(I+1) then exit;\nResult:=True;\nend;\n\nprocedure ReverseGame(Memo: TMemo);\n{Play the reverse game on specified memo}\nvar C: char;\nvar Numbers: TNumbers;\nvar S: string;\nvar R: integer;\nbegin\nRandomize;\nScrambleNumbers(Numbers);\nwhile true do\n\tbegin\n\tS:=GetNumbersStr(Numbers);\n\tC:=WaitForKey(Memo,S+' Number To Reverse: ');\n\tif Application.Terminated then exit;\n\tif C in ['x','X'] then break;\n\tR:=byte(C) - $30;\n\tReverseNumbers(Numbers,R);\n\tif IsWinner(Numbers) then\n\t\tbegin\n\t\tS:=GetNumbersStr(Numbers);\n\t\tMemo.Lines.Add(S+' - WINNER!!');\n\t\tbreak;\n\t\tend;\n\tend;\nend;\n","language":"Delphi"},{"code":"import \"prelude.eg\"\nimport \"io.ego\"\nimport \"random.ego\"\n\nusing System\nusing IO\nusing List\nusing Math\n\ndef swap =\n [ (I J) XX -> insert I (nth J XX) (insert J (nth I XX) XX) ]\n\ndef shuffle =\n [ XX ->\n let INDICES = reverse (fromto 0 ((length XX) - 1)) in\n let SWAPS = map [ I -> I (between 0 I) ] INDICES in\n foldr [I J -> swap I J] XX SWAPS ]\n\ndef prompt =\n [ XX TURN ->\n let _ = print TURN \". \" in\n let _ = map [ X -> print X \" \" ] XX in\n let _ = print \" : \" in\n toint getline ]\n\ndef game =\n [ GOAL SHUFFLE TURN ->\n if SHUFFLE == GOAL then\n let _ = print \"the goal was \" in\n let _ = map [ X -> print X \" \" ] GOAL in\n print \"\\nit took you \" TURN \" turns\\n\"\n else\n let N = prompt SHUFFLE TURN in\n let YY = (reverse (take N SHUFFLE)) ++ (drop N SHUFFLE) in\n game GOAL YY (TURN + 1) ]\n\ndef main =\n let XX = fromto 1 9 in game XX (shuffle XX) 0\n","language":"Egel"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature {NONE}\n\n\tmake\n\t\t\t-- Plays Number Reversal Game.\n\t\tlocal\n\t\t\tcount: INTEGER\n\t\tdo\n\t\t\tinitialize_game\n\t\t\tio.put_string (\"Let's play the number reversal game.%N\")\n\t\t\tacross\n\t\t\t\tnumbers as ar\n\t\t\tloop\n\t\t\t\tio.put_string (ar.item.out + \"%T\")\n\t\t\tend\n\t\t\tfrom\n\t\t\tuntil\n\t\t\t\tis_sorted (numbers, 1, numbers.count)\n\t\t\tloop\n\t\t\t\tio.put_string (\"%NHow many numbers should be reversed?%N\")\n\t\t\t\tio.read_integer\n\t\t\t\treverse_array (io.last_integer)\n\t\t\t\tacross\n\t\t\t\t\tnumbers as ar\n\t\t\t\tloop\n\t\t\t\t\tio.put_string (ar.item.out + \"%T\")\n\t\t\t\tend\n\t\t\t\tcount := count + 1\n\t\t\tend\n\t\t\tio.put_string (\"%NYou needed \" + count.out + \" reversals.\")\n\t\tend\n\nfeature {NONE}\n\n\tinitialize_game\n\t\t\t-- Array with numbers from 1 to 9 in a random unsorted order.\n\t\tlocal\n\t\t\trandom: V_RANDOM\n\t\t\titem, i: INTEGER\n\t\tdo\n\t\t\tcreate random\n\t\t\tcreate numbers.make_empty\n\t\t\tfrom\n\t\t\t\ti := 1\n\t\t\tuntil\n\t\t\t\tnumbers.count = 9 and not is_sorted (numbers, 1, numbers.count)\n\t\t\tloop\n\t\t\t\titem := random.bounded_item (1, 9)\n\t\t\t\tif not numbers.has (item) then\n\t\t\t\t\tnumbers.force (item, i)\n\t\t\t\t\ti := i + 1\n\t\t\t\tend\n\t\t\t\trandom.forth\n\t\t\tend\n\t\tend\n\n\tnumbers: ARRAY [INTEGER]\n\n\treverse_array (upper: INTEGER)\n\t\t\t-- Array numbers with first element up to nth element reversed.\n\t\trequire\n\t\t\tupper_positive: upper > 0\n\t\t\tar_not_void: numbers /= Void\n\t\tlocal\n\t\t\ti, j: INTEGER\n\t\t\tnew_array: ARRAY [INTEGER]\n\t\tdo\n\t\t\tcreate new_array.make_empty\n\t\t\tnew_array.deep_copy (numbers)\n\t\t\tfrom\n\t\t\t\ti := 1\n\t\t\t\tj := upper\n\t\t\tuntil\n\t\t\t\ti > j\n\t\t\tloop\n\t\t\t\tnew_array [i] := numbers [j]\n\t\t\t\tnew_array [j] := numbers [i]\n\t\t\t\ti := i + 1\n\t\t\t\tj := j - 1\n\t\t\tend\n\t\t\tnumbers := new_array\n\t\tend\n\n\tis_sorted (ar: ARRAY [INTEGER]; l, r: INTEGER): BOOLEAN\n\t\t\t-- Is Array 'ar' sorted in ascending order?\n\t\trequire\n\t\t\tar_not_empty: not ar.is_empty\n\t\tdo\n\t\t\tResult := True\n\t\t\tacross\n\t\t\t\t1 |..| (r - 1) as c\n\t\t\tloop\n\t\t\t\tif ar [c.item] > ar [c.item + 1] then\n\t\t\t\t\tResult := False\n\t\t\t\tend\n\t\t\tend\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"import system'routines;\nimport extensions;\n\npublic program()\n{\n var sorted := Array.allocate(9).populate::(n => n + 1 );\n var values := sorted.clone().randomize(9);\n\n while (sorted.sequenceEqual(values))\n {\n values := sorted.randomize(9)\n };\n\n var tries := new Integer();\n until (sorted.sequenceEqual(values))\n {\n tries.append(1);\n\n console.print(\"# \",tries,\" : LIST : \",values,\" - Flip how many?\");\n\n values.sequenceReverse(0, console.readLine().toInt())\n };\n\n console.printLine(\"You took \",tries,\" attempts to put the digits in order!\").readChar()\n}\n","language":"Elena"},{"code":"defmodule Number_reversal_game do\n def start( n ) when n > 1 do\n IO.puts \"Usage: #{usage(n)}\"\n targets = Enum.to_list( 1..n )\n jumbleds = Enum.shuffle(targets)\n attempt = loop( targets, jumbleds, 0 )\n IO.puts \"Numbers sorted in #{attempt} atttempts\"\n end\n\n defp loop( targets, targets, attempt ), do: attempt\n defp loop( targets, jumbleds, attempt ) do\n IO.inspect jumbleds\n {n,_} = IO.gets(\"How many digits from the left to reverse? \") |> Integer.parse\n loop( targets, Enum.reverse_slice(jumbleds, 0, n), attempt+1 )\n end\n\n defp usage(n), do: \"Given a jumbled list of the numbers 1 to #{n} that are definitely not in ascending order, show the list then ask the player how many digits from the left to reverse. Reverse those digits, then ask again, until all the digits end up in ascending order.\"\nend\n\nNumber_reversal_game.start( 9 )\n","language":"Elixir"},{"code":"-module( number_reversal_game ).\n\n-export( [task/0, start/1] ).\n\nstart( N ) when N > 1 ->\n\tio:fwrite( \"Usage: ~s~n\", [usage(N)] ),\n\tTargets = lists:seq( 1, N ),\n\tJumbleds = [X||{_,X} <- lists:sort([ {random:uniform(), Y} || Y <- Targets])],\n\tAttempt = loop( Targets, Jumbleds, 0 ),\n\tio:fwrite( \"Numbers sorted in ~p atttempts~n\", [Attempt] ).\n\ntask() -> start( 9 ).\n\n\n\nloop( Targets, Targets, Attempt ) -> Attempt;\nloop( Targets, Jumbleds, Attempt ) ->\n\tio:fwrite( \"~p~n\", [Jumbleds] ),\n\t{ok,[N]} = io:fread( \"How many digits from the left to reverse? \", \"~d\" ),\n\t{Lefts, Rights} = lists:split( N, Jumbleds ),\n\tloop( Targets, lists:reverse(Lefts) ++ Rights, Attempt + 1 ).\n\nusage(N) -> io_lib:format( \"Given a jumbled list of the numbers 1 to ~p that are definitely not in ascending order, show the list then ask the player how many digits from the left to reverse. Reverse those digits, then ask again, until all the digits end up in ascending order.\", [N] ).\n","language":"Erlang"},{"code":"include get.e\n\nfunction accending(sequence s)\n for i = 1 to length(s)-1 do\n if s[i]>s[i+1] then\n return 0\n end if\n end for\n return 1\nend function\n\nputs(1,\"Given a jumbled list of the numbers 1 to 9,\\n\")\nputs(1,\"you must select how many digits from the left to reverse.\\n\")\nputs(1,\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\n\")\n\nsequence nums\nnums = repeat(0,9)\ninteger n,flp,tries,temp\n\n-- initial values\nfor i = 1 to 9 do\n nums[i] = i\nend for\n\nwhile accending(nums) do -- shuffle\n for i = 1 to 9 do\n n = rand(9)\n temp = nums[n]\n nums[n] = nums[i]\n nums[i] = temp\n end for\nend while\n\ntries = 0\nwhile 1 do\n printf(1,\"%2d : \",tries)\n for i = 1 to 9 do\n printf(1,\"%d \",nums[i])\n end for\n\n if accending(nums) then\n exit\n end if\n\n flp = prompt_number(\" -- How many numbers should be flipped? \",{1,9})\n for i = 1 to flp/2 do\n temp = nums[i]\n nums[i] = nums[flp-i+1]\n nums[flp-i+1] = temp\n end for\n\n tries += 1\nend while\n\nprintf(1,\"\\nYou took %d tries to put the digits in order.\", tries)\n","language":"Euphoria"},{"code":"let rand = System.Random()\n\nwhile true do\n let rec randomNums() =\n let xs = [|for i in 1..9 -> rand.Next(), i|] |> Array.sort |> Array.map snd\n if xs = Array.sort xs then randomNums() else xs\n\n let xs = randomNums()\n\n let suffix = function | 1 -> \"st\" | 2 -> \"nd\" | 3 -> \"rd\" | _ -> \"th\"\n\n let rec move i =\n printf \"\\n%A\\n\\nReverse how many digits from the left in your %i%s move? : \" xs i (suffix i)\n let n = stdin.ReadLine() |> int\n Array.blit (Array.rev xs.[0..n-1]) 0 xs 0 n\n if xs <> Array.sort xs then\n move (i+1)\n else\n printfn \"\\nYou took %i moves to put the digits in order!\\n\" i\n\n move 1\n","language":"F-Sharp"},{"code":"USING: formatting io kernel math math.parser math.ranges\nnamespaces random sequences strings ;\nIN: rosetta.number-reversal\n\n: make-jumbled-array ( -- sorted jumbled )\n CHAR: 1 CHAR: 9 [a,b] [ 1string ] map dup clone randomize\n [ 2dup = ] [ randomize ] while ;\n\nSYMBOL: trials\n\n: prompt ( jumbled -- n )\n trials get \"#%2d: \" printf\n \", \" join write\n \" Flip how many? \" write flush\n readln string>number ;\n\n: game-loop ( sorted jumbled -- )\n 2dup = [\n 2drop trials get\n \"\\nYou took %d attempts to put the digits in order!\\n\" printf\n flush\n ] [\n trials [ 1 + ] change\n dup dup prompt head-slice reverse! drop\n game-loop\n ] if ;\n\n: play ( -- )\n 0 trials set\n make-jumbled-array game-loop ;\n","language":"Factor"},{"code":"01.10 D 3;S T=0\n01.20 F X=1,9;T %1,D(X)\n01.30 T !;A \"HOW MANY\",R\n01.40 I (R-1)1.3;I (9-R)1.3\n01.50 D 5;S T=T+1\n01.60 D 4;I (A-9)1.2\n01.70 D 1.2;T !\"CORRECT! ATTEMPTS\",%4,T,!\n01.80 Q\n\n02.10 S A=10*FRAN();S A=A-FITR(A)\n\n03.10 F X=1,9;S D(X)=X\n03.20 F X=1,8;D 2;S Y=X+FITR((10-X)*A);S A=D(X);S D(X)=D(Y);S D(Y)=A\n03.30 D 4\n03.40 I (8-A)3.1\n\n04.10 S A=0\n04.20 F X=1,9;D 4.4\n04.30 R\n04.40 I (D(X)-X)4.3,4.5,4.3\n04.50 S A=A+1\n\n05.10 F X=1,R/2;S A=D(X);S D(X)=D(R-X+1);S D(R-X+1)=A\n","language":"FOCAL"},{"code":"include random.fs\n\nvariable flips\ncreate nums 9 cells allot\n\n: .array ( addr len -- ) 0 ?do dup @ . cell+ loop drop ;\n\n: shuffle ( addr len -- )\n 2 swap do\n dup i random cells +\n over @ over @ swap\n rot ! over !\n cell+\n -1 +loop drop ;\n\n: sorted? ( addr len -- )\n 1- cells bounds ?do\n i 2@ < if unloop false exit then\n cell +loop true ;\n\n: init\n 0 flips !\n nums 10 1 do\n i over ! cell+\n loop drop\n begin nums 9 shuffle nums 9 sorted? 0= until\n cr nums 9 .array ;\n\n: reverse ( addr len -- )\n 1- cells bounds\n begin 2dup >\n while over @ over @ >r over ! over r> swap !\n cell+ swap 1 cells - swap\n repeat 2drop ;\n\n: flip ( n -- )\n dup 2 10 within 0= if . .\" must be within 2 to 9\" exit then\n nums swap reverse\n 1 flips +!\n nums 9 sorted? if\n cr .\" Got it in \" flips @ . .\" tries!\"\n else\n cr nums 9 .array\n then ;\n\ninit\n1 2 8 5 7 6 9 4 3 ok\n7 flip\n9 6 7 5 8 2 1 4 3 ok\n","language":"Forth"},{"code":"program Reversal_game\n implicit none\n\n integer :: list(9) = (/ 1, 2, 3, 4, 5, 6, 7, 8, 9 /)\n integer :: pos, attempts = 0\n\n call random_seed\n do while (sorted(list))\n call Shuffle(list)\n end do\n write(*, \"(9i5)\") list\n write(*,*)\n do while (.not. Sorted(list))\n write(*, \"(a)\", advance=\"no\") \"How many numbers from the left do you want to reverse? : \"\n read*, pos\n attempts = attempts + 1\n list(1:pos) = list(pos:1:-1)\n write(*, \"(9i5)\") list\n write(*,*)\n end do\n write(*,*)\n write(*, \"(a,i0,a)\") \"Congratulations! Solved in \", attempts, \" attempts\"\n\ncontains\n\nsubroutine Shuffle(a)\n integer, intent(inout) :: a(:)\n integer :: i, randpos, temp\n real :: r\n\n do i = size(a), 2, -1\n call random_number(r)\n randpos = int(r * i) + 1\n temp = a(randpos)\n a(randpos) = a(i)\n a(i) = temp\n end do\nend subroutine\n\nfunction Sorted(a)\n logical :: Sorted\n integer, intent(in) :: a(:)\n integer :: i\n\n do i = 1, size(a)-1\n if(list(i+1) /= list(i)+1) then\n Sorted = .false.\n return\n end if\n end do\n Sorted = .true.\nend function\n\nend program\n","language":"Fortran"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"sort\"\n \"time\"\n)\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n var k []int\n for {\n k = rand.Perm(9)\n for i, r := range k {\n if r == 0 {\n k[i] = 9\n }\n }\n if !sort.IntsAreSorted(k) {\n break\n }\n }\n fmt.Println(\"Sort digits by reversing a number of digits on the left.\")\n var n, score int\n for {\n fmt.Print(\"Digits: \", k, \". How many to reverse? \")\n i, _ := fmt.Scanln(&n)\n score++\n if i == 0 || n < 2 || n > 9 {\n fmt.Println(\"\\n(Enter a number from 2 to 9)\")\n continue\n }\n for l, r := 0, n-1; l < r; l, r = l+1, r-1 {\n k[l], k[r] = k[r], k[l]\n }\n if sort.IntsAreSorted(k) {\n fmt.Print(\"Digits: \", k, \".\\n\")\n fmt.Print(\"Your score: \", score, \". Good job.\\n\")\n return\n }\n }\n}\n","language":"Go"},{"code":"sorted = [*(1..9)]\narr = sorted.clone()\n\nvoid flipstart(n) { arr[0..<n] = arr[0..<n].reverse() }\n\nint steps = 0\nwhile (arr==sorted) Collections.shuffle(arr)\nwhile (arr!=sorted) {\n println arr.join(' ')\n print 'Reverse how many? '\n def flipcount = System.in.readLine()\n flipstart( flipcount.toInteger() )\n steps += 1\n}\nprintln \"Done! That took you ${steps} steps\"\n","language":"Groovy"},{"code":"import Data.List\nimport Control.Arrow\nimport Rosetta.Knuthshuffle\n\nnumberRevGame = do\n let goal = [1..9]\n\n shuffle xs =\n\tif xs /= goal then return xs\n\t\t else shuffle =<< knuthShuffle xs\n\n prefixFlipAt k = uncurry (++). first reverse. splitAt k\n\n prompt r ry = do\n\t putStr $ show r ++ \". \" ++ concatMap (flip (++) \" \". show) ry\n\t\t ++ \" How many to flip? \"\n\t answ <- getLine\n\t let n = read answ\n\t if n<10 && 0<n then return n\n\t else do\n\t putStrLn \"Error. The number should be between 0 and 10. Try again\"\n\t prompt r ry\n\n playNRG r nrs =\n\tif nrs == goal then do\n\t putStrLn $ \"The answer is: \" ++ concatMap (flip (++) \" \". show) nrs\n\t putStrLn $ \"It took you \" ++ show r ++ \" attempts to sort the numbers.\"\n\t putStrLn \"\"\n\t\telse do\n\t\t answ <- prompt r nrs\n\t\t playNRG (succ r) (prefixFlipAt answ nrs)\n\t\n start <- shuffle goal\n\n playNRG 1 start\n","language":"Haskell"},{"code":" WRITE(Messagebox) \"You took \", Reversals(), \" attempts\"\n\nFUNCTION Reversals()\n DIMENSION digits(9), temp(9)\n\n digits = 0\n DO i = 1, 9 ! create the shuffled digits\n 1 x = CEILING( RAN(9) )\n IF( INDEX(digits, x) ) GOTO 1 ! HicEst has no WHILE\n digits(i) = x\n ENDDO\n\n DO Reversals = 1, 1E6 ! HicEst needs an upper bound\n DLG(NameEdit=Flips, DNum, MIn=0, MAx=9, Text=digits)\n DO j = 1, Flips/2\n swap = digits(j)\n digits(j) = digits(Flips+1-j)\n digits(Flips+1-j) = swap\n ENDDO\n temp = digits($+1) > digits($) ! $ = left side index\n IF( SUM(temp) == 8 ) RETURN\n ENDDO\nEND\n","language":"HicEst"},{"code":"procedure main(cq) # Number Reversal Game\nlocal x,nums,R,flips\n\n$define PROTECT [\"WIN\",\"ASK\"]\n$define MAGIC [\"xyzzy\",\"abracadabra\",\"hocus\",\"pocus\",\"presto\",\"changeo\",\"open\",\"sesame\",\"irs\"]\n\nput(cq,\"game\") # start command queue - use command line\nrule := string(&digits--'0') # ruler and move commands\nevery put(protected := [], map(!PROTECT)) # protected commands\nevery put(magic := [], !MAGIC)\n\nwhile x := get(cq) | \"MOVE\" do { # command from queue or ask for move\n case x of {\n \"help\" | \"h\" | \"?\" : # --- start of user facing commands ---\n write(\"Input a position. The list will be flipped left to right at that point.\\n\",\n\t \"You win when the list is sorted.\\n\",\n\t \"Commands:\\n\",\n \" help, h, ? - shows this\\n\",\n \" new, g - new game\\n\",\t\t\t\n \" ruler, r - shows a ruler\\n\",\n \" show, s - shows the list\\n\",\n \" <n> - flips the list at ruler position n\\n\",\n \" quit, q - quit\\n\",\n \"and various magic words.\\n\"\n ) & put(cq,\"rule\")\n \"game\" | \"g\" | \"new\" : {\n put(cq,\"help\")\n flips := 0\n nums := rule\n until nums ~== rule do\n every !nums :=: ?nums # shuffle\n }\n \"rule\" | \"ruler\" | \"r\" :\n put(cq,\"show\") & every writes(\" \" || \" \" | !(if /mirror then rule else reverse(rule)) | \"\\n\")\n \"show\" | \"s\" :\n every writes(\" \" || \"=\" | !nums | \" =\\n\")\n !rule : { # 0 - 9 for flipping\n if /mirror then nums[1+:x] := reverse(nums[1+:x])\n else nums[0-:x] := reverse(nums[0-:x]) \t\t\n flips +:= 1\n put(cq,if nums == rule then \"WIN\" else \"show\")\n }\n \"quit\" | \"q\" :\n break write(\"Goodbye.\")\n !magic: # --- start of magic\n write(\"That has no power here. Try again!\")\n \"magic\" | \"mirror\" | \"m\" : {\n mirror := if /mirror then 1 else &null\n write(\"Wait! What is this? The writing has reversed.\")\n }\t\t\n !protected: # --- Start of internal (upper case) and protected commands\n put(cq,?rule) & write(\"Tisk, Tisk, don't try and cheat. Take a random penalty flip!\") \t\t\n \"MOVE\" :\n put(cq,ask(\"Command? : \") ) \t\t\n \"WIN\" :\n put(cq,\"ASK\") & write(\"Congratulations you won in \",flips,\" flips!\")\n \"ASK\" :\n put(cq,case ask(\"Play another game? : \") of { \"y\"|\"yes\" : \"game\"; \"n\"|\"no\" : \"quit\"; default : \"ASK\" } )\n default: # --- say what?\n write(\"Sorry I don't know that command, try help?\")\n }\n }\nend\n\nprocedure ask(s) #: ask for input with prompt s and return the 1st word in lower case\nwrites(\\s)\nmap(trim(read())) ? return tab(upto(' ')|0)\nend\n","language":"Icon"},{"code":"Number Reversal Game is a room.\n\nThe current list is a list of numbers that varies.\n\nWhen play begins:\n\tnow the current list is a shuffled list from 1 to 9;\n\tnow the command prompt is \"Current list: [current list in brace notation].[line break]How many items to flip? \".\n\nDefinition: a list of numbers (called L) is sorted:\n\trepeat with N running from 1 to the number of entries in L:\n\t\tif entry N in L is not N, no;\n\tyes.\n\nTo decide which list of numbers is a shuffled list from (min - number) to (max - number):\n\tlet result be a list of numbers;\n\trepeat with N running from min to max:\n\t\tadd N to result;\n\twhile true is true:\n\t\tsort result in random order;\n\t\tif result is not sorted, decide on result.\n\nFlipping is an action applying to one number. Understand \"[number]\" as flipping.\n\nCarry out flipping:\n\tlet N be the number understood;\n\tlet L be the current list;\n\ttruncate the current list to the first N entries;\n\treverse the current list;\n\ttruncate L to the last (number of entries in L minus N) entries;\n\tadd L to the current list.\n\nReport flipping: say \"\".\n\nEvery turn:\n\tif the current list is sorted, end the story saying \"You have won\".\n\nThis is the new print final score rule:\n\tsay \"It took you [turn count] flip[s] to sort the list.\"\n\nThe new print final score rule is listed instead of the print final score rule in the for printing the player's obituary rules.\n","language":"Inform-7"},{"code":"withRange := method( a, z,\n Range clone setRange(a,z)\n)\nsorted := withRange(1,9) asList\nnumbers := sorted clone shuffle\nwhile( numbers==sorted, numbers = numbers shuffle)\n\nsteps :=0\nstdin := File standardInput\nwhile( numbers != sorted,\n writeln(numbers join(\" \"))\n write(\"Reverse how many? \")\n flipcount := stdin readLine asNumber\n withRange(0, ((flipcount-1)/2) floor) foreach( i,\n numbers swapIndices(i,flipcount-1-i)\n )\n steps = steps+1\n)\nwriteln(\"Done! That took you \", steps, \" steps\")\n","language":"Io"},{"code":"100 PROGRAM \"Reversal.bas\"\n110 RANDOMIZE\n120 NUMERIC NR(1 TO 9)\n130 LET TRIES=0\n140 TEXT :PRINT \"Given a jumbled list of the numbers 1 to 9, you must select how many digits from the left to reverse.\":PRINT \"Your goal is to get the digits in order with 1 on the left and 9 on the right.\":PRINT\n150 FOR I=1 TO 9\n160 LET NR(I)=I\n170 NEXT\n180 DO\n190 FOR I=2 TO 9\n200 LET N=RND(I)+1\n210 IF N<>I THEN CALL SWAP(N,I)\n220 NEXT\n230 LOOP WHILE ORDERED\n240 DO\n250 PRINT USING \"##: \":TRIES;\n260 FOR I=1 TO 9\n270 PRINT NR(I);\n280 NEXT\n290 PRINT\n300 IF ORDERED THEN EXIT DO\n310 DO\n320 INPUT PROMPT \"How many numbers should be flipped? \":FLIP\n330 LOOP WHILE FLIP<2 OR FLIP>9\n340 FOR I=1 TO FLIP/2\n350 CALL SWAP(I,FLIP-I+1)\n360 NEXT\n370 LET TRIES=TRIES+1\n380 LOOP\n390 PRINT :PRINT \"You took\";TRIES;\"tries to put the digits in order.\"\n400 DEF SWAP(A,B)\n410 LET T=NR(A):LET NR(A)=NR(B):LET NR(B)=T\n420 END DEF\n430 DEF ORDERED\n440 LET ORDERED=-1\n450 FOR J=1 TO 8\n460 IF NR(J)>NR(J+1) THEN LET ORDERED=0:EXIT FOR\n470 NEXT\n480 END DEF\n","language":"IS-BASIC"},{"code":"require 'misc' NB. for the verb prompt\n\nINTRO=: noun define\nNumber Reversal Game\nFlip groups of numbers from the left of the list until\nthe numbers are sorted in ascending order.\n)\n\nreversegame=: verb define\n whilst. (-: /:~)nums do.\n nums=. 1+9?9 NB. 1-9 in random order\n end.\n score=. 0\n smoutput INTRO NB. Display instructions\n while. -.(-: /:~)nums do.\n score=. 1+ score NB. increment score\n nnum=. 0\".prompt (\":score),': ',(\":nums),' How many numbers to flip?: '\n if. 0 = #nnum do. return. end. NB. exit on ENTER without number\n nums=. (C.i.-nnum) C. nums NB. reverse first nnum numbers\n end.\n 'You took ',(\": score), ' attempts to put the numbers in order.'\n)\n","language":"J"},{"code":" reversegame''\nNumber Reversal Game\nSort the numbers in ascending order by repeatedly\nflipping sets of numbers from the left.\n\n1: 4 7 5 6 9 1 2 8 3 How many numbers to flip?: 5\n2: 9 6 5 7 4 1 2 8 3 How many numbers to flip?: 9\n3: 3 8 2 1 4 7 5 6 9 How many numbers to flip?: 2\n4: 8 3 2 1 4 7 5 6 9 How many numbers to flip?: 8\n5: 6 5 7 4 1 2 3 8 9 How many numbers to flip?: 3\n6: 7 5 6 4 1 2 3 8 9 How many numbers to flip?: 7\n7: 3 2 1 4 6 5 7 8 9 How many numbers to flip?: 5\n8: 6 4 1 2 3 5 7 8 9 How many numbers to flip?: 6\n9: 5 3 2 1 4 6 7 8 9 How many numbers to flip?: 5\n10: 4 1 2 3 5 6 7 8 9 How many numbers to flip?: 4\n11: 3 2 1 4 5 6 7 8 9 How many numbers to flip?: 3\nYou took 11 attempts to put the numbers in order.\n","language":"J"},{"code":"import java.util.List;\nimport java.util.ArrayList;\nimport java.util.Scanner;\nimport java.util.Collections;\n\n\npublic class ReversalGame {\n private List<Integer> gameList;\n\n public ReversalGame() {\n initialize();\n }\n\n public void play() throws Exception {\n int i = 0;\n int moveCount = 0;\n Scanner scanner = new Scanner(System.in);\n while (true) {\n System.out.println(gameList);\n System.out.println(\"Please enter a index to reverse from 2 to 9. Enter 99 to quit\");\n i = scanner.nextInt();\n if (i == 99) {\n break;\n }\n if (i < 2 || i > 9) {\n System.out.println(\"Invalid input\");\n } else {\n moveCount++;\n reverse(i);\n if (isSorted()) {\n System.out.println(\"Congratulations you solved this in \" + moveCount + \" moves!\");\n break;\n }\n }\n\n }\n scanner.close();\n }\n\n private void reverse(int position) {\n Collections.reverse(gameList.subList(0, position));\n }\n\n private boolean isSorted() {\n for (int i=0; i < gameList.size() - 1; ++i) {\n if (gameList.get(i).compareTo(gameList.get(i + 1)) > 0) {\n return false;\n }\n }\n return true;\n }\n\n private void initialize() {\n this.gameList = new ArrayList<Integer>(9);\n for (int i=1; i < 10; ++i) {\n gameList.add(i);\n }\n while (isSorted()) {\n Collections.shuffle(gameList);\n }\n }\n\n\n public static void main(String[] args) {\n try {\n ReversalGame game = new ReversalGame();\n game.play();\n } catch (Exception e) {\n System.out.println(e.getMessage());\n e.printStackTrace();\n }\n }\n}\n","language":"Java"},{"code":"<html>\n<head>\n <title>Number Reversal Game</title>\n</head>\n\n<body>\n<div id=\"start\"></div>\n<div id=\"progress\"></div>\n<div id=\"score\"></div>\n<script type=\"text/javascript\">\n","language":"JavaScript"},{"code":"function endGame(progress) {\n var scoreId = progress.scoreId,\n result = 'You took ' + progress.count + ' attempts to put the digits in order!';\n if (progress.abort === true) {\n result = 'Game aborted.';\n }\n document.getElementById(scoreId).innerHTML = result;\n}\n\nfunction reverseFirstN(arr, n) {\n var reversed = arr.slice(0, n).reverse();\n return reversed.concat(arr.slice(n));\n}\n\nfunction isSorted(arr) {\n return arr.slice(0).sort().toString() === arr.toString();\n}\n\nfunction gameLoop(progress) {\n if (isSorted(progress.arr)) {\n endGame(progress);\n } else {\n var n = parseInt(window.prompt('How many elements to reverse?', ''), 10);\n if (isNaN(n)) {\n progress.abort = true;\n } else {\n progress.arr = reverseFirstN(progress.arr, n);\n progress.innerHTML += '<p>' + progress.arr + '</p>';\n progress.count += 1;\n }\n if (progress.abort !== true) {\n // allow window to repaint before next guess\n setTimeout(function () {\n gameLoop(progress);\n }, 1);\n }\n }\n}\n\nfunction knuth_shuffle(a) {\n var n = a.length,\n r,\n temp;\n while (n > 1) {\n r = Math.floor(n * Math.random());\n n -= 1;\n temp = a[n];\n a[n] = a[r];\n a[r] = temp;\n }\n return a;\n}\n\nfunction playGame(startId, progressId, scoreId) {\n var progress = document.getElementById(progressId);\n progress.arr = knuth_shuffle([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n document.getElementById(startId).innerHTML = '<p>' + progress.arr.toString() + '</p>';\n\n progress.count = 0;\n progress.scoreId = scoreId;\n\n // allow window to repaint before prompting for a guess\n setTimeout(function () {\n gameLoop(progress);\n }, 1);\n}\n\nplayGame('start', 'progress', 'score');\n","language":"JavaScript"},{"code":"</script>\n</body>\n</html>\n","language":"JavaScript"},{"code":"# Input: the initial array\ndef play:\n def sorted: . == sort;\n\n def reverse(n): (.[0:n] | reverse) + .[n:];\n\n def prompt: \"List: \\(.list)\\nEnter a pivot number: \";\n\n def report: \"Great! Your score is \\(.score)\";\n\n {list: ., score: 0}\n | (if .list | sorted then \"List was sorted to begin with.\"\n else\n prompt,\n ( label $done\n | foreach inputs as $n (.;\n .list |= reverse($n) | .score +=1;\n if .list | sorted then report, break $done else prompt end ))\n end);\n","language":"Jq"},{"code":"[1,2,3,9,8,7,6,5,4] | play\n","language":"Jq"},{"code":"# v0.6\n\nfunction numrevgame()\n l = collect(1:9)\n while issorted(l) shuffle!(l) end\n score = 0\n println(\"# Number reversal game\")\n while !issorted(l)\n print(\"$l\\nInsert the index up to which to revert: \")\n n = parse(Int, readline())\n reverse!(l, 1, n)\n score += 1\n end\n println(\"$l... You won!\\nScore: $score\")\n return score\nend\n\nnumrevgame()\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun isAscending(a: IntArray): Boolean {\n for (i in 0..8) if (a[i] != i + 1) return false\n return true\n}\n\nfun main(args: Array<String>) {\n val r = java.util.Random()\n var count = 0\n val numbers = IntArray(9)\n numbers[0] = 2 + r.nextInt(8) // this will ensure list isn't ascending\n for (i in 1..8) {\n var rn: Int\n do {\n rn = 1 + r.nextInt(9)\n } while (rn in numbers)\n numbers[i] = rn\n }\n println(\"Here's your first list : ${numbers.joinToString()}\")\n while (true) {\n var rev: Int\n do {\n print(\"How many numbers from the left are to be reversed : \")\n rev = readLine()!!.toInt()\n } while (rev !in 2..9)\n count++\n var i = 0\n var j = rev - 1\n while (i < j) {\n val temp = numbers[i]\n numbers[i++] = numbers[j]\n numbers[j--] = temp\n }\n if (isAscending(numbers)) {\n println(\"Here's your final list : ${numbers.joinToString()}\")\n break\n }\n println(\"Here's your list now : ${numbers.joinToString()}\")\n }\n println(\"So you've completed the game with a score of $count\")\n}\n","language":"Kotlin"},{"code":"-- Initialisation\nmath.randomseed(os.time())\nnumList = {values = {}}\n\n-- Check whether list contains n\nfunction numList:contains (n)\n for k, v in pairs(self.values) do\n if v == n then return true end\n end\n return false\nend\n\n-- Check whether list is in order\nfunction numList:inOrder ()\n for k, v in pairs(self.values) do\n if k ~=v then return false end\n end\n return true\nend\n\n-- Create necessarily out-of-order list\nfunction numList:build ()\n local newNum\n repeat\n for i = 1, 9 do\n repeat\n newNum = math.random(1, 9)\n until not numList:contains(newNum)\n table.insert(self.values, newNum)\n end\n until not numList:inOrder()\nend\n\n-- Display list of numbers on one line\nfunction numList:show ()\n for k, v in pairs(self.values) do\n io.write(v .. \" \")\n end\n io.write(\":\\t\")\nend\n\n-- Reverse n values from left\nfunction numList:reverse (n)\n local swapList = {}\n for k, v in pairs(self.values) do\n table.insert(swapList, v)\n end\n for i = 1, n do\n swapList[i] = self.values[n + 1 - i]\n end\n self.values = swapList\nend\n\n-- Main procedure\nlocal score = 0\nprint(\"\\nRosetta Code Number Reversal Game in Lua\")\nprint(\"========================================\\n\")\nnumList:build()\nrepeat\n numList:show()\n numList:reverse(tonumber(io.read()))\n score = score + 1\nuntil numList:inOrder()\nnumList:show()\nprint(\"\\n\\nW00t! You scored:\", score)\n","language":"Lua"},{"code":"Module Number_Reversal_Game {\n PRINT \"Given a jumbled list of the numbers 1 to 9,\"\n PRINT \"you must select how many digits from the left to reverse.\"\n PRINT \"Your goal is to get the digits in order with 1 on the left and 9 on the right.\"\n \\\\ work on a new stack - old stack parked, and attached at the exit of this block\n Stack New {\n Data 1,2,3,4,5,6,7,8,9\n \\\\ Create jumbled list\n For i=1 to 30: Reverse(Random(2,9)):Next i\n Tries=0\n fin=false\n Repeat {\n \\\\ Show Stack\n Stack\n Try ok {\n INPUT \" -- How many numbers should be flipped:\", flp%\n }\n if not Ok then print: Restart\n if flp%<2 or flp%>9 then Restart\n Reverse(flp%)\n Tries++\n CheckStack(&fin)\n } until Fin\n \\\\ show stack again\n Stack\n PRINT \"You took \"; tries; \" tries to put the digits in order.\"\n }\n Sub Reverse(n)\n Shift 1, -n ' shift one item nth times in reverse\n End Sub\n Sub CheckStack(&ok)\n ok=true\n if stack.size<2 then exit sub\n Local i\n For i=2 to stack.size {\n ok=stackitem(i)-stackitem(i-1)=1\n if ok else exit\n }\n End Sub\n}\nNumber_Reversal_Game\n","language":"M2000-Interpreter"},{"code":"Module[{array = Range@9, score = 0},\n While[array == Range@9, array = RandomSample@Range@9];\n While[array != Range@9,\n Print@array; (array[[;; #]] = Reverse@array[[;; #]]) &@\n Input[\"How many digits would you like to reverse?\"]; score++];\n Print@array; Print[\"Your score:\", score]]\n","language":"Mathematica"},{"code":"function NumberReversalGame\n list = randperm(9);\n while issorted(list)\n list = randperm(9);\n end\n fprintf('Given a list of numbers, try to put them into ascending order\\n')\n fprintf('by sequentially reversing everything left of a point you choose\\n')\n fprintf('in the array. Try to do it in as few reversals as possible.\\n')\n fprintf('No input will quit the game.\\n')\n fprintf('Position Num:%s\\n', sprintf(' %d', 1:length(list)))\n fprintf('Current List:%s', sprintf(' %d', list))\n pivot = 1;\n nTries = 0;\n while ~isempty(pivot) && ~issorted(list)\n pivot = input(' Enter position of reversal limit: ');\n if pivot\n list(1:pivot) = list(pivot:-1:1);\n fprintf('Current List:%s', sprintf(' %d', list))\n nTries = nTries+1;\n end\n end\n if issorted(list)\n fprintf('\\nCongratulations! You win! Only %d reversals.\\n', nTries)\n else\n fprintf('\\nPlay again soon!\\n')\n end\nend\n","language":"MATLAB"},{"code":"import random, rdstdin, strutils, algorithm\nrandomize()\n\nproc isSorted[T](s: openarray[T]): bool =\n var last = low(T)\n for c in s:\n if c < last:\n return false\n last = c\n return true\n\nproc toString[T](s: openarray[T]): string =\n result = \"\"\n for i, x in s:\n if i > 0:\n result.add \" \"\n result.add($x)\n\necho \"\"\"number reversal game\n Given a jumbled list of the numbers 1 to 9\n Show the list.\n Ask the player how many digits from the left to reverse.\n Reverse those digits then ask again.\n until all the digits end up in ascending order.\"\"\"\n\nvar data = @[1,2,3,4,5,6,7,8,9]\nvar trials = 0\nwhile isSorted data:\n shuffle data\nwhile not isSorted data:\n inc trials\n var flip = parseInt readLineFromStdin(\n \"#\" & $trials & \": List: '\" & toString(data) & \"' Flip how many?: \")\n reverse(data, 0, flip - 1)\n\necho \"You took \", trials, \" attempts to put the digits in order!\"\n","language":"Nim"},{"code":"let swap ar i j =\n let tmp = ar.(i) in\n ar.(i) <- ar.(j);\n ar.(j) <- tmp\n\nlet shuffle ar =\n for i = pred(Array.length ar) downto 1 do\n let j = Random.int (i + 1) in\n swap ar i j\n done\n\nlet reversal ar n =\n for i = 0 to pred(n/2) do\n let j = (pred n) - i in\n swap ar i j\n done\n\nlet sorted ar =\n try\n let prev = ref ar.(0) in\n for i = 1 to pred(Array.length ar) do\n if ar.(i) < !prev then raise Exit;\n prev := ar.(i)\n done;\n (true)\n with Exit ->\n (false)\n\nlet () =\n print_endline \"\\\n Number Reversal Game\n Sort the numbers in ascending order by repeatedly\n flipping sets of numbers from the left.\";\n Random.self_init();\n let nums = Array.init 9 (fun i -> succ i) in\n while sorted nums do shuffle nums done;\n let n = ref 1 in\n while not(sorted nums) do\n Printf.printf \"#%2d: \" !n;\n Array.iter (Printf.printf \" %d\") nums;\n print_newline();\n let r = read_int() in\n reversal nums r;\n incr n;\n done;\n print_endline \"Congratulations!\";\n Printf.printf \"You took %d attempts to put the digits in order.\\n\" !n;\n;;\n","language":"OCaml"},{"code":"let revert li n =\n let rec aux acc i = function\n | [] -> acc\n | xs when i <= 0 -> acc @ xs\n | x::xs -> aux (x::acc) (pred i) xs\n in\n aux [] n li\n\nlet take li n =\n let rec aux acc i = function\n | x::xs when i = n -> (x, List.rev_append acc xs)\n | x::xs -> aux (x::acc) (succ i) xs\n | _ -> invalid_arg \"take\"\n in\n aux [] 0 li\n\nlet shuffle li =\n let rec aux acc len = function\n | [] -> acc\n | li ->\n let x, xs = take li (Random.int len) in\n aux (x::acc) (pred len) xs\n in\n aux [] (List.length li) li\n\nlet rec sorted = function\n | [] -> (true)\n | x::y::_ when x > y -> (false)\n | x::xs -> sorted xs\n\nlet () =\n print_endline \"\\\n Number Reversal Game\n Sort the numbers in ascending order by repeatedly\n flipping sets of numbers from the left.\";\n Random.self_init();\n let li = shuffle [1; 2; 3; 4; 5; 6; 7; 8; 9] in\n let rec loop n li =\n Printf.printf \"#%2d: \" n;\n List.iter (Printf.printf \" %d\") li;\n Printf.printf \" ? %!\";\n let r = read_int() in\n let li = revert li r in\n if not(sorted li)\n then loop (succ n) li\n else Printf.printf \"You took %d attempts to put the digits in order.\\n\" n;\n in\n loop 1 li\n;;\n","language":"OCaml"},{"code":"import: console\n\n: reversalGame\n| l n |\n doWhile: [\t\t\n ListBuffer new ->l\n while(l size 9 <>) [ 9 rand dup l include ifFalse: [ l add ] else: [ drop ] ]\n l sort l ==\n ]\n\n 0 while(l sort l <>) [\n System.Out \"List is \" << l << \" ==> how many digits from left to reverse : \" <-\n System.Console askln asInteger dup ifNull: [ drop continue ] ->n\n 1+ l left(n) reverse l right(l size n -) + ->l\n ]\n \"You won ! Your score is :\" . println ;\n","language":"Oforth"},{"code":"declare\n proc {Main}\n proc {Loop N Xs}\n if {Not {IsSorted Xs}} then\n Num NewXs\n in\n {System.printInfo N#\": \"}\n {System.print Xs}\n {System.printInfo \" -- Reverse how many? \"}\n Num = {String.toInt {ReadLine}}\n NewXs = {Append\n {Reverse {List.take Xs Num}}\n {List.drop Xs Num}}\n {Loop N+1 NewXs}\n else\n {System.showInfo \"You took \"#N#\" tries to put the digits in order.\"}\n end\n end\n fun {EnsureShuffled Xs}\n Ys = {Shuffle Xs}\n in\n if {Not {IsSorted Ys}} then Ys\n else {EnsureShuffled Xs}\n end\n end\n in\n {Loop 0 {EnsureShuffled {List.number 1 9 1}}}\n end\n\n fun {IsSorted Xs}\n {Sort Xs Value.'<'} == Xs\n end\n\n local\n class TextFile from Open.file Open.text end\n StdIn = {New TextFile init(name:stdin)}\n in\n fun {ReadLine}\n {StdIn getS($)}\n end\n end\n\n fun {Shuffle Xs}\n {FoldL Xs\n fun {$ Z _}\n {Pick {Diff Xs Z}}|Z\n end\n nil}\n end\n\n fun {Pick Xs}\n {Nth Xs {OS.rand} mod {Length Xs} + 1}\n end\n\n fun {Diff Xs Ys}\n {FoldL Ys List.subtract Xs}\n end\nin\n {Main}\n","language":"Oz"},{"code":"game()={\n my(v=numtoperm(9,random(9!-1)),score,in,t); \\\\ Create vector with 1..9, excluding the one sorted in ascending order\n while(v!=vecsort(v),\n print(concat(concat([\"\"],v)));\n in=input();\n for(i=0,in\\2-1,\n t=v[9-i];\n\t v[9-i]=v[10-in+i];\n\t v[10-in+i]=t\n );\n score++\n );\n score\n};\n","language":"PARI-GP"},{"code":"program NumberReversalGame;\n\nprocedure PrintList(list: array of integer);\nvar\n i: integer;\nbegin\n for i := low(list) to high(list) do\n begin\n Write(list[i]);\n if i < high(list) then Write(', ');\n end;\n WriteLn;\nend;\n\nprocedure Swap(var list: array of integer; i, j: integer);\nvar\n buf: integer;\nbegin\n buf := list[i];\n list[i] := list[j];\n list[j] := buf;\nend;\n\nprocedure ShuffleList(var list: array of integer);\nvar\n i, j, n: integer;\nbegin\n Randomize;\n\n for n := 0 to 99 do\n begin\n i := Random(high(list)+1);\n j := Random(high(list)+1);\n Swap(list, i, j);\n end;\nend;\n\nprocedure ReverseList(var list: array of integer; j: integer);\nvar\n i: integer;\nbegin\n i := low(list);\n\n while i < j do\n begin\n Swap(list, i, j);\n i += 1;\n j -= 1;\n end;\nend;\n\nfunction IsOrdered(list: array of integer): boolean;\nvar\n i: integer;\nbegin\n IsOrdered := true;\n i:= high(list);\n\n while i > 0 do\n begin\n if list[i] <> (list[i-1] + 1) then\n begin\n IsOrdered:= false;\n break;\n end;\n i -= 1;\n end;\nend;\n\n\nvar\n list: array [0..8] of integer = (1, 2, 3, 4, 5, 6, 7, 8, 9);\n n: integer;\n moves: integer;\nbegin\n\n WriteLn('Number Reversal Game');\n WriteLn;\n WriteLn('Sort the following list in ascending order by reversing the first n digits');\n WriteLn('from the left.');\n WriteLn;\n\n ShuffleList(list);\n PrintList(list);\n\n moves := 0;\n\n while not IsOrdered(list) do\n begin\n WriteLn('How many digits from the left will you reverse?');\n Write('> ');\n Read(n);\n\n ReverseList(list, n-1);\n PrintList(list);\n moves += 1;\n end;\n\n WriteLn;\n WriteLn('Congratulations you made it in just ', moves, ' moves!');\n WriteLn;\nend.\n","language":"Pascal"},{"code":"use List::Util qw(shuffle);\n\nmy $turn = 0;\nmy @jumble = shuffle 1..9;\n\nwhile ( join('', @jumble) eq '123456789' ) {\n @jumble = shuffle 1..9;\n}\n\nuntil ( join('', @jumble) eq '123456789' ) {\n $turn++;\n printf \"%2d: @jumble - Flip how many digits ? \", $turn;\n\n my $d = <>;\n\n @jumble[0..$d-1] = reverse @jumble[0..$d-1];\n}\n\nprint \" @jumble\\n\";\nprint \"You won in $turn turns.\\n\";\n","language":"Perl"},{"code":"puts(1,\"Given a jumbled list of the numbers 1 to 9,\\n\")\nputs(1,\"you must select how many digits from the left to reverse.\\n\")\nputs(1,\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\n\")\n\nconstant inums = tagset(9)\nsequence nums\ninteger turns = 0, flip\n\nwhile 1 do\n nums = shuffle(inums)\n if nums!=inums then exit end if\nend while\n\nwhile 1 do\n printf(1,\"%2d : %d %d %d %d %d %d %d %d %d \",turns&nums)\n if nums=inums then exit end if\n flip = prompt_number(\" -- How many numbers should be flipped? \",{1,9})\n nums[1..flip] = reverse(nums[1..flip])\n turns += 1\nend while\n\nprintf(1,\"\\nYou took %d turns to put the digits in order.\", turns)\n","language":"Phix"},{"code":"class ReversalGame {\n private $numbers;\n\n public function __construct() {\n $this->initialize();\n }\n\n public function play() {\n $i = 0;\n $moveCount = 0;\n while (true) {\n echo json_encode($this->numbers) . \"\\n\";\n echo \"Please enter an index to reverse from 2 to 9. Enter 99 to quit\\n\";\n $i = intval(rtrim(fgets(STDIN), \"\\n\"));\n if ($i == 99) {\n break;\n }\n if ($i < 2 || $i > 9) {\n echo \"Invalid input\\n\";\n } else {\n $moveCount++;\n $this->reverse($i);\n if ($this->isSorted()) {\n echo \"Congratulations you solved this in $moveCount moves!\\n\";\n break;\n }\n }\n\n }\n }\n\n private function reverse($position) {\n array_splice($this->numbers, 0, $position, array_reverse(array_slice($this->numbers, 0, $position)));\n }\n\n private function isSorted() {\n for ($i = 0; $i < count($this->numbers) - 1; ++$i) {\n if ($this->numbers[$i] > $this->numbers[$i + 1]) {\n return false;\n }\n }\n return true;\n }\n\n private function initialize() {\n $this->numbers = range(1, 9);\n while ($this->isSorted()) {\n shuffle($this->numbers);\n }\n }\n\n}\n\n$game = new ReversalGame();\n$game->play();\n","language":"PHP"},{"code":"(load \"@lib/simul.l\")\n\n(de reversalGame ()\n (let (Lst (shuffle (range 1 9)) Cnt 0)\n (while (apply < Lst)\n (setq Lst (shuffle Lst)) )\n (loop\n (printsp Lst)\n (T (apply < Lst) Cnt)\n (NIL (num? (read)))\n (setq Lst (flip Lst @))\n (inc 'Cnt) ) ) )\n","language":"PicoLisp"},{"code":"digits: procedure options (main); /* 23 April 2010 */\n declare s character (9) varying;\n declare i fixed binary;\n declare digit character (1);\n\nrestart:\n put skip list ('In this game, you are given a group of digits.');\n put skip list ('You will specify one of those digits.');\n put skip list ('The computer will then reverse the digits up to the one you nominate.');\n put skip list ('Your task is to repeat this process a number of times until all the digits');\n put skip list ('are in order, left to right, 1 to 9.');\n put skip list ('Here are your digits');\n\nredo:\n s = '';\n do until (length(s) = 9);\n digit = trim ( fixed(trunc (1+random()*9) ) );\n if index(s, digit) = 0 then s = s || digit;\n end;\n if s = '123456789' then go to redo;\n\nloop:\n do forever;\n put skip list (s);\n if s = '123456789' then leave;\n get edit (digit) (a(1));\n i = index(s, digit);\n if i = 0 then do; put skip list ('invalid request'); iterate loop; end;\n s = reverse( substr(s, 1, i) ) || substr(s, i+1, length(s)-i);\n end;\n put skip list ('Congratulations');\n go to restart;\nend digits;\n","language":"PL-I"},{"code":"#adding the below function to the previous users submission to prevent the small\n#chance of getting an array that is in ascending order.\n\n#Full disclosure: I am an infrastructure engineer, not a dev. My code is likely\n#bad.\n\nfunction generateArray{\n $fArray = 1..9 | Get-Random -Count 9\n if (-join $fArray -eq -join @(1..9)){\n generateArray\n }\n return $fArray\n}\n$array = generateArray\n\n#everything below is untouched from original submission\n$nTries = 0\nWhile(-join $Array -ne -join @(1..9)){\n $nTries++\n $nReverse = Read-Host -Prompt \"[$Array] -- How many digits to reverse? \"\n [Array]::Reverse($Array,0,$nReverse)\n}\n\"$Array\"\n\"Your score: $nTries\"\n","language":"PowerShell"},{"code":"play :- random_numbers(L), do_turn(0,L), !.\n\ndo_turn(N, L) :-\n\tprint_list(L),\n\thow_many_to_flip(F),\n\tflip(L,F,[],Lnew),\n\tsucc(N,N1),\n\tsorted(N1,Lnew).\n\nhow_many_to_flip(F) :-\n\tread_line_to_codes(user_input, Line),\n\tnumber_codes(F, Line),\n\tbetween(1,9,F).\n\t\nflip(L,0,C,R) :- append(C,L,R).\nflip([Ln|T],N,C,R) :- dif(N,0), succ(N0,N), flip(T,N0,[Ln|C],R).\n\t\nsorted(N,L) :-\n\tsort(L,L)\n\t-> print_list(L), format('-> ~p~n', N)\n\t; do_turn(N,L).\t\n\nrandom_numbers(L) :- random_permutation([1,2,3,4,5,6,7,8,9],L).\n\nprint_list(L) :-\n\tatomic_list_concat(L, ' ', Lf),\n\tformat('(~w) ',Lf).\n","language":"Prolog"},{"code":"Dim MyList(9)\n\nDeclare is_list_sorted()\n\nIf OpenConsole()\n Define score, indata, i, txt$\n\n For i=1 To 9 ;- Initiate the list\n MyList(i)=i\n Next\n While is_list_sorted()\n For i=1 To 9 ;- Do a Fisher–Yates shuffle\n Swap MyList(i), MyList(Random(i)+1)\n Next\n Wend\n\n ;- Start the Game\n Repeat\n score+1\n txt$=RSet(str(score), 3)+\": \" ;- Show current list\n For i=1 To 9\n txt$+str(MyList(i))+\" \"\n Next\n Repeat ;- Get input & swap\n Print(txt$+\"| How many numbers should be flipped? \"): indata=Val(Input())\n Until indata>=1 And indata<=9 ;- Verify the input\n For i=1 To (indata/2)\n Swap MyList(i),MyList(indata-i+1)\n Next\n Until is_list_sorted()\n\n ;- Present result & wait for users input before closing down\n PrintN(#CRLF$+\"You did it in \"+str(score)+\" moves\")\n Print(\"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n\nProcedure is_list_sorted()\n Protected i\n Shared MyList()\n For i=1 To 9\n If MyList(i)<>i\n ProcedureReturn #False\n EndIf\n Next\n ProcedureReturn #True\nEndProcedure\n","language":"PureBasic"},{"code":"'''\nnumber reversal game\n Given a jumbled list of the numbers 1 to 9\n Show the list.\n Ask the player how many digits from the left to reverse.\n Reverse those digits then ask again.\n until all the digits end up in ascending order.\n\n'''\n\nimport random\n\nprint(__doc__)\ndata, trials = list('123456789'), 0\nwhile data == sorted(data):\n random.shuffle(data)\nwhile data != sorted(data):\n trials += 1\n flip = int(input('#%2i: LIST: %r Flip how many?: ' % (trials, ' '.join(data))))\n data[:flip] = reversed(data[:flip])\n\nprint('\\nYou took %2i attempts to put the digits in order!' % trials)\n","language":"Python"},{"code":" [ 0 temp put\n [] 9 times\n [ i^ 1+ join ]\n dup\n [ shuffle 2dup != until ]\n [ dup echo cr\n 2dup != while\n [ $ \"Reverse how many? \"\n input\n $->n not iff\n drop again ]\n split dip reverse join\n 1 temp tally\n again ]\n drop cr\n say \"That took \"\n temp take echo\n say \" reversals.\" ] is play ( --> )\n","language":"Quackery"},{"code":"reversalGame <- function(){\n cat(\"Welcome to the Number Reversal Game! \\n\")\n cat(\"Sort the numbers into ascending order by repeatedly \\n\",\n \"reversing the first n digits, where you specify n. \\n \\n\", sep=\"\")\n\n # Generate a list that's definitely not in ascending order, per instuctions\n data <- sample(1:9, 9)\n while (all(data == 1:9)){\n cat(\"What were the chances...? \\n\")\n data <- sample(1:9, 9)\n }\n trials <- 0\n\n # Play the game\n while (any(data != 1:9)){\n trials <- trials + 1\n cat(\"Trial\", sprintf(\"%02d\", trials), \" # \", data, \" # \")\n answer <- readline(paste(\"Flip how many? \"))\n data[1:answer] <- data[answer:1]\n }\n\n # Victory!\n cat(\"Well done. You needed\", trials, \"flips. \\n\")\n}\n","language":"R"},{"code":">reversalGame()\nWelcome to the Number Reversal Game!\nSort the numbers into ascending order by repeatedly\nreversing the first n digits, where you specify n.\n\nTrial 01 # 4 3 2 1 7 9 8 5 6 # Flip how many? 7\nTrial 02 # 8 9 7 1 2 3 4 5 6 # Flip how many? 2\nTrial 03 # 9 8 7 1 2 3 4 5 6 # Flip how many? 9\nTrial 04 # 6 5 4 3 2 1 7 8 9 # Flip how many? 6\nWell done. You needed 4 flips.\n","language":"R"},{"code":"#lang racket\n(let loop ([nums (range 1 10)] [n 0])\n (cond [(apply < nums) (if (zero? n)\n (loop (shuffle nums) 0)\n (printf \"Done in ~s steps.\\n\" n))]\n [else (printf \"Step #~s: ~s\\nFlip how many? \" n nums)\n (define-values (l r) (split-at nums (read)))\n (loop (append (reverse l) r) (add1 n))]))\n","language":"Racket"},{"code":"repeat while [<] my @jumbled-list {\n @jumbled-list = (1..9).pick(*)\n}\n\nmy $turn = 0;\nrepeat until [<] @jumbled-list {\n my $d = prompt $turn.=succ.fmt('%2d: ') ~\n @jumbled-list ~\n \" - Flip how many digits? \"\n or exit;\n @jumbled-list[^$d] .= reverse;\n}\n\nsay \" @jumbled-list[]\";\nsay \"You won in $turn turns.\";\n","language":"Raku"},{"code":"import Prelude;\nimport vis::Figure;\nimport vis::Render;\n\npublic void NumberReversalGame(){\n\n\t//generate randomlist\n\tL = [1..9];\n\tscore = 0;\n\trandomlist = [];\n\twhile (L != []){\n\t\ttemp = takeOneFrom(L);\n\t\trandomlist += temp[0];\n\t\tL = temp[1];\n\t}\n\t\n\t// user interaction\n\tscore = 0;\n\ttext1 = \"\";\n\tfigure =\n\tbox(vcat([\n\t\tbox(text(str(){\n\t\t\treturn \"<randomlist>\";})),\n\t\tbox(textfield(\"Insert number of digits you would like to reverse here.\",\n\t\t\tvoid(str s){\n\t\t\t\tscore += 1;\n\t\t\t\tn = toInt(s);\n\t\t\t\tspliced = slice(randomlist, 0, n);\t\t\t\t\t\n\t\t\t\trandomlist = reverse(spliced) + (randomlist - spliced);\n\t\t\t\t},\n\t\t\tfillColor(\"lightblue\"))),\n\t\tbox(text(str(){\n\t\t\treturn ((randomlist == [1 .. 9]) ? \"Well done! Your score: <score>.\" : \"Keep going!\");}))\n\t\t\t\t]));\n\t\n\trender(figure);\n}\n","language":"Rascal"},{"code":"REBOL []\n\nprint \"NUMBER REVERSAL GAME\"\n\ntries: 0\ngoal: [1 2 3 4 5 6 7 8 9]\nrandom/seed now\n\nuntil [\n jumble: random goal\n jumble != goal ; repeat in the unlikely case that jumble isn't jumbled\n]\n\nwhile [jumble != goal] [\n prin jumble\n prin \" How many to flip? \"\n flip-index: to-integer input ; no validation!\n reverse/part jumble flip-index\n tries: tries + 1\n]\n\nprint rejoin [\"You took \" tries \" attempts.\"]\n","language":"REBOL"},{"code":"/*REXX program (a game): reverse a jumbled set of decimal digits 'til they're in order.*/\nsignal on halt /*allows the CBLF to HALT the program.*/\n___= copies('─', 9); pad=left('', 9) /*a fence used for computer's messages.*/\nsay ___ \"This game will show you nine random unique digits (1 ──► 9), and you'll enter\"\nsay ___ \"one of those digits which will reverse all the digits from the left-most digit\"\nsay ___ \"up to (and including) that decimal digit. The game's objective is to get all\"\nsay ___ \"of the digits in ascending order with the fewest tries. Here're your digits:\"\nok= 123456789 /*the result that the string should be.*/\n$= /* ◄─── decimal target to be generated.*/\n do until length($)==9; _=random(1, 9) /*build a random unique numeric string.*/\n if pos(_, $) \\== 0 then iterate /*¬ unique? Only use a decimal dig once*/\n $=$ || _ /*construct a string of unique digits. */\n if $==ok then $= /*string can't be in order, start over.*/\n end /*until*/\n\n do score=1 until $==ok; say /* [↓] display the digits & the prompt*/\n say ___ $ right('please enter a digit (or Quit):', 50)\n parse pull ox . 1 ux . 1 x .; upper ux /*get a decimal digit (maybe) from CBLF*/\n if abbrev('QUIT', ux, 1) then signal halt /*does the CBLF want to quit this game?*/\n if length(x)>1 then do; say ___ pad '***error*** invalid input: ' ox; iterate; end\n if x='' then iterate /*try again, CBLF didn't enter anything*/\n g=pos(x, $) /*validate if the input digit is legal.*/\n if g==0 then say ___ pad '***error*** invalid digit: ' ox\n else $=strip(reverse(left($,g))substr($,g+1)) /*reverse some (or all) digits*/\n end /*score*/\n\nsay; say ___ $; say; say center(' Congratulations! ', 70, \"═\"); say\nsay ___ pad 'Your score was' score; exit /*stick a fork in it, we're all done. */\nhalt: say ___ pad 'quitting.'; exit /* \" \" \" \" \" \" \" \" */\n","language":"REXX"},{"code":"# Project : Number reversal game\n\nrever = 1:9\nleftrever = []\nfor n = 1 to len(rever)\n rnd = random(8) + 1\n temp = rever[n]\n rever[n] = rever[rnd]\n rever[rnd] = temp\nnext\nsee rever\nsee nl\nwhile true\n num = 0\n leftrever = []\n showarray(rever)\n see \" : Reverse how many = \"\n give r\n r = number(r)\n for n = 1 to r\n add(leftrever, rever[n])\n next\n leftrever = reverse(leftrever)\n for pos = 1 to r\n rever[pos] = leftrever[pos]\n next\n for m = 1 to len(rever)\n if rever[m] = m\n num = num + 1\n ok\n next\n if num = len(rever)\n exit\n ok\nend\nsee \"You took \" + num + \" attempts.\" + nl\n\nfunc swap(a, b)\n temp = a\n a = b\n b = temp\n return [a, b]\n\nfunc showarray(vect)\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","language":"Ring"},{"code":"ary = (1..9).to_a\nary.shuffle! while ary == ary.sort\nscore = 0\nuntil ary == ary.sort\n print \"#{ary.inspect} -- How many digits to reverse? \"\n num = gets.to_i # should validate input\n ary[0, num] = ary[0, num].reverse\n score += 1\nend\np ary\nputs \"Your score: #{score}\"\n","language":"Ruby"},{"code":"for i = 1 to 9 ' get numbers 1 to 9\n n(i) = i\nnext i\nnumShuffles = 3\n' ----------------------------------\n' shuffle numbers\n' ----------------------------------\nfor \ti \t= 1 to 9 * numShuffles\n\ti1\t= int(rnd(1)*9) + 1\n\ti2\t= int(rnd(1)*9) + 1\n\th2\t= n(i1)\n\tn(i1)\t= n(i2)\n\tn(i2)\t= h2\nnext i\n\nfor i = 1 to 9\n a$ = a$ + str$(n(i)) + \" \"\nnext i\ncount = 0\n\n[loop]\n count = count + 1\n print count;\" : \";a$\n for i = 1 to 9 ' check if in sequence\n j = i * 2\n if mid$(a$,j-1,1) > mid$(a$,j,1) then goto [notOrdered]\n next i\n print \"It took \";count;\" tries\"\nend\n\n[notOrdered]\ninput \"How many numbers to flip:\";i\ni = ((i-1) * 2) + 1\nb$ = \"\"\nfor j = i to 1 step -2\n b$ = b$ + mid$(a$,j,2)\nnext j\na$ = b$ + mid$(a$,i + 2)\ngoto [loop]\nend\n","language":"Run-BASIC"},{"code":"use rand::prelude::*;\nuse std::io::stdin;\n\nfn is_sorted(seq: &[impl PartialOrd]) -> bool {\n if seq.len() < 2 {\n return true;\n }\n // Look for any instance where the previous number is larger than the following\n !seq.iter()\n .zip(seq[1..].iter())\n .any(|(prev, foll)| prev > foll)\n}\n\nfn main() {\n println!(\n \"Number reversal game:\n Given a jumbled list of the numbers 1 to 9, put the numbers in order.\n Each attempt you can reverse up to n digits starting from the left.\n The score is the count of the reversals needed to attain the ascending order.\"\n );\n let mut rng = thread_rng();\n\n let mut sequence: Vec<u8> = (1..10).collect();\n while is_sorted(&sequence) {\n sequence.shuffle(&mut rng);\n }\n\n let mut attempt = 1;\n while !is_sorted(&sequence) {\n println!(\n \"Attempt {}: {:?} - How many numbers do you want to flip?\",\n attempt, sequence\n );\n let flip = {\n let mut input = String::new();\n stdin().read_line(&mut input).unwrap();\n input.trim().parse().unwrap()\n };\n sequence[..flip].reverse();\n attempt += 1;\n }\n println!(\n \"Congrats! It took you {} attempts to sort the sequence.\",\n attempt - 1 // Remove additionally counted attempt\n );\n}\n","language":"Rust"},{"code":"object NumberReversalGame extends App {\n def play(n: Int, cur: List[Int], goal: List[Int]) {\n readLine(s\"\"\"$n. ${cur mkString \" \"} How many to flip? \"\"\") match {\n case null => println\n case s => scala.util.Try(s.toInt) match {\n case scala.util.Success(i) if i > 0 && i <= cur.length =>\n (cur.take(i).reverse ++ cur.drop(i)) match {\n case done if done == goal =>\n println(s\"Congratulations! You solved \"+goal.mkString(\" \"))\n println(s\"Your score is $n (lower is better)\")\n case next => play(n + 1, next, goal)\n }\n case _ => println(s\"Choose a number between 1 and ${cur.length}\")\n play(n + 1, cur, goal)\n }\n }\n }\n\n def play(size: Int) {\n val goal = List.range(1, size + 1)\n def init: List[Int] = scala.util.Random.shuffle(goal) match {\n case repeat if repeat == goal => init\n case done => done\n }\n play(1, init, goal)\n }\n\n play(9)\n}\n","language":"Scala"},{"code":"(import (scheme base)\n (scheme read)\n (scheme write)\n (srfi 1) ; list functions\n (srfi 27)) ; random numbers\n\n(random-source-randomize! default-random-source)\n\n(define (make-randomised-list)\n (let ((vec (apply vector (iota 9 1))))\n (do ((c 0 (+ 1 c)))\n ((and (>= c 20) ; at least 20 tries\n (not (apply < (vector->list vec)))) ; ensures list not in order\n (vector->list vec))\n (let* ((i (random-integer 9)) ; swap two randomly chosen elements\n (j (random-integer 9))\n (tmp (vector-ref vec i)))\n (vector-set! vec i (vector-ref vec j))\n (vector-set! vec j tmp)))))\n\n(define (play-game lst plays)\n (define (reverse-first n lst)\n (let-values (((start tail) (split-at lst n)))\n (append (reverse start) tail)))\n ;\n (display \"List: \") (display lst) (newline)\n (display \"How many numbers should be flipped? \")\n (let* ((flip (string->number (read-line)))\n (new-lst (reverse-first flip lst)))\n (if (apply < new-lst)\n (display (string-append \"Finished in \"\n (number->string plays)\n \" attempts\\n\"))\n (play-game new-lst (+ 1 plays)))))\n\n(play-game (make-randomised-list) 1)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n const array integer: sortedList is [] ( 1, 2, 3, 4, 5, 6, 7, 8, 9);\n var array integer: list is 0 times 0;\n var array integer: reversedList is 0 times 0;\n var integer: score is 0;\n var integer: index is 0;\n var integer: number is 0;\n var integer: reverse is 0;\n begin\n for number range sortedList do\n index := rand(1, succ(length(list)));\n list := list[.. pred(index)] & [] (number) & list[index ..];\n end for;\n repeat\n write(\"Current list: \");\n for number range list do\n write(number <& \" \");\n end for;\n repeat\n write(\" Digits to reverse? \");\n readln(reverse);\n if reverse < 2 or reverse > 9 then\n write(\"Please enter a value between 2 and 9.\");\n end if;\n until reverse >= 2 and reverse <= 9;\n incr(score);\n reversedList := 0 times 0;\n for index range reverse downto 1 do\n reversedList &:= list[index];\n end for;\n list := reversedList & list[succ(reverse) ..];\n until list = sortedList;\n writeln(\"Congratulations, you sorted the list in \" <& score <& \" reversals.\");\n end func;\n","language":"Seed7"},{"code":"// set the initial list of digits\nset currentList to 1..9 sorted by random of a million\n\n// make sure we don't start off already sorted\nrepeat while currentList equals 1..9\n\tsort currentList by random of a million\nend repeat\n\n// ask until it is solved\nrepeat while currentList isn't equal to 1..9\n\tadd 1 to numberOfTurns\n\tset headline to \"Turn #\" & numberOfTurns & \": You have \" & currentList joined by empty\n\t\n\task \"How many digits do you want to reverse?\" titled headline message \"On each turn, specify the number of initial digits to reverse.\"\n\tif it isn't a number then exit all -- allow the user to exit\n\t\n\tsort items 1 to it of currentList descending by the counter\nend repeat\n\nanswer \"You sorted it in \" & numberOfTurns & \" turns!\" titled \"Congratulations!\"\n","language":"SenseTalk"},{"code":"program number_reversal_game;\n setrandom(0);\n tries := 0;\n state := shuffled_numbers();\n\n loop until state = \"123456789\" do\n tries +:= 1;\n swapat := read_step(tries, state);\n state := reverse state(..swapat) + state(swapat+1..);\n end loop;\n print(state + \" - You win in \" + str tries + \" tries.\");\n\n proc read_step(tries, state);\n loop until r in [str d : d in [1..9]] do\n putchar(state + \" - Reverse how many? \");\n flush(stdout);\n r := getline(stdin);\n end loop;\n return val r;\n end proc;\n\n proc shuffled_numbers();\n digits := \"123456789\";\n loop until out /= digits do\n dset := {d : d in digits};\n out := +/[[d := random dset, dset less:= d](1) : until dset = {}];\n end loop;\n return out;\n end proc;\nend program;\n","language":"SETL"},{"code":"var turn = 0;\nvar jumble = @(1..9).bshuffle; # best-shuffle\n\nfor (turn; jumble != 1..9; ++turn) {\n printf(\"%2d: %s - Flip how many digits ? \", turn, jumble.join(' '));\n var d = read(Number) \\\\ break;\n jumble[0 .. d-1] = [jumble[0 .. d-1]].reverse...;\n}\n\nprint \" #{jumble.join(' ')}\\n\";\nprint \"You won in #{turn} turns.\\n\";\n","language":"Sidef"},{"code":"package require Tcl 8.5\n# Simple shuffler, not very efficient but good enough for here\nproc shuffle list {\n set result {}\n while {[llength $list]} {\n\tset i [expr {int([llength $list] * rand())}]\n\tlappend result [lindex $list $i]\n\tset list [lreplace $list $i $i]\n }\n return $result\n}\n# Returns the list with the prefix of it reversed\nproc flipfirst {list n} {\n concat [lreverse [lrange $list 0 $n-1]] [lrange $list $n end]\n}\n\n# Core game engine; list to play with is optional argument\nproc nrgame {{target \"1 2 3 4 5 6 7 8 9\"}} {\n set nums $target\n while {$nums eq $target} {set nums [shuffle $nums]}\n set goes 0\n while {$nums ne $target} {\n\tincr goes\n\tputs -nonewline \"#${goes}: List is '[join $nums {, }]', how many to reverse? \"\n\tflush stdout\n\tgets stdin n\n\tif {$n eq \"q\"} {return quit}\n\t# Input validation would go here\n\tset nums [flipfirst $nums $n]\n }\n return $goes\n}\n\n# Print some instructions and wait for the user to win\nputs \"Welcome to the Number Reversal Game!\"\nputs \"------------------------------------\"\nputs \"I'll show you a list of numbers, you need to reverse prefixes of them\"\nputs \"to get the whole list in ascending order. A 'q' will quit early.\\n\"\nputs \"\"\nset outcome [nrgame]\nif {$outcome ne \"quit\"} {\n puts \"\\nYou took $outcome attempts to put the digits in order.\"\n}\n","language":"Tcl"},{"code":"RANDOMIZE\n\nPRINT \"Dada una lista aleatoria de números del 1 al 9,\"\nPRINT \"indica cuantos dígitos de la izquierda voltear.\"\nPRINT \" El objetivo es obtener los dígitos en orden \"\nPRINT \" con el 1 a la izquierda y el 9 a la derecha.\"\nPRINT\n\nDIM nums(1 to 9)\nDIM temp(1 to 9)\n!valores iniciales\nFOR x = 1 to 9\n LET nums(x) = x\nNEXT x\n\nDO !barajamos\n FOR x = 9 to 2 step -1\n LET n = round(int(rnd*(x))+1)\n IF n <> x then\n !swap (nums(n), nums(x)) !no existe comado SWAP\n LET temp(n) = nums(x)\n LET nums(x) = nums(n)\n LET nums(n) = temp(n)\n END IF\n NEXT x\n FOR x = 1 to 8 !nos aseguramos que no estén en orden\n IF nums(x) > nums(x+1) then EXIT DO\n NEXT x\nLOOP\n\nLET denuevo = -1\nDO\n IF intentos < 10 then PRINT \" \";\n PRINT intentos; \":\";\n FOR x = 1 to 9\n PRINT nums(x);\n NEXT x\n\n IF (not denuevo <> 0) then EXIT DO\n\n INPUT prompt \" -- ¿Cuántos volteamos? \": volteo\n IF volteo < 0 or volteo > 9 then LET volteo = 0\n\n FOR x = 1 to (ip(volteo/2))\n !swap (nums(x), nums(volteo-x+1)) !no existe SWAP\n LET temp(n) = nums(volteo-x+1)\n LET nums(volteo-x+1) = nums(x)\n LET nums(x) = temp(n)\n NEXT x\n\n LET denuevo = 0\n !comprobamos el orden\n FOR x = 1 to 8\n IF nums(x) > nums(x+1) then\n LET denuevo = -1\n EXIT FOR\n END IF\n NEXT x\n\n IF volteo > 0 then LET intentos = intentos+1\nLOOP\n\nPRINT\nPRINT\nPRINT \"Necesitaste \"; ltrim$(rtrim$(str$(intentos))); \" intentos.\"\nEND\n","language":"True-BASIC"},{"code":"$$ MODE TUSCRIPT\nnumbers=RANDOM_NUMBERS (1,9,9),nr=0\n\nSECTION check\nLOOP o,n=numbers\n IF (n!=o) THEN\n DO PRINT\n EXIT\n ELSEIF (n==9&&o==9) THEN\n DO PRINT\n PRINT \" You made it ... in round \",r\n STOP\n ELSE\n CYCLE\n ENDIF\nENDLOOP\nENDSECTION\n\nSECTION print\n PRINT numbers\nENDSECTION\n\n\nDO PRINT\nLOOP r=1,14\nIF (nr>=0&&nr<10) THEN\n ASK \"Reverse - how many?\": nr=\"\"\n i=\"\"\n LOOP n=1,nr\n i=APPEND(i,n)\n ENDLOOP\n numbers =SPLIT (numbers)\n reverse_nr=SELECT (numbers,#i,keep_nr), reverse_nr=REVERSE(reverse_nr)\n numbers =APPEND (reverse_nr,keep_nr), numbers =JOIN (numbers)\n DO check\nENDIF\nENDLOOP\n","language":"TUSCRIPT"},{"code":"print \"\\nWelcome to the number reversal game!\\n\"\n\nprint \"You must put the numbers in order from 1 to 9.\"\nprint \"Your only moves are to reverse groups of numbers\"\nprint \"on the left side of the list.\"\n\ninteger list score\n\n# start a new game\nfunction newgame {\n\tinteger i j t\n\n\t# score = number of moves\n\t((score = 0))\n\n\t# list = array of numbers\n\tset -A list 1 2 3 4 5 6 7 8 9\n\twhile true; do\n\t\t# Knuth shuffle\n\t\t((i = 9))\n\t\twhile ((i > 1)); do\n\t\t\t# get random j from 0 to i - 1\n\t\t\t((j = RANDOM))\n\t\t\t((j < 32768 % i)) && continue\n\t\t\t((j %= i))\n\n\t\t\t# decrement i, swap list[i] with list[j]\n\t\t\t((i -= 1))\n\t\t\t((t = list[i]))\n\t\t\t((list[i] = list[j]))\n\t\t\t((list[j] = t))\n\t\tdone\n\t\twin || break\n\tdone\n}\n\n# numbers in order?\nfunction win {\n\tinteger i\n\n\t# check if list[0] == 1, list[1] == 2, ...\n\t((i = 0))\n\twhile ((i < 9)); do\n\t\t((list[i] != i + 1)) && return 1\n\t\t((i += 1))\n\tdone\n\treturn 0\n}\n\n# reverse first $1 elements of list\nfunction reverse {\n\tinteger left right t\n\n\t((left = 0))\n\t((right = $1 - 1))\n\twhile ((right > left)); do\n\t\t((t = list[left]))\n\t\t((list[left] = list[right]))\n\t\t((list[right] = t))\n\t\t((left += 1))\n\t\t((right -= 1))\n\tdone\n}\n\n\ninteger i\n\nnewgame\nwhile true; do\n\tprint -n \"\\nYour list: \"\n\t((i = 0))\n\twhile ((i < 8)); do\n\t\tprintf \"%d, \" ${list[i]}\n\t\t((i += 1))\n\tdone\n\tprintf \"%d\\n\" ${list[8]}\n\n\tif win; then\n\t\tprint \"YOU WIN!\"\n\t\tprintf \"Your score is %d moves.\\n\" $score\n\t\tprint -n \"Would you like to play again (y/n)? \"\n\n\t\tif read again && [[ $again = @(y|Y)* ]]; then\n\t\t\tnewgame\n\t\telse\n\t\t\tprint \"\\n\\nBye!\"\n\t\t\texit\n\t\tfi\n\telse\n\t\tprint -n \"How many numbers to reverse? \"\n\n\t\tif read i; then\n\t\t\t((score += 1))\n\t\t\treverse $i\n\t\telse\n\t\t\tprint \"\\n\\nBye!\"\n\t\t\texit\n\t\tfi\n\tfi\ndone\n","language":"UNIX-Shell"},{"code":"import rand\nimport os\n\nfn main() {\n\tmut score, mut rnum := 0, 0\n\tmut mix, mut unmix := []int{}, []int{}\n\tfor mix.len < 9 {\n\t\trnum = rand.int_in_range(1, 10) or {println('Error: invalid number') exit(1)}\n\t\tif mix.contains(rnum) == false {\n\t\t\tmix << rnum\n\t\t}\n\t}\n\tunmix = mix.clone()\n\tunmix.sort()\n\tprintln(\"Select how many digits from the left to reverse.\")\n\tfor {\n\t\tprint(\"The list is: ${mix} ==> How many digits to reverse? \")\n\t\tinput := os.input('').str().trim_space().int()\n\t\tscore++\n\t\tif input == 0 || input < 2 || input > 9 {\n\t\t\tprintln(\"\\n(Enter a number from 2 to 9)\")\n\t\t\tcontinue\n\t\t}\n\t\tfor idx, rdx := 0, input - 1; idx < rdx; idx, rdx = idx + 1, rdx - 1 {\n\t\t\tmix[idx], mix[rdx] = mix[rdx], mix[idx]\n\t\t}\n\t\tif mix == unmix {\n\t\t\tprintln(\"The list is: ${mix}.\")\n\t\t\tprintln(\"Your score: ${score}. Good job.\")\n\t\t\tbreak\n\t\t}\n\t}\n}\n","language":"V-(Vlang)"},{"code":"Private Function shuffle(ByVal a As Variant) As Variant\n Dim t As Variant, i As Integer\n For i = UBound(a) To LBound(a) + 1 Step -1\n j = Int((UBound(a) - LBound(a) + 1) * Rnd + LBound(a))\n t = a(i)\n a(i) = a(j)\n a(j) = t\n Next i\n shuffle = a\nEnd Function\nPrivate Sub reverse(ByRef a As Variant, n As Integer)\n Dim b As Variant\n b = a\n For i = 1 To n\n a(i) = b(n + 1 - i)\n Next i\nEnd Sub\nPublic Sub game()\n Debug.Print \"Given a jumbled list of the numbers 1 to 9\"\n Debug.Print \"you must select how many digits from the left to reverse.\"\n Debug.Print \"Your goal is to get the digits in order with 1 on the left and 9 on the right.\"\n\n inums = [{1,2,3,4,5,6,7,8,9}]\n Dim nums As Variant\n Dim turns As Integer, flip As Integer\n\n shuffled = False\n Do While Not shuffled\n nums = shuffle(inums)\n For i = LBound(nums) To UBound(nums)\n If nums(i) <> inums(i) Then\n shuffled = True\n Exit For\n End If\n Next i\n Loop\n\n\n Do While True\n Debug.Print turns; \":\";\n For Each x In nums: Debug.Print x;: Next x\n Debug.Print\n flag = False\n For i = LBound(nums) To UBound(nums)\n If nums(i) <> inums(i) Then\n flag = True\n Exit For\n End If\n Next i\n If flag Then\n flip = InputBox(\" -- How many numbers should be flipped? \")\n reverse nums, flip\n turns = turns + 1\n Else\n Exit Do\n End If\n Loop\n\n Debug.Print \"You took\"; turns; \"turns to put the digits in order.\"\nEnd Sub\n","language":"VBA"},{"code":"import \"./sort\" for Sort\nimport \"random\" for Random\nimport \"io\" for Stdin, Stdout\n\nvar r= Random.new()\nvar count = 0\nvar numbers = [0] * 9\nnumbers[0] = r.int(2, 10) // this will ensure list isn't ascending\nfor (i in 1..8) {\n var rn\n while(true) {\n rn = r.int(1, 10)\n if (!numbers.contains(rn)) break\n }\n numbers[i] = rn\n}\nSystem.print(\"Here's your first list : %(numbers)\")\nwhile (true) {\n var rev\n while (true) {\n System.write(\"How many numbers from the left are to be reversed : \")\n Stdout.flush()\n rev = Num.fromString(Stdin.readLine())\n if (rev.type == Num && rev.isInteger && rev >= 2 && rev <= 9) break\n }\n count = count + 1\n var i = 0\n var j = rev - 1\n while (i < j) {\n var temp = numbers[i]\n numbers[i] = numbers[j]\n numbers[j] = temp\n i = i + 1\n j = j - 1\n }\n if (Sort.isSorted(numbers)) {\n System.print(\"Here's your final list : %(numbers)\")\n break\n }\n System.print(\"Here's your list now : %(numbers)\")\n}\nSystem.print(\"So you've completed the game with a score of %(count)\")\n","language":"Wren"},{"code":"int Taken, I, Digit, Num, Score, Rev, Temp;\nchar List(9);\ninclude c:\\cxpl\\codes;\n \\make jumbled list of digits 1 to 9\n[loop [Taken:= 0; \\bit array indicates which digits are taken\n for I:= 0 to 9-1 do\n [repeat Digit:= Ran(9)+1 until (Taken & 1<<Digit) = 0;\n Taken:= Taken + 1<<Digit; \\mark digit as taken\n List(I):= Digit; \\add digit to the list\n ];\nfor I:= 0 to 9-2 do if List(I) > List(I+1) then quit;\n]; \\quit loop when digits are not in ascending order\nScore:= 0;\nloop [for I:= 0 to 9-1 do [IntOut(0, List(I)); ChOut(0, ^ )];\n Num:= 0; for I:= 0 to 9-1 do Num:= Num*10 + List(I);\n if Num = 123456789 then quit;\n Text(0, \"^M^JReverse how many digits? \"); Rev:= IntIn(0);\n for I:= 0 to Rev/2-1 do\n [Temp:= List(I); List(I):= List(Rev-1-I); List(Rev-1-I):= Temp];\n Score:= Score+1;\n ];\nText(0, \"^M^JCongrats! You did it in \"); IntOut(0, Score);\nText(0, \" moves!!^M^J\");\n]\n","language":"XPL0"},{"code":"// Rosetta Code problem: https://www.rosettacode.org/wiki/Number_reversal_game\n// by Jjuanhdez, 06/2022\n\nprint \"Given a jumbled list of the numbers 1 to 9, \"\nprint \"you must select how many digits from the left \"\nprint \"to reverse. Your goal is to get the digits in \"\nprint \"order with 1 on the left and 9 on the right.\\n\"\n\ndim nums(10)\ndim a(10)\nintentos = 0: denuevo = true: colum = 6\n\n//valores iniciales\nfor i = 1 to 9\n nums(i) = i\nnext i\n\nfor i = 9 to 2 step -1\n n = int(ran(i)) + 1\n if n <> i then\n a(i) = nums(i)\n nums(i) = nums(n)\n nums(n) = a(i)\n fi\nnext i\n\nrepeat\n if intentos < 10 print \" \";\n print intentos, \": \";\n for i = 1 to 9\n print nums(i), \" \";\n next i\n\n if not denuevo break\n\n input \" -- How many do we flip \" volteo\n if volteo < 0 or volteo > 9 volteo = 0\n\n for i = 1 to int(volteo / 2)\n a(i) = nums(volteo - i + 1)\n nums(volteo - i + 1) = nums(i)\n nums(i) = a(i)\n next i\n\n denuevo = false\n //comprobamos el orden\n for i = 1 to 8\n if nums(i) > nums(i + 1) then\n denuevo = true\n break\n fi\n next i\n\n if volteo > 0 intentos = intentos + 1\nuntil false\nprint \"\\n\\n You needed \", intentos, \" attempts.\"\nend\n","language":"Yabasic"},{"code":"correctList,scrambledList,N:=[1..9].walk(), correctList.shuffle(),correctList.len();\ncorrectList,scrambledList=correctList.concat(\"\"), scrambledList.concat(\"\"); // list to string\nattempts:=0;\nwhile(scrambledList!=correctList){ // Repeat until the sequence is correct\n n:=ask((\"[%d] %s How many numbers (from the left) should be flipped? \")\n\t .fmt(attempts,scrambledList));\n try{ n=n.toInt() }catch{ println(\"Not a number\"); continue; }\n if(not (0<=n<N)){ println(\"Out of range\"); continue; }\n attempts+=1;\n // Reverse the first part of the string and add the second part\n scrambledList=scrambledList[0,n].reverse() + scrambledList[n,*];\n}\nprintln(\"You took %d attempts to get the correct sequence.\".fmt(attempts));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Puzzles\\nfrom: http://rosettacode.org/wiki/Number_reversal_game\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nGiven a jumbled list of the numbers '''1''' to '''9''' that are definitely ''not'' in \\nascending order.\\n\\nShow the list, and then ask the player how many digits from the \\nleft to reverse. \\n\\nReverse those digits, then ask again, until all the digits end up in ascending order.\\n\\n\\nThe score is the count of the reversals needed to attain the ascending order.\\n\\n\\nNote: Assume the player's input does not need extra validation.\\n\\n\\n;Related tasks:\\n* [[Sorting algorithms/Pancake sort]]\\n* [[wp:Pancake sorting|Pancake sorting]].\\n* [[Topswops]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V data = Array(‘139275486’)\\nV trials = 0\\n\\nL data != sorted(data)\\n trials++\\n V flip = Int(input(‘###2: LIST: '#.' Flip how many?: ’.format(trials, data.join(‘ ’))))\\n data.reverse_range(0 .< flip)\\n\\nprint(\\\"\\\\nYou took #. attempts to put the digits in order!\\\".format(trials))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"rawio:\\tequ\\t6\\n\\torg\\t100h\\n\\t;;;\\tInitialize RNG from keypresses\\n\\tlxi\\td,keys\\n\\tcall\\tputs\\n\\tmvi\\tb,4\\t; 4*4 = 16 bytes\\nrndini:\\tmvi\\tc,4\\n\\tlxi\\th,rnddat\\nrndin2:\\tpush\\tb\\n\\tpush \\th\\nrndkey:\\tcall\\tkeyin\\t; Get key\\n\\tana\\ta\\n\\tjz\\trndkey\\n\\tpop\\th\\n\\tpop \\tb\\n\\txra\\tm\\t; XOR into random data\\n\\tmov\\tm,a\\n\\tinx\\th\\n\\tdcr\\tc\\n\\tjnz\\trndin2\\n\\tdcr\\tb\\n\\tjnz \\trndini\\n\\tlxi\\td,done\\n\\tcall\\tputs\\n\\t;;;\\tCreate and shuffle array of numbers\\n\\tmvi\\ta,'1'\\t; Start at 1\\n\\tmvi\\tb,9\\t; 9 items\\n\\tlxi\\th,list\\nmklst:\\tmov\\tm,a\\t; Store item\\n\\tinr\\ta\\t; Increment item\\n\\tinx\\th\\t; Increment pointer\\n\\tdcr\\tb\\t; One fewer list\\n\\tjnz\\tmklst\\n\\tmov\\tm,b\\t; Zero-terminate the list\\n\\tlxi\\td,list+8\\nshuf:\\tcall\\trande\\t; Shuffle the list. E = high, L = low\\n\\tmov\\tl,a\\n\\tldax\\td\\t; Load current number\\n\\tmov\\tb,m\\t; Load number to swap with\\n\\tmov\\tm,a\\t; Store first number\\n\\tmov\\ta,b\\t; Store second number\\n\\tstax\\td\\n\\tdcr\\te\\t; Move pointer back\\n\\tjnz\\tshuf\\t; Keep going until list is shuffled\\n\\tlxi\\th,0\\t; Keep score on stack\\n\\tpush\\th\\n\\t;;;\\tGame loop\\ngame:\\tlxi\\td,list\\t; Print current state\\n\\tcall\\tputs\\n\\tlxi\\td,list\\n\\tldax\\td\\ncheck:\\tmov\\tb,a\\t; Check if list is sorted (done)\\n\\tinx\\td\\n\\tldax\\td\\n\\tana\\ta\\t; Reached end of list?\\n\\tjz\\twin\\t; Then the list is in order\\n\\tcmp\\tb\\t; Larger than previous?\\n\\tjnc\\tcheck\\t; Then keep going\\n\\tlxi\\td,prompt\\n\\tcall\\tputs\\t; Ask for a number\\n\\tcall\\tgetnum\\n\\tmov\\tb,a \\t; B = high number\\n\\tdcr\\tb\\n\\tmvi\\tc,0\\t; C = low number\\n\\tmvi\\th,listhi\\nswap:\\tmov\\tl,c\\t; Load high number in D\\n\\tmov\\td,m\\n\\tmov\\tl,b\\t; Load high number in E\\n\\tmov\\te,m\\n\\tmov\\tm,d\\t; Store low number in high place\\n\\tmov\\tl,c\\n\\tmov\\tm,e\\t; Store high number in low place\\n\\tdcr\\tb\\t; Decrement high index\\n\\tinr\\tc\\t; Increment low index\\n\\tmov\\ta,c\\t; Low < high?\\n\\tcmp\\tb\\n\\tjc\\tswap\\t; Then keep swapping\\n\\tlxi\\td,nl\\t; Print newline\\n\\tcall\\tputs\\n\\tpop\\th\\t; Increment score\\n\\tinx \\th\\n\\tpush \\th\\n\\tjmp\\tgame\\nwin:\\tlxi\\td,winmsg\\n\\tcall\\tputs\\t; Print win message\\n\\tlxi\\th,score\\n\\txthl\\t\\t; Retrieve score and push score output buffer\\n\\tlxi\\tb,-10\\t; Divisor\\ndigit:\\tlxi\\td,-1\\t; Quotient\\ndgdiv:\\tinx\\td\\t; Find digit\\n\\tdad\\tb\\n\\tjc\\tdgdiv\\n\\tmvi\\ta,'0'+10\\n\\tadd\\tl\\t; Store digit\\n\\tpop\\th\\t; Get pointer\\n\\tdcx \\th\\t; Decrement pointer\\n\\tmov\\tm,a\\t; Write digit to memory\\n\\tpush\\th\\t; Store pointer\\n\\txchg\\t\\t; Continue with quotient\\n\\tmov\\ta,h\\t; Done yet?\\n\\tora\\tl\\n\\tjnz\\tdigit\\t; If not keep going\\n\\tpop\\td\\t; Retrieve pointer\\n\\t;;;\\tPrint 0-terminated string\\nputs:\\tldax\\td\\t; Get character\\n\\tana\\ta\\t; Is it zero?\\n\\trz\\t\\t; Then stop\\n\\tinx\\td\\t; Otherwise, increment buffer pointer\\n\\tpush\\td\\t; Save buffer pointer\\n\\tmov\\te,a\\t; Print character\\n\\tcall\\tio\\n\\tpop\\td\\t; Restore buffer pointer\\n\\tjmp \\tputs\\t; Next character \\t\\n\\t;;;\\tRead 1-9 key\\ngnerr:\\tmvi\\te,7\\n\\tcall\\tio\\ngetnum:\\tcall\\tkeyin\\n\\tana\\ta\\n\\tjz\\tgetnum\\t; If no key, wait for one\\n\\tcpi\\t'1'\\n\\tjc\\tgnerr\\t; Not valid - beep and try again\\n\\tcpi\\t'9'+1\\n\\tjnc\\tgnerr\\n\\tpush\\tpsw\\t; Valid - echo\\n\\tmov\\te,a\\n\\tcall\\tio\\n\\tpop\\tpsw\\n\\tsui\\t'0'\\n\\tret\\nkeyin:\\tmvi\\te,0FFh\\t; Read key\\nio:\\tmvi\\tc,rawio\\t; CP/M raw I/O call\\n\\tjmp\\t5\\n\\t;;; \\tRandom number up to E\\nrande:\\tcall\\trand\\n\\tani\\t15\\n\\tcmp\\te\\n\\tjnc\\trande\\n\\tret\\n\\t;;;\\tRNG\\nrand:\\tpush\\th! lxi h,rnddat! inr m! mov a,m! inx h! xra m! inx h! xra m\\n\\tmov\\tm,a! inx h! add m! mov m,a! rar! dcx h! xra m! dcx h! add m\\n\\tmov\\tm,a! pop h\\n\\tret\\nprompt:\\tdb\\t9,' - Reverse how many? ',0\\nkeys:\\tdb\\t'Please press some keys to seed the RNG...',0\\ndone:\\tdb\\t'done.'\\nnl:\\tdb\\t13,10,0\\nwinmsg:\\tdb\\t13,10,'You win! Score = ',0\\n\\tdb\\t'*****'\\nscore:\\tdb\\t13,10,0\\nlisthi:\\tequ\\t$/256+1\\nlist:\\tequ\\tlisthi*256\\nrnddat:\\tequ\\tlist+16\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"PROC KnuthShuffle(BYTE ARRAY tab BYTE size)\\n BYTE i,j,tmp\\n\\n i=size-1\\n WHILE i>0\\n DO\\n j=Rand(i+1)\\n tmp=tab(i)\\n tab(i)=tab(j)\\n tab(j)=tmp\\n i==-1\\n OD\\nRETURN\\n\\nBYTE FUNC IsSorted(BYTE ARRAY tab BYTE size)\\n BYTE i\\n\\n FOR i=0 TO size-2\\n DO\\n IF tab(i)>tab(i+1) THEN\\n RETURN (0)\\n FI\\n OD\\nRETURN (1)\\n\\nPROC Swap(BYTE ARRAY tab BYTE size,count)\\n BYTE i,j,tmp\\n\\n i=0 j=count-1\\n WHILE i<j\\n DO\\n tmp=tab(i)\\n tab(i)=tab(j)\\n tab(j)=tmp\\n i==+1 j==-1\\n OD\\nRETURN\\n\\nPROC Main()\\n DEFINE SIZE=\\\"9\\\"\\n BYTE ARRAY a(SIZE)\\n BYTE i,j,n,tmp\\n BYTE LMARGIN=$52,oldLMARGIN\\n\\n oldLMARGIN=LMARGIN\\n LMARGIN=0 ;remove left margin on the screen\\n Put(125) PutE() ;clear the screen\\n\\n FOR i=0 TO SIZE-1\\n DO\\n a(i)=i+1\\n OD\\n KnuthShuffle(a,SIZE)\\n\\n i=0\\n DO\\n PrintF(\\\"%B: \\\",i)\\n FOR j=0 TO SIZE-1\\n DO\\n PrintB(a(j))\\n OD\\n IF IsSorted(a,SIZE) THEN\\n EXIT\\n FI\\n PrintF(\\\" How many to flip (2-%B)? \\\",SIZE)\\n n=InputB()\\n IF n>=2 AND n<=SIZE THEN\\n Swap(a,SIZE,n)\\n i==+1\\n FI\\n OD\\n\\n PrintF(\\\"%E%EYou solved it in %B moves!\\\",i)\\n\\n LMARGIN=oldLMARGIN ;restore left margin on the screen\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_Io; use Ada.Text_Io;\\nwith Ada.Integer_Text_Io; use Ada.Integer_Text_Io;\\nwith Ada.Numerics.Discrete_Random;\\n\\nprocedure NumberReverse is\\n\\n subtype RandRange is Integer range 1..9;\\n type NumArrayType is array (Integer range 1..9) of Integer;\\n\\n package RandNumbers is new Ada.Numerics.Discrete_Random(RandRange);\\n use RandNumbers;\\n\\n G : Generator;\\n\\n procedure FillArray (A : in out NumArrayType) is\\n Temp : RandRange;\\n begin\\n A := (others => 0);\\n for I in 1..9 loop\\n Temp := Random(G);\\n while A(Temp) /= 0 loop\\n Temp := Random(G);\\n end loop;\\n A(Temp) := I;\\n end loop;\\n end FillArray;\\n\\n procedure Put(A : in NumArrayType) is\\n begin\\n for I in 1..9 loop\\n Put(A(I), 0);\\n Put(\\\" \\\");\\n end loop;\\n end Put;\\n\\n procedure Prompt (Index : out Integer) is\\n begin\\n New_Line;\\n Put(\\\"How many numbers would you like to reverse: \\\");\\n Get(Index);\\n end Prompt;\\n\\n procedure ReverseArray(Arr : in out NumArrayType;\\n Index : in Integer) is\\n Temp : RandRange;\\n begin\\n for I in 1..Index/2 loop\\n Temp := Arr(I);\\n Arr(I) := Arr(Index + 1 - I);\\n Arr(Index + 1 - I) := Temp;\\n end loop;\\n end ReverseArray;\\n\\n Sorted : constant NumArrayType := (1,2,3,4,5,6,7,8,9);\\n Arr : NumArrayType;\\n Index : Integer;\\n Count : Integer := 0;\\nbegin\\n Reset(G);\\n loop\\n FillArray(Arr);\\n exit when Sorted /= Arr;\\n end loop;\\n loop\\n Put(Arr);\\n Prompt(Index);\\n Count := Count + 1;\\n ReverseArray(Arr, Index);\\n exit when Sorted = Arr;\\n end loop;\\n Put(Arr);\\n New_Line;\\n Put(\\\"Congratulations! You win. It took \\\" &\\n Integer'Image(Count) & \\\" tries.\\\");\\nend NumberReverse;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN # play the number reversal game #\\n\\nCO begin code from the Knuth shuffle task CO\\nPROC between = (INT a, b)INT :\\n(\\n ENTIER (random * ABS (b-a+1) + (a<b|a|b))\\n);\\n\\nPROC knuth shuffle = (REF[]INT a)VOID:\\n(\\n FOR i FROM LWB a TO UPB a DO\\n INT j = between(LWB a, UPB a);\\n INT t = a[i];\\n a[i] := a[j];\\n a[j] := t\\n OD\\n);\\nCO end code from the Knuth shuffle task CO\\n\\n []INT ordered digits = ( 1, 2, 3, 4, 5, 6, 7, 8, 9 );\\n [ 1 : 9 ]INT digits := ordered digits;\\n knuth shuffle( digits );\\n\\n # ignore invalid data in stand in #\\n on value error( stand in, ( REF FILE f )BOOL: TRUE );\\n\\n PROC print digits = VOID: # prints the digits #\\n BEGIN\\n print( ( \\\"The digits are:\\\" ) );\\n FOR i TO 9 DO print( ( whole( digits[ i ], -2 ) ) ) OD;\\n print( ( newline ) )\\n END # print digits # ;\\n\\n OP = = ( []INT a, b )BOOL: # returns TRUE if a = b #\\n IF LWB a /= LWB b OR UPB a /= UPB b THEN\\n FALSE # a and b have different bounds #\\n ELSE\\n # a and b ave the same bounds #\\n BOOL same := TRUE;\\n FOR i FROM LWB a TO UPB a WHILE same DO same := a[ i ] = b[ i ] OD;\\n same\\n FI # = # ;\\n OP /= = ( []INT a, b )BOOL: NOT ( a = b ); # returns TRUE if a not = b #\\n\\n INT count := 0;\\n\\n print digits;\\n WHILE digits /= ordered digits DO\\n print( ( \\\"How many digits to reverse (2-9)? \\\" ) );\\n INT n := 0;\\n read( ( n, newline ) );\\n IF n >= 2 AND n <= 9 THEN\\n # reverse the n left-most digits #\\n count +:= 1;\\n INT r pos := n;\\n FOR pos TO n OVER 2 DO\\n INT t = digits[ r pos ];\\n digits[ r pos ] := digits[ pos ];\\n digits[ pos ] := t;\\n r pos -:= 1\\n OD;\\n print digits\\n FI\\n OD;\\n print( ( newline, \\\"You ordered the digits in \\\", whole( count, 0 ), \\\" moves\\\", newline ) )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"∇numrev;list;in;swaps\\n list←{9?9}⍣{⍺≢⍳9}⊢⍬\\n swaps←0\\nread:\\n swaps+←1\\n in←{⍞←⍵⋄(≢⍵)↓⍞}(⍕list),': swap how many? '\\n list←⌽@(⍳⍎in)⊢list\\n →(list≢⍳9)/read\\n ⎕←(⍕list),': Congratulations!'\\n ⎕←'Swaps:',swaps\\n∇\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \" 100 LET M$ = CHR$ (13)\\n 110 LET A$ = \\\"123456789\\\"\\n 120 FOR S = 0 TO 1 STEP 0\\n 130 LET N$ = A$\\n 140 FOR I = 1 TO 9\\n 150 LET R = INT ( RND (1) * 9 + 1)\\n 160 GOSUB 500SWAP\\n 170 NEXT I\\n 180 LET S = N$ < > A$\\n 190 NEXT S\\n 200 FOR S = 1 TO 1E9\\n 210 PRINT M$\\\"HOW MANY DIGITS \\\"N$M$\\\" FROM THE LEFT ^^^^^^^^^\\\"M$\\\" TO REVERSE? \\\"A$\\n 230 INPUT \\\"--------------> \\\";N%\\n 300 FOR I = 1 TO INT (N% / 2)\\n 310 LET R = N% - I + 1\\n 320 GOSUB 500SWAP\\n 330 NEXT I\\n 340 IF N$ = A$ THEN PRINT M$\\\"SCORE \\\"S;: END\\n 350 NEXT S\\n 500 LET I$ = MID$ (N$,I,1)\\n 510 LET N$ = MID$ (N$,1,I - 1) + MID$ (N$,R,1) + MID$ (N$,I + 1)\\n 520 LET N$ = MID$ (N$,1,R - 1) + I$ + MID$ (N$,R + 1)\\n 530 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"arr: 1..9\\n\\nwhile [arr = sort arr]->\\n arr: shuffle arr\\n\\nscore: 0\\nwhile [arr <> sort arr][\\n prints [arr \\\"-- \\\"]\\n digits: to :integer strip input \\\"How many digits to reverse? \\\"\\n arr: (reverse slice arr 0 digits-1) ++ slice arr digits (size arr)-1\\n score: score + 1\\n]\\n\\nprint [\\\"Your score:\\\" score]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"print '# Number reversal game'\\n\\nvar data, trials = list(1..9), 0\\n\\nwhile data == sort data:\\n random.shuffle data\\n\\nwhile data != sort data:\\n trials += 1\\n flip = int input '#${trials}: LIST: ${join data} Flip how many?: '\\n data[:flip] = reverse data[:flip]\\n\\nprint '\\\\nYou took ${trials} attempts to put digits in order!'\\n\",\n \"language\": \"Astro\"\n },\n {\n \"code\": \"; Submitted by MasterFocus --- http://tiny.cc/iTunis\\n\\nScrambledList := CorrectList := \\\"1 2 3 4 5 6 7 8 9\\\" ; Declare two identical correct sequences\\nWhile ( ScrambledList = CorrectList )\\n Sort, ScrambledList, Random D%A_Space% ; Shuffle one of them inside a While-loop to ensure it's shuffled\\n\\nAttempts := 0\\nWhile ( ScrambledList <> CorrectList ) ; Repeat until the sequence is correct\\n{\\n InputBox, EnteredNumber, Number Reversal Game, Attempts so far: %Attempts%`n`nCurrent sequence: %ScrambledList%`n`nHow many numbers (from the left) should be flipped?, , 400, 200\\n If ErrorLevel\\n ExitApp ; Exit if user presses ESC or Cancel\\n If EnteredNumber is not integer\\n Continue ; Discard attempt if entered number is not an integer\\n If ( EnteredNumber <= 1 )\\n Continue ; Discard attempt if entered number is <= 1\\n Attempts++ ; Increase the number of attempts\\n ; Reverse the first part of the string and add the second part\\n ; The entered number is multiplied by 2 to deal with the spaces\\n ScrambledList := Reverse(SubStr(ScrambledList,1,(EnteredNumber*2)-1)) SubStr(ScrambledList,EnteredNumber*2)\\n}\\n\\nMsgBox, You took %Attempts% attempts to get the correct sequence. ; Final message\\n\\nReturn\\n\\n;-------------------\\n\\nReverse(Str) ; Auxiliar function (flips a string)\\n{\\n Loop, Parse, Str\\n Out := A_LoopField Out\\n Return Out\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n\\tprint \\\"\\\\nWelcome to the number reversal game!\\\\n\\\"\\n\\n\\tprint \\\"You must put the numbers in order from 1 to 9.\\\"\\n\\tprint \\\"Your only moves are to reverse groups of numbers\\\"\\n\\tprint \\\"on the left side of the list.\\\"\\n\\n\\tnewgame()\\n\\tprompt()\\n}\\n\\n# start a new game\\nfunction newgame( i, j, t) {\\n\\t# score = number of moves\\n\\tscore = 0\\n\\n\\t# list = list of numbers\\n\\tsplit(\\\"123456789\\\", list, \\\"\\\")\\n\\tdo {\\n\\t\\t# Knuth shuffle\\n\\t\\tfor (i = 9; i > 1; i--) {\\n\\t\\t\\tj = int(i * rand()) + 1\\n\\t\\t\\tt = list[i]\\n\\t\\t\\tlist[i] = list[j]\\n\\t\\t\\tlist[j] = t\\n\\t\\t}\\n\\t} while (win())\\n}\\n\\n# numbers in order?\\nfunction win( i) {\\n\\t# check if list[1] == 1, list[2] == 2, ...\\n\\tfor (i = 1; i <= 9; i++) if (list[i] != i) return 0\\n\\treturn 1\\n}\\n\\n# user prompt\\nfunction prompt( i) {\\n\\tprintf \\\"\\\\nYour list: \\\"\\n\\tfor (i = 1; i < 9; i++) printf \\\"%d, \\\", list[i]\\n\\tprintf \\\"%d\\\\n\\\", list[9]\\n\\n\\tif (win()) {\\n\\t\\tprint \\\"YOU WIN!\\\"\\n\\t\\tprintf \\\"Your score is %d moves.\\\\n\\\", score\\n\\t\\tprintf \\\"Would you like to play again (y/n)? \\\"\\n\\t\\tagain = 1\\n\\t} else {\\n\\t\\tprintf \\\"How many numbers to reverse? \\\"\\n\\t}\\n}\\n\\n# user input in $1\\n{\\n\\tif (again) {\\n\\t\\tagain = 0\\n\\t\\tif (tolower(substr($1, 1, 1)) == \\\"y\\\")\\n\\t\\t\\tnewgame()\\n\\t\\telse\\n\\t\\t\\texit\\n\\t} else {\\n\\t\\tscore += 1\\n\\t\\treverse($1)\\n\\t}\\n\\tprompt()\\n}\\n\\nfunction reverse(right, left, t) {\\n\\tleft = 1\\n\\twhile (right > left) {\\n\\t\\tt = list[left]\\n\\t\\tlist[left] = list[right]\\n\\t\\tlist[right] = t\\n\\t\\tleft++\\n\\t\\tright--\\n\\t}\\n}\\n\\nEND { print \\\"\\\\n\\\\nBye!\\\" }\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"PRINT \\\"Given a jumbled list of the numbers 1 to 9,\\\"\\nPRINT \\\"you must select how many digits from the left to reverse.\\\"\\nPRINT \\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\"\\n\\nRANDOMIZE TIMER\\n\\nDIM nums(1 TO 9) AS INTEGER\\nDIM L0 AS INTEGER, n AS INTEGER, flp AS INTEGER, tries AS INTEGER, again AS INTEGER\\n\\n'initial values\\nFOR L0 = 1 TO 9\\n nums(L0) = L0\\nNEXT\\n\\nDO 'shuffle\\n FOR L0 = 9 TO 2 STEP -1\\n n = INT(RND * (L0)) + 1\\n IF n <> L0 THEN SWAP nums(n), nums(L0)\\n NEXT\\n FOR L0 = 1 TO 8 'make sure it's not in order\\n IF nums(L0) > nums(L0 + 1) THEN EXIT DO\\n NEXT\\nLOOP\\n\\nagain = -1\\nDO\\n IF tries < 10 THEN PRINT \\\" \\\";\\n PRINT tries; \\\":\\\";\\n FOR L0 = 1 TO 9\\n PRINT nums(L0);\\n NEXT\\n\\n IF NOT again THEN EXIT DO\\n\\n INPUT \\\" -- How many numbers should be flipped\\\"; flp\\n IF flp < 0 THEN flp = 0\\n IF flp > 9 THEN flp = 0\\n\\n FOR L0 = 1 TO (flp \\\\ 2)\\n SWAP nums(L0), nums(flp - L0 + 1)\\n NEXT\\n\\n again = 0\\n 'check for order\\n FOR L0 = 1 TO 8\\n IF nums(L0) > nums(L0 + 1) THEN\\n again = -1\\n EXIT FOR\\n END IF\\n NEXT\\n\\n IF flp > 0 THEN tries = tries + 1\\nLOOP\\n\\nPRINT : PRINT \\\"You took \\\"; LTRIM$(RTRIM$(STR$(tries))); \\\" tries to put the digits in order.\\\"\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"print \\\"Dada una lista aleatoria de numeros del 1 al 9,\\\"\\nprint \\\"indica cuantos digitos de la izquierda voltear.\\\"\\nprint \\\" El objetivo es obtener los digitos en orden \\\"\\nprint \\\" con el 1 a la izquierda y el 9 a la derecha.\\\" + chr(10)\\n\\ndim nums(10)\\ndim a(10)\\nintentos = 0: denuevo = true: colum = 6\\n\\n#valores iniciales\\nfor i = 1 to 9\\n\\tnums[i] = i\\nnext i\\n\\ndo #barajamos\\n\\tfor i = 9 to 2 step -1\\n\\t\\tn = int(rand * i) + 1\\n\\t\\tif n <> i then\\n\\t\\t\\ta[i] = nums[i]\\n\\t\\t\\tnums[i] = nums[n]\\n\\t\\t\\tnums[n] = a[i]\\n\\t\\tend if\\n\\tnext i\\n\\tfor i = 1 to 8 #nos aseguramos que no estén en orden\\n\\t\\tif nums[i] > nums[i + 1] then exit do\\n\\tnext i\\nuntil false\\n\\ndo\\n\\tif intentos < 10 then print \\\" \\\";\\n\\tprint intentos; \\\": \\\";\\n\\tfor i = 1 to 9\\n\\t\\tprint nums[i];\\\" \\\";\\n\\tnext i\\n\\n\\tif not denuevo then exit do\\n\\n\\tinput \\\" -- Cuantos volteamos \\\", volteo\\n\\tif volteo < 0 or volteo > 9 then volteo = 0\\n\\n\\tfor i = 1 to (volteo \\\\ 2)\\n\\t\\ta[i] = nums[volteo - i + 1]\\n\\t\\tnums[volteo - i + 1] = nums[i]\\n\\t\\tnums[i] = a[i]\\n\\tnext i\\n\\n\\tdenuevo = false\\n\\t#comprobamos el orden\\n\\tfor i = 1 to 8\\n\\t\\tif nums[i] > nums[i + 1] then\\n\\t\\t\\tdenuevo = true\\n\\t\\t\\texit for\\n\\t\\tend if\\n\\tnext i\\n\\n\\tif volteo > 0 then intentos += 1\\nuntil false\\nprint chr(10) + chr(10) + \\\" Necesitaste \\\"; intentos; \\\" intentos.\\\"\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"::\\n::Number Reversal Game Task from Rosetta Code Wiki\\n::Batch File Implementation\\n::\\n::Please do not open this from command prompt.\\n::Directly Open the Batch File to play...\\n::\\n\\n@echo off\\nsetlocal enabledelayedexpansion\\ntitle Number Reversal Game\\n\\n:begin\\nset score=0\\n\\n::The ascending list of 9 digits\\nset list=123456789\\n\\n\\n::Generating a random set of 9 digits...\\nset cyc=9\\n:gen\\nset /a tmp1=%random%%%%cyc%\\nset n%cyc%=!list:~%tmp1%,1!\\nset tmp2=!n%cyc%!\\nset list=!list:%tmp2%=!\\nif not %cyc%==2 (\\n\\tset /a cyc-=1\\n\\tgoto :gen\\n)\\nset /a n1=%list%\\n\\n::Display the Game\\ncls\\necho.\\necho ***Number Reversal Game***\\n:loopgame\\necho.\\necho Current arrangement: %n1%%n2%%n3%%n4%%n5%%n6%%n7%%n8%%n9%\\nset /p move=How many digits from the left should I reverse?\\n\\n::Reverse digits according to the player's input\\n::NOTE: The next command uses the fact that in Batch File,\\n::The output for the division operation is only the integer part of the quotient.\\nset /a lim=(%move%+1)/2\\n\\nset cyc2=1\\n:reverse\\nset /a tmp4=%move%-%cyc2%+1\\nset tmp5=!n%cyc2%!\\nset n%cyc2%=!n%tmp4%!\\nset n%tmp4%=%tmp5%\\nif not %cyc2%==%lim% (\\n\\tset /a cyc2+=1\\n\\tgoto :reverse\\n)\\n\\n::Increment the number of moves took by the player\\nset /a score+=1\\n\\n::IF already won...\\nif %n1%%n2%%n3%%n4%%n5%%n6%%n7%%n8%%n9%==123456789 (\\n\\techo.\\n\\techo Set: %n1%%n2%%n3%%n4%%n5%%n6%%n7%%n8%%n9% DONE^^!\\n\\techo You took %score% moves to arrange the numbers in ascending order.\\n\\tpause>nul\\n\\texit\\n) else (\\ngoto :loopgame\\n)\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" DIM list%(8), done%(8), test%(8)\\n list%() = 1, 2, 3, 4, 5, 6, 7, 8, 9\\n done%() = list%()\\n\\n REM Shuffle:\\n REPEAT\\n FOR i% = 9 TO 2 STEP -1\\n SWAP list%(i%-1), list%(RND(i%)-1)\\n NEXT\\n test%() = list%() - done%()\\n UNTIL MOD(test%()) <> 0\\n\\n REM Run the game:\\n tries% = 0\\n REPEAT\\n tries% += 1\\n FOR i% = 0 TO 8 : PRINT ; list%(i%) \\\" \\\" ; : NEXT\\n INPUT \\\": Reverse how many\\\", n%\\n PROCreverse(list%(), n%)\\n test%() = list%() - done%()\\n UNTIL MOD(test%()) = 0\\n PRINT \\\"You took \\\" ; tries% \\\" attempts.\\\"\\n END\\n\\n DEF PROCreverse(a%(), n%)\\n IF n% < 2 ENDPROC\\n LOCAL i%\\n n% -= 1\\n FOR i% = 0 TO n% DIV 2\\n SWAP a%(i%), a%(n%-i%)\\n NEXT\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"sorted = 1.to 9\\nlength = sorted.length\\nnumbers = sorted.shuffle\\n\\n#Make certain numbers are shuffled\\ntrue? numbers == sorted\\n { while { sorted == numbers.shuffle! } }\\n\\nturns = 0\\n\\nwhile { numbers != sorted } {\\n print \\\"#{numbers} - How many to reverse? \\\"\\n num = g.to_i\\n numbers = numbers[0, num - 1].reverse + numbers[num, length]\\n turns = turns + 1\\n}\\n\\np numbers\\np \\\"It took #{turns} turns to sort numbers.\\\"\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"void number_reversal_game()\\n{\\n printf(\\\"Number Reversal Game. Type a number to flip the first n numbers.\\\");\\n printf(\\\"Win by sorting the numbers in ascending order.\\\\n\\\");\\n printf(\\\"Anything besides numbers are ignored.\\\\n\\\");\\n printf(\\\"\\\\t |1__2__3__4__5__6__7__8__9|\\\\n\\\");\\n int list[9] = {1,2,3,4,5,6,7,8,9};\\n shuffle_list(list,9);\\n\\n int tries=0;\\n unsigned int i;\\n int input;\\n\\n while(!check_array(list, 9))\\n {\\n ((tries<10) ? printf(\\\"Round %d : \\\", tries) : printf(\\\"Round %d : \\\", tries));\\n for(i=0;i<9;i++)printf(\\\"%d \\\",list[i]);\\n printf(\\\" Gimme that number:\\\");\\n while(1)\\n {\\n //Just keep asking for proper input\\n scanf(\\\"%d\\\", &input);\\n if(input>1&&input<10)\\n break;\\n\\n printf(\\\"\\\\n%d - Please enter a number between 2 and 9:\\\", (int)input);\\n }\\n tries++;\\n do_flip(list, 9, input);\\n }\\n printf(\\\"Hurray! You solved it in %d moves!\\\\n\\\", tries);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"void shuffle_list(int *list, int len)\\n{\\n //We'll just be swapping 100 times. Could be more/less. Doesn't matter much.\\n int n=100;\\n int a=0;\\n int b=0;\\n int buf = 0;\\n //Random enough for common day use..\\n srand(time(NULL));\\n while(n--)\\n {\\n //Get random locations and swap\\n a = rand()%len;\\n b = rand()%len;\\n buf = list[a];\\n list[a] = list[b];\\n list[b] = buf;\\n }\\n // \\\"shuffled to ordered state\\\" fix:\\n if (check_array(list, len)) shuffle_list (list, len);\\n}\\n\\nvoid do_flip(int *list, int length, int num)\\n{\\n //Flip a part on an array\\n int swap;\\n int i=0;\\n for(i;i<--num;i++)\\n {\\n swap=list[i];\\n list[i]=list[num];\\n list[num]=swap;\\n }\\n}\\n\\nint check_array(int *arr, int len)\\n{\\n while(--len)\\n {\\n if(arr[len]!=(arr[len-1]+1))\\n return 0;\\n }\\n return 1;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"void number_reversal_game()\\n{\\n\\tcout << \\\"Number Reversal Game. Type a number to flip the first n numbers.\\\";\\n\\tcout << \\\"You win by sorting the numbers in ascending order.\\\";\\n\\tcout << \\\"Anything besides numbers are ignored.\\\\n\\\";\\n\\tcout << \\\"\\\\t |1__2__3__4__5__6__7__8__9|\\\\n\\\";\\n\\tint list[9] = {1,2,3,4,5,6,7,8,9};\\n do\\n {\\n\\t shuffle_list(list,9);\\n } while(check_array(list, 9));\\n\\n\\tint tries=0;\\n\\tunsigned int i;\\n\\tint input;\\n\\n\\twhile(!check_array(list, 9))\\n\\t{\\n\\t\\tcout << \\\"Round \\\" << tries << ((tries<10) ? \\\" : \\\" : \\\" : \\\");\\n\\t\\tfor(i=0;i<9;i++)cout << list[i] << \\\" \\\";\\n\\t\\tcout << \\\" Gimme that number:\\\";\\n\\t\\twhile(1)\\n\\t\\t{\\n\\t\\t\\tcin >> input;\\n\\t\\t\\tif(input>1&&input<10)\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcout << \\\"\\\\nPlease enter a number between 2 and 9:\\\";\\n\\t\\t}\\n\\t\\ttries++;\\n\\t\\tdo_flip(list, 9, input);\\n\\t}\\n\\tcout << \\\"Hurray! You solved it in %d moves!\\\\n\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <algorithm>\\n#include <functional>\\n#include <iterator>\\n#include <cstdlib>\\n#include <ctime>\\n\\ntemplate<typename T, int size>\\n bool is_sorted(T (&array)[size])\\n{\\n return std::adjacent_find(array, array+size, std::greater<T>())\\n == array+size;\\n}\\n\\nint main()\\n{\\n std::srand(std::time(0));\\n\\n int list[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };\\n\\n do\\n {\\n std::random_shuffle(list, list+9);\\n } while (is_sorted(list));\\n\\n int score = 0;\\n\\n do\\n {\\n std::cout << \\\"Current list: \\\";\\n std::copy(list, list+9, std::ostream_iterator<int>(std::cout, \\\" \\\"));\\n\\n int rev;\\n while (true)\\n {\\n std::cout << \\\"\\\\nDigits to reverse? \\\";\\n std::cin >> rev;\\n if (rev > 1 && rev < 10)\\n break;\\n std::cout << \\\"Please enter a value between 2 and 9.\\\";\\n }\\n\\n ++score;\\n std::reverse(list, list + rev);\\n } while (!is_sorted(list));\\n\\n std::cout << \\\"Congratulations, you sorted the list.\\\\n\\\"\\n << \\\"You needed \\\" << score << \\\" reversals.\\\" << std::endl;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"// Written by Katsumi -- twitter.com/realKatsumi_vn\\n// Compile with: g++ -std=c++20 -Wall -Wextra -pedantic NumberReversal.cpp -o NumberReversal\\n#include <iostream>\\n#include <algorithm>\\n#include <utility>\\n#include <functional>\\n#include <iterator>\\n#include <random>\\n#include <vector>\\n#include <string>\\n\\ntemplate <class T>\\nbool Sorted(std::vector<T> list) {\\n return std::adjacent_find(list.begin(), list.end(), std::greater<T>()) == list.end();\\n}\\n\\ntemplate <class T>\\nstd::string VectorRepr(std::vector<T> list) {\\n auto Separate = [](std::string a, int b) {\\n return std::move(a) + \\\", \\\" + std::to_string(b);\\n };\\n return std::accumulate(std::next(list.begin()), list.end(), std::to_string(list[0]), Separate);\\n}\\n\\nint main() {\\n const std::string IntroText = \\\"NUMBER REVERSAL GAME\\\\n\\\"\\n \\\"based on a \\\\\\\"task\\\\\\\" on Rosetta Code -- rosettacode.org\\\\n\\\"\\n \\\"by Katsumi -- twitter.com/realKatsumi.vn\\\\n\\\\n\\\";\\n\\n // Don't ever write this s**tty code...\\n // std::srand(std::time(0));\\n // Do this instead:\\n std::random_device Device;\\n std::mt19937_64 Generator(Device());\\n\\n std::vector<int> List = {1, 2, 3, 4, 5, 6, 7, 8, 9};\\n std::shuffle(List.begin(), List.end(), Generator);\\n\\n std::cout << IntroText;\\n\\n int Moves, PlayerInput;\\n while (!Sorted(List)) {\\n std::cout << \\\"Current list: [\\\" << VectorRepr(List) << \\\"]\\\\n\\\"\\n \\\"Digits to reverse? (2-9) \\\";\\n while (true) {\\n std::cin >> PlayerInput;\\n if (PlayerInput < 2 || PlayerInput > 9)\\n std::cout << \\\"Please enter a value between 2 and 9.\\\\n\\\"\\n \\\"Digits to reverse? (2-9) \\\";\\n else\\n break;\\n }\\n\\n std::reverse(List.begin(), List.begin()+PlayerInput);\\n ++Moves;\\n }\\n\\n std::cout << \\\"Yay! You sorted the list! You've made \\\" << Moves << \\\" moves.\\\\n\\\";\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nclass Program\\n{\\n static void Main(string[] args)\\n {\\n var r = new Random();\\n\\n var tries = 1;\\n var sorted = Enumerable.Range(1, 9).ToList();\\n var values = sorted.OrderBy(x => r.Next(-1, 1)).ToList();\\n\\n while (Enumerable.SequenceEqual(sorted, values)) {\\n values = sorted.OrderBy(x => r.Next(-1, 1)).ToList();\\n }\\n\\n //values = \\\"1 3 9 2 7 5 4 8 6\\\".Split().Select(x => int.Parse(x)).ToList();\\n\\n while (!Enumerable.SequenceEqual(sorted, values))\\n {\\n Console.Write(\\\"# {0}: LIST: {1} - Flip how many? \\\", tries, String.Join(\\\" \\\", values));\\n\\n values.Reverse(0, int.Parse(Console.ReadLine()));\\n tries += 1;\\n }\\n\\n Console.WriteLine(\\\"\\\\nYou took {0} attempts to put the digits in order!\\\", tries - 1);\\n Console.ReadLine();\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"class Program\\n{\\n\\tstatic void Main(string[] args)\\n\\t{\\n\\t\\tint[] values = new int[9];\\n\\t\\tRandom tRandom = new Random();\\n\\t\\tint tries = 0;\\n\\n\\t\\tfor (int x = 0; x < values.Length; x++)\\n\\t\\t{\\n\\t\\t\\tvalues[x] = x + 1;\\n\\t\\t}\\n\\n\\t\\tvalues = RandomPermutation<int>(values);\\n\\n\\t\\tdo\\n\\t\\t{\\n\\t\\t\\tConsole.Write(\\\"Numbers: \\\");\\n\\t\\t\\tfor (int x = 0; x < values.Length; x++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tConsole.Write(\\\" \\\");\\n\\t\\t\\t\\tConsole.Write(values[x]);\\n\\t\\t\\t}\\n\\t\\t\\tConsole.WriteLine(\\\". Enter number of numbers from the left to reverse: \\\");\\n\\n\\t\\t\\tstring tIn = \\\"\\\";\\n\\t\\t\\tdo\\n\\t\\t\\t{\\n\\t\\t\\t\\ttIn = Console.ReadLine();\\n\\t\\t\\t} while (tIn.Length != 1);\\n\\n\\t\\t\\tint nums = Convert.ToInt32(tIn.ToString());\\n\\n\\t\\t\\tint[] newValues = new int[9];\\n\\t\\t\\tfor (int x = nums; x < newValues.Length; x++)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// Move those not reversing\\n\\t\\t\\t\\tnewValues[x] = values[x];\\n\\t\\t\\t}\\n\\t\\t\\tfor (int x = 0; x < nums; x++)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// Reverse the rest\\n\\t\\t\\t\\tnewValues[x] = values[nums - 1 - x];\\n\\t\\t\\t}\\n\\t\\t\\tvalues = newValues;\\n\\t\\t\\ttries++;\\n\\t\\t} while (!check(values));\\n\\n\\t\\tConsole.WriteLine(\\\"Success!\\\");\\n\\t\\tConsole.WriteLine(\\\"Attempts: \\\" + tries);\\n\\n\\t\\tConsole.Read();\\n\\t}\\n\\n\\tpublic static bool check(int[] p)\\n\\t{\\n\\t\\t// Check all items\\n\\t\\tfor (int x = 0; x < p.Length - 1; x++)\\n\\t\\t{\\n\\t\\t\\tif (p[x + 1] <= p[x])\\n\\t\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\treturn true;\\n\\t}\\n\\n\\tpublic static T[] RandomPermutation<T>(T[] array)\\n\\t{\\n\\t\\tT[] retArray = new T[array.Length];\\n\\t\\tarray.CopyTo(retArray, 0);\\n\\n\\t\\tRandom random = new Random();\\n\\t\\tfor (int i = 0; i < array.Length; i += 1)\\n\\t\\t{\\n\\t\\t\\tint swapIndex = random.Next(i, array.Length);\\n\\t\\t\\tif (swapIndex != i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tT temp = retArray[i];\\n\\t\\t\\t\\tretArray[i] = retArray[swapIndex];\\n\\t\\t\\t\\tretArray[swapIndex] = temp;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn retArray;\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn flip-at [n coll]\\n (let [[x y] (split-at n coll)]\\n (concat (reverse x) y )))\\n\\n(def sorted '(1 2 3 4 5 6 7 8 9)) ; i.e. (range 1 10)\\n(def unsorted? #(not= % sorted))\\n\\n(loop [unsorted (first (filter unsorted? (iterate shuffle sorted))), steps 0]\\n (if (= unsorted sorted)\\n (printf \\\"Done! That took you %d steps%n\\\" steps)\\n (do\\n (println unsorted)\\n (printf \\\"Reverse how many? \\\")\\n (flush)\\n (let [flipcount (read)]\\n (recur (flip-at flipcount unsorted), (inc steps))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"% This program uses the random number generator from PCLU's\\n% 'misc.lib'\\n\\n% Shuffle the given array. Every item ends up in a different place,\\n% so if given the numbers in ascending order, it is guaranteed that\\n% they will not still be in ascending order at the end.\\njumble = proc [T: type] (a: array[T])\\n for i: int in int$from_to_by(array[T]$high(a), array[T]$low(a)+1, -1) do\\n j: int := array[T]$low(a) + random$next(i - array[T]$low(a))\\n x: T := a[i]\\n a[i] := a[j]\\n a[j] := x\\n end\\nend jumble\\n\\n% Is the array sorted?\\nwin = proc (a: array[int]) returns (bool)\\n for i: int in array[int]$indexes(a) do\\n if i ~= a[i] then return(false) end\\n end\\n return(true)\\nend win\\n\\n% Reverse the first N items of the array\\nreverse = proc (n: int, a: array[int])\\n for i: int in int$from_to(1, n/2) do\\n j: int := n-i+1\\n x: int := a[j]\\n a[j] := a[i]\\n a[i] := x\\n end\\nend reverse\\n\\n% Play the game\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n pi: stream := stream$primary_input()\\n d: date := now()\\n random$seed(d.second + 60*(d.minute + 60*d.hour))\\n score: int := 0\\n nums: array[int] := array[int]$[1,2,3,4,5,6,7,8,9]\\n jumble[int](nums)\\n while ~win(nums) do\\n for i: int in array[int]$elements(nums) do\\n stream$puts(po, int$unparse(i))\\n end\\n stream$puts(po, \\\": reverse how many? \\\")\\n n: int := int$parse(stream$getl(pi))\\n reverse(n, nums)\\n score := score + 1\\n end\\n for i: int in array[int]$elements(nums) do\\n stream$puts(po, int$unparse(i))\\n end\\n stream$putl(po, \\\"\\\\nScore = \\\" || int$unparse(score))\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. REVERSAL.\\n AUTHOR. Bill Gunshannon\\n INSTALLATION. Home.\\n DATE-WRITTEN. 11 December 2021\\n ****************************************************************\\n ** Program Abstract:\\n ** Use a Knuth Shuffle to reate our out ot sort array.\\n ** Use a procedure called \\\"reverse\\\" to pancake sort the array.\\n ****************************************************************\\n\\n DATA DIVISION.\\n WORKING-STORAGE SECTION.\\n\\n 01 RNUM PIC 9.\\n 01 TRIES PIC 99 VALUE 0.\\n 01 ANSWER PIC 9(9) VALUE 123456789.\\n 01 TBL-LEN PIC 9 VALUE 9.\\n 01 TBL.\\n 05 TZ PIC 9(9).\\n 05 TA REDEFINES TZ\\n PIC 9 OCCURS 9 TIMES.\\n\\n PROCEDURE DIVISION.\\n\\n MAIN-pROGRAM.\\n MOVE ANSWER TO TBL\\n\\n CALL 'KNUTH-SHUFFLE'\\n USING BY REFERENCE TBL\\n END-CALL.\\n\\n DISPLAY \\\"TABLE after shuffle: \\\" TBL.\\n\\n PERFORM UNTIL TBL = ANSWER\\n ADD 1 TO TRIES\\n DISPLAY \\\"How many to reverse? \\\"\\n ACCEPT RNUM\\n\\n CALL 'REVERSE' USING BY CONTENT RNUM,\\n BY REFERENCE TBL\\n END-CALL\\n\\n DISPLAY \\\"Try #\\\" TRIES \\\" \\\" TBL\\n END-PERFORM.\\n DISPLAY \\\"Congratulations. You did it!\\\"\\n\\n STOP RUN.\\n END PROGRAM REVERSAL.\\n\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. KNUTH-SHUFFLE.\\n\\n DATA DIVISION.\\n LOCAL-STORAGE SECTION.\\n 01 I PIC 9(9).\\n 01 J PIC 9(9).\\n 01 TEMP PIC 9(9).\\n 01 tABLE-lEN PIC 9 value 9.\\n\\n LINKAGE SECTION.\\n 01 TTABLE-AREA.\\n 03 TTABLE PIC 9 OCCURS 9 TIMES.\\n\\n PROCEDURE DIVISION USING ttable-area.\\n MOVE FUNCTION RANDOM(FUNCTION CURRENT-DATE (11:6)) TO I\\n\\n PERFORM VARYING i FROM Table-Len BY -1 UNTIL i = 0\\n COMPUTE j =\\n FUNCTION MOD(FUNCTION RANDOM * 10000, Table-Len) + 1\\n\\n MOVE ttable (i) TO temp\\n MOVE ttable (j) TO ttable (i)\\n MOVE temp TO ttable (j)\\n END-PERFORM.\\n\\n GOBACK.\\n END PROGRAM KNUTH-SHUFFLE.\\n\\n\\n IDENTIFICATION DIVISION.\\n PROGRAM-ID. REVERSE.\\n\\n DATA DIVISION.\\n LOCAL-STORAGE SECTION.\\n 01 I PIC 9.\\n 01 J PIC 9.\\n 01 X PIC 9.\\n 01 LOOP-IDX PIC 9.\\n\\n\\n LINKAGE SECTION.\\n 01 IDX PIC 9.\\n 01 TTABLE-AREA.\\n 03 TTABLE PIC 9 OCCURS 9 TIMES.\\n\\n PROCEDURE DIVISION USING IDX, TTABLE-AREA.\\n\\n DIVIDE IDX BY 2 GIVING LOOP-IDx\\n\\n\\n MOVE 1 TO I\\n MOVE IDX TO J\\n\\n PERFORM LOOP-IDX TIMES\\n MOVE TTABLE(I) TO X\\n MOVE TTABLE(J) TO TTABLE(I)\\n MOVE X TO TTABLE(J)\\n ADD 1 TO I\\n SUBTRACT 1 FROM J\\n END-PERFORM.\\n\\n GOBACK.\\n END PROGRAM REVERSE.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun shuffle! (vector)\\n (loop for i from (1- (length vector)) downto 1\\n do (rotatef (aref vector i)\\n (aref vector (random i)))))\\n\\n(defun slice (vector start &optional end)\\n (let ((end (or end (length vector))))\\n (make-array (- end start)\\n :element-type (array-element-type vector)\\n :displaced-to vector\\n :displaced-index-offset start)))\\n\\n(defun orderedp (seq)\\n (apply #'<= (coerce seq 'list)))\\n\\n(defun prompt-integer (prompt)\\n (format t \\\"~A: \\\" prompt)\\n (finish-output)\\n (clear-input)\\n (parse-integer (read-line)))\\n\\n(defun game ()\\n (let ((numbers (vector 1 2 3 4 5 6 7 8 9)))\\n (shuffle! numbers)\\n (let ((score\\n (do ((score 0 (1+ score)))\\n ((orderedp numbers) score)\\n (format t \\\"~A~%\\\" numbers)\\n (let* ((n (prompt-integer \\\"How many numbers to reverse\\\"))\\n (slice (slice numbers 0 n)))\\n (replace slice (nreverse slice))))))\\n (format t \\\"~A~%Congratulations, you did it in ~D reversals!~%\\\" numbers score))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"SIZE = 9\\nordered = (1..SIZE).to_a\\nshuffled = (1..SIZE).to_a\\n\\nwhile shuffled == ordered\\n shuffled.shuffle!\\nend\\n\\nscore = 0\\nuntil shuffled == ordered\\n print \\\"#{shuffled} Enter items to reverse: \\\"\\n\\n next unless guess = gets\\n next unless num = guess.to_i?\\n next if num < 2 || num > SIZE\\n\\n shuffled[0, num] = shuffled[0, num].reverse\\n score += 1\\nend\\n\\nputs \\\"#{shuffled} Your score: #{score}\\\"\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.stdio, std.random, std.string, std.conv, std.algorithm,\\n std.range;\\n\\nvoid main() {\\n auto data = iota(1, 10).array;\\n do data.randomShuffle;\\n while (data.isSorted);\\n\\n int trial;\\n while (!data.isSorted) {\\n writef(\\\"%d: %s How many numbers to flip? \\\", ++trial, data);\\n data[0 .. readln.strip.to!uint].reverse;\\n }\\n writefln(\\\"\\\\nYou took %d attempts.\\\", trial);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"type TKeyWaiter = class(TObject)\\n private\\n FControl: TWinControl;\\n protected\\n procedure HandleKeyPress(Sender: TObject; var Key: Char);\\n public\\n KeyChar: Char;\\n ValidKey: boolean;\\n Abort: boolean;\\n constructor Create(Control: TWinControl);\\n function WaitForKey: char;\\n end;\\n\\n{ TMemoWaiter }\\n\\ntype TControlHack = class(TWinControl) end;\\n\\nconstructor TKeyWaiter.Create(Control: TWinControl);\\n{Save the control we want to wait on}\\nbegin\\nFControl:=Control;\\nend;\\n\\nprocedure TKeyWaiter.HandleKeyPress(Sender: TObject; var Key: Char);\\n{Handle captured key press}\\nbegin\\nKeyChar:=Key;\\nValidKey:=True;\\nend;\\n\\n\\nfunction TKeyWaiter.WaitForKey: char;\\n{Capture keypress event and wait for key press control}\\n{Spends most of its time sleep and aborts if the user}\\n{sets the abort flag or the program terminates}\\nbegin\\nValidKey:=False;\\nAbort:=False;\\nTControlHack(FControl).OnKeyPress:=HandleKeyPress;\\nrepeat\\n\\tbegin\\n\\tApplication.ProcessMessages;\\n\\tSleep(100);\\n\\tend\\nuntil ValidKey or Application.Terminated or Abort;\\nResult:=KeyChar;\\nend;\\n\\n\\n\\n\\n{===========================================================}\\n\\ntype TNumbers = array [0..8] of integer;\\n\\nfunction WaitForKey(Memo: TMemo; Prompt: string): char;\\n{Wait for key stroke on TMemo component}\\nvar KW: TKeyWaiter;\\nbegin\\n{Use custom object to wait and capture key strokes}\\nKW:=TKeyWaiter.Create(Memo);\\ntry\\nMemo.Lines.Add(Prompt);\\nMemo.SelStart:=Memo.SelStart-1;\\nMemo.SetFocus;\\nResult:=KW.WaitForKey;\\nfinally KW.Free; end;\\nend;\\n\\n\\nprocedure ScrambleNumbers(var Numbers: TNumbers);\\n{Scramble numbers into a random order}\\nvar I,I1,I2,T: integer;\\nbegin\\nfor I:=0 to 8 do Numbers[I]:=I+1;\\nfor I:=1 to 100 do\\n\\tbegin\\n\\tI1:=Random(9);\\n\\tI2:=Random(9);\\n\\tT:=Numbers[I1];\\n\\tNumbers[I1]:=Numbers[I2];\\n\\tNumbers[I2]:=T;\\n\\tend;\\nend;\\n\\nfunction GetNumbersStr(Numbers: TNumbers): string;\\n{Return number order as a string}\\nvar I: integer;\\nbegin\\nResult:='';\\nfor I:=0 to High(Numbers) do\\n\\tbegin\\n\\tif I<>0 then Result:=Result+' ';\\n\\tResult:=Result+IntToStr(Numbers[I]);\\n\\tend;\\nend;\\n\\n\\nprocedure ReverseNumbers(var Numbers: TNumbers; Count: integer);\\n{Reverse the specified count of numbers from the start}\\nvar NT: TNumbers;\\nvar I,I1: integer;\\nbegin\\nNT:=Numbers;\\nfor I:=0 to Count-1 do\\n\\tbegin\\n\\tI1:=(Count-1) - I;\\n\\tNumbers[I1]:=NT[I];\\n\\tend;\\nend;\\n\\nfunction IsWinner(Numbers: TNumbers): boolean;\\n{Check if is number is order 1..9}\\nvar I: integer;\\nbegin\\nResult:=False;\\nfor I:=0 to High(Numbers) do\\n if Numbers[I]<>(I+1) then exit;\\nResult:=True;\\nend;\\n\\nprocedure ReverseGame(Memo: TMemo);\\n{Play the reverse game on specified memo}\\nvar C: char;\\nvar Numbers: TNumbers;\\nvar S: string;\\nvar R: integer;\\nbegin\\nRandomize;\\nScrambleNumbers(Numbers);\\nwhile true do\\n\\tbegin\\n\\tS:=GetNumbersStr(Numbers);\\n\\tC:=WaitForKey(Memo,S+' Number To Reverse: ');\\n\\tif Application.Terminated then exit;\\n\\tif C in ['x','X'] then break;\\n\\tR:=byte(C) - $30;\\n\\tReverseNumbers(Numbers,R);\\n\\tif IsWinner(Numbers) then\\n\\t\\tbegin\\n\\t\\tS:=GetNumbersStr(Numbers);\\n\\t\\tMemo.Lines.Add(S+' - WINNER!!');\\n\\t\\tbreak;\\n\\t\\tend;\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"import \\\"prelude.eg\\\"\\nimport \\\"io.ego\\\"\\nimport \\\"random.ego\\\"\\n\\nusing System\\nusing IO\\nusing List\\nusing Math\\n\\ndef swap =\\n [ (I J) XX -> insert I (nth J XX) (insert J (nth I XX) XX) ]\\n\\ndef shuffle =\\n [ XX ->\\n let INDICES = reverse (fromto 0 ((length XX) - 1)) in\\n let SWAPS = map [ I -> I (between 0 I) ] INDICES in\\n foldr [I J -> swap I J] XX SWAPS ]\\n\\ndef prompt =\\n [ XX TURN ->\\n let _ = print TURN \\\". \\\" in\\n let _ = map [ X -> print X \\\" \\\" ] XX in\\n let _ = print \\\" : \\\" in\\n toint getline ]\\n\\ndef game =\\n [ GOAL SHUFFLE TURN ->\\n if SHUFFLE == GOAL then\\n let _ = print \\\"the goal was \\\" in\\n let _ = map [ X -> print X \\\" \\\" ] GOAL in\\n print \\\"\\\\nit took you \\\" TURN \\\" turns\\\\n\\\"\\n else\\n let N = prompt SHUFFLE TURN in\\n let YY = (reverse (take N SHUFFLE)) ++ (drop N SHUFFLE) in\\n game GOAL YY (TURN + 1) ]\\n\\ndef main =\\n let XX = fromto 1 9 in game XX (shuffle XX) 0\\n\",\n \"language\": \"Egel\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE}\\n\\n\\tmake\\n\\t\\t\\t-- Plays Number Reversal Game.\\n\\t\\tlocal\\n\\t\\t\\tcount: INTEGER\\n\\t\\tdo\\n\\t\\t\\tinitialize_game\\n\\t\\t\\tio.put_string (\\\"Let's play the number reversal game.%N\\\")\\n\\t\\t\\tacross\\n\\t\\t\\t\\tnumbers as ar\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (ar.item.out + \\\"%T\\\")\\n\\t\\t\\tend\\n\\t\\t\\tfrom\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tis_sorted (numbers, 1, numbers.count)\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (\\\"%NHow many numbers should be reversed?%N\\\")\\n\\t\\t\\t\\tio.read_integer\\n\\t\\t\\t\\treverse_array (io.last_integer)\\n\\t\\t\\t\\tacross\\n\\t\\t\\t\\t\\tnumbers as ar\\n\\t\\t\\t\\tloop\\n\\t\\t\\t\\t\\tio.put_string (ar.item.out + \\\"%T\\\")\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tcount := count + 1\\n\\t\\t\\tend\\n\\t\\t\\tio.put_string (\\\"%NYou needed \\\" + count.out + \\\" reversals.\\\")\\n\\t\\tend\\n\\nfeature {NONE}\\n\\n\\tinitialize_game\\n\\t\\t\\t-- Array with numbers from 1 to 9 in a random unsorted order.\\n\\t\\tlocal\\n\\t\\t\\trandom: V_RANDOM\\n\\t\\t\\titem, i: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate random\\n\\t\\t\\tcreate numbers.make_empty\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tnumbers.count = 9 and not is_sorted (numbers, 1, numbers.count)\\n\\t\\t\\tloop\\n\\t\\t\\t\\titem := random.bounded_item (1, 9)\\n\\t\\t\\t\\tif not numbers.has (item) then\\n\\t\\t\\t\\t\\tnumbers.force (item, i)\\n\\t\\t\\t\\t\\ti := i + 1\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\trandom.forth\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tnumbers: ARRAY [INTEGER]\\n\\n\\treverse_array (upper: INTEGER)\\n\\t\\t\\t-- Array numbers with first element up to nth element reversed.\\n\\t\\trequire\\n\\t\\t\\tupper_positive: upper > 0\\n\\t\\t\\tar_not_void: numbers /= Void\\n\\t\\tlocal\\n\\t\\t\\ti, j: INTEGER\\n\\t\\t\\tnew_array: ARRAY [INTEGER]\\n\\t\\tdo\\n\\t\\t\\tcreate new_array.make_empty\\n\\t\\t\\tnew_array.deep_copy (numbers)\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 1\\n\\t\\t\\t\\tj := upper\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti > j\\n\\t\\t\\tloop\\n\\t\\t\\t\\tnew_array [i] := numbers [j]\\n\\t\\t\\t\\tnew_array [j] := numbers [i]\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\t\\tj := j - 1\\n\\t\\t\\tend\\n\\t\\t\\tnumbers := new_array\\n\\t\\tend\\n\\n\\tis_sorted (ar: ARRAY [INTEGER]; l, r: INTEGER): BOOLEAN\\n\\t\\t\\t-- Is Array 'ar' sorted in ascending order?\\n\\t\\trequire\\n\\t\\t\\tar_not_empty: not ar.is_empty\\n\\t\\tdo\\n\\t\\t\\tResult := True\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| (r - 1) as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif ar [c.item] > ar [c.item + 1] then\\n\\t\\t\\t\\t\\tResult := False\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"import system'routines;\\nimport extensions;\\n\\npublic program()\\n{\\n var sorted := Array.allocate(9).populate::(n => n + 1 );\\n var values := sorted.clone().randomize(9);\\n\\n while (sorted.sequenceEqual(values))\\n {\\n values := sorted.randomize(9)\\n };\\n\\n var tries := new Integer();\\n until (sorted.sequenceEqual(values))\\n {\\n tries.append(1);\\n\\n console.print(\\\"# \\\",tries,\\\" : LIST : \\\",values,\\\" - Flip how many?\\\");\\n\\n values.sequenceReverse(0, console.readLine().toInt())\\n };\\n\\n console.printLine(\\\"You took \\\",tries,\\\" attempts to put the digits in order!\\\").readChar()\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"defmodule Number_reversal_game do\\n def start( n ) when n > 1 do\\n IO.puts \\\"Usage: #{usage(n)}\\\"\\n targets = Enum.to_list( 1..n )\\n jumbleds = Enum.shuffle(targets)\\n attempt = loop( targets, jumbleds, 0 )\\n IO.puts \\\"Numbers sorted in #{attempt} atttempts\\\"\\n end\\n\\n defp loop( targets, targets, attempt ), do: attempt\\n defp loop( targets, jumbleds, attempt ) do\\n IO.inspect jumbleds\\n {n,_} = IO.gets(\\\"How many digits from the left to reverse? \\\") |> Integer.parse\\n loop( targets, Enum.reverse_slice(jumbleds, 0, n), attempt+1 )\\n end\\n\\n defp usage(n), do: \\\"Given a jumbled list of the numbers 1 to #{n} that are definitely not in ascending order, show the list then ask the player how many digits from the left to reverse. Reverse those digits, then ask again, until all the digits end up in ascending order.\\\"\\nend\\n\\nNumber_reversal_game.start( 9 )\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( number_reversal_game ).\\n\\n-export( [task/0, start/1] ).\\n\\nstart( N ) when N > 1 ->\\n\\tio:fwrite( \\\"Usage: ~s~n\\\", [usage(N)] ),\\n\\tTargets = lists:seq( 1, N ),\\n\\tJumbleds = [X||{_,X} <- lists:sort([ {random:uniform(), Y} || Y <- Targets])],\\n\\tAttempt = loop( Targets, Jumbleds, 0 ),\\n\\tio:fwrite( \\\"Numbers sorted in ~p atttempts~n\\\", [Attempt] ).\\n\\ntask() -> start( 9 ).\\n\\n\\n\\nloop( Targets, Targets, Attempt ) -> Attempt;\\nloop( Targets, Jumbleds, Attempt ) ->\\n\\tio:fwrite( \\\"~p~n\\\", [Jumbleds] ),\\n\\t{ok,[N]} = io:fread( \\\"How many digits from the left to reverse? \\\", \\\"~d\\\" ),\\n\\t{Lefts, Rights} = lists:split( N, Jumbleds ),\\n\\tloop( Targets, lists:reverse(Lefts) ++ Rights, Attempt + 1 ).\\n\\nusage(N) -> io_lib:format( \\\"Given a jumbled list of the numbers 1 to ~p that are definitely not in ascending order, show the list then ask the player how many digits from the left to reverse. Reverse those digits, then ask again, until all the digits end up in ascending order.\\\", [N] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"include get.e\\n\\nfunction accending(sequence s)\\n for i = 1 to length(s)-1 do\\n if s[i]>s[i+1] then\\n return 0\\n end if\\n end for\\n return 1\\nend function\\n\\nputs(1,\\\"Given a jumbled list of the numbers 1 to 9,\\\\n\\\")\\nputs(1,\\\"you must select how many digits from the left to reverse.\\\\n\\\")\\nputs(1,\\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\\n\\\")\\n\\nsequence nums\\nnums = repeat(0,9)\\ninteger n,flp,tries,temp\\n\\n-- initial values\\nfor i = 1 to 9 do\\n nums[i] = i\\nend for\\n\\nwhile accending(nums) do -- shuffle\\n for i = 1 to 9 do\\n n = rand(9)\\n temp = nums[n]\\n nums[n] = nums[i]\\n nums[i] = temp\\n end for\\nend while\\n\\ntries = 0\\nwhile 1 do\\n printf(1,\\\"%2d : \\\",tries)\\n for i = 1 to 9 do\\n printf(1,\\\"%d \\\",nums[i])\\n end for\\n\\n if accending(nums) then\\n exit\\n end if\\n\\n flp = prompt_number(\\\" -- How many numbers should be flipped? \\\",{1,9})\\n for i = 1 to flp/2 do\\n temp = nums[i]\\n nums[i] = nums[flp-i+1]\\n nums[flp-i+1] = temp\\n end for\\n\\n tries += 1\\nend while\\n\\nprintf(1,\\\"\\\\nYou took %d tries to put the digits in order.\\\", tries)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"let rand = System.Random()\\n\\nwhile true do\\n let rec randomNums() =\\n let xs = [|for i in 1..9 -> rand.Next(), i|] |> Array.sort |> Array.map snd\\n if xs = Array.sort xs then randomNums() else xs\\n\\n let xs = randomNums()\\n\\n let suffix = function | 1 -> \\\"st\\\" | 2 -> \\\"nd\\\" | 3 -> \\\"rd\\\" | _ -> \\\"th\\\"\\n\\n let rec move i =\\n printf \\\"\\\\n%A\\\\n\\\\nReverse how many digits from the left in your %i%s move? : \\\" xs i (suffix i)\\n let n = stdin.ReadLine() |> int\\n Array.blit (Array.rev xs.[0..n-1]) 0 xs 0 n\\n if xs <> Array.sort xs then\\n move (i+1)\\n else\\n printfn \\\"\\\\nYou took %i moves to put the digits in order!\\\\n\\\" i\\n\\n move 1\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting io kernel math math.parser math.ranges\\nnamespaces random sequences strings ;\\nIN: rosetta.number-reversal\\n\\n: make-jumbled-array ( -- sorted jumbled )\\n CHAR: 1 CHAR: 9 [a,b] [ 1string ] map dup clone randomize\\n [ 2dup = ] [ randomize ] while ;\\n\\nSYMBOL: trials\\n\\n: prompt ( jumbled -- n )\\n trials get \\\"#%2d: \\\" printf\\n \\\", \\\" join write\\n \\\" Flip how many? \\\" write flush\\n readln string>number ;\\n\\n: game-loop ( sorted jumbled -- )\\n 2dup = [\\n 2drop trials get\\n \\\"\\\\nYou took %d attempts to put the digits in order!\\\\n\\\" printf\\n flush\\n ] [\\n trials [ 1 + ] change\\n dup dup prompt head-slice reverse! drop\\n game-loop\\n ] if ;\\n\\n: play ( -- )\\n 0 trials set\\n make-jumbled-array game-loop ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"01.10 D 3;S T=0\\n01.20 F X=1,9;T %1,D(X)\\n01.30 T !;A \\\"HOW MANY\\\",R\\n01.40 I (R-1)1.3;I (9-R)1.3\\n01.50 D 5;S T=T+1\\n01.60 D 4;I (A-9)1.2\\n01.70 D 1.2;T !\\\"CORRECT! ATTEMPTS\\\",%4,T,!\\n01.80 Q\\n\\n02.10 S A=10*FRAN();S A=A-FITR(A)\\n\\n03.10 F X=1,9;S D(X)=X\\n03.20 F X=1,8;D 2;S Y=X+FITR((10-X)*A);S A=D(X);S D(X)=D(Y);S D(Y)=A\\n03.30 D 4\\n03.40 I (8-A)3.1\\n\\n04.10 S A=0\\n04.20 F X=1,9;D 4.4\\n04.30 R\\n04.40 I (D(X)-X)4.3,4.5,4.3\\n04.50 S A=A+1\\n\\n05.10 F X=1,R/2;S A=D(X);S D(X)=D(R-X+1);S D(R-X+1)=A\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \"include random.fs\\n\\nvariable flips\\ncreate nums 9 cells allot\\n\\n: .array ( addr len -- ) 0 ?do dup @ . cell+ loop drop ;\\n\\n: shuffle ( addr len -- )\\n 2 swap do\\n dup i random cells +\\n over @ over @ swap\\n rot ! over !\\n cell+\\n -1 +loop drop ;\\n\\n: sorted? ( addr len -- )\\n 1- cells bounds ?do\\n i 2@ < if unloop false exit then\\n cell +loop true ;\\n\\n: init\\n 0 flips !\\n nums 10 1 do\\n i over ! cell+\\n loop drop\\n begin nums 9 shuffle nums 9 sorted? 0= until\\n cr nums 9 .array ;\\n\\n: reverse ( addr len -- )\\n 1- cells bounds\\n begin 2dup >\\n while over @ over @ >r over ! over r> swap !\\n cell+ swap 1 cells - swap\\n repeat 2drop ;\\n\\n: flip ( n -- )\\n dup 2 10 within 0= if . .\\\" must be within 2 to 9\\\" exit then\\n nums swap reverse\\n 1 flips +!\\n nums 9 sorted? if\\n cr .\\\" Got it in \\\" flips @ . .\\\" tries!\\\"\\n else\\n cr nums 9 .array\\n then ;\\n\\ninit\\n1 2 8 5 7 6 9 4 3 ok\\n7 flip\\n9 6 7 5 8 2 1 4 3 ok\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program Reversal_game\\n implicit none\\n\\n integer :: list(9) = (/ 1, 2, 3, 4, 5, 6, 7, 8, 9 /)\\n integer :: pos, attempts = 0\\n\\n call random_seed\\n do while (sorted(list))\\n call Shuffle(list)\\n end do\\n write(*, \\\"(9i5)\\\") list\\n write(*,*)\\n do while (.not. Sorted(list))\\n write(*, \\\"(a)\\\", advance=\\\"no\\\") \\\"How many numbers from the left do you want to reverse? : \\\"\\n read*, pos\\n attempts = attempts + 1\\n list(1:pos) = list(pos:1:-1)\\n write(*, \\\"(9i5)\\\") list\\n write(*,*)\\n end do\\n write(*,*)\\n write(*, \\\"(a,i0,a)\\\") \\\"Congratulations! Solved in \\\", attempts, \\\" attempts\\\"\\n\\ncontains\\n\\nsubroutine Shuffle(a)\\n integer, intent(inout) :: a(:)\\n integer :: i, randpos, temp\\n real :: r\\n\\n do i = size(a), 2, -1\\n call random_number(r)\\n randpos = int(r * i) + 1\\n temp = a(randpos)\\n a(randpos) = a(i)\\n a(i) = temp\\n end do\\nend subroutine\\n\\nfunction Sorted(a)\\n logical :: Sorted\\n integer, intent(in) :: a(:)\\n integer :: i\\n\\n do i = 1, size(a)-1\\n if(list(i+1) /= list(i)+1) then\\n Sorted = .false.\\n return\\n end if\\n end do\\n Sorted = .true.\\nend function\\n\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"sort\\\"\\n \\\"time\\\"\\n)\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n var k []int\\n for {\\n k = rand.Perm(9)\\n for i, r := range k {\\n if r == 0 {\\n k[i] = 9\\n }\\n }\\n if !sort.IntsAreSorted(k) {\\n break\\n }\\n }\\n fmt.Println(\\\"Sort digits by reversing a number of digits on the left.\\\")\\n var n, score int\\n for {\\n fmt.Print(\\\"Digits: \\\", k, \\\". How many to reverse? \\\")\\n i, _ := fmt.Scanln(&n)\\n score++\\n if i == 0 || n < 2 || n > 9 {\\n fmt.Println(\\\"\\\\n(Enter a number from 2 to 9)\\\")\\n continue\\n }\\n for l, r := 0, n-1; l < r; l, r = l+1, r-1 {\\n k[l], k[r] = k[r], k[l]\\n }\\n if sort.IntsAreSorted(k) {\\n fmt.Print(\\\"Digits: \\\", k, \\\".\\\\n\\\")\\n fmt.Print(\\\"Your score: \\\", score, \\\". Good job.\\\\n\\\")\\n return\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"sorted = [*(1..9)]\\narr = sorted.clone()\\n\\nvoid flipstart(n) { arr[0..<n] = arr[0..<n].reverse() }\\n\\nint steps = 0\\nwhile (arr==sorted) Collections.shuffle(arr)\\nwhile (arr!=sorted) {\\n println arr.join(' ')\\n print 'Reverse how many? '\\n def flipcount = System.in.readLine()\\n flipstart( flipcount.toInteger() )\\n steps += 1\\n}\\nprintln \\\"Done! That took you ${steps} steps\\\"\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List\\nimport Control.Arrow\\nimport Rosetta.Knuthshuffle\\n\\nnumberRevGame = do\\n let goal = [1..9]\\n\\n shuffle xs =\\n\\tif xs /= goal then return xs\\n\\t\\t else shuffle =<< knuthShuffle xs\\n\\n prefixFlipAt k = uncurry (++). first reverse. splitAt k\\n\\n prompt r ry = do\\n\\t putStr $ show r ++ \\\". \\\" ++ concatMap (flip (++) \\\" \\\". show) ry\\n\\t\\t ++ \\\" How many to flip? \\\"\\n\\t answ <- getLine\\n\\t let n = read answ\\n\\t if n<10 && 0<n then return n\\n\\t else do\\n\\t putStrLn \\\"Error. The number should be between 0 and 10. Try again\\\"\\n\\t prompt r ry\\n\\n playNRG r nrs =\\n\\tif nrs == goal then do\\n\\t putStrLn $ \\\"The answer is: \\\" ++ concatMap (flip (++) \\\" \\\". show) nrs\\n\\t putStrLn $ \\\"It took you \\\" ++ show r ++ \\\" attempts to sort the numbers.\\\"\\n\\t putStrLn \\\"\\\"\\n\\t\\telse do\\n\\t\\t answ <- prompt r nrs\\n\\t\\t playNRG (succ r) (prefixFlipAt answ nrs)\\n\\t\\n start <- shuffle goal\\n\\n playNRG 1 start\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" WRITE(Messagebox) \\\"You took \\\", Reversals(), \\\" attempts\\\"\\n\\nFUNCTION Reversals()\\n DIMENSION digits(9), temp(9)\\n\\n digits = 0\\n DO i = 1, 9 ! create the shuffled digits\\n 1 x = CEILING( RAN(9) )\\n IF( INDEX(digits, x) ) GOTO 1 ! HicEst has no WHILE\\n digits(i) = x\\n ENDDO\\n\\n DO Reversals = 1, 1E6 ! HicEst needs an upper bound\\n DLG(NameEdit=Flips, DNum, MIn=0, MAx=9, Text=digits)\\n DO j = 1, Flips/2\\n swap = digits(j)\\n digits(j) = digits(Flips+1-j)\\n digits(Flips+1-j) = swap\\n ENDDO\\n temp = digits($+1) > digits($) ! $ = left side index\\n IF( SUM(temp) == 8 ) RETURN\\n ENDDO\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(cq) # Number Reversal Game\\nlocal x,nums,R,flips\\n\\n$define PROTECT [\\\"WIN\\\",\\\"ASK\\\"]\\n$define MAGIC [\\\"xyzzy\\\",\\\"abracadabra\\\",\\\"hocus\\\",\\\"pocus\\\",\\\"presto\\\",\\\"changeo\\\",\\\"open\\\",\\\"sesame\\\",\\\"irs\\\"]\\n\\nput(cq,\\\"game\\\") # start command queue - use command line\\nrule := string(&digits--'0') # ruler and move commands\\nevery put(protected := [], map(!PROTECT)) # protected commands\\nevery put(magic := [], !MAGIC)\\n\\nwhile x := get(cq) | \\\"MOVE\\\" do { # command from queue or ask for move\\n case x of {\\n \\\"help\\\" | \\\"h\\\" | \\\"?\\\" : # --- start of user facing commands ---\\n write(\\\"Input a position. The list will be flipped left to right at that point.\\\\n\\\",\\n\\t \\\"You win when the list is sorted.\\\\n\\\",\\n\\t \\\"Commands:\\\\n\\\",\\n \\\" help, h, ? - shows this\\\\n\\\",\\n \\\" new, g - new game\\\\n\\\",\\t\\t\\t\\n \\\" ruler, r - shows a ruler\\\\n\\\",\\n \\\" show, s - shows the list\\\\n\\\",\\n \\\" <n> - flips the list at ruler position n\\\\n\\\",\\n \\\" quit, q - quit\\\\n\\\",\\n \\\"and various magic words.\\\\n\\\"\\n ) & put(cq,\\\"rule\\\")\\n \\\"game\\\" | \\\"g\\\" | \\\"new\\\" : {\\n put(cq,\\\"help\\\")\\n flips := 0\\n nums := rule\\n until nums ~== rule do\\n every !nums :=: ?nums # shuffle\\n }\\n \\\"rule\\\" | \\\"ruler\\\" | \\\"r\\\" :\\n put(cq,\\\"show\\\") & every writes(\\\" \\\" || \\\" \\\" | !(if /mirror then rule else reverse(rule)) | \\\"\\\\n\\\")\\n \\\"show\\\" | \\\"s\\\" :\\n every writes(\\\" \\\" || \\\"=\\\" | !nums | \\\" =\\\\n\\\")\\n !rule : { # 0 - 9 for flipping\\n if /mirror then nums[1+:x] := reverse(nums[1+:x])\\n else nums[0-:x] := reverse(nums[0-:x]) \\t\\t\\n flips +:= 1\\n put(cq,if nums == rule then \\\"WIN\\\" else \\\"show\\\")\\n }\\n \\\"quit\\\" | \\\"q\\\" :\\n break write(\\\"Goodbye.\\\")\\n !magic: # --- start of magic\\n write(\\\"That has no power here. Try again!\\\")\\n \\\"magic\\\" | \\\"mirror\\\" | \\\"m\\\" : {\\n mirror := if /mirror then 1 else &null\\n write(\\\"Wait! What is this? The writing has reversed.\\\")\\n }\\t\\t\\n !protected: # --- Start of internal (upper case) and protected commands\\n put(cq,?rule) & write(\\\"Tisk, Tisk, don't try and cheat. Take a random penalty flip!\\\") \\t\\t\\n \\\"MOVE\\\" :\\n put(cq,ask(\\\"Command? : \\\") ) \\t\\t\\n \\\"WIN\\\" :\\n put(cq,\\\"ASK\\\") & write(\\\"Congratulations you won in \\\",flips,\\\" flips!\\\")\\n \\\"ASK\\\" :\\n put(cq,case ask(\\\"Play another game? : \\\") of { \\\"y\\\"|\\\"yes\\\" : \\\"game\\\"; \\\"n\\\"|\\\"no\\\" : \\\"quit\\\"; default : \\\"ASK\\\" } )\\n default: # --- say what?\\n write(\\\"Sorry I don't know that command, try help?\\\")\\n }\\n }\\nend\\n\\nprocedure ask(s) #: ask for input with prompt s and return the 1st word in lower case\\nwrites(\\\\s)\\nmap(trim(read())) ? return tab(upto(' ')|0)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Number Reversal Game is a room.\\n\\nThe current list is a list of numbers that varies.\\n\\nWhen play begins:\\n\\tnow the current list is a shuffled list from 1 to 9;\\n\\tnow the command prompt is \\\"Current list: [current list in brace notation].[line break]How many items to flip? \\\".\\n\\nDefinition: a list of numbers (called L) is sorted:\\n\\trepeat with N running from 1 to the number of entries in L:\\n\\t\\tif entry N in L is not N, no;\\n\\tyes.\\n\\nTo decide which list of numbers is a shuffled list from (min - number) to (max - number):\\n\\tlet result be a list of numbers;\\n\\trepeat with N running from min to max:\\n\\t\\tadd N to result;\\n\\twhile true is true:\\n\\t\\tsort result in random order;\\n\\t\\tif result is not sorted, decide on result.\\n\\nFlipping is an action applying to one number. Understand \\\"[number]\\\" as flipping.\\n\\nCarry out flipping:\\n\\tlet N be the number understood;\\n\\tlet L be the current list;\\n\\ttruncate the current list to the first N entries;\\n\\treverse the current list;\\n\\ttruncate L to the last (number of entries in L minus N) entries;\\n\\tadd L to the current list.\\n\\nReport flipping: say \\\"\\\".\\n\\nEvery turn:\\n\\tif the current list is sorted, end the story saying \\\"You have won\\\".\\n\\nThis is the new print final score rule:\\n\\tsay \\\"It took you [turn count] flip[s] to sort the list.\\\"\\n\\nThe new print final score rule is listed instead of the print final score rule in the for printing the player's obituary rules.\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"withRange := method( a, z,\\n Range clone setRange(a,z)\\n)\\nsorted := withRange(1,9) asList\\nnumbers := sorted clone shuffle\\nwhile( numbers==sorted, numbers = numbers shuffle)\\n\\nsteps :=0\\nstdin := File standardInput\\nwhile( numbers != sorted,\\n writeln(numbers join(\\\" \\\"))\\n write(\\\"Reverse how many? \\\")\\n flipcount := stdin readLine asNumber\\n withRange(0, ((flipcount-1)/2) floor) foreach( i,\\n numbers swapIndices(i,flipcount-1-i)\\n )\\n steps = steps+1\\n)\\nwriteln(\\\"Done! That took you \\\", steps, \\\" steps\\\")\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Reversal.bas\\\"\\n110 RANDOMIZE\\n120 NUMERIC NR(1 TO 9)\\n130 LET TRIES=0\\n140 TEXT :PRINT \\\"Given a jumbled list of the numbers 1 to 9, you must select how many digits from the left to reverse.\\\":PRINT \\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\":PRINT\\n150 FOR I=1 TO 9\\n160 LET NR(I)=I\\n170 NEXT\\n180 DO\\n190 FOR I=2 TO 9\\n200 LET N=RND(I)+1\\n210 IF N<>I THEN CALL SWAP(N,I)\\n220 NEXT\\n230 LOOP WHILE ORDERED\\n240 DO\\n250 PRINT USING \\\"##: \\\":TRIES;\\n260 FOR I=1 TO 9\\n270 PRINT NR(I);\\n280 NEXT\\n290 PRINT\\n300 IF ORDERED THEN EXIT DO\\n310 DO\\n320 INPUT PROMPT \\\"How many numbers should be flipped? \\\":FLIP\\n330 LOOP WHILE FLIP<2 OR FLIP>9\\n340 FOR I=1 TO FLIP/2\\n350 CALL SWAP(I,FLIP-I+1)\\n360 NEXT\\n370 LET TRIES=TRIES+1\\n380 LOOP\\n390 PRINT :PRINT \\\"You took\\\";TRIES;\\\"tries to put the digits in order.\\\"\\n400 DEF SWAP(A,B)\\n410 LET T=NR(A):LET NR(A)=NR(B):LET NR(B)=T\\n420 END DEF\\n430 DEF ORDERED\\n440 LET ORDERED=-1\\n450 FOR J=1 TO 8\\n460 IF NR(J)>NR(J+1) THEN LET ORDERED=0:EXIT FOR\\n470 NEXT\\n480 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"require 'misc' NB. for the verb prompt\\n\\nINTRO=: noun define\\nNumber Reversal Game\\nFlip groups of numbers from the left of the list until\\nthe numbers are sorted in ascending order.\\n)\\n\\nreversegame=: verb define\\n whilst. (-: /:~)nums do.\\n nums=. 1+9?9 NB. 1-9 in random order\\n end.\\n score=. 0\\n smoutput INTRO NB. Display instructions\\n while. -.(-: /:~)nums do.\\n score=. 1+ score NB. increment score\\n nnum=. 0\\\".prompt (\\\":score),': ',(\\\":nums),' How many numbers to flip?: '\\n if. 0 = #nnum do. return. end. NB. exit on ENTER without number\\n nums=. (C.i.-nnum) C. nums NB. reverse first nnum numbers\\n end.\\n 'You took ',(\\\": score), ' attempts to put the numbers in order.'\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" reversegame''\\nNumber Reversal Game\\nSort the numbers in ascending order by repeatedly\\nflipping sets of numbers from the left.\\n\\n1: 4 7 5 6 9 1 2 8 3 How many numbers to flip?: 5\\n2: 9 6 5 7 4 1 2 8 3 How many numbers to flip?: 9\\n3: 3 8 2 1 4 7 5 6 9 How many numbers to flip?: 2\\n4: 8 3 2 1 4 7 5 6 9 How many numbers to flip?: 8\\n5: 6 5 7 4 1 2 3 8 9 How many numbers to flip?: 3\\n6: 7 5 6 4 1 2 3 8 9 How many numbers to flip?: 7\\n7: 3 2 1 4 6 5 7 8 9 How many numbers to flip?: 5\\n8: 6 4 1 2 3 5 7 8 9 How many numbers to flip?: 6\\n9: 5 3 2 1 4 6 7 8 9 How many numbers to flip?: 5\\n10: 4 1 2 3 5 6 7 8 9 How many numbers to flip?: 4\\n11: 3 2 1 4 5 6 7 8 9 How many numbers to flip?: 3\\nYou took 11 attempts to put the numbers in order.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.List;\\nimport java.util.ArrayList;\\nimport java.util.Scanner;\\nimport java.util.Collections;\\n\\n\\npublic class ReversalGame {\\n private List<Integer> gameList;\\n\\n public ReversalGame() {\\n initialize();\\n }\\n\\n public void play() throws Exception {\\n int i = 0;\\n int moveCount = 0;\\n Scanner scanner = new Scanner(System.in);\\n while (true) {\\n System.out.println(gameList);\\n System.out.println(\\\"Please enter a index to reverse from 2 to 9. Enter 99 to quit\\\");\\n i = scanner.nextInt();\\n if (i == 99) {\\n break;\\n }\\n if (i < 2 || i > 9) {\\n System.out.println(\\\"Invalid input\\\");\\n } else {\\n moveCount++;\\n reverse(i);\\n if (isSorted()) {\\n System.out.println(\\\"Congratulations you solved this in \\\" + moveCount + \\\" moves!\\\");\\n break;\\n }\\n }\\n\\n }\\n scanner.close();\\n }\\n\\n private void reverse(int position) {\\n Collections.reverse(gameList.subList(0, position));\\n }\\n\\n private boolean isSorted() {\\n for (int i=0; i < gameList.size() - 1; ++i) {\\n if (gameList.get(i).compareTo(gameList.get(i + 1)) > 0) {\\n return false;\\n }\\n }\\n return true;\\n }\\n\\n private void initialize() {\\n this.gameList = new ArrayList<Integer>(9);\\n for (int i=1; i < 10; ++i) {\\n gameList.add(i);\\n }\\n while (isSorted()) {\\n Collections.shuffle(gameList);\\n }\\n }\\n\\n\\n public static void main(String[] args) {\\n try {\\n ReversalGame game = new ReversalGame();\\n game.play();\\n } catch (Exception e) {\\n System.out.println(e.getMessage());\\n e.printStackTrace();\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"<html>\\n<head>\\n <title>Number Reversal Game</title>\\n</head>\\n\\n<body>\\n<div id=\\\"start\\\"></div>\\n<div id=\\\"progress\\\"></div>\\n<div id=\\\"score\\\"></div>\\n<script type=\\\"text/javascript\\\">\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function endGame(progress) {\\n var scoreId = progress.scoreId,\\n result = 'You took ' + progress.count + ' attempts to put the digits in order!';\\n if (progress.abort === true) {\\n result = 'Game aborted.';\\n }\\n document.getElementById(scoreId).innerHTML = result;\\n}\\n\\nfunction reverseFirstN(arr, n) {\\n var reversed = arr.slice(0, n).reverse();\\n return reversed.concat(arr.slice(n));\\n}\\n\\nfunction isSorted(arr) {\\n return arr.slice(0).sort().toString() === arr.toString();\\n}\\n\\nfunction gameLoop(progress) {\\n if (isSorted(progress.arr)) {\\n endGame(progress);\\n } else {\\n var n = parseInt(window.prompt('How many elements to reverse?', ''), 10);\\n if (isNaN(n)) {\\n progress.abort = true;\\n } else {\\n progress.arr = reverseFirstN(progress.arr, n);\\n progress.innerHTML += '<p>' + progress.arr + '</p>';\\n progress.count += 1;\\n }\\n if (progress.abort !== true) {\\n // allow window to repaint before next guess\\n setTimeout(function () {\\n gameLoop(progress);\\n }, 1);\\n }\\n }\\n}\\n\\nfunction knuth_shuffle(a) {\\n var n = a.length,\\n r,\\n temp;\\n while (n > 1) {\\n r = Math.floor(n * Math.random());\\n n -= 1;\\n temp = a[n];\\n a[n] = a[r];\\n a[r] = temp;\\n }\\n return a;\\n}\\n\\nfunction playGame(startId, progressId, scoreId) {\\n var progress = document.getElementById(progressId);\\n progress.arr = knuth_shuffle([1, 2, 3, 4, 5, 6, 7, 8, 9]);\\n document.getElementById(startId).innerHTML = '<p>' + progress.arr.toString() + '</p>';\\n\\n progress.count = 0;\\n progress.scoreId = scoreId;\\n\\n // allow window to repaint before prompting for a guess\\n setTimeout(function () {\\n gameLoop(progress);\\n }, 1);\\n}\\n\\nplayGame('start', 'progress', 'score');\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"</script>\\n</body>\\n</html>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Input: the initial array\\ndef play:\\n def sorted: . == sort;\\n\\n def reverse(n): (.[0:n] | reverse) + .[n:];\\n\\n def prompt: \\\"List: \\\\(.list)\\\\nEnter a pivot number: \\\";\\n\\n def report: \\\"Great! Your score is \\\\(.score)\\\";\\n\\n {list: ., score: 0}\\n | (if .list | sorted then \\\"List was sorted to begin with.\\\"\\n else\\n prompt,\\n ( label $done\\n | foreach inputs as $n (.;\\n .list |= reverse($n) | .score +=1;\\n if .list | sorted then report, break $done else prompt end ))\\n end);\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[1,2,3,9,8,7,6,5,4] | play\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# v0.6\\n\\nfunction numrevgame()\\n l = collect(1:9)\\n while issorted(l) shuffle!(l) end\\n score = 0\\n println(\\\"# Number reversal game\\\")\\n while !issorted(l)\\n print(\\\"$l\\\\nInsert the index up to which to revert: \\\")\\n n = parse(Int, readline())\\n reverse!(l, 1, n)\\n score += 1\\n end\\n println(\\\"$l... You won!\\\\nScore: $score\\\")\\n return score\\nend\\n\\nnumrevgame()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun isAscending(a: IntArray): Boolean {\\n for (i in 0..8) if (a[i] != i + 1) return false\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n val r = java.util.Random()\\n var count = 0\\n val numbers = IntArray(9)\\n numbers[0] = 2 + r.nextInt(8) // this will ensure list isn't ascending\\n for (i in 1..8) {\\n var rn: Int\\n do {\\n rn = 1 + r.nextInt(9)\\n } while (rn in numbers)\\n numbers[i] = rn\\n }\\n println(\\\"Here's your first list : ${numbers.joinToString()}\\\")\\n while (true) {\\n var rev: Int\\n do {\\n print(\\\"How many numbers from the left are to be reversed : \\\")\\n rev = readLine()!!.toInt()\\n } while (rev !in 2..9)\\n count++\\n var i = 0\\n var j = rev - 1\\n while (i < j) {\\n val temp = numbers[i]\\n numbers[i++] = numbers[j]\\n numbers[j--] = temp\\n }\\n if (isAscending(numbers)) {\\n println(\\\"Here's your final list : ${numbers.joinToString()}\\\")\\n break\\n }\\n println(\\\"Here's your list now : ${numbers.joinToString()}\\\")\\n }\\n println(\\\"So you've completed the game with a score of $count\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Initialisation\\nmath.randomseed(os.time())\\nnumList = {values = {}}\\n\\n-- Check whether list contains n\\nfunction numList:contains (n)\\n for k, v in pairs(self.values) do\\n if v == n then return true end\\n end\\n return false\\nend\\n\\n-- Check whether list is in order\\nfunction numList:inOrder ()\\n for k, v in pairs(self.values) do\\n if k ~=v then return false end\\n end\\n return true\\nend\\n\\n-- Create necessarily out-of-order list\\nfunction numList:build ()\\n local newNum\\n repeat\\n for i = 1, 9 do\\n repeat\\n newNum = math.random(1, 9)\\n until not numList:contains(newNum)\\n table.insert(self.values, newNum)\\n end\\n until not numList:inOrder()\\nend\\n\\n-- Display list of numbers on one line\\nfunction numList:show ()\\n for k, v in pairs(self.values) do\\n io.write(v .. \\\" \\\")\\n end\\n io.write(\\\":\\\\t\\\")\\nend\\n\\n-- Reverse n values from left\\nfunction numList:reverse (n)\\n local swapList = {}\\n for k, v in pairs(self.values) do\\n table.insert(swapList, v)\\n end\\n for i = 1, n do\\n swapList[i] = self.values[n + 1 - i]\\n end\\n self.values = swapList\\nend\\n\\n-- Main procedure\\nlocal score = 0\\nprint(\\\"\\\\nRosetta Code Number Reversal Game in Lua\\\")\\nprint(\\\"========================================\\\\n\\\")\\nnumList:build()\\nrepeat\\n numList:show()\\n numList:reverse(tonumber(io.read()))\\n score = score + 1\\nuntil numList:inOrder()\\nnumList:show()\\nprint(\\\"\\\\n\\\\nW00t! You scored:\\\", score)\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Number_Reversal_Game {\\n PRINT \\\"Given a jumbled list of the numbers 1 to 9,\\\"\\n PRINT \\\"you must select how many digits from the left to reverse.\\\"\\n PRINT \\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\"\\n \\\\\\\\ work on a new stack - old stack parked, and attached at the exit of this block\\n Stack New {\\n Data 1,2,3,4,5,6,7,8,9\\n \\\\\\\\ Create jumbled list\\n For i=1 to 30: Reverse(Random(2,9)):Next i\\n Tries=0\\n fin=false\\n Repeat {\\n \\\\\\\\ Show Stack\\n Stack\\n Try ok {\\n INPUT \\\" -- How many numbers should be flipped:\\\", flp%\\n }\\n if not Ok then print: Restart\\n if flp%<2 or flp%>9 then Restart\\n Reverse(flp%)\\n Tries++\\n CheckStack(&fin)\\n } until Fin\\n \\\\\\\\ show stack again\\n Stack\\n PRINT \\\"You took \\\"; tries; \\\" tries to put the digits in order.\\\"\\n }\\n Sub Reverse(n)\\n Shift 1, -n ' shift one item nth times in reverse\\n End Sub\\n Sub CheckStack(&ok)\\n ok=true\\n if stack.size<2 then exit sub\\n Local i\\n For i=2 to stack.size {\\n ok=stackitem(i)-stackitem(i-1)=1\\n if ok else exit\\n }\\n End Sub\\n}\\nNumber_Reversal_Game\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module[{array = Range@9, score = 0},\\n While[array == Range@9, array = RandomSample@Range@9];\\n While[array != Range@9,\\n Print@array; (array[[;; #]] = Reverse@array[[;; #]]) &@\\n Input[\\\"How many digits would you like to reverse?\\\"]; score++];\\n Print@array; Print[\\\"Your score:\\\", score]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function NumberReversalGame\\n list = randperm(9);\\n while issorted(list)\\n list = randperm(9);\\n end\\n fprintf('Given a list of numbers, try to put them into ascending order\\\\n')\\n fprintf('by sequentially reversing everything left of a point you choose\\\\n')\\n fprintf('in the array. Try to do it in as few reversals as possible.\\\\n')\\n fprintf('No input will quit the game.\\\\n')\\n fprintf('Position Num:%s\\\\n', sprintf(' %d', 1:length(list)))\\n fprintf('Current List:%s', sprintf(' %d', list))\\n pivot = 1;\\n nTries = 0;\\n while ~isempty(pivot) && ~issorted(list)\\n pivot = input(' Enter position of reversal limit: ');\\n if pivot\\n list(1:pivot) = list(pivot:-1:1);\\n fprintf('Current List:%s', sprintf(' %d', list))\\n nTries = nTries+1;\\n end\\n end\\n if issorted(list)\\n fprintf('\\\\nCongratulations! You win! Only %d reversals.\\\\n', nTries)\\n else\\n fprintf('\\\\nPlay again soon!\\\\n')\\n end\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import random, rdstdin, strutils, algorithm\\nrandomize()\\n\\nproc isSorted[T](s: openarray[T]): bool =\\n var last = low(T)\\n for c in s:\\n if c < last:\\n return false\\n last = c\\n return true\\n\\nproc toString[T](s: openarray[T]): string =\\n result = \\\"\\\"\\n for i, x in s:\\n if i > 0:\\n result.add \\\" \\\"\\n result.add($x)\\n\\necho \\\"\\\"\\\"number reversal game\\n Given a jumbled list of the numbers 1 to 9\\n Show the list.\\n Ask the player how many digits from the left to reverse.\\n Reverse those digits then ask again.\\n until all the digits end up in ascending order.\\\"\\\"\\\"\\n\\nvar data = @[1,2,3,4,5,6,7,8,9]\\nvar trials = 0\\nwhile isSorted data:\\n shuffle data\\nwhile not isSorted data:\\n inc trials\\n var flip = parseInt readLineFromStdin(\\n \\\"#\\\" & $trials & \\\": List: '\\\" & toString(data) & \\\"' Flip how many?: \\\")\\n reverse(data, 0, flip - 1)\\n\\necho \\\"You took \\\", trials, \\\" attempts to put the digits in order!\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let swap ar i j =\\n let tmp = ar.(i) in\\n ar.(i) <- ar.(j);\\n ar.(j) <- tmp\\n\\nlet shuffle ar =\\n for i = pred(Array.length ar) downto 1 do\\n let j = Random.int (i + 1) in\\n swap ar i j\\n done\\n\\nlet reversal ar n =\\n for i = 0 to pred(n/2) do\\n let j = (pred n) - i in\\n swap ar i j\\n done\\n\\nlet sorted ar =\\n try\\n let prev = ref ar.(0) in\\n for i = 1 to pred(Array.length ar) do\\n if ar.(i) < !prev then raise Exit;\\n prev := ar.(i)\\n done;\\n (true)\\n with Exit ->\\n (false)\\n\\nlet () =\\n print_endline \\\"\\\\\\n Number Reversal Game\\n Sort the numbers in ascending order by repeatedly\\n flipping sets of numbers from the left.\\\";\\n Random.self_init();\\n let nums = Array.init 9 (fun i -> succ i) in\\n while sorted nums do shuffle nums done;\\n let n = ref 1 in\\n while not(sorted nums) do\\n Printf.printf \\\"#%2d: \\\" !n;\\n Array.iter (Printf.printf \\\" %d\\\") nums;\\n print_newline();\\n let r = read_int() in\\n reversal nums r;\\n incr n;\\n done;\\n print_endline \\\"Congratulations!\\\";\\n Printf.printf \\\"You took %d attempts to put the digits in order.\\\\n\\\" !n;\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let revert li n =\\n let rec aux acc i = function\\n | [] -> acc\\n | xs when i <= 0 -> acc @ xs\\n | x::xs -> aux (x::acc) (pred i) xs\\n in\\n aux [] n li\\n\\nlet take li n =\\n let rec aux acc i = function\\n | x::xs when i = n -> (x, List.rev_append acc xs)\\n | x::xs -> aux (x::acc) (succ i) xs\\n | _ -> invalid_arg \\\"take\\\"\\n in\\n aux [] 0 li\\n\\nlet shuffle li =\\n let rec aux acc len = function\\n | [] -> acc\\n | li ->\\n let x, xs = take li (Random.int len) in\\n aux (x::acc) (pred len) xs\\n in\\n aux [] (List.length li) li\\n\\nlet rec sorted = function\\n | [] -> (true)\\n | x::y::_ when x > y -> (false)\\n | x::xs -> sorted xs\\n\\nlet () =\\n print_endline \\\"\\\\\\n Number Reversal Game\\n Sort the numbers in ascending order by repeatedly\\n flipping sets of numbers from the left.\\\";\\n Random.self_init();\\n let li = shuffle [1; 2; 3; 4; 5; 6; 7; 8; 9] in\\n let rec loop n li =\\n Printf.printf \\\"#%2d: \\\" n;\\n List.iter (Printf.printf \\\" %d\\\") li;\\n Printf.printf \\\" ? %!\\\";\\n let r = read_int() in\\n let li = revert li r in\\n if not(sorted li)\\n then loop (succ n) li\\n else Printf.printf \\\"You took %d attempts to put the digits in order.\\\\n\\\" n;\\n in\\n loop 1 li\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"import: console\\n\\n: reversalGame\\n| l n |\\n doWhile: [\\t\\t\\n ListBuffer new ->l\\n while(l size 9 <>) [ 9 rand dup l include ifFalse: [ l add ] else: [ drop ] ]\\n l sort l ==\\n ]\\n\\n 0 while(l sort l <>) [\\n System.Out \\\"List is \\\" << l << \\\" ==> how many digits from left to reverse : \\\" <-\\n System.Console askln asInteger dup ifNull: [ drop continue ] ->n\\n 1+ l left(n) reverse l right(l size n -) + ->l\\n ]\\n \\\"You won ! Your score is :\\\" . println ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n proc {Main}\\n proc {Loop N Xs}\\n if {Not {IsSorted Xs}} then\\n Num NewXs\\n in\\n {System.printInfo N#\\\": \\\"}\\n {System.print Xs}\\n {System.printInfo \\\" -- Reverse how many? \\\"}\\n Num = {String.toInt {ReadLine}}\\n NewXs = {Append\\n {Reverse {List.take Xs Num}}\\n {List.drop Xs Num}}\\n {Loop N+1 NewXs}\\n else\\n {System.showInfo \\\"You took \\\"#N#\\\" tries to put the digits in order.\\\"}\\n end\\n end\\n fun {EnsureShuffled Xs}\\n Ys = {Shuffle Xs}\\n in\\n if {Not {IsSorted Ys}} then Ys\\n else {EnsureShuffled Xs}\\n end\\n end\\n in\\n {Loop 0 {EnsureShuffled {List.number 1 9 1}}}\\n end\\n\\n fun {IsSorted Xs}\\n {Sort Xs Value.'<'} == Xs\\n end\\n\\n local\\n class TextFile from Open.file Open.text end\\n StdIn = {New TextFile init(name:stdin)}\\n in\\n fun {ReadLine}\\n {StdIn getS($)}\\n end\\n end\\n\\n fun {Shuffle Xs}\\n {FoldL Xs\\n fun {$ Z _}\\n {Pick {Diff Xs Z}}|Z\\n end\\n nil}\\n end\\n\\n fun {Pick Xs}\\n {Nth Xs {OS.rand} mod {Length Xs} + 1}\\n end\\n\\n fun {Diff Xs Ys}\\n {FoldL Ys List.subtract Xs}\\n end\\nin\\n {Main}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"game()={\\n my(v=numtoperm(9,random(9!-1)),score,in,t); \\\\\\\\ Create vector with 1..9, excluding the one sorted in ascending order\\n while(v!=vecsort(v),\\n print(concat(concat([\\\"\\\"],v)));\\n in=input();\\n for(i=0,in\\\\2-1,\\n t=v[9-i];\\n\\t v[9-i]=v[10-in+i];\\n\\t v[10-in+i]=t\\n );\\n score++\\n );\\n score\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program NumberReversalGame;\\n\\nprocedure PrintList(list: array of integer);\\nvar\\n i: integer;\\nbegin\\n for i := low(list) to high(list) do\\n begin\\n Write(list[i]);\\n if i < high(list) then Write(', ');\\n end;\\n WriteLn;\\nend;\\n\\nprocedure Swap(var list: array of integer; i, j: integer);\\nvar\\n buf: integer;\\nbegin\\n buf := list[i];\\n list[i] := list[j];\\n list[j] := buf;\\nend;\\n\\nprocedure ShuffleList(var list: array of integer);\\nvar\\n i, j, n: integer;\\nbegin\\n Randomize;\\n\\n for n := 0 to 99 do\\n begin\\n i := Random(high(list)+1);\\n j := Random(high(list)+1);\\n Swap(list, i, j);\\n end;\\nend;\\n\\nprocedure ReverseList(var list: array of integer; j: integer);\\nvar\\n i: integer;\\nbegin\\n i := low(list);\\n\\n while i < j do\\n begin\\n Swap(list, i, j);\\n i += 1;\\n j -= 1;\\n end;\\nend;\\n\\nfunction IsOrdered(list: array of integer): boolean;\\nvar\\n i: integer;\\nbegin\\n IsOrdered := true;\\n i:= high(list);\\n\\n while i > 0 do\\n begin\\n if list[i] <> (list[i-1] + 1) then\\n begin\\n IsOrdered:= false;\\n break;\\n end;\\n i -= 1;\\n end;\\nend;\\n\\n\\nvar\\n list: array [0..8] of integer = (1, 2, 3, 4, 5, 6, 7, 8, 9);\\n n: integer;\\n moves: integer;\\nbegin\\n\\n WriteLn('Number Reversal Game');\\n WriteLn;\\n WriteLn('Sort the following list in ascending order by reversing the first n digits');\\n WriteLn('from the left.');\\n WriteLn;\\n\\n ShuffleList(list);\\n PrintList(list);\\n\\n moves := 0;\\n\\n while not IsOrdered(list) do\\n begin\\n WriteLn('How many digits from the left will you reverse?');\\n Write('> ');\\n Read(n);\\n\\n ReverseList(list, n-1);\\n PrintList(list);\\n moves += 1;\\n end;\\n\\n WriteLn;\\n WriteLn('Congratulations you made it in just ', moves, ' moves!');\\n WriteLn;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use List::Util qw(shuffle);\\n\\nmy $turn = 0;\\nmy @jumble = shuffle 1..9;\\n\\nwhile ( join('', @jumble) eq '123456789' ) {\\n @jumble = shuffle 1..9;\\n}\\n\\nuntil ( join('', @jumble) eq '123456789' ) {\\n $turn++;\\n printf \\\"%2d: @jumble - Flip how many digits ? \\\", $turn;\\n\\n my $d = <>;\\n\\n @jumble[0..$d-1] = reverse @jumble[0..$d-1];\\n}\\n\\nprint \\\" @jumble\\\\n\\\";\\nprint \\\"You won in $turn turns.\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"puts(1,\\\"Given a jumbled list of the numbers 1 to 9,\\\\n\\\")\\nputs(1,\\\"you must select how many digits from the left to reverse.\\\\n\\\")\\nputs(1,\\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\\n\\\")\\n\\nconstant inums = tagset(9)\\nsequence nums\\ninteger turns = 0, flip\\n\\nwhile 1 do\\n nums = shuffle(inums)\\n if nums!=inums then exit end if\\nend while\\n\\nwhile 1 do\\n printf(1,\\\"%2d : %d %d %d %d %d %d %d %d %d \\\",turns&nums)\\n if nums=inums then exit end if\\n flip = prompt_number(\\\" -- How many numbers should be flipped? \\\",{1,9})\\n nums[1..flip] = reverse(nums[1..flip])\\n turns += 1\\nend while\\n\\nprintf(1,\\\"\\\\nYou took %d turns to put the digits in order.\\\", turns)\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"class ReversalGame {\\n private $numbers;\\n\\n public function __construct() {\\n $this->initialize();\\n }\\n\\n public function play() {\\n $i = 0;\\n $moveCount = 0;\\n while (true) {\\n echo json_encode($this->numbers) . \\\"\\\\n\\\";\\n echo \\\"Please enter an index to reverse from 2 to 9. Enter 99 to quit\\\\n\\\";\\n $i = intval(rtrim(fgets(STDIN), \\\"\\\\n\\\"));\\n if ($i == 99) {\\n break;\\n }\\n if ($i < 2 || $i > 9) {\\n echo \\\"Invalid input\\\\n\\\";\\n } else {\\n $moveCount++;\\n $this->reverse($i);\\n if ($this->isSorted()) {\\n echo \\\"Congratulations you solved this in $moveCount moves!\\\\n\\\";\\n break;\\n }\\n }\\n\\n }\\n }\\n\\n private function reverse($position) {\\n array_splice($this->numbers, 0, $position, array_reverse(array_slice($this->numbers, 0, $position)));\\n }\\n\\n private function isSorted() {\\n for ($i = 0; $i < count($this->numbers) - 1; ++$i) {\\n if ($this->numbers[$i] > $this->numbers[$i + 1]) {\\n return false;\\n }\\n }\\n return true;\\n }\\n\\n private function initialize() {\\n $this->numbers = range(1, 9);\\n while ($this->isSorted()) {\\n shuffle($this->numbers);\\n }\\n }\\n\\n}\\n\\n$game = new ReversalGame();\\n$game->play();\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(load \\\"@lib/simul.l\\\")\\n\\n(de reversalGame ()\\n (let (Lst (shuffle (range 1 9)) Cnt 0)\\n (while (apply < Lst)\\n (setq Lst (shuffle Lst)) )\\n (loop\\n (printsp Lst)\\n (T (apply < Lst) Cnt)\\n (NIL (num? (read)))\\n (setq Lst (flip Lst @))\\n (inc 'Cnt) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"digits: procedure options (main); /* 23 April 2010 */\\n declare s character (9) varying;\\n declare i fixed binary;\\n declare digit character (1);\\n\\nrestart:\\n put skip list ('In this game, you are given a group of digits.');\\n put skip list ('You will specify one of those digits.');\\n put skip list ('The computer will then reverse the digits up to the one you nominate.');\\n put skip list ('Your task is to repeat this process a number of times until all the digits');\\n put skip list ('are in order, left to right, 1 to 9.');\\n put skip list ('Here are your digits');\\n\\nredo:\\n s = '';\\n do until (length(s) = 9);\\n digit = trim ( fixed(trunc (1+random()*9) ) );\\n if index(s, digit) = 0 then s = s || digit;\\n end;\\n if s = '123456789' then go to redo;\\n\\nloop:\\n do forever;\\n put skip list (s);\\n if s = '123456789' then leave;\\n get edit (digit) (a(1));\\n i = index(s, digit);\\n if i = 0 then do; put skip list ('invalid request'); iterate loop; end;\\n s = reverse( substr(s, 1, i) ) || substr(s, i+1, length(s)-i);\\n end;\\n put skip list ('Congratulations');\\n go to restart;\\nend digits;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"#adding the below function to the previous users submission to prevent the small\\n#chance of getting an array that is in ascending order.\\n\\n#Full disclosure: I am an infrastructure engineer, not a dev. My code is likely\\n#bad.\\n\\nfunction generateArray{\\n $fArray = 1..9 | Get-Random -Count 9\\n if (-join $fArray -eq -join @(1..9)){\\n generateArray\\n }\\n return $fArray\\n}\\n$array = generateArray\\n\\n#everything below is untouched from original submission\\n$nTries = 0\\nWhile(-join $Array -ne -join @(1..9)){\\n $nTries++\\n $nReverse = Read-Host -Prompt \\\"[$Array] -- How many digits to reverse? \\\"\\n [Array]::Reverse($Array,0,$nReverse)\\n}\\n\\\"$Array\\\"\\n\\\"Your score: $nTries\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"play :- random_numbers(L), do_turn(0,L), !.\\n\\ndo_turn(N, L) :-\\n\\tprint_list(L),\\n\\thow_many_to_flip(F),\\n\\tflip(L,F,[],Lnew),\\n\\tsucc(N,N1),\\n\\tsorted(N1,Lnew).\\n\\nhow_many_to_flip(F) :-\\n\\tread_line_to_codes(user_input, Line),\\n\\tnumber_codes(F, Line),\\n\\tbetween(1,9,F).\\n\\t\\nflip(L,0,C,R) :- append(C,L,R).\\nflip([Ln|T],N,C,R) :- dif(N,0), succ(N0,N), flip(T,N0,[Ln|C],R).\\n\\t\\nsorted(N,L) :-\\n\\tsort(L,L)\\n\\t-> print_list(L), format('-> ~p~n', N)\\n\\t; do_turn(N,L).\\t\\n\\nrandom_numbers(L) :- random_permutation([1,2,3,4,5,6,7,8,9],L).\\n\\nprint_list(L) :-\\n\\tatomic_list_concat(L, ' ', Lf),\\n\\tformat('(~w) ',Lf).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Dim MyList(9)\\n\\nDeclare is_list_sorted()\\n\\nIf OpenConsole()\\n Define score, indata, i, txt$\\n\\n For i=1 To 9 ;- Initiate the list\\n MyList(i)=i\\n Next\\n While is_list_sorted()\\n For i=1 To 9 ;- Do a Fisher–Yates shuffle\\n Swap MyList(i), MyList(Random(i)+1)\\n Next\\n Wend\\n\\n ;- Start the Game\\n Repeat\\n score+1\\n txt$=RSet(str(score), 3)+\\\": \\\" ;- Show current list\\n For i=1 To 9\\n txt$+str(MyList(i))+\\\" \\\"\\n Next\\n Repeat ;- Get input & swap\\n Print(txt$+\\\"| How many numbers should be flipped? \\\"): indata=Val(Input())\\n Until indata>=1 And indata<=9 ;- Verify the input\\n For i=1 To (indata/2)\\n Swap MyList(i),MyList(indata-i+1)\\n Next\\n Until is_list_sorted()\\n\\n ;- Present result & wait for users input before closing down\\n PrintN(#CRLF$+\\\"You did it in \\\"+str(score)+\\\" moves\\\")\\n Print(\\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\\nProcedure is_list_sorted()\\n Protected i\\n Shared MyList()\\n For i=1 To 9\\n If MyList(i)<>i\\n ProcedureReturn #False\\n EndIf\\n Next\\n ProcedureReturn #True\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"'''\\nnumber reversal game\\n Given a jumbled list of the numbers 1 to 9\\n Show the list.\\n Ask the player how many digits from the left to reverse.\\n Reverse those digits then ask again.\\n until all the digits end up in ascending order.\\n\\n'''\\n\\nimport random\\n\\nprint(__doc__)\\ndata, trials = list('123456789'), 0\\nwhile data == sorted(data):\\n random.shuffle(data)\\nwhile data != sorted(data):\\n trials += 1\\n flip = int(input('#%2i: LIST: %r Flip how many?: ' % (trials, ' '.join(data))))\\n data[:flip] = reversed(data[:flip])\\n\\nprint('\\\\nYou took %2i attempts to put the digits in order!' % trials)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 0 temp put\\n [] 9 times\\n [ i^ 1+ join ]\\n dup\\n [ shuffle 2dup != until ]\\n [ dup echo cr\\n 2dup != while\\n [ $ \\\"Reverse how many? \\\"\\n input\\n $->n not iff\\n drop again ]\\n split dip reverse join\\n 1 temp tally\\n again ]\\n drop cr\\n say \\\"That took \\\"\\n temp take echo\\n say \\\" reversals.\\\" ] is play ( --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"reversalGame <- function(){\\n cat(\\\"Welcome to the Number Reversal Game! \\\\n\\\")\\n cat(\\\"Sort the numbers into ascending order by repeatedly \\\\n\\\",\\n \\\"reversing the first n digits, where you specify n. \\\\n \\\\n\\\", sep=\\\"\\\")\\n\\n # Generate a list that's definitely not in ascending order, per instuctions\\n data <- sample(1:9, 9)\\n while (all(data == 1:9)){\\n cat(\\\"What were the chances...? \\\\n\\\")\\n data <- sample(1:9, 9)\\n }\\n trials <- 0\\n\\n # Play the game\\n while (any(data != 1:9)){\\n trials <- trials + 1\\n cat(\\\"Trial\\\", sprintf(\\\"%02d\\\", trials), \\\" # \\\", data, \\\" # \\\")\\n answer <- readline(paste(\\\"Flip how many? \\\"))\\n data[1:answer] <- data[answer:1]\\n }\\n\\n # Victory!\\n cat(\\\"Well done. You needed\\\", trials, \\\"flips. \\\\n\\\")\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \">reversalGame()\\nWelcome to the Number Reversal Game!\\nSort the numbers into ascending order by repeatedly\\nreversing the first n digits, where you specify n.\\n\\nTrial 01 # 4 3 2 1 7 9 8 5 6 # Flip how many? 7\\nTrial 02 # 8 9 7 1 2 3 4 5 6 # Flip how many? 2\\nTrial 03 # 9 8 7 1 2 3 4 5 6 # Flip how many? 9\\nTrial 04 # 6 5 4 3 2 1 7 8 9 # Flip how many? 6\\nWell done. You needed 4 flips.\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(let loop ([nums (range 1 10)] [n 0])\\n (cond [(apply < nums) (if (zero? n)\\n (loop (shuffle nums) 0)\\n (printf \\\"Done in ~s steps.\\\\n\\\" n))]\\n [else (printf \\\"Step #~s: ~s\\\\nFlip how many? \\\" n nums)\\n (define-values (l r) (split-at nums (read)))\\n (loop (append (reverse l) r) (add1 n))]))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"repeat while [<] my @jumbled-list {\\n @jumbled-list = (1..9).pick(*)\\n}\\n\\nmy $turn = 0;\\nrepeat until [<] @jumbled-list {\\n my $d = prompt $turn.=succ.fmt('%2d: ') ~\\n @jumbled-list ~\\n \\\" - Flip how many digits? \\\"\\n or exit;\\n @jumbled-list[^$d] .= reverse;\\n}\\n\\nsay \\\" @jumbled-list[]\\\";\\nsay \\\"You won in $turn turns.\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import Prelude;\\nimport vis::Figure;\\nimport vis::Render;\\n\\npublic void NumberReversalGame(){\\n\\n\\t//generate randomlist\\n\\tL = [1..9];\\n\\tscore = 0;\\n\\trandomlist = [];\\n\\twhile (L != []){\\n\\t\\ttemp = takeOneFrom(L);\\n\\t\\trandomlist += temp[0];\\n\\t\\tL = temp[1];\\n\\t}\\n\\t\\n\\t// user interaction\\n\\tscore = 0;\\n\\ttext1 = \\\"\\\";\\n\\tfigure =\\n\\tbox(vcat([\\n\\t\\tbox(text(str(){\\n\\t\\t\\treturn \\\"<randomlist>\\\";})),\\n\\t\\tbox(textfield(\\\"Insert number of digits you would like to reverse here.\\\",\\n\\t\\t\\tvoid(str s){\\n\\t\\t\\t\\tscore += 1;\\n\\t\\t\\t\\tn = toInt(s);\\n\\t\\t\\t\\tspliced = slice(randomlist, 0, n);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\trandomlist = reverse(spliced) + (randomlist - spliced);\\n\\t\\t\\t\\t},\\n\\t\\t\\tfillColor(\\\"lightblue\\\"))),\\n\\t\\tbox(text(str(){\\n\\t\\t\\treturn ((randomlist == [1 .. 9]) ? \\\"Well done! Your score: <score>.\\\" : \\\"Keep going!\\\");}))\\n\\t\\t\\t\\t]));\\n\\t\\n\\trender(figure);\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"REBOL []\\n\\nprint \\\"NUMBER REVERSAL GAME\\\"\\n\\ntries: 0\\ngoal: [1 2 3 4 5 6 7 8 9]\\nrandom/seed now\\n\\nuntil [\\n jumble: random goal\\n jumble != goal ; repeat in the unlikely case that jumble isn't jumbled\\n]\\n\\nwhile [jumble != goal] [\\n prin jumble\\n prin \\\" How many to flip? \\\"\\n flip-index: to-integer input ; no validation!\\n reverse/part jumble flip-index\\n tries: tries + 1\\n]\\n\\nprint rejoin [\\\"You took \\\" tries \\\" attempts.\\\"]\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \"/*REXX program (a game): reverse a jumbled set of decimal digits 'til they're in order.*/\\nsignal on halt /*allows the CBLF to HALT the program.*/\\n___= copies('─', 9); pad=left('', 9) /*a fence used for computer's messages.*/\\nsay ___ \\\"This game will show you nine random unique digits (1 ──► 9), and you'll enter\\\"\\nsay ___ \\\"one of those digits which will reverse all the digits from the left-most digit\\\"\\nsay ___ \\\"up to (and including) that decimal digit. The game's objective is to get all\\\"\\nsay ___ \\\"of the digits in ascending order with the fewest tries. Here're your digits:\\\"\\nok= 123456789 /*the result that the string should be.*/\\n$= /* ◄─── decimal target to be generated.*/\\n do until length($)==9; _=random(1, 9) /*build a random unique numeric string.*/\\n if pos(_, $) \\\\== 0 then iterate /*¬ unique? Only use a decimal dig once*/\\n $=$ || _ /*construct a string of unique digits. */\\n if $==ok then $= /*string can't be in order, start over.*/\\n end /*until*/\\n\\n do score=1 until $==ok; say /* [↓] display the digits & the prompt*/\\n say ___ $ right('please enter a digit (or Quit):', 50)\\n parse pull ox . 1 ux . 1 x .; upper ux /*get a decimal digit (maybe) from CBLF*/\\n if abbrev('QUIT', ux, 1) then signal halt /*does the CBLF want to quit this game?*/\\n if length(x)>1 then do; say ___ pad '***error*** invalid input: ' ox; iterate; end\\n if x='' then iterate /*try again, CBLF didn't enter anything*/\\n g=pos(x, $) /*validate if the input digit is legal.*/\\n if g==0 then say ___ pad '***error*** invalid digit: ' ox\\n else $=strip(reverse(left($,g))substr($,g+1)) /*reverse some (or all) digits*/\\n end /*score*/\\n\\nsay; say ___ $; say; say center(' Congratulations! ', 70, \\\"═\\\"); say\\nsay ___ pad 'Your score was' score; exit /*stick a fork in it, we're all done. */\\nhalt: say ___ pad 'quitting.'; exit /* \\\" \\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Number reversal game\\n\\nrever = 1:9\\nleftrever = []\\nfor n = 1 to len(rever)\\n rnd = random(8) + 1\\n temp = rever[n]\\n rever[n] = rever[rnd]\\n rever[rnd] = temp\\nnext\\nsee rever\\nsee nl\\nwhile true\\n num = 0\\n leftrever = []\\n showarray(rever)\\n see \\\" : Reverse how many = \\\"\\n give r\\n r = number(r)\\n for n = 1 to r\\n add(leftrever, rever[n])\\n next\\n leftrever = reverse(leftrever)\\n for pos = 1 to r\\n rever[pos] = leftrever[pos]\\n next\\n for m = 1 to len(rever)\\n if rever[m] = m\\n num = num + 1\\n ok\\n next\\n if num = len(rever)\\n exit\\n ok\\nend\\nsee \\\"You took \\\" + num + \\\" attempts.\\\" + nl\\n\\nfunc swap(a, b)\\n temp = a\\n a = b\\n b = temp\\n return [a, b]\\n\\nfunc showarray(vect)\\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\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"ary = (1..9).to_a\\nary.shuffle! while ary == ary.sort\\nscore = 0\\nuntil ary == ary.sort\\n print \\\"#{ary.inspect} -- How many digits to reverse? \\\"\\n num = gets.to_i # should validate input\\n ary[0, num] = ary[0, num].reverse\\n score += 1\\nend\\np ary\\nputs \\\"Your score: #{score}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"for i = 1 to 9 ' get numbers 1 to 9\\n n(i) = i\\nnext i\\nnumShuffles = 3\\n' ----------------------------------\\n' shuffle numbers\\n' ----------------------------------\\nfor \\ti \\t= 1 to 9 * numShuffles\\n\\ti1\\t= int(rnd(1)*9) + 1\\n\\ti2\\t= int(rnd(1)*9) + 1\\n\\th2\\t= n(i1)\\n\\tn(i1)\\t= n(i2)\\n\\tn(i2)\\t= h2\\nnext i\\n\\nfor i = 1 to 9\\n a$ = a$ + str$(n(i)) + \\\" \\\"\\nnext i\\ncount = 0\\n\\n[loop]\\n count = count + 1\\n print count;\\\" : \\\";a$\\n for i = 1 to 9 ' check if in sequence\\n j = i * 2\\n if mid$(a$,j-1,1) > mid$(a$,j,1) then goto [notOrdered]\\n next i\\n print \\\"It took \\\";count;\\\" tries\\\"\\nend\\n\\n[notOrdered]\\ninput \\\"How many numbers to flip:\\\";i\\ni = ((i-1) * 2) + 1\\nb$ = \\\"\\\"\\nfor j = i to 1 step -2\\n b$ = b$ + mid$(a$,j,2)\\nnext j\\na$ = b$ + mid$(a$,i + 2)\\ngoto [loop]\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use rand::prelude::*;\\nuse std::io::stdin;\\n\\nfn is_sorted(seq: &[impl PartialOrd]) -> bool {\\n if seq.len() < 2 {\\n return true;\\n }\\n // Look for any instance where the previous number is larger than the following\\n !seq.iter()\\n .zip(seq[1..].iter())\\n .any(|(prev, foll)| prev > foll)\\n}\\n\\nfn main() {\\n println!(\\n \\\"Number reversal game:\\n Given a jumbled list of the numbers 1 to 9, put the numbers in order.\\n Each attempt you can reverse up to n digits starting from the left.\\n The score is the count of the reversals needed to attain the ascending order.\\\"\\n );\\n let mut rng = thread_rng();\\n\\n let mut sequence: Vec<u8> = (1..10).collect();\\n while is_sorted(&sequence) {\\n sequence.shuffle(&mut rng);\\n }\\n\\n let mut attempt = 1;\\n while !is_sorted(&sequence) {\\n println!(\\n \\\"Attempt {}: {:?} - How many numbers do you want to flip?\\\",\\n attempt, sequence\\n );\\n let flip = {\\n let mut input = String::new();\\n stdin().read_line(&mut input).unwrap();\\n input.trim().parse().unwrap()\\n };\\n sequence[..flip].reverse();\\n attempt += 1;\\n }\\n println!(\\n \\\"Congrats! It took you {} attempts to sort the sequence.\\\",\\n attempt - 1 // Remove additionally counted attempt\\n );\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object NumberReversalGame extends App {\\n def play(n: Int, cur: List[Int], goal: List[Int]) {\\n readLine(s\\\"\\\"\\\"$n. ${cur mkString \\\" \\\"} How many to flip? \\\"\\\"\\\") match {\\n case null => println\\n case s => scala.util.Try(s.toInt) match {\\n case scala.util.Success(i) if i > 0 && i <= cur.length =>\\n (cur.take(i).reverse ++ cur.drop(i)) match {\\n case done if done == goal =>\\n println(s\\\"Congratulations! You solved \\\"+goal.mkString(\\\" \\\"))\\n println(s\\\"Your score is $n (lower is better)\\\")\\n case next => play(n + 1, next, goal)\\n }\\n case _ => println(s\\\"Choose a number between 1 and ${cur.length}\\\")\\n play(n + 1, cur, goal)\\n }\\n }\\n }\\n\\n def play(size: Int) {\\n val goal = List.range(1, size + 1)\\n def init: List[Int] = scala.util.Random.shuffle(goal) match {\\n case repeat if repeat == goal => init\\n case done => done\\n }\\n play(1, init, goal)\\n }\\n\\n play(9)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(import (scheme base)\\n (scheme read)\\n (scheme write)\\n (srfi 1) ; list functions\\n (srfi 27)) ; random numbers\\n\\n(random-source-randomize! default-random-source)\\n\\n(define (make-randomised-list)\\n (let ((vec (apply vector (iota 9 1))))\\n (do ((c 0 (+ 1 c)))\\n ((and (>= c 20) ; at least 20 tries\\n (not (apply < (vector->list vec)))) ; ensures list not in order\\n (vector->list vec))\\n (let* ((i (random-integer 9)) ; swap two randomly chosen elements\\n (j (random-integer 9))\\n (tmp (vector-ref vec i)))\\n (vector-set! vec i (vector-ref vec j))\\n (vector-set! vec j tmp)))))\\n\\n(define (play-game lst plays)\\n (define (reverse-first n lst)\\n (let-values (((start tail) (split-at lst n)))\\n (append (reverse start) tail)))\\n ;\\n (display \\\"List: \\\") (display lst) (newline)\\n (display \\\"How many numbers should be flipped? \\\")\\n (let* ((flip (string->number (read-line)))\\n (new-lst (reverse-first flip lst)))\\n (if (apply < new-lst)\\n (display (string-append \\\"Finished in \\\"\\n (number->string plays)\\n \\\" attempts\\\\n\\\"))\\n (play-game new-lst (+ 1 plays)))))\\n\\n(play-game (make-randomised-list) 1)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n const array integer: sortedList is [] ( 1, 2, 3, 4, 5, 6, 7, 8, 9);\\n var array integer: list is 0 times 0;\\n var array integer: reversedList is 0 times 0;\\n var integer: score is 0;\\n var integer: index is 0;\\n var integer: number is 0;\\n var integer: reverse is 0;\\n begin\\n for number range sortedList do\\n index := rand(1, succ(length(list)));\\n list := list[.. pred(index)] & [] (number) & list[index ..];\\n end for;\\n repeat\\n write(\\\"Current list: \\\");\\n for number range list do\\n write(number <& \\\" \\\");\\n end for;\\n repeat\\n write(\\\" Digits to reverse? \\\");\\n readln(reverse);\\n if reverse < 2 or reverse > 9 then\\n write(\\\"Please enter a value between 2 and 9.\\\");\\n end if;\\n until reverse >= 2 and reverse <= 9;\\n incr(score);\\n reversedList := 0 times 0;\\n for index range reverse downto 1 do\\n reversedList &:= list[index];\\n end for;\\n list := reversedList & list[succ(reverse) ..];\\n until list = sortedList;\\n writeln(\\\"Congratulations, you sorted the list in \\\" <& score <& \\\" reversals.\\\");\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"// set the initial list of digits\\nset currentList to 1..9 sorted by random of a million\\n\\n// make sure we don't start off already sorted\\nrepeat while currentList equals 1..9\\n\\tsort currentList by random of a million\\nend repeat\\n\\n// ask until it is solved\\nrepeat while currentList isn't equal to 1..9\\n\\tadd 1 to numberOfTurns\\n\\tset headline to \\\"Turn #\\\" & numberOfTurns & \\\": You have \\\" & currentList joined by empty\\n\\t\\n\\task \\\"How many digits do you want to reverse?\\\" titled headline message \\\"On each turn, specify the number of initial digits to reverse.\\\"\\n\\tif it isn't a number then exit all -- allow the user to exit\\n\\t\\n\\tsort items 1 to it of currentList descending by the counter\\nend repeat\\n\\nanswer \\\"You sorted it in \\\" & numberOfTurns & \\\" turns!\\\" titled \\\"Congratulations!\\\"\\n\",\n \"language\": \"SenseTalk\"\n },\n {\n \"code\": \"program number_reversal_game;\\n setrandom(0);\\n tries := 0;\\n state := shuffled_numbers();\\n\\n loop until state = \\\"123456789\\\" do\\n tries +:= 1;\\n swapat := read_step(tries, state);\\n state := reverse state(..swapat) + state(swapat+1..);\\n end loop;\\n print(state + \\\" - You win in \\\" + str tries + \\\" tries.\\\");\\n\\n proc read_step(tries, state);\\n loop until r in [str d : d in [1..9]] do\\n putchar(state + \\\" - Reverse how many? \\\");\\n flush(stdout);\\n r := getline(stdin);\\n end loop;\\n return val r;\\n end proc;\\n\\n proc shuffled_numbers();\\n digits := \\\"123456789\\\";\\n loop until out /= digits do\\n dset := {d : d in digits};\\n out := +/[[d := random dset, dset less:= d](1) : until dset = {}];\\n end loop;\\n return out;\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"var turn = 0;\\nvar jumble = @(1..9).bshuffle; # best-shuffle\\n\\nfor (turn; jumble != 1..9; ++turn) {\\n printf(\\\"%2d: %s - Flip how many digits ? \\\", turn, jumble.join(' '));\\n var d = read(Number) \\\\\\\\ break;\\n jumble[0 .. d-1] = [jumble[0 .. d-1]].reverse...;\\n}\\n\\nprint \\\" #{jumble.join(' ')}\\\\n\\\";\\nprint \\\"You won in #{turn} turns.\\\\n\\\";\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n# Simple shuffler, not very efficient but good enough for here\\nproc shuffle list {\\n set result {}\\n while {[llength $list]} {\\n\\tset i [expr {int([llength $list] * rand())}]\\n\\tlappend result [lindex $list $i]\\n\\tset list [lreplace $list $i $i]\\n }\\n return $result\\n}\\n# Returns the list with the prefix of it reversed\\nproc flipfirst {list n} {\\n concat [lreverse [lrange $list 0 $n-1]] [lrange $list $n end]\\n}\\n\\n# Core game engine; list to play with is optional argument\\nproc nrgame {{target \\\"1 2 3 4 5 6 7 8 9\\\"}} {\\n set nums $target\\n while {$nums eq $target} {set nums [shuffle $nums]}\\n set goes 0\\n while {$nums ne $target} {\\n\\tincr goes\\n\\tputs -nonewline \\\"#${goes}: List is '[join $nums {, }]', how many to reverse? \\\"\\n\\tflush stdout\\n\\tgets stdin n\\n\\tif {$n eq \\\"q\\\"} {return quit}\\n\\t# Input validation would go here\\n\\tset nums [flipfirst $nums $n]\\n }\\n return $goes\\n}\\n\\n# Print some instructions and wait for the user to win\\nputs \\\"Welcome to the Number Reversal Game!\\\"\\nputs \\\"------------------------------------\\\"\\nputs \\\"I'll show you a list of numbers, you need to reverse prefixes of them\\\"\\nputs \\\"to get the whole list in ascending order. A 'q' will quit early.\\\\n\\\"\\nputs \\\"\\\"\\nset outcome [nrgame]\\nif {$outcome ne \\\"quit\\\"} {\\n puts \\\"\\\\nYou took $outcome attempts to put the digits in order.\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"RANDOMIZE\\n\\nPRINT \\\"Dada una lista aleatoria de números del 1 al 9,\\\"\\nPRINT \\\"indica cuantos dígitos de la izquierda voltear.\\\"\\nPRINT \\\" El objetivo es obtener los dígitos en orden \\\"\\nPRINT \\\" con el 1 a la izquierda y el 9 a la derecha.\\\"\\nPRINT\\n\\nDIM nums(1 to 9)\\nDIM temp(1 to 9)\\n!valores iniciales\\nFOR x = 1 to 9\\n LET nums(x) = x\\nNEXT x\\n\\nDO !barajamos\\n FOR x = 9 to 2 step -1\\n LET n = round(int(rnd*(x))+1)\\n IF n <> x then\\n !swap (nums(n), nums(x)) !no existe comado SWAP\\n LET temp(n) = nums(x)\\n LET nums(x) = nums(n)\\n LET nums(n) = temp(n)\\n END IF\\n NEXT x\\n FOR x = 1 to 8 !nos aseguramos que no estén en orden\\n IF nums(x) > nums(x+1) then EXIT DO\\n NEXT x\\nLOOP\\n\\nLET denuevo = -1\\nDO\\n IF intentos < 10 then PRINT \\\" \\\";\\n PRINT intentos; \\\":\\\";\\n FOR x = 1 to 9\\n PRINT nums(x);\\n NEXT x\\n\\n IF (not denuevo <> 0) then EXIT DO\\n\\n INPUT prompt \\\" -- ¿Cuántos volteamos? \\\": volteo\\n IF volteo < 0 or volteo > 9 then LET volteo = 0\\n\\n FOR x = 1 to (ip(volteo/2))\\n !swap (nums(x), nums(volteo-x+1)) !no existe SWAP\\n LET temp(n) = nums(volteo-x+1)\\n LET nums(volteo-x+1) = nums(x)\\n LET nums(x) = temp(n)\\n NEXT x\\n\\n LET denuevo = 0\\n !comprobamos el orden\\n FOR x = 1 to 8\\n IF nums(x) > nums(x+1) then\\n LET denuevo = -1\\n EXIT FOR\\n END IF\\n NEXT x\\n\\n IF volteo > 0 then LET intentos = intentos+1\\nLOOP\\n\\nPRINT\\nPRINT\\nPRINT \\\"Necesitaste \\\"; ltrim$(rtrim$(str$(intentos))); \\\" intentos.\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nnumbers=RANDOM_NUMBERS (1,9,9),nr=0\\n\\nSECTION check\\nLOOP o,n=numbers\\n IF (n!=o) THEN\\n DO PRINT\\n EXIT\\n ELSEIF (n==9&&o==9) THEN\\n DO PRINT\\n PRINT \\\" You made it ... in round \\\",r\\n STOP\\n ELSE\\n CYCLE\\n ENDIF\\nENDLOOP\\nENDSECTION\\n\\nSECTION print\\n PRINT numbers\\nENDSECTION\\n\\n\\nDO PRINT\\nLOOP r=1,14\\nIF (nr>=0&&nr<10) THEN\\n ASK \\\"Reverse - how many?\\\": nr=\\\"\\\"\\n i=\\\"\\\"\\n LOOP n=1,nr\\n i=APPEND(i,n)\\n ENDLOOP\\n numbers =SPLIT (numbers)\\n reverse_nr=SELECT (numbers,#i,keep_nr), reverse_nr=REVERSE(reverse_nr)\\n numbers =APPEND (reverse_nr,keep_nr), numbers =JOIN (numbers)\\n DO check\\nENDIF\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"print \\\"\\\\nWelcome to the number reversal game!\\\\n\\\"\\n\\nprint \\\"You must put the numbers in order from 1 to 9.\\\"\\nprint \\\"Your only moves are to reverse groups of numbers\\\"\\nprint \\\"on the left side of the list.\\\"\\n\\ninteger list score\\n\\n# start a new game\\nfunction newgame {\\n\\tinteger i j t\\n\\n\\t# score = number of moves\\n\\t((score = 0))\\n\\n\\t# list = array of numbers\\n\\tset -A list 1 2 3 4 5 6 7 8 9\\n\\twhile true; do\\n\\t\\t# Knuth shuffle\\n\\t\\t((i = 9))\\n\\t\\twhile ((i > 1)); do\\n\\t\\t\\t# get random j from 0 to i - 1\\n\\t\\t\\t((j = RANDOM))\\n\\t\\t\\t((j < 32768 % i)) && continue\\n\\t\\t\\t((j %= i))\\n\\n\\t\\t\\t# decrement i, swap list[i] with list[j]\\n\\t\\t\\t((i -= 1))\\n\\t\\t\\t((t = list[i]))\\n\\t\\t\\t((list[i] = list[j]))\\n\\t\\t\\t((list[j] = t))\\n\\t\\tdone\\n\\t\\twin || break\\n\\tdone\\n}\\n\\n# numbers in order?\\nfunction win {\\n\\tinteger i\\n\\n\\t# check if list[0] == 1, list[1] == 2, ...\\n\\t((i = 0))\\n\\twhile ((i < 9)); do\\n\\t\\t((list[i] != i + 1)) && return 1\\n\\t\\t((i += 1))\\n\\tdone\\n\\treturn 0\\n}\\n\\n# reverse first $1 elements of list\\nfunction reverse {\\n\\tinteger left right t\\n\\n\\t((left = 0))\\n\\t((right = $1 - 1))\\n\\twhile ((right > left)); do\\n\\t\\t((t = list[left]))\\n\\t\\t((list[left] = list[right]))\\n\\t\\t((list[right] = t))\\n\\t\\t((left += 1))\\n\\t\\t((right -= 1))\\n\\tdone\\n}\\n\\n\\ninteger i\\n\\nnewgame\\nwhile true; do\\n\\tprint -n \\\"\\\\nYour list: \\\"\\n\\t((i = 0))\\n\\twhile ((i < 8)); do\\n\\t\\tprintf \\\"%d, \\\" ${list[i]}\\n\\t\\t((i += 1))\\n\\tdone\\n\\tprintf \\\"%d\\\\n\\\" ${list[8]}\\n\\n\\tif win; then\\n\\t\\tprint \\\"YOU WIN!\\\"\\n\\t\\tprintf \\\"Your score is %d moves.\\\\n\\\" $score\\n\\t\\tprint -n \\\"Would you like to play again (y/n)? \\\"\\n\\n\\t\\tif read again && [[ $again = @(y|Y)* ]]; then\\n\\t\\t\\tnewgame\\n\\t\\telse\\n\\t\\t\\tprint \\\"\\\\n\\\\nBye!\\\"\\n\\t\\t\\texit\\n\\t\\tfi\\n\\telse\\n\\t\\tprint -n \\\"How many numbers to reverse? \\\"\\n\\n\\t\\tif read i; then\\n\\t\\t\\t((score += 1))\\n\\t\\t\\treverse $i\\n\\t\\telse\\n\\t\\t\\tprint \\\"\\\\n\\\\nBye!\\\"\\n\\t\\t\\texit\\n\\t\\tfi\\n\\tfi\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import rand\\nimport os\\n\\nfn main() {\\n\\tmut score, mut rnum := 0, 0\\n\\tmut mix, mut unmix := []int{}, []int{}\\n\\tfor mix.len < 9 {\\n\\t\\trnum = rand.int_in_range(1, 10) or {println('Error: invalid number') exit(1)}\\n\\t\\tif mix.contains(rnum) == false {\\n\\t\\t\\tmix << rnum\\n\\t\\t}\\n\\t}\\n\\tunmix = mix.clone()\\n\\tunmix.sort()\\n\\tprintln(\\\"Select how many digits from the left to reverse.\\\")\\n\\tfor {\\n\\t\\tprint(\\\"The list is: ${mix} ==> How many digits to reverse? \\\")\\n\\t\\tinput := os.input('').str().trim_space().int()\\n\\t\\tscore++\\n\\t\\tif input == 0 || input < 2 || input > 9 {\\n\\t\\t\\tprintln(\\\"\\\\n(Enter a number from 2 to 9)\\\")\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tfor idx, rdx := 0, input - 1; idx < rdx; idx, rdx = idx + 1, rdx - 1 {\\n\\t\\t\\tmix[idx], mix[rdx] = mix[rdx], mix[idx]\\n\\t\\t}\\n\\t\\tif mix == unmix {\\n\\t\\t\\tprintln(\\\"The list is: ${mix}.\\\")\\n\\t\\t\\tprintln(\\\"Your score: ${score}. Good job.\\\")\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Private Function shuffle(ByVal a As Variant) As Variant\\n Dim t As Variant, i As Integer\\n For i = UBound(a) To LBound(a) + 1 Step -1\\n j = Int((UBound(a) - LBound(a) + 1) * Rnd + LBound(a))\\n t = a(i)\\n a(i) = a(j)\\n a(j) = t\\n Next i\\n shuffle = a\\nEnd Function\\nPrivate Sub reverse(ByRef a As Variant, n As Integer)\\n Dim b As Variant\\n b = a\\n For i = 1 To n\\n a(i) = b(n + 1 - i)\\n Next i\\nEnd Sub\\nPublic Sub game()\\n Debug.Print \\\"Given a jumbled list of the numbers 1 to 9\\\"\\n Debug.Print \\\"you must select how many digits from the left to reverse.\\\"\\n Debug.Print \\\"Your goal is to get the digits in order with 1 on the left and 9 on the right.\\\"\\n\\n inums = [{1,2,3,4,5,6,7,8,9}]\\n Dim nums As Variant\\n Dim turns As Integer, flip As Integer\\n\\n shuffled = False\\n Do While Not shuffled\\n nums = shuffle(inums)\\n For i = LBound(nums) To UBound(nums)\\n If nums(i) <> inums(i) Then\\n shuffled = True\\n Exit For\\n End If\\n Next i\\n Loop\\n\\n\\n Do While True\\n Debug.Print turns; \\\":\\\";\\n For Each x In nums: Debug.Print x;: Next x\\n Debug.Print\\n flag = False\\n For i = LBound(nums) To UBound(nums)\\n If nums(i) <> inums(i) Then\\n flag = True\\n Exit For\\n End If\\n Next i\\n If flag Then\\n flip = InputBox(\\\" -- How many numbers should be flipped? \\\")\\n reverse nums, flip\\n turns = turns + 1\\n Else\\n Exit Do\\n End If\\n Loop\\n\\n Debug.Print \\\"You took\\\"; turns; \\\"turns to put the digits in order.\\\"\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./sort\\\" for Sort\\nimport \\\"random\\\" for Random\\nimport \\\"io\\\" for Stdin, Stdout\\n\\nvar r= Random.new()\\nvar count = 0\\nvar numbers = [0] * 9\\nnumbers[0] = r.int(2, 10) // this will ensure list isn't ascending\\nfor (i in 1..8) {\\n var rn\\n while(true) {\\n rn = r.int(1, 10)\\n if (!numbers.contains(rn)) break\\n }\\n numbers[i] = rn\\n}\\nSystem.print(\\\"Here's your first list : %(numbers)\\\")\\nwhile (true) {\\n var rev\\n while (true) {\\n System.write(\\\"How many numbers from the left are to be reversed : \\\")\\n Stdout.flush()\\n rev = Num.fromString(Stdin.readLine())\\n if (rev.type == Num && rev.isInteger && rev >= 2 && rev <= 9) break\\n }\\n count = count + 1\\n var i = 0\\n var j = rev - 1\\n while (i < j) {\\n var temp = numbers[i]\\n numbers[i] = numbers[j]\\n numbers[j] = temp\\n i = i + 1\\n j = j - 1\\n }\\n if (Sort.isSorted(numbers)) {\\n System.print(\\\"Here's your final list : %(numbers)\\\")\\n break\\n }\\n System.print(\\\"Here's your list now : %(numbers)\\\")\\n}\\nSystem.print(\\\"So you've completed the game with a score of %(count)\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"int Taken, I, Digit, Num, Score, Rev, Temp;\\nchar List(9);\\ninclude c:\\\\cxpl\\\\codes;\\n \\\\make jumbled list of digits 1 to 9\\n[loop [Taken:= 0; \\\\bit array indicates which digits are taken\\n for I:= 0 to 9-1 do\\n [repeat Digit:= Ran(9)+1 until (Taken & 1<<Digit) = 0;\\n Taken:= Taken + 1<<Digit; \\\\mark digit as taken\\n List(I):= Digit; \\\\add digit to the list\\n ];\\nfor I:= 0 to 9-2 do if List(I) > List(I+1) then quit;\\n]; \\\\quit loop when digits are not in ascending order\\nScore:= 0;\\nloop [for I:= 0 to 9-1 do [IntOut(0, List(I)); ChOut(0, ^ )];\\n Num:= 0; for I:= 0 to 9-1 do Num:= Num*10 + List(I);\\n if Num = 123456789 then quit;\\n Text(0, \\\"^M^JReverse how many digits? \\\"); Rev:= IntIn(0);\\n for I:= 0 to Rev/2-1 do\\n [Temp:= List(I); List(I):= List(Rev-1-I); List(Rev-1-I):= Temp];\\n Score:= Score+1;\\n ];\\nText(0, \\\"^M^JCongrats! You did it in \\\"); IntOut(0, Score);\\nText(0, \\\" moves!!^M^J\\\");\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"// Rosetta Code problem: https://www.rosettacode.org/wiki/Number_reversal_game\\n// by Jjuanhdez, 06/2022\\n\\nprint \\\"Given a jumbled list of the numbers 1 to 9, \\\"\\nprint \\\"you must select how many digits from the left \\\"\\nprint \\\"to reverse. Your goal is to get the digits in \\\"\\nprint \\\"order with 1 on the left and 9 on the right.\\\\n\\\"\\n\\ndim nums(10)\\ndim a(10)\\nintentos = 0: denuevo = true: colum = 6\\n\\n//valores iniciales\\nfor i = 1 to 9\\n nums(i) = i\\nnext i\\n\\nfor i = 9 to 2 step -1\\n n = int(ran(i)) + 1\\n if n <> i then\\n a(i) = nums(i)\\n nums(i) = nums(n)\\n nums(n) = a(i)\\n fi\\nnext i\\n\\nrepeat\\n if intentos < 10 print \\\" \\\";\\n print intentos, \\\": \\\";\\n for i = 1 to 9\\n print nums(i), \\\" \\\";\\n next i\\n\\n if not denuevo break\\n\\n input \\\" -- How many do we flip \\\" volteo\\n if volteo < 0 or volteo > 9 volteo = 0\\n\\n for i = 1 to int(volteo / 2)\\n a(i) = nums(volteo - i + 1)\\n nums(volteo - i + 1) = nums(i)\\n nums(i) = a(i)\\n next i\\n\\n denuevo = false\\n //comprobamos el orden\\n for i = 1 to 8\\n if nums(i) > nums(i + 1) then\\n denuevo = true\\n break\\n fi\\n next i\\n\\n if volteo > 0 intentos = intentos + 1\\nuntil false\\nprint \\\"\\\\n\\\\n You needed \\\", intentos, \\\" attempts.\\\"\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"correctList,scrambledList,N:=[1..9].walk(), correctList.shuffle(),correctList.len();\\ncorrectList,scrambledList=correctList.concat(\\\"\\\"), scrambledList.concat(\\\"\\\"); // list to string\\nattempts:=0;\\nwhile(scrambledList!=correctList){ // Repeat until the sequence is correct\\n n:=ask((\\\"[%d] %s How many numbers (from the left) should be flipped? \\\")\\n\\t .fmt(attempts,scrambledList));\\n try{ n=n.toInt() }catch{ println(\\\"Not a number\\\"); continue; }\\n if(not (0<=n<N)){ println(\\\"Out of range\\\"); continue; }\\n attempts+=1;\\n // Reverse the first part of the string and add the second part\\n scrambledList=scrambledList[0,n].reverse() + scrambledList[n,*];\\n}\\nprintln(\\\"You took %d attempts to get the correct sequence.\\\".fmt(attempts));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Number-reversal-game"}}},{"rowIdx":1453,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Numbers_which_are_not_the_sum_of_distinct_squares\n","language":"00-META"},{"code":"Integer squares are the set of integers multiplied by themselves: 1 x 1 = '''1''', 2 × 2 = '''4''', 3 × 3 = '''9''', etc. ( 1, 4, 9, 16 ... )\n\nMost positive integers can be generated as the sum of 1 or more distinct integer squares.\n\n '''1''' == 1\n '''5''' == 4 + 1\n '''25''' == 16 + 9\n '''77''' == 36 + 25 + 16\n '''103''' == 49 + 25 + 16 + 9 + 4\nMany can be generated in multiple ways:\n\n '''90''' == 36 + 25 + 16 + 9 + 4 == 64 + 16 + 9 + 1 == 49 + 25 + 16 == 64 + 25 + 1 == 81 + 9\n '''130''' == 64 + 36 + 16 + 9 + 4 + 1 == 49 + 36 + 25 + 16 + 4 == 100 + 16 + 9 + 4 + 1 == 81 + 36 + 9 + 4 == 64 + 49 + 16 + 1 == 100 + 25 + 4 + 1 == 81 + 49 == 121 + 9 \n\nThe number of positive integers that '''cannot''' be generated by any combination of distinct squares is in fact finite:\n\n 2, 3, 6, 7, etc.\n\n\n;Task\n\nFind and show here, on this page, '''every''' positive integer than cannot be generated as the sum of distinct squares.\n\nDo not use magic numbers or pre-determined limits. Justify your answer mathematically. \n\n\n;See also\n\n* [[oeis:A001422|OEIS: A001422 Numbers which are not the sum of distinct squares]]\n\n\n","language":"00-TASK"},{"code":"CO find the integers that can't be expressed as the sum of distinct squares\n it can be proved that if 120-324 can be expressed as the sum of distinct\n squares then all integers greater than 129 can be so expressed\n (see the link in the Wren sample) so we need to check that 129-324 can\n be so expressed and find the numbers below 129 that can't be so expressed\nCO\nBEGIN\n INT max number = 324;\n [ 0 : max number ]BOOL is sum; FOR i FROM LWB is sum TO UPB is sum DO is sum[ i ] := FALSE OD;\n INT max square = ENTIER sqrt( 324 );\n [ 0 : max square ]INT square; FOR i FROM LWB square TO UPB square DO square[ i ] := i * i OD;\n\n PROC flag sum = ( INT curr sum, sq pos )VOID:\n IF INT next sum = curr sum + square[ sq pos ];\n next sum <= UPB is sum\n THEN\n is sum[ next sum ] := TRUE;\n FOR i FROM sq pos + 1 TO UPB square DO\n flag sum( next sum, i )\n OD\n FI # flag sum # ;\n\n FOR i FROM LWB square TO UPB square DO\n flag sum( 0, i )\n OD;\n # show the numbers that can't be formed from a sum of distinct squares #\n # and check 129-324 can be so formed #\n INT unformable := 0;\n FOR i FROM LWB is sum TO UPB is sum DO\n IF NOT is sum[ i ] THEN\n print( ( whole( i, -4 ) ) );\n IF ( unformable +:= 1 ) MOD 12 = 0 THEN print( ( newline ) ) FI;\n IF i > 128 THEN\n print( ( newline, \"**** unexpected unformable number: \", whole( i, 0 ), newline ) )\n FI\n FI\n OD\nEND\n","language":"ALGOL-68"},{"code":"begin comment find the integers that can't be expressed as the sum of distinct squares\n it can be proved that if 120-324 can be expressed as the sum of distinct\n squares then all integers greater than 129 can be so expressed\n (see the link in the Wren sample) so we need to check that 129-324 can\n be so expressed and find the numbers below 129 that can't be so expressed\n ;\n integer MAX_NUMBER, MAX_SQUARE;\n MAX_NUMBER := 324;\n MAX_SQUARE := entier( sqrt( MAX_NUMBER ) );\n\n begin\n logical array isSum ( 0 :: MAX_NUMBER );\n integer array square ( 0 :: MAX_SQUARE );\n integer unformable;\n\n procedure flagSum ( integer value currSum, sqPos ) ; begin\n integer nextSum;\n nextSum := currSum + square( sqPos );\n if nextSum <= MAX_NUMBER then begin\n isSum( nextSum ) := true;\n for i := sqPos + 1 until MAX_SQUARE do flagSum( nextSum, i )\n end of_nextSum_le_MAX_NUMBER\n end flagSum ;\n\n for i := 0 until MAX_NUMBER do isSum( i ) := false;\n for i := 0 until MAX_SQUARE do square( i ) := i * i;\n for i := 0 until MAX_SQUARE do flagSum( 0, i );\n % show the numbers that can't be formed from a sum of distinct squares %\n % and check 129-324 can be so formed %\n unformable := 0;\n for i := 0 until MAX_NUMBER do\n if not isSum( i ) then begin\n writeon( i_w := 4, s_w := 0, i );\n unformable := unformable + 1;\n if unformable rem 12 = 0 then write();\n if i > 128 then write( i_w := 1, s_w := 0, \"**** unexpected unformable number: \", i )\n end if_not_isSum__i\n end\nend.\n","language":"ALGOL-W"},{"code":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <iostream>\n#include <numeric>\n#include <vector>\n\nvoid print_vector(const std::vector<int32_t>& list) {\n\tstd::cout << \"[\";\n\tfor ( uint64_t i = 0; i < list.size() - 1; ++i ) {\n\t\tstd::cout << list[i] <<\", \";\n\t}\n\tstd::cout << list.back() << \"]\" << std::endl;\n}\n\nbool sum_of_distinct_squares(const int32_t& n, const std::vector<int32_t>& squares) {\n\tif ( n <= 0 ) {\n\t\treturn false;\n\t}\n\tif ( find(squares.begin(), squares.end(), n) != squares.end() ) {\n\t\treturn true;\n\t}\n\n\tconst int32_t sum = std::accumulate(squares.begin(), squares.end(), 0);\n\tif ( n > sum ) {\n\t\treturn false;\n\t}\n\tif ( n == sum ) {\n\t\treturn true;\n\t}\n\n\tstd::vector<int32_t> reversed_squares(squares);\n\treversed_squares.erase(reversed_squares.end() - 1);\n\tstd::reverse(reversed_squares.begin(), reversed_squares.end());\n\n\treturn sum_of_distinct_squares(n - squares[squares.size() - 1], reversed_squares)\n\t\t|| sum_of_distinct_squares(n, reversed_squares);\n}\n\nint main() {\n\tstd::vector<int32_t> squares;\n\tstd::vector<int32_t> result;\n\tint32_t test_number = 1;\n\tint32_t previous_test_number = 1;\n\twhile ( previous_test_number >= ( test_number >> 1 ) ) {\n\t\tconst int32_t square_root = static_cast<int32_t>(std::sqrt(test_number));\n\t\tif ( square_root * square_root == test_number ) {\n\t\t\tsquares.emplace_back(test_number);\n\t\t}\n\t\tif ( ! sum_of_distinct_squares(test_number, squares) ) {\n\t\t\tresult.emplace_back(test_number);\n\t\t\tprevious_test_number = test_number;\n\t\t}\n\t\ttest_number++;\n\t}\n\n\tstd::cout << \"Numbers which are not the sum of distinct squares:\" << std::endl;\n\tprint_vector(result);\n\tstd::cout << \"\\n\" << \"Stopped checking after finding \" << ( test_number - previous_test_number )\n\t\t<< \" sequential non-gaps after the final gap of \" << previous_test_number << std::endl;\n\tstd::cout << \"Found \" << result.size() << \" numbers in total\" << std::endl;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program {\n\n // recursively permutates the list of squares to seek a matching sum\n static bool soms(int n, IEnumerable<int> f) {\n if (n <= 0) return false;\n if (f.Contains(n)) return true;\n switch(n.CompareTo(f.Sum())) {\n case 1: return false;\n case 0: return true;\n case -1:\n var rf = f.Reverse().Skip(1).ToList();\n return soms(n - f.Last(), rf) || soms(n, rf);\n }\n return false;\n }\n\n static void Main() {\n var sw = System.Diagnostics.Stopwatch.StartNew();\n int c = 0, r, i, g; var s = new List<int>(); var a = new List<int>();\n var sf = \"stopped checking after finding {0} sequential non-gaps after the final gap of {1}\";\n for (i = 1, g = 1; g >= (i >> 1); i++) {\n if ((r = (int)Math.Sqrt(i)) * r == i) s.Add(i);\n if (!soms(i, s)) a.Add(g = i);\n }\n sw.Stop();\n Console.WriteLine(\"Numbers which are not the sum of distinct squares:\");\n Console.WriteLine(string.Join(\", \", a));\n Console.WriteLine(sf, i - g, g);\n Console.Write(\"found {0} total in {1} ms\",\n a.Count, sw.Elapsed.TotalMilliseconds);\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program {\n\n static List<int> y = new List<int>();\n\n // checks permutations of squares in a binary fashion\n static void soms(ref List<int> f, int d) { f.Add(f.Last() + d);\n int l = 1 << f.Count, max = f.Last(), min = max - d;\n var x = new List<int>();\n for (int i = 1; i < l; i++) {\n int j = i, k = 0, r = 0; while (j > 0) {\n if ((j & 1) == 1 && (r += f[k]) >= max) break;\n j >>= 1; k++; } if (r > min && r < max) x.Add(r); }\n for ( ; ++min < max; ) if (!x.Contains(min)) y.Add(min); }\n\n static void Main() {\n var sw = System.Diagnostics.Stopwatch.StartNew();\n var s = new List<int>{ 1 };\n var sf = \"stopped checking after finding {0} sequential non-gaps after the final gap of {1}\";\n for (int d = 1; d <= 29; ) soms(ref s, d += 2);\n sw.Stop();\n Console.WriteLine(\"Numbers which are not the sum of distinct squares:\");\n Console.WriteLine(string.Join (\", \", y));\n Console.WriteLine(\"found {0} total in {1} ms\",\n y.Count, sw.Elapsed.TotalMilliseconds);\n Console.Write(sf, s.Last()-y.Last(),y.Last());\n }\n}\n","language":"C-sharp"},{"code":"{This code would normally be a separate library but is present her for clarity}\n\n{Iterater object to step through all the indices\n{ corresponding to the bits in \"N\". This is used }\n{ step through all the combinations of items }\n\ntype TBitIterator = class(TObject)\n private\n FNumber,FIndex: integer;\n public\n procedure Start(StartNumber: integer);\n function Next(var Index: integer): boolean;\n end;\n\nprocedure TBitIterator.Start(StartNumber: integer);\n{Set the starting value of the number }\nbegin\nFNumber:=StartNumber;\nend;\n\n\nfunction TBitIterator.Next(var Index: integer): boolean;\n{Return the next available index}\nbegin\nResult:=False;\nwhile FNumber>0 do\n\tbegin\n\tResult:=(FNumber and 1)=1;\n\tif Result then Index:=FIndex;\n\tFNumber:=FNumber shr 1;\n\tInc(FIndex);\n\tif Result then break;\n\tend;\nend;\n\n{------------------------------------------------------------------------------}\n\n\nprocedure NonSquareSums(Memo: TMemo);\nvar Squares: TCardinalDynArray;\nvar I,N,Cnt: integer;\nvar S: string;\n\n\tfunction GetSum(N: integer): integer;\n\t{Iterate through all indices corresponding to N}\n\t{Get get the sum of their values}\n\tvar Inx: integer;\n\tvar BI: TBitIterator;\n\tbegin\n\tBI:=TBitIterator.Create;\n\ttry\n\tBI.Start(N);\n\tResult:=0;\n\twhile BI.Next(Inx) do\n\t Result:=Result+Squares[Inx];\n\tfinally BI.Free; end;\n\tend;\n\n\tfunction HasSquareSum(N: integer): boolean;\n\t{See if N is sum of squares}\n\tvar I: integer;\n\tbegin\n\tResult:=True;\n\tfor I:=0 to High(Squares) do\n\t if GetSum(I)=N then exit;\n\tResult:=False;\n\tend;\n\n\nbegin\n{build array of squares for speed}\n{64K^2 max 32-bit integer value}\nSetLength(Squares,65536);\nfor I:=1 to High(Squares) do Squares[I-1]:=I*I;\nS:=''; Cnt:=0;\n{Test numbers up to sqrt(64K) = 64}\nfor I:=1 to trunc(sqrt(Length(Squares))) do\n if not HasSquareSum(I) then\n\tbegin\n\t{display number that aren't sum of squares}\n\tInc(Cnt);\n\tS:=S+Format('%4d',[I]);\n\tif (Cnt mod 10)=0 then S:=S+CRLF;\n\tend;\nMemo.Lines.Add('Numbers which are not the sum of distinct squares');\nMemo.Lines.Add('Count = '+IntToStr(Cnt));\nMemo.Lines.Add(S);\nend;\n","language":"Delphi"},{"code":"maxNumber = 324\nlen isSum[] maxNumber\nmaxSquare = floor sqrt maxNumber\n#\nproc flagSum currSum sqPos . .\n nextSum = currSum + sqPos * sqPos\n if nextSum <= maxNumber\n isSum[nextSum] = 1\n for i = sqPos + 1 to maxSquare\n flagSum nextSum i\n .\n .\n.\nfor i = 1 to maxSquare\n flagSum 0 i\n.\nfor i = 1 to maxNumber\n if isSum[i] = 0\n write i & \" \"\n .\n.\n","language":"EasyLang"},{"code":"program practicalnumbers;\n{$IFDEF Windows} {$APPTYPE CONSOLE} {$ENDIF}\nvar\n HasSum: array of byte;\nfunction FindLongestContiniuosBlock(startIdx,MaxIdx:NativeInt):NativeInt;\nvar\n hs0 : pByte;\n l : NativeInt;\nbegin\n l := 0;\n hs0 := @HasSum[0];\n for startIdx := startIdx to MaxIdx do\n Begin\n IF hs0[startIdx]=0 then\n BREAK;\n inc(l);\n end;\n FindLongestContiniuosBlock := l;\nend;\n\nfunction SumAllSquares(Limit: Uint32):NativeInt;\n//mark sum and than shift by next summand == add\nvar\n hs0, hs1: pByte;\n idx, j, maxlimit, delta,MaxContiniuos,MaxConOffset: NativeInt;\nbegin\n MaxContiniuos := 0;\n MaxConOffset := 0;\n maxlimit := 0;\n hs0 := @HasSum[0];\n hs0[0] := 1; //has sum of 0*0\n idx := 1;\n\n writeln('number offset longest sum of');\n writeln(' block squares');\n while idx <= Limit do\n begin\n delta := idx*idx;\n //delta is within the continiuos range than break\n If (MaxContiniuos-MaxConOffset) > delta then\n BREAK;\n\n //mark oldsum+ delta with oldsum\n hs1 := @hs0[delta];\n for j := maxlimit downto 0 do\n hs1[j] := hs1[j] or hs0[j];\n\n maxlimit := maxlimit + delta;\n\n j := MaxConOffset;\n repeat\n delta := FindLongestContiniuosBlock(j,maxlimit);\n IF delta>MaxContiniuos then\n begin\n MaxContiniuos:= delta;\n MaxConOffset := j;\n end;\n inc(j,delta+1);\n until j > (maxlimit-delta);\n writeln(idx:4,MaxConOffset:7,MaxContiniuos:8,maxlimit:8);\n inc(idx);\n end;\n SumAllSquares:= idx;\nend;\n\nvar\n limit,\n sumsquare,\n n: NativeInt;\nbegin\n Limit := 25;\n sumsquare := 0;\n for n := 1 to Limit do\n sumsquare := sumsquare+n*n;\n writeln('sum of square [1..',limit,'] = ',sumsquare) ;\n writeln;\n\n setlength(HasSum,sumsquare+1);\n n := SumAllSquares(Limit);\n writeln(n);\n for Limit := 1 to n*n do\n if HasSum[Limit]=0 then\n write(Limit,',');\n setlength(HasSum,0);\n {$IFNDEF UNIX} readln; {$ENDIF}\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"Function SumSq(num As Integer) As Integer 'Return sum of squares specified by bits in num\n Dim As Integer n = 1, suma = 0, Sq\n While num\n If num And 1 Then\n Sq = n*n\n suma += Sq\n End If\n num Shr= 1\n n += 1\n Wend\n Return suma\nEnd Function\n\nDim As Integer limite = 1e6, cant = 0, i\nDim As Boolean flags(limite)\n\nFor i = 0 To limite-1\n flags(i) = True\nNext\nFor i = 0 To limite-1\n If i < limite Then flags(SumSq(i)) = False\nNext\n\nFor i = 0 To Sqr(limite)-1\n If flags(i) Then cant += 1: Print i;\nNext\nPrint Chr(10); cant; \" numbers which are not the sum of distinct squares.\"\n\nSleep\n","language":"FreeBASIC"},{"code":"Public flags[1000000] As Boolean\n\nPublic Sub Main()\n\n Dim limite As Integer = 1e6, cant As Integer = 0, i As Integer\n\n For i = 0 To limite - 1\n flags[i] = True\n Next\n For i = 0 To limite - 1\n If i < limite Then flags[SumSq(i)] = False\n Next\n\n For i = 0 To Sqr(limite) - 1\n If flags[i] Then\n cant += 1\n Print i; \" \";\n End If\n Next\n Print Chr(10); cant; \" numbers which are not the sum of distinct squares.\"\n\nEnd\n\nFunction SumSq(num As Integer) As Integer\n\n Dim n As Integer = 1, suma As Integer = 0, Sq As Integer\n\n While num\n If num And 1 Then\n Sq = n * n\n suma += Sq\n End If\n num = num Shr 1\n n += 1\n Wend\n Return suma\n\nEnd Function\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"rcu\"\n)\n\nfunc contains(a []int, n int) bool {\n for _, e := range a {\n if e == n {\n return true\n }\n }\n return false\n}\n\n// recursively permutates the list of squares to seek a matching sum\nfunc soms(n int, f []int) bool {\n if n <= 0 {\n return false\n }\n if contains(f, n) {\n return true\n }\n sum := rcu.SumInts(f)\n if n > sum {\n return false\n }\n if n == sum {\n return true\n }\n rf := make([]int, len(f))\n copy(rf, f)\n for i, j := 0, len(rf)-1; i < j; i, j = i+1, j-1 {\n rf[i], rf[j] = rf[j], rf[i]\n }\n rf = rf[1:]\n return soms(n-f[len(f)-1], rf) || soms(n, rf)\n}\n\nfunc main() {\n var s, a []int\n sf := \"\\nStopped checking after finding %d sequential non-gaps after the final gap of %d\\n\"\n i, g := 1, 1\n for g >= (i >> 1) {\n r := int(math.Sqrt(float64(i)))\n if r*r == i {\n s = append(s, i)\n }\n if !soms(i, s) {\n g = i\n a = append(a, g)\n }\n i++\n }\n fmt.Println(\"Numbers which are not the sum of distinct squares:\")\n fmt.Println(a)\n fmt.Printf(sf, i-g, g)\n fmt.Printf(\"Found %d in total\\n\", len(a))\n}\n\nvar r int\n","language":"Go"},{"code":"task=: {{\n r=. 'invalid'\n lim=. 1\n whilst. -.r -: have do.\n have=. r\n lim=. lim+1\n r=. (i.*:lim) -. (#:i.2^lim)+/ .**:i.lim\n end.\n}}\n","language":"J"},{"code":" task''\n2 3 6 7 8 11 12 15 18 19 22 23 24 27 28 31 32 33 43 44 47 48 60 67 72 76 92 96 108 112 128\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.List;\n\npublic final class NumbersNotSumDistinctSquares {\n\n\tpublic static void main(String[] aArgs) {\n\t\tList<Integer> squares = new ArrayList<Integer>();\n\t\tList<Integer> result = new ArrayList<Integer>();\n\t int testNumber = 1;\n\t int previousTestNumber = 1;\n\t while ( previousTestNumber >= ( testNumber >> 1 ) ) {\n\t final int squareRoot = (int) Math.sqrt(testNumber);\n\t if ( squareRoot * squareRoot == testNumber ) {\n\t squares.add(testNumber);\n\t }\n\t if ( ! sumOfDistinctSquares(testNumber, squares) ) {\t\n\t result.add(testNumber);\n\t previousTestNumber = testNumber;\n\t }\n\t testNumber += 1;\n\t }\n\t\n\t System.out.println(\"Numbers which are not the sum of distinct squares:\");\n\t System.out.println(result);\n\t System.out.println();\n\t System.out.println(\"Stopped checking after finding \" + ( testNumber - previousTestNumber )\n\t \t+ \" sequential non-gaps after the final gap of \" + previousTestNumber);\n\t System.out.println(\"Found \" + result.size() + \" numbers in total\");\n\t}\n\t\n\tprivate static boolean sumOfDistinctSquares(int aN, List<Integer> aSquares) {\n\t\tif ( aN <= 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tif ( aSquares.contains(aN) ) {\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\tfinal int sum = aSquares.stream().mapToInt(Integer::intValue).sum();\n\t\tif ( aN > sum ) {\n\t return false;\n\t }\n\t if ( aN == sum ) {\n\t return true;\n\t }\n\t\n\t List<Integer> reversedSquares = new ArrayList<Integer>(aSquares);\n\t reversedSquares.remove(reversedSquares.size() - 1);\n\t Collections.reverse(reversedSquares);\n\t\n\t return sumOfDistinctSquares(aN - aSquares.get(aSquares.size() - 1), reversedSquares)\n\t \t|| sumOfDistinctSquares(aN, reversedSquares);\n\t}\n\n}\n","language":"Java"},{"code":"#def squares: range(1; infinite) | . * .;\n\n# sums of distinct squares (sods)\n# Output: a stream of [$n, $sums] where $sums is the array of sods based on $n\ndef sods:\n # input: [$n, $sums]\n def next:\n . as [$n, $sums]\n | (($n+1)*($n+1)) as $next\n | reduce $sums[] as $s ($sums + [$next];\n if index($s + $next) then . else . + [$s + $next] end)\n | [$n + 1, unique];\n\n [1, [1]]\n | recurse(next);\n\n# Input: an array\n# Output: the length of the run beginning at $n\ndef length_of_run($n):\n label $out\n | (range($n+1; length),null) as $i\n | if $i == null then (length-$n)\n elif .[$i] == .[$i-1] + 1 then empty\n else $i-$n, break $out\n end;\n\n# Input: an array\ndef length_of_longest_run:\n . as $in\n | first(\n foreach (range(0; length),null) as $i (0;\n if $i == null then .\n else ($in|length_of_run($i)) as $n\n | if $n > . then $n else . end\n end;\n if $i == null or (($in|length) - $i) < . then . else empty end) );\n\ndef sq: .*.;\n\n# Output: [$ix, $length]\ndef relevant_sods:\n first(\n sods\n | . as [$n, $s]\n | ($s|length_of_longest_run) as $length\n | if $length > ($n+1|sq) then . else empty end );\n\ndef not_sum_of_distinct_squares:\n relevant_sods\n | . as [$ix, $sods]\n | [range(2; $ix+2|sq)] - $sods;\n\nnot_sum_of_distinct_squares\n","language":"Jq"},{"code":"#=\nHere we show all the 128 < numbers < 400 can be expressed as a sum of distinct squares. Now\n11 * 11 < 128 < 12 * 12. It is also true that we need no square less than 144 (12 * 12) to\nreduce via subtraction of squares all the numbers above 400 to a number > 128 and < 400 by\nsubtracting discrete squares of numbers over 12, since the interval between such squares can\nbe well below 128: for example, |14^2 - 15^2| is 29. So, we can always find a serial subtraction\nof discrete integer squares from any number > 400 that targets the interval between 129 and\n400. Once we get to that interval, we already have shown in the program below that we can\nuse the remaining squares under 400 to complete the remaining sum.\n=#\n\nusing Combinatorics\n\nsquares = [n * n for n in 1:20]\n\npossibles = [n for n in 1:500 if all(combo -> sum(combo) != n, combinations(squares))]\n\nprintln(possibles)\n","language":"Julia"},{"code":"do --[[ find the integers that can't be expressed as the sum of distinct squares\n it can be proved that if 120-324 can be expressed as the sum of distinct squares\n then all integers greater than 129 can be so expressed (see the link in\n the Wren sample) so we need to check that 129-324 can be so expressed\n and find the numbers below 129 that can't be so expressed\n --]]\n local maxNumber = 324\n local isSum = {}\n local maxSquare = math.floor( math.sqrt( 324 ) )\n local square = {} for i = 0,maxSquare do square[ i ] = i * i end\n\n local function flagSum ( currSum, sqPos )\n local nextSum = currSum + square[ sqPos ]\n if nextSum <= maxNumber then\n isSum[ nextSum ] = true\n for i = sqPos + 1, maxSquare do\n flagSum( nextSum, i )\n end\n end\n end\n\n for i = 0,maxSquare do\n flagSum( 0, i )\n end\n --[[ show the numbers that can't be formed from a sum of distinct squares\n and check 129-324 can be so formed\n --]]\n local unformable = 0\n for i = 0, maxNumber do\n if not isSum[ i ] then\n io.write( string.format( \"%4d\", i ) )\n unformable = unformable + 1\n if unformable % 12 == 0 then io.write( \"\\n\" ) end\n if i > 128 then\n io.write( \"\\n\", \"**** unexpected unformable number: \", i, \"\\n\" )\n end\n end\n end\nend\n","language":"Lua"},{"code":"ClearAll[SumOfSquareable]\nSumOfSquareable[n_Integer] := MemberQ[Total /@ Subsets[Range[1, Floor[Sqrt[n]]]^2, {1, \\[Infinity]}], n]\nnotsummable = {};\ni = 1;\nDo[\n If[SumOfSquareable[i],\n If[i > 1,\n If[i - Max[notsummable] > Max[notsummable],\n Break[]\n ]\n ]\n ,\n AppendTo[notsummable, i]\n ];\n i++\n ,\n {\\[Infinity]}\n ]\nnotsummable\n","language":"Mathematica"},{"code":"MODULE NotSumDistinctSq;\nFROM InOut IMPORT WriteString, WriteLn, WriteCard;\nVAR\n sds : ARRAY [0..324] OF BOOLEAN; (* sum of distinct squares? *)\n j, k, r, rsq, max_true, start, nr_in_line : CARDINAL;\nBEGIN\n sds[0] := TRUE;\n FOR j := 1 TO 324 DO sds[j] := FALSE; END;\n max_true := 0; (* maximum index for which sds is TRUE *)\n FOR r := 1 TO 18 DO\n rsq := r*r;\n (* NB Work backwards, so that the only TRUE values found\n are those set up by previous values of r. *)\n start := 324 - rsq;\n IF start > max_true THEN start := max_true; END;\n FOR j := start TO 0 BY -1 DO\n IF sds[j] THEN\n k := j + rsq;\n sds[k] := TRUE;\n IF k > max_true THEN max_true := k; END;\n END;\n END;\n END;\n\n (* Verify that all integers 129..324 are sums of distinct squares *)\n j := 129;\n WHILE (j <= 324) AND sds[j] DO INC(j); END;\n IF j <= 324 THEN\n WriteString( \"*** Verification failed ***\");\n RETURN;\n END;\n\n (* Print the result *)\n WriteString( \"Positive integers not the sum of distinct squares\");\n WriteLn;\n nr_in_line := 0;\n FOR j := 0 TO 128 DO\n IF NOT sds[j] THEN\n IF nr_in_line = 12 THEN\n WriteLn; nr_in_line := 0;\n END;\n WriteCard(j, 4);\n INC( nr_in_line);\n END;\n END;\nEND NotSumDistinctSq.\n","language":"Modula-2"},{"code":"import std/[algorithm, math, monotimes, strformat, strutils, times]\n\nproc soms(n: int; f: seq[int]): bool =\n ## Recursively permutates the list of squares to seek a matching sum.\n if n <= 0: return false\n if n in f: return true\n case cmp(n, sum(f))\n of 1:\n result = false\n of 0:\n result = true\n else:\n let rf = reversed(f.toOpenArray(0, f.len - 2))\n result = soms(n - f[^1], rf) or soms(n, rf)\n\nlet start = getMonoTime()\nvar s, a: seq[int]\nvar i, g = 1\nwhile g >= i shr 1:\n let r = sqrt(i.toFloat).int\n if r * r == i: s.add i\n if not soms(i, s):\n g = i\n a.add g\n inc i\n\necho \"Numbers which are not the sum of distinct squares:\"\necho a.join(\" \")\necho &\"\\nStopped checking after finding {i - g} sequential non-gaps after the final gap of {g}.\"\necho &\"Found {a.len} total in {(getMonotime() - start).inMicroseconds} µs.\"\n","language":"Nim"},{"code":"use v5.36;\nuse List::Util <sum uniq none>;\nuse Algorithm::Combinatorics 'combinations';\n\nmy @squares = map { $_**2 } 0..100;\nmy $sq;\n\nwhile (++$sq) {\n my(@sums, @run);\n for (1..$sq) {\n push @sums, sum @squares[@$_] for combinations [1..$sq+1], $_\n }\n @sums = uniq sort { $a <=> $b } @sums;\n for (@sums) {\n push(@run, $_) and next unless @run;\n if ($_ == $run[-1] + 1) { push @run, $_ } else { last if @run > $squares[$sq]; @run = () }\n }\n next unless @run;\n for my $i (1..$run[-1]) {\n push @res, $i if none { $i eq $_ } @sums\n }\n last if @run > $squares[$sq];\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">summable</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- (1 can be expressed as 1*1)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sq</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">n</span>\n <span style=\"color: #000000;\">summable</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- (process backwards to avoid adding sq more than once)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">sq</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">sq</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">match</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)),</span><span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">summable</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">nwansods</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"numbers which are not the sum of distinct squares\"</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">shorten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">find_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">summable</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">nwansods</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))})</span>\n<!--\n","language":"Phix"},{"code":" [ [] swap\n behead swap\n witheach\n [ 2dup = iff\n drop done\n dip join ]\n join ] is unique ( [ --> [ )\n\n [ stack ] is cut ( --> s )\n\n [ -1 cut put\n 1 temp put\n 1 swap\n behead swap\n witheach\n [ tuck - -1 = iff\n [ dip 1+\n over temp share\n > if\n [ over temp replace\n i^ cut replace ] ]\n else\n [ nip 1 swap ] ]\n 2drop\n temp take cut take ] is maxrun ( [ --> n n )\n\n [ [] swap 0 over\n witheach [ bit | ]\n swap -1 peek times\n [ dup i^ bit & not if\n [ dip [ i^ join ] ] ]\n drop ] is missing ( [ --> [ )\n\n 1 temp put\n ' [ 0 ]\n 1 from\n [ dup witheach\n [ temp share +\n join ]\n sort unique\n dup maxrun drop\n index 2 + temp tally\n temp share > iff\n end done\n 2 incr ]\n temp release\n dup maxrun\n nip split\n drop missing\n say \"Numbers that are not the sum of distinct squares:\"\n cr echo\n","language":"Quackery"},{"code":"my @squares = ^∞ .map: *²; # Infinite series of squares\n\nfor 1..∞ -> $sq { # for every combination of all squares\n my @sums = @squares[^$sq].combinations».sum.unique.sort;\n my @run;\n for @sums {\n @run.push($_) and next unless @run.elems;\n if $_ == @run.tail + 1 { @run.push: $_ } else { last if @run.elems > @squares[$sq]; @run = () }\n }\n put grep * ∉ @sums, 1..@run.tail and last if @run.elems > @squares[$sq];\n}\n","language":"Raku"},{"code":"var squares = (1..18).map { |i| i * i }.toList\nvar combs = []\nvar results = []\n\n// generate combinations of the numbers 0 to n-1 taken m at a time\nvar combGen = Fn.new { |n, m|\n var s = List.filled(m, 0)\n var last = m - 1\n var rc // recursive closure\n rc = Fn.new { |i, next|\n var j = next\n while (j < n) {\n s[i] = j\n if (i == last) {\n combs.add(s.toList)\n } else {\n rc.call(i+1, j+1)\n }\n j = j + 1\n }\n }\n rc.call(0, 0)\n}\n\nfor (n in 1..324) {\n var all = true\n for (m in 1..18) {\n combGen.call(18, m)\n for (comb in combs) {\n var tot = (0...m).reduce(0) { |acc, i| acc + squares[comb[i]] }\n if (tot == n) {\n all = false\n break\n }\n }\n if (!all) break\n combs.clear()\n }\n if (all) results.add(n)\n}\n\nSystem.print(\"Numbers which are not the sum of distinct squares:\")\nSystem.print(results)\n","language":"Wren"},{"code":"import \"./math\" for Nums\nimport \"./fmt\" for Fmt\n\n// recursively permutates the list of squares to seek a matching sum\nvar soms\nsoms = Fn.new { |n, f|\n if (n <= 0) return false\n if (f.contains(n)) return true\n var sum = Nums.sum(f)\n if (n > sum) return false\n if (n == sum) return true\n var rf = f[-1..0].skip(1).toList\n return soms.call(n - f[-1], rf) || soms.call(n, rf)\n}\n\nvar start = System.clock\nvar s = []\nvar a = []\nvar sf = \"\\nStopped checking after finding $d sequential non-gaps after the final gap of $d\"\nvar i = 1\nvar g = 1\nvar r\nwhile (g >= (i >> 1)) {\n if ((r = i.sqrt.floor) * r == i) s.add(i)\n if (!soms.call(i, s)) a.add(g = i)\n i = i + 1\n}\nSystem.print(\"Numbers which are not the sum of distinct squares:\")\nSystem.print(a.join(\", \"))\nFmt.print(sf, i - g, g)\nFmt.print(\"Found $d total in $d ms.\", a.count, ((System.clock - start)*1000).round)\n","language":"Wren"},{"code":"func SumSq(B); \\Return sum of squares specified by bits in B\nint B, N, Sq, Sum;\n[N:= 1; Sum:= 0;\nwhile B do\n [if B & 1 then\n [Sq:= N*N;\n Sum:= Sum + Sq;\n ];\n B:= B>>1;\n N:= N+1;\n ];\nreturn Sum;\n];\n\ndef Limit = 1_000_000;\nchar Flags(Limit);\nint I;\n[for I:= 0 to Limit-1 do\n Flags(I):= true;\nfor I:= 0 to Limit-1 do\n if I < Limit then\n Flags(SumSq(I)):= false;\nfor I:= 0 to sqrt(Limit)-1 do\n if Flags(I) then\n [IntOut(0, I); ChOut(0, ^ )];\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Numbers_which_are_not_the_sum_of_distinct_squares\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Integer squares are the set of integers multiplied by themselves: 1 x 1 = '''1''', 2 × 2 = '''4''', 3 × 3 = '''9''', etc. ( 1, 4, 9, 16 ... )\\n\\nMost positive integers can be generated as the sum of 1 or more distinct integer squares.\\n\\n '''1''' == 1\\n '''5''' == 4 + 1\\n '''25''' == 16 + 9\\n '''77''' == 36 + 25 + 16\\n '''103''' == 49 + 25 + 16 + 9 + 4\\nMany can be generated in multiple ways:\\n\\n '''90''' == 36 + 25 + 16 + 9 + 4 == 64 + 16 + 9 + 1 == 49 + 25 + 16 == 64 + 25 + 1 == 81 + 9\\n '''130''' == 64 + 36 + 16 + 9 + 4 + 1 == 49 + 36 + 25 + 16 + 4 == 100 + 16 + 9 + 4 + 1 == 81 + 36 + 9 + 4 == 64 + 49 + 16 + 1 == 100 + 25 + 4 + 1 == 81 + 49 == 121 + 9 \\n\\nThe number of positive integers that '''cannot''' be generated by any combination of distinct squares is in fact finite:\\n\\n 2, 3, 6, 7, etc.\\n\\n\\n;Task\\n\\nFind and show here, on this page, '''every''' positive integer than cannot be generated as the sum of distinct squares.\\n\\nDo not use magic numbers or pre-determined limits. Justify your answer mathematically. \\n\\n\\n;See also\\n\\n* [[oeis:A001422|OEIS: A001422 Numbers which are not the sum of distinct squares]]\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"CO find the integers that can't be expressed as the sum of distinct squares\\n it can be proved that if 120-324 can be expressed as the sum of distinct\\n squares then all integers greater than 129 can be so expressed\\n (see the link in the Wren sample) so we need to check that 129-324 can\\n be so expressed and find the numbers below 129 that can't be so expressed\\nCO\\nBEGIN\\n INT max number = 324;\\n [ 0 : max number ]BOOL is sum; FOR i FROM LWB is sum TO UPB is sum DO is sum[ i ] := FALSE OD;\\n INT max square = ENTIER sqrt( 324 );\\n [ 0 : max square ]INT square; FOR i FROM LWB square TO UPB square DO square[ i ] := i * i OD;\\n\\n PROC flag sum = ( INT curr sum, sq pos )VOID:\\n IF INT next sum = curr sum + square[ sq pos ];\\n next sum <= UPB is sum\\n THEN\\n is sum[ next sum ] := TRUE;\\n FOR i FROM sq pos + 1 TO UPB square DO\\n flag sum( next sum, i )\\n OD\\n FI # flag sum # ;\\n\\n FOR i FROM LWB square TO UPB square DO\\n flag sum( 0, i )\\n OD;\\n # show the numbers that can't be formed from a sum of distinct squares #\\n # and check 129-324 can be so formed #\\n INT unformable := 0;\\n FOR i FROM LWB is sum TO UPB is sum DO\\n IF NOT is sum[ i ] THEN\\n print( ( whole( i, -4 ) ) );\\n IF ( unformable +:= 1 ) MOD 12 = 0 THEN print( ( newline ) ) FI;\\n IF i > 128 THEN\\n print( ( newline, \\\"**** unexpected unformable number: \\\", whole( i, 0 ), newline ) )\\n FI\\n FI\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin comment find the integers that can't be expressed as the sum of distinct squares\\n it can be proved that if 120-324 can be expressed as the sum of distinct\\n squares then all integers greater than 129 can be so expressed\\n (see the link in the Wren sample) so we need to check that 129-324 can\\n be so expressed and find the numbers below 129 that can't be so expressed\\n ;\\n integer MAX_NUMBER, MAX_SQUARE;\\n MAX_NUMBER := 324;\\n MAX_SQUARE := entier( sqrt( MAX_NUMBER ) );\\n\\n begin\\n logical array isSum ( 0 :: MAX_NUMBER );\\n integer array square ( 0 :: MAX_SQUARE );\\n integer unformable;\\n\\n procedure flagSum ( integer value currSum, sqPos ) ; begin\\n integer nextSum;\\n nextSum := currSum + square( sqPos );\\n if nextSum <= MAX_NUMBER then begin\\n isSum( nextSum ) := true;\\n for i := sqPos + 1 until MAX_SQUARE do flagSum( nextSum, i )\\n end of_nextSum_le_MAX_NUMBER\\n end flagSum ;\\n\\n for i := 0 until MAX_NUMBER do isSum( i ) := false;\\n for i := 0 until MAX_SQUARE do square( i ) := i * i;\\n for i := 0 until MAX_SQUARE do flagSum( 0, i );\\n % show the numbers that can't be formed from a sum of distinct squares %\\n % and check 129-324 can be so formed %\\n unformable := 0;\\n for i := 0 until MAX_NUMBER do\\n if not isSum( i ) then begin\\n writeon( i_w := 4, s_w := 0, i );\\n unformable := unformable + 1;\\n if unformable rem 12 = 0 then write();\\n if i > 128 then write( i_w := 1, s_w := 0, \\\"**** unexpected unformable number: \\\", i )\\n end if_not_isSum__i\\n end\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdint>\\n#include <iostream>\\n#include <numeric>\\n#include <vector>\\n\\nvoid print_vector(const std::vector<int32_t>& list) {\\n\\tstd::cout << \\\"[\\\";\\n\\tfor ( uint64_t i = 0; i < list.size() - 1; ++i ) {\\n\\t\\tstd::cout << list[i] <<\\\", \\\";\\n\\t}\\n\\tstd::cout << list.back() << \\\"]\\\" << std::endl;\\n}\\n\\nbool sum_of_distinct_squares(const int32_t& n, const std::vector<int32_t>& squares) {\\n\\tif ( n <= 0 ) {\\n\\t\\treturn false;\\n\\t}\\n\\tif ( find(squares.begin(), squares.end(), n) != squares.end() ) {\\n\\t\\treturn true;\\n\\t}\\n\\n\\tconst int32_t sum = std::accumulate(squares.begin(), squares.end(), 0);\\n\\tif ( n > sum ) {\\n\\t\\treturn false;\\n\\t}\\n\\tif ( n == sum ) {\\n\\t\\treturn true;\\n\\t}\\n\\n\\tstd::vector<int32_t> reversed_squares(squares);\\n\\treversed_squares.erase(reversed_squares.end() - 1);\\n\\tstd::reverse(reversed_squares.begin(), reversed_squares.end());\\n\\n\\treturn sum_of_distinct_squares(n - squares[squares.size() - 1], reversed_squares)\\n\\t\\t|| sum_of_distinct_squares(n, reversed_squares);\\n}\\n\\nint main() {\\n\\tstd::vector<int32_t> squares;\\n\\tstd::vector<int32_t> result;\\n\\tint32_t test_number = 1;\\n\\tint32_t previous_test_number = 1;\\n\\twhile ( previous_test_number >= ( test_number >> 1 ) ) {\\n\\t\\tconst int32_t square_root = static_cast<int32_t>(std::sqrt(test_number));\\n\\t\\tif ( square_root * square_root == test_number ) {\\n\\t\\t\\tsquares.emplace_back(test_number);\\n\\t\\t}\\n\\t\\tif ( ! sum_of_distinct_squares(test_number, squares) ) {\\n\\t\\t\\tresult.emplace_back(test_number);\\n\\t\\t\\tprevious_test_number = test_number;\\n\\t\\t}\\n\\t\\ttest_number++;\\n\\t}\\n\\n\\tstd::cout << \\\"Numbers which are not the sum of distinct squares:\\\" << std::endl;\\n\\tprint_vector(result);\\n\\tstd::cout << \\\"\\\\n\\\" << \\\"Stopped checking after finding \\\" << ( test_number - previous_test_number )\\n\\t\\t<< \\\" sequential non-gaps after the final gap of \\\" << previous_test_number << std::endl;\\n\\tstd::cout << \\\"Found \\\" << result.size() << \\\" numbers in total\\\" << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nclass Program {\\n\\n // recursively permutates the list of squares to seek a matching sum\\n static bool soms(int n, IEnumerable<int> f) {\\n if (n <= 0) return false;\\n if (f.Contains(n)) return true;\\n switch(n.CompareTo(f.Sum())) {\\n case 1: return false;\\n case 0: return true;\\n case -1:\\n var rf = f.Reverse().Skip(1).ToList();\\n return soms(n - f.Last(), rf) || soms(n, rf);\\n }\\n return false;\\n }\\n\\n static void Main() {\\n var sw = System.Diagnostics.Stopwatch.StartNew();\\n int c = 0, r, i, g; var s = new List<int>(); var a = new List<int>();\\n var sf = \\\"stopped checking after finding {0} sequential non-gaps after the final gap of {1}\\\";\\n for (i = 1, g = 1; g >= (i >> 1); i++) {\\n if ((r = (int)Math.Sqrt(i)) * r == i) s.Add(i);\\n if (!soms(i, s)) a.Add(g = i);\\n }\\n sw.Stop();\\n Console.WriteLine(\\\"Numbers which are not the sum of distinct squares:\\\");\\n Console.WriteLine(string.Join(\\\", \\\", a));\\n Console.WriteLine(sf, i - g, g);\\n Console.Write(\\\"found {0} total in {1} ms\\\",\\n a.Count, sw.Elapsed.TotalMilliseconds);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nclass Program {\\n\\n static List<int> y = new List<int>();\\n\\n // checks permutations of squares in a binary fashion\\n static void soms(ref List<int> f, int d) { f.Add(f.Last() + d);\\n int l = 1 << f.Count, max = f.Last(), min = max - d;\\n var x = new List<int>();\\n for (int i = 1; i < l; i++) {\\n int j = i, k = 0, r = 0; while (j > 0) {\\n if ((j & 1) == 1 && (r += f[k]) >= max) break;\\n j >>= 1; k++; } if (r > min && r < max) x.Add(r); }\\n for ( ; ++min < max; ) if (!x.Contains(min)) y.Add(min); }\\n\\n static void Main() {\\n var sw = System.Diagnostics.Stopwatch.StartNew();\\n var s = new List<int>{ 1 };\\n var sf = \\\"stopped checking after finding {0} sequential non-gaps after the final gap of {1}\\\";\\n for (int d = 1; d <= 29; ) soms(ref s, d += 2);\\n sw.Stop();\\n Console.WriteLine(\\\"Numbers which are not the sum of distinct squares:\\\");\\n Console.WriteLine(string.Join (\\\", \\\", y));\\n Console.WriteLine(\\\"found {0} total in {1} ms\\\",\\n y.Count, sw.Elapsed.TotalMilliseconds);\\n Console.Write(sf, s.Last()-y.Last(),y.Last());\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"{This code would normally be a separate library but is present her for clarity}\\n\\n{Iterater object to step through all the indices\\n{ corresponding to the bits in \\\"N\\\". This is used }\\n{ step through all the combinations of items }\\n\\ntype TBitIterator = class(TObject)\\n private\\n FNumber,FIndex: integer;\\n public\\n procedure Start(StartNumber: integer);\\n function Next(var Index: integer): boolean;\\n end;\\n\\nprocedure TBitIterator.Start(StartNumber: integer);\\n{Set the starting value of the number }\\nbegin\\nFNumber:=StartNumber;\\nend;\\n\\n\\nfunction TBitIterator.Next(var Index: integer): boolean;\\n{Return the next available index}\\nbegin\\nResult:=False;\\nwhile FNumber>0 do\\n\\tbegin\\n\\tResult:=(FNumber and 1)=1;\\n\\tif Result then Index:=FIndex;\\n\\tFNumber:=FNumber shr 1;\\n\\tInc(FIndex);\\n\\tif Result then break;\\n\\tend;\\nend;\\n\\n{------------------------------------------------------------------------------}\\n\\n\\nprocedure NonSquareSums(Memo: TMemo);\\nvar Squares: TCardinalDynArray;\\nvar I,N,Cnt: integer;\\nvar S: string;\\n\\n\\tfunction GetSum(N: integer): integer;\\n\\t{Iterate through all indices corresponding to N}\\n\\t{Get get the sum of their values}\\n\\tvar Inx: integer;\\n\\tvar BI: TBitIterator;\\n\\tbegin\\n\\tBI:=TBitIterator.Create;\\n\\ttry\\n\\tBI.Start(N);\\n\\tResult:=0;\\n\\twhile BI.Next(Inx) do\\n\\t Result:=Result+Squares[Inx];\\n\\tfinally BI.Free; end;\\n\\tend;\\n\\n\\tfunction HasSquareSum(N: integer): boolean;\\n\\t{See if N is sum of squares}\\n\\tvar I: integer;\\n\\tbegin\\n\\tResult:=True;\\n\\tfor I:=0 to High(Squares) do\\n\\t if GetSum(I)=N then exit;\\n\\tResult:=False;\\n\\tend;\\n\\n\\nbegin\\n{build array of squares for speed}\\n{64K^2 max 32-bit integer value}\\nSetLength(Squares,65536);\\nfor I:=1 to High(Squares) do Squares[I-1]:=I*I;\\nS:=''; Cnt:=0;\\n{Test numbers up to sqrt(64K) = 64}\\nfor I:=1 to trunc(sqrt(Length(Squares))) do\\n if not HasSquareSum(I) then\\n\\tbegin\\n\\t{display number that aren't sum of squares}\\n\\tInc(Cnt);\\n\\tS:=S+Format('%4d',[I]);\\n\\tif (Cnt mod 10)=0 then S:=S+CRLF;\\n\\tend;\\nMemo.Lines.Add('Numbers which are not the sum of distinct squares');\\nMemo.Lines.Add('Count = '+IntToStr(Cnt));\\nMemo.Lines.Add(S);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"maxNumber = 324\\nlen isSum[] maxNumber\\nmaxSquare = floor sqrt maxNumber\\n#\\nproc flagSum currSum sqPos . .\\n nextSum = currSum + sqPos * sqPos\\n if nextSum <= maxNumber\\n isSum[nextSum] = 1\\n for i = sqPos + 1 to maxSquare\\n flagSum nextSum i\\n .\\n .\\n.\\nfor i = 1 to maxSquare\\n flagSum 0 i\\n.\\nfor i = 1 to maxNumber\\n if isSum[i] = 0\\n write i & \\\" \\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"program practicalnumbers;\\n{$IFDEF Windows} {$APPTYPE CONSOLE} {$ENDIF}\\nvar\\n HasSum: array of byte;\\nfunction FindLongestContiniuosBlock(startIdx,MaxIdx:NativeInt):NativeInt;\\nvar\\n hs0 : pByte;\\n l : NativeInt;\\nbegin\\n l := 0;\\n hs0 := @HasSum[0];\\n for startIdx := startIdx to MaxIdx do\\n Begin\\n IF hs0[startIdx]=0 then\\n BREAK;\\n inc(l);\\n end;\\n FindLongestContiniuosBlock := l;\\nend;\\n\\nfunction SumAllSquares(Limit: Uint32):NativeInt;\\n//mark sum and than shift by next summand == add\\nvar\\n hs0, hs1: pByte;\\n idx, j, maxlimit, delta,MaxContiniuos,MaxConOffset: NativeInt;\\nbegin\\n MaxContiniuos := 0;\\n MaxConOffset := 0;\\n maxlimit := 0;\\n hs0 := @HasSum[0];\\n hs0[0] := 1; //has sum of 0*0\\n idx := 1;\\n\\n writeln('number offset longest sum of');\\n writeln(' block squares');\\n while idx <= Limit do\\n begin\\n delta := idx*idx;\\n //delta is within the continiuos range than break\\n If (MaxContiniuos-MaxConOffset) > delta then\\n BREAK;\\n\\n //mark oldsum+ delta with oldsum\\n hs1 := @hs0[delta];\\n for j := maxlimit downto 0 do\\n hs1[j] := hs1[j] or hs0[j];\\n\\n maxlimit := maxlimit + delta;\\n\\n j := MaxConOffset;\\n repeat\\n delta := FindLongestContiniuosBlock(j,maxlimit);\\n IF delta>MaxContiniuos then\\n begin\\n MaxContiniuos:= delta;\\n MaxConOffset := j;\\n end;\\n inc(j,delta+1);\\n until j > (maxlimit-delta);\\n writeln(idx:4,MaxConOffset:7,MaxContiniuos:8,maxlimit:8);\\n inc(idx);\\n end;\\n SumAllSquares:= idx;\\nend;\\n\\nvar\\n limit,\\n sumsquare,\\n n: NativeInt;\\nbegin\\n Limit := 25;\\n sumsquare := 0;\\n for n := 1 to Limit do\\n sumsquare := sumsquare+n*n;\\n writeln('sum of square [1..',limit,'] = ',sumsquare) ;\\n writeln;\\n\\n setlength(HasSum,sumsquare+1);\\n n := SumAllSquares(Limit);\\n writeln(n);\\n for Limit := 1 to n*n do\\n if HasSum[Limit]=0 then\\n write(Limit,',');\\n setlength(HasSum,0);\\n {$IFNDEF UNIX} readln; {$ENDIF}\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"Function SumSq(num As Integer) As Integer 'Return sum of squares specified by bits in num\\n Dim As Integer n = 1, suma = 0, Sq\\n While num\\n If num And 1 Then\\n Sq = n*n\\n suma += Sq\\n End If\\n num Shr= 1\\n n += 1\\n Wend\\n Return suma\\nEnd Function\\n\\nDim As Integer limite = 1e6, cant = 0, i\\nDim As Boolean flags(limite)\\n\\nFor i = 0 To limite-1\\n flags(i) = True\\nNext\\nFor i = 0 To limite-1\\n If i < limite Then flags(SumSq(i)) = False\\nNext\\n\\nFor i = 0 To Sqr(limite)-1\\n If flags(i) Then cant += 1: Print i;\\nNext\\nPrint Chr(10); cant; \\\" numbers which are not the sum of distinct squares.\\\"\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Public flags[1000000] As Boolean\\n\\nPublic Sub Main()\\n\\n Dim limite As Integer = 1e6, cant As Integer = 0, i As Integer\\n\\n For i = 0 To limite - 1\\n flags[i] = True\\n Next\\n For i = 0 To limite - 1\\n If i < limite Then flags[SumSq(i)] = False\\n Next\\n\\n For i = 0 To Sqr(limite) - 1\\n If flags[i] Then\\n cant += 1\\n Print i; \\\" \\\";\\n End If\\n Next\\n Print Chr(10); cant; \\\" numbers which are not the sum of distinct squares.\\\"\\n\\nEnd\\n\\nFunction SumSq(num As Integer) As Integer\\n\\n Dim n As Integer = 1, suma As Integer = 0, Sq As Integer\\n\\n While num\\n If num And 1 Then\\n Sq = n * n\\n suma += Sq\\n End If\\n num = num Shr 1\\n n += 1\\n Wend\\n Return suma\\n\\nEnd Function\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc contains(a []int, n int) bool {\\n for _, e := range a {\\n if e == n {\\n return true\\n }\\n }\\n return false\\n}\\n\\n// recursively permutates the list of squares to seek a matching sum\\nfunc soms(n int, f []int) bool {\\n if n <= 0 {\\n return false\\n }\\n if contains(f, n) {\\n return true\\n }\\n sum := rcu.SumInts(f)\\n if n > sum {\\n return false\\n }\\n if n == sum {\\n return true\\n }\\n rf := make([]int, len(f))\\n copy(rf, f)\\n for i, j := 0, len(rf)-1; i < j; i, j = i+1, j-1 {\\n rf[i], rf[j] = rf[j], rf[i]\\n }\\n rf = rf[1:]\\n return soms(n-f[len(f)-1], rf) || soms(n, rf)\\n}\\n\\nfunc main() {\\n var s, a []int\\n sf := \\\"\\\\nStopped checking after finding %d sequential non-gaps after the final gap of %d\\\\n\\\"\\n i, g := 1, 1\\n for g >= (i >> 1) {\\n r := int(math.Sqrt(float64(i)))\\n if r*r == i {\\n s = append(s, i)\\n }\\n if !soms(i, s) {\\n g = i\\n a = append(a, g)\\n }\\n i++\\n }\\n fmt.Println(\\\"Numbers which are not the sum of distinct squares:\\\")\\n fmt.Println(a)\\n fmt.Printf(sf, i-g, g)\\n fmt.Printf(\\\"Found %d in total\\\\n\\\", len(a))\\n}\\n\\nvar r int\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"task=: {{\\n r=. 'invalid'\\n lim=. 1\\n whilst. -.r -: have do.\\n have=. r\\n lim=. lim+1\\n r=. (i.*:lim) -. (#:i.2^lim)+/ .**:i.lim\\n end.\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" task''\\n2 3 6 7 8 11 12 15 18 19 22 23 24 27 28 31 32 33 43 44 47 48 60 67 72 76 92 96 108 112 128\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.List;\\n\\npublic final class NumbersNotSumDistinctSquares {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tList<Integer> squares = new ArrayList<Integer>();\\n\\t\\tList<Integer> result = new ArrayList<Integer>();\\n\\t int testNumber = 1;\\n\\t int previousTestNumber = 1;\\n\\t while ( previousTestNumber >= ( testNumber >> 1 ) ) {\\n\\t final int squareRoot = (int) Math.sqrt(testNumber);\\n\\t if ( squareRoot * squareRoot == testNumber ) {\\n\\t squares.add(testNumber);\\n\\t }\\n\\t if ( ! sumOfDistinctSquares(testNumber, squares) ) {\\t\\n\\t result.add(testNumber);\\n\\t previousTestNumber = testNumber;\\n\\t }\\n\\t testNumber += 1;\\n\\t }\\n\\t\\n\\t System.out.println(\\\"Numbers which are not the sum of distinct squares:\\\");\\n\\t System.out.println(result);\\n\\t System.out.println();\\n\\t System.out.println(\\\"Stopped checking after finding \\\" + ( testNumber - previousTestNumber )\\n\\t \\t+ \\\" sequential non-gaps after the final gap of \\\" + previousTestNumber);\\n\\t System.out.println(\\\"Found \\\" + result.size() + \\\" numbers in total\\\");\\n\\t}\\n\\t\\n\\tprivate static boolean sumOfDistinctSquares(int aN, List<Integer> aSquares) {\\n\\t\\tif ( aN <= 0 ) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\tif ( aSquares.contains(aN) ) {\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfinal int sum = aSquares.stream().mapToInt(Integer::intValue).sum();\\n\\t\\tif ( aN > sum ) {\\n\\t return false;\\n\\t }\\n\\t if ( aN == sum ) {\\n\\t return true;\\n\\t }\\n\\t\\n\\t List<Integer> reversedSquares = new ArrayList<Integer>(aSquares);\\n\\t reversedSquares.remove(reversedSquares.size() - 1);\\n\\t Collections.reverse(reversedSquares);\\n\\t\\n\\t return sumOfDistinctSquares(aN - aSquares.get(aSquares.size() - 1), reversedSquares)\\n\\t \\t|| sumOfDistinctSquares(aN, reversedSquares);\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"#def squares: range(1; infinite) | . * .;\\n\\n# sums of distinct squares (sods)\\n# Output: a stream of [$n, $sums] where $sums is the array of sods based on $n\\ndef sods:\\n # input: [$n, $sums]\\n def next:\\n . as [$n, $sums]\\n | (($n+1)*($n+1)) as $next\\n | reduce $sums[] as $s ($sums + [$next];\\n if index($s + $next) then . else . + [$s + $next] end)\\n | [$n + 1, unique];\\n\\n [1, [1]]\\n | recurse(next);\\n\\n# Input: an array\\n# Output: the length of the run beginning at $n\\ndef length_of_run($n):\\n label $out\\n | (range($n+1; length),null) as $i\\n | if $i == null then (length-$n)\\n elif .[$i] == .[$i-1] + 1 then empty\\n else $i-$n, break $out\\n end;\\n\\n# Input: an array\\ndef length_of_longest_run:\\n . as $in\\n | first(\\n foreach (range(0; length),null) as $i (0;\\n if $i == null then .\\n else ($in|length_of_run($i)) as $n\\n | if $n > . then $n else . end\\n end;\\n if $i == null or (($in|length) - $i) < . then . else empty end) );\\n\\ndef sq: .*.;\\n\\n# Output: [$ix, $length]\\ndef relevant_sods:\\n first(\\n sods\\n | . as [$n, $s]\\n | ($s|length_of_longest_run) as $length\\n | if $length > ($n+1|sq) then . else empty end );\\n\\ndef not_sum_of_distinct_squares:\\n relevant_sods\\n | . as [$ix, $sods]\\n | [range(2; $ix+2|sq)] - $sods;\\n\\nnot_sum_of_distinct_squares\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"#=\\nHere we show all the 128 < numbers < 400 can be expressed as a sum of distinct squares. Now\\n11 * 11 < 128 < 12 * 12. It is also true that we need no square less than 144 (12 * 12) to\\nreduce via subtraction of squares all the numbers above 400 to a number > 128 and < 400 by\\nsubtracting discrete squares of numbers over 12, since the interval between such squares can\\nbe well below 128: for example, |14^2 - 15^2| is 29. So, we can always find a serial subtraction\\nof discrete integer squares from any number > 400 that targets the interval between 129 and\\n400. Once we get to that interval, we already have shown in the program below that we can\\nuse the remaining squares under 400 to complete the remaining sum.\\n=#\\n\\nusing Combinatorics\\n\\nsquares = [n * n for n in 1:20]\\n\\npossibles = [n for n in 1:500 if all(combo -> sum(combo) != n, combinations(squares))]\\n\\nprintln(possibles)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"do --[[ find the integers that can't be expressed as the sum of distinct squares\\n it can be proved that if 120-324 can be expressed as the sum of distinct squares\\n then all integers greater than 129 can be so expressed (see the link in\\n the Wren sample) so we need to check that 129-324 can be so expressed\\n and find the numbers below 129 that can't be so expressed\\n --]]\\n local maxNumber = 324\\n local isSum = {}\\n local maxSquare = math.floor( math.sqrt( 324 ) )\\n local square = {} for i = 0,maxSquare do square[ i ] = i * i end\\n\\n local function flagSum ( currSum, sqPos )\\n local nextSum = currSum + square[ sqPos ]\\n if nextSum <= maxNumber then\\n isSum[ nextSum ] = true\\n for i = sqPos + 1, maxSquare do\\n flagSum( nextSum, i )\\n end\\n end\\n end\\n\\n for i = 0,maxSquare do\\n flagSum( 0, i )\\n end\\n --[[ show the numbers that can't be formed from a sum of distinct squares\\n and check 129-324 can be so formed\\n --]]\\n local unformable = 0\\n for i = 0, maxNumber do\\n if not isSum[ i ] then\\n io.write( string.format( \\\"%4d\\\", i ) )\\n unformable = unformable + 1\\n if unformable % 12 == 0 then io.write( \\\"\\\\n\\\" ) end\\n if i > 128 then\\n io.write( \\\"\\\\n\\\", \\\"**** unexpected unformable number: \\\", i, \\\"\\\\n\\\" )\\n end\\n end\\n end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[SumOfSquareable]\\nSumOfSquareable[n_Integer] := MemberQ[Total /@ Subsets[Range[1, Floor[Sqrt[n]]]^2, {1, \\\\[Infinity]}], n]\\nnotsummable = {};\\ni = 1;\\nDo[\\n If[SumOfSquareable[i],\\n If[i > 1,\\n If[i - Max[notsummable] > Max[notsummable],\\n Break[]\\n ]\\n ]\\n ,\\n AppendTo[notsummable, i]\\n ];\\n i++\\n ,\\n {\\\\[Infinity]}\\n ]\\nnotsummable\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"MODULE NotSumDistinctSq;\\nFROM InOut IMPORT WriteString, WriteLn, WriteCard;\\nVAR\\n sds : ARRAY [0..324] OF BOOLEAN; (* sum of distinct squares? *)\\n j, k, r, rsq, max_true, start, nr_in_line : CARDINAL;\\nBEGIN\\n sds[0] := TRUE;\\n FOR j := 1 TO 324 DO sds[j] := FALSE; END;\\n max_true := 0; (* maximum index for which sds is TRUE *)\\n FOR r := 1 TO 18 DO\\n rsq := r*r;\\n (* NB Work backwards, so that the only TRUE values found\\n are those set up by previous values of r. *)\\n start := 324 - rsq;\\n IF start > max_true THEN start := max_true; END;\\n FOR j := start TO 0 BY -1 DO\\n IF sds[j] THEN\\n k := j + rsq;\\n sds[k] := TRUE;\\n IF k > max_true THEN max_true := k; END;\\n END;\\n END;\\n END;\\n\\n (* Verify that all integers 129..324 are sums of distinct squares *)\\n j := 129;\\n WHILE (j <= 324) AND sds[j] DO INC(j); END;\\n IF j <= 324 THEN\\n WriteString( \\\"*** Verification failed ***\\\");\\n RETURN;\\n END;\\n\\n (* Print the result *)\\n WriteString( \\\"Positive integers not the sum of distinct squares\\\");\\n WriteLn;\\n nr_in_line := 0;\\n FOR j := 0 TO 128 DO\\n IF NOT sds[j] THEN\\n IF nr_in_line = 12 THEN\\n WriteLn; nr_in_line := 0;\\n END;\\n WriteCard(j, 4);\\n INC( nr_in_line);\\n END;\\n END;\\nEND NotSumDistinctSq.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"import std/[algorithm, math, monotimes, strformat, strutils, times]\\n\\nproc soms(n: int; f: seq[int]): bool =\\n ## Recursively permutates the list of squares to seek a matching sum.\\n if n <= 0: return false\\n if n in f: return true\\n case cmp(n, sum(f))\\n of 1:\\n result = false\\n of 0:\\n result = true\\n else:\\n let rf = reversed(f.toOpenArray(0, f.len - 2))\\n result = soms(n - f[^1], rf) or soms(n, rf)\\n\\nlet start = getMonoTime()\\nvar s, a: seq[int]\\nvar i, g = 1\\nwhile g >= i shr 1:\\n let r = sqrt(i.toFloat).int\\n if r * r == i: s.add i\\n if not soms(i, s):\\n g = i\\n a.add g\\n inc i\\n\\necho \\\"Numbers which are not the sum of distinct squares:\\\"\\necho a.join(\\\" \\\")\\necho &\\\"\\\\nStopped checking after finding {i - g} sequential non-gaps after the final gap of {g}.\\\"\\necho &\\\"Found {a.len} total in {(getMonotime() - start).inMicroseconds} µs.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use v5.36;\\nuse List::Util <sum uniq none>;\\nuse Algorithm::Combinatorics 'combinations';\\n\\nmy @squares = map { $_**2 } 0..100;\\nmy $sq;\\n\\nwhile (++$sq) {\\n my(@sums, @run);\\n for (1..$sq) {\\n push @sums, sum @squares[@$_] for combinations [1..$sq+1], $_\\n }\\n @sums = uniq sort { $a <=> $b } @sums;\\n for (@sums) {\\n push(@run, $_) and next unless @run;\\n if ($_ == $run[-1] + 1) { push @run, $_ } else { last if @run > $squares[$sq]; @run = () }\\n }\\n next unless @run;\\n for my $i (1..$run[-1]) {\\n push @res, $i if none { $i eq $_ } @sums\\n }\\n last if @run > $squares[$sq];\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">summable</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (1 can be expressed as 1*1)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #000000;\\\">summable</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (process backwards to avoid adding sq more than once)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">sq</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">sq</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">match</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)),</span><span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">summable</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">nwansods</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"numbers which are not the sum of distinct squares\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">shorten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">find_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">summable</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">nwansods</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \" [ [] swap\\n behead swap\\n witheach\\n [ 2dup = iff\\n drop done\\n dip join ]\\n join ] is unique ( [ --> [ )\\n\\n [ stack ] is cut ( --> s )\\n\\n [ -1 cut put\\n 1 temp put\\n 1 swap\\n behead swap\\n witheach\\n [ tuck - -1 = iff\\n [ dip 1+\\n over temp share\\n > if\\n [ over temp replace\\n i^ cut replace ] ]\\n else\\n [ nip 1 swap ] ]\\n 2drop\\n temp take cut take ] is maxrun ( [ --> n n )\\n\\n [ [] swap 0 over\\n witheach [ bit | ]\\n swap -1 peek times\\n [ dup i^ bit & not if\\n [ dip [ i^ join ] ] ]\\n drop ] is missing ( [ --> [ )\\n\\n 1 temp put\\n ' [ 0 ]\\n 1 from\\n [ dup witheach\\n [ temp share +\\n join ]\\n sort unique\\n dup maxrun drop\\n index 2 + temp tally\\n temp share > iff\\n end done\\n 2 incr ]\\n temp release\\n dup maxrun\\n nip split\\n drop missing\\n say \\\"Numbers that are not the sum of distinct squares:\\\"\\n cr echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my @squares = ^∞ .map: *²; # Infinite series of squares\\n\\nfor 1..∞ -> $sq { # for every combination of all squares\\n my @sums = @squares[^$sq].combinations».sum.unique.sort;\\n my @run;\\n for @sums {\\n @run.push($_) and next unless @run.elems;\\n if $_ == @run.tail + 1 { @run.push: $_ } else { last if @run.elems > @squares[$sq]; @run = () }\\n }\\n put grep * ∉ @sums, 1..@run.tail and last if @run.elems > @squares[$sq];\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"var squares = (1..18).map { |i| i * i }.toList\\nvar combs = []\\nvar results = []\\n\\n// generate combinations of the numbers 0 to n-1 taken m at a time\\nvar combGen = Fn.new { |n, m|\\n var s = List.filled(m, 0)\\n var last = m - 1\\n var rc // recursive closure\\n rc = Fn.new { |i, next|\\n var j = next\\n while (j < n) {\\n s[i] = j\\n if (i == last) {\\n combs.add(s.toList)\\n } else {\\n rc.call(i+1, j+1)\\n }\\n j = j + 1\\n }\\n }\\n rc.call(0, 0)\\n}\\n\\nfor (n in 1..324) {\\n var all = true\\n for (m in 1..18) {\\n combGen.call(18, m)\\n for (comb in combs) {\\n var tot = (0...m).reduce(0) { |acc, i| acc + squares[comb[i]] }\\n if (tot == n) {\\n all = false\\n break\\n }\\n }\\n if (!all) break\\n combs.clear()\\n }\\n if (all) results.add(n)\\n}\\n\\nSystem.print(\\\"Numbers which are not the sum of distinct squares:\\\")\\nSystem.print(results)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Nums\\nimport \\\"./fmt\\\" for Fmt\\n\\n// recursively permutates the list of squares to seek a matching sum\\nvar soms\\nsoms = Fn.new { |n, f|\\n if (n <= 0) return false\\n if (f.contains(n)) return true\\n var sum = Nums.sum(f)\\n if (n > sum) return false\\n if (n == sum) return true\\n var rf = f[-1..0].skip(1).toList\\n return soms.call(n - f[-1], rf) || soms.call(n, rf)\\n}\\n\\nvar start = System.clock\\nvar s = []\\nvar a = []\\nvar sf = \\\"\\\\nStopped checking after finding $d sequential non-gaps after the final gap of $d\\\"\\nvar i = 1\\nvar g = 1\\nvar r\\nwhile (g >= (i >> 1)) {\\n if ((r = i.sqrt.floor) * r == i) s.add(i)\\n if (!soms.call(i, s)) a.add(g = i)\\n i = i + 1\\n}\\nSystem.print(\\\"Numbers which are not the sum of distinct squares:\\\")\\nSystem.print(a.join(\\\", \\\"))\\nFmt.print(sf, i - g, g)\\nFmt.print(\\\"Found $d total in $d ms.\\\", a.count, ((System.clock - start)*1000).round)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func SumSq(B); \\\\Return sum of squares specified by bits in B\\nint B, N, Sq, Sum;\\n[N:= 1; Sum:= 0;\\nwhile B do\\n [if B & 1 then\\n [Sq:= N*N;\\n Sum:= Sum + Sq;\\n ];\\n B:= B>>1;\\n N:= N+1;\\n ];\\nreturn Sum;\\n];\\n\\ndef Limit = 1_000_000;\\nchar Flags(Limit);\\nint I;\\n[for I:= 0 to Limit-1 do\\n Flags(I):= true;\\nfor I:= 0 to Limit-1 do\\n if I < Limit then\\n Flags(SumSq(I)):= false;\\nfor I:= 0 to sqrt(Limit)-1 do\\n if Flags(I) then\\n [IntOut(0, I); ChOut(0, ^ )];\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Numbers-which-are-not-the-sum-of-distinct-squares"}}},{"rowIdx":1454,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Numbers_with_equal_rises_and_falls\n","language":"00-META"},{"code":"When a number is written in base 10, adjacent digits may \"rise\" or \"fall\" as the number is read (usually from left to right).\n\n\n;Definition:\nGiven the decimal digits of the number are written as a series <big>d</big>:\n:* A ''rise'' is an index <big>i</big> such that <big> d(i) < d(i+1)</big>\n:* A ''fall'' is an index <big>i</big> such that <big> d(i) > d(i+1)</big>\n\n\n;Examples:\n:* The number '''726,169''' has '''3''' rises and '''2''' falls, so it <u>isn't</u> in the sequence.\n:* The number '''83,548''' has '''2''' rises and '''2''' falls, so it <u>is</u> in the sequence.\n\n\n;Task:\n:* Print the first '''200''' numbers in the sequence \n:* Show that the '''10 millionth''' (10,000,000<sup>th</sup>) number in the sequence is '''41,909,002'''\n\n\n;See also:\n* OEIS Sequence [[OEIS:A296712|A296712]] describes numbers whose digit sequence in base 10 have equal \"rises\" and \"falls\".\n\n\n;Related tasks:\n* [[Esthetic_numbers|Esthetic numbers]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F riseEqFall(=num)\n ‘Check whether a number belongs to sequence A296712.’\n V height = 0\n V d1 = num % 10\n num I/= 10\n L num != 0\n V d2 = num % 10\n height += (d1 < d2) - (d1 > d2)\n d1 = d2\n num I/= 10\n R height == 0\n\nV num = 0\nF nextNum()\n L\n :num++\n I riseEqFall(:num)\n L.break\n R :num\n\nprint(‘The first 200 numbers are:’)\nL 200\n print(nextNum(), end' ‘ ’)\nprint()\n\nL 0 .< 10'000'000 - 200 - 1\n nextNum()\nprint(‘The 10,000,000th number is: ’nextNum())\n","language":"11l"},{"code":"puts:\tequ\t9\t; CP/M calls\nputch:\tequ\t2\n\torg\t100h\n\t;;;\tPrint first 200 numbers\n\tlxi\td,first\n\tmvi\tc,puts\n\tcall\t5\n\tmvi\tb,200\t; 200 numbers\nf200:\tpush\tb\n\tcall\tnext\t; Get next number\n\tcall\tpnum\t; Print the number\n\tpop\tb\t; Restore counter\n\tdcr\tb\t; Are we there yet?\n\tjnz\tf200\t; If not, next number\n\t;;;\tFind 10,000,000th number\n\tlxi\td,tenmil\n\tmvi\tc,puts\n\tcall\t5\nf1e7:\tcall\tnext\t; Keep generating numbers until ten million reached\n\tjnz\tf1e7\t; Then print the number\n\t;;;\tPrint the current number\npnum:\tlxi\td,num\npscan:\tdcx\td\t; Scan for zero\n\tldax\td\n\tana\ta\n\tjnz\tpscan\n\tmvi\tc,puts\t; Once found, print string\n\tjmp\t5\n\t;;;\tIncrement number until rises and falls are equal\nnext:\tlxi\th,num\nincdgt:\tmov\ta,m\t; Get digit\n\tana\ta\t; If 0, then initialize\n\tjz\tgrow\n\tinr\ta\t; Otherwise, increment\n\tmov\tm,a\t; Store back\n\tcpi\t'9'+1\t; Rollover?\n\tjnz\tidone\t; If not, we're done\n\tmvi\tm,'0'\t; If so, set digit to 0\n\tdcx\th\t; And increment previous digit\n\tjmp\tincdgt\ngrow:\tmvi\tm,'1'\nidone:\tlxi\th,num\t; Find rises and falls\n\tmvi\tb,0\t; B = rises - falls\n\tmov\tc,m\t; C = right digit in comparison\npair:\tdcx\th\n\tmov\ta,m\t; A = left digit in comparison\n\tana\ta\t; When zero, done\n\tjz\tcheck\n\tcmp\tc\t; Compare left digit to right digit\n\tjc\tfall\t; A<C = fall\n\tjnz\trise\t; A>C = rise\nnxdgt:\tmov\tc,a\t; C is now left digit\n\tjmp\tpair\t; Check next pair\nfall:\tdcr\tb\t; Fall: decrement B\n\tjmp\tnxdgt\nrise:\tinr\tb\t; Rise: increment B\n\tjmp\tnxdgt\ncheck:\tmov\ta,b\t; If B=0 then rises and falls are equal\n\tana\ta\n\tjnz\tnext\t; Otherwise, increment number and try again\n\tlxi\th,ctr\t; But if so, decrement the counter to 10 million\n\tmov\ta,m\t; First byte\n\tsui\t1\n\tmov\tm,a\n\tinx\th\t; Second byte\n\tmov\ta,m\n\tsbb\tb\t; B=0 here\n\tmov\tm,a\n\tinx\th\t; Third byte\n\tmov\ta,m\n\tsbb\tb\n\tmov\tm,a\n\tdcx\th\t; OR them together to see if the number is zero\n\tora\tm\n\tdcx\th\n\tora\tm\n\tret\n\t;;;\tStrings\nfirst:\tdb\t'The first 200 numbers are:',13,10,'$'\ntenmil:\tdb\t13,10,10,'The 10,000,000th number is: $'\n\t;;;\tCurrent number (stored as ASCII)\n\tdb\t0,0,0,0,0,0,0,0\nnum:\tdb\t'0 $'\n\t;;;\t24-bit counter to keep track of ten million\nctr:\tdb\t80h,96h,98h\t; 1e7 = 989680h\n","language":"8080-Assembly"},{"code":"puts:\tequ\t9\t\t; MS-DOS print string\n\tcpu\t8086\n\tbits\t16\n\torg\t100h\nsection\t.text\n\tmov\tbp,98h\t\t; BP:DI = 989680h = ten million\n\tmov\tdi,9680h\n\t;;;\tPrint first 200 numbers\n\tmov\tdx,first\t; Print message\n\tmov\tah,puts\n\tint\t21h\nn200:\tcall\tnext\t\t; Get next number\n\tcall\tpnum\t\t; Print the number\n\tcmp\tdi,95B8h\t; Have we had 200 yet?\n\tja\tn200\t\t; If not, print next number\n\t;;;\tPrint the 10 millionth number\n\tmov\tdx,tenmil\t; Print message\n\tmov\tah,puts\n\tint\t21h\nn1e7:\tcall\tnext\t\t; Get next number\n\tjnz\tn1e7\t\t; Until we have the 10 millionth\n\t;;;\tPrint the current number\npnum:\tstd\t\t\t; Read backwards\n\txchg\tsi,di\t\t; Keep DI safe\n\tmov\tdi,num\n\tmov\tcx,9\n\txor\tal,al\t\t; Find the first zero\n\trepnz\tscasb\n\tinc\tdi\t\t; Go to first digit\n\tinc\tdi\n\txchg\tsi,di\t\t; Put DI back\n\tmov\tdx,si\t\t; Call DOS to print the number\n\tmov\tah,puts\n\tint\t21h\n\tret\n\t;;;\tIncrement number until rises and falls are equal\nnext:\tstd\t\t\t; Read number backwards\n.inc:\tmov\tbx,num\n.iloop:\tmov\tal,[bx]\t\t; Get digit\n\ttest\tal,al\t\t; If uninitialized, write a 1\n\tjz\t.grow\n\tinc\tax\t\t; Otherwise, increment\n\tmov\t[bx],al\t\t; Write it back\n\tcmp\tal,'9'+1\t; Rollover?\n\tjnz\t.idone\t\t; If not, the increment is done\n\tmov\t[bx],byte '0'\t; But if so, this digit should be 0,\n\tdec\tbx\t\t; and the next digit incremented.\n\tjmp\t.iloop\n.grow:\tmov\t[bx],byte '1'\t; The number gains an extra digit\n.idone:\txor\tbl,bl\t\t; BL = rise and fall counter\n\tmov\tsi,num\n\tlodsb\t\t\t; Read first digit to compare to\n.pair:\txchg\tah,al\t\t; Previous digit to compare\n\tlodsb\t\t\t; Read next digit\n\ttest\tal,al\t\t; Done yet?\n\tjz\t.done\n\tcmp\tal,ah\t\t; If not, compare the digits\n\tja\t.fall\t\t; If they are different,\t\n\tjb\t.rise\t\t; there is a fall or a rise\n\tjmp\t.pair\t\t; Otherwise, try next pair\n.fall:\tdec\tbl\t\t; Fall: decrement BL\n\tjmp\t.pair\n.rise:\tinc\tbl\t\t; Rise: increment BL\n\tjmp\t.pair\n.done:\ttest\tbl,bl\t\t; At the end, check if BL is zero\n\tjnz\t.inc\t\t; If not, try next number\n\tsub\tdi,1\t\t; Decrement the million counter in BP:DI\n\tsbb\tbp,0\n\tmov\tax,di\t\t; Test if BP:DI is zero\n\tor\tax,bp\n\tret\nsection\t.data\n\t;;;\tStrings\nfirst:\tdb\t'The first 200 numbers are:',13,10,'$'\ntenmil:\tdb\t13,10,10,'The 10,000,000th number is: $'\n\t;;;\tCurrent number, stored as ASCII\n\tdb\t0,0,0,0,0,0,0,0\nnum:\tdb\t'0 $'\n","language":"8086-Assembly"},{"code":"with Ada.Text_Io;\nwith Ada.Integer_Text_Io;\n\nprocedure Equal_Rise_Fall is\n use Ada.Text_Io;\n\n function Has_Equal_Rise_Fall (Value : Natural) return Boolean is\n Rises : Natural := 0;\n Falls : Natural := 0;\n Image : constant String := Natural'Image (Value);\n Last : Character := Image (Image'First + 1);\n begin\n for Pos in Image'First + 2 .. Image'Last loop\n if Image (Pos) > Last then\n Rises := Rises + 1;\n elsif Image (Pos) < Last then\n Falls := Falls + 1;\n end if;\n Last := Image (Pos);\n end loop;\n return Rises = Falls;\n end Has_Equal_Rise_Fall;\n\n Value : Natural := 1;\n Count : Natural := 0;\nbegin\n loop\n if Has_Equal_Rise_Fall (Value) then\n Count := Count + 1;\n if Count <= 200 then\n Ada.Integer_Text_Io.Put (Value, Width => 5);\n if Count mod 20 = 0 then\n New_Line;\n end if;\n end if;\n if Count = 10_000_000 then\n New_Line;\n Put_Line (\"The 10_000_000th: \" & Natural'Image (Value));\n exit;\n end if;\n end if;\n Value := Value + 1;\n end loop;\nend Equal_Rise_Fall;\n","language":"Ada"},{"code":"BEGIN\n # returns TRUE if the number of digits in n followed by a higher digit (rises) #\n # equals the number of digits followed by a lower digit (falls) #\n # FALSE otherwise #\n PROC rises equals falls = ( INT n )BOOL:\n BEGIN\n INT rf := 0;\n INT prev := n MOD 10;\n INT v := n OVER 10;\n WHILE v > 0 DO\n INT d = v MOD 10;\n IF d < prev THEN\n rf +:= 1 # rise #\n ELIF d > prev THEN\n rf -:= 1 # fall #\n FI;\n prev := d;\n v OVERAB 10\n OD;\n rf = 0\n END; # rises equals falls #\n # task tests #\n print( ( \"The first 200 numbers in the sequence are:\", newline ) );\n INT count := 0;\n INT max count = 10 000 000;\n FOR n WHILE count < max count DO\n IF rises equals falls( n ) THEN\n count +:= 1;\n IF count <= 200 THEN\n print( ( whole( n, -4 ) ) );\n IF count MOD 20 = 0 THEN print( ( newline ) ) FI\n ELIF count = max count THEN\n print( ( newline, \"The 10 millionth number in the sequence is \", whole( n, -8 ), \".\", newline ) )\n FI\n FI\n OD\nEND\n","language":"ALGOL-68"},{"code":"risefall←{\n ⍝ Determine if a number is in the sequence\n inSeq←0=(+/2(<->)/10(⊥⍣¯1)⊢)\n\n ⍝ First 200 numbers\n ⎕←'The first 200 numbers are:'\n ⎕←(⊢(/⍨)inSeq¨)⍳404\n\n ⍝ 10,000,000th number\n ⍝ You can't just make a list that big and filter\n ⍝ it, because that will just get you a WS FULL.\n ⍝ Instead it's necessary to loop over them the old-\n ⍝ fashioned way\n ⍞←'The 10,000,000th number is: '\n ⎕←1e7{⍺=0:⍵-1 ⋄ (⍺-inSeq ⍵)∇ ⍵+1}1\n}\n","language":"APL"},{"code":"limit1 := 200, limit2 := 10000000\ncount := 0, result1 := result1 := \"\"\nloop{\n num := A_Index\n if !Rise_Fall(num)\n continue\n count++\n if (count <= limit1)\n result1 .= num . (Mod(count, 20) ? \"`t\" : \"`n\")\n if (count = limit2){\n result2 := num\n break\n }\n if !mod(count, 10000)\n ToolTip % count\n}\nToolTip\nMsgBox % \"The first \" limit1 \" numbers in the sequence:`n\" result1 \"`nThe \" limit2 \" number in the sequence is: \" result2\nreturn\n\nRise_Fall(num){\n rise := fall := 0\n for i, n in StrSplit(num){\n if (i=1)\n prev := n\n else if (n > prev)\n rise++\n else if (n < prev)\n fall++\n if (rise > (StrLen(num)-1) /2) || (fall > (StrLen(num)-1) /2)\n return 0\n prev := n\n }\n if (fall = rise)\n return 1\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f NUMBERS_WITH_EQUAL_RISES_AND_FALLS.AWK\n# converted from Go\nBEGIN {\n print(\"1-200:\")\n while (1) {\n if (rises_equals_falls(++n)) {\n if (++count <= 200) {\n printf(\"%4d\",n)\n if (count % 20 == 0) {\n printf(\"\\n\")\n }\n }\n if (count == 1E7) {\n printf(\"\\n%d: %d\",count,n)\n break\n }\n }\n }\n exit(0)\n}\nfunction rises_equals_falls(n, d,falls,prev,rises) {\n if (n < 10) {\n return(1)\n }\n prev = -1\n while (n > 0) {\n d = n % 10\n if (prev >= 0) {\n if (d < prev) {\n rises++\n }\n else if (d > prev) {\n falls++\n }\n }\n prev = d\n n = int(n / 10)\n }\n return(rises == falls)\n}\n","language":"AWK"},{"code":"c = 0\ni = 1\nwhile c < 10000001\n\tif eqrf(i) then\n\t\tc += 1\n\t\tif c <= 200 then print i;\" \";\n\t\tif c = 10000000 then print : print i\n\tend if\n\ti += 1\nend while\nend\n\nfunction eqrf(n)\n\tsn$ = string(n)\n\tq = 0\n\tfor i = 2 to length(sn$)\n\t\tif asc(mid(sn$,i,1)) > asc(mid(sn$,i-1,1)) then\n\t\t\tq += 1\n\t\telse\n\t\t\tif asc(mid(sn$,i,1)) < asc(mid(sn$,i-1,1)) then\n\t\t\t\tq -= 1\n\t\t\tend if\n\t\tend if\n\tnext i\n\tif q = 0 then return true else return false\nend function\n","language":"BASIC256"},{"code":"#include <stdio.h>\n\n/* Check whether a number has an equal amount of rises\n * and falls\n */\nint riseEqFall(int num) {\n int rdigit = num % 10;\n int netHeight = 0;\n while (num /= 10) {\n netHeight += ((num % 10) > rdigit) - ((num % 10) < rdigit);\n rdigit = num % 10;\n }\n return netHeight == 0;\n}\n\n/* Get the next member of the sequence, in order,\n * starting at 1\n */\nint nextNum() {\n static int num = 0;\n do {num++;} while (!riseEqFall(num));\n return num;\n}\n\nint main(void) {\n int total, num;\n\n /* Generate first 200 numbers */\n printf(\"The first 200 numbers are: \\n\");\n for (total = 0; total < 200; total++)\n printf(\"%d \", nextNum());\n\n /* Generate 10,000,000th number */\n printf(\"\\n\\nThe 10,000,000th number is: \");\n for (; total < 10000000; total++) num = nextNum();\n printf(\"%d\\n\", num);\n\n return 0;\n}\n","language":"C"},{"code":"#include <iomanip>\n#include <iostream>\n\nbool equal_rises_and_falls(int n) {\n int total = 0;\n for (int previous_digit = -1; n > 0; n /= 10) {\n int digit = n % 10;\n if (previous_digit > digit)\n ++total;\n else if (previous_digit >= 0 && previous_digit < digit)\n --total;\n previous_digit = digit;\n }\n return total == 0;\n}\n\nint main() {\n const int limit1 = 200;\n const int limit2 = 10000000;\n int n = 0;\n std::cout << \"The first \" << limit1 << \" numbers in the sequence are:\\n\";\n for (int count = 0; count < limit2; ) {\n if (equal_rises_and_falls(++n)) {\n ++count;\n if (count <= limit1)\n std::cout << std::setw(3) << n << (count % 20 == 0 ? '\\n' : ' ');\n }\n }\n std::cout << \"\\nThe \" << limit2 << \"th number in the sequence is \" << n << \".\\n\";\n}\n","language":"C++"},{"code":"% Find how many rises and falls a number has\nrises_falls = proc (n: int) returns (int,int)\n rises: int := 0\n falls: int := 0\n\n while n >= 10 do\n dl: int := n//10\n n := n / 10\n dh: int := n//10\n if dh < dl then rises := rises + 1\n elseif dl < dh then falls := falls + 1\n end\n end\n return (rises, falls)\nend rises_falls\n\n% Generate all numbers with equal rises and falls\nequal_rises_falls = iter () yields (int)\n n: int := 1\n rises, falls: int\n while true do\n rises, falls := rises_falls(n)\n if rises = falls then yield (n) end\n n := n + 1\n end\nend equal_rises_falls\n\n% Show the first 200 and the 10,000,000th\nstart_up = proc ()\n po: stream := stream$primary_output()\n count: int := 0\n\n for n: int in equal_rises_falls() do\n count := count + 1\n if count <= 200 then\n stream$putright(po, int$unparse(n), 5)\n if count//10 = 0 then stream$putc(po, '\\n') end\n elseif count = 10000000 then\n stream$putl(po, \"\\nThe 10,000,000th number is: \"\n || int$unparse(n))\n break\n end\n end\nend start_up\n","language":"CLU"},{"code":"include \"cowgol.coh\";\n\n# return the change in height of a number\nsub height(n: uint32): (h: int8) is\n h := 0;\n var dgt := (n % 10) as uint8;\n var prev: uint8;\n n := n / 10;\n\n while n > 0 loop\n prev := dgt;\n dgt := (n % 10) as uint8;\n n := n / 10;\n if prev < dgt then\n h := h + 1;\n elseif prev > dgt then\n h := h - 1;\n end if;\n end loop;\nend sub;\n\nvar number: uint32 := 0;\nvar seen: uint32 := 0;\nvar col: uint8 := 10;\n\nprint(\"The first 200 numbers are:\");\nprint_nl();\nwhile seen < 10000000 loop\n loop\n number := number + 1;\n if height(number) == 0 then break; end if;\n end loop;\n seen := seen + 1;\n if seen <= 200 then\n print_i32(number);\n col := col - 1;\n if col != 0 then\n print_char('\\t');\n else\n print_char('\\n');\n col := 10;\n end if;\n end if;\nend loop;\n\nprint_nl();\nprint(\"The 10,000,000th number is: \");\nprint_i32(number);\nprint_nl();\n","language":"Cowgol"},{"code":"procedure GetDigits(N: integer; var IA: TIntegerDynArray);\n{Get an array of the integers in a number}\nvar T: integer;\nbegin\nSetLength(IA,0);\nrepeat\n\tbegin\n\tT:=N mod 10;\n\tN:=N div 10;\n\tSetLength(IA,Length(IA)+1);\n\tIA[High(IA)]:=T;\n\tend\nuntil N<1;\nend;\n\n\nfunction HasEqualRiseFall(N: integer): boolean;\n{Count rises and falls in numbers left to Right}\nvar I: integer;\nvar IA: TIntegerDynArray;\nvar Rise,Fall: integer;\nbegin\nRise:=0; Fall:=0;\nGetDigits(N,IA);\nfor I:=High(IA) downto 1 do\n if IA[I-1]>IA[I] then Inc(Rise)\n else if IA[I-1]<IA[I] then Inc(Fall);\nResult:=Rise=Fall;\nend;\n\n\nprocedure ShowEqualRiseFall(Memo: TMemo);\nvar I,Cnt: integer;\nvar S: string;\nbegin\nCnt:=0;\nS:='';\nfor I:=1 to High(integer) do\n if HasEqualRiseFall(I) then\n\tbegin\n\tInc(Cnt);\n\tS:=S+Format('%4.0d', [I]);\n\tif (Cnt mod 20)=0 then S:=S+CRLF;\n\tif Cnt=200 then break;\n\tend;\nMemo.Text:=S;\nMemo.Lines.Add('Count = '+IntToStr(Cnt));\n\nfor I:=1 to High(integer) do\n if HasEqualRiseFall(I) then\n\tbegin\n\tInc(Cnt);\n\tif Cnt>=10000000 then\n\t\tbegin\n\t\tMemo.Lines.Add('10-Million: '+IntToStr(I));\n\t\tbreak;\n\t\tend;\n\tend;\nend;\n","language":"Delphi"},{"code":"fastfunc risefall n .\n if n < 10\n return 1\n .\n prev = -1\n while n > 0\n d = n mod 10\n if prev >= 0\n if d < prev\n rises += 1\n elif d > prev\n falls += 1\n .\n .\n prev = d\n n = n div 10\n .\n if rises = falls\n return 1\n .\n return 0\n.\nnumfmt 0 4\nn = 1\nrepeat\n if risefall n = 1\n cnt += 1\n if cnt <= 200\n write n\n if cnt mod 10 = 0\n print \"\"\n .\n .\n .\n until cnt = 1e7\n n += 1\n.\nprint \"\"\nprint n\n","language":"EasyLang"},{"code":"// A296712. Nigel Galloway: October 9th., 2020\nlet fN g=let rec fN Ψ n g=match n,Ψ with (0,0)->true |(0,_)->false |_->let i=n%10 in fN (Ψ + (compare i g)) (n/10) i in fN 0 g (g%10)\nlet A296712=seq{1..2147483647}|>Seq.filter fN\nA296712|>Seq.take 200|>Seq.iter(printf \"%d \"); printfn\"\\n\"\n[999999;9999999;99999999]|>List.iter(fun n->printfn \"The %dth element is %d\" (n+1) (Seq.item n A296712))\n","language":"F-Sharp"},{"code":"USING: grouping io kernel lists lists.lazy math math.extras\nprettyprint tools.memory.private ;\n\n: rises-and-falls-equal? ( n -- ? )\n 0 swap 10 /mod swap\n [ 10 /mod rot over - sgn rotd + spin ] until-zero drop 0 = ;\n\n: OEIS:A296712 ( -- list )\n 1 lfrom [ rises-and-falls-equal? ] lfilter ;\n\n! Task\n\"The first 200 numbers in OEIS:A296712 are:\" print\n200 OEIS:A296712 ltake list>array 20 group simple-table. nl\n\n\"The 10 millionth number in OEIS:A296712 is \" write\n9,999,999 OEIS:A296712 lnth commas print\n","language":"Factor"},{"code":": in-seq? ( n -- is N in the sequence? )\n 0 swap \\ height\n 10 /mod \\ digit and rest of number\n begin dup while \\ as long as the number isn't zero...\n 10 /mod \\ get next digit and quotient\n -rot swap \\ retrieve previous digit\n over - sgn \\ see if higher, lower or equal (-1, 0, 1)\n >r rot r> + \\ add to height\n -rot swap \\ quotient on top of stack\n repeat\n drop drop \\ drop number and last digit\n 0= \\ is height equal to zero?\n;\n\n: next-val ( n -- n: retrieve first element of sequence higher than N )\n begin 1+ dup in-seq? until\n;\n\n: two-hundred\n begin over 200 < while\n next-val dup .\n swap 1+ swap\n repeat\n;\n\n: ten-million\n begin over 10000000 < while\n next-val\n swap 1+ swap\n repeat\n;\n\n0 0 \\ top of stack: current index and number\n.\" The first 200 numbers are: \" two-hundred cr cr\n.\" The 10,000,000th number is: \" ten-million . cr\nbye\n","language":"Forth"},{"code":" PROGRAM A296712\n INTEGER IDX, NUM, I\n* Index and number start out at zero\n IDX = 0\n NUM = 0\n* Find and write the first 200 numbers\n WRITE (*,'(A)') 'The first 200 numbers are: '\n DO 100 I = 1, 200\n CALL NEXT NUM(IDX, NUM)\n WRITE (*,'(I4)',ADVANCE='NO') NUM\n IF (MOD(I,20).EQ.0) WRITE (*,*)\n 100 CONTINUE\n* Find the 10,000,000th number\n WRITE (*,*)\n WRITE (*,'(A)',ADVANCE='NO') 'The 10,000,000th number is: '\n 200 CALL NEXT NUM(IDX, NUM)\n IF (IDX.NE.10000000) GOTO 200\n WRITE (*,'(I8)') NUM\n STOP\n END\n\n* Given index and current number, retrieve the next number\n* in the sequence.\n SUBROUTINE NEXT NUM(IDX, NUM)\n INTEGER IDX, NUM\n LOGICAL IN SEQ\n 100 NUM = NUM + 1\n IF (.NOT. IN SEQ(NUM)) GOTO 100\n IDX = IDX + 1\n END\n\n* See whether N is in the sequence\n LOGICAL FUNCTION IN SEQ(N)\n INTEGER N, DL, DR, VAL, HEIGHT\n* Get first digit and divide value by 10\n DL = MOD(N, 10)\n VAL = N / 10\n HEIGHT = 0\n 100 IF (VAL.NE.0) THEN\n* Retrieve digits by modulo and division\n DR = DL\n DL = MOD(VAL, 10)\n VAL = VAL / 10\n* Record rise or fall\n IF (DL.LT.DR) HEIGHT = HEIGHT + 1\n IF (DL.GT.DR) HEIGHT = HEIGHT - 1\n GOTO 100\n END IF\n* N is in the sequence if the final height is 0\n IN SEQ = HEIGHT.EQ.0\n RETURN\n END\n","language":"Fortran"},{"code":"function eqrf( n as uinteger ) as boolean\n dim as string sn = str(n)\n dim as integer q = 0\n for i as uinteger = 2 to len(sn)\n if asc(mid(sn,i,1)) > asc(mid(sn,i-1,1)) then\n q += 1\n elseif asc(mid(sn,i,1)) < asc(mid(sn,i-1,1)) then\n q -= 1\n end if\n next i\n if q = 0 then return true else return false\nend function\n\ndim as uinteger c = 0, i = 1\nwhile c < 10000001\n if eqrf(i) then\n c += 1\n if c <= 200 then print i;\" \";\n if c = 10000000 then print : print i\n end if\n i += 1\nwend\n","language":"FreeBASIC"},{"code":"Public Sub Main()\n\n Dim c As Integer = 0, i As Integer = 1\n While c < 10000001\n If eqrf(i) Then\n c += 1\n If c <= 200 Then Print \" \"; i;\n If c = 10000000 Then Print Chr(10); i\n End If\n i += 1\n Wend\n\nEnd\n\nFunction eqrf(n As Integer) As Boolean\n\n Dim sn As String = Str(n)\n Dim q As Integer = 0, i As Integer\n\n For i = 2 To Len(sn)\n If Asc(Mid(sn, i, 1)) > Asc(Mid(sn, i - 1, 1)) Then\n q += 1\n Else If Asc(Mid(sn, i, 1)) < Asc(Mid(sn, i - 1, 1)) Then\n q -= 1\n End If\n Next\n If q = 0 Then Return True Else Return False\n\nEnd Function\n","language":"Gambas"},{"code":"package main\n\nimport \"fmt\"\n\nfunc risesEqualsFalls(n int) bool {\n if n < 10 {\n return true\n }\n rises := 0\n falls := 0\n prev := -1\n for n > 0 {\n d := n % 10\n if prev >= 0 {\n if d < prev {\n rises = rises + 1\n } else if d > prev {\n falls = falls + 1\n }\n }\n prev = d\n n /= 10\n }\n return rises == falls\n}\n\nfunc main() {\n fmt.Println(\"The first 200 numbers in the sequence are:\")\n count := 0\n n := 1\n for {\n if risesEqualsFalls(n) {\n count++\n if count <= 200 {\n fmt.Printf(\"%3d \", n)\n if count%20 == 0 {\n fmt.Println()\n }\n }\n if count == 1e7 {\n fmt.Println(\"\\nThe 10 millionth number in the sequence is \", n)\n break\n }\n }\n n++\n }\n}\n","language":"Go"},{"code":"import Data.Char\n\npairs :: [a] -> [(a,a)]\npairs (a:b:as) = (a,b):pairs (b:as)\npairs _ = []\n\nriseEqFall :: Int -> Bool\nriseEqFall n = rel (>) digitPairs == rel (<) digitPairs\n where rel r = sum . map (fromEnum . uncurry r)\n digitPairs = pairs $ map digitToInt $ show n\n\na296712 :: [Int]\na296712 = [n | n <- [1..], riseEqFall n]\n\nmain :: IO ()\nmain = do\n\tputStrLn \"The first 200 numbers are: \"\n\tputStrLn $ unwords $ map show $ take 200 a296712\n\tputStrLn \"\"\n\tputStr \"The 10,000,000th number is: \"\n\tputStrLn $ show $ a296712 !! 9999999\n","language":"Haskell"},{"code":"NB. This would have been shorter but memory constraints forced me to test candidates\nNB. in batches rather than all at once (iPads are amazing but not supercomputers...)\n\ngennumberblocks =: 3 : 0\nNB. y Block index. Each block is at most 100000 numbers\nNB. Return one or more boxed blocks of numbers, segregated by digit count\n(<. 10 ^. n) </. n =. (y * 100000) + >: i.100000\n)\n\ntestblock =: 3 : 0\nNB. y A block of numbers all with the same digit count\nNB. Return those that pass the test\ny #~ ((+/\"1) 2 </\\\"1 f) = (+/\"1) 2 >/\\\"1 \".\"1\"0 \": ,. y\n)\n\npow =: 3 : 0\nNB. Generate and test one or more blocks of numbers and add the results to the\nNB. running list of answers\n'nextblockindex answers' =. y\n(>: nextblockindex) ; answers , ; testblock &. > gennumberblocks nextblockindex\n)\n\ngo =: 3 : 0\nresult =: pow ^: ((1e7&>)@#@(1&{::)) ^:_ (0 ; '')\n'The first 200 numbers are:' (1!:2) 2\n(10 20 $ 200 {. 1 {:: result) (1!:2) 2\n'The 10,000,000th number is: ' , \": 9999999 { 1 {:: result\n)\n","language":"J"},{"code":"public class EqualRisesFalls {\n public static void main(String[] args) {\n final int limit1 = 200;\n final int limit2 = 10000000;\n System.out.printf(\"The first %d numbers in the sequence are:\\n\", limit1);\n int n = 0;\n for (int count = 0; count < limit2; ) {\n if (equalRisesAndFalls(++n)) {\n ++count;\n if (count <= limit1)\n System.out.printf(\"%3d%c\", n, count % 20 == 0 ? '\\n' : ' ');\n }\n }\n System.out.printf(\"\\nThe %dth number in the sequence is %d.\\n\", limit2, n);\n }\n\n private static boolean equalRisesAndFalls(int n) {\n int total = 0;\n for (int previousDigit = -1; n > 0; n /= 10) {\n int digit = n % 10;\n if (previousDigit > digit)\n ++total;\n else if (previousDigit >= 0 && previousDigit < digit)\n --total;\n previousDigit = digit;\n }\n return total == 0;\n }\n}\n","language":"Java"},{"code":"def risesEqualsFalls:\n . as $n\n | if . < 10 then true\n else {rises: 0, falls: 0, prev: -1, n: $n}\n | until (.n <= 0;\n (.n % 10 ) as $d\n | if .prev >= 0\n then if $d < .prev then .rises += 1\n elif $d > .prev then .falls += 1\n else .\n\t end\n\t else .\n\t end\n | .prev = $d\n | .n = ((.n/10)|floor) )\n | .rises == .falls\n end ;\n\ndef A296712: range(1; infinite) | select(risesEqualsFalls);\n\n# Override jq's incorrect definition of nth/2\n# Emit the $n-th value of the stream, counting from 0; or emit nothing\ndef nth($n; s):\n if $n < 0 then error(\"nth/2 doesn't support negative indices\")\n else label $out\n | foreach s as $x (-1; .+1; select(. >= $n) | $x, break $out)\n end;\n\n# The tasks\n\"First 200:\",\n [limit(200; A296712)],\n\n \"\\nThe 10 millionth number in the sequence is \\(\n nth(1e7 - 1; A296712))\"\n","language":"Jq"},{"code":"using Lazy\n\nfunction rises_and_falls(n)\n if n < 10\n return 0, 0\n end\n lastr, rises, falls = n % 10, 0, 0\n while n != 0\n n, r = divrem(n, 10)\n if r > lastr\n falls += 1\n elseif r < lastr\n rises += 1\n end\n lastr = r\n end\n return rises, falls\nend\n\nisA296712(x) = ((a, b) = rises_and_falls(x); return a == b)\n\nfunction genA296712(N, M)\n A296712 = filter(isA296712, Lazy.range(1));\n j = 0\n for i in take(200, A296712)\n j += 1\n print(lpad(i, 4), j % 20 == 0 ? \"\\n\" : \"\")\n end\n for i in take(M, A296712)\n j = i\n end\n println(\"\\nThe $M-th number in sequence A296712 is $j.\")\nend\n\ngenA296712(200, 10_000_000)\n","language":"Julia"},{"code":" NORMAL MODE IS INTEGER\n VECTOR VALUES FMT = $I8,1H:,I9*$\n\n INTERNAL FUNCTION(NUM)\n ENTRY TO RISFAL.\n N=NUM\n DEPTH = 0\n DIGA = N-(N/10)*10\n N = N/10\nLOOP WHENEVER N.E.0, FUNCTION RETURN DEPTH.E.0\n DIGB = DIGA\n DIGA = N-(N/10)*10\n N = N/10\n WHENEVER DIGA.L.DIGB, DEPTH=DEPTH-1\n WHENEVER DIGA.G.DIGB, DEPTH=DEPTH+1\n TRANSFER TO LOOP\n END OF FUNCTION\n\n I=0\n J=0\nLOOP J=J+1\n WHENEVER .NOT.RISFAL.(J), TRANSFER TO LOOP\n I=I+1\n WHENEVER I.LE.200, PRINT FORMAT FMT, I, J\n WHENEVER I.L.10000000, TRANSFER TO LOOP\n PRINT FORMAT FMT, I, J\n\n END OF PROGRAM\n","language":"MAD"},{"code":"ClearAll[EqualRisesAndFallsQ]\nEqualRisesAndFallsQ[n_Integer] := Total[Sign[Differences[IntegerDigits[n]]]] == 0\nTake[Select[Range[1000], EqualRisesAndFallsQ], 200]\nvalid = 0;\nDynamic[{i, valid}]\nDo[\n If[EqualRisesAndFallsQ[i],\n valid += 1;\n If[valid == 10^7, Print[i]; Break[]]\n ]\n ,\n {i, 50 10^6}\n ]\n","language":"Mathematica"},{"code":"import strutils\n\nfunc insequence(n: Positive): bool =\n ## Return true if \"n\" is in the sequence.\n if n < 10: return true\n var diff = 0\n var prev = n mod 10\n var n = n div 10\n while n != 0:\n let digit = n mod 10\n if digit < prev: inc diff\n elif digit > prev: dec diff\n prev = digit\n n = n div 10\n result = diff == 0\n\niterator a297712(): (int, int) =\n ## Yield the positions and the numbers of the sequence.\n var n = 1\n var pos = 0\n while true:\n if n.insequence:\n inc pos\n yield (pos, n)\n inc n\n\necho \"First 200 numbers in the sequence:\"\nfor (pos, n) in a297712():\n if pos <= 200:\n stdout.write ($n).align(3), if pos mod 20 == 0: '\\n' else: ' '\n elif pos == 10_000_000:\n echo \"\\nTen millionth number in the sequence: \", n\n break\n","language":"Nim"},{"code":"#!/usr/bin/perl\n\nuse strict;\nuse warnings;\n\nsub rf\n {\n local $_ = shift;\n my $sum = 0;\n $sum += $1 <=> $2 while /(.)(?=(.))/g;\n $sum\n }\n\nmy $count = 0;\nmy $n = 0;\nmy @numbers;\nwhile( $count < 200 )\n {\n rf(++$n) or $count++, push @numbers, $n;\n }\nprint \"first 200: @numbers\\n\" =~ s/.{1,70}\\K\\s/\\n/gr;\n\n$count = 0;\n$n = 0;\nwhile( $count < 10e6 )\n {\n rf(++$n) or $count++;\n }\nprint \"\\n10,000,000th number: $n\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The first 200 numbers are:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rmf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rmf</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #7060A8;\">compare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rmf</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">200</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%3d \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">1e7</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nThe %,dth number is %,d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,d:%,d\\r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n<!--\n","language":"Phix"},{"code":"Procedure.b eqrf(n.i)\n sn.s = Str(n)\n q.i = 0\n\n For i.i = 2 To Len(sn)\n If Asc(Mid(sn, i, 1)) > Asc(Mid(sn, i - 1, 1)):\n q + 1\n Else\n If Asc(Mid(sn, i, 1)) < Asc(Mid(sn, i - 1, 1)):\n q - 1\n EndIf\n EndIf\n Next\n If q = 0:\n ProcedureReturn #True\n Else\n ProcedureReturn #False\n EndIf\n\nEndProcedure\n\nOpenConsole()\nc.i = 0\ni.i = 1\nWhile c < 10000001\n If eqrf(i):\n c + 1\n If c <= 200:\n Print(\" \" + Str(i))\n EndIf\n If c = 10000000:\n PrintN(#CRLF$ + Str(i))\n EndIf\n EndIf\n i + 1\nWend\n\nInput()\nCloseConsole()\n","language":"PureBasic"},{"code":"import itertools\n\ndef riseEqFall(num):\n \"\"\"Check whether a number belongs to sequence A296712.\"\"\"\n height = 0\n d1 = num % 10\n num //= 10\n while num:\n d2 = num % 10\n height += (d1<d2) - (d1>d2)\n d1 = d2\n num //= 10\n return height == 0\n\ndef sequence(start, fn):\n \"\"\"Generate a sequence defined by a function\"\"\"\n num=start-1\n while True:\n num += 1\n while not fn(num): num += 1\n yield num\n\na296712 = sequence(1, riseEqFall)\n\n# Generate the first 200 numbers\nprint(\"The first 200 numbers are:\")\nprint(*itertools.islice(a296712, 200))\n\n# Generate the 10,000,000th number\nprint(\"The 10,000,000th number is:\")\nprint(*itertools.islice(a296712, 10000000-200-1, 10000000-200))\n# It is necessary to subtract 200 from the index, because 200 numbers\n# have already been consumed.\n","language":"Python"},{"code":" [ [] swap\n [ 10 /mod\n rot join swap\n dup 0 = until ]\n drop ] is digits ( n --> [ )\n\n [ stack ] is rises\n [ stack ] is falls\n\n [ 0 rises put\n 0 falls put\n digits\n behead swap witheach\n [ tuck 2dup < iff\n [ 1 rises tally\n 2drop ] done\n > if\n [ 1 falls tally ] ]\n drop\n rises take\n falls take = ] is equal ( n --> b )\n\n [] 0\n [ 1+ dup equal if\n [ tuck join swap ]\n over size 200 = until ]\n drop\n echo\n cr cr\n 0 0\n [ 1+ dup equal if\n [ dip 1+ ]\n over 10000000 = until ]\n nip\n echo\n","language":"Quackery"},{"code":"use Lingua::EN::Numbers;\nuse Base::Any;\n\nsub rf (int $base = 10, $batch = Any, &op = &infix:<==>) {\n my %batch = batch => $batch if $batch;\n flat (1 .. ∞).hyper(|%batch).map: {\n my int ($this, $last) = $_, $_ % $base;\n my int ($rise, $fall) = 0, 0;\n while $this {\n my int $rem = $this % $base;\n $this = $this div $base;\n if $rem > $last { $fall = $fall + 1 }\n elsif $rem < $last { $rise = $rise + 1 }\n $last = $rem\n }\n next unless &op($rise, $fall);\n $_\n }\n}\n\n# The task\nmy $upto = 200;\nput \"Rise = Fall:\\nFirst {$upto.&cardinal} (base 10):\";\n.put for rf[^$upto]».fmt(\"%3d\").batch(20);\n\n$upto = 10_000_000;\nput \"\\nThe {$upto.&ordinal} (base 10): \", comma rf(10, 65536)[$upto - 1];\n\n# Other bases and comparisons\nput \"\\n\\nGeneralized for other bases and other comparisons:\";\n$upto = ^5;\nmy $which = \"{tc $upto.map({.exp(10).&ordinal}).join: ', '}, values in some other bases:\";\n\nput \"\\nRise = Fall: $which\";\nfor <3 296691 4 296694 5 296697 6 296700 7 296703 8 296706 9 296709 10 296712\n 11 296744 12 296747 13 296750 14 296753 15 296756 16 296759 20 296762 60 296765>\n -> $base, $oeis {\n put \"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \",\n $upto.map({rf(+$base, Any)[.exp(10) - 1].&to-base($base)}).join: ', '\n}\n\nput \"\\nRise > Fall: $which\";\nfor <3 296692 4 296695 5 296698 6 296701 7 296704 8 296707 9 296710 10 296713\n 11 296745 12 296748 13 296751 14 296754 15 296757 16 296760 20 296763 60 296766>\n -> $base, $oeis {\n put \"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \",\n $upto.map({rf(+$base, Any, &infix:«>»)[.exp(10) - 1].&to-base($base)}).join: ', '\n }\n\nput \"\\nRise < Fall: $which\";\nfor <3 296693 4 296696 5 296699 6 296702 7 296705 8 296708 9 296711 10 296714\n 11 296746 12 296749 13 296752 14 296755 15 296758 16 296761 20 296764 60 296767>\n -> $base, $oeis {\n put \"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \",\n $upto.map({rf(+$base, Any, &infix:«<»)[.exp(10) - 1].&to-base($base)}).join: ', '\n }\n","language":"Raku"},{"code":"/*REXX pgm finds and displays N numbers that have an equal number of rises and falls,*/\nparse arg n . /*obtain optional argument from the CL.*/\nif n=='' | n==\",\" then n= 200 /*Not specified? Then use the default.*/\nappend= n>0 /*a flag that is used to append numbers*/\nn= abs(n) /*use the absolute value of N. */\ncall init /*initialize the rise/fall database. */\n do j=1 until #==n /*test integers until we have N of them*/\n s= 0 /*initialize the sum of rises/falls. */\n do k=1 for length(j)-1 /*obtain a set of two digs from number.*/\n t= substr(j, k, 2) /*obtain a set of two digs from number.*/\n s= s + @.t /*sum the rises and falls in the number*/\n end /*k*/\n if s\\==0 then iterate /*Equal # of rises & falls? Then add it*/\n #= # + 1 /*bump the count of numbers found. */\n if append then $= $ j /*append to the list of numbers found. */\n end /*j*/\n\nif append then call show /*display a list of N numbers──►term.*/\n else say 'the ' commas(n)th(n) \" number is: \" commas(j) /*show Nth #.*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg _; do c=length(_)-3 to 1 by -3; _=insert(',', _, c); end; return _\nth: parse arg th; return word('th st nd rd',1+(th//10)*(th//100%10\\==1)*(th//10<4))\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ninit: @.= 0; do i=1 for 9; _= i' '; @._= 1; _= '0'i; @._= +1; end /*i*/\n do i=10 to 99; parse var i a 2 b; if a>b then @.i= -1\n else if a<b then @.i= +1\n end /*i*/; #= 0; $=; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshow: say 'the first ' commas(#) \" numbers are:\"; say; w= length( word($, #) )\n _=; do o=1 for n; _= _ right( word($, o), w); if o//20\\==0 then iterate\n say substr(_, 2); _= /*display a line; nullify a new line. */\n end /*o*/ /* [↑] display 20 numbers to a line.*/\n\n if _\\=='' then say substr(_, 2); return /*handle any residual numbers in list. */\n","language":"REXX"},{"code":"class Integer\n def eq_rise_fall? = digits.each_cons(2).sum{|a,b| a <=> b} == 0\nend\n\nputs (1..).lazy.select(&:eq_rise_fall?).take(200).force.join(\" \")\n\nn = 10_000_000\nres = (1..).lazy.select(&:eq_rise_fall?).take(n).drop(n-1).first\nputs \"The #{n}th number in the sequence is #{res}.\"\n","language":"Ruby"},{"code":"func isok(arr) {\n var diffs = arr.map_cons(2, {|a,b| a - b })\n diffs.count { .is_pos } == diffs.count { .is_neg }\n}\n\nvar base = 10\n\nwith (200) {|n|\n say \"First #{n} terms (base #{base}):\"\n n.by { isok(.digits(base)) && .is_pos }.each_slice(20, {|*a|\n say a.map { '%3s' % _ }.join(' ')\n })\n}\n\nwith (1e7) {|n| # takes a very long time\n say \"\\nThe #{n.commify}-th term (base #{base}): #{\n n.th { isok(.digits(base)) && .is_pos }.commify}\"\n}\n","language":"Sidef"},{"code":"import Foundation\n\nfunc equalRisesAndFalls(_ n: Int) -> Bool {\n var total = 0\n var previousDigit = -1\n var m = n\n while m > 0 {\n let digit = m % 10\n m /= 10\n if previousDigit > digit {\n total += 1\n } else if previousDigit >= 0 && previousDigit < digit {\n total -= 1\n }\n previousDigit = digit\n }\n return total == 0\n}\n\nvar count = 0\nvar n = 0\nlet limit1 = 200\nlet limit2 = 10000000\nprint(\"The first \\(limit1) numbers in the sequence are:\")\nwhile count < limit2 {\n n += 1\n if equalRisesAndFalls(n) {\n count += 1\n if count <= limit1 {\n print(String(format: \"%3d\", n), terminator: count % 20 == 0 ? \"\\n\" : \" \")\n }\n }\n}\nprint(\"\\nThe \\(limit2)th number in the sequence is \\(n).\")\n","language":"Swift"},{"code":"import \"./fmt\" for Fmt\n\nvar risesEqualsFalls = Fn.new { |n|\n if (n < 10) return true\n var rises = 0\n var falls = 0\n var prev = -1\n while (n > 0) {\n var d = n%10\n if (prev >= 0) {\n if (d < prev) {\n rises = rises + 1\n } else if (d > prev) {\n falls = falls + 1\n }\n }\n prev = d\n n = (n/10).floor\n }\n return rises == falls\n}\n\nSystem.print(\"The first 200 numbers in the sequence are:\")\nvar count = 0\nvar n = 1\nwhile (true) {\n if (risesEqualsFalls.call(n)) {\n count = count + 1\n if (count <= 200) {\n Fmt.write(\"$3d \", n)\n if (count % 20 == 0) System.print()\n }\n if (count == 1e7) {\n Fmt.print(\"\\nThe 10 millionth number in the sequence is $,d.\", n)\n break\n }\n }\n n = n + 1\n}\n","language":"Wren"},{"code":"func RiseFall(N); \\Return 'true' if N has equal rises and falls\nint N, R, F, D, D0;\n[R:= 0; F:= 0;\nN:= N/10;\nD0:= rem(0);\nwhile N do\n [N:= N/10;\n D:= rem(0);\n if D > D0 then R:= R+1;\n if D < D0 then F:= F+1;\n D0:= D;\n ];\nreturn R = F;\n];\n\nint N, Cnt;\n[N:= 1;\nCnt:= 0;\nloop [if RiseFall(N) then\n [Cnt:= Cnt+1;\n if Cnt <= 200 then\n [IntOut(0, N);\n if rem (Cnt/10) = 0 then CrLf(0)\n else ChOut(0, 9\\tab\\);\n ];\n if Cnt = 10_000_000 then\n [Text(0, \"10 millionth number is \");\n IntOut(0, N); CrLf(0);\n quit;\n ];\n ];\n N:= N+1;\n ];\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Numbers_with_equal_rises_and_falls\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"When a number is written in base 10, adjacent digits may \\\"rise\\\" or \\\"fall\\\" as the number is read (usually from left to right).\\n\\n\\n;Definition:\\nGiven the decimal digits of the number are written as a series <big>d</big>:\\n:* A ''rise'' is an index <big>i</big> such that <big> d(i) < d(i+1)</big>\\n:* A ''fall'' is an index <big>i</big> such that <big> d(i) > d(i+1)</big>\\n\\n\\n;Examples:\\n:* The number '''726,169''' has '''3''' rises and '''2''' falls, so it <u>isn't</u> in the sequence.\\n:* The number '''83,548''' has '''2''' rises and '''2''' falls, so it <u>is</u> in the sequence.\\n\\n\\n;Task:\\n:* Print the first '''200''' numbers in the sequence \\n:* Show that the '''10 millionth''' (10,000,000<sup>th</sup>) number in the sequence is '''41,909,002'''\\n\\n\\n;See also:\\n* OEIS Sequence [[OEIS:A296712|A296712]] describes numbers whose digit sequence in base 10 have equal \\\"rises\\\" and \\\"falls\\\".\\n\\n\\n;Related tasks:\\n* [[Esthetic_numbers|Esthetic numbers]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F riseEqFall(=num)\\n ‘Check whether a number belongs to sequence A296712.’\\n V height = 0\\n V d1 = num % 10\\n num I/= 10\\n L num != 0\\n V d2 = num % 10\\n height += (d1 < d2) - (d1 > d2)\\n d1 = d2\\n num I/= 10\\n R height == 0\\n\\nV num = 0\\nF nextNum()\\n L\\n :num++\\n I riseEqFall(:num)\\n L.break\\n R :num\\n\\nprint(‘The first 200 numbers are:’)\\nL 200\\n print(nextNum(), end' ‘ ’)\\nprint()\\n\\nL 0 .< 10'000'000 - 200 - 1\\n nextNum()\\nprint(‘The 10,000,000th number is: ’nextNum())\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"puts:\\tequ\\t9\\t; CP/M calls\\nputch:\\tequ\\t2\\n\\torg\\t100h\\n\\t;;;\\tPrint first 200 numbers\\n\\tlxi\\td,first\\n\\tmvi\\tc,puts\\n\\tcall\\t5\\n\\tmvi\\tb,200\\t; 200 numbers\\nf200:\\tpush\\tb\\n\\tcall\\tnext\\t; Get next number\\n\\tcall\\tpnum\\t; Print the number\\n\\tpop\\tb\\t; Restore counter\\n\\tdcr\\tb\\t; Are we there yet?\\n\\tjnz\\tf200\\t; If not, next number\\n\\t;;;\\tFind 10,000,000th number\\n\\tlxi\\td,tenmil\\n\\tmvi\\tc,puts\\n\\tcall\\t5\\nf1e7:\\tcall\\tnext\\t; Keep generating numbers until ten million reached\\n\\tjnz\\tf1e7\\t; Then print the number\\n\\t;;;\\tPrint the current number\\npnum:\\tlxi\\td,num\\npscan:\\tdcx\\td\\t; Scan for zero\\n\\tldax\\td\\n\\tana\\ta\\n\\tjnz\\tpscan\\n\\tmvi\\tc,puts\\t; Once found, print string\\n\\tjmp\\t5\\n\\t;;;\\tIncrement number until rises and falls are equal\\nnext:\\tlxi\\th,num\\nincdgt:\\tmov\\ta,m\\t; Get digit\\n\\tana\\ta\\t; If 0, then initialize\\n\\tjz\\tgrow\\n\\tinr\\ta\\t; Otherwise, increment\\n\\tmov\\tm,a\\t; Store back\\n\\tcpi\\t'9'+1\\t; Rollover?\\n\\tjnz\\tidone\\t; If not, we're done\\n\\tmvi\\tm,'0'\\t; If so, set digit to 0\\n\\tdcx\\th\\t; And increment previous digit\\n\\tjmp\\tincdgt\\ngrow:\\tmvi\\tm,'1'\\nidone:\\tlxi\\th,num\\t; Find rises and falls\\n\\tmvi\\tb,0\\t; B = rises - falls\\n\\tmov\\tc,m\\t; C = right digit in comparison\\npair:\\tdcx\\th\\n\\tmov\\ta,m\\t; A = left digit in comparison\\n\\tana\\ta\\t; When zero, done\\n\\tjz\\tcheck\\n\\tcmp\\tc\\t; Compare left digit to right digit\\n\\tjc\\tfall\\t; A<C = fall\\n\\tjnz\\trise\\t; A>C = rise\\nnxdgt:\\tmov\\tc,a\\t; C is now left digit\\n\\tjmp\\tpair\\t; Check next pair\\nfall:\\tdcr\\tb\\t; Fall: decrement B\\n\\tjmp\\tnxdgt\\nrise:\\tinr\\tb\\t; Rise: increment B\\n\\tjmp\\tnxdgt\\ncheck:\\tmov\\ta,b\\t; If B=0 then rises and falls are equal\\n\\tana\\ta\\n\\tjnz\\tnext\\t; Otherwise, increment number and try again\\n\\tlxi\\th,ctr\\t; But if so, decrement the counter to 10 million\\n\\tmov\\ta,m\\t; First byte\\n\\tsui\\t1\\n\\tmov\\tm,a\\n\\tinx\\th\\t; Second byte\\n\\tmov\\ta,m\\n\\tsbb\\tb\\t; B=0 here\\n\\tmov\\tm,a\\n\\tinx\\th\\t; Third byte\\n\\tmov\\ta,m\\n\\tsbb\\tb\\n\\tmov\\tm,a\\n\\tdcx\\th\\t; OR them together to see if the number is zero\\n\\tora\\tm\\n\\tdcx\\th\\n\\tora\\tm\\n\\tret\\n\\t;;;\\tStrings\\nfirst:\\tdb\\t'The first 200 numbers are:',13,10,'$'\\ntenmil:\\tdb\\t13,10,10,'The 10,000,000th number is: $'\\n\\t;;;\\tCurrent number (stored as ASCII)\\n\\tdb\\t0,0,0,0,0,0,0,0\\nnum:\\tdb\\t'0 $'\\n\\t;;;\\t24-bit counter to keep track of ten million\\nctr:\\tdb\\t80h,96h,98h\\t; 1e7 = 989680h\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"puts:\\tequ\\t9\\t\\t; MS-DOS print string\\n\\tcpu\\t8086\\n\\tbits\\t16\\n\\torg\\t100h\\nsection\\t.text\\n\\tmov\\tbp,98h\\t\\t; BP:DI = 989680h = ten million\\n\\tmov\\tdi,9680h\\n\\t;;;\\tPrint first 200 numbers\\n\\tmov\\tdx,first\\t; Print message\\n\\tmov\\tah,puts\\n\\tint\\t21h\\nn200:\\tcall\\tnext\\t\\t; Get next number\\n\\tcall\\tpnum\\t\\t; Print the number\\n\\tcmp\\tdi,95B8h\\t; Have we had 200 yet?\\n\\tja\\tn200\\t\\t; If not, print next number\\n\\t;;;\\tPrint the 10 millionth number\\n\\tmov\\tdx,tenmil\\t; Print message\\n\\tmov\\tah,puts\\n\\tint\\t21h\\nn1e7:\\tcall\\tnext\\t\\t; Get next number\\n\\tjnz\\tn1e7\\t\\t; Until we have the 10 millionth\\n\\t;;;\\tPrint the current number\\npnum:\\tstd\\t\\t\\t; Read backwards\\n\\txchg\\tsi,di\\t\\t; Keep DI safe\\n\\tmov\\tdi,num\\n\\tmov\\tcx,9\\n\\txor\\tal,al\\t\\t; Find the first zero\\n\\trepnz\\tscasb\\n\\tinc\\tdi\\t\\t; Go to first digit\\n\\tinc\\tdi\\n\\txchg\\tsi,di\\t\\t; Put DI back\\n\\tmov\\tdx,si\\t\\t; Call DOS to print the number\\n\\tmov\\tah,puts\\n\\tint\\t21h\\n\\tret\\n\\t;;;\\tIncrement number until rises and falls are equal\\nnext:\\tstd\\t\\t\\t; Read number backwards\\n.inc:\\tmov\\tbx,num\\n.iloop:\\tmov\\tal,[bx]\\t\\t; Get digit\\n\\ttest\\tal,al\\t\\t; If uninitialized, write a 1\\n\\tjz\\t.grow\\n\\tinc\\tax\\t\\t; Otherwise, increment\\n\\tmov\\t[bx],al\\t\\t; Write it back\\n\\tcmp\\tal,'9'+1\\t; Rollover?\\n\\tjnz\\t.idone\\t\\t; If not, the increment is done\\n\\tmov\\t[bx],byte '0'\\t; But if so, this digit should be 0,\\n\\tdec\\tbx\\t\\t; and the next digit incremented.\\n\\tjmp\\t.iloop\\n.grow:\\tmov\\t[bx],byte '1'\\t; The number gains an extra digit\\n.idone:\\txor\\tbl,bl\\t\\t; BL = rise and fall counter\\n\\tmov\\tsi,num\\n\\tlodsb\\t\\t\\t; Read first digit to compare to\\n.pair:\\txchg\\tah,al\\t\\t; Previous digit to compare\\n\\tlodsb\\t\\t\\t; Read next digit\\n\\ttest\\tal,al\\t\\t; Done yet?\\n\\tjz\\t.done\\n\\tcmp\\tal,ah\\t\\t; If not, compare the digits\\n\\tja\\t.fall\\t\\t; If they are different,\\t\\n\\tjb\\t.rise\\t\\t; there is a fall or a rise\\n\\tjmp\\t.pair\\t\\t; Otherwise, try next pair\\n.fall:\\tdec\\tbl\\t\\t; Fall: decrement BL\\n\\tjmp\\t.pair\\n.rise:\\tinc\\tbl\\t\\t; Rise: increment BL\\n\\tjmp\\t.pair\\n.done:\\ttest\\tbl,bl\\t\\t; At the end, check if BL is zero\\n\\tjnz\\t.inc\\t\\t; If not, try next number\\n\\tsub\\tdi,1\\t\\t; Decrement the million counter in BP:DI\\n\\tsbb\\tbp,0\\n\\tmov\\tax,di\\t\\t; Test if BP:DI is zero\\n\\tor\\tax,bp\\n\\tret\\nsection\\t.data\\n\\t;;;\\tStrings\\nfirst:\\tdb\\t'The first 200 numbers are:',13,10,'$'\\ntenmil:\\tdb\\t13,10,10,'The 10,000,000th number is: $'\\n\\t;;;\\tCurrent number, stored as ASCII\\n\\tdb\\t0,0,0,0,0,0,0,0\\nnum:\\tdb\\t'0 $'\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"with Ada.Text_Io;\\nwith Ada.Integer_Text_Io;\\n\\nprocedure Equal_Rise_Fall is\\n use Ada.Text_Io;\\n\\n function Has_Equal_Rise_Fall (Value : Natural) return Boolean is\\n Rises : Natural := 0;\\n Falls : Natural := 0;\\n Image : constant String := Natural'Image (Value);\\n Last : Character := Image (Image'First + 1);\\n begin\\n for Pos in Image'First + 2 .. Image'Last loop\\n if Image (Pos) > Last then\\n Rises := Rises + 1;\\n elsif Image (Pos) < Last then\\n Falls := Falls + 1;\\n end if;\\n Last := Image (Pos);\\n end loop;\\n return Rises = Falls;\\n end Has_Equal_Rise_Fall;\\n\\n Value : Natural := 1;\\n Count : Natural := 0;\\nbegin\\n loop\\n if Has_Equal_Rise_Fall (Value) then\\n Count := Count + 1;\\n if Count <= 200 then\\n Ada.Integer_Text_Io.Put (Value, Width => 5);\\n if Count mod 20 = 0 then\\n New_Line;\\n end if;\\n end if;\\n if Count = 10_000_000 then\\n New_Line;\\n Put_Line (\\\"The 10_000_000th: \\\" & Natural'Image (Value));\\n exit;\\n end if;\\n end if;\\n Value := Value + 1;\\n end loop;\\nend Equal_Rise_Fall;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN\\n # returns TRUE if the number of digits in n followed by a higher digit (rises) #\\n # equals the number of digits followed by a lower digit (falls) #\\n # FALSE otherwise #\\n PROC rises equals falls = ( INT n )BOOL:\\n BEGIN\\n INT rf := 0;\\n INT prev := n MOD 10;\\n INT v := n OVER 10;\\n WHILE v > 0 DO\\n INT d = v MOD 10;\\n IF d < prev THEN\\n rf +:= 1 # rise #\\n ELIF d > prev THEN\\n rf -:= 1 # fall #\\n FI;\\n prev := d;\\n v OVERAB 10\\n OD;\\n rf = 0\\n END; # rises equals falls #\\n # task tests #\\n print( ( \\\"The first 200 numbers in the sequence are:\\\", newline ) );\\n INT count := 0;\\n INT max count = 10 000 000;\\n FOR n WHILE count < max count DO\\n IF rises equals falls( n ) THEN\\n count +:= 1;\\n IF count <= 200 THEN\\n print( ( whole( n, -4 ) ) );\\n IF count MOD 20 = 0 THEN print( ( newline ) ) FI\\n ELIF count = max count THEN\\n print( ( newline, \\\"The 10 millionth number in the sequence is \\\", whole( n, -8 ), \\\".\\\", newline ) )\\n FI\\n FI\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"risefall←{\\n ⍝ Determine if a number is in the sequence\\n inSeq←0=(+/2(<->)/10(⊥⍣¯1)⊢)\\n\\n ⍝ First 200 numbers\\n ⎕←'The first 200 numbers are:'\\n ⎕←(⊢(/⍨)inSeq¨)⍳404\\n\\n ⍝ 10,000,000th number\\n ⍝ You can't just make a list that big and filter\\n ⍝ it, because that will just get you a WS FULL.\\n ⍝ Instead it's necessary to loop over them the old-\\n ⍝ fashioned way\\n ⍞←'The 10,000,000th number is: '\\n ⎕←1e7{⍺=0:⍵-1 ⋄ (⍺-inSeq ⍵)∇ ⍵+1}1\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"limit1 := 200, limit2 := 10000000\\ncount := 0, result1 := result1 := \\\"\\\"\\nloop{\\n num := A_Index\\n if !Rise_Fall(num)\\n continue\\n count++\\n if (count <= limit1)\\n result1 .= num . (Mod(count, 20) ? \\\"`t\\\" : \\\"`n\\\")\\n if (count = limit2){\\n result2 := num\\n break\\n }\\n if !mod(count, 10000)\\n ToolTip % count\\n}\\nToolTip\\nMsgBox % \\\"The first \\\" limit1 \\\" numbers in the sequence:`n\\\" result1 \\\"`nThe \\\" limit2 \\\" number in the sequence is: \\\" result2\\nreturn\\n\\nRise_Fall(num){\\n rise := fall := 0\\n for i, n in StrSplit(num){\\n if (i=1)\\n prev := n\\n else if (n > prev)\\n rise++\\n else if (n < prev)\\n fall++\\n if (rise > (StrLen(num)-1) /2) || (fall > (StrLen(num)-1) /2)\\n return 0\\n prev := n\\n }\\n if (fall = rise)\\n return 1\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f NUMBERS_WITH_EQUAL_RISES_AND_FALLS.AWK\\n# converted from Go\\nBEGIN {\\n print(\\\"1-200:\\\")\\n while (1) {\\n if (rises_equals_falls(++n)) {\\n if (++count <= 200) {\\n printf(\\\"%4d\\\",n)\\n if (count % 20 == 0) {\\n printf(\\\"\\\\n\\\")\\n }\\n }\\n if (count == 1E7) {\\n printf(\\\"\\\\n%d: %d\\\",count,n)\\n break\\n }\\n }\\n }\\n exit(0)\\n}\\nfunction rises_equals_falls(n, d,falls,prev,rises) {\\n if (n < 10) {\\n return(1)\\n }\\n prev = -1\\n while (n > 0) {\\n d = n % 10\\n if (prev >= 0) {\\n if (d < prev) {\\n rises++\\n }\\n else if (d > prev) {\\n falls++\\n }\\n }\\n prev = d\\n n = int(n / 10)\\n }\\n return(rises == falls)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"c = 0\\ni = 1\\nwhile c < 10000001\\n\\tif eqrf(i) then\\n\\t\\tc += 1\\n\\t\\tif c <= 200 then print i;\\\" \\\";\\n\\t\\tif c = 10000000 then print : print i\\n\\tend if\\n\\ti += 1\\nend while\\nend\\n\\nfunction eqrf(n)\\n\\tsn$ = string(n)\\n\\tq = 0\\n\\tfor i = 2 to length(sn$)\\n\\t\\tif asc(mid(sn$,i,1)) > asc(mid(sn$,i-1,1)) then\\n\\t\\t\\tq += 1\\n\\t\\telse\\n\\t\\t\\tif asc(mid(sn$,i,1)) < asc(mid(sn$,i-1,1)) then\\n\\t\\t\\t\\tq -= 1\\n\\t\\t\\tend if\\n\\t\\tend if\\n\\tnext i\\n\\tif q = 0 then return true else return false\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n/* Check whether a number has an equal amount of rises\\n * and falls\\n */\\nint riseEqFall(int num) {\\n int rdigit = num % 10;\\n int netHeight = 0;\\n while (num /= 10) {\\n netHeight += ((num % 10) > rdigit) - ((num % 10) < rdigit);\\n rdigit = num % 10;\\n }\\n return netHeight == 0;\\n}\\n\\n/* Get the next member of the sequence, in order,\\n * starting at 1\\n */\\nint nextNum() {\\n static int num = 0;\\n do {num++;} while (!riseEqFall(num));\\n return num;\\n}\\n\\nint main(void) {\\n int total, num;\\n\\n /* Generate first 200 numbers */\\n printf(\\\"The first 200 numbers are: \\\\n\\\");\\n for (total = 0; total < 200; total++)\\n printf(\\\"%d \\\", nextNum());\\n\\n /* Generate 10,000,000th number */\\n printf(\\\"\\\\n\\\\nThe 10,000,000th number is: \\\");\\n for (; total < 10000000; total++) num = nextNum();\\n printf(\\\"%d\\\\n\\\", num);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iomanip>\\n#include <iostream>\\n\\nbool equal_rises_and_falls(int n) {\\n int total = 0;\\n for (int previous_digit = -1; n > 0; n /= 10) {\\n int digit = n % 10;\\n if (previous_digit > digit)\\n ++total;\\n else if (previous_digit >= 0 && previous_digit < digit)\\n --total;\\n previous_digit = digit;\\n }\\n return total == 0;\\n}\\n\\nint main() {\\n const int limit1 = 200;\\n const int limit2 = 10000000;\\n int n = 0;\\n std::cout << \\\"The first \\\" << limit1 << \\\" numbers in the sequence are:\\\\n\\\";\\n for (int count = 0; count < limit2; ) {\\n if (equal_rises_and_falls(++n)) {\\n ++count;\\n if (count <= limit1)\\n std::cout << std::setw(3) << n << (count % 20 == 0 ? '\\\\n' : ' ');\\n }\\n }\\n std::cout << \\\"\\\\nThe \\\" << limit2 << \\\"th number in the sequence is \\\" << n << \\\".\\\\n\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"% Find how many rises and falls a number has\\nrises_falls = proc (n: int) returns (int,int)\\n rises: int := 0\\n falls: int := 0\\n\\n while n >= 10 do\\n dl: int := n//10\\n n := n / 10\\n dh: int := n//10\\n if dh < dl then rises := rises + 1\\n elseif dl < dh then falls := falls + 1\\n end\\n end\\n return (rises, falls)\\nend rises_falls\\n\\n% Generate all numbers with equal rises and falls\\nequal_rises_falls = iter () yields (int)\\n n: int := 1\\n rises, falls: int\\n while true do\\n rises, falls := rises_falls(n)\\n if rises = falls then yield (n) end\\n n := n + 1\\n end\\nend equal_rises_falls\\n\\n% Show the first 200 and the 10,000,000th\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n count: int := 0\\n\\n for n: int in equal_rises_falls() do\\n count := count + 1\\n if count <= 200 then\\n stream$putright(po, int$unparse(n), 5)\\n if count//10 = 0 then stream$putc(po, '\\\\n') end\\n elseif count = 10000000 then\\n stream$putl(po, \\\"\\\\nThe 10,000,000th number is: \\\"\\n || int$unparse(n))\\n break\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# return the change in height of a number\\nsub height(n: uint32): (h: int8) is\\n h := 0;\\n var dgt := (n % 10) as uint8;\\n var prev: uint8;\\n n := n / 10;\\n\\n while n > 0 loop\\n prev := dgt;\\n dgt := (n % 10) as uint8;\\n n := n / 10;\\n if prev < dgt then\\n h := h + 1;\\n elseif prev > dgt then\\n h := h - 1;\\n end if;\\n end loop;\\nend sub;\\n\\nvar number: uint32 := 0;\\nvar seen: uint32 := 0;\\nvar col: uint8 := 10;\\n\\nprint(\\\"The first 200 numbers are:\\\");\\nprint_nl();\\nwhile seen < 10000000 loop\\n loop\\n number := number + 1;\\n if height(number) == 0 then break; end if;\\n end loop;\\n seen := seen + 1;\\n if seen <= 200 then\\n print_i32(number);\\n col := col - 1;\\n if col != 0 then\\n print_char('\\\\t');\\n else\\n print_char('\\\\n');\\n col := 10;\\n end if;\\n end if;\\nend loop;\\n\\nprint_nl();\\nprint(\\\"The 10,000,000th number is: \\\");\\nprint_i32(number);\\nprint_nl();\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"procedure GetDigits(N: integer; var IA: TIntegerDynArray);\\n{Get an array of the integers in a number}\\nvar T: integer;\\nbegin\\nSetLength(IA,0);\\nrepeat\\n\\tbegin\\n\\tT:=N mod 10;\\n\\tN:=N div 10;\\n\\tSetLength(IA,Length(IA)+1);\\n\\tIA[High(IA)]:=T;\\n\\tend\\nuntil N<1;\\nend;\\n\\n\\nfunction HasEqualRiseFall(N: integer): boolean;\\n{Count rises and falls in numbers left to Right}\\nvar I: integer;\\nvar IA: TIntegerDynArray;\\nvar Rise,Fall: integer;\\nbegin\\nRise:=0; Fall:=0;\\nGetDigits(N,IA);\\nfor I:=High(IA) downto 1 do\\n if IA[I-1]>IA[I] then Inc(Rise)\\n else if IA[I-1]<IA[I] then Inc(Fall);\\nResult:=Rise=Fall;\\nend;\\n\\n\\nprocedure ShowEqualRiseFall(Memo: TMemo);\\nvar I,Cnt: integer;\\nvar S: string;\\nbegin\\nCnt:=0;\\nS:='';\\nfor I:=1 to High(integer) do\\n if HasEqualRiseFall(I) then\\n\\tbegin\\n\\tInc(Cnt);\\n\\tS:=S+Format('%4.0d', [I]);\\n\\tif (Cnt mod 20)=0 then S:=S+CRLF;\\n\\tif Cnt=200 then break;\\n\\tend;\\nMemo.Text:=S;\\nMemo.Lines.Add('Count = '+IntToStr(Cnt));\\n\\nfor I:=1 to High(integer) do\\n if HasEqualRiseFall(I) then\\n\\tbegin\\n\\tInc(Cnt);\\n\\tif Cnt>=10000000 then\\n\\t\\tbegin\\n\\t\\tMemo.Lines.Add('10-Million: '+IntToStr(I));\\n\\t\\tbreak;\\n\\t\\tend;\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"fastfunc risefall n .\\n if n < 10\\n return 1\\n .\\n prev = -1\\n while n > 0\\n d = n mod 10\\n if prev >= 0\\n if d < prev\\n rises += 1\\n elif d > prev\\n falls += 1\\n .\\n .\\n prev = d\\n n = n div 10\\n .\\n if rises = falls\\n return 1\\n .\\n return 0\\n.\\nnumfmt 0 4\\nn = 1\\nrepeat\\n if risefall n = 1\\n cnt += 1\\n if cnt <= 200\\n write n\\n if cnt mod 10 = 0\\n print \\\"\\\"\\n .\\n .\\n .\\n until cnt = 1e7\\n n += 1\\n.\\nprint \\\"\\\"\\nprint n\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// A296712. Nigel Galloway: October 9th., 2020\\nlet fN g=let rec fN Ψ n g=match n,Ψ with (0,0)->true |(0,_)->false |_->let i=n%10 in fN (Ψ + (compare i g)) (n/10) i in fN 0 g (g%10)\\nlet A296712=seq{1..2147483647}|>Seq.filter fN\\nA296712|>Seq.take 200|>Seq.iter(printf \\\"%d \\\"); printfn\\\"\\\\n\\\"\\n[999999;9999999;99999999]|>List.iter(fun n->printfn \\\"The %dth element is %d\\\" (n+1) (Seq.item n A296712))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: grouping io kernel lists lists.lazy math math.extras\\nprettyprint tools.memory.private ;\\n\\n: rises-and-falls-equal? ( n -- ? )\\n 0 swap 10 /mod swap\\n [ 10 /mod rot over - sgn rotd + spin ] until-zero drop 0 = ;\\n\\n: OEIS:A296712 ( -- list )\\n 1 lfrom [ rises-and-falls-equal? ] lfilter ;\\n\\n! Task\\n\\\"The first 200 numbers in OEIS:A296712 are:\\\" print\\n200 OEIS:A296712 ltake list>array 20 group simple-table. nl\\n\\n\\\"The 10 millionth number in OEIS:A296712 is \\\" write\\n9,999,999 OEIS:A296712 lnth commas print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": in-seq? ( n -- is N in the sequence? )\\n 0 swap \\\\ height\\n 10 /mod \\\\ digit and rest of number\\n begin dup while \\\\ as long as the number isn't zero...\\n 10 /mod \\\\ get next digit and quotient\\n -rot swap \\\\ retrieve previous digit\\n over - sgn \\\\ see if higher, lower or equal (-1, 0, 1)\\n >r rot r> + \\\\ add to height\\n -rot swap \\\\ quotient on top of stack\\n repeat\\n drop drop \\\\ drop number and last digit\\n 0= \\\\ is height equal to zero?\\n;\\n\\n: next-val ( n -- n: retrieve first element of sequence higher than N )\\n begin 1+ dup in-seq? until\\n;\\n\\n: two-hundred\\n begin over 200 < while\\n next-val dup .\\n swap 1+ swap\\n repeat\\n;\\n\\n: ten-million\\n begin over 10000000 < while\\n next-val\\n swap 1+ swap\\n repeat\\n;\\n\\n0 0 \\\\ top of stack: current index and number\\n.\\\" The first 200 numbers are: \\\" two-hundred cr cr\\n.\\\" The 10,000,000th number is: \\\" ten-million . cr\\nbye\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" PROGRAM A296712\\n INTEGER IDX, NUM, I\\n* Index and number start out at zero\\n IDX = 0\\n NUM = 0\\n* Find and write the first 200 numbers\\n WRITE (*,'(A)') 'The first 200 numbers are: '\\n DO 100 I = 1, 200\\n CALL NEXT NUM(IDX, NUM)\\n WRITE (*,'(I4)',ADVANCE='NO') NUM\\n IF (MOD(I,20).EQ.0) WRITE (*,*)\\n 100 CONTINUE\\n* Find the 10,000,000th number\\n WRITE (*,*)\\n WRITE (*,'(A)',ADVANCE='NO') 'The 10,000,000th number is: '\\n 200 CALL NEXT NUM(IDX, NUM)\\n IF (IDX.NE.10000000) GOTO 200\\n WRITE (*,'(I8)') NUM\\n STOP\\n END\\n\\n* Given index and current number, retrieve the next number\\n* in the sequence.\\n SUBROUTINE NEXT NUM(IDX, NUM)\\n INTEGER IDX, NUM\\n LOGICAL IN SEQ\\n 100 NUM = NUM + 1\\n IF (.NOT. IN SEQ(NUM)) GOTO 100\\n IDX = IDX + 1\\n END\\n\\n* See whether N is in the sequence\\n LOGICAL FUNCTION IN SEQ(N)\\n INTEGER N, DL, DR, VAL, HEIGHT\\n* Get first digit and divide value by 10\\n DL = MOD(N, 10)\\n VAL = N / 10\\n HEIGHT = 0\\n 100 IF (VAL.NE.0) THEN\\n* Retrieve digits by modulo and division\\n DR = DL\\n DL = MOD(VAL, 10)\\n VAL = VAL / 10\\n* Record rise or fall\\n IF (DL.LT.DR) HEIGHT = HEIGHT + 1\\n IF (DL.GT.DR) HEIGHT = HEIGHT - 1\\n GOTO 100\\n END IF\\n* N is in the sequence if the final height is 0\\n IN SEQ = HEIGHT.EQ.0\\n RETURN\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"function eqrf( n as uinteger ) as boolean\\n dim as string sn = str(n)\\n dim as integer q = 0\\n for i as uinteger = 2 to len(sn)\\n if asc(mid(sn,i,1)) > asc(mid(sn,i-1,1)) then\\n q += 1\\n elseif asc(mid(sn,i,1)) < asc(mid(sn,i-1,1)) then\\n q -= 1\\n end if\\n next i\\n if q = 0 then return true else return false\\nend function\\n\\ndim as uinteger c = 0, i = 1\\nwhile c < 10000001\\n if eqrf(i) then\\n c += 1\\n if c <= 200 then print i;\\\" \\\";\\n if c = 10000000 then print : print i\\n end if\\n i += 1\\nwend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n Dim c As Integer = 0, i As Integer = 1\\n While c < 10000001\\n If eqrf(i) Then\\n c += 1\\n If c <= 200 Then Print \\\" \\\"; i;\\n If c = 10000000 Then Print Chr(10); i\\n End If\\n i += 1\\n Wend\\n\\nEnd\\n\\nFunction eqrf(n As Integer) As Boolean\\n\\n Dim sn As String = Str(n)\\n Dim q As Integer = 0, i As Integer\\n\\n For i = 2 To Len(sn)\\n If Asc(Mid(sn, i, 1)) > Asc(Mid(sn, i - 1, 1)) Then\\n q += 1\\n Else If Asc(Mid(sn, i, 1)) < Asc(Mid(sn, i - 1, 1)) Then\\n q -= 1\\n End If\\n Next\\n If q = 0 Then Return True Else Return False\\n\\nEnd Function\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc risesEqualsFalls(n int) bool {\\n if n < 10 {\\n return true\\n }\\n rises := 0\\n falls := 0\\n prev := -1\\n for n > 0 {\\n d := n % 10\\n if prev >= 0 {\\n if d < prev {\\n rises = rises + 1\\n } else if d > prev {\\n falls = falls + 1\\n }\\n }\\n prev = d\\n n /= 10\\n }\\n return rises == falls\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"The first 200 numbers in the sequence are:\\\")\\n count := 0\\n n := 1\\n for {\\n if risesEqualsFalls(n) {\\n count++\\n if count <= 200 {\\n fmt.Printf(\\\"%3d \\\", n)\\n if count%20 == 0 {\\n fmt.Println()\\n }\\n }\\n if count == 1e7 {\\n fmt.Println(\\\"\\\\nThe 10 millionth number in the sequence is \\\", n)\\n break\\n }\\n }\\n n++\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Char\\n\\npairs :: [a] -> [(a,a)]\\npairs (a:b:as) = (a,b):pairs (b:as)\\npairs _ = []\\n\\nriseEqFall :: Int -> Bool\\nriseEqFall n = rel (>) digitPairs == rel (<) digitPairs\\n where rel r = sum . map (fromEnum . uncurry r)\\n digitPairs = pairs $ map digitToInt $ show n\\n\\na296712 :: [Int]\\na296712 = [n | n <- [1..], riseEqFall n]\\n\\nmain :: IO ()\\nmain = do\\n\\tputStrLn \\\"The first 200 numbers are: \\\"\\n\\tputStrLn $ unwords $ map show $ take 200 a296712\\n\\tputStrLn \\\"\\\"\\n\\tputStr \\\"The 10,000,000th number is: \\\"\\n\\tputStrLn $ show $ a296712 !! 9999999\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB. This would have been shorter but memory constraints forced me to test candidates\\nNB. in batches rather than all at once (iPads are amazing but not supercomputers...)\\n\\ngennumberblocks =: 3 : 0\\nNB. y Block index. Each block is at most 100000 numbers\\nNB. Return one or more boxed blocks of numbers, segregated by digit count\\n(<. 10 ^. n) </. n =. (y * 100000) + >: i.100000\\n)\\n\\ntestblock =: 3 : 0\\nNB. y A block of numbers all with the same digit count\\nNB. Return those that pass the test\\ny #~ ((+/\\\"1) 2 </\\\\\\\"1 f) = (+/\\\"1) 2 >/\\\\\\\"1 \\\".\\\"1\\\"0 \\\": ,. y\\n)\\n\\npow =: 3 : 0\\nNB. Generate and test one or more blocks of numbers and add the results to the\\nNB. running list of answers\\n'nextblockindex answers' =. y\\n(>: nextblockindex) ; answers , ; testblock &. > gennumberblocks nextblockindex\\n)\\n\\ngo =: 3 : 0\\nresult =: pow ^: ((1e7&>)@#@(1&{::)) ^:_ (0 ; '')\\n'The first 200 numbers are:' (1!:2) 2\\n(10 20 $ 200 {. 1 {:: result) (1!:2) 2\\n'The 10,000,000th number is: ' , \\\": 9999999 { 1 {:: result\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class EqualRisesFalls {\\n public static void main(String[] args) {\\n final int limit1 = 200;\\n final int limit2 = 10000000;\\n System.out.printf(\\\"The first %d numbers in the sequence are:\\\\n\\\", limit1);\\n int n = 0;\\n for (int count = 0; count < limit2; ) {\\n if (equalRisesAndFalls(++n)) {\\n ++count;\\n if (count <= limit1)\\n System.out.printf(\\\"%3d%c\\\", n, count % 20 == 0 ? '\\\\n' : ' ');\\n }\\n }\\n System.out.printf(\\\"\\\\nThe %dth number in the sequence is %d.\\\\n\\\", limit2, n);\\n }\\n\\n private static boolean equalRisesAndFalls(int n) {\\n int total = 0;\\n for (int previousDigit = -1; n > 0; n /= 10) {\\n int digit = n % 10;\\n if (previousDigit > digit)\\n ++total;\\n else if (previousDigit >= 0 && previousDigit < digit)\\n --total;\\n previousDigit = digit;\\n }\\n return total == 0;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def risesEqualsFalls:\\n . as $n\\n | if . < 10 then true\\n else {rises: 0, falls: 0, prev: -1, n: $n}\\n | until (.n <= 0;\\n (.n % 10 ) as $d\\n | if .prev >= 0\\n then if $d < .prev then .rises += 1\\n elif $d > .prev then .falls += 1\\n else .\\n\\t end\\n\\t else .\\n\\t end\\n | .prev = $d\\n | .n = ((.n/10)|floor) )\\n | .rises == .falls\\n end ;\\n\\ndef A296712: range(1; infinite) | select(risesEqualsFalls);\\n\\n# Override jq's incorrect definition of nth/2\\n# Emit the $n-th value of the stream, counting from 0; or emit nothing\\ndef nth($n; s):\\n if $n < 0 then error(\\\"nth/2 doesn't support negative indices\\\")\\n else label $out\\n | foreach s as $x (-1; .+1; select(. >= $n) | $x, break $out)\\n end;\\n\\n# The tasks\\n\\\"First 200:\\\",\\n [limit(200; A296712)],\\n\\n \\\"\\\\nThe 10 millionth number in the sequence is \\\\(\\n nth(1e7 - 1; A296712))\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Lazy\\n\\nfunction rises_and_falls(n)\\n if n < 10\\n return 0, 0\\n end\\n lastr, rises, falls = n % 10, 0, 0\\n while n != 0\\n n, r = divrem(n, 10)\\n if r > lastr\\n falls += 1\\n elseif r < lastr\\n rises += 1\\n end\\n lastr = r\\n end\\n return rises, falls\\nend\\n\\nisA296712(x) = ((a, b) = rises_and_falls(x); return a == b)\\n\\nfunction genA296712(N, M)\\n A296712 = filter(isA296712, Lazy.range(1));\\n j = 0\\n for i in take(200, A296712)\\n j += 1\\n print(lpad(i, 4), j % 20 == 0 ? \\\"\\\\n\\\" : \\\"\\\")\\n end\\n for i in take(M, A296712)\\n j = i\\n end\\n println(\\\"\\\\nThe $M-th number in sequence A296712 is $j.\\\")\\nend\\n\\ngenA296712(200, 10_000_000)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n VECTOR VALUES FMT = $I8,1H:,I9*$\\n\\n INTERNAL FUNCTION(NUM)\\n ENTRY TO RISFAL.\\n N=NUM\\n DEPTH = 0\\n DIGA = N-(N/10)*10\\n N = N/10\\nLOOP WHENEVER N.E.0, FUNCTION RETURN DEPTH.E.0\\n DIGB = DIGA\\n DIGA = N-(N/10)*10\\n N = N/10\\n WHENEVER DIGA.L.DIGB, DEPTH=DEPTH-1\\n WHENEVER DIGA.G.DIGB, DEPTH=DEPTH+1\\n TRANSFER TO LOOP\\n END OF FUNCTION\\n\\n I=0\\n J=0\\nLOOP J=J+1\\n WHENEVER .NOT.RISFAL.(J), TRANSFER TO LOOP\\n I=I+1\\n WHENEVER I.LE.200, PRINT FORMAT FMT, I, J\\n WHENEVER I.L.10000000, TRANSFER TO LOOP\\n PRINT FORMAT FMT, I, J\\n\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"ClearAll[EqualRisesAndFallsQ]\\nEqualRisesAndFallsQ[n_Integer] := Total[Sign[Differences[IntegerDigits[n]]]] == 0\\nTake[Select[Range[1000], EqualRisesAndFallsQ], 200]\\nvalid = 0;\\nDynamic[{i, valid}]\\nDo[\\n If[EqualRisesAndFallsQ[i],\\n valid += 1;\\n If[valid == 10^7, Print[i]; Break[]]\\n ]\\n ,\\n {i, 50 10^6}\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strutils\\n\\nfunc insequence(n: Positive): bool =\\n ## Return true if \\\"n\\\" is in the sequence.\\n if n < 10: return true\\n var diff = 0\\n var prev = n mod 10\\n var n = n div 10\\n while n != 0:\\n let digit = n mod 10\\n if digit < prev: inc diff\\n elif digit > prev: dec diff\\n prev = digit\\n n = n div 10\\n result = diff == 0\\n\\niterator a297712(): (int, int) =\\n ## Yield the positions and the numbers of the sequence.\\n var n = 1\\n var pos = 0\\n while true:\\n if n.insequence:\\n inc pos\\n yield (pos, n)\\n inc n\\n\\necho \\\"First 200 numbers in the sequence:\\\"\\nfor (pos, n) in a297712():\\n if pos <= 200:\\n stdout.write ($n).align(3), if pos mod 20 == 0: '\\\\n' else: ' '\\n elif pos == 10_000_000:\\n echo \\\"\\\\nTen millionth number in the sequence: \\\", n\\n break\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict;\\nuse warnings;\\n\\nsub rf\\n {\\n local $_ = shift;\\n my $sum = 0;\\n $sum += $1 <=> $2 while /(.)(?=(.))/g;\\n $sum\\n }\\n\\nmy $count = 0;\\nmy $n = 0;\\nmy @numbers;\\nwhile( $count < 200 )\\n {\\n rf(++$n) or $count++, push @numbers, $n;\\n }\\nprint \\\"first 200: @numbers\\\\n\\\" =~ s/.{1,70}\\\\K\\\\s/\\\\n/gr;\\n\\n$count = 0;\\n$n = 0;\\nwhile( $count < 10e6 )\\n {\\n rf(++$n) or $count++;\\n }\\nprint \\\"\\\\n10,000,000th number: $n\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The first 200 numbers are:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rmf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rmf</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #7060A8;\\\">compare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rmf</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">200</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%3d \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">1e7</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nThe %,dth number is %,d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,d:%,d\\\\r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"Procedure.b eqrf(n.i)\\n sn.s = Str(n)\\n q.i = 0\\n\\n For i.i = 2 To Len(sn)\\n If Asc(Mid(sn, i, 1)) > Asc(Mid(sn, i - 1, 1)):\\n q + 1\\n Else\\n If Asc(Mid(sn, i, 1)) < Asc(Mid(sn, i - 1, 1)):\\n q - 1\\n EndIf\\n EndIf\\n Next\\n If q = 0:\\n ProcedureReturn #True\\n Else\\n ProcedureReturn #False\\n EndIf\\n\\nEndProcedure\\n\\nOpenConsole()\\nc.i = 0\\ni.i = 1\\nWhile c < 10000001\\n If eqrf(i):\\n c + 1\\n If c <= 200:\\n Print(\\\" \\\" + Str(i))\\n EndIf\\n If c = 10000000:\\n PrintN(#CRLF$ + Str(i))\\n EndIf\\n EndIf\\n i + 1\\nWend\\n\\nInput()\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import itertools\\n\\ndef riseEqFall(num):\\n \\\"\\\"\\\"Check whether a number belongs to sequence A296712.\\\"\\\"\\\"\\n height = 0\\n d1 = num % 10\\n num //= 10\\n while num:\\n d2 = num % 10\\n height += (d1<d2) - (d1>d2)\\n d1 = d2\\n num //= 10\\n return height == 0\\n\\ndef sequence(start, fn):\\n \\\"\\\"\\\"Generate a sequence defined by a function\\\"\\\"\\\"\\n num=start-1\\n while True:\\n num += 1\\n while not fn(num): num += 1\\n yield num\\n\\na296712 = sequence(1, riseEqFall)\\n\\n# Generate the first 200 numbers\\nprint(\\\"The first 200 numbers are:\\\")\\nprint(*itertools.islice(a296712, 200))\\n\\n# Generate the 10,000,000th number\\nprint(\\\"The 10,000,000th number is:\\\")\\nprint(*itertools.islice(a296712, 10000000-200-1, 10000000-200))\\n# It is necessary to subtract 200 from the index, because 200 numbers\\n# have already been consumed.\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ [] swap\\n [ 10 /mod\\n rot join swap\\n dup 0 = until ]\\n drop ] is digits ( n --> [ )\\n\\n [ stack ] is rises\\n [ stack ] is falls\\n\\n [ 0 rises put\\n 0 falls put\\n digits\\n behead swap witheach\\n [ tuck 2dup < iff\\n [ 1 rises tally\\n 2drop ] done\\n > if\\n [ 1 falls tally ] ]\\n drop\\n rises take\\n falls take = ] is equal ( n --> b )\\n\\n [] 0\\n [ 1+ dup equal if\\n [ tuck join swap ]\\n over size 200 = until ]\\n drop\\n echo\\n cr cr\\n 0 0\\n [ 1+ dup equal if\\n [ dip 1+ ]\\n over 10000000 = until ]\\n nip\\n echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"use Lingua::EN::Numbers;\\nuse Base::Any;\\n\\nsub rf (int $base = 10, $batch = Any, &op = &infix:<==>) {\\n my %batch = batch => $batch if $batch;\\n flat (1 .. ∞).hyper(|%batch).map: {\\n my int ($this, $last) = $_, $_ % $base;\\n my int ($rise, $fall) = 0, 0;\\n while $this {\\n my int $rem = $this % $base;\\n $this = $this div $base;\\n if $rem > $last { $fall = $fall + 1 }\\n elsif $rem < $last { $rise = $rise + 1 }\\n $last = $rem\\n }\\n next unless &op($rise, $fall);\\n $_\\n }\\n}\\n\\n# The task\\nmy $upto = 200;\\nput \\\"Rise = Fall:\\\\nFirst {$upto.&cardinal} (base 10):\\\";\\n.put for rf[^$upto]».fmt(\\\"%3d\\\").batch(20);\\n\\n$upto = 10_000_000;\\nput \\\"\\\\nThe {$upto.&ordinal} (base 10): \\\", comma rf(10, 65536)[$upto - 1];\\n\\n# Other bases and comparisons\\nput \\\"\\\\n\\\\nGeneralized for other bases and other comparisons:\\\";\\n$upto = ^5;\\nmy $which = \\\"{tc $upto.map({.exp(10).&ordinal}).join: ', '}, values in some other bases:\\\";\\n\\nput \\\"\\\\nRise = Fall: $which\\\";\\nfor <3 296691 4 296694 5 296697 6 296700 7 296703 8 296706 9 296709 10 296712\\n 11 296744 12 296747 13 296750 14 296753 15 296756 16 296759 20 296762 60 296765>\\n -> $base, $oeis {\\n put \\\"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \\\",\\n $upto.map({rf(+$base, Any)[.exp(10) - 1].&to-base($base)}).join: ', '\\n}\\n\\nput \\\"\\\\nRise > Fall: $which\\\";\\nfor <3 296692 4 296695 5 296698 6 296701 7 296704 8 296707 9 296710 10 296713\\n 11 296745 12 296748 13 296751 14 296754 15 296757 16 296760 20 296763 60 296766>\\n -> $base, $oeis {\\n put \\\"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \\\",\\n $upto.map({rf(+$base, Any, &infix:«>»)[.exp(10) - 1].&to-base($base)}).join: ', '\\n }\\n\\nput \\\"\\\\nRise < Fall: $which\\\";\\nfor <3 296693 4 296696 5 296699 6 296702 7 296705 8 296708 9 296711 10 296714\\n 11 296746 12 296749 13 296752 14 296755 15 296758 16 296761 20 296764 60 296767>\\n -> $base, $oeis {\\n put \\\"Base {$base.fmt(<%2d>)} (https://oeis.org/A$oeis): \\\",\\n $upto.map({rf(+$base, Any, &infix:«<»)[.exp(10) - 1].&to-base($base)}).join: ', '\\n }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm finds and displays N numbers that have an equal number of rises and falls,*/\\nparse arg n . /*obtain optional argument from the CL.*/\\nif n=='' | n==\\\",\\\" then n= 200 /*Not specified? Then use the default.*/\\nappend= n>0 /*a flag that is used to append numbers*/\\nn= abs(n) /*use the absolute value of N. */\\ncall init /*initialize the rise/fall database. */\\n do j=1 until #==n /*test integers until we have N of them*/\\n s= 0 /*initialize the sum of rises/falls. */\\n do k=1 for length(j)-1 /*obtain a set of two digs from number.*/\\n t= substr(j, k, 2) /*obtain a set of two digs from number.*/\\n s= s + @.t /*sum the rises and falls in the number*/\\n end /*k*/\\n if s\\\\==0 then iterate /*Equal # of rises & falls? Then add it*/\\n #= # + 1 /*bump the count of numbers found. */\\n if append then $= $ j /*append to the list of numbers found. */\\n end /*j*/\\n\\nif append then call show /*display a list of N numbers──►term.*/\\n else say 'the ' commas(n)th(n) \\\" number is: \\\" commas(j) /*show Nth #.*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg _; do c=length(_)-3 to 1 by -3; _=insert(',', _, c); end; return _\\nth: parse arg th; return word('th st nd rd',1+(th//10)*(th//100%10\\\\==1)*(th//10<4))\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ninit: @.= 0; do i=1 for 9; _= i' '; @._= 1; _= '0'i; @._= +1; end /*i*/\\n do i=10 to 99; parse var i a 2 b; if a>b then @.i= -1\\n else if a<b then @.i= +1\\n end /*i*/; #= 0; $=; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshow: say 'the first ' commas(#) \\\" numbers are:\\\"; say; w= length( word($, #) )\\n _=; do o=1 for n; _= _ right( word($, o), w); if o//20\\\\==0 then iterate\\n say substr(_, 2); _= /*display a line; nullify a new line. */\\n end /*o*/ /* [↑] display 20 numbers to a line.*/\\n\\n if _\\\\=='' then say substr(_, 2); return /*handle any residual numbers in list. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"class Integer\\n def eq_rise_fall? = digits.each_cons(2).sum{|a,b| a <=> b} == 0\\nend\\n\\nputs (1..).lazy.select(&:eq_rise_fall?).take(200).force.join(\\\" \\\")\\n\\nn = 10_000_000\\nres = (1..).lazy.select(&:eq_rise_fall?).take(n).drop(n-1).first\\nputs \\\"The #{n}th number in the sequence is #{res}.\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"func isok(arr) {\\n var diffs = arr.map_cons(2, {|a,b| a - b })\\n diffs.count { .is_pos } == diffs.count { .is_neg }\\n}\\n\\nvar base = 10\\n\\nwith (200) {|n|\\n say \\\"First #{n} terms (base #{base}):\\\"\\n n.by { isok(.digits(base)) && .is_pos }.each_slice(20, {|*a|\\n say a.map { '%3s' % _ }.join(' ')\\n })\\n}\\n\\nwith (1e7) {|n| # takes a very long time\\n say \\\"\\\\nThe #{n.commify}-th term (base #{base}): #{\\n n.th { isok(.digits(base)) && .is_pos }.commify}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc equalRisesAndFalls(_ n: Int) -> Bool {\\n var total = 0\\n var previousDigit = -1\\n var m = n\\n while m > 0 {\\n let digit = m % 10\\n m /= 10\\n if previousDigit > digit {\\n total += 1\\n } else if previousDigit >= 0 && previousDigit < digit {\\n total -= 1\\n }\\n previousDigit = digit\\n }\\n return total == 0\\n}\\n\\nvar count = 0\\nvar n = 0\\nlet limit1 = 200\\nlet limit2 = 10000000\\nprint(\\\"The first \\\\(limit1) numbers in the sequence are:\\\")\\nwhile count < limit2 {\\n n += 1\\n if equalRisesAndFalls(n) {\\n count += 1\\n if count <= limit1 {\\n print(String(format: \\\"%3d\\\", n), terminator: count % 20 == 0 ? \\\"\\\\n\\\" : \\\" \\\")\\n }\\n }\\n}\\nprint(\\\"\\\\nThe \\\\(limit2)th number in the sequence is \\\\(n).\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar risesEqualsFalls = Fn.new { |n|\\n if (n < 10) return true\\n var rises = 0\\n var falls = 0\\n var prev = -1\\n while (n > 0) {\\n var d = n%10\\n if (prev >= 0) {\\n if (d < prev) {\\n rises = rises + 1\\n } else if (d > prev) {\\n falls = falls + 1\\n }\\n }\\n prev = d\\n n = (n/10).floor\\n }\\n return rises == falls\\n}\\n\\nSystem.print(\\\"The first 200 numbers in the sequence are:\\\")\\nvar count = 0\\nvar n = 1\\nwhile (true) {\\n if (risesEqualsFalls.call(n)) {\\n count = count + 1\\n if (count <= 200) {\\n Fmt.write(\\\"$3d \\\", n)\\n if (count % 20 == 0) System.print()\\n }\\n if (count == 1e7) {\\n Fmt.print(\\\"\\\\nThe 10 millionth number in the sequence is $,d.\\\", n)\\n break\\n }\\n }\\n n = n + 1\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func RiseFall(N); \\\\Return 'true' if N has equal rises and falls\\nint N, R, F, D, D0;\\n[R:= 0; F:= 0;\\nN:= N/10;\\nD0:= rem(0);\\nwhile N do\\n [N:= N/10;\\n D:= rem(0);\\n if D > D0 then R:= R+1;\\n if D < D0 then F:= F+1;\\n D0:= D;\\n ];\\nreturn R = F;\\n];\\n\\nint N, Cnt;\\n[N:= 1;\\nCnt:= 0;\\nloop [if RiseFall(N) then\\n [Cnt:= Cnt+1;\\n if Cnt <= 200 then\\n [IntOut(0, N);\\n if rem (Cnt/10) = 0 then CrLf(0)\\n else ChOut(0, 9\\\\tab\\\\);\\n ];\\n if Cnt = 10_000_000 then\\n [Text(0, \\\"10 millionth number is \\\");\\n IntOut(0, N); CrLf(0);\\n quit;\\n ];\\n ];\\n N:= N+1;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Numbers-with-equal-rises-and-falls"}}},{"rowIdx":1455,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Numeric_error_propagation\n","language":"00-META"},{"code":"If '''f''', '''a''', and '''b''' are values with uncertainties σ<sub>f</sub>, σ<sub>a</sub>, and σ<sub>b</sub>, and '''c''' is a constant; \n<br>then if '''f''' is derived from '''a''', '''b''', and '''c''' in the following ways, \n<br>then σ<sub>f</sub> can be calculated as follows:\n\n:;Addition/Subtraction\n:* If f = a ± c, or f = c ± a then '''σ<sub>f</sub> = σ<sub>a</sub>'''\n:* If f = a ± b then '''σ<sub>f</sub><sup>2</sup> = σ<sub>a</sub><sup>2</sup> + σ<sub>b</sub><sup>2</sup>'''\n\n:;Multiplication/Division\n:* If f = ca or f = ac then '''σ<sub>f</sub> = |cσ<sub>a</sub>|'''\n:* If f = ab or f = a / b then '''σ<sub>f</sub><sup>2</sup> = f<sup>2</sup>( (σ<sub>a</sub> / a)<sup>2</sup> + (σ<sub>b</sub> / b)<sup>2</sup>)'''\n\n:;Exponentiation\n:* If f = a<sup>c</sup> then '''σ<sub>f</sub> = |fc(σ<sub>a</sub> / a)|'''\n\n\nCaution:\n::This implementation of error propagation does not address issues of dependent and independent values. It is assumed that '''a''' and '''b''' are independent and so the formula for multiplication should not be applied to '''a*a''' for example. See [[Talk:Numeric_error_propagation|the talk page]] for some of the implications of this issue.\n\n\n;Task details:\n# Add an uncertain number type to your language that can support addition, subtraction, multiplication, division, and exponentiation between numbers with an associated error term together with 'normal' floating point numbers without an associated error term. <br>Implement enough functionality to perform the following calculations.\n# Given coordinates and their errors:<br>x1 = 100 ± 1.1<br>y1 = 50 ± 1.2<br>x2 = 200 ± 2.2<br>y2 = 100 ± 2.3<br> if point p1 is located at (x1, y1) and p2 is at (x2, y2); calculate the distance between the two points using the classic Pythagorean formula: <br> <big><big> d = √<span style=\"text-decoration:overline\"> (x1 - x2)² + (y1 - y2)² </span> </big></big>\n# Print and display both <big> '''d''' </big> and its error.\n\n <!-- the superscript \n 2 glyph [²] \nhad to be used instead of the \n <sup>2</sup> \nnotation which causes the overline \"text-decoration\" to either overlay the superscript or it causes a \"break\" in the continuous overline part of the radic. Gerard Schildberger. --> \n\n;References:\n* [http://casa.colorado.edu/~benderan/teaching/astr3510/stats.pdf A Guide to Error Propagation] B. Keeney, 2005.\n* [[wp:Propagation of uncertainty|Propagation of uncertainty]] Wikipedia.\n\n\n;Related task:\n* [[Quaternion type]]\n<br><br>\n\n","language":"00-TASK"},{"code":"generic\n type Real is digits <>;\n with function Sqrt(X: Real) return Real;\n with function \"**\"(X: Real; Y: Real) return Real;\npackage Approximation is\n\n type Number is private;\n\n -- create an approximation\n function Approx(Value: Real; Sigma: Real) return Number;\n\n -- unary operations and conversion Real to Number\n function \"+\"(X: Real) return Number;\n function \"-\"(X: Real) return Number;\n function \"+\"(X: Number) return Number;\n function \"-\"(X: Number) return Number;\n\n -- addition / subtraction\n function \"+\"(X: Number; Y: Number) return Number;\n function \"-\"(X: Number; Y: Number) return Number;\n\n -- multiplication / division\n function \"*\"(X: Number; Y: Number) return Number;\n function \"/\"(X: Number; Y: Number) return Number;\n\n -- exponentiation\n function \"**\"(X: Number; Y: Positive) return Number;\n function \"**\"(X: Number; Y: Real) return Number;\n\n -- Output to Standard IO (wrapper for Ada.Text_IO and Ada.Text_IO.Float_IO)\n procedure Put_Line(Message: String;\n Item: Number;\n Value_Fore: Natural := 7;\n Sigma_Fore: Natural := 4;\n Aft: Natural := 2;\n Exp: Natural := 0);\n procedure Put(Item: Number;\n Value_Fore: Natural := 7;\n Sigma_Fore: Natural := 3;\n Aft: Natural := 2;\n Exp: Natural := 0);\n\nprivate\n type Number is record\n Value: Real;\n Sigma: Real;\n end record;\nend Approximation;\n","language":"Ada"},{"code":"with Ada.Text_IO;\n\npackage body Approximation is\n\n package RIO is new Ada.Text_IO.Float_IO(Real);\n\n -- create an approximation\n\n function Approx(Value: Real; Sigma: Real) return Number is\n begin\n return (Value, Sigma);\n end Approx;\n\n -- unary operations and conversion Real to Number\n\n function \"+\"(X: Real) return Number is\n begin\n return Approx(X, 0.0);\n end \"+\";\n\n function \"-\"(X: Real) return Number is\n begin\n return Approx(-X, 0.0);\n end \"-\";\n\n function \"+\"(X: Number) return Number is\n begin\n return X;\n end \"+\";\n\n function \"-\"(X: Number) return Number is\n begin\n return Approx(-X.Value, X.Sigma);\n end \"-\";\n\n -- addition / subtraction\n\n function \"+\"(X: Number; Y: Number) return Number is\n Z: Number;\n begin\n Z.Value := X.Value + Y.Value;\n Z.Sigma := Sqrt(X.Sigma*X.Sigma + Y.Sigma*Y.Sigma);\n return Z;\n end \"+\";\n\n function \"-\"(X: Number; Y: Number) return Number is\n begin\n return X + (-Y);\n end \"-\";\n\n -- multiplication / division\n\n function \"*\"(X: Number; Y: Number) return Number is\n Z: Number;\n begin\n Z.Value := X.Value * Y.Value;\n Z.Sigma := Z.Value * Sqrt((X.Sigma/X.Value)**2 + (Y.Sigma/Y.Value)**2);\n return Z;\n end \"*\";\n\n function \"/\"(X: Number; Y: Number) return Number is\n Z: Number;\n begin\n Z.Value := X.Value / Y.Value;\n Z.Sigma := Z.Value * Sqrt((X.Sigma/X.Value)**2 + (Y.Sigma/Y.Value)**2);\n return Z;\n end \"/\";\n\n -- exponentiation\n\n function \"**\"(X: Number; Y: Positive) return Number is\n Z: Number;\n begin\n Z.Value := X.Value ** Y ;\n Z.Sigma := Z.Value * Real(Y) * (X.Sigma/X.Value);\n if Z.Sigma < 0.0 then\n Z.Sigma := - Z.Sigma;\n end if;\n return Z;\n end \"**\";\n\n function \"**\"(X: Number; Y: Real) return Number is\n Z: Number;\n begin\n Z.Value := X.Value ** Y ;\n Z.Sigma := Z.Value * Y * (X.Sigma/X.Value);\n if Z.Sigma < 0.0 then\n Z.Sigma := - Z.Sigma;\n end if;\n return Z;\n end \"**\";\n\n -- Output to Standard IO (wrapper for Ada.Text_IO.Float_IO)\n\n procedure Put_Line(Message: String;\n Item: Number;\n Value_Fore: Natural := 7;\n Sigma_Fore: Natural := 4;\n Aft: Natural := 2;\n Exp: Natural := 0) is\n begin\n Ada.Text_IO.Put(Message);\n Put(Item, Value_Fore, Sigma_Fore, Aft, Exp);\n Ada.Text_IO.New_Line;\n end Put_Line;\n\n procedure Put(Item: Number;\n Value_Fore: Natural := 7;\n Sigma_Fore: Natural := 3;\n Aft: Natural := 2;\n Exp: Natural := 0) is\n begin\n RIO.Put(Item.Value, Value_Fore, Aft, Exp);\n Ada.Text_IO.Put(\" (+-\");\n RIO.Put(Item.Sigma, Sigma_Fore, Aft, Exp);\n Ada.Text_IO.Put(\")\");\n end Put;\n\nend Approximation;\n","language":"Ada"},{"code":"with Approximation, Ada.Numerics.Elementary_Functions;\n\nprocedure Test_Approximations is\n package A is new Approximation(Float,\n Ada.Numerics.Elementary_Functions.Sqrt,\n Ada.Numerics.Elementary_Functions.\"**\");\n use type A.Number;\n X1: A.Number := A.Approx(100.0, 1.1);\n Y1: A.Number := A.Approx( 50.0, 1.2);\n X2: A.Number := A.Approx(200.0, 2.2);\n Y2: A.Number := A.Approx(100.0, 2.3);\n\nbegin\n A.Put_Line(\"Distance:\",\n ((X1-X2)**2 + (Y1 - Y2)**2)**0.5,\n Sigma_Fore => 1);\nend Test_Approximations;\n","language":"Ada"},{"code":"# MODE representing a uncertain number #\nMODE UNCERTAIN = STRUCT( REAL v, uncertainty );\n\n# add a costant and an uncertain value #\nOP + = ( INT c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, uncertainty OF u );\nOP + = ( UNCERTAIN u, INT c )UNCERTAIN: c + u;\nOP + = ( REAL c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, uncertainty OF u );\nOP + = ( UNCERTAIN u, REAL c )UNCERTAIN: c + u;\n# add two uncertain values #\nOP + = ( UNCERTAIN a, b )UNCERTAIN: UNCERTAIN( v OF a + v OF b\n , sqrt( ( uncertainty OF a * uncertainty OF a )\n + ( uncertainty OF b * uncertainty OF b )\n )\n );\n\n# negate an uncertain value #\nOP - = ( UNCERTAIN a )UNCERTAIN: ( - v OF a, uncertainty OF a );\n\n# subtract an uncertain value from a constant #\nOP - = ( INT c, UNCERTAIN u )UNCERTAIN: c + - u;\nOP - = ( REAL c, UNCERTAIN u )UNCERTAIN: c + - u;\n# subtract a constant from an uncertain value #\nOP - = ( UNCERTAIN u, INT c )UNCERTAIN: u + - c;\nOP - = ( UNCERTAIN u, REAL c )UNCERTAIN: u + - c;\n# subtract two uncertain values #\nOP - = ( UNCERTAIN a, b )UNCERTAIN: a + - b;\n\n# multiply a constant by an uncertain value #\nOP * = ( INT c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, ABS( c * uncertainty OF u ) );\nOP * = ( UNCERTAIN u, INT c )UNCERTAIN: c * u;\nOP * = ( REAL c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, ABS( c * uncertainty OF u ) );\nOP * = ( UNCERTAIN u, REAL c )UNCERTAIN: c * u;\n# multiply two uncertain values #\nOP * = ( UNCERTAIN a, b )UNCERTAIN:\n BEGIN\n REAL av = v OF a;\n REAL bv = v OF b;\n REAL f = av * bv;\n UNCERTAIN( f, f * sqrt( ( uncertainty OF a / av ) + ( uncertainty OF b / bv ) ) )\n END # * # ;\n\n# construct the reciprocol of an uncertain value #\nOP ONEOVER = ( UNCERTAIN u )UNCERTAIN: ( 1 / v OF u, uncertainty OF u );\n# divide a constant by an uncertain value #\nOP / = ( INT c, UNCERTAIN u )UNCERTAIN: c * ONEOVER u;\nOP / = ( REAL c, UNCERTAIN u )UNCERTAIN: c * ONEOVER u;\n# divide an uncertain value by a constant #\nOP / = ( UNCERTAIN u, INT c )UNCERTAIN: u * ( 1 / c );\nOP / = ( UNCERTAIN u, REAL c )UNCERTAIN: u * ( 1 / c );\n# divide two uncertain values #\nOP / = ( UNCERTAIN a, b )UNCERTAIN: a * ONEOVER b;\n\n# exponentiation #\nOP ^ = ( UNCERTAIN u, INT c )UNCERTAIN:\n BEGIN\n REAL f = v OF u ^ c;\n UNCERTAIN( f, ABS ( ( f * c * uncertainty OF u ) / v OF u ) )\n END # ^ # ;\nOP ^ = ( UNCERTAIN u, REAL c )UNCERTAIN:\n BEGIN\n REAL f = v OF u ^ c;\n UNCERTAIN( f, ABS ( ( f * c * uncertainty OF u ) / v OF u ) )\n END # ^ # ;\n\n# test the above operatrs by using them to find the pythagorean distance between the two sample points #\nUNCERTAIN x1 = UNCERTAIN( 100, 1.1 );\nUNCERTAIN y1 = UNCERTAIN( 50, 1.2 );\nUNCERTAIN x2 = UNCERTAIN( 200, 2.2 );\nUNCERTAIN y2 = UNCERTAIN( 100, 2.3 );\n\nUNCERTAIN d = ( ( ( x1 - x2 ) ^ 2 ) + ( y1 - y2 ) ^ 2 ) ^ 0.5;\n\nprint( ( \"distance: \", fixed( v OF d, 0, 2 ), \" +/- \", fixed( uncertainty OF d, 0, 2 ), newline ) )\n","language":"ALGOL-68"},{"code":"#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <math.h>\n\ntypedef struct{\n double value;\n double delta;\n}imprecise;\n\n#define SQR(x) ((x) * (x))\nimprecise imprecise_add(imprecise a, imprecise b)\n{\n imprecise ret;\n ret.value = a.value + b.value;\n ret.delta = sqrt(SQR(a.delta) + SQR(b.delta));\n return ret;\n}\n\nimprecise imprecise_mul(imprecise a, imprecise b)\n{\n imprecise ret;\n ret.value = a.value * b.value;\n ret.delta = sqrt(SQR(a.value * b.delta) + SQR(b.value * a.delta));\n return ret;\n}\n\nimprecise imprecise_div(imprecise a, imprecise b)\n{\n imprecise ret;\n ret.value = a.value / b.value;\n ret.delta = sqrt(SQR(a.value * b.delta) + SQR(b.value * a.delta)) / SQR(b.value);\n return ret;\n}\n\nimprecise imprecise_pow(imprecise a, double c)\n{\n imprecise ret;\n ret.value = pow(a.value, c);\n ret.delta = fabs(ret.value * c * a.delta / a.value);\n return ret;\n}\n\nchar* printImprecise(imprecise val)\n{\n\tchar principal[30],error[30],*string,sign[2];\n\tsign[0] = 241; /* ASCII code for ±, technical notation for denoting errors */\n\tsign[1] = 00;\n\t\n\tsprintf(principal,\"%f\",val.value);\n\tsprintf(error,\"%f\",val.delta);\n\t\n\tstring = (char*)malloc((strlen(principal)+1+strlen(error)+1)*sizeof(char));\n\t\n\tstrcpy(string,principal);\n\tstrcat(string,sign);\n\tstrcat(string,error);\n\t\n\treturn string;\n}\n\nint main(void) {\n imprecise x1 = {100, 1.1};\n imprecise y1 = {50, 1.2};\n imprecise x2 = {-200, 2.2};\n imprecise y2 = {-100, 2.3};\n imprecise d;\n\n d = imprecise_pow(imprecise_add(imprecise_pow(imprecise_add(x1, x2), 2),imprecise_pow(imprecise_add(y1, y2), 2)), 0.5);\n printf(\"Distance, d, between the following points :\");\n printf(\"\\n( x1, y1) = ( %s, %s)\",printImprecise(x1),printImprecise(y1));\n printf(\"\\n( x2, y2) = ( %s, %s)\",printImprecise(x2),printImprecise(y2));\n printf(\"\\nis d = %s\", printImprecise(d));\n return 0;\n}\n","language":"C"},{"code":"#pragma once\n\n#include <cmath>\n#include <string>\n#include <sstream>\n#include <iomanip>\n\nclass Approx {\npublic:\n Approx(double _v, double _s = 0.0) : v(_v), s(_s) {}\n\n operator std::string() const {\n std::ostringstream os(\"\");\n os << std::setprecision(15) << v << \" ±\" << std::setprecision(15) << s << std::ends;\n return os.str();\n }\n\n Approx operator +(const Approx& a) const { return Approx(v + a.v, sqrt(s * s + a.s * a.s)); }\n Approx operator +(double d) const { return Approx(v + d, s); }\n Approx operator -(const Approx& a) const { return Approx(v - a.v, sqrt(s * s + a.s * a.s)); }\n Approx operator -(double d) const { return Approx(v - d, s); }\n\n Approx operator *(const Approx& a) const {\n const double t = v * a.v;\n return Approx(v, sqrt(t * t * s * s / (v * v) + a.s * a.s / (a.v * a.v)));\n }\n\n Approx operator *(double d) const { return Approx(v * d, fabs(d * s)); }\n\n Approx operator /(const Approx& a) const {\n const double t = v / a.v;\n return Approx(t, sqrt(t * t * s * s / (v * v) + a.s * a.s / (a.v * a.v)));\n }\n\n Approx operator /(double d) const { return Approx(v / d, fabs(d * s)); }\n\n Approx pow(double d) const {\n const double t = ::pow(v, d);\n return Approx(t, fabs(t * d * s / v));\n }\n\nprivate:\n double v, s;\n};\n","language":"C++"},{"code":"#include <cstdlib>\n#include <iostream>\n#include \"numeric_error.hpp\"\n\nint main(const int argc, const char* argv[]) {\n const Approx x1(100, 1.1);\n const Approx x2(50, 1.2);\n const Approx y1(200, 2.2);\n const Approx y2(100, 2.3);\n std::cout << std::string(((x1 - x2).pow(2.) + (y1 - y2).pow(2.)).pow(0.5)) << std::endl; // => 111.803398874989 ±2.938366893361\n\n\treturn EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"(defstruct uncertain-number\n (value 0 :type number)\n (uncertainty 0 :type number))\n\n(defmethod print-object ((n uncertain-number) stream)\n (format stream \"~,2F ± ~,2F\" (uncertain-number-value n) (uncertain-number-uncertainty n)))\n\n(defun ~+ (n1 n2)\n (let* ((value1 (uncertain-number-value n1))\n (value2 (uncertain-number-value n2))\n (uncertainty1 (uncertain-number-uncertainty n1))\n (uncertainty2 (uncertain-number-uncertainty n2))\n (value (+ value1 value2))\n (uncertainty (sqrt (+ (* uncertainty1 uncertainty1)\n (* uncertainty2 uncertainty2)))))\n (make-uncertain-number :value value :uncertainty uncertainty)))\n\n(defun negate (n)\n (make-uncertain-number :value (- (uncertain-number-value n))\n :uncertainty (uncertain-number-uncertainty n)))\n\n(defun ~- (n1 n2)\n (~+ n1 (negate n2)))\n\n(defun ~* (n1 n2)\n (let* ((value1 (uncertain-number-value n1))\n (value2 (uncertain-number-value n2))\n (uncertainty-ratio-1 (/ (uncertain-number-uncertainty n1) value1))\n (uncertainty-ratio-2 (/ (uncertain-number-uncertainty n2) value2))\n (value (* value1 value2))\n (uncertainty (sqrt (* value\n value\n (+ (* uncertainty-ratio-1 uncertainty-ratio-1)\n (* uncertainty-ratio-2 uncertainty-ratio-2))))))\n (make-uncertain-number :value value :uncertainty uncertainty)))\n\n(defun inverse (n)\n (make-uncertain-number :value (/ (uncertain-number-value n))\n :uncertainty (uncertain-number-uncertainty n)))\n\n(defun ~/ (n1 n2)\n (~* n1 (inverse n2)))\n\n(defun ~expt (base exp)\n (let* ((base-value (uncertain-number-value base))\n (uncertainty-ratio (/ (uncertain-number-uncertainty base) base-value))\n (value (expt base-value exp))\n (uncertainty (abs (* value exp uncertainty-ratio))))\n (make-uncertain-number :value value :uncertainty uncertainty)))\n\n(defun solve ()\n (let* ((x1 (make-uncertain-number :value 100 :uncertainty 1.1))\n (y1 (make-uncertain-number :value 50 :uncertainty 1.2))\n (x2 (make-uncertain-number :value 200 :uncertainty 2.2))\n (y2 (make-uncertain-number :value 100 :uncertainty 2.3))\n (d (~expt (~+ (~expt (~- x1 x2) 2) (~expt (~- y1 y2) 2))\n 1/2)))\n (format t \"d = ~A~%\" d)))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.math, std.string, std.typecons, std.traits;\n\nconst struct Imprecise {\n private const double value, delta;\n\n this(in double v, in double d) pure nothrow {\n this.value = v;\n this.delta = abs(d);\n }\n\n enum IsImprecise(T) = is(Unqual!T == Unqual!(typeof(this)));\n\n I reciprocal() const pure nothrow {\n return I(1.0 / value, delta / (value ^^ 2));\n }\n\n string toString() const {\n return format(\"I(value=%g, delta=%g)\", value, delta);\n }\n\n I opUnary(string op:\"-\")() const pure nothrow {\n return I(-this.value, this.delta);\n }\n\n I opBinary(string op:\"+\", T)(in T other) const pure nothrow\n if (isNumeric!T || IsImprecise!T) {\n static if (IsImprecise!T)\n return I(this.value + other.value,\n (this.delta ^^ 2 + other.delta ^^ 2) ^^ 0.5);\n else\n return I(this.value + other, this.delta);\n }\n\n I opBinaryRight(string op:\"+\", T)(in T other) const pure nothrow\n if (isNumeric!T) {\n return I(this.value + other, this.delta);\n }\n\n I opBinary(string op:\"-\", T)(in T other) const pure nothrow\n if (isNumeric!T || IsImprecise!T) {\n return this + (-other);\n }\n\n I opBinaryRight(string op:\"-\", T)(in T other) const pure nothrow\n if (isNumeric!T) {\n return this - other;\n }\n\n I opBinary(string op:\"*\", T)(in T other) const pure nothrow\n if (isNumeric!T || IsImprecise!T) {\n static if (IsImprecise!T) {\n auto f = this.value * other.value;\n return I(f, f * ((delta / value) ^^ 2 +\n (other.delta / other.value) ^^ 2) ^^ 0.5);\n } else\n return I(this.value * other, this.delta * other);\n }\n\n I opBinaryRight(string op:\"*\", T)(in T other) const pure nothrow\n if (isNumeric!T) {\n return this * other;\n }\n\n I opBinary(string op:\"/\", T)(in T other) const pure nothrow\n if (isNumeric!T || IsImprecise!T) {\n static if (IsImprecise!T)\n return this * other.reciprocal();\n else\n return I(this.value / other, this.delta / other);\n }\n\n I opBinaryRight(string op:\"/\", T)(in T other) const pure nothrow\n if (isNumeric!T) {\n return this / other;\n }\n\n I opBinary(string op:\"^^\", T)(in T other) const pure nothrow\n if (isNumeric!T) {\n auto f = this.value ^^ other;\n return I(f, f * other * (this.delta / this.value));\n }\n}\n\nalias I = Imprecise;\n\nauto distance(T1, T2)(in T1 p1, in T2 p2) pure nothrow {\n return ((p1[0] - p2[0]) ^^ 2 + (p1[1] - p2[1]) ^^ 2) ^^ 0.5;\n}\n\nvoid main() {\n immutable x1 = I(100, 1.1);\n immutable x2 = I(200, 2.2);\n immutable y1 = I( 50, 1.2);\n immutable y2 = I(100, 2.3);\n\n immutable p1 = tuple(x1, y1);\n immutable p2 = tuple(x2, y2);\n writefln(\"Point p1: (%s, %s)\", p1[0], p1[1]);\n writefln(\"Point p2: (%s, %s)\", p2[0], p2[1]);\n writeln(\"Distance(p1, p2): \", distance(p1, p2));\n}\n","language":"D"},{"code":"let sqr (x : float) = x * x\nlet abs (x : float) = System.Math.Abs x\nlet pow = System.Math.Pow\n\ntype Approx (value : float, sigma : float) =\n member this.value = value\n member this.sigma = sigma\n\n static member (~-) (x : Approx) = Approx (- x.value, x.sigma)\n static member (%+) (x: Approx, y : float) = Approx (x.value + y, x.sigma)\n static member (%+) (y : float, x : Approx) = x %+ y\n static member (%+) (x : Approx, y : Approx) =\n Approx (x.value + y.value, sqrt((sqr x.sigma)+(sqr y.sigma)))\n static member (%-) (x: Approx, y : float) = Approx (x.value - y, x.sigma)\n static member (%-) (y : float, x : Approx) = (-x) %+ y\n static member (%-) (x : Approx, y : Approx) = x %+ (-y)\n static member (%*) (x : Approx, y : float) = Approx (y * x.value, abs(y * x.sigma))\n static member (%*) (y : float, x : Approx) = x %* y\n static member (%*) (x : Approx, y : Approx) =\n let v = x.value * y.value\n Approx (v, v * sqrt(sqr(x.sigma/x.value))+sqr(y.sigma/y.value))\n static member (%/) (x : Approx, y : Approx) =\n Approx (x.value / y.value, sqrt(sqr(x.sigma/x.value))+sqr(y.sigma/y.value))\n static member (%^) (x : Approx, y : float) =\n if y < 0. then failwith (\"Cannot raise the power with a negative number \" + y.ToString())\n let v = pow(x.value,y)\n Approx (v, abs(v * y * x.sigma / x.value))\n\n override this.ToString() = sprintf \"%.2f ±%.2f\" value sigma\n\n[<EntryPoint>]\nlet main argv =\n let x1 = Approx (100., 1.1)\n let y1 = Approx (50., 1.2)\n let x2 = Approx (200., 2.2)\n let y2 = Approx (100., 2.3)\n\n printfn \"Distance: %A\" ((((x1 %- x2) %^ 2.) %+ ((y1 %- y2) %^ 2.)) %^ 0.5)\n 0\n","language":"F-Sharp"},{"code":"USING: accessors arrays fry kernel locals math math.functions\nmulti-methods parser prettyprint prettyprint.custom sequences ;\nRENAME: GENERIC: multi-methods => MM-GENERIC:\nFROM: syntax => M: ;\nIN: imprecise\n\nTUPLE: imprecise\n { value float read-only }\n { sigma float read-only } ;\n\nC: <imprecise> imprecise\n\n: >imprecise< ( imprecise -- value sigma )\n [ value>> ] [ sigma>> ] bi ;\n\n! Define a custom syntax for imprecise numbers.\n\n<< SYNTAX: I{ \\ } [ first2 <imprecise> ] parse-literal ; >>\nM: imprecise pprint-delims drop \\ I{ \\ } ;\nM: imprecise >pprint-sequence >imprecise< 2array ;\nM: imprecise pprint* pprint-object ;\n\n<PRIVATE\n\n! Error functions\n\n: f+-i ( float imprecise quot -- imprecise )\n [ >imprecise< ] dip dip <imprecise> ; inline\n\n: i+-i ( imprecise1 imprecise2 quot -- imprecise )\n '[ [ value>> ] bi@ @ ]\n [ [ sigma>> sq ] bi@ + sqrt <imprecise> ] 2bi ; inline\n\n: f*/i ( float imprecise quot -- imprecise )\n [ >imprecise< overd ] dip [ * abs ] 2bi* <imprecise> ;\n inline\n\n:: i*/i ( a b quot -- imprecise )\n a b [ >imprecise< ] bi@ :> ( vala siga valb sigb )\n vala valb quot call :> val\n val sq siga sq * vala sq /f sigb sq + valb sq /f sqrt :> sig\n val sig <imprecise> ; inline\n\nPRIVATE>\n\nMM-GENERIC: ~+ ( obj1 obj2 -- imprecise ) foldable flushable\nMETHOD: ~+ { float imprecise } [ + ] f+-i ;\nMETHOD: ~+ { imprecise float } swap ~+ ;\nMETHOD: ~+ { imprecise imprecise } [ + ] i+-i ;\n\nMM-GENERIC: ~- ( obj1 obj2 -- imprecise ) foldable flushable\nMETHOD: ~- { float imprecise } [ - ] f+-i ;\nMETHOD: ~- { imprecise float } swap [ swap - ] f+-i ;\nMETHOD: ~- { imprecise imprecise } [ - ] i+-i ;\n\nMM-GENERIC: ~* ( obj1 obj2 -- imprecise ) foldable flushable\nMETHOD: ~* { float imprecise } [ * ] f*/i ;\nMETHOD: ~* { imprecise float } swap ~* ;\nMETHOD: ~* { imprecise imprecise } [ * ] i*/i ;\n\nMM-GENERIC: ~/ ( obj1 obj2 -- imprecise ) foldable flushable\nMETHOD: ~/ { float imprecise } [ /f ] f*/i ;\nMETHOD: ~/ { imprecise float } swap [ swap /f ] f*/i ;\nMETHOD: ~/ { imprecise imprecise } [ /f ] i*/i ;\n\n:: ~^ ( a x -- imprecise )\n a >imprecise< :> ( vala siga )\n vala x ^ >rect drop :> val\n val x * siga vala /f * abs :> sig\n val sig <imprecise> ; foldable flushable\n\n<PRIVATE\n\n: imprecise-demo ( -- )\n I{ 100 1.1 } I{ 200 2.2 } ~- 2. ~^\n I{ 50 1.2 } I{ 100 2.3 } ~- 2. ~^ ~+ 0.5 ~^ . ;\n\nPRIVATE>\n\nMAIN: imprecise-demo\n","language":"Factor"},{"code":"USING: arrays kernel locals math math.functions math.vectors\nprettyprint sequences sequences.extras ;\nIN: uncertain\n\n<PRIVATE\n\n: ubi* ( x y p q -- u )\n [ [ first2 ] bi@ swapd ] 2dip 2bi* 2array ; inline\n\n: err+ ( x y -- z ) [ sq ] bi@ + sqrt ;\n\n:: (u*) ( u1 u2 quot -- u )\n u1 u2 [ first2 ] bi@ :> ( v1 s1 v2 s2 )\n v1 v2 quot call :> val\n s1 v1 /f sq s2 v2 /f sq + val sq * sqrt :> sig\n val sig 2array ; inline\n\nPRIVATE>\n\n: u+n ( u n -- u ) 0 2array v+ ;\n: n+u ( n u -- u ) swap u+n ;\n: u-n ( u n -- u ) 0 2array v- ;\n: n-u ( n u -- u ) [ 0 2array ] dip v- ;\n: u+ ( u u -- u ) [ + ] [ err+ ] ubi* ;\n: u- ( u u -- u ) [ - ] [ err+ ] ubi* ;\n: u*n ( u n -- u ) dup 2array [ * ] [ * abs ] ubi* ;\n: n*u ( n u -- u ) swap u*n ;\n: u/n ( u n -- u ) dup 2array [ /f ] [ * abs ] ubi* ;\n: n/u ( n u -- u ) [ dup 2array ] dip [ /f ] [ * abs ] ubi* ;\n: u* ( u u -- u ) [ * ] (u*) ;\n: u/ ( u u -- u ) [ /f ] (u*) ;\n\n:: u^n ( u n -- u )\n u first2 :> ( v1 s1 )\n v1 n ^ >rect drop :> val\n val n * s1 v1 /f * abs :> sig\n val sig 2array ;\n\n<PRIVATE\n\n: uncertain-demo ( -- )\n { 100 1.1 } { 200 2.2 } u- 2.0 u^n\n { 50 1.2 } { 100 2.3 } u- 2.0 u^n u+ 0.5 u^n . ;\n\nPRIVATE>\n\nMAIN: uncertain-demo\n","language":"Factor"},{"code":" PROGRAM CALCULATE\t!A distance, with error propagation.\n REAL X1, Y1, X2, Y2\t!The co-ordinates.\n REAL X1E,Y1E,X2E,Y2E\t!Their standard deviation.\n DATA X1, Y1 ,X2, Y2 /100., 50., 200.,100./\t!Specified\n DATA X1E,Y1E,X2E,Y2E/ 1.1, 1.2, 2.2, 2.3/\t!Values.\n REAL DX,DY,D2,D,DXE,DYE,E\t!Assistants.\n CHARACTER*1 C\t\t\t!I'm stuck with code page 437 instead of 850.\n PARAMETER (C = CHAR(241))\t\t!Thus ± does not yield this glyph on a \"console\" screen. CHAR(241) does.\n REAL SD\t!This is an arithmetic statement function.\n SD(X,P,S) = P*ABS(X)**(P - 1)*S\t!SD for X**P where SD of X is S\n WRITE (6,1) X1,C,X1E,Y1,C,Y1E,\t!Reveal the points\n 1 X2,C,X2E,Y2,C,Y2E\t!Though one could have used an array...\n 1 FORMAT (\"Euclidean distance between two points:\"/\t!A heading.\n 1 (\"(\",F5.1,A1,F3.1,\",\",F5.1,A1,F3.1,\")\"))\t\t!Thus, One point per line.\n DX = (X1 - X2)\t\t\t!X difference.\n DXE = SQRT(X1E**2 + X2E**2)\t!SD for DX, a simple difference.\n DY = (Y1 - Y2)\t\t\t!Y difference.\n DYE = SQRT(Y1E**2 + Y2E**2)\t!SD for DY, (Y1 - Y2)\n D2 = DX**2 + DY**2\t\t!The distance, squared.\n DXE = SD(DX,2,DXE)\t\t!SD for DX**2\n DYE = SD(DY,2,DYE)\t\t!SD for DY**2\n E = SQRT(DXE**2 + DYE**2)\t\t!SD for their sum\n D = SQRT(D2)\t\t\t!The distance!\n E = SD(D2,0.5,E)\t\t\t!SD after the SQRT.\n WRITE (6,2) D,C,E\t\t\t!Ahh, the relief.\n 2 FORMAT (\"Distance\",F6.1,A1,F4.2)\t!Sizes to fit the example.\n END\t!Enough.\n","language":"Fortran"},{"code":" MODULE ERRORFLOW\t!Calculate with an error estimate tagging along.\n INTEGER VSP,VMAX\t\t!Do so with an arithmetic stack.\n PARAMETER (VMAX = 28)\t!Surely sufficient.\n REAL STACKV(VMAX)\t!Holds the values.\n REAL STACKE(VMAX)\t!And the corresponding error estimate.\n INTEGER VOUT\t\t!Output file.\n LOGICAL VTRACE\t\t!Perhaps progress is to be followed in detail.\n DATA VSP,VOUT,VTRACE/0,0,.FALSE./\t!Start with nothing.\n CHARACTER*1 PM\t\t\t!I'm stuck with code page 437 instead of 850.\n PARAMETER (PM = CHAR(241))\t!Thus ± does not yield this glyph on a \"console\" screen. CHAR(241) does.\n CONTAINS\t\t!The servants.\n SUBROUTINE VINIT(OUT)\t!Get ready.\n INTEGER OUT\t\t!Unit number for output.\n VSP = 0\t\t!My stack is empty.\n VOUT = OUT\t\t!Save this rather than have extra parameters.\n VTRACE = VOUT .GT. 0\t!By implication.\n END SUBROUTINE VINIT\t!Ready.\n SUBROUTINE VSHOW(WOT)\t!Show the topmost element.\n CHARACTER*(*) WOT\t!The caller identifies itself.\n IF (VSP.LE.0) THEN\t!Just in case\n WRITE (VOUT,1) \"Empty\",VSP\t!My stack may be empty.\n ELSE\t\t\t!But normally, it is not.\n IF (STACKV(VSP).EQ.0) THEN\t!But it might have a zero value!\n WRITE (VOUT,1) WOT,VSP,STACKV(VSP),PM,STACKE(VSP)\t\t!Alas. No percentage, then.\n 1 FORMAT (A8,\": Vstack(\",I2,\") =\",F8.1,A1,F6.2,F9.1,\"%\")\t!Suits the example.\n ELSE\t\t!Avoiding a divide-by-zero is polite.\n WRITE (VOUT,1) WOT,VSP,STACKV(VSP),PM,STACKE(VSP),\t!Possibly, a surprise, still.\n 1 STACKE(VSP)/STACKV(VSP)*100\t!The relative error may well be interesting.\n END IF\t\t!The pearls have been cast.\n END IF\t\t!So much for protection.\n END SUBROUTINE VSHOW\t!Could reveal all the stack...\n\n SUBROUTINE VLOAD(V,E)\t!Load the stack.\n REAL V,E\t\t!The value and its error.\n IF (VSP.GE.VMAX) STOP \"VLOAD: overflow!\"\t!Oh dear.\n VSP = VSP + 1\t\t!Up one.\n STACKV(VSP) = V\t!Place the value.\n STACKE(VSP) = E\t!And the error.\n IF (VTRACE) CALL VSHOW(\"vLoad\")\n END SUBROUTINE VLOAD\t!That was easy!\n\n SUBROUTINE VADD\t\t!Add the top two elements.\n IF (VSP.LE.1) STOP \"VADD: underflow!\"\t!Maybe not.\n STACKV(VSP - 1) = STACKV(VSP - 1) + STACKV(VSP)\t!Do the deed.\n STACKE(VSP - 1) = SQRT(STACKE(VSP - 1)**2 + STACKE(VSP)**2)\t!The errors follow.\n VSP = VSP - 1\t\t\t!Two values have become one.\n IF (VTRACE) CALL VSHOW(\"vAdd\")!The result.\n END SUBROUTINE VADD\t!The variance of the sum is the sum of the variances.\n\n SUBROUTINE VSUB\t\t!Subtract the topmost element from the one below.\n IF (VSP.LE.1) STOP \"VSUB: underflow!\"\t!Perhaps not.\n STACKV(VSP - 1) = STACKV(VSP - 1) - STACKV(VSP)\t!The topmost was the second loaded.\n STACKE(VSP - 1) = SQRT(STACKE(VSP - 1)**2 + STACKE(VSP)**2)\t!Add the variances also.\n VSP = VSP - 1\t\t\t!Two values have become one.\n IF (VTRACE) CALL VSHOW(\"vSub\")!The result.\n END SUBROUTINE VSUB\t!Could alternatively play with the signs and add...\n\n SUBROUTINE VMUL\t\t!Multiply the top two elements.\n REAL R1,R2\t\t!Use relative errors in place of plain SD.\n IF (VSP.LE.1) STOP \"VMUL: underflow!\"\t!Perhaps not.\n R1 = STACKE(VSP - 1)/STACKV(VSP - 1)\t!The relative errors for multiply\n R2 = STACKE(VSP) /STACKV(VSP)\t!Are treated as are variances in addition.\n STACKV(VSP - 1) = STACKV(VSP - 1)*STACKV(VSP)\t!Perform the multiply.\n VSP = VSP - 1\t\t\t\t\t!Unstack, but not quite finished.\n STACKE(VSP) = SQRT((R1**2 + R2**2)*STACKV(VSP)**2)\t![SD/xy]² = [SD/x]² + [SD/y]²\n IF (VTRACE) CALL VSHOW(\"vMul\")\t\t\t!Thus SD² = [[SD/x]² + [SD/y]²]xy²\n END SUBROUTINE VMUL\t!The square means that the error's sign is not altered.\n\n SUBROUTINE VDIV\t\t!Divide the penultimate element by the top elements.\n REAL R1,R2\t\t!Use relative errors in place of plain SD.\n IF (VSP.LE.1) STOP \"VDIV: underflow!\"\t!Perhaps not.\n R1 = STACKE(VSP - 1)/STACKV(VSP - 1)\t!The relative errors for divide\n R2 = STACKE(VSP) /STACKV(VSP)\t!Are treated as are variances in subtraction.\n STACKV(VSP - 1) = STACKV(VSP - 1)/STACKV(VSP)\t!Perform the divide.\n VSP = VSP - 1\t\t\t\t\t!X/Y is Load X, Load Y, Divide; Y is topmost.\n STACKE(VSP) = SQRT((R1**2 + R2**2)*STACKV(VSP)**2)\t![SD/(x/y)]² = [SD/x]² + [SD/y]²\n IF (VTRACE) CALL VSHOW(\"vDiv\")\t\t\t!Thus SD² = [[SD/x]² + [SD/y]²](x/y)²\n END SUBROUTINE VDIV\t!Worry over y ± SD spanning zero...\n\n SUBROUTINE VSQRT\t!Now for some fun with the topmost element.\n IF (VSP.LE.0) STOP \"VSQRT: underflow!\"\t!Maybe not.\n STACKV(VSP) = SQRT(STACKV(VSP))\t\t!Negative? Let the system complain.\n STACKE(VSP) = 0.5/STACKV(VSP)*STACKE(VSP)\t!F(x ± s) = F(x) ± F'(x).s\n IF (VTRACE) CALL VSHOW(\"vSqrt\")\t\t!Here, F' can't be negative.\n END SUBROUTINE VSQRT\t!No change to the pointer.\n SUBROUTINE VSQUARE\t!Another raise-to-a-power.\n STACKE(VSP) = 2*ABS(STACKV(VSP))*STACKE(VSP)\t!The error's sign is not to be messed with.\n STACKV(VSP) = STACKV(VSP)**2\t\t!This will never be negative.\n IF (VTRACE) CALL VSHOW(\"vSquare\")\t!Keep away from zero though.\n END SUBROUTINE VSQUARE\t!Same formula as VSQRT, just a different power.\n SUBROUTINE VPOW(P)\t!Now for the more general.\n INTEGER P\t\t!Though only integer powers for this routine, so no EXP(P*LN(x)).\n IF (VSP.LE.0) STOP \"VPOW: underflow!\"\t!Perhaps not.\n IF (P.EQ.0) STOP \"VPOW: zero power!\"\t!No sense in this power!\n STACKE(VSP) = P*ABS(STACKV(VSP))**(P - 1)*STACKE(VSP)\t!Negative values a worry.\n STACKV(VSP) = ABS(STACKV(VSP))**P\t\t\t!I only want the magnitude.\n IF (VTRACE) CALL VSHOW(\"vPower\")\t!So, what happened?\n END SUBROUTINE VPOW\t!Powers with fractional parts are troublesome.\n END MODULE ERRORFLOW\t!That will do for the test problem.\n\n PROGRAM CALCULATE\t!A distance, with error propagation.\n USE ERRORFLOW\t!For the details.\n REAL X1, Y1, X2, Y2\t!The co-ordinates.\n REAL X1E,Y1E,X2E,Y2E\t!Their standard deviation.\n DATA X1, Y1 ,X2, Y2 /100., 50., 200.,100./\t!Specified\n DATA X1E,Y1E,X2E,Y2E/ 1.1, 1.2, 2.2, 2.3/\t!Values.\n\n WRITE (6,1) X1,PM,X1E,Y1,PM,Y1E,\t!Reveal the points\n 1 X2,PM,X2E,Y2,PM,Y2E\t!Though one could have used an array...\n 1 FORMAT (\"Euclidean distance between two points:\"/\t!A heading.\n 1 (\"(\",F5.1,A1,F3.1,\",\",F5.1,A1,F3.1,\")\"))\t\t!Thus, One point per line.\n\nCalculate SQRT[(X2 - X1)**2 + (Y2 - Y1)**2]\n CALL VINIT(6)\t\t!Start my arithmetic.\n CALL VLOAD(X2,X2E)\n CALL VLOAD(X1,X1E)\n CALL VSUB\t\t\t!(X2 - X1)\n CALL VSQUARE\t\t!(X2 - X1)**2\n CALL VLOAD(Y2,Y2E)\n CALL VLOAD(Y1,Y1E)\n CALL VSUB\t\t\t!Y2 - Y1)\n CALL VSQUARE\t\t!Y2 - Y1)**2\n CALL VADD\t\t\t!(X2 - X1)**2 + (Y2 - Y1)**2\n CALL VSQRT\t\t!SQRT((X2 - X1)**2 + (Y2 - Y1)**2)\n WRITE (6,2) STACKV(1),PM,STACKE(1)\t!Ahh, the relief.\n 2 FORMAT (\"Distance\",F6.1,A1,F4.2)\t!Sizes to fit the example.\n END\t!Enough.\n","language":"Fortran"},{"code":" TYPE DATUM\n REAL VALUE\n REAL SD\n END TYPE DATUM\n TYPE POINT\n TYPE(DATUM) X\n TYPE(DATUM) Y\n END TYPE POINT\n TYPE(POINT) P1,P2\n","language":"Fortran"},{"code":"'----------------------\n' definition of a \"measurement\" type with value and uncartainty\n' and operators that can operate on them\n'---------------------\n\n#macro p2(x)\n (x)*(x)\n#endmacro\n\ntype meas\n vlu as double\n unc as double\nend type\n\noperator + ( a as meas, b as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu + b.vlu\n ret.unc = sqr( a.unc*a.unc + b.unc*b.unc )\n return ret\nend operator\n\noperator + ( c as double, a as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu + c\n ret.unc = a.unc\n return ret\nend operator\n\noperator + ( a as meas, c as double ) as meas\n return c+a\nend operator\n\noperator - ( a as meas, b as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu - b.vlu\n ret.unc = sqr( a.unc*a.unc + b.unc*b.unc )\n return ret\nend operator\n\noperator - ( c as double, a as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu - c\n ret.unc = a.unc\n return ret\nend operator\n\noperator - ( a as meas, c as double ) as meas\n dim ret as meas\n ret.vlu = c - a.vlu\n ret.unc = a.unc\n return ret\nend operator\n\noperator * ( a as meas, b as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu*b.vlu\n ret.unc = sqr(p2(ret.vlu) * (p2(a.unc/a.vlu)+p2(b.unc/b.vlu)))\n return ret\nend operator\n\noperator * ( c as double, a as meas ) as meas\n dim ret as meas\n ret.vlu = a.vlu*c\n ret.unc = abs(c*a.unc)\n return ret\nend operator\n\noperator * ( a as meas, c as double ) as meas\n return c*a\nend operator\n\noperator ^ ( a as meas, c as double ) as meas\n dim ret as meas\n ret.vlu = a.vlu ^ c\n ret.unc = abs(ret.vlu*c*a.unc/a.vlu)\n return ret\nend operator\n\noperator / ( c as double, a as meas ) as meas\n return c*a^(-1)\nend operator\n\noperator / ( a as meas, c as double ) as meas\n return a*(1.0/c)\nend operator\n\noperator / ( a as meas, b as meas ) as meas\n return b*a^(-1)\nend operator\n\nsub printm( a as meas )\n print using \"####.##### +- ####.####\"; a.vlu; a.unc\nend sub\n\n'--------------------------------\n' now the results\n'--------------------------------\n\ndim as meas x1, y1, x2, y2\nx1.vlu = 100.\nx1.unc = 1.1\ny1.vlu = 50.\ny1.unc = 1.2\nx2.vlu = 200.\nx2.unc = 2.2\ny2.vlu = 100.\ny2.unc = 2.3\n\nprintm( ((x1-x2)^2 + (y1-y2)^2)^0.5 )\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\n// \"uncertain number type\"\n// a little optimization is to represent the error term with its square.\n// this saves some taking of square roots in various places.\ntype unc struct {\n n float64 // the number\n s float64 // *square* of one sigma error term\n}\n\n// constructor, nice to have so it can handle squaring of error term\nfunc newUnc(n, s float64) *unc {\n return &unc{n, s * s}\n}\n\n// error term accessor method, nice to have so it can handle recovering\n// (non-squared) error term from internal (squared) representation\nfunc (z *unc) errorTerm() float64 {\n return math.Sqrt(z.s)\n}\n\n// Arithmetic methods are modeled on the Go big number package.\n// The basic scheme is to pass all operands as method arguments, compute\n// the result into the method receiver, and then return the receiver as\n// the result of the method. This has an advantage of letting the programer\n// determine allocation and use of temporary objects, reducing garbage;\n// and has the convenience and efficiency of allowing operations to be chained.\n\n// addition/subtraction\nfunc (z *unc) addC(a *unc, c float64) *unc {\n *z = *a\n z.n += c\n return z\n}\n\nfunc (z *unc) subC(a *unc, c float64) *unc {\n *z = *a\n z.n -= c\n return z\n}\n\nfunc (z *unc) addU(a, b *unc) *unc {\n z.n = a.n + b.n\n z.s = a.s + b.s\n return z\n}\nfunc (z *unc) subU(a, b *unc) *unc {\n z.n = a.n - b.n\n z.s = a.s + b.s\n return z\n}\n\n// multiplication/division\nfunc (z *unc) mulC(a *unc, c float64) *unc {\n z.n = a.n * c\n z.s = a.s * c * c\n return z\n}\n\nfunc (z *unc) divC(a *unc, c float64) *unc {\n z.n = a.n / c\n z.s = a.s / (c * c)\n return z\n}\n\nfunc (z *unc) mulU(a, b *unc) *unc {\n prod := a.n * b.n\n z.n, z.s = prod, prod*prod*(a.s/(a.n*a.n)+b.s/(b.n*b.n))\n return z\n}\n\nfunc (z *unc) divU(a, b *unc) *unc {\n quot := a.n / b.n\n z.n, z.s = quot, quot*quot*(a.s/(a.n*a.n)+b.s/(b.n*b.n))\n return z\n}\n\n// exponentiation\nfunc (z *unc) expC(a *unc, c float64) *unc {\n f := math.Pow(a.n, c)\n g := f * c / a.n\n z.n = f\n z.s = a.s * g * g\n return z\n}\n\nfunc main() {\n x1 := newUnc(100, 1.1)\n x2 := newUnc(200, 2.2)\n y1 := newUnc(50, 1.2)\n y2 := newUnc(100, 2.3)\n var d, d2 unc\n d.expC(d.addU(d.expC(d.subU(x1, x2), 2), d2.expC(d2.subU(y1, y2), 2)), .5)\n fmt.Println(\"d: \", d.n)\n fmt.Println(\"error:\", d.errorTerm())\n}\n","language":"Go"},{"code":"data Error a = Error {value :: a, uncertainty :: a} deriving (Eq, Show)\n\ninstance (Floating a) => Num (Error a) where\n\tError a ua + Error b ub = Error (a + b) (sqrt (ua ^ 2 + ub ^ 2))\n\tnegate (Error a ua) = Error (negate a) ua\n\tError a ua * Error b ub = Error (a * b) (abs (a * b * sqrt ((ua / a) ^ 2 + (ub / b) ^ 2))) -- I've factored out the f^2 from the square root\n\tfromInteger a = Error (fromInteger a) 0\n\ninstance (Floating a) => Fractional (Error a) where\n\tfromRational a = Error (fromRational a) 0\n\tError a ua / Error b ub = Error (a / b) (abs (a / b * sqrt ((ua / a) ^ 2 + (ub / b) ^ 2))) -- I've factored out the f^2 from the square root\n\ninstance (Floating a) => Floating (Error a) where\n\tError a ua ** Error c 0 = Error (a ** c) (abs (ua * c * a**c / a))\n\nmain = print (sqrt ((x1 - x2) ** 2 + (y1 - y2) ** 2)) where -- using (^) for exponentiation would calculate a*a, which the problem specifically said was calculated wrong\n\tx1 = Error 100 1.1\n\ty1 = Error 50 1.2\n\tx2 = Error 200 2.2\n\ty2 = Error 100 2.3\n","language":"Haskell"},{"code":"record num(val,err)\n\nprocedure main(a)\n x1 := num(100.0, 1.1)\n y1 := num(50.0, 1.2)\n x2 := num(200.0, 2.2)\n y2 := num(100.0, 2.3)\n d := pow(add(pow(sub(x1,x2),2),pow(sub(y1,y2),2)),0.5)\n write(\"d = [\",d.val,\", \",d.err,\"]\")\nend\n\nprocedure add(a,b)\n return (numeric(a)+numeric(b)) |\n num(numeric(a)+b.val, b.err) |\n num(a.val+numeric(b), a.err) |\n num(a.val+b.val, (a.err^2 + b.err^2) ^ 0.5)\nend\n\nprocedure sub(a,b)\n return (numeric(a)-numeric(b)) |\n num(numeric(a)-b.val, b.err) |\n num(a.val-numeric(b), a.err) |\n num(a.val-b.val, (a.err^2 + b.err^2) ^ 0.5)\nend\n\nprocedure mul(a,b)\n return (numeric(a)*numeric(b)) |\n num(numeric(a)*b.val, abs(a*b.err)) |\n num(a.val*numeric(b), abs(b*a.err)) |\n num(f := a.val*b.val, ((f^2*((a.err/a.val)^2+(b.err/b.val)^2))^0.5))\nend\n\nprocedure div(a,b)\n return (numeric(a)/numeric(b)) |\n num(numeric(a)/b.val, abs(a*b.err)) |\n num(a.val/numeric(b), abs(b*a.err)) |\n num(f := a.val/b.val, ((f^2*((a.err/a.val)^2+(b.err/b.val)^2))^0.5))\nend\n\nprocedure pow(a,b)\n return (numeric(a)^numeric(b)) |\n num(f := a.val^numeric(b), abs(f*b*(a.err/a.val)))\nend\n","language":"Icon"},{"code":"num=: {.\"1\nunc=: {:@}.\"1 : ,.\ndist=: +/&.:*:\n","language":"J"},{"code":"x1=: 100 unc 1.1\ny1=: 50 unc 1.2\n\nx2=: 200 unc 2.2\ny2=: 100 unc 2.3\n","language":"J"},{"code":" num x1\n100\n unc x1\n1.1\n","language":"J"},{"code":" num 100\n100\n unc 100\n0\n","language":"J"},{"code":" 3 dist 4\n5\n","language":"J"},{"code":"add=: +&num unc dist&unc\nsub=: -&num unc dist&unc\nmul=: *&num unc |@(*&num * dist&(unc%num))\ndiv=: %&num unc |@(%&num * dist&(unc%num))\nexp=: ^&num unc |@(^&num * dist&(unc%num))\n","language":"J"},{"code":" exp&0.5 (x1 sub x2) add&(exp&2) y1 sub y2\n111.803 2.48717\n","language":"J"},{"code":"public class Approx {\n private double value;\n private double error;\n\n public Approx(){this.value = this.error = 0;}\n\n public Approx(Approx b){\n this.value = b.value;\n this.error = b.error;\n }\n\n public Approx(double value, double error){\n this.value = value;\n this.error = error;\n }\n\n public Approx add(Approx b){\n value+= b.value;\n error = Math.sqrt(error * error + b.error * b.error);\n return this;\n }\n\n public Approx add(double b){\n value+= b;\n return this;\n }\n\n public Approx sub(Approx b){\n value-= b.value;\n error = Math.sqrt(error * error + b.error * b.error);\n return this;\n }\n\n public Approx sub(double b){\n value-= b;\n return this;\n }\n\n public Approx mult(Approx b){\n double oldVal = value;\n value*= b.value;\n error = Math.sqrt(value * value * (error*error) / (oldVal*oldVal) +\n (b.error*b.error) / (b.value*b.value));\n return this;\n }\n\n public Approx mult(double b){\n value*= b;\n error = Math.abs(b * error);\n return this;\n }\n\n public Approx div(Approx b){\n double oldVal = value;\n value/= b.value;\n error = Math.sqrt(value * value * (error*error) / (oldVal*oldVal) +\n (b.error*b.error) / (b.value*b.value));\n return this;\n }\n\n public Approx div(double b){\n value/= b;\n error = Math.abs(b * error);\n return this;\n }\n\n public Approx pow(double b){\n double oldVal = value;\n value = Math.pow(value, b);\n error = Math.abs(value * b * (error / oldVal));\n return this;\n }\n\n @Override\n public String toString(){return value+\"±\"+error;}\n\n public static void main(String[] args){\n Approx x1 = new Approx(100, 1.1);\n Approx y1 = new Approx(50, 1.2);\n Approx x2 = new Approx(200, 2.2);\n Approx y2 = new Approx(100, 2.3);\n\n x1.sub(x2).pow(2).add(y1.sub(y2).pow(2)).pow(0.5);\n\n System.out.println(x1);\n }\n}\n","language":"Java"},{"code":"using Measurements\n\nx1 = measurement(100, 1.1)\nx2 = measurement(200, 2.2)\ny1 = measurement(50, 1.2)\ny2 = measurement(100, 2.3)\n\nd = sqrt((x1 - x2)^2 + (y1 - y2)^2)\n\n@show d\n@show d.val, d.err\n","language":"Julia"},{"code":"module NumericError\n\nimport Base: convert, promote_rule, +, -, *, /, ^\n\nexport Measure\n\ntype Measure <: Number\n x::Float64\n σ::Float64\n Measure(x::Real) = new(Float64(x), 0)\n Measure(x::Real, σ::Real) = new(Float64(x), σ)\nend\n\nBase.show(io::IO, x::Measure) = print(io, string(x.x, \" ± \", x.σ))\n\nBase.convert(::Type{Measure}, x::Real) = Measure(Float64(x), 0.0)\nBase.promote_rule(::Type{Float64}, ::Type{Measure}) = Measure\nBase.promote_rule(::Type{Int64}, ::Type{Measure}) = Measure\n\n+(a::Measure, b::Measure) = Measure(a.x + b.x, sqrt(a.σ ^ 2 + b.σ ^ 2))\n-(a::Measure, b::Measure) = Measure(a.x - b.x, sqrt(a.σ ^ 2 + b.σ ^ 2))\n-(a::Measure) = Measure(-a.x, a.σ)\n\n*(a::Measure, b::Measure) = begin\n x = a.x * b.x\n σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\n Measure(x, σ)\nend\n/(a::Measure, b::Measure) = begin\n x = a.x / b.x\n σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\n Measure(x, σ)\nend\n\n^(a::Measure, b::Float64) = begin\n x = a.x ^ b\n σ = abs(x * b * a.σ / a.x)\n Measure(x, σ)\nend\n\nBase.sqrt(a::Measure) = a ^ .5\n\nend # module NumericError\n\nusing NumericError\n\n# x1 = 100 ± 1.1\n# y1 = 50 ± 1.2\n# x2 = 200 ± 2.2\n# y2 = 100 ± 2.3\n\nx1 = Measure(100, 1.1)\ny1 = Measure(50, 1.2)\nx2 = Measure(200, 2.2)\ny2 = Measure(100, 2.3)\n\nd = sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\n\n@show x1 y1 x2 y2 sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\n","language":"Julia"},{"code":"import java.lang.Math.*\n\ndata class Approx(val ν: Double, val σ: Double = 0.0) {\n constructor(a: Approx) : this(a.ν, a.σ)\n constructor(n: Number) : this(n.toDouble(), 0.0)\n\n override fun toString() = \"$ν ±$σ\"\n\n operator infix fun plus(a: Approx) = Approx(ν + a.ν, sqrt(σ * σ + a.σ * a.σ))\n operator infix fun plus(d: Double) = Approx(ν + d, σ)\n operator infix fun minus(a: Approx) = Approx(ν - a.ν, sqrt(σ * σ + a.σ * a.σ))\n operator infix fun minus(d: Double) = Approx(ν - d, σ)\n\n operator infix fun times(a: Approx): Approx {\n val v = ν * a.ν\n return Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\n }\n\n operator infix fun times(d: Double) = Approx(ν * d, abs(d * σ))\n\n operator infix fun div(a: Approx): Approx {\n val v = ν / a.ν\n return Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\n }\n\n operator infix fun div(d: Double) = Approx(ν / d, abs(d * σ))\n\n fun pow(d: Double): Approx {\n val v = pow(ν, d)\n return Approx(v, abs(v * d * σ / ν))\n }\n}\n\nfun main(args: Array<String>) {\n val x1 = Approx(100.0, 1.1)\n val y1 = Approx(50.0, 1.2)\n val x2 = Approx(200.0, 2.2)\n val y2 = Approx(100.0, 2.3)\n println(((x1 - x2).pow(2.0) + (y1 - y2).pow(2.0)).pow(0.5))\n}\n","language":"Kotlin"},{"code":"PlusMinus /: a_ ± σa_ + c_?NumericQ := N[(a + c) ± σa];\nPlusMinus /: a_ ± σa_ + b_ ± σb_ := N[(a + b) ± Norm@{σa, σb}];\nPlusMinus /: c_?NumericQ (a_ ± σa_) := N[c a ± Abs[c σa]];\nPlusMinus /: (a_ ± σa_) (b_ ± σb_) := N[a b ± (a b Norm@{σa/a, σb/b})^2];\nPlusMinus /: (a_ ± σa_)^c_?NumericQ := N[a^c ± Abs[a^c σa/a]];\n","language":"Mathematica"},{"code":"x1 = 100 ± 1.1;\ny1 = 50 ± 1.2;\nx2 = 200 ± 2.2;\ny2 = 100 ± 2.3;\nd = Sqrt[(x1 - x2)^2 + (y1 - y2)^2]\n","language":"Mathematica"},{"code":"x1 = Around[100, 1.1];\ny1 = Around[50, 1.2];\nx2 = Around[200, 2.2];\ny2 = Around[100, 2.3];\nd = Sqrt[(x1 - x2)^2 + (y1 - y2)^2]\n","language":"Mathematica"},{"code":"import strformat\nimport math\n\ntype\n Imprecise = object\n x: float\n σ: float\n\ntemplate `^`(a, b: float): float =\n pow(a, b)\ntemplate `-`(a: Imprecise): Imprecise =\n Imprecise(x: -a.x, σ: a.σ)\ntemplate `+`(a, b: Imprecise): Imprecise =\n Imprecise(x: a.x + b.x, σ: sqrt(a.σ ^ 2 + b.σ ^ 2))\ntemplate `-`(a, b: Imprecise): Imprecise =\n Imprecise(x: a.x - b.x, σ: sqrt(a.σ ^ 2 + b.σ ^ 2))\ntemplate `*`(a, b: Imprecise): Imprecise =\n let x = a.x * b.x\n let σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\n Imprecise(x: x, σ: σ)\ntemplate `/`(a, b: Imprecise): Imprecise =\n let x = a.x / b.x\n let σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\n Imprecise(x: x, σ: σ)\ntemplate `^`(a: Imprecise, b: float): Imprecise =\n if b < 0:\n raise newException(IOError, \"Cannot raise to negative power.\")\n let x = a.x ^ b\n let σ = abs(x * b * a.σ / a.x)\n Imprecise(x: x, σ: σ)\ntemplate sqrt(a: Imprecise): Imprecise =\n a ^ 0.5\n\nproc `$`(a: Imprecise): string =\n fmt\"{a.x:.2f} ± {a.σ:.2f}\"\n\nvar x1 = Imprecise(x: 100, σ: 1.1)\nvar y1 = Imprecise(x: 50, σ: 1.2)\nvar x2 = Imprecise(x: 200, σ: 2.2)\nvar y2 = Imprecise(x: 100, σ: 2.3)\n\necho sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\n","language":"Nim"},{"code":"add(a,b)=if(type(a)==type(b), a+b, if(type(a)==\"t_VEC\",a+[b,0],b+[a,0]));\nsub(a,b)=if(type(a)==type(b), [a[1]-b[1],a[2]+b[2]], if(type(a)==\"t_VEC\",a-[b,0],[a,0]-b));\nmult(a,b)=if(type(a)==\"t_VEC\", if(type(b)==\"t_VEC\", [a[1]*b[1], abs(a[1]*b[1])*sqrt(norml2([a[2]/a[1],b[2]/b[1]]))], [b*a[1], abs(b)*a[2]]), [a*b[1], abs(a)*b[2]]);\ndiv(a,b)=if(type(b)!=\"t_VEC\", mult(a,1/b), mult(a,[1/b[1],b[2]/b[1]^2]));\npow(a,b)=[a[1]^b, abs(a[1]^b*b*a[2]/a[1])];\nx1=[100,1.1];y1=[50,1.2];x2=[200,2.2];y2=[100,2.3];\npow(add(pow(sub(x1,x2),2),pow(sub(y1,y2),2)),.5)\n","language":"PARI-GP"},{"code":"use v5.36;\n\npackage ErrVar;\n\n# helper function, apply function 'f' to pairs (a, b) from listX and listY\nsub zip ($f, $x, $y) {\n my @out;\n $y = [(0) x @$x] unless @$y; # if not defined\n push @out, $f->($x->[$_], $y->[$_]) for 0 .. $#$x;\n \\@out\n}\n\nuse overload\n '\"\"' => \\&_str,\n '+' => \\&_add,\n '-' => \\&_sub,\n '*' => \\&_mul,\n '/' => \\&_div,\n 'bool' => \\&_bool,\n '<=>' => \\&_ncmp,\n 'neg' => \\&_neg,\n 'sqrt' => \\&_sqrt,\n 'log' => \\&_log,\n 'exp' => \\&_exp,\n '**' => \\&_pow,\n;\n\n# make a variable with mean value and a list of coefficient to\n# variables providing independent errors\nsub make ($x, @v) { bless [$x, @v] }\n\n# mean value of the var, or just the input if it's not of this class\nsub mean ($x) { ref $x && $x->isa(__PACKAGE__) ? $x->[0] : $x }\n\n# return variance index array\nsub vlist ($x) { ref $x && $x->isa(__PACKAGE__) ? $x->[1] : [] }\n\nsub variance ($x) {\n return 0 unless ref($x) and $x->isa(__PACKAGE__);\n my $s;\n $s += $_ * $_ for @{$x->[1]};\n $s\n}\n\nsub covariance ($x, $y) {\n return 0 unless ref($x) && $x->isa(__PACKAGE__);\n return 0 unless ref($y) && $y->isa(__PACKAGE__);\n my $s;\n zip sub ($a,$b) { $s += $a * $b }, vlist($x), vlist($y);\n $s\n}\n\nsub sigma ($v) { sqrt variance $v }\n\n# to determine if a var is probably zero. we use 1σ here\nsub _bool ($x, $, $) {\n abs(mean $x) > sigma $x\n}\n\nsub _ncmp ($a, $b, $) {\n return 0 unless my $x = $a - $b;\n mean($x) > 0 ? 1 : -1\n}\n\nsub _neg ($x, $, $) {\n bless [ -mean($x), [map(-$_, @{vlist $x}) ] ];\n}\n\nsub _add ($x, $y, $) {\n my ($x0, $y0) = ( mean($x), mean($y));\n my ($xv, $yv) = (vlist($x), vlist($y));\n bless [$x0 + $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\n}\n\nsub _sub ($x, $y, $) {\n my ($x0, $y0) = ( mean($x), mean($y));\n my ($xv, $yv) = (vlist($x), vlist($y));\n bless [$x0 - $y0, zip sub ($a,$b) {$a - $b}, $xv, $yv]\n}\n\nsub _mul ($x, $y, $) {\n my ($x0, $y0) = ( mean($x), mean($y));\n my ($xv, $yv) = (vlist($x), vlist($y));\n $xv = [ map($y0 * $_, @$xv) ];\n $yv = [ map($x0 * $_, @$yv) ];\n bless [$x0 * $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\n}\n\nsub _div ($x, $y, $) {\n my ($x0, $y0) = ( mean($x), mean($y));\n my ($xv, $yv) = (vlist($x), vlist($y));\n $xv = [ map($_/$y0, @$xv) ];\n $yv = [ map($x0 * $_/$y0/$y0, @$yv) ];\n bless [$x0 / $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\n}\n\nsub _sqrt ($x, $, $) {\n my ($x0, $xv) = ( mean($x), vlist($x) );\n $x0 = sqrt($x0);\n $xv = [ map($_ / 2 / $x0, @$xv) ];\n bless [$x0, $xv]\n}\n\nsub _pow ($x, $y, $) {\n if ($x < 0) {\n die \"Can't take pow of negative number $x\" if int($y) != $y or $y & 1;\n $x = -$x;\n }\n exp($y * log $x)\n}\n\nsub _exp ($x, $, $) {\n my ($x0, $xv) = ( exp(mean($x)), vlist($x) );\n bless [ $x0, [map($x0 * $_, @$xv) ] ]\n}\n\nsub _log ($x, $, $) {\n my ($x0, $xv) = ( mean($x), vlist($x) );\n bless [ log($x0), [ map($_ / $x0, @$xv) ] ]\n}\n\nsub _str { sprintf '%g±%.3g', $_[0][0], sigma($_[0]) }\n\npackage main;\n\nsub e { ErrVar::make @_ };\n\n# x1 is of mean value 100, containing error 1.1 from source 1, etc.\n# all error sources are independent.\nmy $x1 = e 100, [1.1, 0, 0, 0 ];\nmy $x2 = e 200, [0, 2.2, 0, 0 ];\nmy $y1 = e 50, [0, 0, 1.2, 0 ];\nmy $y2 = e 100, [0, 0, 0, 2.3];\n\nmy $z1 = sqrt(($x1 - $x2) ** 2 + ($y1 - $y2) ** 2);\nsay \"distance: $z1\";\n\n# this is not for task requirement\nmy $a = $x1 + $x2;\nmy $b = $y1 - 2 * $x2;\nsay \"covariance between $a and $b: \", $a->covariance($b);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DELTA</span>\n\n <span style=\"color: #008080;\">type</span> <span style=\"color: #000000;\">imprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #004080;\">atom</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #004080;\">atom</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">type</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">a</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">imprecise_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">]))</span>\n <span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ret</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">imprecise_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">]))</span>\n <span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ret</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">imprecise_div</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">delta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">]))/</span><span style=\"color: #000000;\">sqr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ret</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">imprecise_pow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">delta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">DELTA</span><span style=\"color: #0000FF;\">]/</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">VALUE</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">ret</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">delta</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ret</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%g+/-%g\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">imp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000000;\">imprecise</span> <span style=\"color: #000000;\">x1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">50</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">x2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{-</span><span style=\"color: #000000;\">200</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">y2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{-</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.3</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">tmp1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tmp2</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">d</span>\n\n <span style=\"color: #000000;\">tmp1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">tmp1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_pow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">tmp2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">tmp2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_pow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tmp2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">imprecise_pow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Distance, d, between the following points :\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n( x1, y1) = ( %s, %s)\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n( x2, y2) = ( %s, %s)\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x2</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y2</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nis d = %s\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">printImprecise</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"(scl 12)\n(load \"@lib/math.l\")\n\n# Overload arithmetic operators +, -, *, / and **\n(redef + @\n (let R (next)\n (while (args)\n (let N (next)\n (setq R\n (if2 (atom R) (atom N)\n (+ R N) # c + c\n (cons (+ R (car N)) (cdr N)) # c + a\n (cons (+ (car R) N) (cdr R)) # a + c\n (cons # a + b\n (+ (car R) (car N))\n (+ (cdr R) (cdr N)) ) ) ) ) )\n R ) )\n\n(redef - @\n (let R (next)\n (ifn (args)\n (- R)\n (while (args)\n (let N (next)\n (setq R\n (if2 (atom R) (atom N)\n (- R N) # c - c\n (cons (- R (car N)) (cdr N)) # c - a\n (cons (- (car R) N) (cdr R)) # a - c\n (cons # a - b\n (- (car R) (car N))\n (+ (cdr R) (cdr N)) ) ) ) ) )\n R ) ) )\n\n(redef * @\n (let R (next)\n (while (args)\n (let N (next)\n (setq R\n (if2 (atom R) (atom N)\n (* R N) # c * c\n (cons # c * a\n (*/ R (car N) 1.0)\n (mul2div2 (cdr N) R 1.0) )\n (cons # a * c\n (*/ (car R) N 1.0)\n (mul2div2 (cdr R) N 1.0) )\n (uncMul (*/ (car R) (car N) 1.0) R N) ) ) ) ) # a * b\n R ) )\n\n(redef / @\n (let R (next)\n (while (args)\n (let N (next)\n (setq R\n (if2 (atom R) (atom N)\n (/ R N) # c / c\n (cons # c / a\n (*/ R 1.0 (car N))\n (mul2div2 (cdr N) R 1.0) )\n (cons # a / c\n (*/ (car R) 1.0 N)\n (mul2div2 (cdr R) N 1.0) )\n (uncMul (*/ (car R) 1.0 (car N)) R N) ) ) ) ) # a / b\n R ) )\n\n(redef ** (A C)\n (if (atom A)\n (** A C)\n (let F (pow (car A) C)\n (cons F\n (mul2div2 (cdr A) (*/ F C (car A)) 1.0) ) ) ) )\n\n# Utilities\n(de mul2div2 (A B C)\n (*/ A B B (* C C)) )\n\n(de uncMul (F R N)\n (cons F\n (mul2div2\n (+\n (mul2div2 (cdr R) 1.0 (car R))\n (mul2div2 (cdr N) 1.0 (car N)) )\n F\n 1.0 ) ) )\n\n# I/O conversion\n(de unc (N U)\n (if U\n (cons N (*/ U U 1.0))\n (pack\n (round (car N) 10)\n \" ± \"\n (round (sqrt (cdr N) 1.0) 8) ) ) )\n","language":"PicoLisp"},{"code":"(de distance (X1 Y1 X2 Y2)\n (**\n (+ (** (- X1 X2) 2.0) (** (- Y1 Y2) 2.0))\n 0.5 ) )\n\n(prinl \"Distance: \"\n (unc\n (distance\n (unc 100. 1.1)\n (unc 50. 1.2)\n (unc 200. 2.2)\n (unc 100. 2.3) ) ) )\n","language":"PicoLisp"},{"code":"from collections import namedtuple\nimport math\n\nclass I(namedtuple('Imprecise', 'value, delta')):\n 'Imprecise type: I(value=0.0, delta=0.0)'\n\n __slots__ = ()\n\n def __new__(_cls, value=0.0, delta=0.0):\n 'Defaults to 0.0 ± delta'\n return super().__new__(_cls, float(value), abs(float(delta)))\n\n def reciprocal(self):\n return I(1. / self.value, self.delta / (self.value**2))\n\n def __str__(self):\n 'Shorter form of Imprecise as string'\n return 'I(%g, %g)' % self\n\n def __neg__(self):\n return I(-self.value, self.delta)\n\n def __add__(self, other):\n if type(other) == I:\n return I( self.value + other.value, (self.delta**2 + other.delta**2)**0.5 )\n try:\n c = float(other)\n except:\n return NotImplemented\n return I(self.value + c, self.delta)\n\n def __sub__(self, other):\n return self + (-other)\n\n def __radd__(self, other):\n return I.__add__(self, other)\n\n def __mul__(self, other):\n if type(other) == I:\n #if id(self) == id(other):\n # return self ** 2\n a1,b1 = self\n a2,b2 = other\n f = a1 * a2\n return I( f, f * ( (b1 / a1)**2 + (b2 / a2)**2 )**0.5 )\n try:\n c = float(other)\n except:\n return NotImplemented\n return I(self.value * c, self.delta * c)\n\n def __pow__(self, other):\n if type(other) == I:\n return NotImplemented\n try:\n c = float(other)\n except:\n return NotImplemented\n f = self.value ** c\n return I(f, f * c * (self.delta / self.value))\n\n def __rmul__(self, other):\n return I.__mul__(self, other)\n\n def __truediv__(self, other):\n if type(other) == I:\n return self.__mul__(other.reciprocal())\n try:\n c = float(other)\n except:\n return NotImplemented\n return I(self.value / c, self.delta / c)\n\n def __rtruediv__(self, other):\n return other * self.reciprocal()\n\n __div__, __rdiv__ = __truediv__, __rtruediv__\n\nImprecise = I\n\ndef distance(p1, p2):\n x1, y1 = p1\n x2, y2 = p2\n return ((x1 - x2)**2 + (y1 - y2)**2)**0.5\n\nx1 = I(100, 1.1)\nx2 = I(200, 2.2)\ny1 = I( 50, 1.2)\ny2 = I(100, 2.3)\n\np1, p2 = (x1, y1), (x2, y2)\nprint(\"Distance between points\\n p1: %s\\n and p2: %s\\n = %r\" % (\n p1, p2, distance(p1, p2)))\n","language":"Python"},{"code":"#lang racket\n\n(struct ± (x dx) #:transparent\n #:methods gen:custom-write\n [(define (write-proc a port mode) (display (±->string a) port))])\n\n(define/match (±+ a [b 0])\n [((± x dx) (± y dy)) (± (+ x y) (norm dx dy))]\n [((± x dx) c) (± (+ x c) dx)]\n [(_ (± y dy)) (±+ b a)])\n\n(define/match (±* a b)\n [((± x dx) (± y dy)) (± (* x y) (* x y (norm (/ dx x) (/ dy y))))]\n [((± x dx) c) (± (* x c) (abs (* c dx)))]\n [(_ (± y dy)) (±* b a)])\n\n(define/match (±- a [b #f])\n [(a #f) (±* -1 a)]\n [(a b) (±+ a (±* -1 b))])\n\n(define/match (±/ a b)\n [((± x dx) (± y dy)) (± (/ x y) (/ x y (norm (/ dx x) (/ dy y))))]\n [((± _ _) c) (±* a (/ 1 c))])\n\n(define/match (±expt a c)\n [((± x dx) c) (± (expt x c) (abs (* (expt x c) (/ dx x))))])\n\n(define/match (norm a b)\n [((± x dx) (± y dy)) (±expt (±+ (±expt a 2) (±expt b 2)) 0.5)]\n [(x y) (sqrt (+ (sqr x) (sqr y)))])\n\n(define/match (±->string x [places 3])\n [((± x dx) p) (string-join (map (λ (s) (real->decimal-string s p))\n (list x dx))\" ± \")])\n\n;; Test\n;;\n(define x1 (± 100 1.1))\n(define y1 (± 50 1.2))\n(define x2 (± 200 2.2))\n(define y2 (± 100 2.3))\n(norm (±- x1 x2) (±- y1 y2))\n","language":"Racket"},{"code":"# cache of independent sources so we can make them all the same length.\n# (Because Raku does not yet have a longest-zip metaoperator.)\nmy @INDEP;\n\nclass Approx does Numeric {\n has Real $.x;\t# The mean.\n has $.c;\t\t# The components of error.\n\n multi method Str { sprintf \"%g±%.3g\", $!x, $.σ }\n multi method Bool { abs($!x) > $.σ }\n\n method variance { [+] @.c X** 2 }\n method σ { sqrt self.variance }\n}\n\nmulti approx($x,$c) { Approx.new: :$x, :$c }\nmulti approx($x) { Approx.new: :$x, :c[0 xx +@INDEP] }\n\n# Each ± gets its own source slot.\nmulti infix:<±>($a, $b) {\n .push: 0 for @INDEP; # lengthen older component lists\n my $c = [ flat 0 xx @INDEP, $b ];\n @INDEP.push: $c;\t # add new component list\n\n approx $a, $c;\n}\n\nmulti prefix:<->(Approx $a) { approx -$a.x, [$a.c.map: -*] }\n\nmulti infix:<+>($a, Approx $b) { approx($a) + $b }\nmulti infix:<+>(Approx $a, $b) { $a + approx($b) }\nmulti infix:<+>(Approx $a, Approx $b) { approx $a.x + $b.x, [$a.c Z+ $b.c] }\n\nmulti infix:<->($a, Approx $b) { approx($a) - $b }\nmulti infix:<->(Approx $a, $b) { $a - approx($b) }\nmulti infix:<->(Approx $a, Approx $b) { approx $a.x - $b.x, [$a.c Z- $b.c] }\n\nmulti covariance(Real $a, Real $b) { 0 }\nmulti covariance(Approx $a, Approx $b) { [+] $a.c Z* $b.c }\n\nmulti infix:«<=>»(Approx $a, Approx $b) { $a.x <=> $b.x }\nmulti infix:<cmp>(Approx $a, Approx $b) { $a.x <=> $b.x }\n\nmulti infix:<*>($a, Approx $b) { approx($a) * $b }\nmulti infix:<*>(Approx $a, $b) { $a * approx($b) }\nmulti infix:<*>(Approx $a, Approx $b) {\n approx $a.x * $b.x,\n [$a.c.map({$b.x * $_}) Z+ $b.c.map({$a.x * $_})];\n}\n\nmulti infix:</>($a, Approx $b) { approx($a) / $b }\nmulti infix:</>(Approx $a, $b) { $a / approx($b) }\nmulti infix:</>(Approx $a, Approx $b) {\n approx $a.x / $b.x,\n [ $a.c.map({ $_ / $b.x }) Z+ $b.c.map({ $a.x * $_ / $b.x / $b.x }) ];\n}\n\nmulti sqrt(Approx $a) {\n my $x = sqrt($a.x);\n approx $x, [ $a.c.map: { $_ / 2 / $x } ];\n}\n\nmulti infix:<**>(Approx $a, Real $b) { $a ** approx($b) }\nmulti infix:<**>(Approx $a is copy, Approx $b) {\n\tmy $ax = $a.x;\n\tmy $bx = $b.x;\n\tmy $fbx = floor $b.x;\n\tif $ax < 0 {\n\t if $fbx != $bx or $fbx +& 1 {\n\t\tdie \"Can't take power of negative number $ax\";\n\t }\n\t $a = -$a;\n\t}\n\texp($b * log $a);\n}\n\nmulti exp(Approx $a) {\n\tmy $x = exp($a.x);\n\tapprox $x, [ $a.c.map: { $x * $_ } ];\n}\n\nmulti log(Approx $a) {\n\tmy $x0 = $a.x;\n\tapprox log($x0), [ $a.c.map: { $_ / $x0 }];\n}\n\n# Each ± sets up an independent source component.\nmy $x1 = 100 ± 1.1;\nmy $x2 = 200 ± 2.2;\nmy $y1 = 50 ± 1.2;\nmy $y2 = 100 ± 2.3;\n\n# The standard task.\nmy $z1 = sqrt(($x1 - $x2) ** 2 + ($y1 - $y2) ** 2);\nsay \"distance: $z1\\n\";\n\n# Just showing off.\nmy $a = $x1 + $x2;\nmy $b = $y1 - 2 * $x2;\nsay \"covariance between $a and $b: \", covariance($a,$b);\n","language":"Raku"},{"code":"/*REXX program calculates the distance between two points (2D) with error propagation. */\nparse arg a b . /*obtain arguments from the CL*/\nif a=='' | a==\",\" then a= '100±1.1, 50±1.2' /*Not given? Then use default.*/\nif b=='' | b==\",\" then b= '200±2.2, 100±2.3' /* \" \" \" \" \" */\nparse var a ax ',' ay; parse var b bx ',' by /*obtain X,Y from A & B point.*/\nparse var ax ax '±' axe; parse var bx bx '±' bxE /* \" err \" Ax and Bx.*/\nparse var ay ay '±' aye; parse var by by '±' byE /* \" \" \" Ay \" By.*/\nif axE=='' then axE= 0; if bxE==\"\" then bxE= 0 /*No error? Then use default.*/\nif ayE=='' then ayE= 0; if byE==\"\" then byE= 0 /* \" \" \" \" \" */\n say ' A point (x,y)= ' ax \"±\" axE', ' ay \"±\" ayE /*display A point (with err)*/\n say ' B point (x.y)= ' bx \"±\" bxE', ' by \"±\" byE /* \" B \" \" \" */\n say /*blank line for the eyeballs.*/\ndx= ax-bx; dxE= sqrt(axE**2 + bxE**2); xe= #(dx, 2, dxE) /*compute X distances (& err)*/\ndy= ay-by; dyE= sqrt(ayE**2 + byE**2); ye= #(dy, 2, dyE) /* \" Y \" \" \" */\nD= sqrt(dx**2 + dy**2) /*compute the 2D distance. */\n say 'distance=' D \"±\" #(D**2, .5, sqrt(xE**2 + yE**2)) /*display \" \" \" */\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n#: procedure; arg x,p,e; if p=.5 then z=1/sqrt(abs(x)); else z=abs(x)**(p-1); return p*e*z\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\n numeric form; parse value format(x,2,1,,0) 'E0' with g \"E\" _ .; g=g * .5'e'_ % 2\n m.=9; do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\n numeric digits d; return g/1\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\n numeric form; parse value format(x,2,1,,0) 'E0' with g \"E\" _ .; g= g * .5'e'_ % 2\n m.= 9; do j=0 while h>9; m.j= h; h= h%2+1; end /*j*/\n do k=j+5 to 0 by -1; numeric digits m.k; g= (g+x/g)*.5; end /*k*/\n numeric digits d; return g/1\n","language":"REXX"},{"code":"class NumberWithUncertainty\n def initialize(number, error)\n @num = number\n @err = error.abs\n end\n attr_reader :num, :err\n\n def +(other)\n if other.kind_of?(self.class)\n self.class.new(num + other.num, Math::hypot(err, other.err))\n else\n self.class.new(num + other, err)\n end\n end\n\n def -(other)\n if other.kind_of?(self.class)\n self.class.new(num - other.num, Math::hypot(err, other.err))\n else\n self.class.new(num - other, err)\n end\n end\n\n def *(other)\n if other.kind_of?(self.class)\n prod = num * other.num\n e = Math::hypot((prod * err / num), (prod * other.err / other.num))\n self.class.new(prod, e)\n else\n self.class.new(num * other, (err * other).abs)\n end\n end\n\n def /(other)\n if other.kind_of?(self.class)\n quo = num / other.num\n e = Math::hypot((quo * err / num), (quo * other.err / other.num))\n self.class.new(quo, e)\n else\n self.class.new(num / other, (err * other).abs)\n end\n end\n\n def **(exponent)\n Float(exponent) rescue raise ArgumentError, \"not an number: #{exponent}\"\n prod = num ** exponent\n self.class.new(prod, (prod * exponent * err / num).abs)\n end\n\n def sqrt\n self ** 0.5\n end\n\n def to_s\n \"#{num} \\u00b1 #{err}\"\n end\nend\n\nx1 = NumberWithUncertainty.new(100, 1.1)\ny1 = NumberWithUncertainty.new( 50, 1.2)\nx2 = NumberWithUncertainty.new(200, 2.2)\ny2 = NumberWithUncertainty.new(100, 2.3)\n\nputs ((x1 - x2) ** 2 + (y1 - y2) ** 2).sqrt\n","language":"Ruby"},{"code":"import java.lang.Math._\n\nclass Approx(val ν: Double, val σ: Double = 0.0) {\n def this(a: Approx) = this(a.ν, a.σ)\n def this(n: Number) = this(n.doubleValue(), 0.0)\n\n override def toString = s\"$ν ±$σ\"\n\n def +(a: Approx) = Approx(ν + a.ν, sqrt(σ * σ + a.σ * a.σ))\n def +(d: Double) = Approx(ν + d, σ)\n def -(a: Approx) = Approx(ν - a.ν, sqrt(σ * σ + a.σ * a.σ))\n def -(d: Double) = Approx(ν - d, σ)\n\n def *(a: Approx) = {\n val v = ν * a.ν\n Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\n }\n\n def *(d: Double) = Approx(ν * d, abs(d * σ))\n\n def /(a: Approx) = {\n val t = ν / a.ν\n Approx(t, sqrt(t * t * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\n }\n\n def /(d: Double) = Approx(ν / d, abs(d * σ))\n\n def ^(d: Double) = {\n val t = pow(ν, d)\n Approx(t, abs(t * d * σ / ν))\n }\n}\n\nobject Approx { def apply(ν: Double, σ: Double = 0.0) = new Approx(ν, σ) }\n\nobject NumericError extends App {\n def √(a: Approx) = a^0.5\n val x1 = Approx(100.0, 1.1)\n val x2 = Approx(50.0, 1.2)\n val y1 = Approx(200.0, 2.2)\n val y2 = Approx(100.0, 2.3)\n println(√(((x1 - x2)^2.0) + ((y1 - y2)^2.0))) // => 111.80339887498948 ±2.938366893361004\n}\n","language":"Scala"},{"code":"import Foundation\n\nprecedencegroup ExponentiationGroup {\n higherThan: MultiplicationPrecedence\n}\n\ninfix operator ** : ExponentiationGroup\ninfix operator ±\n\nfunc ±(_ lhs: Double, _ rhs: Double) -> UncertainDouble { UncertainDouble(value: lhs, error: rhs) }\n\nstruct UncertainDouble {\n var value: Double\n var error: Double\n\n static func +(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\n return UncertainDouble(value: lhs.value + rhs.value, error: pow(pow(lhs.error, 2) + pow(rhs.error, 2), 0.5))\n }\n\n static func +(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\n return UncertainDouble(value: lhs.value + rhs, error: lhs.error)\n }\n\n static func -(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\n return UncertainDouble(value: lhs.value - rhs.value, error: pow(pow(lhs.error, 2) + pow(rhs.error, 2), 0.5))\n }\n\n static func -(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\n return UncertainDouble(value: lhs.value - rhs, error: lhs.error)\n }\n\n static func *(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\n let val = lhs.value * rhs.value\n\n return UncertainDouble(\n value: val,\n error: pow(pow(val, 2) * (pow(lhs.error / lhs.value, 2) + pow(rhs.error / rhs.value, 2)), 0.5)\n )\n }\n\n static func *(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\n return UncertainDouble(value: lhs.value * rhs, error: abs(lhs.error * rhs))\n }\n\n static func /(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\n let val = lhs.value / rhs.value\n\n return UncertainDouble(\n value: val,\n error: pow(val, 2) * (pow(lhs.error / lhs.value, 2) + pow(rhs.error / rhs.value, 2))\n )\n }\n\n static func /(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\n return UncertainDouble(value: lhs.value / rhs, error: abs(lhs.error * rhs))\n }\n\n static func **(_ lhs: UncertainDouble, _ power: Double) -> UncertainDouble {\n let val = pow(lhs.value, power)\n\n return UncertainDouble(value: val, error: abs((val * power) * (lhs.error / lhs.value)))\n }\n}\n\nextension UncertainDouble: CustomStringConvertible {\n public var description: String { \"\\(value) ± \\(error)\" }\n}\n\nlet (x1, y1) = (100 ± 1.1, 50 ± 1.2)\nlet (x2, y2) = (200 ± 2.2, 100 ± 2.3)\n\nlet d = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\n\nprint(d)\n","language":"Swift"},{"code":"package require Tcl 8.6\noo::class create RAII-support {\n constructor {} {\n\tupvar 1 { end } end\n\tlappend end [self]\n\ttrace add variable end unset [namespace code {my DieNicely}]\n }\n destructor {\n\tcatch {\n\t upvar 1 { end } end\n\t trace remove variable end unset [namespace code {my DieNicely}]\n\t}\n }\n method return {{level 1}} {\n\tincr level\n\tupvar 1 { end } end\n\tupvar $level { end } parent\n\ttrace remove variable end unset [namespace code {my DieNicely}]\n\tlappend parent [self]\n\ttrace add variable parent unset [namespace code {my DieNicely}]\n\treturn -level $level [self]\n }\n # Swallows arguments\n method DieNicely args {tailcall my destroy}\n}\noo::class create RAII-class {\n superclass oo::class\n method return args {\n\t[my new {*}$args] return 2\n }\n method unknown {m args} {\n\tif {[string is double -strict $m]} {\n\t return [tailcall my new $m {*}$args]\n\t}\n\tnext $m {*}$args\n }\n unexport create unknown\n self method create args {\n\tset c [next {*}$args]\n\too::define $c superclass {*}[info class superclass $c] RAII-support\n\treturn $c\n }\n}\n# Makes a convenient scope for limiting RAII lifetimes\nproc scope {script} {\n foreach v [info global] {\n\tif {[array exists ::$v] || [string match { * } $v]} continue\n\tlappend vars $v\n\tlappend vals [set ::$v]\n }\n tailcall apply [list $vars [list \\\n\ttry $script on ok msg {$msg return}\n ] [uplevel 1 {namespace current}]] {*}$vals\n}\n","language":"Tcl"},{"code":"RAII-class create Err {\n variable N E\n constructor {number {error 0.0}} {\n\tnext\n\tnamespace import ::tcl::mathfunc::* ::tcl::mathop::*\n\tvariable N $number E [abs $error]\n }\n method p {} {\n\treturn \"$N \\u00b1 $E\"\n }\n\n method n {} { return $N }\n method e {} { return $E }\n\n method + e {\n\tif {[info object isa object $e]} {\n\t Err return [+ $N [$e n]] [hypot $E [$e e]]\n\t} else {\n\t Err return [+ $N $e] $E\n\t}\n }\n method - e {\n\tif {[info object isa object $e]} {\n\t Err return [- $N [$e n]] [hypot $E [$e e]]\n\t} else {\n\t Err return [- $N $e] $E\n\t}\n }\n method * e {\n\tif {[info object isa object $e]} {\n\t set f [* $n [$E n]]\n\t Err return $f [expr {hypot($E*$f/$N, [$e e]*$f/[$e n])}]\n\t} else {\n\t Err return [* $N $e] [abs [* $E $e]]\n\t}\n }\n method / e {\n\tif {[info object isa object $e]} {\n\t set f [/ $n [$E n]]\n\t Err return $f [expr {hypot($E*$f/$N, [$e e]*$f/[$e n])}]\n\t} else {\n\t Err return [/ $N $e] [abs [/ $E $e]]\n\t}\n }\n method ** c {\n\tset f [** $N $c]\n\tErr return $f [abs [* $f $c [/ $E $N]]]\n }\n\n export + - * / **\n}\n","language":"Tcl"},{"code":"set x1 [Err 100 1.1]\nset x2 [Err 200 2.2]\nset y1 [Err 50 1.2]\nset y2 [Err 100 2.3]\n# Evaluate in a local context to clean up intermediate objects\nset d [scope {\n [[[$x1 - $x2] ** 2] + [[$y1 - $y2] ** 2]] ** 0.5\n}]\nputs \"d = [$d p]\"\n","language":"Tcl"},{"code":"class Approx {\n construct new(nu, sigma) {\n _nu = nu\n _sigma = sigma\n }\n\n static new(a) {\n if (a is Approx) return Approx.new(a.nu, a.sigma)\n if (a is Num) return Approx.new(a, 0)\n }\n\n nu { _nu }\n sigma { _sigma }\n\n +(a) {\n if (a is Approx) return Approx.new(_nu + a.nu, (_sigma *_sigma + a.sigma*a.sigma).sqrt)\n if (a is Num) return Approx.new(_nu + a, _sigma)\n }\n\n -(a) {\n if (a is Approx) return Approx.new(_nu - a.nu, (_sigma *_sigma + a.sigma*a.sigma).sqrt)\n if (a is Num) return Approx.new(_nu - a, _sigma)\n }\n\n *(a) {\n if (a is Approx) {\n var v = _nu * a.nu\n return Approx.new(v, (v*v*_sigma*_sigma/(_nu*_nu) + a.sigma*a.sigma/(a.nu*a.nu)).sqrt)\n }\n if (a is Num) return Approx.new(_nu*a, (a*_sigma).abs)\n }\n\n /(a) {\n if (a is Approx) {\n var v = _nu / a.nu\n return Approx.new(v, (v*v*_sigma*_sigma/(_nu*_nu) + a.sigma*a.sigma/(a.nu*a.nu)).sqrt)\n }\n if (a is Num) return Approx.new(_nu/a, (a*_sigma).abs)\n }\n\n pow(d) {\n var v = _nu.pow(d)\n return Approx.new(v, (v*d*_sigma/_nu).abs)\n }\n\n toString { \"%(_nu) ±%(_sigma)\" }\n}\n\nvar x1 = Approx.new(100, 1.1)\nvar y1 = Approx.new( 50, 1.2)\nvar x2 = Approx.new(200, 2.2)\nvar y2 = Approx.new(100, 2.3)\nSystem.print(((x1 - x2).pow(2) + (y1 - y2).pow(2)).pow(0.5))\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Numeric_error_propagation\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"If '''f''', '''a''', and '''b''' are values with uncertainties σ<sub>f</sub>, σ<sub>a</sub>, and σ<sub>b</sub>, and '''c''' is a constant; \\n<br>then if '''f''' is derived from '''a''', '''b''', and '''c''' in the following ways, \\n<br>then σ<sub>f</sub> can be calculated as follows:\\n\\n:;Addition/Subtraction\\n:* If f = a ± c, or f = c ± a then '''σ<sub>f</sub> = σ<sub>a</sub>'''\\n:* If f = a ± b then '''σ<sub>f</sub><sup>2</sup> = σ<sub>a</sub><sup>2</sup> + σ<sub>b</sub><sup>2</sup>'''\\n\\n:;Multiplication/Division\\n:* If f = ca or f = ac then '''σ<sub>f</sub> = |cσ<sub>a</sub>|'''\\n:* If f = ab or f = a / b then '''σ<sub>f</sub><sup>2</sup> = f<sup>2</sup>( (σ<sub>a</sub> / a)<sup>2</sup> + (σ<sub>b</sub> / b)<sup>2</sup>)'''\\n\\n:;Exponentiation\\n:* If f = a<sup>c</sup> then '''σ<sub>f</sub> = |fc(σ<sub>a</sub> / a)|'''\\n\\n\\nCaution:\\n::This implementation of error propagation does not address issues of dependent and independent values. It is assumed that '''a''' and '''b''' are independent and so the formula for multiplication should not be applied to '''a*a''' for example. See [[Talk:Numeric_error_propagation|the talk page]] for some of the implications of this issue.\\n\\n\\n;Task details:\\n# Add an uncertain number type to your language that can support addition, subtraction, multiplication, division, and exponentiation between numbers with an associated error term together with 'normal' floating point numbers without an associated error term. <br>Implement enough functionality to perform the following calculations.\\n# Given coordinates and their errors:<br>x1 = 100 ± 1.1<br>y1 = 50 ± 1.2<br>x2 = 200 ± 2.2<br>y2 = 100 ± 2.3<br> if point p1 is located at (x1, y1) and p2 is at (x2, y2); calculate the distance between the two points using the classic Pythagorean formula: <br> <big><big> d = √<span style=\\\"text-decoration:overline\\\"> (x1 - x2)² + (y1 - y2)² </span> </big></big>\\n# Print and display both <big> '''d''' </big> and its error.\\n\\n <!-- the superscript \\n 2 glyph [²] \\nhad to be used instead of the \\n <sup>2</sup> \\nnotation which causes the overline \\\"text-decoration\\\" to either overlay the superscript or it causes a \\\"break\\\" in the continuous overline part of the radic. Gerard Schildberger. --> \\n\\n;References:\\n* [http://casa.colorado.edu/~benderan/teaching/astr3510/stats.pdf A Guide to Error Propagation] B. Keeney, 2005.\\n* [[wp:Propagation of uncertainty|Propagation of uncertainty]] Wikipedia.\\n\\n\\n;Related task:\\n* [[Quaternion type]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"generic\\n type Real is digits <>;\\n with function Sqrt(X: Real) return Real;\\n with function \\\"**\\\"(X: Real; Y: Real) return Real;\\npackage Approximation is\\n\\n type Number is private;\\n\\n -- create an approximation\\n function Approx(Value: Real; Sigma: Real) return Number;\\n\\n -- unary operations and conversion Real to Number\\n function \\\"+\\\"(X: Real) return Number;\\n function \\\"-\\\"(X: Real) return Number;\\n function \\\"+\\\"(X: Number) return Number;\\n function \\\"-\\\"(X: Number) return Number;\\n\\n -- addition / subtraction\\n function \\\"+\\\"(X: Number; Y: Number) return Number;\\n function \\\"-\\\"(X: Number; Y: Number) return Number;\\n\\n -- multiplication / division\\n function \\\"*\\\"(X: Number; Y: Number) return Number;\\n function \\\"/\\\"(X: Number; Y: Number) return Number;\\n\\n -- exponentiation\\n function \\\"**\\\"(X: Number; Y: Positive) return Number;\\n function \\\"**\\\"(X: Number; Y: Real) return Number;\\n\\n -- Output to Standard IO (wrapper for Ada.Text_IO and Ada.Text_IO.Float_IO)\\n procedure Put_Line(Message: String;\\n Item: Number;\\n Value_Fore: Natural := 7;\\n Sigma_Fore: Natural := 4;\\n Aft: Natural := 2;\\n Exp: Natural := 0);\\n procedure Put(Item: Number;\\n Value_Fore: Natural := 7;\\n Sigma_Fore: Natural := 3;\\n Aft: Natural := 2;\\n Exp: Natural := 0);\\n\\nprivate\\n type Number is record\\n Value: Real;\\n Sigma: Real;\\n end record;\\nend Approximation;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\npackage body Approximation is\\n\\n package RIO is new Ada.Text_IO.Float_IO(Real);\\n\\n -- create an approximation\\n\\n function Approx(Value: Real; Sigma: Real) return Number is\\n begin\\n return (Value, Sigma);\\n end Approx;\\n\\n -- unary operations and conversion Real to Number\\n\\n function \\\"+\\\"(X: Real) return Number is\\n begin\\n return Approx(X, 0.0);\\n end \\\"+\\\";\\n\\n function \\\"-\\\"(X: Real) return Number is\\n begin\\n return Approx(-X, 0.0);\\n end \\\"-\\\";\\n\\n function \\\"+\\\"(X: Number) return Number is\\n begin\\n return X;\\n end \\\"+\\\";\\n\\n function \\\"-\\\"(X: Number) return Number is\\n begin\\n return Approx(-X.Value, X.Sigma);\\n end \\\"-\\\";\\n\\n -- addition / subtraction\\n\\n function \\\"+\\\"(X: Number; Y: Number) return Number is\\n Z: Number;\\n begin\\n Z.Value := X.Value + Y.Value;\\n Z.Sigma := Sqrt(X.Sigma*X.Sigma + Y.Sigma*Y.Sigma);\\n return Z;\\n end \\\"+\\\";\\n\\n function \\\"-\\\"(X: Number; Y: Number) return Number is\\n begin\\n return X + (-Y);\\n end \\\"-\\\";\\n\\n -- multiplication / division\\n\\n function \\\"*\\\"(X: Number; Y: Number) return Number is\\n Z: Number;\\n begin\\n Z.Value := X.Value * Y.Value;\\n Z.Sigma := Z.Value * Sqrt((X.Sigma/X.Value)**2 + (Y.Sigma/Y.Value)**2);\\n return Z;\\n end \\\"*\\\";\\n\\n function \\\"/\\\"(X: Number; Y: Number) return Number is\\n Z: Number;\\n begin\\n Z.Value := X.Value / Y.Value;\\n Z.Sigma := Z.Value * Sqrt((X.Sigma/X.Value)**2 + (Y.Sigma/Y.Value)**2);\\n return Z;\\n end \\\"/\\\";\\n\\n -- exponentiation\\n\\n function \\\"**\\\"(X: Number; Y: Positive) return Number is\\n Z: Number;\\n begin\\n Z.Value := X.Value ** Y ;\\n Z.Sigma := Z.Value * Real(Y) * (X.Sigma/X.Value);\\n if Z.Sigma < 0.0 then\\n Z.Sigma := - Z.Sigma;\\n end if;\\n return Z;\\n end \\\"**\\\";\\n\\n function \\\"**\\\"(X: Number; Y: Real) return Number is\\n Z: Number;\\n begin\\n Z.Value := X.Value ** Y ;\\n Z.Sigma := Z.Value * Y * (X.Sigma/X.Value);\\n if Z.Sigma < 0.0 then\\n Z.Sigma := - Z.Sigma;\\n end if;\\n return Z;\\n end \\\"**\\\";\\n\\n -- Output to Standard IO (wrapper for Ada.Text_IO.Float_IO)\\n\\n procedure Put_Line(Message: String;\\n Item: Number;\\n Value_Fore: Natural := 7;\\n Sigma_Fore: Natural := 4;\\n Aft: Natural := 2;\\n Exp: Natural := 0) is\\n begin\\n Ada.Text_IO.Put(Message);\\n Put(Item, Value_Fore, Sigma_Fore, Aft, Exp);\\n Ada.Text_IO.New_Line;\\n end Put_Line;\\n\\n procedure Put(Item: Number;\\n Value_Fore: Natural := 7;\\n Sigma_Fore: Natural := 3;\\n Aft: Natural := 2;\\n Exp: Natural := 0) is\\n begin\\n RIO.Put(Item.Value, Value_Fore, Aft, Exp);\\n Ada.Text_IO.Put(\\\" (+-\\\");\\n RIO.Put(Item.Sigma, Sigma_Fore, Aft, Exp);\\n Ada.Text_IO.Put(\\\")\\\");\\n end Put;\\n\\nend Approximation;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Approximation, Ada.Numerics.Elementary_Functions;\\n\\nprocedure Test_Approximations is\\n package A is new Approximation(Float,\\n Ada.Numerics.Elementary_Functions.Sqrt,\\n Ada.Numerics.Elementary_Functions.\\\"**\\\");\\n use type A.Number;\\n X1: A.Number := A.Approx(100.0, 1.1);\\n Y1: A.Number := A.Approx( 50.0, 1.2);\\n X2: A.Number := A.Approx(200.0, 2.2);\\n Y2: A.Number := A.Approx(100.0, 2.3);\\n\\nbegin\\n A.Put_Line(\\\"Distance:\\\",\\n ((X1-X2)**2 + (Y1 - Y2)**2)**0.5,\\n Sigma_Fore => 1);\\nend Test_Approximations;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# MODE representing a uncertain number #\\nMODE UNCERTAIN = STRUCT( REAL v, uncertainty );\\n\\n# add a costant and an uncertain value #\\nOP + = ( INT c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, uncertainty OF u );\\nOP + = ( UNCERTAIN u, INT c )UNCERTAIN: c + u;\\nOP + = ( REAL c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, uncertainty OF u );\\nOP + = ( UNCERTAIN u, REAL c )UNCERTAIN: c + u;\\n# add two uncertain values #\\nOP + = ( UNCERTAIN a, b )UNCERTAIN: UNCERTAIN( v OF a + v OF b\\n , sqrt( ( uncertainty OF a * uncertainty OF a )\\n + ( uncertainty OF b * uncertainty OF b )\\n )\\n );\\n\\n# negate an uncertain value #\\nOP - = ( UNCERTAIN a )UNCERTAIN: ( - v OF a, uncertainty OF a );\\n\\n# subtract an uncertain value from a constant #\\nOP - = ( INT c, UNCERTAIN u )UNCERTAIN: c + - u;\\nOP - = ( REAL c, UNCERTAIN u )UNCERTAIN: c + - u;\\n# subtract a constant from an uncertain value #\\nOP - = ( UNCERTAIN u, INT c )UNCERTAIN: u + - c;\\nOP - = ( UNCERTAIN u, REAL c )UNCERTAIN: u + - c;\\n# subtract two uncertain values #\\nOP - = ( UNCERTAIN a, b )UNCERTAIN: a + - b;\\n\\n# multiply a constant by an uncertain value #\\nOP * = ( INT c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, ABS( c * uncertainty OF u ) );\\nOP * = ( UNCERTAIN u, INT c )UNCERTAIN: c * u;\\nOP * = ( REAL c, UNCERTAIN u )UNCERTAIN: UNCERTAIN( v OF u + c, ABS( c * uncertainty OF u ) );\\nOP * = ( UNCERTAIN u, REAL c )UNCERTAIN: c * u;\\n# multiply two uncertain values #\\nOP * = ( UNCERTAIN a, b )UNCERTAIN:\\n BEGIN\\n REAL av = v OF a;\\n REAL bv = v OF b;\\n REAL f = av * bv;\\n UNCERTAIN( f, f * sqrt( ( uncertainty OF a / av ) + ( uncertainty OF b / bv ) ) )\\n END # * # ;\\n\\n# construct the reciprocol of an uncertain value #\\nOP ONEOVER = ( UNCERTAIN u )UNCERTAIN: ( 1 / v OF u, uncertainty OF u );\\n# divide a constant by an uncertain value #\\nOP / = ( INT c, UNCERTAIN u )UNCERTAIN: c * ONEOVER u;\\nOP / = ( REAL c, UNCERTAIN u )UNCERTAIN: c * ONEOVER u;\\n# divide an uncertain value by a constant #\\nOP / = ( UNCERTAIN u, INT c )UNCERTAIN: u * ( 1 / c );\\nOP / = ( UNCERTAIN u, REAL c )UNCERTAIN: u * ( 1 / c );\\n# divide two uncertain values #\\nOP / = ( UNCERTAIN a, b )UNCERTAIN: a * ONEOVER b;\\n\\n# exponentiation #\\nOP ^ = ( UNCERTAIN u, INT c )UNCERTAIN:\\n BEGIN\\n REAL f = v OF u ^ c;\\n UNCERTAIN( f, ABS ( ( f * c * uncertainty OF u ) / v OF u ) )\\n END # ^ # ;\\nOP ^ = ( UNCERTAIN u, REAL c )UNCERTAIN:\\n BEGIN\\n REAL f = v OF u ^ c;\\n UNCERTAIN( f, ABS ( ( f * c * uncertainty OF u ) / v OF u ) )\\n END # ^ # ;\\n\\n# test the above operatrs by using them to find the pythagorean distance between the two sample points #\\nUNCERTAIN x1 = UNCERTAIN( 100, 1.1 );\\nUNCERTAIN y1 = UNCERTAIN( 50, 1.2 );\\nUNCERTAIN x2 = UNCERTAIN( 200, 2.2 );\\nUNCERTAIN y2 = UNCERTAIN( 100, 2.3 );\\n\\nUNCERTAIN d = ( ( ( x1 - x2 ) ^ 2 ) + ( y1 - y2 ) ^ 2 ) ^ 0.5;\\n\\nprint( ( \\\"distance: \\\", fixed( v OF d, 0, 2 ), \\\" +/- \\\", fixed( uncertainty OF d, 0, 2 ), newline ) )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <string.h>\\n#include <stdio.h>\\n#include <math.h>\\n\\ntypedef struct{\\n double value;\\n double delta;\\n}imprecise;\\n\\n#define SQR(x) ((x) * (x))\\nimprecise imprecise_add(imprecise a, imprecise b)\\n{\\n imprecise ret;\\n ret.value = a.value + b.value;\\n ret.delta = sqrt(SQR(a.delta) + SQR(b.delta));\\n return ret;\\n}\\n\\nimprecise imprecise_mul(imprecise a, imprecise b)\\n{\\n imprecise ret;\\n ret.value = a.value * b.value;\\n ret.delta = sqrt(SQR(a.value * b.delta) + SQR(b.value * a.delta));\\n return ret;\\n}\\n\\nimprecise imprecise_div(imprecise a, imprecise b)\\n{\\n imprecise ret;\\n ret.value = a.value / b.value;\\n ret.delta = sqrt(SQR(a.value * b.delta) + SQR(b.value * a.delta)) / SQR(b.value);\\n return ret;\\n}\\n\\nimprecise imprecise_pow(imprecise a, double c)\\n{\\n imprecise ret;\\n ret.value = pow(a.value, c);\\n ret.delta = fabs(ret.value * c * a.delta / a.value);\\n return ret;\\n}\\n\\nchar* printImprecise(imprecise val)\\n{\\n\\tchar principal[30],error[30],*string,sign[2];\\n\\tsign[0] = 241; /* ASCII code for ±, technical notation for denoting errors */\\n\\tsign[1] = 00;\\n\\t\\n\\tsprintf(principal,\\\"%f\\\",val.value);\\n\\tsprintf(error,\\\"%f\\\",val.delta);\\n\\t\\n\\tstring = (char*)malloc((strlen(principal)+1+strlen(error)+1)*sizeof(char));\\n\\t\\n\\tstrcpy(string,principal);\\n\\tstrcat(string,sign);\\n\\tstrcat(string,error);\\n\\t\\n\\treturn string;\\n}\\n\\nint main(void) {\\n imprecise x1 = {100, 1.1};\\n imprecise y1 = {50, 1.2};\\n imprecise x2 = {-200, 2.2};\\n imprecise y2 = {-100, 2.3};\\n imprecise d;\\n\\n d = imprecise_pow(imprecise_add(imprecise_pow(imprecise_add(x1, x2), 2),imprecise_pow(imprecise_add(y1, y2), 2)), 0.5);\\n printf(\\\"Distance, d, between the following points :\\\");\\n printf(\\\"\\\\n( x1, y1) = ( %s, %s)\\\",printImprecise(x1),printImprecise(y1));\\n printf(\\\"\\\\n( x2, y2) = ( %s, %s)\\\",printImprecise(x2),printImprecise(y2));\\n printf(\\\"\\\\nis d = %s\\\", printImprecise(d));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#pragma once\\n\\n#include <cmath>\\n#include <string>\\n#include <sstream>\\n#include <iomanip>\\n\\nclass Approx {\\npublic:\\n Approx(double _v, double _s = 0.0) : v(_v), s(_s) {}\\n\\n operator std::string() const {\\n std::ostringstream os(\\\"\\\");\\n os << std::setprecision(15) << v << \\\" ±\\\" << std::setprecision(15) << s << std::ends;\\n return os.str();\\n }\\n\\n Approx operator +(const Approx& a) const { return Approx(v + a.v, sqrt(s * s + a.s * a.s)); }\\n Approx operator +(double d) const { return Approx(v + d, s); }\\n Approx operator -(const Approx& a) const { return Approx(v - a.v, sqrt(s * s + a.s * a.s)); }\\n Approx operator -(double d) const { return Approx(v - d, s); }\\n\\n Approx operator *(const Approx& a) const {\\n const double t = v * a.v;\\n return Approx(v, sqrt(t * t * s * s / (v * v) + a.s * a.s / (a.v * a.v)));\\n }\\n\\n Approx operator *(double d) const { return Approx(v * d, fabs(d * s)); }\\n\\n Approx operator /(const Approx& a) const {\\n const double t = v / a.v;\\n return Approx(t, sqrt(t * t * s * s / (v * v) + a.s * a.s / (a.v * a.v)));\\n }\\n\\n Approx operator /(double d) const { return Approx(v / d, fabs(d * s)); }\\n\\n Approx pow(double d) const {\\n const double t = ::pow(v, d);\\n return Approx(t, fabs(t * d * s / v));\\n }\\n\\nprivate:\\n double v, s;\\n};\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <cstdlib>\\n#include <iostream>\\n#include \\\"numeric_error.hpp\\\"\\n\\nint main(const int argc, const char* argv[]) {\\n const Approx x1(100, 1.1);\\n const Approx x2(50, 1.2);\\n const Approx y1(200, 2.2);\\n const Approx y2(100, 2.3);\\n std::cout << std::string(((x1 - x2).pow(2.) + (y1 - y2).pow(2.)).pow(0.5)) << std::endl; // => 111.803398874989 ±2.938366893361\\n\\n\\treturn EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(defstruct uncertain-number\\n (value 0 :type number)\\n (uncertainty 0 :type number))\\n\\n(defmethod print-object ((n uncertain-number) stream)\\n (format stream \\\"~,2F ± ~,2F\\\" (uncertain-number-value n) (uncertain-number-uncertainty n)))\\n\\n(defun ~+ (n1 n2)\\n (let* ((value1 (uncertain-number-value n1))\\n (value2 (uncertain-number-value n2))\\n (uncertainty1 (uncertain-number-uncertainty n1))\\n (uncertainty2 (uncertain-number-uncertainty n2))\\n (value (+ value1 value2))\\n (uncertainty (sqrt (+ (* uncertainty1 uncertainty1)\\n (* uncertainty2 uncertainty2)))))\\n (make-uncertain-number :value value :uncertainty uncertainty)))\\n\\n(defun negate (n)\\n (make-uncertain-number :value (- (uncertain-number-value n))\\n :uncertainty (uncertain-number-uncertainty n)))\\n\\n(defun ~- (n1 n2)\\n (~+ n1 (negate n2)))\\n\\n(defun ~* (n1 n2)\\n (let* ((value1 (uncertain-number-value n1))\\n (value2 (uncertain-number-value n2))\\n (uncertainty-ratio-1 (/ (uncertain-number-uncertainty n1) value1))\\n (uncertainty-ratio-2 (/ (uncertain-number-uncertainty n2) value2))\\n (value (* value1 value2))\\n (uncertainty (sqrt (* value\\n value\\n (+ (* uncertainty-ratio-1 uncertainty-ratio-1)\\n (* uncertainty-ratio-2 uncertainty-ratio-2))))))\\n (make-uncertain-number :value value :uncertainty uncertainty)))\\n\\n(defun inverse (n)\\n (make-uncertain-number :value (/ (uncertain-number-value n))\\n :uncertainty (uncertain-number-uncertainty n)))\\n\\n(defun ~/ (n1 n2)\\n (~* n1 (inverse n2)))\\n\\n(defun ~expt (base exp)\\n (let* ((base-value (uncertain-number-value base))\\n (uncertainty-ratio (/ (uncertain-number-uncertainty base) base-value))\\n (value (expt base-value exp))\\n (uncertainty (abs (* value exp uncertainty-ratio))))\\n (make-uncertain-number :value value :uncertainty uncertainty)))\\n\\n(defun solve ()\\n (let* ((x1 (make-uncertain-number :value 100 :uncertainty 1.1))\\n (y1 (make-uncertain-number :value 50 :uncertainty 1.2))\\n (x2 (make-uncertain-number :value 200 :uncertainty 2.2))\\n (y2 (make-uncertain-number :value 100 :uncertainty 2.3))\\n (d (~expt (~+ (~expt (~- x1 x2) 2) (~expt (~- y1 y2) 2))\\n 1/2)))\\n (format t \\\"d = ~A~%\\\" d)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.string, std.typecons, std.traits;\\n\\nconst struct Imprecise {\\n private const double value, delta;\\n\\n this(in double v, in double d) pure nothrow {\\n this.value = v;\\n this.delta = abs(d);\\n }\\n\\n enum IsImprecise(T) = is(Unqual!T == Unqual!(typeof(this)));\\n\\n I reciprocal() const pure nothrow {\\n return I(1.0 / value, delta / (value ^^ 2));\\n }\\n\\n string toString() const {\\n return format(\\\"I(value=%g, delta=%g)\\\", value, delta);\\n }\\n\\n I opUnary(string op:\\\"-\\\")() const pure nothrow {\\n return I(-this.value, this.delta);\\n }\\n\\n I opBinary(string op:\\\"+\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T || IsImprecise!T) {\\n static if (IsImprecise!T)\\n return I(this.value + other.value,\\n (this.delta ^^ 2 + other.delta ^^ 2) ^^ 0.5);\\n else\\n return I(this.value + other, this.delta);\\n }\\n\\n I opBinaryRight(string op:\\\"+\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T) {\\n return I(this.value + other, this.delta);\\n }\\n\\n I opBinary(string op:\\\"-\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T || IsImprecise!T) {\\n return this + (-other);\\n }\\n\\n I opBinaryRight(string op:\\\"-\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T) {\\n return this - other;\\n }\\n\\n I opBinary(string op:\\\"*\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T || IsImprecise!T) {\\n static if (IsImprecise!T) {\\n auto f = this.value * other.value;\\n return I(f, f * ((delta / value) ^^ 2 +\\n (other.delta / other.value) ^^ 2) ^^ 0.5);\\n } else\\n return I(this.value * other, this.delta * other);\\n }\\n\\n I opBinaryRight(string op:\\\"*\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T) {\\n return this * other;\\n }\\n\\n I opBinary(string op:\\\"/\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T || IsImprecise!T) {\\n static if (IsImprecise!T)\\n return this * other.reciprocal();\\n else\\n return I(this.value / other, this.delta / other);\\n }\\n\\n I opBinaryRight(string op:\\\"/\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T) {\\n return this / other;\\n }\\n\\n I opBinary(string op:\\\"^^\\\", T)(in T other) const pure nothrow\\n if (isNumeric!T) {\\n auto f = this.value ^^ other;\\n return I(f, f * other * (this.delta / this.value));\\n }\\n}\\n\\nalias I = Imprecise;\\n\\nauto distance(T1, T2)(in T1 p1, in T2 p2) pure nothrow {\\n return ((p1[0] - p2[0]) ^^ 2 + (p1[1] - p2[1]) ^^ 2) ^^ 0.5;\\n}\\n\\nvoid main() {\\n immutable x1 = I(100, 1.1);\\n immutable x2 = I(200, 2.2);\\n immutable y1 = I( 50, 1.2);\\n immutable y2 = I(100, 2.3);\\n\\n immutable p1 = tuple(x1, y1);\\n immutable p2 = tuple(x2, y2);\\n writefln(\\\"Point p1: (%s, %s)\\\", p1[0], p1[1]);\\n writefln(\\\"Point p2: (%s, %s)\\\", p2[0], p2[1]);\\n writeln(\\\"Distance(p1, p2): \\\", distance(p1, p2));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"let sqr (x : float) = x * x\\nlet abs (x : float) = System.Math.Abs x\\nlet pow = System.Math.Pow\\n\\ntype Approx (value : float, sigma : float) =\\n member this.value = value\\n member this.sigma = sigma\\n\\n static member (~-) (x : Approx) = Approx (- x.value, x.sigma)\\n static member (%+) (x: Approx, y : float) = Approx (x.value + y, x.sigma)\\n static member (%+) (y : float, x : Approx) = x %+ y\\n static member (%+) (x : Approx, y : Approx) =\\n Approx (x.value + y.value, sqrt((sqr x.sigma)+(sqr y.sigma)))\\n static member (%-) (x: Approx, y : float) = Approx (x.value - y, x.sigma)\\n static member (%-) (y : float, x : Approx) = (-x) %+ y\\n static member (%-) (x : Approx, y : Approx) = x %+ (-y)\\n static member (%*) (x : Approx, y : float) = Approx (y * x.value, abs(y * x.sigma))\\n static member (%*) (y : float, x : Approx) = x %* y\\n static member (%*) (x : Approx, y : Approx) =\\n let v = x.value * y.value\\n Approx (v, v * sqrt(sqr(x.sigma/x.value))+sqr(y.sigma/y.value))\\n static member (%/) (x : Approx, y : Approx) =\\n Approx (x.value / y.value, sqrt(sqr(x.sigma/x.value))+sqr(y.sigma/y.value))\\n static member (%^) (x : Approx, y : float) =\\n if y < 0. then failwith (\\\"Cannot raise the power with a negative number \\\" + y.ToString())\\n let v = pow(x.value,y)\\n Approx (v, abs(v * y * x.sigma / x.value))\\n\\n override this.ToString() = sprintf \\\"%.2f ±%.2f\\\" value sigma\\n\\n[<EntryPoint>]\\nlet main argv =\\n let x1 = Approx (100., 1.1)\\n let y1 = Approx (50., 1.2)\\n let x2 = Approx (200., 2.2)\\n let y2 = Approx (100., 2.3)\\n\\n printfn \\\"Distance: %A\\\" ((((x1 %- x2) %^ 2.) %+ ((y1 %- y2) %^ 2.)) %^ 0.5)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors arrays fry kernel locals math math.functions\\nmulti-methods parser prettyprint prettyprint.custom sequences ;\\nRENAME: GENERIC: multi-methods => MM-GENERIC:\\nFROM: syntax => M: ;\\nIN: imprecise\\n\\nTUPLE: imprecise\\n { value float read-only }\\n { sigma float read-only } ;\\n\\nC: <imprecise> imprecise\\n\\n: >imprecise< ( imprecise -- value sigma )\\n [ value>> ] [ sigma>> ] bi ;\\n\\n! Define a custom syntax for imprecise numbers.\\n\\n<< SYNTAX: I{ \\\\ } [ first2 <imprecise> ] parse-literal ; >>\\nM: imprecise pprint-delims drop \\\\ I{ \\\\ } ;\\nM: imprecise >pprint-sequence >imprecise< 2array ;\\nM: imprecise pprint* pprint-object ;\\n\\n<PRIVATE\\n\\n! Error functions\\n\\n: f+-i ( float imprecise quot -- imprecise )\\n [ >imprecise< ] dip dip <imprecise> ; inline\\n\\n: i+-i ( imprecise1 imprecise2 quot -- imprecise )\\n '[ [ value>> ] bi@ @ ]\\n [ [ sigma>> sq ] bi@ + sqrt <imprecise> ] 2bi ; inline\\n\\n: f*/i ( float imprecise quot -- imprecise )\\n [ >imprecise< overd ] dip [ * abs ] 2bi* <imprecise> ;\\n inline\\n\\n:: i*/i ( a b quot -- imprecise )\\n a b [ >imprecise< ] bi@ :> ( vala siga valb sigb )\\n vala valb quot call :> val\\n val sq siga sq * vala sq /f sigb sq + valb sq /f sqrt :> sig\\n val sig <imprecise> ; inline\\n\\nPRIVATE>\\n\\nMM-GENERIC: ~+ ( obj1 obj2 -- imprecise ) foldable flushable\\nMETHOD: ~+ { float imprecise } [ + ] f+-i ;\\nMETHOD: ~+ { imprecise float } swap ~+ ;\\nMETHOD: ~+ { imprecise imprecise } [ + ] i+-i ;\\n\\nMM-GENERIC: ~- ( obj1 obj2 -- imprecise ) foldable flushable\\nMETHOD: ~- { float imprecise } [ - ] f+-i ;\\nMETHOD: ~- { imprecise float } swap [ swap - ] f+-i ;\\nMETHOD: ~- { imprecise imprecise } [ - ] i+-i ;\\n\\nMM-GENERIC: ~* ( obj1 obj2 -- imprecise ) foldable flushable\\nMETHOD: ~* { float imprecise } [ * ] f*/i ;\\nMETHOD: ~* { imprecise float } swap ~* ;\\nMETHOD: ~* { imprecise imprecise } [ * ] i*/i ;\\n\\nMM-GENERIC: ~/ ( obj1 obj2 -- imprecise ) foldable flushable\\nMETHOD: ~/ { float imprecise } [ /f ] f*/i ;\\nMETHOD: ~/ { imprecise float } swap [ swap /f ] f*/i ;\\nMETHOD: ~/ { imprecise imprecise } [ /f ] i*/i ;\\n\\n:: ~^ ( a x -- imprecise )\\n a >imprecise< :> ( vala siga )\\n vala x ^ >rect drop :> val\\n val x * siga vala /f * abs :> sig\\n val sig <imprecise> ; foldable flushable\\n\\n<PRIVATE\\n\\n: imprecise-demo ( -- )\\n I{ 100 1.1 } I{ 200 2.2 } ~- 2. ~^\\n I{ 50 1.2 } I{ 100 2.3 } ~- 2. ~^ ~+ 0.5 ~^ . ;\\n\\nPRIVATE>\\n\\nMAIN: imprecise-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: arrays kernel locals math math.functions math.vectors\\nprettyprint sequences sequences.extras ;\\nIN: uncertain\\n\\n<PRIVATE\\n\\n: ubi* ( x y p q -- u )\\n [ [ first2 ] bi@ swapd ] 2dip 2bi* 2array ; inline\\n\\n: err+ ( x y -- z ) [ sq ] bi@ + sqrt ;\\n\\n:: (u*) ( u1 u2 quot -- u )\\n u1 u2 [ first2 ] bi@ :> ( v1 s1 v2 s2 )\\n v1 v2 quot call :> val\\n s1 v1 /f sq s2 v2 /f sq + val sq * sqrt :> sig\\n val sig 2array ; inline\\n\\nPRIVATE>\\n\\n: u+n ( u n -- u ) 0 2array v+ ;\\n: n+u ( n u -- u ) swap u+n ;\\n: u-n ( u n -- u ) 0 2array v- ;\\n: n-u ( n u -- u ) [ 0 2array ] dip v- ;\\n: u+ ( u u -- u ) [ + ] [ err+ ] ubi* ;\\n: u- ( u u -- u ) [ - ] [ err+ ] ubi* ;\\n: u*n ( u n -- u ) dup 2array [ * ] [ * abs ] ubi* ;\\n: n*u ( n u -- u ) swap u*n ;\\n: u/n ( u n -- u ) dup 2array [ /f ] [ * abs ] ubi* ;\\n: n/u ( n u -- u ) [ dup 2array ] dip [ /f ] [ * abs ] ubi* ;\\n: u* ( u u -- u ) [ * ] (u*) ;\\n: u/ ( u u -- u ) [ /f ] (u*) ;\\n\\n:: u^n ( u n -- u )\\n u first2 :> ( v1 s1 )\\n v1 n ^ >rect drop :> val\\n val n * s1 v1 /f * abs :> sig\\n val sig 2array ;\\n\\n<PRIVATE\\n\\n: uncertain-demo ( -- )\\n { 100 1.1 } { 200 2.2 } u- 2.0 u^n\\n { 50 1.2 } { 100 2.3 } u- 2.0 u^n u+ 0.5 u^n . ;\\n\\nPRIVATE>\\n\\nMAIN: uncertain-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \" PROGRAM CALCULATE\\t!A distance, with error propagation.\\n REAL X1, Y1, X2, Y2\\t!The co-ordinates.\\n REAL X1E,Y1E,X2E,Y2E\\t!Their standard deviation.\\n DATA X1, Y1 ,X2, Y2 /100., 50., 200.,100./\\t!Specified\\n DATA X1E,Y1E,X2E,Y2E/ 1.1, 1.2, 2.2, 2.3/\\t!Values.\\n REAL DX,DY,D2,D,DXE,DYE,E\\t!Assistants.\\n CHARACTER*1 C\\t\\t\\t!I'm stuck with code page 437 instead of 850.\\n PARAMETER (C = CHAR(241))\\t\\t!Thus ± does not yield this glyph on a \\\"console\\\" screen. CHAR(241) does.\\n REAL SD\\t!This is an arithmetic statement function.\\n SD(X,P,S) = P*ABS(X)**(P - 1)*S\\t!SD for X**P where SD of X is S\\n WRITE (6,1) X1,C,X1E,Y1,C,Y1E,\\t!Reveal the points\\n 1 X2,C,X2E,Y2,C,Y2E\\t!Though one could have used an array...\\n 1 FORMAT (\\\"Euclidean distance between two points:\\\"/\\t!A heading.\\n 1 (\\\"(\\\",F5.1,A1,F3.1,\\\",\\\",F5.1,A1,F3.1,\\\")\\\"))\\t\\t!Thus, One point per line.\\n DX = (X1 - X2)\\t\\t\\t!X difference.\\n DXE = SQRT(X1E**2 + X2E**2)\\t!SD for DX, a simple difference.\\n DY = (Y1 - Y2)\\t\\t\\t!Y difference.\\n DYE = SQRT(Y1E**2 + Y2E**2)\\t!SD for DY, (Y1 - Y2)\\n D2 = DX**2 + DY**2\\t\\t!The distance, squared.\\n DXE = SD(DX,2,DXE)\\t\\t!SD for DX**2\\n DYE = SD(DY,2,DYE)\\t\\t!SD for DY**2\\n E = SQRT(DXE**2 + DYE**2)\\t\\t!SD for their sum\\n D = SQRT(D2)\\t\\t\\t!The distance!\\n E = SD(D2,0.5,E)\\t\\t\\t!SD after the SQRT.\\n WRITE (6,2) D,C,E\\t\\t\\t!Ahh, the relief.\\n 2 FORMAT (\\\"Distance\\\",F6.1,A1,F4.2)\\t!Sizes to fit the example.\\n END\\t!Enough.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" MODULE ERRORFLOW\\t!Calculate with an error estimate tagging along.\\n INTEGER VSP,VMAX\\t\\t!Do so with an arithmetic stack.\\n PARAMETER (VMAX = 28)\\t!Surely sufficient.\\n REAL STACKV(VMAX)\\t!Holds the values.\\n REAL STACKE(VMAX)\\t!And the corresponding error estimate.\\n INTEGER VOUT\\t\\t!Output file.\\n LOGICAL VTRACE\\t\\t!Perhaps progress is to be followed in detail.\\n DATA VSP,VOUT,VTRACE/0,0,.FALSE./\\t!Start with nothing.\\n CHARACTER*1 PM\\t\\t\\t!I'm stuck with code page 437 instead of 850.\\n PARAMETER (PM = CHAR(241))\\t!Thus ± does not yield this glyph on a \\\"console\\\" screen. CHAR(241) does.\\n CONTAINS\\t\\t!The servants.\\n SUBROUTINE VINIT(OUT)\\t!Get ready.\\n INTEGER OUT\\t\\t!Unit number for output.\\n VSP = 0\\t\\t!My stack is empty.\\n VOUT = OUT\\t\\t!Save this rather than have extra parameters.\\n VTRACE = VOUT .GT. 0\\t!By implication.\\n END SUBROUTINE VINIT\\t!Ready.\\n SUBROUTINE VSHOW(WOT)\\t!Show the topmost element.\\n CHARACTER*(*) WOT\\t!The caller identifies itself.\\n IF (VSP.LE.0) THEN\\t!Just in case\\n WRITE (VOUT,1) \\\"Empty\\\",VSP\\t!My stack may be empty.\\n ELSE\\t\\t\\t!But normally, it is not.\\n IF (STACKV(VSP).EQ.0) THEN\\t!But it might have a zero value!\\n WRITE (VOUT,1) WOT,VSP,STACKV(VSP),PM,STACKE(VSP)\\t\\t!Alas. No percentage, then.\\n 1 FORMAT (A8,\\\": Vstack(\\\",I2,\\\") =\\\",F8.1,A1,F6.2,F9.1,\\\"%\\\")\\t!Suits the example.\\n ELSE\\t\\t!Avoiding a divide-by-zero is polite.\\n WRITE (VOUT,1) WOT,VSP,STACKV(VSP),PM,STACKE(VSP),\\t!Possibly, a surprise, still.\\n 1 STACKE(VSP)/STACKV(VSP)*100\\t!The relative error may well be interesting.\\n END IF\\t\\t!The pearls have been cast.\\n END IF\\t\\t!So much for protection.\\n END SUBROUTINE VSHOW\\t!Could reveal all the stack...\\n\\n SUBROUTINE VLOAD(V,E)\\t!Load the stack.\\n REAL V,E\\t\\t!The value and its error.\\n IF (VSP.GE.VMAX) STOP \\\"VLOAD: overflow!\\\"\\t!Oh dear.\\n VSP = VSP + 1\\t\\t!Up one.\\n STACKV(VSP) = V\\t!Place the value.\\n STACKE(VSP) = E\\t!And the error.\\n IF (VTRACE) CALL VSHOW(\\\"vLoad\\\")\\n END SUBROUTINE VLOAD\\t!That was easy!\\n\\n SUBROUTINE VADD\\t\\t!Add the top two elements.\\n IF (VSP.LE.1) STOP \\\"VADD: underflow!\\\"\\t!Maybe not.\\n STACKV(VSP - 1) = STACKV(VSP - 1) + STACKV(VSP)\\t!Do the deed.\\n STACKE(VSP - 1) = SQRT(STACKE(VSP - 1)**2 + STACKE(VSP)**2)\\t!The errors follow.\\n VSP = VSP - 1\\t\\t\\t!Two values have become one.\\n IF (VTRACE) CALL VSHOW(\\\"vAdd\\\")!The result.\\n END SUBROUTINE VADD\\t!The variance of the sum is the sum of the variances.\\n\\n SUBROUTINE VSUB\\t\\t!Subtract the topmost element from the one below.\\n IF (VSP.LE.1) STOP \\\"VSUB: underflow!\\\"\\t!Perhaps not.\\n STACKV(VSP - 1) = STACKV(VSP - 1) - STACKV(VSP)\\t!The topmost was the second loaded.\\n STACKE(VSP - 1) = SQRT(STACKE(VSP - 1)**2 + STACKE(VSP)**2)\\t!Add the variances also.\\n VSP = VSP - 1\\t\\t\\t!Two values have become one.\\n IF (VTRACE) CALL VSHOW(\\\"vSub\\\")!The result.\\n END SUBROUTINE VSUB\\t!Could alternatively play with the signs and add...\\n\\n SUBROUTINE VMUL\\t\\t!Multiply the top two elements.\\n REAL R1,R2\\t\\t!Use relative errors in place of plain SD.\\n IF (VSP.LE.1) STOP \\\"VMUL: underflow!\\\"\\t!Perhaps not.\\n R1 = STACKE(VSP - 1)/STACKV(VSP - 1)\\t!The relative errors for multiply\\n R2 = STACKE(VSP) /STACKV(VSP)\\t!Are treated as are variances in addition.\\n STACKV(VSP - 1) = STACKV(VSP - 1)*STACKV(VSP)\\t!Perform the multiply.\\n VSP = VSP - 1\\t\\t\\t\\t\\t!Unstack, but not quite finished.\\n STACKE(VSP) = SQRT((R1**2 + R2**2)*STACKV(VSP)**2)\\t![SD/xy]² = [SD/x]² + [SD/y]²\\n IF (VTRACE) CALL VSHOW(\\\"vMul\\\")\\t\\t\\t!Thus SD² = [[SD/x]² + [SD/y]²]xy²\\n END SUBROUTINE VMUL\\t!The square means that the error's sign is not altered.\\n\\n SUBROUTINE VDIV\\t\\t!Divide the penultimate element by the top elements.\\n REAL R1,R2\\t\\t!Use relative errors in place of plain SD.\\n IF (VSP.LE.1) STOP \\\"VDIV: underflow!\\\"\\t!Perhaps not.\\n R1 = STACKE(VSP - 1)/STACKV(VSP - 1)\\t!The relative errors for divide\\n R2 = STACKE(VSP) /STACKV(VSP)\\t!Are treated as are variances in subtraction.\\n STACKV(VSP - 1) = STACKV(VSP - 1)/STACKV(VSP)\\t!Perform the divide.\\n VSP = VSP - 1\\t\\t\\t\\t\\t!X/Y is Load X, Load Y, Divide; Y is topmost.\\n STACKE(VSP) = SQRT((R1**2 + R2**2)*STACKV(VSP)**2)\\t![SD/(x/y)]² = [SD/x]² + [SD/y]²\\n IF (VTRACE) CALL VSHOW(\\\"vDiv\\\")\\t\\t\\t!Thus SD² = [[SD/x]² + [SD/y]²](x/y)²\\n END SUBROUTINE VDIV\\t!Worry over y ± SD spanning zero...\\n\\n SUBROUTINE VSQRT\\t!Now for some fun with the topmost element.\\n IF (VSP.LE.0) STOP \\\"VSQRT: underflow!\\\"\\t!Maybe not.\\n STACKV(VSP) = SQRT(STACKV(VSP))\\t\\t!Negative? Let the system complain.\\n STACKE(VSP) = 0.5/STACKV(VSP)*STACKE(VSP)\\t!F(x ± s) = F(x) ± F'(x).s\\n IF (VTRACE) CALL VSHOW(\\\"vSqrt\\\")\\t\\t!Here, F' can't be negative.\\n END SUBROUTINE VSQRT\\t!No change to the pointer.\\n SUBROUTINE VSQUARE\\t!Another raise-to-a-power.\\n STACKE(VSP) = 2*ABS(STACKV(VSP))*STACKE(VSP)\\t!The error's sign is not to be messed with.\\n STACKV(VSP) = STACKV(VSP)**2\\t\\t!This will never be negative.\\n IF (VTRACE) CALL VSHOW(\\\"vSquare\\\")\\t!Keep away from zero though.\\n END SUBROUTINE VSQUARE\\t!Same formula as VSQRT, just a different power.\\n SUBROUTINE VPOW(P)\\t!Now for the more general.\\n INTEGER P\\t\\t!Though only integer powers for this routine, so no EXP(P*LN(x)).\\n IF (VSP.LE.0) STOP \\\"VPOW: underflow!\\\"\\t!Perhaps not.\\n IF (P.EQ.0) STOP \\\"VPOW: zero power!\\\"\\t!No sense in this power!\\n STACKE(VSP) = P*ABS(STACKV(VSP))**(P - 1)*STACKE(VSP)\\t!Negative values a worry.\\n STACKV(VSP) = ABS(STACKV(VSP))**P\\t\\t\\t!I only want the magnitude.\\n IF (VTRACE) CALL VSHOW(\\\"vPower\\\")\\t!So, what happened?\\n END SUBROUTINE VPOW\\t!Powers with fractional parts are troublesome.\\n END MODULE ERRORFLOW\\t!That will do for the test problem.\\n\\n PROGRAM CALCULATE\\t!A distance, with error propagation.\\n USE ERRORFLOW\\t!For the details.\\n REAL X1, Y1, X2, Y2\\t!The co-ordinates.\\n REAL X1E,Y1E,X2E,Y2E\\t!Their standard deviation.\\n DATA X1, Y1 ,X2, Y2 /100., 50., 200.,100./\\t!Specified\\n DATA X1E,Y1E,X2E,Y2E/ 1.1, 1.2, 2.2, 2.3/\\t!Values.\\n\\n WRITE (6,1) X1,PM,X1E,Y1,PM,Y1E,\\t!Reveal the points\\n 1 X2,PM,X2E,Y2,PM,Y2E\\t!Though one could have used an array...\\n 1 FORMAT (\\\"Euclidean distance between two points:\\\"/\\t!A heading.\\n 1 (\\\"(\\\",F5.1,A1,F3.1,\\\",\\\",F5.1,A1,F3.1,\\\")\\\"))\\t\\t!Thus, One point per line.\\n\\nCalculate SQRT[(X2 - X1)**2 + (Y2 - Y1)**2]\\n CALL VINIT(6)\\t\\t!Start my arithmetic.\\n CALL VLOAD(X2,X2E)\\n CALL VLOAD(X1,X1E)\\n CALL VSUB\\t\\t\\t!(X2 - X1)\\n CALL VSQUARE\\t\\t!(X2 - X1)**2\\n CALL VLOAD(Y2,Y2E)\\n CALL VLOAD(Y1,Y1E)\\n CALL VSUB\\t\\t\\t!Y2 - Y1)\\n CALL VSQUARE\\t\\t!Y2 - Y1)**2\\n CALL VADD\\t\\t\\t!(X2 - X1)**2 + (Y2 - Y1)**2\\n CALL VSQRT\\t\\t!SQRT((X2 - X1)**2 + (Y2 - Y1)**2)\\n WRITE (6,2) STACKV(1),PM,STACKE(1)\\t!Ahh, the relief.\\n 2 FORMAT (\\\"Distance\\\",F6.1,A1,F4.2)\\t!Sizes to fit the example.\\n END\\t!Enough.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" TYPE DATUM\\n REAL VALUE\\n REAL SD\\n END TYPE DATUM\\n TYPE POINT\\n TYPE(DATUM) X\\n TYPE(DATUM) Y\\n END TYPE POINT\\n TYPE(POINT) P1,P2\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"'----------------------\\n' definition of a \\\"measurement\\\" type with value and uncartainty\\n' and operators that can operate on them\\n'---------------------\\n\\n#macro p2(x)\\n (x)*(x)\\n#endmacro\\n\\ntype meas\\n vlu as double\\n unc as double\\nend type\\n\\noperator + ( a as meas, b as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu + b.vlu\\n ret.unc = sqr( a.unc*a.unc + b.unc*b.unc )\\n return ret\\nend operator\\n\\noperator + ( c as double, a as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu + c\\n ret.unc = a.unc\\n return ret\\nend operator\\n\\noperator + ( a as meas, c as double ) as meas\\n return c+a\\nend operator\\n\\noperator - ( a as meas, b as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu - b.vlu\\n ret.unc = sqr( a.unc*a.unc + b.unc*b.unc )\\n return ret\\nend operator\\n\\noperator - ( c as double, a as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu - c\\n ret.unc = a.unc\\n return ret\\nend operator\\n\\noperator - ( a as meas, c as double ) as meas\\n dim ret as meas\\n ret.vlu = c - a.vlu\\n ret.unc = a.unc\\n return ret\\nend operator\\n\\noperator * ( a as meas, b as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu*b.vlu\\n ret.unc = sqr(p2(ret.vlu) * (p2(a.unc/a.vlu)+p2(b.unc/b.vlu)))\\n return ret\\nend operator\\n\\noperator * ( c as double, a as meas ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu*c\\n ret.unc = abs(c*a.unc)\\n return ret\\nend operator\\n\\noperator * ( a as meas, c as double ) as meas\\n return c*a\\nend operator\\n\\noperator ^ ( a as meas, c as double ) as meas\\n dim ret as meas\\n ret.vlu = a.vlu ^ c\\n ret.unc = abs(ret.vlu*c*a.unc/a.vlu)\\n return ret\\nend operator\\n\\noperator / ( c as double, a as meas ) as meas\\n return c*a^(-1)\\nend operator\\n\\noperator / ( a as meas, c as double ) as meas\\n return a*(1.0/c)\\nend operator\\n\\noperator / ( a as meas, b as meas ) as meas\\n return b*a^(-1)\\nend operator\\n\\nsub printm( a as meas )\\n print using \\\"####.##### +- ####.####\\\"; a.vlu; a.unc\\nend sub\\n\\n'--------------------------------\\n' now the results\\n'--------------------------------\\n\\ndim as meas x1, y1, x2, y2\\nx1.vlu = 100.\\nx1.unc = 1.1\\ny1.vlu = 50.\\ny1.unc = 1.2\\nx2.vlu = 200.\\nx2.unc = 2.2\\ny2.vlu = 100.\\ny2.unc = 2.3\\n\\nprintm( ((x1-x2)^2 + (y1-y2)^2)^0.5 )\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\n// \\\"uncertain number type\\\"\\n// a little optimization is to represent the error term with its square.\\n// this saves some taking of square roots in various places.\\ntype unc struct {\\n n float64 // the number\\n s float64 // *square* of one sigma error term\\n}\\n\\n// constructor, nice to have so it can handle squaring of error term\\nfunc newUnc(n, s float64) *unc {\\n return &unc{n, s * s}\\n}\\n\\n// error term accessor method, nice to have so it can handle recovering\\n// (non-squared) error term from internal (squared) representation\\nfunc (z *unc) errorTerm() float64 {\\n return math.Sqrt(z.s)\\n}\\n\\n// Arithmetic methods are modeled on the Go big number package.\\n// The basic scheme is to pass all operands as method arguments, compute\\n// the result into the method receiver, and then return the receiver as\\n// the result of the method. This has an advantage of letting the programer\\n// determine allocation and use of temporary objects, reducing garbage;\\n// and has the convenience and efficiency of allowing operations to be chained.\\n\\n// addition/subtraction\\nfunc (z *unc) addC(a *unc, c float64) *unc {\\n *z = *a\\n z.n += c\\n return z\\n}\\n\\nfunc (z *unc) subC(a *unc, c float64) *unc {\\n *z = *a\\n z.n -= c\\n return z\\n}\\n\\nfunc (z *unc) addU(a, b *unc) *unc {\\n z.n = a.n + b.n\\n z.s = a.s + b.s\\n return z\\n}\\nfunc (z *unc) subU(a, b *unc) *unc {\\n z.n = a.n - b.n\\n z.s = a.s + b.s\\n return z\\n}\\n\\n// multiplication/division\\nfunc (z *unc) mulC(a *unc, c float64) *unc {\\n z.n = a.n * c\\n z.s = a.s * c * c\\n return z\\n}\\n\\nfunc (z *unc) divC(a *unc, c float64) *unc {\\n z.n = a.n / c\\n z.s = a.s / (c * c)\\n return z\\n}\\n\\nfunc (z *unc) mulU(a, b *unc) *unc {\\n prod := a.n * b.n\\n z.n, z.s = prod, prod*prod*(a.s/(a.n*a.n)+b.s/(b.n*b.n))\\n return z\\n}\\n\\nfunc (z *unc) divU(a, b *unc) *unc {\\n quot := a.n / b.n\\n z.n, z.s = quot, quot*quot*(a.s/(a.n*a.n)+b.s/(b.n*b.n))\\n return z\\n}\\n\\n// exponentiation\\nfunc (z *unc) expC(a *unc, c float64) *unc {\\n f := math.Pow(a.n, c)\\n g := f * c / a.n\\n z.n = f\\n z.s = a.s * g * g\\n return z\\n}\\n\\nfunc main() {\\n x1 := newUnc(100, 1.1)\\n x2 := newUnc(200, 2.2)\\n y1 := newUnc(50, 1.2)\\n y2 := newUnc(100, 2.3)\\n var d, d2 unc\\n d.expC(d.addU(d.expC(d.subU(x1, x2), 2), d2.expC(d2.subU(y1, y2), 2)), .5)\\n fmt.Println(\\\"d: \\\", d.n)\\n fmt.Println(\\\"error:\\\", d.errorTerm())\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"data Error a = Error {value :: a, uncertainty :: a} deriving (Eq, Show)\\n\\ninstance (Floating a) => Num (Error a) where\\n\\tError a ua + Error b ub = Error (a + b) (sqrt (ua ^ 2 + ub ^ 2))\\n\\tnegate (Error a ua) = Error (negate a) ua\\n\\tError a ua * Error b ub = Error (a * b) (abs (a * b * sqrt ((ua / a) ^ 2 + (ub / b) ^ 2))) -- I've factored out the f^2 from the square root\\n\\tfromInteger a = Error (fromInteger a) 0\\n\\ninstance (Floating a) => Fractional (Error a) where\\n\\tfromRational a = Error (fromRational a) 0\\n\\tError a ua / Error b ub = Error (a / b) (abs (a / b * sqrt ((ua / a) ^ 2 + (ub / b) ^ 2))) -- I've factored out the f^2 from the square root\\n\\ninstance (Floating a) => Floating (Error a) where\\n\\tError a ua ** Error c 0 = Error (a ** c) (abs (ua * c * a**c / a))\\n\\nmain = print (sqrt ((x1 - x2) ** 2 + (y1 - y2) ** 2)) where -- using (^) for exponentiation would calculate a*a, which the problem specifically said was calculated wrong\\n\\tx1 = Error 100 1.1\\n\\ty1 = Error 50 1.2\\n\\tx2 = Error 200 2.2\\n\\ty2 = Error 100 2.3\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"record num(val,err)\\n\\nprocedure main(a)\\n x1 := num(100.0, 1.1)\\n y1 := num(50.0, 1.2)\\n x2 := num(200.0, 2.2)\\n y2 := num(100.0, 2.3)\\n d := pow(add(pow(sub(x1,x2),2),pow(sub(y1,y2),2)),0.5)\\n write(\\\"d = [\\\",d.val,\\\", \\\",d.err,\\\"]\\\")\\nend\\n\\nprocedure add(a,b)\\n return (numeric(a)+numeric(b)) |\\n num(numeric(a)+b.val, b.err) |\\n num(a.val+numeric(b), a.err) |\\n num(a.val+b.val, (a.err^2 + b.err^2) ^ 0.5)\\nend\\n\\nprocedure sub(a,b)\\n return (numeric(a)-numeric(b)) |\\n num(numeric(a)-b.val, b.err) |\\n num(a.val-numeric(b), a.err) |\\n num(a.val-b.val, (a.err^2 + b.err^2) ^ 0.5)\\nend\\n\\nprocedure mul(a,b)\\n return (numeric(a)*numeric(b)) |\\n num(numeric(a)*b.val, abs(a*b.err)) |\\n num(a.val*numeric(b), abs(b*a.err)) |\\n num(f := a.val*b.val, ((f^2*((a.err/a.val)^2+(b.err/b.val)^2))^0.5))\\nend\\n\\nprocedure div(a,b)\\n return (numeric(a)/numeric(b)) |\\n num(numeric(a)/b.val, abs(a*b.err)) |\\n num(a.val/numeric(b), abs(b*a.err)) |\\n num(f := a.val/b.val, ((f^2*((a.err/a.val)^2+(b.err/b.val)^2))^0.5))\\nend\\n\\nprocedure pow(a,b)\\n return (numeric(a)^numeric(b)) |\\n num(f := a.val^numeric(b), abs(f*b*(a.err/a.val)))\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"num=: {.\\\"1\\nunc=: {:@}.\\\"1 : ,.\\ndist=: +/&.:*:\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"x1=: 100 unc 1.1\\ny1=: 50 unc 1.2\\n\\nx2=: 200 unc 2.2\\ny2=: 100 unc 2.3\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" num x1\\n100\\n unc x1\\n1.1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" num 100\\n100\\n unc 100\\n0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 3 dist 4\\n5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"add=: +&num unc dist&unc\\nsub=: -&num unc dist&unc\\nmul=: *&num unc |@(*&num * dist&(unc%num))\\ndiv=: %&num unc |@(%&num * dist&(unc%num))\\nexp=: ^&num unc |@(^&num * dist&(unc%num))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" exp&0.5 (x1 sub x2) add&(exp&2) y1 sub y2\\n111.803 2.48717\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Approx {\\n private double value;\\n private double error;\\n\\n public Approx(){this.value = this.error = 0;}\\n\\n public Approx(Approx b){\\n this.value = b.value;\\n this.error = b.error;\\n }\\n\\n public Approx(double value, double error){\\n this.value = value;\\n this.error = error;\\n }\\n\\n public Approx add(Approx b){\\n value+= b.value;\\n error = Math.sqrt(error * error + b.error * b.error);\\n return this;\\n }\\n\\n public Approx add(double b){\\n value+= b;\\n return this;\\n }\\n\\n public Approx sub(Approx b){\\n value-= b.value;\\n error = Math.sqrt(error * error + b.error * b.error);\\n return this;\\n }\\n\\n public Approx sub(double b){\\n value-= b;\\n return this;\\n }\\n\\n public Approx mult(Approx b){\\n double oldVal = value;\\n value*= b.value;\\n error = Math.sqrt(value * value * (error*error) / (oldVal*oldVal) +\\n (b.error*b.error) / (b.value*b.value));\\n return this;\\n }\\n\\n public Approx mult(double b){\\n value*= b;\\n error = Math.abs(b * error);\\n return this;\\n }\\n\\n public Approx div(Approx b){\\n double oldVal = value;\\n value/= b.value;\\n error = Math.sqrt(value * value * (error*error) / (oldVal*oldVal) +\\n (b.error*b.error) / (b.value*b.value));\\n return this;\\n }\\n\\n public Approx div(double b){\\n value/= b;\\n error = Math.abs(b * error);\\n return this;\\n }\\n\\n public Approx pow(double b){\\n double oldVal = value;\\n value = Math.pow(value, b);\\n error = Math.abs(value * b * (error / oldVal));\\n return this;\\n }\\n\\n @Override\\n public String toString(){return value+\\\"±\\\"+error;}\\n\\n public static void main(String[] args){\\n Approx x1 = new Approx(100, 1.1);\\n Approx y1 = new Approx(50, 1.2);\\n Approx x2 = new Approx(200, 2.2);\\n Approx y2 = new Approx(100, 2.3);\\n\\n x1.sub(x2).pow(2).add(y1.sub(y2).pow(2)).pow(0.5);\\n\\n System.out.println(x1);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Measurements\\n\\nx1 = measurement(100, 1.1)\\nx2 = measurement(200, 2.2)\\ny1 = measurement(50, 1.2)\\ny2 = measurement(100, 2.3)\\n\\nd = sqrt((x1 - x2)^2 + (y1 - y2)^2)\\n\\n@show d\\n@show d.val, d.err\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"module NumericError\\n\\nimport Base: convert, promote_rule, +, -, *, /, ^\\n\\nexport Measure\\n\\ntype Measure <: Number\\n x::Float64\\n σ::Float64\\n Measure(x::Real) = new(Float64(x), 0)\\n Measure(x::Real, σ::Real) = new(Float64(x), σ)\\nend\\n\\nBase.show(io::IO, x::Measure) = print(io, string(x.x, \\\" ± \\\", x.σ))\\n\\nBase.convert(::Type{Measure}, x::Real) = Measure(Float64(x), 0.0)\\nBase.promote_rule(::Type{Float64}, ::Type{Measure}) = Measure\\nBase.promote_rule(::Type{Int64}, ::Type{Measure}) = Measure\\n\\n+(a::Measure, b::Measure) = Measure(a.x + b.x, sqrt(a.σ ^ 2 + b.σ ^ 2))\\n-(a::Measure, b::Measure) = Measure(a.x - b.x, sqrt(a.σ ^ 2 + b.σ ^ 2))\\n-(a::Measure) = Measure(-a.x, a.σ)\\n\\n*(a::Measure, b::Measure) = begin\\n x = a.x * b.x\\n σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\\n Measure(x, σ)\\nend\\n/(a::Measure, b::Measure) = begin\\n x = a.x / b.x\\n σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\\n Measure(x, σ)\\nend\\n\\n^(a::Measure, b::Float64) = begin\\n x = a.x ^ b\\n σ = abs(x * b * a.σ / a.x)\\n Measure(x, σ)\\nend\\n\\nBase.sqrt(a::Measure) = a ^ .5\\n\\nend # module NumericError\\n\\nusing NumericError\\n\\n# x1 = 100 ± 1.1\\n# y1 = 50 ± 1.2\\n# x2 = 200 ± 2.2\\n# y2 = 100 ± 2.3\\n\\nx1 = Measure(100, 1.1)\\ny1 = Measure(50, 1.2)\\nx2 = Measure(200, 2.2)\\ny2 = Measure(100, 2.3)\\n\\nd = sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\\n\\n@show x1 y1 x2 y2 sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.lang.Math.*\\n\\ndata class Approx(val ν: Double, val σ: Double = 0.0) {\\n constructor(a: Approx) : this(a.ν, a.σ)\\n constructor(n: Number) : this(n.toDouble(), 0.0)\\n\\n override fun toString() = \\\"$ν ±$σ\\\"\\n\\n operator infix fun plus(a: Approx) = Approx(ν + a.ν, sqrt(σ * σ + a.σ * a.σ))\\n operator infix fun plus(d: Double) = Approx(ν + d, σ)\\n operator infix fun minus(a: Approx) = Approx(ν - a.ν, sqrt(σ * σ + a.σ * a.σ))\\n operator infix fun minus(d: Double) = Approx(ν - d, σ)\\n\\n operator infix fun times(a: Approx): Approx {\\n val v = ν * a.ν\\n return Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\\n }\\n\\n operator infix fun times(d: Double) = Approx(ν * d, abs(d * σ))\\n\\n operator infix fun div(a: Approx): Approx {\\n val v = ν / a.ν\\n return Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\\n }\\n\\n operator infix fun div(d: Double) = Approx(ν / d, abs(d * σ))\\n\\n fun pow(d: Double): Approx {\\n val v = pow(ν, d)\\n return Approx(v, abs(v * d * σ / ν))\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val x1 = Approx(100.0, 1.1)\\n val y1 = Approx(50.0, 1.2)\\n val x2 = Approx(200.0, 2.2)\\n val y2 = Approx(100.0, 2.3)\\n println(((x1 - x2).pow(2.0) + (y1 - y2).pow(2.0)).pow(0.5))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"PlusMinus /: a_ ± σa_ + c_?NumericQ := N[(a + c) ± σa];\\nPlusMinus /: a_ ± σa_ + b_ ± σb_ := N[(a + b) ± Norm@{σa, σb}];\\nPlusMinus /: c_?NumericQ (a_ ± σa_) := N[c a ± Abs[c σa]];\\nPlusMinus /: (a_ ± σa_) (b_ ± σb_) := N[a b ± (a b Norm@{σa/a, σb/b})^2];\\nPlusMinus /: (a_ ± σa_)^c_?NumericQ := N[a^c ± Abs[a^c σa/a]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"x1 = 100 ± 1.1;\\ny1 = 50 ± 1.2;\\nx2 = 200 ± 2.2;\\ny2 = 100 ± 2.3;\\nd = Sqrt[(x1 - x2)^2 + (y1 - y2)^2]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"x1 = Around[100, 1.1];\\ny1 = Around[50, 1.2];\\nx2 = Around[200, 2.2];\\ny2 = Around[100, 2.3];\\nd = Sqrt[(x1 - x2)^2 + (y1 - y2)^2]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat\\nimport math\\n\\ntype\\n Imprecise = object\\n x: float\\n σ: float\\n\\ntemplate `^`(a, b: float): float =\\n pow(a, b)\\ntemplate `-`(a: Imprecise): Imprecise =\\n Imprecise(x: -a.x, σ: a.σ)\\ntemplate `+`(a, b: Imprecise): Imprecise =\\n Imprecise(x: a.x + b.x, σ: sqrt(a.σ ^ 2 + b.σ ^ 2))\\ntemplate `-`(a, b: Imprecise): Imprecise =\\n Imprecise(x: a.x - b.x, σ: sqrt(a.σ ^ 2 + b.σ ^ 2))\\ntemplate `*`(a, b: Imprecise): Imprecise =\\n let x = a.x * b.x\\n let σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\\n Imprecise(x: x, σ: σ)\\ntemplate `/`(a, b: Imprecise): Imprecise =\\n let x = a.x / b.x\\n let σ = sqrt(x ^ 2 * ((a.σ / a.x) ^ 2 + (b.σ / b.x) ^ 2))\\n Imprecise(x: x, σ: σ)\\ntemplate `^`(a: Imprecise, b: float): Imprecise =\\n if b < 0:\\n raise newException(IOError, \\\"Cannot raise to negative power.\\\")\\n let x = a.x ^ b\\n let σ = abs(x * b * a.σ / a.x)\\n Imprecise(x: x, σ: σ)\\ntemplate sqrt(a: Imprecise): Imprecise =\\n a ^ 0.5\\n\\nproc `$`(a: Imprecise): string =\\n fmt\\\"{a.x:.2f} ± {a.σ:.2f}\\\"\\n\\nvar x1 = Imprecise(x: 100, σ: 1.1)\\nvar y1 = Imprecise(x: 50, σ: 1.2)\\nvar x2 = Imprecise(x: 200, σ: 2.2)\\nvar y2 = Imprecise(x: 100, σ: 2.3)\\n\\necho sqrt((x1 - x2) ^ 2 + (y1 - y2) ^ 2)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"add(a,b)=if(type(a)==type(b), a+b, if(type(a)==\\\"t_VEC\\\",a+[b,0],b+[a,0]));\\nsub(a,b)=if(type(a)==type(b), [a[1]-b[1],a[2]+b[2]], if(type(a)==\\\"t_VEC\\\",a-[b,0],[a,0]-b));\\nmult(a,b)=if(type(a)==\\\"t_VEC\\\", if(type(b)==\\\"t_VEC\\\", [a[1]*b[1], abs(a[1]*b[1])*sqrt(norml2([a[2]/a[1],b[2]/b[1]]))], [b*a[1], abs(b)*a[2]]), [a*b[1], abs(a)*b[2]]);\\ndiv(a,b)=if(type(b)!=\\\"t_VEC\\\", mult(a,1/b), mult(a,[1/b[1],b[2]/b[1]^2]));\\npow(a,b)=[a[1]^b, abs(a[1]^b*b*a[2]/a[1])];\\nx1=[100,1.1];y1=[50,1.2];x2=[200,2.2];y2=[100,2.3];\\npow(add(pow(sub(x1,x2),2),pow(sub(y1,y2),2)),.5)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use v5.36;\\n\\npackage ErrVar;\\n\\n# helper function, apply function 'f' to pairs (a, b) from listX and listY\\nsub zip ($f, $x, $y) {\\n my @out;\\n $y = [(0) x @$x] unless @$y; # if not defined\\n push @out, $f->($x->[$_], $y->[$_]) for 0 .. $#$x;\\n \\\\@out\\n}\\n\\nuse overload\\n '\\\"\\\"' => \\\\&_str,\\n '+' => \\\\&_add,\\n '-' => \\\\&_sub,\\n '*' => \\\\&_mul,\\n '/' => \\\\&_div,\\n 'bool' => \\\\&_bool,\\n '<=>' => \\\\&_ncmp,\\n 'neg' => \\\\&_neg,\\n 'sqrt' => \\\\&_sqrt,\\n 'log' => \\\\&_log,\\n 'exp' => \\\\&_exp,\\n '**' => \\\\&_pow,\\n;\\n\\n# make a variable with mean value and a list of coefficient to\\n# variables providing independent errors\\nsub make ($x, @v) { bless [$x, @v] }\\n\\n# mean value of the var, or just the input if it's not of this class\\nsub mean ($x) { ref $x && $x->isa(__PACKAGE__) ? $x->[0] : $x }\\n\\n# return variance index array\\nsub vlist ($x) { ref $x && $x->isa(__PACKAGE__) ? $x->[1] : [] }\\n\\nsub variance ($x) {\\n return 0 unless ref($x) and $x->isa(__PACKAGE__);\\n my $s;\\n $s += $_ * $_ for @{$x->[1]};\\n $s\\n}\\n\\nsub covariance ($x, $y) {\\n return 0 unless ref($x) && $x->isa(__PACKAGE__);\\n return 0 unless ref($y) && $y->isa(__PACKAGE__);\\n my $s;\\n zip sub ($a,$b) { $s += $a * $b }, vlist($x), vlist($y);\\n $s\\n}\\n\\nsub sigma ($v) { sqrt variance $v }\\n\\n# to determine if a var is probably zero. we use 1σ here\\nsub _bool ($x, $, $) {\\n abs(mean $x) > sigma $x\\n}\\n\\nsub _ncmp ($a, $b, $) {\\n return 0 unless my $x = $a - $b;\\n mean($x) > 0 ? 1 : -1\\n}\\n\\nsub _neg ($x, $, $) {\\n bless [ -mean($x), [map(-$_, @{vlist $x}) ] ];\\n}\\n\\nsub _add ($x, $y, $) {\\n my ($x0, $y0) = ( mean($x), mean($y));\\n my ($xv, $yv) = (vlist($x), vlist($y));\\n bless [$x0 + $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\\n}\\n\\nsub _sub ($x, $y, $) {\\n my ($x0, $y0) = ( mean($x), mean($y));\\n my ($xv, $yv) = (vlist($x), vlist($y));\\n bless [$x0 - $y0, zip sub ($a,$b) {$a - $b}, $xv, $yv]\\n}\\n\\nsub _mul ($x, $y, $) {\\n my ($x0, $y0) = ( mean($x), mean($y));\\n my ($xv, $yv) = (vlist($x), vlist($y));\\n $xv = [ map($y0 * $_, @$xv) ];\\n $yv = [ map($x0 * $_, @$yv) ];\\n bless [$x0 * $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\\n}\\n\\nsub _div ($x, $y, $) {\\n my ($x0, $y0) = ( mean($x), mean($y));\\n my ($xv, $yv) = (vlist($x), vlist($y));\\n $xv = [ map($_/$y0, @$xv) ];\\n $yv = [ map($x0 * $_/$y0/$y0, @$yv) ];\\n bless [$x0 / $y0, zip sub ($a,$b) {$a + $b}, $xv, $yv]\\n}\\n\\nsub _sqrt ($x, $, $) {\\n my ($x0, $xv) = ( mean($x), vlist($x) );\\n $x0 = sqrt($x0);\\n $xv = [ map($_ / 2 / $x0, @$xv) ];\\n bless [$x0, $xv]\\n}\\n\\nsub _pow ($x, $y, $) {\\n if ($x < 0) {\\n die \\\"Can't take pow of negative number $x\\\" if int($y) != $y or $y & 1;\\n $x = -$x;\\n }\\n exp($y * log $x)\\n}\\n\\nsub _exp ($x, $, $) {\\n my ($x0, $xv) = ( exp(mean($x)), vlist($x) );\\n bless [ $x0, [map($x0 * $_, @$xv) ] ]\\n}\\n\\nsub _log ($x, $, $) {\\n my ($x0, $xv) = ( mean($x), vlist($x) );\\n bless [ log($x0), [ map($_ / $x0, @$xv) ] ]\\n}\\n\\nsub _str { sprintf '%g±%.3g', $_[0][0], sigma($_[0]) }\\n\\npackage main;\\n\\nsub e { ErrVar::make @_ };\\n\\n# x1 is of mean value 100, containing error 1.1 from source 1, etc.\\n# all error sources are independent.\\nmy $x1 = e 100, [1.1, 0, 0, 0 ];\\nmy $x2 = e 200, [0, 2.2, 0, 0 ];\\nmy $y1 = e 50, [0, 0, 1.2, 0 ];\\nmy $y2 = e 100, [0, 0, 0, 2.3];\\n\\nmy $z1 = sqrt(($x1 - $x2) ** 2 + ($y1 - $y2) ** 2);\\nsay \\\"distance: $z1\\\";\\n\\n# this is not for task requirement\\nmy $a = $x1 + $x2;\\nmy $b = $y1 - 2 * $x2;\\nsay \\\"covariance between $a and $b: \\\", $a->covariance($b);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DELTA</span>\\n\\n <span style=\\\"color: #008080;\\\">type</span> <span style=\\\"color: #000000;\\\">imprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #004080;\\\">atom</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #004080;\\\">atom</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">type</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">a</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">imprecise_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">]))</span>\\n <span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ret</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">imprecise_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">]))</span>\\n <span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ret</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">imprecise_div</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">delta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">]))/</span><span style=\\\"color: #000000;\\\">sqr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ret</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">imprecise_pow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">delta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">DELTA</span><span style=\\\"color: #0000FF;\\\">]/</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">VALUE</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">ret</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">delta</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ret</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%g+/-%g\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">imp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000000;\\\">imprecise</span> <span style=\\\"color: #000000;\\\">x1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">50</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">x2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{-</span><span style=\\\"color: #000000;\\\">200</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">y2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{-</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.3</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">tmp1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tmp2</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">d</span>\\n\\n <span style=\\\"color: #000000;\\\">tmp1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">tmp1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_pow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">tmp2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">tmp2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_pow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tmp2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">imprecise_pow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Distance, d, between the following points :\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n( x1, y1) = ( %s, %s)\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n( x2, y2) = ( %s, %s)\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x2</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y2</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nis d = %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">printImprecise</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(scl 12)\\n(load \\\"@lib/math.l\\\")\\n\\n# Overload arithmetic operators +, -, *, / and **\\n(redef + @\\n (let R (next)\\n (while (args)\\n (let N (next)\\n (setq R\\n (if2 (atom R) (atom N)\\n (+ R N) # c + c\\n (cons (+ R (car N)) (cdr N)) # c + a\\n (cons (+ (car R) N) (cdr R)) # a + c\\n (cons # a + b\\n (+ (car R) (car N))\\n (+ (cdr R) (cdr N)) ) ) ) ) )\\n R ) )\\n\\n(redef - @\\n (let R (next)\\n (ifn (args)\\n (- R)\\n (while (args)\\n (let N (next)\\n (setq R\\n (if2 (atom R) (atom N)\\n (- R N) # c - c\\n (cons (- R (car N)) (cdr N)) # c - a\\n (cons (- (car R) N) (cdr R)) # a - c\\n (cons # a - b\\n (- (car R) (car N))\\n (+ (cdr R) (cdr N)) ) ) ) ) )\\n R ) ) )\\n\\n(redef * @\\n (let R (next)\\n (while (args)\\n (let N (next)\\n (setq R\\n (if2 (atom R) (atom N)\\n (* R N) # c * c\\n (cons # c * a\\n (*/ R (car N) 1.0)\\n (mul2div2 (cdr N) R 1.0) )\\n (cons # a * c\\n (*/ (car R) N 1.0)\\n (mul2div2 (cdr R) N 1.0) )\\n (uncMul (*/ (car R) (car N) 1.0) R N) ) ) ) ) # a * b\\n R ) )\\n\\n(redef / @\\n (let R (next)\\n (while (args)\\n (let N (next)\\n (setq R\\n (if2 (atom R) (atom N)\\n (/ R N) # c / c\\n (cons # c / a\\n (*/ R 1.0 (car N))\\n (mul2div2 (cdr N) R 1.0) )\\n (cons # a / c\\n (*/ (car R) 1.0 N)\\n (mul2div2 (cdr R) N 1.0) )\\n (uncMul (*/ (car R) 1.0 (car N)) R N) ) ) ) ) # a / b\\n R ) )\\n\\n(redef ** (A C)\\n (if (atom A)\\n (** A C)\\n (let F (pow (car A) C)\\n (cons F\\n (mul2div2 (cdr A) (*/ F C (car A)) 1.0) ) ) ) )\\n\\n# Utilities\\n(de mul2div2 (A B C)\\n (*/ A B B (* C C)) )\\n\\n(de uncMul (F R N)\\n (cons F\\n (mul2div2\\n (+\\n (mul2div2 (cdr R) 1.0 (car R))\\n (mul2div2 (cdr N) 1.0 (car N)) )\\n F\\n 1.0 ) ) )\\n\\n# I/O conversion\\n(de unc (N U)\\n (if U\\n (cons N (*/ U U 1.0))\\n (pack\\n (round (car N) 10)\\n \\\" ± \\\"\\n (round (sqrt (cdr N) 1.0) 8) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(de distance (X1 Y1 X2 Y2)\\n (**\\n (+ (** (- X1 X2) 2.0) (** (- Y1 Y2) 2.0))\\n 0.5 ) )\\n\\n(prinl \\\"Distance: \\\"\\n (unc\\n (distance\\n (unc 100. 1.1)\\n (unc 50. 1.2)\\n (unc 200. 2.2)\\n (unc 100. 2.3) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"from collections import namedtuple\\nimport math\\n\\nclass I(namedtuple('Imprecise', 'value, delta')):\\n 'Imprecise type: I(value=0.0, delta=0.0)'\\n\\n __slots__ = ()\\n\\n def __new__(_cls, value=0.0, delta=0.0):\\n 'Defaults to 0.0 ± delta'\\n return super().__new__(_cls, float(value), abs(float(delta)))\\n\\n def reciprocal(self):\\n return I(1. / self.value, self.delta / (self.value**2))\\n\\n def __str__(self):\\n 'Shorter form of Imprecise as string'\\n return 'I(%g, %g)' % self\\n\\n def __neg__(self):\\n return I(-self.value, self.delta)\\n\\n def __add__(self, other):\\n if type(other) == I:\\n return I( self.value + other.value, (self.delta**2 + other.delta**2)**0.5 )\\n try:\\n c = float(other)\\n except:\\n return NotImplemented\\n return I(self.value + c, self.delta)\\n\\n def __sub__(self, other):\\n return self + (-other)\\n\\n def __radd__(self, other):\\n return I.__add__(self, other)\\n\\n def __mul__(self, other):\\n if type(other) == I:\\n #if id(self) == id(other):\\n # return self ** 2\\n a1,b1 = self\\n a2,b2 = other\\n f = a1 * a2\\n return I( f, f * ( (b1 / a1)**2 + (b2 / a2)**2 )**0.5 )\\n try:\\n c = float(other)\\n except:\\n return NotImplemented\\n return I(self.value * c, self.delta * c)\\n\\n def __pow__(self, other):\\n if type(other) == I:\\n return NotImplemented\\n try:\\n c = float(other)\\n except:\\n return NotImplemented\\n f = self.value ** c\\n return I(f, f * c * (self.delta / self.value))\\n\\n def __rmul__(self, other):\\n return I.__mul__(self, other)\\n\\n def __truediv__(self, other):\\n if type(other) == I:\\n return self.__mul__(other.reciprocal())\\n try:\\n c = float(other)\\n except:\\n return NotImplemented\\n return I(self.value / c, self.delta / c)\\n\\n def __rtruediv__(self, other):\\n return other * self.reciprocal()\\n\\n __div__, __rdiv__ = __truediv__, __rtruediv__\\n\\nImprecise = I\\n\\ndef distance(p1, p2):\\n x1, y1 = p1\\n x2, y2 = p2\\n return ((x1 - x2)**2 + (y1 - y2)**2)**0.5\\n\\nx1 = I(100, 1.1)\\nx2 = I(200, 2.2)\\ny1 = I( 50, 1.2)\\ny2 = I(100, 2.3)\\n\\np1, p2 = (x1, y1), (x2, y2)\\nprint(\\\"Distance between points\\\\n p1: %s\\\\n and p2: %s\\\\n = %r\\\" % (\\n p1, p2, distance(p1, p2)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(struct ± (x dx) #:transparent\\n #:methods gen:custom-write\\n [(define (write-proc a port mode) (display (±->string a) port))])\\n\\n(define/match (±+ a [b 0])\\n [((± x dx) (± y dy)) (± (+ x y) (norm dx dy))]\\n [((± x dx) c) (± (+ x c) dx)]\\n [(_ (± y dy)) (±+ b a)])\\n\\n(define/match (±* a b)\\n [((± x dx) (± y dy)) (± (* x y) (* x y (norm (/ dx x) (/ dy y))))]\\n [((± x dx) c) (± (* x c) (abs (* c dx)))]\\n [(_ (± y dy)) (±* b a)])\\n\\n(define/match (±- a [b #f])\\n [(a #f) (±* -1 a)]\\n [(a b) (±+ a (±* -1 b))])\\n\\n(define/match (±/ a b)\\n [((± x dx) (± y dy)) (± (/ x y) (/ x y (norm (/ dx x) (/ dy y))))]\\n [((± _ _) c) (±* a (/ 1 c))])\\n\\n(define/match (±expt a c)\\n [((± x dx) c) (± (expt x c) (abs (* (expt x c) (/ dx x))))])\\n\\n(define/match (norm a b)\\n [((± x dx) (± y dy)) (±expt (±+ (±expt a 2) (±expt b 2)) 0.5)]\\n [(x y) (sqrt (+ (sqr x) (sqr y)))])\\n\\n(define/match (±->string x [places 3])\\n [((± x dx) p) (string-join (map (λ (s) (real->decimal-string s p))\\n (list x dx))\\\" ± \\\")])\\n\\n;; Test\\n;;\\n(define x1 (± 100 1.1))\\n(define y1 (± 50 1.2))\\n(define x2 (± 200 2.2))\\n(define y2 (± 100 2.3))\\n(norm (±- x1 x2) (±- y1 y2))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# cache of independent sources so we can make them all the same length.\\n# (Because Raku does not yet have a longest-zip metaoperator.)\\nmy @INDEP;\\n\\nclass Approx does Numeric {\\n has Real $.x;\\t# The mean.\\n has $.c;\\t\\t# The components of error.\\n\\n multi method Str { sprintf \\\"%g±%.3g\\\", $!x, $.σ }\\n multi method Bool { abs($!x) > $.σ }\\n\\n method variance { [+] @.c X** 2 }\\n method σ { sqrt self.variance }\\n}\\n\\nmulti approx($x,$c) { Approx.new: :$x, :$c }\\nmulti approx($x) { Approx.new: :$x, :c[0 xx +@INDEP] }\\n\\n# Each ± gets its own source slot.\\nmulti infix:<±>($a, $b) {\\n .push: 0 for @INDEP; # lengthen older component lists\\n my $c = [ flat 0 xx @INDEP, $b ];\\n @INDEP.push: $c;\\t # add new component list\\n\\n approx $a, $c;\\n}\\n\\nmulti prefix:<->(Approx $a) { approx -$a.x, [$a.c.map: -*] }\\n\\nmulti infix:<+>($a, Approx $b) { approx($a) + $b }\\nmulti infix:<+>(Approx $a, $b) { $a + approx($b) }\\nmulti infix:<+>(Approx $a, Approx $b) { approx $a.x + $b.x, [$a.c Z+ $b.c] }\\n\\nmulti infix:<->($a, Approx $b) { approx($a) - $b }\\nmulti infix:<->(Approx $a, $b) { $a - approx($b) }\\nmulti infix:<->(Approx $a, Approx $b) { approx $a.x - $b.x, [$a.c Z- $b.c] }\\n\\nmulti covariance(Real $a, Real $b) { 0 }\\nmulti covariance(Approx $a, Approx $b) { [+] $a.c Z* $b.c }\\n\\nmulti infix:«<=>»(Approx $a, Approx $b) { $a.x <=> $b.x }\\nmulti infix:<cmp>(Approx $a, Approx $b) { $a.x <=> $b.x }\\n\\nmulti infix:<*>($a, Approx $b) { approx($a) * $b }\\nmulti infix:<*>(Approx $a, $b) { $a * approx($b) }\\nmulti infix:<*>(Approx $a, Approx $b) {\\n approx $a.x * $b.x,\\n [$a.c.map({$b.x * $_}) Z+ $b.c.map({$a.x * $_})];\\n}\\n\\nmulti infix:</>($a, Approx $b) { approx($a) / $b }\\nmulti infix:</>(Approx $a, $b) { $a / approx($b) }\\nmulti infix:</>(Approx $a, Approx $b) {\\n approx $a.x / $b.x,\\n [ $a.c.map({ $_ / $b.x }) Z+ $b.c.map({ $a.x * $_ / $b.x / $b.x }) ];\\n}\\n\\nmulti sqrt(Approx $a) {\\n my $x = sqrt($a.x);\\n approx $x, [ $a.c.map: { $_ / 2 / $x } ];\\n}\\n\\nmulti infix:<**>(Approx $a, Real $b) { $a ** approx($b) }\\nmulti infix:<**>(Approx $a is copy, Approx $b) {\\n\\tmy $ax = $a.x;\\n\\tmy $bx = $b.x;\\n\\tmy $fbx = floor $b.x;\\n\\tif $ax < 0 {\\n\\t if $fbx != $bx or $fbx +& 1 {\\n\\t\\tdie \\\"Can't take power of negative number $ax\\\";\\n\\t }\\n\\t $a = -$a;\\n\\t}\\n\\texp($b * log $a);\\n}\\n\\nmulti exp(Approx $a) {\\n\\tmy $x = exp($a.x);\\n\\tapprox $x, [ $a.c.map: { $x * $_ } ];\\n}\\n\\nmulti log(Approx $a) {\\n\\tmy $x0 = $a.x;\\n\\tapprox log($x0), [ $a.c.map: { $_ / $x0 }];\\n}\\n\\n# Each ± sets up an independent source component.\\nmy $x1 = 100 ± 1.1;\\nmy $x2 = 200 ± 2.2;\\nmy $y1 = 50 ± 1.2;\\nmy $y2 = 100 ± 2.3;\\n\\n# The standard task.\\nmy $z1 = sqrt(($x1 - $x2) ** 2 + ($y1 - $y2) ** 2);\\nsay \\\"distance: $z1\\\\n\\\";\\n\\n# Just showing off.\\nmy $a = $x1 + $x2;\\nmy $b = $y1 - 2 * $x2;\\nsay \\\"covariance between $a and $b: \\\", covariance($a,$b);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program calculates the distance between two points (2D) with error propagation. */\\nparse arg a b . /*obtain arguments from the CL*/\\nif a=='' | a==\\\",\\\" then a= '100±1.1, 50±1.2' /*Not given? Then use default.*/\\nif b=='' | b==\\\",\\\" then b= '200±2.2, 100±2.3' /* \\\" \\\" \\\" \\\" \\\" */\\nparse var a ax ',' ay; parse var b bx ',' by /*obtain X,Y from A & B point.*/\\nparse var ax ax '±' axe; parse var bx bx '±' bxE /* \\\" err \\\" Ax and Bx.*/\\nparse var ay ay '±' aye; parse var by by '±' byE /* \\\" \\\" \\\" Ay \\\" By.*/\\nif axE=='' then axE= 0; if bxE==\\\"\\\" then bxE= 0 /*No error? Then use default.*/\\nif ayE=='' then ayE= 0; if byE==\\\"\\\" then byE= 0 /* \\\" \\\" \\\" \\\" \\\" */\\n say ' A point (x,y)= ' ax \\\"±\\\" axE', ' ay \\\"±\\\" ayE /*display A point (with err)*/\\n say ' B point (x.y)= ' bx \\\"±\\\" bxE', ' by \\\"±\\\" byE /* \\\" B \\\" \\\" \\\" */\\n say /*blank line for the eyeballs.*/\\ndx= ax-bx; dxE= sqrt(axE**2 + bxE**2); xe= #(dx, 2, dxE) /*compute X distances (& err)*/\\ndy= ay-by; dyE= sqrt(ayE**2 + byE**2); ye= #(dy, 2, dyE) /* \\\" Y \\\" \\\" \\\" */\\nD= sqrt(dx**2 + dy**2) /*compute the 2D distance. */\\n say 'distance=' D \\\"±\\\" #(D**2, .5, sqrt(xE**2 + yE**2)) /*display \\\" \\\" \\\" */\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n#: procedure; arg x,p,e; if p=.5 then z=1/sqrt(abs(x)); else z=abs(x)**(p-1); return p*e*z\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\\n numeric form; parse value format(x,2,1,,0) 'E0' with g \\\"E\\\" _ .; g=g * .5'e'_ % 2\\n m.=9; do j=0 while h>9; m.j=h; h=h%2+1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g=(g+x/g)*.5; end /*k*/\\n numeric digits d; return g/1\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsqrt: procedure; parse arg x; if x=0 then return 0; d=digits(); numeric digits; h=d+6\\n numeric form; parse value format(x,2,1,,0) 'E0' with g \\\"E\\\" _ .; g= g * .5'e'_ % 2\\n m.= 9; do j=0 while h>9; m.j= h; h= h%2+1; end /*j*/\\n do k=j+5 to 0 by -1; numeric digits m.k; g= (g+x/g)*.5; end /*k*/\\n numeric digits d; return g/1\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"class NumberWithUncertainty\\n def initialize(number, error)\\n @num = number\\n @err = error.abs\\n end\\n attr_reader :num, :err\\n\\n def +(other)\\n if other.kind_of?(self.class)\\n self.class.new(num + other.num, Math::hypot(err, other.err))\\n else\\n self.class.new(num + other, err)\\n end\\n end\\n\\n def -(other)\\n if other.kind_of?(self.class)\\n self.class.new(num - other.num, Math::hypot(err, other.err))\\n else\\n self.class.new(num - other, err)\\n end\\n end\\n\\n def *(other)\\n if other.kind_of?(self.class)\\n prod = num * other.num\\n e = Math::hypot((prod * err / num), (prod * other.err / other.num))\\n self.class.new(prod, e)\\n else\\n self.class.new(num * other, (err * other).abs)\\n end\\n end\\n\\n def /(other)\\n if other.kind_of?(self.class)\\n quo = num / other.num\\n e = Math::hypot((quo * err / num), (quo * other.err / other.num))\\n self.class.new(quo, e)\\n else\\n self.class.new(num / other, (err * other).abs)\\n end\\n end\\n\\n def **(exponent)\\n Float(exponent) rescue raise ArgumentError, \\\"not an number: #{exponent}\\\"\\n prod = num ** exponent\\n self.class.new(prod, (prod * exponent * err / num).abs)\\n end\\n\\n def sqrt\\n self ** 0.5\\n end\\n\\n def to_s\\n \\\"#{num} \\\\u00b1 #{err}\\\"\\n end\\nend\\n\\nx1 = NumberWithUncertainty.new(100, 1.1)\\ny1 = NumberWithUncertainty.new( 50, 1.2)\\nx2 = NumberWithUncertainty.new(200, 2.2)\\ny2 = NumberWithUncertainty.new(100, 2.3)\\n\\nputs ((x1 - x2) ** 2 + (y1 - y2) ** 2).sqrt\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import java.lang.Math._\\n\\nclass Approx(val ν: Double, val σ: Double = 0.0) {\\n def this(a: Approx) = this(a.ν, a.σ)\\n def this(n: Number) = this(n.doubleValue(), 0.0)\\n\\n override def toString = s\\\"$ν ±$σ\\\"\\n\\n def +(a: Approx) = Approx(ν + a.ν, sqrt(σ * σ + a.σ * a.σ))\\n def +(d: Double) = Approx(ν + d, σ)\\n def -(a: Approx) = Approx(ν - a.ν, sqrt(σ * σ + a.σ * a.σ))\\n def -(d: Double) = Approx(ν - d, σ)\\n\\n def *(a: Approx) = {\\n val v = ν * a.ν\\n Approx(v, sqrt(v * v * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\\n }\\n\\n def *(d: Double) = Approx(ν * d, abs(d * σ))\\n\\n def /(a: Approx) = {\\n val t = ν / a.ν\\n Approx(t, sqrt(t * t * σ * σ / (ν * ν) + a.σ * a.σ / (a.ν * a.ν)))\\n }\\n\\n def /(d: Double) = Approx(ν / d, abs(d * σ))\\n\\n def ^(d: Double) = {\\n val t = pow(ν, d)\\n Approx(t, abs(t * d * σ / ν))\\n }\\n}\\n\\nobject Approx { def apply(ν: Double, σ: Double = 0.0) = new Approx(ν, σ) }\\n\\nobject NumericError extends App {\\n def √(a: Approx) = a^0.5\\n val x1 = Approx(100.0, 1.1)\\n val x2 = Approx(50.0, 1.2)\\n val y1 = Approx(200.0, 2.2)\\n val y2 = Approx(100.0, 2.3)\\n println(√(((x1 - x2)^2.0) + ((y1 - y2)^2.0))) // => 111.80339887498948 ±2.938366893361004\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import Foundation\\n\\nprecedencegroup ExponentiationGroup {\\n higherThan: MultiplicationPrecedence\\n}\\n\\ninfix operator ** : ExponentiationGroup\\ninfix operator ±\\n\\nfunc ±(_ lhs: Double, _ rhs: Double) -> UncertainDouble { UncertainDouble(value: lhs, error: rhs) }\\n\\nstruct UncertainDouble {\\n var value: Double\\n var error: Double\\n\\n static func +(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value + rhs.value, error: pow(pow(lhs.error, 2) + pow(rhs.error, 2), 0.5))\\n }\\n\\n static func +(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value + rhs, error: lhs.error)\\n }\\n\\n static func -(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value - rhs.value, error: pow(pow(lhs.error, 2) + pow(rhs.error, 2), 0.5))\\n }\\n\\n static func -(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value - rhs, error: lhs.error)\\n }\\n\\n static func *(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\\n let val = lhs.value * rhs.value\\n\\n return UncertainDouble(\\n value: val,\\n error: pow(pow(val, 2) * (pow(lhs.error / lhs.value, 2) + pow(rhs.error / rhs.value, 2)), 0.5)\\n )\\n }\\n\\n static func *(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value * rhs, error: abs(lhs.error * rhs))\\n }\\n\\n static func /(_ lhs: UncertainDouble, _ rhs: UncertainDouble) -> UncertainDouble {\\n let val = lhs.value / rhs.value\\n\\n return UncertainDouble(\\n value: val,\\n error: pow(val, 2) * (pow(lhs.error / lhs.value, 2) + pow(rhs.error / rhs.value, 2))\\n )\\n }\\n\\n static func /(_ lhs: UncertainDouble, _ rhs: Double) -> UncertainDouble {\\n return UncertainDouble(value: lhs.value / rhs, error: abs(lhs.error * rhs))\\n }\\n\\n static func **(_ lhs: UncertainDouble, _ power: Double) -> UncertainDouble {\\n let val = pow(lhs.value, power)\\n\\n return UncertainDouble(value: val, error: abs((val * power) * (lhs.error / lhs.value)))\\n }\\n}\\n\\nextension UncertainDouble: CustomStringConvertible {\\n public var description: String { \\\"\\\\(value) ± \\\\(error)\\\" }\\n}\\n\\nlet (x1, y1) = (100 ± 1.1, 50 ± 1.2)\\nlet (x2, y2) = (200 ± 2.2, 100 ± 2.3)\\n\\nlet d = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\\n\\nprint(d)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.6\\noo::class create RAII-support {\\n constructor {} {\\n\\tupvar 1 { end } end\\n\\tlappend end [self]\\n\\ttrace add variable end unset [namespace code {my DieNicely}]\\n }\\n destructor {\\n\\tcatch {\\n\\t upvar 1 { end } end\\n\\t trace remove variable end unset [namespace code {my DieNicely}]\\n\\t}\\n }\\n method return {{level 1}} {\\n\\tincr level\\n\\tupvar 1 { end } end\\n\\tupvar $level { end } parent\\n\\ttrace remove variable end unset [namespace code {my DieNicely}]\\n\\tlappend parent [self]\\n\\ttrace add variable parent unset [namespace code {my DieNicely}]\\n\\treturn -level $level [self]\\n }\\n # Swallows arguments\\n method DieNicely args {tailcall my destroy}\\n}\\noo::class create RAII-class {\\n superclass oo::class\\n method return args {\\n\\t[my new {*}$args] return 2\\n }\\n method unknown {m args} {\\n\\tif {[string is double -strict $m]} {\\n\\t return [tailcall my new $m {*}$args]\\n\\t}\\n\\tnext $m {*}$args\\n }\\n unexport create unknown\\n self method create args {\\n\\tset c [next {*}$args]\\n\\too::define $c superclass {*}[info class superclass $c] RAII-support\\n\\treturn $c\\n }\\n}\\n# Makes a convenient scope for limiting RAII lifetimes\\nproc scope {script} {\\n foreach v [info global] {\\n\\tif {[array exists ::$v] || [string match { * } $v]} continue\\n\\tlappend vars $v\\n\\tlappend vals [set ::$v]\\n }\\n tailcall apply [list $vars [list \\\\\\n\\ttry $script on ok msg {$msg return}\\n ] [uplevel 1 {namespace current}]] {*}$vals\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"RAII-class create Err {\\n variable N E\\n constructor {number {error 0.0}} {\\n\\tnext\\n\\tnamespace import ::tcl::mathfunc::* ::tcl::mathop::*\\n\\tvariable N $number E [abs $error]\\n }\\n method p {} {\\n\\treturn \\\"$N \\\\u00b1 $E\\\"\\n }\\n\\n method n {} { return $N }\\n method e {} { return $E }\\n\\n method + e {\\n\\tif {[info object isa object $e]} {\\n\\t Err return [+ $N [$e n]] [hypot $E [$e e]]\\n\\t} else {\\n\\t Err return [+ $N $e] $E\\n\\t}\\n }\\n method - e {\\n\\tif {[info object isa object $e]} {\\n\\t Err return [- $N [$e n]] [hypot $E [$e e]]\\n\\t} else {\\n\\t Err return [- $N $e] $E\\n\\t}\\n }\\n method * e {\\n\\tif {[info object isa object $e]} {\\n\\t set f [* $n [$E n]]\\n\\t Err return $f [expr {hypot($E*$f/$N, [$e e]*$f/[$e n])}]\\n\\t} else {\\n\\t Err return [* $N $e] [abs [* $E $e]]\\n\\t}\\n }\\n method / e {\\n\\tif {[info object isa object $e]} {\\n\\t set f [/ $n [$E n]]\\n\\t Err return $f [expr {hypot($E*$f/$N, [$e e]*$f/[$e n])}]\\n\\t} else {\\n\\t Err return [/ $N $e] [abs [/ $E $e]]\\n\\t}\\n }\\n method ** c {\\n\\tset f [** $N $c]\\n\\tErr return $f [abs [* $f $c [/ $E $N]]]\\n }\\n\\n export + - * / **\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set x1 [Err 100 1.1]\\nset x2 [Err 200 2.2]\\nset y1 [Err 50 1.2]\\nset y2 [Err 100 2.3]\\n# Evaluate in a local context to clean up intermediate objects\\nset d [scope {\\n [[[$x1 - $x2] ** 2] + [[$y1 - $y2] ** 2]] ** 0.5\\n}]\\nputs \\\"d = [$d p]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"class Approx {\\n construct new(nu, sigma) {\\n _nu = nu\\n _sigma = sigma\\n }\\n\\n static new(a) {\\n if (a is Approx) return Approx.new(a.nu, a.sigma)\\n if (a is Num) return Approx.new(a, 0)\\n }\\n\\n nu { _nu }\\n sigma { _sigma }\\n\\n +(a) {\\n if (a is Approx) return Approx.new(_nu + a.nu, (_sigma *_sigma + a.sigma*a.sigma).sqrt)\\n if (a is Num) return Approx.new(_nu + a, _sigma)\\n }\\n\\n -(a) {\\n if (a is Approx) return Approx.new(_nu - a.nu, (_sigma *_sigma + a.sigma*a.sigma).sqrt)\\n if (a is Num) return Approx.new(_nu - a, _sigma)\\n }\\n\\n *(a) {\\n if (a is Approx) {\\n var v = _nu * a.nu\\n return Approx.new(v, (v*v*_sigma*_sigma/(_nu*_nu) + a.sigma*a.sigma/(a.nu*a.nu)).sqrt)\\n }\\n if (a is Num) return Approx.new(_nu*a, (a*_sigma).abs)\\n }\\n\\n /(a) {\\n if (a is Approx) {\\n var v = _nu / a.nu\\n return Approx.new(v, (v*v*_sigma*_sigma/(_nu*_nu) + a.sigma*a.sigma/(a.nu*a.nu)).sqrt)\\n }\\n if (a is Num) return Approx.new(_nu/a, (a*_sigma).abs)\\n }\\n\\n pow(d) {\\n var v = _nu.pow(d)\\n return Approx.new(v, (v*d*_sigma/_nu).abs)\\n }\\n\\n toString { \\\"%(_nu) ±%(_sigma)\\\" }\\n}\\n\\nvar x1 = Approx.new(100, 1.1)\\nvar y1 = Approx.new( 50, 1.2)\\nvar x2 = Approx.new(200, 2.2)\\nvar y2 = Approx.new(100, 2.3)\\nSystem.print(((x1 - x2).pow(2) + (y1 - y2).pow(2)).pow(0.5))\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Numeric-error-propagation"}}},{"rowIdx":1456,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes\n","language":"00-META"},{"code":"This task is about expressing numbers with an attached (abutted) suffix multiplier(s), the suffix(es) could be:\n::* an alphabetic (named) multiplier which could be abbreviated\n::* metric multiplier(s) which can be specified multiple times\n::* \"binary\" multiplier(s) which can be specified multiple times\n::* explanation marks (<big>'''!'''</big>) which indicate a factorial or multifactorial\n\n\nThe (decimal) numbers can be expressed generally as:\n {<big>±</big>} {digits} {'''.'''} {digits}\n ────── or ──────\n {<big>±</big>} {digits} {'''.'''} {digits} {'''E''' <small>or</small> '''e'''} {<big>±</big>} {digits}\n\nwhere:\n::* numbers won't have embedded blanks (contrary to the expaciated examples above where whitespace was used for readability)\n::* this task will only be dealing with decimal numbers, both in the ''mantissa'' and ''exponent''\n::* <big>±</big> indicates an optional plus or minus sign (<big>'''+'''</big> <small>or</small> <big>'''-'''</big>)\n::* digits are the decimal digits ('''0''' ──► '''9''')\n::* the digits can have comma(s) interjected to separate the ''periods'' (thousands) such as: '''12,467,000'''\n::* '''.''' is the decimal point, sometimes also called a ''dot''\n::* '''e''' or '''E''' denotes the use of decimal exponentiation (a number multiplied by raising ten to some power)\n\n\nThis isn't a pure or perfect definition of the way we express decimal numbers, but it should convey the intent for this task.\n\nThe use of the word ''periods'' (thousands) is not meant to confuse, that word (as used above) is what the '''comma''' separates;\n<br>the groups of decimal digits are called ''periods'', and in almost all cases, are groups of three decimal digits.\n\nIf an '''e''' or '''E''' is specified, there must be a legal number expressed before it, and there must be a legal (exponent) expressed after it.\n\nAlso, there must be some digits expressed in all cases, not just a sign and/or decimal point.\n\nSuperfluous signs, decimal points, exponent numbers, and zeros need not be preserved.\n\nI.E.: \n'''+7''' '''007''' '''7.00''' '''7E-0''' '''7E000''' '''70e-1''' could all be expressed as '''7'''\n\nAll numbers to be \"expanded\" can be assumed to be valid and there won't be a requirement to verify their validity.\n\n\n;Abbreviated alphabetic suffixes to be supported (where the capital letters signify the minimum abbreation that can be used):\n '''PAIRs''' multiply the number by '''2''' (as in pairs of shoes or pants)\n '''SCOres''' multiply the number by '''20''' (as '''3score''' would be '''60''')\n '''DOZens''' multiply the number by '''12'''\n '''GRoss''' multiply the number by '''144''' (twelve dozen)\n '''GREATGRoss''' multiply the number by '''1,728''' (a dozen gross)\n '''GOOGOLs''' multiply the number by '''10^100''' (ten raised to the 100&sup>th</sup> power)\n\n\nNote that the plurals are supported, even though they're usually used when expressing exact numbers (She has 2 dozen eggs, and dozens of quavas)\n\n\n;Metric suffixes to be supported (whether or not they're officially sanctioned):\n '''K''' multiply the number by '''10^3''' kilo (1,000)\n '''M''' multiply the number by '''10^6''' mega (1,000,000)\n '''G''' multiply the number by '''10^9''' giga (1,000,000,000)\n '''T''' multiply the number by '''10^12''' tera (1,000,000,000,000)\n '''P''' multiply the number by '''10^15''' peta (1,000,000,000,000,000)\n '''E''' multiply the number by '''10^18''' exa (1,000,000,000,000,000,000)\n '''Z''' multiply the number by '''10^21''' zetta (1,000,000,000,000,000,000,000)\n '''Y''' multiply the number by '''10^24''' yotta (1,000,000,000,000,000,000,000,000)\n '''X''' multiply the number by '''10^27''' xenta (1,000,000,000,000,000,000,000,000,000)\n '''W''' multiply the number by '''10^30''' wekta (1,000,000,000,000,000,000,000,000,000,000)\n '''V''' multiply the number by '''10^33''' vendeka (1,000,000,000,000,000,000,000,000,000,000,000)\n '''U''' multiply the number by '''10^36''' udekta (1,000,000,000,000,000,000,000,000,000,000,000,000)\n\n\n;Binary suffixes to be supported (whether or not they're officially sanctioned):\n '''Ki''' multiply the number by '''2^10''' kibi (1,024)\n '''Mi''' multiply the number by '''2^20''' mebi (1,048,576)\n '''Gi''' multiply the number by '''2^30''' gibi (1,073,741,824)\n '''Ti''' multiply the number by '''2^40''' tebi (1,099,571,627,776)\n '''Pi''' multiply the number by '''2^50''' pebi (1,125,899,906,884,629)\n '''Ei''' multiply the number by '''2^60''' exbi (1,152,921,504,606,846,976)\n '''Zi''' multiply the number by '''2^70''' zeb1 (1,180,591,620,717,411,303,424)\n '''Yi''' multiply the number by '''2^80''' yobi (1,208,925,819,614,629,174,706,176)\n '''Xi''' multiply the number by '''2^90''' xebi (1,237,940,039,285,380,274,899,124,224)\n '''Wi''' multiply the number by '''2^100''' webi (1,267,650,600,228,229,401,496,703,205,376)\n '''Vi''' multiply the number by '''2^110''' vebi (1,298,074,214,633,706,907,132,624,082,305,024)\n '''Ui''' multiply the number by '''2^120''' uebi (1,329,227,995,784,915,872,903,807,060,280,344,576)\n\n\nAll of the metric and binary suffixes can be expressed in lowercase, uppercase, ''or'' mixed case.\n\nAll of the metric and binary suffixes can be ''stacked'' (expressed multiple times), and also be intermixed:\n<br>I.E.: '''123k''' '''123K''' '''123GKi''' '''12.3GiGG''' '''12.3e-7T''' '''.78E100e'''\n \n\n;Factorial suffixes to be supported:\n '''!''' compute the (regular) factorial product: '''5!''' is '''5''' × '''4''' × '''3''' × '''2''' × '''1''' = '''120'''\n '''!!''' compute the double factorial product: '''8!''' is '''8''' × '''6''' × '''4''' × '''2''' = '''384'''\n '''!!!''' compute the triple factorial product: '''8!''' is '''8''' × '''5''' × '''2''' = '''80'''\n '''!!!!''' compute the quadruple factorial product: '''8!''' is '''8''' × '''4''' = '''32'''\n '''!!!!!''' compute the quintuple factorial product: '''8!''' is '''8''' × '''3''' = '''24'''\n ··· the number of factorial symbols that can be specified is to be unlimited (as per what can be entered/typed) ···\n\n\nFactorial suffixes aren't, of course, the usual type of multipliers, but are used here in a similar vein.\n\n\nMultifactorials aren't to be confused with ''super─factorials'' where '''(4!)!''' would be '''(24)!'''.\n\n\n\n;Task:\n::* Using the test cases (below), show the \"expanded\" numbers here, on this page.\n::* For each list, show the input on one line, and also show the output on one line.\n::* When showing the input line, keep the spaces (whitespace) and case (capitalizations) as is.\n::* For each result (list) displayed on one line, separate each number with two blanks.\n::* Add commas to the output numbers were appropriate.\n\n\n;Test cases:\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\n 1,567 +1.567k 0.1567e-2m\n 25.123kK 25.123m 2.5123e-00002G\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\n -.25123e-34Vikki 2e-77gooGols\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n\nwhere the last number for the factorials has nine factorial symbols (<big>'''!'''</big>) after the '''9'''\n\n\n\n;Related tasks:\n* [[Multifactorial]] (which has a clearer and more succinct definition of multifactorials.)\n* [[Factorial]]\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"USING: combinators combinators.short-circuit formatting fry\ngrouping grouping.extras kernel literals math math.functions\nmath.parser math.ranges qw regexp sequences sequences.deep\nsequences.extras sets splitting unicode ;\nIN: rosetta-code.numerical-suffixes\n\nCONSTANT: test-cases {\n qw{ 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre }\n qw{ 1,567 +1.567k 0.1567e-2m }\n qw{ 25.123kK 25.123m 2.5123e-00002G }\n qw{ 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei }\n qw{ -.25123e-34Vikki 2e-77gooGols }\n qw{\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!!\n 9!!!!!!!!!\n }\n}\n\nCONSTANT: alpha {\n { \"PAIRs\" 2 } { \"DOZens\" 12 } { \"SCOres\" 20 }\n { \"GRoss\" 144 } { \"GREATGRoss\" 1,728 }\n ${ \"GOOGOLs\" 10 100 ^ }\n}\n\nCONSTANT: metric qw{ K M G T P E Z Y X W V U }\n\n! Multifactorial\n: m! ( n degree -- m ) neg 1 swap <range> product ;\n\n! Separate a number from its suffix(es).\n! e.g. \"+1.567k\" -> 1.567 \"k\"\n: num/suffix ( str -- n suffix(es) )\n dup <head-clumps> <reversed> { } like \"\" map-like\n [ string>number ] map [ ] find [ tail* ] dip swap ;\n\n! Checks whether str1 is an abbreviation of str2.\n! e.g. \"greatGRo\" \"GREATGRoss\" -> t\n: abbrev? ( str1 str2 -- ? )\n {\n [ [ >upper ] [ [ LETTER? ] take-while head? ] bi* ]\n [ [ length ] bi@ <= ]\n } 2&& ;\n\n! Convert an alpha suffix to its multiplication function.\n! e.g. \"Doz\" -> [ 12 * ]\n: alpha>quot ( str -- quot )\n [ alpha ] dip '[ first _ swap abbrev? ] find nip second\n [ * ] curry ;\n\n! Split a suffix composed of metric and binary suffixes into its\n! constituent parts. e.g. \"Vikki\" -> { \"Vi\" \"k\" \"ki\" }\n: split-compound ( str -- seq )\n R/ (.i|.)/i all-matching-subseqs ;\n\n! Convert a metric or binary suffix to its multiplication\n! function. e.g. \"k\" -> [ 10 3 ^ * ]\n: suffix>quot ( str -- quot )\n dup [ [ 0 1 ] dip subseq >upper metric index 1 + ] dip\n length 1 = [ 3 * '[ 10 _ ^ * ] ] [ 10 * '[ 2 _ ^ * ] ] if ;\n\n! Apply suffix>quot to each member of a sequence.\n! e.g. { \"Vi\" \"k\" \"ki\" } ->\n! [ [ 2 110 ^ * ] [ 10 3 ^ * ] [ 2 10 ^ * ] ]\n: map-suffix ( seq -- seq' ) [ suffix>quot ] [ ] map-as ;\n\n! Tests whether a string is composed of metric and/or binary\n! suffixes. e.g. \"Vikki\" -> t\n: compound? ( str -- ? )\n >upper metric concat \"I\" append without empty? ;\n\n! Convert a float to an integer if it is numerically equivalent\n! to an integer. e.g. 1.0 -> 1, 1.23 -> 1.23\n: ?f>i ( x -- y/n )\n dup >integer 2dup [ number= ] 2dip swap ? ;\n\n! Convert a suffix string to a function that performs the\n! calculations required by the suffix.\n! e.g. \"!!!\" -> [ 3 m! ], \"kiKI\" -> [ 2 10 ^ * 2 10 ^ * ]\n: parse-suffix ( str -- quot )\n {\n { [ dup empty? ] [ drop [ ] ] }\n { [ dup first CHAR: ! = ] [ length [ m! ] curry ] }\n { [ dup compound? ] [ split-compound map-suffix ] }\n [ alpha>quot ]\n } cond flatten ;\n\nGENERIC: commas ( n -- str )\n\n! Add commas to an integer in triplets.\n! e.g. 1567 -> \"1,567\"\nM: integer commas number>string <reversed> 3 group\n [ \",\" append ] map concat reverse rest ;\n\n! Add commas to a float in triplets.\n! e.g. 1567.12345 -> \"1,567.12345\"\nM: float commas number>string \".\" split first2\n [ string>number commas ] dip \".\" glue ;\n\n! Parse any number with any numerical or alphabetical suffix.\n! e.g. \"288Doz\" -> \"3,456\", \"9!!\" -> \"945\"\n: parse-alpha ( str -- str' )\n num/suffix parse-suffix curry call( -- x ) ?f>i commas ;\n\n: main ( -- )\n test-cases [\n dup [ parse-alpha ] map\n \"Numbers: %[%s, %]\\n Result: %[%s, %]\\n\\n\" printf\n ] each ;\n\nMAIN: main\n","language":"Factor"},{"code":"USING: formatting fry grouping kernel literals math\nmath.functions math.parser math.ranges multiline peg.ebnf\nquotations qw sequences sequences.deep splitting strings unicode ;\nIN: rosetta-code.numerical-suffixes.ebnf\n\nCONSTANT: test-cases {\n qw{ 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre }\n qw{ 1,567 +1.567k 0.1567e-2m }\n qw{ 25.123kK 25.123m 2.5123e-00002G }\n qw{ 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei }\n qw{ -.25123e-34Vikki 2e-77gooGols }\n qw{\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!!\n 9!!!!!!!!!\n }\n}\n\nCONSTANT: metric qw{ K M G T P E Z Y X W V U }\n\n: suffix>quot ( str -- quot )\n dup [ [ 0 1 ] dip subseq >upper metric index 1 + ] dip\n length 1 = [ 3 * '[ 10 _ ^ * ] ] [ 10 * '[ 2 _ ^ * ] ] if ;\n\n: ?f>i ( x -- y/n ) dup >integer 2dup [ number= ] 2dip swap ? ;\n\nGENERIC: commas ( n -- str )\nM: integer commas number>string <reversed> 3 group\n [ \",\" append ] map concat reverse rest ;\n\nM: float commas number>string \".\" split first2\n [ string>number commas ] dip \".\" glue ;\n\nEBNF: suffix-num [=[\n sign = [+-]\n digit = [0-9]\n triplet = digit digit digit\n commas = (triplet | digit digit | digit) ([,] triplet)+\n integer = sign? (commas | digit+)\n exp = [Ee] sign? digit+\n bfloat = (integer | sign)? [.] digit+ exp?\n float = (bfloat | integer exp)\n number = (float | integer) => [[ flatten \"\" like string>number ]]\n pairs = [Pp] [Aa] [Ii] [Rr] [s]? => [[ [ 2 * ] ]]\n dozens = [Dd] [Oo] [Zz] [e]? [n]? [s]? => [[ [ 12 * ] ]]\n scores = [Ss] [Cc] [Oo] [r]? [e]? [s]? => [[ [ 20 * ] ]]\n gross = [Gg] [Rr] [o]? [s]? [s]? => [[ [ 144 * ] ]]\n gg = [Gg] [Rr] [Ee] [Aa] [Tt] gross => [[ [ 1728 * ] ]]\n googols = [Gg] [Oo] [Oo] [Gg] [Oo] [Ll] [s]? => [[ [ $[ 10 100 ^ ] * ] ]]\n alpha = (pairs | dozens | scores | gg | gross | googols)\n numeric = ([KkMmGgPpEeT-Zt-z] [Ii]?) => [[ flatten \"\" like suffix>quot ]]\n ncompnd = numeric+\n fact = [!]+ => [[ length [ neg 1 swap <range> product ] curry ]]\n suffix = (alpha | ncompnd | fact)\n s-num = number suffix? !(.) =>\n [[ >quotation flatten call( -- x ) ?f>i commas ]]\n]=]\n\n: num-alpha-suffix-demo ( -- )\n test-cases [\n dup [ suffix-num ] map\n \"Numbers: %[%s, %]\\n Result: %[%s, %]\\n\\n\" printf\n ] each ;\n\nMAIN: num-alpha-suffix-demo\n","language":"Factor"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"math/big\"\n \"strconv\"\n \"strings\"\n)\n\ntype minmult struct {\n min int\n mult float64\n}\n\nvar abbrevs = map[string]minmult{\n \"PAIRs\": {4, 2}, \"SCOres\": {3, 20}, \"DOZens\": {3, 12},\n \"GRoss\": {2, 144}, \"GREATGRoss\": {7, 1728}, \"GOOGOLs\": {6, 1e100},\n}\n\nvar metric = map[string]float64{\n \"K\": 1e3, \"M\": 1e6, \"G\": 1e9, \"T\": 1e12, \"P\": 1e15, \"E\": 1e18,\n \"Z\": 1e21, \"Y\": 1e24, \"X\": 1e27, \"W\": 1e30, \"V\": 1e33, \"U\": 1e36,\n}\n\nvar binary = map[string]float64{\n \"Ki\": b(10), \"Mi\": b(20), \"Gi\": b(30), \"Ti\": b(40), \"Pi\": b(50), \"Ei\": b(60),\n \"Zi\": b(70), \"Yi\": b(80), \"Xi\": b(90), \"Wi\": b(100), \"Vi\": b(110), \"Ui\": b(120),\n}\n\nfunc b(e float64) float64 {\n return math.Pow(2, e)\n}\n\nfunc googol() *big.Float {\n g1 := new(big.Float).SetPrec(500)\n g1.SetInt64(10000000000)\n g := new(big.Float)\n g.Set(g1)\n for i := 2; i <= 10; i++ {\n g.Mul(g, g1)\n }\n return g\n}\n\nfunc fact(num string, d int) int {\n prod := 1\n n, _ := strconv.Atoi(num)\n for i := n; i > 0; i -= d {\n prod *= i\n }\n return prod\n}\n\nfunc parse(number string) *big.Float {\n bf := new(big.Float).SetPrec(500)\n t1 := new(big.Float).SetPrec(500)\n t2 := new(big.Float).SetPrec(500)\n // find index of last digit\n var i int\n for i = len(number) - 1; i >= 0; i-- {\n if '0' <= number[i] && number[i] <= '9' {\n break\n }\n }\n num := number[:i+1]\n num = strings.Replace(num, \",\", \"\", -1) // get rid of any commas\n suf := strings.ToUpper(number[i+1:])\n if suf == \"\" {\n bf.SetString(num)\n return bf\n }\n if suf[0] == '!' {\n prod := fact(num, len(suf))\n bf.SetInt64(int64(prod))\n return bf\n }\n for k, v := range abbrevs {\n kk := strings.ToUpper(k)\n if strings.HasPrefix(kk, suf) && len(suf) >= v.min {\n t1.SetString(num)\n if k != \"GOOGOLs\" {\n t2.SetFloat64(v.mult)\n } else {\n t2 = googol() // for greater accuracy\n }\n bf.Mul(t1, t2)\n return bf\n }\n }\n bf.SetString(num)\n for k, v := range metric {\n for j := 0; j < len(suf); j++ {\n if k == suf[j:j+1] {\n if j < len(suf)-1 && suf[j+1] == 'I' {\n t1.SetFloat64(binary[k+\"i\"])\n bf.Mul(bf, t1)\n j++\n } else {\n t1.SetFloat64(v)\n bf.Mul(bf, t1)\n }\n }\n }\n }\n return bf\n}\n\nfunc commatize(s string) string {\n if len(s) == 0 {\n return \"\"\n }\n neg := s[0] == '-'\n if neg {\n s = s[1:]\n }\n frac := \"\"\n if ix := strings.Index(s, \".\"); ix >= 0 {\n frac = s[ix:]\n s = s[:ix]\n }\n le := len(s)\n for i := le - 3; i >= 1; i -= 3 {\n s = s[0:i] + \",\" + s[i:]\n }\n if !neg {\n return s + frac\n }\n return \"-\" + s + frac\n}\n\nfunc process(numbers []string) {\n fmt.Print(\"numbers = \")\n for _, number := range numbers {\n fmt.Printf(\"%s \", number)\n }\n fmt.Print(\"\\nresults = \")\n for _, number := range numbers {\n res := parse(number)\n t := res.Text('g', 50)\n fmt.Printf(\"%s \", commatize(t))\n }\n fmt.Println(\"\\n\")\n}\n\nfunc main() {\n numbers := []string{\"2greatGRo\", \"24Gros\", \"288Doz\", \"1,728pairs\", \"172.8SCOre\"}\n process(numbers)\n\n numbers = []string{\"1,567\", \"+1.567k\", \"0.1567e-2m\"}\n process(numbers)\n\n numbers = []string{\"25.123kK\", \"25.123m\", \"2.5123e-00002G\"}\n process(numbers)\n\n numbers = []string{\"25.123kiKI\", \"25.123Mi\", \"2.5123e-00002Gi\", \"+.25123E-7Ei\"}\n process(numbers)\n\n numbers = []string{\"-.25123e-34Vikki\", \"2e-77gooGols\"}\n process(numbers)\n\n numbers = []string{\"9!\", \"9!!\", \"9!!!\", \"9!!!!\", \"9!!!!!\", \"9!!!!!!\",\n \"9!!!!!!!\", \"9!!!!!!!!\", \"9!!!!!!!!!\"}\n process(numbers)\n}\n","language":"Go"},{"code":"using Formatting\n\npartialsuffixes = Dict(\"PAIR\" => \"PAIRS\", \"SCO\" => \"SCORES\", \"DOZ\" => \"DOZENS\",\n \"GR\" => \"GROSS\", \"GREATGR\" => \"GREATGROSS\", \"GOOGOL\" => \"GOOGOLS\")\npartials = sort(collect(keys(partialsuffixes)), lt=(a,b)->length(a)<length(b), rev=true)\n\nmulticharsuffixes = Dict(\"PAIRS\" => 2, \"SCORES\" => 20, \"DOZENS\" => 12, \"GROSS\" => 144,\n \"GREATGROSS\" => 1728, \"GOOGOLS\" => BigInt(10)^100)\n\ntwocharsuffixes = Dict(\n \"KI\" => BigInt(2)^10, \"MI\" => BigInt(2)^20, \"GI\" => BigInt(2)^30, \"TI\" => BigInt(2)^40,\n \"PI\" => BigInt(2)^50, \"EI\" => BigInt(2)^60, \"ZI\" => BigInt(2)^70, \"YI\" => BigInt(2)^80,\n \"XI\" => BigInt(2)^90, \"WI\" => BigInt(2)^100, \"VI\" => BigInt(2)^110, \"UI\" => BigInt(2)^120)\ntwosuff = collect(keys(twocharsuffixes))\n\nonecharsuffixes = Dict(\"K\" => 10^3, \"M\" => 10^6, \"G\" => 10^9, \"T\" => 10^12, \"P\" => 10^15,\n \"E\" => 10^18, \"Z\" => 10^21, \"Y\" => BigInt(10)^24,\n \"X\" => BigInt(10)^27, \"W\" => BigInt(10)^30,\n \"V\" => BigInt(10)^33, \"U\" => BigInt(10)^36)\nonesuff = collect(keys(onecharsuffixes))\n\nfunction firstsuffix(s, x)\n str = uppercase(s)\n if str[1] == '!'\n lastbang = something(findfirst(x -> x != '!', str), length(str))\n return prod(x:-lastbang:1) / x, lastbang\n end\n for pstr in partials\n if match(Regex(\"^\" * pstr), str) != nothing\n fullsuffix = partialsuffixes[pstr]\n n = length(pstr)\n while n < length(fullsuffix) && n < length(str) && fullsuffix[n+1] == str[n+1]\n n += 1\n end\n return BigInt(multicharsuffixes[fullsuffix]), n\n end\n end\n for pstr in twosuff\n if match(Regex(\"^\" * pstr), str) != nothing\n return BigInt(twocharsuffixes[pstr]), 2\n end\n end\n for pstr in onesuff\n if match(Regex(\"^\" * pstr), str) != nothing\n return BigInt(onecharsuffixes[pstr]), 1\n end\n end\n return 1, length(s)\nend\n\nfunction parsesuffix(s, x)\n str = s\n mult = BigInt(1)\n n = 1\n while n <= length(str)\n multiplier, n = firstsuffix(str, x)\n mult *= multiplier\n str = str[n+1:end]\n end\n mult\nend\n\nfunction suffixednumber(s)\n if (endnum = findlast(isdigit, s)) == nothing\n return NaN\n end\n x = BigFloat(replace(s[1:endnum], \",\" => \"\"))\n return x * (endnum < length(s) ? parsesuffix(s[endnum + 1:end], x) : 1)\nend\n\nconst testcases =\n[\"2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\",\n \"1,567 +1.567k 0.1567e-2m\",\n \"25.123kK 25.123m 2.5123e-00002G\",\n \"25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\",\n \"-.25123e-34Vikki 2e-77gooGols\",\n \"9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\"]\n\nfunction testsuffixes()\n for line in testcases\n cases = split(line)\n println(\"Testing: \", string.(cases))\n println(\"Results: \", join(map(x -> format(suffixednumber(x), commas=true), cases), \" \"), \"\\n\")\n end\nend\n\ntestsuffixes()\n","language":"Julia"},{"code":"import re, strutils, parseutils, tables, math\nconst input = \"\"\"\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\n 1,567 +1.567k 0.1567e-2m\n 25.123kK 25.123m 2.5123e-00002G\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\n -.25123e-34Vikki 2e-77gooGols\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n \"\"\"\nlet\n abbrAlpha = re(r\"(PAIR)(s)?$|(SCO)(r|re|res)?$|(DOZ)(e|en|ens)?$|(GR)(o|os|oss)?$|(GREATGR)(o|os|oss)?$|(GOOGOL)(s)?$\",\n flags = {reIgnoreCase})\n metricBinary = re(r\"[KMGTPEZYXWVU]i?\", flags = {reIgnoreCase})\n factorial = re\"!+$\"\nconst\n alphaValues = [2e0, 20e0, 12e0, 144e0, 1728e0, 1e100]\n metricBinaryValueTab = {\"K\": 10.0^3, \"KI\": 2.0^10, \"M\": 10.0^6, \"MI\": 2.0^20,\n \"G\": 10.0^9, \"GI\": 2.0^30, \"T\": 10.0^12, \"TI\": 2.0^40, \"P\": 10.0^15,\n \"PI\": 2.0^50, \"E\": 10.0^18, \"EI\": 2.0^60, \"Z\": 10.0^21, \"ZI\": 2.0^70,\n \"Y\": 10.0^24, \"YI\": 2.0^80, \"X\": 10.0^27, \"XI\": 2.0^90, \"W\": 10.0^30,\n \"WI\": 2.0^100, \"V\": 10.0^33, \"VI\": 2.0^110, \"U\": 10.0^36,\n \"UI\": 2.0^120}.toTable\nvar\n matches: array[12, string]\n res, fac: float\n suffix: string\nproc sepFloat(f: float): string =\n var\n s = $f\n i, num: int\n num = parseInt(s, i)\n if num == 0:\n return s\n else:\n return insertSep($i, ',', 3)&s[num..^1]\nfor line in input.splitLines():\n if not isEmptyOrWhiteSpace(line):\n echo(\"Input:\\n\", line, \"\\nOutput:\")\n var output = \" \"\n for raw_number in line.replace(\",\", \"\").splitWhiteSpace():\n suffix = raw_number[parseutils.parseFloat(raw_number, res)..^1].toUpper()\n if suffix.match(abbrAlpha, matches):\n for i, v in matches.mpairs():\n if i mod 2 == 0 and not v.isEmptyOrWhiteSpace():\n res*=alphaValues[i div 2]\n v = \"\"\n break\n elif suffix.match(factorial):\n fac = abs(res)-toFloat(len(suffix))\n while fac > 0:\n res*=fac\n fac-=toFloat(len(suffix))\n elif suffix.match(metricBinary):\n for m in suffix.findAll(metricBinary):\n res*=metricBinaryValueTab[m]\n output &= sepFloat(res)&\" \"\n echo(output)\n","language":"Nim"},{"code":"#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes\nuse warnings;\n\nmy %suffix = qw( k 1e3 m 1e6 g 1e9 t 1e12 p 1e15 e 1e18 z 1e21 y 1e24 x 1e27\n w 1e30 v 1e33 u 1e36 ki 2**10 mi 2**20 gi 2**30 ti 2**40 pi 2**50 ei 2**60\n zi 2**70 yi 2**80 xi 2**90 wi 2**100 vi 2**110 ui 2**120 );\n\nlocal $\" = ' '; # strange rule...\nprint \"numbers = ${_}results = @{[ map suffix($_), split ]}\\n\\n\" while <DATA>;\n\nsub suffix\n {\n my ($value, $mods) = shift =~ tr/,//dr =~ /([+-]?[\\d.]+(?:e[+-]\\d+)?)(.*)/i;\n $value *= $^R while $mods =~ /\n PAIRs? (?{ 2 })\n | SCO(re?)? (?{ 20 })\n | DOZ(e(ns?)?)? (?{ 12 })\n | GREATGR(o(ss?)?)? (?{ 1728 }) # must be before GRoss\n | GR(o(ss?)?)? (?{ 144 })\n | GOOGOLs? (?{ 10**100 })\n | [kmgtpezyxwvu]i? (?{ eval $suffix{ lc $& } })\n | !+ (?{ my $factor = $value;\n $value *= $factor while ($factor -= length $&) > 1;\n 1 })\n /gix;\n return $value =~ s/(\\..*)|\\B(?=(\\d\\d\\d)+(?!\\d))/$1 || ','/ger;\n }\n\n__DATA__\n2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\n1,567 +1.567k 0.1567e-2m\n25.123kK 25.123m 2.5123e-00002G\n25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\n-.25123e-34Vikki 2e-77gooGols\n9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">bigatom</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_scale</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">34</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (min rqd for accuracy on the \"Vikki\" test)\n -- (the default is 25, not quite enough here)</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">suffixes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">\"GREATGRoss\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1728</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"GOOGOLs\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ba_new</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1e100\"</span><span style=\"color: #0000FF;\">)},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"SCOres\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"DOZens\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"GRoss\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">144</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"PAIRs\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #008000;\">\"KMGTPEZYXWVU\"</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">decode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">bigatom</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">BA_ONE</span>\n <span style=\"color: #000000;\">suffix</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">)></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">suffix</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">suffixes</span><span style=\"color: #0000FF;\">[$])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">'I'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ba_power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1024</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">suffix</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ba_power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">suffix</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">facto</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">bigatom</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">bigatom</span> <span style=\"color: #000000;\">nf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">ba_compare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nf</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)>=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nf</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">nf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nf</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">test_cases</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\n 1,567 +1.567k 0.1567e-2m\n 25.123kK 25.123m 2.5123e-00002G\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\n -.25123e-34Vikki 2e-77gooGols\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n 0.017k!!\n \"\"\"</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test_cases</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">no_empty</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">test</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">suffix</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">facts</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #008000;\">'!'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$]}</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">digit</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">digit</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #008000;\">'9'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$]}</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">bigatom</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_new</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\",\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">decode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">suffix</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">facto</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ns</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ba_sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%30s : %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">ns</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"from functools import reduce\nfrom operator import mul\nfrom decimal import *\n\ngetcontext().prec = MAX_PREC\n\ndef expand(num):\n suffixes = [\n # (name, min_abbreviation_length, base, exponent)\n ('greatgross', 7, 12, 3),\n ('gross', 2, 12, 2),\n ('dozens', 3, 12, 1),\n ('pairs', 4, 2, 1),\n ('scores', 3, 20, 1),\n ('googols', 6, 10, 100),\n ('ki', 2, 2, 10),\n ('mi', 2, 2, 20),\n ('gi', 2, 2, 30),\n ('ti', 2, 2, 40),\n ('pi', 2, 2, 50),\n ('ei', 2, 2, 60),\n ('zi', 2, 2, 70),\n ('yi', 2, 2, 80),\n ('xi', 2, 2, 90),\n ('wi', 2, 2, 100),\n ('vi', 2, 2, 110),\n ('ui', 2, 2, 120),\n ('k', 1, 10, 3),\n ('m', 1, 10, 6),\n ('g', 1, 10, 9),\n ('t', 1, 10, 12),\n ('p', 1, 10, 15),\n ('e', 1, 10, 18),\n ('z', 1, 10, 21),\n ('y', 1, 10, 24),\n ('x', 1, 10, 27),\n ('w', 1, 10, 30)\n ]\n\n num = num.replace(',', '').strip().lower()\n\n if num[-1].isdigit():\n return float(num)\n\n for i, char in enumerate(reversed(num)):\n if char.isdigit():\n input_suffix = num[-i:]\n num = Decimal(num[:-i])\n break\n\n if input_suffix[0] == '!':\n return reduce(mul, range(int(num), 0, -len(input_suffix)))\n\n while len(input_suffix) > 0:\n for suffix, min_abbrev, base, power in suffixes:\n if input_suffix[:min_abbrev] == suffix[:min_abbrev]:\n for i in range(min_abbrev, len(input_suffix) + 1):\n if input_suffix[:i+1] != suffix[:i+1]:\n num *= base ** power\n input_suffix = input_suffix[i:]\n break\n break\n\n return num\n\n\ntest = \"2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n\\\n 1,567 +1.567k 0.1567e-2m\\n\\\n 25.123kK 25.123m 2.5123e-00002G\\n\\\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n\\\n -.25123e-34Vikki 2e-77gooGols\\n\\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\"\n\nfor test_line in test.split(\"\\n\"):\n test_cases = test_line.split()\n print(\"Input:\", ' '.join(test_cases))\n print(\"Output:\", ' '.join(format(result, ',f').strip('0').strip('.') for result in map(expand, test_cases)))\n","language":"Python"},{"code":"use Rat::Precise;\n\nmy $googol = 10**100;\n«PAIRs 2 SCOres 20 DOZens 12 GRoss 144 GREATGRoss 1728 GOOGOLs $googol»\n ~~ m:g/ ((<.:Lu>+) <.:Ll>*) \\s+ (\\S+) /;\n\nmy %abr = |$/.map: {\n my $abbrv = .[0].Str.fc;\n my $mag = +.[1];\n |map { $abbrv.substr( 0, $_ ) => $mag },\n .[0][0].Str.chars .. $abbrv.chars\n}\n\nmy %suffix = flat %abr,\n(<K M G T P E Z Y X W V U>».fc Z=> (1000, * * 1000 … *)),\n(<Ki Mi Gi Ti Pi Ei Zi Yi Xi Wi Vi Ui>».fc Z=> (1024, * * 1024 … *));\n\nmy $reg = %suffix.keys.join('|');\n\nsub comma ($i is copy) {\n my $s = $i < 0 ?? '-' !! '';\n my ($whole, $frac) = $i.split('.');\n $frac = $frac.defined ?? \".$frac\" !! '';\n $s ~ $whole.abs.flip.comb(3).join(',').flip ~ $frac\n}\n\nsub units (Str $str) {\n $str.fc ~~ /^(.+?)(<alpha>*)('!'*)$/;\n my ($val, $unit, $fact) = $0, $1.Str.fc, $2.Str;\n $val.=subst(',', '', :g);\n if $val ~~ m:i/'e'/ {\n my ($m,$e) = $val.split(/<[eE]>/);\n $val = ($e < 0)\n ?? $m * FatRat.new(1,10**-$e)\n !! $m * 10**$e;\n }\n my @suf = $unit;\n unless %suffix{$unit}:exists {\n $unit ~~ /(<$reg>)+/;\n @suf = $0;\n }\n my $ret = $val<>;\n $ret = [*] $ret, |@suf.map: { %suffix{$_} } if @suf[0];\n $ret = [*] ($ret, * - $fact.chars …^ * < 2) if $fact.chars;\n $ret.?precise // $ret\n}\n\nmy $test = q:to '===';\n2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\n1,567 +1.567k 0.1567e-2m\n25.123kK 25.123m 2.5123e-00002G\n25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\n-.25123e-34Vikki 2e-77gooGols\n9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n.017k!!\n===\n\nprintf \"%16s: %s\\n\", $_, comma .&units for $test.words;\n\n# Task required stupid layout\n# say \"\\n In: $_\\nOut: \", .words.map({comma .&units}).join(' ') for $test.lines;\n","language":"Raku"},{"code":"/*REXX pgm converts numbers (with commas) with suffix multipliers──►pure decimal numbers*/\nnumeric digits 2000 /*allow the usage of ginormous numbers.*/\n@.=; @.1= '2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre'\n @.2= '1,567 +1.567k 0.1567e-2m'\n @.3= '25.123kK 25.123m 2.5123e-00002G'\n @.4= '25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei'\n @.5= '-.25123e-34Vikki 2e-77gooGols'\n @.6= 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\n\nparse arg x /*obtain optional arguments from the CL*/\nif x\\=='' then do; @.2=; @.1=x /*use the number(s) specified on the CL*/\n end /*allow user to specify their own list.*/\n /* [↓] handle a list or multiple lists*/\n do n=1 while @.n\\==''; $= /*process each of the numbers in lists.*/\n say 'numbers= ' @.n /*echo the original arg to the terminal*/\n\n do j=1 for words(@.n); y= word(@.n, j) /*obtain a single number from the input*/\n $= $ ' 'commas( num(y) ) /*process a number; add result to list.*/\n end /*j*/ /* [↑] add commas to number if needed.*/\n /* [↑] add extra blank betweenst nums.*/\n say ' result= ' strip($); say /*echo the result(s) to the terminal. */\n end /*n*/ /* [↑] elide the pre-pended blank. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisInt: return datatype( arg(1), 'Whole') /*return 1 if arg is an integer, or 0 */\nisNum: return datatype( arg(1), 'Number') /* \" \" \" \" \" a number. \" \" */\np: return word( arg(1), 1) /*pick 1st argument or 2nd argument. */\nser: say; say '***error*** ' arg(1); say; exit 13\nshorten:procedure; parse arg a,n; return left(a, max(0, length(a) - p(n 1) ) )\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$fact!: procedure; parse arg x _ .; L= length(x); n= L - length(strip(x, 'T', \"!\") )\n if n<=-n | _\\=='' | arg()\\==1 then return x; z= left(x, L - n)\n if z<0 | \\isInt(z) then return x; return $fact(z, n)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$fact: procedure; parse arg x _ .; arg ,n ! .; n= p(n 1); if \\isInt(n) then n= 0\n if x<-n | \\isInt(x) |n<1 | _||!\\=='' |arg()>2 then return x||copies(\"!\",max(1,n))\n s= x // n; if s==0 then s= n /*compute where to start multiplying. */\n != 1 /*the initial factorial product so far.*/\n do j=s to x by n; != !*j /*perform the actual factorial product.*/\n end /*j*/ /*{operator // is REXX's ÷ remainder}*/\n return ! /* [↑] handles any level of factorial.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$sfxa: parse arg u,s 1 c,m; upper u c /*get original version & upper version.*/\n if pos( left(s, 2), u)\\==0 then do j=length(s) to compare(s, c)-1 by -1\n if right(u, j) \\== left(c, j) then iterate\n _= left(u, length(u) - j) /*get the num.*/\n if isNum(_) then return m * _ /*good suffix.*/\n leave /*return as is*/\n end\n return arg(1) /* [↑] handles an alphabetic suffixes.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$sfx!: parse arg y; if right(y, 1)=='!' then y= $fact!(y)\n if \\isNum(y) then y=$sfxz(); if isNum(y) then return y; return $sfxm(y)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$sfxm: parse arg z 1 w; upper w; @= 'KMGTPEZYXWVU'; b= 1000\n if right(w, 1)=='I' then do; z= shorten(z); w= z; upper w; b= 1024\n end\n _= pos( right(w, 1), @); if _==0 then return arg(1)\n n= shorten(z); r= num(n, , 1); if isNum(r) then return r * b**_\n return arg(1) /* [↑] handles metric or binary suffix*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n$sfxz: return $sfxa( $sfxa( $sfxa( $sfxa( $sfxa( $sfxa(y, 'PAIRs', 2), 'DOZens', 12), ,\n 'SCores', 20), 'GREATGRoss', 1728), 'GRoss', 144), 'GOOGOLs', 1e100)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: procedure; parse arg _; n= _'.9'; #= 123456789; b= verify(n, #, \"M\")\n e= verify(n, #'0', , verify(n, #\"0.\", 'M') ) - 4 /* [↑] add commas.*/\n do j=e to b by -3; _= insert(',', _, j); end /*j*/; return _\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nnum: procedure; parse arg x .,,q; if x=='' then return x\n if isNum(x) then return x/1; x= space( translate(x, , ','), 0)\n if \\isNum(x) then x= $sfx!(x); if isNum(x) then return x/1\n if q==1 then return x\n if q=='' then call ser \"argument isn't numeric or doesn't have a legal suffix:\" x\n","language":"REXX"},{"code":"import \"./big\" for BigRat\nimport \"./str\" for Str\nimport \"./fmt\" for Fmt\n\nvar abbrevs = {\n \"PAIRs\": [4, 2], \"SCOres\": [3, 20], \"DOZens\": [3, 12],\n \"GRoss\": [2, 144], \"GREATGRoss\": [7, 1728], \"GOOGOLs\": [6, 1e100]\n}\n\nvar metric = {\n \"K\": 1e3, \"M\": 1e6, \"G\": 1e9, \"T\": 1e12, \"P\": 1e15, \"E\": 1e18,\n \"Z\": 1e21, \"Y\": 1e24, \"X\": 1e27, \"W\": 1e30, \"V\": 1e33, \"U\": 1e36\n}\n\nvar b = Fn.new { |e| BigRat.two.pow(e) }\n\nvar binary = {\n \"Ki\": b.call(10), \"Mi\": b.call(20), \"Gi\": b.call(30), \"Ti\": b.call(40),\n \"Pi\": b.call(50), \"Ei\": b.call(60), \"Zi\": b.call(70), \"Yi\": b.call(80),\n \"Xi\": b.call(90), \"Wi\": b.call(100), \"Vi\": b.call(110), \"Ui\": b.call(120)\n}\n\nvar googol = BigRat.fromDecimal(\"1e100\")\n\nvar fact = Fn.new { |num, d|\n var prod = 1\n var n = Num.fromString(num)\n var i = n\n while (i > 0) {\n prod = prod * i\n i = i - d\n }\n return prod\n}\n\nvar parse = Fn.new { |number|\n // find index of last digit\n var i = number.count - 1\n while (i >= 0) {\n if (48 <= number.bytes[i] && number.bytes[i] <= 57) break\n i = i - 1\n }\n var num = number[0..i]\n num = num.replace(\",\", \"\") // get rid of any commas\n var suf = Str.upper(number[i+1..-1])\n if (suf == \"\") return BigRat.fromDecimal(num)\n if (suf[0] == \"!\") {\n var prod = fact.call(num, suf.count)\n return BigRat.new(prod)\n }\n for (me in abbrevs) {\n var kk = Str.upper(me.key)\n if (kk.startsWith(suf) && suf.count >= me.value[0]) {\n var t1 = BigRat.fromDecimal(num)\n var t2 = (me.key != \"GOOGOLS\") ? BigRat.fromDecimal(me.value[1]) : googol\n return t1 * t2\n }\n }\n var bf = BigRat.fromDecimal(num)\n for (me in metric) {\n var j = 0\n while (j < suf.count) {\n if (me.key == suf[j]) {\n if (j < suf.count-1 && suf[j+1] == \"I\") {\n bf = bf * binary[me.key + \"i\"]\n j = j + 1\n } else {\n bf = bf * me.value\n }\n }\n j = j + 1\n }\n }\n return bf\n}\n\nvar process = Fn.new { |numbers|\n System.write(\"numbers = \")\n for (number in numbers) Fmt.write(\"$s \", number)\n System.write(\"\\nresults = \")\n for (number in numbers) {\n var res = parse.call(number)\n if (res.isInteger) {\n Fmt.write(\"$,s \", res.toDecimal(50))\n } else {\n var sres = Fmt.swrite(\"$,s\", res.truncate.toDecimal)\n Fmt.write(\"$s \", sres + res.fraction.abs.toDecimal(50)[1..-1])\n }\n }\n System.print(\"\\n\")\n}\n\nvar numbers = [\"2greatGRo\", \"24Gros\", \"288Doz\", \"1,728pairs\", \"172.8SCOre\"]\nprocess.call(numbers)\n\nnumbers = [\"1,567\", \"+1.567k\", \"0.1567e-2m\"]\nprocess.call(numbers)\n\nnumbers = [\"25.123kK\", \"25.123m\", \"2.5123e-00002G\"]\nprocess.call(numbers)\n\nnumbers = [\"25.123kiKI\", \"25.123Mi\", \"2.5123e-00002Gi\", \"+.25123E-7Ei\"]\nprocess.call(numbers)\n\nnumbers = [\"-.25123e-34Vikki\", \"2e-77gooGols\"]\nprocess.call(numbers)\n\nnumbers = [\"9!\", \"9!!\", \"9!!!\", \"9!!!!\", \"9!!!!!\", \"9!!!!!!\", \"9!!!!!!!\", \"9!!!!!!!!\", \"9!!!!!!!!!\"]\nprocess.call(numbers)\n","language":"Wren"},{"code":"var [const] BI=Import.lib(\"zklBigNum\"); // GMP\nvar kRE,kD, aRE,aD;\n\nkRE,kD = ki();\naRE,aD = abrevCreate();\n\nfcn naSuffixes(numStr){\n var [const]\n numRE=RegExp(0'^([+-]*\\.*\\d+[.]*\\d*E*[+-]*\\d*)^),\n bangRE=RegExp(0'^(!+)^);\n\n nstr:=(numStr - \" ,\").toUpper();\n numRE.search(nstr);\n nstr,r := nstr[numRE.matched[0][1],*], numRE.matched[1];\n if(r.matches(\"*[.E]*\")) r=r.toFloat(); // arg!\n if(r.matches(\"*[.E]*\")) r=r.toFloat(); // arg!\n else \t\t r=BI(r);\n\n reg z;\n do{\n z=nstr;\t// use this to see if we actually did anything\n if(aRE.search(nstr)){\n\t ns,k := aRE.matched;\t// ((0,3),\"SCO\")\n\t re,b := aD[k];\t\t// (RegExp(\"R|RE|RES\"),BI(20)),\n\t nstr = nstr[ns[1],*];\n\t if(re.search(nstr)) nstr=nstr[re.matched[0][1],*]; # remove abbrev tail\n\t r=r*b;\n continue;\n }else if(kRE.search(nstr)){\n\t r*=kD[kRE.matched[1]];\t // \"K\":1000 ...\n\t nstr=nstr[kRE.matched[0][1],*];\n continue;\n }else if(bangRE.search(nstr)){ // floats are converted to int\n\t n,k,z := r.toInt(), bangRE.matched[0][1], n - k;\n\t r,nstr = BI(n), nstr[k,*];\n\t while(z>0){ r.mul(z); z-=k; }\n continue;\n }\n }while(nstr and z!=nstr);\n r\n}\n\nfcn ki{ // case insensitive: k, ki,\n ss:=\"K M G T P E Z Y X W V U\".split();\n d:=Dictionary();\n ss.zipWith(d.add,[3..3*(ss.len()),3].apply(BI(10).pow)); # E:1e+18\n ss.apply(\"append\",\"I\")\n .zipWith(d.add,[10..10*(ss.len()),10].apply(BI(2).pow)); # EI:1.15292e+18\n re:=\"([%s]I\\\\?)\".fmt(ss.concat()); // \"([KMGTPEZYXWVU]I\\?)\"\n return(RegExp(re),d);\n}\nfcn abrevCreate{\n var upDown=RegExp(\"([A-Z]+)(.*)\");\n s:=\"PAIRs 2; SCOres 20; DOZens 12; GREATGRoss 1728; GRoss 144; GOOGOLs 10e100\".split(\";\");\n abrevs,re := Dictionary(), Sink(String);\n foreach an in (s){\n a,n := an.split();\n upDown.search(a);\n u,d := upDown.matched[1,2];\n d=d.len().pump(List, // \"R|RE|RES\"\n '+(1),d.get.fp(0),\"toUpper\").reverse().concat(\"|\");\n abrevs.add(u,T(RegExp(d),BI(n)));\n re.write(u,\" \");\n }\n // \"PAIR|SCO|DOZ|GR|GREATGR|GOOGOL\"\n re=RegExp(\"(%s)\".fmt(re.close().strip().replace(\" \",\"|\")));\n return(re,abrevs);\n}\n","language":"Zkl"},{"code":"foreach na in (T(\"2greatGRo\", \"24Gros\", \"288Doz\", \"1,728pairs\", \"172.8SCOre\",\n \"1,567\", \"+1.567k\", \"0.1567e-2m\",\n \"25.123kK\", \"25.123m\", \"2.5123e-00002G\",\n \"25.123kiKI\", \"25.123Mi\", \"2.5123e-00002Gi\", \"+.25123E-7Ei\",\n \"-.25123e-34Vikki\", \"2e-77gooGols\",\n \"9!\", \"9!!\", \"9!!!\", \"9!!!!\", \"9!!!!!\", \"9!!!!!!\",\n \"9!!!!!!!\", \"9!!!!!!!!\", \"9!!!!!!!!!\",\n \"9!!!!!!!!!k\", \".017k!!\", \"4 dozensK\", \"2 dozen pairs\")){\n\n if((r:=naSuffixes(na)).isType(Float)) println(\"%16s : %,f\".fmt(na,r));\n else \t\t\t\t println(\"%16s : %,d\".fmt(na,r));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This task is about expressing numbers with an attached (abutted) suffix multiplier(s), the suffix(es) could be:\\n::* an alphabetic (named) multiplier which could be abbreviated\\n::* metric multiplier(s) which can be specified multiple times\\n::* \\\"binary\\\" multiplier(s) which can be specified multiple times\\n::* explanation marks (<big>'''!'''</big>) which indicate a factorial or multifactorial\\n\\n\\nThe (decimal) numbers can be expressed generally as:\\n {<big>±</big>} {digits} {'''.'''} {digits}\\n ────── or ──────\\n {<big>±</big>} {digits} {'''.'''} {digits} {'''E''' <small>or</small> '''e'''} {<big>±</big>} {digits}\\n\\nwhere:\\n::* numbers won't have embedded blanks (contrary to the expaciated examples above where whitespace was used for readability)\\n::* this task will only be dealing with decimal numbers, both in the ''mantissa'' and ''exponent''\\n::* <big>±</big> indicates an optional plus or minus sign (<big>'''+'''</big> <small>or</small> <big>'''-'''</big>)\\n::* digits are the decimal digits ('''0''' ──► '''9''')\\n::* the digits can have comma(s) interjected to separate the ''periods'' (thousands) such as: '''12,467,000'''\\n::* '''.''' is the decimal point, sometimes also called a ''dot''\\n::* '''e''' or '''E''' denotes the use of decimal exponentiation (a number multiplied by raising ten to some power)\\n\\n\\nThis isn't a pure or perfect definition of the way we express decimal numbers, but it should convey the intent for this task.\\n\\nThe use of the word ''periods'' (thousands) is not meant to confuse, that word (as used above) is what the '''comma''' separates;\\n<br>the groups of decimal digits are called ''periods'', and in almost all cases, are groups of three decimal digits.\\n\\nIf an '''e''' or '''E''' is specified, there must be a legal number expressed before it, and there must be a legal (exponent) expressed after it.\\n\\nAlso, there must be some digits expressed in all cases, not just a sign and/or decimal point.\\n\\nSuperfluous signs, decimal points, exponent numbers, and zeros need not be preserved.\\n\\nI.E.: \\n'''+7''' '''007''' '''7.00''' '''7E-0''' '''7E000''' '''70e-1''' could all be expressed as '''7'''\\n\\nAll numbers to be \\\"expanded\\\" can be assumed to be valid and there won't be a requirement to verify their validity.\\n\\n\\n;Abbreviated alphabetic suffixes to be supported (where the capital letters signify the minimum abbreation that can be used):\\n '''PAIRs''' multiply the number by '''2''' (as in pairs of shoes or pants)\\n '''SCOres''' multiply the number by '''20''' (as '''3score''' would be '''60''')\\n '''DOZens''' multiply the number by '''12'''\\n '''GRoss''' multiply the number by '''144''' (twelve dozen)\\n '''GREATGRoss''' multiply the number by '''1,728''' (a dozen gross)\\n '''GOOGOLs''' multiply the number by '''10^100''' (ten raised to the 100&sup>th</sup> power)\\n\\n\\nNote that the plurals are supported, even though they're usually used when expressing exact numbers (She has 2 dozen eggs, and dozens of quavas)\\n\\n\\n;Metric suffixes to be supported (whether or not they're officially sanctioned):\\n '''K''' multiply the number by '''10^3''' kilo (1,000)\\n '''M''' multiply the number by '''10^6''' mega (1,000,000)\\n '''G''' multiply the number by '''10^9''' giga (1,000,000,000)\\n '''T''' multiply the number by '''10^12''' tera (1,000,000,000,000)\\n '''P''' multiply the number by '''10^15''' peta (1,000,000,000,000,000)\\n '''E''' multiply the number by '''10^18''' exa (1,000,000,000,000,000,000)\\n '''Z''' multiply the number by '''10^21''' zetta (1,000,000,000,000,000,000,000)\\n '''Y''' multiply the number by '''10^24''' yotta (1,000,000,000,000,000,000,000,000)\\n '''X''' multiply the number by '''10^27''' xenta (1,000,000,000,000,000,000,000,000,000)\\n '''W''' multiply the number by '''10^30''' wekta (1,000,000,000,000,000,000,000,000,000,000)\\n '''V''' multiply the number by '''10^33''' vendeka (1,000,000,000,000,000,000,000,000,000,000,000)\\n '''U''' multiply the number by '''10^36''' udekta (1,000,000,000,000,000,000,000,000,000,000,000,000)\\n\\n\\n;Binary suffixes to be supported (whether or not they're officially sanctioned):\\n '''Ki''' multiply the number by '''2^10''' kibi (1,024)\\n '''Mi''' multiply the number by '''2^20''' mebi (1,048,576)\\n '''Gi''' multiply the number by '''2^30''' gibi (1,073,741,824)\\n '''Ti''' multiply the number by '''2^40''' tebi (1,099,571,627,776)\\n '''Pi''' multiply the number by '''2^50''' pebi (1,125,899,906,884,629)\\n '''Ei''' multiply the number by '''2^60''' exbi (1,152,921,504,606,846,976)\\n '''Zi''' multiply the number by '''2^70''' zeb1 (1,180,591,620,717,411,303,424)\\n '''Yi''' multiply the number by '''2^80''' yobi (1,208,925,819,614,629,174,706,176)\\n '''Xi''' multiply the number by '''2^90''' xebi (1,237,940,039,285,380,274,899,124,224)\\n '''Wi''' multiply the number by '''2^100''' webi (1,267,650,600,228,229,401,496,703,205,376)\\n '''Vi''' multiply the number by '''2^110''' vebi (1,298,074,214,633,706,907,132,624,082,305,024)\\n '''Ui''' multiply the number by '''2^120''' uebi (1,329,227,995,784,915,872,903,807,060,280,344,576)\\n\\n\\nAll of the metric and binary suffixes can be expressed in lowercase, uppercase, ''or'' mixed case.\\n\\nAll of the metric and binary suffixes can be ''stacked'' (expressed multiple times), and also be intermixed:\\n<br>I.E.: '''123k''' '''123K''' '''123GKi''' '''12.3GiGG''' '''12.3e-7T''' '''.78E100e'''\\n \\n\\n;Factorial suffixes to be supported:\\n '''!''' compute the (regular) factorial product: '''5!''' is '''5''' × '''4''' × '''3''' × '''2''' × '''1''' = '''120'''\\n '''!!''' compute the double factorial product: '''8!''' is '''8''' × '''6''' × '''4''' × '''2''' = '''384'''\\n '''!!!''' compute the triple factorial product: '''8!''' is '''8''' × '''5''' × '''2''' = '''80'''\\n '''!!!!''' compute the quadruple factorial product: '''8!''' is '''8''' × '''4''' = '''32'''\\n '''!!!!!''' compute the quintuple factorial product: '''8!''' is '''8''' × '''3''' = '''24'''\\n ··· the number of factorial symbols that can be specified is to be unlimited (as per what can be entered/typed) ···\\n\\n\\nFactorial suffixes aren't, of course, the usual type of multipliers, but are used here in a similar vein.\\n\\n\\nMultifactorials aren't to be confused with ''super─factorials'' where '''(4!)!''' would be '''(24)!'''.\\n\\n\\n\\n;Task:\\n::* Using the test cases (below), show the \\\"expanded\\\" numbers here, on this page.\\n::* For each list, show the input on one line, and also show the output on one line.\\n::* When showing the input line, keep the spaces (whitespace) and case (capitalizations) as is.\\n::* For each result (list) displayed on one line, separate each number with two blanks.\\n::* Add commas to the output numbers were appropriate.\\n\\n\\n;Test cases:\\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n 1,567 +1.567k 0.1567e-2m\\n 25.123kK 25.123m 2.5123e-00002G\\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n -.25123e-34Vikki 2e-77gooGols\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n\\nwhere the last number for the factorials has nine factorial symbols (<big>'''!'''</big>) after the '''9'''\\n\\n\\n\\n;Related tasks:\\n* [[Multifactorial]] (which has a clearer and more succinct definition of multifactorials.)\\n* [[Factorial]]\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"USING: combinators combinators.short-circuit formatting fry\\ngrouping grouping.extras kernel literals math math.functions\\nmath.parser math.ranges qw regexp sequences sequences.deep\\nsequences.extras sets splitting unicode ;\\nIN: rosetta-code.numerical-suffixes\\n\\nCONSTANT: test-cases {\\n qw{ 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre }\\n qw{ 1,567 +1.567k 0.1567e-2m }\\n qw{ 25.123kK 25.123m 2.5123e-00002G }\\n qw{ 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei }\\n qw{ -.25123e-34Vikki 2e-77gooGols }\\n qw{\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!!\\n 9!!!!!!!!!\\n }\\n}\\n\\nCONSTANT: alpha {\\n { \\\"PAIRs\\\" 2 } { \\\"DOZens\\\" 12 } { \\\"SCOres\\\" 20 }\\n { \\\"GRoss\\\" 144 } { \\\"GREATGRoss\\\" 1,728 }\\n ${ \\\"GOOGOLs\\\" 10 100 ^ }\\n}\\n\\nCONSTANT: metric qw{ K M G T P E Z Y X W V U }\\n\\n! Multifactorial\\n: m! ( n degree -- m ) neg 1 swap <range> product ;\\n\\n! Separate a number from its suffix(es).\\n! e.g. \\\"+1.567k\\\" -> 1.567 \\\"k\\\"\\n: num/suffix ( str -- n suffix(es) )\\n dup <head-clumps> <reversed> { } like \\\"\\\" map-like\\n [ string>number ] map [ ] find [ tail* ] dip swap ;\\n\\n! Checks whether str1 is an abbreviation of str2.\\n! e.g. \\\"greatGRo\\\" \\\"GREATGRoss\\\" -> t\\n: abbrev? ( str1 str2 -- ? )\\n {\\n [ [ >upper ] [ [ LETTER? ] take-while head? ] bi* ]\\n [ [ length ] bi@ <= ]\\n } 2&& ;\\n\\n! Convert an alpha suffix to its multiplication function.\\n! e.g. \\\"Doz\\\" -> [ 12 * ]\\n: alpha>quot ( str -- quot )\\n [ alpha ] dip '[ first _ swap abbrev? ] find nip second\\n [ * ] curry ;\\n\\n! Split a suffix composed of metric and binary suffixes into its\\n! constituent parts. e.g. \\\"Vikki\\\" -> { \\\"Vi\\\" \\\"k\\\" \\\"ki\\\" }\\n: split-compound ( str -- seq )\\n R/ (.i|.)/i all-matching-subseqs ;\\n\\n! Convert a metric or binary suffix to its multiplication\\n! function. e.g. \\\"k\\\" -> [ 10 3 ^ * ]\\n: suffix>quot ( str -- quot )\\n dup [ [ 0 1 ] dip subseq >upper metric index 1 + ] dip\\n length 1 = [ 3 * '[ 10 _ ^ * ] ] [ 10 * '[ 2 _ ^ * ] ] if ;\\n\\n! Apply suffix>quot to each member of a sequence.\\n! e.g. { \\\"Vi\\\" \\\"k\\\" \\\"ki\\\" } ->\\n! [ [ 2 110 ^ * ] [ 10 3 ^ * ] [ 2 10 ^ * ] ]\\n: map-suffix ( seq -- seq' ) [ suffix>quot ] [ ] map-as ;\\n\\n! Tests whether a string is composed of metric and/or binary\\n! suffixes. e.g. \\\"Vikki\\\" -> t\\n: compound? ( str -- ? )\\n >upper metric concat \\\"I\\\" append without empty? ;\\n\\n! Convert a float to an integer if it is numerically equivalent\\n! to an integer. e.g. 1.0 -> 1, 1.23 -> 1.23\\n: ?f>i ( x -- y/n )\\n dup >integer 2dup [ number= ] 2dip swap ? ;\\n\\n! Convert a suffix string to a function that performs the\\n! calculations required by the suffix.\\n! e.g. \\\"!!!\\\" -> [ 3 m! ], \\\"kiKI\\\" -> [ 2 10 ^ * 2 10 ^ * ]\\n: parse-suffix ( str -- quot )\\n {\\n { [ dup empty? ] [ drop [ ] ] }\\n { [ dup first CHAR: ! = ] [ length [ m! ] curry ] }\\n { [ dup compound? ] [ split-compound map-suffix ] }\\n [ alpha>quot ]\\n } cond flatten ;\\n\\nGENERIC: commas ( n -- str )\\n\\n! Add commas to an integer in triplets.\\n! e.g. 1567 -> \\\"1,567\\\"\\nM: integer commas number>string <reversed> 3 group\\n [ \\\",\\\" append ] map concat reverse rest ;\\n\\n! Add commas to a float in triplets.\\n! e.g. 1567.12345 -> \\\"1,567.12345\\\"\\nM: float commas number>string \\\".\\\" split first2\\n [ string>number commas ] dip \\\".\\\" glue ;\\n\\n! Parse any number with any numerical or alphabetical suffix.\\n! e.g. \\\"288Doz\\\" -> \\\"3,456\\\", \\\"9!!\\\" -> \\\"945\\\"\\n: parse-alpha ( str -- str' )\\n num/suffix parse-suffix curry call( -- x ) ?f>i commas ;\\n\\n: main ( -- )\\n test-cases [\\n dup [ parse-alpha ] map\\n \\\"Numbers: %[%s, %]\\\\n Result: %[%s, %]\\\\n\\\\n\\\" printf\\n ] each ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: formatting fry grouping kernel literals math\\nmath.functions math.parser math.ranges multiline peg.ebnf\\nquotations qw sequences sequences.deep splitting strings unicode ;\\nIN: rosetta-code.numerical-suffixes.ebnf\\n\\nCONSTANT: test-cases {\\n qw{ 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre }\\n qw{ 1,567 +1.567k 0.1567e-2m }\\n qw{ 25.123kK 25.123m 2.5123e-00002G }\\n qw{ 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei }\\n qw{ -.25123e-34Vikki 2e-77gooGols }\\n qw{\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!!\\n 9!!!!!!!!!\\n }\\n}\\n\\nCONSTANT: metric qw{ K M G T P E Z Y X W V U }\\n\\n: suffix>quot ( str -- quot )\\n dup [ [ 0 1 ] dip subseq >upper metric index 1 + ] dip\\n length 1 = [ 3 * '[ 10 _ ^ * ] ] [ 10 * '[ 2 _ ^ * ] ] if ;\\n\\n: ?f>i ( x -- y/n ) dup >integer 2dup [ number= ] 2dip swap ? ;\\n\\nGENERIC: commas ( n -- str )\\nM: integer commas number>string <reversed> 3 group\\n [ \\\",\\\" append ] map concat reverse rest ;\\n\\nM: float commas number>string \\\".\\\" split first2\\n [ string>number commas ] dip \\\".\\\" glue ;\\n\\nEBNF: suffix-num [=[\\n sign = [+-]\\n digit = [0-9]\\n triplet = digit digit digit\\n commas = (triplet | digit digit | digit) ([,] triplet)+\\n integer = sign? (commas | digit+)\\n exp = [Ee] sign? digit+\\n bfloat = (integer | sign)? [.] digit+ exp?\\n float = (bfloat | integer exp)\\n number = (float | integer) => [[ flatten \\\"\\\" like string>number ]]\\n pairs = [Pp] [Aa] [Ii] [Rr] [s]? => [[ [ 2 * ] ]]\\n dozens = [Dd] [Oo] [Zz] [e]? [n]? [s]? => [[ [ 12 * ] ]]\\n scores = [Ss] [Cc] [Oo] [r]? [e]? [s]? => [[ [ 20 * ] ]]\\n gross = [Gg] [Rr] [o]? [s]? [s]? => [[ [ 144 * ] ]]\\n gg = [Gg] [Rr] [Ee] [Aa] [Tt] gross => [[ [ 1728 * ] ]]\\n googols = [Gg] [Oo] [Oo] [Gg] [Oo] [Ll] [s]? => [[ [ $[ 10 100 ^ ] * ] ]]\\n alpha = (pairs | dozens | scores | gg | gross | googols)\\n numeric = ([KkMmGgPpEeT-Zt-z] [Ii]?) => [[ flatten \\\"\\\" like suffix>quot ]]\\n ncompnd = numeric+\\n fact = [!]+ => [[ length [ neg 1 swap <range> product ] curry ]]\\n suffix = (alpha | ncompnd | fact)\\n s-num = number suffix? !(.) =>\\n [[ >quotation flatten call( -- x ) ?f>i commas ]]\\n]=]\\n\\n: num-alpha-suffix-demo ( -- )\\n test-cases [\\n dup [ suffix-num ] map\\n \\\"Numbers: %[%s, %]\\\\n Result: %[%s, %]\\\\n\\\\n\\\" printf\\n ] each ;\\n\\nMAIN: num-alpha-suffix-demo\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"math/big\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\ntype minmult struct {\\n min int\\n mult float64\\n}\\n\\nvar abbrevs = map[string]minmult{\\n \\\"PAIRs\\\": {4, 2}, \\\"SCOres\\\": {3, 20}, \\\"DOZens\\\": {3, 12},\\n \\\"GRoss\\\": {2, 144}, \\\"GREATGRoss\\\": {7, 1728}, \\\"GOOGOLs\\\": {6, 1e100},\\n}\\n\\nvar metric = map[string]float64{\\n \\\"K\\\": 1e3, \\\"M\\\": 1e6, \\\"G\\\": 1e9, \\\"T\\\": 1e12, \\\"P\\\": 1e15, \\\"E\\\": 1e18,\\n \\\"Z\\\": 1e21, \\\"Y\\\": 1e24, \\\"X\\\": 1e27, \\\"W\\\": 1e30, \\\"V\\\": 1e33, \\\"U\\\": 1e36,\\n}\\n\\nvar binary = map[string]float64{\\n \\\"Ki\\\": b(10), \\\"Mi\\\": b(20), \\\"Gi\\\": b(30), \\\"Ti\\\": b(40), \\\"Pi\\\": b(50), \\\"Ei\\\": b(60),\\n \\\"Zi\\\": b(70), \\\"Yi\\\": b(80), \\\"Xi\\\": b(90), \\\"Wi\\\": b(100), \\\"Vi\\\": b(110), \\\"Ui\\\": b(120),\\n}\\n\\nfunc b(e float64) float64 {\\n return math.Pow(2, e)\\n}\\n\\nfunc googol() *big.Float {\\n g1 := new(big.Float).SetPrec(500)\\n g1.SetInt64(10000000000)\\n g := new(big.Float)\\n g.Set(g1)\\n for i := 2; i <= 10; i++ {\\n g.Mul(g, g1)\\n }\\n return g\\n}\\n\\nfunc fact(num string, d int) int {\\n prod := 1\\n n, _ := strconv.Atoi(num)\\n for i := n; i > 0; i -= d {\\n prod *= i\\n }\\n return prod\\n}\\n\\nfunc parse(number string) *big.Float {\\n bf := new(big.Float).SetPrec(500)\\n t1 := new(big.Float).SetPrec(500)\\n t2 := new(big.Float).SetPrec(500)\\n // find index of last digit\\n var i int\\n for i = len(number) - 1; i >= 0; i-- {\\n if '0' <= number[i] && number[i] <= '9' {\\n break\\n }\\n }\\n num := number[:i+1]\\n num = strings.Replace(num, \\\",\\\", \\\"\\\", -1) // get rid of any commas\\n suf := strings.ToUpper(number[i+1:])\\n if suf == \\\"\\\" {\\n bf.SetString(num)\\n return bf\\n }\\n if suf[0] == '!' {\\n prod := fact(num, len(suf))\\n bf.SetInt64(int64(prod))\\n return bf\\n }\\n for k, v := range abbrevs {\\n kk := strings.ToUpper(k)\\n if strings.HasPrefix(kk, suf) && len(suf) >= v.min {\\n t1.SetString(num)\\n if k != \\\"GOOGOLs\\\" {\\n t2.SetFloat64(v.mult)\\n } else {\\n t2 = googol() // for greater accuracy\\n }\\n bf.Mul(t1, t2)\\n return bf\\n }\\n }\\n bf.SetString(num)\\n for k, v := range metric {\\n for j := 0; j < len(suf); j++ {\\n if k == suf[j:j+1] {\\n if j < len(suf)-1 && suf[j+1] == 'I' {\\n t1.SetFloat64(binary[k+\\\"i\\\"])\\n bf.Mul(bf, t1)\\n j++\\n } else {\\n t1.SetFloat64(v)\\n bf.Mul(bf, t1)\\n }\\n }\\n }\\n }\\n return bf\\n}\\n\\nfunc commatize(s string) string {\\n if len(s) == 0 {\\n return \\\"\\\"\\n }\\n neg := s[0] == '-'\\n if neg {\\n s = s[1:]\\n }\\n frac := \\\"\\\"\\n if ix := strings.Index(s, \\\".\\\"); ix >= 0 {\\n frac = s[ix:]\\n s = s[:ix]\\n }\\n le := len(s)\\n for i := le - 3; i >= 1; i -= 3 {\\n s = s[0:i] + \\\",\\\" + s[i:]\\n }\\n if !neg {\\n return s + frac\\n }\\n return \\\"-\\\" + s + frac\\n}\\n\\nfunc process(numbers []string) {\\n fmt.Print(\\\"numbers = \\\")\\n for _, number := range numbers {\\n fmt.Printf(\\\"%s \\\", number)\\n }\\n fmt.Print(\\\"\\\\nresults = \\\")\\n for _, number := range numbers {\\n res := parse(number)\\n t := res.Text('g', 50)\\n fmt.Printf(\\\"%s \\\", commatize(t))\\n }\\n fmt.Println(\\\"\\\\n\\\")\\n}\\n\\nfunc main() {\\n numbers := []string{\\\"2greatGRo\\\", \\\"24Gros\\\", \\\"288Doz\\\", \\\"1,728pairs\\\", \\\"172.8SCOre\\\"}\\n process(numbers)\\n\\n numbers = []string{\\\"1,567\\\", \\\"+1.567k\\\", \\\"0.1567e-2m\\\"}\\n process(numbers)\\n\\n numbers = []string{\\\"25.123kK\\\", \\\"25.123m\\\", \\\"2.5123e-00002G\\\"}\\n process(numbers)\\n\\n numbers = []string{\\\"25.123kiKI\\\", \\\"25.123Mi\\\", \\\"2.5123e-00002Gi\\\", \\\"+.25123E-7Ei\\\"}\\n process(numbers)\\n\\n numbers = []string{\\\"-.25123e-34Vikki\\\", \\\"2e-77gooGols\\\"}\\n process(numbers)\\n\\n numbers = []string{\\\"9!\\\", \\\"9!!\\\", \\\"9!!!\\\", \\\"9!!!!\\\", \\\"9!!!!!\\\", \\\"9!!!!!!\\\",\\n \\\"9!!!!!!!\\\", \\\"9!!!!!!!!\\\", \\\"9!!!!!!!!!\\\"}\\n process(numbers)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"using Formatting\\n\\npartialsuffixes = Dict(\\\"PAIR\\\" => \\\"PAIRS\\\", \\\"SCO\\\" => \\\"SCORES\\\", \\\"DOZ\\\" => \\\"DOZENS\\\",\\n \\\"GR\\\" => \\\"GROSS\\\", \\\"GREATGR\\\" => \\\"GREATGROSS\\\", \\\"GOOGOL\\\" => \\\"GOOGOLS\\\")\\npartials = sort(collect(keys(partialsuffixes)), lt=(a,b)->length(a)<length(b), rev=true)\\n\\nmulticharsuffixes = Dict(\\\"PAIRS\\\" => 2, \\\"SCORES\\\" => 20, \\\"DOZENS\\\" => 12, \\\"GROSS\\\" => 144,\\n \\\"GREATGROSS\\\" => 1728, \\\"GOOGOLS\\\" => BigInt(10)^100)\\n\\ntwocharsuffixes = Dict(\\n \\\"KI\\\" => BigInt(2)^10, \\\"MI\\\" => BigInt(2)^20, \\\"GI\\\" => BigInt(2)^30, \\\"TI\\\" => BigInt(2)^40,\\n \\\"PI\\\" => BigInt(2)^50, \\\"EI\\\" => BigInt(2)^60, \\\"ZI\\\" => BigInt(2)^70, \\\"YI\\\" => BigInt(2)^80,\\n \\\"XI\\\" => BigInt(2)^90, \\\"WI\\\" => BigInt(2)^100, \\\"VI\\\" => BigInt(2)^110, \\\"UI\\\" => BigInt(2)^120)\\ntwosuff = collect(keys(twocharsuffixes))\\n\\nonecharsuffixes = Dict(\\\"K\\\" => 10^3, \\\"M\\\" => 10^6, \\\"G\\\" => 10^9, \\\"T\\\" => 10^12, \\\"P\\\" => 10^15,\\n \\\"E\\\" => 10^18, \\\"Z\\\" => 10^21, \\\"Y\\\" => BigInt(10)^24,\\n \\\"X\\\" => BigInt(10)^27, \\\"W\\\" => BigInt(10)^30,\\n \\\"V\\\" => BigInt(10)^33, \\\"U\\\" => BigInt(10)^36)\\nonesuff = collect(keys(onecharsuffixes))\\n\\nfunction firstsuffix(s, x)\\n str = uppercase(s)\\n if str[1] == '!'\\n lastbang = something(findfirst(x -> x != '!', str), length(str))\\n return prod(x:-lastbang:1) / x, lastbang\\n end\\n for pstr in partials\\n if match(Regex(\\\"^\\\" * pstr), str) != nothing\\n fullsuffix = partialsuffixes[pstr]\\n n = length(pstr)\\n while n < length(fullsuffix) && n < length(str) && fullsuffix[n+1] == str[n+1]\\n n += 1\\n end\\n return BigInt(multicharsuffixes[fullsuffix]), n\\n end\\n end\\n for pstr in twosuff\\n if match(Regex(\\\"^\\\" * pstr), str) != nothing\\n return BigInt(twocharsuffixes[pstr]), 2\\n end\\n end\\n for pstr in onesuff\\n if match(Regex(\\\"^\\\" * pstr), str) != nothing\\n return BigInt(onecharsuffixes[pstr]), 1\\n end\\n end\\n return 1, length(s)\\nend\\n\\nfunction parsesuffix(s, x)\\n str = s\\n mult = BigInt(1)\\n n = 1\\n while n <= length(str)\\n multiplier, n = firstsuffix(str, x)\\n mult *= multiplier\\n str = str[n+1:end]\\n end\\n mult\\nend\\n\\nfunction suffixednumber(s)\\n if (endnum = findlast(isdigit, s)) == nothing\\n return NaN\\n end\\n x = BigFloat(replace(s[1:endnum], \\\",\\\" => \\\"\\\"))\\n return x * (endnum < length(s) ? parsesuffix(s[endnum + 1:end], x) : 1)\\nend\\n\\nconst testcases =\\n[\\\"2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\\",\\n \\\"1,567 +1.567k 0.1567e-2m\\\",\\n \\\"25.123kK 25.123m 2.5123e-00002G\\\",\\n \\\"25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\\",\\n \\\"-.25123e-34Vikki 2e-77gooGols\\\",\\n \\\"9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\\"]\\n\\nfunction testsuffixes()\\n for line in testcases\\n cases = split(line)\\n println(\\\"Testing: \\\", string.(cases))\\n println(\\\"Results: \\\", join(map(x -> format(suffixednumber(x), commas=true), cases), \\\" \\\"), \\\"\\\\n\\\")\\n end\\nend\\n\\ntestsuffixes()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import re, strutils, parseutils, tables, math\\nconst input = \\\"\\\"\\\"\\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n 1,567 +1.567k 0.1567e-2m\\n 25.123kK 25.123m 2.5123e-00002G\\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n -.25123e-34Vikki 2e-77gooGols\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n \\\"\\\"\\\"\\nlet\\n abbrAlpha = re(r\\\"(PAIR)(s)?$|(SCO)(r|re|res)?$|(DOZ)(e|en|ens)?$|(GR)(o|os|oss)?$|(GREATGR)(o|os|oss)?$|(GOOGOL)(s)?$\\\",\\n flags = {reIgnoreCase})\\n metricBinary = re(r\\\"[KMGTPEZYXWVU]i?\\\", flags = {reIgnoreCase})\\n factorial = re\\\"!+$\\\"\\nconst\\n alphaValues = [2e0, 20e0, 12e0, 144e0, 1728e0, 1e100]\\n metricBinaryValueTab = {\\\"K\\\": 10.0^3, \\\"KI\\\": 2.0^10, \\\"M\\\": 10.0^6, \\\"MI\\\": 2.0^20,\\n \\\"G\\\": 10.0^9, \\\"GI\\\": 2.0^30, \\\"T\\\": 10.0^12, \\\"TI\\\": 2.0^40, \\\"P\\\": 10.0^15,\\n \\\"PI\\\": 2.0^50, \\\"E\\\": 10.0^18, \\\"EI\\\": 2.0^60, \\\"Z\\\": 10.0^21, \\\"ZI\\\": 2.0^70,\\n \\\"Y\\\": 10.0^24, \\\"YI\\\": 2.0^80, \\\"X\\\": 10.0^27, \\\"XI\\\": 2.0^90, \\\"W\\\": 10.0^30,\\n \\\"WI\\\": 2.0^100, \\\"V\\\": 10.0^33, \\\"VI\\\": 2.0^110, \\\"U\\\": 10.0^36,\\n \\\"UI\\\": 2.0^120}.toTable\\nvar\\n matches: array[12, string]\\n res, fac: float\\n suffix: string\\nproc sepFloat(f: float): string =\\n var\\n s = $f\\n i, num: int\\n num = parseInt(s, i)\\n if num == 0:\\n return s\\n else:\\n return insertSep($i, ',', 3)&s[num..^1]\\nfor line in input.splitLines():\\n if not isEmptyOrWhiteSpace(line):\\n echo(\\\"Input:\\\\n\\\", line, \\\"\\\\nOutput:\\\")\\n var output = \\\" \\\"\\n for raw_number in line.replace(\\\",\\\", \\\"\\\").splitWhiteSpace():\\n suffix = raw_number[parseutils.parseFloat(raw_number, res)..^1].toUpper()\\n if suffix.match(abbrAlpha, matches):\\n for i, v in matches.mpairs():\\n if i mod 2 == 0 and not v.isEmptyOrWhiteSpace():\\n res*=alphaValues[i div 2]\\n v = \\\"\\\"\\n break\\n elif suffix.match(factorial):\\n fac = abs(res)-toFloat(len(suffix))\\n while fac > 0:\\n res*=fac\\n fac-=toFloat(len(suffix))\\n elif suffix.match(metricBinary):\\n for m in suffix.findAll(metricBinary):\\n res*=metricBinaryValueTab[m]\\n output &= sepFloat(res)&\\\" \\\"\\n echo(output)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # https://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes\\nuse warnings;\\n\\nmy %suffix = qw( k 1e3 m 1e6 g 1e9 t 1e12 p 1e15 e 1e18 z 1e21 y 1e24 x 1e27\\n w 1e30 v 1e33 u 1e36 ki 2**10 mi 2**20 gi 2**30 ti 2**40 pi 2**50 ei 2**60\\n zi 2**70 yi 2**80 xi 2**90 wi 2**100 vi 2**110 ui 2**120 );\\n\\nlocal $\\\" = ' '; # strange rule...\\nprint \\\"numbers = ${_}results = @{[ map suffix($_), split ]}\\\\n\\\\n\\\" while <DATA>;\\n\\nsub suffix\\n {\\n my ($value, $mods) = shift =~ tr/,//dr =~ /([+-]?[\\\\d.]+(?:e[+-]\\\\d+)?)(.*)/i;\\n $value *= $^R while $mods =~ /\\n PAIRs? (?{ 2 })\\n | SCO(re?)? (?{ 20 })\\n | DOZ(e(ns?)?)? (?{ 12 })\\n | GREATGR(o(ss?)?)? (?{ 1728 }) # must be before GRoss\\n | GR(o(ss?)?)? (?{ 144 })\\n | GOOGOLs? (?{ 10**100 })\\n | [kmgtpezyxwvu]i? (?{ eval $suffix{ lc $& } })\\n | !+ (?{ my $factor = $value;\\n $value *= $factor while ($factor -= length $&) > 1;\\n 1 })\\n /gix;\\n return $value =~ s/(\\\\..*)|\\\\B(?=(\\\\d\\\\d\\\\d)+(?!\\\\d))/$1 || ','/ger;\\n }\\n\\n__DATA__\\n2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n1,567 +1.567k 0.1567e-2m\\n25.123kK 25.123m 2.5123e-00002G\\n25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n-.25123e-34Vikki 2e-77gooGols\\n9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">bigatom</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_scale</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">34</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (min rqd for accuracy on the \\\"Vikki\\\" test)\\n -- (the default is 25, not quite enough here)</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">suffixes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">\\\"GREATGRoss\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1728</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"GOOGOLs\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ba_new</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1e100\\\"</span><span style=\\\"color: #0000FF;\\\">)},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"SCOres\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"DOZens\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"GRoss\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">144</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"PAIRs\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #008000;\\\">\\\"KMGTPEZYXWVU\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">decode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">bigatom</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">BA_ONE</span>\\n <span style=\\\"color: #000000;\\\">suffix</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">)></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">suffix</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">suffixes</span><span style=\\\"color: #0000FF;\\\">[$])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">'I'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ba_power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1024</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">suffix</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ba_power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">suffix</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">facto</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">bigatom</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">bigatom</span> <span style=\\\"color: #000000;\\\">nf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">ba_compare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nf</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)>=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nf</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">nf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nf</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">test_cases</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n 2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n 1,567 +1.567k 0.1567e-2m\\n 25.123kK 25.123m 2.5123e-00002G\\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n -.25123e-34Vikki 2e-77gooGols\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n 0.017k!!\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test_cases</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">no_empty</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">test</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">suffix</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">facts</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #008000;\\\">'!'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$]}</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">digit</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">digit</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #008000;\\\">'9'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$]}</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">bigatom</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_new</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\",\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">decode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">suffix</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">facto</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ns</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ba_sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%30s : %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">ns</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from functools import reduce\\nfrom operator import mul\\nfrom decimal import *\\n\\ngetcontext().prec = MAX_PREC\\n\\ndef expand(num):\\n suffixes = [\\n # (name, min_abbreviation_length, base, exponent)\\n ('greatgross', 7, 12, 3),\\n ('gross', 2, 12, 2),\\n ('dozens', 3, 12, 1),\\n ('pairs', 4, 2, 1),\\n ('scores', 3, 20, 1),\\n ('googols', 6, 10, 100),\\n ('ki', 2, 2, 10),\\n ('mi', 2, 2, 20),\\n ('gi', 2, 2, 30),\\n ('ti', 2, 2, 40),\\n ('pi', 2, 2, 50),\\n ('ei', 2, 2, 60),\\n ('zi', 2, 2, 70),\\n ('yi', 2, 2, 80),\\n ('xi', 2, 2, 90),\\n ('wi', 2, 2, 100),\\n ('vi', 2, 2, 110),\\n ('ui', 2, 2, 120),\\n ('k', 1, 10, 3),\\n ('m', 1, 10, 6),\\n ('g', 1, 10, 9),\\n ('t', 1, 10, 12),\\n ('p', 1, 10, 15),\\n ('e', 1, 10, 18),\\n ('z', 1, 10, 21),\\n ('y', 1, 10, 24),\\n ('x', 1, 10, 27),\\n ('w', 1, 10, 30)\\n ]\\n\\n num = num.replace(',', '').strip().lower()\\n\\n if num[-1].isdigit():\\n return float(num)\\n\\n for i, char in enumerate(reversed(num)):\\n if char.isdigit():\\n input_suffix = num[-i:]\\n num = Decimal(num[:-i])\\n break\\n\\n if input_suffix[0] == '!':\\n return reduce(mul, range(int(num), 0, -len(input_suffix)))\\n\\n while len(input_suffix) > 0:\\n for suffix, min_abbrev, base, power in suffixes:\\n if input_suffix[:min_abbrev] == suffix[:min_abbrev]:\\n for i in range(min_abbrev, len(input_suffix) + 1):\\n if input_suffix[:i+1] != suffix[:i+1]:\\n num *= base ** power\\n input_suffix = input_suffix[i:]\\n break\\n break\\n\\n return num\\n\\n\\ntest = \\\"2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\\\n\\\\\\n 1,567 +1.567k 0.1567e-2m\\\\n\\\\\\n 25.123kK 25.123m 2.5123e-00002G\\\\n\\\\\\n 25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\\\n\\\\\\n -.25123e-34Vikki 2e-77gooGols\\\\n\\\\\\n 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\\"\\n\\nfor test_line in test.split(\\\"\\\\n\\\"):\\n test_cases = test_line.split()\\n print(\\\"Input:\\\", ' '.join(test_cases))\\n print(\\\"Output:\\\", ' '.join(format(result, ',f').strip('0').strip('.') for result in map(expand, test_cases)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"use Rat::Precise;\\n\\nmy $googol = 10**100;\\n«PAIRs 2 SCOres 20 DOZens 12 GRoss 144 GREATGRoss 1728 GOOGOLs $googol»\\n ~~ m:g/ ((<.:Lu>+) <.:Ll>*) \\\\s+ (\\\\S+) /;\\n\\nmy %abr = |$/.map: {\\n my $abbrv = .[0].Str.fc;\\n my $mag = +.[1];\\n |map { $abbrv.substr( 0, $_ ) => $mag },\\n .[0][0].Str.chars .. $abbrv.chars\\n}\\n\\nmy %suffix = flat %abr,\\n(<K M G T P E Z Y X W V U>».fc Z=> (1000, * * 1000 … *)),\\n(<Ki Mi Gi Ti Pi Ei Zi Yi Xi Wi Vi Ui>».fc Z=> (1024, * * 1024 … *));\\n\\nmy $reg = %suffix.keys.join('|');\\n\\nsub comma ($i is copy) {\\n my $s = $i < 0 ?? '-' !! '';\\n my ($whole, $frac) = $i.split('.');\\n $frac = $frac.defined ?? \\\".$frac\\\" !! '';\\n $s ~ $whole.abs.flip.comb(3).join(',').flip ~ $frac\\n}\\n\\nsub units (Str $str) {\\n $str.fc ~~ /^(.+?)(<alpha>*)('!'*)$/;\\n my ($val, $unit, $fact) = $0, $1.Str.fc, $2.Str;\\n $val.=subst(',', '', :g);\\n if $val ~~ m:i/'e'/ {\\n my ($m,$e) = $val.split(/<[eE]>/);\\n $val = ($e < 0)\\n ?? $m * FatRat.new(1,10**-$e)\\n !! $m * 10**$e;\\n }\\n my @suf = $unit;\\n unless %suffix{$unit}:exists {\\n $unit ~~ /(<$reg>)+/;\\n @suf = $0;\\n }\\n my $ret = $val<>;\\n $ret = [*] $ret, |@suf.map: { %suffix{$_} } if @suf[0];\\n $ret = [*] ($ret, * - $fact.chars …^ * < 2) if $fact.chars;\\n $ret.?precise // $ret\\n}\\n\\nmy $test = q:to '===';\\n2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre\\n1,567 +1.567k 0.1567e-2m\\n25.123kK 25.123m 2.5123e-00002G\\n25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei\\n-.25123e-34Vikki 2e-77gooGols\\n9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n.017k!!\\n===\\n\\nprintf \\\"%16s: %s\\\\n\\\", $_, comma .&units for $test.words;\\n\\n# Task required stupid layout\\n# say \\\"\\\\n In: $_\\\\nOut: \\\", .words.map({comma .&units}).join(' ') for $test.lines;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm converts numbers (with commas) with suffix multipliers──►pure decimal numbers*/\\nnumeric digits 2000 /*allow the usage of ginormous numbers.*/\\n@.=; @.1= '2greatGRo 24Gros 288Doz 1,728pairs 172.8SCOre'\\n @.2= '1,567 +1.567k 0.1567e-2m'\\n @.3= '25.123kK 25.123m 2.5123e-00002G'\\n @.4= '25.123kiKI 25.123Mi 2.5123e-00002Gi +.25123E-7Ei'\\n @.5= '-.25123e-34Vikki 2e-77gooGols'\\n @.6= 9! 9!! 9!!! 9!!!! 9!!!!! 9!!!!!! 9!!!!!!! 9!!!!!!!! 9!!!!!!!!!\\n\\nparse arg x /*obtain optional arguments from the CL*/\\nif x\\\\=='' then do; @.2=; @.1=x /*use the number(s) specified on the CL*/\\n end /*allow user to specify their own list.*/\\n /* [↓] handle a list or multiple lists*/\\n do n=1 while @.n\\\\==''; $= /*process each of the numbers in lists.*/\\n say 'numbers= ' @.n /*echo the original arg to the terminal*/\\n\\n do j=1 for words(@.n); y= word(@.n, j) /*obtain a single number from the input*/\\n $= $ ' 'commas( num(y) ) /*process a number; add result to list.*/\\n end /*j*/ /* [↑] add commas to number if needed.*/\\n /* [↑] add extra blank betweenst nums.*/\\n say ' result= ' strip($); say /*echo the result(s) to the terminal. */\\n end /*n*/ /* [↑] elide the pre-pended blank. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisInt: return datatype( arg(1), 'Whole') /*return 1 if arg is an integer, or 0 */\\nisNum: return datatype( arg(1), 'Number') /* \\\" \\\" \\\" \\\" \\\" a number. \\\" \\\" */\\np: return word( arg(1), 1) /*pick 1st argument or 2nd argument. */\\nser: say; say '***error*** ' arg(1); say; exit 13\\nshorten:procedure; parse arg a,n; return left(a, max(0, length(a) - p(n 1) ) )\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$fact!: procedure; parse arg x _ .; L= length(x); n= L - length(strip(x, 'T', \\\"!\\\") )\\n if n<=-n | _\\\\=='' | arg()\\\\==1 then return x; z= left(x, L - n)\\n if z<0 | \\\\isInt(z) then return x; return $fact(z, n)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$fact: procedure; parse arg x _ .; arg ,n ! .; n= p(n 1); if \\\\isInt(n) then n= 0\\n if x<-n | \\\\isInt(x) |n<1 | _||!\\\\=='' |arg()>2 then return x||copies(\\\"!\\\",max(1,n))\\n s= x // n; if s==0 then s= n /*compute where to start multiplying. */\\n != 1 /*the initial factorial product so far.*/\\n do j=s to x by n; != !*j /*perform the actual factorial product.*/\\n end /*j*/ /*{operator // is REXX's ÷ remainder}*/\\n return ! /* [↑] handles any level of factorial.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$sfxa: parse arg u,s 1 c,m; upper u c /*get original version & upper version.*/\\n if pos( left(s, 2), u)\\\\==0 then do j=length(s) to compare(s, c)-1 by -1\\n if right(u, j) \\\\== left(c, j) then iterate\\n _= left(u, length(u) - j) /*get the num.*/\\n if isNum(_) then return m * _ /*good suffix.*/\\n leave /*return as is*/\\n end\\n return arg(1) /* [↑] handles an alphabetic suffixes.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$sfx!: parse arg y; if right(y, 1)=='!' then y= $fact!(y)\\n if \\\\isNum(y) then y=$sfxz(); if isNum(y) then return y; return $sfxm(y)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$sfxm: parse arg z 1 w; upper w; @= 'KMGTPEZYXWVU'; b= 1000\\n if right(w, 1)=='I' then do; z= shorten(z); w= z; upper w; b= 1024\\n end\\n _= pos( right(w, 1), @); if _==0 then return arg(1)\\n n= shorten(z); r= num(n, , 1); if isNum(r) then return r * b**_\\n return arg(1) /* [↑] handles metric or binary suffix*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n$sfxz: return $sfxa( $sfxa( $sfxa( $sfxa( $sfxa( $sfxa(y, 'PAIRs', 2), 'DOZens', 12), ,\\n 'SCores', 20), 'GREATGRoss', 1728), 'GRoss', 144), 'GOOGOLs', 1e100)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: procedure; parse arg _; n= _'.9'; #= 123456789; b= verify(n, #, \\\"M\\\")\\n e= verify(n, #'0', , verify(n, #\\\"0.\\\", 'M') ) - 4 /* [↑] add commas.*/\\n do j=e to b by -3; _= insert(',', _, j); end /*j*/; return _\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nnum: procedure; parse arg x .,,q; if x=='' then return x\\n if isNum(x) then return x/1; x= space( translate(x, , ','), 0)\\n if \\\\isNum(x) then x= $sfx!(x); if isNum(x) then return x/1\\n if q==1 then return x\\n if q=='' then call ser \\\"argument isn't numeric or doesn't have a legal suffix:\\\" x\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigRat\\nimport \\\"./str\\\" for Str\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar abbrevs = {\\n \\\"PAIRs\\\": [4, 2], \\\"SCOres\\\": [3, 20], \\\"DOZens\\\": [3, 12],\\n \\\"GRoss\\\": [2, 144], \\\"GREATGRoss\\\": [7, 1728], \\\"GOOGOLs\\\": [6, 1e100]\\n}\\n\\nvar metric = {\\n \\\"K\\\": 1e3, \\\"M\\\": 1e6, \\\"G\\\": 1e9, \\\"T\\\": 1e12, \\\"P\\\": 1e15, \\\"E\\\": 1e18,\\n \\\"Z\\\": 1e21, \\\"Y\\\": 1e24, \\\"X\\\": 1e27, \\\"W\\\": 1e30, \\\"V\\\": 1e33, \\\"U\\\": 1e36\\n}\\n\\nvar b = Fn.new { |e| BigRat.two.pow(e) }\\n\\nvar binary = {\\n \\\"Ki\\\": b.call(10), \\\"Mi\\\": b.call(20), \\\"Gi\\\": b.call(30), \\\"Ti\\\": b.call(40),\\n \\\"Pi\\\": b.call(50), \\\"Ei\\\": b.call(60), \\\"Zi\\\": b.call(70), \\\"Yi\\\": b.call(80),\\n \\\"Xi\\\": b.call(90), \\\"Wi\\\": b.call(100), \\\"Vi\\\": b.call(110), \\\"Ui\\\": b.call(120)\\n}\\n\\nvar googol = BigRat.fromDecimal(\\\"1e100\\\")\\n\\nvar fact = Fn.new { |num, d|\\n var prod = 1\\n var n = Num.fromString(num)\\n var i = n\\n while (i > 0) {\\n prod = prod * i\\n i = i - d\\n }\\n return prod\\n}\\n\\nvar parse = Fn.new { |number|\\n // find index of last digit\\n var i = number.count - 1\\n while (i >= 0) {\\n if (48 <= number.bytes[i] && number.bytes[i] <= 57) break\\n i = i - 1\\n }\\n var num = number[0..i]\\n num = num.replace(\\\",\\\", \\\"\\\") // get rid of any commas\\n var suf = Str.upper(number[i+1..-1])\\n if (suf == \\\"\\\") return BigRat.fromDecimal(num)\\n if (suf[0] == \\\"!\\\") {\\n var prod = fact.call(num, suf.count)\\n return BigRat.new(prod)\\n }\\n for (me in abbrevs) {\\n var kk = Str.upper(me.key)\\n if (kk.startsWith(suf) && suf.count >= me.value[0]) {\\n var t1 = BigRat.fromDecimal(num)\\n var t2 = (me.key != \\\"GOOGOLS\\\") ? BigRat.fromDecimal(me.value[1]) : googol\\n return t1 * t2\\n }\\n }\\n var bf = BigRat.fromDecimal(num)\\n for (me in metric) {\\n var j = 0\\n while (j < suf.count) {\\n if (me.key == suf[j]) {\\n if (j < suf.count-1 && suf[j+1] == \\\"I\\\") {\\n bf = bf * binary[me.key + \\\"i\\\"]\\n j = j + 1\\n } else {\\n bf = bf * me.value\\n }\\n }\\n j = j + 1\\n }\\n }\\n return bf\\n}\\n\\nvar process = Fn.new { |numbers|\\n System.write(\\\"numbers = \\\")\\n for (number in numbers) Fmt.write(\\\"$s \\\", number)\\n System.write(\\\"\\\\nresults = \\\")\\n for (number in numbers) {\\n var res = parse.call(number)\\n if (res.isInteger) {\\n Fmt.write(\\\"$,s \\\", res.toDecimal(50))\\n } else {\\n var sres = Fmt.swrite(\\\"$,s\\\", res.truncate.toDecimal)\\n Fmt.write(\\\"$s \\\", sres + res.fraction.abs.toDecimal(50)[1..-1])\\n }\\n }\\n System.print(\\\"\\\\n\\\")\\n}\\n\\nvar numbers = [\\\"2greatGRo\\\", \\\"24Gros\\\", \\\"288Doz\\\", \\\"1,728pairs\\\", \\\"172.8SCOre\\\"]\\nprocess.call(numbers)\\n\\nnumbers = [\\\"1,567\\\", \\\"+1.567k\\\", \\\"0.1567e-2m\\\"]\\nprocess.call(numbers)\\n\\nnumbers = [\\\"25.123kK\\\", \\\"25.123m\\\", \\\"2.5123e-00002G\\\"]\\nprocess.call(numbers)\\n\\nnumbers = [\\\"25.123kiKI\\\", \\\"25.123Mi\\\", \\\"2.5123e-00002Gi\\\", \\\"+.25123E-7Ei\\\"]\\nprocess.call(numbers)\\n\\nnumbers = [\\\"-.25123e-34Vikki\\\", \\\"2e-77gooGols\\\"]\\nprocess.call(numbers)\\n\\nnumbers = [\\\"9!\\\", \\\"9!!\\\", \\\"9!!!\\\", \\\"9!!!!\\\", \\\"9!!!!!\\\", \\\"9!!!!!!\\\", \\\"9!!!!!!!\\\", \\\"9!!!!!!!!\\\", \\\"9!!!!!!!!!\\\"]\\nprocess.call(numbers)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var [const] BI=Import.lib(\\\"zklBigNum\\\"); // GMP\\nvar kRE,kD, aRE,aD;\\n\\nkRE,kD = ki();\\naRE,aD = abrevCreate();\\n\\nfcn naSuffixes(numStr){\\n var [const]\\n numRE=RegExp(0'^([+-]*\\\\.*\\\\d+[.]*\\\\d*E*[+-]*\\\\d*)^),\\n bangRE=RegExp(0'^(!+)^);\\n\\n nstr:=(numStr - \\\" ,\\\").toUpper();\\n numRE.search(nstr);\\n nstr,r := nstr[numRE.matched[0][1],*], numRE.matched[1];\\n if(r.matches(\\\"*[.E]*\\\")) r=r.toFloat(); // arg!\\n if(r.matches(\\\"*[.E]*\\\")) r=r.toFloat(); // arg!\\n else \\t\\t r=BI(r);\\n\\n reg z;\\n do{\\n z=nstr;\\t// use this to see if we actually did anything\\n if(aRE.search(nstr)){\\n\\t ns,k := aRE.matched;\\t// ((0,3),\\\"SCO\\\")\\n\\t re,b := aD[k];\\t\\t// (RegExp(\\\"R|RE|RES\\\"),BI(20)),\\n\\t nstr = nstr[ns[1],*];\\n\\t if(re.search(nstr)) nstr=nstr[re.matched[0][1],*]; # remove abbrev tail\\n\\t r=r*b;\\n continue;\\n }else if(kRE.search(nstr)){\\n\\t r*=kD[kRE.matched[1]];\\t // \\\"K\\\":1000 ...\\n\\t nstr=nstr[kRE.matched[0][1],*];\\n continue;\\n }else if(bangRE.search(nstr)){ // floats are converted to int\\n\\t n,k,z := r.toInt(), bangRE.matched[0][1], n - k;\\n\\t r,nstr = BI(n), nstr[k,*];\\n\\t while(z>0){ r.mul(z); z-=k; }\\n continue;\\n }\\n }while(nstr and z!=nstr);\\n r\\n}\\n\\nfcn ki{ // case insensitive: k, ki,\\n ss:=\\\"K M G T P E Z Y X W V U\\\".split();\\n d:=Dictionary();\\n ss.zipWith(d.add,[3..3*(ss.len()),3].apply(BI(10).pow)); # E:1e+18\\n ss.apply(\\\"append\\\",\\\"I\\\")\\n .zipWith(d.add,[10..10*(ss.len()),10].apply(BI(2).pow)); # EI:1.15292e+18\\n re:=\\\"([%s]I\\\\\\\\?)\\\".fmt(ss.concat()); // \\\"([KMGTPEZYXWVU]I\\\\?)\\\"\\n return(RegExp(re),d);\\n}\\nfcn abrevCreate{\\n var upDown=RegExp(\\\"([A-Z]+)(.*)\\\");\\n s:=\\\"PAIRs 2; SCOres 20; DOZens 12; GREATGRoss 1728; GRoss 144; GOOGOLs 10e100\\\".split(\\\";\\\");\\n abrevs,re := Dictionary(), Sink(String);\\n foreach an in (s){\\n a,n := an.split();\\n upDown.search(a);\\n u,d := upDown.matched[1,2];\\n d=d.len().pump(List, // \\\"R|RE|RES\\\"\\n '+(1),d.get.fp(0),\\\"toUpper\\\").reverse().concat(\\\"|\\\");\\n abrevs.add(u,T(RegExp(d),BI(n)));\\n re.write(u,\\\" \\\");\\n }\\n // \\\"PAIR|SCO|DOZ|GR|GREATGR|GOOGOL\\\"\\n re=RegExp(\\\"(%s)\\\".fmt(re.close().strip().replace(\\\" \\\",\\\"|\\\")));\\n return(re,abrevs);\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach na in (T(\\\"2greatGRo\\\", \\\"24Gros\\\", \\\"288Doz\\\", \\\"1,728pairs\\\", \\\"172.8SCOre\\\",\\n \\\"1,567\\\", \\\"+1.567k\\\", \\\"0.1567e-2m\\\",\\n \\\"25.123kK\\\", \\\"25.123m\\\", \\\"2.5123e-00002G\\\",\\n \\\"25.123kiKI\\\", \\\"25.123Mi\\\", \\\"2.5123e-00002Gi\\\", \\\"+.25123E-7Ei\\\",\\n \\\"-.25123e-34Vikki\\\", \\\"2e-77gooGols\\\",\\n \\\"9!\\\", \\\"9!!\\\", \\\"9!!!\\\", \\\"9!!!!\\\", \\\"9!!!!!\\\", \\\"9!!!!!!\\\",\\n \\\"9!!!!!!!\\\", \\\"9!!!!!!!!\\\", \\\"9!!!!!!!!!\\\",\\n \\\"9!!!!!!!!!k\\\", \\\".017k!!\\\", \\\"4 dozensK\\\", \\\"2 dozen pairs\\\")){\\n\\n if((r:=naSuffixes(na)).isType(Float)) println(\\\"%16s : %,f\\\".fmt(na,r));\\n else \\t\\t\\t\\t println(\\\"%16s : %,d\\\".fmt(na,r));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Numerical-and-alphabetical-suffixes"}}},{"rowIdx":1457,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Arithmetic\n- Mathematics\nfrom: http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature\nnote: Arithmetic operations\n","language":"00-META"},{"code":"{|border=1 cellspacing=0 cellpadding=3\n|In a general [[wp:Gaussian quadrature|Gaussian quadrature]] rule, an definite integral of <math>f(x)</math> is first approximated over the interval <math>[-1,1]</math> by a polynomial approximable function <math>g(x)</math> and a known weighting function <math>W(x)</math>.\n|<math>\\int_{-1}^1 f(x) \\, dx = \\int_{-1}^1 W(x) g(x) \\, dx</math>\n|-\n|Those are then approximated by a sum of function values at specified points <math>x_i</math> multiplied by some weights <math>w_i</math>:\n|<math>\\int_{-1}^1 W(x) g(x) \\, dx \\approx \\sum_{i=1}^n w_i g(x_i)</math>\n|-\n|In the case of Gauss-Legendre quadrature, the weighting function <math>W(x) = 1</math>, so we can approximate an integral of <math>f(x)</math> with:\n|<math>\\int_{-1}^1 f(x)\\,dx \\approx \\sum_{i=1}^n w_i f(x_i)</math>\n|}\n\n\nFor this, we first need to calculate the nodes and the weights, but after we have them, we can reuse them for numerious integral evaluations, which greatly speeds up the calculation compared to more [[Numerical Integration|simple numerical integration methods]].\n\n{|border=1 cellspacing=0 cellpadding=3\n|The <math>n</math> evaluation points <math>x_i</math> for a n-point rule, also called \"nodes\", are roots of n-th order [[wp:Legendre Polynomials|Legendre Polynomials]] <math>P_n(x)</math>. Legendre polynomials are defined by the following recursive rule:\n|<math>P_0(x) = 1</math><br/>\n<math>P_1(x) = x</math><br/>\n<math>nP_{n}(x) = (2n-1)xP_{n-1}(x)-(n-1)P_{n-2}(x)</math>\n|-\n|There is also a recursive equation for their derivative:\n|<math>P_{n}'(x) = \\frac{n}{x^2-1} \\left( x P_n(x) - P_{n-1}(x) \\right)</math>\n|-\n|The roots of those polynomials are in general not analytically solvable, so they have to be approximated numerically, for example by [[wp:Newton's method|Newton-Raphson iteration]]:\n|<math>x_{n+1} = x_n - \\frac{f(x_n)}{f'(x_n)}</math>\n|-\n|The first guess <math>x_0</math> for the <math>i</math>-th root of a <math>n</math>-order polynomial <math>P_n</math> can be given by\n|<math>x_0 = \\cos \\left( \\pi \\, \\frac{i - \\frac{1}{4}}{n+\\frac{1}{2}} \\right)</math>\n|-\n|After we get the nodes <math>x_i</math>, we compute the appropriate weights by:\n|<math>w_i = \\frac{2}{\\left( 1-x_i^2 \\right) [P'_n(x_i)]^2}</math>\n|-\n|After we have the nodes and the weights for a n-point quadrature rule, we can approximate an integral over any interval <math>[a,b]</math> by\n|<math>\\int_a^b f(x)\\,dx \\approx \\frac{b-a}{2} \\sum_{i=1}^n w_i f\\left(\\frac{b-a}{2}x_i + \\frac{a+b}{2}\\right)</math>\n|}\n\n\n'''Task description'''\n\nSimilar to the task [[Numerical Integration]], the task here is to calculate the definite integral of a function <math>f(x)</math>, but by applying an n-point Gauss-Legendre quadrature rule, as described [[wp:Gaussian Quadrature|here]], for example. The input values should be an function f to integrate, the bounds of the integration interval a and b, and the number of gaussian evaluation points n. An reference implementation in Common Lisp is provided for comparison.\n\nTo demonstrate the calculation, compute the weights and nodes for an 5-point quadrature rule and then use them to compute:\n <big><big><math>\\int_{-3}^{3} \\exp(x) \\, dx \\approx \\sum_{i=1}^5 w_i \\; \\exp(x_i) \\approx 20.036</math></big></big>\n<br><br>\n\n","language":"00-TASK"},{"code":"F legendreIn(x, n)\n F prev1(idx, pn1)\n R (2 * idx - 1) * @x * pn1\n F prev2(idx, pn2)\n R (idx - 1) * pn2\n\n I n == 0\n R 1.0\n E I n == 1\n R x\n E\n V result = 0.0\n V p1 = x\n V p2 = 1.0\n L(i) 2 .. n\n result = (prev1(i, p1) - prev2(i, p2)) / i\n p2 = p1\n p1 = result\n R result\n\nF deriveLegendreIn(x, n)\n F calcresult(curr, prev)\n R Float(@n) / (@x ^ 2 - 1) * (@x * curr - prev)\n R calcresult(legendreIn(x, n), legendreIn(x, n - 1))\n\nF guess(n, i)\n R cos(math:pi * (i - 0.25) / (n + 0.5))\n\nF nodes(n)\n V result = [(0.0, 0.0)] * n\n F calc(x)\n R legendreIn(x, @n) / deriveLegendreIn(x, @n)\n\n L(i) 0 .< n\n V x = guess(n, i + 1)\n V x0 = x\n x -= calc(x)\n L abs(x - x0) > 1e-12\n x0 = x\n x -= calc(x)\n\n result[i] = (x, 2 / ((1.0 - x ^ 2) * (deriveLegendreIn(x, n)) ^ 2))\n\n R result\n\nF integ(f, ns, p1, p2)\n F dist()\n R (@p2 - @p1) / 2\n F avg()\n R (@p1 + @p2) / 2\n V result = dist()\n V sum = 0.0\n V thenodes = [0.0] * ns\n V weights = [0.0] * ns\n L(nw) nodes(ns)\n sum += nw[1] * f(dist() * nw[0] + avg())\n thenodes[L.index] = nw[0]\n weights[L.index] = nw[1]\n\n print(‘ nodes:’, end' ‘’)\n L(n) thenodes\n print(‘ #.5’.format(n), end' ‘’)\n print()\n print(‘ weights:’, end' ‘’)\n L(w) weights\n print(‘ #.5’.format(w), end' ‘’)\n print()\n R result * sum\n\nprint(‘integral: ’integ(x -> exp(x), 5, -3, 3))\n","language":"11l"},{"code":"#include \"share/atspre_staload.hats\"\n\n%{^\n#include <float.h>\n#include <math.h>\n%}\n\nextern fn {tk : tkind} g0float_pi : () -<> g0float tk\nextern fn {tk : tkind} g0float_cos : g0float tk -<> g0float tk\nextern fn {tk : tkind} g0float_exp : g0float tk -<> g0float tk\nimplement g0float_pi<dblknd> () = $extval (double, \"M_PI\")\nimplement g0float_cos<dblknd> x = $extfcall (double, \"cos\", x)\nimplement g0float_exp<dblknd> x = $extfcall (double, \"exp\", x)\n\nmacdef PI = g0float_pi ()\noverload cos with g0float_cos\noverload exp with g0float_exp\n\nmacdef NAN = g0f2f ($extval (float, \"NAN\"))\nmacdef Zero = g0i2f 0\nmacdef One = g0i2f 1\nmacdef Two = g0i2f 2\n\n(* Computes the initial guess for the root i of a n-order Legendre\n polynomial. *)\nfn {tk : tkind}\nguess {n, i : int | 1 <= i; i <= n}\n (n : int n, i : int i) :<> g0float tk =\n cos (PI * ((g0i2f i - g0f2f 0.25) / (g0i2f n + g0f2f 0.5)))\n\n(* Computes and evaluates the degree-n Legendre polynomial at the\n point x. *)\nfn {tk : tkind}\nlegpoly {n : pos}\n (n : int n, x : g0float tk) :<> g0float tk =\n let\n fun\n loop {i : int | 2 <= i; i <= n + 1} .<n + 1 - i>.\n (i : int i, pa : g0float tk, pb : g0float tk)\n :<> g0float tk =\n if i = succ n then\n pb\n else\n let\n val iflt = (g0i2f i) : g0float tk\n val pn = (((iflt + iflt - One) / iflt) * x * pb)\n - (((iflt - One) / iflt) * pa)\n in\n loop (succ i, pb, pn)\n end\n in\n if n = 0 then\n One\n else if n = 1 then\n x\n else\n loop (2, One, x)\n end\n\n(* Computes and evaluates the derivative of an n-order Legendre\n polynomial at point x. *)\nfn {tk : tkind}\nlegdiff {n : int | 2 <= n}\n (n : int n, x : g0float tk) :<> g0float tk =\n (g0i2f n / ((x * x) - One))\n * ((x * legpoly<tk> (n, x)) - legpoly<tk> (pred n, x))\n\n(* Computes the n nodes for an n-point quadrature rule (the n roots of\n a degree-n polynomial). *)\nfn {tk : tkind}\nnodes {n : int | 2 <= n}\n (n : int n) :<!refwrt> arrayref (g0float tk, n) =\n let\n val x = arrayref_make_elt<g0float tk> (i2sz n, Zero)\n fn\n v_update (v : g0float tk) :<> g0float tk =\n v - (legpoly<tk> (n, v) / legdiff<tk> (n, v))\n var i : Int\n in\n for* {i : nat | i <= n} .<n - i>.\n (i : int i) =>\n (i := 0; i <> n; i := succ i)\n let\n val v = guess<tk> (n, succ i)\n val v = v_update v\n val v = v_update v\n val v = v_update v\n val v = v_update v\n val v = v_update v\n in\n x[i] := v\n end;\n x\n end\n\n(* Computes the weight for an degree-n polynomial at the node x. *)\nfn {tk : tkind}\nlegwts {n : int | 2 <= n}\n (n : int n, x : g0float tk) :<> g0float tk =\n (* Here I am having slightly excessive fun with notation: *)\n Two / ((One - (x * x)) * (y * y where {val y = legdiff<tk> (n, x)}))\n (* Normally I would not write code in such fashion. :) Nevertheless,\n it is interesting that this works. *)\n\n(* Takes an array of nodes x and computes an array of corresponding\n weights w. Note that x is an arrayref, not an arrszref, and so\n (unlike in the Common Lisp) we have to tell the function the size\n of the new array w. That information is not otherwise stored AT\n RUNTIME. The ATS compiler, however, will force us AT COMPILE TIME\n to pass the correct size. *)\nfn {tk : tkind}\nweights {n : int | 2 <= n}\n (n : int n, x : arrayref (g0float tk, n))\n :<!refwrt> arrayref (g0float tk, n) =\n let\n val w = arrayref_make_elt<g0float tk> (i2sz n, Zero)\n var i : Int\n in\n for* {i : nat | i <= n} .<n - i>.\n (i : int i) =>\n (i := 0; i <> n; i := succ i)\n w[i] := legwts (n, x[i]);\n w\n end\n\n(* Estimates the definite integral of a function on [a,b], using an\n n-point Gauss-Legendre quadrature rule. *)\nfn {tk : tkind}\nquad {n : int | 2 <= n}\n (f : g0float tk -<> g0float tk,\n n : int n,\n a : g0float tk,\n b : g0float tk) :<> g0float tk =\n let\n val x = $effmask_ref ($effmask_wrt (nodes<tk> n))\n val w = $effmask_ref ($effmask_wrt (weights<tk> (n, x)))\n\n val ahalf = g0f2f 0.5 * a and bhalf = g0f2f 0.5 * b\n val C1 = bhalf - ahalf and C2 = ahalf + bhalf\n\n fun\n loop {i : nat | i <= n} .<n - i>.\n (i : int i, sum : g0float tk) :<> g0float tk =\n if i = n then\n sum\n else\n let\n val y = $effmask_ref (w[i] * f ((C1 * x[i]) + C2))\n in\n loop (succ i, sum + y)\n end\n in\n C1 * loop (0, Zero)\n end\n\nimplement\nmain () =\n let\n val outf = stdout_ref\n in\n fprintln! (outf, \"nodes<dblknd> 5\");\n fprint_arrayref_sep<double> (outf, nodes<dblknd> (5),\n i2sz 5, \" \");\n fprintln! (outf); fprintln! (outf);\n fprintln! (outf, \"weights (nodes<dblknd> 5)\");\n fprint_arrayref_sep<double> (outf, weights (5, nodes<dblknd> (5)),\n i2sz 5, \" \");\n fprintln! (outf); fprintln! (outf);\n fprintln! (outf, \"quad (lam x => exp x, 5, ~3.0, 3.0) = \",\n quad (lam x => exp x, 5, ~3.0, 3.0));\n fprintln! (outf);\n fprintln! (outf, \"More examples, borrowed from the Common Lisp:\");\n fprintln! (outf, \"quad (lam x => x ** 3, 5, 0.0, 1.0) = \",\n quad (lam x => x ** 3, 5, 0.0, 1.0));\n fprintln! (outf, \"quad (lam x => 1.0 / x, 5, 1.0, 100.0) = \",\n quad (lam x => 1.0 / x, 5, 1.0, 100.0));\n fprintln! (outf, \"quad (lam x => x, 5, 0.0, 5000.0) = \",\n quad (lam x => x, 5, 0.0, 5000.0));\n fprintln! (outf, \"quad (lam x => x, 5, 0.0, 6000.0) = \",\n quad (lam x => x, 5, 0.0, 6000.0));\n 0\n end\n","language":"ATS"},{"code":"NNI ==> NonNegativeInteger\nRECORD ==> Record(x : List Fraction Integer, w : List Fraction Integer)\n\ngaussCoefficients(n : NNI, eps : Fraction Integer) : RECORD ==\n p := legendreP(n,z)\n q := n/2*D(p, z)*legendreP(subtractIfCan(n,1)::NNI, z)\n x := map(rhs,solve(p,eps))\n w := [subst(1/q, z=xi) for xi in x]\n [x,w]\n\ngaussIntegrate(e : Expression Float, segbind : SegmentBinding(Float), n : NNI) : Float ==\n eps := 1/10^100\n u := gaussCoefficients(n,eps)\n interval := segment segbind\n var := variable segbind\n a := lo interval\n b := hi interval\n c := (a+b)/2\n h := (b-a)/2\n h*reduce(+,[wi*subst(e,var=c+xi*h) for xi in u.x for wi in u.w])\n","language":"Axiom"},{"code":"digits(50)\ngaussIntegrate(4/(1+x^2), x=0..1, 20)\n\n (1) 3.1415926535_8979323846_2643379815_9534002592_872901276\n Type: Float\n% - %pi\n\n (2) - 0.3463549483_9378821092_475 E -26\n","language":"Axiom"},{"code":"#include <stdio.h>\n#include <math.h>\n\n#define N 5\ndouble Pi;\ndouble lroots[N];\ndouble weight[N];\ndouble lcoef[N + 1][N + 1] = {{0}};\n\nvoid lege_coef()\n{\n\tint n, i;\n\tlcoef[0][0] = lcoef[1][1] = 1;\n\tfor (n = 2; n <= N; n++) {\n\t\tlcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\n\t\tfor (i = 1; i <= n; i++)\n\t\t\tlcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1]\n\t\t\t\t\t - (n - 1) * lcoef[n - 2][i] ) / n;\n\t}\n}\n\ndouble lege_eval(int n, double x)\n{\n\tint i;\n\tdouble s = lcoef[n][n];\n\tfor (i = n; i; i--)\n\t\ts = s * x + lcoef[n][i - 1];\n\treturn s;\n}\n\ndouble lege_diff(int n, double x)\n{\n\treturn n * (x * lege_eval(n, x) - lege_eval(n - 1, x)) / (x * x - 1);\n}\n\nvoid lege_roots()\n{\n\tint i;\n\tdouble x, x1;\n\tfor (i = 1; i <= N; i++) {\n\t\tx = cos(Pi * (i - .25) / (N + .5));\n\t\tdo {\n\t\t\tx1 = x;\n\t\t\tx -= lege_eval(N, x) / lege_diff(N, x);\n\t\t} while ( fdim( x, x1) > 2e-16 );\n\t\t/* fdim( ) was introduced in C99, if it isn't available\n\t\t * on your system, try fabs( ) */\n\t\tlroots[i - 1] = x;\n\n\t\tx1 = lege_diff(N, x);\n\t\tweight[i - 1] = 2 / ((1 - x * x) * x1 * x1);\n\t}\n}\n\ndouble lege_inte(double (*f)(double), double a, double b)\n{\n\tdouble c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\n\tint i;\n\tfor (i = 0; i < N; i++)\n\t\tsum += weight[i] * f(c1 * lroots[i] + c2);\n\treturn c1 * sum;\n}\n\nint main()\n{\n\tint i;\n\tPi = atan2(1, 1) * 4;\n\n\tlege_coef();\n\tlege_roots();\n\n\tprintf(\"Roots: \");\n\tfor (i = 0; i < N; i++)\n\t\tprintf(\" %g\", lroots[i]);\n\n\tprintf(\"\\nWeight:\");\n\tfor (i = 0; i < N; i++)\n\t\tprintf(\" %g\", weight[i]);\n\n\tprintf(\"\\nintegrating Exp(x) over [-3, 3]:\\n\\t%10.8f,\\n\"\n\t\t\"compred to actual\\n\\t%10.8f\\n\",\n\t\tlege_inte(exp, -3, 3), exp(3) - exp(-3));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <iomanip>\n#include <cmath>\n\nnamespace Rosetta {\n\n /*! Implementation of Gauss-Legendre quadrature\n * http://en.wikipedia.org/wiki/Gaussian_quadrature\n * http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature\n *\n */\n template <int N>\n class GaussLegendreQuadrature {\n public:\n enum {eDEGREE = N};\n\n /*! Compute the integral of a functor\n *\n * @param a lower limit of integration\n * @param b upper limit of integration\n * @param f the function to integrate\n * @param err callback in case of problems\n */\n template <typename Function>\n double integrate(double a, double b, Function f) {\n double p = (b - a) / 2;\n double q = (b + a) / 2;\n const LegendrePolynomial& legpoly = s_LegendrePolynomial;\n\n double sum = 0;\n for (int i = 1; i <= eDEGREE; ++i) {\n sum += legpoly.weight(i) * f(p * legpoly.root(i) + q);\n }\n\n return p * sum;\n }\n\n /*! Print out roots and weights for information\n */\n void print_roots_and_weights(std::ostream& out) const {\n const LegendrePolynomial& legpoly = s_LegendrePolynomial;\n out << \"Roots: \";\n for (int i = 0; i <= eDEGREE; ++i) {\n out << ' ' << legpoly.root(i);\n }\n out << std::endl;\n out << \"Weights:\";\n for (int i = 0; i <= eDEGREE; ++i) {\n out << ' ' << legpoly.weight(i);\n }\n out << std::endl;\n }\n private:\n /*! Implementation of the Legendre polynomials that form\n * the basis of this quadrature\n */\n class LegendrePolynomial {\n public:\n LegendrePolynomial () {\n // Solve roots and weights\n for (int i = 0; i <= eDEGREE; ++i) {\n double dr = 1;\n\n // Find zero\n Evaluation eval(cos(M_PI * (i - 0.25) / (eDEGREE + 0.5)));\n do {\n dr = eval.v() / eval.d();\n eval.evaluate(eval.x() - dr);\n } while (fabs (dr) > 2e-16);\n\n this->_r[i] = eval.x();\n this->_w[i] = 2 / ((1 - eval.x() * eval.x()) * eval.d() * eval.d());\n }\n }\n\n double root(int i) const { return this->_r[i]; }\n double weight(int i) const { return this->_w[i]; }\n private:\n double _r[eDEGREE + 1];\n double _w[eDEGREE + 1];\n\n /*! Evaluate the value *and* derivative of the\n * Legendre polynomial\n */\n class Evaluation {\n public:\n explicit Evaluation (double x) : _x(x), _v(1), _d(0) {\n this->evaluate(x);\n }\n\n void evaluate(double x) {\n this->_x = x;\n\n double vsub1 = x;\n double vsub2 = 1;\n double f = 1 / (x * x - 1);\n\n for (int i = 2; i <= eDEGREE; ++i) {\n this->_v = ((2 * i - 1) * x * vsub1 - (i - 1) * vsub2) / i;\n this->_d = i * f * (x * this->_v - vsub1);\n\n vsub2 = vsub1;\n vsub1 = this->_v;\n }\n }\n\n double v() const { return this->_v; }\n double d() const { return this->_d; }\n double x() const { return this->_x; }\n\n private:\n double _x;\n double _v;\n double _d;\n };\n };\n\n /*! Pre-compute the weights and abscissae of the Legendre polynomials\n */\n static LegendrePolynomial s_LegendrePolynomial;\n };\n\n template <int N>\n typename GaussLegendreQuadrature<N>::LegendrePolynomial GaussLegendreQuadrature<N>::s_LegendrePolynomial;\n}\n\n// This to avoid issues with exp being a templated function\ndouble RosettaExp(double x) {\n return exp(x);\n}\n\nint main() {\n Rosetta::GaussLegendreQuadrature<5> gl5;\n\n std::cout << std::setprecision(10);\n\n gl5.print_roots_and_weights(std::cout);\n std::cout << \"Integrating Exp(X) over [-3, 3]: \" << gl5.integrate(-3., 3., RosettaExp) << std::endl;\n std::cout << \"Actual value: \" << RosettaExp(3) - RosettaExp(-3) << std::endl;\n}\n","language":"C++"},{"code":"using System;\n//Works in .NET 6+\n//Tested using https://dotnetfiddle.net because im lazy\n\npublic class Program {\n\n public static double[][] legeCoef(int N) {\n //Initialising Jagged Array\n double[][] lcoef = new double[N+1][];\n for (int i=0; i < lcoef.Length; ++i)\n lcoef[i] = new double[N+1];\n\n\n lcoef[0][0] = lcoef[1][1] = 1;\n for (int n = 2; n <= N; n++) {\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\n for (int i = 1; i <= n; i++)\n lcoef[n][i] = ((2*n - 1) * lcoef[n-1][i-1]\n - (n-1) * lcoef[n-2][i] ) / n;\n }\n return lcoef;\n }\n\n\n static double legeEval(double[][] lcoef, int N, double x) {\n double s = lcoef[N][N];\n for (int i = N; i > 0; --i)\n s = s * x + lcoef[N][i-1];\n return s;\n }\n\n static double legeDiff(double[][] lcoef, int N, double x) {\n return N * (x * legeEval(lcoef, N, x) - legeEval(lcoef, N-1, x)) / (x*x - 1);\n }\n\n static void legeRoots(double[][] lcoef, int N, out double[] lroots, out double[] weight) {\n lroots = new double[N];\n weight = new double[N];\n\n double x, x1;\n for (int i = 1; i <= N; i++) {\n x = Math.Cos(Math.PI * (i - 0.25) / (N + 0.5));\n do {\n x1 = x;\n x -= legeEval(lcoef, N, x) / legeDiff(lcoef, N, x);\n }\n while (x != x1);\n lroots[i-1] = x;\n\n x1 = legeDiff(lcoef, N, x);\n weight[i-1] = 2 / ((1 - x*x) * x1*x1);\n }\n }\n\n\n\n static double legeInte(Func<Double, Double> f, int N, double[] weights, double[] lroots, double a, double b) {\n double c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\n for (int i = 0; i < N; i++)\n sum += weights[i] * f.Invoke(c1 * lroots[i] + c2);\n return c1 * sum;\n }\n\n //..................Main...............................\n public static string Combine(double[] arrayD) {\n return string.Join(\", \", arrayD);\t\n }\n\n public static void Main() {\n int N = 5;\n\n var lcoeff = legeCoef(N);\n\n double[] roots;\n double[] weights;\n legeRoots(lcoeff, N, out roots, out weights);\n\n var integrateResult = legeInte(x=>Math.Exp(x), N, weights, roots, -3, 3);\n\n Console.WriteLine(\"Roots: \" + Combine(roots));\n Console.WriteLine(\"Weights: \" + Combine(weights)+ \"\\n\" );\n Console.WriteLine(\"integral: \" + integrateResult );\n Console.WriteLine(\"actual: \" + (Math.Exp(3)-Math.Exp(-3)) );\n }\n\n\n}\n","language":"C-sharp"},{"code":";; Computes the initial guess for the root i of a n-order Legendre polynomial.\n(defun guess (n i)\n (cos (* pi\n (/ (- i 0.25d0)\n (+ n 0.5d0)))))\n\n;; Computes and evaluates the n-order Legendre polynomial at the point x.\n(defun legpoly (n x)\n (let ((pa 1.0d0)\n (pb x)\n (pn))\n (cond ((= n 0) pa)\n ((= n 1) pb)\n (t (loop for i from 2 to n do\n (setf pn (- (* (/ (- (* 2 i) 1) i) x pb)\n (* (/ (- i 1) i) pa)))\n (setf pa pb)\n (setf pb pn)\n finally (return pn))))))\n\n;; Computes and evaluates the derivative of an n-order Legendre polynomial at point x.\n(defun legdiff (n x)\n (* (/ n (- (* x x) 1))\n (- (* x (legpoly n x))\n (legpoly (- n 1) x))))\n\n;; Computes the n nodes for an n-point quadrature rule. (i.e. n roots of a n-order polynomial)\n(defun nodes (n)\n (let ((x (make-array n :initial-element 0.0d0)))\n (loop for i from 0 to (- n 1) do\n (let ((val (guess n (+ i 1))) ;Nullstellen-Schätzwert.\n (itermax 5))\n (dotimes (j itermax)\n (setf val (- val\n (/ (legpoly n val)\n (legdiff n val)))))\n (setf (aref x i) val)))\n x))\n\n;; Computes the weight for an n-order polynomial at the point (node) x.\n(defun legwts (n x)\n (/ 2\n (* (- 1 (* x x))\n (expt (legdiff n x) 2))))\n\n;; Takes a array of nodes x and computes an array of corresponding weights w.\n(defun weights (x)\n (let* ((n (car (array-dimensions x)))\n (w (make-array n :initial-element 0.0d0)))\n (loop for i from 0 to (- n 1) do\n (setf (aref w i) (legwts n (aref x i))))\n w))\n\n;; Integrates a function f with a n-point Gauss-Legendre quadrature rule over the interval [a,b].\n(defun int (f n a b)\n (let* ((x (nodes n))\n (w (weights x)))\n (* (/ (- b a) 2.0d0)\n (loop for i from 0 to (- n 1)\n sum (* (aref w i)\n (funcall f (+ (* (/ (- b a) 2.0d0)\n (aref x i))\n (/ (+ a b) 2.0d0))))))))\n","language":"Common-Lisp"},{"code":"(nodes 5)\n#(0.906179845938664d0 0.5384693101056831d0 2.996272867003007d-95 -0.5384693101056831d0 -0.906179845938664d0)\n\n(weights (nodes 5))\n#(0.23692688505618917d0 0.47862867049936647d0 0.5688888888888889d0 0.47862867049936647d0 0.23692688505618917d0)\n\n(int #'exp 5 -3 3)\n20.035577718385568d0\n","language":"Common-Lisp"},{"code":"(int #'(lambda (x) (expt x 3)) 5 0 1)\n0.24999999999999997d0\n\n(int #'(lambda (x) (/ 1 x)) 5 1 100)\n4.059147508941519d0\n\n(int #'(lambda (x) x) 5 0 5000)\n1.25d7\n\n(int #'(lambda (x) x) 5 0 6000)\n1.8000000000000004d7\n","language":"Common-Lisp"},{"code":"import std.stdio, std.math;\n\nimmutable struct GaussLegendreQuadrature(size_t N, FP=double,\n size_t NBITS=50) {\n immutable static double[N] lroots, weight;\n alias FP[N + 1][N + 1] CoefMat;\n\n pure nothrow @safe @nogc static this() {\n static FP legendreEval(in ref FP[N + 1][N + 1] lcoef,\n in int n, in FP x) pure nothrow {\n FP s = lcoef[n][n];\n foreach_reverse (immutable i; 1 .. n+1)\n s = s * x + lcoef[n][i - 1];\n return s;\n }\n\n static FP legendreDiff(in ref CoefMat lcoef,\n in int n, in FP x)\n pure nothrow @safe @nogc {\n return n * (x * legendreEval(lcoef, n, x) -\n legendreEval(lcoef, n - 1, x)) /\n (x ^^ 2 - 1);\n }\n\n CoefMat lcoef = 0.0;\n legendreCoefInit(/*ref*/ lcoef);\n\n // Legendre roots:\n foreach (immutable i; 1 .. N + 1) {\n FP x = cos(PI * (i - 0.25) / (N + 0.5));\n FP x1;\n do {\n x1 = x;\n x -= legendreEval(lcoef, N, x) /\n legendreDiff(lcoef, N, x);\n } while (feqrel(x, x1) < NBITS);\n lroots[i - 1] = x;\n x1 = legendreDiff(lcoef, N, x);\n weight[i - 1] = 2 / ((1 - x ^^ 2) * (x1 ^^ 2));\n }\n }\n\n static private void legendreCoefInit(ref CoefMat lcoef)\n pure nothrow @safe @nogc {\n lcoef[0][0] = lcoef[1][1] = 1;\n foreach (immutable int n; 2 .. N + 1) { // n must be signed.\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\n foreach (immutable i; 1 .. n + 1)\n lcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1] -\n (n - 1) * lcoef[n - 2][i]) / n;\n }\n }\n\n static public FP integrate(in FP function(/*in*/ FP x) pure nothrow @safe @nogc f,\n in FP a, in FP b)\n pure nothrow @safe @nogc {\n immutable FP c1 = (b - a) / 2;\n immutable FP c2 = (b + a) / 2;\n FP sum = 0.0;\n foreach (immutable i; 0 .. N)\n sum += weight[i] * f(c1 * lroots[i] + c2);\n return c1 * sum;\n }\n}\n\nvoid main() {\n GaussLegendreQuadrature!(5, real) glq;\n writeln(\"Roots: \", glq.lroots);\n writeln(\"Weight: \", glq.weight);\n writefln(\"Integrating exp(x) over [-3, 3]: %10.12f\",\n glq.integrate(&exp, -3, 3));\n writefln(\"Compred to actual: %10.12f\",\n 3.0.exp - exp(-3.0));\n}\n","language":"D"},{"code":"program Legendre;\n\n{$APPTYPE CONSOLE}\n\nconst Order = 5;\n Epsilon = 1E-12;\n\nvar Roots : array[0..Order-1] of double;\n Weight : array[0..Order-1] of double;\n LegCoef : array [0..Order,0..Order] of double;\n\nfunction F(X:double) : double;\nbegin\n Result := Exp(X);\nend;\n\nprocedure PrepCoef;\nvar I, N : integer;\nbegin\n for I:=0 to Order do\n for N := 0 to Order do\n LegCoef[I,N] := 0;\n LegCoef[0,0] := 1;\n LegCoef[1,1] := 1;\n For N:=2 to Order do\n begin\n LegCoef[N,0] := -(N-1) * LegCoef[N-2,0] / N;\n For I := 1 to Order do\n LegCoef[N,I] := ((2*N-1) * LegCoef[N-1,I-1] - (N-1)*LegCoef[N-2,I]) / N;\n end;\nend;\n\nfunction LegEval(N:integer; X:double) : double;\nvar I : integer;\nbegin\n Result := LegCoef[n][n];\n for I := N-1 downto 0 do\n Result := Result * X + LegCoef[N][I];\nend;\n\nfunction LegDiff(N:integer; X:double) : double;\nbegin\n Result := N * (X * LegEval(N,X) - LegEval(N-1,X)) / (X*X-1);\nend;\n\nprocedure LegRoots;\nvar I : integer;\n X, X1 : double;\nbegin\n for I := 1 to Order do\n begin\n X := Cos(Pi * (I-0.25) / (Order+0.5));\n repeat\n X1 := X;\n X := X - LegEval(Order,X) / LegDiff(Order, X);\n until Abs (X-X1) < Epsilon;\n Roots[I-1] := X;\n X1 := LegDiff(Order,X);\n Weight[I-1] := 2 / ((1-X*X) * X1*X1);\n end;\nend;\n\nfunction LegInt(A,B:double) : double;\nvar I : integer;\n C1, C2 : double;\nbegin\n C1 := (B-A)/2;\n C2 := (B+A)/2;\n Result := 0;\n For I := 0 to Order-1 do\n Result := Result + Weight[I] * F(C1*Roots[I] + C2);\n Result := C1 * Result;\nend;\n\nvar I : integer;\n\nbegin\n PrepCoef;\n LegRoots;\n\n Write('Roots: ');\n for I := 0 to Order-1 do\n Write (' ',Roots[I]:13:10);\n Writeln;\n\n Write('Weight: ');\n for I := 0 to Order-1 do\n Write (' ', Weight[I]:13:10);\n writeln;\n\n Writeln('Integrating Exp(x) over [-3, 3]: ',LegInt(-3,3):13:10);\n Writeln('Actual value: ',Exp(3)-Exp(-3):13:10);\n Readln;\nend.\n","language":"Delphi"},{"code":"! Works with gfortran but needs the option\n! -assume realloc_lhs\n! when compiled with Intel Fortran.\n\nprogram gauss\n implicit none\n integer, parameter :: p = 16 ! quadruple precision\n integer :: n = 10, k\n real(kind=p), allocatable :: r(:,:)\n real(kind=p) :: z, a, b, exact\n do n = 1,20\n a = -3; b = 3\n r = gaussquad(n)\n z = (b-a)/2*dot_product(r(2,:),exp((a+b)/2+r(1,:)*(b-a)/2))\n exact = exp(3.0_p)-exp(-3.0_p)\n print \"(i0,1x,g0,1x,g10.2)\",n, z, z-exact\n end do\n\n contains\n\n function gaussquad(n) result(r)\n integer :: n\n real(kind=p), parameter :: pi = 4*atan(1._p)\n real(kind=p) :: r(2, n), x, f, df, dx\n integer :: i, iter\n real(kind = p), allocatable :: p0(:), p1(:), tmp(:)\n\n p0 = [1._p]\n p1 = [1._p, 0._p]\n\n do k = 2, n\n tmp = ((2*k-1)*[p1,0._p]-(k-1)*[0._p, 0._p,p0])/k\n p0 = p1; p1 = tmp\n end do\n do i = 1, n\n x = cos(pi*(i-0.25_p)/(n+0.5_p))\n do iter = 1, 10\n f = p1(1); df = 0._p\n do k = 2, size(p1)\n df = f + x*df\n f = p1(k) + x * f\n end do\n dx = f / df\n x = x - dx\n if (abs(dx)<10*epsilon(dx)) exit\n end do\n r(1,i) = x\n r(2,i) = 2/((1-x**2)*df**2)\n end do\n end function\nend program\n","language":"Fortran"},{"code":"#define PI 4 * Atn(1)\nConst As Double LIM = 5\n\nDim Shared As Double lroots(LIM - 1)\nDim Shared As Double weight(LIM - 1)\n\nDim Shared As Double lcoef(LIM, LIM)\nFor i As Integer = 0 To LIM\n For j As Integer = 0 To LIM\n lcoef(i, j) = 0\n Next j\nNext i\n\nSub legeCoef()\n lcoef(0, 0) = 1\n lcoef(1, 1) = 1\n For n As Integer = 2 To LIM\n lcoef(n, 0) = -(n - 1) * lcoef(n - 2, 0) / n\n For i As Integer = 1 To n\n lcoef(n, i) = ((2 * n - 1) * lcoef(n - 1, i - 1) - (n - 1) * lcoef(n - 2, i)) / n\n Next i\n Next n\nEnd Sub\n\nFunction legeEval(n As Integer, x As Double) As Double\n Dim As Double s = lcoef(n, n)\n For i As Integer = n To 1 Step -1\n s = s * x + lcoef(n, i - 1)\n Next i\n Return s\nEnd Function\n\nFunction legeDiff(n As Integer, x As Double) As Double\n Return n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1)\nEnd Function\n\nSub legeRoots()\n Dim As Double x = 0\n Dim As Double x1 = 0\n For i As Integer = 1 To LIM\n x = Cos(PI * (i - 0.25) / (LIM + 0.5))\n Do\n x1 = x\n x = x - legeEval(LIM, x) / legeDiff(LIM, x)\n Loop Until x = x1\n lroots(i - 1) = x\n x1 = legeDiff(LIM, x)\n weight(i - 1) = 2 / ((1 - x * x) * x1 * x1)\n Next i\nEnd Sub\n\nFunction legeIntegrate(f As Function (As Double) As Double, a As Double, b As Double) As Double\n Dim As Double c1 = (b - a) / 2\n Dim As Double c2 = (b + a) / 2\n Dim As Double sum = 0\n For i As Integer = 0 To LIM - 1\n sum = sum + weight(i) * f(c1 * lroots(i) + c2)\n Next i\n Return c1 * sum\nEnd Function\n\nlegeCoef()\nlegeRoots()\n\nPrint \"Roots: \";\nFor i As Integer = 0 To LIM - 1\n Print Using \" ##.######\"; lroots(i);\nNext i\nPrint\n\nPrint \"Weight:\";\nFor i As Integer = 0 To LIM - 1\n Print Using \" ##.######\"; weight(i);\nNext i\nPrint\n\nFunction f(x As Double) As Double\n Return Exp(x)\nEnd Function\n\nDim As Double actual = Exp(3) - Exp(-3)\nPrint Using !\"Integrating exp(x) over [-3, 3]:\\n\\t########.######,\\ncompared to actual\\n\\t########.######\"; legeIntegrate(@f, -3, 3); actual\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n)\n\n// cFunc for continuous function. A type definition for convenience.\ntype cFunc func(float64) float64\n\nfunc main() {\n fmt.Println(\"integral:\", glq(math.Exp, -3, 3, 5))\n}\n\n// glq integrates f from a to b by Guass-Legendre quadrature using n nodes.\n// For the task, it also shows the intermediate values determining the nodes:\n// the n roots of the order n Legendre polynomal and the corresponding n\n// weights used for the integration.\nfunc glq(f cFunc, a, b float64, n int) float64 {\n x, w := glqNodes(n, f)\n show := func(label string, vs []float64) {\n fmt.Printf(\"%8s: \", label)\n for _, v := range vs {\n fmt.Printf(\"%8.5f \", v)\n }\n fmt.Println()\n }\n show(\"nodes\", x)\n show(\"weights\", w)\n var sum float64\n bma2 := (b - a) * .5\n bpa2 := (b + a) * .5\n for i, xi := range x {\n sum += w[i] * f(bma2*xi+bpa2)\n }\n return bma2 * sum\n}\n\n// glqNodes computes both nodes and weights for a Gauss-Legendre\n// Quadrature integration. Parameters are n, the number of nodes\n// to compute and f, a continuous function to integrate. Return\n// values have len n.\nfunc glqNodes(n int, f cFunc) (node []float64, weight []float64) {\n p := legendrePoly(n)\n pn := p[n]\n n64 := float64(n)\n dn := func(x float64) float64 {\n return (x*pn(x) - p[n-1](x)) * n64 / (x*x - 1)\n }\n node = make([]float64, n)\n for i := range node {\n x0 := math.Cos(math.Pi * (float64(i+1) - .25) / (n64 + .5))\n node[i] = newtonRaphson(pn, dn, x0)\n }\n weight = make([]float64, n)\n for i, x := range node {\n dnx := dn(x)\n weight[i] = 2 / ((1 - x*x) * dnx * dnx)\n }\n return\n}\n\n// legendrePoly constructs functions that implement Lengendre polynomials.\n// This is done by function composition by recurrence relation (Bonnet's.)\n// For given n, n+1 functions are returned, computing P0 through Pn.\nfunc legendrePoly(n int) []cFunc {\n r := make([]cFunc, n+1)\n r[0] = func(float64) float64 { return 1 }\n r[1] = func(x float64) float64 { return x }\n for i := 2; i <= n; i++ {\n i2m1 := float64(i*2 - 1)\n im1 := float64(i - 1)\n rm1 := r[i-1]\n rm2 := r[i-2]\n invi := 1 / float64(i)\n r[i] = func(x float64) float64 {\n return (i2m1*x*rm1(x) - im1*rm2(x)) * invi\n }\n }\n return r\n}\n\n// newtonRaphson is general purpose, although totally primitive, simply\n// panicking after a fixed number of iterations without convergence to\n// a fixed error. Parameter f must be a continuous function,\n// df its derivative, x0 an initial guess.\nfunc newtonRaphson(f, df cFunc, x0 float64) float64 {\n for i := 0; i < 30; i++ {\n x1 := x0 - f(x0)/df(x0)\n if math.Abs(x1-x0) <= math.Abs(x0*1e-15) {\n return x1\n }\n x0 = x1\n }\n panic(\"no convergence\")\n}\n","language":"Go"},{"code":"gaussLegendre n f a b = d*sum [ w x*f(m + d*x) | x <- roots ]\n where d = (b - a)/2\n m = (b + a)/2\n w x = 2/(1-x^2)/(legendreP' n x)^2\n roots = map (findRoot (legendreP n) (legendreP' n) . x0) [1..n]\n x0 i = cos (pi*(i-1/4)/(n+1/2))\n","language":"Haskell"},{"code":"legendreP n x = go n 1 x\n where go 0 p2 _ = p2\n go 1 _ p1 = p1\n go n p2 p1 = go (n-1) p1 $ ((2*n-1)*x*p1 - (n-1)*p2)/n\n\nlegendreP' n x = n/(x^2-1)*(x*legendreP n x - legendreP (n-1) x)\n","language":"Haskell"},{"code":"findRoot f df = fixedPoint (\\x -> x - f x / df x)\n\nfixedPoint f x | abs (fx - x) < 1e-15 = x\n | otherwise = fixedPoint f fx\n where fx = f x\n","language":"Haskell"},{"code":"integrate _ [] = 0\nintegrate f (m:ms) = sum $ zipWith (gaussLegendre 5 f) (m:ms) ms\n","language":"Haskell"},{"code":"NB. returns coefficents for yth-order Legendre polynomial\ngetLegendreCoeffs=: verb define M.\n if. y<:1 do. 1 {.~ - y+1 return. end.\n (%~ <:@(,~ +:) -/@:* (0;'') ,&> [: getLegendreCoeffs&.> -&1 2) y\n)\n\ngetPolyRoots=: 1 {:: p. NB. returns the roots of a polynomial\ngetGaussLegendreWeights=: 2 % -.@*:@[ * (*:@p.~ p..) NB. form: roots getGaussLegendreWeights coeffs\ngetGaussLegendrePoints=: (getPolyRoots ([ ,: getGaussLegendreWeights) ])@getLegendreCoeffs\n\nNB.*integrateGaussLegendre a Integrates a function u with a n-point Gauss-Legendre quadrature rule over the interval [a,b]\nNB. form: npoints function integrateGaussLegendre (a,b)\nintegrateGaussLegendre=: adverb define\n:\n 'nodes wgts'=. getGaussLegendrePoints x\n -: (-~/ y) * wgts +/@:* u -: nodes p.~ (+/ , -~/) y\n)\n","language":"J"},{"code":" 5 ^ integrateGaussLegendre _3 3\n20.0356\n -~/ ^ _3 3 NB. true value\n20.0357\n","language":"J"},{"code":"import static java.lang.Math.*;\nimport java.util.function.Function;\n\npublic class Test {\n final static int N = 5;\n\n static double[] lroots = new double[N];\n static double[] weight = new double[N];\n static double[][] lcoef = new double[N + 1][N + 1];\n\n static void legeCoef() {\n lcoef[0][0] = lcoef[1][1] = 1;\n\n for (int n = 2; n <= N; n++) {\n\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\n\n for (int i = 1; i <= n; i++) {\n lcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1]\n - (n - 1) * lcoef[n - 2][i]) / n;\n }\n }\n }\n\n static double legeEval(int n, double x) {\n double s = lcoef[n][n];\n for (int i = n; i > 0; i--)\n s = s * x + lcoef[n][i - 1];\n return s;\n }\n\n static double legeDiff(int n, double x) {\n return n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1);\n }\n\n static void legeRoots() {\n double x, x1;\n for (int i = 1; i <= N; i++) {\n x = cos(PI * (i - 0.25) / (N + 0.5));\n do {\n x1 = x;\n x -= legeEval(N, x) / legeDiff(N, x);\n } while (x != x1);\n\n lroots[i - 1] = x;\n\n x1 = legeDiff(N, x);\n weight[i - 1] = 2 / ((1 - x * x) * x1 * x1);\n }\n }\n\n static double legeInte(Function<Double, Double> f, double a, double b) {\n double c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\n for (int i = 0; i < N; i++)\n sum += weight[i] * f.apply(c1 * lroots[i] + c2);\n return c1 * sum;\n }\n\n public static void main(String[] args) {\n legeCoef();\n legeRoots();\n\n System.out.print(\"Roots: \");\n for (int i = 0; i < N; i++)\n System.out.printf(\" %f\", lroots[i]);\n\n System.out.print(\"\\nWeight:\");\n for (int i = 0; i < N; i++)\n System.out.printf(\" %f\", weight[i]);\n\n System.out.printf(\"%nintegrating Exp(x) over [-3, 3]:%n\\t%10.8f,%n\"\n + \"compared to actual%n\\t%10.8f%n\",\n legeInte(x -> exp(x), -3, 3), exp(3) - exp(-3));\n }\n}\n","language":"Java"},{"code":"const factorial = n => n <= 1 ? 1 : n * factorial(n - 1);\nconst M = n => (n - (n % 2 !== 0)) / 2;\nconst gaussLegendre = (fn, a, b, n) => {\n\t// coefficients of the Legendre polynomial\n\tconst coef = [...Array(M(n) + 1)].map((v, m) => v = (-1) ** m * factorial(2 * n - 2 * m) / (2 ** n * factorial(m) * factorial(n - m) * factorial(n - 2 * m)));\n\t// the polynomial function\n\tconst f = x => coef.map((v, i) => v * x ** (n - 2 * i)).reduce((sum, item) => sum + item, 0);\n\tconst terms = coef.length - (n % 2 === 0);\n\t// coefficients of the derivative polybomial\n\tconst dcoef = [...Array(terms)].map((v, i) => v = n - 2 * i).map((val, i) => val * coef[i]);\n\t// the derivative polynomial function\n\tconst df = x => dcoef.map((v, i) => v * x ** (n - 1 - 2 * i)).reduce((sum, item) => sum + item, 0);\n\tconst guess = [...Array(n)].map((v, i) => Math.cos(Math.PI * (i + 1 - 1 / 4) / (n + 1 / 2)));\n\t// Newton Raphson\n\tconst roots = guess.map(xo => [...Array(100)].reduce(x => x - f(x) / df(x), xo));\n\tconst weights = roots.map(v => 2 / ((1 - v ** 2) * df(v) ** 2));\n\treturn (b - a) / 2 * weights.map((v, i) => v * fn((b - a) * roots[i] / 2 + (a + b) / 2)).reduce((sum, item) => sum + item, 0);\n}\nconsole.log(gaussLegendre(x => Math.exp(x), -3, 3, 5));\n","language":"JavaScript"},{"code":"# output: an array\ndef legendreCoef($N):\n {lcoef: (reduce range(0;$N+1) as $i (null; .[$i] = [range(0;$N + 1)| 0]))}\n | .lcoef[0][0] = 1\n | .lcoef[1][1] = 1\n | reduce range(2; $N+1) as $n (.;\n .lcoef[$n][0] = -($n-1) * .lcoef[$n -2][0] / $n\n | reduce range (1; $n+1) as $i (.;\n .lcoef[$n][$i] = ((2*$n - 1) * .lcoef[$n-1][$i-1] - ($n - 1) * .lcoef[$n-2][$i]) / $n ) )\n | .lcoef ;\n\n# input: lcoef\n# output: the value\ndef legendreEval($n; $x):\n . as $lcoef\n | reduce range($n; 0 ;-1) as $i ( $lcoef[$n][$n] ; . * $x + $lcoef[$n][$i-1] ) ;\n\n# input: lcoef\ndef legendreDiff($n; $x):\n $n * ($x * legendreEval($n; $x) - legendreEval($n-1; $x)) / ($x*$x - 1) ;\n\n# input: lcoef\n# output: {lroots, weight}\ndef legendreRoots($N):\n def pi: 1|atan * 4;\n . as $lcoef\n | { x: 0, x1: null}\n | reduce range(1; 1+$N) as $i (.;\n .x = ((pi * ($i - 0.25) / ($N + 0.5)) | cos )\n | until (.x == .x1;\n .x1 = .x\n | .x as $x\n | .x = .x - ($lcoef | (legendreEval($N; $x) / legendreDiff($N; $x) )) )\n | .lroots[$i-1] = .x\n | .x as $x\n | .x1 = ($lcoef|legendreDiff($N; $x))\n | .weight[$i-1] = 2 / ((1 - .x*.x) * .x1 * .x1) ) ;\n\n# Input: {lroots, weight}\ndef legendreIntegrate(f; $a; $b; $N):\n .lroots as $lroots\n | .weight as $weight\n | (($b - $a) / 2) as $c1\n | (($b + $a) / 2) as $c2\n | reduce range(0;$N) as $i (0; . + $weight[$i] * (($c1* $lroots[$i] + $c2)|f) )\n | $c1 * .;\n\ndef task($N):\n def actual: 3|exp - ((-3)|exp);\n\n legendreCoef($N)\n | legendreRoots($N)\n | \"Roots: \",\n .lroots,\n \"\\nWeight:\",\n .weight,\n\n \"\\nIntegrating exp(x) over [-3, 3]: \\(legendreIntegrate(exp; -3; 3; N))\",\n \"compared to actual: \\(actual)\" ;\n\ntask(5)\n","language":"Jq"},{"code":"using LinearAlgebra\n\nfunction gauss(a, b, N)\n λ, Q = eigen(SymTridiagonal(zeros(N), [n / sqrt(4n^2 - 1) for n = 1:N-1]))\n @. (λ + 1) * (b - a) / 2 + a, [2Q[1, i]^2 for i = 1:N] * (b - a) / 2\nend\n","language":"Julia"},{"code":"import java.lang.Math.*\n\nclass Legendre(val N: Int) {\n fun evaluate(n: Int, x: Double) = (n downTo 1).fold(c[n][n]) { s, i -> s * x + c[n][i - 1] }\n\n fun diff(n: Int, x: Double) = n * (x * evaluate(n, x) - evaluate(n - 1, x)) / (x * x - 1)\n\n fun integrate(f: (Double) -> Double, a: Double, b: Double): Double {\n val c1 = (b - a) / 2\n val c2 = (b + a) / 2\n return c1 * (0 until N).fold(0.0) { s, i -> s + weights[i] * f(c1 * roots[i] + c2) }\n }\n\n private val roots = DoubleArray(N)\n private val weights = DoubleArray(N)\n private val c = Array(N + 1) { DoubleArray(N + 1) } // coefficients\n\n init {\n // coefficients:\n c[0][0] = 1.0\n c[1][1] = 1.0\n for (n in 2..N) {\n c[n][0] = (1 - n) * c[n - 2][0] / n\n for (i in 1..n)\n c[n][i] = ((2 * n - 1) * c[n - 1][i - 1] - (n - 1) * c[n - 2][i]) / n\n }\n\n // roots:\n var x: Double\n var x1: Double\n for (i in 1..N) {\n x = cos(PI * (i - 0.25) / (N + 0.5))\n do {\n x1 = x\n x -= evaluate(N, x) / diff(N, x)\n } while (x != x1)\n\n x1 = diff(N, x)\n roots[i - 1] = x\n weights[i - 1] = 2 / ((1 - x * x) * x1 * x1)\n }\n\n print(\"Roots:\")\n roots.forEach { print(\" %f\".format(it)) }\n println()\n print(\"Weights:\")\n weights.forEach { print(\" %f\".format(it)) }\n println()\n }\n}\n\nfun main(args: Array<String>) {\n val legendre = Legendre(5)\n println(\"integrating Exp(x) over [-3, 3]:\")\n println(\"\\t%10.8f\".format(legendre.integrate(Math::exp, -3.0, 3.0)))\n println(\"compared to actual:\")\n println(\"\\t%10.8f\".format(exp(3.0) - exp(-3.0)))\n}\n","language":"Kotlin"},{"code":"local order = 0\n\nlocal legendreRoots = {}\nlocal legendreWeights = {}\n\nlocal function legendre(term, z)\n if (term == 0) then\n return 1\n elseif (term == 1) then\n return z\n else\n return ((2 * term - 1) * z * legendre(term - 1, z) - (term - 1) * legendre(term - 2, z)) / term\n end\nend\n\nlocal function legendreDerivative(term, z)\n if (term == 0) then\n return 0\n elseif (term == 1) then\n return 1\n else\n return ( term * ((z * legendre(term, z)) - legendre(term - 1, z))) / (z * z - 1)\n end\nend\n\nlocal function getLegendreRoots()\n local y, y1\n\t\n for index = 1, order do\n y = math.cos(math.pi * (index - 0.25) / (order + 0.5))\n\t\t\n repeat\n y1 = y\n y = y - (legendre(order, y) / legendreDerivative(order, y))\n until y == y1\n\t\t\n table.insert(legendreRoots, y)\n end\nend\n\nlocal function getLegendreWeights()\n for index = 1, order do\n local weight = 2 / ((1 - (legendreRoots[index]) ^ 2) * (legendreDerivative(order, legendreRoots[index])) ^ 2)\n table.insert(legendreWeights, weight)\n end\nend\n\nfunction gaussLegendreQuadrature(f, lowerLimit, upperLimit, n)\n order = n\n\t\n do\n getLegendreRoots()\n getLegendreWeights()\n end\n\t\n local c1 = (upperLimit - lowerLimit) / 2\n local c2 = (upperLimit + lowerLimit) / 2\n local sum = 0\n\t\n for i = 1, order do\n sum = sum + legendreWeights[i] * f(c1 * legendreRoots[i] + c2)\n end\n\t\n return c1 * sum\nend\n\ndo\n print(gaussLegendreQuadrature(function(x) return math.exp(x) end, -3, 3, 5))\nend\n","language":"Lua"},{"code":"gaussLegendreQuadrature[func_, {a_, b_}, degree_: 5] :=\nBlock[{nodes, x, weights},\n nodes = Cases[NSolve[LegendreP[degree, x] == 0, x], _?NumericQ, Infinity];\n weights = 2 (1 - nodes^2)/(degree LegendreP[degree - 1, nodes])^2;\n (b - a)/2 weights.func[(b - a)/2 nodes + (b + a)/2]]\ngaussLegendreQuadrature[Exp, {-3, 3}]\n","language":"Mathematica"},{"code":"%Print the result.\ndisp(GLGD_int(@(x) exp(x), -3, 3, 5));\n\n%Integration using Gauss-Legendre quad\n%Does almost the same as 'integral' in MATLAB\nfunction y=GLGD_int(fun,xmin,xmax,n)\n%fun: the intergrand as a function handle\n%xmin: lower boundary of integration\n%xmax: upper boundary of integration\n%n: order of polynomials used (number of integration ponts)\n[x_IP,weight]=GLGD_para(n);\n%assign global coordinates to the integraton points\nx_eval=x_IP*(xmax-xmin)/2+(xmax+xmin)/2;\ny=0;\nfor aa=1:n\n y=y+feval(fun,x_eval(aa))*weight(aa)*(xmax-xmin)/2;\nend\nend\n\nfunction [x_IP,weight]=GLGD_para(n)\n%n: the order of the polynomial\nx_IP=legendreRoot(n,10^(-16));\nweight=2./(1-x_IP.^2)./diff_legendrePoly(x_IP,n).^2;\nend\n\n%roots of the Legendre Polynomial using Newton-Raphson\nfunction x_IP=legendreRoot(n,tol)\n%n: order of the polynomial\n%tol: tolerence of the error\nif n<2\n disp('No root can be found');\nelse\n root=zeros(1,floor(n/2));\n for aa=1:floor(n/2) %iterate to find half of the roots\n x=cos(pi*(aa-0.25)/(n+0.5));\n err=10*tol;\n iter=0;\n while (err>tol)&&(iter<1000)\n dx=-legendrePoly(x,n)/diff_legendrePoly(x,n);\n x=x+dx;\n iter=iter+1;\n err=abs(legendrePoly(x,n));\n end\n root(aa)=x;\n end\n if mod(n,2)==0\n x_IP=[-1*root,root];\n else\n x_IP=[-1*root,0,root];\n end\n x_IP=sort(x_IP);\nend\nend\n\n%derivative of the Legendre Polynomial\nfunction y=diff_legendrePoly(x_IP,n)\n%n: order of the polynomial\n%x_IP: coordinates of the integration points\nif n==0\n y=0;\nelse\n y=n./(x_IP.^2-1).*(x_IP.*legendrePoly(x_IP,n)-legendrePoly(x_IP,n-1));\nend\nend\n\n%Produces Legendre Polynomials\nfunction y=legendrePoly(x,n)\n%n: order of polynomial\n%x: input x\nif n==0\n y=1;\nelseif n==1\n y=x;\nelse\n y=((2*n-1).*x.*legendrePoly(x,n-1)-(n-1)*legendrePoly(x,n-2))/n;\nend\nend\n","language":"MATLAB"},{"code":"gauss_coeff(n) := block([p, q, v, w],\n p: expand(legendre_p(n, x)),\n q: expand(n/2*diff(p, x)*legendre_p(n - 1, x)),\n v: map(rhs, bfallroots(p)),\n w: map(lambda([z], 1/subst([x = z], q)), v),\n [map(bfloat, v), map(bfloat, w)])$\n\ngauss_int(f, a, b, n) := block([u, x, w, c, h],\n u: gauss_coeff(n),\n x: u[1],\n w: u[2],\n c: bfloat((a + b)/2),\n h: bfloat((b - a)/2),\n h*sum(w[i]*bfloat(f(c + x[i]*h)), i, 1, n))$\n\n\nfpprec: 40$\n\n\ngauss_int(lambda([x], 4/(1 + x^2)), 0, 1, 20);\n/* 3.141592653589793238462643379852215927697b0 */\n\n% - bfloat(%pi);\n/* -3.427286956499858315999116083264403489053b-27 */\n\n\ngauss_int(exp, -3, 3, 5);\n/* 2.003557771838556215392853572527509393154b1 */\n\n% - bfloat(integrate(exp(x), x, -3, 3));\n/* -1.721364342416440206515136565621888185351b-4 */\n","language":"Maxima"},{"code":"import math, strformat\n\nproc legendreIn(x: float, n: int): float =\n\n template prev1(idx: int; pn1: float): float =\n (2*idx - 1).float * x * pn1\n\n template prev2(idx: int; pn2: float): float =\n (idx-1).float * pn2\n\n if n == 0:\n return 1.0\n elif n == 1:\n return x\n else:\n var\n p1 = float x\n p2 = 1.0\n for i in 2 .. n:\n result = (i.prev1(p1) - i.prev2(p2)) / i.float\n p2 = p1\n p1 = result\n\nproc deriveLegendreIn(x: float, n: int): float =\n template calcresult(curr, prev: float): untyped =\n n.float / (x^2 - 1) * (x * curr - prev)\n result = calcresult(x.legendreIn n, x.legendreIn(n-1))\n\nfunc guess(n, i: int): float =\n cos(PI * (i.float - 0.25) / (n.float + 0.5))\n\nproc nodes(n: int): seq[(float, float)] =\n result = newseq[(float, float)](n)\n template calc(x: float): untyped =\n x.legendreIn(n) / x.deriveLegendreIn(n)\n\n for i in 0 .. result.high:\n var x = guess(n, i+1)\n block newton:\n var x0 = x\n x -= calc x\n while abs(x-x0) > 1e-12:\n x0 = x\n x -= calc x\n\n result[i][0] = x\n result[i][1] = 2 / ((1.0 - x^2) * (x.deriveLegendreIn n)^2)\n\nproc integ(f: proc(x: float): float; ns, p1, p2: int): float =\n template dist: untyped =\n (p2 - p1).float / 2.0\n template avg: untyped =\n (p1 + p2).float / 2.0\n result = dist()\n var\n sum = 0'f\n thenodes = newseq[float](ns)\n weights = newseq[float](ns)\n for i, nw in ns.nodes:\n sum += nw[1] * f(dist() * nw[0] + avg())\n thenodes[i] = nw[0]\n weights[i] = nw[1]\n\n let apos = \":\"\n stdout.write fmt\"\"\"{\"nodes\":>8}{apos}\"\"\"\n for n in thenodes:\n stdout.write &\" {n:>6.5f}\"\n stdout.write \"\\n\"\n stdout.write &\"\"\"{\"weights\":>8}{apos}\"\"\"\n for w in weights:\n stdout.write &\" {w:>6.5f}\"\n stdout.write \"\\n\"\n result *= sum\n\nproc main =\n echo \"integral: \", integ(exp, 5, -3, 3)\n\nmain()\n","language":"Nim"},{"code":"let rec leg n x = match n with (* Evaluate Legendre polynomial *)\n | 0 -> 1.0\n | 1 -> x\n | k -> let u = 1.0 -. 1.0 /. float k in\n (1.0+.u)*.x*.(leg (k-1) x) -. u*.(leg (k-2) x);;\n\nlet leg' n x = match n with (* derivative *)\n | 0 -> 0.0\n | 1 -> 1.0\n | _ -> ((leg (n-1) x) -. x*.(leg n x)) *. (float n)/.(1.0-.x*.x);;\n\nlet approx_root k n = (* Reversed Francesco Tricomi: 1 <= k <= n *)\n let pi = acos (-1.0) and s = float(2*n)\n and t = 1.0 +. float(1-4*k)/.float(4*n+2) in\n (1.0 -. (float (n-1))/.(s*.s*.s))*.cos(pi*.t);;\n\nlet rec refine r n = (* Newton-Raphson *)\n let r1 = r -. (leg n r)/.(leg' n r) in\n if abs_float (r-.r1) < 2e-16 then r1 else refine r1 n;;\n\nlet root k n = refine (approx_root k n) n;;\n\nlet node k n = (* Abscissa and weight *)\n let r = root k n in\n let deriv = leg' n r in\n let w = 2.0/.((1.0-.r*.r)*.(deriv*.deriv)) in\n (r,w);;\n\nlet nodes n =\n let rec aux k = if k > n then [] else node k n :: aux (k+1)\n in aux 1;;\n\nlet quadrature n f a b =\n let f1 x = f ((x*.(b-.a) +. a +. b)*.0.5) in\n let eval s (x,w) = s +. w*.(f1 x) in\n 0.5*.(b-.a)*.(List.fold_left eval 0.0 (nodes n));;\n","language":"OCaml"},{"code":"let calc n =\n Printf.printf\n \"Gauss-Legendre %2d-point quadrature for exp over [-3..3] = %.16f\\n\"\n n (quadrature n exp (-3.0) 3.0);;\n\ncalc 5;;\ncalc 10;;\ncalc 15;;\ncalc 20;;\n","language":"OCaml"},{"code":"Printf.printf \"%.16f\\n\" ((exp 3.0) -.(exp (-3.0)));;\n20.0357498548198052\n","language":"OCaml"},{"code":"/*---------------------------------------------------------------------\n* 31.10.2013 Walter Pachl Translation from REXX (from PL/I)\n* using ooRexx' rxmath package\n* which limits the precision to 16 digits\n*--------------------------------------------------------------------*/\nprec=60\nNumeric Digits prec\nepsilon=1/10**prec\npi=3.141592653589793238462643383279502884197169399375105820974944592307\nexact = RxCalcExp(3,prec)-RxCalcExp(-3,prec)\nDo n = 1 To 20\n a = -3; b = 3\n r.=0\n call gaussquad\n sum=0\n Do j=1 To n\n sum=sum + r.2.j * RxCalcExp((a+b)/2+r.1.j*(b-a)/2,prec)\n End\n z = (b-a)/2 * sum\n Say right(n,2) format(z,2,40) format(z-exact,2,4,,0)\n End\n Say ' ' exact '(exact)'\n Exit\n\n gaussquad:\n p0.0=1; p0.1=1\n p1.0=2; p1.1=1; p1.2=0\n Do k = 2 To n\n tmp.0=p1.0+1\n Do L = 1 To p1.0\n tmp.l = p1.l\n End\n tmp.l=0\n tmp2.0=p0.0+2\n tmp2.1=0\n tmp2.2=0\n Do L = 1 To p0.0\n l2=l+2\n tmp2.l2=p0.l\n End\n Do j=1 To tmp.0\n tmp.j = ((2*k-1)*tmp.j - (k-1)*tmp2.j)/k\n End\n p0.0=p1.0\n Do j=1 To p0.0\n p0.j = p1.j\n End\n p1.0=tmp.0\n Do j=1 To p1.0\n p1.j=tmp.j\n End\n End\n Do i = 1 To n\n x = RxCalcCos(pi*(i-0.25)/(n+0.5),prec,'R')\n Do iter = 1 To 10\n f = p1.1; df = 0\n Do k = 2 To p1.0\n df = f + x*df\n f = p1.k + x * f\n End\n dx = f / df\n x = x - dx\n If abs(dx) < epsilon Then Leave\n End\n r.1.i = x\n r.2.i = 2/((1-x**2)*df**2)\n End\n Return\n\n::requires 'rxmath' LIBRARY\n","language":"OoRexx"},{"code":"GLq(f,a,b,n)={\n my(P=pollegendre(n),Pp=P',x=polroots(P));\n (b-a)*sum(i=1,n,f((b-a)*x[i]/2+(a+b)/2)/(1-x[i]^2)/subst(Pp,'x,x[i])^2)\n};\n# \\\\ Turn on timer\nGLq(x->exp(x), -3, 3, 5) \\\\ As of version 2.4.4, this can be written GLq(exp, -3, 3, 5)\n","language":"PARI-GP"},{"code":"intnumgauss(x=-3, 3, exp(x), intnumgaussinit(5))\nintnumgauss(x=-3, 3, exp(x)) \\\\ determine number of points automatically; all digits shown should be accurate\n","language":"PARI-GP"},{"code":"program Legendre(output);\n\nconst Order = 5;\n Order1 = Order - 1;\n Epsilon = 1E-12;\n Pi = 3.1415926;\n\nvar Roots : array[0..Order1] of real;\n Weight : array[0..Order1] of real;\n LegCoef : array [0..Order,0..Order] of real;\n I : integer;\n\n\nfunction F(X:real) : real;\nbegin\n F := Exp(X);\nend;\n\nprocedure PrepCoef;\nvar I, N : integer;\nbegin\n for I:=0 to Order do\n for N := 0 to Order do\n LegCoef[I,N] := 0;\n LegCoef[0,0] := 1;\n LegCoef[1,1] := 1;\n For N:=2 to Order do\n begin\n LegCoef[N,0] := -(N-1) * LegCoef[N-2,0] / N;\n For I := 1 to Order do\n LegCoef[N,I] := ((2*N-1) * LegCoef[N-1,I-1] - (N-1)*LegCoef[N-2,I]) / N;\n end;\nend;\n\nfunction LegEval(N:integer; X:real) : real;\nvar I : integer;\n Result : real;\nbegin\n Result := LegCoef[n][n];\n for I := N-1 downto 0 do\n Result := Result * X + LegCoef[N][I];\n LegEval := Result;\nend;\n\nfunction LegDiff(N:integer; X:real) : real;\nbegin\n LegDiff := N * (X * LegEval(N,X) - LegEval(N-1,X)) / (X*X-1);\nend;\n\nprocedure LegRoots;\nvar I : integer;\n X, X1 : real;\nbegin\n for I := 1 to Order do\n begin\n X := Cos(Pi * (I-0.25) / (Order+0.5));\n repeat\n X1 := X;\n X := X - LegEval(Order,X) / LegDiff(Order, X);\n until Abs (X-X1) < Epsilon;\n Roots[I-1] := X;\n X1 := LegDiff(Order,X);\n Weight[I-1] := 2 / ((1-X*X) * X1*X1);\n end;\nend;\n\nfunction LegInt(A,B:real) : real;\nvar I : integer;\n C1, C2, Result : real;\nbegin\n C1 := (B-A)/2;\n C2 := (B+A)/2;\n Result := 0;\n For I := 0 to Order-1 do\n Result := Result + Weight[I] * F(C1*Roots[I] + C2);\n Result := C1 * Result;\n LegInt := Result;\nend;\n\nbegin\n PrepCoef;\n LegRoots;\n\n Write('Roots: ');\n for I := 0 to Order-1 do\n Write (' ',Roots[I]:13:10);\n Writeln;\n\n Write('Weight: ');\n for I := 0 to Order-1 do\n Write (' ', Weight[I]:13:10);\n writeln;\n\n Writeln('Integrating Exp(x) over [-3, 3]: ',LegInt(-3,3):13:10);\n Writeln('Actual value: ',Exp(3)-Exp(-3):13:10);\nend.\n","language":"Pascal"},{"code":"use List::Util qw(sum);\nuse constant pi => 3.14159265;\n\nsub legendre_pair {\n my($n, $x) = @_;\n if ($n == 1) { return $x, 1 }\n my ($m1, $m2) = legendre_pair($n - 1, $x);\n my $u = 1 - 1 / $n;\n (1 + $u) * $x * $m1 - $u * $m2, $m1;\n}\n\nsub legendre {\n my($n, $x) = @_;\n (legendre_pair($n, $x))[0]\n}\n\nsub legendre_prime {\n my($n, $x) = @_;\n if ($n == 0) { return 0 }\n if ($n == 1) { return 1 }\n my ($m0, $m1) = legendre_pair($n, $x);\n ($m1 - $x * $m0) * $n / (1 - $x**2);\n}\n\nsub approximate_legendre_root {\n my($n, $k) = @_;\n my $t = (4*$k - 1) / (4*$n + 2);\n (1 - ($n - 1) / (8 * $n**3)) * cos(pi * $t);\n}\n\nsub newton_raphson {\n my($n, $r) = @_;\n while (abs(my $dr = - legendre($n,$r) / legendre_prime($n,$r)) >= 2e-16) {\n $r += $dr;\n }\n $r;\n}\n\nsub legendre_root {\n my($n, $k) = @_;\n newton_raphson($n, approximate_legendre_root($n, $k));\n}\n\nsub weight {\n my($n, $r) = @_;\n 2 / ((1 - $r**2) * legendre_prime($n, $r)**2)\n}\n\nsub nodes {\n my($n) = @_;\n my %node;\n $node{'0'} = weight($n, 0) if 0 != $n%2;\n for (1 .. int $n/2) {\n my $r = legendre_root($n, $_);\n my $w = weight($n, $r);\n $node{$r} = $w; $node{-$r} = $w;\n }\n return %node\n}\n\nsub quadrature {\n our($n, $a, $b) = @_;\n sub scale { ($_[0] * ($b - $a) + $a + $b) / 2 }\n %nodes = nodes($n);\n ($b - $a) / 2 * sum map { $nodes{$_} * exp(scale($_)) } keys %nodes;\n}\n\nprintf(\"Gauss-Legendre %2d-point quadrature ∫₋₃⁺³ exp(x) dx ≈ %.13f\\n\", $_, quadrature($_, -3, +3) )\n for 5 .. 10, 20;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">legendreRoots</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">legendreWeights</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">z</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">((</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)-(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">))/</span><span style=\"color: #000000;\">term</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">legendreDerivative</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">term</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">term</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">)))/(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">getLegendreRoots</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">legendreRoots</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">index</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cos</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">PI</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">index</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.25</span><span style=\"color: #0000FF;\">)/(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">y1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">y</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">legendre</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">legendreDerivative</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">y1</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">2e-16</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">legendreRoots</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">y</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">getLegendreWeights</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">legendreWeights</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">index</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">lri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">legendreRoots</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">index</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">diff</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">legendreDerivative</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lri</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">weight</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #0000FF;\">((</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">))*</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">diff</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">legendreWeights</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">weight</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">gaussLegendreQuadrature</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lowerLimit</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">upperLimit</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n\n <span style=\"color: #000000;\">getLegendreRoots</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">getLegendreWeights</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">upperLimit</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">lowerLimit</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">upperLimit</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">lowerLimit</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">/</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">legendreWeights</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">legendreRoots</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">c2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">c1</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">machine_bits</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"%.13f\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"%.14f\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">11</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">gaussLegendreQuadrature</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">exp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"roots:\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">legendreRoots</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"weights:\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">legendreWeights</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Gauss-Legendre %2d-point quadrature for exp over [-3..3] = %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #7060A8;\">exp</span><span style=\"color: #0000FF;\">(-</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" compared to actual = %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"(subscriptrange, size, fofl):\nIntegration_Gauss: procedure options (main);\n\n declare (n, k) fixed binary;\n declare r(*,*) float (18) controlled;\n declare (z, a, b, exact) float (18);\n\n do n = 1 to 20;\n a = -3; b = 3;\n if allocation(r) > 0 then free r;\n allocate r(2, n); r = 0;\n call gaussquad(n, r);\n z = (b-a)/2 * sum(r(2,*) * exp((a+b)/2+r(1,*)*(b-a)/2));\n exact = exp(3.0q0)-exp(-3.0q0);\n put skip edit (n, z, z-exact) (f(5), f(25,16), e(15,2));\n end;\n\ngaussquad: procedure(n, r);\n/*declare n fixed binary, r(2, n) float (18);*/\n declare n fixed binary, r(2, *) float (18);/* corrected */\n declare pi float (18) value (4*atan(1.0q0));\n declare (x, f, df, dx) float (18);\n declare (i, iter, L) fixed binary;\n declare (p0(*), p1(*), tmp(*), tmp2(*)) float (18) controlled;\n\n allocate p0(1) initial (1);\n allocate p1(2) initial (1, 0);\n\n do k = 2 to n;\n allocate tmp(hbound(p1)+1); do L = 1 to hbound(p1); tmp(L) = p1(L); end; tmp(L) = 0;\n allocate tmp2(hbound(p0)+2); tmp2(1), tmp2(2) = 0;\n do L = 1 to hbound(p0); tmp2(L+2) = p0(L); end;\n tmp = ((2*k-1)*tmp - (k-1)*tmp2)/k;\n free p0; allocate p0(hbound(p1)); p0 = p1;\n free p1; allocate p1(hbound(tmp)); p1 = tmp;\n free tmp, tmp2;\n end;\n do i = 1 to n;\n x = cos(pi*(i-0.25q0)/(n+0.5q0));\n do iter = 1 to 10;\n f = p1(1); df = 0;\n do k = 2 to hbound(p1);\n df = f + x*df;\n f = p1(k) + x * f;\n end;\n dx = f / df;\n x = x - dx;\n if abs(dx) < 10*epsilon(dx) then leave;\n end;\n r(1,i) = x;\n r(2,i) = 2/((1-x**2)*df**2);\n end;\n end gaussquad;\nend Integration_Gauss;\n","language":"PL-I"},{"code":"from numpy import *\n\n##################################################################\n# Recursive generation of the Legendre polynomial of order n\ndef Legendre(n,x):\n\tx=array(x)\n\tif (n==0):\n\t\treturn x*0+1.0\n\telif (n==1):\n\t\treturn x\n\telse:\n\t\treturn ((2.0*n-1.0)*x*Legendre(n-1,x)-(n-1)*Legendre(n-2,x))/n\n\n##################################################################\n# Derivative of the Legendre polynomials\ndef DLegendre(n,x):\n\tx=array(x)\n\tif (n==0):\n\t\treturn x*0\n\telif (n==1):\n\t\treturn x*0+1.0\n\telse:\n\t\treturn (n/(x**2-1.0))*(x*Legendre(n,x)-Legendre(n-1,x))\n##################################################################\n# Roots of the polynomial obtained using Newton-Raphson method\ndef LegendreRoots(polyorder,tolerance=1e-20):\n\tif polyorder<2:\n\t\terr=1 # bad polyorder no roots can be found\n\telse:\n\t\troots=[]\n\t\t# The polynomials are alternately even and odd functions. So we evaluate only half the number of roots.\n\t\tfor i in range(1,int(polyorder)/2 +1):\n\t\t\tx=cos(pi*(i-0.25)/(polyorder+0.5))\n\t\t\terror=10*tolerance\n\t\t iters=0\n\t\t while (error>tolerance) and (iters<1000):\n\t\t dx=-Legendre(polyorder,x)/DLegendre(polyorder,x)\n\t\t x=x+dx\n\t\t iters=iters+1\n\t\t error=abs(dx)\n\t\t\troots.append(x)\n\t\t# Use symmetry to get the other roots\n\t\troots=array(roots)\n\t\tif polyorder%2==0:\n\t\t\troots=concatenate( (-1.0*roots, roots[::-1]) )\n\t\telse:\n\t\t\troots=concatenate( (-1.0*roots, [0.0], roots[::-1]) )\n\t\terr=0 # successfully determined roots\n\treturn [roots, err]\n##################################################################\n# Weight coefficients\ndef GaussLegendreWeights(polyorder):\n\tW=[]\n\t[xis,err]=LegendreRoots(polyorder)\n\tif err==0:\n\t\tW=2.0/( (1.0-xis**2)*(DLegendre(polyorder,xis)**2) )\n\t\terr=0\n\telse:\n\t\terr=1 # could not determine roots - so no weights\n\treturn [W, xis, err]\n##################################################################\n# The integral value\n# func \t\t: the integrand\n# a, b \t\t: lower and upper limits of the integral\n# polyorder \t: order of the Legendre polynomial to be used\n#\ndef GaussLegendreQuadrature(func, polyorder, a, b):\n\t[Ws,xs, err]= GaussLegendreWeights(polyorder)\n\tif err==0:\n\t\tans=(b-a)*0.5*sum( Ws*func( (b-a)*0.5*xs+ (b+a)*0.5 ) )\n\telse:\n\t\t# (in case of error)\n\t\terr=1\n\t\tans=None\n\treturn [ans,err]\n##################################################################\n# The integrand - change as required\ndef func(x):\n\treturn exp(x)\n##################################################################\n#\n\norder=5\n[Ws,xs,err]=GaussLegendreWeights(order)\nif err==0:\n\tprint \"Order : \", order\n\tprint \"Roots : \", xs\n\tprint \"Weights : \", Ws\nelse:\n\tprint \"Roots/Weights evaluation failed\"\n\n# Integrating the function\n[ans,err]=GaussLegendreQuadrature(func , order, -3,3)\nif err==0:\n\tprint \"Integral : \", ans\nelse:\n\tprint \"Integral evaluation failed\"\n","language":"Python"},{"code":"import numpy as np\n\n# func is a function that takes a list-like input values\ndef gauss_legendre_integrate(func, domain, deg):\n x, w = np.polynomial.legendre.leggauss(deg)\n s = (domain[1] - domain[0])/2\n a = (domain[1] + domain[0])/2\n return np.sum(s*w*func(s*x + a))\n\nfor d in range(3, 10):\n print(d, gauss_legendre_integrate(np.exp, [-3, 3], d))\n","language":"Python"},{"code":"(define (LegendreP n x)\n (let compute ([n n] [Pn-1 x] [Pn-2 1])\n (case n\n [(0) Pn-2]\n [(1) Pn-1]\n [else (compute (- n 1)\n (/ (- (* (- (* 2 n) 1) x Pn-1)\n (* (- n 1) Pn-2)) n)\n Pn-1)])))\n\n(define (LegendreP′ n x)\n (* (/ n (- (* x x) 1))\n (- (* x (LegendreP n x))\n (LegendreP (- n 1) x))))\n","language":"Racket"},{"code":"(define (LegendreP-root n i)\n ; newton-raphson step\n (define (newton-step x)\n (- x (/ (LegendreP n x) (LegendreP′ n x))))\n ; initial guess\n (define x0 (cos (* pi (/ (- i 1/4) (+ n 1/2)))))\n ; computation of a root with relative accuracy 1e-15\n (if (< (abs x0) 1e-15)\n 0\n (let next ([x′ (newton-step x0)] [x x0])\n (if (< (abs (/ (- x′ x) (+ x′ x))) 1e-15)\n x′\n (next (newton-step x′) x′)))))\n","language":"Racket"},{"code":"(define (Gauss-Legendre-quadrature n)\n ;; positive roots\n (define roots\n (for/list ([i (in-range (floor (/ n 2)))])\n (LegendreP-root n (+ i 1))))\n ;; weights for positive roots\n (define weights\n (for/list ([x (in-list roots)])\n (/ 2 (- 1 (sqr x)) (sqr (LegendreP′ n x)))))\n ;; all roots and weights\n (values (append (map - roots)\n (if (odd? n) (list 0) '())\n (reverse roots))\n (append weights\n (if (odd? n) (list (/ 2 (sqr (LegendreP′ n 0)))) '())\n (reverse weights))))\n","language":"Racket"},{"code":"(define (integrate f a b #:nodes (n 5))\n (define m (/ (+ a b) 2))\n (define d (/ (- b a) 2))\n (define-values [x w] (Gauss-Legendre-quadrature n))\n (define (g x) (f (+ m (* d x))))\n (* d (+ (apply + (map * w (map g x))))))\n","language":"Racket"},{"code":"> (Gauss-Legendre-quadrature 5)\n'(-0.906179845938664 -0.5384693101056831 0 0.5384693101056831 0.906179845938664)\n'(0.23692688505618875 0.47862867049936625 128/225 0.47862867049936625 0.23692688505618875)\n\n> (integrate exp -3 3)\n20.035577718385547\n\n> (- (exp 3) (exp -3)\n20.035749854819805\n","language":"Racket"},{"code":"> (require plot)\n> (parameterize ([plot-x-label \"Number of Gaussian nodes\"]\n [plot-y-label \"Integration error\"]\n [plot-y-transform log-transform]\n [plot-y-ticks (log-ticks #:base 10)])\n (plot (points (for/list ([n (in-range 2 11)])\n (list n (abs (- (integrate exp -3 3 #:nodes n)\n (- (exp 3) (exp -3)))))))))\n","language":"Racket"},{"code":"multi legendre-pair( 1 , $x) { $x, 1 }\nmulti legendre-pair(Int $n, $x) {\n my ($m1, $m2) = legendre-pair($n - 1, $x);\n my \\u = 1 - 1 / $n;\n (1 + u) * $x * $m1 - u * $m2, $m1;\n}\n\nmulti legendre( 0 , $ ) { 1 }\nmulti legendre(Int $n, $x) { legendre-pair($n, $x)[0] }\n\nmulti legendre-prime( 0 , $ ) { 0 }\nmulti legendre-prime( 1 , $ ) { 1 }\nmulti legendre-prime(Int $n, $x) {\n my ($m0, $m1) = legendre-pair($n, $x);\n ($m1 - $x * $m0) * $n / (1 - $x**2);\n}\n\nsub approximate-legendre-root(Int $n, Int $k) {\n # Approximation due to Francesco Tricomi\n my \\t = (4*$k - 1) / (4*$n + 2);\n (1 - ($n - 1) / (8 * $n**3)) * cos(pi * t);\n}\n\nsub newton-raphson(&f, &f-prime, $r is copy, :$eps = 2e-16) {\n while abs(my \\dr = - f($r) / f-prime($r)) >= $eps {\n $r += dr;\n }\n $r;\n}\n\nsub legendre-root(Int $n, Int $k) {\n newton-raphson(&legendre.assuming($n), &legendre-prime.assuming($n),\n approximate-legendre-root($n, $k));\n}\n\nsub weight(Int $n, $r) { 2 / ((1 - $r**2) * legendre-prime($n, $r)**2) }\n\nsub nodes(Int $n) {\n flat gather {\n take 0 => weight($n, 0) if $n !%% 2;\n for 1 .. $n div 2 {\n my $r = legendre-root($n, $_);\n my $w = weight($n, $r);\n take $r => $w, -$r => $w;\n }\n }\n}\n\nsub quadrature(Int $n, &f, $a, $b, :@nodes = nodes($n)) {\n sub scale($x) { ($x * ($b - $a) + $a + $b) / 2 }\n ($b - $a) / 2 * [+] @nodes.map: { .value * f(scale(.key)) }\n}\n\nsay \"Gauss-Legendre $_.fmt('%2d')-point quadrature ∫₋₃⁺³ exp(x) dx ≈ \",\n quadrature($_, &exp, -3, +3) for flat 5 .. 10, 20;\n","language":"Raku"},{"code":"/*---------------------------------------------------------------------\n* 31.10.2013 Walter Pachl Translation from PL/I\n* 01.11.2014 -\"- see Version 2 for improvements\n*--------------------------------------------------------------------*/\nCall time 'R'\nprec=60\nNumeric Digits prec\nepsilon=1/10**prec\npi=3.141592653589793238462643383279502884197169399375105820974944592307\nexact = exp(3,prec)-exp(-3,prec)\nDo n = 1 To 20\n a = -3; b = 3\n r.=0\n call gaussquad\n sum=0\n Do j=1 To n\n sum=sum + r.2.j * exp((a+b)/2+r.1.j*(b-a)/2,prec)\n End\n z = (b-a)/2 * sum\n Say right(n,2) format(z,2,40) format(z-exact,2,4,,0)\n End\n Say ' ' exact '(exact)'\n say '... and took' format(time('E'),,2) \"seconds\"\n Exit\n\n gaussquad:\n p0.0=1; p0.1=1\n p1.0=2; p1.1=1; p1.2=0\n Do k = 2 To n\n tmp.0=p1.0+1\n Do L = 1 To p1.0\n tmp.l = p1.l\n End\n tmp.l=0\n tmp2.0=p0.0+2\n tmp2.1=0\n tmp2.2=0\n Do L = 1 To p0.0\n l2=l+2\n tmp2.l2=p0.l\n End\n Do j=1 To tmp.0\n tmp.j = ((2*k-1)*tmp.j - (k-1)*tmp2.j)/k\n End\n p0.0=p1.0\n Do j=1 To p0.0\n p0.j = p1.j\n End\n p1.0=tmp.0\n Do j=1 To p1.0\n p1.j=tmp.j\n End\n End\n Do i = 1 To n\n x = cos(pi*(i-0.25)/(n+0.5),prec)\n Do iter = 1 To 10\n f = p1.1; df = 0\n Do k = 2 To p1.0\n df = f + x*df\n f = p1.k + x * f\n End\n dx = f / df\n x = x - dx\n If abs(dx) < epsilon then leave\n End\n r.1.i = x\n r.2.i = 2/((1-x**2)*df**2)\n End\n Return\n\ncos: Procedure\n/* REXX ****************************************************************\n* Return cos(x) -- with specified precision\n* cos(x) = 1-(x**2/2!)+(x**4/4!)-(x**6/6!)+-...\n* 920903 Walter Pachl\n***********************************************************************/\n Parse Arg x,prec\n If prec='' Then prec=9\n Numeric Digits (2*prec)\n Numeric Fuzz 3\n o=1\n u=1\n r=1\n Do i=1 By 2\n ra=r\n o=-o*x*x\n u=u*i*(i+1)\n r=r+(o/u)\n If r=ra Then Leave\n End\n Numeric Digits prec\n Return r+0\n\nexp: Procedure\n/***********************************************************************\n* Return exp(x) -- with reasonable precision\n* 920903 Walter Pachl\n***********************************************************************/\n Parse Arg x,prec\n If prec<9 Then prec=9\n Numeric Digits (2*prec)\n Numeric Fuzz 3\n o=1\n u=1\n r=1\n Do i=1 By 1\n ra=r\n o=o*x\n u=u*i\n r=r+(o/u)\n If r=ra Then Leave\n End\n Numeric Digits (prec)\n Return r+0\n","language":"REXX"},{"code":"/*REXX program does numerical integration using an N─point Gauss─Legendre quadrature rule. */\npi= pi(); digs= length(pi) - length(.); numeric digits digs; reps= digs % 2\n\n!.= .; b= 3; a= -b; bma= b - a; bmaH= bma / 2; tiny= '1e-'digs\ntrueV= exp(b)-exp(a); bpa= b + a; bpaH= bpa / 2\nhdr= 'iterate value (with ' digs \" decimal digits being used)\"\nsay ' step ' center(hdr, digs+3) ' difference' /*show hdr*/\nsep='──────' copies(\"─\", digs+3) '─────────────'; say sep /* \" sep*/\n\n do #=1 until dif>0; p0z= 1; p0.1= 1; p1z= 2; p1.1= 1; p1.2= 0; ##= # + .5; r.= 0\n /*█*/ do k=2 to #; km= k - 1\n /*█*/ do y=1 for p1z; T.y= p1.y; end /*y*/\n /*█*/ T.y= 0; TT.= 0; do L=1 for p0z; _= L + 2; TT._= p0.L; end /*L*/\n /*█*/ kkm= k + km; do j=1 for p1z +1; T.j= (kkm*T.j - km*TT.j)/k; end /*j*/\n /*█*/ p0z= p1z; do n=1 for p0z; p0.n= p1.n ; end /*n*/\n /*█*/ p1z= p1z + 1; do p=1 for p1z; p1.p= T.p ; end /*p*/\n /*█*/ end /*k*/\n /*▓*/ do !=1 for #; x= cos( pi * (! - .25) / ## )\n /*▓*/ /*░*/ do reps until abs(dx) <= tiny\n /*▓*/ /*░*/ f= p1.1; df= 0; do u=2 to p1z; df= f + x*df\n /*▓*/ /*░*/ f= p1.u +x*f\n /*▓*/ /*░*/ end /*u*/\n /*▓*/ /*░*/ dx= f / df; x= x - dx\n /*▓*/ /*░*/ end /*reps ···*/\n /*▓*/ r.1.!= x\n /*▓*/ r.2.!= 2 / ( (1 - x*x) * df*df)\n /*▓*/ end /*!*/\n $= 0\n /*▒*/ do m=1 for #; $=$ + r.2.m * exp(bpaH + r.1.m*bmaH); end /*m*/\n z= bmaH * $ /*calculate target value (Z)*/\n dif= z - trueV; z= format(z, 3, digs - 2) /* \" difference. */\n Ndif= translate( format(dif, 3, 4, 2, 0), 'e', \"E\")\n if #\\==1 then say center(#, 6) z' ' Ndif /*no display if not computed*/\n end /*#*/\n\nsay sep; xdif= compare( strip(z), trueV); say right(\"↑\", 6 + 1 + xdif)\nsay left('', 6 + 1) trueV \" {exact value}\"; say\nsay 'Using ' digs \" digit precision, the\" ,\n 'N-point Gauss─Legendre quadrature (GLQ) had an accuracy of ' xdif-2 \" digits.\"\nexit 0 /*stick a fork in it, we're all done. */\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\ne: return 2.718281828459045235360287471352662497757247093699959574966967627724076630353547595\npi: return 3.141592653589793238462643383279502884197169399375105820974944592307816406286286209\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\ncos: procedure expose !.; parse arg x; if !.x\\==. then return !.x; _= 1; z=1; y= x*x\n do k=2 by 2 until p==z; p=z; _= -_*y/(k*(k-1)); z=z+_; end; !.x=z; return z\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\nexp: procedure; parse arg x; ix= x % 1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix; z= 1\n _=1; do j=1 until p==z; p=z; _= _*x/j; z= z+_; end; return z * e()**ix\n","language":"REXX"},{"code":"/*REXX program does numerical integration using an N─point Gauss─Legendre quadrature rule. */\npi= pi(); digs= length(pi) - length(.); numeric digits digs; reps= digs % 2\n!.= .; b= 3; a= -b; bma= b - a; bmaH= bma / 2; tiny= '1e-'digs\ntrueV= exp(b)-exp(a); bpa= b + a; bpaH= bpa / 2\nhdr= 'iterate value (with ' digs \" decimal digits being used)\"\nsay ' step ' center(hdr, digs+3) ' difference' /*show hdr*/\nsep='──────' copies(\"─\", digs+3) '─────────────'; say sep /* \" sep*/\n\n do #=1 until dif>0; p0z= 1; p0.1= 1; p1z= 2; p1.1= 1; p1.2= 0; ##= # + .5; r.= 0\n /*█*/ do k=2 to #; km= k - 1\n /*█*/ do y=1 for p1z; T.y= p1.y; end /*y*/\n /*█*/ T.y= 0; TT.= 0; do L=1 for p0z; _= L + 2; TT._= p0.L; end /*L*/\n /*█*/ kkm= k + km; do j=1 for p1z +1; T.j= (kkm*T.j - km*TT.j)/k; end /*j*/\n /*█*/ p0z= p1z; do n=1 for p0z; p0.n= p1.n ; end /*n*/\n /*█*/ p1z= p1z + 1; do p=1 for p1z; p1.p= T.p ; end /*p*/\n /*█*/ end /*k*/\n /*▓*/ do !=1 for #; x= cos( pi * (! - .25) / ## )\n /*▓*/ /*░*/ do reps until abs(dx) <= tiny\n /*▓*/ /*░*/ f= p1.1; df= 0; do u=2 to p1z; df= f + x*df\n /*▓*/ /*░*/ f= p1.u +x*f\n /*▓*/ /*░*/ end /*u*/\n /*▓*/ /*░*/ dx= f / df; x= x - dx\n /*▓*/ /*░*/ end /*reps ···*/\n /*▓*/ r.1.!= x\n /*▓*/ r.2.!= 2 / ( (1 - x*x) * df*df)\n /*▓*/ end /*!*/\n $= 0\n /*▒*/ do m=1 for #; $=$ + r.2.m * exp(bpaH + r.1.m*bmaH); end /*m*/\n z= bmaH * $ /*calculate target value (Z)*/\n dif= z - trueV; z= format(z, 3, digs - 2) /* \" difference. */\n Ndif= translate( format(dif, 3, 4, 3, 0), 'e', \"E\")\n if #\\==1 then say center(#, 6) z' ' Ndif /*no display if not computed*/\n end /*#*/\n\nsay sep; xdif= compare( strip(z), trueV); say right(\"↑\", 6 + 1 + xdif)\nsay left('', 6 + 1) trueV \" {exact value}\"; say\nsay 'Using ' digs \" digit precision, the\" ,\n 'N-point Gauss─Legendre quadrature (GLQ) had an accuracy of ' xdif-2 \" digits.\"\nexit 0 /*stick a fork in it, we're all done. */\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\ne: return 2.71828182845904523536028747135266249775724709369995957496696762772407663035354759,\n ||457138217852516642742746639193200305992181741359662904357290033429526059563073813232862794\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\npi: return 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899,\n ||862803482534211706798214808651328230664709384460955058223172535940812848111745028410270194\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\ncos: procedure expose !.; parse arg x; if !.x\\==. then return !.x; _= 1; z=1; y= x*x\n do k=2 by 2 until p==z; p=z; _= -_*y/(k*(k-1)); z=z+_; end; !.x=z; return z\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\nexp: procedure; parse arg x; ix= x % 1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix; z= 1\n _=1; do j=1 until p==z; p=z; _= _*x/j; z= z+_; end; return z * e()**ix\n","language":"REXX"},{"code":"import scala.math.{Pi, cos, exp}\n\nobject GaussLegendreQuadrature extends App {\n private val N = 5\n\n private def legeInte(a: Double, b: Double): Double = {\n val (c1, c2) = ((b - a) / 2, (b + a) / 2)\n val tuples: IndexedSeq[(Double, Double)] = {\n val lcoef = {\n val lcoef = Array.ofDim[Double](N + 1, N + 1)\n\n lcoef(0)(0) = 1\n lcoef(1)(1) = 1\n for (i <- 2 to N) {\n lcoef(i)(0) = -(i - 1) * lcoef(i - 2)(0) / i\n for (j <- 1 to i) lcoef(i)(j) =\n ((2 * i - 1) * lcoef(i - 1)(j - 1) - (i - 1) * lcoef(i - 2)(j)) / i\n }\n lcoef\n }\n\n def legeEval(n: Int, x: Double): Double =\n lcoef(n).take(n).foldRight(lcoef(n)(n))((o, s) => s * x + o)\n\n def legeDiff(n: Int, x: Double): Double =\n n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1)\n\n @scala.annotation.tailrec\n def convergention(x0: Double, x1: Double): Double = {\n if (x0 == x1) x1\n else convergention(x1, x1 - legeEval(N, x1) / legeDiff(N, x1))\n }\n\n for {i <- 0 until 5\n x = convergention(0.0, cos(Pi * (i + 1 - 0.25) / (N + 0.5)))\n x1 = legeDiff(N, x)\n } yield (x, 2 / ((1 - x * x) * x1 * x1))\n }\n\n println(s\"Roots: ${tuples.map(el => f\" ${el._1}%10.6f\").mkString}\")\n println(s\"Weight:${tuples.map(el => f\" ${el._2}%10.6f\").mkString}\")\n\n c1 * tuples.map { case (lroot, weight) => weight * exp(c1 * lroot + c2) }.sum\n }\n\n println(f\"Integrating exp(x) over [-3, 3]:\\n\\t${legeInte(-3, 3)}%10.8f,\")\n println(f\"compared to actual%n\\t${exp(3) - exp(-3)}%10.8f\")\n\n}\n","language":"Scala"},{"code":"func legendre_pair((1), x) { (x, 1) }\nfunc legendre_pair( n, x) {\n var (m1, m2) = legendre_pair(n - 1, x)\n var u = (1 - 1/n)\n ((1 + u)*x*m1 - u*m2, m1)\n}\n\nfunc legendre((0), _) { 1 }\nfunc legendre( n, x) { [legendre_pair(n, x)][0] }\n\nfunc legendre_prime({ .is_zero }, _) { 0 }\nfunc legendre_prime({ .is_one }, _) { 1 }\n\nfunc legendre_prime(n, x) {\n var (m0, m1) = legendre_pair(n, x)\n (m1 - x*m0) * n / (1 - x**2)\n}\n\nfunc approximate_legendre_root(n, k) {\n # Approximation due to Francesco Tricomi\n var t = ((4*k - 1) / (4*n + 2))\n (1 - ((n - 1)/(8 * n**3))) * cos(Num.pi * t)\n}\n\nfunc newton_raphson(f, f_prime, r, eps = 2e-16) {\n loop {\n var dr = (-f(r) / f_prime(r))\n dr.abs >= eps || break\n r += dr\n }\n return r\n}\n\nfunc legendre_root(n, k) {\n newton_raphson(legendre.method(:call, n), legendre_prime.method(:call, n),\n approximate_legendre_root(n, k))\n}\n\nfunc weight(n, r) { 2 / ((1 - r**2) * legendre_prime(n, r)**2) }\n\nfunc nodes(n) {\n gather {\n take(Pair(0, weight(n, 0))) if n.is_odd\n { |i|\n var r = legendre_root(n, i)\n var w = weight(n, r)\n take(Pair(r, w), Pair(-r, w))\n }.each(1 .. (n >> 1))\n }\n}\n\nfunc quadrature(n, f, a, b, nds = nodes(n)) {\n func scale(x) { (x*(b - a) + a + b) / 2 }\n (b - a) / 2 * nds.sum { .second * f(scale(.first)) }\n}\n\n[(5..10)..., 20].each { |i|\n printf(\"Gauss-Legendre %2d-point quadrature ∫₋₃⁺³ exp(x) dx ≈ %.15f\\n\",\n i, quadrature(i, {.exp}, -3, +3))\n}\n","language":"Sidef"},{"code":"package require Tcl 8.5\npackage require math::special\npackage require math::polynomials\npackage require math::constants\nmath::constants::constants pi\n\n# Computes the initial guess for the root i of a n-order Legendre polynomial\nproc guess {n i} {\n global pi\n expr { cos($pi * ($i - 0.25) / ($n + 0.5)) }\n}\n\n# Computes and evaluates the n-order Legendre polynomial at the point x\nproc legpoly {n x} {\n math::polynomials::evalPolyn [math::special::legendre $n] $x\n}\n\n# Computes and evaluates the derivative of an n-order Legendre polynomial at point x\nproc legdiff {n x} {\n expr {$n / ($x**2 - 1) * ($x * [legpoly $n $x] - [legpoly [incr n -1] $x])}\n}\n\n# Computes the n nodes for an n-point quadrature rule. (i.e. n roots of a n-order polynomial)\nproc nodes n {\n set x [lrepeat $n 0.0]\n for {set i 0} {$i < $n} {incr i} {\n\tset val [guess $n [expr {$i + 1}]]\n\tforeach . {1 2 3 4 5} {\n\t set val [expr {$val - [legpoly $n $val] / [legdiff $n $val]}]\n\t}\n\tlset x $i $val\n }\n return $x\n}\n\n# Computes the weight for an n-order polynomial at the point (node) x\nproc legwts {n x} {\n expr {2.0 / (1 - $x**2) / [legdiff $n $x]**2}\n}\n\n# Takes a array of nodes x and computes an array of corresponding weights w\nproc weights x {\n set n [llength $x]\n set w {}\n foreach xi $x {\n\tlappend w [legwts $n $xi]\n }\n return $w\n}\n\n# Integrates a lambda term f with a n-point Gauss-Legendre quadrature rule over the interval [a,b]\nproc gausslegendreintegrate {f n a b} {\n set x [nodes $n]\n set w [weights $x]\n set rangesize2 [expr {($b - $a)/2}]\n set rangesum2 [expr {($a + $b)/2}]\n set sum 0.0\n foreach xi $x wi $w {\n\tset y [expr {$rangesize2*$xi + $rangesum2}]\n\tset sum [expr {$sum + $wi*[apply $f $y]}]\n }\n expr {$sum * $rangesize2}\n}\n","language":"Tcl"},{"code":"puts \"nodes(5) = [nodes 5]\"\nputs \"weights(5) = [weights [nodes 5]]\"\nset exp {x {expr {exp($x)}}}\nputs \"int(exp,-3,3) = [gausslegendreintegrate $exp 5 -3 3]\"\n","language":"Tcl"},{"code":"#import std\n#import nat\n\nlegendre = # takes n to the pair of functions (P_n,P'_n), where P_n is the Legendre polynomial of order n\n\n~&?\\(1E0!,0E0!)! -+\n ^|/~& //mp..vid^ mp..sub\\1E0+ mp..sqr,\n ~~ \"c\". ~&\\1E0; ~&\\\"c\"; ~&ar^?\\0E0! mp..add^/mp..mul@alrPrhPX ^|R/~& ^|\\~&t ^/~&l mp..mul,\n @iiXNX ~&rZ->r @l ^/^|(~&tt+ sum@NNiCCiX+ successor,~&) both~&g&&~&+ -+\n ~* mp..zero_p?/~& (&&~&r ~&EZ+ ~~ mp..prec)^/~& ^(~&,..shr\\8); mp..equ^|(~&,..gro\\8)->l @r ^/~& ..shr\\8,\n ^(~&rl,mp..mul*lrrPD)^/..nat2mp@r -+\n ^(~&l,mp..sub*+ zipp0E0^|\\~& :/0E0)+ ~&rrt->lhthPX ^(\n ^lrNCC\\~&lh mp..vid^*D/..nat2mp@rl -+\n mp..sub*+ zipp0E0^|\\~& :/0E0,\n mp..mul~*brlD^|bbI/~&hthPX @l ..nat2mp~~+ predecessor~~NiCiX+-,\n @r ^|/successor predecessor),\n ^|(mp..grow/1E0; @iNC ^lrNCC\\~& :/0E0,~&/2)+-+-+-\n\nnodes = # takes precision and order (p,n) to a list of nodes and weights <(x_1,w_1)..(x_n,w_n)>\n\n-+\n ^H(\n @lrr *+ ^/~&+ mp..div/( ..nat2mp 2)++ mp..mul^/(mp..sqr; //mp..sub ..nat2mp 1)+ mp..sqr+,\n mp..shr^*DrlXS/~&ll ^|H\\~& *+ @NiX+ ->l^|(~&lZ!|+ not+ //mp..eq,@r+ ^/~&+ mp..sub^/~&+ mp..div^)),\n ^/^|(~&,legendre) mp..cos*+ mp..mul^*D(\n mp..div^|/mp..pi@NiC mp..add/5E-1+ ..nat2mp,\n @r mp..bus/*2.5E-1+ ..nat2mp*+ nrange/1)+-\n\nintegral = # takes precision and order (p,n) to a function taking a function and interval (f,(a,b))\n\n(\"p\",\"n\"). -+\n mp..shrink^/~& difference\\\"p\"+ mp..prec,\n mp..mul^|/~& mp..add:-0E0+ * mp..mul^/~&rr ^H/~&ll mp..add^\\~&lrr mp..mul@lrPrXl,\n ^(~&rl,-*nodes(\"p\",\"n\"))^|/~& mp..vid~~G/2E0+ ^/mp..bus mp..add+-\n","language":"Ursala"},{"code":"#show+\n\ndemo =\n\n~&lNrCT (\n ^|lNrCT(:/'nodes:',:/'weights:')@lSrSX ..mp2str~~* nodes/160 5,\n :/'integral:' ~&iNC ..mp2str integral(160,5) (mp..exp,-3E0,3E0))\n","language":"Ursala"},{"code":"import \"./fmt\" for Fmt\n\nvar N = 5\n\nvar lroots = List.filled(N, 0)\nvar weight = List.filled(N, 0)\n\nvar lcoef = List.filled(N+1, null)\nfor (i in 0..N) lcoef[i] = List.filled(N + 1, 0)\n\nvar legeCoef = Fn.new {\n lcoef[0][0] = lcoef[1][1] = 1\n for (n in 2..N) {\n lcoef[n][0] = -(n-1) * lcoef[n -2][0] / n\n for (i in 1..n) {\n lcoef[n][i] = ((2*n - 1) * lcoef[n-1][i-1] - (n - 1) * lcoef[n-2][i]) / n\n }\n }\n}\n\nvar legeEval = Fn.new { |n, x| (n..1).reduce(lcoef[n][n]) { |s, i| s*x + lcoef[n][i-1] } }\n\nvar legeDiff = Fn.new { |n, x|\n return n * (x * legeEval.call(n, x) - legeEval.call(n-1, x)) / (x*x - 1)\n}\n\nvar legeRoots = Fn.new {\n var x = 0\n var x1 = 0\n for (i in 1..N) {\n x = (Num.pi * (i - 0.25) / (N + 0.5)).cos\n while (true) {\n x1 = x\n x = x - legeEval.call(N, x) / legeDiff.call(N, x)\n if (x == x1) break\n }\n lroots[i-1] = x\n x1 = legeDiff.call(N, x)\n weight[i-1] = 2 / ((1 - x*x) * x1 * x1)\n }\n}\n\nvar legeIntegrate = Fn.new { |f, a, b|\n var c1 = (b - a) / 2\n var c2 = (b + a) / 2\n var sum = 0\n for (i in 0...N) sum = sum + weight[i] * f.call(c1*lroots[i] + c2)\n return c1 * sum\n}\n\nlegeCoef.call()\nlegeRoots.call()\nSystem.write(\"Roots: \")\nfor (i in 0...N) Fmt.write(\" $f\", lroots[i])\nSystem.write(\"\\nWeight:\")\nfor (i in 0...N) Fmt.write(\" $f\", weight[i])\n\nvar f = Fn.new { |x| x.exp }\nvar actual = 3.exp - (-3).exp\nFmt.print(\"\\nIntegrating exp(x) over [-3, 3]:\\n\\t$10.8f,\\n\" +\n \"compared to actual\\n\\t$10.8f\", legeIntegrate.call(f, -3, 3), actual)\n","language":"Wren"},{"code":"fcn legendrePair(n,x){ //-->(float,float)\n if(n==1) return(x,1.0);\n m1,m2:=legendrePair(n-1,x);\n u:=1.0 - 1.0/n;\n return( (u + 1)*x*m1 - u*m2, m1);\n}\nfcn legendre(n,x){ //-->float\n if(n==0) return(0.0);\n legendrePair(n,x)[0]\n}\nfcn legendrePrime(n,x){ //-->float\n if(n==0) return(0.0);\n if(n==1) return(1.0);\n m0,m1:=legendrePair(n,x);\n (m1 - m0*x)*n/(1.0 - x*x);\n}\nfcn approximateLegendreRoot(n,k){ # Approximation due to Francesco Tricomi\n t:=(4.0*k - 1)/(4.0*n + 2);\n (1.0 - (n - 1)/(8*n*n*n))*((0.0).pi*t).cos();\n}\nfcn newtonRaphson(f,fPrime,r,eps=2.0e-16){\n while(not (dr:=-f(r)/fPrime(r)).closeTo(0.0,eps)){ r+=dr }\n r;\n}\nfcn legendreRoot(n,k){\n newtonRaphson(legendre.fp(n),legendrePrime.fp(n),\n approximateLegendreRoot(n,k));\n}\nfcn weight(n,r){\n lp:=legendrePrime(n,r);\n 2.0/((1.0 - r*r)*lp*lp)\n}\nfcn nodes(n){ //-->( (r,weight), (r,w), ...) length n\n sink:=n.isOdd and L(T(0.0,weight(n,0))) or List;\n (1).pump(n/2,sink,'wrap(m){\n r:=legendreRoot(n,m);\n w:=weight(n,r);\n return( Void.Write,T(r,w),T(-r,w) )\n })\n}\nfcn quadrature(n,f,a,b,nds=Void){\n if(not nds) nds=nodes(n);\n scale:='wrap(x){ (x*(b - a) + a + b) / 2 };\n nds.reduce('wrap(p,[(r,w)]){ p + w*f(scale(r)) },0.0) * (b - a)/2\n}\n","language":"Zkl"},{"code":"[5..10].walk().append(20).pump(Console.println,fcn(n){\n (\"Gauss-Legendre %2d-point quadrature \"\n \"\\U222B;\\U208B;\\U2083;\\U207A;\\UB3; exp(x) dx = %.13f\")\n .fmt(n,quadrature(n, fcn(x){ x.exp() }, -3, 3))\n})\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Arithmetic\\n- Mathematics\\nfrom: http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature\\nnote: Arithmetic operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{|border=1 cellspacing=0 cellpadding=3\\n|In a general [[wp:Gaussian quadrature|Gaussian quadrature]] rule, an definite integral of <math>f(x)</math> is first approximated over the interval <math>[-1,1]</math> by a polynomial approximable function <math>g(x)</math> and a known weighting function <math>W(x)</math>.\\n|<math>\\\\int_{-1}^1 f(x) \\\\, dx = \\\\int_{-1}^1 W(x) g(x) \\\\, dx</math>\\n|-\\n|Those are then approximated by a sum of function values at specified points <math>x_i</math> multiplied by some weights <math>w_i</math>:\\n|<math>\\\\int_{-1}^1 W(x) g(x) \\\\, dx \\\\approx \\\\sum_{i=1}^n w_i g(x_i)</math>\\n|-\\n|In the case of Gauss-Legendre quadrature, the weighting function <math>W(x) = 1</math>, so we can approximate an integral of <math>f(x)</math> with:\\n|<math>\\\\int_{-1}^1 f(x)\\\\,dx \\\\approx \\\\sum_{i=1}^n w_i f(x_i)</math>\\n|}\\n\\n\\nFor this, we first need to calculate the nodes and the weights, but after we have them, we can reuse them for numerious integral evaluations, which greatly speeds up the calculation compared to more [[Numerical Integration|simple numerical integration methods]].\\n\\n{|border=1 cellspacing=0 cellpadding=3\\n|The <math>n</math> evaluation points <math>x_i</math> for a n-point rule, also called \\\"nodes\\\", are roots of n-th order [[wp:Legendre Polynomials|Legendre Polynomials]] <math>P_n(x)</math>. Legendre polynomials are defined by the following recursive rule:\\n|<math>P_0(x) = 1</math><br/>\\n<math>P_1(x) = x</math><br/>\\n<math>nP_{n}(x) = (2n-1)xP_{n-1}(x)-(n-1)P_{n-2}(x)</math>\\n|-\\n|There is also a recursive equation for their derivative:\\n|<math>P_{n}'(x) = \\\\frac{n}{x^2-1} \\\\left( x P_n(x) - P_{n-1}(x) \\\\right)</math>\\n|-\\n|The roots of those polynomials are in general not analytically solvable, so they have to be approximated numerically, for example by [[wp:Newton's method|Newton-Raphson iteration]]:\\n|<math>x_{n+1} = x_n - \\\\frac{f(x_n)}{f'(x_n)}</math>\\n|-\\n|The first guess <math>x_0</math> for the <math>i</math>-th root of a <math>n</math>-order polynomial <math>P_n</math> can be given by\\n|<math>x_0 = \\\\cos \\\\left( \\\\pi \\\\, \\\\frac{i - \\\\frac{1}{4}}{n+\\\\frac{1}{2}} \\\\right)</math>\\n|-\\n|After we get the nodes <math>x_i</math>, we compute the appropriate weights by:\\n|<math>w_i = \\\\frac{2}{\\\\left( 1-x_i^2 \\\\right) [P'_n(x_i)]^2}</math>\\n|-\\n|After we have the nodes and the weights for a n-point quadrature rule, we can approximate an integral over any interval <math>[a,b]</math> by\\n|<math>\\\\int_a^b f(x)\\\\,dx \\\\approx \\\\frac{b-a}{2} \\\\sum_{i=1}^n w_i f\\\\left(\\\\frac{b-a}{2}x_i + \\\\frac{a+b}{2}\\\\right)</math>\\n|}\\n\\n\\n'''Task description'''\\n\\nSimilar to the task [[Numerical Integration]], the task here is to calculate the definite integral of a function <math>f(x)</math>, but by applying an n-point Gauss-Legendre quadrature rule, as described [[wp:Gaussian Quadrature|here]], for example. The input values should be an function f to integrate, the bounds of the integration interval a and b, and the number of gaussian evaluation points n. An reference implementation in Common Lisp is provided for comparison.\\n\\nTo demonstrate the calculation, compute the weights and nodes for an 5-point quadrature rule and then use them to compute:\\n <big><big><math>\\\\int_{-3}^{3} \\\\exp(x) \\\\, dx \\\\approx \\\\sum_{i=1}^5 w_i \\\\; \\\\exp(x_i) \\\\approx 20.036</math></big></big>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F legendreIn(x, n)\\n F prev1(idx, pn1)\\n R (2 * idx - 1) * @x * pn1\\n F prev2(idx, pn2)\\n R (idx - 1) * pn2\\n\\n I n == 0\\n R 1.0\\n E I n == 1\\n R x\\n E\\n V result = 0.0\\n V p1 = x\\n V p2 = 1.0\\n L(i) 2 .. n\\n result = (prev1(i, p1) - prev2(i, p2)) / i\\n p2 = p1\\n p1 = result\\n R result\\n\\nF deriveLegendreIn(x, n)\\n F calcresult(curr, prev)\\n R Float(@n) / (@x ^ 2 - 1) * (@x * curr - prev)\\n R calcresult(legendreIn(x, n), legendreIn(x, n - 1))\\n\\nF guess(n, i)\\n R cos(math:pi * (i - 0.25) / (n + 0.5))\\n\\nF nodes(n)\\n V result = [(0.0, 0.0)] * n\\n F calc(x)\\n R legendreIn(x, @n) / deriveLegendreIn(x, @n)\\n\\n L(i) 0 .< n\\n V x = guess(n, i + 1)\\n V x0 = x\\n x -= calc(x)\\n L abs(x - x0) > 1e-12\\n x0 = x\\n x -= calc(x)\\n\\n result[i] = (x, 2 / ((1.0 - x ^ 2) * (deriveLegendreIn(x, n)) ^ 2))\\n\\n R result\\n\\nF integ(f, ns, p1, p2)\\n F dist()\\n R (@p2 - @p1) / 2\\n F avg()\\n R (@p1 + @p2) / 2\\n V result = dist()\\n V sum = 0.0\\n V thenodes = [0.0] * ns\\n V weights = [0.0] * ns\\n L(nw) nodes(ns)\\n sum += nw[1] * f(dist() * nw[0] + avg())\\n thenodes[L.index] = nw[0]\\n weights[L.index] = nw[1]\\n\\n print(‘ nodes:’, end' ‘’)\\n L(n) thenodes\\n print(‘ #.5’.format(n), end' ‘’)\\n print()\\n print(‘ weights:’, end' ‘’)\\n L(w) weights\\n print(‘ #.5’.format(w), end' ‘’)\\n print()\\n R result * sum\\n\\nprint(‘integral: ’integ(x -> exp(x), 5, -3, 3))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include \\\"share/atspre_staload.hats\\\"\\n\\n%{^\\n#include <float.h>\\n#include <math.h>\\n%}\\n\\nextern fn {tk : tkind} g0float_pi : () -<> g0float tk\\nextern fn {tk : tkind} g0float_cos : g0float tk -<> g0float tk\\nextern fn {tk : tkind} g0float_exp : g0float tk -<> g0float tk\\nimplement g0float_pi<dblknd> () = $extval (double, \\\"M_PI\\\")\\nimplement g0float_cos<dblknd> x = $extfcall (double, \\\"cos\\\", x)\\nimplement g0float_exp<dblknd> x = $extfcall (double, \\\"exp\\\", x)\\n\\nmacdef PI = g0float_pi ()\\noverload cos with g0float_cos\\noverload exp with g0float_exp\\n\\nmacdef NAN = g0f2f ($extval (float, \\\"NAN\\\"))\\nmacdef Zero = g0i2f 0\\nmacdef One = g0i2f 1\\nmacdef Two = g0i2f 2\\n\\n(* Computes the initial guess for the root i of a n-order Legendre\\n polynomial. *)\\nfn {tk : tkind}\\nguess {n, i : int | 1 <= i; i <= n}\\n (n : int n, i : int i) :<> g0float tk =\\n cos (PI * ((g0i2f i - g0f2f 0.25) / (g0i2f n + g0f2f 0.5)))\\n\\n(* Computes and evaluates the degree-n Legendre polynomial at the\\n point x. *)\\nfn {tk : tkind}\\nlegpoly {n : pos}\\n (n : int n, x : g0float tk) :<> g0float tk =\\n let\\n fun\\n loop {i : int | 2 <= i; i <= n + 1} .<n + 1 - i>.\\n (i : int i, pa : g0float tk, pb : g0float tk)\\n :<> g0float tk =\\n if i = succ n then\\n pb\\n else\\n let\\n val iflt = (g0i2f i) : g0float tk\\n val pn = (((iflt + iflt - One) / iflt) * x * pb)\\n - (((iflt - One) / iflt) * pa)\\n in\\n loop (succ i, pb, pn)\\n end\\n in\\n if n = 0 then\\n One\\n else if n = 1 then\\n x\\n else\\n loop (2, One, x)\\n end\\n\\n(* Computes and evaluates the derivative of an n-order Legendre\\n polynomial at point x. *)\\nfn {tk : tkind}\\nlegdiff {n : int | 2 <= n}\\n (n : int n, x : g0float tk) :<> g0float tk =\\n (g0i2f n / ((x * x) - One))\\n * ((x * legpoly<tk> (n, x)) - legpoly<tk> (pred n, x))\\n\\n(* Computes the n nodes for an n-point quadrature rule (the n roots of\\n a degree-n polynomial). *)\\nfn {tk : tkind}\\nnodes {n : int | 2 <= n}\\n (n : int n) :<!refwrt> arrayref (g0float tk, n) =\\n let\\n val x = arrayref_make_elt<g0float tk> (i2sz n, Zero)\\n fn\\n v_update (v : g0float tk) :<> g0float tk =\\n v - (legpoly<tk> (n, v) / legdiff<tk> (n, v))\\n var i : Int\\n in\\n for* {i : nat | i <= n} .<n - i>.\\n (i : int i) =>\\n (i := 0; i <> n; i := succ i)\\n let\\n val v = guess<tk> (n, succ i)\\n val v = v_update v\\n val v = v_update v\\n val v = v_update v\\n val v = v_update v\\n val v = v_update v\\n in\\n x[i] := v\\n end;\\n x\\n end\\n\\n(* Computes the weight for an degree-n polynomial at the node x. *)\\nfn {tk : tkind}\\nlegwts {n : int | 2 <= n}\\n (n : int n, x : g0float tk) :<> g0float tk =\\n (* Here I am having slightly excessive fun with notation: *)\\n Two / ((One - (x * x)) * (y * y where {val y = legdiff<tk> (n, x)}))\\n (* Normally I would not write code in such fashion. :) Nevertheless,\\n it is interesting that this works. *)\\n\\n(* Takes an array of nodes x and computes an array of corresponding\\n weights w. Note that x is an arrayref, not an arrszref, and so\\n (unlike in the Common Lisp) we have to tell the function the size\\n of the new array w. That information is not otherwise stored AT\\n RUNTIME. The ATS compiler, however, will force us AT COMPILE TIME\\n to pass the correct size. *)\\nfn {tk : tkind}\\nweights {n : int | 2 <= n}\\n (n : int n, x : arrayref (g0float tk, n))\\n :<!refwrt> arrayref (g0float tk, n) =\\n let\\n val w = arrayref_make_elt<g0float tk> (i2sz n, Zero)\\n var i : Int\\n in\\n for* {i : nat | i <= n} .<n - i>.\\n (i : int i) =>\\n (i := 0; i <> n; i := succ i)\\n w[i] := legwts (n, x[i]);\\n w\\n end\\n\\n(* Estimates the definite integral of a function on [a,b], using an\\n n-point Gauss-Legendre quadrature rule. *)\\nfn {tk : tkind}\\nquad {n : int | 2 <= n}\\n (f : g0float tk -<> g0float tk,\\n n : int n,\\n a : g0float tk,\\n b : g0float tk) :<> g0float tk =\\n let\\n val x = $effmask_ref ($effmask_wrt (nodes<tk> n))\\n val w = $effmask_ref ($effmask_wrt (weights<tk> (n, x)))\\n\\n val ahalf = g0f2f 0.5 * a and bhalf = g0f2f 0.5 * b\\n val C1 = bhalf - ahalf and C2 = ahalf + bhalf\\n\\n fun\\n loop {i : nat | i <= n} .<n - i>.\\n (i : int i, sum : g0float tk) :<> g0float tk =\\n if i = n then\\n sum\\n else\\n let\\n val y = $effmask_ref (w[i] * f ((C1 * x[i]) + C2))\\n in\\n loop (succ i, sum + y)\\n end\\n in\\n C1 * loop (0, Zero)\\n end\\n\\nimplement\\nmain () =\\n let\\n val outf = stdout_ref\\n in\\n fprintln! (outf, \\\"nodes<dblknd> 5\\\");\\n fprint_arrayref_sep<double> (outf, nodes<dblknd> (5),\\n i2sz 5, \\\" \\\");\\n fprintln! (outf); fprintln! (outf);\\n fprintln! (outf, \\\"weights (nodes<dblknd> 5)\\\");\\n fprint_arrayref_sep<double> (outf, weights (5, nodes<dblknd> (5)),\\n i2sz 5, \\\" \\\");\\n fprintln! (outf); fprintln! (outf);\\n fprintln! (outf, \\\"quad (lam x => exp x, 5, ~3.0, 3.0) = \\\",\\n quad (lam x => exp x, 5, ~3.0, 3.0));\\n fprintln! (outf);\\n fprintln! (outf, \\\"More examples, borrowed from the Common Lisp:\\\");\\n fprintln! (outf, \\\"quad (lam x => x ** 3, 5, 0.0, 1.0) = \\\",\\n quad (lam x => x ** 3, 5, 0.0, 1.0));\\n fprintln! (outf, \\\"quad (lam x => 1.0 / x, 5, 1.0, 100.0) = \\\",\\n quad (lam x => 1.0 / x, 5, 1.0, 100.0));\\n fprintln! (outf, \\\"quad (lam x => x, 5, 0.0, 5000.0) = \\\",\\n quad (lam x => x, 5, 0.0, 5000.0));\\n fprintln! (outf, \\\"quad (lam x => x, 5, 0.0, 6000.0) = \\\",\\n quad (lam x => x, 5, 0.0, 6000.0));\\n 0\\n end\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"NNI ==> NonNegativeInteger\\nRECORD ==> Record(x : List Fraction Integer, w : List Fraction Integer)\\n\\ngaussCoefficients(n : NNI, eps : Fraction Integer) : RECORD ==\\n p := legendreP(n,z)\\n q := n/2*D(p, z)*legendreP(subtractIfCan(n,1)::NNI, z)\\n x := map(rhs,solve(p,eps))\\n w := [subst(1/q, z=xi) for xi in x]\\n [x,w]\\n\\ngaussIntegrate(e : Expression Float, segbind : SegmentBinding(Float), n : NNI) : Float ==\\n eps := 1/10^100\\n u := gaussCoefficients(n,eps)\\n interval := segment segbind\\n var := variable segbind\\n a := lo interval\\n b := hi interval\\n c := (a+b)/2\\n h := (b-a)/2\\n h*reduce(+,[wi*subst(e,var=c+xi*h) for xi in u.x for wi in u.w])\\n\",\n \"language\": \"Axiom\"\n },\n {\n \"code\": \"digits(50)\\ngaussIntegrate(4/(1+x^2), x=0..1, 20)\\n\\n (1) 3.1415926535_8979323846_2643379815_9534002592_872901276\\n Type: Float\\n% - %pi\\n\\n (2) - 0.3463549483_9378821092_475 E -26\\n\",\n \"language\": \"Axiom\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <math.h>\\n\\n#define N 5\\ndouble Pi;\\ndouble lroots[N];\\ndouble weight[N];\\ndouble lcoef[N + 1][N + 1] = {{0}};\\n\\nvoid lege_coef()\\n{\\n\\tint n, i;\\n\\tlcoef[0][0] = lcoef[1][1] = 1;\\n\\tfor (n = 2; n <= N; n++) {\\n\\t\\tlcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\\n\\t\\tfor (i = 1; i <= n; i++)\\n\\t\\t\\tlcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1]\\n\\t\\t\\t\\t\\t - (n - 1) * lcoef[n - 2][i] ) / n;\\n\\t}\\n}\\n\\ndouble lege_eval(int n, double x)\\n{\\n\\tint i;\\n\\tdouble s = lcoef[n][n];\\n\\tfor (i = n; i; i--)\\n\\t\\ts = s * x + lcoef[n][i - 1];\\n\\treturn s;\\n}\\n\\ndouble lege_diff(int n, double x)\\n{\\n\\treturn n * (x * lege_eval(n, x) - lege_eval(n - 1, x)) / (x * x - 1);\\n}\\n\\nvoid lege_roots()\\n{\\n\\tint i;\\n\\tdouble x, x1;\\n\\tfor (i = 1; i <= N; i++) {\\n\\t\\tx = cos(Pi * (i - .25) / (N + .5));\\n\\t\\tdo {\\n\\t\\t\\tx1 = x;\\n\\t\\t\\tx -= lege_eval(N, x) / lege_diff(N, x);\\n\\t\\t} while ( fdim( x, x1) > 2e-16 );\\n\\t\\t/* fdim( ) was introduced in C99, if it isn't available\\n\\t\\t * on your system, try fabs( ) */\\n\\t\\tlroots[i - 1] = x;\\n\\n\\t\\tx1 = lege_diff(N, x);\\n\\t\\tweight[i - 1] = 2 / ((1 - x * x) * x1 * x1);\\n\\t}\\n}\\n\\ndouble lege_inte(double (*f)(double), double a, double b)\\n{\\n\\tdouble c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\\n\\tint i;\\n\\tfor (i = 0; i < N; i++)\\n\\t\\tsum += weight[i] * f(c1 * lroots[i] + c2);\\n\\treturn c1 * sum;\\n}\\n\\nint main()\\n{\\n\\tint i;\\n\\tPi = atan2(1, 1) * 4;\\n\\n\\tlege_coef();\\n\\tlege_roots();\\n\\n\\tprintf(\\\"Roots: \\\");\\n\\tfor (i = 0; i < N; i++)\\n\\t\\tprintf(\\\" %g\\\", lroots[i]);\\n\\n\\tprintf(\\\"\\\\nWeight:\\\");\\n\\tfor (i = 0; i < N; i++)\\n\\t\\tprintf(\\\" %g\\\", weight[i]);\\n\\n\\tprintf(\\\"\\\\nintegrating Exp(x) over [-3, 3]:\\\\n\\\\t%10.8f,\\\\n\\\"\\n\\t\\t\\\"compred to actual\\\\n\\\\t%10.8f\\\\n\\\",\\n\\t\\tlege_inte(exp, -3, 3), exp(3) - exp(-3));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iomanip>\\n#include <cmath>\\n\\nnamespace Rosetta {\\n\\n /*! Implementation of Gauss-Legendre quadrature\\n * http://en.wikipedia.org/wiki/Gaussian_quadrature\\n * http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature\\n *\\n */\\n template <int N>\\n class GaussLegendreQuadrature {\\n public:\\n enum {eDEGREE = N};\\n\\n /*! Compute the integral of a functor\\n *\\n * @param a lower limit of integration\\n * @param b upper limit of integration\\n * @param f the function to integrate\\n * @param err callback in case of problems\\n */\\n template <typename Function>\\n double integrate(double a, double b, Function f) {\\n double p = (b - a) / 2;\\n double q = (b + a) / 2;\\n const LegendrePolynomial& legpoly = s_LegendrePolynomial;\\n\\n double sum = 0;\\n for (int i = 1; i <= eDEGREE; ++i) {\\n sum += legpoly.weight(i) * f(p * legpoly.root(i) + q);\\n }\\n\\n return p * sum;\\n }\\n\\n /*! Print out roots and weights for information\\n */\\n void print_roots_and_weights(std::ostream& out) const {\\n const LegendrePolynomial& legpoly = s_LegendrePolynomial;\\n out << \\\"Roots: \\\";\\n for (int i = 0; i <= eDEGREE; ++i) {\\n out << ' ' << legpoly.root(i);\\n }\\n out << std::endl;\\n out << \\\"Weights:\\\";\\n for (int i = 0; i <= eDEGREE; ++i) {\\n out << ' ' << legpoly.weight(i);\\n }\\n out << std::endl;\\n }\\n private:\\n /*! Implementation of the Legendre polynomials that form\\n * the basis of this quadrature\\n */\\n class LegendrePolynomial {\\n public:\\n LegendrePolynomial () {\\n // Solve roots and weights\\n for (int i = 0; i <= eDEGREE; ++i) {\\n double dr = 1;\\n\\n // Find zero\\n Evaluation eval(cos(M_PI * (i - 0.25) / (eDEGREE + 0.5)));\\n do {\\n dr = eval.v() / eval.d();\\n eval.evaluate(eval.x() - dr);\\n } while (fabs (dr) > 2e-16);\\n\\n this->_r[i] = eval.x();\\n this->_w[i] = 2 / ((1 - eval.x() * eval.x()) * eval.d() * eval.d());\\n }\\n }\\n\\n double root(int i) const { return this->_r[i]; }\\n double weight(int i) const { return this->_w[i]; }\\n private:\\n double _r[eDEGREE + 1];\\n double _w[eDEGREE + 1];\\n\\n /*! Evaluate the value *and* derivative of the\\n * Legendre polynomial\\n */\\n class Evaluation {\\n public:\\n explicit Evaluation (double x) : _x(x), _v(1), _d(0) {\\n this->evaluate(x);\\n }\\n\\n void evaluate(double x) {\\n this->_x = x;\\n\\n double vsub1 = x;\\n double vsub2 = 1;\\n double f = 1 / (x * x - 1);\\n\\n for (int i = 2; i <= eDEGREE; ++i) {\\n this->_v = ((2 * i - 1) * x * vsub1 - (i - 1) * vsub2) / i;\\n this->_d = i * f * (x * this->_v - vsub1);\\n\\n vsub2 = vsub1;\\n vsub1 = this->_v;\\n }\\n }\\n\\n double v() const { return this->_v; }\\n double d() const { return this->_d; }\\n double x() const { return this->_x; }\\n\\n private:\\n double _x;\\n double _v;\\n double _d;\\n };\\n };\\n\\n /*! Pre-compute the weights and abscissae of the Legendre polynomials\\n */\\n static LegendrePolynomial s_LegendrePolynomial;\\n };\\n\\n template <int N>\\n typename GaussLegendreQuadrature<N>::LegendrePolynomial GaussLegendreQuadrature<N>::s_LegendrePolynomial;\\n}\\n\\n// This to avoid issues with exp being a templated function\\ndouble RosettaExp(double x) {\\n return exp(x);\\n}\\n\\nint main() {\\n Rosetta::GaussLegendreQuadrature<5> gl5;\\n\\n std::cout << std::setprecision(10);\\n\\n gl5.print_roots_and_weights(std::cout);\\n std::cout << \\\"Integrating Exp(X) over [-3, 3]: \\\" << gl5.integrate(-3., 3., RosettaExp) << std::endl;\\n std::cout << \\\"Actual value: \\\" << RosettaExp(3) - RosettaExp(-3) << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n//Works in .NET 6+\\n//Tested using https://dotnetfiddle.net because im lazy\\n\\npublic class Program {\\n\\n public static double[][] legeCoef(int N) {\\n //Initialising Jagged Array\\n double[][] lcoef = new double[N+1][];\\n for (int i=0; i < lcoef.Length; ++i)\\n lcoef[i] = new double[N+1];\\n\\n\\n lcoef[0][0] = lcoef[1][1] = 1;\\n for (int n = 2; n <= N; n++) {\\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\\n for (int i = 1; i <= n; i++)\\n lcoef[n][i] = ((2*n - 1) * lcoef[n-1][i-1]\\n - (n-1) * lcoef[n-2][i] ) / n;\\n }\\n return lcoef;\\n }\\n\\n\\n static double legeEval(double[][] lcoef, int N, double x) {\\n double s = lcoef[N][N];\\n for (int i = N; i > 0; --i)\\n s = s * x + lcoef[N][i-1];\\n return s;\\n }\\n\\n static double legeDiff(double[][] lcoef, int N, double x) {\\n return N * (x * legeEval(lcoef, N, x) - legeEval(lcoef, N-1, x)) / (x*x - 1);\\n }\\n\\n static void legeRoots(double[][] lcoef, int N, out double[] lroots, out double[] weight) {\\n lroots = new double[N];\\n weight = new double[N];\\n\\n double x, x1;\\n for (int i = 1; i <= N; i++) {\\n x = Math.Cos(Math.PI * (i - 0.25) / (N + 0.5));\\n do {\\n x1 = x;\\n x -= legeEval(lcoef, N, x) / legeDiff(lcoef, N, x);\\n }\\n while (x != x1);\\n lroots[i-1] = x;\\n\\n x1 = legeDiff(lcoef, N, x);\\n weight[i-1] = 2 / ((1 - x*x) * x1*x1);\\n }\\n }\\n\\n\\n\\n static double legeInte(Func<Double, Double> f, int N, double[] weights, double[] lroots, double a, double b) {\\n double c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\\n for (int i = 0; i < N; i++)\\n sum += weights[i] * f.Invoke(c1 * lroots[i] + c2);\\n return c1 * sum;\\n }\\n\\n //..................Main...............................\\n public static string Combine(double[] arrayD) {\\n return string.Join(\\\", \\\", arrayD);\\t\\n }\\n\\n public static void Main() {\\n int N = 5;\\n\\n var lcoeff = legeCoef(N);\\n\\n double[] roots;\\n double[] weights;\\n legeRoots(lcoeff, N, out roots, out weights);\\n\\n var integrateResult = legeInte(x=>Math.Exp(x), N, weights, roots, -3, 3);\\n\\n Console.WriteLine(\\\"Roots: \\\" + Combine(roots));\\n Console.WriteLine(\\\"Weights: \\\" + Combine(weights)+ \\\"\\\\n\\\" );\\n Console.WriteLine(\\\"integral: \\\" + integrateResult );\\n Console.WriteLine(\\\"actual: \\\" + (Math.Exp(3)-Math.Exp(-3)) );\\n }\\n\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \";; Computes the initial guess for the root i of a n-order Legendre polynomial.\\n(defun guess (n i)\\n (cos (* pi\\n (/ (- i 0.25d0)\\n (+ n 0.5d0)))))\\n\\n;; Computes and evaluates the n-order Legendre polynomial at the point x.\\n(defun legpoly (n x)\\n (let ((pa 1.0d0)\\n (pb x)\\n (pn))\\n (cond ((= n 0) pa)\\n ((= n 1) pb)\\n (t (loop for i from 2 to n do\\n (setf pn (- (* (/ (- (* 2 i) 1) i) x pb)\\n (* (/ (- i 1) i) pa)))\\n (setf pa pb)\\n (setf pb pn)\\n finally (return pn))))))\\n\\n;; Computes and evaluates the derivative of an n-order Legendre polynomial at point x.\\n(defun legdiff (n x)\\n (* (/ n (- (* x x) 1))\\n (- (* x (legpoly n x))\\n (legpoly (- n 1) x))))\\n\\n;; Computes the n nodes for an n-point quadrature rule. (i.e. n roots of a n-order polynomial)\\n(defun nodes (n)\\n (let ((x (make-array n :initial-element 0.0d0)))\\n (loop for i from 0 to (- n 1) do\\n (let ((val (guess n (+ i 1))) ;Nullstellen-Schätzwert.\\n (itermax 5))\\n (dotimes (j itermax)\\n (setf val (- val\\n (/ (legpoly n val)\\n (legdiff n val)))))\\n (setf (aref x i) val)))\\n x))\\n\\n;; Computes the weight for an n-order polynomial at the point (node) x.\\n(defun legwts (n x)\\n (/ 2\\n (* (- 1 (* x x))\\n (expt (legdiff n x) 2))))\\n\\n;; Takes a array of nodes x and computes an array of corresponding weights w.\\n(defun weights (x)\\n (let* ((n (car (array-dimensions x)))\\n (w (make-array n :initial-element 0.0d0)))\\n (loop for i from 0 to (- n 1) do\\n (setf (aref w i) (legwts n (aref x i))))\\n w))\\n\\n;; Integrates a function f with a n-point Gauss-Legendre quadrature rule over the interval [a,b].\\n(defun int (f n a b)\\n (let* ((x (nodes n))\\n (w (weights x)))\\n (* (/ (- b a) 2.0d0)\\n (loop for i from 0 to (- n 1)\\n sum (* (aref w i)\\n (funcall f (+ (* (/ (- b a) 2.0d0)\\n (aref x i))\\n (/ (+ a b) 2.0d0))))))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(nodes 5)\\n#(0.906179845938664d0 0.5384693101056831d0 2.996272867003007d-95 -0.5384693101056831d0 -0.906179845938664d0)\\n\\n(weights (nodes 5))\\n#(0.23692688505618917d0 0.47862867049936647d0 0.5688888888888889d0 0.47862867049936647d0 0.23692688505618917d0)\\n\\n(int #'exp 5 -3 3)\\n20.035577718385568d0\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(int #'(lambda (x) (expt x 3)) 5 0 1)\\n0.24999999999999997d0\\n\\n(int #'(lambda (x) (/ 1 x)) 5 1 100)\\n4.059147508941519d0\\n\\n(int #'(lambda (x) x) 5 0 5000)\\n1.25d7\\n\\n(int #'(lambda (x) x) 5 0 6000)\\n1.8000000000000004d7\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.math;\\n\\nimmutable struct GaussLegendreQuadrature(size_t N, FP=double,\\n size_t NBITS=50) {\\n immutable static double[N] lroots, weight;\\n alias FP[N + 1][N + 1] CoefMat;\\n\\n pure nothrow @safe @nogc static this() {\\n static FP legendreEval(in ref FP[N + 1][N + 1] lcoef,\\n in int n, in FP x) pure nothrow {\\n FP s = lcoef[n][n];\\n foreach_reverse (immutable i; 1 .. n+1)\\n s = s * x + lcoef[n][i - 1];\\n return s;\\n }\\n\\n static FP legendreDiff(in ref CoefMat lcoef,\\n in int n, in FP x)\\n pure nothrow @safe @nogc {\\n return n * (x * legendreEval(lcoef, n, x) -\\n legendreEval(lcoef, n - 1, x)) /\\n (x ^^ 2 - 1);\\n }\\n\\n CoefMat lcoef = 0.0;\\n legendreCoefInit(/*ref*/ lcoef);\\n\\n // Legendre roots:\\n foreach (immutable i; 1 .. N + 1) {\\n FP x = cos(PI * (i - 0.25) / (N + 0.5));\\n FP x1;\\n do {\\n x1 = x;\\n x -= legendreEval(lcoef, N, x) /\\n legendreDiff(lcoef, N, x);\\n } while (feqrel(x, x1) < NBITS);\\n lroots[i - 1] = x;\\n x1 = legendreDiff(lcoef, N, x);\\n weight[i - 1] = 2 / ((1 - x ^^ 2) * (x1 ^^ 2));\\n }\\n }\\n\\n static private void legendreCoefInit(ref CoefMat lcoef)\\n pure nothrow @safe @nogc {\\n lcoef[0][0] = lcoef[1][1] = 1;\\n foreach (immutable int n; 2 .. N + 1) { // n must be signed.\\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\\n foreach (immutable i; 1 .. n + 1)\\n lcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1] -\\n (n - 1) * lcoef[n - 2][i]) / n;\\n }\\n }\\n\\n static public FP integrate(in FP function(/*in*/ FP x) pure nothrow @safe @nogc f,\\n in FP a, in FP b)\\n pure nothrow @safe @nogc {\\n immutable FP c1 = (b - a) / 2;\\n immutable FP c2 = (b + a) / 2;\\n FP sum = 0.0;\\n foreach (immutable i; 0 .. N)\\n sum += weight[i] * f(c1 * lroots[i] + c2);\\n return c1 * sum;\\n }\\n}\\n\\nvoid main() {\\n GaussLegendreQuadrature!(5, real) glq;\\n writeln(\\\"Roots: \\\", glq.lroots);\\n writeln(\\\"Weight: \\\", glq.weight);\\n writefln(\\\"Integrating exp(x) over [-3, 3]: %10.12f\\\",\\n glq.integrate(&exp, -3, 3));\\n writefln(\\\"Compred to actual: %10.12f\\\",\\n 3.0.exp - exp(-3.0));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Legendre;\\n\\n{$APPTYPE CONSOLE}\\n\\nconst Order = 5;\\n Epsilon = 1E-12;\\n\\nvar Roots : array[0..Order-1] of double;\\n Weight : array[0..Order-1] of double;\\n LegCoef : array [0..Order,0..Order] of double;\\n\\nfunction F(X:double) : double;\\nbegin\\n Result := Exp(X);\\nend;\\n\\nprocedure PrepCoef;\\nvar I, N : integer;\\nbegin\\n for I:=0 to Order do\\n for N := 0 to Order do\\n LegCoef[I,N] := 0;\\n LegCoef[0,0] := 1;\\n LegCoef[1,1] := 1;\\n For N:=2 to Order do\\n begin\\n LegCoef[N,0] := -(N-1) * LegCoef[N-2,0] / N;\\n For I := 1 to Order do\\n LegCoef[N,I] := ((2*N-1) * LegCoef[N-1,I-1] - (N-1)*LegCoef[N-2,I]) / N;\\n end;\\nend;\\n\\nfunction LegEval(N:integer; X:double) : double;\\nvar I : integer;\\nbegin\\n Result := LegCoef[n][n];\\n for I := N-1 downto 0 do\\n Result := Result * X + LegCoef[N][I];\\nend;\\n\\nfunction LegDiff(N:integer; X:double) : double;\\nbegin\\n Result := N * (X * LegEval(N,X) - LegEval(N-1,X)) / (X*X-1);\\nend;\\n\\nprocedure LegRoots;\\nvar I : integer;\\n X, X1 : double;\\nbegin\\n for I := 1 to Order do\\n begin\\n X := Cos(Pi * (I-0.25) / (Order+0.5));\\n repeat\\n X1 := X;\\n X := X - LegEval(Order,X) / LegDiff(Order, X);\\n until Abs (X-X1) < Epsilon;\\n Roots[I-1] := X;\\n X1 := LegDiff(Order,X);\\n Weight[I-1] := 2 / ((1-X*X) * X1*X1);\\n end;\\nend;\\n\\nfunction LegInt(A,B:double) : double;\\nvar I : integer;\\n C1, C2 : double;\\nbegin\\n C1 := (B-A)/2;\\n C2 := (B+A)/2;\\n Result := 0;\\n For I := 0 to Order-1 do\\n Result := Result + Weight[I] * F(C1*Roots[I] + C2);\\n Result := C1 * Result;\\nend;\\n\\nvar I : integer;\\n\\nbegin\\n PrepCoef;\\n LegRoots;\\n\\n Write('Roots: ');\\n for I := 0 to Order-1 do\\n Write (' ',Roots[I]:13:10);\\n Writeln;\\n\\n Write('Weight: ');\\n for I := 0 to Order-1 do\\n Write (' ', Weight[I]:13:10);\\n writeln;\\n\\n Writeln('Integrating Exp(x) over [-3, 3]: ',LegInt(-3,3):13:10);\\n Writeln('Actual value: ',Exp(3)-Exp(-3):13:10);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"! Works with gfortran but needs the option\\n! -assume realloc_lhs\\n! when compiled with Intel Fortran.\\n\\nprogram gauss\\n implicit none\\n integer, parameter :: p = 16 ! quadruple precision\\n integer :: n = 10, k\\n real(kind=p), allocatable :: r(:,:)\\n real(kind=p) :: z, a, b, exact\\n do n = 1,20\\n a = -3; b = 3\\n r = gaussquad(n)\\n z = (b-a)/2*dot_product(r(2,:),exp((a+b)/2+r(1,:)*(b-a)/2))\\n exact = exp(3.0_p)-exp(-3.0_p)\\n print \\\"(i0,1x,g0,1x,g10.2)\\\",n, z, z-exact\\n end do\\n\\n contains\\n\\n function gaussquad(n) result(r)\\n integer :: n\\n real(kind=p), parameter :: pi = 4*atan(1._p)\\n real(kind=p) :: r(2, n), x, f, df, dx\\n integer :: i, iter\\n real(kind = p), allocatable :: p0(:), p1(:), tmp(:)\\n\\n p0 = [1._p]\\n p1 = [1._p, 0._p]\\n\\n do k = 2, n\\n tmp = ((2*k-1)*[p1,0._p]-(k-1)*[0._p, 0._p,p0])/k\\n p0 = p1; p1 = tmp\\n end do\\n do i = 1, n\\n x = cos(pi*(i-0.25_p)/(n+0.5_p))\\n do iter = 1, 10\\n f = p1(1); df = 0._p\\n do k = 2, size(p1)\\n df = f + x*df\\n f = p1(k) + x * f\\n end do\\n dx = f / df\\n x = x - dx\\n if (abs(dx)<10*epsilon(dx)) exit\\n end do\\n r(1,i) = x\\n r(2,i) = 2/((1-x**2)*df**2)\\n end do\\n end function\\nend program\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define PI 4 * Atn(1)\\nConst As Double LIM = 5\\n\\nDim Shared As Double lroots(LIM - 1)\\nDim Shared As Double weight(LIM - 1)\\n\\nDim Shared As Double lcoef(LIM, LIM)\\nFor i As Integer = 0 To LIM\\n For j As Integer = 0 To LIM\\n lcoef(i, j) = 0\\n Next j\\nNext i\\n\\nSub legeCoef()\\n lcoef(0, 0) = 1\\n lcoef(1, 1) = 1\\n For n As Integer = 2 To LIM\\n lcoef(n, 0) = -(n - 1) * lcoef(n - 2, 0) / n\\n For i As Integer = 1 To n\\n lcoef(n, i) = ((2 * n - 1) * lcoef(n - 1, i - 1) - (n - 1) * lcoef(n - 2, i)) / n\\n Next i\\n Next n\\nEnd Sub\\n\\nFunction legeEval(n As Integer, x As Double) As Double\\n Dim As Double s = lcoef(n, n)\\n For i As Integer = n To 1 Step -1\\n s = s * x + lcoef(n, i - 1)\\n Next i\\n Return s\\nEnd Function\\n\\nFunction legeDiff(n As Integer, x As Double) As Double\\n Return n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1)\\nEnd Function\\n\\nSub legeRoots()\\n Dim As Double x = 0\\n Dim As Double x1 = 0\\n For i As Integer = 1 To LIM\\n x = Cos(PI * (i - 0.25) / (LIM + 0.5))\\n Do\\n x1 = x\\n x = x - legeEval(LIM, x) / legeDiff(LIM, x)\\n Loop Until x = x1\\n lroots(i - 1) = x\\n x1 = legeDiff(LIM, x)\\n weight(i - 1) = 2 / ((1 - x * x) * x1 * x1)\\n Next i\\nEnd Sub\\n\\nFunction legeIntegrate(f As Function (As Double) As Double, a As Double, b As Double) As Double\\n Dim As Double c1 = (b - a) / 2\\n Dim As Double c2 = (b + a) / 2\\n Dim As Double sum = 0\\n For i As Integer = 0 To LIM - 1\\n sum = sum + weight(i) * f(c1 * lroots(i) + c2)\\n Next i\\n Return c1 * sum\\nEnd Function\\n\\nlegeCoef()\\nlegeRoots()\\n\\nPrint \\\"Roots: \\\";\\nFor i As Integer = 0 To LIM - 1\\n Print Using \\\" ##.######\\\"; lroots(i);\\nNext i\\nPrint\\n\\nPrint \\\"Weight:\\\";\\nFor i As Integer = 0 To LIM - 1\\n Print Using \\\" ##.######\\\"; weight(i);\\nNext i\\nPrint\\n\\nFunction f(x As Double) As Double\\n Return Exp(x)\\nEnd Function\\n\\nDim As Double actual = Exp(3) - Exp(-3)\\nPrint Using !\\\"Integrating exp(x) over [-3, 3]:\\\\n\\\\t########.######,\\\\ncompared to actual\\\\n\\\\t########.######\\\"; legeIntegrate(@f, -3, 3); actual\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n)\\n\\n// cFunc for continuous function. A type definition for convenience.\\ntype cFunc func(float64) float64\\n\\nfunc main() {\\n fmt.Println(\\\"integral:\\\", glq(math.Exp, -3, 3, 5))\\n}\\n\\n// glq integrates f from a to b by Guass-Legendre quadrature using n nodes.\\n// For the task, it also shows the intermediate values determining the nodes:\\n// the n roots of the order n Legendre polynomal and the corresponding n\\n// weights used for the integration.\\nfunc glq(f cFunc, a, b float64, n int) float64 {\\n x, w := glqNodes(n, f)\\n show := func(label string, vs []float64) {\\n fmt.Printf(\\\"%8s: \\\", label)\\n for _, v := range vs {\\n fmt.Printf(\\\"%8.5f \\\", v)\\n }\\n fmt.Println()\\n }\\n show(\\\"nodes\\\", x)\\n show(\\\"weights\\\", w)\\n var sum float64\\n bma2 := (b - a) * .5\\n bpa2 := (b + a) * .5\\n for i, xi := range x {\\n sum += w[i] * f(bma2*xi+bpa2)\\n }\\n return bma2 * sum\\n}\\n\\n// glqNodes computes both nodes and weights for a Gauss-Legendre\\n// Quadrature integration. Parameters are n, the number of nodes\\n// to compute and f, a continuous function to integrate. Return\\n// values have len n.\\nfunc glqNodes(n int, f cFunc) (node []float64, weight []float64) {\\n p := legendrePoly(n)\\n pn := p[n]\\n n64 := float64(n)\\n dn := func(x float64) float64 {\\n return (x*pn(x) - p[n-1](x)) * n64 / (x*x - 1)\\n }\\n node = make([]float64, n)\\n for i := range node {\\n x0 := math.Cos(math.Pi * (float64(i+1) - .25) / (n64 + .5))\\n node[i] = newtonRaphson(pn, dn, x0)\\n }\\n weight = make([]float64, n)\\n for i, x := range node {\\n dnx := dn(x)\\n weight[i] = 2 / ((1 - x*x) * dnx * dnx)\\n }\\n return\\n}\\n\\n// legendrePoly constructs functions that implement Lengendre polynomials.\\n// This is done by function composition by recurrence relation (Bonnet's.)\\n// For given n, n+1 functions are returned, computing P0 through Pn.\\nfunc legendrePoly(n int) []cFunc {\\n r := make([]cFunc, n+1)\\n r[0] = func(float64) float64 { return 1 }\\n r[1] = func(x float64) float64 { return x }\\n for i := 2; i <= n; i++ {\\n i2m1 := float64(i*2 - 1)\\n im1 := float64(i - 1)\\n rm1 := r[i-1]\\n rm2 := r[i-2]\\n invi := 1 / float64(i)\\n r[i] = func(x float64) float64 {\\n return (i2m1*x*rm1(x) - im1*rm2(x)) * invi\\n }\\n }\\n return r\\n}\\n\\n// newtonRaphson is general purpose, although totally primitive, simply\\n// panicking after a fixed number of iterations without convergence to\\n// a fixed error. Parameter f must be a continuous function,\\n// df its derivative, x0 an initial guess.\\nfunc newtonRaphson(f, df cFunc, x0 float64) float64 {\\n for i := 0; i < 30; i++ {\\n x1 := x0 - f(x0)/df(x0)\\n if math.Abs(x1-x0) <= math.Abs(x0*1e-15) {\\n return x1\\n }\\n x0 = x1\\n }\\n panic(\\\"no convergence\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"gaussLegendre n f a b = d*sum [ w x*f(m + d*x) | x <- roots ]\\n where d = (b - a)/2\\n m = (b + a)/2\\n w x = 2/(1-x^2)/(legendreP' n x)^2\\n roots = map (findRoot (legendreP n) (legendreP' n) . x0) [1..n]\\n x0 i = cos (pi*(i-1/4)/(n+1/2))\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"legendreP n x = go n 1 x\\n where go 0 p2 _ = p2\\n go 1 _ p1 = p1\\n go n p2 p1 = go (n-1) p1 $ ((2*n-1)*x*p1 - (n-1)*p2)/n\\n\\nlegendreP' n x = n/(x^2-1)*(x*legendreP n x - legendreP (n-1) x)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"findRoot f df = fixedPoint (\\\\x -> x - f x / df x)\\n\\nfixedPoint f x | abs (fx - x) < 1e-15 = x\\n | otherwise = fixedPoint f fx\\n where fx = f x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"integrate _ [] = 0\\nintegrate f (m:ms) = sum $ zipWith (gaussLegendre 5 f) (m:ms) ms\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"NB. returns coefficents for yth-order Legendre polynomial\\ngetLegendreCoeffs=: verb define M.\\n if. y<:1 do. 1 {.~ - y+1 return. end.\\n (%~ <:@(,~ +:) -/@:* (0;'') ,&> [: getLegendreCoeffs&.> -&1 2) y\\n)\\n\\ngetPolyRoots=: 1 {:: p. NB. returns the roots of a polynomial\\ngetGaussLegendreWeights=: 2 % -.@*:@[ * (*:@p.~ p..) NB. form: roots getGaussLegendreWeights coeffs\\ngetGaussLegendrePoints=: (getPolyRoots ([ ,: getGaussLegendreWeights) ])@getLegendreCoeffs\\n\\nNB.*integrateGaussLegendre a Integrates a function u with a n-point Gauss-Legendre quadrature rule over the interval [a,b]\\nNB. form: npoints function integrateGaussLegendre (a,b)\\nintegrateGaussLegendre=: adverb define\\n:\\n 'nodes wgts'=. getGaussLegendrePoints x\\n -: (-~/ y) * wgts +/@:* u -: nodes p.~ (+/ , -~/) y\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 5 ^ integrateGaussLegendre _3 3\\n20.0356\\n -~/ ^ _3 3 NB. true value\\n20.0357\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import static java.lang.Math.*;\\nimport java.util.function.Function;\\n\\npublic class Test {\\n final static int N = 5;\\n\\n static double[] lroots = new double[N];\\n static double[] weight = new double[N];\\n static double[][] lcoef = new double[N + 1][N + 1];\\n\\n static void legeCoef() {\\n lcoef[0][0] = lcoef[1][1] = 1;\\n\\n for (int n = 2; n <= N; n++) {\\n\\n lcoef[n][0] = -(n - 1) * lcoef[n - 2][0] / n;\\n\\n for (int i = 1; i <= n; i++) {\\n lcoef[n][i] = ((2 * n - 1) * lcoef[n - 1][i - 1]\\n - (n - 1) * lcoef[n - 2][i]) / n;\\n }\\n }\\n }\\n\\n static double legeEval(int n, double x) {\\n double s = lcoef[n][n];\\n for (int i = n; i > 0; i--)\\n s = s * x + lcoef[n][i - 1];\\n return s;\\n }\\n\\n static double legeDiff(int n, double x) {\\n return n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1);\\n }\\n\\n static void legeRoots() {\\n double x, x1;\\n for (int i = 1; i <= N; i++) {\\n x = cos(PI * (i - 0.25) / (N + 0.5));\\n do {\\n x1 = x;\\n x -= legeEval(N, x) / legeDiff(N, x);\\n } while (x != x1);\\n\\n lroots[i - 1] = x;\\n\\n x1 = legeDiff(N, x);\\n weight[i - 1] = 2 / ((1 - x * x) * x1 * x1);\\n }\\n }\\n\\n static double legeInte(Function<Double, Double> f, double a, double b) {\\n double c1 = (b - a) / 2, c2 = (b + a) / 2, sum = 0;\\n for (int i = 0; i < N; i++)\\n sum += weight[i] * f.apply(c1 * lroots[i] + c2);\\n return c1 * sum;\\n }\\n\\n public static void main(String[] args) {\\n legeCoef();\\n legeRoots();\\n\\n System.out.print(\\\"Roots: \\\");\\n for (int i = 0; i < N; i++)\\n System.out.printf(\\\" %f\\\", lroots[i]);\\n\\n System.out.print(\\\"\\\\nWeight:\\\");\\n for (int i = 0; i < N; i++)\\n System.out.printf(\\\" %f\\\", weight[i]);\\n\\n System.out.printf(\\\"%nintegrating Exp(x) over [-3, 3]:%n\\\\t%10.8f,%n\\\"\\n + \\\"compared to actual%n\\\\t%10.8f%n\\\",\\n legeInte(x -> exp(x), -3, 3), exp(3) - exp(-3));\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const factorial = n => n <= 1 ? 1 : n * factorial(n - 1);\\nconst M = n => (n - (n % 2 !== 0)) / 2;\\nconst gaussLegendre = (fn, a, b, n) => {\\n\\t// coefficients of the Legendre polynomial\\n\\tconst coef = [...Array(M(n) + 1)].map((v, m) => v = (-1) ** m * factorial(2 * n - 2 * m) / (2 ** n * factorial(m) * factorial(n - m) * factorial(n - 2 * m)));\\n\\t// the polynomial function\\n\\tconst f = x => coef.map((v, i) => v * x ** (n - 2 * i)).reduce((sum, item) => sum + item, 0);\\n\\tconst terms = coef.length - (n % 2 === 0);\\n\\t// coefficients of the derivative polybomial\\n\\tconst dcoef = [...Array(terms)].map((v, i) => v = n - 2 * i).map((val, i) => val * coef[i]);\\n\\t// the derivative polynomial function\\n\\tconst df = x => dcoef.map((v, i) => v * x ** (n - 1 - 2 * i)).reduce((sum, item) => sum + item, 0);\\n\\tconst guess = [...Array(n)].map((v, i) => Math.cos(Math.PI * (i + 1 - 1 / 4) / (n + 1 / 2)));\\n\\t// Newton Raphson\\n\\tconst roots = guess.map(xo => [...Array(100)].reduce(x => x - f(x) / df(x), xo));\\n\\tconst weights = roots.map(v => 2 / ((1 - v ** 2) * df(v) ** 2));\\n\\treturn (b - a) / 2 * weights.map((v, i) => v * fn((b - a) * roots[i] / 2 + (a + b) / 2)).reduce((sum, item) => sum + item, 0);\\n}\\nconsole.log(gaussLegendre(x => Math.exp(x), -3, 3, 5));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# output: an array\\ndef legendreCoef($N):\\n {lcoef: (reduce range(0;$N+1) as $i (null; .[$i] = [range(0;$N + 1)| 0]))}\\n | .lcoef[0][0] = 1\\n | .lcoef[1][1] = 1\\n | reduce range(2; $N+1) as $n (.;\\n .lcoef[$n][0] = -($n-1) * .lcoef[$n -2][0] / $n\\n | reduce range (1; $n+1) as $i (.;\\n .lcoef[$n][$i] = ((2*$n - 1) * .lcoef[$n-1][$i-1] - ($n - 1) * .lcoef[$n-2][$i]) / $n ) )\\n | .lcoef ;\\n\\n# input: lcoef\\n# output: the value\\ndef legendreEval($n; $x):\\n . as $lcoef\\n | reduce range($n; 0 ;-1) as $i ( $lcoef[$n][$n] ; . * $x + $lcoef[$n][$i-1] ) ;\\n\\n# input: lcoef\\ndef legendreDiff($n; $x):\\n $n * ($x * legendreEval($n; $x) - legendreEval($n-1; $x)) / ($x*$x - 1) ;\\n\\n# input: lcoef\\n# output: {lroots, weight}\\ndef legendreRoots($N):\\n def pi: 1|atan * 4;\\n . as $lcoef\\n | { x: 0, x1: null}\\n | reduce range(1; 1+$N) as $i (.;\\n .x = ((pi * ($i - 0.25) / ($N + 0.5)) | cos )\\n | until (.x == .x1;\\n .x1 = .x\\n | .x as $x\\n | .x = .x - ($lcoef | (legendreEval($N; $x) / legendreDiff($N; $x) )) )\\n | .lroots[$i-1] = .x\\n | .x as $x\\n | .x1 = ($lcoef|legendreDiff($N; $x))\\n | .weight[$i-1] = 2 / ((1 - .x*.x) * .x1 * .x1) ) ;\\n\\n# Input: {lroots, weight}\\ndef legendreIntegrate(f; $a; $b; $N):\\n .lroots as $lroots\\n | .weight as $weight\\n | (($b - $a) / 2) as $c1\\n | (($b + $a) / 2) as $c2\\n | reduce range(0;$N) as $i (0; . + $weight[$i] * (($c1* $lroots[$i] + $c2)|f) )\\n | $c1 * .;\\n\\ndef task($N):\\n def actual: 3|exp - ((-3)|exp);\\n\\n legendreCoef($N)\\n | legendreRoots($N)\\n | \\\"Roots: \\\",\\n .lroots,\\n \\\"\\\\nWeight:\\\",\\n .weight,\\n\\n \\\"\\\\nIntegrating exp(x) over [-3, 3]: \\\\(legendreIntegrate(exp; -3; 3; N))\\\",\\n \\\"compared to actual: \\\\(actual)\\\" ;\\n\\ntask(5)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using LinearAlgebra\\n\\nfunction gauss(a, b, N)\\n λ, Q = eigen(SymTridiagonal(zeros(N), [n / sqrt(4n^2 - 1) for n = 1:N-1]))\\n @. (λ + 1) * (b - a) / 2 + a, [2Q[1, i]^2 for i = 1:N] * (b - a) / 2\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import java.lang.Math.*\\n\\nclass Legendre(val N: Int) {\\n fun evaluate(n: Int, x: Double) = (n downTo 1).fold(c[n][n]) { s, i -> s * x + c[n][i - 1] }\\n\\n fun diff(n: Int, x: Double) = n * (x * evaluate(n, x) - evaluate(n - 1, x)) / (x * x - 1)\\n\\n fun integrate(f: (Double) -> Double, a: Double, b: Double): Double {\\n val c1 = (b - a) / 2\\n val c2 = (b + a) / 2\\n return c1 * (0 until N).fold(0.0) { s, i -> s + weights[i] * f(c1 * roots[i] + c2) }\\n }\\n\\n private val roots = DoubleArray(N)\\n private val weights = DoubleArray(N)\\n private val c = Array(N + 1) { DoubleArray(N + 1) } // coefficients\\n\\n init {\\n // coefficients:\\n c[0][0] = 1.0\\n c[1][1] = 1.0\\n for (n in 2..N) {\\n c[n][0] = (1 - n) * c[n - 2][0] / n\\n for (i in 1..n)\\n c[n][i] = ((2 * n - 1) * c[n - 1][i - 1] - (n - 1) * c[n - 2][i]) / n\\n }\\n\\n // roots:\\n var x: Double\\n var x1: Double\\n for (i in 1..N) {\\n x = cos(PI * (i - 0.25) / (N + 0.5))\\n do {\\n x1 = x\\n x -= evaluate(N, x) / diff(N, x)\\n } while (x != x1)\\n\\n x1 = diff(N, x)\\n roots[i - 1] = x\\n weights[i - 1] = 2 / ((1 - x * x) * x1 * x1)\\n }\\n\\n print(\\\"Roots:\\\")\\n roots.forEach { print(\\\" %f\\\".format(it)) }\\n println()\\n print(\\\"Weights:\\\")\\n weights.forEach { print(\\\" %f\\\".format(it)) }\\n println()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val legendre = Legendre(5)\\n println(\\\"integrating Exp(x) over [-3, 3]:\\\")\\n println(\\\"\\\\t%10.8f\\\".format(legendre.integrate(Math::exp, -3.0, 3.0)))\\n println(\\\"compared to actual:\\\")\\n println(\\\"\\\\t%10.8f\\\".format(exp(3.0) - exp(-3.0)))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local order = 0\\n\\nlocal legendreRoots = {}\\nlocal legendreWeights = {}\\n\\nlocal function legendre(term, z)\\n if (term == 0) then\\n return 1\\n elseif (term == 1) then\\n return z\\n else\\n return ((2 * term - 1) * z * legendre(term - 1, z) - (term - 1) * legendre(term - 2, z)) / term\\n end\\nend\\n\\nlocal function legendreDerivative(term, z)\\n if (term == 0) then\\n return 0\\n elseif (term == 1) then\\n return 1\\n else\\n return ( term * ((z * legendre(term, z)) - legendre(term - 1, z))) / (z * z - 1)\\n end\\nend\\n\\nlocal function getLegendreRoots()\\n local y, y1\\n\\t\\n for index = 1, order do\\n y = math.cos(math.pi * (index - 0.25) / (order + 0.5))\\n\\t\\t\\n repeat\\n y1 = y\\n y = y - (legendre(order, y) / legendreDerivative(order, y))\\n until y == y1\\n\\t\\t\\n table.insert(legendreRoots, y)\\n end\\nend\\n\\nlocal function getLegendreWeights()\\n for index = 1, order do\\n local weight = 2 / ((1 - (legendreRoots[index]) ^ 2) * (legendreDerivative(order, legendreRoots[index])) ^ 2)\\n table.insert(legendreWeights, weight)\\n end\\nend\\n\\nfunction gaussLegendreQuadrature(f, lowerLimit, upperLimit, n)\\n order = n\\n\\t\\n do\\n getLegendreRoots()\\n getLegendreWeights()\\n end\\n\\t\\n local c1 = (upperLimit - lowerLimit) / 2\\n local c2 = (upperLimit + lowerLimit) / 2\\n local sum = 0\\n\\t\\n for i = 1, order do\\n sum = sum + legendreWeights[i] * f(c1 * legendreRoots[i] + c2)\\n end\\n\\t\\n return c1 * sum\\nend\\n\\ndo\\n print(gaussLegendreQuadrature(function(x) return math.exp(x) end, -3, 3, 5))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"gaussLegendreQuadrature[func_, {a_, b_}, degree_: 5] :=\\nBlock[{nodes, x, weights},\\n nodes = Cases[NSolve[LegendreP[degree, x] == 0, x], _?NumericQ, Infinity];\\n weights = 2 (1 - nodes^2)/(degree LegendreP[degree - 1, nodes])^2;\\n (b - a)/2 weights.func[(b - a)/2 nodes + (b + a)/2]]\\ngaussLegendreQuadrature[Exp, {-3, 3}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"%Print the result.\\ndisp(GLGD_int(@(x) exp(x), -3, 3, 5));\\n\\n%Integration using Gauss-Legendre quad\\n%Does almost the same as 'integral' in MATLAB\\nfunction y=GLGD_int(fun,xmin,xmax,n)\\n%fun: the intergrand as a function handle\\n%xmin: lower boundary of integration\\n%xmax: upper boundary of integration\\n%n: order of polynomials used (number of integration ponts)\\n[x_IP,weight]=GLGD_para(n);\\n%assign global coordinates to the integraton points\\nx_eval=x_IP*(xmax-xmin)/2+(xmax+xmin)/2;\\ny=0;\\nfor aa=1:n\\n y=y+feval(fun,x_eval(aa))*weight(aa)*(xmax-xmin)/2;\\nend\\nend\\n\\nfunction [x_IP,weight]=GLGD_para(n)\\n%n: the order of the polynomial\\nx_IP=legendreRoot(n,10^(-16));\\nweight=2./(1-x_IP.^2)./diff_legendrePoly(x_IP,n).^2;\\nend\\n\\n%roots of the Legendre Polynomial using Newton-Raphson\\nfunction x_IP=legendreRoot(n,tol)\\n%n: order of the polynomial\\n%tol: tolerence of the error\\nif n<2\\n disp('No root can be found');\\nelse\\n root=zeros(1,floor(n/2));\\n for aa=1:floor(n/2) %iterate to find half of the roots\\n x=cos(pi*(aa-0.25)/(n+0.5));\\n err=10*tol;\\n iter=0;\\n while (err>tol)&&(iter<1000)\\n dx=-legendrePoly(x,n)/diff_legendrePoly(x,n);\\n x=x+dx;\\n iter=iter+1;\\n err=abs(legendrePoly(x,n));\\n end\\n root(aa)=x;\\n end\\n if mod(n,2)==0\\n x_IP=[-1*root,root];\\n else\\n x_IP=[-1*root,0,root];\\n end\\n x_IP=sort(x_IP);\\nend\\nend\\n\\n%derivative of the Legendre Polynomial\\nfunction y=diff_legendrePoly(x_IP,n)\\n%n: order of the polynomial\\n%x_IP: coordinates of the integration points\\nif n==0\\n y=0;\\nelse\\n y=n./(x_IP.^2-1).*(x_IP.*legendrePoly(x_IP,n)-legendrePoly(x_IP,n-1));\\nend\\nend\\n\\n%Produces Legendre Polynomials\\nfunction y=legendrePoly(x,n)\\n%n: order of polynomial\\n%x: input x\\nif n==0\\n y=1;\\nelseif n==1\\n y=x;\\nelse\\n y=((2*n-1).*x.*legendrePoly(x,n-1)-(n-1)*legendrePoly(x,n-2))/n;\\nend\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"gauss_coeff(n) := block([p, q, v, w],\\n p: expand(legendre_p(n, x)),\\n q: expand(n/2*diff(p, x)*legendre_p(n - 1, x)),\\n v: map(rhs, bfallroots(p)),\\n w: map(lambda([z], 1/subst([x = z], q)), v),\\n [map(bfloat, v), map(bfloat, w)])$\\n\\ngauss_int(f, a, b, n) := block([u, x, w, c, h],\\n u: gauss_coeff(n),\\n x: u[1],\\n w: u[2],\\n c: bfloat((a + b)/2),\\n h: bfloat((b - a)/2),\\n h*sum(w[i]*bfloat(f(c + x[i]*h)), i, 1, n))$\\n\\n\\nfpprec: 40$\\n\\n\\ngauss_int(lambda([x], 4/(1 + x^2)), 0, 1, 20);\\n/* 3.141592653589793238462643379852215927697b0 */\\n\\n% - bfloat(%pi);\\n/* -3.427286956499858315999116083264403489053b-27 */\\n\\n\\ngauss_int(exp, -3, 3, 5);\\n/* 2.003557771838556215392853572527509393154b1 */\\n\\n% - bfloat(integrate(exp(x), x, -3, 3));\\n/* -1.721364342416440206515136565621888185351b-4 */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"import math, strformat\\n\\nproc legendreIn(x: float, n: int): float =\\n\\n template prev1(idx: int; pn1: float): float =\\n (2*idx - 1).float * x * pn1\\n\\n template prev2(idx: int; pn2: float): float =\\n (idx-1).float * pn2\\n\\n if n == 0:\\n return 1.0\\n elif n == 1:\\n return x\\n else:\\n var\\n p1 = float x\\n p2 = 1.0\\n for i in 2 .. n:\\n result = (i.prev1(p1) - i.prev2(p2)) / i.float\\n p2 = p1\\n p1 = result\\n\\nproc deriveLegendreIn(x: float, n: int): float =\\n template calcresult(curr, prev: float): untyped =\\n n.float / (x^2 - 1) * (x * curr - prev)\\n result = calcresult(x.legendreIn n, x.legendreIn(n-1))\\n\\nfunc guess(n, i: int): float =\\n cos(PI * (i.float - 0.25) / (n.float + 0.5))\\n\\nproc nodes(n: int): seq[(float, float)] =\\n result = newseq[(float, float)](n)\\n template calc(x: float): untyped =\\n x.legendreIn(n) / x.deriveLegendreIn(n)\\n\\n for i in 0 .. result.high:\\n var x = guess(n, i+1)\\n block newton:\\n var x0 = x\\n x -= calc x\\n while abs(x-x0) > 1e-12:\\n x0 = x\\n x -= calc x\\n\\n result[i][0] = x\\n result[i][1] = 2 / ((1.0 - x^2) * (x.deriveLegendreIn n)^2)\\n\\nproc integ(f: proc(x: float): float; ns, p1, p2: int): float =\\n template dist: untyped =\\n (p2 - p1).float / 2.0\\n template avg: untyped =\\n (p1 + p2).float / 2.0\\n result = dist()\\n var\\n sum = 0'f\\n thenodes = newseq[float](ns)\\n weights = newseq[float](ns)\\n for i, nw in ns.nodes:\\n sum += nw[1] * f(dist() * nw[0] + avg())\\n thenodes[i] = nw[0]\\n weights[i] = nw[1]\\n\\n let apos = \\\":\\\"\\n stdout.write fmt\\\"\\\"\\\"{\\\"nodes\\\":>8}{apos}\\\"\\\"\\\"\\n for n in thenodes:\\n stdout.write &\\\" {n:>6.5f}\\\"\\n stdout.write \\\"\\\\n\\\"\\n stdout.write &\\\"\\\"\\\"{\\\"weights\\\":>8}{apos}\\\"\\\"\\\"\\n for w in weights:\\n stdout.write &\\\" {w:>6.5f}\\\"\\n stdout.write \\\"\\\\n\\\"\\n result *= sum\\n\\nproc main =\\n echo \\\"integral: \\\", integ(exp, 5, -3, 3)\\n\\nmain()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let rec leg n x = match n with (* Evaluate Legendre polynomial *)\\n | 0 -> 1.0\\n | 1 -> x\\n | k -> let u = 1.0 -. 1.0 /. float k in\\n (1.0+.u)*.x*.(leg (k-1) x) -. u*.(leg (k-2) x);;\\n\\nlet leg' n x = match n with (* derivative *)\\n | 0 -> 0.0\\n | 1 -> 1.0\\n | _ -> ((leg (n-1) x) -. x*.(leg n x)) *. (float n)/.(1.0-.x*.x);;\\n\\nlet approx_root k n = (* Reversed Francesco Tricomi: 1 <= k <= n *)\\n let pi = acos (-1.0) and s = float(2*n)\\n and t = 1.0 +. float(1-4*k)/.float(4*n+2) in\\n (1.0 -. (float (n-1))/.(s*.s*.s))*.cos(pi*.t);;\\n\\nlet rec refine r n = (* Newton-Raphson *)\\n let r1 = r -. (leg n r)/.(leg' n r) in\\n if abs_float (r-.r1) < 2e-16 then r1 else refine r1 n;;\\n\\nlet root k n = refine (approx_root k n) n;;\\n\\nlet node k n = (* Abscissa and weight *)\\n let r = root k n in\\n let deriv = leg' n r in\\n let w = 2.0/.((1.0-.r*.r)*.(deriv*.deriv)) in\\n (r,w);;\\n\\nlet nodes n =\\n let rec aux k = if k > n then [] else node k n :: aux (k+1)\\n in aux 1;;\\n\\nlet quadrature n f a b =\\n let f1 x = f ((x*.(b-.a) +. a +. b)*.0.5) in\\n let eval s (x,w) = s +. w*.(f1 x) in\\n 0.5*.(b-.a)*.(List.fold_left eval 0.0 (nodes n));;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let calc n =\\n Printf.printf\\n \\\"Gauss-Legendre %2d-point quadrature for exp over [-3..3] = %.16f\\\\n\\\"\\n n (quadrature n exp (-3.0) 3.0);;\\n\\ncalc 5;;\\ncalc 10;;\\ncalc 15;;\\ncalc 20;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"Printf.printf \\\"%.16f\\\\n\\\" ((exp 3.0) -.(exp (-3.0)));;\\n20.0357498548198052\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"/*---------------------------------------------------------------------\\n* 31.10.2013 Walter Pachl Translation from REXX (from PL/I)\\n* using ooRexx' rxmath package\\n* which limits the precision to 16 digits\\n*--------------------------------------------------------------------*/\\nprec=60\\nNumeric Digits prec\\nepsilon=1/10**prec\\npi=3.141592653589793238462643383279502884197169399375105820974944592307\\nexact = RxCalcExp(3,prec)-RxCalcExp(-3,prec)\\nDo n = 1 To 20\\n a = -3; b = 3\\n r.=0\\n call gaussquad\\n sum=0\\n Do j=1 To n\\n sum=sum + r.2.j * RxCalcExp((a+b)/2+r.1.j*(b-a)/2,prec)\\n End\\n z = (b-a)/2 * sum\\n Say right(n,2) format(z,2,40) format(z-exact,2,4,,0)\\n End\\n Say ' ' exact '(exact)'\\n Exit\\n\\n gaussquad:\\n p0.0=1; p0.1=1\\n p1.0=2; p1.1=1; p1.2=0\\n Do k = 2 To n\\n tmp.0=p1.0+1\\n Do L = 1 To p1.0\\n tmp.l = p1.l\\n End\\n tmp.l=0\\n tmp2.0=p0.0+2\\n tmp2.1=0\\n tmp2.2=0\\n Do L = 1 To p0.0\\n l2=l+2\\n tmp2.l2=p0.l\\n End\\n Do j=1 To tmp.0\\n tmp.j = ((2*k-1)*tmp.j - (k-1)*tmp2.j)/k\\n End\\n p0.0=p1.0\\n Do j=1 To p0.0\\n p0.j = p1.j\\n End\\n p1.0=tmp.0\\n Do j=1 To p1.0\\n p1.j=tmp.j\\n End\\n End\\n Do i = 1 To n\\n x = RxCalcCos(pi*(i-0.25)/(n+0.5),prec,'R')\\n Do iter = 1 To 10\\n f = p1.1; df = 0\\n Do k = 2 To p1.0\\n df = f + x*df\\n f = p1.k + x * f\\n End\\n dx = f / df\\n x = x - dx\\n If abs(dx) < epsilon Then Leave\\n End\\n r.1.i = x\\n r.2.i = 2/((1-x**2)*df**2)\\n End\\n Return\\n\\n::requires 'rxmath' LIBRARY\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"GLq(f,a,b,n)={\\n my(P=pollegendre(n),Pp=P',x=polroots(P));\\n (b-a)*sum(i=1,n,f((b-a)*x[i]/2+(a+b)/2)/(1-x[i]^2)/subst(Pp,'x,x[i])^2)\\n};\\n# \\\\\\\\ Turn on timer\\nGLq(x->exp(x), -3, 3, 5) \\\\\\\\ As of version 2.4.4, this can be written GLq(exp, -3, 3, 5)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"intnumgauss(x=-3, 3, exp(x), intnumgaussinit(5))\\nintnumgauss(x=-3, 3, exp(x)) \\\\\\\\ determine number of points automatically; all digits shown should be accurate\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program Legendre(output);\\n\\nconst Order = 5;\\n Order1 = Order - 1;\\n Epsilon = 1E-12;\\n Pi = 3.1415926;\\n\\nvar Roots : array[0..Order1] of real;\\n Weight : array[0..Order1] of real;\\n LegCoef : array [0..Order,0..Order] of real;\\n I : integer;\\n\\n\\nfunction F(X:real) : real;\\nbegin\\n F := Exp(X);\\nend;\\n\\nprocedure PrepCoef;\\nvar I, N : integer;\\nbegin\\n for I:=0 to Order do\\n for N := 0 to Order do\\n LegCoef[I,N] := 0;\\n LegCoef[0,0] := 1;\\n LegCoef[1,1] := 1;\\n For N:=2 to Order do\\n begin\\n LegCoef[N,0] := -(N-1) * LegCoef[N-2,0] / N;\\n For I := 1 to Order do\\n LegCoef[N,I] := ((2*N-1) * LegCoef[N-1,I-1] - (N-1)*LegCoef[N-2,I]) / N;\\n end;\\nend;\\n\\nfunction LegEval(N:integer; X:real) : real;\\nvar I : integer;\\n Result : real;\\nbegin\\n Result := LegCoef[n][n];\\n for I := N-1 downto 0 do\\n Result := Result * X + LegCoef[N][I];\\n LegEval := Result;\\nend;\\n\\nfunction LegDiff(N:integer; X:real) : real;\\nbegin\\n LegDiff := N * (X * LegEval(N,X) - LegEval(N-1,X)) / (X*X-1);\\nend;\\n\\nprocedure LegRoots;\\nvar I : integer;\\n X, X1 : real;\\nbegin\\n for I := 1 to Order do\\n begin\\n X := Cos(Pi * (I-0.25) / (Order+0.5));\\n repeat\\n X1 := X;\\n X := X - LegEval(Order,X) / LegDiff(Order, X);\\n until Abs (X-X1) < Epsilon;\\n Roots[I-1] := X;\\n X1 := LegDiff(Order,X);\\n Weight[I-1] := 2 / ((1-X*X) * X1*X1);\\n end;\\nend;\\n\\nfunction LegInt(A,B:real) : real;\\nvar I : integer;\\n C1, C2, Result : real;\\nbegin\\n C1 := (B-A)/2;\\n C2 := (B+A)/2;\\n Result := 0;\\n For I := 0 to Order-1 do\\n Result := Result + Weight[I] * F(C1*Roots[I] + C2);\\n Result := C1 * Result;\\n LegInt := Result;\\nend;\\n\\nbegin\\n PrepCoef;\\n LegRoots;\\n\\n Write('Roots: ');\\n for I := 0 to Order-1 do\\n Write (' ',Roots[I]:13:10);\\n Writeln;\\n\\n Write('Weight: ');\\n for I := 0 to Order-1 do\\n Write (' ', Weight[I]:13:10);\\n writeln;\\n\\n Writeln('Integrating Exp(x) over [-3, 3]: ',LegInt(-3,3):13:10);\\n Writeln('Actual value: ',Exp(3)-Exp(-3):13:10);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use List::Util qw(sum);\\nuse constant pi => 3.14159265;\\n\\nsub legendre_pair {\\n my($n, $x) = @_;\\n if ($n == 1) { return $x, 1 }\\n my ($m1, $m2) = legendre_pair($n - 1, $x);\\n my $u = 1 - 1 / $n;\\n (1 + $u) * $x * $m1 - $u * $m2, $m1;\\n}\\n\\nsub legendre {\\n my($n, $x) = @_;\\n (legendre_pair($n, $x))[0]\\n}\\n\\nsub legendre_prime {\\n my($n, $x) = @_;\\n if ($n == 0) { return 0 }\\n if ($n == 1) { return 1 }\\n my ($m0, $m1) = legendre_pair($n, $x);\\n ($m1 - $x * $m0) * $n / (1 - $x**2);\\n}\\n\\nsub approximate_legendre_root {\\n my($n, $k) = @_;\\n my $t = (4*$k - 1) / (4*$n + 2);\\n (1 - ($n - 1) / (8 * $n**3)) * cos(pi * $t);\\n}\\n\\nsub newton_raphson {\\n my($n, $r) = @_;\\n while (abs(my $dr = - legendre($n,$r) / legendre_prime($n,$r)) >= 2e-16) {\\n $r += $dr;\\n }\\n $r;\\n}\\n\\nsub legendre_root {\\n my($n, $k) = @_;\\n newton_raphson($n, approximate_legendre_root($n, $k));\\n}\\n\\nsub weight {\\n my($n, $r) = @_;\\n 2 / ((1 - $r**2) * legendre_prime($n, $r)**2)\\n}\\n\\nsub nodes {\\n my($n) = @_;\\n my %node;\\n $node{'0'} = weight($n, 0) if 0 != $n%2;\\n for (1 .. int $n/2) {\\n my $r = legendre_root($n, $_);\\n my $w = weight($n, $r);\\n $node{$r} = $w; $node{-$r} = $w;\\n }\\n return %node\\n}\\n\\nsub quadrature {\\n our($n, $a, $b) = @_;\\n sub scale { ($_[0] * ($b - $a) + $a + $b) / 2 }\\n %nodes = nodes($n);\\n ($b - $a) / 2 * sum map { $nodes{$_} * exp(scale($_)) } keys %nodes;\\n}\\n\\nprintf(\\\"Gauss-Legendre %2d-point quadrature ∫₋₃⁺³ exp(x) dx ≈ %.13f\\\\n\\\", $_, quadrature($_, -3, +3) )\\n for 5 .. 10, 20;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">legendreRoots</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">legendreWeights</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">z</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">((</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)-(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">))/</span><span style=\\\"color: #000000;\\\">term</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">legendreDerivative</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">term</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">term</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">)))/(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">getLegendreRoots</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">legendreRoots</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">index</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cos</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">PI</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">index</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.25</span><span style=\\\"color: #0000FF;\\\">)/(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">y1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">y</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">legendre</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">legendreDerivative</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">y1</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">2e-16</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">legendreRoots</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">y</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">getLegendreWeights</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">legendreWeights</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">index</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">lri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">legendreRoots</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">index</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">diff</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">legendreDerivative</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lri</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">weight</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #0000FF;\\\">((</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">))*</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">diff</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">legendreWeights</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">weight</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">gaussLegendreQuadrature</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lowerLimit</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">upperLimit</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n\\n <span style=\\\"color: #000000;\\\">getLegendreRoots</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">getLegendreWeights</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">upperLimit</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">lowerLimit</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">upperLimit</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">lowerLimit</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">/</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">legendreWeights</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">legendreRoots</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">c2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">c1</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">machine_bits</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"%.13f\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"%.14f\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">11</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">gaussLegendreQuadrature</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">exp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"roots:\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">legendreRoots</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"weights:\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">legendreWeights</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Gauss-Legendre %2d-point quadrature for exp over [-3..3] = %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #7060A8;\\\">exp</span><span style=\\\"color: #0000FF;\\\">(-</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" compared to actual = %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(subscriptrange, size, fofl):\\nIntegration_Gauss: procedure options (main);\\n\\n declare (n, k) fixed binary;\\n declare r(*,*) float (18) controlled;\\n declare (z, a, b, exact) float (18);\\n\\n do n = 1 to 20;\\n a = -3; b = 3;\\n if allocation(r) > 0 then free r;\\n allocate r(2, n); r = 0;\\n call gaussquad(n, r);\\n z = (b-a)/2 * sum(r(2,*) * exp((a+b)/2+r(1,*)*(b-a)/2));\\n exact = exp(3.0q0)-exp(-3.0q0);\\n put skip edit (n, z, z-exact) (f(5), f(25,16), e(15,2));\\n end;\\n\\ngaussquad: procedure(n, r);\\n/*declare n fixed binary, r(2, n) float (18);*/\\n declare n fixed binary, r(2, *) float (18);/* corrected */\\n declare pi float (18) value (4*atan(1.0q0));\\n declare (x, f, df, dx) float (18);\\n declare (i, iter, L) fixed binary;\\n declare (p0(*), p1(*), tmp(*), tmp2(*)) float (18) controlled;\\n\\n allocate p0(1) initial (1);\\n allocate p1(2) initial (1, 0);\\n\\n do k = 2 to n;\\n allocate tmp(hbound(p1)+1); do L = 1 to hbound(p1); tmp(L) = p1(L); end; tmp(L) = 0;\\n allocate tmp2(hbound(p0)+2); tmp2(1), tmp2(2) = 0;\\n do L = 1 to hbound(p0); tmp2(L+2) = p0(L); end;\\n tmp = ((2*k-1)*tmp - (k-1)*tmp2)/k;\\n free p0; allocate p0(hbound(p1)); p0 = p1;\\n free p1; allocate p1(hbound(tmp)); p1 = tmp;\\n free tmp, tmp2;\\n end;\\n do i = 1 to n;\\n x = cos(pi*(i-0.25q0)/(n+0.5q0));\\n do iter = 1 to 10;\\n f = p1(1); df = 0;\\n do k = 2 to hbound(p1);\\n df = f + x*df;\\n f = p1(k) + x * f;\\n end;\\n dx = f / df;\\n x = x - dx;\\n if abs(dx) < 10*epsilon(dx) then leave;\\n end;\\n r(1,i) = x;\\n r(2,i) = 2/((1-x**2)*df**2);\\n end;\\n end gaussquad;\\nend Integration_Gauss;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"from numpy import *\\n\\n##################################################################\\n# Recursive generation of the Legendre polynomial of order n\\ndef Legendre(n,x):\\n\\tx=array(x)\\n\\tif (n==0):\\n\\t\\treturn x*0+1.0\\n\\telif (n==1):\\n\\t\\treturn x\\n\\telse:\\n\\t\\treturn ((2.0*n-1.0)*x*Legendre(n-1,x)-(n-1)*Legendre(n-2,x))/n\\n\\n##################################################################\\n# Derivative of the Legendre polynomials\\ndef DLegendre(n,x):\\n\\tx=array(x)\\n\\tif (n==0):\\n\\t\\treturn x*0\\n\\telif (n==1):\\n\\t\\treturn x*0+1.0\\n\\telse:\\n\\t\\treturn (n/(x**2-1.0))*(x*Legendre(n,x)-Legendre(n-1,x))\\n##################################################################\\n# Roots of the polynomial obtained using Newton-Raphson method\\ndef LegendreRoots(polyorder,tolerance=1e-20):\\n\\tif polyorder<2:\\n\\t\\terr=1 # bad polyorder no roots can be found\\n\\telse:\\n\\t\\troots=[]\\n\\t\\t# The polynomials are alternately even and odd functions. So we evaluate only half the number of roots.\\n\\t\\tfor i in range(1,int(polyorder)/2 +1):\\n\\t\\t\\tx=cos(pi*(i-0.25)/(polyorder+0.5))\\n\\t\\t\\terror=10*tolerance\\n\\t\\t iters=0\\n\\t\\t while (error>tolerance) and (iters<1000):\\n\\t\\t dx=-Legendre(polyorder,x)/DLegendre(polyorder,x)\\n\\t\\t x=x+dx\\n\\t\\t iters=iters+1\\n\\t\\t error=abs(dx)\\n\\t\\t\\troots.append(x)\\n\\t\\t# Use symmetry to get the other roots\\n\\t\\troots=array(roots)\\n\\t\\tif polyorder%2==0:\\n\\t\\t\\troots=concatenate( (-1.0*roots, roots[::-1]) )\\n\\t\\telse:\\n\\t\\t\\troots=concatenate( (-1.0*roots, [0.0], roots[::-1]) )\\n\\t\\terr=0 # successfully determined roots\\n\\treturn [roots, err]\\n##################################################################\\n# Weight coefficients\\ndef GaussLegendreWeights(polyorder):\\n\\tW=[]\\n\\t[xis,err]=LegendreRoots(polyorder)\\n\\tif err==0:\\n\\t\\tW=2.0/( (1.0-xis**2)*(DLegendre(polyorder,xis)**2) )\\n\\t\\terr=0\\n\\telse:\\n\\t\\terr=1 # could not determine roots - so no weights\\n\\treturn [W, xis, err]\\n##################################################################\\n# The integral value\\n# func \\t\\t: the integrand\\n# a, b \\t\\t: lower and upper limits of the integral\\n# polyorder \\t: order of the Legendre polynomial to be used\\n#\\ndef GaussLegendreQuadrature(func, polyorder, a, b):\\n\\t[Ws,xs, err]= GaussLegendreWeights(polyorder)\\n\\tif err==0:\\n\\t\\tans=(b-a)*0.5*sum( Ws*func( (b-a)*0.5*xs+ (b+a)*0.5 ) )\\n\\telse:\\n\\t\\t# (in case of error)\\n\\t\\terr=1\\n\\t\\tans=None\\n\\treturn [ans,err]\\n##################################################################\\n# The integrand - change as required\\ndef func(x):\\n\\treturn exp(x)\\n##################################################################\\n#\\n\\norder=5\\n[Ws,xs,err]=GaussLegendreWeights(order)\\nif err==0:\\n\\tprint \\\"Order : \\\", order\\n\\tprint \\\"Roots : \\\", xs\\n\\tprint \\\"Weights : \\\", Ws\\nelse:\\n\\tprint \\\"Roots/Weights evaluation failed\\\"\\n\\n# Integrating the function\\n[ans,err]=GaussLegendreQuadrature(func , order, -3,3)\\nif err==0:\\n\\tprint \\\"Integral : \\\", ans\\nelse:\\n\\tprint \\\"Integral evaluation failed\\\"\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import numpy as np\\n\\n# func is a function that takes a list-like input values\\ndef gauss_legendre_integrate(func, domain, deg):\\n x, w = np.polynomial.legendre.leggauss(deg)\\n s = (domain[1] - domain[0])/2\\n a = (domain[1] + domain[0])/2\\n return np.sum(s*w*func(s*x + a))\\n\\nfor d in range(3, 10):\\n print(d, gauss_legendre_integrate(np.exp, [-3, 3], d))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(define (LegendreP n x)\\n (let compute ([n n] [Pn-1 x] [Pn-2 1])\\n (case n\\n [(0) Pn-2]\\n [(1) Pn-1]\\n [else (compute (- n 1)\\n (/ (- (* (- (* 2 n) 1) x Pn-1)\\n (* (- n 1) Pn-2)) n)\\n Pn-1)])))\\n\\n(define (LegendreP′ n x)\\n (* (/ n (- (* x x) 1))\\n (- (* x (LegendreP n x))\\n (LegendreP (- n 1) x))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (LegendreP-root n i)\\n ; newton-raphson step\\n (define (newton-step x)\\n (- x (/ (LegendreP n x) (LegendreP′ n x))))\\n ; initial guess\\n (define x0 (cos (* pi (/ (- i 1/4) (+ n 1/2)))))\\n ; computation of a root with relative accuracy 1e-15\\n (if (< (abs x0) 1e-15)\\n 0\\n (let next ([x′ (newton-step x0)] [x x0])\\n (if (< (abs (/ (- x′ x) (+ x′ x))) 1e-15)\\n x′\\n (next (newton-step x′) x′)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (Gauss-Legendre-quadrature n)\\n ;; positive roots\\n (define roots\\n (for/list ([i (in-range (floor (/ n 2)))])\\n (LegendreP-root n (+ i 1))))\\n ;; weights for positive roots\\n (define weights\\n (for/list ([x (in-list roots)])\\n (/ 2 (- 1 (sqr x)) (sqr (LegendreP′ n x)))))\\n ;; all roots and weights\\n (values (append (map - roots)\\n (if (odd? n) (list 0) '())\\n (reverse roots))\\n (append weights\\n (if (odd? n) (list (/ 2 (sqr (LegendreP′ n 0)))) '())\\n (reverse weights))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (integrate f a b #:nodes (n 5))\\n (define m (/ (+ a b) 2))\\n (define d (/ (- b a) 2))\\n (define-values [x w] (Gauss-Legendre-quadrature n))\\n (define (g x) (f (+ m (* d x))))\\n (* d (+ (apply + (map * w (map g x))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"> (Gauss-Legendre-quadrature 5)\\n'(-0.906179845938664 -0.5384693101056831 0 0.5384693101056831 0.906179845938664)\\n'(0.23692688505618875 0.47862867049936625 128/225 0.47862867049936625 0.23692688505618875)\\n\\n> (integrate exp -3 3)\\n20.035577718385547\\n\\n> (- (exp 3) (exp -3)\\n20.035749854819805\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"> (require plot)\\n> (parameterize ([plot-x-label \\\"Number of Gaussian nodes\\\"]\\n [plot-y-label \\\"Integration error\\\"]\\n [plot-y-transform log-transform]\\n [plot-y-ticks (log-ticks #:base 10)])\\n (plot (points (for/list ([n (in-range 2 11)])\\n (list n (abs (- (integrate exp -3 3 #:nodes n)\\n (- (exp 3) (exp -3)))))))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"multi legendre-pair( 1 , $x) { $x, 1 }\\nmulti legendre-pair(Int $n, $x) {\\n my ($m1, $m2) = legendre-pair($n - 1, $x);\\n my \\\\u = 1 - 1 / $n;\\n (1 + u) * $x * $m1 - u * $m2, $m1;\\n}\\n\\nmulti legendre( 0 , $ ) { 1 }\\nmulti legendre(Int $n, $x) { legendre-pair($n, $x)[0] }\\n\\nmulti legendre-prime( 0 , $ ) { 0 }\\nmulti legendre-prime( 1 , $ ) { 1 }\\nmulti legendre-prime(Int $n, $x) {\\n my ($m0, $m1) = legendre-pair($n, $x);\\n ($m1 - $x * $m0) * $n / (1 - $x**2);\\n}\\n\\nsub approximate-legendre-root(Int $n, Int $k) {\\n # Approximation due to Francesco Tricomi\\n my \\\\t = (4*$k - 1) / (4*$n + 2);\\n (1 - ($n - 1) / (8 * $n**3)) * cos(pi * t);\\n}\\n\\nsub newton-raphson(&f, &f-prime, $r is copy, :$eps = 2e-16) {\\n while abs(my \\\\dr = - f($r) / f-prime($r)) >= $eps {\\n $r += dr;\\n }\\n $r;\\n}\\n\\nsub legendre-root(Int $n, Int $k) {\\n newton-raphson(&legendre.assuming($n), &legendre-prime.assuming($n),\\n approximate-legendre-root($n, $k));\\n}\\n\\nsub weight(Int $n, $r) { 2 / ((1 - $r**2) * legendre-prime($n, $r)**2) }\\n\\nsub nodes(Int $n) {\\n flat gather {\\n take 0 => weight($n, 0) if $n !%% 2;\\n for 1 .. $n div 2 {\\n my $r = legendre-root($n, $_);\\n my $w = weight($n, $r);\\n take $r => $w, -$r => $w;\\n }\\n }\\n}\\n\\nsub quadrature(Int $n, &f, $a, $b, :@nodes = nodes($n)) {\\n sub scale($x) { ($x * ($b - $a) + $a + $b) / 2 }\\n ($b - $a) / 2 * [+] @nodes.map: { .value * f(scale(.key)) }\\n}\\n\\nsay \\\"Gauss-Legendre $_.fmt('%2d')-point quadrature ∫₋₃⁺³ exp(x) dx ≈ \\\",\\n quadrature($_, &exp, -3, +3) for flat 5 .. 10, 20;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*---------------------------------------------------------------------\\n* 31.10.2013 Walter Pachl Translation from PL/I\\n* 01.11.2014 -\\\"- see Version 2 for improvements\\n*--------------------------------------------------------------------*/\\nCall time 'R'\\nprec=60\\nNumeric Digits prec\\nepsilon=1/10**prec\\npi=3.141592653589793238462643383279502884197169399375105820974944592307\\nexact = exp(3,prec)-exp(-3,prec)\\nDo n = 1 To 20\\n a = -3; b = 3\\n r.=0\\n call gaussquad\\n sum=0\\n Do j=1 To n\\n sum=sum + r.2.j * exp((a+b)/2+r.1.j*(b-a)/2,prec)\\n End\\n z = (b-a)/2 * sum\\n Say right(n,2) format(z,2,40) format(z-exact,2,4,,0)\\n End\\n Say ' ' exact '(exact)'\\n say '... and took' format(time('E'),,2) \\\"seconds\\\"\\n Exit\\n\\n gaussquad:\\n p0.0=1; p0.1=1\\n p1.0=2; p1.1=1; p1.2=0\\n Do k = 2 To n\\n tmp.0=p1.0+1\\n Do L = 1 To p1.0\\n tmp.l = p1.l\\n End\\n tmp.l=0\\n tmp2.0=p0.0+2\\n tmp2.1=0\\n tmp2.2=0\\n Do L = 1 To p0.0\\n l2=l+2\\n tmp2.l2=p0.l\\n End\\n Do j=1 To tmp.0\\n tmp.j = ((2*k-1)*tmp.j - (k-1)*tmp2.j)/k\\n End\\n p0.0=p1.0\\n Do j=1 To p0.0\\n p0.j = p1.j\\n End\\n p1.0=tmp.0\\n Do j=1 To p1.0\\n p1.j=tmp.j\\n End\\n End\\n Do i = 1 To n\\n x = cos(pi*(i-0.25)/(n+0.5),prec)\\n Do iter = 1 To 10\\n f = p1.1; df = 0\\n Do k = 2 To p1.0\\n df = f + x*df\\n f = p1.k + x * f\\n End\\n dx = f / df\\n x = x - dx\\n If abs(dx) < epsilon then leave\\n End\\n r.1.i = x\\n r.2.i = 2/((1-x**2)*df**2)\\n End\\n Return\\n\\ncos: Procedure\\n/* REXX ****************************************************************\\n* Return cos(x) -- with specified precision\\n* cos(x) = 1-(x**2/2!)+(x**4/4!)-(x**6/6!)+-...\\n* 920903 Walter Pachl\\n***********************************************************************/\\n Parse Arg x,prec\\n If prec='' Then prec=9\\n Numeric Digits (2*prec)\\n Numeric Fuzz 3\\n o=1\\n u=1\\n r=1\\n Do i=1 By 2\\n ra=r\\n o=-o*x*x\\n u=u*i*(i+1)\\n r=r+(o/u)\\n If r=ra Then Leave\\n End\\n Numeric Digits prec\\n Return r+0\\n\\nexp: Procedure\\n/***********************************************************************\\n* Return exp(x) -- with reasonable precision\\n* 920903 Walter Pachl\\n***********************************************************************/\\n Parse Arg x,prec\\n If prec<9 Then prec=9\\n Numeric Digits (2*prec)\\n Numeric Fuzz 3\\n o=1\\n u=1\\n r=1\\n Do i=1 By 1\\n ra=r\\n o=o*x\\n u=u*i\\n r=r+(o/u)\\n If r=ra Then Leave\\n End\\n Numeric Digits (prec)\\n Return r+0\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program does numerical integration using an N─point Gauss─Legendre quadrature rule. */\\npi= pi(); digs= length(pi) - length(.); numeric digits digs; reps= digs % 2\\n\\n!.= .; b= 3; a= -b; bma= b - a; bmaH= bma / 2; tiny= '1e-'digs\\ntrueV= exp(b)-exp(a); bpa= b + a; bpaH= bpa / 2\\nhdr= 'iterate value (with ' digs \\\" decimal digits being used)\\\"\\nsay ' step ' center(hdr, digs+3) ' difference' /*show hdr*/\\nsep='──────' copies(\\\"─\\\", digs+3) '─────────────'; say sep /* \\\" sep*/\\n\\n do #=1 until dif>0; p0z= 1; p0.1= 1; p1z= 2; p1.1= 1; p1.2= 0; ##= # + .5; r.= 0\\n /*█*/ do k=2 to #; km= k - 1\\n /*█*/ do y=1 for p1z; T.y= p1.y; end /*y*/\\n /*█*/ T.y= 0; TT.= 0; do L=1 for p0z; _= L + 2; TT._= p0.L; end /*L*/\\n /*█*/ kkm= k + km; do j=1 for p1z +1; T.j= (kkm*T.j - km*TT.j)/k; end /*j*/\\n /*█*/ p0z= p1z; do n=1 for p0z; p0.n= p1.n ; end /*n*/\\n /*█*/ p1z= p1z + 1; do p=1 for p1z; p1.p= T.p ; end /*p*/\\n /*█*/ end /*k*/\\n /*▓*/ do !=1 for #; x= cos( pi * (! - .25) / ## )\\n /*▓*/ /*░*/ do reps until abs(dx) <= tiny\\n /*▓*/ /*░*/ f= p1.1; df= 0; do u=2 to p1z; df= f + x*df\\n /*▓*/ /*░*/ f= p1.u +x*f\\n /*▓*/ /*░*/ end /*u*/\\n /*▓*/ /*░*/ dx= f / df; x= x - dx\\n /*▓*/ /*░*/ end /*reps ···*/\\n /*▓*/ r.1.!= x\\n /*▓*/ r.2.!= 2 / ( (1 - x*x) * df*df)\\n /*▓*/ end /*!*/\\n $= 0\\n /*▒*/ do m=1 for #; $=$ + r.2.m * exp(bpaH + r.1.m*bmaH); end /*m*/\\n z= bmaH * $ /*calculate target value (Z)*/\\n dif= z - trueV; z= format(z, 3, digs - 2) /* \\\" difference. */\\n Ndif= translate( format(dif, 3, 4, 2, 0), 'e', \\\"E\\\")\\n if #\\\\==1 then say center(#, 6) z' ' Ndif /*no display if not computed*/\\n end /*#*/\\n\\nsay sep; xdif= compare( strip(z), trueV); say right(\\\"↑\\\", 6 + 1 + xdif)\\nsay left('', 6 + 1) trueV \\\" {exact value}\\\"; say\\nsay 'Using ' digs \\\" digit precision, the\\\" ,\\n 'N-point Gauss─Legendre quadrature (GLQ) had an accuracy of ' xdif-2 \\\" digits.\\\"\\nexit 0 /*stick a fork in it, we're all done. */\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\ne: return 2.718281828459045235360287471352662497757247093699959574966967627724076630353547595\\npi: return 3.141592653589793238462643383279502884197169399375105820974944592307816406286286209\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\ncos: procedure expose !.; parse arg x; if !.x\\\\==. then return !.x; _= 1; z=1; y= x*x\\n do k=2 by 2 until p==z; p=z; _= -_*y/(k*(k-1)); z=z+_; end; !.x=z; return z\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\nexp: procedure; parse arg x; ix= x % 1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix; z= 1\\n _=1; do j=1 until p==z; p=z; _= _*x/j; z= z+_; end; return z * e()**ix\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program does numerical integration using an N─point Gauss─Legendre quadrature rule. */\\npi= pi(); digs= length(pi) - length(.); numeric digits digs; reps= digs % 2\\n!.= .; b= 3; a= -b; bma= b - a; bmaH= bma / 2; tiny= '1e-'digs\\ntrueV= exp(b)-exp(a); bpa= b + a; bpaH= bpa / 2\\nhdr= 'iterate value (with ' digs \\\" decimal digits being used)\\\"\\nsay ' step ' center(hdr, digs+3) ' difference' /*show hdr*/\\nsep='──────' copies(\\\"─\\\", digs+3) '─────────────'; say sep /* \\\" sep*/\\n\\n do #=1 until dif>0; p0z= 1; p0.1= 1; p1z= 2; p1.1= 1; p1.2= 0; ##= # + .5; r.= 0\\n /*█*/ do k=2 to #; km= k - 1\\n /*█*/ do y=1 for p1z; T.y= p1.y; end /*y*/\\n /*█*/ T.y= 0; TT.= 0; do L=1 for p0z; _= L + 2; TT._= p0.L; end /*L*/\\n /*█*/ kkm= k + km; do j=1 for p1z +1; T.j= (kkm*T.j - km*TT.j)/k; end /*j*/\\n /*█*/ p0z= p1z; do n=1 for p0z; p0.n= p1.n ; end /*n*/\\n /*█*/ p1z= p1z + 1; do p=1 for p1z; p1.p= T.p ; end /*p*/\\n /*█*/ end /*k*/\\n /*▓*/ do !=1 for #; x= cos( pi * (! - .25) / ## )\\n /*▓*/ /*░*/ do reps until abs(dx) <= tiny\\n /*▓*/ /*░*/ f= p1.1; df= 0; do u=2 to p1z; df= f + x*df\\n /*▓*/ /*░*/ f= p1.u +x*f\\n /*▓*/ /*░*/ end /*u*/\\n /*▓*/ /*░*/ dx= f / df; x= x - dx\\n /*▓*/ /*░*/ end /*reps ···*/\\n /*▓*/ r.1.!= x\\n /*▓*/ r.2.!= 2 / ( (1 - x*x) * df*df)\\n /*▓*/ end /*!*/\\n $= 0\\n /*▒*/ do m=1 for #; $=$ + r.2.m * exp(bpaH + r.1.m*bmaH); end /*m*/\\n z= bmaH * $ /*calculate target value (Z)*/\\n dif= z - trueV; z= format(z, 3, digs - 2) /* \\\" difference. */\\n Ndif= translate( format(dif, 3, 4, 3, 0), 'e', \\\"E\\\")\\n if #\\\\==1 then say center(#, 6) z' ' Ndif /*no display if not computed*/\\n end /*#*/\\n\\nsay sep; xdif= compare( strip(z), trueV); say right(\\\"↑\\\", 6 + 1 + xdif)\\nsay left('', 6 + 1) trueV \\\" {exact value}\\\"; say\\nsay 'Using ' digs \\\" digit precision, the\\\" ,\\n 'N-point Gauss─Legendre quadrature (GLQ) had an accuracy of ' xdif-2 \\\" digits.\\\"\\nexit 0 /*stick a fork in it, we're all done. */\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\ne: return 2.71828182845904523536028747135266249775724709369995957496696762772407663035354759,\\n ||457138217852516642742746639193200305992181741359662904357290033429526059563073813232862794\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\npi: return 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899,\\n ||862803482534211706798214808651328230664709384460955058223172535940812848111745028410270194\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\ncos: procedure expose !.; parse arg x; if !.x\\\\==. then return !.x; _= 1; z=1; y= x*x\\n do k=2 by 2 until p==z; p=z; _= -_*y/(k*(k-1)); z=z+_; end; !.x=z; return z\\n/*───────────────────────────────────────────────────────────────────────────────────────────*/\\nexp: procedure; parse arg x; ix= x % 1; if abs(x-ix)>.5 then ix= ix + sign(x); x= x-ix; z= 1\\n _=1; do j=1 until p==z; p=z; _= _*x/j; z= z+_; end; return z * e()**ix\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"import scala.math.{Pi, cos, exp}\\n\\nobject GaussLegendreQuadrature extends App {\\n private val N = 5\\n\\n private def legeInte(a: Double, b: Double): Double = {\\n val (c1, c2) = ((b - a) / 2, (b + a) / 2)\\n val tuples: IndexedSeq[(Double, Double)] = {\\n val lcoef = {\\n val lcoef = Array.ofDim[Double](N + 1, N + 1)\\n\\n lcoef(0)(0) = 1\\n lcoef(1)(1) = 1\\n for (i <- 2 to N) {\\n lcoef(i)(0) = -(i - 1) * lcoef(i - 2)(0) / i\\n for (j <- 1 to i) lcoef(i)(j) =\\n ((2 * i - 1) * lcoef(i - 1)(j - 1) - (i - 1) * lcoef(i - 2)(j)) / i\\n }\\n lcoef\\n }\\n\\n def legeEval(n: Int, x: Double): Double =\\n lcoef(n).take(n).foldRight(lcoef(n)(n))((o, s) => s * x + o)\\n\\n def legeDiff(n: Int, x: Double): Double =\\n n * (x * legeEval(n, x) - legeEval(n - 1, x)) / (x * x - 1)\\n\\n @scala.annotation.tailrec\\n def convergention(x0: Double, x1: Double): Double = {\\n if (x0 == x1) x1\\n else convergention(x1, x1 - legeEval(N, x1) / legeDiff(N, x1))\\n }\\n\\n for {i <- 0 until 5\\n x = convergention(0.0, cos(Pi * (i + 1 - 0.25) / (N + 0.5)))\\n x1 = legeDiff(N, x)\\n } yield (x, 2 / ((1 - x * x) * x1 * x1))\\n }\\n\\n println(s\\\"Roots: ${tuples.map(el => f\\\" ${el._1}%10.6f\\\").mkString}\\\")\\n println(s\\\"Weight:${tuples.map(el => f\\\" ${el._2}%10.6f\\\").mkString}\\\")\\n\\n c1 * tuples.map { case (lroot, weight) => weight * exp(c1 * lroot + c2) }.sum\\n }\\n\\n println(f\\\"Integrating exp(x) over [-3, 3]:\\\\n\\\\t${legeInte(-3, 3)}%10.8f,\\\")\\n println(f\\\"compared to actual%n\\\\t${exp(3) - exp(-3)}%10.8f\\\")\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func legendre_pair((1), x) { (x, 1) }\\nfunc legendre_pair( n, x) {\\n var (m1, m2) = legendre_pair(n - 1, x)\\n var u = (1 - 1/n)\\n ((1 + u)*x*m1 - u*m2, m1)\\n}\\n\\nfunc legendre((0), _) { 1 }\\nfunc legendre( n, x) { [legendre_pair(n, x)][0] }\\n\\nfunc legendre_prime({ .is_zero }, _) { 0 }\\nfunc legendre_prime({ .is_one }, _) { 1 }\\n\\nfunc legendre_prime(n, x) {\\n var (m0, m1) = legendre_pair(n, x)\\n (m1 - x*m0) * n / (1 - x**2)\\n}\\n\\nfunc approximate_legendre_root(n, k) {\\n # Approximation due to Francesco Tricomi\\n var t = ((4*k - 1) / (4*n + 2))\\n (1 - ((n - 1)/(8 * n**3))) * cos(Num.pi * t)\\n}\\n\\nfunc newton_raphson(f, f_prime, r, eps = 2e-16) {\\n loop {\\n var dr = (-f(r) / f_prime(r))\\n dr.abs >= eps || break\\n r += dr\\n }\\n return r\\n}\\n\\nfunc legendre_root(n, k) {\\n newton_raphson(legendre.method(:call, n), legendre_prime.method(:call, n),\\n approximate_legendre_root(n, k))\\n}\\n\\nfunc weight(n, r) { 2 / ((1 - r**2) * legendre_prime(n, r)**2) }\\n\\nfunc nodes(n) {\\n gather {\\n take(Pair(0, weight(n, 0))) if n.is_odd\\n { |i|\\n var r = legendre_root(n, i)\\n var w = weight(n, r)\\n take(Pair(r, w), Pair(-r, w))\\n }.each(1 .. (n >> 1))\\n }\\n}\\n\\nfunc quadrature(n, f, a, b, nds = nodes(n)) {\\n func scale(x) { (x*(b - a) + a + b) / 2 }\\n (b - a) / 2 * nds.sum { .second * f(scale(.first)) }\\n}\\n\\n[(5..10)..., 20].each { |i|\\n printf(\\\"Gauss-Legendre %2d-point quadrature ∫₋₃⁺³ exp(x) dx ≈ %.15f\\\\n\\\",\\n i, quadrature(i, {.exp}, -3, +3))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\npackage require math::special\\npackage require math::polynomials\\npackage require math::constants\\nmath::constants::constants pi\\n\\n# Computes the initial guess for the root i of a n-order Legendre polynomial\\nproc guess {n i} {\\n global pi\\n expr { cos($pi * ($i - 0.25) / ($n + 0.5)) }\\n}\\n\\n# Computes and evaluates the n-order Legendre polynomial at the point x\\nproc legpoly {n x} {\\n math::polynomials::evalPolyn [math::special::legendre $n] $x\\n}\\n\\n# Computes and evaluates the derivative of an n-order Legendre polynomial at point x\\nproc legdiff {n x} {\\n expr {$n / ($x**2 - 1) * ($x * [legpoly $n $x] - [legpoly [incr n -1] $x])}\\n}\\n\\n# Computes the n nodes for an n-point quadrature rule. (i.e. n roots of a n-order polynomial)\\nproc nodes n {\\n set x [lrepeat $n 0.0]\\n for {set i 0} {$i < $n} {incr i} {\\n\\tset val [guess $n [expr {$i + 1}]]\\n\\tforeach . {1 2 3 4 5} {\\n\\t set val [expr {$val - [legpoly $n $val] / [legdiff $n $val]}]\\n\\t}\\n\\tlset x $i $val\\n }\\n return $x\\n}\\n\\n# Computes the weight for an n-order polynomial at the point (node) x\\nproc legwts {n x} {\\n expr {2.0 / (1 - $x**2) / [legdiff $n $x]**2}\\n}\\n\\n# Takes a array of nodes x and computes an array of corresponding weights w\\nproc weights x {\\n set n [llength $x]\\n set w {}\\n foreach xi $x {\\n\\tlappend w [legwts $n $xi]\\n }\\n return $w\\n}\\n\\n# Integrates a lambda term f with a n-point Gauss-Legendre quadrature rule over the interval [a,b]\\nproc gausslegendreintegrate {f n a b} {\\n set x [nodes $n]\\n set w [weights $x]\\n set rangesize2 [expr {($b - $a)/2}]\\n set rangesum2 [expr {($a + $b)/2}]\\n set sum 0.0\\n foreach xi $x wi $w {\\n\\tset y [expr {$rangesize2*$xi + $rangesum2}]\\n\\tset sum [expr {$sum + $wi*[apply $f $y]}]\\n }\\n expr {$sum * $rangesize2}\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts \\\"nodes(5) = [nodes 5]\\\"\\nputs \\\"weights(5) = [weights [nodes 5]]\\\"\\nset exp {x {expr {exp($x)}}}\\nputs \\\"int(exp,-3,3) = [gausslegendreintegrate $exp 5 -3 3]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\nlegendre = # takes n to the pair of functions (P_n,P'_n), where P_n is the Legendre polynomial of order n\\n\\n~&?\\\\(1E0!,0E0!)! -+\\n ^|/~& //mp..vid^ mp..sub\\\\1E0+ mp..sqr,\\n ~~ \\\"c\\\". ~&\\\\1E0; ~&\\\\\\\"c\\\"; ~&ar^?\\\\0E0! mp..add^/mp..mul@alrPrhPX ^|R/~& ^|\\\\~&t ^/~&l mp..mul,\\n @iiXNX ~&rZ->r @l ^/^|(~&tt+ sum@NNiCCiX+ successor,~&) both~&g&&~&+ -+\\n ~* mp..zero_p?/~& (&&~&r ~&EZ+ ~~ mp..prec)^/~& ^(~&,..shr\\\\8); mp..equ^|(~&,..gro\\\\8)->l @r ^/~& ..shr\\\\8,\\n ^(~&rl,mp..mul*lrrPD)^/..nat2mp@r -+\\n ^(~&l,mp..sub*+ zipp0E0^|\\\\~& :/0E0)+ ~&rrt->lhthPX ^(\\n ^lrNCC\\\\~&lh mp..vid^*D/..nat2mp@rl -+\\n mp..sub*+ zipp0E0^|\\\\~& :/0E0,\\n mp..mul~*brlD^|bbI/~&hthPX @l ..nat2mp~~+ predecessor~~NiCiX+-,\\n @r ^|/successor predecessor),\\n ^|(mp..grow/1E0; @iNC ^lrNCC\\\\~& :/0E0,~&/2)+-+-+-\\n\\nnodes = # takes precision and order (p,n) to a list of nodes and weights <(x_1,w_1)..(x_n,w_n)>\\n\\n-+\\n ^H(\\n @lrr *+ ^/~&+ mp..div/( ..nat2mp 2)++ mp..mul^/(mp..sqr; //mp..sub ..nat2mp 1)+ mp..sqr+,\\n mp..shr^*DrlXS/~&ll ^|H\\\\~& *+ @NiX+ ->l^|(~&lZ!|+ not+ //mp..eq,@r+ ^/~&+ mp..sub^/~&+ mp..div^)),\\n ^/^|(~&,legendre) mp..cos*+ mp..mul^*D(\\n mp..div^|/mp..pi@NiC mp..add/5E-1+ ..nat2mp,\\n @r mp..bus/*2.5E-1+ ..nat2mp*+ nrange/1)+-\\n\\nintegral = # takes precision and order (p,n) to a function taking a function and interval (f,(a,b))\\n\\n(\\\"p\\\",\\\"n\\\"). -+\\n mp..shrink^/~& difference\\\\\\\"p\\\"+ mp..prec,\\n mp..mul^|/~& mp..add:-0E0+ * mp..mul^/~&rr ^H/~&ll mp..add^\\\\~&lrr mp..mul@lrPrXl,\\n ^(~&rl,-*nodes(\\\"p\\\",\\\"n\\\"))^|/~& mp..vid~~G/2E0+ ^/mp..bus mp..add+-\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#show+\\n\\ndemo =\\n\\n~&lNrCT (\\n ^|lNrCT(:/'nodes:',:/'weights:')@lSrSX ..mp2str~~* nodes/160 5,\\n :/'integral:' ~&iNC ..mp2str integral(160,5) (mp..exp,-3E0,3E0))\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar N = 5\\n\\nvar lroots = List.filled(N, 0)\\nvar weight = List.filled(N, 0)\\n\\nvar lcoef = List.filled(N+1, null)\\nfor (i in 0..N) lcoef[i] = List.filled(N + 1, 0)\\n\\nvar legeCoef = Fn.new {\\n lcoef[0][0] = lcoef[1][1] = 1\\n for (n in 2..N) {\\n lcoef[n][0] = -(n-1) * lcoef[n -2][0] / n\\n for (i in 1..n) {\\n lcoef[n][i] = ((2*n - 1) * lcoef[n-1][i-1] - (n - 1) * lcoef[n-2][i]) / n\\n }\\n }\\n}\\n\\nvar legeEval = Fn.new { |n, x| (n..1).reduce(lcoef[n][n]) { |s, i| s*x + lcoef[n][i-1] } }\\n\\nvar legeDiff = Fn.new { |n, x|\\n return n * (x * legeEval.call(n, x) - legeEval.call(n-1, x)) / (x*x - 1)\\n}\\n\\nvar legeRoots = Fn.new {\\n var x = 0\\n var x1 = 0\\n for (i in 1..N) {\\n x = (Num.pi * (i - 0.25) / (N + 0.5)).cos\\n while (true) {\\n x1 = x\\n x = x - legeEval.call(N, x) / legeDiff.call(N, x)\\n if (x == x1) break\\n }\\n lroots[i-1] = x\\n x1 = legeDiff.call(N, x)\\n weight[i-1] = 2 / ((1 - x*x) * x1 * x1)\\n }\\n}\\n\\nvar legeIntegrate = Fn.new { |f, a, b|\\n var c1 = (b - a) / 2\\n var c2 = (b + a) / 2\\n var sum = 0\\n for (i in 0...N) sum = sum + weight[i] * f.call(c1*lroots[i] + c2)\\n return c1 * sum\\n}\\n\\nlegeCoef.call()\\nlegeRoots.call()\\nSystem.write(\\\"Roots: \\\")\\nfor (i in 0...N) Fmt.write(\\\" $f\\\", lroots[i])\\nSystem.write(\\\"\\\\nWeight:\\\")\\nfor (i in 0...N) Fmt.write(\\\" $f\\\", weight[i])\\n\\nvar f = Fn.new { |x| x.exp }\\nvar actual = 3.exp - (-3).exp\\nFmt.print(\\\"\\\\nIntegrating exp(x) over [-3, 3]:\\\\n\\\\t$10.8f,\\\\n\\\" +\\n \\\"compared to actual\\\\n\\\\t$10.8f\\\", legeIntegrate.call(f, -3, 3), actual)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn legendrePair(n,x){ //-->(float,float)\\n if(n==1) return(x,1.0);\\n m1,m2:=legendrePair(n-1,x);\\n u:=1.0 - 1.0/n;\\n return( (u + 1)*x*m1 - u*m2, m1);\\n}\\nfcn legendre(n,x){ //-->float\\n if(n==0) return(0.0);\\n legendrePair(n,x)[0]\\n}\\nfcn legendrePrime(n,x){ //-->float\\n if(n==0) return(0.0);\\n if(n==1) return(1.0);\\n m0,m1:=legendrePair(n,x);\\n (m1 - m0*x)*n/(1.0 - x*x);\\n}\\nfcn approximateLegendreRoot(n,k){ # Approximation due to Francesco Tricomi\\n t:=(4.0*k - 1)/(4.0*n + 2);\\n (1.0 - (n - 1)/(8*n*n*n))*((0.0).pi*t).cos();\\n}\\nfcn newtonRaphson(f,fPrime,r,eps=2.0e-16){\\n while(not (dr:=-f(r)/fPrime(r)).closeTo(0.0,eps)){ r+=dr }\\n r;\\n}\\nfcn legendreRoot(n,k){\\n newtonRaphson(legendre.fp(n),legendrePrime.fp(n),\\n approximateLegendreRoot(n,k));\\n}\\nfcn weight(n,r){\\n lp:=legendrePrime(n,r);\\n 2.0/((1.0 - r*r)*lp*lp)\\n}\\nfcn nodes(n){ //-->( (r,weight), (r,w), ...) length n\\n sink:=n.isOdd and L(T(0.0,weight(n,0))) or List;\\n (1).pump(n/2,sink,'wrap(m){\\n r:=legendreRoot(n,m);\\n w:=weight(n,r);\\n return( Void.Write,T(r,w),T(-r,w) )\\n })\\n}\\nfcn quadrature(n,f,a,b,nds=Void){\\n if(not nds) nds=nodes(n);\\n scale:='wrap(x){ (x*(b - a) + a + b) / 2 };\\n nds.reduce('wrap(p,[(r,w)]){ p + w*f(scale(r)) },0.0) * (b - a)/2\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"[5..10].walk().append(20).pump(Console.println,fcn(n){\\n (\\\"Gauss-Legendre %2d-point quadrature \\\"\\n \\\"\\\\U222B;\\\\U208B;\\\\U2083;\\\\U207A;\\\\UB3; exp(x) dx = %.13f\\\")\\n .fmt(n,quadrature(n, fcn(x){ x.exp() }, -3, 3))\\n})\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Numerical-integration-Gauss-Legendre-Quadrature"}}},{"rowIdx":1458,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Object_serialization\nnote: Object oriented\n","language":"00-META"},{"code":"Create a set of data types based upon [[inheritance]]. Each data type or class should have a print command that displays the contents of an instance of that class to standard output. Create instances of each class in your inheritance hierarchy and display them to standard output. Write each of the objects to a file named ''objects.dat'' in binary form using serialization or marshalling. Read the file ''objects.dat'' and print the contents of each serialized object.\n\n","language":"00-TASK"},{"code":"with Ada.Calendar; use Ada.Calendar;\n\npackage Messages is\n type Message is tagged record\n Timestamp : Time;\n end record;\n\n procedure Print(Item : Message);\n procedure Display(Item : Message'Class);\n\n type Sensor_Message is new Message with record\n Sensor_Id : Integer;\n Reading : Float;\n end record;\n\n procedure Print(Item : Sensor_Message);\n\n type Control_Message is new Message with record\n Actuator_Id : Integer;\n Command : Float;\n end record;\n\n procedure Print(Item : Control_Message);\n\nend Messages;\n","language":"Ada"},{"code":"with Ada.Text_Io; use Ada.Text_Io;\nwith Ada.Integer_Text_Io; use Ada.Integer_Text_Io;\nwith Ada.Float_Text_IO; use Ada.Float_Text_IO;\n\npackage body Messages is\n\n -----------\n -- Print --\n -----------\n\n procedure Print (Item : Message) is\n The_Year : Year_Number;\n The_Month : Month_Number;\n The_Day : Day_Number;\n Seconds : Day_Duration;\n begin\n Split(Date => Item.Timestamp, Year => The_Year,\n Month => The_Month, Day => The_Day, Seconds => Seconds);\n\n Put(\"Time Stamp:\");\n Put(Item => The_Year, Width => 4);\n Put(\"-\");\n Put(Item => The_Month, Width => 1);\n Put(\"-\");\n Put(Item => The_Day, Width => 1);\n New_Line;\n end Print;\n\n -----------\n -- Print --\n -----------\n\n procedure Print (Item : Sensor_Message) is\n begin\n Print(Message(Item));\n Put(\"Sensor Id: \");\n Put(Item => Item.Sensor_Id, Width => 1);\n New_Line;\n Put(\"Reading: \");\n Put(Item => Item.Reading, Fore => 1, Aft => 4, Exp => 0);\n New_Line;\n end Print;\n\n -----------\n -- Print --\n -----------\n\n procedure Print (Item : Control_Message) is\n begin\n Print(Message(Item));\n Put(\"Actuator Id: \");\n Put(Item => Item.Actuator_Id, Width => 1);\n New_Line;\n Put(\"Command: \");\n Put(Item => Item.Command, Fore => 1, Aft => 4, Exp => 0);\n New_Line;\n end Print;\n\n -------------\n ---Display --\n -------------\n\n procedure Display(Item : Message'Class) is\n begin\n Print(Item);\n end Display;\n\nend Messages;\n","language":"Ada"},{"code":"with Messages; use Messages;\nwith Ada.Streams.Stream_Io; use Ada.Streams.Stream_Io;\nwith Ada.Calendar; use Ada.Calendar;\nwith Ada.Text_Io;\n\nprocedure Streams_Example is\n S1 : Sensor_Message;\n M1 : Message;\n C1 : Control_Message;\n Now : Time := Clock;\n The_File : Ada.Streams.Stream_Io.File_Type;\n The_Stream : Ada.Streams.Stream_IO.Stream_Access;\nbegin\n S1 := (Now, 1234, 0.025);\n M1.Timestamp := Now;\n C1 := (Now, 15, 0.334);\n Display(S1);\n Display(M1);\n Display(C1);\n begin\n Open(File => The_File, Mode => Out_File,\n Name => \"Messages.dat\");\n exception\n when others =>\n Create(File => The_File, Name => \"Messages.dat\");\n end;\n The_Stream := Stream(The_File);\n Sensor_Message'Class'Output(The_Stream, S1);\n Message'Class'Output(The_Stream, M1);\n Control_Message'Class'Output(The_Stream, C1);\n Close(The_File);\n Open(File => The_File, Mode => In_File,\n Name => \"Messages.dat\");\n The_Stream := Stream(The_File);\n Ada.Text_Io.New_Line(2);\n while not End_Of_File(The_File) loop\n Display(Message'Class'Input(The_Stream));\n end loop;\n Close(The_File);\nend Streams_Example;\n","language":"Ada"},{"code":"MODE ENTITY = STRUCT([6]CHAR name, INT creation);\nFORMAT entity repr = $\"Name: \"g\", Created:\"g$;\nMODE PERSON = STRUCT(ENTITY entity, STRING email);\nFORMAT person repr = $f(entity repr)\", Email: \"g$;\n\nPERSON instance1 := PERSON(ENTITY(\"Cletus\", 20080808), \"test+1@localhost.localdomain\");\nprint((name OF entity OF instance1, new line));\n\nENTITY instance2 := ENTITY(\"Entity\",20111111);\nprint((name OF instance2, new line));\n\nFILE target;\nINT errno := open(target, \"rows.dat\", stand back channel); # open file #\n\n# Serialise #\nput(target,(instance1, new line, instance2, new line));\nprintf(($\"Serialised...\"l$));\n\nclose(target); # flush file stream #\nerrno := open(target, \"rows.dat\", stand back channel); # load again #\n\n# Unserialise #\nPERSON i1;\nENTITY i2;\nget(target,(i1, new line, i2, new line));\nprintf(($\"Unserialised...\"l$));\n\nprintf((person repr, i1, $l$));\nprintf((entity repr, i2, $l$))\n","language":"ALGOL-68"},{"code":"#include <string>\n#include <fstream>\n#include <boost/serialization/string.hpp>\n#include <boost/archive/text_oarchive.hpp>\n#include <boost/archive/text_iarchive.hpp>\n#include <boost/serialization/base_object.hpp>\n#include <iostream>\n\nclass Employee {\npublic :\n Employee( ) { }\n\n Employee ( const std::string &dep , const std::string &namen )\n : department( dep ) , name( namen ) {\n\t my_id = count++ ;\n }\n\n std::string getName( ) const {\n return name ;\n }\n\n std::string getDepartment( ) const {\n return department ;\n }\n\n int getId( ) const {\n return my_id ;\n }\n\n void setDepartment( const std::string &dep ) {\n department.assign( dep ) ;\n }\n\n virtual void print( ) {\n std::cout << \"Name: \" << name << '\\n' ;\n std::cout << \"Id: \" << my_id << '\\n' ;\n std::cout << \"Department: \" << department << '\\n' ;\n }\n\n virtual ~Employee( ) { }\n static int count ;\nprivate :\n std::string name ;\n std::string department ;\n int my_id ;\n friend class boost::serialization::access ;\n\n template <class Archive>\n void serialize( Archive &ar, const unsigned int version ) {\n\t ar & my_id ;\n\t ar & name ;\n\t ar & department ;\n }\n\n} ;\n\nclass Worker : public Employee {\npublic :\n Worker( const std::string & dep, const std::string &namen ,\n\t double hourlyPay ) : Employee( dep , namen ) , salary( hourlyPay) { }\n\n Worker( ) { }\n\n double getSalary( ) {\n return salary ;\n }\n\n void setSalary( double pay ) {\n if ( pay > 0 )\n\t salary = pay ;\n }\n\n virtual void print( ) {\n Employee::print( ) ;\n std::cout << \"wage per hour: \" << salary << '\\n' ;\n }\nprivate :\n double salary ;\n friend class boost::serialization::access ;\n template <class Archive>\n void serialize ( Archive & ar, const unsigned int version ) {\n\t ar & boost::serialization::base_object<Employee>( *this ) ;\n\t ar & salary ;\n }\n} ;\n\nint Employee::count = 0 ;\n\nint main( ) {\n std::ofstream storefile( \"/home/ulrich/objects.dat\" ) ; //creating objects of base class\n const Employee emp1( \"maintenance\" , \"Fritz Schmalstieg\" ) ;\n const Employee emp2( \"maintenance\" , \"John Berry\" ) ;\n const Employee emp3( \"repair\" , \"Pawel Lichatschow\" ) ;\n const Employee emp4( \"IT\" , \"Marian Niculescu\" ) ;\n const Worker worker1( \"maintenance\" , \"Laurent Le Chef\" , 20 ) ;//creating objects of derived class\n const Worker worker2 ( \"IT\" , \"Srinivan Taraman\" , 55.35 ) ;\n boost::archive::text_oarchive oar ( storefile ) ;//starting serialization into designated file\n oar << emp1 ;\n oar << emp2 ;\n oar << emp3 ;\n oar << emp4 ;\n oar << worker1 ;\n oar << worker2 ;\n storefile.close( ) ;\n std::cout << \"Reading out the data again\\n\" ;\n Employee e1 , e2 , e3 , e4 ; //creating instances of base class objects for deserialization\n Worker w1, w2 ; // same for objects of derived class\n std::ifstream sourcefile( \"/home/ulrich/objects.dat\" ) ;\n boost::archive::text_iarchive iar( sourcefile ) ;//starting deserialization\n iar >> e1 >> e2 >> e3 >> e4 ;\n iar >> w1 >> w2 ;\n sourcefile.close( ) ;\n std::cout << \"And here are the data after deserialization!( abridged):\\n\" ;\n e1.print( ) ;\n e3.print( ) ;\n w2.print( ) ;\n return 0 ;\n}\n","language":"C++"},{"code":"using System;\nusing System.IO;\nusing System.Collections.Generic;\nusing System.Runtime.Serialization.Formatters.Binary;\n\nnamespace Object_serialization\n{\n [Serializable] public class Being\n {\n public bool Alive { get; set; }\n }\n\n [Serializable] public class Animal: Being\n {\n public Animal() { }\n\n public Animal(long id, string name, bool alive = true)\n {\n Id = id;\n Name = name;\n Alive = alive;\n }\n\n public long Id { get; set; }\n public string Name { get; set; }\n\n public void Print() { Console.WriteLine(\"{0}, id={1} is {2}\",\n Name, Id, Alive ? \"alive\" : \"dead\"); }\n }\n\n\n internal class Program\n {\n private static void Main()\n {\n string path =\n Environment.GetFolderPath(Environment.SpecialFolder.Desktop)+\"\\\\objects.dat\";\n\n var n = new List<Animal>\n {\n new Animal(1, \"Fido\"),\n new Animal(2, \"Lupo\"),\n new Animal(7, \"Wanda\"),\n new Animal(3, \"Kiki\", alive: false)\n };\n\n foreach(Animal animal in n)\n animal.Print();\n\n using(var stream = new FileStream(path, FileMode.Create, FileAccess.Write))\n new BinaryFormatter().Serialize(stream, n);\n\n n.Clear();\n Console.WriteLine(\"---------------\");\n List<Animal> m;\n\n using(var stream = new FileStream(path, FileMode.Open, FileAccess.Read))\n m = (List<Animal>) new BinaryFormatter().Deserialize(stream);\n\n foreach(Animal animal in m)\n animal.Print();\n }\n }\n}\n","language":"C-sharp"},{"code":"(defmacro with-serialization-to-file ((stream pathname) &body body)\n `(with-open-file (,stream ,pathname\n :element-type '(unsigned-byte 8)\n :direction :output\n :if-exists :supersede)\n ,@body))\n\n(defclass entity ()\n ((name :initarg :name :initform \"Some entity\")))\n\n(defclass person (entity)\n ((name :initarg :name :initform \"The Nameless One\")))\n","language":"Common-Lisp"},{"code":"CL-USER> (list (make-instance 'entity)\n (make-instance 'person))\n\n(#<ENTITY {1004B13141}> #<PERSON {1004B142B1}>)\nCL-USER> (mapc #'describe *)\n#<ENTITY {1004B13141}>\n [standard-object]\n\nSlots with :INSTANCE allocation:\n NAME = \"Some entity\"\n#<PERSON {1004B142B1}>\n [standard-object]\n\nSlots with :INSTANCE allocation:\n NAME = \"The Nameless One\"\n(#<ENTITY {1004B13141}> #<PERSON {1004B142B1}>)\nCL-USER> (with-serialization-to-file (stream \"/tmp/objects.dat\")\n (cl-serializer:serialize * :output stream)\n ;; SERIALIZE shows an octet-vector as its return value\n (values))\n; No value\nCL-USER> (mapc #'describe (with-open-file (stream \"/tmp/objects.dat\"\n :element-type '(unsigned-byte 8))\n (cl-serializer:deserialize stream)))\n#<ENTITY {1003C12911}>\n [standard-object]\n\nSlots with :INSTANCE allocation:\n NAME = \"Some entity\"\n#<PERSON {1003C12A81}>\n [standard-object]\n\nSlots with :INSTANCE allocation:\n NAME = \"The Nameless One\"\n(#<ENTITY {1003C12911}> #<PERSON {1003C12A81}>)\n","language":"Common-Lisp"},{"code":"import test1;\nimport std.stdio;\nimport std.file;\nclass full2:base2 {\n this(byte[]manip,bool isroot=true) {super(manip,isroot);}\n this(){super();}\n void print() {\n foreach(item;rep) {\n writefln(item.i32);\n }\n }\n}\n\nvoid main() {\n full2 base = new full2();\n base1 tmp = new base1;\n tmp.i32 = 34;\n base.add_rep(tmp);\n tmp = new base1;\n tmp.i32 = 32;\n base.add_rep(tmp);\n tmp = new base1;\n tmp.i32 = 33;\n base.add_rep(tmp);\n tmp = new base1;\n tmp.i32 = 36;\n base.add_rep(tmp);\n writefln(\"Input data:\");\n base.print;\n write(\"objects.dat\",base.Serialize());\n byte[]filedata = cast(byte[])read(\"objects.dat\");\n base = new full2(filedata);\n writefln(\"Output data:\");\n base.print;\n}\n","language":"D"},{"code":"def makeEvent(time :int) {\n return def event {\n to __printOn(out) { out.print(`@@$time`) }\n to __optUncall() { return [makeEvent, \"run\", [time]] }\n to getTime() { return time }\n }\n}\n\ndef makeArrival(time :int, what :any, position :int) {\n return def arrival extends makeEvent(time) {\n to __printOn(out) {\n out.print(`$what to $position $super`)\n }\n to __optUncall() {\n return [makeArrival, \"run\", [time, what, position]]\n }\n\n to getWhat() { return what }\n to getPosition() { return position }\n }\n}\n","language":"E"},{"code":"def surgeon := <import:org.erights.e.elib.serial.makeSurgeon>().diverge()\nsurgeon.addExit(makeEvent, \"makeEvent\")\nsurgeon.addExit(makeArrival, \"makeArrival\")\n","language":"E"},{"code":"def objs := [makeEvent(timer.now()),\n makeArrival(timer.now(), \"Smith\", 7)]\n\nstdout.println(objs)\n<file:objects.dat>.setBytes(surgeon.serialize(objs))\nstdout.println(surgeon.unserialize(<file:objects.dat>.getBytes()))\n","language":"E"},{"code":"(define (person->string self) (format \"%a : person.\" (person-name self)))\n(define (writer->string self) (format \"%a: writer of %a.\"\n\t\t\t(person-name self)\n\t\t\t(writer-books self)))\n(define (father->string self) (format \"%a: father of %a.\"\n\t\t\t(person-name self)\n\t\t\t(map person-name (father-children self))))\n\t\t\t\n; 'classes' definition, with inheritance.\n; a writer is a person, too.\n(struct person (name) #:tostring person->string)\n(struct writer person (books) #:tostring writer->string)\n(struct father person (children) #:tostring father->string)\n\n(define simon (writer \"Simon\" '(my-life my-wife my-bike)))\n(define elvis (person \"Elvis\"))\n(define papa (father \"papa\" (list simon elvis)))\n\n(local-put-value 'simon simon \"objects.dat\")\n📕 local-db: local-put:unknown store : \"objects.dat\"\n;; forgot to create the store. Create it :\n(local-make-store \"objects.dat\") → \"objects.dat\"\n\n(local-put-value 'simon simon \"objects.dat\")\n(local-put-value 'elvis elvis \"objects.dat\")\n(local-put-value 'papa papa \"objects.dat\")\n\n;; inspect\nsimon → Simon: writer of (my-life my-wife my-bike).\npapa → papa: father of (Simon Elvis).\nelvis → Elvis : person.\n","language":"EchoLisp"},{"code":";; reboot (close the browser window)\n; inspect objects.dat :\n(local-keys 'objects.dat) → (\"elvis\" \"papa\" \"simon\")\n\n(define simon (local-get-value 'simon \"objects.dat\"))\n(define elvis (local-get-value 'elvis \"objects.dat\"))\n(define papa (local-get-value 'papa \"objects.dat\"))\n\n; data are restored\nsimon → Simon: writer of (my-life my-wife my-bike).\npapa → papa: father of (Simon Elvis).\n\n;; check if references (pointers) are restored\n(set-writer-name! simon \"Antoinette\") → \"Antoinette\"\nsimon→ Antoinette: writer of (my-life my-wife my-bike).\n\n;; inspect\npapa → papa: father of (Antoinette Elvis). ; YES 😳 !\n\n;; - Self-referencing (EchoLisp version 2.11)\n;; add 'papa' to the chidren of 'papa' - whatever this means - and print it :\n(set-father-children! papa (list simon papa elvis))\npapa → papa: father of (Antoinette papa Elvis).\n\n; save/restore\n(local-put-value 'papa papa \"objects.dat\")\n(define papa (local-get-value 'papa \"objects.dat\"))\npapa → papa: father of (Antoinette papa Elvis).\n","language":"EchoLisp"},{"code":"-module( object_serialization ).\n\n-export( [task/0] ).\n\n-record( entity, {name, date} ).\n-record( person, {entity, email} ).\n\ntask() ->\n\tPerson = #person{entity=#entity{name=\"Cletus\", date=20080808}, email=\"test+1@localhost.localdomain\"},\n\tprint( Person ),\n\tEntity = #entity{name=\"Entity\", date=20111111},\n\tprint( Entity ),\n\tok = file:write_file( \"objects.dat\", erlang:term_to_binary([Person, Entity]) ),\n\t{ok, Binary} = file:read_file( \"objects.dat\" ),\n\t[New_person, New_entity] = erlang:binary_to_term( Binary ),\n\tio:fwrite( \"Deserialized\\n\" ),\n\tprint( New_person ),\n\tprint( New_entity ).\n\t\n\n\nprint( #entity{name=Name, date=Date} ) ->\n\tio:fwrite( \"Entity: \" ),\n\tio:fwrite( \"name: ~p, date: ~p~n\", [Name, Date] );\nprint( #person{entity=Entity, email=Email} ) ->\n\tio:fwrite( \"Person: \" ),\n\tprint( Entity ),\n\tio:fwrite( \"\\temail: ~p~n\", [Email] ).\n","language":"Erlang"},{"code":"USING: accessors combinators.extras io io.encodings.binary\nio.files io.files.info kernel prettyprint serialize ;\nIN: rosetta-code.object-serialization\n\n! Define two classes, item and armor. armor is a subclass of\n! item.\n\nTUPLE: item name value ;\nTUPLE: armor < item physical-resistance fire-resistance ;\n\n! Define boa constructors for both classes using C: shorthand.\n! boa means By Order of Arguments, and yes, this is a pun on boa\n! constrictors.\n\nC: <item> item\nC: <armor> armor\n\n! Create three example items and print them out\n! non-destructively.\n\n\"Fish scales\" 0.05 <item>\n\"Gold piece\" 1 <item>\n\"Breastplate of Ashannar\" 50,000 55 30 <armor>\n[ [ . ] keep ] tri@ nl\n\n! Serialize the three objects to a binary file named\n! objects.dat.\n\n\"Serializing objects to objects.dat . . . \" print\n\"objects.dat\" binary [ [ serialize ] tri@ ] with-file-writer\n\n! Check that objects.dat exists.\n\n\"objects.dat exists? \" write \"objects.dat\" exists? .\n\"Size on disk: \" write \"objects.dat\" file-info size>> pprint\n\" bytes\" print nl\n\n! Deserialize three objects from objects.dat.\n\n\"Deserializing objects from objects.dat . . . \" print nl\n\"objects.dat\" binary [ [ deserialize ] thrice ] with-file-reader\n\n! Print out deserialized objects.\n\n[ . ] tri@\n","language":"Factor"},{"code":"Type Person\n nombre As String\n edad As Integer\nEnd Type\n\nSub PrintPerson(p As Person)\n Print \"Name: \"; p.nombre\n Print \"Age: \"; p.edad\nEnd Sub\n\nSub Serialize(p As Person, filename As String)\n Open filename For Binary As #1\n Put #1, , p.nombre\n Put #1, , p.edad\n Close #1\nEnd Sub\n\nSub Deserialize(p As Person, filename As String)\n Open filename For Binary As #1\n Get #1, , p.nombre\n Get #1, , p.edad\n Close #1\nEnd Sub\n\nDim pp As Person\npp.nombre = \"Juan Hdez.\"\npp.edad = 52\n\nSerialize(pp, \"objects.dat\")\nDeserialize(pp, \"objects.dat\")\n\nPrintPerson(pp)\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"encoding/gob\"\n \"fmt\"\n \"os\"\n)\n\ntype printable interface {\n print()\n}\n\nfunc main() {\n // create instances\n animals := []printable{\n &Animal{Alive: true},\n &Cat{},\n &Lab{\n Dog: Dog{Animal: Animal{Alive: true}},\n Color: \"yellow\",\n },\n &Collie{Dog: Dog{\n Animal: Animal{Alive: true},\n ObedienceTrained: true,\n }},\n }\n\n // display\n fmt.Println(\"created:\")\n for _, a := range animals {\n a.print()\n }\n\n // serialize\n f, err := os.Create(\"objects.dat\")\n if err != nil {\n fmt.Println(err)\n return\n }\n for _, a := range animals {\n gob.Register(a)\n }\n err = gob.NewEncoder(f).Encode(animals)\n if err != nil {\n fmt.Println(err)\n return\n }\n f.Close()\n\n // read\n f, err = os.Open(\"objects.dat\")\n if err != nil {\n fmt.Println(err)\n return\n }\n var clones []printable\n gob.NewDecoder(f).Decode(&clones)\n if err != nil {\n fmt.Println(err)\n return\n }\n\n // display\n fmt.Println(\"\\nloaded from objects.dat:\")\n for _, c := range clones {\n c.print()\n }\n}\n\ntype Animal struct {\n Alive bool\n}\n\nfunc (a *Animal) print() {\n if a.Alive {\n fmt.Println(\" live animal, unspecified type\")\n } else {\n fmt.Println(\" dead animal, unspecified type\")\n }\n}\n\ntype Dog struct {\n Animal\n ObedienceTrained bool\n}\n\nfunc (d *Dog) print() {\n switch {\n case !d.Alive:\n fmt.Println(\" dead dog\")\n case d.ObedienceTrained:\n fmt.Println(\" trained dog\")\n default:\n fmt.Println(\" dog, not trained\")\n }\n}\n\ntype Cat struct {\n Animal\n LitterBoxTrained bool\n}\n\nfunc (c *Cat) print() {\n switch {\n case !c.Alive:\n fmt.Println(\" dead cat\")\n case c.LitterBoxTrained:\n fmt.Println(\" litter box trained cat\")\n default:\n fmt.Println(\" cat, not litter box trained\")\n }\n}\n\ntype Lab struct {\n Dog\n Color string\n}\n\nfunc (l *Lab) print() {\n var r string\n if l.Color == \"\" {\n r = \"lab, color unspecified\"\n } else {\n r = l.Color + \" lab\"\n }\n switch {\n case !l.Alive:\n fmt.Println(\" dead\", r)\n case l.ObedienceTrained:\n fmt.Println(\" trained\", r)\n default:\n fmt.Printf(\" %s, not trained\\n\", r)\n }\n}\n\ntype Collie struct {\n Dog\n CatchesFrisbee bool\n}\n\nfunc (c *Collie) print() {\n switch {\n case !c.Alive:\n fmt.Println(\" dead collie\")\n case c.ObedienceTrained && c.CatchesFrisbee:\n fmt.Println(\" trained collie, catches frisbee\")\n case c.ObedienceTrained && !c.CatchesFrisbee:\n fmt.Println(\" trained collie, but doesn't catch frisbee\")\n case !c.ObedienceTrained && c.CatchesFrisbee:\n fmt.Println(\" collie, not trained, but catches frisbee\")\n case !c.ObedienceTrained && !c.CatchesFrisbee:\n fmt.Println(\" collie, not trained, doesn't catch frisbee\")\n }\n}\n","language":"Go"},{"code":"class Entity implements Serializable {\n static final serialVersionUID = 3504465751164822571L\n String name = 'Thingamabob'\n public String toString() { return name }\n}\n\nclass Person extends Entity implements Serializable {\n static final serialVersionUID = -9170445713373959735L\n Person() { name = 'Clement' }\n Person(name) { this.name = name }\n}\n","language":"Groovy"},{"code":"File objectStore = new File('objectStore.ser')\nif (objectStore.exists()) { objectStore.delete() }\nassert ! objectStore.exists()\ndef os\ntry {\n os = objectStore.newObjectOutputStream()\n os << new Person()\n os << 10.5\n os << new Person('Cletus')\n os << new Date()\n os << new Person('Pious')\n os << java.awt.Color.RED\n os << new Person('Linus')\n os << 'just random garbage'\n os << new Person('Lucy')\n os << ['lists', 'are', 'serializable']\n os << new Person('Schroeder')\n} catch (e) { throw new Exception(e) } finally { os?.close() }\nassert objectStore.exists()\n","language":"Groovy"},{"code":"def is\ntry {\n is = objectStore.newObjectInputStream(this.class.classLoader)\n is.eachObject { println it }\n} catch (e) { throw new Exception(e) } finally { is?.close() }\n\nobjectStore.delete()\nassert ! objectStore.exists()\n","language":"Groovy"},{"code":"{-# LANGUAGE DeriveGeneric #-}\n\nmodule Main (main) where\n\nimport qualified Data.ByteString.Lazy as ByteString (readFile, writeFile)\nimport Data.Binary (Binary)\nimport qualified Data.Binary as Binary (decode, encode)\nimport GHC.Generics (Generic)\n\ndata Employee =\n Manager String String\n | IndividualContributor String String\n deriving (Generic, Show)\ninstance Binary Employee\n\nmain :: IO ()\nmain = do\n ByteString.writeFile \"objects.dat\" $ Binary.encode\n [ IndividualContributor \"John Doe\" \"Sales\"\n , Manager \"Jane Doe\" \"Engineering\"\n ]\n\n bytes <- ByteString.readFile \"objects.dat\"\n let employees = Binary.decode bytes\n print (employees :: [Employee])\n","language":"Haskell"},{"code":"(var object {:a 1 :b \"Hello, world!\" [1 2 3] :c}\n serialised (str object)\n deserialised (safe-eval serialised))\n\n(print \"Object: \" object)\n(print \"Serialised: \" serialised)\n(str \"Deserialised: \" deserialised)\n","language":"Haskell"},{"code":"lin_z_=:5!:5\nserializeObject=:3 :0\n p=. copath y\n d=. ;LF;\"1(,'=:';lin__y)\"0 nl__y i.4\n '(',(5!:5<'p'),')(copath[cocurrent@])cocreate ''''',,d,LF\n)\n\ndeserializeObject=:3 :0\n o=.conl 1\n 0!:100 y\n (conl 1)-.o\n)\n\ncoclass'room'\n create=:3 :'size=:y'\n print=:3 :'''room size '',\":size'\n\ncoclass'kitchen'\n coinsert'room'\n print=:3 :'''kitchen size '',\":size'\n\ncoclass'kitchenWithSink'\n coinsert'kitchen'\n print=:3 :'''kitchen with sink size '',\":size'\n\ncocurrent'base'\n\nR=:'small' conew 'room'\nK=:'medium' conew 'kitchen'\nS=:'large' conew 'kitchenWithSink'\nprint__R''\nprint__K''\nprint__S''\n\n\n(;<@serializeObject\"0 R,K,S) 1!:2 <'objects.dat'\n\n'r1 k1 s1'=: <\"0 deserializeObject 1!:1<'objects.dat'\nprint__r1''\nprint__k1''\nprint__s1''\n","language":"J"},{"code":" print__R''\nroom size small\n print__K''\nkitchen size medium\n print__S''\nkitchen with sink size large\n\n\n (;<@serializeObject\"0 R,K,S) 1!:2 <'objects.dat'\n\n 'r1 k1 s1'=: <\"0 deserializeObject 1!:1<'objects.dat'\n print__r1''\nroom size small\n print__k1''\nkitchen size medium\n print__s1''\nkitchen with sink size large\n","language":"J"},{"code":"import java.io.*;\n\n// classes must implement java.io.Serializable in order to be serializable\nclass Entity implements Serializable {\n // it is recommended to hard-code serialVersionUID so changes to class\n // will not invalidate previously serialized objects\n static final long serialVersionUID = 3504465751164822571L;\n String name = \"Entity\";\n public String toString() { return name; }\n}\n\nclass Person extends Entity implements Serializable {\n static final long serialVersionUID = -9170445713373959735L;\n Person() { name = \"Cletus\"; }\n}\n\npublic class SerializationTest {\n public static void main(String[] args) {\n Person instance1 = new Person();\n System.out.println(instance1);\n\n Entity instance2 = new Entity();\n System.out.println(instance2);\n\n // Serialize\n try {\n ObjectOutput out = new ObjectOutputStream(new FileOutputStream(\"objects.dat\")); // open ObjectOutputStream\n\n out.writeObject(instance1); // serialize \"instance1\" and \"instance2\" to \"out\"\n out.writeObject(instance2);\n out.close();\n System.out.println(\"Serialized...\");\n } catch (IOException e) {\n System.err.println(\"Something screwed up while serializing\");\n e.printStackTrace();\n System.exit(1);\n }\n\n // Deserialize\n try {\n ObjectInput in = new ObjectInputStream(new FileInputStream(\"objects.dat\")); // open ObjectInputStream\n\n Object readObject1 = in.readObject(); // read two objects from \"in\"\n Object readObject2 = in.readObject(); // you may want to cast them to the appropriate types\n in.close();\n System.out.println(\"Deserialized...\");\n\n System.out.println(readObject1);\n System.out.println(readObject2);\n } catch (IOException e) {\n System.err.println(\"Something screwed up while deserializing\");\n e.printStackTrace();\n System.exit(1);\n } catch (ClassNotFoundException e) {\n System.err.println(\"Unknown class for deserialized object\");\n e.printStackTrace();\n System.exit(1);\n }\n }\n}\n","language":"Java"},{"code":"abstract type Hello end\n\nstruct HelloWorld <: Hello\n name::String\n HelloWorld(s) = new(s)\nend\n\nstruct HelloTime <: Hello\n name::String\n tnew::DateTime\n HelloTime(s) = new(s, now())\nend\n\nsayhello(hlo) = println(\"Hello to this world, $(hlo.name)!\")\n\nsayhello(hlo::HelloTime) = println(\"It is now $(now()). Hello from back in $(hlo.tnew), $(hlo.name)!\")\n\nh1 = HelloWorld(\"world\")\nh2 = HelloTime(\"new world\")\n\nsayhello(h1)\nsayhello(h2)\n\nfh = open(\"objects.dat\", \"w\")\nserialize(fh, h1)\nserialize(fh,h2)\nclose(fh)\n\nsleep(10)\n\nfh = open(\"objects.dat\", \"r\")\nhh1 = deserialize(fh)\nhh2 = deserialize(fh)\nclose(fh)\n\nsayhello(hh1)\nsayhello(hh2)\n","language":"Julia"},{"code":"// version 1.2.0\n\nimport java.io.*\n\nopen class Entity(val name: String = \"Entity\"): Serializable {\n override fun toString() = name\n\n companion object {\n val serialVersionUID = 3504465751164822571L\n }\n}\n\nclass Person(name: String = \"Brian\"): Entity(name), Serializable {\n companion object {\n val serialVersionUID = -9170445713373959735L\n }\n}\n\nfun main(args: Array<String>) {\n val instance1 = Person()\n println(instance1)\n\n val instance2 = Entity()\n println(instance2)\n\n // serialize\n try {\n val out = ObjectOutputStream(FileOutputStream(\"objects.dat\"))\n out.writeObject(instance1)\n out.writeObject(instance2)\n out.close()\n println(\"Serialized...\")\n }\n catch (e: IOException) {\n println(\"Error occurred whilst serializing\")\n System.exit(1)\n }\n\n // deserialize\n try {\n val inp = ObjectInputStream(FileInputStream(\"objects.dat\"))\n val readObject1 = inp.readObject()\n val readObject2 = inp.readObject()\n inp.close()\n println(\"Deserialized...\")\n println(readObject1)\n println(readObject2)\n }\n catch (e: IOException) {\n println(\"Error occurred whilst deserializing\")\n System.exit(1)\n }\n catch (e: ClassNotFoundException) {\n println(\"Unknown class for deserialized object\")\n System.exit(1)\n }\n}\n","language":"Kotlin"},{"code":"/* Object serialization, in Neko */\n\nvar file_open = $loader.loadprim(\"std@file_open\", 2)\nvar file_write = $loader.loadprim(\"std@file_write\", 4)\nvar file_read = $loader.loadprim(\"std@file_read\", 4)\nvar file_close = $loader.loadprim(\"std@file_close\", 1)\n\nvar serialize = $loader.loadprim(\"std@serialize\", 1)\nvar unserialize = $loader.loadprim(\"std@unserialize\", 2)\n\n/* Inheritance by prototype */\nproto = $new(null)\nproto.print = function () { $print(this, \"\\n\") }\n\nobj = $new(null)\nobj.msg = \"Hello\"\nobj.dest = $array(\"Town\", \"Country\", \"World\")\n\n$objsetproto(obj, proto)\n$print(\"Original:\\n\")\nobj.print()\n\n/* Serialize the object */\nvar thing = serialize(obj)\nvar len = $ssize(thing)\n\n/* To disk */\nvar f = file_open(\"object-serialization.bin\", \"w\")\nfile_write(f, thing, 0, len)\nfile_close(f)\n\n/* Load the binary data into a new string space */\nf = file_open(\"object-serialization.bin\", \"r\")\nvar buff = $smake(len)\nfile_read(f, buff, 0, len)\nfile_close(f)\n\n/* Unserialize the object into a new variable */\nvar other = unserialize(buff, $loader)\n$print(\"deserialized:\\n\")\nother.print()\n","language":"Neko"},{"code":"import marshal, streams\n\ntype\n Base = object of RootObj\n name: string\n Descendant = object of Base\nproc newBase(): Base = Base(name: \"base\")\nproc newDescendant(): Descendant = Descendant(name: \"descend\")\nproc print(obj: Base) =\n echo(obj.name)\n\nvar\n base = newBase()\n descendant = newDescendant()\nprint(base)\nprint(descendant)\n\nvar strm = newFileStream(\"objects.dat\", fmWrite)\nstore(strm, (base, descendant))\nstrm.close()\n\nvar t: (Base, Descendant)\nload(newFileStream(\"objects.dat\", fmRead), t)\nprint(t[0])\nprint(t[1])\n","language":"Nim"},{"code":"bundle Default {\n class Thingy {\n @id : Int;\n\n New(id : Int) {\n @id := id;\n }\n\n method : public : Print() ~ Nil {\n @id->PrintLine();\n }\n }\n\n class Person from Thingy {\n @name : String;\n\n New(id : Int, name : String) {\n Parent(id);\n @name := name;\n }\n\n method : public : Print() ~ Nil {\n @id->PrintLine();\n @name->PrintLine();\n }\n }\n\n class Serial {\n function : Main(args : String[]) ~ Nil {\n t := Thingy->New(7);\n p := Person->New(13, \"Bush\");\n\n s := IO.Serializer->New();\n s->Write(t->As(Base));\n s->Write(p->As(Base));\n\n writer := IO.FileWriter->New(\"objects.dat\");\n writer->WriteBuffer(s->Serialize());\n writer->Close();\n\n buffer := IO.FileReader->ReadBinaryFile(\"objects.dat\");\n d := IO.Deserializer->New(buffer);\n\n t2 := d->ReadObject()->As(Thingy);\n t2->Print();\n p2 := d->ReadObject()->As(Person);\n p2->Print();\n }\n }\n}\n","language":"Objeck"},{"code":"#import <Foundation/Foundation.h>\n\n// a fantasy two level hierarchy\n@interface Animal : NSObject <NSCoding>\n{\n NSString *animalName;\n int numberOfLegs;\n}\n- (instancetype) initWithName: (NSString*)name andLegs: (NSInteger)legs;\n- (void) dump;\n@end\n\n@implementation Animal\n- (instancetype) initWithName: (NSString*)name andLegs: (NSInteger)legs\n{\n if ((self = [super init])) {\n animalName = name;\n numberOfLegs = legs;\n }\n return self;\n}\n- (void) dump\n{\n NSLog(@\"%@ has %d legs\", animalName, numberOfLegs);\n}\n// ========\n- (void) encodeWithCoder: (NSCoder*)coder\n{\n [coder encodeObject: animalName forKey: @\"Animal.name\"];\n [coder encodeInt: numberOfLegs forKey: @\"Animal.legs\"];\n}\n- (instancetype) initWithCoder: (NSCoder*)coder\n{\n if ((self = [super init])) {\n animalName = [coder decodeObjectForKey: @\"Animal.name\"];\n numberOfLegs = [coder decodeIntForKey: @\"Animal.legs\"];\n }\n return self;\n}\n@end\n\n@interface Mammal : Animal <NSCoding>\n{\n BOOL hasFur;\n NSMutableArray *eatenList;\n}\n- (instancetype) initWithName: (NSString*)name hasFur: (BOOL)fur;\n- (void) addEatenThing: (NSString*)thing;\n@end\n\n@implementation Mammal\n- (instancetype) init\n{\n if ((self = [super init])) {\n hasFur = NO;\n eatenList = [[NSMutableArray alloc] initWithCapacity: 10];\n }\n return self;\n}\n- (instancetype) initWithName: (NSString*)name hasFur: (BOOL)fur\n{\n if ((self = [super initWithName: name andLegs: 4])) {\n hasFur = fur;\n eatenList = [[NSMutableArray alloc] initWithCapacity: 10];\n }\n return self;\n}\n- (void) addEatenThing: (NSString*)thing\n{\n [eatenList addObject: thing];\n}\n- (void) dump\n{\n [super dump];\n NSLog(@\"has fur? %@\", (hasFur) ? @\"yes\" : @\"no\" );\n NSLog(@\"it has eaten %d things:\", [eatenList count]);\n for ( id element in eatenList )\n NSLog(@\"it has eaten a %@\", element);\n NSLog(@\"end of eaten things list\");\n}\n// ========= de/archiving\n- (void) encodeWithCoder: (NSCoder*)coder\n{\n [super encodeWithCoder: coder];\n [coder encodeBool: numberOfLegs forKey: @\"Mammal.hasFur\"];\n [coder encodeObject: eatenList forKey: @\"Mammal.eaten\"];\n}\n- (instancetype) initWithCoder: (NSCoder*)coder\n{\n if ((self = [super initWithCoder: coder])) {\n hasFur = [coder decodeBoolForKey: @\"Mammal.hasFur\"];\n eatenList = [coder decodeObjectForKey: @\"Mammal.eaten\"];\n }\n return self;\n}\n@end\n\n\nint main()\n{\n @autoreleasepool {\n\n // let us create a fantasy animal\n Animal *anAnimal = [[Animal alloc]\n\t initWithName: @\"Eptohippos\"\n\t andLegs: 7\n\t ];\n // for some reason an Eptohippos is not an horse with 7 legs,\n // and it is not a mammal, of course...\n\n // let us create a fantasy mammal (which is an animal too)\n Mammal *aMammal = [[Mammal alloc]\n\t initWithName: @\"Mammaluc\"\n\t hasFur: YES\n\t ];\n // let us add some eaten stuff...\n [aMammal addEatenThing: @\"lamb\"];\n [aMammal addEatenThing: @\"table\"];\n [aMammal addEatenThing: @\"web page\"];\n\n // dump anAnimal\n NSLog(@\"----- original Animal -----\");\n [anAnimal dump];\n\n // dump aMammal...\n NSLog(@\"----- original Mammal -----\");\n [aMammal dump];\n\n // now let us store the objects...\n NSMutableData *data = [[NSMutableData alloc] init];\n NSKeyedArchiver *arch = [[NSKeyedArchiver alloc]\n\t\t\t initForWritingWithMutableData: data];\n [arch encodeObject: anAnimal forKey: @\"Eptohippos\"];\n [arch encodeObject: aMammal forKey: @\"Mammaluc\"];\n [arch finishEncoding];\n [data writeToFile: @\"objects.dat\" atomically: YES];\n\n // now we want to retrieve the saved objects...\n NSData *ldata = [[NSData alloc]\n\t\t initWithContentsOfFile: @\"objects.dat\"];\n NSKeyedUnarchived *darch = [[NSKeyedUnarchiver alloc]\n\t initForReadingWithData: ldata];\n Animal *archivedAnimal = [darch decodeObjectForKey: @\"Eptohippos\"];\n Mammal *archivedMammal = [darch decodeObjectForKey: @\"Mammaluc\"];\n [darch finishDecoding];\n\n // now let's dump/print the objects...\n NSLog(@\"\\n\");\n NSLog(@\"----- the archived Animal -----\");\n [archivedAnimal dump];\n NSLog(@\"----- the archived Mammal -----\");\n [archivedMammal dump];\n\n }\n return EXIT_SUCCESS;\n}\n","language":"Objective-C"},{"code":"type entity = { name : string }\n\nlet create_entity () = { name = \"Entity\" }\nlet print_entity x = print_endline x.name\nlet create_person () = { name = \"Cletus\" }\n\nlet instance1 = create_person ()\nlet instance2 = create_entity ()\n\n(* Serialize *)\nlet out_chan = open_out_bin \"objects.dat\";;\noutput_value out_chan instance1;;\noutput_value out_chan instance2;;\nclose_out out_chan;;\n\n(* Deserialize *)\nlet in_chan = open_in_bin \"objects.dat\";;\nlet result1 : entity = input_value in_chan;;\nlet result2 : entity = input_value in_chan;;\nclose_in in_chan;;\n\nprint_entity result1;;\nprint_entity result2;;\n","language":"OCaml"},{"code":"$ ol\nWelcome to Otus Lisp 1.2,\ntype ',help' to help, ',quit' to end session.\n> (define Object (tuple\n '(1 2 3 4) ; list\n #(4 3 2 1) ; bytevector\n \"hello\" ; ansi string\n \"こんにちは\" ; unicode string\n (list->ff '(; associative array\n (1 . 123456)\n (2 . second)\n (3 . \"-th-\")))\n {(4 . 'sym) ; alternatively declared..\n (5 . +)} ; ..associative array\n #false ; value\n -123 ; short number\n 123456789012345678901234567890123456789 ; long number\n)\n;; Defined Object\n#((1 2 3 4) #(4 3 2 1) hello こんにちは #ff((1 . 123456) (2 . second) (3 . -th-))\n#ff((4 . sym) (5 . #<function>)) #false -123\n123456789012345678901234567890123456789)\n\n> (fasl-save Object \"/tmp/object.bin\")\n#true\n\n> (define New (fasl-load \"/tmp/object.bin\" #false))\n;; Defined New\n#((1 2 3 4) #(4 3 2 1) hello こんにちは #ff((1 . 123456) (2 . second) (3 . -th-))\n#ff((4 . sym) (5 . #<function>)) #false -123\n123456789012345678901234567890123456789)\n\n> (equal? Object New)\n#true\n\n> ,quit\nbye-bye :/\n$\n","language":"Ol"},{"code":"{\n package Greeting;\n sub new {\n my $v = \"Hello world!\\n\";\n bless \\$v, shift;\n };\n sub stringify {\n ${shift()};\n };\n};\n{\n package Son::of::Greeting;\n use base qw(Greeting); # inherit methods\n sub new { # overwrite method of super class\n my $v = \"Hello world from Junior!\\n\";\n bless \\$v, shift;\n };\n};\n{\n use Storable qw(store retrieve);\n package main;\n my $g1 = Greeting->new;\n my $s1 = Son::of::Greeting->new;\n print $g1->stringify;\n print $s1->stringify;\n\n store $g1, 'objects.dat';\n my $g2 = retrieve 'objects.dat';\n\n store $s1, 'objects.dat';\n my $s2 = retrieve 'objects.dat';\n\n print $g2->stringify;\n print $s2->stringify;\n};\n","language":"Perl"},{"code":"use MooseX::Declare;\n\nclass Greeting {\n use MooseX::Storage;\n with Storage('format' => 'JSON', io => 'File');\n has string => (is => 'ro', default => \"Hello world!\\n\");\n}\nclass Son::Of::Greeting extends Greeting {\n has string => (is => 'ro', default => \"Hello from Junior!\\n\");\n}\n\nmy $g1 = Greeting->new;\nmy $s1 = Son::Of::Greeting->new;\n\nprint $g1->string;\nprint $s1->string;\n\n$g1->store('object1.json');\nmy $g2 = Greeting->load('object1.json');\n\n$s1->store('object2.json');\nmy $s2 = Son::Of::Greeting->load('object2.json');\n\nprint $g2->string;\nprint $s2->string;\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">include</span> <span style=\"color: #008000;\">\"builtins/serialize.e\"</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">randobj</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000080;font-style:italic;\">-- test function (generate some random garbage)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)<=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- make sequence[1..3]</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">randobj</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)<=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- make string</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'A'</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span> <span style=\"color: #000080;font-style:italic;\">-- half int/half float</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">o1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">randobj</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">o2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">randobj</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">o3</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">randobj</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">o1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">o2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">o3</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fh</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"objects.dat\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"wb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">serialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o1</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">serialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o2</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">serialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o3</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"===\"</span>\n\n <span style=\"color: #000000;\">fh</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"objects.dat\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"rb\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">deserialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">deserialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">deserialize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">delete_file</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"objects.dat\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"$myObj = new Object();\n$serializedObj = serialize($myObj);\n","language":"PHP"},{"code":"(class +Point)\n# x y\n\n(dm T (X Y)\n (=: x (or X 0))\n (=: y (or Y 0)) )\n\n(dm print> ()\n (prinl \"Point \" (: x) \",\" (: y)) )\n\n(class +Circle +Point)\n# r\n\n(dm T (X Y R)\n (super X Y)\n (=: r (or R 0)) )\n\n(dm print> ()\n (prinl \"Circle \" (: x) \",\" (: y) \",\" (: r)) )\n\n(setq\n P (new '(+Point) 3 4)\n C (new '(+Circle) 10 10 5) )\n\n(print> P)\n(print> C)\n\n(out \"objects.dat\"\n (pr (val P) (getl P))\n (pr (val C) (getl C)) )\n","language":"PicoLisp"},{"code":"(in \"objects.dat\"\n (putl (setq A (box (rd))) (rd))\n (putl (setq B (box (rd))) (rd)) )\n\n(print> A)\n(print> B)\n","language":"PicoLisp"},{"code":"# Object Serialization in Python\n# serialization in python is accomplished via the Pickle module.\n# Alternatively, one can use the cPickle module if speed is the key,\n# everything else in this example remains the same.\n\nimport pickle\n\nclass Entity:\n\tdef __init__(self):\n\t\tself.name = \"Entity\"\n\tdef printName(self):\n\t\tprint self.name\n\nclass Person(Entity): #OldMan inherits from Entity\n\tdef __init__(self): #override constructor\n\t\tself.name = \"Cletus\"\n\ninstance1 = Person()\ninstance1.printName()\n\ninstance2 = Entity()\ninstance2.printName()\n\ntarget = file(\"objects.dat\", \"w\") # open file\n\n# Serialize\npickle.dump((instance1, instance2), target) # serialize `instance1` and `instance2`to `target`\ntarget.close() # flush file stream\nprint \"Serialized...\"\n\n# Unserialize\ntarget = file(\"objects.dat\") # load again\ni1, i2 = pickle.load(target)\nprint \"Unserialized...\"\n\ni1.printName()\ni2.printName()\n","language":"Python"},{"code":"(require racket/serialize)\n","language":"Racket"},{"code":"#lang racket\n;; Object Serialization: Tim Brown, Oct. 2014\n(require racket/serialize)\n\n(define (join-person-name-list persons)\n (string-join (map (λ (c) (send c ->string)) persons) \", \"))\n\n(define-serializable-class person% object%\n (init-field name [siblings null])\n (define/public (->string #:show (show null))\n (cond\n [(and (member 'siblings show) (not (null? siblings)))\n (format \"~a (~a)\" name (join-person-name-list siblings))]\n [else name]))\n (super-new))\n\n(define-serializable-class parent% person%\n (init-field [children null])\n (define/override (->string #:show (show null))\n (cond\n [(and (member 'children show) (not (null? children)))\n (format \"~a [~a]\" (super ->string #:show show) (join-person-name-list children))]\n [else (super ->string #:show show)]))\n (super-new))\n\n;; horribly out of fashion and probaly no longer PC\n(define-serializable-class nuclear-family% object%\n (init-field father mother children)\n (define/public (->string)\n (string-append\n (format \"~a + ~a -> \" (send father ->string) (send mother ->string))\n (format \"~a\" (join-person-name-list children))))\n (super-new))\n\n;; =| TESTS |=========================================================================================\n(define jack (new person% [name \"Jack\"]))\n(define joan (new person% [name \"Joan\"]))\n(set-field! siblings jack (list joan))\n(set-field! siblings joan (list jack))\n(define the-kids (list jack joan))\n(define john (new parent% [name \"John\"] [children the-kids]))\n(define jane (new parent% [name \"Jane\"] [children the-kids]))\n\n(define the-family\n (new nuclear-family% [father john] [mother jane] [children the-kids]))\n\n(define (duplicate-object-through-file o f-name)\n (with-output-to-file f-name #:exists 'replace (λ () (write (serialize o))))\n (with-input-from-file f-name (λ () (deserialize (read)))))\n\n(define cloned-family (duplicate-object-through-file the-family \"objects.dat\"))\n\n(printf \"The original family:\\t~a~%\" (send the-family ->string))\n(printf \"The cloned family:\\t~a~%~%\" (send cloned-family ->string))\n(printf \"objects.dat contains ----~%~a~%-------------------~%~%\" (file->string \"objects.dat\"))\n(printf \"Clones are different?~%\")\n(define cloned-jack (first (get-field children cloned-family)))\n(set-field! name cloned-jack \"JACK\")\n(printf \"Jack's name is:\\t~s~%\" (get-field name jack))\n(printf \"Clone's name is:\\t~s~%~%\" (get-field name cloned-jack))\n(printf \"Relationships are maintained?~%\")\n(define cloned-joan (second (get-field children cloned-family)))\n(printf \"Joan's description with siblings:\\t~s~%\" (send joan ->string #:show '(siblings)))\n(printf \"Clone's description with siblings:\\t~s~%~%\"\n (send cloned-joan ->string #:show '(siblings)))\n(printf \"After Jack's renaming the cloned family is: ~a~%~%\" (send cloned-family ->string))\n(printf \"Various descriptions of cloned John:~%\")\n(define cloned-john (get-field father cloned-family))\n(printf \"Just the name:\\t~s~%\" (send cloned-john ->string))\n(printf \"With siblings:\\t~s (he hasn't any)~%\" (send cloned-john ->string #:show '(siblings)))\n(printf \"With children:\\t~s~%\" (send cloned-john ->string #:show '(children)))\n(printf \"With both:\\t~s~%\" (send cloned-john ->string #:show '(siblings children)))\n","language":"Racket"},{"code":"# Reference:\n# https://docs.raku.org/language/classtut\n# https://github.com/teodozjan/perl-store\n\nuse v6;\nuse PerlStore::FileStore;\n\nclass Point {\n has Int $.x;\n has Int $.y;\n}\n\nclass Rectangle does FileStore {\n has Point $.lower;\n has Point $.upper;\n\n method area() returns Int {\n ($!upper.x - $!lower.x) * ( $!upper.y - $!lower.y);\n }\n}\n\nmy $r1 = Rectangle.new(lower => Point.new(x => 0, y => 0),\n upper => Point.new(x => 10, y => 10));\nsay \"Create Rectangle1 with area \",$r1.area();\nsay \"Serialize Rectangle1 to object.dat\";\n$r1.to_file('./objects.dat');\nsay \"\";\nsay \"take a peek on object.dat ..\";\nsay slurp \"./objects.dat\";\nsay \"\";\nsay \"Deserialize to Rectangle2\";\nmy $r2 = from_file('objects.dat');\nsay \"Rectangle2 is of type \", $r2.WHAT;\nsay \"Rectangle2 area is \", $r2.area();\n","language":"Raku"},{"code":"class Being\n def initialize(specialty=nil)\n @specialty=specialty\n end\n def to_s\n \"(object_id = #{object_id})\\n\"+\"(#{self.class}):\".ljust(12)+to_s4Being+(@specialty ? \"\\n\"+\" \"*12+@specialty : \"\")\n end\n def to_s4Being\n \"I am a collection of cooperative molecules with a talent for self-preservation.\"\n end\nend\n\nclass Earthling < Being\n def to_s4Being\n \"I originate from a blue planet.\\n\"+\" \"*12+to_s4Earthling\n end\nend\n\nclass Mammal < Earthling\n def initialize(type)\n @type=type\n end\n def to_s4Earthling\n \"I am champion in taking care of my offspring and eating everything I can find, except mammals of type #{@type}.\"\n end\nend\n\nclass Fish < Earthling\n def initialize(iq)\n @iq=(iq>1 ? :instrustableValue : iq)\n end\n def to_s4Earthling\n \"Although I think I can think, I can't resist biting in hooks.\"\n end\nend\n\nclass Moonling < Being\n def to_s4Being\n \"My name is Janneke Maan, and apparently some Earthlings will pay me a visit.\"\n end\nend\n\ndiverseCollection=[]\ndiverseCollection << (marsian=Being.new(\"I come from Mars and like playing hide and seek.\"))\ndiverseCollection << (me=Mammal.new(:human))\ndiverseCollection << (nemo=Fish.new(0.99))\ndiverseCollection << (jannakeMaan=Moonling.new)\n\nputs \"BEGIN ORIGINAL DIVERSE COLLECTION\"\ndiverseCollection.each do |being|\n puts \"\",being.to_s\nend\nputs \"END ORIGINAL DIVERSE COLLECTION\"\nputs \"\\n\"+\"*\"*50+\"\\n\\n\"\n\n#Marshal the diverse Array of beings\nFile.open('diverseCollection.bin','w') do |fo|\n fo << Marshal.dump(diverseCollection)\nend\n\n#load the Array of diverse beings\nsameDiverseCollection=Marshal.load(File.read('diverseCollection.bin'))\n\nputs \"BEGIN LOADED DIVERSE COLLECTION\"\nputs(\n sameDiverseCollection.collect do |being|\n being.to_s\n end.join(\"\\n\\n\")\n )\nputs \"END LOADED DIVERSE COLLECTION\"\n","language":"Ruby"},{"code":"serde = { version = \"1.0.89\", features = [\"derive\"] }\nbincode = \"1.1.2\"\n","language":"Rust"},{"code":"use std::fmt;\n\nuse bincode::{deserialize, serialize};\nuse serde::{Deserialize, Serialize};\n\n#[derive(Debug, Serialize, Deserialize)]\nenum Animal {\n Dog { name: String, color: String },\n Bird { name: String, wingspan: u8 },\n}\n\nimpl fmt::Display for Animal {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n match self {\n Animal::Dog { name, color } => write!(f, \"{} is a dog with {} fur\", name, color),\n Animal::Bird { name, wingspan } => {\n write!(f, \"{} is a bird with a wingspan of {}\", name, wingspan)\n }\n }\n }\n}\n\nfn main() -> bincode::Result<()> {\n let animals = vec![\n Animal::Dog {\n name: \"Rover\".into(),\n color: \"brown\".into(),\n },\n Animal::Bird {\n name: \"Tweety\".into(),\n wingspan: 3,\n },\n ];\n\n for animal in &animals {\n println!(\"{}\", animal);\n }\n\n let serialized = serialize(&animals)?;\n\n println!(\"Serialized into {} bytes\", serialized.len());\n\n let deserialized: Vec<Animal> = deserialize(&serialized)?;\n\n println!(\"{:#?}\", deserialized);\n\n Ok(())\n}\n","language":"Rust"},{"code":"serde = { version = \"1.0.89\", features = [\"derive\"] }\nbincode = \"1.1.2\"\ntypetag = \"0.1.1\"\n","language":"Rust"},{"code":"use std::fmt::{self, Debug, Display};\n\nuse bincode::{deserialize, serialize};\nuse serde::{Deserialize, Serialize};\n\n#[typetag::serde(tag = \"animal\")]\ntrait Animal: Display + Debug {\n fn name(&self) -> Option<&str>;\n fn feet(&self) -> u32;\n}\n\n#[derive(Debug, Deserialize, Serialize)]\nstruct Dog {\n name: String,\n color: String,\n}\n\nimpl Display for Dog {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(f, \"{} is a dog with {} fur\", self.name, self.color)\n }\n}\n\n#[typetag::serde]\nimpl Animal for Dog {\n fn name(&self) -> Option<&str> {\n Some(&self.name)\n }\n\n fn feet(&self) -> u32 {\n 4\n }\n}\n\n#[derive(Debug, Deserialize, Serialize)]\nstruct Bird {\n name: String,\n wingspan: u32,\n}\n\nimpl Display for Bird {\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\n write!(\n f,\n \"{} is a bird with a wingspan of {}\",\n self.name, self.wingspan\n )\n }\n}\n\n#[typetag::serde]\nimpl Animal for Bird {\n fn name(&self) -> Option<&str> {\n Some(&self.name)\n }\n\n fn feet(&self) -> u32 {\n 2\n }\n}\n\nfn main() -> bincode::Result<()> {\n let animals: Vec<Box<dyn Animal>> = vec![\n Box::new(Dog {\n name: \"Rover\".into(),\n color: \"brown\".into(),\n }),\n Box::new(Bird {\n name: \"Tweety\".into(),\n wingspan: 3,\n }),\n ];\n\n for animal in &animals {\n println!(\"{}\", animal);\n }\n\n let serialized = serialize(&animals)?;\n println!(\"Serialized into {} bytes\", serialized.len());\n\n let deserialized: Vec<Box<dyn Animal>> = deserialize(&serialized)?;\n\n println!(\"{:#?}\", deserialized);\n\n Ok(())\n}\n","language":"Rust"},{"code":"package require Tcl 8.6\npackage require TclOO::serializer 0.1\n\n# These classes are inspired by the Perl example\noo::class create Greeting {\n superclass oo::serializable\n variable v\n constructor {} {\n set v \"Hello world!\"\n }\n method get {} {\n return $v\n }\n}\noo::class create SubGreeting {\n superclass Greeting oo::serializable\n variable v\n constructor {} {\n set v \"Hello world from Junior!\"\n }\n}\noo::class create GreetingsHolder {\n superclass oo::serializable\n variable o1 o2\n constructor {greeting1 greeting2} {\n set o1 $greeting1\n set o2 $greeting2\n }\n method printGreetings {} {\n puts [$o1 get]\n puts [$o2 get]\n }\n destructor {\n $o1 destroy\n $o2 destroy\n }\n}\n\n# Make some objects and store them\nGreetingsHolder create holder [Greeting new] [SubGreeting new]\nset f [open \"objects.dat\" w]\nputs $f [oo::serialize holder]\nclose $f\n\n# Delete the objects\nholder destroy\n\n# Recreate the objects from the file and show that they work\nset f [open \"objects.dat\" r]\nset obj [oo::deserialize [read $f]]\nclose $f\n$obj printGreetings\n","language":"Tcl"},{"code":"(defstruct shape ()\n (pos-x 0.0) (pos-y 0.0))\n\n(defstruct circle (shape)\n radius)\n\n(defstruct ellipse (shape)\n min-radius maj-radius)\n\n(defvarl shapes (list (new circle radius 3.0)\n (new ellipse min-radius 4.0 maj-radius 5.0)))\n\n(put-line \"original shapes:\")\n(prinl shapes)\n\n(file-put \"shapes.tl\" shapes)\n\n(put-line \"dump of shapes.tl file:\")\n(put-line (file-get-string \"shapes.tl\"))\n\n(put-line \"object list read from file:\")\n(prinl (file-get \"shapes.tl\"))\n","language":"TXR"},{"code":"(defstruct shape ()\n (pos-x 0.0) (pos-y 0.0))\n\n(defstruct circle (shape)\n radius\n (:method print (me stream pretty-p)\n (if pretty-p\n (put-string `#<circle of radius @{me.radius} at coordinates (@{me.pos-x}, @{me.pos-y})>`)\n :)))\n\n(let ((circ (new circle radius 5.3)))\n (prinl circ) ;; print machine readably\n (pprinl circ)) ;; print pretty\n","language":"TXR"},{"code":"import \"./json\" for JSON\nimport \"io\" for File, FileFlags\n\nclass Entity {\n construct new(name) {\n _name = name\n }\n\n name { _name }\n\n // JSON representation\n toString { \"{\\\"name\\\": \\\"%(_name)\\\"}\" }\n\n // mimics the JSON output\n print() { System.print(this.toString.replace(\"\\\"\", \"\")) }\n\n serialize(fileName) {\n var o = JSON.parse(this.toString)\n File.openWithFlags(fileName, FileFlags.writeOnly) { |file|\n file.writeBytes(\"%(o)\\n\")\n }\n }\n}\n\nclass Person is Entity {\n construct new(name, age) {\n super(name)\n _age = age\n }\n\n // JSON representation\n toString { \"{\\\"name\\\": \\\"%(name)\\\", \\\"age\\\": \\\"%(_age)\\\"}\" }\n\n // mimics the JSON output\n print() { System.print(this.toString.replace(\"\\\"\", \"\")) }\n\n serialize(fileName) {\n var o = JSON.parse(this.toString)\n File.openWithFlags(fileName, FileFlags.writeOnly) { |file|\n file.writeBytes(\"%(o)\\n\")\n }\n }\n}\n\n// create file for serialization\nvar fileName = \"objects.dat\"\nvar file = File.create(fileName)\nfile.close()\n\nSystem.print(\"Calling print methods gives:\")\n\nvar e = Entity.new(\"John\")\ne.print()\ne.serialize(fileName)\n\nvar p = Person.new(\"Fred\", 35)\np.print()\np.serialize(fileName)\n\nSystem.print(\"\\nContents of objects.dat are:\")\nSystem.print(File.read(fileName))\n","language":"Wren"},{"code":"class [static] ARootClass{ // A top level class, no instances\n class A{ self.println(\" constructor\"); } // a regular class\n class B(A){ // ditto\n var x;\n fcn init(x=123){ self.x=x }\n fcn toString{ \"x is \"+x }\n }\n}\n\nARootClass.B(456).println(); // create an instance\n // prints:\n Class(A) constructor\n x is 456\n\nf:=File(\"object.dat\",\"wb\");\nCompiler.Asm.writeRootClass(ARootClass,f); // serialize to file\nf.close();\n\nf:=File(\"object.dat\",\"rb\");\nrc:=Compiler.Asm.readRootClass(f); // read and re-create\n // prints (readRootClass calls all constructors by default):\n Class(A) constructor\nf.close();\nrc.B().println(); // create a new instance of B\n // prints:\n x is 123\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Object_serialization\\nnote: Object oriented\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Create a set of data types based upon [[inheritance]]. Each data type or class should have a print command that displays the contents of an instance of that class to standard output. Create instances of each class in your inheritance hierarchy and display them to standard output. Write each of the objects to a file named ''objects.dat'' in binary form using serialization or marshalling. Read the file ''objects.dat'' and print the contents of each serialized object.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Calendar; use Ada.Calendar;\\n\\npackage Messages is\\n type Message is tagged record\\n Timestamp : Time;\\n end record;\\n\\n procedure Print(Item : Message);\\n procedure Display(Item : Message'Class);\\n\\n type Sensor_Message is new Message with record\\n Sensor_Id : Integer;\\n Reading : Float;\\n end record;\\n\\n procedure Print(Item : Sensor_Message);\\n\\n type Control_Message is new Message with record\\n Actuator_Id : Integer;\\n Command : Float;\\n end record;\\n\\n procedure Print(Item : Control_Message);\\n\\nend Messages;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_Io; use Ada.Text_Io;\\nwith Ada.Integer_Text_Io; use Ada.Integer_Text_Io;\\nwith Ada.Float_Text_IO; use Ada.Float_Text_IO;\\n\\npackage body Messages is\\n\\n -----------\\n -- Print --\\n -----------\\n\\n procedure Print (Item : Message) is\\n The_Year : Year_Number;\\n The_Month : Month_Number;\\n The_Day : Day_Number;\\n Seconds : Day_Duration;\\n begin\\n Split(Date => Item.Timestamp, Year => The_Year,\\n Month => The_Month, Day => The_Day, Seconds => Seconds);\\n\\n Put(\\\"Time Stamp:\\\");\\n Put(Item => The_Year, Width => 4);\\n Put(\\\"-\\\");\\n Put(Item => The_Month, Width => 1);\\n Put(\\\"-\\\");\\n Put(Item => The_Day, Width => 1);\\n New_Line;\\n end Print;\\n\\n -----------\\n -- Print --\\n -----------\\n\\n procedure Print (Item : Sensor_Message) is\\n begin\\n Print(Message(Item));\\n Put(\\\"Sensor Id: \\\");\\n Put(Item => Item.Sensor_Id, Width => 1);\\n New_Line;\\n Put(\\\"Reading: \\\");\\n Put(Item => Item.Reading, Fore => 1, Aft => 4, Exp => 0);\\n New_Line;\\n end Print;\\n\\n -----------\\n -- Print --\\n -----------\\n\\n procedure Print (Item : Control_Message) is\\n begin\\n Print(Message(Item));\\n Put(\\\"Actuator Id: \\\");\\n Put(Item => Item.Actuator_Id, Width => 1);\\n New_Line;\\n Put(\\\"Command: \\\");\\n Put(Item => Item.Command, Fore => 1, Aft => 4, Exp => 0);\\n New_Line;\\n end Print;\\n\\n -------------\\n ---Display --\\n -------------\\n\\n procedure Display(Item : Message'Class) is\\n begin\\n Print(Item);\\n end Display;\\n\\nend Messages;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Messages; use Messages;\\nwith Ada.Streams.Stream_Io; use Ada.Streams.Stream_Io;\\nwith Ada.Calendar; use Ada.Calendar;\\nwith Ada.Text_Io;\\n\\nprocedure Streams_Example is\\n S1 : Sensor_Message;\\n M1 : Message;\\n C1 : Control_Message;\\n Now : Time := Clock;\\n The_File : Ada.Streams.Stream_Io.File_Type;\\n The_Stream : Ada.Streams.Stream_IO.Stream_Access;\\nbegin\\n S1 := (Now, 1234, 0.025);\\n M1.Timestamp := Now;\\n C1 := (Now, 15, 0.334);\\n Display(S1);\\n Display(M1);\\n Display(C1);\\n begin\\n Open(File => The_File, Mode => Out_File,\\n Name => \\\"Messages.dat\\\");\\n exception\\n when others =>\\n Create(File => The_File, Name => \\\"Messages.dat\\\");\\n end;\\n The_Stream := Stream(The_File);\\n Sensor_Message'Class'Output(The_Stream, S1);\\n Message'Class'Output(The_Stream, M1);\\n Control_Message'Class'Output(The_Stream, C1);\\n Close(The_File);\\n Open(File => The_File, Mode => In_File,\\n Name => \\\"Messages.dat\\\");\\n The_Stream := Stream(The_File);\\n Ada.Text_Io.New_Line(2);\\n while not End_Of_File(The_File) loop\\n Display(Message'Class'Input(The_Stream));\\n end loop;\\n Close(The_File);\\nend Streams_Example;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE ENTITY = STRUCT([6]CHAR name, INT creation);\\nFORMAT entity repr = $\\\"Name: \\\"g\\\", Created:\\\"g$;\\nMODE PERSON = STRUCT(ENTITY entity, STRING email);\\nFORMAT person repr = $f(entity repr)\\\", Email: \\\"g$;\\n\\nPERSON instance1 := PERSON(ENTITY(\\\"Cletus\\\", 20080808), \\\"test+1@localhost.localdomain\\\");\\nprint((name OF entity OF instance1, new line));\\n\\nENTITY instance2 := ENTITY(\\\"Entity\\\",20111111);\\nprint((name OF instance2, new line));\\n\\nFILE target;\\nINT errno := open(target, \\\"rows.dat\\\", stand back channel); # open file #\\n\\n# Serialise #\\nput(target,(instance1, new line, instance2, new line));\\nprintf(($\\\"Serialised...\\\"l$));\\n\\nclose(target); # flush file stream #\\nerrno := open(target, \\\"rows.dat\\\", stand back channel); # load again #\\n\\n# Unserialise #\\nPERSON i1;\\nENTITY i2;\\nget(target,(i1, new line, i2, new line));\\nprintf(($\\\"Unserialised...\\\"l$));\\n\\nprintf((person repr, i1, $l$));\\nprintf((entity repr, i2, $l$))\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <string>\\n#include <fstream>\\n#include <boost/serialization/string.hpp>\\n#include <boost/archive/text_oarchive.hpp>\\n#include <boost/archive/text_iarchive.hpp>\\n#include <boost/serialization/base_object.hpp>\\n#include <iostream>\\n\\nclass Employee {\\npublic :\\n Employee( ) { }\\n\\n Employee ( const std::string &dep , const std::string &namen )\\n : department( dep ) , name( namen ) {\\n\\t my_id = count++ ;\\n }\\n\\n std::string getName( ) const {\\n return name ;\\n }\\n\\n std::string getDepartment( ) const {\\n return department ;\\n }\\n\\n int getId( ) const {\\n return my_id ;\\n }\\n\\n void setDepartment( const std::string &dep ) {\\n department.assign( dep ) ;\\n }\\n\\n virtual void print( ) {\\n std::cout << \\\"Name: \\\" << name << '\\\\n' ;\\n std::cout << \\\"Id: \\\" << my_id << '\\\\n' ;\\n std::cout << \\\"Department: \\\" << department << '\\\\n' ;\\n }\\n\\n virtual ~Employee( ) { }\\n static int count ;\\nprivate :\\n std::string name ;\\n std::string department ;\\n int my_id ;\\n friend class boost::serialization::access ;\\n\\n template <class Archive>\\n void serialize( Archive &ar, const unsigned int version ) {\\n\\t ar & my_id ;\\n\\t ar & name ;\\n\\t ar & department ;\\n }\\n\\n} ;\\n\\nclass Worker : public Employee {\\npublic :\\n Worker( const std::string & dep, const std::string &namen ,\\n\\t double hourlyPay ) : Employee( dep , namen ) , salary( hourlyPay) { }\\n\\n Worker( ) { }\\n\\n double getSalary( ) {\\n return salary ;\\n }\\n\\n void setSalary( double pay ) {\\n if ( pay > 0 )\\n\\t salary = pay ;\\n }\\n\\n virtual void print( ) {\\n Employee::print( ) ;\\n std::cout << \\\"wage per hour: \\\" << salary << '\\\\n' ;\\n }\\nprivate :\\n double salary ;\\n friend class boost::serialization::access ;\\n template <class Archive>\\n void serialize ( Archive & ar, const unsigned int version ) {\\n\\t ar & boost::serialization::base_object<Employee>( *this ) ;\\n\\t ar & salary ;\\n }\\n} ;\\n\\nint Employee::count = 0 ;\\n\\nint main( ) {\\n std::ofstream storefile( \\\"/home/ulrich/objects.dat\\\" ) ; //creating objects of base class\\n const Employee emp1( \\\"maintenance\\\" , \\\"Fritz Schmalstieg\\\" ) ;\\n const Employee emp2( \\\"maintenance\\\" , \\\"John Berry\\\" ) ;\\n const Employee emp3( \\\"repair\\\" , \\\"Pawel Lichatschow\\\" ) ;\\n const Employee emp4( \\\"IT\\\" , \\\"Marian Niculescu\\\" ) ;\\n const Worker worker1( \\\"maintenance\\\" , \\\"Laurent Le Chef\\\" , 20 ) ;//creating objects of derived class\\n const Worker worker2 ( \\\"IT\\\" , \\\"Srinivan Taraman\\\" , 55.35 ) ;\\n boost::archive::text_oarchive oar ( storefile ) ;//starting serialization into designated file\\n oar << emp1 ;\\n oar << emp2 ;\\n oar << emp3 ;\\n oar << emp4 ;\\n oar << worker1 ;\\n oar << worker2 ;\\n storefile.close( ) ;\\n std::cout << \\\"Reading out the data again\\\\n\\\" ;\\n Employee e1 , e2 , e3 , e4 ; //creating instances of base class objects for deserialization\\n Worker w1, w2 ; // same for objects of derived class\\n std::ifstream sourcefile( \\\"/home/ulrich/objects.dat\\\" ) ;\\n boost::archive::text_iarchive iar( sourcefile ) ;//starting deserialization\\n iar >> e1 >> e2 >> e3 >> e4 ;\\n iar >> w1 >> w2 ;\\n sourcefile.close( ) ;\\n std::cout << \\\"And here are the data after deserialization!( abridged):\\\\n\\\" ;\\n e1.print( ) ;\\n e3.print( ) ;\\n w2.print( ) ;\\n return 0 ;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.IO;\\nusing System.Collections.Generic;\\nusing System.Runtime.Serialization.Formatters.Binary;\\n\\nnamespace Object_serialization\\n{\\n [Serializable] public class Being\\n {\\n public bool Alive { get; set; }\\n }\\n\\n [Serializable] public class Animal: Being\\n {\\n public Animal() { }\\n\\n public Animal(long id, string name, bool alive = true)\\n {\\n Id = id;\\n Name = name;\\n Alive = alive;\\n }\\n\\n public long Id { get; set; }\\n public string Name { get; set; }\\n\\n public void Print() { Console.WriteLine(\\\"{0}, id={1} is {2}\\\",\\n Name, Id, Alive ? \\\"alive\\\" : \\\"dead\\\"); }\\n }\\n\\n\\n internal class Program\\n {\\n private static void Main()\\n {\\n string path =\\n Environment.GetFolderPath(Environment.SpecialFolder.Desktop)+\\\"\\\\\\\\objects.dat\\\";\\n\\n var n = new List<Animal>\\n {\\n new Animal(1, \\\"Fido\\\"),\\n new Animal(2, \\\"Lupo\\\"),\\n new Animal(7, \\\"Wanda\\\"),\\n new Animal(3, \\\"Kiki\\\", alive: false)\\n };\\n\\n foreach(Animal animal in n)\\n animal.Print();\\n\\n using(var stream = new FileStream(path, FileMode.Create, FileAccess.Write))\\n new BinaryFormatter().Serialize(stream, n);\\n\\n n.Clear();\\n Console.WriteLine(\\\"---------------\\\");\\n List<Animal> m;\\n\\n using(var stream = new FileStream(path, FileMode.Open, FileAccess.Read))\\n m = (List<Animal>) new BinaryFormatter().Deserialize(stream);\\n\\n foreach(Animal animal in m)\\n animal.Print();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defmacro with-serialization-to-file ((stream pathname) &body body)\\n `(with-open-file (,stream ,pathname\\n :element-type '(unsigned-byte 8)\\n :direction :output\\n :if-exists :supersede)\\n ,@body))\\n\\n(defclass entity ()\\n ((name :initarg :name :initform \\\"Some entity\\\")))\\n\\n(defclass person (entity)\\n ((name :initarg :name :initform \\\"The Nameless One\\\")))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"CL-USER> (list (make-instance 'entity)\\n (make-instance 'person))\\n\\n(#<ENTITY {1004B13141}> #<PERSON {1004B142B1}>)\\nCL-USER> (mapc #'describe *)\\n#<ENTITY {1004B13141}>\\n [standard-object]\\n\\nSlots with :INSTANCE allocation:\\n NAME = \\\"Some entity\\\"\\n#<PERSON {1004B142B1}>\\n [standard-object]\\n\\nSlots with :INSTANCE allocation:\\n NAME = \\\"The Nameless One\\\"\\n(#<ENTITY {1004B13141}> #<PERSON {1004B142B1}>)\\nCL-USER> (with-serialization-to-file (stream \\\"/tmp/objects.dat\\\")\\n (cl-serializer:serialize * :output stream)\\n ;; SERIALIZE shows an octet-vector as its return value\\n (values))\\n; No value\\nCL-USER> (mapc #'describe (with-open-file (stream \\\"/tmp/objects.dat\\\"\\n :element-type '(unsigned-byte 8))\\n (cl-serializer:deserialize stream)))\\n#<ENTITY {1003C12911}>\\n [standard-object]\\n\\nSlots with :INSTANCE allocation:\\n NAME = \\\"Some entity\\\"\\n#<PERSON {1003C12A81}>\\n [standard-object]\\n\\nSlots with :INSTANCE allocation:\\n NAME = \\\"The Nameless One\\\"\\n(#<ENTITY {1003C12911}> #<PERSON {1003C12A81}>)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import test1;\\nimport std.stdio;\\nimport std.file;\\nclass full2:base2 {\\n this(byte[]manip,bool isroot=true) {super(manip,isroot);}\\n this(){super();}\\n void print() {\\n foreach(item;rep) {\\n writefln(item.i32);\\n }\\n }\\n}\\n\\nvoid main() {\\n full2 base = new full2();\\n base1 tmp = new base1;\\n tmp.i32 = 34;\\n base.add_rep(tmp);\\n tmp = new base1;\\n tmp.i32 = 32;\\n base.add_rep(tmp);\\n tmp = new base1;\\n tmp.i32 = 33;\\n base.add_rep(tmp);\\n tmp = new base1;\\n tmp.i32 = 36;\\n base.add_rep(tmp);\\n writefln(\\\"Input data:\\\");\\n base.print;\\n write(\\\"objects.dat\\\",base.Serialize());\\n byte[]filedata = cast(byte[])read(\\\"objects.dat\\\");\\n base = new full2(filedata);\\n writefln(\\\"Output data:\\\");\\n base.print;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"def makeEvent(time :int) {\\n return def event {\\n to __printOn(out) { out.print(`@@$time`) }\\n to __optUncall() { return [makeEvent, \\\"run\\\", [time]] }\\n to getTime() { return time }\\n }\\n}\\n\\ndef makeArrival(time :int, what :any, position :int) {\\n return def arrival extends makeEvent(time) {\\n to __printOn(out) {\\n out.print(`$what to $position $super`)\\n }\\n to __optUncall() {\\n return [makeArrival, \\\"run\\\", [time, what, position]]\\n }\\n\\n to getWhat() { return what }\\n to getPosition() { return position }\\n }\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def surgeon := <import:org.erights.e.elib.serial.makeSurgeon>().diverge()\\nsurgeon.addExit(makeEvent, \\\"makeEvent\\\")\\nsurgeon.addExit(makeArrival, \\\"makeArrival\\\")\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def objs := [makeEvent(timer.now()),\\n makeArrival(timer.now(), \\\"Smith\\\", 7)]\\n\\nstdout.println(objs)\\n<file:objects.dat>.setBytes(surgeon.serialize(objs))\\nstdout.println(surgeon.unserialize(<file:objects.dat>.getBytes()))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(define (person->string self) (format \\\"%a : person.\\\" (person-name self)))\\n(define (writer->string self) (format \\\"%a: writer of %a.\\\"\\n\\t\\t\\t(person-name self)\\n\\t\\t\\t(writer-books self)))\\n(define (father->string self) (format \\\"%a: father of %a.\\\"\\n\\t\\t\\t(person-name self)\\n\\t\\t\\t(map person-name (father-children self))))\\n\\t\\t\\t\\n; 'classes' definition, with inheritance.\\n; a writer is a person, too.\\n(struct person (name) #:tostring person->string)\\n(struct writer person (books) #:tostring writer->string)\\n(struct father person (children) #:tostring father->string)\\n\\n(define simon (writer \\\"Simon\\\" '(my-life my-wife my-bike)))\\n(define elvis (person \\\"Elvis\\\"))\\n(define papa (father \\\"papa\\\" (list simon elvis)))\\n\\n(local-put-value 'simon simon \\\"objects.dat\\\")\\n📕 local-db: local-put:unknown store : \\\"objects.dat\\\"\\n;; forgot to create the store. Create it :\\n(local-make-store \\\"objects.dat\\\") → \\\"objects.dat\\\"\\n\\n(local-put-value 'simon simon \\\"objects.dat\\\")\\n(local-put-value 'elvis elvis \\\"objects.dat\\\")\\n(local-put-value 'papa papa \\\"objects.dat\\\")\\n\\n;; inspect\\nsimon → Simon: writer of (my-life my-wife my-bike).\\npapa → papa: father of (Simon Elvis).\\nelvis → Elvis : person.\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \";; reboot (close the browser window)\\n; inspect objects.dat :\\n(local-keys 'objects.dat) → (\\\"elvis\\\" \\\"papa\\\" \\\"simon\\\")\\n\\n(define simon (local-get-value 'simon \\\"objects.dat\\\"))\\n(define elvis (local-get-value 'elvis \\\"objects.dat\\\"))\\n(define papa (local-get-value 'papa \\\"objects.dat\\\"))\\n\\n; data are restored\\nsimon → Simon: writer of (my-life my-wife my-bike).\\npapa → papa: father of (Simon Elvis).\\n\\n;; check if references (pointers) are restored\\n(set-writer-name! simon \\\"Antoinette\\\") → \\\"Antoinette\\\"\\nsimon→ Antoinette: writer of (my-life my-wife my-bike).\\n\\n;; inspect\\npapa → papa: father of (Antoinette Elvis). ; YES 😳 !\\n\\n;; - Self-referencing (EchoLisp version 2.11)\\n;; add 'papa' to the chidren of 'papa' - whatever this means - and print it :\\n(set-father-children! papa (list simon papa elvis))\\npapa → papa: father of (Antoinette papa Elvis).\\n\\n; save/restore\\n(local-put-value 'papa papa \\\"objects.dat\\\")\\n(define papa (local-get-value 'papa \\\"objects.dat\\\"))\\npapa → papa: father of (Antoinette papa Elvis).\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"-module( object_serialization ).\\n\\n-export( [task/0] ).\\n\\n-record( entity, {name, date} ).\\n-record( person, {entity, email} ).\\n\\ntask() ->\\n\\tPerson = #person{entity=#entity{name=\\\"Cletus\\\", date=20080808}, email=\\\"test+1@localhost.localdomain\\\"},\\n\\tprint( Person ),\\n\\tEntity = #entity{name=\\\"Entity\\\", date=20111111},\\n\\tprint( Entity ),\\n\\tok = file:write_file( \\\"objects.dat\\\", erlang:term_to_binary([Person, Entity]) ),\\n\\t{ok, Binary} = file:read_file( \\\"objects.dat\\\" ),\\n\\t[New_person, New_entity] = erlang:binary_to_term( Binary ),\\n\\tio:fwrite( \\\"Deserialized\\\\n\\\" ),\\n\\tprint( New_person ),\\n\\tprint( New_entity ).\\n\\t\\n\\n\\nprint( #entity{name=Name, date=Date} ) ->\\n\\tio:fwrite( \\\"Entity: \\\" ),\\n\\tio:fwrite( \\\"name: ~p, date: ~p~n\\\", [Name, Date] );\\nprint( #person{entity=Entity, email=Email} ) ->\\n\\tio:fwrite( \\\"Person: \\\" ),\\n\\tprint( Entity ),\\n\\tio:fwrite( \\\"\\\\temail: ~p~n\\\", [Email] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"USING: accessors combinators.extras io io.encodings.binary\\nio.files io.files.info kernel prettyprint serialize ;\\nIN: rosetta-code.object-serialization\\n\\n! Define two classes, item and armor. armor is a subclass of\\n! item.\\n\\nTUPLE: item name value ;\\nTUPLE: armor < item physical-resistance fire-resistance ;\\n\\n! Define boa constructors for both classes using C: shorthand.\\n! boa means By Order of Arguments, and yes, this is a pun on boa\\n! constrictors.\\n\\nC: <item> item\\nC: <armor> armor\\n\\n! Create three example items and print them out\\n! non-destructively.\\n\\n\\\"Fish scales\\\" 0.05 <item>\\n\\\"Gold piece\\\" 1 <item>\\n\\\"Breastplate of Ashannar\\\" 50,000 55 30 <armor>\\n[ [ . ] keep ] tri@ nl\\n\\n! Serialize the three objects to a binary file named\\n! objects.dat.\\n\\n\\\"Serializing objects to objects.dat . . . \\\" print\\n\\\"objects.dat\\\" binary [ [ serialize ] tri@ ] with-file-writer\\n\\n! Check that objects.dat exists.\\n\\n\\\"objects.dat exists? \\\" write \\\"objects.dat\\\" exists? .\\n\\\"Size on disk: \\\" write \\\"objects.dat\\\" file-info size>> pprint\\n\\\" bytes\\\" print nl\\n\\n! Deserialize three objects from objects.dat.\\n\\n\\\"Deserializing objects from objects.dat . . . \\\" print nl\\n\\\"objects.dat\\\" binary [ [ deserialize ] thrice ] with-file-reader\\n\\n! Print out deserialized objects.\\n\\n[ . ] tri@\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Type Person\\n nombre As String\\n edad As Integer\\nEnd Type\\n\\nSub PrintPerson(p As Person)\\n Print \\\"Name: \\\"; p.nombre\\n Print \\\"Age: \\\"; p.edad\\nEnd Sub\\n\\nSub Serialize(p As Person, filename As String)\\n Open filename For Binary As #1\\n Put #1, , p.nombre\\n Put #1, , p.edad\\n Close #1\\nEnd Sub\\n\\nSub Deserialize(p As Person, filename As String)\\n Open filename For Binary As #1\\n Get #1, , p.nombre\\n Get #1, , p.edad\\n Close #1\\nEnd Sub\\n\\nDim pp As Person\\npp.nombre = \\\"Juan Hdez.\\\"\\npp.edad = 52\\n\\nSerialize(pp, \\\"objects.dat\\\")\\nDeserialize(pp, \\\"objects.dat\\\")\\n\\nPrintPerson(pp)\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"encoding/gob\\\"\\n \\\"fmt\\\"\\n \\\"os\\\"\\n)\\n\\ntype printable interface {\\n print()\\n}\\n\\nfunc main() {\\n // create instances\\n animals := []printable{\\n &Animal{Alive: true},\\n &Cat{},\\n &Lab{\\n Dog: Dog{Animal: Animal{Alive: true}},\\n Color: \\\"yellow\\\",\\n },\\n &Collie{Dog: Dog{\\n Animal: Animal{Alive: true},\\n ObedienceTrained: true,\\n }},\\n }\\n\\n // display\\n fmt.Println(\\\"created:\\\")\\n for _, a := range animals {\\n a.print()\\n }\\n\\n // serialize\\n f, err := os.Create(\\\"objects.dat\\\")\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n for _, a := range animals {\\n gob.Register(a)\\n }\\n err = gob.NewEncoder(f).Encode(animals)\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n f.Close()\\n\\n // read\\n f, err = os.Open(\\\"objects.dat\\\")\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n var clones []printable\\n gob.NewDecoder(f).Decode(&clones)\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n\\n // display\\n fmt.Println(\\\"\\\\nloaded from objects.dat:\\\")\\n for _, c := range clones {\\n c.print()\\n }\\n}\\n\\ntype Animal struct {\\n Alive bool\\n}\\n\\nfunc (a *Animal) print() {\\n if a.Alive {\\n fmt.Println(\\\" live animal, unspecified type\\\")\\n } else {\\n fmt.Println(\\\" dead animal, unspecified type\\\")\\n }\\n}\\n\\ntype Dog struct {\\n Animal\\n ObedienceTrained bool\\n}\\n\\nfunc (d *Dog) print() {\\n switch {\\n case !d.Alive:\\n fmt.Println(\\\" dead dog\\\")\\n case d.ObedienceTrained:\\n fmt.Println(\\\" trained dog\\\")\\n default:\\n fmt.Println(\\\" dog, not trained\\\")\\n }\\n}\\n\\ntype Cat struct {\\n Animal\\n LitterBoxTrained bool\\n}\\n\\nfunc (c *Cat) print() {\\n switch {\\n case !c.Alive:\\n fmt.Println(\\\" dead cat\\\")\\n case c.LitterBoxTrained:\\n fmt.Println(\\\" litter box trained cat\\\")\\n default:\\n fmt.Println(\\\" cat, not litter box trained\\\")\\n }\\n}\\n\\ntype Lab struct {\\n Dog\\n Color string\\n}\\n\\nfunc (l *Lab) print() {\\n var r string\\n if l.Color == \\\"\\\" {\\n r = \\\"lab, color unspecified\\\"\\n } else {\\n r = l.Color + \\\" lab\\\"\\n }\\n switch {\\n case !l.Alive:\\n fmt.Println(\\\" dead\\\", r)\\n case l.ObedienceTrained:\\n fmt.Println(\\\" trained\\\", r)\\n default:\\n fmt.Printf(\\\" %s, not trained\\\\n\\\", r)\\n }\\n}\\n\\ntype Collie struct {\\n Dog\\n CatchesFrisbee bool\\n}\\n\\nfunc (c *Collie) print() {\\n switch {\\n case !c.Alive:\\n fmt.Println(\\\" dead collie\\\")\\n case c.ObedienceTrained && c.CatchesFrisbee:\\n fmt.Println(\\\" trained collie, catches frisbee\\\")\\n case c.ObedienceTrained && !c.CatchesFrisbee:\\n fmt.Println(\\\" trained collie, but doesn't catch frisbee\\\")\\n case !c.ObedienceTrained && c.CatchesFrisbee:\\n fmt.Println(\\\" collie, not trained, but catches frisbee\\\")\\n case !c.ObedienceTrained && !c.CatchesFrisbee:\\n fmt.Println(\\\" collie, not trained, doesn't catch frisbee\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class Entity implements Serializable {\\n static final serialVersionUID = 3504465751164822571L\\n String name = 'Thingamabob'\\n public String toString() { return name }\\n}\\n\\nclass Person extends Entity implements Serializable {\\n static final serialVersionUID = -9170445713373959735L\\n Person() { name = 'Clement' }\\n Person(name) { this.name = name }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"File objectStore = new File('objectStore.ser')\\nif (objectStore.exists()) { objectStore.delete() }\\nassert ! objectStore.exists()\\ndef os\\ntry {\\n os = objectStore.newObjectOutputStream()\\n os << new Person()\\n os << 10.5\\n os << new Person('Cletus')\\n os << new Date()\\n os << new Person('Pious')\\n os << java.awt.Color.RED\\n os << new Person('Linus')\\n os << 'just random garbage'\\n os << new Person('Lucy')\\n os << ['lists', 'are', 'serializable']\\n os << new Person('Schroeder')\\n} catch (e) { throw new Exception(e) } finally { os?.close() }\\nassert objectStore.exists()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def is\\ntry {\\n is = objectStore.newObjectInputStream(this.class.classLoader)\\n is.eachObject { println it }\\n} catch (e) { throw new Exception(e) } finally { is?.close() }\\n\\nobjectStore.delete()\\nassert ! objectStore.exists()\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"{-# LANGUAGE DeriveGeneric #-}\\n\\nmodule Main (main) where\\n\\nimport qualified Data.ByteString.Lazy as ByteString (readFile, writeFile)\\nimport Data.Binary (Binary)\\nimport qualified Data.Binary as Binary (decode, encode)\\nimport GHC.Generics (Generic)\\n\\ndata Employee =\\n Manager String String\\n | IndividualContributor String String\\n deriving (Generic, Show)\\ninstance Binary Employee\\n\\nmain :: IO ()\\nmain = do\\n ByteString.writeFile \\\"objects.dat\\\" $ Binary.encode\\n [ IndividualContributor \\\"John Doe\\\" \\\"Sales\\\"\\n , Manager \\\"Jane Doe\\\" \\\"Engineering\\\"\\n ]\\n\\n bytes <- ByteString.readFile \\\"objects.dat\\\"\\n let employees = Binary.decode bytes\\n print (employees :: [Employee])\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"(var object {:a 1 :b \\\"Hello, world!\\\" [1 2 3] :c}\\n serialised (str object)\\n deserialised (safe-eval serialised))\\n\\n(print \\\"Object: \\\" object)\\n(print \\\"Serialised: \\\" serialised)\\n(str \\\"Deserialised: \\\" deserialised)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"lin_z_=:5!:5\\nserializeObject=:3 :0\\n p=. copath y\\n d=. ;LF;\\\"1(,'=:';lin__y)\\\"0 nl__y i.4\\n '(',(5!:5<'p'),')(copath[cocurrent@])cocreate ''''',,d,LF\\n)\\n\\ndeserializeObject=:3 :0\\n o=.conl 1\\n 0!:100 y\\n (conl 1)-.o\\n)\\n\\ncoclass'room'\\n create=:3 :'size=:y'\\n print=:3 :'''room size '',\\\":size'\\n\\ncoclass'kitchen'\\n coinsert'room'\\n print=:3 :'''kitchen size '',\\\":size'\\n\\ncoclass'kitchenWithSink'\\n coinsert'kitchen'\\n print=:3 :'''kitchen with sink size '',\\\":size'\\n\\ncocurrent'base'\\n\\nR=:'small' conew 'room'\\nK=:'medium' conew 'kitchen'\\nS=:'large' conew 'kitchenWithSink'\\nprint__R''\\nprint__K''\\nprint__S''\\n\\n\\n(;<@serializeObject\\\"0 R,K,S) 1!:2 <'objects.dat'\\n\\n'r1 k1 s1'=: <\\\"0 deserializeObject 1!:1<'objects.dat'\\nprint__r1''\\nprint__k1''\\nprint__s1''\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" print__R''\\nroom size small\\n print__K''\\nkitchen size medium\\n print__S''\\nkitchen with sink size large\\n\\n\\n (;<@serializeObject\\\"0 R,K,S) 1!:2 <'objects.dat'\\n\\n 'r1 k1 s1'=: <\\\"0 deserializeObject 1!:1<'objects.dat'\\n print__r1''\\nroom size small\\n print__k1''\\nkitchen size medium\\n print__s1''\\nkitchen with sink size large\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.*;\\n\\n// classes must implement java.io.Serializable in order to be serializable\\nclass Entity implements Serializable {\\n // it is recommended to hard-code serialVersionUID so changes to class\\n // will not invalidate previously serialized objects\\n static final long serialVersionUID = 3504465751164822571L;\\n String name = \\\"Entity\\\";\\n public String toString() { return name; }\\n}\\n\\nclass Person extends Entity implements Serializable {\\n static final long serialVersionUID = -9170445713373959735L;\\n Person() { name = \\\"Cletus\\\"; }\\n}\\n\\npublic class SerializationTest {\\n public static void main(String[] args) {\\n Person instance1 = new Person();\\n System.out.println(instance1);\\n\\n Entity instance2 = new Entity();\\n System.out.println(instance2);\\n\\n // Serialize\\n try {\\n ObjectOutput out = new ObjectOutputStream(new FileOutputStream(\\\"objects.dat\\\")); // open ObjectOutputStream\\n\\n out.writeObject(instance1); // serialize \\\"instance1\\\" and \\\"instance2\\\" to \\\"out\\\"\\n out.writeObject(instance2);\\n out.close();\\n System.out.println(\\\"Serialized...\\\");\\n } catch (IOException e) {\\n System.err.println(\\\"Something screwed up while serializing\\\");\\n e.printStackTrace();\\n System.exit(1);\\n }\\n\\n // Deserialize\\n try {\\n ObjectInput in = new ObjectInputStream(new FileInputStream(\\\"objects.dat\\\")); // open ObjectInputStream\\n\\n Object readObject1 = in.readObject(); // read two objects from \\\"in\\\"\\n Object readObject2 = in.readObject(); // you may want to cast them to the appropriate types\\n in.close();\\n System.out.println(\\\"Deserialized...\\\");\\n\\n System.out.println(readObject1);\\n System.out.println(readObject2);\\n } catch (IOException e) {\\n System.err.println(\\\"Something screwed up while deserializing\\\");\\n e.printStackTrace();\\n System.exit(1);\\n } catch (ClassNotFoundException e) {\\n System.err.println(\\\"Unknown class for deserialized object\\\");\\n e.printStackTrace();\\n System.exit(1);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"abstract type Hello end\\n\\nstruct HelloWorld <: Hello\\n name::String\\n HelloWorld(s) = new(s)\\nend\\n\\nstruct HelloTime <: Hello\\n name::String\\n tnew::DateTime\\n HelloTime(s) = new(s, now())\\nend\\n\\nsayhello(hlo) = println(\\\"Hello to this world, $(hlo.name)!\\\")\\n\\nsayhello(hlo::HelloTime) = println(\\\"It is now $(now()). Hello from back in $(hlo.tnew), $(hlo.name)!\\\")\\n\\nh1 = HelloWorld(\\\"world\\\")\\nh2 = HelloTime(\\\"new world\\\")\\n\\nsayhello(h1)\\nsayhello(h2)\\n\\nfh = open(\\\"objects.dat\\\", \\\"w\\\")\\nserialize(fh, h1)\\nserialize(fh,h2)\\nclose(fh)\\n\\nsleep(10)\\n\\nfh = open(\\\"objects.dat\\\", \\\"r\\\")\\nhh1 = deserialize(fh)\\nhh2 = deserialize(fh)\\nclose(fh)\\n\\nsayhello(hh1)\\nsayhello(hh2)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.0\\n\\nimport java.io.*\\n\\nopen class Entity(val name: String = \\\"Entity\\\"): Serializable {\\n override fun toString() = name\\n\\n companion object {\\n val serialVersionUID = 3504465751164822571L\\n }\\n}\\n\\nclass Person(name: String = \\\"Brian\\\"): Entity(name), Serializable {\\n companion object {\\n val serialVersionUID = -9170445713373959735L\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val instance1 = Person()\\n println(instance1)\\n\\n val instance2 = Entity()\\n println(instance2)\\n\\n // serialize\\n try {\\n val out = ObjectOutputStream(FileOutputStream(\\\"objects.dat\\\"))\\n out.writeObject(instance1)\\n out.writeObject(instance2)\\n out.close()\\n println(\\\"Serialized...\\\")\\n }\\n catch (e: IOException) {\\n println(\\\"Error occurred whilst serializing\\\")\\n System.exit(1)\\n }\\n\\n // deserialize\\n try {\\n val inp = ObjectInputStream(FileInputStream(\\\"objects.dat\\\"))\\n val readObject1 = inp.readObject()\\n val readObject2 = inp.readObject()\\n inp.close()\\n println(\\\"Deserialized...\\\")\\n println(readObject1)\\n println(readObject2)\\n }\\n catch (e: IOException) {\\n println(\\\"Error occurred whilst deserializing\\\")\\n System.exit(1)\\n }\\n catch (e: ClassNotFoundException) {\\n println(\\\"Unknown class for deserialized object\\\")\\n System.exit(1)\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"/* Object serialization, in Neko */\\n\\nvar file_open = $loader.loadprim(\\\"std@file_open\\\", 2)\\nvar file_write = $loader.loadprim(\\\"std@file_write\\\", 4)\\nvar file_read = $loader.loadprim(\\\"std@file_read\\\", 4)\\nvar file_close = $loader.loadprim(\\\"std@file_close\\\", 1)\\n\\nvar serialize = $loader.loadprim(\\\"std@serialize\\\", 1)\\nvar unserialize = $loader.loadprim(\\\"std@unserialize\\\", 2)\\n\\n/* Inheritance by prototype */\\nproto = $new(null)\\nproto.print = function () { $print(this, \\\"\\\\n\\\") }\\n\\nobj = $new(null)\\nobj.msg = \\\"Hello\\\"\\nobj.dest = $array(\\\"Town\\\", \\\"Country\\\", \\\"World\\\")\\n\\n$objsetproto(obj, proto)\\n$print(\\\"Original:\\\\n\\\")\\nobj.print()\\n\\n/* Serialize the object */\\nvar thing = serialize(obj)\\nvar len = $ssize(thing)\\n\\n/* To disk */\\nvar f = file_open(\\\"object-serialization.bin\\\", \\\"w\\\")\\nfile_write(f, thing, 0, len)\\nfile_close(f)\\n\\n/* Load the binary data into a new string space */\\nf = file_open(\\\"object-serialization.bin\\\", \\\"r\\\")\\nvar buff = $smake(len)\\nfile_read(f, buff, 0, len)\\nfile_close(f)\\n\\n/* Unserialize the object into a new variable */\\nvar other = unserialize(buff, $loader)\\n$print(\\\"deserialized:\\\\n\\\")\\nother.print()\\n\",\n \"language\": \"Neko\"\n },\n {\n \"code\": \"import marshal, streams\\n\\ntype\\n Base = object of RootObj\\n name: string\\n Descendant = object of Base\\nproc newBase(): Base = Base(name: \\\"base\\\")\\nproc newDescendant(): Descendant = Descendant(name: \\\"descend\\\")\\nproc print(obj: Base) =\\n echo(obj.name)\\n\\nvar\\n base = newBase()\\n descendant = newDescendant()\\nprint(base)\\nprint(descendant)\\n\\nvar strm = newFileStream(\\\"objects.dat\\\", fmWrite)\\nstore(strm, (base, descendant))\\nstrm.close()\\n\\nvar t: (Base, Descendant)\\nload(newFileStream(\\\"objects.dat\\\", fmRead), t)\\nprint(t[0])\\nprint(t[1])\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Thingy {\\n @id : Int;\\n\\n New(id : Int) {\\n @id := id;\\n }\\n\\n method : public : Print() ~ Nil {\\n @id->PrintLine();\\n }\\n }\\n\\n class Person from Thingy {\\n @name : String;\\n\\n New(id : Int, name : String) {\\n Parent(id);\\n @name := name;\\n }\\n\\n method : public : Print() ~ Nil {\\n @id->PrintLine();\\n @name->PrintLine();\\n }\\n }\\n\\n class Serial {\\n function : Main(args : String[]) ~ Nil {\\n t := Thingy->New(7);\\n p := Person->New(13, \\\"Bush\\\");\\n\\n s := IO.Serializer->New();\\n s->Write(t->As(Base));\\n s->Write(p->As(Base));\\n\\n writer := IO.FileWriter->New(\\\"objects.dat\\\");\\n writer->WriteBuffer(s->Serialize());\\n writer->Close();\\n\\n buffer := IO.FileReader->ReadBinaryFile(\\\"objects.dat\\\");\\n d := IO.Deserializer->New(buffer);\\n\\n t2 := d->ReadObject()->As(Thingy);\\n t2->Print();\\n p2 := d->ReadObject()->As(Person);\\n p2->Print();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"#import <Foundation/Foundation.h>\\n\\n// a fantasy two level hierarchy\\n@interface Animal : NSObject <NSCoding>\\n{\\n NSString *animalName;\\n int numberOfLegs;\\n}\\n- (instancetype) initWithName: (NSString*)name andLegs: (NSInteger)legs;\\n- (void) dump;\\n@end\\n\\n@implementation Animal\\n- (instancetype) initWithName: (NSString*)name andLegs: (NSInteger)legs\\n{\\n if ((self = [super init])) {\\n animalName = name;\\n numberOfLegs = legs;\\n }\\n return self;\\n}\\n- (void) dump\\n{\\n NSLog(@\\\"%@ has %d legs\\\", animalName, numberOfLegs);\\n}\\n// ========\\n- (void) encodeWithCoder: (NSCoder*)coder\\n{\\n [coder encodeObject: animalName forKey: @\\\"Animal.name\\\"];\\n [coder encodeInt: numberOfLegs forKey: @\\\"Animal.legs\\\"];\\n}\\n- (instancetype) initWithCoder: (NSCoder*)coder\\n{\\n if ((self = [super init])) {\\n animalName = [coder decodeObjectForKey: @\\\"Animal.name\\\"];\\n numberOfLegs = [coder decodeIntForKey: @\\\"Animal.legs\\\"];\\n }\\n return self;\\n}\\n@end\\n\\n@interface Mammal : Animal <NSCoding>\\n{\\n BOOL hasFur;\\n NSMutableArray *eatenList;\\n}\\n- (instancetype) initWithName: (NSString*)name hasFur: (BOOL)fur;\\n- (void) addEatenThing: (NSString*)thing;\\n@end\\n\\n@implementation Mammal\\n- (instancetype) init\\n{\\n if ((self = [super init])) {\\n hasFur = NO;\\n eatenList = [[NSMutableArray alloc] initWithCapacity: 10];\\n }\\n return self;\\n}\\n- (instancetype) initWithName: (NSString*)name hasFur: (BOOL)fur\\n{\\n if ((self = [super initWithName: name andLegs: 4])) {\\n hasFur = fur;\\n eatenList = [[NSMutableArray alloc] initWithCapacity: 10];\\n }\\n return self;\\n}\\n- (void) addEatenThing: (NSString*)thing\\n{\\n [eatenList addObject: thing];\\n}\\n- (void) dump\\n{\\n [super dump];\\n NSLog(@\\\"has fur? %@\\\", (hasFur) ? @\\\"yes\\\" : @\\\"no\\\" );\\n NSLog(@\\\"it has eaten %d things:\\\", [eatenList count]);\\n for ( id element in eatenList )\\n NSLog(@\\\"it has eaten a %@\\\", element);\\n NSLog(@\\\"end of eaten things list\\\");\\n}\\n// ========= de/archiving\\n- (void) encodeWithCoder: (NSCoder*)coder\\n{\\n [super encodeWithCoder: coder];\\n [coder encodeBool: numberOfLegs forKey: @\\\"Mammal.hasFur\\\"];\\n [coder encodeObject: eatenList forKey: @\\\"Mammal.eaten\\\"];\\n}\\n- (instancetype) initWithCoder: (NSCoder*)coder\\n{\\n if ((self = [super initWithCoder: coder])) {\\n hasFur = [coder decodeBoolForKey: @\\\"Mammal.hasFur\\\"];\\n eatenList = [coder decodeObjectForKey: @\\\"Mammal.eaten\\\"];\\n }\\n return self;\\n}\\n@end\\n\\n\\nint main()\\n{\\n @autoreleasepool {\\n\\n // let us create a fantasy animal\\n Animal *anAnimal = [[Animal alloc]\\n\\t initWithName: @\\\"Eptohippos\\\"\\n\\t andLegs: 7\\n\\t ];\\n // for some reason an Eptohippos is not an horse with 7 legs,\\n // and it is not a mammal, of course...\\n\\n // let us create a fantasy mammal (which is an animal too)\\n Mammal *aMammal = [[Mammal alloc]\\n\\t initWithName: @\\\"Mammaluc\\\"\\n\\t hasFur: YES\\n\\t ];\\n // let us add some eaten stuff...\\n [aMammal addEatenThing: @\\\"lamb\\\"];\\n [aMammal addEatenThing: @\\\"table\\\"];\\n [aMammal addEatenThing: @\\\"web page\\\"];\\n\\n // dump anAnimal\\n NSLog(@\\\"----- original Animal -----\\\");\\n [anAnimal dump];\\n\\n // dump aMammal...\\n NSLog(@\\\"----- original Mammal -----\\\");\\n [aMammal dump];\\n\\n // now let us store the objects...\\n NSMutableData *data = [[NSMutableData alloc] init];\\n NSKeyedArchiver *arch = [[NSKeyedArchiver alloc]\\n\\t\\t\\t initForWritingWithMutableData: data];\\n [arch encodeObject: anAnimal forKey: @\\\"Eptohippos\\\"];\\n [arch encodeObject: aMammal forKey: @\\\"Mammaluc\\\"];\\n [arch finishEncoding];\\n [data writeToFile: @\\\"objects.dat\\\" atomically: YES];\\n\\n // now we want to retrieve the saved objects...\\n NSData *ldata = [[NSData alloc]\\n\\t\\t initWithContentsOfFile: @\\\"objects.dat\\\"];\\n NSKeyedUnarchived *darch = [[NSKeyedUnarchiver alloc]\\n\\t initForReadingWithData: ldata];\\n Animal *archivedAnimal = [darch decodeObjectForKey: @\\\"Eptohippos\\\"];\\n Mammal *archivedMammal = [darch decodeObjectForKey: @\\\"Mammaluc\\\"];\\n [darch finishDecoding];\\n\\n // now let's dump/print the objects...\\n NSLog(@\\\"\\\\n\\\");\\n NSLog(@\\\"----- the archived Animal -----\\\");\\n [archivedAnimal dump];\\n NSLog(@\\\"----- the archived Mammal -----\\\");\\n [archivedMammal dump];\\n\\n }\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"type entity = { name : string }\\n\\nlet create_entity () = { name = \\\"Entity\\\" }\\nlet print_entity x = print_endline x.name\\nlet create_person () = { name = \\\"Cletus\\\" }\\n\\nlet instance1 = create_person ()\\nlet instance2 = create_entity ()\\n\\n(* Serialize *)\\nlet out_chan = open_out_bin \\\"objects.dat\\\";;\\noutput_value out_chan instance1;;\\noutput_value out_chan instance2;;\\nclose_out out_chan;;\\n\\n(* Deserialize *)\\nlet in_chan = open_in_bin \\\"objects.dat\\\";;\\nlet result1 : entity = input_value in_chan;;\\nlet result2 : entity = input_value in_chan;;\\nclose_in in_chan;;\\n\\nprint_entity result1;;\\nprint_entity result2;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"$ ol\\nWelcome to Otus Lisp 1.2,\\ntype ',help' to help, ',quit' to end session.\\n> (define Object (tuple\\n '(1 2 3 4) ; list\\n #(4 3 2 1) ; bytevector\\n \\\"hello\\\" ; ansi string\\n \\\"こんにちは\\\" ; unicode string\\n (list->ff '(; associative array\\n (1 . 123456)\\n (2 . second)\\n (3 . \\\"-th-\\\")))\\n {(4 . 'sym) ; alternatively declared..\\n (5 . +)} ; ..associative array\\n #false ; value\\n -123 ; short number\\n 123456789012345678901234567890123456789 ; long number\\n)\\n;; Defined Object\\n#((1 2 3 4) #(4 3 2 1) hello こんにちは #ff((1 . 123456) (2 . second) (3 . -th-))\\n#ff((4 . sym) (5 . #<function>)) #false -123\\n123456789012345678901234567890123456789)\\n\\n> (fasl-save Object \\\"/tmp/object.bin\\\")\\n#true\\n\\n> (define New (fasl-load \\\"/tmp/object.bin\\\" #false))\\n;; Defined New\\n#((1 2 3 4) #(4 3 2 1) hello こんにちは #ff((1 . 123456) (2 . second) (3 . -th-))\\n#ff((4 . sym) (5 . #<function>)) #false -123\\n123456789012345678901234567890123456789)\\n\\n> (equal? Object New)\\n#true\\n\\n> ,quit\\nbye-bye :/\\n$\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"{\\n package Greeting;\\n sub new {\\n my $v = \\\"Hello world!\\\\n\\\";\\n bless \\\\$v, shift;\\n };\\n sub stringify {\\n ${shift()};\\n };\\n};\\n{\\n package Son::of::Greeting;\\n use base qw(Greeting); # inherit methods\\n sub new { # overwrite method of super class\\n my $v = \\\"Hello world from Junior!\\\\n\\\";\\n bless \\\\$v, shift;\\n };\\n};\\n{\\n use Storable qw(store retrieve);\\n package main;\\n my $g1 = Greeting->new;\\n my $s1 = Son::of::Greeting->new;\\n print $g1->stringify;\\n print $s1->stringify;\\n\\n store $g1, 'objects.dat';\\n my $g2 = retrieve 'objects.dat';\\n\\n store $s1, 'objects.dat';\\n my $s2 = retrieve 'objects.dat';\\n\\n print $g2->stringify;\\n print $s2->stringify;\\n};\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use MooseX::Declare;\\n\\nclass Greeting {\\n use MooseX::Storage;\\n with Storage('format' => 'JSON', io => 'File');\\n has string => (is => 'ro', default => \\\"Hello world!\\\\n\\\");\\n}\\nclass Son::Of::Greeting extends Greeting {\\n has string => (is => 'ro', default => \\\"Hello from Junior!\\\\n\\\");\\n}\\n\\nmy $g1 = Greeting->new;\\nmy $s1 = Son::Of::Greeting->new;\\n\\nprint $g1->string;\\nprint $s1->string;\\n\\n$g1->store('object1.json');\\nmy $g2 = Greeting->load('object1.json');\\n\\n$s1->store('object2.json');\\nmy $s2 = Son::Of::Greeting->load('object2.json');\\n\\nprint $g2->string;\\nprint $s2->string;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #008000;\\\">\\\"builtins/serialize.e\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">randobj</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- test function (generate some random garbage)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)<=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- make sequence[1..3]</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">randobj</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)<=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- make string</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'A'</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- half int/half float</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">o1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">randobj</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">o2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">randobj</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">o3</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">randobj</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">o1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">o2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">o3</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fh</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"objects.dat\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"wb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">serialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o1</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">serialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">serialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o3</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"===\\\"</span>\\n\\n <span style=\\\"color: #000000;\\\">fh</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"objects.dat\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"rb\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">deserialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">deserialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">deserialize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">delete_file</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"objects.dat\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"$myObj = new Object();\\n$serializedObj = serialize($myObj);\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(class +Point)\\n# x y\\n\\n(dm T (X Y)\\n (=: x (or X 0))\\n (=: y (or Y 0)) )\\n\\n(dm print> ()\\n (prinl \\\"Point \\\" (: x) \\\",\\\" (: y)) )\\n\\n(class +Circle +Point)\\n# r\\n\\n(dm T (X Y R)\\n (super X Y)\\n (=: r (or R 0)) )\\n\\n(dm print> ()\\n (prinl \\\"Circle \\\" (: x) \\\",\\\" (: y) \\\",\\\" (: r)) )\\n\\n(setq\\n P (new '(+Point) 3 4)\\n C (new '(+Circle) 10 10 5) )\\n\\n(print> P)\\n(print> C)\\n\\n(out \\\"objects.dat\\\"\\n (pr (val P) (getl P))\\n (pr (val C) (getl C)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(in \\\"objects.dat\\\"\\n (putl (setq A (box (rd))) (rd))\\n (putl (setq B (box (rd))) (rd)) )\\n\\n(print> A)\\n(print> B)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"# Object Serialization in Python\\n# serialization in python is accomplished via the Pickle module.\\n# Alternatively, one can use the cPickle module if speed is the key,\\n# everything else in this example remains the same.\\n\\nimport pickle\\n\\nclass Entity:\\n\\tdef __init__(self):\\n\\t\\tself.name = \\\"Entity\\\"\\n\\tdef printName(self):\\n\\t\\tprint self.name\\n\\nclass Person(Entity): #OldMan inherits from Entity\\n\\tdef __init__(self): #override constructor\\n\\t\\tself.name = \\\"Cletus\\\"\\n\\ninstance1 = Person()\\ninstance1.printName()\\n\\ninstance2 = Entity()\\ninstance2.printName()\\n\\ntarget = file(\\\"objects.dat\\\", \\\"w\\\") # open file\\n\\n# Serialize\\npickle.dump((instance1, instance2), target) # serialize `instance1` and `instance2`to `target`\\ntarget.close() # flush file stream\\nprint \\\"Serialized...\\\"\\n\\n# Unserialize\\ntarget = file(\\\"objects.dat\\\") # load again\\ni1, i2 = pickle.load(target)\\nprint \\\"Unserialized...\\\"\\n\\ni1.printName()\\ni2.printName()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"(require racket/serialize)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang racket\\n;; Object Serialization: Tim Brown, Oct. 2014\\n(require racket/serialize)\\n\\n(define (join-person-name-list persons)\\n (string-join (map (λ (c) (send c ->string)) persons) \\\", \\\"))\\n\\n(define-serializable-class person% object%\\n (init-field name [siblings null])\\n (define/public (->string #:show (show null))\\n (cond\\n [(and (member 'siblings show) (not (null? siblings)))\\n (format \\\"~a (~a)\\\" name (join-person-name-list siblings))]\\n [else name]))\\n (super-new))\\n\\n(define-serializable-class parent% person%\\n (init-field [children null])\\n (define/override (->string #:show (show null))\\n (cond\\n [(and (member 'children show) (not (null? children)))\\n (format \\\"~a [~a]\\\" (super ->string #:show show) (join-person-name-list children))]\\n [else (super ->string #:show show)]))\\n (super-new))\\n\\n;; horribly out of fashion and probaly no longer PC\\n(define-serializable-class nuclear-family% object%\\n (init-field father mother children)\\n (define/public (->string)\\n (string-append\\n (format \\\"~a + ~a -> \\\" (send father ->string) (send mother ->string))\\n (format \\\"~a\\\" (join-person-name-list children))))\\n (super-new))\\n\\n;; =| TESTS |=========================================================================================\\n(define jack (new person% [name \\\"Jack\\\"]))\\n(define joan (new person% [name \\\"Joan\\\"]))\\n(set-field! siblings jack (list joan))\\n(set-field! siblings joan (list jack))\\n(define the-kids (list jack joan))\\n(define john (new parent% [name \\\"John\\\"] [children the-kids]))\\n(define jane (new parent% [name \\\"Jane\\\"] [children the-kids]))\\n\\n(define the-family\\n (new nuclear-family% [father john] [mother jane] [children the-kids]))\\n\\n(define (duplicate-object-through-file o f-name)\\n (with-output-to-file f-name #:exists 'replace (λ () (write (serialize o))))\\n (with-input-from-file f-name (λ () (deserialize (read)))))\\n\\n(define cloned-family (duplicate-object-through-file the-family \\\"objects.dat\\\"))\\n\\n(printf \\\"The original family:\\\\t~a~%\\\" (send the-family ->string))\\n(printf \\\"The cloned family:\\\\t~a~%~%\\\" (send cloned-family ->string))\\n(printf \\\"objects.dat contains ----~%~a~%-------------------~%~%\\\" (file->string \\\"objects.dat\\\"))\\n(printf \\\"Clones are different?~%\\\")\\n(define cloned-jack (first (get-field children cloned-family)))\\n(set-field! name cloned-jack \\\"JACK\\\")\\n(printf \\\"Jack's name is:\\\\t~s~%\\\" (get-field name jack))\\n(printf \\\"Clone's name is:\\\\t~s~%~%\\\" (get-field name cloned-jack))\\n(printf \\\"Relationships are maintained?~%\\\")\\n(define cloned-joan (second (get-field children cloned-family)))\\n(printf \\\"Joan's description with siblings:\\\\t~s~%\\\" (send joan ->string #:show '(siblings)))\\n(printf \\\"Clone's description with siblings:\\\\t~s~%~%\\\"\\n (send cloned-joan ->string #:show '(siblings)))\\n(printf \\\"After Jack's renaming the cloned family is: ~a~%~%\\\" (send cloned-family ->string))\\n(printf \\\"Various descriptions of cloned John:~%\\\")\\n(define cloned-john (get-field father cloned-family))\\n(printf \\\"Just the name:\\\\t~s~%\\\" (send cloned-john ->string))\\n(printf \\\"With siblings:\\\\t~s (he hasn't any)~%\\\" (send cloned-john ->string #:show '(siblings)))\\n(printf \\\"With children:\\\\t~s~%\\\" (send cloned-john ->string #:show '(children)))\\n(printf \\\"With both:\\\\t~s~%\\\" (send cloned-john ->string #:show '(siblings children)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# Reference:\\n# https://docs.raku.org/language/classtut\\n# https://github.com/teodozjan/perl-store\\n\\nuse v6;\\nuse PerlStore::FileStore;\\n\\nclass Point {\\n has Int $.x;\\n has Int $.y;\\n}\\n\\nclass Rectangle does FileStore {\\n has Point $.lower;\\n has Point $.upper;\\n\\n method area() returns Int {\\n ($!upper.x - $!lower.x) * ( $!upper.y - $!lower.y);\\n }\\n}\\n\\nmy $r1 = Rectangle.new(lower => Point.new(x => 0, y => 0),\\n upper => Point.new(x => 10, y => 10));\\nsay \\\"Create Rectangle1 with area \\\",$r1.area();\\nsay \\\"Serialize Rectangle1 to object.dat\\\";\\n$r1.to_file('./objects.dat');\\nsay \\\"\\\";\\nsay \\\"take a peek on object.dat ..\\\";\\nsay slurp \\\"./objects.dat\\\";\\nsay \\\"\\\";\\nsay \\\"Deserialize to Rectangle2\\\";\\nmy $r2 = from_file('objects.dat');\\nsay \\\"Rectangle2 is of type \\\", $r2.WHAT;\\nsay \\\"Rectangle2 area is \\\", $r2.area();\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"class Being\\n def initialize(specialty=nil)\\n @specialty=specialty\\n end\\n def to_s\\n \\\"(object_id = #{object_id})\\\\n\\\"+\\\"(#{self.class}):\\\".ljust(12)+to_s4Being+(@specialty ? \\\"\\\\n\\\"+\\\" \\\"*12+@specialty : \\\"\\\")\\n end\\n def to_s4Being\\n \\\"I am a collection of cooperative molecules with a talent for self-preservation.\\\"\\n end\\nend\\n\\nclass Earthling < Being\\n def to_s4Being\\n \\\"I originate from a blue planet.\\\\n\\\"+\\\" \\\"*12+to_s4Earthling\\n end\\nend\\n\\nclass Mammal < Earthling\\n def initialize(type)\\n @type=type\\n end\\n def to_s4Earthling\\n \\\"I am champion in taking care of my offspring and eating everything I can find, except mammals of type #{@type}.\\\"\\n end\\nend\\n\\nclass Fish < Earthling\\n def initialize(iq)\\n @iq=(iq>1 ? :instrustableValue : iq)\\n end\\n def to_s4Earthling\\n \\\"Although I think I can think, I can't resist biting in hooks.\\\"\\n end\\nend\\n\\nclass Moonling < Being\\n def to_s4Being\\n \\\"My name is Janneke Maan, and apparently some Earthlings will pay me a visit.\\\"\\n end\\nend\\n\\ndiverseCollection=[]\\ndiverseCollection << (marsian=Being.new(\\\"I come from Mars and like playing hide and seek.\\\"))\\ndiverseCollection << (me=Mammal.new(:human))\\ndiverseCollection << (nemo=Fish.new(0.99))\\ndiverseCollection << (jannakeMaan=Moonling.new)\\n\\nputs \\\"BEGIN ORIGINAL DIVERSE COLLECTION\\\"\\ndiverseCollection.each do |being|\\n puts \\\"\\\",being.to_s\\nend\\nputs \\\"END ORIGINAL DIVERSE COLLECTION\\\"\\nputs \\\"\\\\n\\\"+\\\"*\\\"*50+\\\"\\\\n\\\\n\\\"\\n\\n#Marshal the diverse Array of beings\\nFile.open('diverseCollection.bin','w') do |fo|\\n fo << Marshal.dump(diverseCollection)\\nend\\n\\n#load the Array of diverse beings\\nsameDiverseCollection=Marshal.load(File.read('diverseCollection.bin'))\\n\\nputs \\\"BEGIN LOADED DIVERSE COLLECTION\\\"\\nputs(\\n sameDiverseCollection.collect do |being|\\n being.to_s\\n end.join(\\\"\\\\n\\\\n\\\")\\n )\\nputs \\\"END LOADED DIVERSE COLLECTION\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"serde = { version = \\\"1.0.89\\\", features = [\\\"derive\\\"] }\\nbincode = \\\"1.1.2\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use std::fmt;\\n\\nuse bincode::{deserialize, serialize};\\nuse serde::{Deserialize, Serialize};\\n\\n#[derive(Debug, Serialize, Deserialize)]\\nenum Animal {\\n Dog { name: String, color: String },\\n Bird { name: String, wingspan: u8 },\\n}\\n\\nimpl fmt::Display for Animal {\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n match self {\\n Animal::Dog { name, color } => write!(f, \\\"{} is a dog with {} fur\\\", name, color),\\n Animal::Bird { name, wingspan } => {\\n write!(f, \\\"{} is a bird with a wingspan of {}\\\", name, wingspan)\\n }\\n }\\n }\\n}\\n\\nfn main() -> bincode::Result<()> {\\n let animals = vec![\\n Animal::Dog {\\n name: \\\"Rover\\\".into(),\\n color: \\\"brown\\\".into(),\\n },\\n Animal::Bird {\\n name: \\\"Tweety\\\".into(),\\n wingspan: 3,\\n },\\n ];\\n\\n for animal in &animals {\\n println!(\\\"{}\\\", animal);\\n }\\n\\n let serialized = serialize(&animals)?;\\n\\n println!(\\\"Serialized into {} bytes\\\", serialized.len());\\n\\n let deserialized: Vec<Animal> = deserialize(&serialized)?;\\n\\n println!(\\\"{:#?}\\\", deserialized);\\n\\n Ok(())\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"serde = { version = \\\"1.0.89\\\", features = [\\\"derive\\\"] }\\nbincode = \\\"1.1.2\\\"\\ntypetag = \\\"0.1.1\\\"\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"use std::fmt::{self, Debug, Display};\\n\\nuse bincode::{deserialize, serialize};\\nuse serde::{Deserialize, Serialize};\\n\\n#[typetag::serde(tag = \\\"animal\\\")]\\ntrait Animal: Display + Debug {\\n fn name(&self) -> Option<&str>;\\n fn feet(&self) -> u32;\\n}\\n\\n#[derive(Debug, Deserialize, Serialize)]\\nstruct Dog {\\n name: String,\\n color: String,\\n}\\n\\nimpl Display for Dog {\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n write!(f, \\\"{} is a dog with {} fur\\\", self.name, self.color)\\n }\\n}\\n\\n#[typetag::serde]\\nimpl Animal for Dog {\\n fn name(&self) -> Option<&str> {\\n Some(&self.name)\\n }\\n\\n fn feet(&self) -> u32 {\\n 4\\n }\\n}\\n\\n#[derive(Debug, Deserialize, Serialize)]\\nstruct Bird {\\n name: String,\\n wingspan: u32,\\n}\\n\\nimpl Display for Bird {\\n fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {\\n write!(\\n f,\\n \\\"{} is a bird with a wingspan of {}\\\",\\n self.name, self.wingspan\\n )\\n }\\n}\\n\\n#[typetag::serde]\\nimpl Animal for Bird {\\n fn name(&self) -> Option<&str> {\\n Some(&self.name)\\n }\\n\\n fn feet(&self) -> u32 {\\n 2\\n }\\n}\\n\\nfn main() -> bincode::Result<()> {\\n let animals: Vec<Box<dyn Animal>> = vec![\\n Box::new(Dog {\\n name: \\\"Rover\\\".into(),\\n color: \\\"brown\\\".into(),\\n }),\\n Box::new(Bird {\\n name: \\\"Tweety\\\".into(),\\n wingspan: 3,\\n }),\\n ];\\n\\n for animal in &animals {\\n println!(\\\"{}\\\", animal);\\n }\\n\\n let serialized = serialize(&animals)?;\\n println!(\\\"Serialized into {} bytes\\\", serialized.len());\\n\\n let deserialized: Vec<Box<dyn Animal>> = deserialize(&serialized)?;\\n\\n println!(\\\"{:#?}\\\", deserialized);\\n\\n Ok(())\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"package require Tcl 8.6\\npackage require TclOO::serializer 0.1\\n\\n# These classes are inspired by the Perl example\\noo::class create Greeting {\\n superclass oo::serializable\\n variable v\\n constructor {} {\\n set v \\\"Hello world!\\\"\\n }\\n method get {} {\\n return $v\\n }\\n}\\noo::class create SubGreeting {\\n superclass Greeting oo::serializable\\n variable v\\n constructor {} {\\n set v \\\"Hello world from Junior!\\\"\\n }\\n}\\noo::class create GreetingsHolder {\\n superclass oo::serializable\\n variable o1 o2\\n constructor {greeting1 greeting2} {\\n set o1 $greeting1\\n set o2 $greeting2\\n }\\n method printGreetings {} {\\n puts [$o1 get]\\n puts [$o2 get]\\n }\\n destructor {\\n $o1 destroy\\n $o2 destroy\\n }\\n}\\n\\n# Make some objects and store them\\nGreetingsHolder create holder [Greeting new] [SubGreeting new]\\nset f [open \\\"objects.dat\\\" w]\\nputs $f [oo::serialize holder]\\nclose $f\\n\\n# Delete the objects\\nholder destroy\\n\\n# Recreate the objects from the file and show that they work\\nset f [open \\\"objects.dat\\\" r]\\nset obj [oo::deserialize [read $f]]\\nclose $f\\n$obj printGreetings\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"(defstruct shape ()\\n (pos-x 0.0) (pos-y 0.0))\\n\\n(defstruct circle (shape)\\n radius)\\n\\n(defstruct ellipse (shape)\\n min-radius maj-radius)\\n\\n(defvarl shapes (list (new circle radius 3.0)\\n (new ellipse min-radius 4.0 maj-radius 5.0)))\\n\\n(put-line \\\"original shapes:\\\")\\n(prinl shapes)\\n\\n(file-put \\\"shapes.tl\\\" shapes)\\n\\n(put-line \\\"dump of shapes.tl file:\\\")\\n(put-line (file-get-string \\\"shapes.tl\\\"))\\n\\n(put-line \\\"object list read from file:\\\")\\n(prinl (file-get \\\"shapes.tl\\\"))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"(defstruct shape ()\\n (pos-x 0.0) (pos-y 0.0))\\n\\n(defstruct circle (shape)\\n radius\\n (:method print (me stream pretty-p)\\n (if pretty-p\\n (put-string `#<circle of radius @{me.radius} at coordinates (@{me.pos-x}, @{me.pos-y})>`)\\n :)))\\n\\n(let ((circ (new circle radius 5.3)))\\n (prinl circ) ;; print machine readably\\n (pprinl circ)) ;; print pretty\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"import \\\"./json\\\" for JSON\\nimport \\\"io\\\" for File, FileFlags\\n\\nclass Entity {\\n construct new(name) {\\n _name = name\\n }\\n\\n name { _name }\\n\\n // JSON representation\\n toString { \\\"{\\\\\\\"name\\\\\\\": \\\\\\\"%(_name)\\\\\\\"}\\\" }\\n\\n // mimics the JSON output\\n print() { System.print(this.toString.replace(\\\"\\\\\\\"\\\", \\\"\\\")) }\\n\\n serialize(fileName) {\\n var o = JSON.parse(this.toString)\\n File.openWithFlags(fileName, FileFlags.writeOnly) { |file|\\n file.writeBytes(\\\"%(o)\\\\n\\\")\\n }\\n }\\n}\\n\\nclass Person is Entity {\\n construct new(name, age) {\\n super(name)\\n _age = age\\n }\\n\\n // JSON representation\\n toString { \\\"{\\\\\\\"name\\\\\\\": \\\\\\\"%(name)\\\\\\\", \\\\\\\"age\\\\\\\": \\\\\\\"%(_age)\\\\\\\"}\\\" }\\n\\n // mimics the JSON output\\n print() { System.print(this.toString.replace(\\\"\\\\\\\"\\\", \\\"\\\")) }\\n\\n serialize(fileName) {\\n var o = JSON.parse(this.toString)\\n File.openWithFlags(fileName, FileFlags.writeOnly) { |file|\\n file.writeBytes(\\\"%(o)\\\\n\\\")\\n }\\n }\\n}\\n\\n// create file for serialization\\nvar fileName = \\\"objects.dat\\\"\\nvar file = File.create(fileName)\\nfile.close()\\n\\nSystem.print(\\\"Calling print methods gives:\\\")\\n\\nvar e = Entity.new(\\\"John\\\")\\ne.print()\\ne.serialize(fileName)\\n\\nvar p = Person.new(\\\"Fred\\\", 35)\\np.print()\\np.serialize(fileName)\\n\\nSystem.print(\\\"\\\\nContents of objects.dat are:\\\")\\nSystem.print(File.read(fileName))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"class [static] ARootClass{ // A top level class, no instances\\n class A{ self.println(\\\" constructor\\\"); } // a regular class\\n class B(A){ // ditto\\n var x;\\n fcn init(x=123){ self.x=x }\\n fcn toString{ \\\"x is \\\"+x }\\n }\\n}\\n\\nARootClass.B(456).println(); // create an instance\\n // prints:\\n Class(A) constructor\\n x is 456\\n\\nf:=File(\\\"object.dat\\\",\\\"wb\\\");\\nCompiler.Asm.writeRootClass(ARootClass,f); // serialize to file\\nf.close();\\n\\nf:=File(\\\"object.dat\\\",\\\"rb\\\");\\nrc:=Compiler.Asm.readRootClass(f); // read and re-create\\n // prints (readRootClass calls all constructors by default):\\n Class(A) constructor\\nf.close();\\nrc.B().println(); // create a new instance of B\\n // prints:\\n x is 123\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Object-serialization"}}},{"rowIdx":1459,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Odd_word_problem\n","language":"00-META"},{"code":";Task:\nWrite a program that solves the [http://c2.com/cgi/wiki?OddWordProblem odd word problem] with the restrictions given below.\n\n\n;Description:\nYou are promised an input stream consisting of English letters and punctuations. \n\nIt is guaranteed that:\n* the words (sequence of consecutive letters) are delimited by one and only one punctuation,\n* the stream will begin with a word,\n* the words will be at least one letter long, and \n* a full stop (a period, [<b>.</b>]) appears after, and only after, the last word.\n\n\n;Example:\nA stream with six words: \n:: <big><code>what,is,the;meaning,of:life.</code></big> \n\n\nThe task is to reverse the letters in every other word while leaving punctuations intact, producing:\n:: <big><code>what,si,the;gninaem,of:efil.</code></big> \nwhile observing the following restrictions:\n# Only I/O allowed is reading or writing one character at a time, which means: no reading in a string, no peeking ahead, no pushing characters back into the stream, and no storing characters in a global variable for later use;\n# You '''are not''' to explicitly save characters in a collection data structure, such as arrays, strings, hash tables, etc, for later reversal;\n# You '''are''' allowed to use recursions, closures, continuations, threads, co-routines, etc., even if their use implies the storage of multiple characters.\n\n\n;Test cases:\nWork on both the \"life\" example given above, and also the text:\n:: <big><code>we,are;not,in,kansas;any,more.</code></big>\n<br><br>\n\n","language":"00-TASK"},{"code":"with Ada.Text_IO;\n\nprocedure Odd_Word_Problem is\n\n use Ada.Text_IO; -- Get, Put, and Look_Ahead\n\n function Current return Character is\n -- reads the current input character, without consuming it\n End_Of_Line: Boolean;\n C: Character;\n begin\n Look_Ahead(C, End_Of_Line);\n if End_Of_Line then\n raise Constraint_Error with \"end of line before the terminating '.'\";\n end if;\n return C;\n end Current;\n\n procedure Skip is\n -- consumes the current input character\n C: Character;\n begin\n Get(C);\n end Skip;\n\n function Is_Alpha(Ch: Character) return Boolean is\n begin\n return (Ch in 'a' .. 'z') or (Ch in 'A' .. 'Z');\n end Is_Alpha;\n\n procedure Odd_Word(C: Character) is\n begin\n if Is_Alpha(C) then\n Skip;\n Odd_Word(Current);\n Put(C);\n end if;\n end Odd_Word;\n\nbegin -- Odd_Word_Problem\n Put(Current);\n while Is_Alpha(Current) loop -- read an even word\n Skip;\n Put(Current);\n end loop;\n if Current /= '.' then -- read an odd word\n Skip;\n Odd_Word(Current);\n Put(Current);\n if Current /= '.' then -- read the remaining words\n Skip;\n Odd_Word_Problem;\n end if;\n end if;\nend Odd_Word_Problem;\n","language":"Ada"},{"code":"# recursively reverses the current word in the input and returns the #\n# the character that followed it #\n# \"ch\" should contain the first letter of the word on entry and will be #\n# updated to the punctuation following the word on exit #\nPROC reverse word = ( REF CHAR ch )VOID:\nBEGIN\n\n CHAR next ch;\n\n read( ( next ch ) );\n\n IF ( next ch <= \"Z\" AND next ch >= \"A\" )\n OR ( next ch <= \"z\" AND next ch >= \"a\" )\n THEN\n reverse word( next ch )\n FI;\n\n print( ( ch ) );\n\n ch := next ch\n\nEND; # reverse word #\n\n\n\n# recursively prints the current word in the input and returns the #\n# character that followed it #\n# \"ch\" should contain the first letter of the word on entry and will be #\n# updated to the punctuation following the word on exit #\nPROC normal word = ( REF CHAR ch )VOID:\nBEGIN\n\n print( ( ch ) );\n read ( ( ch ) );\n\n IF ( ch <= \"Z\" AND ch >= \"A\" )\n OR ( ch <= \"z\" AND ch >= \"a\" )\n THEN\n normal word( ch )\n FI\n\nEND; # normal word #\n\n\n\n# read and print words and punctuation from the input stream, reversing #\n# every second word #\nPROC reverse every other word = VOID:\nBEGIN\n\n CHAR ch;\n\n read( ( ch ) );\n\n WHILE\n ch /= \".\"\n DO\n normal word( ch );\n IF ch /= \".\"\n THEN\n print( ( ch ) );\n read ( ( ch ) );\n reverse word( ch )\n FI\n OD;\n\n print( ( ch ) )\n\nEND; # reverse every other word #\n\n\n\nmain: (\n reverse every other word\n)\n","language":"ALGOL-68"},{"code":"str := \"what,is,the;meaning,of:life.\"\nloop, parse, str\n\tif (A_LoopField ~= \"[[:punct:]]\")\n\t\tres .= A_LoopField, toggle:=!toggle\n\telse\n\t\tres := toggle ? RegExReplace(res, \".*[[:punct:]]\\K\", A_LoopField ) : res A_LoopField\nMsgBox % res\n","language":"AutoHotkey"},{"code":"OPEN \"/dev/stdin\" FOR DEVICE AS in\n\nFUNCTION get_odd()\n\n LOCAL ch, letter\n\n ch = MEMORY(1)\n GETBYTE ch FROM in\n\n IF NOT(REGEX(CHR$(PEEK(ch)), \"[[:punct:]]\")) THEN\n letter = get_odd()\n PRINT CHR$(PEEK(ch));\n ELSE\n letter = PEEK(ch)\n END IF\n\n FREE ch\n RETURN letter\n\nEND FUNCTION\n\nmem = MEMORY(1)\nPRINT \"Enter string: \";\n\nWHILE TRUE\n\n GETBYTE mem FROM in\n PRINT CHR$(PEEK(mem));\n\n IF REGEX(CHR$(PEEK(mem)), \"[[:punct:]]\") THEN\n IF PEEK(mem) <> 46 THEN\n POKE mem, get_odd()\n PRINT CHR$(PEEK(mem));\n END IF\n IF PEEK(mem) = 46 THEN BREAK\n END IF\nWEND\n\nFREE mem\nCLOSE DEVICE in\n\nPRINT\n","language":"BaCon"},{"code":"( ( odd-word\n = dothis doother forward backward\n . ( forward\n = ch\n . fil$:?ch\n & put$!ch\n & ( low$!ch:~<a:~>z&forward$\n | !ch:~\".\"\n )\n )\n & ( backward\n = ch\n . fil$:?ch\n & ( low$!ch:~<a:~>z\n & backward$() (put$!ch&) { This reduces to the return value of backwards$()}\n | '(.put$($ch)&$ch:~\".\") { Macro, evaluates to a function with actual ch. }\n )\n )\n & fil$(!arg,r)\n & ((=forward$).(=(backward$)$))\n : (?dothis.?doother)\n & whl\n ' ( !(dothis.)\n & (!doother.!dothis):(?dothis.?doother)\n )\n & (fil$(,SET,-1)|) { This is how a file is closed: seek the impossible. }\n )\n& put$(\"what,is,the;meaning,of:life.\",\"life.txt\",NEW)\n& put$(\"we,are;not,in,kansas;any,more.\",\"kansas.txt\",NEW)\n& odd-word$\"life.txt\"\n& put$\\n\n& odd-word$\"kansas.txt\" { Real file, as Bracmat cannot read a single character from stdin. }\n);\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <ctype.h>\n\nstatic int\nowp(int odd)\n{\n int ch, ret;\n ch = getc(stdin);\n if (!odd) {\n putc(ch, stdout);\n if (ch == EOF || ch == '.')\n return EOF;\n if (ispunct(ch))\n return 0;\n owp(odd);\n return 0;\n } else {\n if (ispunct(ch))\n return ch;\n ret = owp(odd);\n putc(ch, stdout);\n return ret;\n }\n}\n\nint\nmain(int argc, char **argv)\n{\n int ch = 1;\n while ((ch = owp(!ch)) != EOF) {\n if (ch)\n putc(ch, stdout);\n if (ch == '.')\n break;\n }\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <cctype>\n#include <functional>\n\nusing namespace std;\n\nbool odd()\n{\n function<void ()> prev = []{};\n while(true) {\n int c = cin.get();\n if (!isalpha(c)) {\n prev();\n cout.put(c);\n return c != '.';\n }\n prev = [=] { cout.put(c); prev(); };\n }\n}\n\nbool even()\n{\n while(true) {\n int c;\n cout.put(c = cin.get());\n if (!isalpha(c)) return c != '.';\n }\n}\n\n\nint main()\n{\n bool e = false;\n while( e ? odd() : even() ) e = !e;\n return 0;\n}\n","language":"C++"},{"code":"String[] meaning = [\"what,\", \"is,\", \"the;\", \"meaning,\", \"of:\", \"life.\"];\nString[] kansas = [\"we,\", \"are,\", \"not,\", \"in,\", \"kansas;\", \"any,\", \"more.\"];\n\nshared void run() {\n print(\"\".join(reverseWords(meaning)));\n print(\"\".join(reverseWords(kansas)));\n}\n\nString[] reverseWords(String[] words)\n => recursiveReverseWords(words, []);\n\nString[] recursiveReverseWords(String[] remOrig, String[] revWords)\n => if (nonempty remOrig)\n then recursiveReverseWords(remOrig.rest,\n revWords.withTrailing(reverseWordRecursive(remOrig.first.sequence(),\n [],\n revWords.size.even)))\n else revWords;\n\nString reverseWordRecursive(Character[] remOldChars, Character[] revChars, Boolean isEven)\n => if (nonempty remOldChars)\n then let (char = remOldChars.first) reverseWordRecursive(remOldChars.rest,\n conditionalAddChar(char, revChars, isEven),\n isEven)\n else String(revChars);\n\nCharacter[] conditionalAddChar(Character char, Character[] chars, Boolean isEven)\n => if (isEven || isPunctuation(char))\n then chars.withTrailing(char)\n else chars.withLeading(char);\n\nBoolean isPunctuation(Character char)\n => \",.:;\".contains(char);\n","language":"Ceylon"},{"code":"(defn next-char []\n (char (.read *in*)))\n\n(defn forward []\n (let [ch (next-char)]\n (print ch)\n (if (Character/isLetter ch)\n (forward)\n (not= ch \\.))))\n\n(defn backward []\n (let [ch (next-char)]\n (if (Character/isLetter ch)\n (let [result (backward)]\n (print ch)\n result)\n (fn [] (print ch) (not= ch \\.)))) )\n\n(defn odd-word [s]\n (with-in-str s\n (loop [forward? true]\n (when (if forward?\n (forward)\n ((backward)))\n (recur (not forward?)))) )\n (println))\n","language":"Clojure"},{"code":"user=> (odd-word \"what,is,the;meaning,of:life.\")\nwhat,si,the;gninaem,of:efil.\nnil\nuser=> (odd-word \"we,are;not,in,kansas;any,more.\")\nwe,era;not,ni,kansas;yna,more.\nnil\n","language":"Clojure"},{"code":"isWordChar = (c) -> /^\\w/.test c\nisLastChar = (c) -> c is '.'\n\n# Pass a function that returns an input character and one that outputs a\n# character. JS platforms' ideas of single-character I/O vary widely, but this\n# abstraction is adaptable to most or all.\noddWord = (get, put) ->\n\tforwardWord = ->\n\t\tloop\n\t\t\t# No magic here; buffer then immediately output.\n\t\t\tc = get()\n\t\t\tput(c)\n\t\t\tunless isWordChar(c)\n\t\t\t\treturn not isLastChar(c)\n\t\n\t# NB: (->) is a CoffeeScript idiom for no-op.\n\treverseWord = (outputPending = (->)) ->\n\t\tc = get()\n\t\tif isWordChar(c)\n\t\t\t# Continue word.\n\t\t\t# Tell recursive call to output this character, then any previously\n\t\t\t# pending characters, after the next word character, if any, has\n\t\t\t# been output.\n\t\t\treverseWord ->\n\t\t\t\tput(c)\n\t\t\t\toutputPending()\n\t\telse\n\t\t\t# Word is done.\n\t\t\t# Output previously pending characters, then this punctuation.\n\t\t\toutputPending()\n\t\t\tput(c)\n\t\t\treturn not isLastChar(c)\n\t\n\t# Alternate between forward and reverse until one or the other reports that\n\t# the end-of-input mark has been reached (causing a return of false).\n\tcontinue while forwardWord() and reverseWord()\n","language":"CoffeeScript"},{"code":"isWordChar = (c) -> /^\\w/.test c\nisLastChar = (c) -> c is '.'\n\noddWord = (get, put) ->\n\tforwardWord = ->\n\t\tloop\n\t\t\tc = get()\n\t\t\tput(c)\n\t\t\tunless isWordChar(c)\n\t\t\t\treturn not isLastChar(c)\n\t\n\treverseWord = (outputPending = (->)) ->\n\t\tc = get()\n\t\tif isWordChar(c)\n\t\t\treverseWord ->\n\t\t\t\tput(c)\n\t\t\t\toutputPending()\n\t\telse\n\t\t\toutputPending()\n\t\t\tput(c)\n\t\t\treturn not isLastChar(c)\n\t\n\tcontinue while forwardWord() and reverseWord()\n","language":"CoffeeScript"},{"code":"# Redefine as necessary for target platform.\nprintln = (z) -> console.log z\n\ntestData = [\n\t[\n\t\t\"what,is,the;meaning,of:life.\"\n\t\t\"what,si,the;gninaem,of:efil.\"\n\t]\n\t[\n\t\t\"we,are;not,in,kansas;any,more.\"\n\t\t\"we,era;not,ni,kansas;yna,more.\"\n\t]\n]\n\nresults = for [testString, expectedResult] in testData\n\t# This test machinery uses string buffers for input and output. If your JS\n\t# platform sports single-character I/O, by all means, adapt to taste.\n\tgetCursor = 0\n\tputBuffer = \"\"\n\tget = ->\n\t\ttestString.charAt getCursor++\n\tput = (c) ->\n\t\tputBuffer += c\n\toddWord(get,put)\n\t[testString, expectedResult, putBuffer, putBuffer is expectedResult]\n\nprintln result for result in results\n","language":"CoffeeScript"},{"code":"(defun odd-word (s)\n (let ((stream (make-string-input-stream s)))\n (loop for forwardp = t then (not forwardp)\n while (if forwardp\n (forward stream)\n (funcall (backward stream)))) ))\n\n(defun forward (stream)\n (let ((ch (read-char stream)))\n (write-char ch)\n (if (alpha-char-p ch)\n\t(forward stream)\n (char/= ch #\\.))))\n\n(defun backward (stream)\n (let ((ch (read-char stream)))\n (if (alpha-char-p ch)\n (prog1 (backward stream) (write-char ch))\n #'(lambda () (write-char ch) (char/= ch #\\.)))) )\n","language":"Common-Lisp"},{"code":"? (odd-word \"what,is,the;meaning,of:life.\")\nwhat,si,the;gninaem,of:efil.\nNIL\n? (odd-word \"we,are;not,in,kansas;any,more.\")\nwe,era;not,ni,kansas;yna,more.\nNIL\n","language":"Common-Lisp"},{"code":"bool doChar(in bool odd, in void delegate() nothrow f=null) nothrow {\n import core.stdc.stdio, std.ascii;\n\n immutable int c = getchar;\n if (!odd)\n c.putchar;\n if (c.isAlpha)\n return doChar(odd, { c.putchar; if (f) f(); });\n if (odd) {\n if (f) f();\n c.putchar;\n }\n return c != '.';\n}\n\nvoid main() {\n bool i = true;\n while (doChar(i = !i)) {}\n}\n","language":"D"},{"code":"program Odd_word_problem;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Console,\n System.Character;\n\nfunction doChar(isOdd: boolean; f: TProc = nil): Boolean;\nbegin\n var c: char := Console.ReadKey(True).KeyChar;\n\n if not isOdd then\n Write(c);\n\n if c.IsLetter then\n exit(doChar(isOdd,\n procedure\n begin\n Write(c);\n if assigned(f) then\n f();\n end));\n\n if isOdd then\n begin\n if Assigned(f) then\n f();\n write(c);\n end;\n\n exit(c <> '.');\n\nend;\n\nbegin\n var i: boolean := false;\n while doChar(i) do\n i := not i;\n readln;\nend.\n","language":"Delphi"},{"code":"global inpi inp$ .\nfunc$ read .\n inpi += 1\n return substr inp$ inpi 1\n.\nfunc ispunct c$ .\n if c$ = \".\" or c$ = \":\" or c$ = \";\" or c$ = \",\"\n return 1\n .\n return 0\n.\nfunc$ handle odd .\n c$ = read\n if ispunct c$ = 1\n return c$\n .\n if odd = 0\n write c$\n r$ = handle 0\n return r$\n else\n r$ = handle 1\n write c$\n return r$\n .\n.\nproc go . .\n repeat\n c$ = handle odd\n write c$\n until c$ = \".\"\n odd = 1 - odd\n .\n print \"\"\n.\nrepeat\n inp$ = input\n until inp$ = \"\"\n inpi = 0\n go\n.\ninput_data\nwe,are;not,in,kansas;any,more.\nwhat,is,the;meaning,of:life.\n","language":"EasyLang"},{"code":"(lib 'sequences)\n(define input-stream null)\n(define output-stream \"\")\n\n;;---------------------------\n;; character I/O simulation\n;; --------------------------\n(define (read-char) (next input-stream)) ;; #f if EOF\n(define (write-char c) (when c (set! output-stream (string-append output-stream c))))\n\n(define (init-streams sentence)\n\t(set! input-stream (procrastinator sentence))\n\t(set! output-stream \"\"))\n\n;;---------------------------------\n;; task , using read-char/write-char\n;;----------------------------------\n\n(define (flop) ; reverses, and returns first non-alpha after word, or EOF\n\t(define c (read-char))\n\t(if (string-alphabetic? c) (begin0 (flop) (write-char c)) c))\n\t\n(define (flip)\n (define c (read-char))\n (if (string-alphabetic? c) (begin (write-char c) (flip)) c))\n\n(define (task sentence)\n\t (init-streams sentence)\n\t (while (and (write-char (flip)) (write-char (flop))))\n\t output-stream )\n","language":"EchoLisp"},{"code":"(task \"what,is,the;meaning,of:life.\")\n → \"what,si,the;gninaem,of:efil.\"\n; check diacritical\n(task \"Longtemps,je me suis couché,héhé,hôhô,de bonne heure.\")\n → \"Longtemps,ej me sius couché,éhéh,hôhô,ed bonne erueh.\"\n","language":"EchoLisp"},{"code":"defmodule Odd_word do\n def handle(s, false, i, o) when ((s >= \"a\" and s <= \"z\") or (s >= \"A\" and s <= \"Z\")) do\n o.(s)\n handle(i.(), false, i, o)\n end\n def handle(s, t, i, o) when ((s >= \"a\" and s <= \"z\") or (s >= \"A\" and s <= \"Z\")) do\n d = handle(i.(), :rec, i, o)\n o.(s)\n if t == true, do: handle(d, t, i, o), else: d\n end\n def handle(s, :rec, _, _), do: s\n def handle(?., _, _, o), do: o.(?.); :done\n def handle(:eof, _, _, _), do: :done\n def handle(s, t, i, o) do\n o.(s)\n handle(i.(), not t, i, o)\n end\n\n def main do\n i = fn() -> IO.getn(\"\") end\n o = fn(s) -> IO.write(s) end\n handle(i.(), false, i, o)\n end\nend\n\nOdd_word.main\n","language":"Elixir"},{"code":"handle(S, false, I, O) when (((S >= $a) and (S =< $z)) or ((S >= $A) and (S =< $Z))) ->\n O(S),\n handle(I(), false, I, O);\nhandle(S, T, I, O) when (((S >= $a) and (S =< $z)) or ((S >= $A) and (S =< $Z))) ->\n D = handle(I(), rec, I, O),\n O(S),\n case T of true -> handle(D, T, I, O); _ -> D end;\nhandle(S, rec, _, _) -> S;\nhandle($., _, _, O) -> O($.), done;\nhandle(eof, _, _, _) -> done;\nhandle(S, T, I, O) -> O(S), handle(I(), not T, I, O).\n\nmain([]) ->\n I = fun() -> hd(io:get_chars([], 1)) end,\n O = fun(S) -> io:put_chars([S]) end,\n handle(I(), false, I, O).\n","language":"Erlang"},{"code":"open System\nopen System.Text.RegularExpressions\n\nlet mutable Inp = Console.In\n\nlet Out c = printf \"%c\" c; (if c = '.' then Environment.Exit 0)\n\nlet In() = Inp.Read() |> Convert.ToChar\n\nlet (|WordCharacter|OtherCharacter|) c =\n if Regex.IsMatch(c.ToString(),\"[a-zA-Z]\") then\n WordCharacter\n else\n OtherCharacter\n\nlet rec forward () =\n let c = In()\n let rec backward () : char =\n let c = In()\n match c with\n | WordCharacter ->\n let s = backward() in Out c; s\n | OtherCharacter -> c\n Out c\n match c with\n | WordCharacter -> forward()\n | OtherCharacter -> backward()\n\n[<EntryPoint>]\nlet main argv =\n if argv.Length > 0 then Inp <- new System.IO.StringReader(argv.[0])\n let rec loop () = forward() |> Out; loop()\n loop()\n 0\n","language":"F-Sharp"},{"code":"USING: continuations kernel io io.streams.string locals unicode.categories ;\nIN: rosetta.odd-word\n\n<PRIVATE\n! Save current continuation.\n: savecc ( -- continuation/f )\n [ ] callcc1 ; inline\n\n! Jump back to continuation, where savecc will return f.\n: jump-back ( continuation -- )\n f swap continue-with ; inline\nPRIVATE>\n\n:: read-odd-word ( -- )\n f :> first-continuation!\n f :> last-continuation!\n f :> reverse!\n ! Read characters. Loop until end of stream.\n [ read1 dup ] [\n dup Letter? [\n ! This character is a letter.\n reverse [\n ! Odd word: Write letters in reverse order.\n last-continuation savecc dup [\n last-continuation!\n 2drop ! Drop letter and previous continuation.\n ] [\n ! After jump: print letters in reverse.\n drop ! Drop f.\n swap write1 ! Write letter.\n jump-back ! Follow chain of continuations.\n ] if\n ] [\n ! Even word: Write letters immediately.\n write1\n ] if\n ] [\n ! This character is punctuation.\n reverse [\n ! End odd word. Fix trampoline, follow chain of continuations\n ! (to print letters in reverse), then bounce off trampoline.\n savecc dup [\n first-continuation!\n last-continuation jump-back\n ] [ drop ] if\n write1 ! Write punctuation.\n f reverse! ! Begin even word.\n ] [\n write1 ! Write punctuation.\n t reverse! ! Begin odd word.\n ! Create trampoline to bounce to (future) first-continuation.\n savecc dup [\n last-continuation!\n ] [ drop first-continuation jump-back ] if\n ] if\n ] if\n ] while\n ! Drop f from read1. Then print a cosmetic newline.\n drop nl ;\n\n: odd-word ( string -- )\n [ read-odd-word ] with-string-reader ;\n","language":"Factor"},{"code":"[$$$$'.=\\',=|\\';=|\\':=|~[^s;!\\,]?]s: {recursive reading}\n[s;!$'.=~[,^f;!]?]r: {reverse words}\n[[$$$$'.=\\',=|\\';=|\\':=|~][,^]#$'.=~[,^r;!]?]f: {forward words}\n^f;!, {start}\n","language":"FALSE"},{"code":": word? dup [char] . <> over bl <> and ;\n: ?quit dup [char] . = if emit quit then ;\n: eatbl begin dup bl = while drop key repeat ?quit ;\n: even begin word? while emit key repeat ;\n: odd word? if key recurse swap emit then ;\n: main cr key eatbl begin even eatbl space odd eatbl space again ;\n","language":"Forth"},{"code":" MODULE ELUDOM\t!Uses the call stack for auxiliary storage.\n INTEGER MSG,INF\t!I/O unit numbers.\n LOGICAL DEFER\t!To stumble, or not to stumble.\n CONTAINS\n CHARACTER*1 RECURSIVE FUNCTION GET(IN)\t!Returns one character, going forwards.\n INTEGER IN\t!The input file.\n CHARACTER*1 C\t!The single character to be read therefrom.\n READ (IN,1,ADVANCE=\"NO\",EOR=3,END=4) C\t!Thus. Not advancing to the next record.\n 1 FORMAT (A1,$)\t!For output, no advance to the next line either.\n 2 IF ((\"A\"<=C .AND. C<=\"Z\").OR.(\"a\"<=C .AND. C<=\"z\")) THEN\t!Unsafe for EBCDIC.\n IF (DEFER) THEN\t!Are we to reverse the current text?\n GET = GET(IN)\t!Yes. Go for the next letter.\n WRITE (MSG,1) C\t!And now, backing out, reveal the letter at this level.\n RETURN\t\t!Retreat another level.\n END IF\t\t!Thus passing back the ending non-letter that was encountered.\n ELSE\t\t!And if we've encountered a non-letter,\n DEFER = .NOT. DEFER\t!Then our backwardness flips.\n END IF\t!Enough inspection of C.\n 3 GET = C\t!Pass it back.\n RETURN\t!And we're done.\n 4 GET = CHAR(0)\t!Reserving this for end-of-file.\n END FUNCTION GET!That was strange.\n END MODULE ELUDOM\t!But as per the specification.\n\n PROGRAM CONFUSED\t!Just so.\n USE ELUDOM\t!Forwards? Backwards?\n CHARACTER*1 C\t!A scratchpad for multiple inspections.\n MSG = 6\t!Standard output.\n INF = 10\t!This will do.\n OPEN (INF,NAME = \"Confused.txt\",STATUS=\"OLD\",ACTION=\"READ\")\t!Go for the file.\n\nChew through the input. A full stop marks the end.\n 10 DEFER = .FALSE.\t!Start off going forwards.\n 11 C = GET(INF)\t\t!Get some character from file INF.\n IF (ICHAR(C).LE.0) STOP\t\t!Perhaps end-of-file is reported.\n IF (C.NE.\" \") WRITE (MSG,12) C\t!Otherwise, write it. A blank for end-of-record.\n 12 FORMAT (A1,$)\t\t\t!Obviously, not finishing the line each time.\n IF (C.NE.\".\") GO TO 11\t!And if not a full stop, do it again.\n WRITE (MSG,\"('')\")\t!End the line of output.\n GO TO 10\t\t!And have another go.\n END\t!That was confusing.\n","language":"Fortran"},{"code":"Dim Shared As Integer n1 = 1\n\nFunction reverseString(texto As String) As String\n Dim As Integer x, lt = Len(texto)\n For x = 0 To lt Shr 1 - 1\n Swap texto[x], texto[lt - x - 1]\n Next x\n Return texto\nEnd Function\n\nSub process(texto As String)\n Dim As Integer c = 0, n2\n Dim As String tmptexto\n\n Print \"Input stream: \"; texto\n Print \"Output stream: \";\n Do\n n2 = Instr(texto, Any \",;:.\")\n tmptexto = Mid(texto, n1, n2-1)\n Print Iif(c Mod 2 = 0, tmptexto, reverseString(tmptexto)); Mid(texto, n2, 1);\n If Mid(texto, n2, 1) = \".\" Then Exit Do\n texto = Mid(texto, n2+1, Len(texto))\n c += 1\n Loop\n Print !\"\\n\"\nEnd Sub\n\nprocess(\"what,is,the;meaning,of:life.\")\nprocess(\"we,are;not,in,kansas;any,more.\")\n\nSleep\n","language":"FreeBASIC"},{"code":"begin globals\nshort ndx : bool odd : cfstringref stream\nend globals\n\nlocal fn recursion\n cfstringref ch = mid( stream, ndx, 1 )\n if fn StringContainsString( @\",;:. \", ch ) == no\n ndx++\n if odd then fn recursion : print ch; ¬\n else print ch; : fn recursion\n end if\nend fn\n\nlocal fn oddWordTask( s as cfstringref )\n ndx = 0 : odd = no : stream = s\n print : print, stream : print,\n while ndx < len( stream )\n fn recursion : print mid( stream, ndx, 1 );\n odd = yes - odd : ndx++\n wend\n print\nend fn\n\nwindow 1, @\"Odd word task in FutureBasic\", (0,0,310,155)\nfn oddWordTask( @\"what,is,the;meaning,of:life.\" )\nfn oddWordTask( @\"we,are;not,in,kansas;any,more.\" )\nfn oddWordTask( @\"This also works with normal spaces.\" )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"io\"\n \"os\"\n \"unicode\"\n)\n\nfunc main() {\n owp(os.Stdout, bytes.NewBufferString(\"what,is,the;meaning,of:life.\"))\n fmt.Println()\n owp(os.Stdout, bytes.NewBufferString(\"we,are;not,in,kansas;any,more.\"))\n fmt.Println()\n}\n\nfunc owp(dst io.Writer, src io.Reader) {\n byte_in := func () byte {\n bs := make([]byte, 1)\n src.Read(bs)\n return bs[0]\n }\n byte_out := func (b byte) { dst.Write([]byte{b}) }\n var odd func() byte\n odd = func() byte {\n s := byte_in()\n if unicode.IsPunct(rune(s)) {\n return s\n }\n b := odd()\n byte_out(s)\n return b\n }\n for {\n for {\n b := byte_in()\n byte_out(b)\n if b == '.' {\n return\n }\n if unicode.IsPunct(rune(b)) {\n break\n }\n }\n b := odd()\n byte_out(b)\n if b == '.' {\n return\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"io\"\n \"os\"\n \"unicode\"\n)\n\nfunc main() {\n owp(os.Stdout, bytes.NewBufferString(\"what,is,the;meaning,of:life.\"))\n fmt.Println()\n owp(os.Stdout, bytes.NewBufferString(\"we,are;not,in,kansas;any,more.\"))\n fmt.Println()\n}\n\nfunc owp(dst io.Writer, src io.Reader) {\n byte_in := func () byte {\n bs := make([]byte, 1)\n src.Read(bs)\n return bs[0]\n }\n byte_out := func (b byte) { dst.Write([]byte{b}) }\n odd := func() byte {\n for {\n b := byte_in()\n if unicode.IsPunct(int(b)) {\n return b\n }\n defer byte_out(b)\n }\n panic(\"impossible\")\n }\n for {\n for {\n b := byte_in()\n byte_out(b)\n if b == '.' {\n return\n }\n if unicode.IsPunct(rune(b)) {\n break\n }\n }\n b := odd()\n byte_out(b)\n if b == '.' {\n return\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"io\"\n \"os\"\n \"unicode\"\n)\n\nfunc main() {\n owp(os.Stdout, bytes.NewBufferString(\"what,is,the;meaning,of:life.\"))\n fmt.Println()\n owp(os.Stdout, bytes.NewBufferString(\"we,are;not,in,kansas;any,more.\"))\n fmt.Println()\n}\n\ntype Coroutine struct {\n out <-chan Coroutine\n in chan<- byte\n}\n\nfunc owp(dst io.Writer, src io.Reader) {\n byte_in := func () (byte, error) {\n bs := make([]byte, 1)\n _, err := src.Read(bs)\n return bs[0], err\n }\n byte_out := func (b byte) { dst.Write([]byte{b}) }\n\n var f, r Coroutine\n\n f = func () Coroutine {\n out := make(chan Coroutine)\n\tin := make(chan byte)\n var fwd func (byte) byte\n fwd = func (c byte) (z byte) {\n if unicode.IsLetter(rune(c)) {\n byte_out(c)\n out <- f\n z = fwd(<- in)\n } else {\n z = c\n }\n return\n }\n go func () {\n for {\n x, ok := <- in\n if !ok { break }\n byte_out(fwd(x))\n out <- r\n }\n } ()\n return Coroutine{ out, in }\n } ()\n r = func () Coroutine {\n out := make(chan Coroutine)\n\tin := make(chan byte)\n var rev func (byte) byte\n rev = func (c byte) (z byte) {\n if unicode.IsLetter(rune(c)) {\n out <- r\n z = rev(<- in)\n byte_out(c)\n } else {\n z = c\n }\n return\n }\n go func () {\n for {\n x, ok := <- in\n if !ok { break }\n byte_out(rev(x))\n out <- f\n }\n } ()\n return Coroutine{ out, in }\n } ()\n\n for coro := f; ; coro = <- coro.out {\n c, err := byte_in()\n if err != nil { break }\n coro.in <- c\n }\n close(f.in)\n close(r.in)\n}\n","language":"Go"},{"code":"import System.IO\n (BufferMode(..), getContents, hSetBuffering, stdin, stdout)\nimport Data.Char (isAlpha)\n\nsplit :: String -> (String, String)\nsplit = span isAlpha\n\nparse :: String -> String\nparse [] = []\nparse l =\n let (a, w) = split l\n (b, x) = splitAt 1 w\n (c, y) = split x\n (d, z) = splitAt 1 y\n in a <> b <> reverse c <> d <> parse z\n\nmain :: IO ()\nmain =\n hSetBuffering stdin NoBuffering >> hSetBuffering stdout NoBuffering >> getContents >>=\n putStr . takeWhile (/= '.') . parse >>\n putStrLn \".\"\n","language":"Haskell"},{"code":"isAlpha :: Char -> Bool\nisAlpha = flip elem $ ['a'..'z'] ++ ['A'..'Z']\n\nparse :: IO ()\nparse = do\n x <- getChar\n putChar x\n case () of\n _ | x == '.' -> return ()\n | isAlpha x -> parse\n | otherwise -> do\n c <- revParse\n putChar c\n if c == '.'\n then return ()\n else parse\n\nrevParse :: IO Char\nrevParse = do\n x <- getChar\n case () of\n _ | x == '.' -> return x\n | isAlpha x -> do\n c <- revParse\n putChar x\n return c\n | otherwise -> return x\n\nmain :: IO ()\nmain = hSetBuffering stdin NoBuffering >> hSetBuffering stdout NoBuffering >>\n parse >> putStrLn \"\"\n","language":"Haskell"},{"code":"procedure main()\nevery OddWord(![\"what,is,the;meaning,of:life.\",\n \"we,are;not,in,kansas;any,more.\"])\nend\n\nprocedure OddWord(stream) #: wrapper for demonstration\n write(\"Input stream: \",stream)\n writes(\"Output stream: \") & eWord(create !stream,'.,;:') & write()\nend\n\nprocedure eWord(stream,marks) #: handle even words\n repeat {\n repeat\n writes(@stream) ? if =\".\" then return else if any(marks) then break\n if writes(oWord(stream,marks)) == '.' then return\n }\nend\n\nprocedure oWord(stream,marks) #: handle odd words (reverse)\n if any(marks,s := @stream) then return s\n return 1(oWord(stream,marks), writes(s))\nend\n","language":"Icon"},{"code":"procedure main(A)\n repeat (while writes((any(&letters, c := reads(&input,1)),c))) |\n (writes(c) ~== \".\" ~== writes(rWord())) | break write()\nend\n\nprocedure rWord(c)\n c1 := rWord((any(&letters, c1 := reads(&input,1)),c1))\n writes(\\c)\n return c1\nend\n","language":"Icon"},{"code":"putch=: 4 :0 NB. coroutine verb\n outch y\n return x\n)\n\nisletter=: toupper ~: tolower\n\ndo_char=: 3 :0 NB. coroutine verb\n ch=. getch''\n if. isletter ch do.\n if. odd do.\n putch&ch yield do_char '' return.\n end.\n else.\n odd=: -. odd\n end.\n return ch\n)\n\nevenodd=: 3 :0\n clear_outstream begin_instream y\n odd=: 0\n whilst. '.'~:char do.\n outch char=. do_char coroutine ''\n end.\n)\n","language":"J"},{"code":" evenodd 'what,is,the;meaning,of:life.'\nwhat,si,the;gninaem,of:efil.\n evenodd 'we,are;not,in,kansas;any,more.'\nwe,era;not,ni,kansas;yna,more.\n","language":"J"},{"code":"public class OddWord {\n interface CharHandler {\n\tCharHandler handle(char c) throws Exception;\n }\n final CharHandler fwd = new CharHandler() {\n\tpublic CharHandler handle(char c) {\n\t System.out.print(c);\n\t return (Character.isLetter(c) ? fwd : rev);\n\t}\n };\n class Reverser extends Thread implements CharHandler {\n\tReverser() {\n\t setDaemon(true);\n\t start();\n\t}\n\tprivate Character ch; // For inter-thread comms\n\tprivate char recur() throws Exception {\n\t notify();\n\t while (ch == null) wait();\n\t char c = ch, ret = c;\n\t ch = null;\n\t if (Character.isLetter(c)) {\n\t\tret = recur();\n\t\tSystem.out.print(c);\n\t }\n\t return ret;\n\t}\n\tpublic synchronized void run() {\n\t try {\n\t\twhile (true) {\n\t\t System.out.print(recur());\n\t\t notify();\n\t\t}\n\t } catch (Exception e) {}\n\t}\n\tpublic synchronized CharHandler handle(char c) throws Exception {\n\t while (ch != null) wait();\n\t ch = c;\n\t notify();\n\t while (ch != null) wait();\n\t return (Character.isLetter(c) ? rev : fwd);\n\t}\n }\n final CharHandler rev = new Reverser();\n\n public void loop() throws Exception {\n\tCharHandler handler = fwd;\n\tint c;\n\twhile ((c = System.in.read()) >= 0) {\n\t handler = handler.handle((char) c);\n\t}\n }\n\n public static void main(String[] args) throws Exception {\n\tnew OddWord().loop();\n }\n}\n","language":"Java"},{"code":"# io = readstring(STDIN)\nio = \"what,is,the;meaning,of:life.\"\ni = 0\n\nreadbyte!() = io[global i += 1]\nwritebyte(c) = print(Char(c))\n\nfunction odd(prev::Function = () -> false)\n a = readbyte!()\n if !isalpha(a)\n prev()\n writebyte(a)\n return a != '.'\n end\n\n # delay action until later, in the shape of a closure\n clos() = (writebyte(a); prev())\n\n return odd(clos)\nend\n\nfunction even()\n while true\n c = readbyte!()\n writebyte(c)\n if !isalpha(c) return c != '.' end\n end\nend\n\nevn = false\nwhile evn ? odd() : even()\n evn = !evn\nend\n","language":"Julia"},{"code":"// version 1.1.3\n\ntypealias Func = () -> Unit\n\nfun doChar(odd: Boolean, f: Func?): Boolean {\n val c = System.`in`.read()\n if (c == -1) return false // end of stream reached\n val ch = c.toChar()\n\n fun writeOut() {\n print(ch)\n if (f != null) f()\n }\n\n if (!odd) print(ch)\n if (ch.isLetter()) return doChar(odd, ::writeOut)\n if (odd) {\n if (f != null) f()\n print(ch)\n }\n return ch != '.'\n}\n\nfun main(args: Array<String>) {\n repeat(2) {\n var b = true\n while (doChar(!b, null)) b = !b\n System.`in`.read() // remove '\\n' from buffer\n println(\"\\n\")\n }\n}\n","language":"Kotlin"},{"code":"define odd_word_processor(str::string) => {\n\tlocal(\n\t\tisodd \t\t= false,\n\t\tpos \t\t= 1,\n\t\tinvpos\t \t= 1,\n\t\tlastpos\t\t= 1\n\t)\n\twhile(#str->get(#pos) != '.' && #pos <= #str->size) => {\n\t\tif(not #str->isAlpha(#pos)) => {\n\t\t\tnot #isodd ? #isodd = true | #isodd = false\t\n\t\t}\n\t\tif(#isodd) => {\n\t\t\t#lastpos = 1\n\t\t\t#invpos = 1\n\t\t\twhile(#str->isAlpha(#pos+#lastpos) && #pos+#lastpos <= #str->size) => {\n\t\t\t\t#lastpos++\n\t\t\t}\n\t\t\t'odd lastpos: '+#lastpos+'\\r'\n\t\t\tlocal(maxpos = #pos+#lastpos-1)\n\t\t\twhile(#invpos < (#lastpos+1)/2) => {\n\t\t\t\tlocal(i,o,ipos,opos)\n\t\t\t\t#ipos = #pos+#invpos\n\t\t\t\t#opos = #pos+(#lastpos-#invpos)\n\t\t\t\t#i = #str->get(#ipos)\n\t\t\t\t#o = #str->get(#opos)\n\t\t\t\t\n\t\t\t\t//'switching '+#i+' and '+#o+'\\r'\n\t\t\t\t\n\t\t\t\t//'insert '+#o+' at '+(#ipos)+'\\r'\n\t\t\t\t#str = string_insert(#str,-position=(#ipos),-text=#o)\n\t\n\t\t\t\t//'remove redundant pos '+(#ipos+1)+'\\r'\n\t\t\t\t#str->remove(#ipos+1,1)\n\t\t\t\t\n\t\t\t\t//'insert '+#i+' at '+(#opos)+'\\r'\n\t\t\t\t#str = string_insert(#str,-position=(#opos),-text=#i)\n\t\n\t\t\t\t//'remove redundant pos '+(#opos+1)+'\\r'\n\t\t\t\t#str->remove(#opos+1,1)\n\t\t\t\t\n\t\t\t\t#invpos++\n\t\t\t}\n\t\t\t#pos += #lastpos - 1\n\t\t}\n\t\t//#str->get(#pos) + #isodd + '\\r'\n\t\t#pos += 1\n\t}\n\treturn #str\n}\n\n'orig:\\rwhat,is,the;meaning,of:life.\\r'\n'new:\\r'\nodd_word_processor('what,is,the;meaning,of:life.')\n'\\rShould have:\\rwhat,si,the;gninaem,of:efil.'\n","language":"Lasso"},{"code":"function reverse()\n local ch = io.read(1)\n if ch:find(\"%w\") then\n local rc = reverse()\n io.write(ch)\n return rc\n end\n return ch\nend\n\nfunction forward()\n ch = io.read(1)\n io.write(ch)\n if ch == \".\" then return false end\n if not ch:find(\"%w\") then\n ch = reverse()\n if ch then io.write(ch) end\n if ch == \".\" then return false end\n end\n return true\nend\n\nwhile forward() do end\n","language":"Lua"},{"code":"Module Checkit {\n global out$\n document out$\n Function PrepareStream$ (buf$) {\n \\\\ get a temporary file\n if buf$=\"\" then {\n class ref {\n f\n class:\n module ref (.f) { }\n }\n \\\\ make f closure by reference\n m->ref(false)\n =lambda$ m->{\n if m=>f then exit\n r$=Key$\n m=>f=r$=\".\"\n =r$\n }\n \\\\ exit function\n break\n }\n name$=tempname$\n \\\\ we use Ansi type files\n Open name$ for output as F\n Print #F, buf$;\n Close #F\n Open name$ for input as #f\n class ref {\n f\n class:\n module ref (.f) { }\n }\n \\\\ make f closure by reference\n m->ref(f)\n =lambda$ m -> {\n if m=>f=-1000 then exit\n def r$\n if not eof(#m=>f) then r$=Input$(#m=>f,2)\n =r$\n if r$=\"\" or r$=\".\" then close #m=>f : m=>f=-1000\n }\n }\n Module Odd(c$) {\n one$=\"\"\n Module MyEven(c$, &last$) {\n one$=If$(last$=\"\"->c$(), last$)\n if one$=\"\" then exit\n if not one$ ~\"[a-zA-Z]\" Then last$=one$: exit\n \\\\ print before\n Print one$;\n out$<=one$\n Call MyEven, c$, &last$\n }\n Module MyOdd(c$, &last$) {\n one$=If$(last$=\"\"->c$(), last$)\n if one$=\"\" then exit\n if not one$ ~\"[a-zA-Z]\" Then last$=one$: exit\n Call MyOdd, c$, &last$\n \\\\ print after\n Print one$;\n out$<=one$\n }\n Do {\n one$=\"\"\n Call MyEven, c$, &one$\n if one$=\"\" then exit\n Print one$;\n out$<=one$\n one$=\"\"\n Call MyOdd, c$, &one$\n if one$=\"\" then exit\n Print one$;\n out$<=one$\n } Always\n Print\n out$<={\n }\n }\n \\\\ Feeding keyboard\n keyboard \"what,is,the;meaning,of:life.\"\n Odd PrepareStream$(\"\")\n \\\\ Use a file for input\n Odd PrepareStream$(\"we,are;not,in,kansas;any,more.\")\n clipboard out$\n}\nCheckit\n","language":"M2000-Interpreter"},{"code":"Module OddWord {\n k$=lambda$->\"\"\n state=false\n odd=True\n do {\n a$=key$\n if a$ ~\"[a-zA-Z]\" then {\n If state Else state~ : odd~\n if state and odd then k$=lambda$ k$, a$->a$+k$() : Continue\n Print a$;\n } Else {\n If state Then state~\n if odd then Print k$(); : k$=lambda$->\"\"\n Print a$;\n }\n } until a$=\".\"\n Print\n}\nkeyboard \"what,is,the;meaning,of:life.\"\nOddWord\nKeyboard \"we,are;not,in,kansas;any,more.\"\nOddWord\n","language":"M2000-Interpreter"},{"code":"import unicode\n\ntype Proc = proc(): bool {.closure.}\n\nvar nothing: Proc = proc(): bool {.closure.} = false\n\nproc odd(prev = nothing): bool =\n let a = stdin.readChar()\n if not isAlpha(Rune(ord(a))):\n discard prev()\n stdout.write(a)\n return a != '.'\n\n # delay action until later, in the shape of a closure\n proc clos(): bool =\n stdout.write(a)\n prev()\n\n return odd(clos)\n\nproc even(): bool =\n while true:\n let c = stdin.readChar()\n stdout.write(c)\n if not isAlpha(Rune(ord(c))):\n return c != '.'\n\nvar e = false\nwhile (if e: odd() else: even()):\n e = not e\n","language":"Nim"},{"code":"import strutils\n\nproc reverseWord(ch: var char) =\n var nextch = stdin.readChar()\n if nextch.isAlphaAscii():\n reverseWord(nextch)\n stdout.write(ch)\n ch = nextch\n\nproc normalWord(ch: var char) =\n stdout.write(ch)\n ch = stdin.readChar()\n if ch.isAlphaAscii():\n normalWord(ch)\n\nvar ch = stdin.readChar()\n\nwhile ch != '.':\n normalWord(ch)\n if ch != '.':\n stdout.write(ch)\n ch = stdin.readChar()\n reverseWord(ch)\nstdout.write(ch)\n","language":"Nim"},{"code":"let is_alpha c =\n c >= 'a' && c <= 'z' ||\n c >= 'A' && c <= 'Z'\n\nlet rec odd () =\n let c = input_char stdin in\n if is_alpha c\n then (let e = odd () in print_char c; e)\n else (c)\n\nlet rec even () =\n let c = input_char stdin in\n if is_alpha c\n then (print_char c; even ())\n else print_char c\n\nlet rev_odd_words () =\n while true do\n even ();\n print_char (odd ())\n done\n\nlet () =\n try rev_odd_words ()\n with End_of_file -> ()\n","language":"OCaml"},{"code":"(define (odd_word_problem words)\n (letrec ((odd (lambda (s out)\n (let loop ((s s) (l '()))\n (cond\n ((null? s)\n out)\n ((pair? s)\n (if (<= #\\a (car s) #\\z)\n (loop (cdr s) (cons (car s) l))\n (even (cdr s) (cons (cons (reverse l) (car s)) out))))\n (else\n (loop (s) l))))))\n (even (lambda (s out)\n (let loop ((s s) (l '()))\n (cond\n ((null? s)\n out)\n ((pair? s)\n (if (<= #\\a (car s) #\\z)\n (loop (cdr s) (cons (car s) l))\n (odd (cdr s) (cons (cons l (car s)) out))))\n (else\n (loop (s) l)))))))\n (for-each (lambda (p)\n (display (runes->string (car p)))\n (display (string (cdr p))))\n (reverse\n (odd (str-iter words) '()))))\n (print))\n(odd_word_problem \"what,is,the;meaning,of:life.\")\n(odd_word_problem \"we,are;not,in,kansas;any,more.\")\n","language":"Ol"},{"code":"sub r\n{\n\tmy ($f, $c) = @_;\n\treturn sub { print $c; $f->(); };\n}\n\n$r = sub {};\n\nwhile (read STDIN, $_, 1) {\n\t$w = /^[a-zA-Z]$/;\n\t$n++ if ($w && !$l);\n\t$l = $w;\n\tif ($n & 1 || !$w) {\n\t\t$r->(); $r = sub{};\n\t\tprint;\n\t} else {\n\t\t$r = r($r, $_);\n\t}\n}\n$r->();\n","language":"Perl"},{"code":"sub rev\n{\n\tmy $c;\n\tread STDIN, $c, 1;\n\tif ($c =~ /^[a-zA-Z]$/) {\n\t\tmy $r = rev();\n\t\tprint $c;\n\t\treturn $r;\n\t} else {\n\t\treturn $c;\n\t}\n}\n\nwhile (read STDIN, $_, 1) {\n\t$w = /^[a-zA-Z]$/;\n\t$n++ if ($w && !$l);\n\t$l = $w;\n\tif ($n & 1) {\n\t\tprint;\n\t} else {\n\t\tmy $r = rev();\n\t\tprint $_;\n\t\tprint $r;\n\t\t$n = 0; $l = 0;\n\t}\n}\n","language":"Perl"},{"code":"$|=1;\n\nwhile (read STDIN, $_, 1) {\n\t$w = /^[a-zA-Z]$/;\n\t$n++ if ($w && !$l);\n\t$l = $w;\n\tif ($n & 1 || !$w) {\n\t\tclose W; while(wait()!=-1){}\n\t\tprint;\n\t} else {\n\t\topen W0, \">&\", \\*W;\n\t\tclose W;\n\t\tpipe R,W;\n\t\tif (!fork()) {\n\t\t\tclose W;\n\t\t\t<R>;\n\t\t\tprint $_;\n\t\t\tclose W0;\n\t\t\texit;\n\t\t}\n\t\tclose W0;\n\t\tclose R;\n\t}\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"what,is,the;meaning,of:life.\"</span>\n <span style=\"color: #000080;font-style:italic;\">--string s = \"we,are;not,in,kansas;any,more.\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">getchar</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">wrod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rev</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">getchar</span><span style=\"color: #0000FF;\">(),</span> <span style=\"color: #000000;\">nch</span>\n <span style=\"color: #000080;font-style:italic;\">-- integer ch = getc(0), nch</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" .,:;!?\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rev</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">nch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">wrod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rev</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">rev</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">nch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">wrod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rev</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nch</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">--puts(1,\"Enter words separated by a single punctuation mark (i.e. !?,.;:) and ending with .\\n\")</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">wrod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rev</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'.'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">rev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">rev</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n<!--\n","language":"Phix"},{"code":"$odd = function ($prev) use ( &$odd ) {\n\t$a = fgetc(STDIN);\n\tif (!ctype_alpha($a)) {\n\t\t$prev();\n\t\tfwrite(STDOUT, $a);\n\t\treturn $a != '.';\n\t}\n\t$clos = function () use ($a , $prev) {\n\t\tfwrite(STDOUT, $a);\n\t\t$prev();\n\t};\n\treturn $odd($clos);\n};\n$even = function () {\n\twhile (true) {\n\t\t$c = fgetc(STDIN);\n\t\tfwrite(STDOUT, $c);\n\t\tif (!ctype_alpha($c)) {\n\t\t\treturn $c != \".\";\n\t\t}\n\t}\n};\n$prev = function(){};\n$e = false;\nwhile ($e ? $odd($prev) : $even()) {\n\t$e = !$e;\n}\n","language":"PHP"},{"code":"(de oddWords ()\n (use C\n (loop\n (until (sub? (prin (setq C (char))) \"!,.:;?\"))\n (T (= \".\" C))\n (setq C (char))\n (T\n (= \".\"\n (prin\n (recur (C)\n (if (sub? C \"!,.:;?\")\n C\n (prog1 (recurse (char)) (prin C)) ) ) ) ) ) )\n (prinl) ) )\n","language":"PicoLisp"},{"code":"(in \"txt1\" (oddWords))\n(in \"txt2\" (oddWords))\n","language":"PicoLisp"},{"code":"test: procedure options (main); /* 2 August 2014 */\n declare (ch, ech) character (1);\n declare odd file;\n\nget_word: procedure recursive;\n declare ch character (1);\n\n get file (odd) edit (ch) (a(1));\n if index('abcdefghijklmnopqrstuvwxyz', ch) > 0 then call get_word;\n if index('abcdefghijklmnopqrstuvwxyz', ch) > 0 then\n put edit (ch) (a);\n else ech = ch;\nend get_word;\n\n open file (odd) input title ('/ODDWORD.DAT,TYPE(text),recsize(100)');\n do forever;\n do until (index('abcdefghijklmnopqrstuvwxyz', ch) = 0 );\n get file (odd) edit (ch) (a(1)); put edit (ch) (a);\n end;\n if ch = '.' then leave;\n call get_word;\n put edit (ech) (a);\n if ech = '.' then leave;\n end;\nend test;\n","language":"PL-I"},{"code":"odd_word_problem :-\n\tread_line_to_codes(user_input, L),\n\teven_word(L, Out, []),\n\tstring_to_list(Str, Out),\n\twriteln(Str).\n\neven_word(\".\") --> \".\".\n\neven_word([H | T]) -->\n\t{char_type(H,alnum)},\n\t[H],\n\teven_word(T).\n\neven_word([H | T]) -->\n\t[H],\n\todd_word(T, []).\n\nodd_word(\".\", R) --> R, \".\".\n\nodd_word([H|T], R) -->\n\t{char_type(H,alnum)},\n\todd_word(T, [H | R]).\n\nodd_word([H|T], R) -->\n\tR,\n\t[H],\n\teven_word(T).\n","language":"Prolog"},{"code":"#False = 0\n#True = 1\n\nGlobal *inputPtr.Character\n\nMacro nextChar()\n *inputPtr + SizeOf(Character)\nEndMacro\n\nProcedure isPunctuation(c.s)\n If FindString(\"!?()[]{},.;:-'\" + #DQUOTE$, c)\n ProcedureReturn #True\n EndIf\n ProcedureReturn #False\nEndProcedure\n\nProcedure oddWord()\n Protected c.c\n c = *inputPtr\\c\n If isPunctuation(Chr(*inputPtr\\c))\n ProcedureReturn\n Else\n nextChar()\n oddWord()\n EndIf\n Print(Chr(c))\nEndProcedure\n\nProcedure oddWordProblem(inputStream.s)\n *inputPtr = @inputStream\n Define isOdd = #False\n While *inputPtr\\c\n If isOdd\n oddWord()\n Else\n Repeat\n Print(Chr(*inputPtr\\c))\n nextChar()\n Until isPunctuation(Chr(*inputPtr\\c))\n EndIf\n Print(Chr(*inputPtr\\c))\n isOdd ! 1 ;toggle word indicator\n nextChar()\n Wend\nEndProcedure\n\nDefine inputStream.s\nIf OpenConsole()\n Repeat\n PrintN(#CRLF$ + #CRLF$ + \"Enter a series of words consisting only of English letters (i.e. a-z, A-Z)\")\n PrintN(\"and that are separated by a punctuation mark (i.e. !?()[]{},.;:-' or \" + #DQUOTE$ + \").\")\n inputStream = Input()\n oddWordProblem(inputStream) ;assume input is correct\n Until inputStream = \"\"\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"from sys import stdin, stdout\n\ndef char_in(): return stdin.read(1)\ndef char_out(c): stdout.write(c)\n\ndef odd(prev = lambda: None):\n\ta = char_in()\n\tif not a.isalpha():\n\t\tprev()\n\t\tchar_out(a)\n\t\treturn a != '.'\n\n\t# delay action until later, in the shape of a closure\n\tdef clos():\n\t\tchar_out(a)\n\t\tprev()\n\n\treturn odd(clos)\n\ndef even():\n\twhile True:\n\t\tc = char_in()\n\t\tchar_out(c)\n\t\tif not c.isalpha(): return c != '.'\n\ne = False\nwhile odd() if e else even():\n\te = not e\n","language":"Python"},{"code":"$ echo \"what,is,the;meaning,of:life.\" | python odd.py\nwhat,si,the;gninaem,of:efil.\n$ echo \"we,are;not,in,kansas;any,more.\" | python odd.py\nwe,era;not,ni,kansas;yna,more.\n","language":"Python"},{"code":"from sys import stdin, stdout\n\ndef char_in(): return stdin.read(1)\ndef char_out(c): stdout.write(c)\n\ndef odd():\n\ta = char_in()\n\tif a.isalpha():\n\t\tr = odd()\n\t\tchar_out(a)\n\t\treturn r\n\n\t# delay printing terminator until later, in the shape of a closure\n\tdef clos():\n\t\tchar_out(a)\n\t\treturn a != '.'\n\n\treturn clos\n\ndef even():\n\twhile True:\n\t\tc = char_in()\n\t\tchar_out(c)\n\t\tif not c.isalpha(): return c != '.'\n\ne = False\nwhile odd()() if e else even():\n\te = not e\n","language":"Python"},{"code":"from sys import stdin, stdout\n\ndef fwd(c):\n if c.isalpha():\n return [stdout.write(c), (yield from fwd((yield f)))][1]\n else:\n return c\n\ndef rev(c):\n if c.isalpha():\n return [(yield from rev((yield r))), stdout.write(c)][0]\n else:\n return c\n\ndef fw():\n while True:\n stdout.write((yield from fwd((yield r))))\n\ndef re():\n while True:\n stdout.write((yield from rev((yield f))))\n\nf = fw()\nr = re()\nnext(f)\nnext(r)\n\ncoro = f\nwhile True:\n c = stdin.read(1)\n if not c:\n break\n coro = coro.send(c)\n","language":"Python"},{"code":"[ upper dup lower != ] is letter ( c --> b )\n\n forward is backwords ( $ --> $ )\n\n[ [ behead\n dup letter while\n emit again ]\n dup emit\n char . !=\n if backwords ] is forwords ( $ --> $ )\n\n[ [ behead\n dup letter while\n swap recurse\n rot emit ]\n dup emit\n char . !=\n if forwords ] resolves backwords ( $ --> $ )\n\n[ forwords drop cr ] is oddwords ( $ --> )\n\n$ \"we,are;not,in,kansas;any,more.\" oddwords\n$ \"what,is,the;meaning,of:life.\" oddwords\n","language":"Quackery"},{"code":"#!/bin/sh\n#|\nexec racket -tm- \"$0\" \"$@\"\n|#\n\n#lang racket\n\n(define (even k)\n (define c (read-char))\n (cond [(eq? c eof) (k)]\n [(not (char-alphabetic? c)) (k) (write-char c) (odd)]\n [else (even (λ() (write-char c) (k)))]))\n\n(define (odd)\n (define c (read-char))\n (unless (eq? c eof)\n (write-char c)\n (if (char-alphabetic? c) (odd) (even void))))\n\n(provide main)\n(define (main) (odd) (newline))\n\n;; (with-input-from-string \"what,is,the;meaning,of:life.\" main)\n;; ;; -> what,si,the;gninaem,of:efil.\n;; (with-input-from-string \"we,are;not,in,kansas;any,more.\" main)\n;; ;; -> we,era;not,ni,kansas;yna,more.\n","language":"Racket"},{"code":"my &in = { $*IN.getc // last }\n\nloop {\n ew(in);\n ow(in).print;\n}\n\nmulti ew ($_ where /\\w/) { .print; ew(in); }\nmulti ew ($_) { .print; next when \"\\n\"; }\n\nmulti ow ($_ where /\\w/) { ow(in) x .print; }\nmulti ow ($_) { $_; }\n","language":"Raku"},{"code":"/*REXX program solves the odd word problem by only using (single) byte input/output.*/\n iFID_ = 'ODDWORD.IN' /*Note: numeric suffix is added later.*/\n oFID_ = 'ODDWORD.' /* \" \" \" \" \" \" */\n do case=1 for 2; #= 0 /*#: is the number of characters read.*/\n iFID= iFID_ || case /*read ODDWORD.IN1 or ODDWORD.IN2 */\n oFID= oFID_ || case /*write ODDWORD.1 or ODDWORD.2 */\n say; say; say '════════ reading file: ' iFID \"════════\" /* ◄■■■■■■■■■ optional. */\n\n do until x==. /* [↓] perform until reaching a period*/\n do until \\datatype(x, 'M') /* [↓] \" \" punctuation found*/\n call rChar /*read a single character. */\n call wChar /*write \" \" \" */\n end /*until \\data···*/ /* [↑] read/write until punctuation. */\n if x==. then leave /*is this the end─of─sentence (period)?*/\n call readLetters; punct= # /*save the location of the punctuation.*/\n do j=#-1 by -1 /*read some characters backwards. */\n call rChar j /*read previous word (backwards). */\n if \\datatype(x, 'M') then leave /*Found punctuation? Then leave J. */\n call wChar /*write a character (which is a letter)*/\n end /*j*/ /* [↑] perform for \"even\" words. */\n call rLett /*read letters until punctuation found.*/\n call wChar; #= punct /*write a char; punctuation location. */\n end /*until x==.*/\n end /*case*/ /* [↑] process both of the input files*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrLett: do until \\datatype(x, 'M'); call rChar; end; return\nwChar: call charout , x /*console*/; call charout oFID, x /*file*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrChar: if arg()==0 then do; x= charin(iFID); #= #+1; end /*read next char*/\n else x= charin(iFID, arg(1) ); /* \" specific \" */ return\n","language":"REXX"},{"code":"# Project : Odd word problem\n\ntest = \"what,is,the;meaning,of:life.\"\nn1 = 1\ntestarr = []\ntestorigin = test\ntest = substr(test, \",\", \" \")\ntest = substr(test, \";\", \" \")\ntest = substr(test, \":\", \" \")\ntest = substr(test, \".\", \" \")\n\nwhile true\n n2 = substring(test, \" \", n1)\n n3 = substring(test, \" \", n2 + 1)\n if n2>0 and n3>0\n strcut = substr(test, n2 + 1, n3 - n2)\n strcut = trim(strcut)\n if strcut != \"\"\n add(testarr, strcut)\n n1 = n3 + 1\n else\n exit\n ok\n ok\nend\n\nfor n = 1 to len(testarr)\n strrev = revstr(testarr[n])\n testorigin = substr(testorigin, testarr[n], strrev)\nnext\nsee testorigin + nl\n\nfunc Substring str,substr,n\n newstr=right(str,len(str)-n+1)\n nr = substr(newstr, substr)\n return n + nr -1\n\nfunc revstr(cStr)\n cStr2 = \"\"\n for x = len(cStr) to 1 step -1\n cStr2 += cStr[x]\n next\n return cStr2\n","language":"Ring"},{"code":"f, r = nil\nfwd = proc {|c|\n c =~ /[[:alpha:]]/ ? [(print c), fwd[Fiber.yield f]][1] : c }\nrev = proc {|c|\n c =~ /[[:alpha:]]/ ? [rev[Fiber.yield r], (print c)][0] : c }\n\n(f = Fiber.new { loop { print fwd[Fiber.yield r] }}).resume\n(r = Fiber.new { loop { print rev[Fiber.yield f] }}).resume\n\ncoro = f\nuntil $stdin.eof?\n coro = coro.resume($stdin.getc)\nend\n","language":"Ruby"},{"code":"require 'continuation' unless defined? Continuation\nrequire 'stringio'\n\n# Save current continuation.\ndef savecc(*data)\n # With MRI 1.8 (but not 1.9), the array literal\n # [callcc {|cc| cc}, *data]\n # used the wrong return value from callcc. The workaround is to\n # put callcc outside the array literal.\n continuation = callcc {|cc| cc}\n [continuation, *data]\nend\n\n# Jump back to continuation, where savecc will return [nil, *data].\ndef jump_back(continuation)\n continuation[nil]\nend\n\ndef read_odd_word(input, output)\n first_continuation, last_continuation = nil\n reverse = false\n # Read characters. Loop until end of stream.\n while c = input.getc\n c = c.chr # For Ruby 1.8, convert Integer to String.\n if c =~ /[[:alpha:]]/\n # This character is a letter.\n if reverse\n # Odd word: Write letters in reverse order.\n saving, last_continuation, c = savecc(last_continuation, c)\n if saving\n last_continuation = saving\n else\n # After jump: print letters in reverse.\n output.print c\n jump_back last_continuation\n end\n else\n # Even word: Write letters immediately.\n output.print c\n end\n else\n # This character is punctuation.\n if reverse\n # End odd word. Fix trampoline, follow chain of continuations\n # (to print letters in reverse), then bounce off trampoline.\n first_continuation, c = savecc(c)\n if first_continuation\n jump_back last_continuation\n end\n output.print c # Write punctuation.\n reverse = false # Begin even word.\n else\n output.print c # Write punctuation.\n reverse = true # Begin odd word.\n # Create trampoline to bounce to (future) first_continuation.\n last_continuation, = savecc\n unless last_continuation\n jump_back first_continuation\n end\n end\n end\n end\n output.puts # Print a cosmetic newline.\nend\n\ndef odd_word(string)\n read_odd_word StringIO.new(string), $stdout\nend\n\nodd_word \"what,is,the;meaning,of:life.\"\nodd_word \"we,are;not,in,kansas;any,more.\"\n","language":"Ruby"},{"code":"open \"oddWord.txt\" for input as #f ' read input stream\nwhile not(eof(#f))\nline input #f, a$\noddW$ = \"\" ' begin the result oddW with blank\npx = 0 ' begin word search location with 0\ncount = 0 ' begin the word count to 0\nwhile x < len(a$) ' look at each character\n\tx = instr(a$,\",\",px) ' search for comma (,)\n\tif x = 0 then x = len(a$) ' no more commas?\n\tx1 = instr(a$,\";\",px) ' search for (;)\n\tx2 = instr(a$,\":\",px) ' search for (:)\n\tif x1 <> 0 then x = min(x,x1) ' what came first the , ; or :\n\tif x2 <> 0 then x = min(x,x2)\n\n\tw$ = mid$(a$,px,x - px) ' get the word seperated by , ; or :\n\n\tif count and 1 then ' is it the odd word\n\t w1$ = \"\"\n\t\tfor i = len(w$) to 1 step -1\n\t\t\tw1$ = w1$ + mid$(w$,i,1) ' reverse odd words\n\t\tnext i\n\t\tw$ = w1$\n\tend if\n oddW$ = oddW$ + w$ + mid$(a$,x,1) ' add the word to the end of oddW$\n\tpx = x + 1 ' bump word search location for next while\n\tcount = count + 1 ' count the words\nwend\nprint a$;\" -> \";oddW$ ' print the original and result\nnext ii\nwend\nclose #f\n","language":"Run-BASIC"},{"code":"import scala.io.Source\nimport java.io.PrintStream\n\ndef process(s: Source, p: PrintStream, w: Int = 0): Unit = if (s.hasNext) s.next match {\n case '.' => p append '.'\n case c if !Character.isAlphabetic(c) => p append c; reverse(s, p, w + 1)\n case c => p append c; process(s, p, w)\n}\n\ndef reverse(s: Source, p: PrintStream, w: Int = 0, x: Char = '.'): Char = s.next match {\n case c if !Character.isAlphabetic(c) => p append x; c\n case c => val n = reverse(s, p, w, c);\n if (x == '.') {p append n; process(s, p, w + 1)} else p append x; n\n}\n\nprocess(Source.fromString(\"what,is,the;meaning,of:life.\"), System.out); println\nprocess(Source.fromString(\"we,are;not,in,kansas;any,more.\"), System.out); println\n","language":"Scala"},{"code":"(define (odd)\n (let ((c (read-char)))\n (if (char-alphabetic? c)\n (let ((r (odd)))\n\t(write-char c)\n\tr)\n (lambda () (write-char c) (char=? c #\\.)))))\n\n(define (even)\n (let ((c (read-char)))\n (write-char c)\n (if (char-alphabetic? c)\n (even)\n (char=? c #\\.))))\n\n(let loop ((i #f))\n (if (if i ((odd)) (even))\n (exit)\n (loop (not i))))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n include \"chartype.s7i\";\n\nconst func char: doChar (in boolean: doReverse) is func\n result\n var char: delimiter is ' ';\n local\n var char: ch is ' ';\n begin\n ch := getc(IN);\n if ch in letter_char then\n if doReverse then\n delimiter := doChar(doReverse);\n write(ch);\n else\n write(ch);\n delimiter := doChar(doReverse);\n end if;\n else\n delimiter := ch;\n end if;\n end func;\n\nconst proc: main is func\n local\n var char: delimiter is ' ';\n var boolean: doReverse is FALSE;\n begin\n repeat\n delimiter := doChar(doReverse);\n write(delimiter);\n doReverse := not doReverse;\n until delimiter = '.';\n writeln;\n end func;\n","language":"Seed7"},{"code":"func rev {\n (var c = STDIN.getc) \\\\ return()\n if (c ~~ /^[a-z]\\z/i) {\n var r = rev()\n print c\n return r\n }\n return c\n}\n\nvar (n=0, l=false)\nwhile (defined(var c = STDIN.getc)) {\n var w = (c ~~ /^[a-z]\\z/i)\n ++n if (w && !l)\n l = w\n if (n & 1) {\n print c\n } else {\n var r = rev()\n print(c, r)\n n = 0\n l = false\n }\n}\n","language":"Sidef"},{"code":"package require Tcl 8.6\n\nproc fwd c {\n expr {[string is alpha $c] ? \"[fwd [yield f][puts -nonewline $c]]\" : $c}\n}\nproc rev c {\n expr {[string is alpha $c] ? \"[rev [yield r]][puts -nonewline $c]\" : $c}\n}\ncoroutine f while 1 {puts -nonewline [fwd [yield r]]}\ncoroutine r while 1 {puts -nonewline [rev [yield f]]}\nfor {set coro f} {![eof stdin]} {} {\n set coro [$coro [read stdin 1]]\n}\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\ninputstring=*\nDATA what,is,the;meaning,of:life.\nDATA we,are;not,in,kansas;any,more.\n\nBUILD C_GROUP >[pu]=\".,;:-\"\n\nLOOP i=inputstring\npu=STRINGS (i,\"|>[pu]|\")\nwo=STRINGS (i,\"|<></|\")\noutputstring=\"\"\n loop n,w=wo,p=pu\n r=MOD(n,2)\n IF (r==0) w=TURN (w)\n outputstring=CONCAT(outputstring,w,p)\nENDLOOP\nPRINT outputstring\nENDLOOP\n","language":"TUSCRIPT"},{"code":"const str = 'what,is,the;meaning,of:life.'\n\nfn main() {\n\tmut temp, mut new_str := '', ''\n\tmut switch := true\n\tfor field in str {\n\t\ttemp += field.ascii_str()\n\t\tif field.is_alnum() == false {\n\t\t\tif switch == true {\n\t\t\t\tnew_str += temp\n\t\t\t\ttemp =''\t\t\t\n\t\t\t\tswitch = false\n\t\t\t\tcontinue\n\t\t\t}\t\t\n\t\t\telse {\n\t\t\t\tnew_str += temp.all_before_last(field.ascii_str()).reverse() + field.ascii_str()\n\t\t\t\ttemp =''\t\t\t\n\t\t\t\tswitch = true\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\t\t\n\t}\n\tprintln(new_str)\n}\n","language":"V-(Vlang)"},{"code":"Private Function OddWordFirst(W As String) As String\nDim i As Integer, count As Integer, l As Integer, flag As Boolean, temp As String\n count = 1\n Do\n flag = Not flag\n l = FindNextPunct(i, W) - count + 1\n If flag Then\n temp = temp & ExtractWord(W, count, l)\n Else\n temp = temp & ReverseWord(W, count, l)\n End If\n Loop While count < Len(W)\n OddWordFirst = temp\nEnd Function\n\nPrivate Function FindNextPunct(d As Integer, W As String) As Integer\nConst PUNCT As String = \",;:.\"\n Do\n d = d + 1\n Loop While InStr(PUNCT, Mid(W, d, 1)) = 0\n FindNextPunct = d\nEnd Function\n\nPrivate Function ExtractWord(W As String, c As Integer, i As Integer) As String\n ExtractWord = Mid(W, c, i)\n c = c + Len(ExtractWord)\nEnd Function\n\nPrivate Function ReverseWord(W As String, c As Integer, i As Integer) As String\nDim temp As String, sep As String\n temp = Left(Mid(W, c, i), Len(Mid(W, c, i)) - 1)\n sep = Right(Mid(W, c, i), 1)\n ReverseWord = StrReverse(temp) & sep\n c = c + Len(ReverseWord)\nEnd Function\n","language":"VBA"},{"code":"Private Function OddWordSecond(Words As String) As String\nDim i&, count&, t$, cpt&, j&, l&, d&, f As Boolean\nConst PUNCT As String = \",;:\"\n For i = 1 To Len(Words)\n 'first word\n If i = 1 Then\n cpt = 1\n Do\n t = t & Mid(Words, cpt, 1)\n cpt = cpt + 1\n Loop While InStr(PUNCT, Mid(Words, cpt, 1)) = 0 And cpt < Len(Words)\n i = cpt\n t = t & Mid(Words, i, 1)\n End If\n If Right(t, 1) = \".\" Then Exit For\n 'Odd words ==> reverse\n While InStr(PUNCT, Mid(Words, cpt + 1, 1)) = 0 And cpt < Len(Words)\n cpt = cpt + 1\n Wend\n l = IIf(f = True, i, i + 1)\n d = IIf(cpt = Len(Words), cpt - 1, cpt)\n For j = d To l Step -1\n t = t & Mid(Words, j, 1)\n Next\n If cpt = Len(Words) Then t = t & \".\": Exit For\n f = True\n i = cpt + 1\n t = t & Mid(Words, i, 1)\n 'Even words\n cpt = i + 1\n t = t & Mid(Words, cpt, 1)\n Do\n cpt = cpt + 1\n t = t & Mid(Words, cpt, 1)\n Loop While InStr(PUNCT, Mid(Words, cpt, 1)) = 0 And cpt < Len(Words)\n i = cpt\n Next\n OddWordSecond = t\nEnd Function\n","language":"VBA"},{"code":"Option Explicit\n\nSub Main()\n Debug.Print \"Input : \" & \"we,are;not,in,kansas;any,more.\"\n Debug.Print \"First way : \" & OddWordFirst(\"we,are;not,in,kansas;any,more.\")\n Debug.Print \"Second way : \" & OddWordSecond(\"we,are;not,in,kansas;any,more.\")\n Debug.Print \"\"\n Debug.Print \"Input : \" & \"what,is,the;meaning,of:life.\"\n Debug.Print \"First way : \" & OddWordFirst(\"what,is,the;meaning,of:life.\")\n Debug.Print \"Second way : \" & OddWordSecond(\"what,is,the;meaning,of:life.\")\nEnd Sub\n","language":"VBA"},{"code":"import \"io\" for Stdin,Stdout\nimport \"./str\" for Char\n\nvar fwrite = Fn.new { |ch|\n System.write(ch)\n Stdout.flush()\n}\n\nvar doChar // recursive\ndoChar = Fn.new { |odd, f|\n var c = Stdin.readByte()\n if (!c) return false // end of stream reached\n var ch = String.fromByte(c)\n\n var writeOut = Fn.new {\n fwrite.call(ch)\n if (f) f.call()\n }\n\n if (!odd) fwrite.call(ch)\n if (Char.isLetter(ch)) return doChar.call(odd, writeOut)\n if (odd) {\n if (f) f.call()\n fwrite.call(ch)\n }\n return ch != \".\"\n}\n\nfor (i in 0..1) {\n var b = true\n while (doChar.call(!b, null)) b = !b\n Stdin.readByte() // remove \\n from buffer\n System.print(\"\\n\")\n}\n","language":"Wren"},{"code":"proc OWP;\nint B;\n func Odd;\n int S, B;\n [S:= ChIn(8);\n if S < ^A then \\punct\\ return S;\n B:= Odd;\n ChOut(0, S);\n return B;\n ];\n\n[OpenI(8);\nloop [loop [B:= ChIn(8);\n ChOut(0, B);\n if B = ^. then return;\n if B < ^A \\punct\\ then quit;\n ];\n B:= Odd;\n ChOut(0, B);\n if B = ^. then return;\n ];\n];\n\n[OpenO(8);\nText(8, \"what,is,the;meaning,of:life. \");\nOWP;\nCrLf(0);\n\nOpenO(8);\nText(8, \"we,are;not,in,kansas;any,more. \");\nOWP;\nCrLf(0);\n]\n","language":"XPL0"},{"code":"var [const] delim=\",:;/?!@#$%^&*()_+\", stop=\".\";\nfcn oddly(inStream){\n inStream=inStream.walker(3); // character iterator: string, file, etc\n doWord:=fcn(inStream,rev,f){ // print next word forewards or reverse\n c:=inStream.next();\n if(not rev) c.print();\n if(not (c==stop or delim.holds(c)))\n\t return(self.fcn(inStream,rev,'{ c.print(); f(); }));\n if(rev){ f(); c.print(); }\n return(c!=stop);\n };\n tf:=Walker.cycle(False,True); // every other word printed backwords\n while(doWord(inStream, tf.next(), Void)) {}\n println();\n}\n","language":"Zkl"},{"code":"oddly(\"what,is,the;meaning,of:life.\");\noddly(Data(0,String,\"we,are;not,in,kansas;any,more.\"));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Odd_word_problem\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nWrite a program that solves the [http://c2.com/cgi/wiki?OddWordProblem odd word problem] with the restrictions given below.\\n\\n\\n;Description:\\nYou are promised an input stream consisting of English letters and punctuations. \\n\\nIt is guaranteed that:\\n* the words (sequence of consecutive letters) are delimited by one and only one punctuation,\\n* the stream will begin with a word,\\n* the words will be at least one letter long, and \\n* a full stop (a period, [<b>.</b>]) appears after, and only after, the last word.\\n\\n\\n;Example:\\nA stream with six words: \\n:: <big><code>what,is,the;meaning,of:life.</code></big> \\n\\n\\nThe task is to reverse the letters in every other word while leaving punctuations intact, producing:\\n:: <big><code>what,si,the;gninaem,of:efil.</code></big> \\nwhile observing the following restrictions:\\n# Only I/O allowed is reading or writing one character at a time, which means: no reading in a string, no peeking ahead, no pushing characters back into the stream, and no storing characters in a global variable for later use;\\n# You '''are not''' to explicitly save characters in a collection data structure, such as arrays, strings, hash tables, etc, for later reversal;\\n# You '''are''' allowed to use recursions, closures, continuations, threads, co-routines, etc., even if their use implies the storage of multiple characters.\\n\\n\\n;Test cases:\\nWork on both the \\\"life\\\" example given above, and also the text:\\n:: <big><code>we,are;not,in,kansas;any,more.</code></big>\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\n\\nprocedure Odd_Word_Problem is\\n\\n use Ada.Text_IO; -- Get, Put, and Look_Ahead\\n\\n function Current return Character is\\n -- reads the current input character, without consuming it\\n End_Of_Line: Boolean;\\n C: Character;\\n begin\\n Look_Ahead(C, End_Of_Line);\\n if End_Of_Line then\\n raise Constraint_Error with \\\"end of line before the terminating '.'\\\";\\n end if;\\n return C;\\n end Current;\\n\\n procedure Skip is\\n -- consumes the current input character\\n C: Character;\\n begin\\n Get(C);\\n end Skip;\\n\\n function Is_Alpha(Ch: Character) return Boolean is\\n begin\\n return (Ch in 'a' .. 'z') or (Ch in 'A' .. 'Z');\\n end Is_Alpha;\\n\\n procedure Odd_Word(C: Character) is\\n begin\\n if Is_Alpha(C) then\\n Skip;\\n Odd_Word(Current);\\n Put(C);\\n end if;\\n end Odd_Word;\\n\\nbegin -- Odd_Word_Problem\\n Put(Current);\\n while Is_Alpha(Current) loop -- read an even word\\n Skip;\\n Put(Current);\\n end loop;\\n if Current /= '.' then -- read an odd word\\n Skip;\\n Odd_Word(Current);\\n Put(Current);\\n if Current /= '.' then -- read the remaining words\\n Skip;\\n Odd_Word_Problem;\\n end if;\\n end if;\\nend Odd_Word_Problem;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# recursively reverses the current word in the input and returns the #\\n# the character that followed it #\\n# \\\"ch\\\" should contain the first letter of the word on entry and will be #\\n# updated to the punctuation following the word on exit #\\nPROC reverse word = ( REF CHAR ch )VOID:\\nBEGIN\\n\\n CHAR next ch;\\n\\n read( ( next ch ) );\\n\\n IF ( next ch <= \\\"Z\\\" AND next ch >= \\\"A\\\" )\\n OR ( next ch <= \\\"z\\\" AND next ch >= \\\"a\\\" )\\n THEN\\n reverse word( next ch )\\n FI;\\n\\n print( ( ch ) );\\n\\n ch := next ch\\n\\nEND; # reverse word #\\n\\n\\n\\n# recursively prints the current word in the input and returns the #\\n# character that followed it #\\n# \\\"ch\\\" should contain the first letter of the word on entry and will be #\\n# updated to the punctuation following the word on exit #\\nPROC normal word = ( REF CHAR ch )VOID:\\nBEGIN\\n\\n print( ( ch ) );\\n read ( ( ch ) );\\n\\n IF ( ch <= \\\"Z\\\" AND ch >= \\\"A\\\" )\\n OR ( ch <= \\\"z\\\" AND ch >= \\\"a\\\" )\\n THEN\\n normal word( ch )\\n FI\\n\\nEND; # normal word #\\n\\n\\n\\n# read and print words and punctuation from the input stream, reversing #\\n# every second word #\\nPROC reverse every other word = VOID:\\nBEGIN\\n\\n CHAR ch;\\n\\n read( ( ch ) );\\n\\n WHILE\\n ch /= \\\".\\\"\\n DO\\n normal word( ch );\\n IF ch /= \\\".\\\"\\n THEN\\n print( ( ch ) );\\n read ( ( ch ) );\\n reverse word( ch )\\n FI\\n OD;\\n\\n print( ( ch ) )\\n\\nEND; # reverse every other word #\\n\\n\\n\\nmain: (\\n reverse every other word\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"str := \\\"what,is,the;meaning,of:life.\\\"\\nloop, parse, str\\n\\tif (A_LoopField ~= \\\"[[:punct:]]\\\")\\n\\t\\tres .= A_LoopField, toggle:=!toggle\\n\\telse\\n\\t\\tres := toggle ? RegExReplace(res, \\\".*[[:punct:]]\\\\K\\\", A_LoopField ) : res A_LoopField\\nMsgBox % res\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"OPEN \\\"/dev/stdin\\\" FOR DEVICE AS in\\n\\nFUNCTION get_odd()\\n\\n LOCAL ch, letter\\n\\n ch = MEMORY(1)\\n GETBYTE ch FROM in\\n\\n IF NOT(REGEX(CHR$(PEEK(ch)), \\\"[[:punct:]]\\\")) THEN\\n letter = get_odd()\\n PRINT CHR$(PEEK(ch));\\n ELSE\\n letter = PEEK(ch)\\n END IF\\n\\n FREE ch\\n RETURN letter\\n\\nEND FUNCTION\\n\\nmem = MEMORY(1)\\nPRINT \\\"Enter string: \\\";\\n\\nWHILE TRUE\\n\\n GETBYTE mem FROM in\\n PRINT CHR$(PEEK(mem));\\n\\n IF REGEX(CHR$(PEEK(mem)), \\\"[[:punct:]]\\\") THEN\\n IF PEEK(mem) <> 46 THEN\\n POKE mem, get_odd()\\n PRINT CHR$(PEEK(mem));\\n END IF\\n IF PEEK(mem) = 46 THEN BREAK\\n END IF\\nWEND\\n\\nFREE mem\\nCLOSE DEVICE in\\n\\nPRINT\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"( ( odd-word\\n = dothis doother forward backward\\n . ( forward\\n = ch\\n . fil$:?ch\\n & put$!ch\\n & ( low$!ch:~<a:~>z&forward$\\n | !ch:~\\\".\\\"\\n )\\n )\\n & ( backward\\n = ch\\n . fil$:?ch\\n & ( low$!ch:~<a:~>z\\n & backward$() (put$!ch&) { This reduces to the return value of backwards$()}\\n | '(.put$($ch)&$ch:~\\\".\\\") { Macro, evaluates to a function with actual ch. }\\n )\\n )\\n & fil$(!arg,r)\\n & ((=forward$).(=(backward$)$))\\n : (?dothis.?doother)\\n & whl\\n ' ( !(dothis.)\\n & (!doother.!dothis):(?dothis.?doother)\\n )\\n & (fil$(,SET,-1)|) { This is how a file is closed: seek the impossible. }\\n )\\n& put$(\\\"what,is,the;meaning,of:life.\\\",\\\"life.txt\\\",NEW)\\n& put$(\\\"we,are;not,in,kansas;any,more.\\\",\\\"kansas.txt\\\",NEW)\\n& odd-word$\\\"life.txt\\\"\\n& put$\\\\n\\n& odd-word$\\\"kansas.txt\\\" { Real file, as Bracmat cannot read a single character from stdin. }\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <ctype.h>\\n\\nstatic int\\nowp(int odd)\\n{\\n int ch, ret;\\n ch = getc(stdin);\\n if (!odd) {\\n putc(ch, stdout);\\n if (ch == EOF || ch == '.')\\n return EOF;\\n if (ispunct(ch))\\n return 0;\\n owp(odd);\\n return 0;\\n } else {\\n if (ispunct(ch))\\n return ch;\\n ret = owp(odd);\\n putc(ch, stdout);\\n return ret;\\n }\\n}\\n\\nint\\nmain(int argc, char **argv)\\n{\\n int ch = 1;\\n while ((ch = owp(!ch)) != EOF) {\\n if (ch)\\n putc(ch, stdout);\\n if (ch == '.')\\n break;\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <cctype>\\n#include <functional>\\n\\nusing namespace std;\\n\\nbool odd()\\n{\\n function<void ()> prev = []{};\\n while(true) {\\n int c = cin.get();\\n if (!isalpha(c)) {\\n prev();\\n cout.put(c);\\n return c != '.';\\n }\\n prev = [=] { cout.put(c); prev(); };\\n }\\n}\\n\\nbool even()\\n{\\n while(true) {\\n int c;\\n cout.put(c = cin.get());\\n if (!isalpha(c)) return c != '.';\\n }\\n}\\n\\n\\nint main()\\n{\\n bool e = false;\\n while( e ? odd() : even() ) e = !e;\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"String[] meaning = [\\\"what,\\\", \\\"is,\\\", \\\"the;\\\", \\\"meaning,\\\", \\\"of:\\\", \\\"life.\\\"];\\nString[] kansas = [\\\"we,\\\", \\\"are,\\\", \\\"not,\\\", \\\"in,\\\", \\\"kansas;\\\", \\\"any,\\\", \\\"more.\\\"];\\n\\nshared void run() {\\n print(\\\"\\\".join(reverseWords(meaning)));\\n print(\\\"\\\".join(reverseWords(kansas)));\\n}\\n\\nString[] reverseWords(String[] words)\\n => recursiveReverseWords(words, []);\\n\\nString[] recursiveReverseWords(String[] remOrig, String[] revWords)\\n => if (nonempty remOrig)\\n then recursiveReverseWords(remOrig.rest,\\n revWords.withTrailing(reverseWordRecursive(remOrig.first.sequence(),\\n [],\\n revWords.size.even)))\\n else revWords;\\n\\nString reverseWordRecursive(Character[] remOldChars, Character[] revChars, Boolean isEven)\\n => if (nonempty remOldChars)\\n then let (char = remOldChars.first) reverseWordRecursive(remOldChars.rest,\\n conditionalAddChar(char, revChars, isEven),\\n isEven)\\n else String(revChars);\\n\\nCharacter[] conditionalAddChar(Character char, Character[] chars, Boolean isEven)\\n => if (isEven || isPunctuation(char))\\n then chars.withTrailing(char)\\n else chars.withLeading(char);\\n\\nBoolean isPunctuation(Character char)\\n => \\\",.:;\\\".contains(char);\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(defn next-char []\\n (char (.read *in*)))\\n\\n(defn forward []\\n (let [ch (next-char)]\\n (print ch)\\n (if (Character/isLetter ch)\\n (forward)\\n (not= ch \\\\.))))\\n\\n(defn backward []\\n (let [ch (next-char)]\\n (if (Character/isLetter ch)\\n (let [result (backward)]\\n (print ch)\\n result)\\n (fn [] (print ch) (not= ch \\\\.)))) )\\n\\n(defn odd-word [s]\\n (with-in-str s\\n (loop [forward? true]\\n (when (if forward?\\n (forward)\\n ((backward)))\\n (recur (not forward?)))) )\\n (println))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"user=> (odd-word \\\"what,is,the;meaning,of:life.\\\")\\nwhat,si,the;gninaem,of:efil.\\nnil\\nuser=> (odd-word \\\"we,are;not,in,kansas;any,more.\\\")\\nwe,era;not,ni,kansas;yna,more.\\nnil\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"isWordChar = (c) -> /^\\\\w/.test c\\nisLastChar = (c) -> c is '.'\\n\\n# Pass a function that returns an input character and one that outputs a\\n# character. JS platforms' ideas of single-character I/O vary widely, but this\\n# abstraction is adaptable to most or all.\\noddWord = (get, put) ->\\n\\tforwardWord = ->\\n\\t\\tloop\\n\\t\\t\\t# No magic here; buffer then immediately output.\\n\\t\\t\\tc = get()\\n\\t\\t\\tput(c)\\n\\t\\t\\tunless isWordChar(c)\\n\\t\\t\\t\\treturn not isLastChar(c)\\n\\t\\n\\t# NB: (->) is a CoffeeScript idiom for no-op.\\n\\treverseWord = (outputPending = (->)) ->\\n\\t\\tc = get()\\n\\t\\tif isWordChar(c)\\n\\t\\t\\t# Continue word.\\n\\t\\t\\t# Tell recursive call to output this character, then any previously\\n\\t\\t\\t# pending characters, after the next word character, if any, has\\n\\t\\t\\t# been output.\\n\\t\\t\\treverseWord ->\\n\\t\\t\\t\\tput(c)\\n\\t\\t\\t\\toutputPending()\\n\\t\\telse\\n\\t\\t\\t# Word is done.\\n\\t\\t\\t# Output previously pending characters, then this punctuation.\\n\\t\\t\\toutputPending()\\n\\t\\t\\tput(c)\\n\\t\\t\\treturn not isLastChar(c)\\n\\t\\n\\t# Alternate between forward and reverse until one or the other reports that\\n\\t# the end-of-input mark has been reached (causing a return of false).\\n\\tcontinue while forwardWord() and reverseWord()\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"isWordChar = (c) -> /^\\\\w/.test c\\nisLastChar = (c) -> c is '.'\\n\\noddWord = (get, put) ->\\n\\tforwardWord = ->\\n\\t\\tloop\\n\\t\\t\\tc = get()\\n\\t\\t\\tput(c)\\n\\t\\t\\tunless isWordChar(c)\\n\\t\\t\\t\\treturn not isLastChar(c)\\n\\t\\n\\treverseWord = (outputPending = (->)) ->\\n\\t\\tc = get()\\n\\t\\tif isWordChar(c)\\n\\t\\t\\treverseWord ->\\n\\t\\t\\t\\tput(c)\\n\\t\\t\\t\\toutputPending()\\n\\t\\telse\\n\\t\\t\\toutputPending()\\n\\t\\t\\tput(c)\\n\\t\\t\\treturn not isLastChar(c)\\n\\t\\n\\tcontinue while forwardWord() and reverseWord()\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"# Redefine as necessary for target platform.\\nprintln = (z) -> console.log z\\n\\ntestData = [\\n\\t[\\n\\t\\t\\\"what,is,the;meaning,of:life.\\\"\\n\\t\\t\\\"what,si,the;gninaem,of:efil.\\\"\\n\\t]\\n\\t[\\n\\t\\t\\\"we,are;not,in,kansas;any,more.\\\"\\n\\t\\t\\\"we,era;not,ni,kansas;yna,more.\\\"\\n\\t]\\n]\\n\\nresults = for [testString, expectedResult] in testData\\n\\t# This test machinery uses string buffers for input and output. If your JS\\n\\t# platform sports single-character I/O, by all means, adapt to taste.\\n\\tgetCursor = 0\\n\\tputBuffer = \\\"\\\"\\n\\tget = ->\\n\\t\\ttestString.charAt getCursor++\\n\\tput = (c) ->\\n\\t\\tputBuffer += c\\n\\toddWord(get,put)\\n\\t[testString, expectedResult, putBuffer, putBuffer is expectedResult]\\n\\nprintln result for result in results\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun odd-word (s)\\n (let ((stream (make-string-input-stream s)))\\n (loop for forwardp = t then (not forwardp)\\n while (if forwardp\\n (forward stream)\\n (funcall (backward stream)))) ))\\n\\n(defun forward (stream)\\n (let ((ch (read-char stream)))\\n (write-char ch)\\n (if (alpha-char-p ch)\\n\\t(forward stream)\\n (char/= ch #\\\\.))))\\n\\n(defun backward (stream)\\n (let ((ch (read-char stream)))\\n (if (alpha-char-p ch)\\n (prog1 (backward stream) (write-char ch))\\n #'(lambda () (write-char ch) (char/= ch #\\\\.)))) )\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"? (odd-word \\\"what,is,the;meaning,of:life.\\\")\\nwhat,si,the;gninaem,of:efil.\\nNIL\\n? (odd-word \\\"we,are;not,in,kansas;any,more.\\\")\\nwe,era;not,ni,kansas;yna,more.\\nNIL\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"bool doChar(in bool odd, in void delegate() nothrow f=null) nothrow {\\n import core.stdc.stdio, std.ascii;\\n\\n immutable int c = getchar;\\n if (!odd)\\n c.putchar;\\n if (c.isAlpha)\\n return doChar(odd, { c.putchar; if (f) f(); });\\n if (odd) {\\n if (f) f();\\n c.putchar;\\n }\\n return c != '.';\\n}\\n\\nvoid main() {\\n bool i = true;\\n while (doChar(i = !i)) {}\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Odd_word_problem;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Console,\\n System.Character;\\n\\nfunction doChar(isOdd: boolean; f: TProc = nil): Boolean;\\nbegin\\n var c: char := Console.ReadKey(True).KeyChar;\\n\\n if not isOdd then\\n Write(c);\\n\\n if c.IsLetter then\\n exit(doChar(isOdd,\\n procedure\\n begin\\n Write(c);\\n if assigned(f) then\\n f();\\n end));\\n\\n if isOdd then\\n begin\\n if Assigned(f) then\\n f();\\n write(c);\\n end;\\n\\n exit(c <> '.');\\n\\nend;\\n\\nbegin\\n var i: boolean := false;\\n while doChar(i) do\\n i := not i;\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"global inpi inp$ .\\nfunc$ read .\\n inpi += 1\\n return substr inp$ inpi 1\\n.\\nfunc ispunct c$ .\\n if c$ = \\\".\\\" or c$ = \\\":\\\" or c$ = \\\";\\\" or c$ = \\\",\\\"\\n return 1\\n .\\n return 0\\n.\\nfunc$ handle odd .\\n c$ = read\\n if ispunct c$ = 1\\n return c$\\n .\\n if odd = 0\\n write c$\\n r$ = handle 0\\n return r$\\n else\\n r$ = handle 1\\n write c$\\n return r$\\n .\\n.\\nproc go . .\\n repeat\\n c$ = handle odd\\n write c$\\n until c$ = \\\".\\\"\\n odd = 1 - odd\\n .\\n print \\\"\\\"\\n.\\nrepeat\\n inp$ = input\\n until inp$ = \\\"\\\"\\n inpi = 0\\n go\\n.\\ninput_data\\nwe,are;not,in,kansas;any,more.\\nwhat,is,the;meaning,of:life.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"(lib 'sequences)\\n(define input-stream null)\\n(define output-stream \\\"\\\")\\n\\n;;---------------------------\\n;; character I/O simulation\\n;; --------------------------\\n(define (read-char) (next input-stream)) ;; #f if EOF\\n(define (write-char c) (when c (set! output-stream (string-append output-stream c))))\\n\\n(define (init-streams sentence)\\n\\t(set! input-stream (procrastinator sentence))\\n\\t(set! output-stream \\\"\\\"))\\n\\n;;---------------------------------\\n;; task , using read-char/write-char\\n;;----------------------------------\\n\\n(define (flop) ; reverses, and returns first non-alpha after word, or EOF\\n\\t(define c (read-char))\\n\\t(if (string-alphabetic? c) (begin0 (flop) (write-char c)) c))\\n\\t\\n(define (flip)\\n (define c (read-char))\\n (if (string-alphabetic? c) (begin (write-char c) (flip)) c))\\n\\n(define (task sentence)\\n\\t (init-streams sentence)\\n\\t (while (and (write-char (flip)) (write-char (flop))))\\n\\t output-stream )\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"(task \\\"what,is,the;meaning,of:life.\\\")\\n → \\\"what,si,the;gninaem,of:efil.\\\"\\n; check diacritical\\n(task \\\"Longtemps,je me suis couché,héhé,hôhô,de bonne heure.\\\")\\n → \\\"Longtemps,ej me sius couché,éhéh,hôhô,ed bonne erueh.\\\"\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Odd_word do\\n def handle(s, false, i, o) when ((s >= \\\"a\\\" and s <= \\\"z\\\") or (s >= \\\"A\\\" and s <= \\\"Z\\\")) do\\n o.(s)\\n handle(i.(), false, i, o)\\n end\\n def handle(s, t, i, o) when ((s >= \\\"a\\\" and s <= \\\"z\\\") or (s >= \\\"A\\\" and s <= \\\"Z\\\")) do\\n d = handle(i.(), :rec, i, o)\\n o.(s)\\n if t == true, do: handle(d, t, i, o), else: d\\n end\\n def handle(s, :rec, _, _), do: s\\n def handle(?., _, _, o), do: o.(?.); :done\\n def handle(:eof, _, _, _), do: :done\\n def handle(s, t, i, o) do\\n o.(s)\\n handle(i.(), not t, i, o)\\n end\\n\\n def main do\\n i = fn() -> IO.getn(\\\"\\\") end\\n o = fn(s) -> IO.write(s) end\\n handle(i.(), false, i, o)\\n end\\nend\\n\\nOdd_word.main\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"handle(S, false, I, O) when (((S >= $a) and (S =< $z)) or ((S >= $A) and (S =< $Z))) ->\\n O(S),\\n handle(I(), false, I, O);\\nhandle(S, T, I, O) when (((S >= $a) and (S =< $z)) or ((S >= $A) and (S =< $Z))) ->\\n D = handle(I(), rec, I, O),\\n O(S),\\n case T of true -> handle(D, T, I, O); _ -> D end;\\nhandle(S, rec, _, _) -> S;\\nhandle($., _, _, O) -> O($.), done;\\nhandle(eof, _, _, _) -> done;\\nhandle(S, T, I, O) -> O(S), handle(I(), not T, I, O).\\n\\nmain([]) ->\\n I = fun() -> hd(io:get_chars([], 1)) end,\\n O = fun(S) -> io:put_chars([S]) end,\\n handle(I(), false, I, O).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen System.Text.RegularExpressions\\n\\nlet mutable Inp = Console.In\\n\\nlet Out c = printf \\\"%c\\\" c; (if c = '.' then Environment.Exit 0)\\n\\nlet In() = Inp.Read() |> Convert.ToChar\\n\\nlet (|WordCharacter|OtherCharacter|) c =\\n if Regex.IsMatch(c.ToString(),\\\"[a-zA-Z]\\\") then\\n WordCharacter\\n else\\n OtherCharacter\\n\\nlet rec forward () =\\n let c = In()\\n let rec backward () : char =\\n let c = In()\\n match c with\\n | WordCharacter ->\\n let s = backward() in Out c; s\\n | OtherCharacter -> c\\n Out c\\n match c with\\n | WordCharacter -> forward()\\n | OtherCharacter -> backward()\\n\\n[<EntryPoint>]\\nlet main argv =\\n if argv.Length > 0 then Inp <- new System.IO.StringReader(argv.[0])\\n let rec loop () = forward() |> Out; loop()\\n loop()\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: continuations kernel io io.streams.string locals unicode.categories ;\\nIN: rosetta.odd-word\\n\\n<PRIVATE\\n! Save current continuation.\\n: savecc ( -- continuation/f )\\n [ ] callcc1 ; inline\\n\\n! Jump back to continuation, where savecc will return f.\\n: jump-back ( continuation -- )\\n f swap continue-with ; inline\\nPRIVATE>\\n\\n:: read-odd-word ( -- )\\n f :> first-continuation!\\n f :> last-continuation!\\n f :> reverse!\\n ! Read characters. Loop until end of stream.\\n [ read1 dup ] [\\n dup Letter? [\\n ! This character is a letter.\\n reverse [\\n ! Odd word: Write letters in reverse order.\\n last-continuation savecc dup [\\n last-continuation!\\n 2drop ! Drop letter and previous continuation.\\n ] [\\n ! After jump: print letters in reverse.\\n drop ! Drop f.\\n swap write1 ! Write letter.\\n jump-back ! Follow chain of continuations.\\n ] if\\n ] [\\n ! Even word: Write letters immediately.\\n write1\\n ] if\\n ] [\\n ! This character is punctuation.\\n reverse [\\n ! End odd word. Fix trampoline, follow chain of continuations\\n ! (to print letters in reverse), then bounce off trampoline.\\n savecc dup [\\n first-continuation!\\n last-continuation jump-back\\n ] [ drop ] if\\n write1 ! Write punctuation.\\n f reverse! ! Begin even word.\\n ] [\\n write1 ! Write punctuation.\\n t reverse! ! Begin odd word.\\n ! Create trampoline to bounce to (future) first-continuation.\\n savecc dup [\\n last-continuation!\\n ] [ drop first-continuation jump-back ] if\\n ] if\\n ] if\\n ] while\\n ! Drop f from read1. Then print a cosmetic newline.\\n drop nl ;\\n\\n: odd-word ( string -- )\\n [ read-odd-word ] with-string-reader ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"[$$$$'.=\\\\',=|\\\\';=|\\\\':=|~[^s;!\\\\,]?]s: {recursive reading}\\n[s;!$'.=~[,^f;!]?]r: {reverse words}\\n[[$$$$'.=\\\\',=|\\\\';=|\\\\':=|~][,^]#$'.=~[,^r;!]?]f: {forward words}\\n^f;!, {start}\\n\",\n \"language\": \"FALSE\"\n },\n {\n \"code\": \": word? dup [char] . <> over bl <> and ;\\n: ?quit dup [char] . = if emit quit then ;\\n: eatbl begin dup bl = while drop key repeat ?quit ;\\n: even begin word? while emit key repeat ;\\n: odd word? if key recurse swap emit then ;\\n: main cr key eatbl begin even eatbl space odd eatbl space again ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" MODULE ELUDOM\\t!Uses the call stack for auxiliary storage.\\n INTEGER MSG,INF\\t!I/O unit numbers.\\n LOGICAL DEFER\\t!To stumble, or not to stumble.\\n CONTAINS\\n CHARACTER*1 RECURSIVE FUNCTION GET(IN)\\t!Returns one character, going forwards.\\n INTEGER IN\\t!The input file.\\n CHARACTER*1 C\\t!The single character to be read therefrom.\\n READ (IN,1,ADVANCE=\\\"NO\\\",EOR=3,END=4) C\\t!Thus. Not advancing to the next record.\\n 1 FORMAT (A1,$)\\t!For output, no advance to the next line either.\\n 2 IF ((\\\"A\\\"<=C .AND. C<=\\\"Z\\\").OR.(\\\"a\\\"<=C .AND. C<=\\\"z\\\")) THEN\\t!Unsafe for EBCDIC.\\n IF (DEFER) THEN\\t!Are we to reverse the current text?\\n GET = GET(IN)\\t!Yes. Go for the next letter.\\n WRITE (MSG,1) C\\t!And now, backing out, reveal the letter at this level.\\n RETURN\\t\\t!Retreat another level.\\n END IF\\t\\t!Thus passing back the ending non-letter that was encountered.\\n ELSE\\t\\t!And if we've encountered a non-letter,\\n DEFER = .NOT. DEFER\\t!Then our backwardness flips.\\n END IF\\t!Enough inspection of C.\\n 3 GET = C\\t!Pass it back.\\n RETURN\\t!And we're done.\\n 4 GET = CHAR(0)\\t!Reserving this for end-of-file.\\n END FUNCTION GET!That was strange.\\n END MODULE ELUDOM\\t!But as per the specification.\\n\\n PROGRAM CONFUSED\\t!Just so.\\n USE ELUDOM\\t!Forwards? Backwards?\\n CHARACTER*1 C\\t!A scratchpad for multiple inspections.\\n MSG = 6\\t!Standard output.\\n INF = 10\\t!This will do.\\n OPEN (INF,NAME = \\\"Confused.txt\\\",STATUS=\\\"OLD\\\",ACTION=\\\"READ\\\")\\t!Go for the file.\\n\\nChew through the input. A full stop marks the end.\\n 10 DEFER = .FALSE.\\t!Start off going forwards.\\n 11 C = GET(INF)\\t\\t!Get some character from file INF.\\n IF (ICHAR(C).LE.0) STOP\\t\\t!Perhaps end-of-file is reported.\\n IF (C.NE.\\\" \\\") WRITE (MSG,12) C\\t!Otherwise, write it. A blank for end-of-record.\\n 12 FORMAT (A1,$)\\t\\t\\t!Obviously, not finishing the line each time.\\n IF (C.NE.\\\".\\\") GO TO 11\\t!And if not a full stop, do it again.\\n WRITE (MSG,\\\"('')\\\")\\t!End the line of output.\\n GO TO 10\\t\\t!And have another go.\\n END\\t!That was confusing.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Dim Shared As Integer n1 = 1\\n\\nFunction reverseString(texto As String) As String\\n Dim As Integer x, lt = Len(texto)\\n For x = 0 To lt Shr 1 - 1\\n Swap texto[x], texto[lt - x - 1]\\n Next x\\n Return texto\\nEnd Function\\n\\nSub process(texto As String)\\n Dim As Integer c = 0, n2\\n Dim As String tmptexto\\n\\n Print \\\"Input stream: \\\"; texto\\n Print \\\"Output stream: \\\";\\n Do\\n n2 = Instr(texto, Any \\\",;:.\\\")\\n tmptexto = Mid(texto, n1, n2-1)\\n Print Iif(c Mod 2 = 0, tmptexto, reverseString(tmptexto)); Mid(texto, n2, 1);\\n If Mid(texto, n2, 1) = \\\".\\\" Then Exit Do\\n texto = Mid(texto, n2+1, Len(texto))\\n c += 1\\n Loop\\n Print !\\\"\\\\n\\\"\\nEnd Sub\\n\\nprocess(\\\"what,is,the;meaning,of:life.\\\")\\nprocess(\\\"we,are;not,in,kansas;any,more.\\\")\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"begin globals\\nshort ndx : bool odd : cfstringref stream\\nend globals\\n\\nlocal fn recursion\\n cfstringref ch = mid( stream, ndx, 1 )\\n if fn StringContainsString( @\\\",;:. \\\", ch ) == no\\n ndx++\\n if odd then fn recursion : print ch; ¬\\n else print ch; : fn recursion\\n end if\\nend fn\\n\\nlocal fn oddWordTask( s as cfstringref )\\n ndx = 0 : odd = no : stream = s\\n print : print, stream : print,\\n while ndx < len( stream )\\n fn recursion : print mid( stream, ndx, 1 );\\n odd = yes - odd : ndx++\\n wend\\n print\\nend fn\\n\\nwindow 1, @\\\"Odd word task in FutureBasic\\\", (0,0,310,155)\\nfn oddWordTask( @\\\"what,is,the;meaning,of:life.\\\" )\\nfn oddWordTask( @\\\"we,are;not,in,kansas;any,more.\\\" )\\nfn oddWordTask( @\\\"This also works with normal spaces.\\\" )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"os\\\"\\n \\\"unicode\\\"\\n)\\n\\nfunc main() {\\n owp(os.Stdout, bytes.NewBufferString(\\\"what,is,the;meaning,of:life.\\\"))\\n fmt.Println()\\n owp(os.Stdout, bytes.NewBufferString(\\\"we,are;not,in,kansas;any,more.\\\"))\\n fmt.Println()\\n}\\n\\nfunc owp(dst io.Writer, src io.Reader) {\\n byte_in := func () byte {\\n bs := make([]byte, 1)\\n src.Read(bs)\\n return bs[0]\\n }\\n byte_out := func (b byte) { dst.Write([]byte{b}) }\\n var odd func() byte\\n odd = func() byte {\\n s := byte_in()\\n if unicode.IsPunct(rune(s)) {\\n return s\\n }\\n b := odd()\\n byte_out(s)\\n return b\\n }\\n for {\\n for {\\n b := byte_in()\\n byte_out(b)\\n if b == '.' {\\n return\\n }\\n if unicode.IsPunct(rune(b)) {\\n break\\n }\\n }\\n b := odd()\\n byte_out(b)\\n if b == '.' {\\n return\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"os\\\"\\n \\\"unicode\\\"\\n)\\n\\nfunc main() {\\n owp(os.Stdout, bytes.NewBufferString(\\\"what,is,the;meaning,of:life.\\\"))\\n fmt.Println()\\n owp(os.Stdout, bytes.NewBufferString(\\\"we,are;not,in,kansas;any,more.\\\"))\\n fmt.Println()\\n}\\n\\nfunc owp(dst io.Writer, src io.Reader) {\\n byte_in := func () byte {\\n bs := make([]byte, 1)\\n src.Read(bs)\\n return bs[0]\\n }\\n byte_out := func (b byte) { dst.Write([]byte{b}) }\\n odd := func() byte {\\n for {\\n b := byte_in()\\n if unicode.IsPunct(int(b)) {\\n return b\\n }\\n defer byte_out(b)\\n }\\n panic(\\\"impossible\\\")\\n }\\n for {\\n for {\\n b := byte_in()\\n byte_out(b)\\n if b == '.' {\\n return\\n }\\n if unicode.IsPunct(rune(b)) {\\n break\\n }\\n }\\n b := odd()\\n byte_out(b)\\n if b == '.' {\\n return\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"io\\\"\\n \\\"os\\\"\\n \\\"unicode\\\"\\n)\\n\\nfunc main() {\\n owp(os.Stdout, bytes.NewBufferString(\\\"what,is,the;meaning,of:life.\\\"))\\n fmt.Println()\\n owp(os.Stdout, bytes.NewBufferString(\\\"we,are;not,in,kansas;any,more.\\\"))\\n fmt.Println()\\n}\\n\\ntype Coroutine struct {\\n out <-chan Coroutine\\n in chan<- byte\\n}\\n\\nfunc owp(dst io.Writer, src io.Reader) {\\n byte_in := func () (byte, error) {\\n bs := make([]byte, 1)\\n _, err := src.Read(bs)\\n return bs[0], err\\n }\\n byte_out := func (b byte) { dst.Write([]byte{b}) }\\n\\n var f, r Coroutine\\n\\n f = func () Coroutine {\\n out := make(chan Coroutine)\\n\\tin := make(chan byte)\\n var fwd func (byte) byte\\n fwd = func (c byte) (z byte) {\\n if unicode.IsLetter(rune(c)) {\\n byte_out(c)\\n out <- f\\n z = fwd(<- in)\\n } else {\\n z = c\\n }\\n return\\n }\\n go func () {\\n for {\\n x, ok := <- in\\n if !ok { break }\\n byte_out(fwd(x))\\n out <- r\\n }\\n } ()\\n return Coroutine{ out, in }\\n } ()\\n r = func () Coroutine {\\n out := make(chan Coroutine)\\n\\tin := make(chan byte)\\n var rev func (byte) byte\\n rev = func (c byte) (z byte) {\\n if unicode.IsLetter(rune(c)) {\\n out <- r\\n z = rev(<- in)\\n byte_out(c)\\n } else {\\n z = c\\n }\\n return\\n }\\n go func () {\\n for {\\n x, ok := <- in\\n if !ok { break }\\n byte_out(rev(x))\\n out <- f\\n }\\n } ()\\n return Coroutine{ out, in }\\n } ()\\n\\n for coro := f; ; coro = <- coro.out {\\n c, err := byte_in()\\n if err != nil { break }\\n coro.in <- c\\n }\\n close(f.in)\\n close(r.in)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import System.IO\\n (BufferMode(..), getContents, hSetBuffering, stdin, stdout)\\nimport Data.Char (isAlpha)\\n\\nsplit :: String -> (String, String)\\nsplit = span isAlpha\\n\\nparse :: String -> String\\nparse [] = []\\nparse l =\\n let (a, w) = split l\\n (b, x) = splitAt 1 w\\n (c, y) = split x\\n (d, z) = splitAt 1 y\\n in a <> b <> reverse c <> d <> parse z\\n\\nmain :: IO ()\\nmain =\\n hSetBuffering stdin NoBuffering >> hSetBuffering stdout NoBuffering >> getContents >>=\\n putStr . takeWhile (/= '.') . parse >>\\n putStrLn \\\".\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"isAlpha :: Char -> Bool\\nisAlpha = flip elem $ ['a'..'z'] ++ ['A'..'Z']\\n\\nparse :: IO ()\\nparse = do\\n x <- getChar\\n putChar x\\n case () of\\n _ | x == '.' -> return ()\\n | isAlpha x -> parse\\n | otherwise -> do\\n c <- revParse\\n putChar c\\n if c == '.'\\n then return ()\\n else parse\\n\\nrevParse :: IO Char\\nrevParse = do\\n x <- getChar\\n case () of\\n _ | x == '.' -> return x\\n | isAlpha x -> do\\n c <- revParse\\n putChar x\\n return c\\n | otherwise -> return x\\n\\nmain :: IO ()\\nmain = hSetBuffering stdin NoBuffering >> hSetBuffering stdout NoBuffering >>\\n parse >> putStrLn \\\"\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\nevery OddWord(![\\\"what,is,the;meaning,of:life.\\\",\\n \\\"we,are;not,in,kansas;any,more.\\\"])\\nend\\n\\nprocedure OddWord(stream) #: wrapper for demonstration\\n write(\\\"Input stream: \\\",stream)\\n writes(\\\"Output stream: \\\") & eWord(create !stream,'.,;:') & write()\\nend\\n\\nprocedure eWord(stream,marks) #: handle even words\\n repeat {\\n repeat\\n writes(@stream) ? if =\\\".\\\" then return else if any(marks) then break\\n if writes(oWord(stream,marks)) == '.' then return\\n }\\nend\\n\\nprocedure oWord(stream,marks) #: handle odd words (reverse)\\n if any(marks,s := @stream) then return s\\n return 1(oWord(stream,marks), writes(s))\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure main(A)\\n repeat (while writes((any(&letters, c := reads(&input,1)),c))) |\\n (writes(c) ~== \\\".\\\" ~== writes(rWord())) | break write()\\nend\\n\\nprocedure rWord(c)\\n c1 := rWord((any(&letters, c1 := reads(&input,1)),c1))\\n writes(\\\\c)\\n return c1\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"putch=: 4 :0 NB. coroutine verb\\n outch y\\n return x\\n)\\n\\nisletter=: toupper ~: tolower\\n\\ndo_char=: 3 :0 NB. coroutine verb\\n ch=. getch''\\n if. isletter ch do.\\n if. odd do.\\n putch&ch yield do_char '' return.\\n end.\\n else.\\n odd=: -. odd\\n end.\\n return ch\\n)\\n\\nevenodd=: 3 :0\\n clear_outstream begin_instream y\\n odd=: 0\\n whilst. '.'~:char do.\\n outch char=. do_char coroutine ''\\n end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" evenodd 'what,is,the;meaning,of:life.'\\nwhat,si,the;gninaem,of:efil.\\n evenodd 'we,are;not,in,kansas;any,more.'\\nwe,era;not,ni,kansas;yna,more.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class OddWord {\\n interface CharHandler {\\n\\tCharHandler handle(char c) throws Exception;\\n }\\n final CharHandler fwd = new CharHandler() {\\n\\tpublic CharHandler handle(char c) {\\n\\t System.out.print(c);\\n\\t return (Character.isLetter(c) ? fwd : rev);\\n\\t}\\n };\\n class Reverser extends Thread implements CharHandler {\\n\\tReverser() {\\n\\t setDaemon(true);\\n\\t start();\\n\\t}\\n\\tprivate Character ch; // For inter-thread comms\\n\\tprivate char recur() throws Exception {\\n\\t notify();\\n\\t while (ch == null) wait();\\n\\t char c = ch, ret = c;\\n\\t ch = null;\\n\\t if (Character.isLetter(c)) {\\n\\t\\tret = recur();\\n\\t\\tSystem.out.print(c);\\n\\t }\\n\\t return ret;\\n\\t}\\n\\tpublic synchronized void run() {\\n\\t try {\\n\\t\\twhile (true) {\\n\\t\\t System.out.print(recur());\\n\\t\\t notify();\\n\\t\\t}\\n\\t } catch (Exception e) {}\\n\\t}\\n\\tpublic synchronized CharHandler handle(char c) throws Exception {\\n\\t while (ch != null) wait();\\n\\t ch = c;\\n\\t notify();\\n\\t while (ch != null) wait();\\n\\t return (Character.isLetter(c) ? rev : fwd);\\n\\t}\\n }\\n final CharHandler rev = new Reverser();\\n\\n public void loop() throws Exception {\\n\\tCharHandler handler = fwd;\\n\\tint c;\\n\\twhile ((c = System.in.read()) >= 0) {\\n\\t handler = handler.handle((char) c);\\n\\t}\\n }\\n\\n public static void main(String[] args) throws Exception {\\n\\tnew OddWord().loop();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# io = readstring(STDIN)\\nio = \\\"what,is,the;meaning,of:life.\\\"\\ni = 0\\n\\nreadbyte!() = io[global i += 1]\\nwritebyte(c) = print(Char(c))\\n\\nfunction odd(prev::Function = () -> false)\\n a = readbyte!()\\n if !isalpha(a)\\n prev()\\n writebyte(a)\\n return a != '.'\\n end\\n\\n # delay action until later, in the shape of a closure\\n clos() = (writebyte(a); prev())\\n\\n return odd(clos)\\nend\\n\\nfunction even()\\n while true\\n c = readbyte!()\\n writebyte(c)\\n if !isalpha(c) return c != '.' end\\n end\\nend\\n\\nevn = false\\nwhile evn ? odd() : even()\\n evn = !evn\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ntypealias Func = () -> Unit\\n\\nfun doChar(odd: Boolean, f: Func?): Boolean {\\n val c = System.`in`.read()\\n if (c == -1) return false // end of stream reached\\n val ch = c.toChar()\\n\\n fun writeOut() {\\n print(ch)\\n if (f != null) f()\\n }\\n\\n if (!odd) print(ch)\\n if (ch.isLetter()) return doChar(odd, ::writeOut)\\n if (odd) {\\n if (f != null) f()\\n print(ch)\\n }\\n return ch != '.'\\n}\\n\\nfun main(args: Array<String>) {\\n repeat(2) {\\n var b = true\\n while (doChar(!b, null)) b = !b\\n System.`in`.read() // remove '\\\\n' from buffer\\n println(\\\"\\\\n\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define odd_word_processor(str::string) => {\\n\\tlocal(\\n\\t\\tisodd \\t\\t= false,\\n\\t\\tpos \\t\\t= 1,\\n\\t\\tinvpos\\t \\t= 1,\\n\\t\\tlastpos\\t\\t= 1\\n\\t)\\n\\twhile(#str->get(#pos) != '.' && #pos <= #str->size) => {\\n\\t\\tif(not #str->isAlpha(#pos)) => {\\n\\t\\t\\tnot #isodd ? #isodd = true | #isodd = false\\t\\n\\t\\t}\\n\\t\\tif(#isodd) => {\\n\\t\\t\\t#lastpos = 1\\n\\t\\t\\t#invpos = 1\\n\\t\\t\\twhile(#str->isAlpha(#pos+#lastpos) && #pos+#lastpos <= #str->size) => {\\n\\t\\t\\t\\t#lastpos++\\n\\t\\t\\t}\\n\\t\\t\\t'odd lastpos: '+#lastpos+'\\\\r'\\n\\t\\t\\tlocal(maxpos = #pos+#lastpos-1)\\n\\t\\t\\twhile(#invpos < (#lastpos+1)/2) => {\\n\\t\\t\\t\\tlocal(i,o,ipos,opos)\\n\\t\\t\\t\\t#ipos = #pos+#invpos\\n\\t\\t\\t\\t#opos = #pos+(#lastpos-#invpos)\\n\\t\\t\\t\\t#i = #str->get(#ipos)\\n\\t\\t\\t\\t#o = #str->get(#opos)\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//'switching '+#i+' and '+#o+'\\\\r'\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//'insert '+#o+' at '+(#ipos)+'\\\\r'\\n\\t\\t\\t\\t#str = string_insert(#str,-position=(#ipos),-text=#o)\\n\\t\\n\\t\\t\\t\\t//'remove redundant pos '+(#ipos+1)+'\\\\r'\\n\\t\\t\\t\\t#str->remove(#ipos+1,1)\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//'insert '+#i+' at '+(#opos)+'\\\\r'\\n\\t\\t\\t\\t#str = string_insert(#str,-position=(#opos),-text=#i)\\n\\t\\n\\t\\t\\t\\t//'remove redundant pos '+(#opos+1)+'\\\\r'\\n\\t\\t\\t\\t#str->remove(#opos+1,1)\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t#invpos++\\n\\t\\t\\t}\\n\\t\\t\\t#pos += #lastpos - 1\\n\\t\\t}\\n\\t\\t//#str->get(#pos) + #isodd + '\\\\r'\\n\\t\\t#pos += 1\\n\\t}\\n\\treturn #str\\n}\\n\\n'orig:\\\\rwhat,is,the;meaning,of:life.\\\\r'\\n'new:\\\\r'\\nodd_word_processor('what,is,the;meaning,of:life.')\\n'\\\\rShould have:\\\\rwhat,si,the;gninaem,of:efil.'\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"function reverse()\\n local ch = io.read(1)\\n if ch:find(\\\"%w\\\") then\\n local rc = reverse()\\n io.write(ch)\\n return rc\\n end\\n return ch\\nend\\n\\nfunction forward()\\n ch = io.read(1)\\n io.write(ch)\\n if ch == \\\".\\\" then return false end\\n if not ch:find(\\\"%w\\\") then\\n ch = reverse()\\n if ch then io.write(ch) end\\n if ch == \\\".\\\" then return false end\\n end\\n return true\\nend\\n\\nwhile forward() do end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Checkit {\\n global out$\\n document out$\\n Function PrepareStream$ (buf$) {\\n \\\\\\\\ get a temporary file\\n if buf$=\\\"\\\" then {\\n class ref {\\n f\\n class:\\n module ref (.f) { }\\n }\\n \\\\\\\\ make f closure by reference\\n m->ref(false)\\n =lambda$ m->{\\n if m=>f then exit\\n r$=Key$\\n m=>f=r$=\\\".\\\"\\n =r$\\n }\\n \\\\\\\\ exit function\\n break\\n }\\n name$=tempname$\\n \\\\\\\\ we use Ansi type files\\n Open name$ for output as F\\n Print #F, buf$;\\n Close #F\\n Open name$ for input as #f\\n class ref {\\n f\\n class:\\n module ref (.f) { }\\n }\\n \\\\\\\\ make f closure by reference\\n m->ref(f)\\n =lambda$ m -> {\\n if m=>f=-1000 then exit\\n def r$\\n if not eof(#m=>f) then r$=Input$(#m=>f,2)\\n =r$\\n if r$=\\\"\\\" or r$=\\\".\\\" then close #m=>f : m=>f=-1000\\n }\\n }\\n Module Odd(c$) {\\n one$=\\\"\\\"\\n Module MyEven(c$, &last$) {\\n one$=If$(last$=\\\"\\\"->c$(), last$)\\n if one$=\\\"\\\" then exit\\n if not one$ ~\\\"[a-zA-Z]\\\" Then last$=one$: exit\\n \\\\\\\\ print before\\n Print one$;\\n out$<=one$\\n Call MyEven, c$, &last$\\n }\\n Module MyOdd(c$, &last$) {\\n one$=If$(last$=\\\"\\\"->c$(), last$)\\n if one$=\\\"\\\" then exit\\n if not one$ ~\\\"[a-zA-Z]\\\" Then last$=one$: exit\\n Call MyOdd, c$, &last$\\n \\\\\\\\ print after\\n Print one$;\\n out$<=one$\\n }\\n Do {\\n one$=\\\"\\\"\\n Call MyEven, c$, &one$\\n if one$=\\\"\\\" then exit\\n Print one$;\\n out$<=one$\\n one$=\\\"\\\"\\n Call MyOdd, c$, &one$\\n if one$=\\\"\\\" then exit\\n Print one$;\\n out$<=one$\\n } Always\\n Print\\n out$<={\\n }\\n }\\n \\\\\\\\ Feeding keyboard\\n keyboard \\\"what,is,the;meaning,of:life.\\\"\\n Odd PrepareStream$(\\\"\\\")\\n \\\\\\\\ Use a file for input\\n Odd PrepareStream$(\\\"we,are;not,in,kansas;any,more.\\\")\\n clipboard out$\\n}\\nCheckit\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Module OddWord {\\n k$=lambda$->\\\"\\\"\\n state=false\\n odd=True\\n do {\\n a$=key$\\n if a$ ~\\\"[a-zA-Z]\\\" then {\\n If state Else state~ : odd~\\n if state and odd then k$=lambda$ k$, a$->a$+k$() : Continue\\n Print a$;\\n } Else {\\n If state Then state~\\n if odd then Print k$(); : k$=lambda$->\\\"\\\"\\n Print a$;\\n }\\n } until a$=\\\".\\\"\\n Print\\n}\\nkeyboard \\\"what,is,the;meaning,of:life.\\\"\\nOddWord\\nKeyboard \\\"we,are;not,in,kansas;any,more.\\\"\\nOddWord\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"import unicode\\n\\ntype Proc = proc(): bool {.closure.}\\n\\nvar nothing: Proc = proc(): bool {.closure.} = false\\n\\nproc odd(prev = nothing): bool =\\n let a = stdin.readChar()\\n if not isAlpha(Rune(ord(a))):\\n discard prev()\\n stdout.write(a)\\n return a != '.'\\n\\n # delay action until later, in the shape of a closure\\n proc clos(): bool =\\n stdout.write(a)\\n prev()\\n\\n return odd(clos)\\n\\nproc even(): bool =\\n while true:\\n let c = stdin.readChar()\\n stdout.write(c)\\n if not isAlpha(Rune(ord(c))):\\n return c != '.'\\n\\nvar e = false\\nwhile (if e: odd() else: even()):\\n e = not e\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import strutils\\n\\nproc reverseWord(ch: var char) =\\n var nextch = stdin.readChar()\\n if nextch.isAlphaAscii():\\n reverseWord(nextch)\\n stdout.write(ch)\\n ch = nextch\\n\\nproc normalWord(ch: var char) =\\n stdout.write(ch)\\n ch = stdin.readChar()\\n if ch.isAlphaAscii():\\n normalWord(ch)\\n\\nvar ch = stdin.readChar()\\n\\nwhile ch != '.':\\n normalWord(ch)\\n if ch != '.':\\n stdout.write(ch)\\n ch = stdin.readChar()\\n reverseWord(ch)\\nstdout.write(ch)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let is_alpha c =\\n c >= 'a' && c <= 'z' ||\\n c >= 'A' && c <= 'Z'\\n\\nlet rec odd () =\\n let c = input_char stdin in\\n if is_alpha c\\n then (let e = odd () in print_char c; e)\\n else (c)\\n\\nlet rec even () =\\n let c = input_char stdin in\\n if is_alpha c\\n then (print_char c; even ())\\n else print_char c\\n\\nlet rev_odd_words () =\\n while true do\\n even ();\\n print_char (odd ())\\n done\\n\\nlet () =\\n try rev_odd_words ()\\n with End_of_file -> ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(define (odd_word_problem words)\\n (letrec ((odd (lambda (s out)\\n (let loop ((s s) (l '()))\\n (cond\\n ((null? s)\\n out)\\n ((pair? s)\\n (if (<= #\\\\a (car s) #\\\\z)\\n (loop (cdr s) (cons (car s) l))\\n (even (cdr s) (cons (cons (reverse l) (car s)) out))))\\n (else\\n (loop (s) l))))))\\n (even (lambda (s out)\\n (let loop ((s s) (l '()))\\n (cond\\n ((null? s)\\n out)\\n ((pair? s)\\n (if (<= #\\\\a (car s) #\\\\z)\\n (loop (cdr s) (cons (car s) l))\\n (odd (cdr s) (cons (cons l (car s)) out))))\\n (else\\n (loop (s) l)))))))\\n (for-each (lambda (p)\\n (display (runes->string (car p)))\\n (display (string (cdr p))))\\n (reverse\\n (odd (str-iter words) '()))))\\n (print))\\n(odd_word_problem \\\"what,is,the;meaning,of:life.\\\")\\n(odd_word_problem \\\"we,are;not,in,kansas;any,more.\\\")\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"sub r\\n{\\n\\tmy ($f, $c) = @_;\\n\\treturn sub { print $c; $f->(); };\\n}\\n\\n$r = sub {};\\n\\nwhile (read STDIN, $_, 1) {\\n\\t$w = /^[a-zA-Z]$/;\\n\\t$n++ if ($w && !$l);\\n\\t$l = $w;\\n\\tif ($n & 1 || !$w) {\\n\\t\\t$r->(); $r = sub{};\\n\\t\\tprint;\\n\\t} else {\\n\\t\\t$r = r($r, $_);\\n\\t}\\n}\\n$r->();\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"sub rev\\n{\\n\\tmy $c;\\n\\tread STDIN, $c, 1;\\n\\tif ($c =~ /^[a-zA-Z]$/) {\\n\\t\\tmy $r = rev();\\n\\t\\tprint $c;\\n\\t\\treturn $r;\\n\\t} else {\\n\\t\\treturn $c;\\n\\t}\\n}\\n\\nwhile (read STDIN, $_, 1) {\\n\\t$w = /^[a-zA-Z]$/;\\n\\t$n++ if ($w && !$l);\\n\\t$l = $w;\\n\\tif ($n & 1) {\\n\\t\\tprint;\\n\\t} else {\\n\\t\\tmy $r = rev();\\n\\t\\tprint $_;\\n\\t\\tprint $r;\\n\\t\\t$n = 0; $l = 0;\\n\\t}\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"$|=1;\\n\\nwhile (read STDIN, $_, 1) {\\n\\t$w = /^[a-zA-Z]$/;\\n\\t$n++ if ($w && !$l);\\n\\t$l = $w;\\n\\tif ($n & 1 || !$w) {\\n\\t\\tclose W; while(wait()!=-1){}\\n\\t\\tprint;\\n\\t} else {\\n\\t\\topen W0, \\\">&\\\", \\\\*W;\\n\\t\\tclose W;\\n\\t\\tpipe R,W;\\n\\t\\tif (!fork()) {\\n\\t\\t\\tclose W;\\n\\t\\t\\t<R>;\\n\\t\\t\\tprint $_;\\n\\t\\t\\tclose W0;\\n\\t\\t\\texit;\\n\\t\\t}\\n\\t\\tclose W0;\\n\\t\\tclose R;\\n\\t}\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"what,is,the;meaning,of:life.\\\"</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--string s = \\\"we,are;not,in,kansas;any,more.\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">getchar</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">wrod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rev</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">getchar</span><span style=\\\"color: #0000FF;\\\">(),</span> <span style=\\\"color: #000000;\\\">nch</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- integer ch = getc(0), nch</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" .,:;!?\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rev</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">nch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">wrod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rev</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">rev</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">nch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">wrod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rev</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nch</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--puts(1,\\\"Enter words separated by a single punctuation mark (i.e. !?,.;:) and ending with .\\\\n\\\")</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">wrod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rev</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'.'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">rev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">rev</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"$odd = function ($prev) use ( &$odd ) {\\n\\t$a = fgetc(STDIN);\\n\\tif (!ctype_alpha($a)) {\\n\\t\\t$prev();\\n\\t\\tfwrite(STDOUT, $a);\\n\\t\\treturn $a != '.';\\n\\t}\\n\\t$clos = function () use ($a , $prev) {\\n\\t\\tfwrite(STDOUT, $a);\\n\\t\\t$prev();\\n\\t};\\n\\treturn $odd($clos);\\n};\\n$even = function () {\\n\\twhile (true) {\\n\\t\\t$c = fgetc(STDIN);\\n\\t\\tfwrite(STDOUT, $c);\\n\\t\\tif (!ctype_alpha($c)) {\\n\\t\\t\\treturn $c != \\\".\\\";\\n\\t\\t}\\n\\t}\\n};\\n$prev = function(){};\\n$e = false;\\nwhile ($e ? $odd($prev) : $even()) {\\n\\t$e = !$e;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de oddWords ()\\n (use C\\n (loop\\n (until (sub? (prin (setq C (char))) \\\"!,.:;?\\\"))\\n (T (= \\\".\\\" C))\\n (setq C (char))\\n (T\\n (= \\\".\\\"\\n (prin\\n (recur (C)\\n (if (sub? C \\\"!,.:;?\\\")\\n C\\n (prog1 (recurse (char)) (prin C)) ) ) ) ) ) )\\n (prinl) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"(in \\\"txt1\\\" (oddWords))\\n(in \\\"txt2\\\" (oddWords))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"test: procedure options (main); /* 2 August 2014 */\\n declare (ch, ech) character (1);\\n declare odd file;\\n\\nget_word: procedure recursive;\\n declare ch character (1);\\n\\n get file (odd) edit (ch) (a(1));\\n if index('abcdefghijklmnopqrstuvwxyz', ch) > 0 then call get_word;\\n if index('abcdefghijklmnopqrstuvwxyz', ch) > 0 then\\n put edit (ch) (a);\\n else ech = ch;\\nend get_word;\\n\\n open file (odd) input title ('/ODDWORD.DAT,TYPE(text),recsize(100)');\\n do forever;\\n do until (index('abcdefghijklmnopqrstuvwxyz', ch) = 0 );\\n get file (odd) edit (ch) (a(1)); put edit (ch) (a);\\n end;\\n if ch = '.' then leave;\\n call get_word;\\n put edit (ech) (a);\\n if ech = '.' then leave;\\n end;\\nend test;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"odd_word_problem :-\\n\\tread_line_to_codes(user_input, L),\\n\\teven_word(L, Out, []),\\n\\tstring_to_list(Str, Out),\\n\\twriteln(Str).\\n\\neven_word(\\\".\\\") --> \\\".\\\".\\n\\neven_word([H | T]) -->\\n\\t{char_type(H,alnum)},\\n\\t[H],\\n\\teven_word(T).\\n\\neven_word([H | T]) -->\\n\\t[H],\\n\\todd_word(T, []).\\n\\nodd_word(\\\".\\\", R) --> R, \\\".\\\".\\n\\nodd_word([H|T], R) -->\\n\\t{char_type(H,alnum)},\\n\\todd_word(T, [H | R]).\\n\\nodd_word([H|T], R) -->\\n\\tR,\\n\\t[H],\\n\\teven_word(T).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"#False = 0\\n#True = 1\\n\\nGlobal *inputPtr.Character\\n\\nMacro nextChar()\\n *inputPtr + SizeOf(Character)\\nEndMacro\\n\\nProcedure isPunctuation(c.s)\\n If FindString(\\\"!?()[]{},.;:-'\\\" + #DQUOTE$, c)\\n ProcedureReturn #True\\n EndIf\\n ProcedureReturn #False\\nEndProcedure\\n\\nProcedure oddWord()\\n Protected c.c\\n c = *inputPtr\\\\c\\n If isPunctuation(Chr(*inputPtr\\\\c))\\n ProcedureReturn\\n Else\\n nextChar()\\n oddWord()\\n EndIf\\n Print(Chr(c))\\nEndProcedure\\n\\nProcedure oddWordProblem(inputStream.s)\\n *inputPtr = @inputStream\\n Define isOdd = #False\\n While *inputPtr\\\\c\\n If isOdd\\n oddWord()\\n Else\\n Repeat\\n Print(Chr(*inputPtr\\\\c))\\n nextChar()\\n Until isPunctuation(Chr(*inputPtr\\\\c))\\n EndIf\\n Print(Chr(*inputPtr\\\\c))\\n isOdd ! 1 ;toggle word indicator\\n nextChar()\\n Wend\\nEndProcedure\\n\\nDefine inputStream.s\\nIf OpenConsole()\\n Repeat\\n PrintN(#CRLF$ + #CRLF$ + \\\"Enter a series of words consisting only of English letters (i.e. a-z, A-Z)\\\")\\n PrintN(\\\"and that are separated by a punctuation mark (i.e. !?()[]{},.;:-' or \\\" + #DQUOTE$ + \\\").\\\")\\n inputStream = Input()\\n oddWordProblem(inputStream) ;assume input is correct\\n Until inputStream = \\\"\\\"\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from sys import stdin, stdout\\n\\ndef char_in(): return stdin.read(1)\\ndef char_out(c): stdout.write(c)\\n\\ndef odd(prev = lambda: None):\\n\\ta = char_in()\\n\\tif not a.isalpha():\\n\\t\\tprev()\\n\\t\\tchar_out(a)\\n\\t\\treturn a != '.'\\n\\n\\t# delay action until later, in the shape of a closure\\n\\tdef clos():\\n\\t\\tchar_out(a)\\n\\t\\tprev()\\n\\n\\treturn odd(clos)\\n\\ndef even():\\n\\twhile True:\\n\\t\\tc = char_in()\\n\\t\\tchar_out(c)\\n\\t\\tif not c.isalpha(): return c != '.'\\n\\ne = False\\nwhile odd() if e else even():\\n\\te = not e\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"$ echo \\\"what,is,the;meaning,of:life.\\\" | python odd.py\\nwhat,si,the;gninaem,of:efil.\\n$ echo \\\"we,are;not,in,kansas;any,more.\\\" | python odd.py\\nwe,era;not,ni,kansas;yna,more.\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from sys import stdin, stdout\\n\\ndef char_in(): return stdin.read(1)\\ndef char_out(c): stdout.write(c)\\n\\ndef odd():\\n\\ta = char_in()\\n\\tif a.isalpha():\\n\\t\\tr = odd()\\n\\t\\tchar_out(a)\\n\\t\\treturn r\\n\\n\\t# delay printing terminator until later, in the shape of a closure\\n\\tdef clos():\\n\\t\\tchar_out(a)\\n\\t\\treturn a != '.'\\n\\n\\treturn clos\\n\\ndef even():\\n\\twhile True:\\n\\t\\tc = char_in()\\n\\t\\tchar_out(c)\\n\\t\\tif not c.isalpha(): return c != '.'\\n\\ne = False\\nwhile odd()() if e else even():\\n\\te = not e\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from sys import stdin, stdout\\n\\ndef fwd(c):\\n if c.isalpha():\\n return [stdout.write(c), (yield from fwd((yield f)))][1]\\n else:\\n return c\\n\\ndef rev(c):\\n if c.isalpha():\\n return [(yield from rev((yield r))), stdout.write(c)][0]\\n else:\\n return c\\n\\ndef fw():\\n while True:\\n stdout.write((yield from fwd((yield r))))\\n\\ndef re():\\n while True:\\n stdout.write((yield from rev((yield f))))\\n\\nf = fw()\\nr = re()\\nnext(f)\\nnext(r)\\n\\ncoro = f\\nwhile True:\\n c = stdin.read(1)\\n if not c:\\n break\\n coro = coro.send(c)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"[ upper dup lower != ] is letter ( c --> b )\\n\\n forward is backwords ( $ --> $ )\\n\\n[ [ behead\\n dup letter while\\n emit again ]\\n dup emit\\n char . !=\\n if backwords ] is forwords ( $ --> $ )\\n\\n[ [ behead\\n dup letter while\\n swap recurse\\n rot emit ]\\n dup emit\\n char . !=\\n if forwords ] resolves backwords ( $ --> $ )\\n\\n[ forwords drop cr ] is oddwords ( $ --> )\\n\\n$ \\\"we,are;not,in,kansas;any,more.\\\" oddwords\\n$ \\\"what,is,the;meaning,of:life.\\\" oddwords\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#!/bin/sh\\n#|\\nexec racket -tm- \\\"$0\\\" \\\"$@\\\"\\n|#\\n\\n#lang racket\\n\\n(define (even k)\\n (define c (read-char))\\n (cond [(eq? c eof) (k)]\\n [(not (char-alphabetic? c)) (k) (write-char c) (odd)]\\n [else (even (λ() (write-char c) (k)))]))\\n\\n(define (odd)\\n (define c (read-char))\\n (unless (eq? c eof)\\n (write-char c)\\n (if (char-alphabetic? c) (odd) (even void))))\\n\\n(provide main)\\n(define (main) (odd) (newline))\\n\\n;; (with-input-from-string \\\"what,is,the;meaning,of:life.\\\" main)\\n;; ;; -> what,si,the;gninaem,of:efil.\\n;; (with-input-from-string \\\"we,are;not,in,kansas;any,more.\\\" main)\\n;; ;; -> we,era;not,ni,kansas;yna,more.\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my &in = { $*IN.getc // last }\\n\\nloop {\\n ew(in);\\n ow(in).print;\\n}\\n\\nmulti ew ($_ where /\\\\w/) { .print; ew(in); }\\nmulti ew ($_) { .print; next when \\\"\\\\n\\\"; }\\n\\nmulti ow ($_ where /\\\\w/) { ow(in) x .print; }\\nmulti ow ($_) { $_; }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program solves the odd word problem by only using (single) byte input/output.*/\\n iFID_ = 'ODDWORD.IN' /*Note: numeric suffix is added later.*/\\n oFID_ = 'ODDWORD.' /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n do case=1 for 2; #= 0 /*#: is the number of characters read.*/\\n iFID= iFID_ || case /*read ODDWORD.IN1 or ODDWORD.IN2 */\\n oFID= oFID_ || case /*write ODDWORD.1 or ODDWORD.2 */\\n say; say; say '════════ reading file: ' iFID \\\"════════\\\" /* ◄■■■■■■■■■ optional. */\\n\\n do until x==. /* [↓] perform until reaching a period*/\\n do until \\\\datatype(x, 'M') /* [↓] \\\" \\\" punctuation found*/\\n call rChar /*read a single character. */\\n call wChar /*write \\\" \\\" \\\" */\\n end /*until \\\\data···*/ /* [↑] read/write until punctuation. */\\n if x==. then leave /*is this the end─of─sentence (period)?*/\\n call readLetters; punct= # /*save the location of the punctuation.*/\\n do j=#-1 by -1 /*read some characters backwards. */\\n call rChar j /*read previous word (backwards). */\\n if \\\\datatype(x, 'M') then leave /*Found punctuation? Then leave J. */\\n call wChar /*write a character (which is a letter)*/\\n end /*j*/ /* [↑] perform for \\\"even\\\" words. */\\n call rLett /*read letters until punctuation found.*/\\n call wChar; #= punct /*write a char; punctuation location. */\\n end /*until x==.*/\\n end /*case*/ /* [↑] process both of the input files*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrLett: do until \\\\datatype(x, 'M'); call rChar; end; return\\nwChar: call charout , x /*console*/; call charout oFID, x /*file*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrChar: if arg()==0 then do; x= charin(iFID); #= #+1; end /*read next char*/\\n else x= charin(iFID, arg(1) ); /* \\\" specific \\\" */ return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Odd word problem\\n\\ntest = \\\"what,is,the;meaning,of:life.\\\"\\nn1 = 1\\ntestarr = []\\ntestorigin = test\\ntest = substr(test, \\\",\\\", \\\" \\\")\\ntest = substr(test, \\\";\\\", \\\" \\\")\\ntest = substr(test, \\\":\\\", \\\" \\\")\\ntest = substr(test, \\\".\\\", \\\" \\\")\\n\\nwhile true\\n n2 = substring(test, \\\" \\\", n1)\\n n3 = substring(test, \\\" \\\", n2 + 1)\\n if n2>0 and n3>0\\n strcut = substr(test, n2 + 1, n3 - n2)\\n strcut = trim(strcut)\\n if strcut != \\\"\\\"\\n add(testarr, strcut)\\n n1 = n3 + 1\\n else\\n exit\\n ok\\n ok\\nend\\n\\nfor n = 1 to len(testarr)\\n strrev = revstr(testarr[n])\\n testorigin = substr(testorigin, testarr[n], strrev)\\nnext\\nsee testorigin + nl\\n\\nfunc Substring str,substr,n\\n newstr=right(str,len(str)-n+1)\\n nr = substr(newstr, substr)\\n return n + nr -1\\n\\nfunc revstr(cStr)\\n cStr2 = \\\"\\\"\\n for x = len(cStr) to 1 step -1\\n cStr2 += cStr[x]\\n next\\n return cStr2\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"f, r = nil\\nfwd = proc {|c|\\n c =~ /[[:alpha:]]/ ? [(print c), fwd[Fiber.yield f]][1] : c }\\nrev = proc {|c|\\n c =~ /[[:alpha:]]/ ? [rev[Fiber.yield r], (print c)][0] : c }\\n\\n(f = Fiber.new { loop { print fwd[Fiber.yield r] }}).resume\\n(r = Fiber.new { loop { print rev[Fiber.yield f] }}).resume\\n\\ncoro = f\\nuntil $stdin.eof?\\n coro = coro.resume($stdin.getc)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"require 'continuation' unless defined? Continuation\\nrequire 'stringio'\\n\\n# Save current continuation.\\ndef savecc(*data)\\n # With MRI 1.8 (but not 1.9), the array literal\\n # [callcc {|cc| cc}, *data]\\n # used the wrong return value from callcc. The workaround is to\\n # put callcc outside the array literal.\\n continuation = callcc {|cc| cc}\\n [continuation, *data]\\nend\\n\\n# Jump back to continuation, where savecc will return [nil, *data].\\ndef jump_back(continuation)\\n continuation[nil]\\nend\\n\\ndef read_odd_word(input, output)\\n first_continuation, last_continuation = nil\\n reverse = false\\n # Read characters. Loop until end of stream.\\n while c = input.getc\\n c = c.chr # For Ruby 1.8, convert Integer to String.\\n if c =~ /[[:alpha:]]/\\n # This character is a letter.\\n if reverse\\n # Odd word: Write letters in reverse order.\\n saving, last_continuation, c = savecc(last_continuation, c)\\n if saving\\n last_continuation = saving\\n else\\n # After jump: print letters in reverse.\\n output.print c\\n jump_back last_continuation\\n end\\n else\\n # Even word: Write letters immediately.\\n output.print c\\n end\\n else\\n # This character is punctuation.\\n if reverse\\n # End odd word. Fix trampoline, follow chain of continuations\\n # (to print letters in reverse), then bounce off trampoline.\\n first_continuation, c = savecc(c)\\n if first_continuation\\n jump_back last_continuation\\n end\\n output.print c # Write punctuation.\\n reverse = false # Begin even word.\\n else\\n output.print c # Write punctuation.\\n reverse = true # Begin odd word.\\n # Create trampoline to bounce to (future) first_continuation.\\n last_continuation, = savecc\\n unless last_continuation\\n jump_back first_continuation\\n end\\n end\\n end\\n end\\n output.puts # Print a cosmetic newline.\\nend\\n\\ndef odd_word(string)\\n read_odd_word StringIO.new(string), $stdout\\nend\\n\\nodd_word \\\"what,is,the;meaning,of:life.\\\"\\nodd_word \\\"we,are;not,in,kansas;any,more.\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"open \\\"oddWord.txt\\\" for input as #f ' read input stream\\nwhile not(eof(#f))\\nline input #f, a$\\noddW$ = \\\"\\\" ' begin the result oddW with blank\\npx = 0 ' begin word search location with 0\\ncount = 0 ' begin the word count to 0\\nwhile x < len(a$) ' look at each character\\n\\tx = instr(a$,\\\",\\\",px) ' search for comma (,)\\n\\tif x = 0 then x = len(a$) ' no more commas?\\n\\tx1 = instr(a$,\\\";\\\",px) ' search for (;)\\n\\tx2 = instr(a$,\\\":\\\",px) ' search for (:)\\n\\tif x1 <> 0 then x = min(x,x1) ' what came first the , ; or :\\n\\tif x2 <> 0 then x = min(x,x2)\\n\\n\\tw$ = mid$(a$,px,x - px) ' get the word seperated by , ; or :\\n\\n\\tif count and 1 then ' is it the odd word\\n\\t w1$ = \\\"\\\"\\n\\t\\tfor i = len(w$) to 1 step -1\\n\\t\\t\\tw1$ = w1$ + mid$(w$,i,1) ' reverse odd words\\n\\t\\tnext i\\n\\t\\tw$ = w1$\\n\\tend if\\n oddW$ = oddW$ + w$ + mid$(a$,x,1) ' add the word to the end of oddW$\\n\\tpx = x + 1 ' bump word search location for next while\\n\\tcount = count + 1 ' count the words\\nwend\\nprint a$;\\\" -> \\\";oddW$ ' print the original and result\\nnext ii\\nwend\\nclose #f\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"import scala.io.Source\\nimport java.io.PrintStream\\n\\ndef process(s: Source, p: PrintStream, w: Int = 0): Unit = if (s.hasNext) s.next match {\\n case '.' => p append '.'\\n case c if !Character.isAlphabetic(c) => p append c; reverse(s, p, w + 1)\\n case c => p append c; process(s, p, w)\\n}\\n\\ndef reverse(s: Source, p: PrintStream, w: Int = 0, x: Char = '.'): Char = s.next match {\\n case c if !Character.isAlphabetic(c) => p append x; c\\n case c => val n = reverse(s, p, w, c);\\n if (x == '.') {p append n; process(s, p, w + 1)} else p append x; n\\n}\\n\\nprocess(Source.fromString(\\\"what,is,the;meaning,of:life.\\\"), System.out); println\\nprocess(Source.fromString(\\\"we,are;not,in,kansas;any,more.\\\"), System.out); println\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (odd)\\n (let ((c (read-char)))\\n (if (char-alphabetic? c)\\n (let ((r (odd)))\\n\\t(write-char c)\\n\\tr)\\n (lambda () (write-char c) (char=? c #\\\\.)))))\\n\\n(define (even)\\n (let ((c (read-char)))\\n (write-char c)\\n (if (char-alphabetic? c)\\n (even)\\n (char=? c #\\\\.))))\\n\\n(let loop ((i #f))\\n (if (if i ((odd)) (even))\\n (exit)\\n (loop (not i))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"chartype.s7i\\\";\\n\\nconst func char: doChar (in boolean: doReverse) is func\\n result\\n var char: delimiter is ' ';\\n local\\n var char: ch is ' ';\\n begin\\n ch := getc(IN);\\n if ch in letter_char then\\n if doReverse then\\n delimiter := doChar(doReverse);\\n write(ch);\\n else\\n write(ch);\\n delimiter := doChar(doReverse);\\n end if;\\n else\\n delimiter := ch;\\n end if;\\n end func;\\n\\nconst proc: main is func\\n local\\n var char: delimiter is ' ';\\n var boolean: doReverse is FALSE;\\n begin\\n repeat\\n delimiter := doChar(doReverse);\\n write(delimiter);\\n doReverse := not doReverse;\\n until delimiter = '.';\\n writeln;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func rev {\\n (var c = STDIN.getc) \\\\\\\\ return()\\n if (c ~~ /^[a-z]\\\\z/i) {\\n var r = rev()\\n print c\\n return r\\n }\\n return c\\n}\\n\\nvar (n=0, l=false)\\nwhile (defined(var c = STDIN.getc)) {\\n var w = (c ~~ /^[a-z]\\\\z/i)\\n ++n if (w && !l)\\n l = w\\n if (n & 1) {\\n print c\\n } else {\\n var r = rev()\\n print(c, r)\\n n = 0\\n l = false\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\nproc fwd c {\\n expr {[string is alpha $c] ? \\\"[fwd [yield f][puts -nonewline $c]]\\\" : $c}\\n}\\nproc rev c {\\n expr {[string is alpha $c] ? \\\"[rev [yield r]][puts -nonewline $c]\\\" : $c}\\n}\\ncoroutine f while 1 {puts -nonewline [fwd [yield r]]}\\ncoroutine r while 1 {puts -nonewline [rev [yield f]]}\\nfor {set coro f} {![eof stdin]} {} {\\n set coro [$coro [read stdin 1]]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\ninputstring=*\\nDATA what,is,the;meaning,of:life.\\nDATA we,are;not,in,kansas;any,more.\\n\\nBUILD C_GROUP >[pu]=\\\".,;:-\\\"\\n\\nLOOP i=inputstring\\npu=STRINGS (i,\\\"|>[pu]|\\\")\\nwo=STRINGS (i,\\\"|<></|\\\")\\noutputstring=\\\"\\\"\\n loop n,w=wo,p=pu\\n r=MOD(n,2)\\n IF (r==0) w=TURN (w)\\n outputstring=CONCAT(outputstring,w,p)\\nENDLOOP\\nPRINT outputstring\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"const str = 'what,is,the;meaning,of:life.'\\n\\nfn main() {\\n\\tmut temp, mut new_str := '', ''\\n\\tmut switch := true\\n\\tfor field in str {\\n\\t\\ttemp += field.ascii_str()\\n\\t\\tif field.is_alnum() == false {\\n\\t\\t\\tif switch == true {\\n\\t\\t\\t\\tnew_str += temp\\n\\t\\t\\t\\ttemp =''\\t\\t\\t\\n\\t\\t\\t\\tswitch = false\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\t\\t\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnew_str += temp.all_before_last(field.ascii_str()).reverse() + field.ascii_str()\\n\\t\\t\\t\\ttemp =''\\t\\t\\t\\n\\t\\t\\t\\tswitch = true\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t}\\t\\t\\n\\t}\\n\\tprintln(new_str)\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Private Function OddWordFirst(W As String) As String\\nDim i As Integer, count As Integer, l As Integer, flag As Boolean, temp As String\\n count = 1\\n Do\\n flag = Not flag\\n l = FindNextPunct(i, W) - count + 1\\n If flag Then\\n temp = temp & ExtractWord(W, count, l)\\n Else\\n temp = temp & ReverseWord(W, count, l)\\n End If\\n Loop While count < Len(W)\\n OddWordFirst = temp\\nEnd Function\\n\\nPrivate Function FindNextPunct(d As Integer, W As String) As Integer\\nConst PUNCT As String = \\\",;:.\\\"\\n Do\\n d = d + 1\\n Loop While InStr(PUNCT, Mid(W, d, 1)) = 0\\n FindNextPunct = d\\nEnd Function\\n\\nPrivate Function ExtractWord(W As String, c As Integer, i As Integer) As String\\n ExtractWord = Mid(W, c, i)\\n c = c + Len(ExtractWord)\\nEnd Function\\n\\nPrivate Function ReverseWord(W As String, c As Integer, i As Integer) As String\\nDim temp As String, sep As String\\n temp = Left(Mid(W, c, i), Len(Mid(W, c, i)) - 1)\\n sep = Right(Mid(W, c, i), 1)\\n ReverseWord = StrReverse(temp) & sep\\n c = c + Len(ReverseWord)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Private Function OddWordSecond(Words As String) As String\\nDim i&, count&, t$, cpt&, j&, l&, d&, f As Boolean\\nConst PUNCT As String = \\\",;:\\\"\\n For i = 1 To Len(Words)\\n 'first word\\n If i = 1 Then\\n cpt = 1\\n Do\\n t = t & Mid(Words, cpt, 1)\\n cpt = cpt + 1\\n Loop While InStr(PUNCT, Mid(Words, cpt, 1)) = 0 And cpt < Len(Words)\\n i = cpt\\n t = t & Mid(Words, i, 1)\\n End If\\n If Right(t, 1) = \\\".\\\" Then Exit For\\n 'Odd words ==> reverse\\n While InStr(PUNCT, Mid(Words, cpt + 1, 1)) = 0 And cpt < Len(Words)\\n cpt = cpt + 1\\n Wend\\n l = IIf(f = True, i, i + 1)\\n d = IIf(cpt = Len(Words), cpt - 1, cpt)\\n For j = d To l Step -1\\n t = t & Mid(Words, j, 1)\\n Next\\n If cpt = Len(Words) Then t = t & \\\".\\\": Exit For\\n f = True\\n i = cpt + 1\\n t = t & Mid(Words, i, 1)\\n 'Even words\\n cpt = i + 1\\n t = t & Mid(Words, cpt, 1)\\n Do\\n cpt = cpt + 1\\n t = t & Mid(Words, cpt, 1)\\n Loop While InStr(PUNCT, Mid(Words, cpt, 1)) = 0 And cpt < Len(Words)\\n i = cpt\\n Next\\n OddWordSecond = t\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Option Explicit\\n\\nSub Main()\\n Debug.Print \\\"Input : \\\" & \\\"we,are;not,in,kansas;any,more.\\\"\\n Debug.Print \\\"First way : \\\" & OddWordFirst(\\\"we,are;not,in,kansas;any,more.\\\")\\n Debug.Print \\\"Second way : \\\" & OddWordSecond(\\\"we,are;not,in,kansas;any,more.\\\")\\n Debug.Print \\\"\\\"\\n Debug.Print \\\"Input : \\\" & \\\"what,is,the;meaning,of:life.\\\"\\n Debug.Print \\\"First way : \\\" & OddWordFirst(\\\"what,is,the;meaning,of:life.\\\")\\n Debug.Print \\\"Second way : \\\" & OddWordSecond(\\\"what,is,the;meaning,of:life.\\\")\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin,Stdout\\nimport \\\"./str\\\" for Char\\n\\nvar fwrite = Fn.new { |ch|\\n System.write(ch)\\n Stdout.flush()\\n}\\n\\nvar doChar // recursive\\ndoChar = Fn.new { |odd, f|\\n var c = Stdin.readByte()\\n if (!c) return false // end of stream reached\\n var ch = String.fromByte(c)\\n\\n var writeOut = Fn.new {\\n fwrite.call(ch)\\n if (f) f.call()\\n }\\n\\n if (!odd) fwrite.call(ch)\\n if (Char.isLetter(ch)) return doChar.call(odd, writeOut)\\n if (odd) {\\n if (f) f.call()\\n fwrite.call(ch)\\n }\\n return ch != \\\".\\\"\\n}\\n\\nfor (i in 0..1) {\\n var b = true\\n while (doChar.call(!b, null)) b = !b\\n Stdin.readByte() // remove \\\\n from buffer\\n System.print(\\\"\\\\n\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc OWP;\\nint B;\\n func Odd;\\n int S, B;\\n [S:= ChIn(8);\\n if S < ^A then \\\\punct\\\\ return S;\\n B:= Odd;\\n ChOut(0, S);\\n return B;\\n ];\\n\\n[OpenI(8);\\nloop [loop [B:= ChIn(8);\\n ChOut(0, B);\\n if B = ^. then return;\\n if B < ^A \\\\punct\\\\ then quit;\\n ];\\n B:= Odd;\\n ChOut(0, B);\\n if B = ^. then return;\\n ];\\n];\\n\\n[OpenO(8);\\nText(8, \\\"what,is,the;meaning,of:life. \\\");\\nOWP;\\nCrLf(0);\\n\\nOpenO(8);\\nText(8, \\\"we,are;not,in,kansas;any,more. \\\");\\nOWP;\\nCrLf(0);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var [const] delim=\\\",:;/?!@#$%^&*()_+\\\", stop=\\\".\\\";\\nfcn oddly(inStream){\\n inStream=inStream.walker(3); // character iterator: string, file, etc\\n doWord:=fcn(inStream,rev,f){ // print next word forewards or reverse\\n c:=inStream.next();\\n if(not rev) c.print();\\n if(not (c==stop or delim.holds(c)))\\n\\t return(self.fcn(inStream,rev,'{ c.print(); f(); }));\\n if(rev){ f(); c.print(); }\\n return(c!=stop);\\n };\\n tf:=Walker.cycle(False,True); // every other word printed backwords\\n while(doWord(inStream, tf.next(), Void)) {}\\n println();\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"oddly(\\\"what,is,the;meaning,of:life.\\\");\\noddly(Data(0,String,\\\"we,are;not,in,kansas;any,more.\\\"));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Odd-word-problem"}}},{"rowIdx":1460,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Old_Russian_measure_of_length\n","language":"00-META"},{"code":";Task:\nWrite a program to perform a conversion of the old Russian measures of length to the metric system (and vice versa).\n\n\nIt is an example of a linear transformation of several variables. \n\n\nThe program should accept a single value in a selected unit of measurement, and convert and return it to the other units: \n<br>''vershoks'', ''arshins'', ''sazhens'', ''versts'', ''meters'', ''centimeters'' and ''kilometers''.\n\n\n;Also see:\n:* [https://en.wikipedia.org/wiki/Obsolete_Russian_units_of_measurement#Length Old Russian measure of length]\n<br><br>\n\n","language":"00-TASK"},{"code":"V unit2mult = [‘arshin’ = 0.7112, ‘centimeter’ = 0.01, ‘diuym’ = 0.0254,\n ‘fut’ = 0.3048, ‘kilometer’ = 1000.0, ‘liniya’ = 0.00254,\n ‘meter’ = 1.0, ‘milia’ = 7467.6, ‘piad’ = 0.1778,\n ‘sazhen’ = 2.1336, ‘tochka’ = 0.000254, ‘vershok’ = 0.04445,\n ‘versta’ = 1066.8]\n\n:start:\nassert(:argv.len == 3, ‘ERROR. Need two arguments - number then units’)\nFloat value\nX.try\n value = Float(:argv[1])\nX.catch\n exit(‘ERROR. First argument must be a (float) number’)\nV unit = :argv[2]\nassert(unit C unit2mult, ‘ERROR. Only know the following units: ’unit2mult.keys().join(‘ ’))\n\nprint(‘#. #. to:’.format(value, unit))\nL(unt, mlt) sorted(unit2mult.items())\n print(‘ #10: #.’.format(unt, value * unit2mult[unit] / mlt))\n","language":"11l"},{"code":"INCLUDE \"D2:REAL.ACT\" ;from the Action! Tool Kit\n\nDEFINE PTR=\"CARD\"\nDEFINE UNIT_COUNT=\"10\"\n\nPTR ARRAY\n names(UNIT_COUNT),\n values(UNIT_COUNT)\nBYTE count=[0]\n\nPROC Append(CHAR ARRAY name REAL POINTER value)\n names(count)=name\n values(count)=value\n count==+1\nRETURN\n\nPROC Init()\n REAL\n arshin,centimeter,kilometer,meter,\n sazhen,vershok,versta\n\n ValR(\"0.7112\",arshin) Append(\"arshins\",arshin)\n ValR(\"0.01\",centimeter) Append(\"centimeters\",centimeter)\n ValR(\"1000\",kilometer) Append(\"kilometers\",kilometer)\n ValR(\"1\",meter) Append(\"meters\",meter)\n ValR(\"2.1336\",sazhen) Append(\"sazhens\",sazhen)\n ValR(\"0.04445\",vershok) Append(\"vershoks\",vershok)\n ValR(\"1066.8\",versta) Append(\"versts\",versta)\nRETURN\n\nBYTE FUNC GetUnit()\n BYTE i,res\n\n FOR i=1 TO count\n DO\n PrintF(\"%B-%S\",i,names(i-1))\n IF i<count THEN Put(32) FI\n OD\n PutE()\n DO\n PrintF(\"Get unit (1-%B): \",count)\n res=InputB()\n UNTIL res>=1 AND res<=count\n OD\nRETURN (res-1)\n\nPROC PrintResult(REAL POINTER value BYTE unit)\n BYTE i\n REAL res,tmp\n\n PutE()\n FOR i=0 TO count-1\n DO\n IF i=unit THEN\n RealAssign(value,res)\n ELSE\n RealMult(value,values(unit),tmp)\n RealDiv(tmp,values(i),res)\n FI\n Print(\" \") PrintR(res)\n PrintF(\" %S%E\",names(i))\n OD\n PutE()\nRETURN\n\nPROC Main()\n BYTE unit\n REAL value\n\n Put(125) PutE() ;clear screen\n Init()\n\n DO\n Print(\"Get value: \")\n InputR(value)\n unit=GetUnit()\n PrintResult(value,unit)\n OD\nRETURN\n","language":"Action-"},{"code":"BEGIN # convert Old Russian units to/from metric #\n # mode to hold details of the units - value is in meters #\n MODE UNIT = STRUCT( STRING name, REAL value );\n # gets a UNIT from the standard input #\n PROC read unit = UNIT:\n BEGIN\n UNIT r;\n read( ( value OF r, name OF r, newline ) );\n # trim leading and trailing spaces from the name #\n INT f pos := LWB name OF r;\n WHILE IF f pos <= UPB name OF r THEN ( name OF r )[ f pos ] = \" \" ELSE FALSE FI\n DO\n f pos +:= 1\n OD;\n INT b pos := UPB name OF r;\n WHILE IF b pos >= LWB name OF r THEN ( name OF r )[ b pos ] = \" \" ELSE FALSE FI\n DO\n b pos -:= 1\n OD;\n IF f pos > b pos THEN\n # no name #\n name OF r := \"\"\n ELIF ( name OF r )[ b pos ] = \"s\" THEN\n # the user entered a plural - remove the \"S\" #\n name OF r := ( name OF r )[ f pos : b pos - 1 ]\n ELSE\n # non-blank, non-plural name #\n name OF r := ( name OF r )[ f pos : b pos ]\n FI;\n r\n END # read unit # ;\n # units and their value in meters #\n []UNIT units = ( ( \"arshin\", 0.7112 ), ( \"centimeter\", 0.01 ), ( \"diuym\", 0.0254 )\n , ( \"fut\", 0.3048 ), ( \"kilometer\", 1000.0 ), ( \"liniya\", 0.00254 )\n , ( \"meter\", 1.0 ), ( \"milia\", 7467.6 ), ( \"piad\", 0.1778 )\n , ( \"sazhen\", 2.1336 ), ( \"tochka\", 0.000254 ), ( \"vershok\", 0.04445 )\n , ( \"versta\", 1066.8 )\n );\n WHILE # prompt for units and show their conversions #\n print( ( \"Enter the unit to convert - value followed by unit name (or 0 to quit): \" ) );\n UNIT r := read unit;\n value OF r /= 0\n DO\n # find the unit name in the table of valid units #\n INT u pos := LWB units - 1;\n FOR i FROM LWB units TO UPB units WHILE u pos < LWB units DO\n IF name OF r = name OF units[ i ] THEN\n u pos := i\n FI\n OD;\n IF u pos < LWB units THEN\n # didn't find the units #\n print( ( \"Unknown units - please enter one of:\", newline, \" \" ) );\n FOR i FROM LWB units TO UPB units DO\n print( ( name OF units[ i ], IF i = UPB units THEN newline ELSE \", \" FI ) )\n OD\n ELSE\n # found the units - show the values in the other units #\n UNIT u = units[ u pos ];\n print( ( fixed( value OF r, -12, 6 ), \" \", name OF u, \" is:\", newline ) );\n FOR i FROM LWB units TO UPB units DO\n IF i /= u pos THEN\n print( ( fixed( ( value OF r * value OF u )/ value OF units[ i ], -16, 6 )\n , \" \", name OF units[ i ], newline\n )\n )\n FI\n OD\n FI\n OD\nEND\n","language":"ALGOL-68"},{"code":"-- General purpose linear measurement converter.\non convertLinear(inputNumber, inputUnitRecord, outputUnitRecord)\n set {inputType, outputType} to {inputUnitRecord's type, outputUnitRecord's type}\n if (inputType is not outputType) then error \"Unit type mismatch: \" & inputType & \", \" & outputType\n -- The |offset| values are only relevant to temperature conversions and default to zero.\n set inputUnit to inputUnitRecord & {|offset|:0}\n set outputUnit to outputUnitRecord & {|offset|:0}\n\n return (inputNumber - (inputUnit's |offset|)) * (inputUnit's coefficient) / (outputUnit's coefficient) ¬\n + (outputUnit's |offset|)\nend convertLinear\n\non program(inputNumber, inputUnitName)\n -- The task description only specifies these seven units, but more can be added if wished.\n -- The coefficients are the equivalent lengths in metres.\n set unitRecords to {{|name|:\"metre\", type:\"length\", coefficient:1.0}, ¬\n {|name|:\"centimetre\", type:\"length\", coefficient:0.01}, {|name|:\"kilometre\", type:\"length\", coefficient:1000.0}, ¬\n {|name|:\"vershok\", type:\"length\", coefficient:0.04445}, {|name|:\"arshin\", type:\"length\", coefficient:0.7112}, ¬\n {|name|:\"sazhen\", type:\"length\", coefficient:2.1336}, {|name|:\"versta\", type:\"length\", coefficient:1066.8}}\n\n -- Massage the given input unit name if necessary.\n if (inputUnitName ends with \"s\") then set inputUnitName to text 1 thru -2 of inputUnitName\n if (inputUnitName ends with \"meter\") then set inputUnitName to (text 1 thru -3 of inputUnitName) & \"re\"\n\n -- Get the record with the input unit name from 'unitRecords'.\n set inputUnitRecord to missing value\n repeat with thisRecord in unitRecords\n if (thisRecord's |name| is inputUnitName) then\n set inputUnitRecord to thisRecord's contents\n exit repeat\n end if\n end repeat\n if (inputUnitRecord is missing value) then error \"Unrecognised unit name: \" & inputUnitName\n\n -- Guess the user's spelling preference from the short-date order configured on their machine.\n tell (current date) to set {Feb1, its day, its month, its year} to {it, 1, 2, 3333}\n set USSpelling to (Feb1's short date string's first word as integer is 2)\n\n -- Convert the input number to its equivalents in all the specified units, rounding to eight decimal\n -- places and getting integer values as AS integers where possible. Pair the results with the unit names.\n set output to {}\n repeat with thisRecord in unitRecords\n set outputNumber to convertLinear(inputNumber, inputUnitRecord, thisRecord)\n set outputNumber to outputNumber div 1 + ((outputNumber * 100000000 mod 100000000) as integer) / 100000000\n if (outputNumber mod 1 is 0) then set outputNumber to outputNumber div 1\n set outputUnitName to thisRecord's |name|\n if ((outputUnitName ends with \"metre\") and (USSpelling)) then ¬\n set outputUnitName to (text 1 thru -3 of outputUnitName) & \"er\"\n if (outputNumber is not 1) then set outputUnitName to outputUnitName & \"s\"\n set end of output to {outputNumber, outputUnitName}\n end repeat\n\n return output -- {{number, unit name}, … }\nend program\n\non demo()\n set output to {}\n set astid to AppleScript's text item delimiters\n repeat with input in {{1, \"kilometre\"}, {1, \"versta\"}}\n set {inputNumber, inputUnitName} to input\n set end of output to (inputNumber as text) & space & inputUnitName & \" is:\"\n set conversions to program(inputNumber, inputUnitName)\n set AppleScript's text item delimiters to space\n repeat with thisConversion in conversions\n set thisConversion's contents to thisConversion as text\n end repeat\n set AppleScript's text item delimiters to \"; \"\n set end of output to conversions as text\n end repeat\n set AppleScript's text item delimiters to linefeed\n set output to output as text\n set AppleScript's text item delimiters to astid\n\n return output\nend demo\n\nreturn demo()\n","language":"AppleScript"},{"code":"\"1 kilometre is:\n1000 metres; 100000 centimetres; 1 kilometre; 2.249718785152E+4 vershoks; 1406.07424072 arshins; 468.69141357 sazhens; 0.93738283 verstas\n1 versta is:\n1066.8 metres; 106680 centimetres; 1.0668 kilometres; 24000 vershoks; 1500 arshins; 500 sazhens; 1 versta\"\n","language":"AppleScript"},{"code":"use AppleScript version \"2.5\" -- macOS 10.12 (Sierra) or later. Not 10.11 (El Capitan).\nuse framework \"Foundation\"\nuse scripting additions\n\nproperty |⌘| : current application\n\n-- Return a custom NSUnit with a linear converter.\non customNSUnit(unitClassName, symbol, coefficient, |offset|)\n set converter to |⌘|'s class \"NSUnitConverterLinear\"'s alloc()'s initWithCoefficient:(coefficient) |constant|:(|offset|)\n return |⌘|'s class unitClassName's alloc()'s initWithSymbol:(symbol) converter:(converter)\nend customNSUnit\n\non program(inputNumber, inputUnitName)\n -- The task description only specifies these seven units, but more can be added if wished.\n -- The base unit of the NSUnitLength class is 'meters'.\n set unitRecords to {{|name|:\"metre\", NSUnit:|⌘|'s class \"NSUnitLength\"'s |meters|()}, ¬\n {|name|:\"centimetre\", NSUnit:|⌘|'s class \"NSUnitLength\"'s |centimeters|()}, ¬\n {|name|:\"kilometre\", NSUnit:|⌘|'s class \"NSUnitLength\"'s |kilometers|()}, ¬\n {|name|:\"vershok\", NSUnit:customNSUnit(\"NSUnitLength\", \"vershok\", 0.04445, 0)}, ¬\n {|name|:\"arshin\", NSUnit:customNSUnit(\"NSUnitLength\", \"arshin\", 0.7112, 0)}, ¬\n {|name|:\"sazhen\", NSUnit:customNSUnit(\"NSUnitLength\", \"sazhen\", 2.1336, 0)}, ¬\n {|name|:\"versta\", NSUnit:customNSUnit(\"NSUnitLength\", \"versta\", 1066.8, 0)}}\n\n -- Massage the given input unit name if necessary.\n if (inputUnitName ends with \"s\") then set inputUnitName to text 1 thru -2 of inputUnitName\n if (inputUnitName ends with \"meter\") then set inputUnitName to (text 1 thru -3 of inputUnitName) & \"re\"\n\n -- Get the record with the input unit name from 'unitRecords'.\n set filter to |⌘|'s class \"NSPredicate\"'s predicateWithFormat_(\"name == %@\", inputUnitName)\n set filteredList to ((|⌘|'s class \"NSArray\"'s arrayWithArray:(unitRecords))'s filteredArrayUsingPredicate:(filter)) as list\n if (filteredList is {}) then error \"Unrecognised unit name: \" & inputUnitName\n set inputUnitRecord to beginning of filteredList\n\n -- Set up an NSMeasurement using the input number and the NSUnit from the record.\n set inputMeasurement to |⌘|'s class \"NSMeasurement\"'s alloc()'s ¬\n initWithDoubleValue:(inputNumber) unit:(inputUnitRecord's NSUnit)\n\n -- Get equivalent NSMeasurements in all the specified units and format them as text using an NSMeasurementFormatter\n -- configured to use the measurements' own units instead of local equivalents and, in the case of the three preset units,\n -- to include the full words, localised and pluralised as appropriate, instead of the symbols \"m\", \"cm\", or \"km\".\n set output to {}\n set measurementFormatter to |⌘|'s class \"NSMeasurementFormatter\"'s new()\n tell measurementFormatter to setUnitOptions:(|⌘|'s NSMeasurementFormatterUnitOptionsProvidedUnit)\n tell measurementFormatter to setUnitStyle:(|⌘|'s NSFormattingUnitStyleLong)\n repeat with thisRecord in unitRecords\n set outputMeasurement to (inputMeasurement's measurementByConvertingToUnit:(thisRecord's NSUnit))\n set formattedMeasurement to (measurementFormatter's stringFromMeasurement:(outputMeasurement)) as text\n if not ((outputMeasurement's doubleValue() is 1) or (thisRecord's |name| ends with \"metre\")) then ¬\n set formattedMeasurement to formattedMeasurement & \"s\"\n set end of output to formattedMeasurement\n end repeat\n\n return output -- {formatted text, … }\nend program\n\non demo()\n considering numeric strings\n if ((system info)'s system version < \"10.12\") then ¬\n error \"El Capitan doesn't support the Foundation framework's Units and Measurement system\"\n end considering\n set output to {}\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \"; \"\n repeat with input in {{1, \"kilometre\"}, {1, \"versta\"}}\n set {inputNumber, inputUnitName} to input\n set end of output to (inputNumber as text) & space & inputUnitName & \" is:\"\n set end of output to program(inputNumber, inputUnitName) as text\n end repeat\n set AppleScript's text item delimiters to linefeed\n set output to output as text\n set AppleScript's text item delimiters to astid\n\n return output\nend demo\n\nreturn demo()\n","language":"AppleScript"},{"code":"\"1 kilometre is:\n1,000 metres; 100,000 centimetres; 1 kilometre; 22,497.188 vershoks; 1,406.074 arshins; 468.691 sazhens; 0.937 verstas\n1 versta is:\n1,066.8 metres; 106,680 centimetres; 1.067 kilometres; 24,000 vershoks; 1,500 arshins; 500 sazhens; 1 versta\"\n","language":"AppleScript"},{"code":"# syntax: GAWK -f OLD_RUSSIAN_MEASURE_OF_LENGTH.AWK\nBEGIN {\n units = \"kilometer meter centimeter tochka liniya diuym vershok piad fut arshin sazhen versta milia\"\n values = \"1000.0 1.0 0.01 0.000254 0.00254 0.0254 0.04445 0.1778 0.3048 0.7112 2.1336 1066.8 7467.6\"\n u_leng = split(units,u_arr,\" \")\n v_leng = split(values,v_arr,\" \")\n if (u_leng != v_leng) {\n print(\"error: lengths of units & values are unequal\")\n exit(1)\n }\n print(\"enter length & measure or C/R to exit\")\n}\n{ if ($0 == \"\") {\n exit(0)\n }\n measure = tolower($2)\n sub(/s$/,\"\",measure)\n for (i=1; i<=u_leng; i++) {\n if (u_arr[i] == measure) {\n for (j=1; j<=u_leng; j++) {\n str = sprintf(\"%.8f\",$1*v_arr[i]/v_arr[j])\n sub(/0+$/,\"\",str)\n printf(\"%10s %s\\n\",u_arr[j],str)\n }\n print(\"\")\n next\n }\n }\n printf(\"error: invalid measure; choose from: %s\\n\\n\",units)\n}\n","language":"AWK"},{"code":"arraybase 1\ndim units = {\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\", \"arshin\", \"sazhen\", \"versta\", \"milia\", \"centimeter\", \"meter\", \"kilometer\"}\n# all expressed in centimeters\ndim convs = {0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000}\n\ndo\n\tcls\n\tprint\n\tfor i = 1 to units[?]\n\t\tprint rjust(string(i),2); \" \"; units[i]\n\tnext\n\tprint\n\tdo\n\t\tinput \"Please choose a unit 1 to 13 : \", unit\n\tuntil unit >= 1 and unit <= 13\n\tprint\n\tdo\n\t\tinput \"Now enter a value in that unit : \", value\n\tuntil value >= 0\n\tprint\n\tprint \"The equivalent in the remaining units is : \"\n\tprint\n\tfor i = 1 to units[?]\n\t\tif i = unit then continue for\n\t\tprint \" \"; units[i], \" : \"; value * convs[unit] / convs[i]\n\tnext\n\tprint\n\tdo\n\t\tinput \"Do another one y/n : \", yn\n\t\tyn = lower(yn)\n\tuntil yn = \"y\" or yn = \"n\"\nuntil yn = \"n\"\n","language":"BASIC256"},{"code":"REM >oldrussian\n@% = &90E\nPROColdrus(1, \"meter\")\nPRINT\nPROColdrus(10, \"arshin\")\nEND\n:\nDEF PROColdrus(length, unit$)\nLOCAL units$(), values(), unit%, i%\nDIM units$(12)\nDIM values(12)\nunits$() = \"kilometer\", \"meter\", \"centimeter\", \"milia\", \"versta\", \"sazhen\", \"arshin\", \"fut\", \"piad\", \"vershok\", \"diuym\", \"liniya\", \"tochka\"\nvalues() = 1000, 1, 0.01, 7467.6, 1066.8, 2.1336, 0.7112, 0.3048, 0.1778, 0.04445, 0.0254, 0.00254, 0.000254\nunit% = -1\nFOR i% = 0 TO 12\n IF units$(i%) = unit$ THEN unit% = i%\nNEXT\nIF unit% = -1 THEN\n PRINT \"Unknown unit '\"; unit$; \"'\"\nELSE\n PRINT; length; \" \"; unit$; \" =\"\n FOR i% = 0 TO 12\n IF i% <> unit% THEN PRINT length / values(i%) * values(unit%); \" \"; units$(i%)\n NEXT\nENDIF\nENDPROC\n","language":"BBC-BASIC"},{"code":"#include<string.h>\n#include<stdlib.h>\n#include<ctype.h>\n#include<stdio.h>\n\n#define UNITS_LENGTH 13\n\nint main(int argC,char* argV[])\n{\n\tint i,reference;\n\tchar *units[UNITS_LENGTH] = {\"kilometer\",\"meter\",\"centimeter\",\"tochka\",\"liniya\",\"diuym\",\"vershok\",\"piad\",\"fut\",\"arshin\",\"sazhen\",\"versta\",\"milia\"};\n double factor, values[UNITS_LENGTH] = {1000.0,1.0,0.01,0.000254,0.00254,0.0254,0.04445,0.1778,0.3048,0.7112,2.1336,1066.8,7467.6};\n\t\n\tif(argC!=3)\n\t\tprintf(\"Usage : %s followed by length as <value> <unit>\");\n\telse{\n\t\tfor(i=0;argV[2][i]!=00;i++)\n\t\t\targV[2][i] = tolower(argV[2][i]);\n\t\t\n\t\tfor(i=0;i<UNITS_LENGTH;i++){\n\t\t\tif(strstr(argV[2],units[i])!=NULL){\n\t\t\t\treference = i;\n\t\t\t\tfactor = atof(argV[1])*values[i];\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%s %s is equal in length to : \\n\",argV[1],argV[2]);\n\t\t\n\t\tfor(i=0;i<UNITS_LENGTH;i++){\n\t\t\tif(i!=reference)\n\t\t\t\tprintf(\"\\n%lf %s\",factor/values[i],units[i]);\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <iomanip>\n//-------------------------------------------------------------------------------------------\nusing namespace std;\n\n//-------------------------------------------------------------------------------------------\nclass ormConverter\n{\npublic:\n ormConverter() : AR( 0.7112f ), CE( 0.01f ), DI( 0.0254f ), FU( 0.3048f ), KI( 1000.0f ), LI( 0.00254f ), ME( 1.0f ),\n\t\t MI( 7467.6f ), PI( 0.1778f ), SA( 2.1336f ), TO( 0.000254f ), VE( 0.04445f ), VR( 1066.8f ) {}\n void convert( char c, float l )\n {\n\tsystem( \"cls\" );\n\tcout << endl << l;\n\tswitch( c )\n\t{\n\t case 'A': cout << \" Arshin to:\"; l *= AR; break;\n\t case 'C': cout << \" Centimeter to:\"; l *= CE; break;\n\t case 'D': cout << \" Diuym to:\"; l *= DI; break;\n\t case 'F': cout << \" Fut to:\"; l *= FU; break;\n\t case 'K': cout << \" Kilometer to:\"; l *= KI; break;\n\t case 'L': cout << \" Liniya to:\"; l *= LI; break;\n\t case 'M': cout << \" Meter to:\"; l *= ME; break;\n\t case 'I': cout << \" Milia to:\"; l *= MI; break;\n\t case 'P': cout << \" Piad to:\"; l *= PI; break;\n\t case 'S': cout << \" Sazhen to:\"; l *= SA; break;\n\t case 'T': cout << \" Tochka to:\"; l *= TO; break;\n\t case 'V': cout << \" Vershok to:\"; l *= VE; break;\n\t case 'E': cout << \" Versta to:\"; l *= VR;\n\t}\n\n\tfloat ar = l / AR, ce = l / CE, di = l / DI, fu = l / FU, ki = l / KI, li = l / LI, me = l / ME,\n\t mi = l / MI, pi = l / PI, sa = l / SA, to = l / TO, ve = l / VE, vr = l / VR;\n\tcout << left << endl << \"=================\" << endl\n\t << setw( 12 ) << \"Arshin:\" << ar << endl << setw( 12 ) << \"Centimeter:\" << ce << endl\n\t << setw( 12 ) << \"Diuym:\" << di << endl << setw( 12 ) << \"Fut:\" << fu << endl\n\t << setw( 12 ) << \"Kilometer:\" << ki << endl << setw( 12 ) << \"Liniya:\" << li << endl\n\t << setw( 12 ) << \"Meter:\" << me << endl << setw( 12 ) << \"Milia:\" << mi << endl\n\t << setw( 12 ) << \"Piad:\" << pi << endl << setw( 12 ) << \"Sazhen:\" << sa << endl\n\t << setw( 12 ) << \"Tochka:\" << to << endl << setw( 12 ) << \"Vershok:\" << ve << endl\n\t << setw( 12 ) << \"Versta:\" << vr << endl << endl << endl;\n }\nprivate:\n const float AR, CE, DI, FU, KI, LI, ME, MI, PI, SA, TO, VE, VR;\n};\n//-------------------------------------------------------------------------------------------\nint _tmain(int argc, _TCHAR* argv[])\n{\n ormConverter c;\n char s; float l;\n while( true )\n {\n\tcout << \"What unit:\\n(A)rshin, (C)entimeter, (D)iuym, (F)ut\\n(K)ilometer, (L)iniya, (M)eter, m(I)lia, (P)iad\\n(S)azhen, (T)ochka, (V)ershok, v(E)rsta, (Q)uit\\n\";\n\tcin >> s; if( s & 32 ) s ^= 32; if( s == 'Q' ) return 0;\n\tcout << \"Length (0 to Quit): \"; cin >> l; if( l == 0 ) return 0;\n\tc.convert( s, l ); system( \"pause\" ); system( \"cls\" );\n }\n return 0;\n}\n//-------------------------------------------------------------------------------------------\n","language":"C++"},{"code":"import std.stdio, std.string, std.algorithm, std.conv;\n\nvoid main(in string[] args) {\n auto factor = [\"arshin\": 0.7112,\n \"centimeter\": 0.01,\n \"diuym\": 0.0254,\n \"fut\": 0.3048,\n \"kilometer\": 1_000.0,\n \"liniya\": 0.00254,\n \"meter\": 1.0,\n \"milia\": 7_467.6,\n \"piad\": 0.1778,\n \"sazhen\": 2.1336,\n \"tochka\": 0.000254,\n \"vershok\": 0.04445,\n \"versta\": 1_066.8];\n\n if (args.length != 3 || !isNumeric(args[1]) || args[2] !in factor)\n return writeln(\"Please provide args Value and Unit.\");\n\n immutable magnitude = args[1].to!double;\n immutable meters = magnitude * factor[args[2]];\n writefln(\"%s %s to:\\n\", args[1], args[2]);\n foreach (immutable key; factor.keys.schwartzSort!(k => factor[k]))\n writefln(\"%10s: %s\", key, meters / factor[key]);\n}\n","language":"D"},{"code":"program Old_Russian_measure_of_length;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nconst\n units: array[0..12] of string = ('tochka', 'liniya', 'dyuim', 'vershok',\n 'piad', 'fut', 'arshin', 'sazhen', 'versta', 'milia', 'centimeter', 'meter',\n 'kilometer');\n convs: array[0..12] of double = (0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\n 71.12, 213.36, 10668, 74676, 1, 100, 10000);\n\nfunction ReadInt(): integer;\nvar\n data: string;\nbegin\n Readln(data);\n Result := StrToIntDef(data, -1);\nend;\n\nfunction ReadFloat(): Double;\nvar\n data: string;\nbegin\n Readln(data);\n Result := StrToFloatDef(data, -1);\nend;\n\nvar\n yn, u: string;\n i, unt: integer;\n value: Double;\n\nbegin\n\n repeat\n for i := 0 to High(units) do\n begin\n u := units[i];\n Writeln(format('%2d %s', [i + 1, u]));\n end;\n Writeln;\n\n unt := 0;\n repeat\n Writeln('Please choose a unit 1 to 13 : ');\n unt := ReadInt();\n until (unt >= 1) and (unt <= 13);\n\n dec(unt);\n\n repeat\n Writeln('Now enter a value in that unit : ');\n value := ReadFloat();\n until value >= 0;\n\n Writeln(#10'The equivalent in the remaining units is:'#10);\n\n for i := 0 to High(units) do\n begin\n u := units[i];\n if i = unt then\n Continue;\n Writeln(format(' %10s : %g', [u, value * convs[unt] / convs[i]]));\n end;\n\n Writeln;\n\n yn := '';\n Writeln('Do another one y/n : ');\n readln(yn);\n until yn.toLower = 'n';\nend.\n","language":"Delphi"},{"code":"units$[] = [ \"tochka\" \"liniya\" \"dyuim\" \"vershok\" \"piad\" \"fut\" \"arshin\" \"sazhen\" \"versta\" \"milia\" \"centimeter\" \"meter\" \"kilometer\" ]\nconvs[] = [ 0.254 0.254 2.54 4.445 17.78 30.48 71.12 213.36 10668 74676 1 100 10000 ]\nfor i to len units$[]\n print i & \") \" & units$[i]\n.\nprint \"\"\nwrite \"Please choose a unit (1 to 13): \"\nrepeat\n unit = number input\n until unit >= 1 and unit <= 13\n.\nprint unit\nwrite \"Now enter a value in that unit: \"\nrepeat\n value = -1\n value = number input\n print value\n until value >= 0\n.\nprint value\nprint \"\"\nprint value & \" \" & units$[unit] & \" are\"\nprint \"\"\nfor i to len units$[]\n if i <> unit\n print value * convs[unit] / convs[i] & \" \" & units$[i]\n .\n.\n","language":"EasyLang"},{"code":"import system'collections;\nimport system'routines;\nimport extensions;\n\nunit2mult = new Map<string, real>()\n .setAt(\"arshin\", 0.7112r)\n .setAt(\"centimeter\", 0.01r)\n .setAt(\"diuym\", 0.0254r)\n .setAt(\"fut\", 0.3048r)\n .setAt(\"kilometer\", 1000.0r)\n .setAt(\"liniya\", 0.00254r)\n .setAt(\"meter\", 1.0r)\n .setAt(\"milia\", 7467.6r)\n .setAt(\"piad\", 0.1778r)\n .setAt(\"sazhen\", 2.1336r)\n .setAt(\"tochka\", 0.000254r)\n .setAt(\"vershok\", 0.04445r)\n .setAt(\"versta\", 1066.8r);\n\npublic program()\n{\n if (program_arguments.Length != 3)\n { console.writeLine(\"need two arguments - number then units\"); AbortException.raise() };\n\n real value := program_arguments[1].toReal();\n string unit := program_arguments[2];\n ifnot (unit2mult.containsKey(unit))\n {\n console.printLine(\"only following units are supported:\",\n unit2mult.selectBy::(x=>x.Item1).asEnumerable());\n\n AbortException.raise()\n };\n\n console.printLine(value,\" \",unit,\" to:\");\n\n unit2mult.forEach::(u,mlt)\n {\n console.printPaddingLeft(30, u, \":\").printLine(value * unit2mult[unit] / mlt)\n }\n}\n","language":"Elena"},{"code":"USING: formatting inverse io kernel math prettyprint quotations\nsequences units.imperial units.si vocabs ;\nIN: rosetta-code.units.russian\n\n: arshin ( n -- d ) 2+1/3 * feet ;\n: tochka ( n -- d ) 1/2800 * arshin ;\n: liniya ( n -- d ) 1/280 * arshin ;\n: dyuim ( n -- d ) 1/28 * arshin ;\n: vershok ( n -- d ) 1/16 * arshin ;\n: ladon ( n -- d ) 7+1/2 * cm ;\n: piad ( n -- d ) 1/4 * arshin ;\n: fut ( n -- d ) 3/7 * arshin ;\n: lokot ( n -- d ) 45 * cm ;\n: shag ( n -- d ) 71 * cm ;\n: sazhen ( n -- d ) 3 * arshin ;\n: versta ( n -- d ) 1,500 * arshin ;\n: milya ( n -- d ) 10,500 * arshin ;\n\n<PRIVATE\n\n: convert ( quot -- )\n [ unparse rest rest but-last write \"to:\" print ] [ call ] bi\n \"rosetta-code.units.russian\" vocab-words { cm m km } append\n [ dup \"%8u : \" printf 1quotation [undo] call( x -- x ) . ]\n with each nl ; inline\n\n: main ( -- )\n [ 6 m ] [ 1+7/8 milya ] [ 2 furlongs ] [ convert ] tri@ ;\n\nPRIVATE>\n\nMAIN: main\n","language":"Factor"},{"code":"create units s\" kilometer\" 2, s\" meter\" 2, s\" centimeter\" 2, s\" tochka\" 2, s\" liniya\" 2, s\" diuym\" 2, s\" vershok\" 2, s\" piad\" 2, s\" fut\" 2, s\" arshin\" 2, s\" sazhen\" 2, s\" versta\" 2, s\" milia\" 2,\ncreate values 1000.0e f, 1.0e f, 0.01e f, 0.000254e f, 0.00254e f, 0.0254e f, 0.04445e f, 0.1778e f, 0.3048e f, 0.7112e f, 2.1336e f, 1066.8e f, 7467.6e f,\n: unit ( u1 -- caddr u1 )\n units swap 2 cells * + 2@ ;\n: myval ( u1 -- caddr u1 )\n values swap 1 cells * + f@ ;\n: 2define create 0 , 0 , ;\n\n2define ch_u\nvariable mlt\nvariable theunit\n: show ( chosen_unit chosen_mutliplier -- )\n ch_u 2!\n mlt f!\n 13 0 DO\n ch_u 2@ i unit compare if\n else mlt f@ f. i unit type cr .\" ===========\" cr\n i myval theunit f!\n 13 0 DO\n .\" \t\" i unit type .\" : \" theunit f@ i myval f/ mlt f@ f* f. cr\n LOOP\n then\n LOOP cr ;\n1e s\" meter\" show\n20e s\" versta\" show\n10e s\" milia\" show\n","language":"Forth"},{"code":"PROGRAM RUS\n IMPLICIT NONE\n REAL, PARAMETER:: E_m = 1.\n REAL, PARAMETER:: E_mm = 1.E-3\n REAL, PARAMETER:: E_km = 1.E+3\n REAL, PARAMETER:: E_cm = 1.E-2\n REAL, PARAMETER:: E_arshin = 71.12 * E_cm\n REAL, PARAMETER:: E_fut = 3./7. * E_arshin\n REAL, PARAMETER:: E_piad = 1./4. * E_arshin\n REAL, PARAMETER:: E_vershok = 1./16. * E_arshin\n REAL, PARAMETER:: E_dyuim = 1./28. * E_arshin\n REAL, PARAMETER:: E_liniya = 1./280. * E_arshin\n REAL, PARAMETER:: E_tochka = 1./2800. * E_arshin\n REAL, PARAMETER:: E_ladon = 7.5 * E_cm\n REAL, PARAMETER:: E_lokot = 45 * E_cm\n REAL, PARAMETER:: E_sazhen = 3. * E_arshin\n REAL, PARAMETER:: E_versta = 1500. * E_arshin\n REAL, PARAMETER:: E_milya = 10500. * E_arshin\n INTEGER, PARAMETER:: N = 16\n CHARACTER(LEN=7), DIMENSION(N):: nam = (/&\n &'m ', 'mm ', 'km ', 'cm ',&\n &'arshin ', 'fut ', 'piad ', 'vershok',&\n &'dyuim ', 'liniya ', 'tochka ', 'ladon ',&\n &'lokot ', 'sazhen ', 'versta ', 'milya ' /)\n REAL, DIMENSION(N):: wert = (/ &\n &1., E_mm, E_km, E_cm,&\n &E_arshin, E_fut, E_piad, E_vershok,&\n &E_dyuim, E_liniya, E_tochka, E_ladon,&\n &E_lokot, E_sazhen, E_versta, E_milya /)\n CHARACTER(LEN=7):: RD_U\n REAL:: RD_V\n INTEGER:: I, J\n DO I=1, N\n WRITE(*, '(A, \" \")', ADVANCE='NO') nam(I)\n END DO\n WRITE (*, *)\n WRITE(*, '(A)', ADVANCE='NO') 'value unit -> '\n READ(*, *) RD_V, RD_U\n RD_U = ADJUSTL(RD_U)\n J = 1\n DO WHILE (NAM(J) .NE. RD_U)\n J = J + 1\n IF (J .GT. N) STOP \"Unit not known: \"//RD_U\n END DO\n RD_V = RD_V * wert(J)\n DO I=1, N\n J = J + 1\n IF (J .GT. N) J = 1\n WRITE (*, '(F20.3, \" \", A)') RD_V / wert(J), nam(J)\n END DO\nEND PROGRAM RUS\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nDim units(1 To 13) As String = {\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\", _\n \"arshin\", \"sazhen\", \"versta\", \"milia\", _\n \"centimeter\", \"meter\", \"kilometer\"}\n\n' all expressed in centimeters\nDim convs(1 To 13) As Single = {0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, _\n 71.12, 213.36, 10668, 74676, _\n 1, 100, 10000}\nDim unit As Integer\nDim value As Single\nDim yn As String\n\nDo\n Shell(\"cls\")\n Print\n For i As Integer = 1 To 13\n Print Using \"##\"; i;\n Print \" \"; units(i)\n Next\n Print\n Do\n Input \"Please choose a unit 1 to 13 : \"; unit\n Loop Until unit >= 1 AndAlso unit <= 13\n Print\n Do\n Input \"Now enter a value in that unit : \"; value\n Loop Until value >= 0\n Print\n Print \"The equivalent in the remaining units is : \"\n Print\n For i As Integer = 1 To 13\n If i = unit Then Continue For\n Print \" \"; units(i), \" : \"; value * convs(unit) / convs(i)\n Next\n Print\n Do\n Input \"Do another one y/n : \"; yn\n yn = LCase(yn)\n Loop Until yn = \"y\" OrElse yn = \"n\"\nLoop Until yn = \"n\"\n\nEnd\n","language":"FreeBASIC"},{"code":"arshin := (2 + 1/3) ft\nvershok := 1/16 arshin\nsazhen := 3 arshin\nverst := 1500 arshin\nversta := verst\n\ndo\n{\n valstr = input[\"Enter unit of measure: \", \"1 arshin\"]\n val = eval[valstr]\n if ! (val conforms length)\n println[\"$valstr is not a unit of length.\"]\n} until val conforms length\n\nprintln[\"$valstr = \"]\nprintln[\" \" + (val -> \"arshin\")]\nprintln[\" \" + (val -> \"vershok\")]\nprintln[\" \" + (val -> \"sazhen\")]\nprintln[\" \" + (val -> \"verst\")]\nprintln[\" \" + (val -> \"feet\")]\nprintln[\" \" + (val -> \"meters\")]\nprintln[\" \" + (val -> \"centimeters\")]\nprintln[\" \" + (val -> \"kilometers\")]\n","language":"Frink"},{"code":"Public Sub Main()\n\n Dim units As String[] = [\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\", \"arshin\", \"sazhen\", \"versta\", \"milia\", \"centimeter\", \"meter\", \"kilometer\"]\n\n ' all expressed in centimeters\n Dim convs As Single[] = [0.254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000]\n Dim i, unit As Integer\n Dim value As Single\n Dim yn As String\n\n Do\n Shell(\"clear\")\n Print\n For i = 1 To units.count\n Print Format$(i, \"##\"); \" \"; units[i - 1]\n Next\n Print \"\\nPlease choose a unit 1 to 13 : \"\n Do\n Input unit\n Loop Until unit >= 1 And unit <= 13\n Print \"\\nNow enter a value in that unit : \"\n Do\n Input value\n Loop Until value >= 0\n Print \"\\nThe equivalent in the remaining units is : \\n\"\n For i = 0 To units.count - 1\n If i = unit - 1 Then Continue 'For\n Print units[i]; Space$(10 - Len(units[i]));\n Print \" : \"; value * convs[unit - 1] / convs[i]\n Next\n Print \"\\nDo another one y/n : \"\n Do\n Input yn\n yn = LCase(yn)\n Loop Until yn = \"y\" Or yn = \"n\"\n Loop Until yn = \"n\"\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"bufio\"\n \"fmt\"\n \"os\"\n \"strconv\"\n \"strings\"\n)\n\nfunc main() {\n units := []string{\n \"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\",\n \"arshin\", \"sazhen\", \"versta\", \"milia\",\n \"centimeter\", \"meter\", \"kilometer\",\n }\n\n convs := []float32{\n 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\n 71.12, 213.36, 10668, 74676,\n 1, 100, 10000,\n }\n\n scanner := bufio.NewScanner(os.Stdin)\n for {\n for i, u := range units {\n fmt.Printf(\"%2d %s\\n\", i+1, u)\n }\n fmt.Println()\n var unit int\n var err error\n for {\n fmt.Print(\"Please choose a unit 1 to 13 : \")\n scanner.Scan()\n unit, err = strconv.Atoi(scanner.Text())\n if err == nil && unit >= 1 && unit <= 13 {\n break\n }\n }\n unit--\n var value float64\n for {\n fmt.Print(\"Now enter a value in that unit : \")\n scanner.Scan()\n value, err = strconv.ParseFloat(scanner.Text(), 32)\n if err == nil && value >= 0 {\n break\n }\n }\n fmt.Println(\"\\nThe equivalent in the remaining units is:\\n\")\n for i, u := range units {\n if i == unit {\n continue\n }\n fmt.Printf(\" %10s : %g\\n\", u, float32(value)*convs[unit]/convs[i])\n }\n fmt.Println()\n yn := \"\"\n for yn != \"y\" && yn != \"n\" {\n fmt.Print(\"Do another one y/n : \")\n scanner.Scan()\n yn = strings.ToLower(scanner.Text())\n }\n if yn == \"n\" {\n return\n }\n }\n}\n","language":"Go"},{"code":"module Main where\n\nimport Text.Printf (printf)\nimport System.Environment (getArgs, getProgName)\n\ntochka = (\"tochka\" , 0.000254)\nliniya = (\"liniya\" , 0.00254)\ncentimeter = (\"centimeter\", 0.01)\ndiuym = (\"diuym\" , 0.0254)\nvershok = (\"vershok\" , 0.04445)\npiad = (\"piad\" , 0.1778)\nfut = (\"fut\" , 0.3048)\narshin = (\"arshin\" , 0.7112)\nmeter = (\"meter\" , 1.0)\nsazhen = (\"sazhen\" , 2.1336)\nkilometer = (\"kilometer\" , 1000.0)\nversta = (\"versta\" , 1066.8)\nmilia = (\"milia\" , 7467.6)\n\nunits :: [(String, Double)]\nunits = [tochka, liniya, centimeter, diuym, vershok, piad, fut, arshin, meter, sazhen, kilometer, versta, milia]\n\n\nconvert :: Double -> Double -> IO ()\nconvert num factor = mapM_ (\\(unit, fac) -> printf \"| %-10s | %-22f|\\n\" unit (num * factor / fac)) units\n\nmain :: IO ()\nmain = do\n args <- getArgs\n case args of\n [x,y] | [(num, \"\")] <- reads x :: [(Double, String)]\n , (Just factor) <- lookup y units -> convert num factor\n (_) -> do\n name <- getProgName\n printf \"Arguments were wrong - please use ./%s <number> <unit>\\n\" name\n","language":"Haskell"},{"code":"#!/usr/bin/ijconsole\nUNIT2MULT=: |:_2 (; \".)&;/\\;:'arshin 0.7112 centimeter 0.01 diuym 0.0254 fut 0.3048 kilometer 1000.0 liniya 0.00254 meter 1.0 milia 7467.6 piad 0.1778 sazhen 2.1336 tochka 0.000254 vershok 0.04445 versta 1066.8'\n\nconv=: UNIT2MULT 1 : 0\n if. 2 ~: # y do. 'ERROR. Need two arguments - number then units'\n else.\n 'VALUE UNIT'=. (;~ _&\".)&;~/y\n if. _ = VALUE do. 'ERROR. First argument must be a (float) number'\n else.\n try.\n scale=. ({::~ i.&(<UNIT))~/m\n ((\":;:inv y),' to:'),\":({.m),.({:m)*L:0 VALUE%scale\n catch.\n 'ERROR. Only know the following units: ',;:inv{.m\n end.\n end.\n end.\n)\n\nNB. for use from os command line only:\nexit echo conv }.ARGV\n","language":"J"},{"code":"public class OldRussianMeasures {\n\n final static String[] keys = {\"tochka\", \"liniya\", \"centimeter\", \"diuym\",\n \"vershok\", \"piad\", \"fut\", \"arshin\", \"meter\", \"sazhen\", \"kilometer\",\n \"versta\", \"milia\"};\n\n final static double[] values = {0.000254, 0.00254, 0.01,0.0254,\n 0.04445, 0.1778, 0.3048, 0.7112, 1.0, 2.1336, 1000.0,\n 1066.8, 7467.6};\n\n public static void main(String[] a) {\n if (a.length == 2 && a[0].matches(\"[+-]?\\\\d*(\\\\.\\\\d+)?\")) {\n double inputVal = lookup(a[1]);\n if (!Double.isNaN(inputVal)) {\n double magnitude = Double.parseDouble(a[0]);\n double meters = magnitude * inputVal;\n System.out.printf(\"%s %s to: %n%n\", a[0], a[1]);\n for (String k: keys)\n System.out.printf(\"%10s: %g%n\", k, meters / lookup(k));\n return;\n }\n }\n System.out.println(\"Please provide a number and unit\");\n\n }\n\n public static double lookup(String key) {\n for (int i = 0; i < keys.length; i++)\n if (keys[i].equals(key))\n return values[i];\n return Double.NaN;\n }\n}\n","language":"Java"},{"code":"def lpad($len): tostring | ($len - length) as $l | (\" \" * $l) + .;\n\ndef Units: {\n \"arshin\" : 0.7112,\n \"centimeter\": 0.01,\n \"diuym\" : 0.0254,\n \"fut\" : 0.3048,\n \"kilometer\" : 1000.0,\n \"liniya\" : 0.00254,\n \"meter\" : 1.0,\n \"milia\" : 7467.6,\n \"piad\" : 0.1778,\n \"sazhen\" : 2.1336,\n \"tochka\" : 0.000254,\n \"vershok\" : 0.04445,\n \"versta\" : 1066.8\n};\n\ndef cyrillic: {\n \"arshin\" : \"арши́н\",\n \"centimeter\": \"сантиметр\",\n \"diuym\" : \"дюйм\",\n \"fut\" : \"фут\",\n \"kilometer\" : \"километр\",\n \"liniya\" : \"ли́ния\",\n \"meter\" : \"метр\",\n \"milia\" : \"ми́ля\",\n \"piad\" : \"пядь\",\n \"sazhen\" : \"саже́нь\",\n \"tochka\" : \"то́чка\",\n \"vershok\" : \"вершо́к\",\n \"versta\" : \"верста́\"\n};\n\ndef request:\n def explain: \"number and unit of measurement expected vs \\(.)\" | error;\n def check:\n $ARGS.positional\n | if length >= 2\n then (try (.[0] | tonumber) catch false) as $n\n | (.[1] | sub(\"s$\";\"\")) as $u\n | if $n and Units[$u] then [$n, $u]\n else explain\n end\n else explain\n end;\n check ;\n\n# Input: a number\n# Delete unhelpful digits\ndef humanize($n):\n tostring\n | ( capture(\"^(?<head>[0-9]*)[.](?<zeros>0*)(?<tail>[0-9]*)$\")\n | (.head|length) as $hl\n | if $hl > $n then .head + \".\"\n elif .head | (. == \"\" or . == \"0\")\n then .head + \".\" + .zeros + .tail[:1 + $n - $hl]\n else .head + \".\" + (.zeros + .tail)[:1 + $n - $hl]\n end ) // .;\n\ndef display:\n Units\n | . as $Units\n | request as [$n, $unit]\n | \"\\($n) \\($unit)\\(if $n == 1 then \"\" else \"s\" end) ::\",\n (to_entries[]\n | \"\\(.key|lpad(10)) : \\(($n * $Units[$unit] / .value) | humanize(5)) \\(cyrillic[.key])\"),\n \"\" ;\n\ndisplay\n","language":"Jq"},{"code":"using DataStructures\n\nconst unit2mult = Dict(\n \"arshin\" => 0.7112, \"centimeter\" => 0.01, \"diuym\" => 0.0254,\n \"fut\" => 0.3048, \"kilometer\" => 1000.0, \"liniya\" => 0.00254,\n \"meter\" => 1.0, \"milia\" => 7467.6, \"piad\" => 0.1778,\n \"sazhen\" => 2.1336, \"tochka\" => 0.000254, \"vershok\" => 0.04445,\n \"versta\" => 1066.8)\n\n@assert length(ARGS) == 2 \"need two arguments - number then units\"\n\nglobal value\ntry value = parse(Float64, ARGS[1])\ncatch error(\"first argument must be a (float) number\") end\n\nif isnull(value) error(\"first argument must be a (float) number\") end\nunit = ARGS[2]\n@assert unit ∈ keys(unit2mult) \"only know the following units:\\n\" * join(keys(unit2mult), \", \")\n\nprintln(\"$value $unit to:\")\nfor (unt, mlt) in sort(unit2mult)\n @printf(\" %10s: %g\\n\", unt, value * unit2mult[unit] / mlt)\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\n/* clears console on Windows 10 */\nfun cls() = ProcessBuilder(\"cmd\", \"/c\", \"cls\").inheritIO().start().waitFor()\n\nfun main(args: Array<String>) {\n val units = listOf(\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\",\n \"arshin\", \"sazhen\", \"versta\", \"milia\",\n \"centimeter\", \"meter\", \"kilometer\")\n val convs = arrayOf(0.0254f, 0.254f, 2.54f, 4.445f, 17.78f, 30.48f,\n 71.12f, 213.36f, 10668.0f, 74676.0f,\n 1.0f, 100.0f, 10000.0f)\n var unit: Int\n var value: Float\n var yn : String\n do {\n cls()\n println()\n for (i in 0 until units.size) println(\"${\"%2d\".format(i + 1)} ${units[i]}\")\n println()\n do {\n print(\"Please choose a unit 1 to 13 : \")\n unit = try { readLine()!!.toInt() } catch (e: NumberFormatException) { 0 }\n }\n while (unit !in 1..13)\n unit--\n do {\n print(\"Now enter a value in that unit : \")\n value = try { readLine()!!.toFloat() } catch (e: NumberFormatException) { -1.0f }\n }\n while (value < 0.0f)\n println(\"\\nThe equivalent in the remaining units is:\\n\")\n for (i in 0 until units.size) {\n if (i == unit) continue\n println(\" ${units[i].padEnd(10)} : ${value * convs[unit] / convs[i]}\")\n }\n println()\n do {\n print(\"Do another one y/n : \")\n yn = readLine()!!.toLowerCase()\n }\n while (yn != \"y\" && yn != \"n\")\n }\n while (yn == \"y\")\n}\n","language":"Kotlin"},{"code":"module OldRusianMeasureOfLength {\n\tunit2mult=list:=\"arshin\" := 0.7112, \"centimeter\" := 0.01, \"diuym\" := 0.0254, \"fut\" := 0.3048, \"kilometer\" := 1000.0, \"liniya\" := 0.00254, \"meter\" := 1.0, \"milia\" := 7467.6, \"piad\" := 0.1778, \"sazhen\" := 2.1336, \"tochka\":= 0.000254, \"vershok\" := 0.04445, \"versta\" := 1066.8\n\tk=each(unit2mult)\n\tmenu // empty menu list\n\tmenu + \"(exit)\"\n\twhile k\n\t\tmenu + eval$(k!)\n\tend while\n\tdouble v\n\tdo\n\t\tPrint \"Value, Unit\";\n\t\tinput \":\", v;\n\t\tprint \" \";\n\t\tmenu !\n\t\tif menu>0 then\n\t\t\tprint menu$(menu)\t\t\t\n\t\t\tif menu$(menu)=\"(exit)\" then exit\n\t\t\tPrint v;\" \";menu$(menu);\" to:\"\n\t\t\tv*=unit2mult(menu$(menu))\n\t\t\tk=each(unit2mult)\n\t\t\twhile k\n\t\t\t\tif eval$(k!)=menu$(menu) then continue\n\t\t\t\tprint format$(\"{0:-12}: {1}\",eval$(k!), round(v/eval(k),9))\n\t\t\tend while\n\t\telse\n\t\t\texit\n\t\tend if\n\talways\n}\nOldRusianMeasureOfLength\n","language":"M2000-Interpreter"},{"code":"ClearAll[units, ConvertRussianQuantities]\nunits = {\"RussianVershoks\", \"RussianArshins\", \"RussianSazhens\", \"RussianVerstas\", \"Centimeters\", \"Meters\", \"Kilometers\"};\nConvertRussianQuantities[q_Quantity] := UnitConvert[q, #] & /@ Select[units, QuantityUnit[q] != # &]\nConvertRussianQuantities[Quantity[1, \"Vershoks\"]]\nConvertRussianQuantities[Quantity[1, \"Arshins\"]]\n","language":"Mathematica"},{"code":"import os, strutils, sequtils, tables\n\nconst Unit2Mult = {\"arshin\": 0.7112, \"centimeter\": 0.01, \"diuym\": 0.0254,\n \"fut\": 0.3048, \"kilometer\": 1000.0, \"liniya\": 0.00254,\n \"meter\": 1.0, \"milia\": 7467.6, \"piad\": 0.1778,\n \"sazhen\": 2.1336, \"tochka\": 0.000254, \"vershok\": 0.04445,\n \"versta\": 1066.8}.toOrderedTable\n\nif paramCount() != 2:\n raise newException(ValueError, \"need two arguments: number then units.\")\n\nlet value = try: parseFloat(paramStr(1))\n except ValueError:\n raise newException(ValueError, \"first argument must be a (float) number.\")\n\nlet unit = paramStr(2)\nif unit notin Unit2Mult:\n raise newException(ValueError,\n \"only know the following units: \" & toSeq(Unit2Mult.keys).join(\" \"))\n\necho value, ' ', unit, \" to:\"\nfor (key, mult) in Unit2Mult.pairs:\n echo key.align(10), \": \", formatFloat(value * Unit2Mult[unit] / mult, ffDecimal, 5)\n","language":"Nim"},{"code":"sub convert {\n my($magnitude, $unit) = @_;\n my %factor = (\n tochka => 0.000254,\n liniya => 0.00254,\n diuym => 0.0254,\n vershok => 0.04445,\n piad => 0.1778,\n fut => 0.3048,\n arshin => 0.7112,\n sazhen => 2.1336,\n versta => 1066.8,\n milia => 7467.6,\n centimeter => 0.01,\n meter => 1.0,\n kilometer => 1000.0,\n );\n\n my $base= $magnitude * $factor{$unit};\n my $result .= \"$magnitude $unit to:\\n\";\n for (sort { $factor{$a} <=> $factor{$b} } keys %factor) {\n $result .= sprintf \"%10s: %s\\n\", $_, sigdig($base / $factor{$_}, 5) unless $_ eq $unit\n }\n return $result;\n}\n\nsub sigdig {\n my($num,$sig) = @_;\n return $num unless $num =~ /\\./;\n\n $num =~ /([1-9]\\d*\\.?\\d*)/;\n my $prefix = $`;\n my $match = $&;\n $sig++ if $match =~ /\\./;\n my $digits = substr $match, 0, $sig;\n my $nextd = substr $match, $sig, 1;\n $digits =~ s/(.)$/{1+$1}/e if $nextd > 5;\n return $prefix . $digits;\n}\n\nprint convert(1,'meter'), \"\\n\\n\";\nprint convert(1,'milia'), \"\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">units</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">\"-- metric ---\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"kilometer\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"km\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"kilometer\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"meter\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"m\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"meter\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"centimeter\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.01</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"cm\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"centimeter\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\" old russian \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"tochka\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.000254</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"liniya\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.00254</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"diuym\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.0254</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"vershok\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.04445</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"piad\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.1778</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"fut\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.3048</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"arshin\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.7112</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"sazhen\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2.1336</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"versta\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1066.8</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"milia\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7467.6</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">units</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">strim</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,f\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'.'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Obviously, uncomment these lines for a prompt (not under p2js)\n --while true do\n -- string input = prompt_string(\"\\nEnter length & measure or CR to exit:\")\n -- if input=\"\" then exit end if\n -- input = lower(trim(input))</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">input</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"7.4676 km\"</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">fmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">input</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #008000;\">\"%f %s\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"%f%s\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">input</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"enter eg 1km or 1 kilometer\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"unrecognised unit: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- abbreviation, eg cm->centimeter</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">f</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">f</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- header</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"--------------%s--------------\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #004080;\">atom</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">-- not abbrev</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%20s %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">strim</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]/</span><span style=\"color: #000000;\">facts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]),</span><span style=\"color: #000000;\">names</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">--end while</span>\n<!--\n","language":"Phix"},{"code":"from sys import argv\n\nunit2mult = {\"arshin\": 0.7112, \"centimeter\": 0.01, \"diuym\": 0.0254,\n \"fut\": 0.3048, \"kilometer\": 1000.0, \"liniya\": 0.00254,\n \"meter\": 1.0, \"milia\": 7467.6, \"piad\": 0.1778,\n \"sazhen\": 2.1336, \"tochka\": 0.000254, \"vershok\": 0.04445,\n \"versta\": 1066.8}\n\nif __name__ == '__main__':\n assert len(argv) == 3, 'ERROR. Need two arguments - number then units'\n try:\n value = float(argv[1])\n except:\n print('ERROR. First argument must be a (float) number')\n raise\n unit = argv[2]\n assert unit in unit2mult, ( 'ERROR. Only know the following units: '\n + ' '.join(unit2mult.keys()) )\n\n print(\"%g %s to:\" % (value, unit))\n for unt, mlt in sorted(unit2mult.items()):\n print(' %10s: %g' % (unt, value * unit2mult[unit] / mlt))\n","language":"Python"},{"code":"DIM units(1 TO 13) AS STRING\nFOR i = LBOUND(units) TO UBOUND(units)\nREAD units(i)\nNEXT i\nDATA \"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\", \"arshin\", \"sazhen\", \"versta\", \"milia\", \"centimeter\", \"meter\", \"kilometer\"\n\n' all expressed in centimeters\nDIM convs(1 TO 13) AS SINGLE\nFOR i = 1 TO 13\nREAD convs(i)\nNEXT i\nDATA 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000\nDIM unit AS INTEGER\nDIM value AS SINGLE\nDIM yn AS STRING\n\nDO\n CLS\n PRINT\n FOR i = 1 TO 13\n PRINT USING \"## \"; i;\n PRINT units(i)\n NEXT i\n PRINT\n DO\n INPUT \"Please choose a unit 1 to 13 : \", unit\n LOOP UNTIL unit >= 1 AND unit <= 13\n PRINT\n DO\n INPUT \"Now enter a value in that unit : \", value\n LOOP UNTIL value >= 0\n PRINT\n PRINT \"The equivalent in the remaining units is : \"\n PRINT\n FOR i = 1 TO 13\n IF i <> unit THEN PRINT \" \"; units(i), \" : \"; value * convs(unit) / convs(i)\n NEXT i\n PRINT\n DO\n INPUT \"Do another one y/n : \", yn\n yn = LCASE$(yn)\n LOOP UNTIL yn = \"y\" OR yn = \"n\"\nLOOP UNTIL yn = \"n\"\n","language":"QBasic"},{"code":"#lang racket\n\n(define units\n '([tochka 0.000254]\n [liniya 0.00254]\n [diuym 0.0254]\n [vershok 0.04445]\n [piad 0.1778]\n [fut 0.3048]\n [arshin 0.7112]\n [sazhen 2.1336]\n [versta 1066.8]\n [milia 7467.6]\n [centimeter 0.01]\n [meter 1.0]\n [kilometer 1000.0]))\n\n(define (show u)\n (printf \"1 ~s to:\\n\" u)\n (define n (cadr (assq u units)))\n (for ([u2 units] #:unless (eq? u (car u2)))\n (displayln (~a (~a (car u2) #:width 10 #:align 'right) \": \"\n (~r (/ n (cadr u2)) #:precision 4))))\n (newline))\n\n(show 'meter)\n(show 'milia)\n","language":"Racket"},{"code":"convert(1, 'meter');\n\nsay '*' x 40, \"\\n\";\n\nconvert(1, 'milia');\n\nsub convert (Real $magnitude, $unit) {\n my %factor =\n tochka => 0.000254,\n liniya => 0.00254,\n diuym => 0.0254,\n vershok => 0.04445,\n piad => 0.1778,\n fut => 0.3048,\n arshin => 0.7112,\n sazhen => 2.1336,\n versta => 1066.8,\n milia => 7467.6,\n centimeter => 0.01,\n meter => 1.0,\n kilometer => 1000.0,\n ;\n\n my $meters = $magnitude * %factor{$unit.lc};\n\n say \"$magnitude $unit to:\\n\", '_' x 40;\n\n printf \"%10s: %s\\n\", $_, $meters / %factor{$_} unless $_ eq $unit.lc\n for %factor.keys.sort:{ +%factor{$_} }\n}\n","language":"Raku"},{"code":"/*REXX program converts a metric or old Russian length to various other lengths. */\n numeric digits 200 /*lots of digits. */\n /*──translation───*/\n /*tip, top */ vershok = 22.492971 /*1.75 inch. */\n /*palm, quarter */ piad = vershok / 4 /*(also) chetvert.*/\n /*yard */ arshin = vershok / 16\n /*fathom */ sazhen = arshin / 3\n /*turn (of a plow)*/ verst = sazhen / 500 /*(also) a versta.*/\n /*mile */ milia = verst / 1.5\n /*inch */ diuym = arshin * 28\n /*foot */ fut = diuym / 12 /*sounds like foot*/\n /*line */ liniya = diuym * 10\n /*point */ tochka = diuym * 100\n\nKM= 1000; CM=100 /*define a couple of metric multipliers*/\nsw= linesize() -1 /*get the linesize (screen width) - 1.*/\nparse arg N what _ __ /*obtain the user's input from the C.L.*/\nif N=='' then call err 'no arguments specified.'\nif \\datatype(N, 'N') then call err 'units not numeric: ' N\nif _\\=='' then call err 'too many arguments specified: ' _ __\nn= n / 1 /*normalize it (004──►4 7.──►7, etc.*/\nif what=='' then what= 'meters'; whatU= what /*None specified? Then assume meters. */\nupper whatU /*an uppercase version for ABBREV bif. */\n select /* [↓] convert the length ───► meters.*/\n when abbrev('METRES' , whatU ) |,\n abbrev('METERS' , whatU ) then m= N\n when abbrev('KILOMETRES' , whatU, 2 ) |,\n abbrev('KILOMETERS' , whatU, 2 ) |,\n abbrev('KMS' , whatU, ) then m= N * KM\n when abbrev('CENTIMETRES', whatU, 2 ) |,\n abbrev('CENTIMETERS', whatU, 2 ) |,\n abbrev('CMS' , whatU, 2 ) then m= N / CM\n when abbrev('ARSHINS' , whatU ) then m= N / arshin\n when abbrev('DIUYM' , whatU ) then m= N / diuym\n when abbrev('FUT' , whatU ) then m= N / fut\n when abbrev('LINIYA' , whatU ) then m= N / liniya\n when abbrev('PIADS' , whatU ) |,\n abbrev('CHETVERTS' , whatU, 2 ) then m= N / piad\n when abbrev('SAZHENS' , whatU ) then m= N / sazhen\n when abbrev('TOCHKA' , whatU ) then m= N / tochka\n when abbrev('VERSHOKS' , whatU, 5 ) then m= N / vershok\n when abbrev('VERSTAS' , whatU, 5 ) |,\n abbrev('VERSTS' , whatU, 2 ) then m= N / verst\n when abbrev('MILIA' , whatU, 2 ) then m= N / milia\n otherwise call err 'invalid measure name: ' what\n end /*select*/\n say centre('metric', sw, \"─\")\ncall tell m / KM , 'kilometer'\ncall tell m , 'meter'\ncall tell m * CM , 'centimeter'\n say centre('old Russian', sw, \"─\")\ncall tell m * milia , 'milia'\ncall tell m * verst , 'verst'\ncall tell m * sazhen , 'sazhen'\ncall tell m * arshin , 'arshin'\ncall tell m * fut , 'fut'\ncall tell m * piad , 'piad'\ncall tell m * vershok , 'vershok'\ncall tell m * diuym , 'diuym'\ncall tell m * liniya , 'liniya'\ncall tell m * tochka , 'tochka' /* ◄─── TELL shows eight decimal digits*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nerr: say center(' error ', sw % 2, \"*\"); do j=1 to arg(); say arg(j); end; exit 13\ns: if arg(1)=1 then return arg(3); return word( arg(2) 's', 1) /*plurals.*/\ntell: parse arg $; numeric digits 8; $= $ / 1; say right($, 40) arg(2)s($); return/*REXX program converts a metric or old Russian length to various other lengths. */\n numeric digits 200 /*lots of digits. */\n /*──translation───*/\n /*tip, top */ vershok = 22.492971 /*1.75 inch. */\n /*palm, quarter */ piad = vershok / 4 /*(also) chetvert.*/\n /*yard */ arshin = vershok / 16\n /*fathom */ sazhen = arshin / 3\n /*turn (of a plow)*/ verst = sazhen / 500 /*(also) a versta.*/\n /*mile */ milia = verst / 1.5\n /*inch */ diuym = arshin * 28\n /*foot */ fut = diuym / 12 /*sounds like foot*/\n /*line */ liniya = diuym * 10\n /*point */ tochka = diuym * 100\n\nKM= 1000; CM=100 /*define a couple of metric multipliers*/\nsw= linesize() -1 /*get the linesize (screen width) - 1.*/\nparse arg N what _ __ /*obtain the user's input from the C.L.*/\nif N=='' then call err 'no arguments specified.'\nif \\datatype(N, 'N') then call err 'units not numeric: ' N\nif _\\=='' then call err 'too many arguments specified: ' _ __\nn= n / 1 /*normalize it (004──►4 7.──►7, etc.*/\nif what=='' then what= 'meters'; whatU= what /*None specified? Then assume meters. */\nupper whatU /*an uppercase version for ABBREV bif. */\n select /* [↓] convert the length ───► meters.*/\n when abbrev('METRES' , whatU ) |,\n abbrev('METERS' , whatU ) then m= N\n when abbrev('KILOMETRES' , whatU, 2 ) |,\n abbrev('KILOMETERS' , whatU, 2 ) |,\n abbrev('KMS' , whatU, ) then m= N * KM\n when abbrev('CENTIMETRES', whatU, 2 ) |,\n abbrev('CENTIMETERS', whatU, 2 ) |,\n abbrev('CMS' , whatU, 2 ) then m= N / CM\n when abbrev('ARSHINS' , whatU ) then m= N / arshin\n when abbrev('DIUYM' , whatU ) then m= N / diuym\n when abbrev('FUT' , whatU ) then m= N / fut\n when abbrev('LINIYA' , whatU ) then m= N / liniya\n when abbrev('PIADS' , whatU ) |,\n abbrev('CHETVERTS' , whatU, 2 ) then m= N / piad\n when abbrev('SAZHENS' , whatU ) then m= N / sazhen\n when abbrev('TOCHKA' , whatU ) then m= N / tochka\n when abbrev('VERSHOKS' , whatU, 5 ) then m= N / vershok\n when abbrev('VERSTAS' , whatU, 5 ) |,\n abbrev('VERSTS' , whatU, 2 ) then m= N / verst\n when abbrev('MILIA' , whatU, 2 ) then m= N / milia\n otherwise call err 'invalid measure name: ' what\n end /*select*/\n say centre('metric', sw, \"─\")\ncall tell m / KM , 'kilometer'\ncall tell m , 'meter'\ncall tell m * CM , 'centimeter'\n say centre('old Russian', sw, \"─\")\ncall tell m * milia , 'milia'\ncall tell m * verst , 'verst'\ncall tell m * sazhen , 'sazhen'\ncall tell m * arshin , 'arshin'\ncall tell m * fut , 'fut'\ncall tell m * piad , 'piad'\ncall tell m * vershok , 'vershok'\ncall tell m * diuym , 'diuym'\ncall tell m * liniya , 'liniya'\ncall tell m * tochka , 'tochka' /* ◄─── TELL shows eight decimal digits*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nerr: say center(' error ', sw % 2, \"*\"); do j=1 to arg(); say arg(j); end; exit 13\ns: if arg(1)=1 then return arg(3); return word( arg(2) 's', 1) /*plurals.*/\ntell: parse arg $; numeric digits 8; $= $ / 1; say right($, 40) arg(2)s($); return\n","language":"REXX"},{"code":"# Project : Old Russian measure of length\n\ndecimals(7)\nunits = [\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\",\n \"arshin\", \"sazhen\", \"versta\", \"milia\",\n \"centimeter\", \"meter\", \"kilometer\"]\n\nconvs = [0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\n 71.12, 213.36, 10668, 74676,\n 1, 100, 10000]\n\nyn = \"y\"\nunit = 1\np = 1\nwhile yn != \"n\"\n for i = 1 to 13\n see \"\" + i + \" \" + units[i] + nl\n next\n see nl\n see \"please choose a unit 1 to 13 : \"\n give unit\n see nl\n see \"now enter a value in that unit : \"\n give value\n see nl\n see \"the equivalent in the remaining units is : \"\n see nl\n for i = 1 to 13\n if i = unit\n loop\n ok\n see \"\" + units[i] + \" : \" + (value * convs[number(unit)] / convs[i]) + nl\n next\n see nl\n while yn = \"y\" or yn = \"n\"\n see \"do another one y/n : \"\n give yn\n yn = lower(yn)\n end\nend\n","language":"Ring"},{"code":"module Distances\n\n RATIOS =\n {arshin: 0.7112, centimeter: 0.01, diuym: 0.0254,\n fut: 0.3048, kilometer: 1000.0, liniya: 0.00254,\n meter: 1.0, milia: 7467.6, piad: 0.1778,\n sazhen: 2.1336, tochka: 0.000254, vershok: 0.04445,\n versta: 1066.8}\n\n def self.method_missing(meth, arg)\n from, to = meth.to_s.split(\"2\").map(&:to_sym)\n raise NoMethodError, meth if ([from,to]-RATIOS.keys).size > 0\n RATIOS[from] * arg / RATIOS[to]\n end\n\n def self.print_others(name, num)\n puts \"#{num} #{name} =\"\n RATIOS.except(name.to_sym).each {|k,v| puts \"#{ (1.0 / v*num)} #{k}\" }\n end\nend\n\nDistances.print_others(\"meter\", 2)\nputs\np Distances.meter2centimeter(3)\np Distances.arshin2meter(1)\np Distances.versta2kilometer(20) # en Hoeperdepoep zat op de stoep\n# 13*13 = 169 methods supported, but not:\np Distances.mile2piad(1)\n","language":"Ruby"},{"code":"use std::env;\nuse std::process;\nuse std::collections::HashMap;\n\nfn main() {\n\n\tlet units: HashMap<&str, f32> = [(\"arshin\",0.7112),(\"centimeter\",0.01),(\"diuym\",0.0254),(\"fut\",0.3048),(\"kilometer\",1000.0),(\"liniya\",0.00254),(\"meter\",1.0),(\"milia\",7467.6),(\"piad\",0.1778),(\"sazhen\",2.1336),(\"tochka\",0.000254),(\"vershok\",0.04445),(\"versta\",1066.8)].iter().cloned().collect();\n\n\tlet args: Vec<String> = env::args().collect();\n\tif args.len() < 3 {\n\t\teprintln!(\"A correct use is oldrus [amount] [unit].\");\n\t\tprocess::exit(1);\n\t};\n\n\tlet length_float;\n\tlength_float = match args[1].parse::<f32>() {\n\t\tOk(length_float) => length_float,\n\t\tErr(..) => 1 as f32,\n\t};\n\n\tlet unit: &str = &args[2];\n\tif ! units.contains_key(unit) {\n\t\tlet mut keys: Vec<&str> = Vec::new();\n\t\tfor i in units.keys() {\n\t\t\tkeys.push(i)\n\t\t};\n\t\teprintln!(\"The correct units are: {}.\", keys.join(\", \"));\n\t\tprocess::exit(1);\n\t};\n\n\tprintln!(\"{} {} to:\", length_float, unit);\n\tfor (lunit, length) in &units {\n\t\tprintln!(\"\t{}: {:?}\", lunit, length_float * units.get(unit).unwrap() / length);\n\t};\n\n\n}\n","language":"Rust"},{"code":"import scala.collection.immutable.HashMap\n\nobject OldRussianLengths extends App {\n\n private def measures = HashMap(\"tochka\" -> 0.000254,\n \"liniya\"-> 0.000254, \"centimeter\"-> 0.01, \"diuym\"-> 0.0254, \"vershok\"-> 0.04445,\n \"piad\" -> 0.1778, \"fut\" -> 0.3048, \"arshin\"-> 0.7112, \"meter\" -> 1.0,\n \"sazhen\"-> 2.1336, \"kilometer\" -> 1000.0, \"versta\"-> 1066.8, \"milia\" -> 7467.6\n ).withDefaultValue(Double.NaN)\n\n if (args.length == 2 && args(0).matches(\"[+-]?\\\\d*(\\\\.\\\\d+)?\")) {\n val inputVal = measures(args(1))\n\n def meters = args(0).toDouble * inputVal\n\n if (!java.lang.Double.isNaN(inputVal)) {\n printf(\"%s %s to: %n%n\", args(0), args(1))\n for (k <- measures) println(f\"${k._1}%10s: ${meters / k._2}%g\")\n }\n } else println(\"Please provide a number and unit on the command line.\")\n\n}\n","language":"Scala"},{"code":"func convert (magnitude, unit) {\n var factor = Hash(\n tochka => 0.000254,\n liniya => 0.00254,\n diuym => 0.0254,\n vershok => 0.04445,\n piad => 0.1778,\n fut => 0.3048,\n arshin => 0.7112,\n sazhen => 2.1336,\n versta => 1066.8,\n milia => 7467.6,\n centimeter => 0.01,\n meter => 1,\n kilometer => 1000,\n )\n\n var meters = (magnitude * factor{unit.lc})\n say(\"#{magnitude} #{unit} to:\\n\", '-' * 40)\n\n for u,f in (factor.sort_by { |_,v| v }) {\n printf(\"%10s: %s\\n\", u, meters / f) if (u != unit.lc)\n }\n}\n\nconvert(1, 'meter')\nsay('')\nconvert(1, 'milia')\n","language":"Sidef"},{"code":"package require units\n\nset russian_units {\n arshin 1.40607\n centimeter 100\n diuym 39.3701\n fut 3.28084\n kilometer 0.001\n liniya 393.701\n meter 1\n milia 0.000133912\n piad 5.6243\n sazhen 0.468691\n tochka 3937.01\n vershok 22.4972\n versta 0.000937383\n}\n\nproc add_russian_units {} {\n foreach {name factor} $::russian_units {\n if {$name eq \"meter\"} continue\n set factor [expr {1/$factor}]\n units::new $name \"$factor meters\" ;# teach units about the new unit\n }\n}\n\nproc demo {} { ;# show some examples\n foreach base {\"1 meter\" \"1 milia\"} {\n puts \"$base to:\"\n foreach {unit _} $::russian_units {\n puts [format \" %-12s: %s\" $unit [units::convert $base $unit]]\n }\n puts \"\"\n }\n}\n\nadd_russian_units\ndemo\n","language":"Tcl"},{"code":"% units::convert \"1 piad^2\" \"hectare\"\n3.1612805858160454e-6\n% units::convert \"100 km/h\" \"versta/minute\"\n1.562305\n","language":"Tcl"},{"code":"DIM units$(1 TO 13)\nFOR i = LBOUND(units$) TO UBOUND(units$)\n READ units$(i)\nNEXT i\nDATA \"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\", \"arshin\", \"sazhen\", \"versta\", \"milia\", \"centimeter\", \"meter\", \"kilometer\"\n\n! all expressed in centimeters\nDIM convs(1 TO 13)\nFOR i = 1 TO 13\n READ convs(i)\nNEXT i\nDATA 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000\n\nDO\n CLEAR\n PRINT\n FOR i = 1 TO 13\n PRINT USING \"## \": i;\n PRINT units$(i)\n NEXT i\n PRINT\n DO\n INPUT prompt \"Please choose a unit 1 to 13 : \": unit\n LOOP UNTIL unit >= 1 AND unit <= 13\n PRINT\n DO\n INPUT prompt \"Now enter a value! in that unit : \": value\n LOOP UNTIL value >= 0\n PRINT\n PRINT \"The equivalent in the remaining units is : \"\n PRINT\n FOR i = 1 TO 13\n IF i <> unit THEN PRINT \" \"; units$(i), \" : \"; value*convs(unit)/convs(i)\n NEXT i\n PRINT\n DO\n INPUT prompt \"Do another one y/n : \": yn$\n LET yn$ = LCASE$(yn$)\n LOOP UNTIL yn$ = \"y\" OR yn$ = \"n\"\nLOOP UNTIL yn$ = \"n\"\nEND\n","language":"True-BASIC"},{"code":"import \"io\" for Stdin, Stdout\nimport \"./fmt\" for Fmt\nimport \"./str\" for Str\n\nvar units = [\n \"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\",\n \"arshin\", \"sazhen\", \"versta\", \"milia\",\n \"centimeter\", \"meter\", \"kilometer\"\n]\n\nvar convs = [\n 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\n 71.12, 213.36, 10668, 74676,\n 1, 100, 10000\n]\n\nwhile (true) {\n var i = 0\n for (u in units) {\n Fmt.print(\"$2d $s\", i+1, u)\n i = i + 1\n }\n System.print()\n var unit\n while (true) {\n System.write(\"Please choose a unit 1 to 13 : \")\n Stdout.flush()\n unit = Num.fromString(Stdin.readLine())\n if (unit.type == Num && unit.isInteger && unit >= 1 && unit <= 13) break\n }\n unit = unit - 1\n var value\n while (true) {\n System.write(\"Now enter a value in that unit : \")\n Stdout.flush()\n value = Num.fromString(Stdin.readLine())\n if (value.type == Num && value >= 0) break\n }\n System.print(\"\\nThe equivalent in the remaining units is:\\n\")\n i = 0\n for (u in units) {\n if (i != unit) Fmt.print(\" $10s : $15.8g\", u, value*convs[unit]/convs[i])\n i = i + 1\n }\n System.print()\n var yn = \"\"\n while (yn != \"y\" && yn != \"n\") {\n System.write(\"Do another one y/n : \")\n Stdout.flush()\n yn = Str.lower(Stdin.readLine())\n }\n if (yn == \"n\") break\n System.print()\n}\n","language":"Wren"},{"code":"PROGRAM\t\"progname\"\nVERSION\t\"0.0000\"\n\nDECLARE FUNCTION Entry ()\n\nFUNCTION Entry ()\n\nDIM units$[14]\nunits$[1] = \"tochka \" : units$[2] = \"liniya \" : units$[3] = \"dyuim \"\nunits$[4] = \"vershok \" : units$[5] = \"piad \" : units$[6] = \"fut \"\nunits$[7] = \"arshin \" : units$[8] = \"sazhen \" : units$[9] = \"versta \"\nunits$[10] = \"milia \" : units$[11] = \"centimeter\" : units$[12] = \"meter \"\nunits$[13] = \"kilometer \"\n\n' all expressed in centimeters\nDIM convs![14]\nconvs![1] = 0.0254 : convs![2] = 0.254 : convs![3] = 2.54\nconvs![4] = 4.445 : convs![5] = 17.78 : convs![6] = 30.48\nconvs![7] = 71.12 : convs![8] = 213.36 : convs![9] = 10668\nconvs![10] = 74676 : convs![11] = 1 : convs![12] = 100 : convs![13] = 10000\n\nDO\n PRINT\n FOR i = 1 TO 13\n PRINT FORMAT$(\"##\",i); \" \"; units$[i]\n NEXT i\n DO\n unit = UBYTE(INLINE$(\"\\nPlease choose a unit 1 to 13 : \"))\n LOOP UNTIL unit >= 1 AND unit <= 13\n DO\n value = USHORT(INLINE$(\"\\nNow enter a value in that unit : \"))\n LOOP UNTIL value >= 0\n\n PRINT\n PRINT \"The equivalent in the remaining units is : \"\n PRINT\n FOR i = 1 TO 13\n IF i <> unit THEN PRINT \" \"; units$[i], \" : \"; value * convs![unit] / convs![i]\n NEXT i\n DO\n yn$ = LCASE$(INLINE$(\"\\nDo another one y/n : \"))\n LOOP UNTIL (yn$ = \"y\") OR (yn$ = \"n\")\n LOOP UNTIL yn$ = \"n\"\n\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"int Units, Unit, I, YN;\nreal Convs, Value;\n\n[Units:= [\"tochka\", \"liniya\", \"dyuim\", \"vershok\", \"piad\", \"fut\",\n \"arshin\", \"sazhen\", \"versta\", \"milia\",\n \"centimeter\", \"meter\", \"kilometer\"];\n\nConvs:= [0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\n 71.12, 213.36, 10668., 74676.,\n 1., 100., 10000.];\n\nloop [for I:= 0 to 13-1 do\n [if I+1 < 10 then ChOut(0, ^ ); IntOut(0, I+1);\n ChOut(0, ^ ); Text(0, Units(I)); CrLf(0);\n ];\n CrLf(0);\n loop [Text(0, \"Please choose a unit 1 to 13 : \");\n OpenI(0);\n Unit:= IntIn(0);\n if Unit >= 1 and Unit <= 13 then quit;\n ];\n Unit:= Unit-1;\n loop [Text(0, \"Now enter a value in that unit : \");\n OpenI(0);\n Value:= RlIn(0);\n if Value >= 1. then quit;\n ];\n Text(0, \"^m^jThe equivalent in the remaining units is:^m^j^m^j\");\n Format(7, 8);\n for I:= 0 to 13-1 do\n [if I # Unit then\n [RlOut(0, Value*Convs(Unit)/Convs(I));\n Text(0, \" : \"); Text(0, Units(I)); CrLf(0);\n ];\n ];\n CrLf(0);\n YN:= ^ ;\n while YN # ^y and YN # ^n do\n [Text(0, \"Do another one y/n : \");\n OpenI(0);\n YN:= ChIn(0) or $20;\n ];\n if YN = ^n then quit;\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"dim units$(14)\nunits$(1) = \"tochka\" : units$(2) = \"liniya\" : units$(3) = \"dyuim\"\nunits$(4) = \"vershok\" : units$(5) = \"piad\" : units$(6) = \"fut\"\nunits$(7) = \"arshin\" : units$(8) = \"sazhen\" : units$(9) = \"versta\"\nunits$(10) = \"milia\" : units$(11) = \"centimeter\" : units$(12) = \"meter\"\nunits$(13) = \"kilometer\"\n\n// all expressed in centimeters\ndim convs(14)\nconvs(1) = 0.0254 : convs(2) = 0.254 : convs(3) = 2.54\nconvs(4) = 4.445 : convs(5) = 17.78 : convs(6) = 30.48\nconvs(7) = 71.12 : convs(8) = 213.36 : convs(9) = 10668\nconvs(10) = 74676 : convs(11) = 1 : convs(12) = 100 : convs(13) = 10000\n\nrepeat\n clear screen\n print\n for i = 1 to arraysize(units$(), 1) - 1\n print i using (\"##\"), \" \", units$(i)\n next\n print\n repeat\n input \"Please choose a unit 1 to 13 : \" unit\n until unit >= 1 and unit <= 13\n print\n repeat\n input \"Now enter a value in that unit : \" value\n until value >= 0\n\n print \"\\nThe equivalent in the remaining units is : \\n\"\n\n for i = 1 to 13\n if i = unit continue\n print \" \", units$(i), \"\\t : \", value * convs(unit) / convs(i)\n next\n print\n repeat\n input \"Do another one y/n : \" yn$\n yn$ = lower$(yn$)\n until yn$ = \"y\" or yn$ = \"n\"\nuntil yn$ = \"n\"\nend\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Old_Russian_measure_of_length\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nWrite a program to perform a conversion of the old Russian measures of length to the metric system (and vice versa).\\n\\n\\nIt is an example of a linear transformation of several variables. \\n\\n\\nThe program should accept a single value in a selected unit of measurement, and convert and return it to the other units: \\n<br>''vershoks'', ''arshins'', ''sazhens'', ''versts'', ''meters'', ''centimeters'' and ''kilometers''.\\n\\n\\n;Also see:\\n:* [https://en.wikipedia.org/wiki/Obsolete_Russian_units_of_measurement#Length Old Russian measure of length]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V unit2mult = [‘arshin’ = 0.7112, ‘centimeter’ = 0.01, ‘diuym’ = 0.0254,\\n ‘fut’ = 0.3048, ‘kilometer’ = 1000.0, ‘liniya’ = 0.00254,\\n ‘meter’ = 1.0, ‘milia’ = 7467.6, ‘piad’ = 0.1778,\\n ‘sazhen’ = 2.1336, ‘tochka’ = 0.000254, ‘vershok’ = 0.04445,\\n ‘versta’ = 1066.8]\\n\\n:start:\\nassert(:argv.len == 3, ‘ERROR. Need two arguments - number then units’)\\nFloat value\\nX.try\\n value = Float(:argv[1])\\nX.catch\\n exit(‘ERROR. First argument must be a (float) number’)\\nV unit = :argv[2]\\nassert(unit C unit2mult, ‘ERROR. Only know the following units: ’unit2mult.keys().join(‘ ’))\\n\\nprint(‘#. #. to:’.format(value, unit))\\nL(unt, mlt) sorted(unit2mult.items())\\n print(‘ #10: #.’.format(unt, value * unit2mult[unit] / mlt))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:REAL.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE PTR=\\\"CARD\\\"\\nDEFINE UNIT_COUNT=\\\"10\\\"\\n\\nPTR ARRAY\\n names(UNIT_COUNT),\\n values(UNIT_COUNT)\\nBYTE count=[0]\\n\\nPROC Append(CHAR ARRAY name REAL POINTER value)\\n names(count)=name\\n values(count)=value\\n count==+1\\nRETURN\\n\\nPROC Init()\\n REAL\\n arshin,centimeter,kilometer,meter,\\n sazhen,vershok,versta\\n\\n ValR(\\\"0.7112\\\",arshin) Append(\\\"arshins\\\",arshin)\\n ValR(\\\"0.01\\\",centimeter) Append(\\\"centimeters\\\",centimeter)\\n ValR(\\\"1000\\\",kilometer) Append(\\\"kilometers\\\",kilometer)\\n ValR(\\\"1\\\",meter) Append(\\\"meters\\\",meter)\\n ValR(\\\"2.1336\\\",sazhen) Append(\\\"sazhens\\\",sazhen)\\n ValR(\\\"0.04445\\\",vershok) Append(\\\"vershoks\\\",vershok)\\n ValR(\\\"1066.8\\\",versta) Append(\\\"versts\\\",versta)\\nRETURN\\n\\nBYTE FUNC GetUnit()\\n BYTE i,res\\n\\n FOR i=1 TO count\\n DO\\n PrintF(\\\"%B-%S\\\",i,names(i-1))\\n IF i<count THEN Put(32) FI\\n OD\\n PutE()\\n DO\\n PrintF(\\\"Get unit (1-%B): \\\",count)\\n res=InputB()\\n UNTIL res>=1 AND res<=count\\n OD\\nRETURN (res-1)\\n\\nPROC PrintResult(REAL POINTER value BYTE unit)\\n BYTE i\\n REAL res,tmp\\n\\n PutE()\\n FOR i=0 TO count-1\\n DO\\n IF i=unit THEN\\n RealAssign(value,res)\\n ELSE\\n RealMult(value,values(unit),tmp)\\n RealDiv(tmp,values(i),res)\\n FI\\n Print(\\\" \\\") PrintR(res)\\n PrintF(\\\" %S%E\\\",names(i))\\n OD\\n PutE()\\nRETURN\\n\\nPROC Main()\\n BYTE unit\\n REAL value\\n\\n Put(125) PutE() ;clear screen\\n Init()\\n\\n DO\\n Print(\\\"Get value: \\\")\\n InputR(value)\\n unit=GetUnit()\\n PrintResult(value,unit)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"BEGIN # convert Old Russian units to/from metric #\\n # mode to hold details of the units - value is in meters #\\n MODE UNIT = STRUCT( STRING name, REAL value );\\n # gets a UNIT from the standard input #\\n PROC read unit = UNIT:\\n BEGIN\\n UNIT r;\\n read( ( value OF r, name OF r, newline ) );\\n # trim leading and trailing spaces from the name #\\n INT f pos := LWB name OF r;\\n WHILE IF f pos <= UPB name OF r THEN ( name OF r )[ f pos ] = \\\" \\\" ELSE FALSE FI\\n DO\\n f pos +:= 1\\n OD;\\n INT b pos := UPB name OF r;\\n WHILE IF b pos >= LWB name OF r THEN ( name OF r )[ b pos ] = \\\" \\\" ELSE FALSE FI\\n DO\\n b pos -:= 1\\n OD;\\n IF f pos > b pos THEN\\n # no name #\\n name OF r := \\\"\\\"\\n ELIF ( name OF r )[ b pos ] = \\\"s\\\" THEN\\n # the user entered a plural - remove the \\\"S\\\" #\\n name OF r := ( name OF r )[ f pos : b pos - 1 ]\\n ELSE\\n # non-blank, non-plural name #\\n name OF r := ( name OF r )[ f pos : b pos ]\\n FI;\\n r\\n END # read unit # ;\\n # units and their value in meters #\\n []UNIT units = ( ( \\\"arshin\\\", 0.7112 ), ( \\\"centimeter\\\", 0.01 ), ( \\\"diuym\\\", 0.0254 )\\n , ( \\\"fut\\\", 0.3048 ), ( \\\"kilometer\\\", 1000.0 ), ( \\\"liniya\\\", 0.00254 )\\n , ( \\\"meter\\\", 1.0 ), ( \\\"milia\\\", 7467.6 ), ( \\\"piad\\\", 0.1778 )\\n , ( \\\"sazhen\\\", 2.1336 ), ( \\\"tochka\\\", 0.000254 ), ( \\\"vershok\\\", 0.04445 )\\n , ( \\\"versta\\\", 1066.8 )\\n );\\n WHILE # prompt for units and show their conversions #\\n print( ( \\\"Enter the unit to convert - value followed by unit name (or 0 to quit): \\\" ) );\\n UNIT r := read unit;\\n value OF r /= 0\\n DO\\n # find the unit name in the table of valid units #\\n INT u pos := LWB units - 1;\\n FOR i FROM LWB units TO UPB units WHILE u pos < LWB units DO\\n IF name OF r = name OF units[ i ] THEN\\n u pos := i\\n FI\\n OD;\\n IF u pos < LWB units THEN\\n # didn't find the units #\\n print( ( \\\"Unknown units - please enter one of:\\\", newline, \\\" \\\" ) );\\n FOR i FROM LWB units TO UPB units DO\\n print( ( name OF units[ i ], IF i = UPB units THEN newline ELSE \\\", \\\" FI ) )\\n OD\\n ELSE\\n # found the units - show the values in the other units #\\n UNIT u = units[ u pos ];\\n print( ( fixed( value OF r, -12, 6 ), \\\" \\\", name OF u, \\\" is:\\\", newline ) );\\n FOR i FROM LWB units TO UPB units DO\\n IF i /= u pos THEN\\n print( ( fixed( ( value OF r * value OF u )/ value OF units[ i ], -16, 6 )\\n , \\\" \\\", name OF units[ i ], newline\\n )\\n )\\n FI\\n OD\\n FI\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"-- General purpose linear measurement converter.\\non convertLinear(inputNumber, inputUnitRecord, outputUnitRecord)\\n set {inputType, outputType} to {inputUnitRecord's type, outputUnitRecord's type}\\n if (inputType is not outputType) then error \\\"Unit type mismatch: \\\" & inputType & \\\", \\\" & outputType\\n -- The |offset| values are only relevant to temperature conversions and default to zero.\\n set inputUnit to inputUnitRecord & {|offset|:0}\\n set outputUnit to outputUnitRecord & {|offset|:0}\\n\\n return (inputNumber - (inputUnit's |offset|)) * (inputUnit's coefficient) / (outputUnit's coefficient) ¬\\n + (outputUnit's |offset|)\\nend convertLinear\\n\\non program(inputNumber, inputUnitName)\\n -- The task description only specifies these seven units, but more can be added if wished.\\n -- The coefficients are the equivalent lengths in metres.\\n set unitRecords to {{|name|:\\\"metre\\\", type:\\\"length\\\", coefficient:1.0}, ¬\\n {|name|:\\\"centimetre\\\", type:\\\"length\\\", coefficient:0.01}, {|name|:\\\"kilometre\\\", type:\\\"length\\\", coefficient:1000.0}, ¬\\n {|name|:\\\"vershok\\\", type:\\\"length\\\", coefficient:0.04445}, {|name|:\\\"arshin\\\", type:\\\"length\\\", coefficient:0.7112}, ¬\\n {|name|:\\\"sazhen\\\", type:\\\"length\\\", coefficient:2.1336}, {|name|:\\\"versta\\\", type:\\\"length\\\", coefficient:1066.8}}\\n\\n -- Massage the given input unit name if necessary.\\n if (inputUnitName ends with \\\"s\\\") then set inputUnitName to text 1 thru -2 of inputUnitName\\n if (inputUnitName ends with \\\"meter\\\") then set inputUnitName to (text 1 thru -3 of inputUnitName) & \\\"re\\\"\\n\\n -- Get the record with the input unit name from 'unitRecords'.\\n set inputUnitRecord to missing value\\n repeat with thisRecord in unitRecords\\n if (thisRecord's |name| is inputUnitName) then\\n set inputUnitRecord to thisRecord's contents\\n exit repeat\\n end if\\n end repeat\\n if (inputUnitRecord is missing value) then error \\\"Unrecognised unit name: \\\" & inputUnitName\\n\\n -- Guess the user's spelling preference from the short-date order configured on their machine.\\n tell (current date) to set {Feb1, its day, its month, its year} to {it, 1, 2, 3333}\\n set USSpelling to (Feb1's short date string's first word as integer is 2)\\n\\n -- Convert the input number to its equivalents in all the specified units, rounding to eight decimal\\n -- places and getting integer values as AS integers where possible. Pair the results with the unit names.\\n set output to {}\\n repeat with thisRecord in unitRecords\\n set outputNumber to convertLinear(inputNumber, inputUnitRecord, thisRecord)\\n set outputNumber to outputNumber div 1 + ((outputNumber * 100000000 mod 100000000) as integer) / 100000000\\n if (outputNumber mod 1 is 0) then set outputNumber to outputNumber div 1\\n set outputUnitName to thisRecord's |name|\\n if ((outputUnitName ends with \\\"metre\\\") and (USSpelling)) then ¬\\n set outputUnitName to (text 1 thru -3 of outputUnitName) & \\\"er\\\"\\n if (outputNumber is not 1) then set outputUnitName to outputUnitName & \\\"s\\\"\\n set end of output to {outputNumber, outputUnitName}\\n end repeat\\n\\n return output -- {{number, unit name}, … }\\nend program\\n\\non demo()\\n set output to {}\\n set astid to AppleScript's text item delimiters\\n repeat with input in {{1, \\\"kilometre\\\"}, {1, \\\"versta\\\"}}\\n set {inputNumber, inputUnitName} to input\\n set end of output to (inputNumber as text) & space & inputUnitName & \\\" is:\\\"\\n set conversions to program(inputNumber, inputUnitName)\\n set AppleScript's text item delimiters to space\\n repeat with thisConversion in conversions\\n set thisConversion's contents to thisConversion as text\\n end repeat\\n set AppleScript's text item delimiters to \\\"; \\\"\\n set end of output to conversions as text\\n end repeat\\n set AppleScript's text item delimiters to linefeed\\n set output to output as text\\n set AppleScript's text item delimiters to astid\\n\\n return output\\nend demo\\n\\nreturn demo()\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"1 kilometre is:\\n1000 metres; 100000 centimetres; 1 kilometre; 2.249718785152E+4 vershoks; 1406.07424072 arshins; 468.69141357 sazhens; 0.93738283 verstas\\n1 versta is:\\n1066.8 metres; 106680 centimetres; 1.0668 kilometres; 24000 vershoks; 1500 arshins; 500 sazhens; 1 versta\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.5\\\" -- macOS 10.12 (Sierra) or later. Not 10.11 (El Capitan).\\nuse framework \\\"Foundation\\\"\\nuse scripting additions\\n\\nproperty |⌘| : current application\\n\\n-- Return a custom NSUnit with a linear converter.\\non customNSUnit(unitClassName, symbol, coefficient, |offset|)\\n set converter to |⌘|'s class \\\"NSUnitConverterLinear\\\"'s alloc()'s initWithCoefficient:(coefficient) |constant|:(|offset|)\\n return |⌘|'s class unitClassName's alloc()'s initWithSymbol:(symbol) converter:(converter)\\nend customNSUnit\\n\\non program(inputNumber, inputUnitName)\\n -- The task description only specifies these seven units, but more can be added if wished.\\n -- The base unit of the NSUnitLength class is 'meters'.\\n set unitRecords to {{|name|:\\\"metre\\\", NSUnit:|⌘|'s class \\\"NSUnitLength\\\"'s |meters|()}, ¬\\n {|name|:\\\"centimetre\\\", NSUnit:|⌘|'s class \\\"NSUnitLength\\\"'s |centimeters|()}, ¬\\n {|name|:\\\"kilometre\\\", NSUnit:|⌘|'s class \\\"NSUnitLength\\\"'s |kilometers|()}, ¬\\n {|name|:\\\"vershok\\\", NSUnit:customNSUnit(\\\"NSUnitLength\\\", \\\"vershok\\\", 0.04445, 0)}, ¬\\n {|name|:\\\"arshin\\\", NSUnit:customNSUnit(\\\"NSUnitLength\\\", \\\"arshin\\\", 0.7112, 0)}, ¬\\n {|name|:\\\"sazhen\\\", NSUnit:customNSUnit(\\\"NSUnitLength\\\", \\\"sazhen\\\", 2.1336, 0)}, ¬\\n {|name|:\\\"versta\\\", NSUnit:customNSUnit(\\\"NSUnitLength\\\", \\\"versta\\\", 1066.8, 0)}}\\n\\n -- Massage the given input unit name if necessary.\\n if (inputUnitName ends with \\\"s\\\") then set inputUnitName to text 1 thru -2 of inputUnitName\\n if (inputUnitName ends with \\\"meter\\\") then set inputUnitName to (text 1 thru -3 of inputUnitName) & \\\"re\\\"\\n\\n -- Get the record with the input unit name from 'unitRecords'.\\n set filter to |⌘|'s class \\\"NSPredicate\\\"'s predicateWithFormat_(\\\"name == %@\\\", inputUnitName)\\n set filteredList to ((|⌘|'s class \\\"NSArray\\\"'s arrayWithArray:(unitRecords))'s filteredArrayUsingPredicate:(filter)) as list\\n if (filteredList is {}) then error \\\"Unrecognised unit name: \\\" & inputUnitName\\n set inputUnitRecord to beginning of filteredList\\n\\n -- Set up an NSMeasurement using the input number and the NSUnit from the record.\\n set inputMeasurement to |⌘|'s class \\\"NSMeasurement\\\"'s alloc()'s ¬\\n initWithDoubleValue:(inputNumber) unit:(inputUnitRecord's NSUnit)\\n\\n -- Get equivalent NSMeasurements in all the specified units and format them as text using an NSMeasurementFormatter\\n -- configured to use the measurements' own units instead of local equivalents and, in the case of the three preset units,\\n -- to include the full words, localised and pluralised as appropriate, instead of the symbols \\\"m\\\", \\\"cm\\\", or \\\"km\\\".\\n set output to {}\\n set measurementFormatter to |⌘|'s class \\\"NSMeasurementFormatter\\\"'s new()\\n tell measurementFormatter to setUnitOptions:(|⌘|'s NSMeasurementFormatterUnitOptionsProvidedUnit)\\n tell measurementFormatter to setUnitStyle:(|⌘|'s NSFormattingUnitStyleLong)\\n repeat with thisRecord in unitRecords\\n set outputMeasurement to (inputMeasurement's measurementByConvertingToUnit:(thisRecord's NSUnit))\\n set formattedMeasurement to (measurementFormatter's stringFromMeasurement:(outputMeasurement)) as text\\n if not ((outputMeasurement's doubleValue() is 1) or (thisRecord's |name| ends with \\\"metre\\\")) then ¬\\n set formattedMeasurement to formattedMeasurement & \\\"s\\\"\\n set end of output to formattedMeasurement\\n end repeat\\n\\n return output -- {formatted text, … }\\nend program\\n\\non demo()\\n considering numeric strings\\n if ((system info)'s system version < \\\"10.12\\\") then ¬\\n error \\\"El Capitan doesn't support the Foundation framework's Units and Measurement system\\\"\\n end considering\\n set output to {}\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\"; \\\"\\n repeat with input in {{1, \\\"kilometre\\\"}, {1, \\\"versta\\\"}}\\n set {inputNumber, inputUnitName} to input\\n set end of output to (inputNumber as text) & space & inputUnitName & \\\" is:\\\"\\n set end of output to program(inputNumber, inputUnitName) as text\\n end repeat\\n set AppleScript's text item delimiters to linefeed\\n set output to output as text\\n set AppleScript's text item delimiters to astid\\n\\n return output\\nend demo\\n\\nreturn demo()\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"1 kilometre is:\\n1,000 metres; 100,000 centimetres; 1 kilometre; 22,497.188 vershoks; 1,406.074 arshins; 468.691 sazhens; 0.937 verstas\\n1 versta is:\\n1,066.8 metres; 106,680 centimetres; 1.067 kilometres; 24,000 vershoks; 1,500 arshins; 500 sazhens; 1 versta\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"# syntax: GAWK -f OLD_RUSSIAN_MEASURE_OF_LENGTH.AWK\\nBEGIN {\\n units = \\\"kilometer meter centimeter tochka liniya diuym vershok piad fut arshin sazhen versta milia\\\"\\n values = \\\"1000.0 1.0 0.01 0.000254 0.00254 0.0254 0.04445 0.1778 0.3048 0.7112 2.1336 1066.8 7467.6\\\"\\n u_leng = split(units,u_arr,\\\" \\\")\\n v_leng = split(values,v_arr,\\\" \\\")\\n if (u_leng != v_leng) {\\n print(\\\"error: lengths of units & values are unequal\\\")\\n exit(1)\\n }\\n print(\\\"enter length & measure or C/R to exit\\\")\\n}\\n{ if ($0 == \\\"\\\") {\\n exit(0)\\n }\\n measure = tolower($2)\\n sub(/s$/,\\\"\\\",measure)\\n for (i=1; i<=u_leng; i++) {\\n if (u_arr[i] == measure) {\\n for (j=1; j<=u_leng; j++) {\\n str = sprintf(\\\"%.8f\\\",$1*v_arr[i]/v_arr[j])\\n sub(/0+$/,\\\"\\\",str)\\n printf(\\\"%10s %s\\\\n\\\",u_arr[j],str)\\n }\\n print(\\\"\\\")\\n next\\n }\\n }\\n printf(\\\"error: invalid measure; choose from: %s\\\\n\\\\n\\\",units)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim units = {\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\", \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"}\\n# all expressed in centimeters\\ndim convs = {0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000}\\n\\ndo\\n\\tcls\\n\\tprint\\n\\tfor i = 1 to units[?]\\n\\t\\tprint rjust(string(i),2); \\\" \\\"; units[i]\\n\\tnext\\n\\tprint\\n\\tdo\\n\\t\\tinput \\\"Please choose a unit 1 to 13 : \\\", unit\\n\\tuntil unit >= 1 and unit <= 13\\n\\tprint\\n\\tdo\\n\\t\\tinput \\\"Now enter a value in that unit : \\\", value\\n\\tuntil value >= 0\\n\\tprint\\n\\tprint \\\"The equivalent in the remaining units is : \\\"\\n\\tprint\\n\\tfor i = 1 to units[?]\\n\\t\\tif i = unit then continue for\\n\\t\\tprint \\\" \\\"; units[i], \\\" : \\\"; value * convs[unit] / convs[i]\\n\\tnext\\n\\tprint\\n\\tdo\\n\\t\\tinput \\\"Do another one y/n : \\\", yn\\n\\t\\tyn = lower(yn)\\n\\tuntil yn = \\\"y\\\" or yn = \\\"n\\\"\\nuntil yn = \\\"n\\\"\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"REM >oldrussian\\n@% = &90E\\nPROColdrus(1, \\\"meter\\\")\\nPRINT\\nPROColdrus(10, \\\"arshin\\\")\\nEND\\n:\\nDEF PROColdrus(length, unit$)\\nLOCAL units$(), values(), unit%, i%\\nDIM units$(12)\\nDIM values(12)\\nunits$() = \\\"kilometer\\\", \\\"meter\\\", \\\"centimeter\\\", \\\"milia\\\", \\\"versta\\\", \\\"sazhen\\\", \\\"arshin\\\", \\\"fut\\\", \\\"piad\\\", \\\"vershok\\\", \\\"diuym\\\", \\\"liniya\\\", \\\"tochka\\\"\\nvalues() = 1000, 1, 0.01, 7467.6, 1066.8, 2.1336, 0.7112, 0.3048, 0.1778, 0.04445, 0.0254, 0.00254, 0.000254\\nunit% = -1\\nFOR i% = 0 TO 12\\n IF units$(i%) = unit$ THEN unit% = i%\\nNEXT\\nIF unit% = -1 THEN\\n PRINT \\\"Unknown unit '\\\"; unit$; \\\"'\\\"\\nELSE\\n PRINT; length; \\\" \\\"; unit$; \\\" =\\\"\\n FOR i% = 0 TO 12\\n IF i% <> unit% THEN PRINT length / values(i%) * values(unit%); \\\" \\\"; units$(i%)\\n NEXT\\nENDIF\\nENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include<string.h>\\n#include<stdlib.h>\\n#include<ctype.h>\\n#include<stdio.h>\\n\\n#define UNITS_LENGTH 13\\n\\nint main(int argC,char* argV[])\\n{\\n\\tint i,reference;\\n\\tchar *units[UNITS_LENGTH] = {\\\"kilometer\\\",\\\"meter\\\",\\\"centimeter\\\",\\\"tochka\\\",\\\"liniya\\\",\\\"diuym\\\",\\\"vershok\\\",\\\"piad\\\",\\\"fut\\\",\\\"arshin\\\",\\\"sazhen\\\",\\\"versta\\\",\\\"milia\\\"};\\n double factor, values[UNITS_LENGTH] = {1000.0,1.0,0.01,0.000254,0.00254,0.0254,0.04445,0.1778,0.3048,0.7112,2.1336,1066.8,7467.6};\\n\\t\\n\\tif(argC!=3)\\n\\t\\tprintf(\\\"Usage : %s followed by length as <value> <unit>\\\");\\n\\telse{\\n\\t\\tfor(i=0;argV[2][i]!=00;i++)\\n\\t\\t\\targV[2][i] = tolower(argV[2][i]);\\n\\t\\t\\n\\t\\tfor(i=0;i<UNITS_LENGTH;i++){\\n\\t\\t\\tif(strstr(argV[2],units[i])!=NULL){\\n\\t\\t\\t\\treference = i;\\n\\t\\t\\t\\tfactor = atof(argV[1])*values[i];\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tprintf(\\\"%s %s is equal in length to : \\\\n\\\",argV[1],argV[2]);\\n\\t\\t\\n\\t\\tfor(i=0;i<UNITS_LENGTH;i++){\\n\\t\\t\\tif(i!=reference)\\n\\t\\t\\t\\tprintf(\\\"\\\\n%lf %s\\\",factor/values[i],units[i]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iomanip>\\n//-------------------------------------------------------------------------------------------\\nusing namespace std;\\n\\n//-------------------------------------------------------------------------------------------\\nclass ormConverter\\n{\\npublic:\\n ormConverter() : AR( 0.7112f ), CE( 0.01f ), DI( 0.0254f ), FU( 0.3048f ), KI( 1000.0f ), LI( 0.00254f ), ME( 1.0f ),\\n\\t\\t MI( 7467.6f ), PI( 0.1778f ), SA( 2.1336f ), TO( 0.000254f ), VE( 0.04445f ), VR( 1066.8f ) {}\\n void convert( char c, float l )\\n {\\n\\tsystem( \\\"cls\\\" );\\n\\tcout << endl << l;\\n\\tswitch( c )\\n\\t{\\n\\t case 'A': cout << \\\" Arshin to:\\\"; l *= AR; break;\\n\\t case 'C': cout << \\\" Centimeter to:\\\"; l *= CE; break;\\n\\t case 'D': cout << \\\" Diuym to:\\\"; l *= DI; break;\\n\\t case 'F': cout << \\\" Fut to:\\\"; l *= FU; break;\\n\\t case 'K': cout << \\\" Kilometer to:\\\"; l *= KI; break;\\n\\t case 'L': cout << \\\" Liniya to:\\\"; l *= LI; break;\\n\\t case 'M': cout << \\\" Meter to:\\\"; l *= ME; break;\\n\\t case 'I': cout << \\\" Milia to:\\\"; l *= MI; break;\\n\\t case 'P': cout << \\\" Piad to:\\\"; l *= PI; break;\\n\\t case 'S': cout << \\\" Sazhen to:\\\"; l *= SA; break;\\n\\t case 'T': cout << \\\" Tochka to:\\\"; l *= TO; break;\\n\\t case 'V': cout << \\\" Vershok to:\\\"; l *= VE; break;\\n\\t case 'E': cout << \\\" Versta to:\\\"; l *= VR;\\n\\t}\\n\\n\\tfloat ar = l / AR, ce = l / CE, di = l / DI, fu = l / FU, ki = l / KI, li = l / LI, me = l / ME,\\n\\t mi = l / MI, pi = l / PI, sa = l / SA, to = l / TO, ve = l / VE, vr = l / VR;\\n\\tcout << left << endl << \\\"=================\\\" << endl\\n\\t << setw( 12 ) << \\\"Arshin:\\\" << ar << endl << setw( 12 ) << \\\"Centimeter:\\\" << ce << endl\\n\\t << setw( 12 ) << \\\"Diuym:\\\" << di << endl << setw( 12 ) << \\\"Fut:\\\" << fu << endl\\n\\t << setw( 12 ) << \\\"Kilometer:\\\" << ki << endl << setw( 12 ) << \\\"Liniya:\\\" << li << endl\\n\\t << setw( 12 ) << \\\"Meter:\\\" << me << endl << setw( 12 ) << \\\"Milia:\\\" << mi << endl\\n\\t << setw( 12 ) << \\\"Piad:\\\" << pi << endl << setw( 12 ) << \\\"Sazhen:\\\" << sa << endl\\n\\t << setw( 12 ) << \\\"Tochka:\\\" << to << endl << setw( 12 ) << \\\"Vershok:\\\" << ve << endl\\n\\t << setw( 12 ) << \\\"Versta:\\\" << vr << endl << endl << endl;\\n }\\nprivate:\\n const float AR, CE, DI, FU, KI, LI, ME, MI, PI, SA, TO, VE, VR;\\n};\\n//-------------------------------------------------------------------------------------------\\nint _tmain(int argc, _TCHAR* argv[])\\n{\\n ormConverter c;\\n char s; float l;\\n while( true )\\n {\\n\\tcout << \\\"What unit:\\\\n(A)rshin, (C)entimeter, (D)iuym, (F)ut\\\\n(K)ilometer, (L)iniya, (M)eter, m(I)lia, (P)iad\\\\n(S)azhen, (T)ochka, (V)ershok, v(E)rsta, (Q)uit\\\\n\\\";\\n\\tcin >> s; if( s & 32 ) s ^= 32; if( s == 'Q' ) return 0;\\n\\tcout << \\\"Length (0 to Quit): \\\"; cin >> l; if( l == 0 ) return 0;\\n\\tc.convert( s, l ); system( \\\"pause\\\" ); system( \\\"cls\\\" );\\n }\\n return 0;\\n}\\n//-------------------------------------------------------------------------------------------\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.algorithm, std.conv;\\n\\nvoid main(in string[] args) {\\n auto factor = [\\\"arshin\\\": 0.7112,\\n \\\"centimeter\\\": 0.01,\\n \\\"diuym\\\": 0.0254,\\n \\\"fut\\\": 0.3048,\\n \\\"kilometer\\\": 1_000.0,\\n \\\"liniya\\\": 0.00254,\\n \\\"meter\\\": 1.0,\\n \\\"milia\\\": 7_467.6,\\n \\\"piad\\\": 0.1778,\\n \\\"sazhen\\\": 2.1336,\\n \\\"tochka\\\": 0.000254,\\n \\\"vershok\\\": 0.04445,\\n \\\"versta\\\": 1_066.8];\\n\\n if (args.length != 3 || !isNumeric(args[1]) || args[2] !in factor)\\n return writeln(\\\"Please provide args Value and Unit.\\\");\\n\\n immutable magnitude = args[1].to!double;\\n immutable meters = magnitude * factor[args[2]];\\n writefln(\\\"%s %s to:\\\\n\\\", args[1], args[2]);\\n foreach (immutable key; factor.keys.schwartzSort!(k => factor[k]))\\n writefln(\\\"%10s: %s\\\", key, meters / factor[key]);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Old_Russian_measure_of_length;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nconst\\n units: array[0..12] of string = ('tochka', 'liniya', 'dyuim', 'vershok',\\n 'piad', 'fut', 'arshin', 'sazhen', 'versta', 'milia', 'centimeter', 'meter',\\n 'kilometer');\\n convs: array[0..12] of double = (0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\\n 71.12, 213.36, 10668, 74676, 1, 100, 10000);\\n\\nfunction ReadInt(): integer;\\nvar\\n data: string;\\nbegin\\n Readln(data);\\n Result := StrToIntDef(data, -1);\\nend;\\n\\nfunction ReadFloat(): Double;\\nvar\\n data: string;\\nbegin\\n Readln(data);\\n Result := StrToFloatDef(data, -1);\\nend;\\n\\nvar\\n yn, u: string;\\n i, unt: integer;\\n value: Double;\\n\\nbegin\\n\\n repeat\\n for i := 0 to High(units) do\\n begin\\n u := units[i];\\n Writeln(format('%2d %s', [i + 1, u]));\\n end;\\n Writeln;\\n\\n unt := 0;\\n repeat\\n Writeln('Please choose a unit 1 to 13 : ');\\n unt := ReadInt();\\n until (unt >= 1) and (unt <= 13);\\n\\n dec(unt);\\n\\n repeat\\n Writeln('Now enter a value in that unit : ');\\n value := ReadFloat();\\n until value >= 0;\\n\\n Writeln(#10'The equivalent in the remaining units is:'#10);\\n\\n for i := 0 to High(units) do\\n begin\\n u := units[i];\\n if i = unt then\\n Continue;\\n Writeln(format(' %10s : %g', [u, value * convs[unt] / convs[i]]));\\n end;\\n\\n Writeln;\\n\\n yn := '';\\n Writeln('Do another one y/n : ');\\n readln(yn);\\n until yn.toLower = 'n';\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"units$[] = [ \\\"tochka\\\" \\\"liniya\\\" \\\"dyuim\\\" \\\"vershok\\\" \\\"piad\\\" \\\"fut\\\" \\\"arshin\\\" \\\"sazhen\\\" \\\"versta\\\" \\\"milia\\\" \\\"centimeter\\\" \\\"meter\\\" \\\"kilometer\\\" ]\\nconvs[] = [ 0.254 0.254 2.54 4.445 17.78 30.48 71.12 213.36 10668 74676 1 100 10000 ]\\nfor i to len units$[]\\n print i & \\\") \\\" & units$[i]\\n.\\nprint \\\"\\\"\\nwrite \\\"Please choose a unit (1 to 13): \\\"\\nrepeat\\n unit = number input\\n until unit >= 1 and unit <= 13\\n.\\nprint unit\\nwrite \\\"Now enter a value in that unit: \\\"\\nrepeat\\n value = -1\\n value = number input\\n print value\\n until value >= 0\\n.\\nprint value\\nprint \\\"\\\"\\nprint value & \\\" \\\" & units$[unit] & \\\" are\\\"\\nprint \\\"\\\"\\nfor i to len units$[]\\n if i <> unit\\n print value * convs[unit] / convs[i] & \\\" \\\" & units$[i]\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import system'collections;\\nimport system'routines;\\nimport extensions;\\n\\nunit2mult = new Map<string, real>()\\n .setAt(\\\"arshin\\\", 0.7112r)\\n .setAt(\\\"centimeter\\\", 0.01r)\\n .setAt(\\\"diuym\\\", 0.0254r)\\n .setAt(\\\"fut\\\", 0.3048r)\\n .setAt(\\\"kilometer\\\", 1000.0r)\\n .setAt(\\\"liniya\\\", 0.00254r)\\n .setAt(\\\"meter\\\", 1.0r)\\n .setAt(\\\"milia\\\", 7467.6r)\\n .setAt(\\\"piad\\\", 0.1778r)\\n .setAt(\\\"sazhen\\\", 2.1336r)\\n .setAt(\\\"tochka\\\", 0.000254r)\\n .setAt(\\\"vershok\\\", 0.04445r)\\n .setAt(\\\"versta\\\", 1066.8r);\\n\\npublic program()\\n{\\n if (program_arguments.Length != 3)\\n { console.writeLine(\\\"need two arguments - number then units\\\"); AbortException.raise() };\\n\\n real value := program_arguments[1].toReal();\\n string unit := program_arguments[2];\\n ifnot (unit2mult.containsKey(unit))\\n {\\n console.printLine(\\\"only following units are supported:\\\",\\n unit2mult.selectBy::(x=>x.Item1).asEnumerable());\\n\\n AbortException.raise()\\n };\\n\\n console.printLine(value,\\\" \\\",unit,\\\" to:\\\");\\n\\n unit2mult.forEach::(u,mlt)\\n {\\n console.printPaddingLeft(30, u, \\\":\\\").printLine(value * unit2mult[unit] / mlt)\\n }\\n}\\n\",\n \"language\": \"Elena\"\n },\n {\n \"code\": \"USING: formatting inverse io kernel math prettyprint quotations\\nsequences units.imperial units.si vocabs ;\\nIN: rosetta-code.units.russian\\n\\n: arshin ( n -- d ) 2+1/3 * feet ;\\n: tochka ( n -- d ) 1/2800 * arshin ;\\n: liniya ( n -- d ) 1/280 * arshin ;\\n: dyuim ( n -- d ) 1/28 * arshin ;\\n: vershok ( n -- d ) 1/16 * arshin ;\\n: ladon ( n -- d ) 7+1/2 * cm ;\\n: piad ( n -- d ) 1/4 * arshin ;\\n: fut ( n -- d ) 3/7 * arshin ;\\n: lokot ( n -- d ) 45 * cm ;\\n: shag ( n -- d ) 71 * cm ;\\n: sazhen ( n -- d ) 3 * arshin ;\\n: versta ( n -- d ) 1,500 * arshin ;\\n: milya ( n -- d ) 10,500 * arshin ;\\n\\n<PRIVATE\\n\\n: convert ( quot -- )\\n [ unparse rest rest but-last write \\\"to:\\\" print ] [ call ] bi\\n \\\"rosetta-code.units.russian\\\" vocab-words { cm m km } append\\n [ dup \\\"%8u : \\\" printf 1quotation [undo] call( x -- x ) . ]\\n with each nl ; inline\\n\\n: main ( -- )\\n [ 6 m ] [ 1+7/8 milya ] [ 2 furlongs ] [ convert ] tri@ ;\\n\\nPRIVATE>\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"create units s\\\" kilometer\\\" 2, s\\\" meter\\\" 2, s\\\" centimeter\\\" 2, s\\\" tochka\\\" 2, s\\\" liniya\\\" 2, s\\\" diuym\\\" 2, s\\\" vershok\\\" 2, s\\\" piad\\\" 2, s\\\" fut\\\" 2, s\\\" arshin\\\" 2, s\\\" sazhen\\\" 2, s\\\" versta\\\" 2, s\\\" milia\\\" 2,\\ncreate values 1000.0e f, 1.0e f, 0.01e f, 0.000254e f, 0.00254e f, 0.0254e f, 0.04445e f, 0.1778e f, 0.3048e f, 0.7112e f, 2.1336e f, 1066.8e f, 7467.6e f,\\n: unit ( u1 -- caddr u1 )\\n units swap 2 cells * + 2@ ;\\n: myval ( u1 -- caddr u1 )\\n values swap 1 cells * + f@ ;\\n: 2define create 0 , 0 , ;\\n\\n2define ch_u\\nvariable mlt\\nvariable theunit\\n: show ( chosen_unit chosen_mutliplier -- )\\n ch_u 2!\\n mlt f!\\n 13 0 DO\\n ch_u 2@ i unit compare if\\n else mlt f@ f. i unit type cr .\\\" ===========\\\" cr\\n i myval theunit f!\\n 13 0 DO\\n .\\\" \\t\\\" i unit type .\\\" : \\\" theunit f@ i myval f/ mlt f@ f* f. cr\\n LOOP\\n then\\n LOOP cr ;\\n1e s\\\" meter\\\" show\\n20e s\\\" versta\\\" show\\n10e s\\\" milia\\\" show\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM RUS\\n IMPLICIT NONE\\n REAL, PARAMETER:: E_m = 1.\\n REAL, PARAMETER:: E_mm = 1.E-3\\n REAL, PARAMETER:: E_km = 1.E+3\\n REAL, PARAMETER:: E_cm = 1.E-2\\n REAL, PARAMETER:: E_arshin = 71.12 * E_cm\\n REAL, PARAMETER:: E_fut = 3./7. * E_arshin\\n REAL, PARAMETER:: E_piad = 1./4. * E_arshin\\n REAL, PARAMETER:: E_vershok = 1./16. * E_arshin\\n REAL, PARAMETER:: E_dyuim = 1./28. * E_arshin\\n REAL, PARAMETER:: E_liniya = 1./280. * E_arshin\\n REAL, PARAMETER:: E_tochka = 1./2800. * E_arshin\\n REAL, PARAMETER:: E_ladon = 7.5 * E_cm\\n REAL, PARAMETER:: E_lokot = 45 * E_cm\\n REAL, PARAMETER:: E_sazhen = 3. * E_arshin\\n REAL, PARAMETER:: E_versta = 1500. * E_arshin\\n REAL, PARAMETER:: E_milya = 10500. * E_arshin\\n INTEGER, PARAMETER:: N = 16\\n CHARACTER(LEN=7), DIMENSION(N):: nam = (/&\\n &'m ', 'mm ', 'km ', 'cm ',&\\n &'arshin ', 'fut ', 'piad ', 'vershok',&\\n &'dyuim ', 'liniya ', 'tochka ', 'ladon ',&\\n &'lokot ', 'sazhen ', 'versta ', 'milya ' /)\\n REAL, DIMENSION(N):: wert = (/ &\\n &1., E_mm, E_km, E_cm,&\\n &E_arshin, E_fut, E_piad, E_vershok,&\\n &E_dyuim, E_liniya, E_tochka, E_ladon,&\\n &E_lokot, E_sazhen, E_versta, E_milya /)\\n CHARACTER(LEN=7):: RD_U\\n REAL:: RD_V\\n INTEGER:: I, J\\n DO I=1, N\\n WRITE(*, '(A, \\\" \\\")', ADVANCE='NO') nam(I)\\n END DO\\n WRITE (*, *)\\n WRITE(*, '(A)', ADVANCE='NO') 'value unit -> '\\n READ(*, *) RD_V, RD_U\\n RD_U = ADJUSTL(RD_U)\\n J = 1\\n DO WHILE (NAM(J) .NE. RD_U)\\n J = J + 1\\n IF (J .GT. N) STOP \\\"Unit not known: \\\"//RD_U\\n END DO\\n RD_V = RD_V * wert(J)\\n DO I=1, N\\n J = J + 1\\n IF (J .GT. N) J = 1\\n WRITE (*, '(F20.3, \\\" \\\", A)') RD_V / wert(J), nam(J)\\n END DO\\nEND PROGRAM RUS\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nDim units(1 To 13) As String = {\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", _\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\", _\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"}\\n\\n' all expressed in centimeters\\nDim convs(1 To 13) As Single = {0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, _\\n 71.12, 213.36, 10668, 74676, _\\n 1, 100, 10000}\\nDim unit As Integer\\nDim value As Single\\nDim yn As String\\n\\nDo\\n Shell(\\\"cls\\\")\\n Print\\n For i As Integer = 1 To 13\\n Print Using \\\"##\\\"; i;\\n Print \\\" \\\"; units(i)\\n Next\\n Print\\n Do\\n Input \\\"Please choose a unit 1 to 13 : \\\"; unit\\n Loop Until unit >= 1 AndAlso unit <= 13\\n Print\\n Do\\n Input \\\"Now enter a value in that unit : \\\"; value\\n Loop Until value >= 0\\n Print\\n Print \\\"The equivalent in the remaining units is : \\\"\\n Print\\n For i As Integer = 1 To 13\\n If i = unit Then Continue For\\n Print \\\" \\\"; units(i), \\\" : \\\"; value * convs(unit) / convs(i)\\n Next\\n Print\\n Do\\n Input \\\"Do another one y/n : \\\"; yn\\n yn = LCase(yn)\\n Loop Until yn = \\\"y\\\" OrElse yn = \\\"n\\\"\\nLoop Until yn = \\\"n\\\"\\n\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"arshin := (2 + 1/3) ft\\nvershok := 1/16 arshin\\nsazhen := 3 arshin\\nverst := 1500 arshin\\nversta := verst\\n\\ndo\\n{\\n valstr = input[\\\"Enter unit of measure: \\\", \\\"1 arshin\\\"]\\n val = eval[valstr]\\n if ! (val conforms length)\\n println[\\\"$valstr is not a unit of length.\\\"]\\n} until val conforms length\\n\\nprintln[\\\"$valstr = \\\"]\\nprintln[\\\" \\\" + (val -> \\\"arshin\\\")]\\nprintln[\\\" \\\" + (val -> \\\"vershok\\\")]\\nprintln[\\\" \\\" + (val -> \\\"sazhen\\\")]\\nprintln[\\\" \\\" + (val -> \\\"verst\\\")]\\nprintln[\\\" \\\" + (val -> \\\"feet\\\")]\\nprintln[\\\" \\\" + (val -> \\\"meters\\\")]\\nprintln[\\\" \\\" + (val -> \\\"centimeters\\\")]\\nprintln[\\\" \\\" + (val -> \\\"kilometers\\\")]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n Dim units As String[] = [\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\", \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"]\\n\\n ' all expressed in centimeters\\n Dim convs As Single[] = [0.254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000]\\n Dim i, unit As Integer\\n Dim value As Single\\n Dim yn As String\\n\\n Do\\n Shell(\\\"clear\\\")\\n Print\\n For i = 1 To units.count\\n Print Format$(i, \\\"##\\\"); \\\" \\\"; units[i - 1]\\n Next\\n Print \\\"\\\\nPlease choose a unit 1 to 13 : \\\"\\n Do\\n Input unit\\n Loop Until unit >= 1 And unit <= 13\\n Print \\\"\\\\nNow enter a value in that unit : \\\"\\n Do\\n Input value\\n Loop Until value >= 0\\n Print \\\"\\\\nThe equivalent in the remaining units is : \\\\n\\\"\\n For i = 0 To units.count - 1\\n If i = unit - 1 Then Continue 'For\\n Print units[i]; Space$(10 - Len(units[i]));\\n Print \\\" : \\\"; value * convs[unit - 1] / convs[i]\\n Next\\n Print \\\"\\\\nDo another one y/n : \\\"\\n Do\\n Input yn\\n yn = LCase(yn)\\n Loop Until yn = \\\"y\\\" Or yn = \\\"n\\\"\\n Loop Until yn = \\\"n\\\"\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"fmt\\\"\\n \\\"os\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc main() {\\n units := []string{\\n \\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\",\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\",\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\",\\n }\\n\\n convs := []float32{\\n 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\\n 71.12, 213.36, 10668, 74676,\\n 1, 100, 10000,\\n }\\n\\n scanner := bufio.NewScanner(os.Stdin)\\n for {\\n for i, u := range units {\\n fmt.Printf(\\\"%2d %s\\\\n\\\", i+1, u)\\n }\\n fmt.Println()\\n var unit int\\n var err error\\n for {\\n fmt.Print(\\\"Please choose a unit 1 to 13 : \\\")\\n scanner.Scan()\\n unit, err = strconv.Atoi(scanner.Text())\\n if err == nil && unit >= 1 && unit <= 13 {\\n break\\n }\\n }\\n unit--\\n var value float64\\n for {\\n fmt.Print(\\\"Now enter a value in that unit : \\\")\\n scanner.Scan()\\n value, err = strconv.ParseFloat(scanner.Text(), 32)\\n if err == nil && value >= 0 {\\n break\\n }\\n }\\n fmt.Println(\\\"\\\\nThe equivalent in the remaining units is:\\\\n\\\")\\n for i, u := range units {\\n if i == unit {\\n continue\\n }\\n fmt.Printf(\\\" %10s : %g\\\\n\\\", u, float32(value)*convs[unit]/convs[i])\\n }\\n fmt.Println()\\n yn := \\\"\\\"\\n for yn != \\\"y\\\" && yn != \\\"n\\\" {\\n fmt.Print(\\\"Do another one y/n : \\\")\\n scanner.Scan()\\n yn = strings.ToLower(scanner.Text())\\n }\\n if yn == \\\"n\\\" {\\n return\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"module Main where\\n\\nimport Text.Printf (printf)\\nimport System.Environment (getArgs, getProgName)\\n\\ntochka = (\\\"tochka\\\" , 0.000254)\\nliniya = (\\\"liniya\\\" , 0.00254)\\ncentimeter = (\\\"centimeter\\\", 0.01)\\ndiuym = (\\\"diuym\\\" , 0.0254)\\nvershok = (\\\"vershok\\\" , 0.04445)\\npiad = (\\\"piad\\\" , 0.1778)\\nfut = (\\\"fut\\\" , 0.3048)\\narshin = (\\\"arshin\\\" , 0.7112)\\nmeter = (\\\"meter\\\" , 1.0)\\nsazhen = (\\\"sazhen\\\" , 2.1336)\\nkilometer = (\\\"kilometer\\\" , 1000.0)\\nversta = (\\\"versta\\\" , 1066.8)\\nmilia = (\\\"milia\\\" , 7467.6)\\n\\nunits :: [(String, Double)]\\nunits = [tochka, liniya, centimeter, diuym, vershok, piad, fut, arshin, meter, sazhen, kilometer, versta, milia]\\n\\n\\nconvert :: Double -> Double -> IO ()\\nconvert num factor = mapM_ (\\\\(unit, fac) -> printf \\\"| %-10s | %-22f|\\\\n\\\" unit (num * factor / fac)) units\\n\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n case args of\\n [x,y] | [(num, \\\"\\\")] <- reads x :: [(Double, String)]\\n , (Just factor) <- lookup y units -> convert num factor\\n (_) -> do\\n name <- getProgName\\n printf \\\"Arguments were wrong - please use ./%s <number> <unit>\\\\n\\\" name\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"#!/usr/bin/ijconsole\\nUNIT2MULT=: |:_2 (; \\\".)&;/\\\\;:'arshin 0.7112 centimeter 0.01 diuym 0.0254 fut 0.3048 kilometer 1000.0 liniya 0.00254 meter 1.0 milia 7467.6 piad 0.1778 sazhen 2.1336 tochka 0.000254 vershok 0.04445 versta 1066.8'\\n\\nconv=: UNIT2MULT 1 : 0\\n if. 2 ~: # y do. 'ERROR. Need two arguments - number then units'\\n else.\\n 'VALUE UNIT'=. (;~ _&\\\".)&;~/y\\n if. _ = VALUE do. 'ERROR. First argument must be a (float) number'\\n else.\\n try.\\n scale=. ({::~ i.&(<UNIT))~/m\\n ((\\\":;:inv y),' to:'),\\\":({.m),.({:m)*L:0 VALUE%scale\\n catch.\\n 'ERROR. Only know the following units: ',;:inv{.m\\n end.\\n end.\\n end.\\n)\\n\\nNB. for use from os command line only:\\nexit echo conv }.ARGV\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class OldRussianMeasures {\\n\\n final static String[] keys = {\\\"tochka\\\", \\\"liniya\\\", \\\"centimeter\\\", \\\"diuym\\\",\\n \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", \\\"arshin\\\", \\\"meter\\\", \\\"sazhen\\\", \\\"kilometer\\\",\\n \\\"versta\\\", \\\"milia\\\"};\\n\\n final static double[] values = {0.000254, 0.00254, 0.01,0.0254,\\n 0.04445, 0.1778, 0.3048, 0.7112, 1.0, 2.1336, 1000.0,\\n 1066.8, 7467.6};\\n\\n public static void main(String[] a) {\\n if (a.length == 2 && a[0].matches(\\\"[+-]?\\\\\\\\d*(\\\\\\\\.\\\\\\\\d+)?\\\")) {\\n double inputVal = lookup(a[1]);\\n if (!Double.isNaN(inputVal)) {\\n double magnitude = Double.parseDouble(a[0]);\\n double meters = magnitude * inputVal;\\n System.out.printf(\\\"%s %s to: %n%n\\\", a[0], a[1]);\\n for (String k: keys)\\n System.out.printf(\\\"%10s: %g%n\\\", k, meters / lookup(k));\\n return;\\n }\\n }\\n System.out.println(\\\"Please provide a number and unit\\\");\\n\\n }\\n\\n public static double lookup(String key) {\\n for (int i = 0; i < keys.length; i++)\\n if (keys[i].equals(key))\\n return values[i];\\n return Double.NaN;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def lpad($len): tostring | ($len - length) as $l | (\\\" \\\" * $l) + .;\\n\\ndef Units: {\\n \\\"arshin\\\" : 0.7112,\\n \\\"centimeter\\\": 0.01,\\n \\\"diuym\\\" : 0.0254,\\n \\\"fut\\\" : 0.3048,\\n \\\"kilometer\\\" : 1000.0,\\n \\\"liniya\\\" : 0.00254,\\n \\\"meter\\\" : 1.0,\\n \\\"milia\\\" : 7467.6,\\n \\\"piad\\\" : 0.1778,\\n \\\"sazhen\\\" : 2.1336,\\n \\\"tochka\\\" : 0.000254,\\n \\\"vershok\\\" : 0.04445,\\n \\\"versta\\\" : 1066.8\\n};\\n\\ndef cyrillic: {\\n \\\"arshin\\\" : \\\"арши́н\\\",\\n \\\"centimeter\\\": \\\"сантиметр\\\",\\n \\\"diuym\\\" : \\\"дюйм\\\",\\n \\\"fut\\\" : \\\"фут\\\",\\n \\\"kilometer\\\" : \\\"километр\\\",\\n \\\"liniya\\\" : \\\"ли́ния\\\",\\n \\\"meter\\\" : \\\"метр\\\",\\n \\\"milia\\\" : \\\"ми́ля\\\",\\n \\\"piad\\\" : \\\"пядь\\\",\\n \\\"sazhen\\\" : \\\"саже́нь\\\",\\n \\\"tochka\\\" : \\\"то́чка\\\",\\n \\\"vershok\\\" : \\\"вершо́к\\\",\\n \\\"versta\\\" : \\\"верста́\\\"\\n};\\n\\ndef request:\\n def explain: \\\"number and unit of measurement expected vs \\\\(.)\\\" | error;\\n def check:\\n $ARGS.positional\\n | if length >= 2\\n then (try (.[0] | tonumber) catch false) as $n\\n | (.[1] | sub(\\\"s$\\\";\\\"\\\")) as $u\\n | if $n and Units[$u] then [$n, $u]\\n else explain\\n end\\n else explain\\n end;\\n check ;\\n\\n# Input: a number\\n# Delete unhelpful digits\\ndef humanize($n):\\n tostring\\n | ( capture(\\\"^(?<head>[0-9]*)[.](?<zeros>0*)(?<tail>[0-9]*)$\\\")\\n | (.head|length) as $hl\\n | if $hl > $n then .head + \\\".\\\"\\n elif .head | (. == \\\"\\\" or . == \\\"0\\\")\\n then .head + \\\".\\\" + .zeros + .tail[:1 + $n - $hl]\\n else .head + \\\".\\\" + (.zeros + .tail)[:1 + $n - $hl]\\n end ) // .;\\n\\ndef display:\\n Units\\n | . as $Units\\n | request as [$n, $unit]\\n | \\\"\\\\($n) \\\\($unit)\\\\(if $n == 1 then \\\"\\\" else \\\"s\\\" end) ::\\\",\\n (to_entries[]\\n | \\\"\\\\(.key|lpad(10)) : \\\\(($n * $Units[$unit] / .value) | humanize(5)) \\\\(cyrillic[.key])\\\"),\\n \\\"\\\" ;\\n\\ndisplay\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using DataStructures\\n\\nconst unit2mult = Dict(\\n \\\"arshin\\\" => 0.7112, \\\"centimeter\\\" => 0.01, \\\"diuym\\\" => 0.0254,\\n \\\"fut\\\" => 0.3048, \\\"kilometer\\\" => 1000.0, \\\"liniya\\\" => 0.00254,\\n \\\"meter\\\" => 1.0, \\\"milia\\\" => 7467.6, \\\"piad\\\" => 0.1778,\\n \\\"sazhen\\\" => 2.1336, \\\"tochka\\\" => 0.000254, \\\"vershok\\\" => 0.04445,\\n \\\"versta\\\" => 1066.8)\\n\\n@assert length(ARGS) == 2 \\\"need two arguments - number then units\\\"\\n\\nglobal value\\ntry value = parse(Float64, ARGS[1])\\ncatch error(\\\"first argument must be a (float) number\\\") end\\n\\nif isnull(value) error(\\\"first argument must be a (float) number\\\") end\\nunit = ARGS[2]\\n@assert unit ∈ keys(unit2mult) \\\"only know the following units:\\\\n\\\" * join(keys(unit2mult), \\\", \\\")\\n\\nprintln(\\\"$value $unit to:\\\")\\nfor (unt, mlt) in sort(unit2mult)\\n @printf(\\\" %10s: %g\\\\n\\\", unt, value * unit2mult[unit] / mlt)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\n/* clears console on Windows 10 */\\nfun cls() = ProcessBuilder(\\\"cmd\\\", \\\"/c\\\", \\\"cls\\\").inheritIO().start().waitFor()\\n\\nfun main(args: Array<String>) {\\n val units = listOf(\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\",\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\",\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\")\\n val convs = arrayOf(0.0254f, 0.254f, 2.54f, 4.445f, 17.78f, 30.48f,\\n 71.12f, 213.36f, 10668.0f, 74676.0f,\\n 1.0f, 100.0f, 10000.0f)\\n var unit: Int\\n var value: Float\\n var yn : String\\n do {\\n cls()\\n println()\\n for (i in 0 until units.size) println(\\\"${\\\"%2d\\\".format(i + 1)} ${units[i]}\\\")\\n println()\\n do {\\n print(\\\"Please choose a unit 1 to 13 : \\\")\\n unit = try { readLine()!!.toInt() } catch (e: NumberFormatException) { 0 }\\n }\\n while (unit !in 1..13)\\n unit--\\n do {\\n print(\\\"Now enter a value in that unit : \\\")\\n value = try { readLine()!!.toFloat() } catch (e: NumberFormatException) { -1.0f }\\n }\\n while (value < 0.0f)\\n println(\\\"\\\\nThe equivalent in the remaining units is:\\\\n\\\")\\n for (i in 0 until units.size) {\\n if (i == unit) continue\\n println(\\\" ${units[i].padEnd(10)} : ${value * convs[unit] / convs[i]}\\\")\\n }\\n println()\\n do {\\n print(\\\"Do another one y/n : \\\")\\n yn = readLine()!!.toLowerCase()\\n }\\n while (yn != \\\"y\\\" && yn != \\\"n\\\")\\n }\\n while (yn == \\\"y\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"module OldRusianMeasureOfLength {\\n\\tunit2mult=list:=\\\"arshin\\\" := 0.7112, \\\"centimeter\\\" := 0.01, \\\"diuym\\\" := 0.0254, \\\"fut\\\" := 0.3048, \\\"kilometer\\\" := 1000.0, \\\"liniya\\\" := 0.00254, \\\"meter\\\" := 1.0, \\\"milia\\\" := 7467.6, \\\"piad\\\" := 0.1778, \\\"sazhen\\\" := 2.1336, \\\"tochka\\\":= 0.000254, \\\"vershok\\\" := 0.04445, \\\"versta\\\" := 1066.8\\n\\tk=each(unit2mult)\\n\\tmenu // empty menu list\\n\\tmenu + \\\"(exit)\\\"\\n\\twhile k\\n\\t\\tmenu + eval$(k!)\\n\\tend while\\n\\tdouble v\\n\\tdo\\n\\t\\tPrint \\\"Value, Unit\\\";\\n\\t\\tinput \\\":\\\", v;\\n\\t\\tprint \\\" \\\";\\n\\t\\tmenu !\\n\\t\\tif menu>0 then\\n\\t\\t\\tprint menu$(menu)\\t\\t\\t\\n\\t\\t\\tif menu$(menu)=\\\"(exit)\\\" then exit\\n\\t\\t\\tPrint v;\\\" \\\";menu$(menu);\\\" to:\\\"\\n\\t\\t\\tv*=unit2mult(menu$(menu))\\n\\t\\t\\tk=each(unit2mult)\\n\\t\\t\\twhile k\\n\\t\\t\\t\\tif eval$(k!)=menu$(menu) then continue\\n\\t\\t\\t\\tprint format$(\\\"{0:-12}: {1}\\\",eval$(k!), round(v/eval(k),9))\\n\\t\\t\\tend while\\n\\t\\telse\\n\\t\\t\\texit\\n\\t\\tend if\\n\\talways\\n}\\nOldRusianMeasureOfLength\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"ClearAll[units, ConvertRussianQuantities]\\nunits = {\\\"RussianVershoks\\\", \\\"RussianArshins\\\", \\\"RussianSazhens\\\", \\\"RussianVerstas\\\", \\\"Centimeters\\\", \\\"Meters\\\", \\\"Kilometers\\\"};\\nConvertRussianQuantities[q_Quantity] := UnitConvert[q, #] & /@ Select[units, QuantityUnit[q] != # &]\\nConvertRussianQuantities[Quantity[1, \\\"Vershoks\\\"]]\\nConvertRussianQuantities[Quantity[1, \\\"Arshins\\\"]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import os, strutils, sequtils, tables\\n\\nconst Unit2Mult = {\\\"arshin\\\": 0.7112, \\\"centimeter\\\": 0.01, \\\"diuym\\\": 0.0254,\\n \\\"fut\\\": 0.3048, \\\"kilometer\\\": 1000.0, \\\"liniya\\\": 0.00254,\\n \\\"meter\\\": 1.0, \\\"milia\\\": 7467.6, \\\"piad\\\": 0.1778,\\n \\\"sazhen\\\": 2.1336, \\\"tochka\\\": 0.000254, \\\"vershok\\\": 0.04445,\\n \\\"versta\\\": 1066.8}.toOrderedTable\\n\\nif paramCount() != 2:\\n raise newException(ValueError, \\\"need two arguments: number then units.\\\")\\n\\nlet value = try: parseFloat(paramStr(1))\\n except ValueError:\\n raise newException(ValueError, \\\"first argument must be a (float) number.\\\")\\n\\nlet unit = paramStr(2)\\nif unit notin Unit2Mult:\\n raise newException(ValueError,\\n \\\"only know the following units: \\\" & toSeq(Unit2Mult.keys).join(\\\" \\\"))\\n\\necho value, ' ', unit, \\\" to:\\\"\\nfor (key, mult) in Unit2Mult.pairs:\\n echo key.align(10), \\\": \\\", formatFloat(value * Unit2Mult[unit] / mult, ffDecimal, 5)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"sub convert {\\n my($magnitude, $unit) = @_;\\n my %factor = (\\n tochka => 0.000254,\\n liniya => 0.00254,\\n diuym => 0.0254,\\n vershok => 0.04445,\\n piad => 0.1778,\\n fut => 0.3048,\\n arshin => 0.7112,\\n sazhen => 2.1336,\\n versta => 1066.8,\\n milia => 7467.6,\\n centimeter => 0.01,\\n meter => 1.0,\\n kilometer => 1000.0,\\n );\\n\\n my $base= $magnitude * $factor{$unit};\\n my $result .= \\\"$magnitude $unit to:\\\\n\\\";\\n for (sort { $factor{$a} <=> $factor{$b} } keys %factor) {\\n $result .= sprintf \\\"%10s: %s\\\\n\\\", $_, sigdig($base / $factor{$_}, 5) unless $_ eq $unit\\n }\\n return $result;\\n}\\n\\nsub sigdig {\\n my($num,$sig) = @_;\\n return $num unless $num =~ /\\\\./;\\n\\n $num =~ /([1-9]\\\\d*\\\\.?\\\\d*)/;\\n my $prefix = $`;\\n my $match = $&;\\n $sig++ if $match =~ /\\\\./;\\n my $digits = substr $match, 0, $sig;\\n my $nextd = substr $match, $sig, 1;\\n $digits =~ s/(.)$/{1+$1}/e if $nextd > 5;\\n return $prefix . $digits;\\n}\\n\\nprint convert(1,'meter'), \\\"\\\\n\\\\n\\\";\\nprint convert(1,'milia'), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">units</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">\\\"-- metric ---\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"kilometer\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"km\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"kilometer\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"meter\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"m\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"meter\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"centimeter\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.01</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"cm\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"centimeter\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\" old russian \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"tochka\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.000254</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"liniya\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.00254</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"diuym\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.0254</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"vershok\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.04445</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"piad\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.1778</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"fut\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.3048</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"arshin\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.7112</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"sazhen\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2.1336</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"versta\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1066.8</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"milia\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7467.6</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">units</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">strim</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'.'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Obviously, uncomment these lines for a prompt (not under p2js)\\n --while true do\\n -- string input = prompt_string(\\\"\\\\nEnter length & measure or CR to exit:\\\")\\n -- if input=\\\"\\\" then exit end if\\n -- input = lower(trim(input))</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">input</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"7.4676 km\\\"</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">fmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">input</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #008000;\\\">\\\"%f %s\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"%f%s\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">input</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"enter eg 1km or 1 kilometer\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"unrecognised unit: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- abbreviation, eg cm->centimeter</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">f</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">f</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- header</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"--------------%s--------------\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #004080;\\\">atom</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- not abbrev</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%20s %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">strim</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]/</span><span style=\\\"color: #000000;\\\">facts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]),</span><span style=\\\"color: #000000;\\\">names</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--end while</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from sys import argv\\n\\nunit2mult = {\\\"arshin\\\": 0.7112, \\\"centimeter\\\": 0.01, \\\"diuym\\\": 0.0254,\\n \\\"fut\\\": 0.3048, \\\"kilometer\\\": 1000.0, \\\"liniya\\\": 0.00254,\\n \\\"meter\\\": 1.0, \\\"milia\\\": 7467.6, \\\"piad\\\": 0.1778,\\n \\\"sazhen\\\": 2.1336, \\\"tochka\\\": 0.000254, \\\"vershok\\\": 0.04445,\\n \\\"versta\\\": 1066.8}\\n\\nif __name__ == '__main__':\\n assert len(argv) == 3, 'ERROR. Need two arguments - number then units'\\n try:\\n value = float(argv[1])\\n except:\\n print('ERROR. First argument must be a (float) number')\\n raise\\n unit = argv[2]\\n assert unit in unit2mult, ( 'ERROR. Only know the following units: '\\n + ' '.join(unit2mult.keys()) )\\n\\n print(\\\"%g %s to:\\\" % (value, unit))\\n for unt, mlt in sorted(unit2mult.items()):\\n print(' %10s: %g' % (unt, value * unit2mult[unit] / mlt))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DIM units(1 TO 13) AS STRING\\nFOR i = LBOUND(units) TO UBOUND(units)\\nREAD units(i)\\nNEXT i\\nDATA \\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\", \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"\\n\\n' all expressed in centimeters\\nDIM convs(1 TO 13) AS SINGLE\\nFOR i = 1 TO 13\\nREAD convs(i)\\nNEXT i\\nDATA 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000\\nDIM unit AS INTEGER\\nDIM value AS SINGLE\\nDIM yn AS STRING\\n\\nDO\\n CLS\\n PRINT\\n FOR i = 1 TO 13\\n PRINT USING \\\"## \\\"; i;\\n PRINT units(i)\\n NEXT i\\n PRINT\\n DO\\n INPUT \\\"Please choose a unit 1 to 13 : \\\", unit\\n LOOP UNTIL unit >= 1 AND unit <= 13\\n PRINT\\n DO\\n INPUT \\\"Now enter a value in that unit : \\\", value\\n LOOP UNTIL value >= 0\\n PRINT\\n PRINT \\\"The equivalent in the remaining units is : \\\"\\n PRINT\\n FOR i = 1 TO 13\\n IF i <> unit THEN PRINT \\\" \\\"; units(i), \\\" : \\\"; value * convs(unit) / convs(i)\\n NEXT i\\n PRINT\\n DO\\n INPUT \\\"Do another one y/n : \\\", yn\\n yn = LCASE$(yn)\\n LOOP UNTIL yn = \\\"y\\\" OR yn = \\\"n\\\"\\nLOOP UNTIL yn = \\\"n\\\"\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define units\\n '([tochka 0.000254]\\n [liniya 0.00254]\\n [diuym 0.0254]\\n [vershok 0.04445]\\n [piad 0.1778]\\n [fut 0.3048]\\n [arshin 0.7112]\\n [sazhen 2.1336]\\n [versta 1066.8]\\n [milia 7467.6]\\n [centimeter 0.01]\\n [meter 1.0]\\n [kilometer 1000.0]))\\n\\n(define (show u)\\n (printf \\\"1 ~s to:\\\\n\\\" u)\\n (define n (cadr (assq u units)))\\n (for ([u2 units] #:unless (eq? u (car u2)))\\n (displayln (~a (~a (car u2) #:width 10 #:align 'right) \\\": \\\"\\n (~r (/ n (cadr u2)) #:precision 4))))\\n (newline))\\n\\n(show 'meter)\\n(show 'milia)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"convert(1, 'meter');\\n\\nsay '*' x 40, \\\"\\\\n\\\";\\n\\nconvert(1, 'milia');\\n\\nsub convert (Real $magnitude, $unit) {\\n my %factor =\\n tochka => 0.000254,\\n liniya => 0.00254,\\n diuym => 0.0254,\\n vershok => 0.04445,\\n piad => 0.1778,\\n fut => 0.3048,\\n arshin => 0.7112,\\n sazhen => 2.1336,\\n versta => 1066.8,\\n milia => 7467.6,\\n centimeter => 0.01,\\n meter => 1.0,\\n kilometer => 1000.0,\\n ;\\n\\n my $meters = $magnitude * %factor{$unit.lc};\\n\\n say \\\"$magnitude $unit to:\\\\n\\\", '_' x 40;\\n\\n printf \\\"%10s: %s\\\\n\\\", $_, $meters / %factor{$_} unless $_ eq $unit.lc\\n for %factor.keys.sort:{ +%factor{$_} }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program converts a metric or old Russian length to various other lengths. */\\n numeric digits 200 /*lots of digits. */\\n /*──translation───*/\\n /*tip, top */ vershok = 22.492971 /*1.75 inch. */\\n /*palm, quarter */ piad = vershok / 4 /*(also) chetvert.*/\\n /*yard */ arshin = vershok / 16\\n /*fathom */ sazhen = arshin / 3\\n /*turn (of a plow)*/ verst = sazhen / 500 /*(also) a versta.*/\\n /*mile */ milia = verst / 1.5\\n /*inch */ diuym = arshin * 28\\n /*foot */ fut = diuym / 12 /*sounds like foot*/\\n /*line */ liniya = diuym * 10\\n /*point */ tochka = diuym * 100\\n\\nKM= 1000; CM=100 /*define a couple of metric multipliers*/\\nsw= linesize() -1 /*get the linesize (screen width) - 1.*/\\nparse arg N what _ __ /*obtain the user's input from the C.L.*/\\nif N=='' then call err 'no arguments specified.'\\nif \\\\datatype(N, 'N') then call err 'units not numeric: ' N\\nif _\\\\=='' then call err 'too many arguments specified: ' _ __\\nn= n / 1 /*normalize it (004──►4 7.──►7, etc.*/\\nif what=='' then what= 'meters'; whatU= what /*None specified? Then assume meters. */\\nupper whatU /*an uppercase version for ABBREV bif. */\\n select /* [↓] convert the length ───► meters.*/\\n when abbrev('METRES' , whatU ) |,\\n abbrev('METERS' , whatU ) then m= N\\n when abbrev('KILOMETRES' , whatU, 2 ) |,\\n abbrev('KILOMETERS' , whatU, 2 ) |,\\n abbrev('KMS' , whatU, ) then m= N * KM\\n when abbrev('CENTIMETRES', whatU, 2 ) |,\\n abbrev('CENTIMETERS', whatU, 2 ) |,\\n abbrev('CMS' , whatU, 2 ) then m= N / CM\\n when abbrev('ARSHINS' , whatU ) then m= N / arshin\\n when abbrev('DIUYM' , whatU ) then m= N / diuym\\n when abbrev('FUT' , whatU ) then m= N / fut\\n when abbrev('LINIYA' , whatU ) then m= N / liniya\\n when abbrev('PIADS' , whatU ) |,\\n abbrev('CHETVERTS' , whatU, 2 ) then m= N / piad\\n when abbrev('SAZHENS' , whatU ) then m= N / sazhen\\n when abbrev('TOCHKA' , whatU ) then m= N / tochka\\n when abbrev('VERSHOKS' , whatU, 5 ) then m= N / vershok\\n when abbrev('VERSTAS' , whatU, 5 ) |,\\n abbrev('VERSTS' , whatU, 2 ) then m= N / verst\\n when abbrev('MILIA' , whatU, 2 ) then m= N / milia\\n otherwise call err 'invalid measure name: ' what\\n end /*select*/\\n say centre('metric', sw, \\\"─\\\")\\ncall tell m / KM , 'kilometer'\\ncall tell m , 'meter'\\ncall tell m * CM , 'centimeter'\\n say centre('old Russian', sw, \\\"─\\\")\\ncall tell m * milia , 'milia'\\ncall tell m * verst , 'verst'\\ncall tell m * sazhen , 'sazhen'\\ncall tell m * arshin , 'arshin'\\ncall tell m * fut , 'fut'\\ncall tell m * piad , 'piad'\\ncall tell m * vershok , 'vershok'\\ncall tell m * diuym , 'diuym'\\ncall tell m * liniya , 'liniya'\\ncall tell m * tochka , 'tochka' /* ◄─── TELL shows eight decimal digits*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nerr: say center(' error ', sw % 2, \\\"*\\\"); do j=1 to arg(); say arg(j); end; exit 13\\ns: if arg(1)=1 then return arg(3); return word( arg(2) 's', 1) /*plurals.*/\\ntell: parse arg $; numeric digits 8; $= $ / 1; say right($, 40) arg(2)s($); return/*REXX program converts a metric or old Russian length to various other lengths. */\\n numeric digits 200 /*lots of digits. */\\n /*──translation───*/\\n /*tip, top */ vershok = 22.492971 /*1.75 inch. */\\n /*palm, quarter */ piad = vershok / 4 /*(also) chetvert.*/\\n /*yard */ arshin = vershok / 16\\n /*fathom */ sazhen = arshin / 3\\n /*turn (of a plow)*/ verst = sazhen / 500 /*(also) a versta.*/\\n /*mile */ milia = verst / 1.5\\n /*inch */ diuym = arshin * 28\\n /*foot */ fut = diuym / 12 /*sounds like foot*/\\n /*line */ liniya = diuym * 10\\n /*point */ tochka = diuym * 100\\n\\nKM= 1000; CM=100 /*define a couple of metric multipliers*/\\nsw= linesize() -1 /*get the linesize (screen width) - 1.*/\\nparse arg N what _ __ /*obtain the user's input from the C.L.*/\\nif N=='' then call err 'no arguments specified.'\\nif \\\\datatype(N, 'N') then call err 'units not numeric: ' N\\nif _\\\\=='' then call err 'too many arguments specified: ' _ __\\nn= n / 1 /*normalize it (004──►4 7.──►7, etc.*/\\nif what=='' then what= 'meters'; whatU= what /*None specified? Then assume meters. */\\nupper whatU /*an uppercase version for ABBREV bif. */\\n select /* [↓] convert the length ───► meters.*/\\n when abbrev('METRES' , whatU ) |,\\n abbrev('METERS' , whatU ) then m= N\\n when abbrev('KILOMETRES' , whatU, 2 ) |,\\n abbrev('KILOMETERS' , whatU, 2 ) |,\\n abbrev('KMS' , whatU, ) then m= N * KM\\n when abbrev('CENTIMETRES', whatU, 2 ) |,\\n abbrev('CENTIMETERS', whatU, 2 ) |,\\n abbrev('CMS' , whatU, 2 ) then m= N / CM\\n when abbrev('ARSHINS' , whatU ) then m= N / arshin\\n when abbrev('DIUYM' , whatU ) then m= N / diuym\\n when abbrev('FUT' , whatU ) then m= N / fut\\n when abbrev('LINIYA' , whatU ) then m= N / liniya\\n when abbrev('PIADS' , whatU ) |,\\n abbrev('CHETVERTS' , whatU, 2 ) then m= N / piad\\n when abbrev('SAZHENS' , whatU ) then m= N / sazhen\\n when abbrev('TOCHKA' , whatU ) then m= N / tochka\\n when abbrev('VERSHOKS' , whatU, 5 ) then m= N / vershok\\n when abbrev('VERSTAS' , whatU, 5 ) |,\\n abbrev('VERSTS' , whatU, 2 ) then m= N / verst\\n when abbrev('MILIA' , whatU, 2 ) then m= N / milia\\n otherwise call err 'invalid measure name: ' what\\n end /*select*/\\n say centre('metric', sw, \\\"─\\\")\\ncall tell m / KM , 'kilometer'\\ncall tell m , 'meter'\\ncall tell m * CM , 'centimeter'\\n say centre('old Russian', sw, \\\"─\\\")\\ncall tell m * milia , 'milia'\\ncall tell m * verst , 'verst'\\ncall tell m * sazhen , 'sazhen'\\ncall tell m * arshin , 'arshin'\\ncall tell m * fut , 'fut'\\ncall tell m * piad , 'piad'\\ncall tell m * vershok , 'vershok'\\ncall tell m * diuym , 'diuym'\\ncall tell m * liniya , 'liniya'\\ncall tell m * tochka , 'tochka' /* ◄─── TELL shows eight decimal digits*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nerr: say center(' error ', sw % 2, \\\"*\\\"); do j=1 to arg(); say arg(j); end; exit 13\\ns: if arg(1)=1 then return arg(3); return word( arg(2) 's', 1) /*plurals.*/\\ntell: parse arg $; numeric digits 8; $= $ / 1; say right($, 40) arg(2)s($); return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Old Russian measure of length\\n\\ndecimals(7)\\nunits = [\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\",\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\",\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"]\\n\\nconvs = [0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\\n 71.12, 213.36, 10668, 74676,\\n 1, 100, 10000]\\n\\nyn = \\\"y\\\"\\nunit = 1\\np = 1\\nwhile yn != \\\"n\\\"\\n for i = 1 to 13\\n see \\\"\\\" + i + \\\" \\\" + units[i] + nl\\n next\\n see nl\\n see \\\"please choose a unit 1 to 13 : \\\"\\n give unit\\n see nl\\n see \\\"now enter a value in that unit : \\\"\\n give value\\n see nl\\n see \\\"the equivalent in the remaining units is : \\\"\\n see nl\\n for i = 1 to 13\\n if i = unit\\n loop\\n ok\\n see \\\"\\\" + units[i] + \\\" : \\\" + (value * convs[number(unit)] / convs[i]) + nl\\n next\\n see nl\\n while yn = \\\"y\\\" or yn = \\\"n\\\"\\n see \\\"do another one y/n : \\\"\\n give yn\\n yn = lower(yn)\\n end\\nend\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"module Distances\\n\\n RATIOS =\\n {arshin: 0.7112, centimeter: 0.01, diuym: 0.0254,\\n fut: 0.3048, kilometer: 1000.0, liniya: 0.00254,\\n meter: 1.0, milia: 7467.6, piad: 0.1778,\\n sazhen: 2.1336, tochka: 0.000254, vershok: 0.04445,\\n versta: 1066.8}\\n\\n def self.method_missing(meth, arg)\\n from, to = meth.to_s.split(\\\"2\\\").map(&:to_sym)\\n raise NoMethodError, meth if ([from,to]-RATIOS.keys).size > 0\\n RATIOS[from] * arg / RATIOS[to]\\n end\\n\\n def self.print_others(name, num)\\n puts \\\"#{num} #{name} =\\\"\\n RATIOS.except(name.to_sym).each {|k,v| puts \\\"#{ (1.0 / v*num)} #{k}\\\" }\\n end\\nend\\n\\nDistances.print_others(\\\"meter\\\", 2)\\nputs\\np Distances.meter2centimeter(3)\\np Distances.arshin2meter(1)\\np Distances.versta2kilometer(20) # en Hoeperdepoep zat op de stoep\\n# 13*13 = 169 methods supported, but not:\\np Distances.mile2piad(1)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::env;\\nuse std::process;\\nuse std::collections::HashMap;\\n\\nfn main() {\\n\\n\\tlet units: HashMap<&str, f32> = [(\\\"arshin\\\",0.7112),(\\\"centimeter\\\",0.01),(\\\"diuym\\\",0.0254),(\\\"fut\\\",0.3048),(\\\"kilometer\\\",1000.0),(\\\"liniya\\\",0.00254),(\\\"meter\\\",1.0),(\\\"milia\\\",7467.6),(\\\"piad\\\",0.1778),(\\\"sazhen\\\",2.1336),(\\\"tochka\\\",0.000254),(\\\"vershok\\\",0.04445),(\\\"versta\\\",1066.8)].iter().cloned().collect();\\n\\n\\tlet args: Vec<String> = env::args().collect();\\n\\tif args.len() < 3 {\\n\\t\\teprintln!(\\\"A correct use is oldrus [amount] [unit].\\\");\\n\\t\\tprocess::exit(1);\\n\\t};\\n\\n\\tlet length_float;\\n\\tlength_float = match args[1].parse::<f32>() {\\n\\t\\tOk(length_float) => length_float,\\n\\t\\tErr(..) => 1 as f32,\\n\\t};\\n\\n\\tlet unit: &str = &args[2];\\n\\tif ! units.contains_key(unit) {\\n\\t\\tlet mut keys: Vec<&str> = Vec::new();\\n\\t\\tfor i in units.keys() {\\n\\t\\t\\tkeys.push(i)\\n\\t\\t};\\n\\t\\teprintln!(\\\"The correct units are: {}.\\\", keys.join(\\\", \\\"));\\n\\t\\tprocess::exit(1);\\n\\t};\\n\\n\\tprintln!(\\\"{} {} to:\\\", length_float, unit);\\n\\tfor (lunit, length) in &units {\\n\\t\\tprintln!(\\\"\\t{}: {:?}\\\", lunit, length_float * units.get(unit).unwrap() / length);\\n\\t};\\n\\n\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.collection.immutable.HashMap\\n\\nobject OldRussianLengths extends App {\\n\\n private def measures = HashMap(\\\"tochka\\\" -> 0.000254,\\n \\\"liniya\\\"-> 0.000254, \\\"centimeter\\\"-> 0.01, \\\"diuym\\\"-> 0.0254, \\\"vershok\\\"-> 0.04445,\\n \\\"piad\\\" -> 0.1778, \\\"fut\\\" -> 0.3048, \\\"arshin\\\"-> 0.7112, \\\"meter\\\" -> 1.0,\\n \\\"sazhen\\\"-> 2.1336, \\\"kilometer\\\" -> 1000.0, \\\"versta\\\"-> 1066.8, \\\"milia\\\" -> 7467.6\\n ).withDefaultValue(Double.NaN)\\n\\n if (args.length == 2 && args(0).matches(\\\"[+-]?\\\\\\\\d*(\\\\\\\\.\\\\\\\\d+)?\\\")) {\\n val inputVal = measures(args(1))\\n\\n def meters = args(0).toDouble * inputVal\\n\\n if (!java.lang.Double.isNaN(inputVal)) {\\n printf(\\\"%s %s to: %n%n\\\", args(0), args(1))\\n for (k <- measures) println(f\\\"${k._1}%10s: ${meters / k._2}%g\\\")\\n }\\n } else println(\\\"Please provide a number and unit on the command line.\\\")\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func convert (magnitude, unit) {\\n var factor = Hash(\\n tochka => 0.000254,\\n liniya => 0.00254,\\n diuym => 0.0254,\\n vershok => 0.04445,\\n piad => 0.1778,\\n fut => 0.3048,\\n arshin => 0.7112,\\n sazhen => 2.1336,\\n versta => 1066.8,\\n milia => 7467.6,\\n centimeter => 0.01,\\n meter => 1,\\n kilometer => 1000,\\n )\\n\\n var meters = (magnitude * factor{unit.lc})\\n say(\\\"#{magnitude} #{unit} to:\\\\n\\\", '-' * 40)\\n\\n for u,f in (factor.sort_by { |_,v| v }) {\\n printf(\\\"%10s: %s\\\\n\\\", u, meters / f) if (u != unit.lc)\\n }\\n}\\n\\nconvert(1, 'meter')\\nsay('')\\nconvert(1, 'milia')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require units\\n\\nset russian_units {\\n arshin 1.40607\\n centimeter 100\\n diuym 39.3701\\n fut 3.28084\\n kilometer 0.001\\n liniya 393.701\\n meter 1\\n milia 0.000133912\\n piad 5.6243\\n sazhen 0.468691\\n tochka 3937.01\\n vershok 22.4972\\n versta 0.000937383\\n}\\n\\nproc add_russian_units {} {\\n foreach {name factor} $::russian_units {\\n if {$name eq \\\"meter\\\"} continue\\n set factor [expr {1/$factor}]\\n units::new $name \\\"$factor meters\\\" ;# teach units about the new unit\\n }\\n}\\n\\nproc demo {} { ;# show some examples\\n foreach base {\\\"1 meter\\\" \\\"1 milia\\\"} {\\n puts \\\"$base to:\\\"\\n foreach {unit _} $::russian_units {\\n puts [format \\\" %-12s: %s\\\" $unit [units::convert $base $unit]]\\n }\\n puts \\\"\\\"\\n }\\n}\\n\\nadd_russian_units\\ndemo\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"% units::convert \\\"1 piad^2\\\" \\\"hectare\\\"\\n3.1612805858160454e-6\\n% units::convert \\\"100 km/h\\\" \\\"versta/minute\\\"\\n1.562305\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"DIM units$(1 TO 13)\\nFOR i = LBOUND(units$) TO UBOUND(units$)\\n READ units$(i)\\nNEXT i\\nDATA \\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\", \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\", \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"\\n\\n! all expressed in centimeters\\nDIM convs(1 TO 13)\\nFOR i = 1 TO 13\\n READ convs(i)\\nNEXT i\\nDATA 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48, 71.12, 213.36, 10668, 74676, 1, 100, 10000\\n\\nDO\\n CLEAR\\n PRINT\\n FOR i = 1 TO 13\\n PRINT USING \\\"## \\\": i;\\n PRINT units$(i)\\n NEXT i\\n PRINT\\n DO\\n INPUT prompt \\\"Please choose a unit 1 to 13 : \\\": unit\\n LOOP UNTIL unit >= 1 AND unit <= 13\\n PRINT\\n DO\\n INPUT prompt \\\"Now enter a value! in that unit : \\\": value\\n LOOP UNTIL value >= 0\\n PRINT\\n PRINT \\\"The equivalent in the remaining units is : \\\"\\n PRINT\\n FOR i = 1 TO 13\\n IF i <> unit THEN PRINT \\\" \\\"; units$(i), \\\" : \\\"; value*convs(unit)/convs(i)\\n NEXT i\\n PRINT\\n DO\\n INPUT prompt \\\"Do another one y/n : \\\": yn$\\n LET yn$ = LCASE$(yn$)\\n LOOP UNTIL yn$ = \\\"y\\\" OR yn$ = \\\"n\\\"\\nLOOP UNTIL yn$ = \\\"n\\\"\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import \\\"io\\\" for Stdin, Stdout\\nimport \\\"./fmt\\\" for Fmt\\nimport \\\"./str\\\" for Str\\n\\nvar units = [\\n \\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\",\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\",\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"\\n]\\n\\nvar convs = [\\n 0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\\n 71.12, 213.36, 10668, 74676,\\n 1, 100, 10000\\n]\\n\\nwhile (true) {\\n var i = 0\\n for (u in units) {\\n Fmt.print(\\\"$2d $s\\\", i+1, u)\\n i = i + 1\\n }\\n System.print()\\n var unit\\n while (true) {\\n System.write(\\\"Please choose a unit 1 to 13 : \\\")\\n Stdout.flush()\\n unit = Num.fromString(Stdin.readLine())\\n if (unit.type == Num && unit.isInteger && unit >= 1 && unit <= 13) break\\n }\\n unit = unit - 1\\n var value\\n while (true) {\\n System.write(\\\"Now enter a value in that unit : \\\")\\n Stdout.flush()\\n value = Num.fromString(Stdin.readLine())\\n if (value.type == Num && value >= 0) break\\n }\\n System.print(\\\"\\\\nThe equivalent in the remaining units is:\\\\n\\\")\\n i = 0\\n for (u in units) {\\n if (i != unit) Fmt.print(\\\" $10s : $15.8g\\\", u, value*convs[unit]/convs[i])\\n i = i + 1\\n }\\n System.print()\\n var yn = \\\"\\\"\\n while (yn != \\\"y\\\" && yn != \\\"n\\\") {\\n System.write(\\\"Do another one y/n : \\\")\\n Stdout.flush()\\n yn = Str.lower(Stdin.readLine())\\n }\\n if (yn == \\\"n\\\") break\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"PROGRAM\\t\\\"progname\\\"\\nVERSION\\t\\\"0.0000\\\"\\n\\nDECLARE FUNCTION Entry ()\\n\\nFUNCTION Entry ()\\n\\nDIM units$[14]\\nunits$[1] = \\\"tochka \\\" : units$[2] = \\\"liniya \\\" : units$[3] = \\\"dyuim \\\"\\nunits$[4] = \\\"vershok \\\" : units$[5] = \\\"piad \\\" : units$[6] = \\\"fut \\\"\\nunits$[7] = \\\"arshin \\\" : units$[8] = \\\"sazhen \\\" : units$[9] = \\\"versta \\\"\\nunits$[10] = \\\"milia \\\" : units$[11] = \\\"centimeter\\\" : units$[12] = \\\"meter \\\"\\nunits$[13] = \\\"kilometer \\\"\\n\\n' all expressed in centimeters\\nDIM convs![14]\\nconvs![1] = 0.0254 : convs![2] = 0.254 : convs![3] = 2.54\\nconvs![4] = 4.445 : convs![5] = 17.78 : convs![6] = 30.48\\nconvs![7] = 71.12 : convs![8] = 213.36 : convs![9] = 10668\\nconvs![10] = 74676 : convs![11] = 1 : convs![12] = 100 : convs![13] = 10000\\n\\nDO\\n PRINT\\n FOR i = 1 TO 13\\n PRINT FORMAT$(\\\"##\\\",i); \\\" \\\"; units$[i]\\n NEXT i\\n DO\\n unit = UBYTE(INLINE$(\\\"\\\\nPlease choose a unit 1 to 13 : \\\"))\\n LOOP UNTIL unit >= 1 AND unit <= 13\\n DO\\n value = USHORT(INLINE$(\\\"\\\\nNow enter a value in that unit : \\\"))\\n LOOP UNTIL value >= 0\\n\\n PRINT\\n PRINT \\\"The equivalent in the remaining units is : \\\"\\n PRINT\\n FOR i = 1 TO 13\\n IF i <> unit THEN PRINT \\\" \\\"; units$[i], \\\" : \\\"; value * convs![unit] / convs![i]\\n NEXT i\\n DO\\n yn$ = LCASE$(INLINE$(\\\"\\\\nDo another one y/n : \\\"))\\n LOOP UNTIL (yn$ = \\\"y\\\") OR (yn$ = \\\"n\\\")\\n LOOP UNTIL yn$ = \\\"n\\\"\\n\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"int Units, Unit, I, YN;\\nreal Convs, Value;\\n\\n[Units:= [\\\"tochka\\\", \\\"liniya\\\", \\\"dyuim\\\", \\\"vershok\\\", \\\"piad\\\", \\\"fut\\\",\\n \\\"arshin\\\", \\\"sazhen\\\", \\\"versta\\\", \\\"milia\\\",\\n \\\"centimeter\\\", \\\"meter\\\", \\\"kilometer\\\"];\\n\\nConvs:= [0.0254, 0.254, 2.54, 4.445, 17.78, 30.48,\\n 71.12, 213.36, 10668., 74676.,\\n 1., 100., 10000.];\\n\\nloop [for I:= 0 to 13-1 do\\n [if I+1 < 10 then ChOut(0, ^ ); IntOut(0, I+1);\\n ChOut(0, ^ ); Text(0, Units(I)); CrLf(0);\\n ];\\n CrLf(0);\\n loop [Text(0, \\\"Please choose a unit 1 to 13 : \\\");\\n OpenI(0);\\n Unit:= IntIn(0);\\n if Unit >= 1 and Unit <= 13 then quit;\\n ];\\n Unit:= Unit-1;\\n loop [Text(0, \\\"Now enter a value in that unit : \\\");\\n OpenI(0);\\n Value:= RlIn(0);\\n if Value >= 1. then quit;\\n ];\\n Text(0, \\\"^m^jThe equivalent in the remaining units is:^m^j^m^j\\\");\\n Format(7, 8);\\n for I:= 0 to 13-1 do\\n [if I # Unit then\\n [RlOut(0, Value*Convs(Unit)/Convs(I));\\n Text(0, \\\" : \\\"); Text(0, Units(I)); CrLf(0);\\n ];\\n ];\\n CrLf(0);\\n YN:= ^ ;\\n while YN # ^y and YN # ^n do\\n [Text(0, \\\"Do another one y/n : \\\");\\n OpenI(0);\\n YN:= ChIn(0) or $20;\\n ];\\n if YN = ^n then quit;\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dim units$(14)\\nunits$(1) = \\\"tochka\\\" : units$(2) = \\\"liniya\\\" : units$(3) = \\\"dyuim\\\"\\nunits$(4) = \\\"vershok\\\" : units$(5) = \\\"piad\\\" : units$(6) = \\\"fut\\\"\\nunits$(7) = \\\"arshin\\\" : units$(8) = \\\"sazhen\\\" : units$(9) = \\\"versta\\\"\\nunits$(10) = \\\"milia\\\" : units$(11) = \\\"centimeter\\\" : units$(12) = \\\"meter\\\"\\nunits$(13) = \\\"kilometer\\\"\\n\\n// all expressed in centimeters\\ndim convs(14)\\nconvs(1) = 0.0254 : convs(2) = 0.254 : convs(3) = 2.54\\nconvs(4) = 4.445 : convs(5) = 17.78 : convs(6) = 30.48\\nconvs(7) = 71.12 : convs(8) = 213.36 : convs(9) = 10668\\nconvs(10) = 74676 : convs(11) = 1 : convs(12) = 100 : convs(13) = 10000\\n\\nrepeat\\n clear screen\\n print\\n for i = 1 to arraysize(units$(), 1) - 1\\n print i using (\\\"##\\\"), \\\" \\\", units$(i)\\n next\\n print\\n repeat\\n input \\\"Please choose a unit 1 to 13 : \\\" unit\\n until unit >= 1 and unit <= 13\\n print\\n repeat\\n input \\\"Now enter a value in that unit : \\\" value\\n until value >= 0\\n\\n print \\\"\\\\nThe equivalent in the remaining units is : \\\\n\\\"\\n\\n for i = 1 to 13\\n if i = unit continue\\n print \\\" \\\", units$(i), \\\"\\\\t : \\\", value * convs(unit) / convs(i)\\n next\\n print\\n repeat\\n input \\\"Do another one y/n : \\\" yn$\\n yn$ = lower$(yn$)\\n until yn$ = \\\"y\\\" or yn$ = \\\"n\\\"\\nuntil yn$ = \\\"n\\\"\\nend\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Old-Russian-measure-of-length"}}},{"rowIdx":1461,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/OLE_automation\nnote: OLE Automation Client and Server\n","language":"00-META"},{"code":"[http://en.wikipedia.org/wiki/OLE_Automation OLE Automation] is an inter-process communication mechanism based on [http://en.wikipedia.org/wiki/Component_Object_Model Component Object Model] (COM) on Microsoft Windows. \n\n\n;Task:\nProvide an automation server implementing objects that can be accessed by a client running in a separate process. \n\nThe client gets a proxy-object that can call methods on the object. \n \nThe communication should be able to handle conversions of [http://en.wikipedia.org/wiki/Variant_type variants] to and from the native value types. \n<br><br>\n\n","language":"00-TASK"},{"code":"ahk := comobjactive(\"ahkdemo.ahk\")\nahk.hello(\"hello world\")\npy := ComObjActive(\"python.server\")\npy.write(\"hello\")\nreturn\n","language":"AutoHotkey"},{"code":"#Persistent\nCLSID_ThisScript := \"{38A3EB13-D0C4-478b-9720-4D0B2D361DB9}\"\nAPPID_ThisScript := \"ahkdemo.ahk\"\nfuncs := [\"aRegisterIDs\", \"aGetObject\", \"aCallFunc\", \"hello\"]\nserver := ahkComServer(CLSID_ThisScript, APPID_ThisScript, funcs)\nreturn\n\naRegisterIDs(this, CLSID, APPID){\nRegisterIDs(CLSID, APPID)\n}\n\nhello(this, message){\nmsgbox % message\n}\naGetObject(this, name){\nglobal\nreturn %name%\n}\n\naCallFunc(this, func, args){\nreturn %func%(args)\n}\n\n;; ahkcomserver()\nahkComServer(CLSID_ThisScript, APPID_ThisScript, funcs)\n{\nglobal serverReady\nserver := object()\n ; CLSID_ThisScript := \"{38A3EB13-D0C4-478b-9720-4D0B2D361DB9}\"\n ; APPID_ThisScript := \"Garglet.QueryServer\"\n\n RegisterIDs(CLSID_ThisScript, APPID_ThisScript)\nfor i, func in funcs\n{\nstr .= func . \", \"\n}\nstr := SubStr(str, 1, strlen(str) - 2)\n\n myObj := ComDispatch(\"\", str)\n; Expose it\n if !(hRemote := ComRemote(myObj, CLSID_ThisScript))\n {\n MsgBox, 16, %A_ScriptName%, Can't remote the object!\n ExitApp\n }\nserver.CLSID := CLSID_ThisScript\nserver.APPID := APPID_ThisScript\nserver.hRemote := hRemote\nserverReady := 1\n return server\n}\n\n#Include ComRemote.ahk\n#include lib\\ComDispTable.ahk\n#include lib\\ComDispatch.ahk\n#include lib\\ComVar.ahk\n","language":"AutoHotkey"},{"code":"package main\n\nimport (\n \"time\"\n ole \"github.com/go-ole/go-ole\"\n \"github.com/go-ole/go-ole/oleutil\"\n)\n\nfunc main() {\n ole.CoInitialize(0)\n unknown, _ := oleutil.CreateObject(\"Word.Application\")\n word, _ := unknown.QueryInterface(ole.IID_IDispatch)\n oleutil.PutProperty(word, \"Visible\", true)\n documents := oleutil.MustGetProperty(word, \"Documents\").ToIDispatch()\n document := oleutil.MustCallMethod(documents, \"Add\").ToIDispatch()\n content := oleutil.MustGetProperty(document, \"Content\").ToIDispatch()\n paragraphs := oleutil.MustGetProperty(content, \"Paragraphs\").ToIDispatch()\n paragraph := oleutil.MustCallMethod(paragraphs, \"Add\").ToIDispatch()\n rnge := oleutil.MustGetProperty(paragraph, \"Range\").ToIDispatch()\n oleutil.PutProperty(rnge, \"Text\", \"This is a Rosetta Code test document.\")\n\n time.Sleep(10 * time.Second)\n\n oleutil.PutProperty(document, \"Saved\", true)\n oleutil.CallMethod(document, \"Close\", false)\n oleutil.CallMethod(word, \"Quit\")\n word.Release()\n\n ole.CoUninitialize()\n}\n","language":"Go"},{"code":"Module CheckAutomation {\n ExitNow=false\n Declare WithEvents Alfa \"WORD.APPLICATION\"\n \\\\ minimize console\n Title \"Minimized- Waiting\", 0\n Wait 300\n Print \"ok\"\n With Alfa, \"Visible\", True\n Function ALFA_QUIT {\n Print \"Why you close Word?\"\n ExitNow=True\n }\n M=0\n Every 20 {\n If ExitNow then exit\n M++\n If M>500 then exit\n }\n Try {\n Method Alfa, \"QUIT\"\n }\n Declare Alfa Nothing\n if ExitNow then {\n Print format$(\"Finish {0:2} sec\", M/1000)\n } Else {\n Print \"Close Word manually\"\n }\n \\\\ show again console\n Title \"ok\"\n}\nCheckAutomation\n","language":"M2000-Interpreter"},{"code":"#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nimport win32com.client\nfrom win32com.server.util import wrap, unwrap\nfrom win32com.server.dispatcher import DefaultDebugDispatcher\nfrom ctypes import *\nimport commands\nimport pythoncom\nimport winerror\nfrom win32com.server.exception import Exception\n\nclsid = \"{55C2F76F-5136-4614-A397-12214CC011E5}\"\niid = pythoncom.MakeIID(clsid)\nappid = \"python.server\"\n\nclass VeryPermissive:\n def __init__(self):\n self.data = []\n self.handle = 0\n self.dobjects = {}\n def __del__(self):\n pythoncom.RevokeActiveObject(self.handle)\n def _dynamic_(self, name, lcid, wFlags, args):\n if wFlags & pythoncom.DISPATCH_METHOD:\n return getattr(self,name)(*args)\n if wFlags & pythoncom.DISPATCH_PROPERTYGET:\n try:\n # to avoid problems with byref param handling, tuple results are converted to lists.\n ret = self.__dict__[name]\n if type(ret)==type(()):\n ret = list(ret)\n return ret\n except KeyError: # Probably a method request.\n raise Exception(scode=winerror.DISP_E_MEMBERNOTFOUND)\n if wFlags & (pythoncom.DISPATCH_PROPERTYPUT | pythoncom.DISPATCH_PROPERTYPUTREF):\n setattr(self, name, args[0])\n return\n raise Exception(scode=winerror.E_INVALIDARG, desc=\"invalid wFlags\")\n def write(self, x):\n print x\n return 0\nimport win32com.server.util, win32com.server.policy\nchild = VeryPermissive()\nob = win32com.server.util.wrap(child, usePolicy=win32com.server.policy.DynamicPolicy)\ntry:\n handle = pythoncom.RegisterActiveObject(ob, iid, 0)\nexcept pythoncom.com_error, details:\n print \"Warning - could not register the object in the ROT:\", details\n handle = None\nchild.handle = handle\n\nahk = win32com.client.Dispatch(\"ahkdemo.ahk\")\nahk.aRegisterIDs(clsid, appid)\n# autohotkey.exe ahkside.ahk\n# python /c/Python26/Scripts/ipython.py -wthread -i pythonside.py\n# must use -wthread otherwise calling com client hangs\n","language":"Python"},{"code":"import win32com.client\nclient = win32com.client.Dispatch(\"python.server\")\nclient.write(\"hello world\")\n","language":"Python"},{"code":"/* OLE_automation.wren */\n\nclass Ole {\n foreign static coInitialize(p)\n foreign static coUninitialize()\n}\n\nclass OleUtil {\n static createObject(programID) {\n return IUnknown.new(programID)\n }\n\n foreign static putProperty(disp, name, param)\n foreign static mustGetProperty(disp, name)\n foreign static mustCallMethod(disp, name)\n foreign static mustCallMethod2(disp, name, param)\n}\n\nforeign class GUID {\n construct new(guid) {}\n}\n\nvar IID_DISPATCH = GUID.new(\"{00020400-0000-0000-C000-000000000046}\")\n\nforeign class IUnknown {\n construct new(programID) {}\n\n foreign queryInterface(iid, name)\n foreign static release(name)\n}\n\nclass Time {\n foreign static sleep(secs)\n}\n\nOle.coInitialize(0)\nvar unknown = OleUtil.createObject(\"Word.application\")\nvar word = unknown.queryInterface(IID_DISPATCH, \"word\")\nOleUtil.putProperty(word, \"Visible\", true)\nvar documents = OleUtil.mustGetProperty(word, \"Documents\")\nvar document = OleUtil.mustCallMethod(documents, \"Add\")\nvar content = OleUtil.mustGetProperty(document, \"Content\")\nvar paragraphs = OleUtil.mustGetProperty(content, \"Paragraphs\")\nvar paragraph = OleUtil.mustCallMethod(paragraphs, \"Add\")\nvar range = OleUtil.mustGetProperty(paragraph, \"Range\")\n\nOleUtil.putProperty(range, \"Text\", \"This is a Rosetta Code test document.\")\n\nTime.sleep(10)\n\nOleUtil.putProperty(document, \"Saved\", true)\nOleUtil.mustCallMethod2(document, \"Close\", false)\nOleUtil.mustCallMethod(word, \"Quit\")\nIUnknown.release(word)\n\nOle.coUninitialize()\n","language":"Wren"},{"code":"/* go run OLE_automation.go */\n\npackage main\n\nimport (\n ole \"github.com/go-ole/go-ole\"\n \"github.com/go-ole/go-ole/oleutil\"\n \"strings\"\n \"time\"\n wren \"github.com/crazyinfin8/WrenGo\"\n)\n\ntype any = interface{}\n\nvar dispMap = make(map[string]*ole.IDispatch)\n\nfunc coInitialize(vm *wren.VM, parameters []any) (any, error) {\n p := uintptr(parameters[1].(float64))\n ole.CoInitialize(p)\n return nil, nil\n}\n\nfunc coUninitialize(vm *wren.VM, parameters []any) (any, error) {\n ole.CoUninitialize()\n return nil, nil\n}\n\nfunc putProperty(vm *wren.VM, parameters []any) (any, error) {\n disp := dispMap[parameters[1].(string)]\n propName := parameters[2].(string)\n param := parameters[3]\n oleutil.PutProperty(disp, propName, param)\n return nil, nil\n}\n\nfunc mustGetProperty(vm *wren.VM, parameters []any) (any, error) {\n disp := dispMap[parameters[1].(string)]\n propName := parameters[2].(string)\n disp2 := oleutil.MustGetProperty(disp, propName).ToIDispatch()\n disp2Name := strings.ToLower(propName)\n dispMap[disp2Name] = disp2\n return disp2Name, nil\n}\n\nfunc mustCallMethod(vm *wren.VM, parameters []any) (any, error) {\n dispName := parameters[1].(string)\n disp := dispMap[dispName]\n methName := parameters[2].(string)\n disp2 := oleutil.MustCallMethod(disp, methName).ToIDispatch()\n disp2Name := dispName[0:len(dispName)-1]\n dispMap[disp2Name] = disp2\n return disp2Name, nil\n}\n\nfunc mustCallMethod2(vm *wren.VM, parameters []any) (any, error) {\n dispName := parameters[1].(string)\n disp := dispMap[dispName]\n methName := parameters[2].(string)\n param := parameters[3]\n disp2 := oleutil.MustCallMethod(disp, methName, param).ToIDispatch()\n disp2Name := dispName[0:len(dispName)-1]\n dispMap[disp2Name] = disp2\n return disp2Name, nil\n}\n\nfunc newGUID(vm *wren.VM, parameters []any) (any, error) {\n param := parameters[1].(string)\n guid := ole.NewGUID(param)\n return &guid, nil\n}\n\nfunc newIUnknown(vm *wren.VM, parameters []any) (any, error) {\n programID := parameters[1].(string)\n unknown, _ := oleutil.CreateObject(programID)\n return &unknown, nil\n}\n\nfunc queryInterface(vm *wren.VM, parameters []any) (any, error) {\n handle := parameters[0].(*wren.ForeignHandle)\n ifc, _ := handle.Get()\n unknown := ifc.(**ole.IUnknown)\n handle2 := parameters[1].(*wren.ForeignHandle)\n ifc2, _ := handle2.Get()\n guid := ifc2.(**ole.GUID)\n disp, _ := (*unknown).QueryInterface(*guid)\n name := parameters[2].(string)\n dispMap[name] = disp\n return name, nil\n}\n\nfunc release(vm *wren.VM, parameters []any) (any, error) {\n unknown := dispMap[parameters[1].(string)]\n unknown.Release()\n return nil, nil\n}\n\nfunc sleep(vm *wren.VM, parameters []any) (any, error) {\n secs := time.Duration(parameters[1].(float64))\n time.Sleep(secs * time.Second)\n return nil, nil\n}\n\nfunc main() {\n vm := wren.NewVM()\n fileName := \"OLE_automation.wren\"\n\n oleMethodMap := wren.MethodMap {\n \"static coInitialize(_)\" : coInitialize,\n \"static coUninitialize()\": coUninitialize,\n }\n\n oleUtilMethodMap := wren.MethodMap {\n \"static putProperty(_,_,_)\" : putProperty,\n \"static mustGetProperty(_,_)\" : mustGetProperty,\n \"static mustCallMethod(_,_)\" : mustCallMethod,\n \"static mustCallMethod2(_,_,_)\": mustCallMethod2,\n }\n\n iUnknownMethodMap := wren.MethodMap {\n \"queryInterface(_,_)\": queryInterface,\n \"static release(_)\" : release,\n }\n\n timeMethodMap := wren.MethodMap {\n\t\"static sleep(_)\": sleep,\n }\n\n classMap := wren.ClassMap {\n \"Ole\" : wren.NewClass(nil, nil, oleMethodMap),\n \"OleUtil\" : wren.NewClass(nil, nil, oleUtilMethodMap),\n \"GUID\" : wren.NewClass(newGUID, nil, nil),\n \"IUnknown\" : wren.NewClass(newIUnknown, nil, iUnknownMethodMap),\n \"Time\" : wren.NewClass(nil, nil, timeMethodMap),\n }\n\n module := wren.NewModule(classMap)\n vm.SetModule(fileName, module)\n vm.InterpretFile(fileName)\n vm.Free()\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/OLE_automation\\nnote: OLE Automation Client and Server\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[http://en.wikipedia.org/wiki/OLE_Automation OLE Automation] is an inter-process communication mechanism based on [http://en.wikipedia.org/wiki/Component_Object_Model Component Object Model] (COM) on Microsoft Windows. \\n\\n\\n;Task:\\nProvide an automation server implementing objects that can be accessed by a client running in a separate process. \\n\\nThe client gets a proxy-object that can call methods on the object. \\n \\nThe communication should be able to handle conversions of [http://en.wikipedia.org/wiki/Variant_type variants] to and from the native value types. \\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"ahk := comobjactive(\\\"ahkdemo.ahk\\\")\\nahk.hello(\\\"hello world\\\")\\npy := ComObjActive(\\\"python.server\\\")\\npy.write(\\\"hello\\\")\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#Persistent\\nCLSID_ThisScript := \\\"{38A3EB13-D0C4-478b-9720-4D0B2D361DB9}\\\"\\nAPPID_ThisScript := \\\"ahkdemo.ahk\\\"\\nfuncs := [\\\"aRegisterIDs\\\", \\\"aGetObject\\\", \\\"aCallFunc\\\", \\\"hello\\\"]\\nserver := ahkComServer(CLSID_ThisScript, APPID_ThisScript, funcs)\\nreturn\\n\\naRegisterIDs(this, CLSID, APPID){\\nRegisterIDs(CLSID, APPID)\\n}\\n\\nhello(this, message){\\nmsgbox % message\\n}\\naGetObject(this, name){\\nglobal\\nreturn %name%\\n}\\n\\naCallFunc(this, func, args){\\nreturn %func%(args)\\n}\\n\\n;; ahkcomserver()\\nahkComServer(CLSID_ThisScript, APPID_ThisScript, funcs)\\n{\\nglobal serverReady\\nserver := object()\\n ; CLSID_ThisScript := \\\"{38A3EB13-D0C4-478b-9720-4D0B2D361DB9}\\\"\\n ; APPID_ThisScript := \\\"Garglet.QueryServer\\\"\\n\\n RegisterIDs(CLSID_ThisScript, APPID_ThisScript)\\nfor i, func in funcs\\n{\\nstr .= func . \\\", \\\"\\n}\\nstr := SubStr(str, 1, strlen(str) - 2)\\n\\n myObj := ComDispatch(\\\"\\\", str)\\n; Expose it\\n if !(hRemote := ComRemote(myObj, CLSID_ThisScript))\\n {\\n MsgBox, 16, %A_ScriptName%, Can't remote the object!\\n ExitApp\\n }\\nserver.CLSID := CLSID_ThisScript\\nserver.APPID := APPID_ThisScript\\nserver.hRemote := hRemote\\nserverReady := 1\\n return server\\n}\\n\\n#Include ComRemote.ahk\\n#include lib\\\\ComDispTable.ahk\\n#include lib\\\\ComDispatch.ahk\\n#include lib\\\\ComVar.ahk\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"time\\\"\\n ole \\\"github.com/go-ole/go-ole\\\"\\n \\\"github.com/go-ole/go-ole/oleutil\\\"\\n)\\n\\nfunc main() {\\n ole.CoInitialize(0)\\n unknown, _ := oleutil.CreateObject(\\\"Word.Application\\\")\\n word, _ := unknown.QueryInterface(ole.IID_IDispatch)\\n oleutil.PutProperty(word, \\\"Visible\\\", true)\\n documents := oleutil.MustGetProperty(word, \\\"Documents\\\").ToIDispatch()\\n document := oleutil.MustCallMethod(documents, \\\"Add\\\").ToIDispatch()\\n content := oleutil.MustGetProperty(document, \\\"Content\\\").ToIDispatch()\\n paragraphs := oleutil.MustGetProperty(content, \\\"Paragraphs\\\").ToIDispatch()\\n paragraph := oleutil.MustCallMethod(paragraphs, \\\"Add\\\").ToIDispatch()\\n rnge := oleutil.MustGetProperty(paragraph, \\\"Range\\\").ToIDispatch()\\n oleutil.PutProperty(rnge, \\\"Text\\\", \\\"This is a Rosetta Code test document.\\\")\\n\\n time.Sleep(10 * time.Second)\\n\\n oleutil.PutProperty(document, \\\"Saved\\\", true)\\n oleutil.CallMethod(document, \\\"Close\\\", false)\\n oleutil.CallMethod(word, \\\"Quit\\\")\\n word.Release()\\n\\n ole.CoUninitialize()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"Module CheckAutomation {\\n ExitNow=false\\n Declare WithEvents Alfa \\\"WORD.APPLICATION\\\"\\n \\\\\\\\ minimize console\\n Title \\\"Minimized- Waiting\\\", 0\\n Wait 300\\n Print \\\"ok\\\"\\n With Alfa, \\\"Visible\\\", True\\n Function ALFA_QUIT {\\n Print \\\"Why you close Word?\\\"\\n ExitNow=True\\n }\\n M=0\\n Every 20 {\\n If ExitNow then exit\\n M++\\n If M>500 then exit\\n }\\n Try {\\n Method Alfa, \\\"QUIT\\\"\\n }\\n Declare Alfa Nothing\\n if ExitNow then {\\n Print format$(\\\"Finish {0:2} sec\\\", M/1000)\\n } Else {\\n Print \\\"Close Word manually\\\"\\n }\\n \\\\\\\\ show again console\\n Title \\\"ok\\\"\\n}\\nCheckAutomation\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\n# -*- coding: utf-8 -*-\\nimport win32com.client\\nfrom win32com.server.util import wrap, unwrap\\nfrom win32com.server.dispatcher import DefaultDebugDispatcher\\nfrom ctypes import *\\nimport commands\\nimport pythoncom\\nimport winerror\\nfrom win32com.server.exception import Exception\\n\\nclsid = \\\"{55C2F76F-5136-4614-A397-12214CC011E5}\\\"\\niid = pythoncom.MakeIID(clsid)\\nappid = \\\"python.server\\\"\\n\\nclass VeryPermissive:\\n def __init__(self):\\n self.data = []\\n self.handle = 0\\n self.dobjects = {}\\n def __del__(self):\\n pythoncom.RevokeActiveObject(self.handle)\\n def _dynamic_(self, name, lcid, wFlags, args):\\n if wFlags & pythoncom.DISPATCH_METHOD:\\n return getattr(self,name)(*args)\\n if wFlags & pythoncom.DISPATCH_PROPERTYGET:\\n try:\\n # to avoid problems with byref param handling, tuple results are converted to lists.\\n ret = self.__dict__[name]\\n if type(ret)==type(()):\\n ret = list(ret)\\n return ret\\n except KeyError: # Probably a method request.\\n raise Exception(scode=winerror.DISP_E_MEMBERNOTFOUND)\\n if wFlags & (pythoncom.DISPATCH_PROPERTYPUT | pythoncom.DISPATCH_PROPERTYPUTREF):\\n setattr(self, name, args[0])\\n return\\n raise Exception(scode=winerror.E_INVALIDARG, desc=\\\"invalid wFlags\\\")\\n def write(self, x):\\n print x\\n return 0\\nimport win32com.server.util, win32com.server.policy\\nchild = VeryPermissive()\\nob = win32com.server.util.wrap(child, usePolicy=win32com.server.policy.DynamicPolicy)\\ntry:\\n handle = pythoncom.RegisterActiveObject(ob, iid, 0)\\nexcept pythoncom.com_error, details:\\n print \\\"Warning - could not register the object in the ROT:\\\", details\\n handle = None\\nchild.handle = handle\\n\\nahk = win32com.client.Dispatch(\\\"ahkdemo.ahk\\\")\\nahk.aRegisterIDs(clsid, appid)\\n# autohotkey.exe ahkside.ahk\\n# python /c/Python26/Scripts/ipython.py -wthread -i pythonside.py\\n# must use -wthread otherwise calling com client hangs\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import win32com.client\\nclient = win32com.client.Dispatch(\\\"python.server\\\")\\nclient.write(\\\"hello world\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"/* OLE_automation.wren */\\n\\nclass Ole {\\n foreign static coInitialize(p)\\n foreign static coUninitialize()\\n}\\n\\nclass OleUtil {\\n static createObject(programID) {\\n return IUnknown.new(programID)\\n }\\n\\n foreign static putProperty(disp, name, param)\\n foreign static mustGetProperty(disp, name)\\n foreign static mustCallMethod(disp, name)\\n foreign static mustCallMethod2(disp, name, param)\\n}\\n\\nforeign class GUID {\\n construct new(guid) {}\\n}\\n\\nvar IID_DISPATCH = GUID.new(\\\"{00020400-0000-0000-C000-000000000046}\\\")\\n\\nforeign class IUnknown {\\n construct new(programID) {}\\n\\n foreign queryInterface(iid, name)\\n foreign static release(name)\\n}\\n\\nclass Time {\\n foreign static sleep(secs)\\n}\\n\\nOle.coInitialize(0)\\nvar unknown = OleUtil.createObject(\\\"Word.application\\\")\\nvar word = unknown.queryInterface(IID_DISPATCH, \\\"word\\\")\\nOleUtil.putProperty(word, \\\"Visible\\\", true)\\nvar documents = OleUtil.mustGetProperty(word, \\\"Documents\\\")\\nvar document = OleUtil.mustCallMethod(documents, \\\"Add\\\")\\nvar content = OleUtil.mustGetProperty(document, \\\"Content\\\")\\nvar paragraphs = OleUtil.mustGetProperty(content, \\\"Paragraphs\\\")\\nvar paragraph = OleUtil.mustCallMethod(paragraphs, \\\"Add\\\")\\nvar range = OleUtil.mustGetProperty(paragraph, \\\"Range\\\")\\n\\nOleUtil.putProperty(range, \\\"Text\\\", \\\"This is a Rosetta Code test document.\\\")\\n\\nTime.sleep(10)\\n\\nOleUtil.putProperty(document, \\\"Saved\\\", true)\\nOleUtil.mustCallMethod2(document, \\\"Close\\\", false)\\nOleUtil.mustCallMethod(word, \\\"Quit\\\")\\nIUnknown.release(word)\\n\\nOle.coUninitialize()\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"/* go run OLE_automation.go */\\n\\npackage main\\n\\nimport (\\n ole \\\"github.com/go-ole/go-ole\\\"\\n \\\"github.com/go-ole/go-ole/oleutil\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n wren \\\"github.com/crazyinfin8/WrenGo\\\"\\n)\\n\\ntype any = interface{}\\n\\nvar dispMap = make(map[string]*ole.IDispatch)\\n\\nfunc coInitialize(vm *wren.VM, parameters []any) (any, error) {\\n p := uintptr(parameters[1].(float64))\\n ole.CoInitialize(p)\\n return nil, nil\\n}\\n\\nfunc coUninitialize(vm *wren.VM, parameters []any) (any, error) {\\n ole.CoUninitialize()\\n return nil, nil\\n}\\n\\nfunc putProperty(vm *wren.VM, parameters []any) (any, error) {\\n disp := dispMap[parameters[1].(string)]\\n propName := parameters[2].(string)\\n param := parameters[3]\\n oleutil.PutProperty(disp, propName, param)\\n return nil, nil\\n}\\n\\nfunc mustGetProperty(vm *wren.VM, parameters []any) (any, error) {\\n disp := dispMap[parameters[1].(string)]\\n propName := parameters[2].(string)\\n disp2 := oleutil.MustGetProperty(disp, propName).ToIDispatch()\\n disp2Name := strings.ToLower(propName)\\n dispMap[disp2Name] = disp2\\n return disp2Name, nil\\n}\\n\\nfunc mustCallMethod(vm *wren.VM, parameters []any) (any, error) {\\n dispName := parameters[1].(string)\\n disp := dispMap[dispName]\\n methName := parameters[2].(string)\\n disp2 := oleutil.MustCallMethod(disp, methName).ToIDispatch()\\n disp2Name := dispName[0:len(dispName)-1]\\n dispMap[disp2Name] = disp2\\n return disp2Name, nil\\n}\\n\\nfunc mustCallMethod2(vm *wren.VM, parameters []any) (any, error) {\\n dispName := parameters[1].(string)\\n disp := dispMap[dispName]\\n methName := parameters[2].(string)\\n param := parameters[3]\\n disp2 := oleutil.MustCallMethod(disp, methName, param).ToIDispatch()\\n disp2Name := dispName[0:len(dispName)-1]\\n dispMap[disp2Name] = disp2\\n return disp2Name, nil\\n}\\n\\nfunc newGUID(vm *wren.VM, parameters []any) (any, error) {\\n param := parameters[1].(string)\\n guid := ole.NewGUID(param)\\n return &guid, nil\\n}\\n\\nfunc newIUnknown(vm *wren.VM, parameters []any) (any, error) {\\n programID := parameters[1].(string)\\n unknown, _ := oleutil.CreateObject(programID)\\n return &unknown, nil\\n}\\n\\nfunc queryInterface(vm *wren.VM, parameters []any) (any, error) {\\n handle := parameters[0].(*wren.ForeignHandle)\\n ifc, _ := handle.Get()\\n unknown := ifc.(**ole.IUnknown)\\n handle2 := parameters[1].(*wren.ForeignHandle)\\n ifc2, _ := handle2.Get()\\n guid := ifc2.(**ole.GUID)\\n disp, _ := (*unknown).QueryInterface(*guid)\\n name := parameters[2].(string)\\n dispMap[name] = disp\\n return name, nil\\n}\\n\\nfunc release(vm *wren.VM, parameters []any) (any, error) {\\n unknown := dispMap[parameters[1].(string)]\\n unknown.Release()\\n return nil, nil\\n}\\n\\nfunc sleep(vm *wren.VM, parameters []any) (any, error) {\\n secs := time.Duration(parameters[1].(float64))\\n time.Sleep(secs * time.Second)\\n return nil, nil\\n}\\n\\nfunc main() {\\n vm := wren.NewVM()\\n fileName := \\\"OLE_automation.wren\\\"\\n\\n oleMethodMap := wren.MethodMap {\\n \\\"static coInitialize(_)\\\" : coInitialize,\\n \\\"static coUninitialize()\\\": coUninitialize,\\n }\\n\\n oleUtilMethodMap := wren.MethodMap {\\n \\\"static putProperty(_,_,_)\\\" : putProperty,\\n \\\"static mustGetProperty(_,_)\\\" : mustGetProperty,\\n \\\"static mustCallMethod(_,_)\\\" : mustCallMethod,\\n \\\"static mustCallMethod2(_,_,_)\\\": mustCallMethod2,\\n }\\n\\n iUnknownMethodMap := wren.MethodMap {\\n \\\"queryInterface(_,_)\\\": queryInterface,\\n \\\"static release(_)\\\" : release,\\n }\\n\\n timeMethodMap := wren.MethodMap {\\n\\t\\\"static sleep(_)\\\": sleep,\\n }\\n\\n classMap := wren.ClassMap {\\n \\\"Ole\\\" : wren.NewClass(nil, nil, oleMethodMap),\\n \\\"OleUtil\\\" : wren.NewClass(nil, nil, oleUtilMethodMap),\\n \\\"GUID\\\" : wren.NewClass(newGUID, nil, nil),\\n \\\"IUnknown\\\" : wren.NewClass(newIUnknown, nil, iUnknownMethodMap),\\n \\\"Time\\\" : wren.NewClass(nil, nil, timeMethodMap),\\n }\\n\\n module := wren.NewModule(classMap)\\n vm.SetModule(fileName, module)\\n vm.InterpretFile(fileName)\\n vm.Free()\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"OLE-automation"}}},{"rowIdx":1462,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Cellular automata\nfrom: http://rosettacode.org/wiki/One-dimensional_cellular_automata\nnote: Games\n","language":"00-META"},{"code":"Assume an array of cells with an initial distribution of live and dead cells, \nand imaginary cells off the end of the array having fixed values.\n\nCells in the next generation of the array are calculated based on the value of the cell and its left and right nearest neighbours in the current generation.\n\nIf, in the following table, a live cell is represented by 1 and a dead cell by 0 then to generate the value of the cell at a particular index in the array of cellular values you use the following table:\n\n 0'''0'''0 -> 0 # \n 0'''0'''1 -> 0 #\n 0'''1'''0 -> 0 # Dies without enough neighbours\n 0'''1'''1 -> 1 # Needs one neighbour to survive\n 1'''0'''0 -> 0 #\n 1'''0'''1 -> 1 # Two neighbours giving birth\n 1'''1'''0 -> 1 # Needs one neighbour to survive\n 1'''1'''1 -> 0 # Starved to death.\n\n;Related tasks:\n* [[Elementary_cellular_automaton|Elementary cellular automaton]]\n\n","language":"00-TASK"},{"code":"V gen = ‘_###_##_#_#_#_#__#__’.map(ch -> Int(ch == ‘#’))\nL(n) 10\n print(gen.map(cell -> (I cell != 0 {‘#’} E ‘_’)).join(‘’))\n gen = [0] [+] gen [+] [0]\n gen = (0 .< gen.len - 2).map(m -> Int(sum(:gen[m .+ 3]) == 2))\n","language":"11l"},{"code":"\\ one-dimensional automaton\n\n\\ direct map of input state to output state:\n{\n \" \" : 32,\n \" #\" : 32,\n \" # \" : 32,\n \" ##\" : 35,\n \"# \" : 32,\n \"# #\" : 35,\n \"## \" : 35,\n \"###\" : 32,\n} var, lifemap\n\n: transition \\ s ix (r:s') -- (r:s')\n >r dup r@ n:1- 3 s:slice\n lifemap @ swap caseof\n r> swap r@ -rot s:! >r ;\n\n\\ run over 'state' and generate new state\n: gen \\ s -- s'\n clone >r\n dup s:len 2 n:-\n ' transition 1 rot loop\n drop r> ;\n\n: life \\ s -- s'\n dup . cr gen ;\n\n\" ### ## # # # # # \" ' life 10 times\nbye\n","language":"8th"},{"code":"(defun rc-step-r (cells)\n (if (endp (rest cells))\n nil\n (cons (if (second cells)\n (xor (first cells) (third cells))\n (and (first cells) (third cells)))\n (rc-step-r (rest cells)))))\n\n(defun rc-step (cells)\n (cons (and (first cells) (second cells))\n (rc-step-r cells)))\n\n(defun rc-steps-r (cells n prev)\n (declare (xargs :measure (nfix n)))\n (if (or (zp n) (equal cells prev))\n nil\n (let ((new (rc-step cells)))\n (cons new (rc-steps-r new (1- n) cells)))))\n\n(defun rc-steps (cells n)\n (cons cells (rc-steps-r cells n nil)))\n\n(defun pretty-row (row)\n (if (endp row)\n (cw \"~%\")\n (prog2$ (cw (if (first row) \"#\" \"-\"))\n (pretty-row (rest row)))))\n\n(defun pretty-output (out)\n (if (endp out)\n nil\n (prog2$ (pretty-row (first out))\n (pretty-output (rest out)))))\n","language":"ACL2"},{"code":"CHAR FUNC CalcCell(CHAR prev,curr,next)\n IF prev='. AND curr='# AND next='# THEN\n RETURN ('#)\n ELSEIF prev='# AND curr='. AND next='# THEN\n RETURN ('#)\n ELSEIF prev='# AND curr='# AND next='. THEN\n RETURN ('#)\n FI\nRETURN ('.)\n\nPROC NextGeneration(CHAR ARRAY s)\n BYTE i\n CHAR prev,curr,next\n\n IF s(0)<4 THEN RETURN FI\n prev=s(1) curr=s(2) next=s(3)\n i=2\n DO\n s(i)=CalcCell(prev,curr,next)\n i==+1\n IF i=s(0) THEN EXIT FI\n prev=curr curr=next next=s(i+1)\n OD\nRETURN\n\nPROC Main()\n DEFINE MAXGEN=\"9\"\n CHAR ARRAY s=\".###.##.#.#.#.#..#..\"\n BYTE i\n\n FOR i=0 TO MAXGEN\n DO\n PrintF(\"Generation %I: %S%E\",i,s)\n IF i<MAXGEN THEN\n NextGeneration(s)\n FI\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Cellular_Automata is\n type Petri_Dish is array (Positive range <>) of Boolean;\n\n procedure Step (Culture : in out Petri_Dish) is\n Left : Boolean := False;\n This : Boolean;\n Right : Boolean;\n begin\n for Index in Culture'First..Culture'Last - 1 loop\n Right := Culture (Index + 1);\n This := Culture (Index);\n Culture (Index) := (This and (Left xor Right)) or (not This and Left and Right);\n Left := This;\n end loop;\n Culture (Culture'Last) := Culture (Culture'Last) and not Left;\n end Step;\n\n procedure Put (Culture : Petri_Dish) is\n begin\n for Index in Culture'Range loop\n if Culture (Index) then\n Put ('#');\n else\n Put ('_');\n end if;\n end loop;\n end Put;\n\n Culture : Petri_Dish :=\n ( False, True, True, True, False, True, True, False, True, False, True,\n False, True, False, True, False, False, True, False, False\n );\nbegin\n for Generation in 0..9 loop\n Put (\"Generation\" & Integer'Image (Generation) & ' ');\n Put (Culture);\n New_Line;\n Step (Culture);\n end loop;\nend Cellular_Automata;\n","language":"Ada"},{"code":"INT stop generation = 9;\nINT universe width = 20;\nFORMAT alive or dead = $b(\"#\",\"_\")$;\n\nBITS universe := 2r01110110101010100100;\n # universe := BIN ( ENTIER ( random * max int ) ); #\nINT upb universe = bits width;\nINT lwb universe = bits width - universe width + 1;\n\nPROC couple = (BITS parent, INT lwb, upb)BOOL: (\n SHORT INT sum := 0;\n FOR bit FROM lwb TO upb DO\n sum +:= ABS (bit ELEM parent)\n OD;\n sum = 2\n);\n\nFOR generation FROM 0 WHILE\n printf(($\"Generation \"d\": \"$, generation,\n $f(alive or dead)$, []BOOL(universe)[lwb universe:upb universe],\n $l$));\n# WHILE # generation < stop generation DO\n BITS next universe := 2r0;\n\n # process the first event horizon manually #\n IF couple(universe,lwb universe,lwb universe + 1) THEN\n next universe := 2r10\n FI;\n\n # process the middle kingdom in a loop #\n FOR bit FROM lwb universe + 1 TO upb universe - 1 DO\n IF couple(universe,bit-1,bit+1) THEN\n next universe := next universe OR 2r1\n FI;\n next universe := next universe SHL 1\n OD;\n\n # process the last event horizon manually #\n IF couple(universe, upb universe - 1, upb universe) THEN\n next universe := next universe OR 2r1\n FI;\n universe := next universe\nOD\n","language":"ALGOL-68"},{"code":"INT stop generation = 9;\nINT upb universe = 20;\nFORMAT alive or dead = $b(\"#\",\"_\")$;\n\nBITS bits universe := 2r01110110101010100100;\n # bits universe := BIN ( ENTIER ( random * max int ) ); #\n[upb universe] BOOL universe := []BOOL(bits universe)[bits width - upb universe + 1:];\n\nPROC couple = (REF[]BOOL parent)BOOL: (\n SHORT INT sum := 0;\n FOR bit FROM LWB parent TO UPB parent DO\n sum +:= ABS (parent[bit])\n OD;\n sum = 2\n);\n\nFOR generation FROM 0 WHILE\n printf(($\"Generation \"d\": \"$, generation,\n $f(alive or dead)$, universe,\n $l$));\n# WHILE # generation < stop generation DO\n [UPB universe]BOOL next universe;\n\n # process the first event horizon manually #\n next universe[1] := couple(universe[:2]);\n\n # process the middle kingdom in a loop #\n FOR bit FROM LWB universe + 1 TO UPB universe - 1 DO\n next universe[bit] := couple(universe[bit-1:bit+1])\n OD;\n\n # process the last event horizon manually #\n next universe[UPB universe] := couple(universe[UPB universe - 1: ]);\n universe := next universe\nOD\n","language":"ALGOL-68"},{"code":"begin\n string(20) state;\n string(20) nextState;\n integer generation;\n generation := 0;\n state := \"_###_##_#_#_#_#__#__\";\n while begin\n write( i_w := 1, s_w := 1, \"Generation \", generation, state );\n nextState := \"____________________\";\n for cPos := 1 until 18 do begin\n string(3) curr;\n curr := state( cPos - 1 // 3 );\n nextState( cPos // 1 ) := if curr = \"_##\" or curr = \"#_#\" or curr = \"##_\" then \"#\" else \"_\"\n end for_cPos ;\n ( state not = nextState )\n end do begin\n state := nextState;\n generation := generation + 1\n end while_not_finished\nend.\n","language":"ALGOL-W"},{"code":"#include <basico.h>\n\nalgoritmo\n tamaño de pila 65\n x = 0\n enlistar (0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,0,\\\n 1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,\\\n 1,1,0,0,0,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0) mover a 'x'\n x2 = x\n decimales '0', token.separador (\"\")\n iterar para ( k=1, #(k<=15), ++k )\n imprimir ' #(utf8(\"Generación #\")),k, \"\\t\", x, NL '\n iterar para ( j=2, #(j<60), ++j )\n #(x2[j] = 0)\n cuando ( #( (x[j-1]+x[j]+x[j+1])==2 ) ){\n #(x2[j]=1)\n }\n siguiente\n x = x2\n siguiente\nterminar\n","language":"Amazing-Hopper"},{"code":"#include <basico.h>\n\nalgoritmo\n x={}\n '0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,0' anidar en lista 'x'\n '1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0' anidar en lista 'x'\n '1,1,0,0,0,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0' anidar en lista 'x'\n\n x2 = x, k=10\n decimales '0', token.separador (\"\")\n iterar\n imprimir ' #(utf8(\"Generación #\")), #(11-k), \"\\t\", x, NL '\n iterar para ( j=2, #(j<60), ++j )\n #( x2[j] = ((x[j-1]+x[j]+x[j+1])==2) )\n siguiente\n x = x2\n mientras ' k-- '\nterminar\n","language":"Amazing-Hopper"},{"code":"100 HOME\n110 n = 10\n120 READ w : DIM x(w+1),x2(w+1) : FOR i = 1 TO w : READ x(i) : NEXT\n130 FOR k = 1 TO n\n140 FOR j = 1 TO w\n150 IF x(j) THEN PRINT \"#\";\n155 IF NOT x(j) THEN PRINT \"_\";\n160 IF x(j-1)+x(j)+x(j+1) = 2 THEN x2(j) = 1\n165 IF x(j-1)+x(j)+x(j+1) <> 2 THEN x2(j) = 0\n170 NEXT : PRINT\n180 FOR j = 1 TO w : x(j) = x2(j) : NEXT\n190 NEXT\n200 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\n","language":"Applesoft-BASIC"},{"code":"evolve: function [arr][\n ary: [0] ++ arr ++ [0]\n ret: new []\n loop 1..(size ary)-2 'i [\n a: ary\\[i-1]\n b: ary\\[i]\n c: ary\\[i+1]\n\n if? 2 = a+b+c -> 'ret ++ 1\n else -> 'ret ++ 0\n ]\n ret\n]\n\nprintIt: function [arr][\n print replace replace join map arr 'n -> to :string n \"0\" \"_\" \"1\" \"#\"\n]\n\narr: [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]\nprintIt arr\n\nnewGen: evolve arr\nwhile [newGen <> arr][\n arr: newGen\n newGen: evolve arr\n printIt newGen\n]\n","language":"Arturo"},{"code":"n := 22, n1 := n+1, v0 := v%n1% := 0 ; set grid dimensions, and fixed cells\n\nLoop % n { ; draw a line of checkboxes\n v%A_Index% := 0\n Gui Add, CheckBox, % \"y10 w17 h17 gCheck x\" A_Index*17-5 \" vv\" A_Index\n}\nGui Add, Button, x+5 y6, step ; button to step to next generation\nGui Show\nReturn\n\nCheck:\n GuiControlGet %A_GuiControl% ; set cells by the mouse\nReturn\n\nButtonStep: ; move to next generation\n Loop % n\n i := A_Index-1, j := i+2, w%A_Index% := v%i%+v%A_Index%+v%j% = 2\n Loop % n\n GuiControl,,v%A_Index%, % v%A_Index% := w%A_Index%\nReturn\n\nGuiClose: ; exit when GUI is closed\nExitApp\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\nBEGIN {\n edge = 1\n ruleNum = 104 # 01101000\n maxGen = 9\n mark = \"@\"\n space = \".\"\n initialState = \".@@@.@@.@.@.@.@..@..\"\n width = length(initialState)\n delete rules\n delete state\n\n initRules(ruleNum)\n initState(initialState, mark)\n for (g = 0; g < maxGen; g++) {\n showState(g, mark, space)\n nextState()\n }\n showState(g, mark, space)\n}\n\nfunction nextState( newState, i, n) {\n delete newState\n for (i = 1; i < width - 1; i++) {\n n = getRuleNum(i)\n newState[i] = rules[n]\n }\n for (i = 0; i < width; i++) { # copy, can't assign arrays\n state[i] = newState[i]\n }\n}\n\n# Convert a three cell neighborhood from binary to decimal\nfunction getRuleNum(i, rn, j, p) {\n rn = 0\n for (j = -1; j < 2; j++) {\n p = i + j\n rn = rn * 2 + (p < 0 || p > width ? edge : state[p])\n }\n return rn\n}\n\nfunction showState(gen, mark, space, i) {\n printf(\"%3d: \", gen)\n for (i = 1; i <= width; i++) {\n printf(\" %s\", (state[i] ? mark : space))\n }\n print \"\"\n}\n\n# Make state transition lookup table from rule number.\nfunction initRules(ruleNum, i, r) {\n delete rules;\n r = ruleNum\n for (i = 0; i < 8; i++) {\n rules[i] = r % 2\n r = int(r / 2)\n }\n}\n\nfunction initState(init, mark, i) {\n delete state\n srand()\n for (i = 0; i < width; i++) {\n state[i] = (substr(init, i, 1) == mark ? 1 : 0) # Given an initial string.\n # state[int(width/2)] = '@' # middle cell\n # state[i] = int(rand() * 100) < 30 ? 1 : 0 # 30% of cells\n }\n}\n","language":"AWK"},{"code":"Another new solution (twice size as previous solution) :\ncat automata.awk :\n\n#!/usr/local/bin/gawk -f\n\n# User defined functions\nfunction ASCII_to_Binary(str_) {\n\tgsub(\"_\",\"0\",str_); gsub(\"@\",\"1\",str_)\n\treturn str_\n}\n\nfunction Binary_to_ASCII(bit_) {\n\tgsub(\"0\",\"_\",bit_); gsub(\"1\",\"@\",bit_)\n\treturn bit_\n}\n\nfunction automate(b1,b2,b3) {\n\ta = and(b1,b2,b3)\n\tb = or(b1,b2,b3)\n\tc = xor(b1,b2,b3)\n\td = a + b + c\n\treturn d == 1 ? 1 : 0\n}\n\n# For each line in input do\n{\nstr_ = $0\ngen = 0\ntaille = length(str_)\nprint \"0: \" str_\ndo {\n\tgen ? str_previous = str_ : str_previous = \"\"\n\tgen += 1\n\tstr_ = ASCII_to_Binary(str_)\n\tsplit(str_,tab,\"\")\n\tstr_ = and(tab[1],tab[2])\n\tfor (i=1; i<=taille-2; i++) {\n\t\tstr_ = str_ automate(tab[i],tab[i+1],tab[i+2])\n\t\t}\n\tstr_ = str_ and(tab[taille-1],tab[taille])\n\tprint gen \": \" Binary_to_ASCII(str_)\n } while (str_ != str_previous)\n}\n","language":"AWK"},{"code":"arraybase 1\ndim start = {0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0}\ndim sgtes(start[?]+1)\n\nfor k = 0 to 9\n print \"Generation \"; k; \": \";\n for j = 0 to start[?]-1\n\n if start[j] then print \"#\"; else print \"_\";\n if start[j-1] + start[j] + start[j+1] = 2 then sgtes[j] = 1 else sgtes[j] = 0\n next j\n print\n for j = 0 to start[?]-1\n start[j] = sgtes[j]\n next j\nnext k\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\n::THE MAIN THING\ncall :one-dca __###__##_#_##_###__######_###_#####_#__##_____#_#_#######__\npause>nul\nexit /b\n::/THE MAIN THING\n\n::THE PROCESSOR\n:one-dca\necho.&set numchars=0&set proc=%1\n\n::COUNT THE NUMBER OF CHARS\nset bef=%proc:_=_,%\nset bef=%bef:#=#,%\nset bef=%bef:~0,-1%\nfor %%x in (%bef%) do set /a numchars+=1\n\nset /a endchar=%numchars%-1\n:nextgen\necho. ^| %proc% ^|\nset currnum=0\nset newgen=\n:editeachchar\n\tset neigh=0\n\tset /a testnum2=%currnum%+1\n\tset /a testnum1=%currnum%-1\n\tif %currnum%==%endchar% (\n\t\tset testchar=!proc:~%testnum1%,1!\n\t\tif !testchar!==# (set neigh=1)\n\t) else (\n\t\tif %currnum%==0 (\n\t\t\tset testchar=%proc:~1,1%\n\t\t\tif !testchar!==# (set neigh=1)\n\t\t) else (\n\t\t\tset testchar1=!proc:~%testnum1%,1!\n\t\t\tset testchar2=!proc:~%testnum2%,1!\n\t\t\tif !testchar1!==# (set /a neigh+=1)\n\t\t\tif !testchar2!==# (set /a neigh+=1)\n\t\t)\n\t)\n\tif %neigh%==0 (set newgen=%newgen%_)\n\tif %neigh%==1 (\n\t\tset testchar=!proc:~%currnum%,1!\n\t\tset newgen=%newgen%!testchar!\n\t)\n\tif %neigh%==2 (\n\t\tset testchar=!proc:~%currnum%,1!\n\t\tif !testchar!==# (set newgen=%newgen%_) else (set newgen=%newgen%#)\n\t)\nif %currnum%==%endchar% (goto :cond) else (set /a currnum+=1&goto :editeachchar)\n\n:cond\nif %proc%==%newgen% (echo.&echo ...The sample is now stable.&goto :EOF)\nset proc=%newgen%\ngoto :nextgen\n::/THE (LLLLLLOOOOOOOOOOOOONNNNNNNNGGGGGG.....) PROCESSOR\n","language":"Batch-File"},{"code":" DIM rule$(7)\n rule$() = \"0\", \"0\", \"0\", \"1\", \"0\", \"1\", \"1\", \"0\"\n\n now$ = \"01110110101010100100\"\n\n FOR generation% = 0 TO 9\n PRINT \"Generation \" ; generation% \":\", now$\n next$ = \"\"\n FOR cell% = 1 TO LEN(now$)\n next$ += rule$(EVAL(\"%\"+MID$(\"0\"+now$+\"0\", cell%, 3)))\n NEXT cell%\n SWAP now$, next$\n NEXT generation%\n","language":"BBC-BASIC"},{"code":"v\n \" !!! !! ! ! ! ! ! \" ,*25 <v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n \" \" ,*25,,,,,,,,,,,,,,,,,,,,<v\n v$< @,*25,,,,,,,,,,,,,,,,,,,,<\n>110p3>:1-10gg\" \"-4* \\:10gg\" \"-2* \\:1+10gg\" \"-\\:54*1+`#v_20p++ :2`#v_ >:4`#v_> >$\" \"v\n >:3`#^_v>:6`|\n ^ >$$$$320p10g1+:9`v > >$\"!\"> 20g10g1+p 20g1+:20p\n ^ v_10p10g\n > ^\n","language":"Befunge"},{"code":" ( ( evolve\n = n z\n . @( !arg\n : %?n ? @?z\n : ?\n ( ( ( 000\n | 001\n | 010\n | 100\n | 111\n )\n & 0 !n:?n\n | (011|101|110)\n & 1 !n:?n\n )\n & ~`\n )\n ?\n )\n | rev$(str$(!z !n))\n )\n & 11101101010101001001:?S\n & :?seen\n & whl\n ' ( ~(!seen:? !S ?)\n & out$!S\n & !S !seen:?seen\n & evolve$!S:?S\n )\n );\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <string.h>\n\nchar trans[] = \"___#_##_\";\n\n#define v(i) (cell[i] != '_')\nint evolve(char cell[], char backup[], int len)\n{\n\tint i, diff = 0;\n\n\tfor (i = 0; i < len; i++) {\n\t\t/* use left, self, right as binary number bits for table index */\n\t\tbackup[i] = trans[ v(i-1) * 4 + v(i) * 2 + v(i + 1) ];\n\t\tdiff += (backup[i] != cell[i]);\n\t}\n\n\tstrcpy(cell, backup);\n\treturn diff;\n}\n\nint main()\n{\n\tchar\tc[] = \"_###_##_#_#_#_#__#__\\n\",\n\t\tb[] = \"____________________\\n\";\n\n\tdo { printf(c + 1); } while (evolve(c + 1, b + 1, sizeof(c) - 3));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n\nchar trans[] = \"___#_##_\";\n\nint evolve(char c[], int len)\n{\n\tint i, diff = 0;\n#\tdefine v(i) ((c[i] & 15) == 1)\n#\tdefine each for (i = 0; i < len; i++)\n\n\teach c[i] = (c[i] == '#');\n\teach c[i] |= (trans[(v(i-1)*4 + v(i)*2 + v(i+1))] == '#') << 4;\n\teach diff += (c[i] & 0xf) ^ (c[i] >> 4);\n\teach c[i] = (c[i] >> 4) ? '#' : '_';\n\n#\tundef each\n#\tundef v\n\treturn diff;\n}\n\nint main()\n{\n\tchar c[] = \"_###_##_#_#_#_#__#__\\n\";\n\n\tdo { printf(c + 1); } while (evolve(c + 1, sizeof(c) - 3));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <bitset>\n#include <string>\n\nconst int ArraySize = 20;\nconst int NumGenerations = 10;\nconst std::string Initial = \"0011101101010101001000\";\n\nint main()\n{\n // + 2 for the fixed ends of the array\n std::bitset<ArraySize + 2> array(Initial);\n\n for(int j = 0; j < NumGenerations; ++j)\n {\n std::bitset<ArraySize + 2> tmpArray(array);\n for(int i = ArraySize; i >= 1 ; --i)\n {\n if(array[i])\n std::cout << \"#\";\n else\n std::cout << \"_\";\n int val = (int)array[i-1] << 2 | (int)array[i] << 1 | (int)array[i+1];\n tmpArray[i] = (val == 3 || val == 5 || val == 6);\n }\n array = tmpArray;\n std::cout << std::endl;\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace prog\n{\n\tclass MainClass\n\t{\t\n\t\tconst int n_iter = 10;\n\t\tstatic int[] f = { 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0 };\n\t\t\n\t\tpublic static void Main (string[] args)\n\t\t{\n\t\t\tfor( int i=0; i<f.Length; i++ )\n\t\t\t\tConsole.Write( f[i]==0 ? \"-\" : \"#\" );\n\t\t\tConsole.WriteLine(\"\");\t\t\t\n\t\t\t\n\t\t\tint[] g = new int[f.Length];\n\t\t\tfor( int n=n_iter; n!=0; n-- )\n\t\t\t{\n\t\t\t\tfor( int i=1; i<f.Length-1; i++ )\n\t\t\t\t{\n\t\t\t\t\tif ( (f[i-1] ^ f[i+1]) == 1 ) g[i] = f[i];\n\t\t\t\t\telse if ( f[i] == 0 && (f[i-1] & f[i+1]) == 1 ) g[i] = 1;\n\t\t\t\t\telse g[i] = 0;\n\t\t\t\t}\n\t\t\t\tg[0] = ( (f[0] & f[1]) == 1 ) ? 1 : 0;\n\t\t\t\tg[g.Length-1] = ( (f[f.Length-1] & f[f.Length-2]) == 1 ) ? 1 : 0;\n\t\t\t\t\n\t\t\t\tint[] tmp = f;\n\t\t\t\tf = g;\n\t\t\t\tg = tmp;\n\t\t\t\t\n\t\t\t\tfor( int i=0; i<f.Length; i++ )\n\t\t\t\t\tConsole.Write( f[i]==0 ? \"-\" : \"#\" );\n\t\t\t\tConsole.WriteLine(\"\");\n\t\t\t}\t\t\t\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"shared abstract class Cell(character) of alive | dead {\n\tshared Character character;\n\tstring => character.string;\n\tshared formal Cell opposite;\n}\n\nshared object alive extends Cell('#') {\n\topposite => dead;\n}\nshared object dead extends Cell('_') {\n\topposite => alive;\n}\n\nshared Map<Character, Cell> cellsByCharacter = map { for (cell in `Cell`.caseValues) cell.character->cell };\n\nshared class Automata1D({Cell*} initialCells) {\n\t\n\t\n\tvalue permanentFirstCell = initialCells.first else dead;\n\tvalue permanentLastCell = initialCells.last else dead;\n\t\n\tvalue cells = Array { *initialCells.rest.exceptLast };\n\t\n\tshared Boolean evolve() {\n\t\t\n\t\tvalue newCells = Array {\n\t\t\tfor (index->cell in cells.indexed)\n\t\t\tlet (left = cells[index - 1] else permanentFirstCell,\n\t\t\t\tright = cells[index + 1] else permanentLastCell,\n\t\t\t\tneighbours = [left, right],\n\t\t\t\tbothAlive = neighbours.every(alive.equals),\n\t\t\t\tbothDead = neighbours.every(dead.equals))\n\t\t\tif (bothAlive)\n\t\t\tthen cell.opposite\n\t\t\telse if (cell == alive && bothDead)\n\t\t\tthen dead\n\t\t\telse cell\n\t\t};\n\t\t\n\t\tif (newCells == cells) {\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tnewCells.copyTo(cells);\n\t\treturn true;\n\t}\n\t\n\tstring => permanentFirstCell.string + \"\".join(cells) + permanentLastCell.string;\n}\n\nshared Automata1D? automata1d(String string) =>\n\t\tlet (cells = string.map((Character element) => cellsByCharacter[element]))\n\t\tif (cells.every((Cell? element) => element exists))\n\t\tthen Automata1D(cells.coalesced)\n\t\telse null;\n\nshared void run() {\n\n\tassert (exists automata = automata1d(\"__###__##_#_##_###__######_###_#####_#__##_____#_#_#######__\"));\n\t\n\tvariable value generation = 0;\n\tprint(\"generation ``generation`` ``automata``\");\n\twhile (automata.evolve() && generation<10) {\n\t\tprint(\"generation `` ++generation `` ``automata``\");\n\t}\n}\n","language":"Ceylon"},{"code":"100 CLS\n110 LET n = 10\n120 READ w\n121 DIM x(w+1): DIM x2(w+1)\n122 FOR i = 1 TO w : READ x(i) : NEXT i\n130 FOR k = 1 TO n\n140 FOR j = 1 TO w\n150 IF x(j) THEN PRINT \"#\"; ELSE PRINT \"_\";\n160 IF x(j-1)+x(j)+x(j+1) = 2 THEN LET x2(j) = 1 ELSE LET x2(j) = 0\n170 NEXT j\n171 PRINT\n180 FOR j = 1 TO w : LET x(j) = x2(j) : NEXT j\n190 NEXT k\n200 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\n210 END\n","language":"Chipmunk-Basic"},{"code":"(ns one-dimensional-cellular-automata\n (:require (clojure.contrib (string :as s))))\n\n(defn next-gen [cells]\n (loop [cs cells ncs (s/take 1 cells)]\n (let [f3 (s/take 3 cs)]\n (if (= 3 (count f3))\n (recur (s/drop 1 cs)\n (str ncs (if (= 2 (count (filter #(= \\# %) f3))) \"#\" \"_\")))\n (str ncs (s/drop 1 cs))))))\n\n(defn generate [n cells]\n (if (= n 0)\n '()\n (cons cells (generate (dec n) (next-gen cells)))))\n","language":"Clojure"},{"code":"one-dimensional-cellular-automata> (doseq [cells (generate 9 \"_###_##_#_#_#_#__#__\")]\n (println cells))\n_###_##_#_#_#_#__#__\n_#_#####_#_#_#______\n__##___##_#_#_______\n__##___###_#________\n__##___#_##_________\n__##____###_________\n__##____#_#_________\n__##_____#__________\n__##________________\nnil\n","language":"Clojure"},{"code":"#!/usr/bin/env lein-exec\n\n(require '[clojure.string :as str])\n\n(def first-genr \"_###_##_#_#_#_#__#__\")\n\n(def hospitable #{\"_##\"\n \"##_\"\n \"#_#\"})\n\n(defn compute-next-genr\n [genr]\n (let [genr (str \"_\" genr \"_\")\n groups (map str/join (partition 3 1 genr))\n next-genr (for [g groups]\n (if (hospitable g) \\# \\_))]\n (str/join next-genr)))\n\n;; ---------------- main -----------------\n(loop [g first-genr\n i 0]\n (if (not= i 10)\n (do (println g)\n (recur (compute-next-genr g)\n (inc i)))))\n","language":"Clojure"},{"code":"(def rules\n {\n [0 0 0] 0\n [0 0 1] 0\n [0 1 0] 0\n [0 1 1] 1\n [1 0 0] 0\n [1 0 1] 1\n [1 1 0] 1\n [1 1 1] 0\n })\n\n(defn nextgen [gen]\n (concat [0]\n (->> gen\n (partition 3 1)\n (map vec)\n (map rules))\n [0]))\n\n; Output time!\n(doseq [g (take 10 (iterate nextgen [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]))]\n (println g))\n","language":"Clojure"},{"code":" Identification division.\n Program-id. rc-1d-cell.\n\n Data division.\n Working-storage section.\n\n*> \"Constants.\"\n 01 max-gens pic 999 value 9.\n 01 state-width pic 99 value 20.\n 01 state-table-init pic x(20) value \".@@@.@@.@.@.@.@..@..\".\n 01 alive pic x value \"@\".\n 01 dead pic x value \".\".\n\n*> The current state.\n 01 state-gen pic 999 value 0.\n 01 state-row.\n 05 state-row-gen pic zz9.\n 05 filler pic xx value \": \".\n 05 state-table.\n 10 state-cells pic x occurs 20 times.\n\n*> The new state.\n 01 new-state-table.\n 05 new-state-cells pic x occurs 20 times.\n\n*> Pointer into cell table during generational production.\n 01 cell-index pic 99.\n 88 at-beginning value 1.\n 88 is-inside values 2 thru 19.\n 88 at-end value 20.\n\n*> The cell's neighborhood.\n 01 neighbor-count-def.\n 03 neighbor-count pic 9.\n 88 is-comfy value 1.\n 88 is-ripe value 2.\n\n Procedure division.\n Perform Init-state-table.\n Perform max-gens times\n perform Display-row\n perform Next-state\n end-perform.\n Perform Display-row.\n Stop run.\n\n Display-row.\n Move state-gen to state-row-gen.\n Display state-row.\n\n*> Determine who lives and who dies.\n Next-state.\n Add 1 to state-gen.\n Move state-table to new-state-table.\n\n Perform with test after\n varying cell-index from 1 by 1\n until at-end\n perform Count-neighbors\n perform Die-off\n perform New-births\n end-perform\n\n move new-state-table to state-table.\n\n*> Living cell with wrong number of neighbors...\n Die-off.\n if state-cells(cell-index) =\n alive and not is-comfy\n then move dead to new-state-cells(cell-index)\n end-if\n .\n\n*> Empty cell with exactly two neighbors are...\n New-births.\n if state-cells(cell-index) = dead and is-ripe\n then move alive to new-state-cells(cell-index)\n end-if\n .\n*> How many living neighbors does a cell have?\n Count-neighbors.\n Move 0 to neighbor-count\n if at-beginning or at-end then\n add 1 to neighbor-count\n else\n if is-inside and state-cells(cell-index - 1) = alive\n then\n add 1 to neighbor-count\n end-if\n if is-inside and state-cells(cell-index + 1) = alive\n then\n add 1 to neighbor-count\n end-if\n end-if\n .\n\n*> String is easier to enter, but table is easier to work with,\n*> so move each character of the initialization string to the\n*> state table.\n\n Init-state-table.\n Perform with test after\n varying cell-index from 1 by 1\n until at-end\n move state-table-init(cell-index:1)\n to state-cells(cell-index)\n end-perform\n .\n","language":"COBOL"},{"code":"# We could cheat and count the bits, but let's keep this general.\n# . = dead, # = alive, middle cells survives iff one of the configurations\n# below is satisified.\nsurvival_scenarios = [\n '.##' # happy neighbors\n '#.#' # birth\n '##.' # happy neighbors\n]\n\nb2c = (b) -> if b then '#' else '.'\n\ncell_next_gen = (left_alive, me_alive, right_alive) ->\n fingerprint = b2c(left_alive) + b2c(me_alive) + b2c(right_alive)\n fingerprint in survival_scenarios\n\ncells_for_next_gen = (cells) ->\n # This function assumes a finite array, i.e. cells can't be born outside\n # the original array.\n (cell_next_gen(cells[i-1], cells[i], cells[i+1]) for i in [0...cells.length])\n\ndisplay = (cells) ->\n (b2c(is_alive) for is_alive in cells).join ''\n\nsimulate = (cells) ->\n while true\n console.log display cells\n new_cells = cells_for_next_gen cells\n break if display(cells) == display(new_cells)\n cells = new_cells\n console.log \"equilibrium achieved\"\n\nsimulate (c == '#' for c in \".###.##.#.#.#.#..#..\")\n","language":"COBOL"},{"code":"(defun value (x)\n (assert (> (length x) 1))\n (coerce x 'simple-bit-vector))\n\n(defun count-neighbors-and-self (value i)\n (flet ((ref (i)\n (if (array-in-bounds-p value i)\n (bit value i)\n 0)))\n (declare (inline ref))\n (+ (ref (1- i))\n (ref i)\n (ref (1+ i)))))\n\n(defun next-cycle (value)\n (let ((new-value (make-array (length value) :element-type 'bit)))\n (loop for i below (length value)\n do (setf (bit new-value i)\n (if (= 2 (count-neighbors-and-self value i))\n 1\n 0)))\n new-value))\n\n(defun print-world (value &optional (stream *standard-output*))\n (loop for i below (length value)\n do (princ (if (zerop (bit value i)) #\\. #\\#)\n stream))\n (terpri stream))\n","language":"Common-Lisp"},{"code":"CL-USER> (loop for previous-value = nil then value\n for value = #*01110110101010100100 then (next-cycle value)\n until (equalp value previous-value)\n do (print-world value))\n.###.##.#.#.#.#..#..\n.#.#####.#.#.#......\n..##...##.#.#.......\n..##...###.#........\n..##...#.##.........\n..##....###.........\n..##....#.#.........\n..##.....#..........\n..##................\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.algorithm;\n\n enum nGenerations = 10;\n enum initial = \"0011101101010101001000\";\n enum table = \"00010110\";\n\n char[initial.length + 2] A = '0', B = '0';\n A[1 .. $-1] = initial;\n foreach (immutable _; 0 .. nGenerations) {\n foreach (immutable i; 1 .. A.length - 1) {\n write(A[i] == '0' ? '_' : '#');\n const val = (A[i-1]-'0' << 2) | (A[i]-'0' << 1) | (A[i+1]-'0');\n B[i] = table[val];\n }\n A.swap(B);\n writeln;\n }\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.algorithm, std.range;\n\n auto A = \"_###_##_#_#_#_#__#__\".map!q{a == '#'}.array;\n auto B = A.dup;\n\n do {\n A.map!q{ \"_#\"[a] }.writeln;\n A.zip(A.cycle.drop(1), A.cycle.drop(A.length - 1))\n .map!(t => [t[]].sum == 2).copy(B);\n A.swap(B);\n } while (A != B);\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.algorithm, std.range, std.bitmanip;\n\n immutable initial = \"__###_##_#_#_#_#__#___\";\n enum nGenerations = 10;\n BitArray A, B;\n A.init(initial.map!(c => c == '#').array);\n B.length = initial.length;\n\n foreach (immutable _; 0 .. nGenerations) {\n //A.map!(b => b ? '#' : '_').writeln;\n //foreach (immutable i, immutable b; A) {\n foreach (immutable i; 1 .. A.length - 1) {\n \"_#\"[A[i]].write;\n immutable val = (uint(A[i - 1]) << 2) |\n (uint(A[i]) << 1) |\n uint(A[i + 1]);\n B[i] = val == 3 || val == 5 || val == 6;\n }\n\n writeln;\n A.swap(B);\n }\n}\n","language":"D"},{"code":"type TGame = string[20];\ntype TPattern = string[3];\n\nfunction GetSubPattern(Game: TGame; Inx: integer): TPattern;\n{Get the pattern of three cells adjacent to Inx}\nvar I: integer;\nbegin\nResult:='';\n{Cells off the ends of the array are consider empty}\nfor I:=Inx-1 to Inx+1 do\n if (I<1) or (I>Length(Game)) then Result:=Result+' '\n else Result:=Result+Game[I];\nend;\n\nfunction GetNewValue(P: TPattern): char;\n{Calculate the new value for a cell based}\n{the pattern of neighboring cells}\nbegin\nif P=' ' then Result:=' '\t{ No change}\nelse if P=' #' then Result:=' '\t{ No change}\nelse if P=' # ' then Result:=' '\t{ Dies without enough neighbours}\nelse if P=' ##' then Result:='#'\t{ Needs one neighbour to survive}\nelse if P='# ' then Result:=' '\t{ No change}\nelse if P='# #' then Result:='#'\t{ Two neighbours giving birth}\nelse if P='## ' then Result:='#'\t{ Needs one neighbour to survive}\nelse if P='###' then Result:=' ';\t{ Starved to death.}\nend;\n\n\nprocedure CellularlAutoGame(Memo: TMemo);\n{Iterate through steps of evolution of cellular automaton}\nvar GameArray,NextArray: TGame;\nvar P: string [3];\nvar I,G: integer;\nbegin\n{Start arrangement}\nGameArray:=' ### ## # # # # # ';\nfor G:=1 to 10 do\n\tbegin\n\t{Display current game situation}\n\tMemo.Lines.Add(GameArray);\n\t{Evolve each cell in the array}\n\tfor I:=1 to Length(GameArray) do\n\t\tbegin\n\t\tP:=GetSubPattern(GameArray,I);\n\t \tNextArray[I]:=GetNewValue(P);\n\t \tend;\n\tGameArray:=NextArray;\n\tend;\nend;\n","language":"Delphi"},{"code":"const ngenerations = 10;\nconst table = [0, 0, 0, 1, 0, 1, 1, 0];\n\nvar a := [0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0];\nvar b := a;\n\nvar i, j : Integer;\nfor i := 1 to ngenerations do begin\n for j := a.low+1 to a.high-1 do begin\n if a[j] = 0 then\n Print('_')\n else Print('#');\n var val := (a[j-1] shl 2) or (a[j] shl 1) or a[j+1];\n b[j] := table[val];\n end;\n var tmp := a;\n a := b;\n b := tmp;\n PrintLn('');\nend;\n","language":"DWScript"},{"code":"def step(state, rule) {\n var result := state(0, 1) # fixed left cell\n for i in 1..(state.size() - 2) {\n # Rule function receives the substring which is the neighborhood\n result += E.toString(rule(state(i-1, i+2)))\n }\n result += state(state.size() - 1) # fixed right cell\n return result\n}\n\ndef play(var state, rule, count, out) {\n out.print(`0 | $state$\\n`)\n for i in 1..count {\n state := step(state, rosettaRule)\n out.print(`$i | $state$\\n`)\n }\n return state\n}\n","language":"E"},{"code":"def rosettaRule := [\n \" \" => \" \",\n \" #\" => \" \",\n \" # \" => \" \",\n \" ##\" => \"#\",\n \"# \" => \" \",\n \"# #\" => \"#\",\n \"## \" => \"#\",\n \"###\" => \" \",\n].get\n\n? play(\" ### ## # # # # # \", rosettaRule, 9, stdout)\n0 | ### ## # # # # #\n1 | # ##### # # #\n2 | ## ## # #\n3 | ## ### #\n4 | ## # ##\n5 | ## ###\n6 | ## # #\n7 | ## #\n8 | ##\n9 | ##\n# value: \" ## \"\n","language":"E"},{"code":"map[] = [ 0 0 0 1 0 1 1 0 ]\ncell[] = [ 0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 ]\nlen celln[] len cell[]\nproc evolve . .\n for i = 2 to len cell[] - 1\n ind = cell[i - 1] + 2 * cell[i] + 4 * cell[i + 1] + 1\n celln[i] = map[ind]\n .\n swap celln[] cell[]\n.\nproc show . .\n for v in cell[]\n if v = 1\n write \"#\"\n else\n write \".\"\n .\n .\n print \"\"\n.\nshow\nfor i to 9\n evolve\n show\n.\n","language":"EasyLang"},{"code":"class\n\tAPPLICATION\n\ncreate\n\tmake\n\nfeature\n\n\tmake\n\t\t\t-- First 10 states of the cellular automata.\n\t\tlocal\n\t\t\tr: RANDOM\n\t\t\tautomata: STRING\n\t\tdo\n\t\t\tcreate r.make\n\t\t\tcreate automata.make_empty\n\t\t\tacross\n\t\t\t\t1 |..| 10 as c\n\t\t\tloop\n\t\t\t\tif r.double_item < 0.5 then\n\t\t\t\t\tautomata.append (\"0\")\n\t\t\t\telse\n\t\t\t\t\tautomata.append (\"1\")\n\t\t\t\tend\n\t\t\t\tr.forth\n\t\t\tend\n\t\t\tacross\n\t\t\t\t1 |..| 10 as c\n\t\t\tloop\n\t\t\t\tio.put_string (automata + \"%N\")\n\t\t\t\tautomata := update (automata)\n\t\t\tend\n\t\tend\n\n\tupdate (s: STRING): STRING\n\t\t\t-- Next state of the cellular automata 's'.\n\t\trequire\n\t\t\tenough_states: s.count > 1\n\t\tlocal\n\t\t\ti: INTEGER\n\t\tdo\n\t\t\tcreate Result.make_empty\n\t\t\t\t-- Dealing with the left border.\n\t\t\tif s [1] = '1' and s [2] = '1' then\n\t\t\t\tResult.append (\"1\")\n\t\t\telse\n\t\t\t\tResult.append (\"0\")\n\t\t\tend\n\t\t\t\t-- Dealing with the middle cells.\n\t\t\tfrom\n\t\t\t\ti := 2\n\t\t\tuntil\n\t\t\t\ti = s.count\n\t\t\tloop\n\t\t\t\tif (s [i] = '0' and (s [i - 1] = '0' or (s [i - 1] = '1' and s [i + 1] = '0'))) or ((s [i] = '1') and ((s [i - 1] = '1' and s [i + 1] = '1') or (s [i - 1] = '0' and s [i + 1] = '0'))) then\n\t\t\t\t\tResult.append (\"0\")\n\t\t\t\telse\n\t\t\t\t\tResult.append (\"1\")\n\t\t\t\tend\n\t\t\t\ti := i + 1\n\t\t\tend\n\t\t\t\t-- Dealing with the right border.\n\t\t\tif s [s.count] = '1' and s [s.count - 1] = '1' then\n\t\t\t\tResult.append (\"1\")\n\t\t\telse\n\t\t\t\tResult.append (\"0\")\n\t\t\tend\n\t\tensure\n\t\t\thas_same_length: s.count = Result.count\n\t\tend\n\nend\n","language":"Eiffel"},{"code":"defmodule RC do\n def run(list, gen \\\\ 0) do\n print(list, gen)\n next = evolve(list)\n if next == list, do: print(next, gen+1), else: run(next, gen+1)\n end\n\n defp evolve(list), do: evolve(Enum.concat([[0], list, [0]]), [])\n\n defp evolve([a,b,c], next), do: Enum.reverse([life(a,b,c) | next])\n defp evolve([a,b,c|rest], next), do: evolve([b,c|rest], [life(a,b,c) | next])\n\n defp life(a,b,c), do: (if a+b+c == 2, do: 1, else: 0)\n\n defp print(list, gen) do\n str = \"Generation #{gen}: \"\n IO.puts Enum.reduce(list, str, fn x,s -> s <> if x==0, do: \".\", else: \"#\" end)\n end\nend\n\nRC.run([0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0])\n","language":"Elixir"},{"code":"import Maybe exposing (withDefault)\nimport List exposing (length, tail, reverse, concat, head, append, map3)\nimport Html exposing (Html, div, h1, text)\nimport String exposing (join)\nimport Svg exposing (svg)\nimport Svg.Attributes exposing (version, width, height, viewBox,cx,cy, fill, r)\nimport Html.App exposing (program)\nimport Random exposing (step, initialSeed, bool, list)\nimport Matrix exposing (fromList, mapWithLocation, flatten) -- chendrix/elm-matrix\nimport Time exposing (Time, second, every)\n\ntype alias Model = { history : List (List Bool)\n , cols : Int\n , rows : Int\n }\n\nview : Model -> Html Msg\nview model =\n let\n circleInBox (row,col) value =\n if value\n then [ Svg.circle [ r \"0.3\"\n , fill (\"purple\")\n , cx (toString (toFloat col + 0.5))\n , cy (toString (toFloat row + 0.5))\n ]\n []\n ]\n else []\n\n showHistory model =\n model.history\n |> reverse\n |> fromList\n |> mapWithLocation circleInBox\n |> flatten\n |> concat\n in\n div []\n [ h1 [] [text \"One Dimensional Cellular Automata\"]\n , svg [ version \"1.1\"\n , width \"700\"\n , height \"700\"\n , viewBox (join \" \"\n [ 0 |> toString\n , 0 |> toString\n , model.cols |> toString\n , model.rows |> toString\n ]\n )\n ]\n (showHistory model)\n ]\n\nupdate : Msg -> Model -> (Model, Cmd Msg)\nupdate msg model =\n if length model.history == model.rows\n then (model, Cmd.none)\n else\n let s1 = model.history |> head |> withDefault []\n s0 = False :: s1\n s2 = append (tail s1 |> withDefault []) [False]\n\n gen d0 d1 d2 =\n case (d0,d1,d2) of\n (False, True, True) -> True\n ( True, False, True) -> True\n ( True, True, False) -> True\n _ -> False\n\n updatedHistory = map3 gen s0 s1 s2 :: model.history\n updatedModel = {model | history = updatedHistory}\n in (updatedModel, Cmd.none)\n\n\ninit : Int -> (Model, Cmd Msg)\ninit n =\n let gen1 = fst (step (list n bool) (initialSeed 34))\n in ({ history = [gen1], rows = n, cols= n }, Cmd.none)\n\ntype Msg = Tick Time\n\nsubscriptions model = every (0.2 * second) Tick\n\nmain = program\n { init = init 40\n , view = view\n , update = update\n , subscriptions = subscriptions\n }\n","language":"Elm"},{"code":"-module(ca).\n-compile(export_all).\n\nrun(N,G) ->\n run(N,G,0).\n\nrun(GN,G,GN) ->\n io:fwrite(\"~B: \",[GN]),\n print(G);\nrun(N,G,GN) ->\n io:fwrite(\"~B: \",[GN]),\n print(G),\n run(N,next(G),GN+1).\n\nprint([]) ->\n io:fwrite(\"~n\");\nprint([0|T]) ->\n io:fwrite(\"_\"),\n print(T);\nprint([1|T]) ->\n io:fwrite(\"#\"),\n print(T).\n\nnext([]) ->\n [];\nnext([_]) ->\n [0];\nnext([H,1|_]=G) ->\n next(G,[H]);\nnext([_|_]=G) ->\n next(G,[0]).\n\nnext([],Acc) ->\n lists:reverse(Acc);\nnext([0,_],Acc) ->\n next([],[0|Acc]);\nnext([1,X],Acc) ->\n next([],[X|Acc]);\nnext([0,X,0|T],Acc) ->\n next([X,0|T],[0|Acc]);\nnext([1,X,0|T],Acc) ->\n next([X,0|T],[X|Acc]);\nnext([0,X,1|T],Acc) ->\n next([X,1|T],[X|Acc]);\nnext([1,0,1|T],Acc) ->\n next([0,1|T],[1|Acc]);\nnext([1,1,1|T],Acc) ->\n next([1,1|T],[0|Acc]).\n","language":"Erlang"},{"code":"44> ca:run(9,[0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0]).\n0: __###_##_#_#_#_#__#___\n1: __#_#####_#_#_#_______\n2: ___##___##_#_#________\n3: ___##___###_#_________\n4: ___##___#_##__________\n5: ___##____###__________\n6: ___##____#_#__________\n7: ___##_____#___________\n8: ___##_________________\n9: ___##_________________\n","language":"Erlang"},{"code":"PROGRAM ONEDIM_AUTOMATA\n\n! for rosettacode.org\n!\n\n!VAR I,J,N,W,K\n\n!$DYNAMIC\nDIM X[0],X2[0]\n\nBEGIN\n\n DATA(20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0)\n\n PRINT(CHR$(12);)\n N=20 ! number of generation required\n READ(W)\n !$DIM X[W+1],X2[W+1]\n FOR I=1 TO W DO\n READ(X[I])\n END FOR\n FOR K=1 TO N DO\n PRINT(\"Generation\";K;TAB(16);)\n FOR J=1 TO W DO\n IF X[J]=1 THEN PRINT(\"#\";) ELSE PRINT(\"_\";) END IF\n IF X[J-1]+X[J]+X[J+1]=2 THEN X2[J]=1 ELSE X2[J]=0 END IF\n END FOR\n PRINT\n FOR J=1 TO W DO\n X[J]=X2[J]\n END FOR\n END FOR\nEND PROGRAM\n","language":"ERRE"},{"code":"include machine.e\n\nfunction rules(integer tri)\n return tri = 3 or tri = 5 or tri = 6\nend function\n\nfunction next_gen(atom gen)\n atom new, bit\n new = rules(and_bits(gen,3)*2) -- work with the first bit separately\n bit = 2\n while gen > 0 do\n new += bit*rules(and_bits(gen,7))\n gen = floor(gen/2) -- shift right\n bit *= 2 -- shift left\n end while\n return new\nend function\n\nconstant char_clear = '_', char_filled = '#'\n\nprocedure print_gen(atom gen)\n puts(1, int_to_bits(gen,32) * (char_filled - char_clear) + char_clear)\n puts(1,'\\n')\nend procedure\n\nfunction s_to_gen(sequence s)\n s -= char_clear\n return bits_to_int(s)\nend function\n\natom gen, prev\ninteger n\n\nn = 0\nprev = 0\ngen = bits_to_int(rand(repeat(2,32))-1)\nwhile gen != prev do\n printf(1,\"Generation %d: \",n)\n print_gen(gen)\n prev = gen\n gen = next_gen(gen)\n n += 1\nend while\n\nprintf(1,\"Generation %d: \",n)\nprint_gen(gen)\n","language":"Euphoria"},{"code":"USING: bit-arrays io kernel locals math sequences ;\nIN: cellular\n\n: bool-sum ( bool1 bool2 -- sum )\n [ [ 2 ] [ 1 ] if ]\n [ [ 1 ] [ 0 ] if ] if ;\n:: neighbours ( index world -- # )\n index [ 1 - ] [ 1 + ] bi [ world ?nth ] bi@ bool-sum ;\n: count-neighbours ( world -- neighbours )\n [ length iota ] keep [ neighbours ] curry map ;\n\n: life-law ( alive? neighbours -- alive? )\n swap [ 1 = ] [ 2 = ] if ;\n: step ( world -- world' )\n dup count-neighbours [ life-law ] ?{ } 2map-as ;\n: print-cellular ( world -- )\n [ CHAR: # CHAR: _ ? ] \"\" map-as print ;\n: main-cellular ( -- )\n ?{ f t t t f t t f t f t f t f t f f t f f }\n 10 [ dup print-cellular step ] times print-cellular ;\nMAIN: main-cellular\n","language":"Factor"},{"code":"class Automaton\n{\n static Int[] evolve (Int[] array)\n {\n return array.map |Int x, Int i -> Int|\n {\n if (i == 0)\n return ( (x + array[1] == 2) ? 1 : 0)\n else if (i == array.size-1)\n return ( (x + array[-2] == 2) ? 1 : 0)\n else if (x + array[i-1] + array[i+1] == 2)\n return 1\n else\n return 0\n }\n }\n\n public static Void main ()\n {\n Int[] array := [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\n echo (array.join(\"\"))\n Int[] newArray := evolve(array)\n while (newArray != array)\n {\n echo (newArray.join(\"\"))\n array = newArray\n newArray = evolve(array)\n }\n }\n}\n","language":"Fantom"},{"code":"1.1 S OLD(2)=1; S OLD(3)=1; S OLD(4)=1; S OLD(6)=1; S OLD(7)=1\n1.2 S OLD(9)=1; S OLD(11)=1; S OLD(13)=1; S OLD(15)=1; S OLD(18)=1\n1.3 F N=1,10; D 2\n1.4 Q\n\n2.1 F X=1,20; D 3\n2.2 F X=1,20; D 6\n2.3 F X=1,20; S OLD(X)=NEW(X)\n2.4 T !\n\n3.1 I (OLD(X-1)+OLD(X)+OLD(X+1)-2)4.1,5.1,4.1\n\n4.1 S NEW(X)=0\n\n5.1 S NEW(X)=1\n\n6.1 I (-OLD(X))7.1,8.1,8.1\n\n7.1 T \"#\"\n\n8.1 T \".\"\n","language":"FOCAL"},{"code":": init ( bits count -- )\n 0 do dup 1 and c, 2/ loop drop ;\n\n20 constant size\ncreate state $2556e size init 0 c,\n\n: .state\n cr size 0 do\n state i + c@ if .\" #\" else space then\n loop ;\n\n: ctable create does> + c@ ;\nctable rules $68 8 init\n\n: gen\n state c@ ( window )\n size 0 do\n 2* state i + 1+ c@ or 7 and\n dup rules state i + c!\n loop drop ;\n\n: life1d ( n -- )\n .state 1 do gen .state loop ;\n\n10 life1d\n","language":"Forth"},{"code":" ### ## # # # # #\n # ##### # # #\n ## ## # #\n ## ### #\n ## # ##\n ## ###\n ## # #\n ## #\n ##\n ## ok\n","language":"Forth"},{"code":"PROGRAM LIFE_1D\n\n IMPLICIT NONE\n\n LOGICAL :: cells(20) = (/ .FALSE., .TRUE., .TRUE., .TRUE., .FALSE., .TRUE., .TRUE., .FALSE., .TRUE., .FALSE., &\n .TRUE., .FALSE., .TRUE., .FALSE., .TRUE., .FALSE., .FALSE., .TRUE., .FALSE., .FALSE. /)\n INTEGER :: i\n\n DO i = 0, 9\n WRITE(*, \"(A,I0,A)\", ADVANCE = \"NO\") \"Generation \", i, \": \"\n CALL Drawgen(cells)\n CALL Nextgen(cells)\n END DO\n\nCONTAINS\n\n SUBROUTINE Nextgen(cells)\n LOGICAL, INTENT (IN OUT) :: cells(:)\n LOGICAL :: left, centre, right\n INTEGER :: i\n\n left = .FALSE.\n DO i = 1, SIZE(cells)-1\n centre = cells(i)\n right = cells(i+1)\n IF (left .AND. right) THEN\n cells(i) = .NOT. cells(i)\n ELSE IF (.NOT. left .AND. .NOT. right) THEN\n cells(i) = .FALSE.\n END IF\n left = centre\n END DO\n cells(SIZE(cells)) = left .AND. right\n END SUBROUTINE Nextgen\n\n SUBROUTINE Drawgen(cells)\n LOGICAL, INTENT (IN OUT) :: cells(:)\n INTEGER :: i\n\n DO i = 1, SIZE(cells)\n IF (cells(i)) THEN\n WRITE(*, \"(A)\", ADVANCE = \"NO\") \"#\"\n ELSE\n WRITE(*, \"(A)\", ADVANCE = \"NO\") \"_\"\n END IF\n END DO\n WRITE(*,*)\n END SUBROUTINE Drawgen\n\nEND PROGRAM LIFE_1D\n","language":"Fortran"},{"code":"#define SIZE 640\n\nrandomize timer\n\ndim as ubyte arr(0 to SIZE-1, 0 to 1)\ndim as uinteger i\nfor i = 0 to SIZE - 1 'initialise array with zeroes and ones\n arr(i, 0)=int(rnd+0.5)\nnext i\n\nscreen 12 'display graphically\n\ndim as string ch=\" \"\ndim as uinteger j = 0, cur = 0, nxt, prv, neigh\nwhile not ch = \"q\" or ch = \"Q\"\n for i = 0 to SIZE - 1\n pset(i, j), 8+7*arr(i,cur) 'print off cells as grey, on cells as bright white\n nxt = (i + 1) mod SIZE\n prv = (i - 1)\n if prv < 0 then prv = SIZE - 1 'let's have a wrap-around array for fun\n neigh = arr(prv, cur) + arr(nxt, cur)\n if arr(i, cur) = 0 then 'evolution rules\n if neigh = 2 then\n arr(i, 1-cur) = 1\n else\n arr(i, 1-cur) = 0\n end if\n else\n if neigh = 0 or neigh = 2 then\n arr(i, 1-cur) = 0\n else\n arr(i, 1-cur) = 1\n end if\n end if\n next i\n j = j + 1\n cur = 1 - cur\n do\n ch = inkey\n if ch <> \"\" then exit do 'press any key to advance the sim\n 'or Q to exit\n loop\nwend\n","language":"FreeBASIC"},{"code":"'\n' One Dimensional Cellular Automaton\n'\nstart$=\"01110110101010100100\"\nmax_cycles%=20 ! give a maximum depth\n'\n' Global variables hold the world, with two rows\n' world! is set up with 2 extra cells width, so there is a FALSE on either side\n' cur% gives the row for current world,\n' new% gives the row for the next world.\n'\nsize%=LEN(start$)\nDIM world!(size%+2,2)\ncur%=0\nnew%=1\nclock%=0\n'\n@setup_world(start$)\nOPENW 1\nCLEARW 1\nDO\n @display_world\n @update_world\n EXIT IF @same_state\n clock%=clock%+1\n EXIT IF clock%>max_cycles% ! safety net\nLOOP\n~INP(2)\nCLOSEW 1\n'\n' parse given string to set up initial states in world\n' -- assumes world! is of correct size\n'\nPROCEDURE setup_world(defn$)\n LOCAL i%\n ' clear out the array\n ARRAYFILL world!(),FALSE\n ' for each 1 in string, set cell to true\n FOR i%=1 TO LEN(defn$)\n IF MID$(defn$,i%,1)=\"1\"\n world!(i%,0)=TRUE\n ENDIF\n NEXT i%\n ' set references to cur and new\n cur%=0\n new%=1\nRETURN\n'\n' Display the world\n'\nPROCEDURE display_world\n LOCAL i%\n FOR i%=1 TO size%\n IF world!(i%,cur%)\n PRINT \"#\";\n ELSE\n PRINT \".\";\n ENDIF\n NEXT i%\n PRINT \"\"\nRETURN\n'\n' Create new version of world\n'\nPROCEDURE update_world\n LOCAL i%\n FOR i%=1 TO size%\n world!(i%,new%)=@new_state(@get_value(i%))\n NEXT i%\n ' reverse cur/new\n cur%=1-cur%\n new%=1-new%\nRETURN\n'\n' Test if cur/new states are the same\n'\nFUNCTION same_state\n LOCAL i%\n FOR i%=1 TO size%\n IF world!(i%,cur%)<>world!(i%,new%)\n RETURN FALSE\n ENDIF\n NEXT i%\n RETURN TRUE\nENDFUNC\n'\n' Return new state of cell given value\n'\nFUNCTION new_state(value%)\n SELECT value%\n CASE 0,1,2,4,7\n RETURN FALSE\n CASE 3,5,6\n RETURN TRUE\n ENDSELECT\nENDFUNC\n'\n' Compute value for cell + neighbours\n'\nFUNCTION get_value(cell%)\n LOCAL result%\n result%=0\n IF world!(cell%-1,cur%)\n result%=result%+4\n ENDIF\n IF world!(cell%,cur%)\n result%=result%+2\n ENDIF\n IF world!(cell%+1,cur%)\n result%=result%+1\n ENDIF\n RETURN result%\nENDFUNC\n","language":"GFA-Basic"},{"code":"package main\n\nimport \"fmt\"\n\nconst (\n start = \"_###_##_#_#_#_#__#__\"\n offLeft = '_'\n offRight = '_'\n dead = '_'\n)\n\nfunc main() {\n fmt.Println(start)\n g := newGenerator(start, offLeft, offRight, dead)\n for i := 0; i < 10; i++ {\n fmt.Println(g())\n }\n}\n\nfunc newGenerator(start string, offLeft, offRight, dead byte) func() string {\n g0 := string(offLeft) + start + string(offRight)\n g1 := []byte(g0)\n last := len(g0) - 1\n return func() string {\n for i := 1; i < last; i++ {\n switch l := g0[i-1]; {\n case l != g0[i+1]:\n g1[i] = g0[i]\n case g0[i] == dead:\n g1[i] = l\n default:\n g1[i] = dead\n }\n }\n g0 = string(g1)\n return g0[1:last]\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sync\"\n)\n\nconst (\n start = \"_###_##_#_#_#_#__#__\"\n offLeft = '_'\n offRight = '_'\n dead = '_'\n)\n\nfunc main() {\n fmt.Println(start)\n a := make([]byte, len(start)+2)\n a[0] = offLeft\n copy(a[1:], start)\n a[len(a)-1] = offRight\n var read, write sync.WaitGroup\n read.Add(len(start) + 1)\n for i := 1; i <= len(start); i++ {\n go cell(a[i-1:i+2], &read, &write)\n }\n for i := 0; i < 10; i++ {\n write.Add(len(start) + 1)\n read.Done()\n read.Wait()\n read.Add(len(start) + 1)\n write.Done()\n write.Wait()\n fmt.Println(string(a[1 : len(a)-1]))\n }\n}\n\nfunc cell(kernel []byte, read, write *sync.WaitGroup) {\n var next byte\n for {\n l, v, r := kernel[0], kernel[1], kernel[2]\n read.Done()\n switch {\n case l != r:\n next = v\n case v == dead:\n next = l\n default:\n next = dead\n }\n read.Wait()\n kernel[1] = next\n write.Done()\n write.Wait()\n }\n}\n","language":"Go"},{"code":"def life1D = { self ->\n def right = self[1..-1] + [false]\n def left = [false] + self[0..-2]\n [left, self, right].transpose().collect { hood -> hood.count { it } == 2 }\n}\n","language":"Groovy"},{"code":"def cells = ('_###_##_#_#_#_#__#__' as List).collect { it == '#' }\nprintln \"Generation 0: ${cells.collect { g -> g ? '#' : '_' }.join()}\"\n(1..9).each {\n cells = life1D(cells)\n println \"Generation ${it}: ${cells.collect { g -> g ? '#' : '_' }.join()}\"\n}\n","language":"Groovy"},{"code":"import Data.List (unfoldr)\nimport System.Random (newStdGen, randomRs)\n\nbnd :: String -> Char\nbnd \"_##\" = '#'\nbnd \"#_#\" = '#'\nbnd \"##_\" = '#'\nbnd _ = '_'\n\nnxt :: String -> String\nnxt = unfoldr go . ('_' :) . (<> \"_\")\n where\n go [_, _] = Nothing\n go xs = Just (bnd $ take 3 xs, drop 1 xs)\n\nlahmahgaan :: String -> [String]\nlahmahgaan xs =\n init\n . until\n ((==) . last <*> last . init)\n ((<>) <*> pure . nxt . last)\n $ [xs, nxt xs]\n\nmain :: IO ()\nmain =\n newStdGen\n >>= ( mapM_ putStrLn . lahmahgaan\n . map (\"_#\" !!)\n . take 36\n . randomRs (0, 1)\n )\n","language":"Haskell"},{"code":"# One dimensional Cellular automaton\nrecord Automaton(size, cells)\n\nprocedure make_automaton (size, items)\n automaton := Automaton (size, items)\n while (*items < size) do push (automaton.cells, 0)\n return automaton\nend\n\nprocedure automaton_display (automaton)\n every (write ! automaton.cells)\nend\n\nprocedure automaton_evolve (automaton)\n revised := make_automaton (automaton.size, [])\n # do the left-most cell\n if ((automaton.cells[1] + automaton.cells[2]) = 2) then\n revised.cells[1] := 1\n # do the right-most cell\n if ((automaton.cells[automaton.size] + automaton.cells[automaton.size-1]) = 2) then\n revised.cells[revised.size] := 1\n # do the intermediate cells\n every (i := 2 to (automaton.size-1)) do {\n if ((automaton.cells[i-1] + automaton.cells[i] + automaton.cells[i+1]) = 2) then\n revised.cells[i] := 1\n }\n return revised\nend\n\nprocedure main ()\n automaton := make_automaton (20, [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0])\n every (1 to 10) do { # generations\n automaton_display (automaton)\n automaton := automaton_evolve (automaton)\n }\nend\n","language":"Icon"},{"code":"procedure main(A)\n A := if *A = 0 then [\"01110110101010100100\"]\n CA := show(\"0\"||A[1]||\"0\") # add always dead border cells\n every CA := show(|evolve(CA)\\10) # limit to max of 10 generations\nend\n\nprocedure show(ca)\n write(ca[2:-1]) # omit border cells\n return ca\nend\n\nprocedure evolve(CA)\n newCA := repl(\"0\",*CA)\n every newCA[i := 2 to (*CA-1)] := (CA[i-1]+CA[i]+CA[i+1] = 2, \"1\")\n return CA ~== newCA # fail if no change\nend\n","language":"Icon"},{"code":"(function next cells\n (... str\n (map (comp str (count [\"#\"]) (= 2) #(% \"#\" \"_\"))\n (str \"_\" cells)\n cells\n (str (skip 1 cells) \"_\"))))\n\n(function generate n cells\n (join \"\\n\" (reductions next cells (range n))))\n","language":"Icon"},{"code":"life1d=: '_#'{~ (2 = 3+/\\ 0,],0:)^:a:\n","language":"J"},{"code":" life1d ? 20 # 2\n_###_##_#_#_#_#__#__\n_#_#####_#_#_#______\n__##___##_#_#_______\n__##___###_#________\n__##___#_##_________\n__##____###_________\n__##____#_#_________\n__##_____#__________\n__##________________\n","language":"J"},{"code":"Rule=:2 :0 NB. , m: number of generations, n: rule number\n '_#'{~ (3 ((|.n#:~8#2) {~ #.)\\ 0,],0:)^:(i.m)\n)\n","language":"J"},{"code":" 9 Rule 104 '#'='_###_##_#_#_#_#__#__'\n_###_##_#_#_#_#__#__\n_#_#####_#_#_#______\n__##___##_#_#_______\n__##___###_#________\n__##___#_##_________\n__##____###_________\n__##____#_#_________\n__##_____#__________\n__##________________\n","language":"J"},{"code":"public class Life{\n\tpublic static void main(String[] args) throws Exception{\n\t\tString start= \"_###_##_#_#_#_#__#__\";\n\t\tint numGens = 10;\n\t\tfor(int i= 0; i < numGens; i++){\n\t\t\tSystem.out.println(\"Generation \" + i + \": \" + start);\n\t\t\tstart= life(start);\n\t\t}\n\t}\n\n\tpublic static String life(String lastGen){\n\t\tString newGen= \"\";\n\t\tfor(int i= 0; i < lastGen.length(); i++){\n\t\t\tint neighbors= 0;\n\t\t\tif (i == 0){//left edge\n\t\t\t\tneighbors= lastGen.charAt(1) == '#' ? 1 : 0;\n\t\t\t} else if (i == lastGen.length() - 1){//right edge\n\t\t\t\tneighbors= lastGen.charAt(i - 1) == '#' ? 1 : 0;\n\t\t\t} else{//middle\n\t\t\t\tneighbors= getNeighbors(lastGen.substring(i - 1, i + 2));\n\t\t\t}\n\n\t\t\tif (neighbors == 0){//dies or stays dead with no neighbors\n\t\t\t\tnewGen+= \"_\";\n\t\t\t}\n\t\t\tif (neighbors == 1){//stays with one neighbor\n\t\t\t\tnewGen+= lastGen.charAt(i);\n\t\t\t}\n\t\t\tif (neighbors == 2){//flips with two neighbors\n\t\t\t\tnewGen+= lastGen.charAt(i) == '#' ? \"_\" : \"#\";\n\t\t\t}\n\t\t}\n\t\treturn newGen;\n\t}\n\n\tpublic static int getNeighbors(String group){\n\t\tint ans= 0;\n\t\tif (group.charAt(0) == '#') ans++;\n\t\tif (group.charAt(2) == '#') ans++;\n\t\treturn ans;\n\t}\n}\n","language":"Java"},{"code":"public class Life{\n\tprivate static char[] trans = \"___#_##_\".toCharArray();\n\n\tprivate static int v(StringBuilder cell, int i){\n\t\treturn (cell.charAt(i) != '_') ? 1 : 0;\n\t}\n\n\tpublic static boolean evolve(StringBuilder cell){\n\t\tboolean diff = false;\n\t\tStringBuilder backup = new StringBuilder(cell.toString());\n\n\t\tfor(int i = 1; i < cell.length() - 3; i++){\n\t\t\t/* use left, self, right as binary number bits for table index */\n\t\t\tbackup.setCharAt(i, trans[v(cell, i - 1) * 4 + v(cell, i) * 2\n\t\t\t \t\t\t\t\t+ v(cell, i + 1)]);\n\t\t\tdiff = diff || (backup.charAt(i) != cell.charAt(i));\n\t\t}\n\n\t\tcell.delete(0, cell.length());//clear the buffer\n\t\tcell.append(backup);//replace it with the new generation\n\t\treturn diff;\n\t}\n\n\tpublic static void main(String[] args){\n\t\tStringBuilder c = new StringBuilder(\"_###_##_#_#_#_#__#__\\n\");\n\n\t\tdo{\n\t\t\tSystem.out.printf(c.substring(1));\n\t\t}while(evolve(c));\n\t}\n}\n","language":"Java"},{"code":"function caStep(old) {\n var old = [0].concat(old, [0]); // Surround with dead cells.\n var state = []; // The new state.\n\n for (var i=1; i<old.length-1; i++) {\n switch (old[i-1] + old[i+1]) {\n case 0: state[i-1] = 0; break;\n case 1: state[i-1] = (old[i] == 1) ? 1 : 0; break;\n case 2: state[i-1] = (old[i] == 1) ? 0 : 1; break;\n }\n }\n return state;\n}\n","language":"JavaScript"},{"code":"alert(caStep([0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]));\n","language":"JavaScript"},{"code":"# The 1-d cellular automaton:\ndef next:\n # Conveniently, jq treats null as 0 when it comes to addition\n # so there is no need to fiddle with the boundaries\n . as $old\n | reduce range(0; length) as $i\n ([];\n ($old[$i-1] + $old[$i+1]) as $s\n | if $s == 0 then .[$i] = 0\n elif $s == 1 then .[$i] = (if $old[$i] == 1 then 1 else 0 end)\n else .[$i] = (if $old[$i] == 1 then 0 else 1 end)\n end);\n\n\n# pretty-print an array:\ndef pp: reduce .[] as $i (\"\"; . + (if $i == 0 then \" \" else \"*\" end));\n\n# continue until quiescence:\ndef go: recurse(. as $prev | next | if . == $prev then empty else . end) | pp;\n\n# Example:\n[0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0] | go\n","language":"Jq"},{"code":"$ jq -c -r -n -f One-dimensional_cellular_automata.jq\n *** ** * * * * *\n * ***** * * *\n ** ** * *\n ** *** *\n ** * **\n ** ***\n ** * *\n ** *\n **\n","language":"Jq"},{"code":"automaton(g::Vector{Bool}) =\n for i ∈ 0:9\n \tprintln(join(alive ? '#' : '_' for alive ∈ g))\n\t g = ([false; g[1:end-1]] .+ g .+ [g[2:end]; false]) .== 2\n end\n\nautomaton([c == '#' for c ∈ \"_###_##_#_#_#_#__#__\"])\n","language":"Julia"},{"code":"struct Automaton g₀::Vector{Bool} end\n\nBase.iterate(a::Automaton, g = a.g₀) =\n g, ([false; g[1:end-1]] .+ g .+ [g[2:end]; false]) .== 2\n\nBase.show(io::IO, a::Automaton) = for g in Iterators.take(a, 10)\n println(io, join(alive ? '#' : '_' for alive ∈ g)) end\n\nAutomaton([c == '#' for c ∈ \"_###_##_#_#_#_#__#__\"])\n","language":"Julia"},{"code":"f:{2=+/(0,x,0)@(!#x)+/:!3}\n","language":"K"},{"code":" `0:\"_X\"@f\\0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0\n_XXX_XX_X_X_X_X__X__\n_X_XXXXX_X_X_X______\n__XX___XX_X_X_______\n__XX___XXX_X________\n__XX___X_XX_________\n__XX____XXX_________\n__XX____X_X_________\n__XX_____X__________\n__XX________________\n","language":"K"},{"code":"// version 1.1.4-3\n\nval trans = \"___#_##_\"\n\nfun v(cell: StringBuilder, i: Int) = if (cell[i] != '_') 1 else 0\n\nfun evolve(cell: StringBuilder, backup: StringBuilder): Boolean {\n val len = cell.length - 2\n var diff = 0\n for (i in 1 until len) {\n /* use left, self, right as binary number bits for table index */\n backup[i] = trans[v(cell, i - 1) * 4 + v(cell, i) * 2 + v(cell, i + 1)]\n diff += if (backup[i] != cell[i]) 1 else 0\n }\n cell.setLength(0)\n cell.append(backup)\n return diff != 0\n}\n\nfun main(args: Array<String>) {\n val c = StringBuilder(\"_###_##_#_#_#_#__#__\")\n val b = StringBuilder(\"____________________\")\n do {\n println(c.substring(1))\n }\n while (evolve(c,b))\n}\n","language":"Kotlin"},{"code":"' [RC] 'One-dimensional cellular automata'\n\n' does not wrap so fails for some rules\nrule$ =\"00010110\" ' Rule 22 decimal\n\nstate$ =\"0011101101010101001000\"\n\nfor j =1 to 20\n print state$\n oldState$ =state$\n state$ =\"0\"\n for k =2 to len( oldState$) -1\n NHood$ =mid$( oldState$, k -1, 3) ' pick 3 char neighbourhood and turn binary string to decimal\n vNHood =0\n for kk =3 to 1 step -1\n vNHood =vNHood +val( mid$( NHood$, kk, 1)) *2^( 3 -kk)\n next kk\n ' .... & use it to index into rule$ to find appropriate new value\n state$ =state$ +mid$( rule$, vNHood +1, 1)\n next k\n state$ =state$ +\"0\"\n\nnext j\n\nend\n","language":"Liberty-BASIC"},{"code":"10 MODE 1:n=10:READ w:DIM x(w+1),x2(w+1):FOR i=1 to w:READ x(i):NEXT\n20 FOR k=1 TO n\n30 FOR j=1 TO w\n40 IF x(j) THEN PRINT \"#\"; ELSE PRINT \"_\";\n50 IF x(j-1)+x(j)+x(j+1)=2 THEN x2(j)=1 ELSE x2(j)=0\n60 NEXT:PRINT\n70 FOR j=1 TO w:x(j)=x2(j):NEXT\n80 NEXT\n90 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\n","language":"Locomotive-Basic"},{"code":"make \"cell_list [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]\nmake \"generations 9\n\nto evolve :n\nifelse :n=1 [make \"nminus1 item :cell_count :cell_list][make \"nminus1 item :n-1 :cell_list]\nifelse :n=:cell_count[make \"nplus1 item 1 :cell_list][make \"nplus1 item :n+1 :cell_list]\nifelse ((item :n :cell_list)=0) [\n\tifelse (and (:nminus1=1) (:nplus1=1)) [output 1][output (item :n :cell_list)]\n][\n\tifelse (and (:nminus1=1) (:nplus1=1)) [output 0][\n\t ifelse and (:nminus1=0) (:nplus1=0) [output 0][output (item :n :cell_list)]]\n]\nend\n\nto CA_1D :cell_list :generations\nmake \"cell_count count :cell_list\n(print \")\nmake \"printout \"\nrepeat :cell_count [\nmake \"printout word :printout ifelse (item repcount :cell_list)=1 [\"#][\"_]\n]\n(print \"Generation \"0: :printout)\n\nrepeat :generations [\n (make \"cell_list_temp [])\n repeat :cell_count[\n (make \"cell_list_temp (lput (evolve repcount) :cell_list_temp))\n ]\n make \"cell_list :cell_list_temp\n make \"printout \"\n repeat :cell_count [\n \t make \"printout word :printout ifelse (item repcount :cell_list)=1 [\"#][\"_]\n ]\n (print \"Generation word repcount \": :printout)\n]\nend\n\nCA_1D :cell_list :generations\n","language":"Logo"},{"code":"num_iterations = 9\nf = { 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0 }\n\nfunction Output( f, l )\n io.write( l, \": \" )\n for i = 1, #f do\n local c\n if f[i] == 1 then c = '#' else c = '_' end\n io.write( c )\n end\n print \"\"\nend\n\nOutput( f, 0 )\n\nfor l = 1, num_iterations do\n local g = {}\n for i = 2, #f-1 do\n if f[i-1] + f[i+1] == 1 then\n g[i] = f[i]\n elseif f[i] == 0 and f[i-1] + f[i+1] == 2 then\n g[i] = 1\n else\n g[i] = 0\n end\n end\n if f[1] == 1 and f[2] == 1 then g[1] = 1 else g[1] = 0 end\n if f[#f] == 1 and f[#f-1] == 1 then g[#f] = 1 else g[#f] = 0 end\n f, g = g, f\n\n Output( f, l )\nend\n","language":"Lua"},{"code":"divert(-1)\ndefine(`set',`define(`$1[$2]',`$3')')\ndefine(`get',`defn(`$1[$2]')')\ndefine(`setrange',`ifelse(`$3',`',$2,`define($1[$2],$3)`'setrange($1,\n incr($2),shift(shift(shift($@))))')')\n\ndnl throw in sentinels at each end (0 and size+1) to make counting easy\ndefine(`new',`set($1,size,eval($#-1))`'setrange($1,1,\n shift($@))`'set($1,0,0)`'set($1,$#,0)')\n\ndefine(`for',\n `ifelse($#,0,``$0'',\n `ifelse(eval($2<=$3),1,\n `pushdef(`$1',$2)$4`'popdef(`$1')$0(`$1',incr($2),$3,`$4')')')')\ndefine(`show',\n `for(`k',1,get($1,size),`get($1,k) ')')\n\ndnl swap(`a',a,`b') using arg stack for temp\ndefine(`swap',`define(`$1',$3)`'define(`$3',$2)')\ndefine(`nalive',\n `eval(get($1,decr($2))+get($1,incr($2)))')\nsetrange(`live',0,0,1,0)\nsetrange(`dead',0,0,0,1)\ndefine(`nv',\n `ifelse(get($1,z),0,`get(dead,$3)',`get(live,$3)')')\ndefine(`evolve',\n `for(`z',1,get($1,size),\n `set($2,z,nv($1,z,nalive($1,z)))')')\nnew(`a',0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0)\nset(`b',size,get(`a',size))`'set(`b',0,0)`'set(`b',incr(get(`a',size)),0)\ndefine(`x',`a')\ndefine(`y',`b')\ndivert\nfor(`j',1,10,\n `show(x)`'evolve(`x',`y')`'swap(`x',x,`y')\n')`'show(x)\n","language":"M4"},{"code":"CellularAutomaton[{{0,0,_}->0,{0,1,0}->0,{0,1,1}->1,{1,0,0}->0,{1,0,1}->1,{1,1,0}->1,{1,1,1}->0},{{1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1},0},12]\nPrint @@@ (% /. {1 -> \"#\", 0 -> \".\"});\n","language":"Mathematica"},{"code":"CellularAutomaton[2^^01101000 (* == 104 *), {{1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1}, 0}, 12];\n","language":"Mathematica"},{"code":"###.##.#.#.#.#..#\n#.#####.#.#.#....\n.##...##.#.#.....\n.##...###.#......\n.##...#.##.......\n.##....###.......\n.##....#.#.......\n.##.....#........\n.##..............\n.##..............\n.##..............\n.##..............\n.##..............\n","language":"Mathematica"},{"code":"function one_dim_cell_automata(v,n)\n V='_#';\n while n>=0;\n\tdisp(V(v+1));\n\tn = n-1;\n\tv = filter([1,1,1],1,[0,v,0]);\n\tv = v(3:end)==2;\n end;\nend\n","language":"MATLAB"},{"code":"MODULE Cell EXPORTS Main;\n\nIMPORT IO, Fmt, Word;\n\nVAR culture := ARRAY [0..19] OF INTEGER {0, 1, 1, 1,\n 0, 1, 1, 0,\n 1, 0, 1, 0,\n 1, 0, 1, 0,\n 0, 1, 0, 0};\n\nPROCEDURE Step(VAR culture: ARRAY OF INTEGER) =\n VAR left: INTEGER := 0;\n this, right: INTEGER;\n BEGIN\n FOR i := FIRST(culture) TO LAST(culture) - 1 DO\n right := culture[i + 1];\n this := culture[i];\n culture[i] :=\n Word.Or(Word.And(this, Word.Xor(left, right)), Word.And(Word.Not(this), Word.And(left, right)));\n left := this;\n END;\n culture[LAST(culture)] := Word.And(culture[LAST(culture)], Word.Not(left));\n END Step;\n\nPROCEDURE Put(VAR culture: ARRAY OF INTEGER) =\n BEGIN\n FOR i := FIRST(culture) TO LAST(culture) DO\n IF culture[i] = 1 THEN\n IO.PutChar('#');\n ELSE\n IO.PutChar('_');\n END;\n END;\n END Put;\n\nBEGIN\n FOR i := 0 TO 9 DO\n IO.Put(\"Generation \" & Fmt.Int(i) & \" \");\n Put(culture);\n IO.Put(\"\\n\");\n Step(culture);\n END;\nEND Cell.\n","language":"Modula-3"},{"code":"30 VAR length .\n35 VAR height .\nFOR length 0 ENDFOR 1 0 ARR VAR list .\nlength 1 - VAR topLen .\nFOR topLen 0 ENDFOR 1 ARR VAR topLst .\n\nDEF getNeighbors\n 1 - VAR tempIndex .\n GET tempIndex SWAP\n tempIndex 1 + VAR tempIndex .\n GET tempIndex SWAP\n tempIndex 1 + VAR tempIndex .\n GET tempIndex SWAP .\n FOR 3 TOSTR ROT ENDFOR\n FOR 2 SWAP + ENDFOR\nENDDEF\n\nDEF printArr\n LEN 1 - VAR stLen .\n 0 VAR j .\n FOR stLen\n GET j\n TOSTR OUT .\n j 1 + VAR j .\n ENDFOR\n || PRINT .\nENDDEF\n\nFOR height\n FOR length 0 ENDFOR ARR VAR next .\n 1 VAR i .\n FOR length\n list i getNeighbors VAR last .\n i 1 - VAR ind .\n last |111| ==\n IF : .\n next 0 INSERT ind\n ENDIF\n\n last |110| ==\n IF : .\n next 1 INSERT ind\n ENDIF\n\n last |101| ==\n IF : .\n next 1 INSERT ind\n ENDIF\n\n last |100| ==\n IF : .\n next 0 INSERT ind\n ENDIF\n\n last |011| ==\n IF : .\n next 1 INSERT ind\n ENDIF\n\n last |010| ==\n IF : .\n next 1 INSERT ind\n ENDIF\n\n last |001| ==\n IF : .\n next 1 INSERT ind\n ENDIF\n\n last |000| ==\n IF : .\n next 0 INSERT ind\n ENDIF\n clear\n i 1 + VAR i .\n ENDFOR\n next printArr .\n next 0 ADD APPEND . VAR list .\nENDFOR\n","language":"MontiLang"},{"code":"% we need a way to write a values and pass the same back\nwi is rest link [write, pass]\n% calculate the neighbors by rotating the array left and right and joining them\nneighbors is pack [pass, sum [-1 rotate, 1 rotate]]\n% calculate the individual birth and death of a single array element\nigen is fork [ = [ + [first, second], 3 first], 0 first, = [ + [first, second], 2 first], 1 first, 0 first ]\n% apply that to the array\nnextgen is each igen neighbors\n% 42\nlife is fork [ > [sum pass, 0 first], life nextgen wi, pass ]\n","language":"Nial"},{"code":"|loaddefs 'life.nial'\n|I := [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\n|life I\n","language":"Nial"},{"code":"import random\n\n\ntype\n BoolArray = array[30, bool]\n Symbols = array[bool, char]\n\n\nproc neighbours(map: BoolArray, i: int): int =\n if i > 0: inc(result, int(map[i - 1]))\n if i + 1 < len(map): inc(result, int(map[i + 1]))\n\nproc print(map: BoolArray, symbols: Symbols) =\n for i in map: write(stdout, symbols[i])\n write(stdout, \"\\l\")\n\nproc randomMap: BoolArray =\n randomize()\n for i in mitems(result): i = sample([true, false])\n\n\nconst\n num_turns = 20\n symbols = ['_', '#']\n\n T = true\n F = false\n\nvar map =\n [F, T, T, T, F, T, T, F, T, F, T, F, T, F, T,\n F, F, T, F, F, F, F, F, F, F, F, F, F, F, F]\n\n# map = randomMap() # uncomment for random start\n\nprint(map, symbols)\n\nfor _ in 0 ..< num_turns:\n var map2 = map\n\n for i, v in pairs(map):\n map2[i] =\n if v: neighbours(map, i) == 1\n else: neighbours(map, i) == 2\n\n print(map2, symbols)\n\n if map2 == map: break\n map = map2\n","language":"Nim"},{"code":"import strutils\n\nconst\n s_init: string = \"_###_##_#_#_#_#__#__\"\n arrLen: int = 20\n\nvar q0: string = s_init & repeat('_',arrLen-20)\nvar q1: string = q0\n\nproc life(s:string): char =\n var str: string = s\n if len(normalize(str)) == 2: # normalize eliminates underscores\n return '#'\n return '_'\n\nproc evolve(q: string): string =\n result = repeat('_',arrLen)\n #result[0] = '_'\n for i in 1 .. q.len-1:\n result[i] = life(substr(q & '_',i-1,i+1))\n\necho(q1)\nq1 = evolve(q0)\necho(q1)\nwhile q1 != q0:\n q0 = q1\n q1 = evolve(q0)\n echo(q1)\n","language":"Nim"},{"code":"proc cellAutomata =\n proc evolveInto(x, t : var string) =\n for i in x.low..x.high:\n let\n alive = x[i] == 'o'\n left = if i == x.low: false else: x[i - 1] == 'o'\n right = if i == x.high: false else: x[i + 1] == 'o'\n t[i] =\n if alive: (if left xor right: 'o' else: '.')\n else: (if left and right: 'o' else: '.')\n\n var\n x = \".ooo.oo.o.o.o.o..o..\"\n t = x\n\n for i in 1..10:\n x.echo\n x.evolveInto t\n swap t, x\n\ncellAutomata()\n","language":"Nim"},{"code":"let get g i =\n try g.(i)\n with _ -> 0\n\nlet next_cell g i =\n match get g (i-1), get g (i), get g (i+1) with\n | 0, 0, 0 -> 0\n | 0, 0, 1 -> 0\n | 0, 1, 0 -> 0\n | 0, 1, 1 -> 1\n | 1, 0, 0 -> 0\n | 1, 0, 1 -> 1\n | 1, 1, 0 -> 1\n | 1, 1, 1 -> 0\n | _ -> assert(false)\n\nlet next g =\n let old_g = Array.copy g in\n for i = 0 to pred(Array.length g) do\n g.(i) <- (next_cell old_g i)\n done\n\nlet print_g g =\n for i = 0 to pred(Array.length g) do\n if g.(i) = 0\n then print_char '_'\n else print_char '#'\n done;\n print_newline()\n","language":"OCaml"},{"code":": nextGen( l )\n| i s |\n l byteSize dup ->s String newSize\n s loop: i [\n i 1 if=: [ 0 ] else: [ i 1- l byteAt '#' = ]\n i l byteAt '#' = +\n i s if=: [ 0 ] else: [ i 1+ l byteAt '#' = ] +\n 2 if=: [ '#' ] else: [ '_' ] over add\n ]\n;\n\n: gen( l n -- )\n l dup .cr #[ nextGen dup .cr ] times( n ) drop ;\n","language":"Oforth"},{"code":"declare\n A0 = {List.toTuple unit \"_###_##_#_#_#_#__#__\"}\n\n MaxGenerations = 9\n\n Rules = unit('___':&_\n '__#':&_\n '_#_':&_\n '_##':&#\n '#__':&_\n '#_#':&#\n '##_':&#\n '###':&_)\n\n fun {Evolve A}\n {Record.mapInd A\n fun {$ I V}\n Left = {CondSelect A I-1 &_}\n Right = {CondSelect A I+1 &_}\n Env = {String.toAtom [Left V Right]}\n in\n Rules.Env\n end\n }\n end\n\n fun lazy {Iterate X F}\n X|{Iterate {F X} F}\n end\nin\n for\n I in 0..MaxGenerations\n A in {Iterate A0 Evolve}\n do\n {System.showInfo \"Gen. \"#I#\": \"#{Record.toList A}}\n end\n","language":"Oz"},{"code":"step(v)=my(u=vector(#v),k);u[1]=v[1]&v[2];u[#u]=v[#v]&v[#v-1];for(i=2,#v-1,k=v[i-1]+v[i+1];u[i]=if(v[i],k==1,k==2));u;\n","language":"PARI-GP"},{"code":"cur = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]; for(n=0, 9, print(cur); cur = step(cur));\n","language":"PARI-GP"},{"code":"[0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0]\n[0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n","language":"PARI-GP"},{"code":"program Test;\n{$IFDEF FPC}{$MODE DELPHI}{$ELSE}{$APPTYPE}{$ENDIF}\nuses\n sysutils;\nconst\n cCHAR: array[0..1] of char = ('_','#');\ntype\n TRow = array of byte;\n\nfunction ConvertToRow(const s:string):tRow;\nvar\n i : NativeInt;\nBegin\n i := length(s);\n setlength(Result,length(s));\n For i := i downto 0 do\n result[i-1]:= ORD(s[i]=cChar[1]);\nend;\n\nfunction OutRow(const row:tRow):string;\n//create output string\nvar\n i: NativeInt;\nBegin\n i := length(row);\n setlength(result,i);\n For i := i downto 1 do\n result[i]:= cChar[row[i-1]];\nend;\n\nprocedure NextRow(row:pByteArray;MaxIdx:NativeInt);\n//compute next row in place by the using a small storage for the\n//2 values, that would otherwise be overridden\nvar\n leftValue,Value: NativeInt;\n i,trpCnt: NativeInt;\nBegin\n leftValue := 0;\n trpCnt := row[0]+row[1];\n\n i := 0;\n while i < MaxIdx do\n Begin\n Value := row[i];\n //the rule for survive : PopCnt == 2\n row[i] := ORD(trpCnt= 2);\n //reduce popcnt of element before\n dec(trpCnt,leftValue);\n //goto next element\n inc(i);\n leftValue := Value;\n //increment popcnt by right element\n inc(trpCnt,row[i+1]);\n //move to next position in ring buffer\n end;\n row[MaxIdx] := ORD(trpCnt= 2);\nend;\n\nconst\n TestString: string=' ### ## # # # # # ';\nvar\n s: string;\n row:tRow;\n i: NativeInt;\nbegin\n s := Teststring;\n row:= ConvertToRow(s);\n For i := 0 to 9 do\n Begin\n writeln(OutRow(row));\n NextRow(@row[0],High(row));\n end;\nend.\n","language":"Pascal"},{"code":"$_=\"_###_##_#_#_#_#__#__\\n\";\ndo {\n y/01/_#/;\n print;\n y/_#/01/;\n s/(?<=(.))(.)(?=(.))/$1 == $3 ? $1 ? 1-$2 : 0 : $2/eg;\n} while ($x ne $_ and $x=$_);\n","language":"Perl"},{"code":"$_=\"_###_##_#_#_#_#__#__\\n\";\n%h=qw(# _ _ #);\ndo {\n print;\n s/(?<=(.))(.)(?=(.))/$1 eq $3 ? $1 eq \"_\" ? \"_\" : $h{$2} : $2/eg;\n} while ($x ne $_ and $x=$_);\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"_###_##_#_#_#_#__#__\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'_'</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">toggled</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'#'</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'#'</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">130</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">curr</span>\n <span style=\"color: #000000;\">toggled</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">toggled</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">s</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">toggled</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"________________________#________________________\"</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'_'</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">toggled</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">24</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">curr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">curr</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'#'</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">130</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">curr</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">prev</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">curr</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 stklen var w\nw tolist 0 0 put\n0 w 1 + repeat var x2\n\n10 for\n\tdrop\n\tw for\n\t\tvar j\n\t\tj get 1 == if \"#\" else \"_\" endif print\n\t\tj 1 - get var p1 j get swap j 1 + get rot p1 + + 2 ==\n\t\tx2 swap j set var x2\n\tendfor\n\tnl\n\tdrop x2\nendfor\n","language":"Phixmonti"},{"code":"go =>\n % _ # # # _ # # _ # _ # _ # _ # _ _ # _ _\n S = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0],\n println(init=S),\n run_ca(S),\n nl,\n\n println(\"Some random inits:\"),\n _ = random2(),\n foreach(N in [5,10,20,50])\n S2 = [random() mod 2 : _I in 1..N],\n run_ca(S2),\n nl\n end.\n\n%\n% Run a CA and show the result.\n%\n\n% rule/1 is the default\nrun_ca(S) =>\n run_ca(S,rule).\nrun_ca(S,Rules) =>\n Len = S.length,\n All := [S],\n Seen = new_map(), % detect fixpoint and cycle\n while (not Seen.has_key(S))\n Seen.put(S,1),\n T = [S[1]] ++ [apply(Rules, slice(S,I-1,I+1)) : I in 2..Len-1] ++ [S[Len]],\n All := All ++ [T],\n S := T\n end,\n foreach(A in All) println(A.convert()) end,\n writeln(len=All.length).\n\n% Convert:\n% 0->\"_\"\n% 1->\"#\"\nconvert(L) = Res =>\n B = \"_#\",\n Res = [B[L[I]+1] : I in 1..L.length].\n\n% the rules\nrule([0,0,0]) = 0. %\nrule([0,0,1]) = 0. %\nrule([0,1,0]) = 0. % Dies without enough neighbours\nrule([0,1,1]) = 1. % Needs one neighbour to survive\nrule([1,0,0]) = 0. %\nrule([1,0,1]) = 1. % Two neighbours giving birth\nrule([1,1,0]) = 1. % Needs one neighbour to survive\nrule([1,1,1]) = 0. % Starved to death.\n","language":"Picat"},{"code":"go2 =>\n N = 4,\n Ns = [0 : _ in 1..N],\n S = Ns ++ [1] ++ Ns,\n run_ca(S, rule30).\n\n% The rules for rule 30\nrule30([0,0,0]) = 0.\nrule30([0,0,1]) = 1.\nrule30([0,1,0]) = 1.\nrule30([0,1,1]) = 1.\nrule30([1,0,0]) = 1.\nrule30([1,0,1]) = 0.\nrule30([1,1,0]) = 0.\nrule30([1,1,1]) = 0.\n","language":"Picat"},{"code":"(let Cells (chop \"_###_##_#_#_#_#__#__\")\n (do 10\n (prinl Cells)\n (setq Cells\n (make\n (link \"_\")\n (map\n '((L)\n (case (head 3 L)\n (`(mapcar chop '(\"___\" \"__#\" \"_#_\" \"#__\" \"###\"))\n (link \"_\") )\n (`(mapcar chop '(\"_##\" \"#_#\" \"##_\"))\n (link \"#\") ) ) )\n Cells )\n (link \"_\") ) ) ) )\n","language":"PicoLisp"},{"code":"one_dimensional_cellular_automata(L) :-\n\tmaplist(my_write, L), nl,\n\tlength(L, N),\n\tlength(LN, N),\n\t% there is a 0 before the beginning\n\tcompute_next([0 |L], LN),\n\t( L \\= LN -> one_dimensional_cellular_automata(LN); true).\n\n% All the possibilites\ncompute_next([0, 0, 0 | R], [0 | R1]) :-\n\tcompute_next([0, 0 | R], R1).\n\ncompute_next([0, 0, 1 | R], [0 | R1]) :-\n\tcompute_next([0, 1 | R], R1).\n\ncompute_next([0, 1, 0 | R], [0 | R1]) :-\n\tcompute_next([1, 0 | R], R1).\n\ncompute_next([0, 1, 1 | R], [1 | R1]) :-\n\tcompute_next([1, 1 | R], R1).\n\ncompute_next([1, 0, 0 | R], [0 | R1]) :-\n\tcompute_next([0, 0 | R], R1).\n\ncompute_next([1, 0, 1 | R], [1 | R1]) :-\n\tcompute_next([0, 1 | R], R1).\n\ncompute_next([1, 1, 0 | R], [1 | R1]) :-\n\tcompute_next([1, 0 | R], R1).\n\ncompute_next([1, 1, 1 | R], [0 | R1]) :-\n\tcompute_next([1, 1 | R], R1).\n\n% the last four possibilies =>\n% we consider that there is à 0 after the end\ncomplang jq># The 1-d cellular automaton:\ndef next:\n # Conveniently, jq treats null as 0 when it comes to addition\n # so there is no need to fiddle with the boundaries\n . as $old\n | reduce range(0; length) as $i\n ([];\n ($old[$i-1] + $old[$i+1]) as $s\n | if $s == 0 then .[$i] = 0\n elif $s == 1 then .[$i] = (if $old[$i] == 1 then 1 else 0 end)\n else .[$i] = (if $old[$i] == 1 then 0 else 1 end)\n end);\n\n\n# pretty-print an array:\ndef pp: reduce .[] as $i (\"\"; . + (if $i == 0 then \" \" else \"*\" end));\n\n# continue until quiescence:\ndef go: recurse(. as $prev | next | if . == $prev then empty else . end) | pp;\n\n# Example:\n[0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0] | goute_next([0, 0], [0]).\n\ncompute_next([1, 0], [0]).\n\ncompute_next([0, 1], [0]).\n\ncompute_next([1, 1], [1]).\n\nmy_write(0) :-\n\twrite(.).\n\nmy_write(1) :-\n\twrite(#).\n\none_dimensional_cellular_automata :-\n\tL = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0],\n\tone_dimensional_cellular_automata(L).\n","language":"Prolog"},{"code":"EnableExplicit\nDim cG.i(21)\nDim nG.i(21)\nDefine.i n, Gen\n\nDataSection\n Data.i 0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\nEndDataSection\nFor n=1 To 20\n Read.i cG(n)\nNext\n\nOpenConsole()\nRepeat\n Print(\"Generation \"+Str(Gen)+\": \")\n For n=1 To 20\n Print(Chr(95-cG(n)*60))\n Next\n Gen +1\n PrintN(\"\")\n For n=1 To 20\n If (cG(n) And (cG(n-1) XOr cg(n+1))) Or (Not cG(n) And (cG(n-1) And cg(n+1)))\n nG(n)=1\n Else\n nG(n)=0\n EndIf\n Next\n CopyArray(nG(), cG())\nUntil Gen > 9\n\nPrintN(\"Press any key to exit\"): Repeat: Until Inkey() <> \"\"\n","language":"PureBasic"},{"code":"import random\n\nprintdead, printlive = '_#'\nmaxgenerations = 10\ncellcount = 20\noffendvalue = '0'\n\nuniverse = ''.join(random.choice('01') for i in range(cellcount))\n\nneighbours2newstate = {\n '000': '0',\n '001': '0',\n '010': '0',\n '011': '1',\n '100': '0',\n '101': '1',\n '110': '1',\n '111': '0',\n }\n\nfor i in range(maxgenerations):\n print \"Generation %3i: %s\" % ( i,\n universe.replace('0', printdead).replace('1', printlive) )\n universe = offendvalue + universe + offendvalue\n universe = ''.join(neighbours2newstate[universe[i:i+3]] for i in range(cellcount))\n","language":"Python"},{"code":"import random\n\nnquads = 5\nmaxgenerations = 10\nfmt = '%%0%ix'%nquads\nnbits = 4*nquads\na = random.getrandbits(nbits) << 1\n#a = int('01110110101010100100', 2) << 1\nendmask = (2<<nbits)-2;\nendvals = 0<<(nbits+1) | 0\ntr = ('____', '___#', '__#_', '__##', '_#__', '_#_#', '_##_', '_###',\n '#___', '#__#', '#_#_', '#_##', '##__', '##_#', '###_', '####' )\nfor i in range(maxgenerations):\n print \"Generation %3i: %s\" % (i,(''.join(tr[int(t,16)] for t in (fmt%(a>>1)))))\n a |= endvals\n a = ((a&((a<<1) | (a>>1))) ^ ((a<<1)&(a>>1))) & endmask\n","language":"Python"},{"code":">>> gen = [ch == '#' for ch in '_###_##_#_#_#_#__#__']\n>>> for n in range(10):\n\tprint(''.join('#' if cell else '_' for cell in gen))\n\tgen = [0] + gen + [0]\n\tgen = [sum(gen[m:m+3]) == 2 for m in range(len(gen)-2)]\n\n\t\n_###_##_#_#_#_#__#__\n_#_#####_#_#_#______\n__##___##_#_#_______\n__##___###_#________\n__##___#_##_________\n__##____###_________\n__##____#_#_________\n__##_____#__________\n__##________________\n__##________________\n>>>\n","language":"Python"},{"code":"'''Cellular Automata'''\n\nfrom itertools import islice, repeat\nfrom functools import reduce\nfrom random import randint\n\n\n# nextRowByRule :: Int -> [Bool] -> [Bool]\ndef nextRowByRule(intRule):\n '''A row of booleans derived by Wolfram rule n\n from another boolean row of the same length.\n '''\n # step :: (Bool, Bool, Bool) -> Bool\n def step(l, x, r):\n return bool(intRule & 2**intFromBools([l, x, r]))\n\n # go :: [Bool] -> [Bool]\n def go(xs):\n return [False] + list(map(\n step,\n xs, xs[1:], xs[2:]\n )) + [False]\n return go\n\n\n# intFromBools :: [Bool] -> Int\ndef intFromBools(xs):\n '''Integer derived by binary interpretation\n of a list of booleans.\n '''\n def go(b, pn):\n power, n = pn\n return (2 * power, n + power if b else n)\n return foldr(go)([1, 0])(xs)[1]\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Samples of Wolfram rule evolutions.\n '''\n print(\n unlines(map(showRuleSample, [104, 30, 110]))\n )\n\n\n# ----------------------- DISPLAY ------------------------\n\n# showRuleSample :: Int -> String\ndef showRuleSample(intRule):\n '''16 steps in the evolution\n of a given Wolfram rule.\n '''\n return 'Rule ' + str(intRule) + ':\\n' + (\n unlines(map(\n showCells,\n take(16)(\n iterate(nextRowByRule(intRule))(\n onePixelInLineOf(64) if (\n bool(randint(0, 1))\n ) else randomPixelsInLineOf(64)\n )\n )\n ))\n )\n\n\n# boolsFromInt :: Int -> [Bool]\ndef boolsFromInt(n):\n '''List of booleans derived by binary\n decomposition of an integer.\n '''\n def go(x):\n return Just((x // 2, bool(x % 2))) if x else Nothing()\n return unfoldl(go)(n)\n\n\n# nBoolsFromInt :: Int -> Int -> [Bool]\ndef nBoolsFromInt(n):\n '''List of bools, left-padded to given length n,\n derived by binary decomposition of an integer x.\n '''\n def go(n, x):\n bs = boolsFromInt(x)\n return list(repeat(False, n - len(bs))) + bs\n return lambda x: go(n, x)\n\n\n# onePixelInLineOf :: Int -> [Bool]\ndef onePixelInLineOf(n):\n '''A row of n (mainly False) booleans,\n with a single True value in the middle.\n '''\n return nBoolsFromInt(n)(\n 2**(n // 2)\n )\n\n\n# randomPixelsInLineOf :: Int -> [Bool]\ndef randomPixelsInLineOf(n):\n '''A row of n booleans with pseudorandom values.\n '''\n return [bool(randint(0, 1)) for _ in range(1, 1 + n)]\n\n\n# showCells :: [Bool] -> String\ndef showCells(xs):\n '''A block string representation of a list of booleans.\n '''\n return ''.join([chr(9608) if x else ' ' for x in xs])\n\n\n# ----------------------- GENERIC ------------------------\n\n# Just :: 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 :: () -> 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# foldr :: (a -> b -> b) -> b -> [a] -> b\ndef foldr(f):\n '''Right to left reduction of a list,\n using the binary operator f, and\n starting with an initial accumulator value.\n '''\n def g(a, x):\n return f(x, a)\n return lambda acc: lambda xs: reduce(\n g, xs[::-1], acc\n )\n\n\n# iterate :: (a -> a) -> a -> Gen [a]\ndef iterate(f):\n '''An infinite list of repeated\n applications of f to x.\n '''\n def go(x):\n v = x\n while True:\n yield v\n v = f(v)\n return go\n\n\n# take :: Int -> [a] -> [a]\n# take :: Int -> String -> String\ndef take(n):\n '''The prefix of xs of length n,\n or xs itself if n > length xs.\n '''\n def go(xs):\n return (\n xs[0:n]\n if isinstance(xs, (list, tuple))\n else list(islice(xs, n))\n )\n return go\n\n\n# unfoldl :: (b -> Maybe (b, a)) -> b -> [a]\ndef unfoldl(f):\n '''Dual to reduce or foldl.\n Where these reduce a list to a summary value, unfoldl\n builds a list from a seed value.\n Where f returns Just(a, b), a is appended 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 x, r = v, v\n xs = []\n while True:\n mb = f(x)\n if mb.get('Nothing'):\n return xs\n else:\n x, r = mb.get('Just')\n xs.insert(0, r)\n return xs\n return go\n\n\n# unlines :: [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","language":"Python"},{"code":"DECLARE FUNCTION life$ (lastGen$)\nDECLARE FUNCTION getNeighbors! (group$)\nCLS\nstart$ = \"_###_##_#_#_#_#__#__\"\nnumGens = 10\nFOR i = 0 TO numGens - 1\n\tPRINT \"Generation\"; i; \": \"; start$\n\tstart$ = life$(start$)\nNEXT i\n\nFUNCTION getNeighbors (group$)\n\t\tans = 0\n\t\tIF (MID$(group$, 1, 1) = \"#\") THEN ans = ans + 1\n\t\tIF (MID$(group$, 3, 1) = \"#\") THEN ans = ans + 1\n\t\tgetNeighbors = ans\nEND FUNCTION\n\nFUNCTION life$ (lastGen$)\n\t\tnewGen$ = \"\"\n\t\tFOR i = 1 TO LEN(lastGen$)\n\t\t\tneighbors = 0\n\t\t\tIF (i = 1) THEN 'left edge\n\t\t\t\tIF MID$(lastGen$, 2, 1) = \"#\" THEN\n\t\t\t\t\tneighbors = 1\n\t\t\t\tELSE\n\t\t\t\t\tneighbors = 0\n\t\t\t\tEND IF\n\t\t\tELSEIF (i = LEN(lastGen$)) THEN 'right edge\n\t\t\t\tIF MID$(lastGen$, LEN(lastGen$) - 1, 1) = \"#\" THEN\n\t\t\t\t\tneighbors = 1\n\t\t\t\tELSE\n\t\t\t\t\tneighbors = 0\n\t\t\t\tEND IF\n\t\t\tELSE 'middle\n\t\t\t\tneighbors = getNeighbors(MID$(lastGen$, i - 1, 3))\n\t\t\tEND IF\n\n\t\t\tIF (neighbors = 0) THEN 'dies or stays dead with no neighbors\n\t\t\t\tnewGen$ = newGen$ + \"_\"\n\t\t\tEND IF\n\t\t\tIF (neighbors = 1) THEN 'stays with one neighbor\n\t\t\t\tnewGen$ = newGen$ + MID$(lastGen$, i, 1)\n\t\t\tEND IF\n\t\t\tIF (neighbors = 2) THEN 'flips with two neighbors\n\t\t\t\tIF MID$(lastGen$, i, 1) = \"#\" THEN\n\t\t\t\t\tnewGen$ = newGen$ + \"_\"\n\t\t\t\tELSE\n\t\t\t\t\tnewGen$ = newGen$ + \"#\"\n\t\t\t\tEND IF\n\t\t\tEND IF\n\t\tNEXT i\n\t\tlife$ = newGen$\nEND FUNCTION\n","language":"QBasic"},{"code":" [ stack 0 ] is cells ( --> s )\n\n [ dup size cells replace\n 0 swap witheach\n [ char # =\n | 1 << ] ] is setup ( $ --> n )\n\n [ 0 swap\n cells share times\n [ dup i >> 7 &\n [ table 0 0 0 1 0 1 1 0 ]\n rot 1 << | swap ]\n drop 1 << ] is nextline ( n --> n )\n\n [ cells share times\n [ dup i 1+ bit &\n iff [ char # ]\n else [ char _ ]\n emit ]\n cr drop ] is echoline ( n --> )\n\n [ setup\n [ dup echoline\n dup nextline\n tuck = until ]\n echoline ] is automate ( $ --> )\n\n $ \"_###_##_#_#_#_#__#__\" automate\n","language":"Quackery"},{"code":"set.seed(15797, kind=\"Mersenne-Twister\")\n\nmaxgenerations = 10\ncellcount = 20\noffendvalue = FALSE\n\n## Cells are alive if TRUE, dead if FALSE\nuniverse <- c(offendvalue,\n sample( c(TRUE, FALSE), cellcount, replace=TRUE),\n offendvalue)\n\n## List of patterns in which the cell stays alive\nstayingAlive <- lapply(list(c(1,1,0),\n c(1,0,1),\n c(0,1,0)), as.logical)\n\n## x : length 3 logical vector\n## map: list of length 3 logical vectors that map to patterns\n## in which x stays alive\ndeadOrAlive <- function(x, map) list(x) %in% map\n\ncellularAutomata <- function(x, map) {\n c(x[1], apply(embed(x, 3), 1, deadOrAlive, map=map), x[length(x)])\n}\n\ndeadOrAlive2string <- function(x) {\n paste(ifelse(x, '#', '_'), collapse=\"\")\n}\n\nfor (i in 1:maxgenerations) {\n universe <- cellularAutomata(universe, stayingAlive)\n cat(format(i, width=3), deadOrAlive2string(universe), \"\\n\")\n}\n","language":"R"},{"code":"#lang racket\n\n(define (update cells)\n (for/list ([crowding (map +\n (append '(0) (drop-right cells 1))\n cells\n (append (drop cells 1) '(0)))])\n (if (= 2 crowding) 1 0)))\n\n(define (life-of cells time)\n (unless (zero? time)\n (displayln cells)\n (life-of (update cells) (sub1 time))))\n\n(life-of '(0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0)\n 10)\n\n#| (0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0)\n (0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0)\n (0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0) |#\n","language":"Racket"},{"code":"#lang slideshow\n\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n;; Simulation of cellular automata, as described by Stephen Wolfram in his 1983 paper.\n;; Uses Racket's inline image display capability for visual presentation\t\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\n\n(require racket/draw)\n(require slideshow)\n\n(define *rules* '((1 1 1) (1 1 0) (1 0 1) (1 0 0)\n\t\t (0 1 1) (0 1 0) (0 0 1) (0 0 0)))\n\n(define (bordered-square n)\n (filled-rectangle n n #:draw-border? #t))\n\n(define (draw-row lst)\n (apply hc-append 2 (map (λ (x) (colorize (bordered-square 10) (cond ((= x 0) \"gray\")\n\t\t\t\t\t\t\t\t ((= x 1) \"red\")\n\t\t\t\t\t\t\t\t (else \"gray\"))))\n\t\t\t lst)))\n\n(define (extract-neighborhood nth prev-row)\n (take (drop (append '(0) prev-row '(0)) nth) 3))\n\n(define (automaton-to-bits n)\n (reverse (map (λ (y) (if (zero? (bitwise-and y n)) 0 1))\n\t\t(map (λ (x) (expt 2 x)) (range 0 8)))))\n\n(define (get-rules bits)\n (map cdr (filter (λ (x) (= (car x) 1)) (map cons bits *rules*))))\n\n(define (advance-row old-row rules)\n (let ([new '()])\n (for ([i (in-range 0 (length old-row))])\n (set! new (cons (if (member (extract-neighborhood i old-row)\n\t\t\t\t rules) 1 0) new)))\n (reverse new)))\n\n(define (draw-automaton automaton init-row row-number)\n (let* ([bit-representation (automaton-to-bits automaton)]\n\t [rules (get-rules bit-representation)]\n\t [rows (list init-row)])\n (for ([i (in-range 1 row-number)])\n (set! rows (cons (advance-row (car rows) rules)\n\t\t rows)))\n (apply vc-append 2 (map draw-row (reverse rows)))))\n\n(draw-automaton 104 '(0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0) 10)\n","language":"Racket"},{"code":"class Automaton {\n has $.rule;\n has @.cells;\n has @.code = $!rule.fmt('%08b').flip.comb».Int;\n\n method gist { \"|{ @!cells.map({+$_ ?? '#' !! ' '}).join }|\" }\n\n method succ {\n self.new: :$!rule, :@!code, :cells(\n @!code[\n 4 «*« @!cells.rotate(-1)\n »+« 2 «*« @!cells\n »+« @!cells.rotate(1)\n ]\n )\n }\n}\n\n# The rule proposed for this task is rule 0b01101000 = 104\n\nmy @padding = 0 xx 5;\nmy Automaton $a .= new:\n rule => 104,\n cells => flat @padding, '111011010101'.comb, @padding\n;\nsay $a++ for ^10;\n\n\n# Rule 104 is not particularly interesting so here is [[wp:Rule 90|Rule 90]],\n# which shows a [[wp:Sierpinski Triangle|Sierpinski Triangle]].\n\nsay '';\n@padding = 0 xx 25;\n$a = Automaton.new: :rule(90), :cells(flat @padding, 1, @padding);\n\nsay $a++ for ^20;\n","language":"Raku"},{"code":"Red [\n Purpose: \"One-dimensional cellular automata\"\n Author: \"Joe Smith\"\n]\n\nvals: [0 1 0]\nkill: [[0 0] [#[none] 0] [0 #[none]]]\nevo: function [petri] [\n\tnew-petri: copy petri\n\twhile [petri/1] [\n\t\tif all [petri/-1 = 1 petri/2 = 1] [new-petri/1: select vals petri/1]\n\t\tif find/only kill reduce [petri/-1 petri/2] [new-petri/1: 0]\n\t\tpetri: next petri new-petri: next new-petri\n\t]\n\tpetri: head petri new-petri: head new-petri\n\tclear insert petri new-petri\n]\n\ndisplay: function [petri] [\n\tprint replace/all (replace/all to-string petri \"0\" \"_\") \"1\" \"#\"\n\tpetri\t\n]\n\nloop 10 [\n\tevo display [1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0]\n]\n","language":"Red"},{"code":"# 1D Cellular Automota\n\nAssume an array of cells with an initial distribution of live and\ndead cells, and imaginary cells off the end of the array having\nfixed values.\n\nCells in the next generation of the array are calculated based on\nthe value of the cell and its left and right nearest neighbors in\nthe current generation.\n\nIf, in the following table, a live cell is represented by 1 and a\ndead cell by 0 then to generate the value of the cell at a particular\nindex in the array of cellular values you use the following table:\n\n000 -> 0 #\n001 -> 0 #\n010 -> 0 # Dies without enough neighbours\n011 -> 1 # Needs one neighbour to survive\n100 -> 0 #\n101 -> 1 # Two neighbours giving birth\n110 -> 1 # Needs one neighbour to survive\n111 -> 0 # Starved to death.\n\nI had originally written an implementation of this in RETRO 11.\nFor RETRO 12 I took advantage of new language features and some\nfurther considerations into the rules for this task.\n\nThe first word, `string,` inlines a string to `here`. I'll use\nthis to setup the initial input.\n\n~~~\n:string, (s-) [ , ] s:for-each #0 , ;\n~~~\n\nThe next two lines setup an initial generation and a buffer for\nthe evolved generation. In this case, `This` is the current\ngeneration and `Next` reflects the next step in the evolution.\n\n~~~\n'This d:create\n '.###.##.#.#.#.#..#.. string,\n\n'Next d:create\n '.................... string,\n~~~\n\nI use `display` to show the current generation.\n\n~~~\n:display (-)\n &This s:put nl ;\n~~~\n\nAs might be expected, `update` copies the `Next` generation to\nthe `This` generation, setting things up for the next cycle.\n\n~~~\n:update (-)\n &Next &This dup s:length copy ;\n~~~\n\nThe word `group` extracts a group of three cells. This data will\nbe passed to `evolve` for processing.\n\n~~~\n:group (a-nnn)\n [ fetch ]\n [ n:inc fetch ]\n [ n:inc n:inc fetch ] tri ;\n~~~\n\nI use `evolve` to decide how a cell should change, based on its\ninitial state with relation to its neighbors.\n\nIn the prior implementation this part was much more complex as I\ntallied things up and had separate conditions for each combination.\nThis time I take advantage of the fact that only cells with two\nneighbors will be alive in the next generation. So the process is:\n\n- take the data from `group`\n- compare to `$#` (for living cells)\n- add the flags\n- if the result is `#-2`, the cell should live\n- otherwise it'll be dead\n\n~~~\n:evolve (nnn-c)\n [ $# eq? ] tri@ + +\n #-2 eq? [ $# ] [ $. ] choose ;\n~~~\n\nFor readability I separated out the next few things. `at` takes an\nindex and returns the address in `This` starting with the index.\n\n~~~\n:at (n-na)\n &This over + ;\n~~~\n\nThe `record` word adds the evolved value to a buffer. In this case\nmy `generation` code will set the buffer to `Next`.\n\n~~~\n:record (c-)\n buffer:add n:inc ;\n~~~\n\nAnd now to tie it all together. Meet `generation`, the longest bit\nof code in this sample. It has several bits:\n\n- setup a new buffer pointing to `Next`\n\n - this also preserves the old buffer\n\n- setup a loop for each cell in `This`\n\n - initial loop index at -1, to ensure proper dummy state for first cell\n - get length of `This` generation\n\n- perform a loop for each item in the generation, updating `Next` as it goes\n\n- copy `Next` to `This` using `update`.\n\n~~~\n:generation (-)\n [ &Next buffer:set\n #-1 &This s:length\n [ at group evolve record ] times drop\n update\n ] buffer:preserve ;\n~~~\n\nThe last bit is a helper. It takes a number of generations and displays\nthe state, then runs a `generation`.\n\n~~~\n:generations (n-)\n [ display generation ] times ;\n~~~\n\nAnd a text. The output should be:\n\n .###.##.#.#.#.#..#..\n .#.#####.#.#.#......\n ..##...##.#.#.......\n ..##...###.#........\n ..##...#.##.........\n ..##....###.........\n ..##....#.#.........\n ..##.....#..........\n ..##................\n ..##................\n\n~~~\n#10 generations\n~~~\n","language":"Retro"},{"code":"/*REXX program generates & displays N generations of one─dimensional cellular automata. */\nparse arg $ gens . /*obtain optional arguments from the CL*/\nif $=='' | $==\",\" then $=001110110101010 /*Not specified? Then use the default.*/\nif gens=='' | gens==\",\" then gens=40 /* \" \" \" \" \" \" */\n\n do #=0 for gens /* process the one-dimensional cells.*/\n say \" generation\" right(#,length(gens)) ' ' translate($, \"#·\", 10)\n @=0 /* [↓] generation.*/\n do j=2 for length($) - 1; x=substr($, j-1, 3) /*obtain the cell.*/\n if x==011 | x==101 | x==110 then @=overlay(1, @, j) /*the cell lives. */\n else @=overlay(0, @, j) /* \" \" dies. */\n end /*j*/\n\n if $==@ then do; say right('repeats', 40); leave; end /*does it repeat? */\n $=@ /*now use the next generation of cells.*/\n end /*#*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"# Project : One-dimensional cellular automata\n\nrule = [\"0\", \"0\", \"0\", \"1\", \"0\", \"1\", \"1\", \"0\"]\nnow = \"01110110101010100100\"\n\nfor generation = 0 to 9\n see \"generation \" + generation + \": \" + now + nl\n nxt = \"\"\n for cell = 1 to len(now)\n str = \"bintodec(\" + '\"' +substr(\"0\"+now+\"0\", cell, 3) + '\"' + \")\"\n eval(\"p=\" + str)\n nxt = nxt + rule[p+1]\n next\n temp = nxt\n nxt = now\n now = temp\nnext\n\nfunc bintodec(bin)\n binsum = 0\n for n=1 to len(bin)\n binsum = binsum + number(bin[n]) *pow(2, len(bin)-n)\n next\n return binsum\n","language":"Ring"},{"code":"def evolve(ary)\n ([0]+ary+[0]).each_cons(3).map{|a,b,c| a+b+c == 2 ? 1 : 0}\nend\n\ndef printit(ary)\n puts ary.join.tr(\"01\",\".#\")\nend\n\nary = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\nprintit ary\nuntil ary == (new = evolve(ary))\n printit ary = new\nend\n","language":"Ruby"},{"code":"fn get_new_state(windowed: &[bool]) -> bool {\n match windowed {\n [false, true, true] | [true, true, false] => true,\n _ => false\n }\n}\n\nfn next_gen(cell: &mut [bool]) {\n let mut v = Vec::with_capacity(cell.len());\n v.push(cell[0]);\n for i in cell.windows(3) {\n v.push(get_new_state(i));\n }\n v.push(cell[cell.len() - 1]);\n cell.copy_from_slice(&v);\n}\n\nfn print_cell(cell: &[bool]) {\n for v in cell {\n print!(\"{} \", if *v {'#'} else {' '});\n }\n println!();\n}\n\nfn main() {\n\n const MAX_GENERATION: usize = 10;\n const CELLS_LENGTH: usize = 30;\n\n let mut cell: [bool; CELLS_LENGTH] = rand::random();\n\n for i in 1..=MAX_GENERATION {\n print!(\"Gen {:2}: \", i);\n print_cell(&cell);\n next_gen(&mut cell);\n }\n}\n","language":"Rust"},{"code":"def cellularAutomata(s: String) = {\n def it = Iterator.iterate(s) ( generation =>\n (\"_%s_\" format generation).iterator\n sliding 3\n map (_ count (_ == '#'))\n map Map(2 -> \"#\").withDefaultValue(\"_\")\n mkString\n )\n\n (it drop 1) zip it takeWhile Function.tupled(_ != _) map (_._2) foreach println\n}\n","language":"Scala"},{"code":"(define (next-generation left petri-dish right)\n (if (null? petri-dish)\n (list)\n (cons (if (= (+ left\n (car petri-dish)\n (if (null? (cdr petri-dish))\n right\n (cadr petri-dish)))\n 2)\n 1\n 0)\n (next-generation (car petri-dish) (cdr petri-dish) right))))\n\n(define (display-evolution petri-dish generations)\n (if (not (zero? generations))\n (begin (display petri-dish)\n (newline)\n (display-evolution (next-generation 0 petri-dish 0)\n (- generations 1)))))\n\n(display-evolution (list 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0) 10)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst string: start is \"_###_##_#_#_#_#__#__\";\n\nconst proc: main is func\n local\n var string: g0 is start;\n var string: g1 is start;\n var integer: generation is 0;\n var integer: i is 0;\n begin\n writeln(g0);\n for generation range 0 to 9 do\n for i range 2 to pred(length(g0)) do\n if g0[i-1] <> g0[i+1] then\n g1 @:= [i] g0[i];\n elsif g0[i] = '_' then\n g1 @:= [i] g0[i-1];\n else\n g1 @:= [i] '_'\n end if;\n end for;\n writeln(g1);\n g0 := g1;\n end for;\n end func;\n","language":"Seed7"},{"code":"import <Utilities/Conversion.sl>;\n\nmain(args(2)) :=\n run(args[1], stringToInt(args[2])) when size(args) = 2\nelse\n \"Usage error: exec <initialCells> <generations>\";\n\nstringToCells(string(1))[i] := 0 when string[i] = '_' else 1;\ncellsToString(cells(1))[i] := '#' when cells[i] = 1 else '_';\n\nrun(cellsString(1), generations) :=\n runHelper(stringToCells(cellsString), generations, cellsString);\n\nrunHelper(cells(1), generations, result(1)) :=\n let\n nextCells := step(cells);\n in\n result when generations = 0\n else\n runHelper(nextCells, generations - 1,\n result ++ \"\\n\" ++ cellsToString(nextCells));\n\nstep(cells(1))[i] :=\n let\n left := cells[i-1] when i > 1 else 0;\n right := cells[i + 1] when i < size(cells) else 0;\n in\n 1 when (left + cells[i] + right) = 2\n else\n 0;\n","language":"SequenceL"},{"code":"var seq = \"_###_##_#_#_#_#__#__\";\nvar x = '';\n\nloop {\n seq.tr!('01', '_#');\n say seq;\n seq.tr!('_#', '01');\n seq.gsub!(/(?<=(.))(.)(?=(.))/, {|s1,s2,s3| s1 == s3 ? (s1 ? 1-s2 : 0) : s2});\n (x != seq) && (x = seq) || break;\n}\n","language":"Sidef"},{"code":"class Automaton(rule, cells) {\n\n method init {\n rule = sprintf(\"%08b\", rule).chars.map{.to_i}.reverse;\n }\n\n method next {\n var previous = cells.map{_};\n var len = previous.len;\n cells[] = rule[\n previous.range.map { |i|\n 4*previous[i-1 % len] +\n 2*previous[i] +\n previous[i+1 % len]\n }...\n ]\n }\n\n method to_s {\n cells.map { _ ? '#' : ' ' }.join;\n }\n}\n\nvar size = 10;\nvar auto = Automaton(\n rule: 104,\n cells: [(size/2).of(0)..., 111011010101.digits..., (size/2).of(0)...],\n);\n\nsize.times {\n say \"|#{auto}|\";\n auto.next;\n}\n","language":"Sidef"},{"code":" 10 LET N$=\"01110110101010100100\"\n 20 LET G=1\n 30 PRINT N$\n 40 LET O$=N$\n 50 LET N$=\"\"\n 60 PRINT AT 0,28;G\n 70 LET N=0\n 80 FOR I=1 TO LEN O$\n 90 IF I=1 THEN GOTO 120\n100 LET N=VAL O$(I-1)\n110 IF I=LEN O$ THEN GOTO 130\n120 LET N=N+VAL O$(I+1)\n130 IF N=0 THEN LET N$=N$+\"0\"\n140 IF N=1 THEN LET N$=N$+O$(I)\n150 IF N=2 THEN LET N$=N$+STR$ NOT VAL O$(I)\n160 PRINT AT 0,I-1;N$(I)\n170 NEXT I\n180 LET G=G+1\n190 IF N$<>O$ THEN GOTO 40\n","language":"Sinclair-ZX81-BASIC"},{"code":"proc evolve {a} {\n set new [list]\n for {set i 0} {$i < [llength $a]} {incr i} {\n lappend new [fate $a $i]\n }\n return $new\n}\n\nproc fate {a i} {\n return [expr {[sum $a $i] == 2}]\n}\n\nproc sum {a i} {\n set sum 0\n set start [expr {$i - 1 < 0 ? 0 : $i - 1}]\n set end [expr {$i + 1 >= [llength $a] ? $i : $i + 1}]\n for {set j $start} {$j <= $end} {incr j} {\n incr sum [lindex $a $j]\n }\n return $sum\n}\n\nproc print {a} {\n puts [string map {0 _ 1 #} [join $a \"\"]]\n}\n\nproc parse {s} {\n return [split [string map {_ 0 # 1} $s] \"\"]\n}\n\nset array [parse \"_###_##_#_#_#_#__#__\"]\nprint $array\nwhile {[set new [evolve $array]] ne $array} {\n set array $new\n print $array\n}\n","language":"Tcl"},{"code":"#import std\n#import nat\n\nrule = -$<0,0,0,&,0,&,&,0>@rSS zipp0*ziD iota8\n\nstep = rule*+ swin3+ :/0+ --<0>\n\nevolve \"n\" = @iNC ~&x+ rep\"n\" ^C/step@h ~&\n\n#show+\n\nexample = ~&?(`#!,`.!)** evolve10 <0,&,&,&,0,&,&,0,&,0,&,0,&,0,0,&,0,0>\n","language":"Ursala"},{"code":"IT(\"Gen 0: ..###.##.#.#.#.#..#.....\") // initial pattern\n#9 = Cur_Col\n\nfor (#8 = 1; #8 < 10; #8++) { // 10 generations\n Goto_Col(7)\n Reg_Empty(20)\n while (Cur_Col < #9-1) {\n if (Match(\"|{##|!#,#.#,|!###}\")==0) {\n Reg_Set(20, \"#\", APPEND)\n } else {\n Reg_Set(20, \".\", APPEND)\n }\n Char\n }\n EOL IN\n IT(\"Gen \") Num_Ins(#8, LEFT+NOCR) IT(\": \")\n Reg_Ins(20)\n}\n","language":"Vedit-macro-language"},{"code":"Gen 0: ..###.##.#.#.#.#..#.....\nGen 1: ..#.#####.#.#.#.........\nGen 2: ...##...##.#.#..........\nGen 3: ...##...###.#...........\nGen 4: ...##...#.##............\nGen 5: ...##....###............\nGen 6: ...##....#.#............\nGen 7: ...##.....#.............\nGen 8: ...##...................\nGen 9: ...##...................\n","language":"Vedit-macro-language"},{"code":"Imports System.Text\n\nModule CellularAutomata\n\n Private Enum PetriStatus\n Active\n Stable\n Dead\n End Enum\n\n Function Main(ByVal cmdArgs() As String) As Integer\n If cmdArgs.Length = 0 Or cmdArgs.Length > 1 Then\n Console.WriteLine(\"Command requires string of either 1s and 0s or #s and _s.\")\n Return 1\n End If\n\n Dim petriDish As BitArray\n\n Try\n petriDish = InitialisePetriDish(cmdArgs(0))\n Catch ex As Exception\n Console.WriteLine(ex.Message)\n Return 1\n End Try\n\n Dim generation As Integer = 0\n Dim ps As PetriStatus = PetriStatus.Active\n\n Do While True\n If ps = PetriStatus.Stable Then\n Console.WriteLine(\"Sample stable after {0} generations.\", generation - 1)\n Exit Do\n Else\n Console.WriteLine(\"{0}: {1}\", generation.ToString(\"D3\"), BuildDishString(petriDish))\n If ps = PetriStatus.Dead Then\n Console.WriteLine(\"Sample dead after {0} generations.\", generation)\n Exit Do\n End If\n End If\n\n ps = GetNextGeneration(petriDish)\n generation += 1\n Loop\n\n Return 0\n End Function\n\n Private Function InitialisePetriDish(ByVal Sample As String) As BitArray\n Dim PetriDish As New BitArray(Sample.Length)\n Dim dead As Boolean = True\n\n For i As Integer = 0 To Sample.Length - 1\n Select Case Sample.Substring(i, 1)\n Case \"1\", \"#\"\n PetriDish(i) = True\n dead = False\n Case \"0\", \"_\"\n PetriDish(i) = False\n Case Else\n Throw New Exception(\"Illegal value in string position \" & i)\n Return Nothing\n End Select\n Next\n\n If dead Then\n Throw New Exception(\"Entered sample is dead.\")\n Return Nothing\n End If\n\n Return PetriDish\n End Function\n\n Private Function GetNextGeneration(ByRef PetriDish As BitArray) As PetriStatus\n Dim petriCache = New BitArray(PetriDish.Length)\n Dim neighbours As Integer\n Dim stable As Boolean = True\n Dim dead As Boolean = True\n\n For i As Integer = 0 To PetriDish.Length - 1\n neighbours = 0\n If i > 0 AndAlso PetriDish(i - 1) Then neighbours += 1\n If i < PetriDish.Length - 1 AndAlso PetriDish(i + 1) Then neighbours += 1\n\n petriCache(i) = (PetriDish(i) And neighbours = 1) OrElse (Not PetriDish(i) And neighbours = 2)\n If PetriDish(i) <> petriCache(i) Then stable = False\n If petriCache(i) Then dead = False\n Next\n\n PetriDish = petriCache\n\n If dead Then Return PetriStatus.Dead\n If stable Then Return PetriStatus.Stable\n Return PetriStatus.Active\n\n End Function\n\n Private Function BuildDishString(ByVal PetriDish As BitArray) As String\n Dim sw As New StringBuilder()\n For Each b As Boolean In PetriDish\n sw.Append(IIf(b, \"#\", \"_\"))\n Next\n\n Return sw.ToString()\n End Function\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"def (gens n l)\n prn l\n repeat n\n zap! gen l\n prn l\n\ndef (gen l)\n with (a nil b nil c l.0)\n collect nil # won't insert paren without second token\n each x cdr.l\n shift! a b c x\n yield (next a b c)\n yield (next b c nil)\n\ndef (next a b c) # next state of b given neighbors a and c\n if (and a c) not.b\n (or a c) b\n","language":"Wart"},{"code":"def (uca l) # new datatype: Uni-dimensional Cellular Automaton\n (tag uca (list l len.l))\n\ndef (len l) :case (isa uca l) # how to compute its length\n rep.l.1\n\ndefcoerce uca list # how to convert it to a list\n (fn(_) rep._.0)\n\ndef (pr l) :case (isa uca l) # how to print it\n each x l # transparently coerces to a list for iterating over\n pr (if x \"#\" \"_\")\n\n# (l i) returns ith cell when l is a uca, and nil when i is out-of-bounds\ndefcall uca (l i)\n if (0 <= i < len.l)\n rep.l.0.i\n\ndef (gens n l)\n prn l\n repeat n\n zap! gen l\n prn l\n\ndef (gen l)\n uca+collect+for i 0 (i < len.l) ++i\n yield (next (l i-1) l.i (l i+1))\n\n# next state of b, given neighbors a and c\ndef (next a b c)\n if (and a c) not.b\n (or a c) b\n","language":"Wart"},{"code":"var trans = \"___#_##_\"\n\nvar v = Fn.new { |cell, i| (cell[i] != \"_\") ? 1 : 0 }\n\nvar evolve = Fn.new { |cell, backup|\n var len = cell.count - 2\n var diff = 0\n for (i in 1...len) {\n /* use left, self, right as binary number bits for table index */\n backup[i] = trans[v.call(cell, i - 1) * 4 + v.call(cell, i) * 2 + v.call(cell, i + 1)]\n diff = diff + ((backup[i] != cell[i]) ? 1 : 0)\n }\n cell.clear()\n cell.addAll(backup)\n return diff != 0\n}\n\nvar c = \"_###_##_#_#_#_#__#__\".toList\nvar b = \"____________________\".toList\nwhile(true) {\n System.print(c[1..-1].join())\n if (!evolve.call(c,b)) break\n}\n","language":"Wren"},{"code":"code ChOut=8, CrLf=9;\nint Gen, Now, New, I;\n[Now:= $076A_A400;\nfor Gen:= 1 to 10 do\n [for I:= 31 downto 0 do ChOut(0, if Now & 1<<I then ^# else ^_);\n CrLf(0);\n New:= 0;\n for I:= 30 downto 1 do\n case Now>>(I-1) & 7 of %011, %101, %110: New:= New ! 1<<I other;\n Now:= New;\n ];\n]\n","language":"XPL0"},{"code":"10 n=10:READ w:DIM x(w+1),x2(w+1):FOR i=1 to w:READ x(i):NEXT\n20 FOR k=1 TO n\n30 FOR j=1 TO w\n40 IF x(j) THEN PRINT \"#\"; ELSE PRINT \"_\"; END IF\n50 IF x(j-1)+x(j)+x(j+1)=2 THEN x2(j)=1 ELSE x2(j)=0 END IF\n60 NEXT:PRINT\n70 FOR j=1 TO w:x(j)=x2(j):NEXT\n80 NEXT\n90 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\n","language":"Yabasic"},{"code":"start$ = \"0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\"\n\ndim x$(1)\n\nfor k = 1 to 10\n n = token(start$, x$(), \",\")\n redim x$(n+1)\n start$ = \"\"\n for j = 1 to n\n if val(x$(j)) then print \"#\"; else print \"_\"; end if\n test = abs(val(x$(j-1)) + val(x$(j)) + val(x$(j+1)) = 2)\n start$ = start$ + str$(test) + \",\"\n next j\n print\nnext k\n","language":"Yabasic"},{"code":"fcn life1D(line){\n right:=line[1,*] + False; // shift left, False fill\n left :=T(False).extend(line[0,-1]); // shift right\n left.zip(line,right).apply(fcn(hood){ hood.sum(0)==2 });\n}\n","language":"Zkl"},{"code":"chars:=T(\"_\",\"#\");\ncells:=\"_###_##_#_#_#_#__#__\".split(\"\").apply('==(\"#\")); //-->L(False,True,True,True,False...)\ndo(10){ cells.apply(chars.get).concat().println(); cells=life1D(cells); }\n","language":"Zkl"},{"code":"fcn life1D(line){\n right:=line[1,*] + \"_\"; // shift left, \"_\" fill\n left :=\"_\" + line[0,-1]; // shift right\n Utils.Helpers.zipWith(\n fcn(a,b,c){ (String(a,b,c) - \"_\") == \"##\" and \"#\" or \"_\" },\n left,line,right).concat();\n}\n","language":"Zkl"},{"code":"cells:=\"_###_##_#_#_#_#__#__\";\ndo(10){ cells.println(); cells=life1D(cells); }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Cellular automata\\nfrom: http://rosettacode.org/wiki/One-dimensional_cellular_automata\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Assume an array of cells with an initial distribution of live and dead cells, \\nand imaginary cells off the end of the array having fixed values.\\n\\nCells in the next generation of the array are calculated based on the value of the cell and its left and right nearest neighbours in the current generation.\\n\\nIf, in the following table, a live cell is represented by 1 and a dead cell by 0 then to generate the value of the cell at a particular index in the array of cellular values you use the following table:\\n\\n 0'''0'''0 -> 0 # \\n 0'''0'''1 -> 0 #\\n 0'''1'''0 -> 0 # Dies without enough neighbours\\n 0'''1'''1 -> 1 # Needs one neighbour to survive\\n 1'''0'''0 -> 0 #\\n 1'''0'''1 -> 1 # Two neighbours giving birth\\n 1'''1'''0 -> 1 # Needs one neighbour to survive\\n 1'''1'''1 -> 0 # Starved to death.\\n\\n;Related tasks:\\n* [[Elementary_cellular_automaton|Elementary cellular automaton]]\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V gen = ‘_###_##_#_#_#_#__#__’.map(ch -> Int(ch == ‘#’))\\nL(n) 10\\n print(gen.map(cell -> (I cell != 0 {‘#’} E ‘_’)).join(‘’))\\n gen = [0] [+] gen [+] [0]\\n gen = (0 .< gen.len - 2).map(m -> Int(sum(:gen[m .+ 3]) == 2))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"\\\\ one-dimensional automaton\\n\\n\\\\ direct map of input state to output state:\\n{\\n \\\" \\\" : 32,\\n \\\" #\\\" : 32,\\n \\\" # \\\" : 32,\\n \\\" ##\\\" : 35,\\n \\\"# \\\" : 32,\\n \\\"# #\\\" : 35,\\n \\\"## \\\" : 35,\\n \\\"###\\\" : 32,\\n} var, lifemap\\n\\n: transition \\\\ s ix (r:s') -- (r:s')\\n >r dup r@ n:1- 3 s:slice\\n lifemap @ swap caseof\\n r> swap r@ -rot s:! >r ;\\n\\n\\\\ run over 'state' and generate new state\\n: gen \\\\ s -- s'\\n clone >r\\n dup s:len 2 n:-\\n ' transition 1 rot loop\\n drop r> ;\\n\\n: life \\\\ s -- s'\\n dup . cr gen ;\\n\\n\\\" ### ## # # # # # \\\" ' life 10 times\\nbye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"(defun rc-step-r (cells)\\n (if (endp (rest cells))\\n nil\\n (cons (if (second cells)\\n (xor (first cells) (third cells))\\n (and (first cells) (third cells)))\\n (rc-step-r (rest cells)))))\\n\\n(defun rc-step (cells)\\n (cons (and (first cells) (second cells))\\n (rc-step-r cells)))\\n\\n(defun rc-steps-r (cells n prev)\\n (declare (xargs :measure (nfix n)))\\n (if (or (zp n) (equal cells prev))\\n nil\\n (let ((new (rc-step cells)))\\n (cons new (rc-steps-r new (1- n) cells)))))\\n\\n(defun rc-steps (cells n)\\n (cons cells (rc-steps-r cells n nil)))\\n\\n(defun pretty-row (row)\\n (if (endp row)\\n (cw \\\"~%\\\")\\n (prog2$ (cw (if (first row) \\\"#\\\" \\\"-\\\"))\\n (pretty-row (rest row)))))\\n\\n(defun pretty-output (out)\\n (if (endp out)\\n nil\\n (prog2$ (pretty-row (first out))\\n (pretty-output (rest out)))))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"CHAR FUNC CalcCell(CHAR prev,curr,next)\\n IF prev='. AND curr='# AND next='# THEN\\n RETURN ('#)\\n ELSEIF prev='# AND curr='. AND next='# THEN\\n RETURN ('#)\\n ELSEIF prev='# AND curr='# AND next='. THEN\\n RETURN ('#)\\n FI\\nRETURN ('.)\\n\\nPROC NextGeneration(CHAR ARRAY s)\\n BYTE i\\n CHAR prev,curr,next\\n\\n IF s(0)<4 THEN RETURN FI\\n prev=s(1) curr=s(2) next=s(3)\\n i=2\\n DO\\n s(i)=CalcCell(prev,curr,next)\\n i==+1\\n IF i=s(0) THEN EXIT FI\\n prev=curr curr=next next=s(i+1)\\n OD\\nRETURN\\n\\nPROC Main()\\n DEFINE MAXGEN=\\\"9\\\"\\n CHAR ARRAY s=\\\".###.##.#.#.#.#..#..\\\"\\n BYTE i\\n\\n FOR i=0 TO MAXGEN\\n DO\\n PrintF(\\\"Generation %I: %S%E\\\",i,s)\\n IF i<MAXGEN THEN\\n NextGeneration(s)\\n FI\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Cellular_Automata is\\n type Petri_Dish is array (Positive range <>) of Boolean;\\n\\n procedure Step (Culture : in out Petri_Dish) is\\n Left : Boolean := False;\\n This : Boolean;\\n Right : Boolean;\\n begin\\n for Index in Culture'First..Culture'Last - 1 loop\\n Right := Culture (Index + 1);\\n This := Culture (Index);\\n Culture (Index) := (This and (Left xor Right)) or (not This and Left and Right);\\n Left := This;\\n end loop;\\n Culture (Culture'Last) := Culture (Culture'Last) and not Left;\\n end Step;\\n\\n procedure Put (Culture : Petri_Dish) is\\n begin\\n for Index in Culture'Range loop\\n if Culture (Index) then\\n Put ('#');\\n else\\n Put ('_');\\n end if;\\n end loop;\\n end Put;\\n\\n Culture : Petri_Dish :=\\n ( False, True, True, True, False, True, True, False, True, False, True,\\n False, True, False, True, False, False, True, False, False\\n );\\nbegin\\n for Generation in 0..9 loop\\n Put (\\\"Generation\\\" & Integer'Image (Generation) & ' ');\\n Put (Culture);\\n New_Line;\\n Step (Culture);\\n end loop;\\nend Cellular_Automata;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"INT stop generation = 9;\\nINT universe width = 20;\\nFORMAT alive or dead = $b(\\\"#\\\",\\\"_\\\")$;\\n\\nBITS universe := 2r01110110101010100100;\\n # universe := BIN ( ENTIER ( random * max int ) ); #\\nINT upb universe = bits width;\\nINT lwb universe = bits width - universe width + 1;\\n\\nPROC couple = (BITS parent, INT lwb, upb)BOOL: (\\n SHORT INT sum := 0;\\n FOR bit FROM lwb TO upb DO\\n sum +:= ABS (bit ELEM parent)\\n OD;\\n sum = 2\\n);\\n\\nFOR generation FROM 0 WHILE\\n printf(($\\\"Generation \\\"d\\\": \\\"$, generation,\\n $f(alive or dead)$, []BOOL(universe)[lwb universe:upb universe],\\n $l$));\\n# WHILE # generation < stop generation DO\\n BITS next universe := 2r0;\\n\\n # process the first event horizon manually #\\n IF couple(universe,lwb universe,lwb universe + 1) THEN\\n next universe := 2r10\\n FI;\\n\\n # process the middle kingdom in a loop #\\n FOR bit FROM lwb universe + 1 TO upb universe - 1 DO\\n IF couple(universe,bit-1,bit+1) THEN\\n next universe := next universe OR 2r1\\n FI;\\n next universe := next universe SHL 1\\n OD;\\n\\n # process the last event horizon manually #\\n IF couple(universe, upb universe - 1, upb universe) THEN\\n next universe := next universe OR 2r1\\n FI;\\n universe := next universe\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"INT stop generation = 9;\\nINT upb universe = 20;\\nFORMAT alive or dead = $b(\\\"#\\\",\\\"_\\\")$;\\n\\nBITS bits universe := 2r01110110101010100100;\\n # bits universe := BIN ( ENTIER ( random * max int ) ); #\\n[upb universe] BOOL universe := []BOOL(bits universe)[bits width - upb universe + 1:];\\n\\nPROC couple = (REF[]BOOL parent)BOOL: (\\n SHORT INT sum := 0;\\n FOR bit FROM LWB parent TO UPB parent DO\\n sum +:= ABS (parent[bit])\\n OD;\\n sum = 2\\n);\\n\\nFOR generation FROM 0 WHILE\\n printf(($\\\"Generation \\\"d\\\": \\\"$, generation,\\n $f(alive or dead)$, universe,\\n $l$));\\n# WHILE # generation < stop generation DO\\n [UPB universe]BOOL next universe;\\n\\n # process the first event horizon manually #\\n next universe[1] := couple(universe[:2]);\\n\\n # process the middle kingdom in a loop #\\n FOR bit FROM LWB universe + 1 TO UPB universe - 1 DO\\n next universe[bit] := couple(universe[bit-1:bit+1])\\n OD;\\n\\n # process the last event horizon manually #\\n next universe[UPB universe] := couple(universe[UPB universe - 1: ]);\\n universe := next universe\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n string(20) state;\\n string(20) nextState;\\n integer generation;\\n generation := 0;\\n state := \\\"_###_##_#_#_#_#__#__\\\";\\n while begin\\n write( i_w := 1, s_w := 1, \\\"Generation \\\", generation, state );\\n nextState := \\\"____________________\\\";\\n for cPos := 1 until 18 do begin\\n string(3) curr;\\n curr := state( cPos - 1 // 3 );\\n nextState( cPos // 1 ) := if curr = \\\"_##\\\" or curr = \\\"#_#\\\" or curr = \\\"##_\\\" then \\\"#\\\" else \\\"_\\\"\\n end for_cPos ;\\n ( state not = nextState )\\n end do begin\\n state := nextState;\\n generation := generation + 1\\n end while_not_finished\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\nalgoritmo\\n tamaño de pila 65\\n x = 0\\n enlistar (0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,0,\\\\\\n 1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0,\\\\\\n 1,1,0,0,0,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0) mover a 'x'\\n x2 = x\\n decimales '0', token.separador (\\\"\\\")\\n iterar para ( k=1, #(k<=15), ++k )\\n imprimir ' #(utf8(\\\"Generación #\\\")),k, \\\"\\\\t\\\", x, NL '\\n iterar para ( j=2, #(j<60), ++j )\\n #(x2[j] = 0)\\n cuando ( #( (x[j-1]+x[j]+x[j+1])==2 ) ){\\n #(x2[j]=1)\\n }\\n siguiente\\n x = x2\\n siguiente\\nterminar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\nalgoritmo\\n x={}\\n '0,0,1,1,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,0' anidar en lista 'x'\\n '1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,1,0,1,0,0' anidar en lista 'x'\\n '1,1,0,0,0,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0' anidar en lista 'x'\\n\\n x2 = x, k=10\\n decimales '0', token.separador (\\\"\\\")\\n iterar\\n imprimir ' #(utf8(\\\"Generación #\\\")), #(11-k), \\\"\\\\t\\\", x, NL '\\n iterar para ( j=2, #(j<60), ++j )\\n #( x2[j] = ((x[j-1]+x[j]+x[j+1])==2) )\\n siguiente\\n x = x2\\n mientras ' k-- '\\nterminar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"100 HOME\\n110 n = 10\\n120 READ w : DIM x(w+1),x2(w+1) : FOR i = 1 TO w : READ x(i) : NEXT\\n130 FOR k = 1 TO n\\n140 FOR j = 1 TO w\\n150 IF x(j) THEN PRINT \\\"#\\\";\\n155 IF NOT x(j) THEN PRINT \\\"_\\\";\\n160 IF x(j-1)+x(j)+x(j+1) = 2 THEN x2(j) = 1\\n165 IF x(j-1)+x(j)+x(j+1) <> 2 THEN x2(j) = 0\\n170 NEXT : PRINT\\n180 FOR j = 1 TO w : x(j) = x2(j) : NEXT\\n190 NEXT\\n200 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"evolve: function [arr][\\n ary: [0] ++ arr ++ [0]\\n ret: new []\\n loop 1..(size ary)-2 'i [\\n a: ary\\\\[i-1]\\n b: ary\\\\[i]\\n c: ary\\\\[i+1]\\n\\n if? 2 = a+b+c -> 'ret ++ 1\\n else -> 'ret ++ 0\\n ]\\n ret\\n]\\n\\nprintIt: function [arr][\\n print replace replace join map arr 'n -> to :string n \\\"0\\\" \\\"_\\\" \\\"1\\\" \\\"#\\\"\\n]\\n\\narr: [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]\\nprintIt arr\\n\\nnewGen: evolve arr\\nwhile [newGen <> arr][\\n arr: newGen\\n newGen: evolve arr\\n printIt newGen\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"n := 22, n1 := n+1, v0 := v%n1% := 0 ; set grid dimensions, and fixed cells\\n\\nLoop % n { ; draw a line of checkboxes\\n v%A_Index% := 0\\n Gui Add, CheckBox, % \\\"y10 w17 h17 gCheck x\\\" A_Index*17-5 \\\" vv\\\" A_Index\\n}\\nGui Add, Button, x+5 y6, step ; button to step to next generation\\nGui Show\\nReturn\\n\\nCheck:\\n GuiControlGet %A_GuiControl% ; set cells by the mouse\\nReturn\\n\\nButtonStep: ; move to next generation\\n Loop % n\\n i := A_Index-1, j := i+2, w%A_Index% := v%i%+v%A_Index%+v%j% = 2\\n Loop % n\\n GuiControl,,v%A_Index%, % v%A_Index% := w%A_Index%\\nReturn\\n\\nGuiClose: ; exit when GUI is closed\\nExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\nBEGIN {\\n edge = 1\\n ruleNum = 104 # 01101000\\n maxGen = 9\\n mark = \\\"@\\\"\\n space = \\\".\\\"\\n initialState = \\\".@@@.@@.@.@.@.@..@..\\\"\\n width = length(initialState)\\n delete rules\\n delete state\\n\\n initRules(ruleNum)\\n initState(initialState, mark)\\n for (g = 0; g < maxGen; g++) {\\n showState(g, mark, space)\\n nextState()\\n }\\n showState(g, mark, space)\\n}\\n\\nfunction nextState( newState, i, n) {\\n delete newState\\n for (i = 1; i < width - 1; i++) {\\n n = getRuleNum(i)\\n newState[i] = rules[n]\\n }\\n for (i = 0; i < width; i++) { # copy, can't assign arrays\\n state[i] = newState[i]\\n }\\n}\\n\\n# Convert a three cell neighborhood from binary to decimal\\nfunction getRuleNum(i, rn, j, p) {\\n rn = 0\\n for (j = -1; j < 2; j++) {\\n p = i + j\\n rn = rn * 2 + (p < 0 || p > width ? edge : state[p])\\n }\\n return rn\\n}\\n\\nfunction showState(gen, mark, space, i) {\\n printf(\\\"%3d: \\\", gen)\\n for (i = 1; i <= width; i++) {\\n printf(\\\" %s\\\", (state[i] ? mark : space))\\n }\\n print \\\"\\\"\\n}\\n\\n# Make state transition lookup table from rule number.\\nfunction initRules(ruleNum, i, r) {\\n delete rules;\\n r = ruleNum\\n for (i = 0; i < 8; i++) {\\n rules[i] = r % 2\\n r = int(r / 2)\\n }\\n}\\n\\nfunction initState(init, mark, i) {\\n delete state\\n srand()\\n for (i = 0; i < width; i++) {\\n state[i] = (substr(init, i, 1) == mark ? 1 : 0) # Given an initial string.\\n # state[int(width/2)] = '@' # middle cell\\n # state[i] = int(rand() * 100) < 30 ? 1 : 0 # 30% of cells\\n }\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"Another new solution (twice size as previous solution) :\\ncat automata.awk :\\n\\n#!/usr/local/bin/gawk -f\\n\\n# User defined functions\\nfunction ASCII_to_Binary(str_) {\\n\\tgsub(\\\"_\\\",\\\"0\\\",str_); gsub(\\\"@\\\",\\\"1\\\",str_)\\n\\treturn str_\\n}\\n\\nfunction Binary_to_ASCII(bit_) {\\n\\tgsub(\\\"0\\\",\\\"_\\\",bit_); gsub(\\\"1\\\",\\\"@\\\",bit_)\\n\\treturn bit_\\n}\\n\\nfunction automate(b1,b2,b3) {\\n\\ta = and(b1,b2,b3)\\n\\tb = or(b1,b2,b3)\\n\\tc = xor(b1,b2,b3)\\n\\td = a + b + c\\n\\treturn d == 1 ? 1 : 0\\n}\\n\\n# For each line in input do\\n{\\nstr_ = $0\\ngen = 0\\ntaille = length(str_)\\nprint \\\"0: \\\" str_\\ndo {\\n\\tgen ? str_previous = str_ : str_previous = \\\"\\\"\\n\\tgen += 1\\n\\tstr_ = ASCII_to_Binary(str_)\\n\\tsplit(str_,tab,\\\"\\\")\\n\\tstr_ = and(tab[1],tab[2])\\n\\tfor (i=1; i<=taille-2; i++) {\\n\\t\\tstr_ = str_ automate(tab[i],tab[i+1],tab[i+2])\\n\\t\\t}\\n\\tstr_ = str_ and(tab[taille-1],tab[taille])\\n\\tprint gen \\\": \\\" Binary_to_ASCII(str_)\\n } while (str_ != str_previous)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"arraybase 1\\ndim start = {0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0}\\ndim sgtes(start[?]+1)\\n\\nfor k = 0 to 9\\n print \\\"Generation \\\"; k; \\\": \\\";\\n for j = 0 to start[?]-1\\n\\n if start[j] then print \\\"#\\\"; else print \\\"_\\\";\\n if start[j-1] + start[j] + start[j+1] = 2 then sgtes[j] = 1 else sgtes[j] = 0\\n next j\\n print\\n for j = 0 to start[?]-1\\n start[j] = sgtes[j]\\n next j\\nnext k\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\n::THE MAIN THING\\ncall :one-dca __###__##_#_##_###__######_###_#####_#__##_____#_#_#######__\\npause>nul\\nexit /b\\n::/THE MAIN THING\\n\\n::THE PROCESSOR\\n:one-dca\\necho.&set numchars=0&set proc=%1\\n\\n::COUNT THE NUMBER OF CHARS\\nset bef=%proc:_=_,%\\nset bef=%bef:#=#,%\\nset bef=%bef:~0,-1%\\nfor %%x in (%bef%) do set /a numchars+=1\\n\\nset /a endchar=%numchars%-1\\n:nextgen\\necho. ^| %proc% ^|\\nset currnum=0\\nset newgen=\\n:editeachchar\\n\\tset neigh=0\\n\\tset /a testnum2=%currnum%+1\\n\\tset /a testnum1=%currnum%-1\\n\\tif %currnum%==%endchar% (\\n\\t\\tset testchar=!proc:~%testnum1%,1!\\n\\t\\tif !testchar!==# (set neigh=1)\\n\\t) else (\\n\\t\\tif %currnum%==0 (\\n\\t\\t\\tset testchar=%proc:~1,1%\\n\\t\\t\\tif !testchar!==# (set neigh=1)\\n\\t\\t) else (\\n\\t\\t\\tset testchar1=!proc:~%testnum1%,1!\\n\\t\\t\\tset testchar2=!proc:~%testnum2%,1!\\n\\t\\t\\tif !testchar1!==# (set /a neigh+=1)\\n\\t\\t\\tif !testchar2!==# (set /a neigh+=1)\\n\\t\\t)\\n\\t)\\n\\tif %neigh%==0 (set newgen=%newgen%_)\\n\\tif %neigh%==1 (\\n\\t\\tset testchar=!proc:~%currnum%,1!\\n\\t\\tset newgen=%newgen%!testchar!\\n\\t)\\n\\tif %neigh%==2 (\\n\\t\\tset testchar=!proc:~%currnum%,1!\\n\\t\\tif !testchar!==# (set newgen=%newgen%_) else (set newgen=%newgen%#)\\n\\t)\\nif %currnum%==%endchar% (goto :cond) else (set /a currnum+=1&goto :editeachchar)\\n\\n:cond\\nif %proc%==%newgen% (echo.&echo ...The sample is now stable.&goto :EOF)\\nset proc=%newgen%\\ngoto :nextgen\\n::/THE (LLLLLLOOOOOOOOOOOOONNNNNNNNGGGGGG.....) PROCESSOR\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" DIM rule$(7)\\n rule$() = \\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"1\\\", \\\"0\\\", \\\"1\\\", \\\"1\\\", \\\"0\\\"\\n\\n now$ = \\\"01110110101010100100\\\"\\n\\n FOR generation% = 0 TO 9\\n PRINT \\\"Generation \\\" ; generation% \\\":\\\", now$\\n next$ = \\\"\\\"\\n FOR cell% = 1 TO LEN(now$)\\n next$ += rule$(EVAL(\\\"%\\\"+MID$(\\\"0\\\"+now$+\\\"0\\\", cell%, 3)))\\n NEXT cell%\\n SWAP now$, next$\\n NEXT generation%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"v\\n \\\" !!! !! ! ! ! ! ! \\\" ,*25 <v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n \\\" \\\" ,*25,,,,,,,,,,,,,,,,,,,,<v\\n v$< @,*25,,,,,,,,,,,,,,,,,,,,<\\n>110p3>:1-10gg\\\" \\\"-4* \\\\:10gg\\\" \\\"-2* \\\\:1+10gg\\\" \\\"-\\\\:54*1+`#v_20p++ :2`#v_ >:4`#v_> >$\\\" \\\"v\\n >:3`#^_v>:6`|\\n ^ >$$$$320p10g1+:9`v > >$\\\"!\\\"> 20g10g1+p 20g1+:20p\\n ^ v_10p10g\\n > ^\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \" ( ( evolve\\n = n z\\n . @( !arg\\n : %?n ? @?z\\n : ?\\n ( ( ( 000\\n | 001\\n | 010\\n | 100\\n | 111\\n )\\n & 0 !n:?n\\n | (011|101|110)\\n & 1 !n:?n\\n )\\n & ~`\\n )\\n ?\\n )\\n | rev$(str$(!z !n))\\n )\\n & 11101101010101001001:?S\\n & :?seen\\n & whl\\n ' ( ~(!seen:? !S ?)\\n & out$!S\\n & !S !seen:?seen\\n & evolve$!S:?S\\n )\\n );\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n\\nchar trans[] = \\\"___#_##_\\\";\\n\\n#define v(i) (cell[i] != '_')\\nint evolve(char cell[], char backup[], int len)\\n{\\n\\tint i, diff = 0;\\n\\n\\tfor (i = 0; i < len; i++) {\\n\\t\\t/* use left, self, right as binary number bits for table index */\\n\\t\\tbackup[i] = trans[ v(i-1) * 4 + v(i) * 2 + v(i + 1) ];\\n\\t\\tdiff += (backup[i] != cell[i]);\\n\\t}\\n\\n\\tstrcpy(cell, backup);\\n\\treturn diff;\\n}\\n\\nint main()\\n{\\n\\tchar\\tc[] = \\\"_###_##_#_#_#_#__#__\\\\n\\\",\\n\\t\\tb[] = \\\"____________________\\\\n\\\";\\n\\n\\tdo { printf(c + 1); } while (evolve(c + 1, b + 1, sizeof(c) - 3));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nchar trans[] = \\\"___#_##_\\\";\\n\\nint evolve(char c[], int len)\\n{\\n\\tint i, diff = 0;\\n#\\tdefine v(i) ((c[i] & 15) == 1)\\n#\\tdefine each for (i = 0; i < len; i++)\\n\\n\\teach c[i] = (c[i] == '#');\\n\\teach c[i] |= (trans[(v(i-1)*4 + v(i)*2 + v(i+1))] == '#') << 4;\\n\\teach diff += (c[i] & 0xf) ^ (c[i] >> 4);\\n\\teach c[i] = (c[i] >> 4) ? '#' : '_';\\n\\n#\\tundef each\\n#\\tundef v\\n\\treturn diff;\\n}\\n\\nint main()\\n{\\n\\tchar c[] = \\\"_###_##_#_#_#_#__#__\\\\n\\\";\\n\\n\\tdo { printf(c + 1); } while (evolve(c + 1, sizeof(c) - 3));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <bitset>\\n#include <string>\\n\\nconst int ArraySize = 20;\\nconst int NumGenerations = 10;\\nconst std::string Initial = \\\"0011101101010101001000\\\";\\n\\nint main()\\n{\\n // + 2 for the fixed ends of the array\\n std::bitset<ArraySize + 2> array(Initial);\\n\\n for(int j = 0; j < NumGenerations; ++j)\\n {\\n std::bitset<ArraySize + 2> tmpArray(array);\\n for(int i = ArraySize; i >= 1 ; --i)\\n {\\n if(array[i])\\n std::cout << \\\"#\\\";\\n else\\n std::cout << \\\"_\\\";\\n int val = (int)array[i-1] << 2 | (int)array[i] << 1 | (int)array[i+1];\\n tmpArray[i] = (val == 3 || val == 5 || val == 6);\\n }\\n array = tmpArray;\\n std::cout << std::endl;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace prog\\n{\\n\\tclass MainClass\\n\\t{\\t\\n\\t\\tconst int n_iter = 10;\\n\\t\\tstatic int[] f = { 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0 };\\n\\t\\t\\n\\t\\tpublic static void Main (string[] args)\\n\\t\\t{\\n\\t\\t\\tfor( int i=0; i<f.Length; i++ )\\n\\t\\t\\t\\tConsole.Write( f[i]==0 ? \\\"-\\\" : \\\"#\\\" );\\n\\t\\t\\tConsole.WriteLine(\\\"\\\");\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tint[] g = new int[f.Length];\\n\\t\\t\\tfor( int n=n_iter; n!=0; n-- )\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor( int i=1; i<f.Length-1; i++ )\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif ( (f[i-1] ^ f[i+1]) == 1 ) g[i] = f[i];\\n\\t\\t\\t\\t\\telse if ( f[i] == 0 && (f[i-1] & f[i+1]) == 1 ) g[i] = 1;\\n\\t\\t\\t\\t\\telse g[i] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tg[0] = ( (f[0] & f[1]) == 1 ) ? 1 : 0;\\n\\t\\t\\t\\tg[g.Length-1] = ( (f[f.Length-1] & f[f.Length-2]) == 1 ) ? 1 : 0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tint[] tmp = f;\\n\\t\\t\\t\\tf = g;\\n\\t\\t\\t\\tg = tmp;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor( int i=0; i<f.Length; i++ )\\n\\t\\t\\t\\t\\tConsole.Write( f[i]==0 ? \\\"-\\\" : \\\"#\\\" );\\n\\t\\t\\t\\tConsole.WriteLine(\\\"\\\");\\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared abstract class Cell(character) of alive | dead {\\n\\tshared Character character;\\n\\tstring => character.string;\\n\\tshared formal Cell opposite;\\n}\\n\\nshared object alive extends Cell('#') {\\n\\topposite => dead;\\n}\\nshared object dead extends Cell('_') {\\n\\topposite => alive;\\n}\\n\\nshared Map<Character, Cell> cellsByCharacter = map { for (cell in `Cell`.caseValues) cell.character->cell };\\n\\nshared class Automata1D({Cell*} initialCells) {\\n\\t\\n\\t\\n\\tvalue permanentFirstCell = initialCells.first else dead;\\n\\tvalue permanentLastCell = initialCells.last else dead;\\n\\t\\n\\tvalue cells = Array { *initialCells.rest.exceptLast };\\n\\t\\n\\tshared Boolean evolve() {\\n\\t\\t\\n\\t\\tvalue newCells = Array {\\n\\t\\t\\tfor (index->cell in cells.indexed)\\n\\t\\t\\tlet (left = cells[index - 1] else permanentFirstCell,\\n\\t\\t\\t\\tright = cells[index + 1] else permanentLastCell,\\n\\t\\t\\t\\tneighbours = [left, right],\\n\\t\\t\\t\\tbothAlive = neighbours.every(alive.equals),\\n\\t\\t\\t\\tbothDead = neighbours.every(dead.equals))\\n\\t\\t\\tif (bothAlive)\\n\\t\\t\\tthen cell.opposite\\n\\t\\t\\telse if (cell == alive && bothDead)\\n\\t\\t\\tthen dead\\n\\t\\t\\telse cell\\n\\t\\t};\\n\\t\\t\\n\\t\\tif (newCells == cells) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\t\\n\\t\\tnewCells.copyTo(cells);\\n\\t\\treturn true;\\n\\t}\\n\\t\\n\\tstring => permanentFirstCell.string + \\\"\\\".join(cells) + permanentLastCell.string;\\n}\\n\\nshared Automata1D? automata1d(String string) =>\\n\\t\\tlet (cells = string.map((Character element) => cellsByCharacter[element]))\\n\\t\\tif (cells.every((Cell? element) => element exists))\\n\\t\\tthen Automata1D(cells.coalesced)\\n\\t\\telse null;\\n\\nshared void run() {\\n\\n\\tassert (exists automata = automata1d(\\\"__###__##_#_##_###__######_###_#####_#__##_____#_#_#######__\\\"));\\n\\t\\n\\tvariable value generation = 0;\\n\\tprint(\\\"generation ``generation`` ``automata``\\\");\\n\\twhile (automata.evolve() && generation<10) {\\n\\t\\tprint(\\\"generation `` ++generation `` ``automata``\\\");\\n\\t}\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"100 CLS\\n110 LET n = 10\\n120 READ w\\n121 DIM x(w+1): DIM x2(w+1)\\n122 FOR i = 1 TO w : READ x(i) : NEXT i\\n130 FOR k = 1 TO n\\n140 FOR j = 1 TO w\\n150 IF x(j) THEN PRINT \\\"#\\\"; ELSE PRINT \\\"_\\\";\\n160 IF x(j-1)+x(j)+x(j+1) = 2 THEN LET x2(j) = 1 ELSE LET x2(j) = 0\\n170 NEXT j\\n171 PRINT\\n180 FOR j = 1 TO w : LET x(j) = x2(j) : NEXT j\\n190 NEXT k\\n200 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\n210 END\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"(ns one-dimensional-cellular-automata\\n (:require (clojure.contrib (string :as s))))\\n\\n(defn next-gen [cells]\\n (loop [cs cells ncs (s/take 1 cells)]\\n (let [f3 (s/take 3 cs)]\\n (if (= 3 (count f3))\\n (recur (s/drop 1 cs)\\n (str ncs (if (= 2 (count (filter #(= \\\\# %) f3))) \\\"#\\\" \\\"_\\\")))\\n (str ncs (s/drop 1 cs))))))\\n\\n(defn generate [n cells]\\n (if (= n 0)\\n '()\\n (cons cells (generate (dec n) (next-gen cells)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"one-dimensional-cellular-automata> (doseq [cells (generate 9 \\\"_###_##_#_#_#_#__#__\\\")]\\n (println cells))\\n_###_##_#_#_#_#__#__\\n_#_#####_#_#_#______\\n__##___##_#_#_______\\n__##___###_#________\\n__##___#_##_________\\n__##____###_________\\n__##____#_#_________\\n__##_____#__________\\n__##________________\\nnil\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"#!/usr/bin/env lein-exec\\n\\n(require '[clojure.string :as str])\\n\\n(def first-genr \\\"_###_##_#_#_#_#__#__\\\")\\n\\n(def hospitable #{\\\"_##\\\"\\n \\\"##_\\\"\\n \\\"#_#\\\"})\\n\\n(defn compute-next-genr\\n [genr]\\n (let [genr (str \\\"_\\\" genr \\\"_\\\")\\n groups (map str/join (partition 3 1 genr))\\n next-genr (for [g groups]\\n (if (hospitable g) \\\\# \\\\_))]\\n (str/join next-genr)))\\n\\n;; ---------------- main -----------------\\n(loop [g first-genr\\n i 0]\\n (if (not= i 10)\\n (do (println g)\\n (recur (compute-next-genr g)\\n (inc i)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def rules\\n {\\n [0 0 0] 0\\n [0 0 1] 0\\n [0 1 0] 0\\n [0 1 1] 1\\n [1 0 0] 0\\n [1 0 1] 1\\n [1 1 0] 1\\n [1 1 1] 0\\n })\\n\\n(defn nextgen [gen]\\n (concat [0]\\n (->> gen\\n (partition 3 1)\\n (map vec)\\n (map rules))\\n [0]))\\n\\n; Output time!\\n(doseq [g (take 10 (iterate nextgen [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]))]\\n (println g))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \" Identification division.\\n Program-id. rc-1d-cell.\\n\\n Data division.\\n Working-storage section.\\n\\n*> \\\"Constants.\\\"\\n 01 max-gens pic 999 value 9.\\n 01 state-width pic 99 value 20.\\n 01 state-table-init pic x(20) value \\\".@@@.@@.@.@.@.@..@..\\\".\\n 01 alive pic x value \\\"@\\\".\\n 01 dead pic x value \\\".\\\".\\n\\n*> The current state.\\n 01 state-gen pic 999 value 0.\\n 01 state-row.\\n 05 state-row-gen pic zz9.\\n 05 filler pic xx value \\\": \\\".\\n 05 state-table.\\n 10 state-cells pic x occurs 20 times.\\n\\n*> The new state.\\n 01 new-state-table.\\n 05 new-state-cells pic x occurs 20 times.\\n\\n*> Pointer into cell table during generational production.\\n 01 cell-index pic 99.\\n 88 at-beginning value 1.\\n 88 is-inside values 2 thru 19.\\n 88 at-end value 20.\\n\\n*> The cell's neighborhood.\\n 01 neighbor-count-def.\\n 03 neighbor-count pic 9.\\n 88 is-comfy value 1.\\n 88 is-ripe value 2.\\n\\n Procedure division.\\n Perform Init-state-table.\\n Perform max-gens times\\n perform Display-row\\n perform Next-state\\n end-perform.\\n Perform Display-row.\\n Stop run.\\n\\n Display-row.\\n Move state-gen to state-row-gen.\\n Display state-row.\\n\\n*> Determine who lives and who dies.\\n Next-state.\\n Add 1 to state-gen.\\n Move state-table to new-state-table.\\n\\n Perform with test after\\n varying cell-index from 1 by 1\\n until at-end\\n perform Count-neighbors\\n perform Die-off\\n perform New-births\\n end-perform\\n\\n move new-state-table to state-table.\\n\\n*> Living cell with wrong number of neighbors...\\n Die-off.\\n if state-cells(cell-index) =\\n alive and not is-comfy\\n then move dead to new-state-cells(cell-index)\\n end-if\\n .\\n\\n*> Empty cell with exactly two neighbors are...\\n New-births.\\n if state-cells(cell-index) = dead and is-ripe\\n then move alive to new-state-cells(cell-index)\\n end-if\\n .\\n*> How many living neighbors does a cell have?\\n Count-neighbors.\\n Move 0 to neighbor-count\\n if at-beginning or at-end then\\n add 1 to neighbor-count\\n else\\n if is-inside and state-cells(cell-index - 1) = alive\\n then\\n add 1 to neighbor-count\\n end-if\\n if is-inside and state-cells(cell-index + 1) = alive\\n then\\n add 1 to neighbor-count\\n end-if\\n end-if\\n .\\n\\n*> String is easier to enter, but table is easier to work with,\\n*> so move each character of the initialization string to the\\n*> state table.\\n\\n Init-state-table.\\n Perform with test after\\n varying cell-index from 1 by 1\\n until at-end\\n move state-table-init(cell-index:1)\\n to state-cells(cell-index)\\n end-perform\\n .\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"# We could cheat and count the bits, but let's keep this general.\\n# . = dead, # = alive, middle cells survives iff one of the configurations\\n# below is satisified.\\nsurvival_scenarios = [\\n '.##' # happy neighbors\\n '#.#' # birth\\n '##.' # happy neighbors\\n]\\n\\nb2c = (b) -> if b then '#' else '.'\\n\\ncell_next_gen = (left_alive, me_alive, right_alive) ->\\n fingerprint = b2c(left_alive) + b2c(me_alive) + b2c(right_alive)\\n fingerprint in survival_scenarios\\n\\ncells_for_next_gen = (cells) ->\\n # This function assumes a finite array, i.e. cells can't be born outside\\n # the original array.\\n (cell_next_gen(cells[i-1], cells[i], cells[i+1]) for i in [0...cells.length])\\n\\ndisplay = (cells) ->\\n (b2c(is_alive) for is_alive in cells).join ''\\n\\nsimulate = (cells) ->\\n while true\\n console.log display cells\\n new_cells = cells_for_next_gen cells\\n break if display(cells) == display(new_cells)\\n cells = new_cells\\n console.log \\\"equilibrium achieved\\\"\\n\\nsimulate (c == '#' for c in \\\".###.##.#.#.#.#..#..\\\")\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(defun value (x)\\n (assert (> (length x) 1))\\n (coerce x 'simple-bit-vector))\\n\\n(defun count-neighbors-and-self (value i)\\n (flet ((ref (i)\\n (if (array-in-bounds-p value i)\\n (bit value i)\\n 0)))\\n (declare (inline ref))\\n (+ (ref (1- i))\\n (ref i)\\n (ref (1+ i)))))\\n\\n(defun next-cycle (value)\\n (let ((new-value (make-array (length value) :element-type 'bit)))\\n (loop for i below (length value)\\n do (setf (bit new-value i)\\n (if (= 2 (count-neighbors-and-self value i))\\n 1\\n 0)))\\n new-value))\\n\\n(defun print-world (value &optional (stream *standard-output*))\\n (loop for i below (length value)\\n do (princ (if (zerop (bit value i)) #\\\\. #\\\\#)\\n stream))\\n (terpri stream))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"CL-USER> (loop for previous-value = nil then value\\n for value = #*01110110101010100100 then (next-cycle value)\\n until (equalp value previous-value)\\n do (print-world value))\\n.###.##.#.#.#.#..#..\\n.#.#####.#.#.#......\\n..##...##.#.#.......\\n..##...###.#........\\n..##...#.##.........\\n..##....###.........\\n..##....#.#.........\\n..##.....#..........\\n..##................\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm;\\n\\n enum nGenerations = 10;\\n enum initial = \\\"0011101101010101001000\\\";\\n enum table = \\\"00010110\\\";\\n\\n char[initial.length + 2] A = '0', B = '0';\\n A[1 .. $-1] = initial;\\n foreach (immutable _; 0 .. nGenerations) {\\n foreach (immutable i; 1 .. A.length - 1) {\\n write(A[i] == '0' ? '_' : '#');\\n const val = (A[i-1]-'0' << 2) | (A[i]-'0' << 1) | (A[i+1]-'0');\\n B[i] = table[val];\\n }\\n A.swap(B);\\n writeln;\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.range;\\n\\n auto A = \\\"_###_##_#_#_#_#__#__\\\".map!q{a == '#'}.array;\\n auto B = A.dup;\\n\\n do {\\n A.map!q{ \\\"_#\\\"[a] }.writeln;\\n A.zip(A.cycle.drop(1), A.cycle.drop(A.length - 1))\\n .map!(t => [t[]].sum == 2).copy(B);\\n A.swap(B);\\n } while (A != B);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.range, std.bitmanip;\\n\\n immutable initial = \\\"__###_##_#_#_#_#__#___\\\";\\n enum nGenerations = 10;\\n BitArray A, B;\\n A.init(initial.map!(c => c == '#').array);\\n B.length = initial.length;\\n\\n foreach (immutable _; 0 .. nGenerations) {\\n //A.map!(b => b ? '#' : '_').writeln;\\n //foreach (immutable i, immutable b; A) {\\n foreach (immutable i; 1 .. A.length - 1) {\\n \\\"_#\\\"[A[i]].write;\\n immutable val = (uint(A[i - 1]) << 2) |\\n (uint(A[i]) << 1) |\\n uint(A[i + 1]);\\n B[i] = val == 3 || val == 5 || val == 6;\\n }\\n\\n writeln;\\n A.swap(B);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"type TGame = string[20];\\ntype TPattern = string[3];\\n\\nfunction GetSubPattern(Game: TGame; Inx: integer): TPattern;\\n{Get the pattern of three cells adjacent to Inx}\\nvar I: integer;\\nbegin\\nResult:='';\\n{Cells off the ends of the array are consider empty}\\nfor I:=Inx-1 to Inx+1 do\\n if (I<1) or (I>Length(Game)) then Result:=Result+' '\\n else Result:=Result+Game[I];\\nend;\\n\\nfunction GetNewValue(P: TPattern): char;\\n{Calculate the new value for a cell based}\\n{the pattern of neighboring cells}\\nbegin\\nif P=' ' then Result:=' '\\t{ No change}\\nelse if P=' #' then Result:=' '\\t{ No change}\\nelse if P=' # ' then Result:=' '\\t{ Dies without enough neighbours}\\nelse if P=' ##' then Result:='#'\\t{ Needs one neighbour to survive}\\nelse if P='# ' then Result:=' '\\t{ No change}\\nelse if P='# #' then Result:='#'\\t{ Two neighbours giving birth}\\nelse if P='## ' then Result:='#'\\t{ Needs one neighbour to survive}\\nelse if P='###' then Result:=' ';\\t{ Starved to death.}\\nend;\\n\\n\\nprocedure CellularlAutoGame(Memo: TMemo);\\n{Iterate through steps of evolution of cellular automaton}\\nvar GameArray,NextArray: TGame;\\nvar P: string [3];\\nvar I,G: integer;\\nbegin\\n{Start arrangement}\\nGameArray:=' ### ## # # # # # ';\\nfor G:=1 to 10 do\\n\\tbegin\\n\\t{Display current game situation}\\n\\tMemo.Lines.Add(GameArray);\\n\\t{Evolve each cell in the array}\\n\\tfor I:=1 to Length(GameArray) do\\n\\t\\tbegin\\n\\t\\tP:=GetSubPattern(GameArray,I);\\n\\t \\tNextArray[I]:=GetNewValue(P);\\n\\t \\tend;\\n\\tGameArray:=NextArray;\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"const ngenerations = 10;\\nconst table = [0, 0, 0, 1, 0, 1, 1, 0];\\n\\nvar a := [0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0];\\nvar b := a;\\n\\nvar i, j : Integer;\\nfor i := 1 to ngenerations do begin\\n for j := a.low+1 to a.high-1 do begin\\n if a[j] = 0 then\\n Print('_')\\n else Print('#');\\n var val := (a[j-1] shl 2) or (a[j] shl 1) or a[j+1];\\n b[j] := table[val];\\n end;\\n var tmp := a;\\n a := b;\\n b := tmp;\\n PrintLn('');\\nend;\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"def step(state, rule) {\\n var result := state(0, 1) # fixed left cell\\n for i in 1..(state.size() - 2) {\\n # Rule function receives the substring which is the neighborhood\\n result += E.toString(rule(state(i-1, i+2)))\\n }\\n result += state(state.size() - 1) # fixed right cell\\n return result\\n}\\n\\ndef play(var state, rule, count, out) {\\n out.print(`0 | $state$\\\\n`)\\n for i in 1..count {\\n state := step(state, rosettaRule)\\n out.print(`$i | $state$\\\\n`)\\n }\\n return state\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def rosettaRule := [\\n \\\" \\\" => \\\" \\\",\\n \\\" #\\\" => \\\" \\\",\\n \\\" # \\\" => \\\" \\\",\\n \\\" ##\\\" => \\\"#\\\",\\n \\\"# \\\" => \\\" \\\",\\n \\\"# #\\\" => \\\"#\\\",\\n \\\"## \\\" => \\\"#\\\",\\n \\\"###\\\" => \\\" \\\",\\n].get\\n\\n? play(\\\" ### ## # # # # # \\\", rosettaRule, 9, stdout)\\n0 | ### ## # # # # #\\n1 | # ##### # # #\\n2 | ## ## # #\\n3 | ## ### #\\n4 | ## # ##\\n5 | ## ###\\n6 | ## # #\\n7 | ## #\\n8 | ##\\n9 | ##\\n# value: \\\" ## \\\"\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"map[] = [ 0 0 0 1 0 1 1 0 ]\\ncell[] = [ 0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 ]\\nlen celln[] len cell[]\\nproc evolve . .\\n for i = 2 to len cell[] - 1\\n ind = cell[i - 1] + 2 * cell[i] + 4 * cell[i + 1] + 1\\n celln[i] = map[ind]\\n .\\n swap celln[] cell[]\\n.\\nproc show . .\\n for v in cell[]\\n if v = 1\\n write \\\"#\\\"\\n else\\n write \\\".\\\"\\n .\\n .\\n print \\\"\\\"\\n.\\nshow\\nfor i to 9\\n evolve\\n show\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"class\\n\\tAPPLICATION\\n\\ncreate\\n\\tmake\\n\\nfeature\\n\\n\\tmake\\n\\t\\t\\t-- First 10 states of the cellular automata.\\n\\t\\tlocal\\n\\t\\t\\tr: RANDOM\\n\\t\\t\\tautomata: STRING\\n\\t\\tdo\\n\\t\\t\\tcreate r.make\\n\\t\\t\\tcreate automata.make_empty\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| 10 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif r.double_item < 0.5 then\\n\\t\\t\\t\\t\\tautomata.append (\\\"0\\\")\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tautomata.append (\\\"1\\\")\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\tr.forth\\n\\t\\t\\tend\\n\\t\\t\\tacross\\n\\t\\t\\t\\t1 |..| 10 as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tio.put_string (automata + \\\"%N\\\")\\n\\t\\t\\t\\tautomata := update (automata)\\n\\t\\t\\tend\\n\\t\\tend\\n\\n\\tupdate (s: STRING): STRING\\n\\t\\t\\t-- Next state of the cellular automata 's'.\\n\\t\\trequire\\n\\t\\t\\tenough_states: s.count > 1\\n\\t\\tlocal\\n\\t\\t\\ti: INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate Result.make_empty\\n\\t\\t\\t\\t-- Dealing with the left border.\\n\\t\\t\\tif s [1] = '1' and s [2] = '1' then\\n\\t\\t\\t\\tResult.append (\\\"1\\\")\\n\\t\\t\\telse\\n\\t\\t\\t\\tResult.append (\\\"0\\\")\\n\\t\\t\\tend\\n\\t\\t\\t\\t-- Dealing with the middle cells.\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti := 2\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti = s.count\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif (s [i] = '0' and (s [i - 1] = '0' or (s [i - 1] = '1' and s [i + 1] = '0'))) or ((s [i] = '1') and ((s [i - 1] = '1' and s [i + 1] = '1') or (s [i - 1] = '0' and s [i + 1] = '0'))) then\\n\\t\\t\\t\\t\\tResult.append (\\\"0\\\")\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tResult.append (\\\"1\\\")\\n\\t\\t\\t\\tend\\n\\t\\t\\t\\ti := i + 1\\n\\t\\t\\tend\\n\\t\\t\\t\\t-- Dealing with the right border.\\n\\t\\t\\tif s [s.count] = '1' and s [s.count - 1] = '1' then\\n\\t\\t\\t\\tResult.append (\\\"1\\\")\\n\\t\\t\\telse\\n\\t\\t\\t\\tResult.append (\\\"0\\\")\\n\\t\\t\\tend\\n\\t\\tensure\\n\\t\\t\\thas_same_length: s.count = Result.count\\n\\t\\tend\\n\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule RC do\\n def run(list, gen \\\\\\\\ 0) do\\n print(list, gen)\\n next = evolve(list)\\n if next == list, do: print(next, gen+1), else: run(next, gen+1)\\n end\\n\\n defp evolve(list), do: evolve(Enum.concat([[0], list, [0]]), [])\\n\\n defp evolve([a,b,c], next), do: Enum.reverse([life(a,b,c) | next])\\n defp evolve([a,b,c|rest], next), do: evolve([b,c|rest], [life(a,b,c) | next])\\n\\n defp life(a,b,c), do: (if a+b+c == 2, do: 1, else: 0)\\n\\n defp print(list, gen) do\\n str = \\\"Generation #{gen}: \\\"\\n IO.puts Enum.reduce(list, str, fn x,s -> s <> if x==0, do: \\\".\\\", else: \\\"#\\\" end)\\n end\\nend\\n\\nRC.run([0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0])\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"import Maybe exposing (withDefault)\\nimport List exposing (length, tail, reverse, concat, head, append, map3)\\nimport Html exposing (Html, div, h1, text)\\nimport String exposing (join)\\nimport Svg exposing (svg)\\nimport Svg.Attributes exposing (version, width, height, viewBox,cx,cy, fill, r)\\nimport Html.App exposing (program)\\nimport Random exposing (step, initialSeed, bool, list)\\nimport Matrix exposing (fromList, mapWithLocation, flatten) -- chendrix/elm-matrix\\nimport Time exposing (Time, second, every)\\n\\ntype alias Model = { history : List (List Bool)\\n , cols : Int\\n , rows : Int\\n }\\n\\nview : Model -> Html Msg\\nview model =\\n let\\n circleInBox (row,col) value =\\n if value\\n then [ Svg.circle [ r \\\"0.3\\\"\\n , fill (\\\"purple\\\")\\n , cx (toString (toFloat col + 0.5))\\n , cy (toString (toFloat row + 0.5))\\n ]\\n []\\n ]\\n else []\\n\\n showHistory model =\\n model.history\\n |> reverse\\n |> fromList\\n |> mapWithLocation circleInBox\\n |> flatten\\n |> concat\\n in\\n div []\\n [ h1 [] [text \\\"One Dimensional Cellular Automata\\\"]\\n , svg [ version \\\"1.1\\\"\\n , width \\\"700\\\"\\n , height \\\"700\\\"\\n , viewBox (join \\\" \\\"\\n [ 0 |> toString\\n , 0 |> toString\\n , model.cols |> toString\\n , model.rows |> toString\\n ]\\n )\\n ]\\n (showHistory model)\\n ]\\n\\nupdate : Msg -> Model -> (Model, Cmd Msg)\\nupdate msg model =\\n if length model.history == model.rows\\n then (model, Cmd.none)\\n else\\n let s1 = model.history |> head |> withDefault []\\n s0 = False :: s1\\n s2 = append (tail s1 |> withDefault []) [False]\\n\\n gen d0 d1 d2 =\\n case (d0,d1,d2) of\\n (False, True, True) -> True\\n ( True, False, True) -> True\\n ( True, True, False) -> True\\n _ -> False\\n\\n updatedHistory = map3 gen s0 s1 s2 :: model.history\\n updatedModel = {model | history = updatedHistory}\\n in (updatedModel, Cmd.none)\\n\\n\\ninit : Int -> (Model, Cmd Msg)\\ninit n =\\n let gen1 = fst (step (list n bool) (initialSeed 34))\\n in ({ history = [gen1], rows = n, cols= n }, Cmd.none)\\n\\ntype Msg = Tick Time\\n\\nsubscriptions model = every (0.2 * second) Tick\\n\\nmain = program\\n { init = init 40\\n , view = view\\n , update = update\\n , subscriptions = subscriptions\\n }\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"-module(ca).\\n-compile(export_all).\\n\\nrun(N,G) ->\\n run(N,G,0).\\n\\nrun(GN,G,GN) ->\\n io:fwrite(\\\"~B: \\\",[GN]),\\n print(G);\\nrun(N,G,GN) ->\\n io:fwrite(\\\"~B: \\\",[GN]),\\n print(G),\\n run(N,next(G),GN+1).\\n\\nprint([]) ->\\n io:fwrite(\\\"~n\\\");\\nprint([0|T]) ->\\n io:fwrite(\\\"_\\\"),\\n print(T);\\nprint([1|T]) ->\\n io:fwrite(\\\"#\\\"),\\n print(T).\\n\\nnext([]) ->\\n [];\\nnext([_]) ->\\n [0];\\nnext([H,1|_]=G) ->\\n next(G,[H]);\\nnext([_|_]=G) ->\\n next(G,[0]).\\n\\nnext([],Acc) ->\\n lists:reverse(Acc);\\nnext([0,_],Acc) ->\\n next([],[0|Acc]);\\nnext([1,X],Acc) ->\\n next([],[X|Acc]);\\nnext([0,X,0|T],Acc) ->\\n next([X,0|T],[0|Acc]);\\nnext([1,X,0|T],Acc) ->\\n next([X,0|T],[X|Acc]);\\nnext([0,X,1|T],Acc) ->\\n next([X,1|T],[X|Acc]);\\nnext([1,0,1|T],Acc) ->\\n next([0,1|T],[1|Acc]);\\nnext([1,1,1|T],Acc) ->\\n next([1,1|T],[0|Acc]).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"44> ca:run(9,[0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0]).\\n0: __###_##_#_#_#_#__#___\\n1: __#_#####_#_#_#_______\\n2: ___##___##_#_#________\\n3: ___##___###_#_________\\n4: ___##___#_##__________\\n5: ___##____###__________\\n6: ___##____#_#__________\\n7: ___##_____#___________\\n8: ___##_________________\\n9: ___##_________________\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM ONEDIM_AUTOMATA\\n\\n! for rosettacode.org\\n!\\n\\n!VAR I,J,N,W,K\\n\\n!$DYNAMIC\\nDIM X[0],X2[0]\\n\\nBEGIN\\n\\n DATA(20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0)\\n\\n PRINT(CHR$(12);)\\n N=20 ! number of generation required\\n READ(W)\\n !$DIM X[W+1],X2[W+1]\\n FOR I=1 TO W DO\\n READ(X[I])\\n END FOR\\n FOR K=1 TO N DO\\n PRINT(\\\"Generation\\\";K;TAB(16);)\\n FOR J=1 TO W DO\\n IF X[J]=1 THEN PRINT(\\\"#\\\";) ELSE PRINT(\\\"_\\\";) END IF\\n IF X[J-1]+X[J]+X[J+1]=2 THEN X2[J]=1 ELSE X2[J]=0 END IF\\n END FOR\\n PRINT\\n FOR J=1 TO W DO\\n X[J]=X2[J]\\n END FOR\\n END FOR\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"include machine.e\\n\\nfunction rules(integer tri)\\n return tri = 3 or tri = 5 or tri = 6\\nend function\\n\\nfunction next_gen(atom gen)\\n atom new, bit\\n new = rules(and_bits(gen,3)*2) -- work with the first bit separately\\n bit = 2\\n while gen > 0 do\\n new += bit*rules(and_bits(gen,7))\\n gen = floor(gen/2) -- shift right\\n bit *= 2 -- shift left\\n end while\\n return new\\nend function\\n\\nconstant char_clear = '_', char_filled = '#'\\n\\nprocedure print_gen(atom gen)\\n puts(1, int_to_bits(gen,32) * (char_filled - char_clear) + char_clear)\\n puts(1,'\\\\n')\\nend procedure\\n\\nfunction s_to_gen(sequence s)\\n s -= char_clear\\n return bits_to_int(s)\\nend function\\n\\natom gen, prev\\ninteger n\\n\\nn = 0\\nprev = 0\\ngen = bits_to_int(rand(repeat(2,32))-1)\\nwhile gen != prev do\\n printf(1,\\\"Generation %d: \\\",n)\\n print_gen(gen)\\n prev = gen\\n gen = next_gen(gen)\\n n += 1\\nend while\\n\\nprintf(1,\\\"Generation %d: \\\",n)\\nprint_gen(gen)\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"USING: bit-arrays io kernel locals math sequences ;\\nIN: cellular\\n\\n: bool-sum ( bool1 bool2 -- sum )\\n [ [ 2 ] [ 1 ] if ]\\n [ [ 1 ] [ 0 ] if ] if ;\\n:: neighbours ( index world -- # )\\n index [ 1 - ] [ 1 + ] bi [ world ?nth ] bi@ bool-sum ;\\n: count-neighbours ( world -- neighbours )\\n [ length iota ] keep [ neighbours ] curry map ;\\n\\n: life-law ( alive? neighbours -- alive? )\\n swap [ 1 = ] [ 2 = ] if ;\\n: step ( world -- world' )\\n dup count-neighbours [ life-law ] ?{ } 2map-as ;\\n: print-cellular ( world -- )\\n [ CHAR: # CHAR: _ ? ] \\\"\\\" map-as print ;\\n: main-cellular ( -- )\\n ?{ f t t t f t t f t f t f t f t f f t f f }\\n 10 [ dup print-cellular step ] times print-cellular ;\\nMAIN: main-cellular\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Automaton\\n{\\n static Int[] evolve (Int[] array)\\n {\\n return array.map |Int x, Int i -> Int|\\n {\\n if (i == 0)\\n return ( (x + array[1] == 2) ? 1 : 0)\\n else if (i == array.size-1)\\n return ( (x + array[-2] == 2) ? 1 : 0)\\n else if (x + array[i-1] + array[i+1] == 2)\\n return 1\\n else\\n return 0\\n }\\n }\\n\\n public static Void main ()\\n {\\n Int[] array := [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\\n echo (array.join(\\\"\\\"))\\n Int[] newArray := evolve(array)\\n while (newArray != array)\\n {\\n echo (newArray.join(\\\"\\\"))\\n array = newArray\\n newArray = evolve(array)\\n }\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"1.1 S OLD(2)=1; S OLD(3)=1; S OLD(4)=1; S OLD(6)=1; S OLD(7)=1\\n1.2 S OLD(9)=1; S OLD(11)=1; S OLD(13)=1; S OLD(15)=1; S OLD(18)=1\\n1.3 F N=1,10; D 2\\n1.4 Q\\n\\n2.1 F X=1,20; D 3\\n2.2 F X=1,20; D 6\\n2.3 F X=1,20; S OLD(X)=NEW(X)\\n2.4 T !\\n\\n3.1 I (OLD(X-1)+OLD(X)+OLD(X+1)-2)4.1,5.1,4.1\\n\\n4.1 S NEW(X)=0\\n\\n5.1 S NEW(X)=1\\n\\n6.1 I (-OLD(X))7.1,8.1,8.1\\n\\n7.1 T \\\"#\\\"\\n\\n8.1 T \\\".\\\"\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \": init ( bits count -- )\\n 0 do dup 1 and c, 2/ loop drop ;\\n\\n20 constant size\\ncreate state $2556e size init 0 c,\\n\\n: .state\\n cr size 0 do\\n state i + c@ if .\\\" #\\\" else space then\\n loop ;\\n\\n: ctable create does> + c@ ;\\nctable rules $68 8 init\\n\\n: gen\\n state c@ ( window )\\n size 0 do\\n 2* state i + 1+ c@ or 7 and\\n dup rules state i + c!\\n loop drop ;\\n\\n: life1d ( n -- )\\n .state 1 do gen .state loop ;\\n\\n10 life1d\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" ### ## # # # # #\\n # ##### # # #\\n ## ## # #\\n ## ### #\\n ## # ##\\n ## ###\\n ## # #\\n ## #\\n ##\\n ## ok\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM LIFE_1D\\n\\n IMPLICIT NONE\\n\\n LOGICAL :: cells(20) = (/ .FALSE., .TRUE., .TRUE., .TRUE., .FALSE., .TRUE., .TRUE., .FALSE., .TRUE., .FALSE., &\\n .TRUE., .FALSE., .TRUE., .FALSE., .TRUE., .FALSE., .FALSE., .TRUE., .FALSE., .FALSE. /)\\n INTEGER :: i\\n\\n DO i = 0, 9\\n WRITE(*, \\\"(A,I0,A)\\\", ADVANCE = \\\"NO\\\") \\\"Generation \\\", i, \\\": \\\"\\n CALL Drawgen(cells)\\n CALL Nextgen(cells)\\n END DO\\n\\nCONTAINS\\n\\n SUBROUTINE Nextgen(cells)\\n LOGICAL, INTENT (IN OUT) :: cells(:)\\n LOGICAL :: left, centre, right\\n INTEGER :: i\\n\\n left = .FALSE.\\n DO i = 1, SIZE(cells)-1\\n centre = cells(i)\\n right = cells(i+1)\\n IF (left .AND. right) THEN\\n cells(i) = .NOT. cells(i)\\n ELSE IF (.NOT. left .AND. .NOT. right) THEN\\n cells(i) = .FALSE.\\n END IF\\n left = centre\\n END DO\\n cells(SIZE(cells)) = left .AND. right\\n END SUBROUTINE Nextgen\\n\\n SUBROUTINE Drawgen(cells)\\n LOGICAL, INTENT (IN OUT) :: cells(:)\\n INTEGER :: i\\n\\n DO i = 1, SIZE(cells)\\n IF (cells(i)) THEN\\n WRITE(*, \\\"(A)\\\", ADVANCE = \\\"NO\\\") \\\"#\\\"\\n ELSE\\n WRITE(*, \\\"(A)\\\", ADVANCE = \\\"NO\\\") \\\"_\\\"\\n END IF\\n END DO\\n WRITE(*,*)\\n END SUBROUTINE Drawgen\\n\\nEND PROGRAM LIFE_1D\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define SIZE 640\\n\\nrandomize timer\\n\\ndim as ubyte arr(0 to SIZE-1, 0 to 1)\\ndim as uinteger i\\nfor i = 0 to SIZE - 1 'initialise array with zeroes and ones\\n arr(i, 0)=int(rnd+0.5)\\nnext i\\n\\nscreen 12 'display graphically\\n\\ndim as string ch=\\\" \\\"\\ndim as uinteger j = 0, cur = 0, nxt, prv, neigh\\nwhile not ch = \\\"q\\\" or ch = \\\"Q\\\"\\n for i = 0 to SIZE - 1\\n pset(i, j), 8+7*arr(i,cur) 'print off cells as grey, on cells as bright white\\n nxt = (i + 1) mod SIZE\\n prv = (i - 1)\\n if prv < 0 then prv = SIZE - 1 'let's have a wrap-around array for fun\\n neigh = arr(prv, cur) + arr(nxt, cur)\\n if arr(i, cur) = 0 then 'evolution rules\\n if neigh = 2 then\\n arr(i, 1-cur) = 1\\n else\\n arr(i, 1-cur) = 0\\n end if\\n else\\n if neigh = 0 or neigh = 2 then\\n arr(i, 1-cur) = 0\\n else\\n arr(i, 1-cur) = 1\\n end if\\n end if\\n next i\\n j = j + 1\\n cur = 1 - cur\\n do\\n ch = inkey\\n if ch <> \\\"\\\" then exit do 'press any key to advance the sim\\n 'or Q to exit\\n loop\\nwend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"'\\n' One Dimensional Cellular Automaton\\n'\\nstart$=\\\"01110110101010100100\\\"\\nmax_cycles%=20 ! give a maximum depth\\n'\\n' Global variables hold the world, with two rows\\n' world! is set up with 2 extra cells width, so there is a FALSE on either side\\n' cur% gives the row for current world,\\n' new% gives the row for the next world.\\n'\\nsize%=LEN(start$)\\nDIM world!(size%+2,2)\\ncur%=0\\nnew%=1\\nclock%=0\\n'\\n@setup_world(start$)\\nOPENW 1\\nCLEARW 1\\nDO\\n @display_world\\n @update_world\\n EXIT IF @same_state\\n clock%=clock%+1\\n EXIT IF clock%>max_cycles% ! safety net\\nLOOP\\n~INP(2)\\nCLOSEW 1\\n'\\n' parse given string to set up initial states in world\\n' -- assumes world! is of correct size\\n'\\nPROCEDURE setup_world(defn$)\\n LOCAL i%\\n ' clear out the array\\n ARRAYFILL world!(),FALSE\\n ' for each 1 in string, set cell to true\\n FOR i%=1 TO LEN(defn$)\\n IF MID$(defn$,i%,1)=\\\"1\\\"\\n world!(i%,0)=TRUE\\n ENDIF\\n NEXT i%\\n ' set references to cur and new\\n cur%=0\\n new%=1\\nRETURN\\n'\\n' Display the world\\n'\\nPROCEDURE display_world\\n LOCAL i%\\n FOR i%=1 TO size%\\n IF world!(i%,cur%)\\n PRINT \\\"#\\\";\\n ELSE\\n PRINT \\\".\\\";\\n ENDIF\\n NEXT i%\\n PRINT \\\"\\\"\\nRETURN\\n'\\n' Create new version of world\\n'\\nPROCEDURE update_world\\n LOCAL i%\\n FOR i%=1 TO size%\\n world!(i%,new%)=@new_state(@get_value(i%))\\n NEXT i%\\n ' reverse cur/new\\n cur%=1-cur%\\n new%=1-new%\\nRETURN\\n'\\n' Test if cur/new states are the same\\n'\\nFUNCTION same_state\\n LOCAL i%\\n FOR i%=1 TO size%\\n IF world!(i%,cur%)<>world!(i%,new%)\\n RETURN FALSE\\n ENDIF\\n NEXT i%\\n RETURN TRUE\\nENDFUNC\\n'\\n' Return new state of cell given value\\n'\\nFUNCTION new_state(value%)\\n SELECT value%\\n CASE 0,1,2,4,7\\n RETURN FALSE\\n CASE 3,5,6\\n RETURN TRUE\\n ENDSELECT\\nENDFUNC\\n'\\n' Compute value for cell + neighbours\\n'\\nFUNCTION get_value(cell%)\\n LOCAL result%\\n result%=0\\n IF world!(cell%-1,cur%)\\n result%=result%+4\\n ENDIF\\n IF world!(cell%,cur%)\\n result%=result%+2\\n ENDIF\\n IF world!(cell%+1,cur%)\\n result%=result%+1\\n ENDIF\\n RETURN result%\\nENDFUNC\\n\",\n \"language\": \"GFA-Basic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nconst (\\n start = \\\"_###_##_#_#_#_#__#__\\\"\\n offLeft = '_'\\n offRight = '_'\\n dead = '_'\\n)\\n\\nfunc main() {\\n fmt.Println(start)\\n g := newGenerator(start, offLeft, offRight, dead)\\n for i := 0; i < 10; i++ {\\n fmt.Println(g())\\n }\\n}\\n\\nfunc newGenerator(start string, offLeft, offRight, dead byte) func() string {\\n g0 := string(offLeft) + start + string(offRight)\\n g1 := []byte(g0)\\n last := len(g0) - 1\\n return func() string {\\n for i := 1; i < last; i++ {\\n switch l := g0[i-1]; {\\n case l != g0[i+1]:\\n g1[i] = g0[i]\\n case g0[i] == dead:\\n g1[i] = l\\n default:\\n g1[i] = dead\\n }\\n }\\n g0 = string(g1)\\n return g0[1:last]\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sync\\\"\\n)\\n\\nconst (\\n start = \\\"_###_##_#_#_#_#__#__\\\"\\n offLeft = '_'\\n offRight = '_'\\n dead = '_'\\n)\\n\\nfunc main() {\\n fmt.Println(start)\\n a := make([]byte, len(start)+2)\\n a[0] = offLeft\\n copy(a[1:], start)\\n a[len(a)-1] = offRight\\n var read, write sync.WaitGroup\\n read.Add(len(start) + 1)\\n for i := 1; i <= len(start); i++ {\\n go cell(a[i-1:i+2], &read, &write)\\n }\\n for i := 0; i < 10; i++ {\\n write.Add(len(start) + 1)\\n read.Done()\\n read.Wait()\\n read.Add(len(start) + 1)\\n write.Done()\\n write.Wait()\\n fmt.Println(string(a[1 : len(a)-1]))\\n }\\n}\\n\\nfunc cell(kernel []byte, read, write *sync.WaitGroup) {\\n var next byte\\n for {\\n l, v, r := kernel[0], kernel[1], kernel[2]\\n read.Done()\\n switch {\\n case l != r:\\n next = v\\n case v == dead:\\n next = l\\n default:\\n next = dead\\n }\\n read.Wait()\\n kernel[1] = next\\n write.Done()\\n write.Wait()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def life1D = { self ->\\n def right = self[1..-1] + [false]\\n def left = [false] + self[0..-2]\\n [left, self, right].transpose().collect { hood -> hood.count { it } == 2 }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def cells = ('_###_##_#_#_#_#__#__' as List).collect { it == '#' }\\nprintln \\\"Generation 0: ${cells.collect { g -> g ? '#' : '_' }.join()}\\\"\\n(1..9).each {\\n cells = life1D(cells)\\n println \\\"Generation ${it}: ${cells.collect { g -> g ? '#' : '_' }.join()}\\\"\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List (unfoldr)\\nimport System.Random (newStdGen, randomRs)\\n\\nbnd :: String -> Char\\nbnd \\\"_##\\\" = '#'\\nbnd \\\"#_#\\\" = '#'\\nbnd \\\"##_\\\" = '#'\\nbnd _ = '_'\\n\\nnxt :: String -> String\\nnxt = unfoldr go . ('_' :) . (<> \\\"_\\\")\\n where\\n go [_, _] = Nothing\\n go xs = Just (bnd $ take 3 xs, drop 1 xs)\\n\\nlahmahgaan :: String -> [String]\\nlahmahgaan xs =\\n init\\n . until\\n ((==) . last <*> last . init)\\n ((<>) <*> pure . nxt . last)\\n $ [xs, nxt xs]\\n\\nmain :: IO ()\\nmain =\\n newStdGen\\n >>= ( mapM_ putStrLn . lahmahgaan\\n . map (\\\"_#\\\" !!)\\n . take 36\\n . randomRs (0, 1)\\n )\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"# One dimensional Cellular automaton\\nrecord Automaton(size, cells)\\n\\nprocedure make_automaton (size, items)\\n automaton := Automaton (size, items)\\n while (*items < size) do push (automaton.cells, 0)\\n return automaton\\nend\\n\\nprocedure automaton_display (automaton)\\n every (write ! automaton.cells)\\nend\\n\\nprocedure automaton_evolve (automaton)\\n revised := make_automaton (automaton.size, [])\\n # do the left-most cell\\n if ((automaton.cells[1] + automaton.cells[2]) = 2) then\\n revised.cells[1] := 1\\n # do the right-most cell\\n if ((automaton.cells[automaton.size] + automaton.cells[automaton.size-1]) = 2) then\\n revised.cells[revised.size] := 1\\n # do the intermediate cells\\n every (i := 2 to (automaton.size-1)) do {\\n if ((automaton.cells[i-1] + automaton.cells[i] + automaton.cells[i+1]) = 2) then\\n revised.cells[i] := 1\\n }\\n return revised\\nend\\n\\nprocedure main ()\\n automaton := make_automaton (20, [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0])\\n every (1 to 10) do { # generations\\n automaton_display (automaton)\\n automaton := automaton_evolve (automaton)\\n }\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure main(A)\\n A := if *A = 0 then [\\\"01110110101010100100\\\"]\\n CA := show(\\\"0\\\"||A[1]||\\\"0\\\") # add always dead border cells\\n every CA := show(|evolve(CA)\\\\10) # limit to max of 10 generations\\nend\\n\\nprocedure show(ca)\\n write(ca[2:-1]) # omit border cells\\n return ca\\nend\\n\\nprocedure evolve(CA)\\n newCA := repl(\\\"0\\\",*CA)\\n every newCA[i := 2 to (*CA-1)] := (CA[i-1]+CA[i]+CA[i+1] = 2, \\\"1\\\")\\n return CA ~== newCA # fail if no change\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(function next cells\\n (... str\\n (map (comp str (count [\\\"#\\\"]) (= 2) #(% \\\"#\\\" \\\"_\\\"))\\n (str \\\"_\\\" cells)\\n cells\\n (str (skip 1 cells) \\\"_\\\"))))\\n\\n(function generate n cells\\n (join \\\"\\\\n\\\" (reductions next cells (range n))))\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"life1d=: '_#'{~ (2 = 3+/\\\\ 0,],0:)^:a:\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" life1d ? 20 # 2\\n_###_##_#_#_#_#__#__\\n_#_#####_#_#_#______\\n__##___##_#_#_______\\n__##___###_#________\\n__##___#_##_________\\n__##____###_________\\n__##____#_#_________\\n__##_____#__________\\n__##________________\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"Rule=:2 :0 NB. , m: number of generations, n: rule number\\n '_#'{~ (3 ((|.n#:~8#2) {~ #.)\\\\ 0,],0:)^:(i.m)\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 9 Rule 104 '#'='_###_##_#_#_#_#__#__'\\n_###_##_#_#_#_#__#__\\n_#_#####_#_#_#______\\n__##___##_#_#_______\\n__##___###_#________\\n__##___#_##_________\\n__##____###_________\\n__##____#_#_________\\n__##_____#__________\\n__##________________\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Life{\\n\\tpublic static void main(String[] args) throws Exception{\\n\\t\\tString start= \\\"_###_##_#_#_#_#__#__\\\";\\n\\t\\tint numGens = 10;\\n\\t\\tfor(int i= 0; i < numGens; i++){\\n\\t\\t\\tSystem.out.println(\\\"Generation \\\" + i + \\\": \\\" + start);\\n\\t\\t\\tstart= life(start);\\n\\t\\t}\\n\\t}\\n\\n\\tpublic static String life(String lastGen){\\n\\t\\tString newGen= \\\"\\\";\\n\\t\\tfor(int i= 0; i < lastGen.length(); i++){\\n\\t\\t\\tint neighbors= 0;\\n\\t\\t\\tif (i == 0){//left edge\\n\\t\\t\\t\\tneighbors= lastGen.charAt(1) == '#' ? 1 : 0;\\n\\t\\t\\t} else if (i == lastGen.length() - 1){//right edge\\n\\t\\t\\t\\tneighbors= lastGen.charAt(i - 1) == '#' ? 1 : 0;\\n\\t\\t\\t} else{//middle\\n\\t\\t\\t\\tneighbors= getNeighbors(lastGen.substring(i - 1, i + 2));\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (neighbors == 0){//dies or stays dead with no neighbors\\n\\t\\t\\t\\tnewGen+= \\\"_\\\";\\n\\t\\t\\t}\\n\\t\\t\\tif (neighbors == 1){//stays with one neighbor\\n\\t\\t\\t\\tnewGen+= lastGen.charAt(i);\\n\\t\\t\\t}\\n\\t\\t\\tif (neighbors == 2){//flips with two neighbors\\n\\t\\t\\t\\tnewGen+= lastGen.charAt(i) == '#' ? \\\"_\\\" : \\\"#\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn newGen;\\n\\t}\\n\\n\\tpublic static int getNeighbors(String group){\\n\\t\\tint ans= 0;\\n\\t\\tif (group.charAt(0) == '#') ans++;\\n\\t\\tif (group.charAt(2) == '#') ans++;\\n\\t\\treturn ans;\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class Life{\\n\\tprivate static char[] trans = \\\"___#_##_\\\".toCharArray();\\n\\n\\tprivate static int v(StringBuilder cell, int i){\\n\\t\\treturn (cell.charAt(i) != '_') ? 1 : 0;\\n\\t}\\n\\n\\tpublic static boolean evolve(StringBuilder cell){\\n\\t\\tboolean diff = false;\\n\\t\\tStringBuilder backup = new StringBuilder(cell.toString());\\n\\n\\t\\tfor(int i = 1; i < cell.length() - 3; i++){\\n\\t\\t\\t/* use left, self, right as binary number bits for table index */\\n\\t\\t\\tbackup.setCharAt(i, trans[v(cell, i - 1) * 4 + v(cell, i) * 2\\n\\t\\t\\t \\t\\t\\t\\t\\t+ v(cell, i + 1)]);\\n\\t\\t\\tdiff = diff || (backup.charAt(i) != cell.charAt(i));\\n\\t\\t}\\n\\n\\t\\tcell.delete(0, cell.length());//clear the buffer\\n\\t\\tcell.append(backup);//replace it with the new generation\\n\\t\\treturn diff;\\n\\t}\\n\\n\\tpublic static void main(String[] args){\\n\\t\\tStringBuilder c = new StringBuilder(\\\"_###_##_#_#_#_#__#__\\\\n\\\");\\n\\n\\t\\tdo{\\n\\t\\t\\tSystem.out.printf(c.substring(1));\\n\\t\\t}while(evolve(c));\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function caStep(old) {\\n var old = [0].concat(old, [0]); // Surround with dead cells.\\n var state = []; // The new state.\\n\\n for (var i=1; i<old.length-1; i++) {\\n switch (old[i-1] + old[i+1]) {\\n case 0: state[i-1] = 0; break;\\n case 1: state[i-1] = (old[i] == 1) ? 1 : 0; break;\\n case 2: state[i-1] = (old[i] == 1) ? 0 : 1; break;\\n }\\n }\\n return state;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"alert(caStep([0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# The 1-d cellular automaton:\\ndef next:\\n # Conveniently, jq treats null as 0 when it comes to addition\\n # so there is no need to fiddle with the boundaries\\n . as $old\\n | reduce range(0; length) as $i\\n ([];\\n ($old[$i-1] + $old[$i+1]) as $s\\n | if $s == 0 then .[$i] = 0\\n elif $s == 1 then .[$i] = (if $old[$i] == 1 then 1 else 0 end)\\n else .[$i] = (if $old[$i] == 1 then 0 else 1 end)\\n end);\\n\\n\\n# pretty-print an array:\\ndef pp: reduce .[] as $i (\\\"\\\"; . + (if $i == 0 then \\\" \\\" else \\\"*\\\" end));\\n\\n# continue until quiescence:\\ndef go: recurse(. as $prev | next | if . == $prev then empty else . end) | pp;\\n\\n# Example:\\n[0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0] | go\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -c -r -n -f One-dimensional_cellular_automata.jq\\n *** ** * * * * *\\n * ***** * * *\\n ** ** * *\\n ** *** *\\n ** * **\\n ** ***\\n ** * *\\n ** *\\n **\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"automaton(g::Vector{Bool}) =\\n for i ∈ 0:9\\n \\tprintln(join(alive ? '#' : '_' for alive ∈ g))\\n\\t g = ([false; g[1:end-1]] .+ g .+ [g[2:end]; false]) .== 2\\n end\\n\\nautomaton([c == '#' for c ∈ \\\"_###_##_#_#_#_#__#__\\\"])\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"struct Automaton g₀::Vector{Bool} end\\n\\nBase.iterate(a::Automaton, g = a.g₀) =\\n g, ([false; g[1:end-1]] .+ g .+ [g[2:end]; false]) .== 2\\n\\nBase.show(io::IO, a::Automaton) = for g in Iterators.take(a, 10)\\n println(io, join(alive ? '#' : '_' for alive ∈ g)) end\\n\\nAutomaton([c == '#' for c ∈ \\\"_###_##_#_#_#_#__#__\\\"])\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"f:{2=+/(0,x,0)@(!#x)+/:!3}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" `0:\\\"_X\\\"@f\\\\0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0\\n_XXX_XX_X_X_X_X__X__\\n_X_XXXXX_X_X_X______\\n__XX___XX_X_X_______\\n__XX___XXX_X________\\n__XX___X_XX_________\\n__XX____XXX_________\\n__XX____X_X_________\\n__XX_____X__________\\n__XX________________\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\nval trans = \\\"___#_##_\\\"\\n\\nfun v(cell: StringBuilder, i: Int) = if (cell[i] != '_') 1 else 0\\n\\nfun evolve(cell: StringBuilder, backup: StringBuilder): Boolean {\\n val len = cell.length - 2\\n var diff = 0\\n for (i in 1 until len) {\\n /* use left, self, right as binary number bits for table index */\\n backup[i] = trans[v(cell, i - 1) * 4 + v(cell, i) * 2 + v(cell, i + 1)]\\n diff += if (backup[i] != cell[i]) 1 else 0\\n }\\n cell.setLength(0)\\n cell.append(backup)\\n return diff != 0\\n}\\n\\nfun main(args: Array<String>) {\\n val c = StringBuilder(\\\"_###_##_#_#_#_#__#__\\\")\\n val b = StringBuilder(\\\"____________________\\\")\\n do {\\n println(c.substring(1))\\n }\\n while (evolve(c,b))\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"' [RC] 'One-dimensional cellular automata'\\n\\n' does not wrap so fails for some rules\\nrule$ =\\\"00010110\\\" ' Rule 22 decimal\\n\\nstate$ =\\\"0011101101010101001000\\\"\\n\\nfor j =1 to 20\\n print state$\\n oldState$ =state$\\n state$ =\\\"0\\\"\\n for k =2 to len( oldState$) -1\\n NHood$ =mid$( oldState$, k -1, 3) ' pick 3 char neighbourhood and turn binary string to decimal\\n vNHood =0\\n for kk =3 to 1 step -1\\n vNHood =vNHood +val( mid$( NHood$, kk, 1)) *2^( 3 -kk)\\n next kk\\n ' .... & use it to index into rule$ to find appropriate new value\\n state$ =state$ +mid$( rule$, vNHood +1, 1)\\n next k\\n state$ =state$ +\\\"0\\\"\\n\\nnext j\\n\\nend\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"10 MODE 1:n=10:READ w:DIM x(w+1),x2(w+1):FOR i=1 to w:READ x(i):NEXT\\n20 FOR k=1 TO n\\n30 FOR j=1 TO w\\n40 IF x(j) THEN PRINT \\\"#\\\"; ELSE PRINT \\\"_\\\";\\n50 IF x(j-1)+x(j)+x(j+1)=2 THEN x2(j)=1 ELSE x2(j)=0\\n60 NEXT:PRINT\\n70 FOR j=1 TO w:x(j)=x2(j):NEXT\\n80 NEXT\\n90 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"make \\\"cell_list [0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0]\\nmake \\\"generations 9\\n\\nto evolve :n\\nifelse :n=1 [make \\\"nminus1 item :cell_count :cell_list][make \\\"nminus1 item :n-1 :cell_list]\\nifelse :n=:cell_count[make \\\"nplus1 item 1 :cell_list][make \\\"nplus1 item :n+1 :cell_list]\\nifelse ((item :n :cell_list)=0) [\\n\\tifelse (and (:nminus1=1) (:nplus1=1)) [output 1][output (item :n :cell_list)]\\n][\\n\\tifelse (and (:nminus1=1) (:nplus1=1)) [output 0][\\n\\t ifelse and (:nminus1=0) (:nplus1=0) [output 0][output (item :n :cell_list)]]\\n]\\nend\\n\\nto CA_1D :cell_list :generations\\nmake \\\"cell_count count :cell_list\\n(print \\\")\\nmake \\\"printout \\\"\\nrepeat :cell_count [\\nmake \\\"printout word :printout ifelse (item repcount :cell_list)=1 [\\\"#][\\\"_]\\n]\\n(print \\\"Generation \\\"0: :printout)\\n\\nrepeat :generations [\\n (make \\\"cell_list_temp [])\\n repeat :cell_count[\\n (make \\\"cell_list_temp (lput (evolve repcount) :cell_list_temp))\\n ]\\n make \\\"cell_list :cell_list_temp\\n make \\\"printout \\\"\\n repeat :cell_count [\\n \\t make \\\"printout word :printout ifelse (item repcount :cell_list)=1 [\\\"#][\\\"_]\\n ]\\n (print \\\"Generation word repcount \\\": :printout)\\n]\\nend\\n\\nCA_1D :cell_list :generations\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"num_iterations = 9\\nf = { 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0 }\\n\\nfunction Output( f, l )\\n io.write( l, \\\": \\\" )\\n for i = 1, #f do\\n local c\\n if f[i] == 1 then c = '#' else c = '_' end\\n io.write( c )\\n end\\n print \\\"\\\"\\nend\\n\\nOutput( f, 0 )\\n\\nfor l = 1, num_iterations do\\n local g = {}\\n for i = 2, #f-1 do\\n if f[i-1] + f[i+1] == 1 then\\n g[i] = f[i]\\n elseif f[i] == 0 and f[i-1] + f[i+1] == 2 then\\n g[i] = 1\\n else\\n g[i] = 0\\n end\\n end\\n if f[1] == 1 and f[2] == 1 then g[1] = 1 else g[1] = 0 end\\n if f[#f] == 1 and f[#f-1] == 1 then g[#f] = 1 else g[#f] = 0 end\\n f, g = g, f\\n\\n Output( f, l )\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"divert(-1)\\ndefine(`set',`define(`$1[$2]',`$3')')\\ndefine(`get',`defn(`$1[$2]')')\\ndefine(`setrange',`ifelse(`$3',`',$2,`define($1[$2],$3)`'setrange($1,\\n incr($2),shift(shift(shift($@))))')')\\n\\ndnl throw in sentinels at each end (0 and size+1) to make counting easy\\ndefine(`new',`set($1,size,eval($#-1))`'setrange($1,1,\\n shift($@))`'set($1,0,0)`'set($1,$#,0)')\\n\\ndefine(`for',\\n `ifelse($#,0,``$0'',\\n `ifelse(eval($2<=$3),1,\\n `pushdef(`$1',$2)$4`'popdef(`$1')$0(`$1',incr($2),$3,`$4')')')')\\ndefine(`show',\\n `for(`k',1,get($1,size),`get($1,k) ')')\\n\\ndnl swap(`a',a,`b') using arg stack for temp\\ndefine(`swap',`define(`$1',$3)`'define(`$3',$2)')\\ndefine(`nalive',\\n `eval(get($1,decr($2))+get($1,incr($2)))')\\nsetrange(`live',0,0,1,0)\\nsetrange(`dead',0,0,0,1)\\ndefine(`nv',\\n `ifelse(get($1,z),0,`get(dead,$3)',`get(live,$3)')')\\ndefine(`evolve',\\n `for(`z',1,get($1,size),\\n `set($2,z,nv($1,z,nalive($1,z)))')')\\nnew(`a',0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0)\\nset(`b',size,get(`a',size))`'set(`b',0,0)`'set(`b',incr(get(`a',size)),0)\\ndefine(`x',`a')\\ndefine(`y',`b')\\ndivert\\nfor(`j',1,10,\\n `show(x)`'evolve(`x',`y')`'swap(`x',x,`y')\\n')`'show(x)\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \"CellularAutomaton[{{0,0,_}->0,{0,1,0}->0,{0,1,1}->1,{1,0,0}->0,{1,0,1}->1,{1,1,0}->1,{1,1,1}->0},{{1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1},0},12]\\nPrint @@@ (% /. {1 -> \\\"#\\\", 0 -> \\\".\\\"});\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"CellularAutomaton[2^^01101000 (* == 104 *), {{1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1}, 0}, 12];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"###.##.#.#.#.#..#\\n#.#####.#.#.#....\\n.##...##.#.#.....\\n.##...###.#......\\n.##...#.##.......\\n.##....###.......\\n.##....#.#.......\\n.##.....#........\\n.##..............\\n.##..............\\n.##..............\\n.##..............\\n.##..............\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function one_dim_cell_automata(v,n)\\n V='_#';\\n while n>=0;\\n\\tdisp(V(v+1));\\n\\tn = n-1;\\n\\tv = filter([1,1,1],1,[0,v,0]);\\n\\tv = v(3:end)==2;\\n end;\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"MODULE Cell EXPORTS Main;\\n\\nIMPORT IO, Fmt, Word;\\n\\nVAR culture := ARRAY [0..19] OF INTEGER {0, 1, 1, 1,\\n 0, 1, 1, 0,\\n 1, 0, 1, 0,\\n 1, 0, 1, 0,\\n 0, 1, 0, 0};\\n\\nPROCEDURE Step(VAR culture: ARRAY OF INTEGER) =\\n VAR left: INTEGER := 0;\\n this, right: INTEGER;\\n BEGIN\\n FOR i := FIRST(culture) TO LAST(culture) - 1 DO\\n right := culture[i + 1];\\n this := culture[i];\\n culture[i] :=\\n Word.Or(Word.And(this, Word.Xor(left, right)), Word.And(Word.Not(this), Word.And(left, right)));\\n left := this;\\n END;\\n culture[LAST(culture)] := Word.And(culture[LAST(culture)], Word.Not(left));\\n END Step;\\n\\nPROCEDURE Put(VAR culture: ARRAY OF INTEGER) =\\n BEGIN\\n FOR i := FIRST(culture) TO LAST(culture) DO\\n IF culture[i] = 1 THEN\\n IO.PutChar('#');\\n ELSE\\n IO.PutChar('_');\\n END;\\n END;\\n END Put;\\n\\nBEGIN\\n FOR i := 0 TO 9 DO\\n IO.Put(\\\"Generation \\\" & Fmt.Int(i) & \\\" \\\");\\n Put(culture);\\n IO.Put(\\\"\\\\n\\\");\\n Step(culture);\\n END;\\nEND Cell.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"30 VAR length .\\n35 VAR height .\\nFOR length 0 ENDFOR 1 0 ARR VAR list .\\nlength 1 - VAR topLen .\\nFOR topLen 0 ENDFOR 1 ARR VAR topLst .\\n\\nDEF getNeighbors\\n 1 - VAR tempIndex .\\n GET tempIndex SWAP\\n tempIndex 1 + VAR tempIndex .\\n GET tempIndex SWAP\\n tempIndex 1 + VAR tempIndex .\\n GET tempIndex SWAP .\\n FOR 3 TOSTR ROT ENDFOR\\n FOR 2 SWAP + ENDFOR\\nENDDEF\\n\\nDEF printArr\\n LEN 1 - VAR stLen .\\n 0 VAR j .\\n FOR stLen\\n GET j\\n TOSTR OUT .\\n j 1 + VAR j .\\n ENDFOR\\n || PRINT .\\nENDDEF\\n\\nFOR height\\n FOR length 0 ENDFOR ARR VAR next .\\n 1 VAR i .\\n FOR length\\n list i getNeighbors VAR last .\\n i 1 - VAR ind .\\n last |111| ==\\n IF : .\\n next 0 INSERT ind\\n ENDIF\\n\\n last |110| ==\\n IF : .\\n next 1 INSERT ind\\n ENDIF\\n\\n last |101| ==\\n IF : .\\n next 1 INSERT ind\\n ENDIF\\n\\n last |100| ==\\n IF : .\\n next 0 INSERT ind\\n ENDIF\\n\\n last |011| ==\\n IF : .\\n next 1 INSERT ind\\n ENDIF\\n\\n last |010| ==\\n IF : .\\n next 1 INSERT ind\\n ENDIF\\n\\n last |001| ==\\n IF : .\\n next 1 INSERT ind\\n ENDIF\\n\\n last |000| ==\\n IF : .\\n next 0 INSERT ind\\n ENDIF\\n clear\\n i 1 + VAR i .\\n ENDFOR\\n next printArr .\\n next 0 ADD APPEND . VAR list .\\nENDFOR\\n\",\n \"language\": \"MontiLang\"\n },\n {\n \"code\": \"% we need a way to write a values and pass the same back\\nwi is rest link [write, pass]\\n% calculate the neighbors by rotating the array left and right and joining them\\nneighbors is pack [pass, sum [-1 rotate, 1 rotate]]\\n% calculate the individual birth and death of a single array element\\nigen is fork [ = [ + [first, second], 3 first], 0 first, = [ + [first, second], 2 first], 1 first, 0 first ]\\n% apply that to the array\\nnextgen is each igen neighbors\\n% 42\\nlife is fork [ > [sum pass, 0 first], life nextgen wi, pass ]\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"|loaddefs 'life.nial'\\n|I := [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\\n|life I\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import random\\n\\n\\ntype\\n BoolArray = array[30, bool]\\n Symbols = array[bool, char]\\n\\n\\nproc neighbours(map: BoolArray, i: int): int =\\n if i > 0: inc(result, int(map[i - 1]))\\n if i + 1 < len(map): inc(result, int(map[i + 1]))\\n\\nproc print(map: BoolArray, symbols: Symbols) =\\n for i in map: write(stdout, symbols[i])\\n write(stdout, \\\"\\\\l\\\")\\n\\nproc randomMap: BoolArray =\\n randomize()\\n for i in mitems(result): i = sample([true, false])\\n\\n\\nconst\\n num_turns = 20\\n symbols = ['_', '#']\\n\\n T = true\\n F = false\\n\\nvar map =\\n [F, T, T, T, F, T, T, F, T, F, T, F, T, F, T,\\n F, F, T, F, F, F, F, F, F, F, F, F, F, F, F]\\n\\n# map = randomMap() # uncomment for random start\\n\\nprint(map, symbols)\\n\\nfor _ in 0 ..< num_turns:\\n var map2 = map\\n\\n for i, v in pairs(map):\\n map2[i] =\\n if v: neighbours(map, i) == 1\\n else: neighbours(map, i) == 2\\n\\n print(map2, symbols)\\n\\n if map2 == map: break\\n map = map2\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import strutils\\n\\nconst\\n s_init: string = \\\"_###_##_#_#_#_#__#__\\\"\\n arrLen: int = 20\\n\\nvar q0: string = s_init & repeat('_',arrLen-20)\\nvar q1: string = q0\\n\\nproc life(s:string): char =\\n var str: string = s\\n if len(normalize(str)) == 2: # normalize eliminates underscores\\n return '#'\\n return '_'\\n\\nproc evolve(q: string): string =\\n result = repeat('_',arrLen)\\n #result[0] = '_'\\n for i in 1 .. q.len-1:\\n result[i] = life(substr(q & '_',i-1,i+1))\\n\\necho(q1)\\nq1 = evolve(q0)\\necho(q1)\\nwhile q1 != q0:\\n q0 = q1\\n q1 = evolve(q0)\\n echo(q1)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"proc cellAutomata =\\n proc evolveInto(x, t : var string) =\\n for i in x.low..x.high:\\n let\\n alive = x[i] == 'o'\\n left = if i == x.low: false else: x[i - 1] == 'o'\\n right = if i == x.high: false else: x[i + 1] == 'o'\\n t[i] =\\n if alive: (if left xor right: 'o' else: '.')\\n else: (if left and right: 'o' else: '.')\\n\\n var\\n x = \\\".ooo.oo.o.o.o.o..o..\\\"\\n t = x\\n\\n for i in 1..10:\\n x.echo\\n x.evolveInto t\\n swap t, x\\n\\ncellAutomata()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let get g i =\\n try g.(i)\\n with _ -> 0\\n\\nlet next_cell g i =\\n match get g (i-1), get g (i), get g (i+1) with\\n | 0, 0, 0 -> 0\\n | 0, 0, 1 -> 0\\n | 0, 1, 0 -> 0\\n | 0, 1, 1 -> 1\\n | 1, 0, 0 -> 0\\n | 1, 0, 1 -> 1\\n | 1, 1, 0 -> 1\\n | 1, 1, 1 -> 0\\n | _ -> assert(false)\\n\\nlet next g =\\n let old_g = Array.copy g in\\n for i = 0 to pred(Array.length g) do\\n g.(i) <- (next_cell old_g i)\\n done\\n\\nlet print_g g =\\n for i = 0 to pred(Array.length g) do\\n if g.(i) = 0\\n then print_char '_'\\n else print_char '#'\\n done;\\n print_newline()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": nextGen( l )\\n| i s |\\n l byteSize dup ->s String newSize\\n s loop: i [\\n i 1 if=: [ 0 ] else: [ i 1- l byteAt '#' = ]\\n i l byteAt '#' = +\\n i s if=: [ 0 ] else: [ i 1+ l byteAt '#' = ] +\\n 2 if=: [ '#' ] else: [ '_' ] over add\\n ]\\n;\\n\\n: gen( l n -- )\\n l dup .cr #[ nextGen dup .cr ] times( n ) drop ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n A0 = {List.toTuple unit \\\"_###_##_#_#_#_#__#__\\\"}\\n\\n MaxGenerations = 9\\n\\n Rules = unit('___':&_\\n '__#':&_\\n '_#_':&_\\n '_##':&#\\n '#__':&_\\n '#_#':&#\\n '##_':&#\\n '###':&_)\\n\\n fun {Evolve A}\\n {Record.mapInd A\\n fun {$ I V}\\n Left = {CondSelect A I-1 &_}\\n Right = {CondSelect A I+1 &_}\\n Env = {String.toAtom [Left V Right]}\\n in\\n Rules.Env\\n end\\n }\\n end\\n\\n fun lazy {Iterate X F}\\n X|{Iterate {F X} F}\\n end\\nin\\n for\\n I in 0..MaxGenerations\\n A in {Iterate A0 Evolve}\\n do\\n {System.showInfo \\\"Gen. \\\"#I#\\\": \\\"#{Record.toList A}}\\n end\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"step(v)=my(u=vector(#v),k);u[1]=v[1]&v[2];u[#u]=v[#v]&v[#v-1];for(i=2,#v-1,k=v[i-1]+v[i+1];u[i]=if(v[i],k==1,k==2));u;\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"cur = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]; for(n=0, 9, print(cur); cur = step(cur));\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"[0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0]\\n[0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program Test;\\n{$IFDEF FPC}{$MODE DELPHI}{$ELSE}{$APPTYPE}{$ENDIF}\\nuses\\n sysutils;\\nconst\\n cCHAR: array[0..1] of char = ('_','#');\\ntype\\n TRow = array of byte;\\n\\nfunction ConvertToRow(const s:string):tRow;\\nvar\\n i : NativeInt;\\nBegin\\n i := length(s);\\n setlength(Result,length(s));\\n For i := i downto 0 do\\n result[i-1]:= ORD(s[i]=cChar[1]);\\nend;\\n\\nfunction OutRow(const row:tRow):string;\\n//create output string\\nvar\\n i: NativeInt;\\nBegin\\n i := length(row);\\n setlength(result,i);\\n For i := i downto 1 do\\n result[i]:= cChar[row[i-1]];\\nend;\\n\\nprocedure NextRow(row:pByteArray;MaxIdx:NativeInt);\\n//compute next row in place by the using a small storage for the\\n//2 values, that would otherwise be overridden\\nvar\\n leftValue,Value: NativeInt;\\n i,trpCnt: NativeInt;\\nBegin\\n leftValue := 0;\\n trpCnt := row[0]+row[1];\\n\\n i := 0;\\n while i < MaxIdx do\\n Begin\\n Value := row[i];\\n //the rule for survive : PopCnt == 2\\n row[i] := ORD(trpCnt= 2);\\n //reduce popcnt of element before\\n dec(trpCnt,leftValue);\\n //goto next element\\n inc(i);\\n leftValue := Value;\\n //increment popcnt by right element\\n inc(trpCnt,row[i+1]);\\n //move to next position in ring buffer\\n end;\\n row[MaxIdx] := ORD(trpCnt= 2);\\nend;\\n\\nconst\\n TestString: string=' ### ## # # # # # ';\\nvar\\n s: string;\\n row:tRow;\\n i: NativeInt;\\nbegin\\n s := Teststring;\\n row:= ConvertToRow(s);\\n For i := 0 to 9 do\\n Begin\\n writeln(OutRow(row));\\n NextRow(@row[0],High(row));\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"$_=\\\"_###_##_#_#_#_#__#__\\\\n\\\";\\ndo {\\n y/01/_#/;\\n print;\\n y/_#/01/;\\n s/(?<=(.))(.)(?=(.))/$1 == $3 ? $1 ? 1-$2 : 0 : $2/eg;\\n} while ($x ne $_ and $x=$_);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"$_=\\\"_###_##_#_#_#_#__#__\\\\n\\\";\\n%h=qw(# _ _ #);\\ndo {\\n print;\\n s/(?<=(.))(.)(?=(.))/$1 eq $3 ? $1 eq \\\"_\\\" ? \\\"_\\\" : $h{$2} : $2/eg;\\n} while ($x ne $_ and $x=$_);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"_###_##_#_#_#_#__#__\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'_'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">toggled</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'#'</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'#'</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">130</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #000000;\\\">toggled</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">toggled</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">toggled</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"________________________#________________________\\\"</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'_'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">toggled</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">24</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">curr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">curr</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'#'</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">130</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">prev</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">curr</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 stklen var w\\nw tolist 0 0 put\\n0 w 1 + repeat var x2\\n\\n10 for\\n\\tdrop\\n\\tw for\\n\\t\\tvar j\\n\\t\\tj get 1 == if \\\"#\\\" else \\\"_\\\" endif print\\n\\t\\tj 1 - get var p1 j get swap j 1 + get rot p1 + + 2 ==\\n\\t\\tx2 swap j set var x2\\n\\tendfor\\n\\tnl\\n\\tdrop x2\\nendfor\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"go =>\\n % _ # # # _ # # _ # _ # _ # _ # _ _ # _ _\\n S = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0],\\n println(init=S),\\n run_ca(S),\\n nl,\\n\\n println(\\\"Some random inits:\\\"),\\n _ = random2(),\\n foreach(N in [5,10,20,50])\\n S2 = [random() mod 2 : _I in 1..N],\\n run_ca(S2),\\n nl\\n end.\\n\\n%\\n% Run a CA and show the result.\\n%\\n\\n% rule/1 is the default\\nrun_ca(S) =>\\n run_ca(S,rule).\\nrun_ca(S,Rules) =>\\n Len = S.length,\\n All := [S],\\n Seen = new_map(), % detect fixpoint and cycle\\n while (not Seen.has_key(S))\\n Seen.put(S,1),\\n T = [S[1]] ++ [apply(Rules, slice(S,I-1,I+1)) : I in 2..Len-1] ++ [S[Len]],\\n All := All ++ [T],\\n S := T\\n end,\\n foreach(A in All) println(A.convert()) end,\\n writeln(len=All.length).\\n\\n% Convert:\\n% 0->\\\"_\\\"\\n% 1->\\\"#\\\"\\nconvert(L) = Res =>\\n B = \\\"_#\\\",\\n Res = [B[L[I]+1] : I in 1..L.length].\\n\\n% the rules\\nrule([0,0,0]) = 0. %\\nrule([0,0,1]) = 0. %\\nrule([0,1,0]) = 0. % Dies without enough neighbours\\nrule([0,1,1]) = 1. % Needs one neighbour to survive\\nrule([1,0,0]) = 0. %\\nrule([1,0,1]) = 1. % Two neighbours giving birth\\nrule([1,1,0]) = 1. % Needs one neighbour to survive\\nrule([1,1,1]) = 0. % Starved to death.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"go2 =>\\n N = 4,\\n Ns = [0 : _ in 1..N],\\n S = Ns ++ [1] ++ Ns,\\n run_ca(S, rule30).\\n\\n% The rules for rule 30\\nrule30([0,0,0]) = 0.\\nrule30([0,0,1]) = 1.\\nrule30([0,1,0]) = 1.\\nrule30([0,1,1]) = 1.\\nrule30([1,0,0]) = 1.\\nrule30([1,0,1]) = 0.\\nrule30([1,1,0]) = 0.\\nrule30([1,1,1]) = 0.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(let Cells (chop \\\"_###_##_#_#_#_#__#__\\\")\\n (do 10\\n (prinl Cells)\\n (setq Cells\\n (make\\n (link \\\"_\\\")\\n (map\\n '((L)\\n (case (head 3 L)\\n (`(mapcar chop '(\\\"___\\\" \\\"__#\\\" \\\"_#_\\\" \\\"#__\\\" \\\"###\\\"))\\n (link \\\"_\\\") )\\n (`(mapcar chop '(\\\"_##\\\" \\\"#_#\\\" \\\"##_\\\"))\\n (link \\\"#\\\") ) ) )\\n Cells )\\n (link \\\"_\\\") ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"one_dimensional_cellular_automata(L) :-\\n\\tmaplist(my_write, L), nl,\\n\\tlength(L, N),\\n\\tlength(LN, N),\\n\\t% there is a 0 before the beginning\\n\\tcompute_next([0 |L], LN),\\n\\t( L \\\\= LN -> one_dimensional_cellular_automata(LN); true).\\n\\n% All the possibilites\\ncompute_next([0, 0, 0 | R], [0 | R1]) :-\\n\\tcompute_next([0, 0 | R], R1).\\n\\ncompute_next([0, 0, 1 | R], [0 | R1]) :-\\n\\tcompute_next([0, 1 | R], R1).\\n\\ncompute_next([0, 1, 0 | R], [0 | R1]) :-\\n\\tcompute_next([1, 0 | R], R1).\\n\\ncompute_next([0, 1, 1 | R], [1 | R1]) :-\\n\\tcompute_next([1, 1 | R], R1).\\n\\ncompute_next([1, 0, 0 | R], [0 | R1]) :-\\n\\tcompute_next([0, 0 | R], R1).\\n\\ncompute_next([1, 0, 1 | R], [1 | R1]) :-\\n\\tcompute_next([0, 1 | R], R1).\\n\\ncompute_next([1, 1, 0 | R], [1 | R1]) :-\\n\\tcompute_next([1, 0 | R], R1).\\n\\ncompute_next([1, 1, 1 | R], [0 | R1]) :-\\n\\tcompute_next([1, 1 | R], R1).\\n\\n% the last four possibilies =>\\n% we consider that there is à 0 after the end\\ncomplang jq># The 1-d cellular automaton:\\ndef next:\\n # Conveniently, jq treats null as 0 when it comes to addition\\n # so there is no need to fiddle with the boundaries\\n . as $old\\n | reduce range(0; length) as $i\\n ([];\\n ($old[$i-1] + $old[$i+1]) as $s\\n | if $s == 0 then .[$i] = 0\\n elif $s == 1 then .[$i] = (if $old[$i] == 1 then 1 else 0 end)\\n else .[$i] = (if $old[$i] == 1 then 0 else 1 end)\\n end);\\n\\n\\n# pretty-print an array:\\ndef pp: reduce .[] as $i (\\\"\\\"; . + (if $i == 0 then \\\" \\\" else \\\"*\\\" end));\\n\\n# continue until quiescence:\\ndef go: recurse(. as $prev | next | if . == $prev then empty else . end) | pp;\\n\\n# Example:\\n[0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0] | goute_next([0, 0], [0]).\\n\\ncompute_next([1, 0], [0]).\\n\\ncompute_next([0, 1], [0]).\\n\\ncompute_next([1, 1], [1]).\\n\\nmy_write(0) :-\\n\\twrite(.).\\n\\nmy_write(1) :-\\n\\twrite(#).\\n\\none_dimensional_cellular_automata :-\\n\\tL = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0],\\n\\tone_dimensional_cellular_automata(L).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"EnableExplicit\\nDim cG.i(21)\\nDim nG.i(21)\\nDefine.i n, Gen\\n\\nDataSection\\n Data.i 0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\nEndDataSection\\nFor n=1 To 20\\n Read.i cG(n)\\nNext\\n\\nOpenConsole()\\nRepeat\\n Print(\\\"Generation \\\"+Str(Gen)+\\\": \\\")\\n For n=1 To 20\\n Print(Chr(95-cG(n)*60))\\n Next\\n Gen +1\\n PrintN(\\\"\\\")\\n For n=1 To 20\\n If (cG(n) And (cG(n-1) XOr cg(n+1))) Or (Not cG(n) And (cG(n-1) And cg(n+1)))\\n nG(n)=1\\n Else\\n nG(n)=0\\n EndIf\\n Next\\n CopyArray(nG(), cG())\\nUntil Gen > 9\\n\\nPrintN(\\\"Press any key to exit\\\"): Repeat: Until Inkey() <> \\\"\\\"\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import random\\n\\nprintdead, printlive = '_#'\\nmaxgenerations = 10\\ncellcount = 20\\noffendvalue = '0'\\n\\nuniverse = ''.join(random.choice('01') for i in range(cellcount))\\n\\nneighbours2newstate = {\\n '000': '0',\\n '001': '0',\\n '010': '0',\\n '011': '1',\\n '100': '0',\\n '101': '1',\\n '110': '1',\\n '111': '0',\\n }\\n\\nfor i in range(maxgenerations):\\n print \\\"Generation %3i: %s\\\" % ( i,\\n universe.replace('0', printdead).replace('1', printlive) )\\n universe = offendvalue + universe + offendvalue\\n universe = ''.join(neighbours2newstate[universe[i:i+3]] for i in range(cellcount))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import random\\n\\nnquads = 5\\nmaxgenerations = 10\\nfmt = '%%0%ix'%nquads\\nnbits = 4*nquads\\na = random.getrandbits(nbits) << 1\\n#a = int('01110110101010100100', 2) << 1\\nendmask = (2<<nbits)-2;\\nendvals = 0<<(nbits+1) | 0\\ntr = ('____', '___#', '__#_', '__##', '_#__', '_#_#', '_##_', '_###',\\n '#___', '#__#', '#_#_', '#_##', '##__', '##_#', '###_', '####' )\\nfor i in range(maxgenerations):\\n print \\\"Generation %3i: %s\\\" % (i,(''.join(tr[int(t,16)] for t in (fmt%(a>>1)))))\\n a |= endvals\\n a = ((a&((a<<1) | (a>>1))) ^ ((a<<1)&(a>>1))) & endmask\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \">>> gen = [ch == '#' for ch in '_###_##_#_#_#_#__#__']\\n>>> for n in range(10):\\n\\tprint(''.join('#' if cell else '_' for cell in gen))\\n\\tgen = [0] + gen + [0]\\n\\tgen = [sum(gen[m:m+3]) == 2 for m in range(len(gen)-2)]\\n\\n\\t\\n_###_##_#_#_#_#__#__\\n_#_#####_#_#_#______\\n__##___##_#_#_______\\n__##___###_#________\\n__##___#_##_________\\n__##____###_________\\n__##____#_#_________\\n__##_____#__________\\n__##________________\\n__##________________\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Cellular Automata'''\\n\\nfrom itertools import islice, repeat\\nfrom functools import reduce\\nfrom random import randint\\n\\n\\n# nextRowByRule :: Int -> [Bool] -> [Bool]\\ndef nextRowByRule(intRule):\\n '''A row of booleans derived by Wolfram rule n\\n from another boolean row of the same length.\\n '''\\n # step :: (Bool, Bool, Bool) -> Bool\\n def step(l, x, r):\\n return bool(intRule & 2**intFromBools([l, x, r]))\\n\\n # go :: [Bool] -> [Bool]\\n def go(xs):\\n return [False] + list(map(\\n step,\\n xs, xs[1:], xs[2:]\\n )) + [False]\\n return go\\n\\n\\n# intFromBools :: [Bool] -> Int\\ndef intFromBools(xs):\\n '''Integer derived by binary interpretation\\n of a list of booleans.\\n '''\\n def go(b, pn):\\n power, n = pn\\n return (2 * power, n + power if b else n)\\n return foldr(go)([1, 0])(xs)[1]\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Samples of Wolfram rule evolutions.\\n '''\\n print(\\n unlines(map(showRuleSample, [104, 30, 110]))\\n )\\n\\n\\n# ----------------------- DISPLAY ------------------------\\n\\n# showRuleSample :: Int -> String\\ndef showRuleSample(intRule):\\n '''16 steps in the evolution\\n of a given Wolfram rule.\\n '''\\n return 'Rule ' + str(intRule) + ':\\\\n' + (\\n unlines(map(\\n showCells,\\n take(16)(\\n iterate(nextRowByRule(intRule))(\\n onePixelInLineOf(64) if (\\n bool(randint(0, 1))\\n ) else randomPixelsInLineOf(64)\\n )\\n )\\n ))\\n )\\n\\n\\n# boolsFromInt :: Int -> [Bool]\\ndef boolsFromInt(n):\\n '''List of booleans derived by binary\\n decomposition of an integer.\\n '''\\n def go(x):\\n return Just((x // 2, bool(x % 2))) if x else Nothing()\\n return unfoldl(go)(n)\\n\\n\\n# nBoolsFromInt :: Int -> Int -> [Bool]\\ndef nBoolsFromInt(n):\\n '''List of bools, left-padded to given length n,\\n derived by binary decomposition of an integer x.\\n '''\\n def go(n, x):\\n bs = boolsFromInt(x)\\n return list(repeat(False, n - len(bs))) + bs\\n return lambda x: go(n, x)\\n\\n\\n# onePixelInLineOf :: Int -> [Bool]\\ndef onePixelInLineOf(n):\\n '''A row of n (mainly False) booleans,\\n with a single True value in the middle.\\n '''\\n return nBoolsFromInt(n)(\\n 2**(n // 2)\\n )\\n\\n\\n# randomPixelsInLineOf :: Int -> [Bool]\\ndef randomPixelsInLineOf(n):\\n '''A row of n booleans with pseudorandom values.\\n '''\\n return [bool(randint(0, 1)) for _ in range(1, 1 + n)]\\n\\n\\n# showCells :: [Bool] -> String\\ndef showCells(xs):\\n '''A block string representation of a list of booleans.\\n '''\\n return ''.join([chr(9608) if x else ' ' for x in xs])\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# Just :: 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 :: () -> 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# foldr :: (a -> b -> b) -> b -> [a] -> b\\ndef foldr(f):\\n '''Right to left reduction of a list,\\n using the binary operator f, and\\n starting with an initial accumulator value.\\n '''\\n def g(a, x):\\n return f(x, a)\\n return lambda acc: lambda xs: reduce(\\n g, xs[::-1], acc\\n )\\n\\n\\n# iterate :: (a -> a) -> a -> Gen [a]\\ndef iterate(f):\\n '''An infinite list of repeated\\n applications of f to x.\\n '''\\n def go(x):\\n v = x\\n while True:\\n yield v\\n v = f(v)\\n return go\\n\\n\\n# take :: Int -> [a] -> [a]\\n# take :: Int -> String -> String\\ndef take(n):\\n '''The prefix of xs of length n,\\n or xs itself if n > length xs.\\n '''\\n def go(xs):\\n return (\\n xs[0:n]\\n if isinstance(xs, (list, tuple))\\n else list(islice(xs, n))\\n )\\n return go\\n\\n\\n# unfoldl :: (b -> Maybe (b, a)) -> b -> [a]\\ndef unfoldl(f):\\n '''Dual to reduce or foldl.\\n Where these reduce a list to a summary value, unfoldl\\n builds a list from a seed value.\\n Where f returns Just(a, b), a is appended 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 x, r = v, v\\n xs = []\\n while True:\\n mb = f(x)\\n if mb.get('Nothing'):\\n return xs\\n else:\\n x, r = mb.get('Just')\\n xs.insert(0, r)\\n return xs\\n return go\\n\\n\\n# unlines :: [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\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DECLARE FUNCTION life$ (lastGen$)\\nDECLARE FUNCTION getNeighbors! (group$)\\nCLS\\nstart$ = \\\"_###_##_#_#_#_#__#__\\\"\\nnumGens = 10\\nFOR i = 0 TO numGens - 1\\n\\tPRINT \\\"Generation\\\"; i; \\\": \\\"; start$\\n\\tstart$ = life$(start$)\\nNEXT i\\n\\nFUNCTION getNeighbors (group$)\\n\\t\\tans = 0\\n\\t\\tIF (MID$(group$, 1, 1) = \\\"#\\\") THEN ans = ans + 1\\n\\t\\tIF (MID$(group$, 3, 1) = \\\"#\\\") THEN ans = ans + 1\\n\\t\\tgetNeighbors = ans\\nEND FUNCTION\\n\\nFUNCTION life$ (lastGen$)\\n\\t\\tnewGen$ = \\\"\\\"\\n\\t\\tFOR i = 1 TO LEN(lastGen$)\\n\\t\\t\\tneighbors = 0\\n\\t\\t\\tIF (i = 1) THEN 'left edge\\n\\t\\t\\t\\tIF MID$(lastGen$, 2, 1) = \\\"#\\\" THEN\\n\\t\\t\\t\\t\\tneighbors = 1\\n\\t\\t\\t\\tELSE\\n\\t\\t\\t\\t\\tneighbors = 0\\n\\t\\t\\t\\tEND IF\\n\\t\\t\\tELSEIF (i = LEN(lastGen$)) THEN 'right edge\\n\\t\\t\\t\\tIF MID$(lastGen$, LEN(lastGen$) - 1, 1) = \\\"#\\\" THEN\\n\\t\\t\\t\\t\\tneighbors = 1\\n\\t\\t\\t\\tELSE\\n\\t\\t\\t\\t\\tneighbors = 0\\n\\t\\t\\t\\tEND IF\\n\\t\\t\\tELSE 'middle\\n\\t\\t\\t\\tneighbors = getNeighbors(MID$(lastGen$, i - 1, 3))\\n\\t\\t\\tEND IF\\n\\n\\t\\t\\tIF (neighbors = 0) THEN 'dies or stays dead with no neighbors\\n\\t\\t\\t\\tnewGen$ = newGen$ + \\\"_\\\"\\n\\t\\t\\tEND IF\\n\\t\\t\\tIF (neighbors = 1) THEN 'stays with one neighbor\\n\\t\\t\\t\\tnewGen$ = newGen$ + MID$(lastGen$, i, 1)\\n\\t\\t\\tEND IF\\n\\t\\t\\tIF (neighbors = 2) THEN 'flips with two neighbors\\n\\t\\t\\t\\tIF MID$(lastGen$, i, 1) = \\\"#\\\" THEN\\n\\t\\t\\t\\t\\tnewGen$ = newGen$ + \\\"_\\\"\\n\\t\\t\\t\\tELSE\\n\\t\\t\\t\\t\\tnewGen$ = newGen$ + \\\"#\\\"\\n\\t\\t\\t\\tEND IF\\n\\t\\t\\tEND IF\\n\\t\\tNEXT i\\n\\t\\tlife$ = newGen$\\nEND FUNCTION\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ stack 0 ] is cells ( --> s )\\n\\n [ dup size cells replace\\n 0 swap witheach\\n [ char # =\\n | 1 << ] ] is setup ( $ --> n )\\n\\n [ 0 swap\\n cells share times\\n [ dup i >> 7 &\\n [ table 0 0 0 1 0 1 1 0 ]\\n rot 1 << | swap ]\\n drop 1 << ] is nextline ( n --> n )\\n\\n [ cells share times\\n [ dup i 1+ bit &\\n iff [ char # ]\\n else [ char _ ]\\n emit ]\\n cr drop ] is echoline ( n --> )\\n\\n [ setup\\n [ dup echoline\\n dup nextline\\n tuck = until ]\\n echoline ] is automate ( $ --> )\\n\\n $ \\\"_###_##_#_#_#_#__#__\\\" automate\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"set.seed(15797, kind=\\\"Mersenne-Twister\\\")\\n\\nmaxgenerations = 10\\ncellcount = 20\\noffendvalue = FALSE\\n\\n## Cells are alive if TRUE, dead if FALSE\\nuniverse <- c(offendvalue,\\n sample( c(TRUE, FALSE), cellcount, replace=TRUE),\\n offendvalue)\\n\\n## List of patterns in which the cell stays alive\\nstayingAlive <- lapply(list(c(1,1,0),\\n c(1,0,1),\\n c(0,1,0)), as.logical)\\n\\n## x : length 3 logical vector\\n## map: list of length 3 logical vectors that map to patterns\\n## in which x stays alive\\ndeadOrAlive <- function(x, map) list(x) %in% map\\n\\ncellularAutomata <- function(x, map) {\\n c(x[1], apply(embed(x, 3), 1, deadOrAlive, map=map), x[length(x)])\\n}\\n\\ndeadOrAlive2string <- function(x) {\\n paste(ifelse(x, '#', '_'), collapse=\\\"\\\")\\n}\\n\\nfor (i in 1:maxgenerations) {\\n universe <- cellularAutomata(universe, stayingAlive)\\n cat(format(i, width=3), deadOrAlive2string(universe), \\\"\\\\n\\\")\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (update cells)\\n (for/list ([crowding (map +\\n (append '(0) (drop-right cells 1))\\n cells\\n (append (drop cells 1) '(0)))])\\n (if (= 2 crowding) 1 0)))\\n\\n(define (life-of cells time)\\n (unless (zero? time)\\n (displayln cells)\\n (life-of (update cells) (sub1 time))))\\n\\n(life-of '(0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0)\\n 10)\\n\\n#| (0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0)\\n (0 1 0 1 1 1 1 1 0 1 0 1 0 1 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0)\\n (0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0) |#\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"#lang slideshow\\n\\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n;; Simulation of cellular automata, as described by Stephen Wolfram in his 1983 paper.\\n;; Uses Racket's inline image display capability for visual presentation\\t\\n;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;\\n\\n(require racket/draw)\\n(require slideshow)\\n\\n(define *rules* '((1 1 1) (1 1 0) (1 0 1) (1 0 0)\\n\\t\\t (0 1 1) (0 1 0) (0 0 1) (0 0 0)))\\n\\n(define (bordered-square n)\\n (filled-rectangle n n #:draw-border? #t))\\n\\n(define (draw-row lst)\\n (apply hc-append 2 (map (λ (x) (colorize (bordered-square 10) (cond ((= x 0) \\\"gray\\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t ((= x 1) \\\"red\\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t (else \\\"gray\\\"))))\\n\\t\\t\\t lst)))\\n\\n(define (extract-neighborhood nth prev-row)\\n (take (drop (append '(0) prev-row '(0)) nth) 3))\\n\\n(define (automaton-to-bits n)\\n (reverse (map (λ (y) (if (zero? (bitwise-and y n)) 0 1))\\n\\t\\t(map (λ (x) (expt 2 x)) (range 0 8)))))\\n\\n(define (get-rules bits)\\n (map cdr (filter (λ (x) (= (car x) 1)) (map cons bits *rules*))))\\n\\n(define (advance-row old-row rules)\\n (let ([new '()])\\n (for ([i (in-range 0 (length old-row))])\\n (set! new (cons (if (member (extract-neighborhood i old-row)\\n\\t\\t\\t\\t rules) 1 0) new)))\\n (reverse new)))\\n\\n(define (draw-automaton automaton init-row row-number)\\n (let* ([bit-representation (automaton-to-bits automaton)]\\n\\t [rules (get-rules bit-representation)]\\n\\t [rows (list init-row)])\\n (for ([i (in-range 1 row-number)])\\n (set! rows (cons (advance-row (car rows) rules)\\n\\t\\t rows)))\\n (apply vc-append 2 (map draw-row (reverse rows)))))\\n\\n(draw-automaton 104 '(0 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0) 10)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"class Automaton {\\n has $.rule;\\n has @.cells;\\n has @.code = $!rule.fmt('%08b').flip.comb».Int;\\n\\n method gist { \\\"|{ @!cells.map({+$_ ?? '#' !! ' '}).join }|\\\" }\\n\\n method succ {\\n self.new: :$!rule, :@!code, :cells(\\n @!code[\\n 4 «*« @!cells.rotate(-1)\\n »+« 2 «*« @!cells\\n »+« @!cells.rotate(1)\\n ]\\n )\\n }\\n}\\n\\n# The rule proposed for this task is rule 0b01101000 = 104\\n\\nmy @padding = 0 xx 5;\\nmy Automaton $a .= new:\\n rule => 104,\\n cells => flat @padding, '111011010101'.comb, @padding\\n;\\nsay $a++ for ^10;\\n\\n\\n# Rule 104 is not particularly interesting so here is [[wp:Rule 90|Rule 90]],\\n# which shows a [[wp:Sierpinski Triangle|Sierpinski Triangle]].\\n\\nsay '';\\n@padding = 0 xx 25;\\n$a = Automaton.new: :rule(90), :cells(flat @padding, 1, @padding);\\n\\nsay $a++ for ^20;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\n Purpose: \\\"One-dimensional cellular automata\\\"\\n Author: \\\"Joe Smith\\\"\\n]\\n\\nvals: [0 1 0]\\nkill: [[0 0] [#[none] 0] [0 #[none]]]\\nevo: function [petri] [\\n\\tnew-petri: copy petri\\n\\twhile [petri/1] [\\n\\t\\tif all [petri/-1 = 1 petri/2 = 1] [new-petri/1: select vals petri/1]\\n\\t\\tif find/only kill reduce [petri/-1 petri/2] [new-petri/1: 0]\\n\\t\\tpetri: next petri new-petri: next new-petri\\n\\t]\\n\\tpetri: head petri new-petri: head new-petri\\n\\tclear insert petri new-petri\\n]\\n\\ndisplay: function [petri] [\\n\\tprint replace/all (replace/all to-string petri \\\"0\\\" \\\"_\\\") \\\"1\\\" \\\"#\\\"\\n\\tpetri\\t\\n]\\n\\nloop 10 [\\n\\tevo display [1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0]\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"# 1D Cellular Automota\\n\\nAssume an array of cells with an initial distribution of live and\\ndead cells, and imaginary cells off the end of the array having\\nfixed values.\\n\\nCells in the next generation of the array are calculated based on\\nthe value of the cell and its left and right nearest neighbors in\\nthe current generation.\\n\\nIf, in the following table, a live cell is represented by 1 and a\\ndead cell by 0 then to generate the value of the cell at a particular\\nindex in the array of cellular values you use the following table:\\n\\n000 -> 0 #\\n001 -> 0 #\\n010 -> 0 # Dies without enough neighbours\\n011 -> 1 # Needs one neighbour to survive\\n100 -> 0 #\\n101 -> 1 # Two neighbours giving birth\\n110 -> 1 # Needs one neighbour to survive\\n111 -> 0 # Starved to death.\\n\\nI had originally written an implementation of this in RETRO 11.\\nFor RETRO 12 I took advantage of new language features and some\\nfurther considerations into the rules for this task.\\n\\nThe first word, `string,` inlines a string to `here`. I'll use\\nthis to setup the initial input.\\n\\n~~~\\n:string, (s-) [ , ] s:for-each #0 , ;\\n~~~\\n\\nThe next two lines setup an initial generation and a buffer for\\nthe evolved generation. In this case, `This` is the current\\ngeneration and `Next` reflects the next step in the evolution.\\n\\n~~~\\n'This d:create\\n '.###.##.#.#.#.#..#.. string,\\n\\n'Next d:create\\n '.................... string,\\n~~~\\n\\nI use `display` to show the current generation.\\n\\n~~~\\n:display (-)\\n &This s:put nl ;\\n~~~\\n\\nAs might be expected, `update` copies the `Next` generation to\\nthe `This` generation, setting things up for the next cycle.\\n\\n~~~\\n:update (-)\\n &Next &This dup s:length copy ;\\n~~~\\n\\nThe word `group` extracts a group of three cells. This data will\\nbe passed to `evolve` for processing.\\n\\n~~~\\n:group (a-nnn)\\n [ fetch ]\\n [ n:inc fetch ]\\n [ n:inc n:inc fetch ] tri ;\\n~~~\\n\\nI use `evolve` to decide how a cell should change, based on its\\ninitial state with relation to its neighbors.\\n\\nIn the prior implementation this part was much more complex as I\\ntallied things up and had separate conditions for each combination.\\nThis time I take advantage of the fact that only cells with two\\nneighbors will be alive in the next generation. So the process is:\\n\\n- take the data from `group`\\n- compare to `$#` (for living cells)\\n- add the flags\\n- if the result is `#-2`, the cell should live\\n- otherwise it'll be dead\\n\\n~~~\\n:evolve (nnn-c)\\n [ $# eq? ] tri@ + +\\n #-2 eq? [ $# ] [ $. ] choose ;\\n~~~\\n\\nFor readability I separated out the next few things. `at` takes an\\nindex and returns the address in `This` starting with the index.\\n\\n~~~\\n:at (n-na)\\n &This over + ;\\n~~~\\n\\nThe `record` word adds the evolved value to a buffer. In this case\\nmy `generation` code will set the buffer to `Next`.\\n\\n~~~\\n:record (c-)\\n buffer:add n:inc ;\\n~~~\\n\\nAnd now to tie it all together. Meet `generation`, the longest bit\\nof code in this sample. It has several bits:\\n\\n- setup a new buffer pointing to `Next`\\n\\n - this also preserves the old buffer\\n\\n- setup a loop for each cell in `This`\\n\\n - initial loop index at -1, to ensure proper dummy state for first cell\\n - get length of `This` generation\\n\\n- perform a loop for each item in the generation, updating `Next` as it goes\\n\\n- copy `Next` to `This` using `update`.\\n\\n~~~\\n:generation (-)\\n [ &Next buffer:set\\n #-1 &This s:length\\n [ at group evolve record ] times drop\\n update\\n ] buffer:preserve ;\\n~~~\\n\\nThe last bit is a helper. It takes a number of generations and displays\\nthe state, then runs a `generation`.\\n\\n~~~\\n:generations (n-)\\n [ display generation ] times ;\\n~~~\\n\\nAnd a text. The output should be:\\n\\n .###.##.#.#.#.#..#..\\n .#.#####.#.#.#......\\n ..##...##.#.#.......\\n ..##...###.#........\\n ..##...#.##.........\\n ..##....###.........\\n ..##....#.#.........\\n ..##.....#..........\\n ..##................\\n ..##................\\n\\n~~~\\n#10 generations\\n~~~\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program generates & displays N generations of one─dimensional cellular automata. */\\nparse arg $ gens . /*obtain optional arguments from the CL*/\\nif $=='' | $==\\\",\\\" then $=001110110101010 /*Not specified? Then use the default.*/\\nif gens=='' | gens==\\\",\\\" then gens=40 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n\\n do #=0 for gens /* process the one-dimensional cells.*/\\n say \\\" generation\\\" right(#,length(gens)) ' ' translate($, \\\"#·\\\", 10)\\n @=0 /* [↓] generation.*/\\n do j=2 for length($) - 1; x=substr($, j-1, 3) /*obtain the cell.*/\\n if x==011 | x==101 | x==110 then @=overlay(1, @, j) /*the cell lives. */\\n else @=overlay(0, @, j) /* \\\" \\\" dies. */\\n end /*j*/\\n\\n if $==@ then do; say right('repeats', 40); leave; end /*does it repeat? */\\n $=@ /*now use the next generation of cells.*/\\n end /*#*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : One-dimensional cellular automata\\n\\nrule = [\\\"0\\\", \\\"0\\\", \\\"0\\\", \\\"1\\\", \\\"0\\\", \\\"1\\\", \\\"1\\\", \\\"0\\\"]\\nnow = \\\"01110110101010100100\\\"\\n\\nfor generation = 0 to 9\\n see \\\"generation \\\" + generation + \\\": \\\" + now + nl\\n nxt = \\\"\\\"\\n for cell = 1 to len(now)\\n str = \\\"bintodec(\\\" + '\\\"' +substr(\\\"0\\\"+now+\\\"0\\\", cell, 3) + '\\\"' + \\\")\\\"\\n eval(\\\"p=\\\" + str)\\n nxt = nxt + rule[p+1]\\n next\\n temp = nxt\\n nxt = now\\n now = temp\\nnext\\n\\nfunc bintodec(bin)\\n binsum = 0\\n for n=1 to len(bin)\\n binsum = binsum + number(bin[n]) *pow(2, len(bin)-n)\\n next\\n return binsum\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def evolve(ary)\\n ([0]+ary+[0]).each_cons(3).map{|a,b,c| a+b+c == 2 ? 1 : 0}\\nend\\n\\ndef printit(ary)\\n puts ary.join.tr(\\\"01\\\",\\\".#\\\")\\nend\\n\\nary = [0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0]\\nprintit ary\\nuntil ary == (new = evolve(ary))\\n printit ary = new\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn get_new_state(windowed: &[bool]) -> bool {\\n match windowed {\\n [false, true, true] | [true, true, false] => true,\\n _ => false\\n }\\n}\\n\\nfn next_gen(cell: &mut [bool]) {\\n let mut v = Vec::with_capacity(cell.len());\\n v.push(cell[0]);\\n for i in cell.windows(3) {\\n v.push(get_new_state(i));\\n }\\n v.push(cell[cell.len() - 1]);\\n cell.copy_from_slice(&v);\\n}\\n\\nfn print_cell(cell: &[bool]) {\\n for v in cell {\\n print!(\\\"{} \\\", if *v {'#'} else {' '});\\n }\\n println!();\\n}\\n\\nfn main() {\\n\\n const MAX_GENERATION: usize = 10;\\n const CELLS_LENGTH: usize = 30;\\n\\n let mut cell: [bool; CELLS_LENGTH] = rand::random();\\n\\n for i in 1..=MAX_GENERATION {\\n print!(\\\"Gen {:2}: \\\", i);\\n print_cell(&cell);\\n next_gen(&mut cell);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def cellularAutomata(s: String) = {\\n def it = Iterator.iterate(s) ( generation =>\\n (\\\"_%s_\\\" format generation).iterator\\n sliding 3\\n map (_ count (_ == '#'))\\n map Map(2 -> \\\"#\\\").withDefaultValue(\\\"_\\\")\\n mkString\\n )\\n\\n (it drop 1) zip it takeWhile Function.tupled(_ != _) map (_._2) foreach println\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (next-generation left petri-dish right)\\n (if (null? petri-dish)\\n (list)\\n (cons (if (= (+ left\\n (car petri-dish)\\n (if (null? (cdr petri-dish))\\n right\\n (cadr petri-dish)))\\n 2)\\n 1\\n 0)\\n (next-generation (car petri-dish) (cdr petri-dish) right))))\\n\\n(define (display-evolution petri-dish generations)\\n (if (not (zero? generations))\\n (begin (display petri-dish)\\n (newline)\\n (display-evolution (next-generation 0 petri-dish 0)\\n (- generations 1)))))\\n\\n(display-evolution (list 1 1 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0) 10)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst string: start is \\\"_###_##_#_#_#_#__#__\\\";\\n\\nconst proc: main is func\\n local\\n var string: g0 is start;\\n var string: g1 is start;\\n var integer: generation is 0;\\n var integer: i is 0;\\n begin\\n writeln(g0);\\n for generation range 0 to 9 do\\n for i range 2 to pred(length(g0)) do\\n if g0[i-1] <> g0[i+1] then\\n g1 @:= [i] g0[i];\\n elsif g0[i] = '_' then\\n g1 @:= [i] g0[i-1];\\n else\\n g1 @:= [i] '_'\\n end if;\\n end for;\\n writeln(g1);\\n g0 := g1;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"import <Utilities/Conversion.sl>;\\n\\nmain(args(2)) :=\\n run(args[1], stringToInt(args[2])) when size(args) = 2\\nelse\\n \\\"Usage error: exec <initialCells> <generations>\\\";\\n\\nstringToCells(string(1))[i] := 0 when string[i] = '_' else 1;\\ncellsToString(cells(1))[i] := '#' when cells[i] = 1 else '_';\\n\\nrun(cellsString(1), generations) :=\\n runHelper(stringToCells(cellsString), generations, cellsString);\\n\\nrunHelper(cells(1), generations, result(1)) :=\\n let\\n nextCells := step(cells);\\n in\\n result when generations = 0\\n else\\n runHelper(nextCells, generations - 1,\\n result ++ \\\"\\\\n\\\" ++ cellsToString(nextCells));\\n\\nstep(cells(1))[i] :=\\n let\\n left := cells[i-1] when i > 1 else 0;\\n right := cells[i + 1] when i < size(cells) else 0;\\n in\\n 1 when (left + cells[i] + right) = 2\\n else\\n 0;\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"var seq = \\\"_###_##_#_#_#_#__#__\\\";\\nvar x = '';\\n\\nloop {\\n seq.tr!('01', '_#');\\n say seq;\\n seq.tr!('_#', '01');\\n seq.gsub!(/(?<=(.))(.)(?=(.))/, {|s1,s2,s3| s1 == s3 ? (s1 ? 1-s2 : 0) : s2});\\n (x != seq) && (x = seq) || break;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"class Automaton(rule, cells) {\\n\\n method init {\\n rule = sprintf(\\\"%08b\\\", rule).chars.map{.to_i}.reverse;\\n }\\n\\n method next {\\n var previous = cells.map{_};\\n var len = previous.len;\\n cells[] = rule[\\n previous.range.map { |i|\\n 4*previous[i-1 % len] +\\n 2*previous[i] +\\n previous[i+1 % len]\\n }...\\n ]\\n }\\n\\n method to_s {\\n cells.map { _ ? '#' : ' ' }.join;\\n }\\n}\\n\\nvar size = 10;\\nvar auto = Automaton(\\n rule: 104,\\n cells: [(size/2).of(0)..., 111011010101.digits..., (size/2).of(0)...],\\n);\\n\\nsize.times {\\n say \\\"|#{auto}|\\\";\\n auto.next;\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" 10 LET N$=\\\"01110110101010100100\\\"\\n 20 LET G=1\\n 30 PRINT N$\\n 40 LET O$=N$\\n 50 LET N$=\\\"\\\"\\n 60 PRINT AT 0,28;G\\n 70 LET N=0\\n 80 FOR I=1 TO LEN O$\\n 90 IF I=1 THEN GOTO 120\\n100 LET N=VAL O$(I-1)\\n110 IF I=LEN O$ THEN GOTO 130\\n120 LET N=N+VAL O$(I+1)\\n130 IF N=0 THEN LET N$=N$+\\\"0\\\"\\n140 IF N=1 THEN LET N$=N$+O$(I)\\n150 IF N=2 THEN LET N$=N$+STR$ NOT VAL O$(I)\\n160 PRINT AT 0,I-1;N$(I)\\n170 NEXT I\\n180 LET G=G+1\\n190 IF N$<>O$ THEN GOTO 40\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"proc evolve {a} {\\n set new [list]\\n for {set i 0} {$i < [llength $a]} {incr i} {\\n lappend new [fate $a $i]\\n }\\n return $new\\n}\\n\\nproc fate {a i} {\\n return [expr {[sum $a $i] == 2}]\\n}\\n\\nproc sum {a i} {\\n set sum 0\\n set start [expr {$i - 1 < 0 ? 0 : $i - 1}]\\n set end [expr {$i + 1 >= [llength $a] ? $i : $i + 1}]\\n for {set j $start} {$j <= $end} {incr j} {\\n incr sum [lindex $a $j]\\n }\\n return $sum\\n}\\n\\nproc print {a} {\\n puts [string map {0 _ 1 #} [join $a \\\"\\\"]]\\n}\\n\\nproc parse {s} {\\n return [split [string map {_ 0 # 1} $s] \\\"\\\"]\\n}\\n\\nset array [parse \\\"_###_##_#_#_#_#__#__\\\"]\\nprint $array\\nwhile {[set new [evolve $array]] ne $array} {\\n set array $new\\n print $array\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\nrule = -$<0,0,0,&,0,&,&,0>@rSS zipp0*ziD iota8\\n\\nstep = rule*+ swin3+ :/0+ --<0>\\n\\nevolve \\\"n\\\" = @iNC ~&x+ rep\\\"n\\\" ^C/step@h ~&\\n\\n#show+\\n\\nexample = ~&?(`#!,`.!)** evolve10 <0,&,&,&,0,&,&,0,&,0,&,0,&,0,0,&,0,0>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"IT(\\\"Gen 0: ..###.##.#.#.#.#..#.....\\\") // initial pattern\\n#9 = Cur_Col\\n\\nfor (#8 = 1; #8 < 10; #8++) { // 10 generations\\n Goto_Col(7)\\n Reg_Empty(20)\\n while (Cur_Col < #9-1) {\\n if (Match(\\\"|{##|!#,#.#,|!###}\\\")==0) {\\n Reg_Set(20, \\\"#\\\", APPEND)\\n } else {\\n Reg_Set(20, \\\".\\\", APPEND)\\n }\\n Char\\n }\\n EOL IN\\n IT(\\\"Gen \\\") Num_Ins(#8, LEFT+NOCR) IT(\\\": \\\")\\n Reg_Ins(20)\\n}\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Gen 0: ..###.##.#.#.#.#..#.....\\nGen 1: ..#.#####.#.#.#.........\\nGen 2: ...##...##.#.#..........\\nGen 3: ...##...###.#...........\\nGen 4: ...##...#.##............\\nGen 5: ...##....###............\\nGen 6: ...##....#.#............\\nGen 7: ...##.....#.............\\nGen 8: ...##...................\\nGen 9: ...##...................\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Imports System.Text\\n\\nModule CellularAutomata\\n\\n Private Enum PetriStatus\\n Active\\n Stable\\n Dead\\n End Enum\\n\\n Function Main(ByVal cmdArgs() As String) As Integer\\n If cmdArgs.Length = 0 Or cmdArgs.Length > 1 Then\\n Console.WriteLine(\\\"Command requires string of either 1s and 0s or #s and _s.\\\")\\n Return 1\\n End If\\n\\n Dim petriDish As BitArray\\n\\n Try\\n petriDish = InitialisePetriDish(cmdArgs(0))\\n Catch ex As Exception\\n Console.WriteLine(ex.Message)\\n Return 1\\n End Try\\n\\n Dim generation As Integer = 0\\n Dim ps As PetriStatus = PetriStatus.Active\\n\\n Do While True\\n If ps = PetriStatus.Stable Then\\n Console.WriteLine(\\\"Sample stable after {0} generations.\\\", generation - 1)\\n Exit Do\\n Else\\n Console.WriteLine(\\\"{0}: {1}\\\", generation.ToString(\\\"D3\\\"), BuildDishString(petriDish))\\n If ps = PetriStatus.Dead Then\\n Console.WriteLine(\\\"Sample dead after {0} generations.\\\", generation)\\n Exit Do\\n End If\\n End If\\n\\n ps = GetNextGeneration(petriDish)\\n generation += 1\\n Loop\\n\\n Return 0\\n End Function\\n\\n Private Function InitialisePetriDish(ByVal Sample As String) As BitArray\\n Dim PetriDish As New BitArray(Sample.Length)\\n Dim dead As Boolean = True\\n\\n For i As Integer = 0 To Sample.Length - 1\\n Select Case Sample.Substring(i, 1)\\n Case \\\"1\\\", \\\"#\\\"\\n PetriDish(i) = True\\n dead = False\\n Case \\\"0\\\", \\\"_\\\"\\n PetriDish(i) = False\\n Case Else\\n Throw New Exception(\\\"Illegal value in string position \\\" & i)\\n Return Nothing\\n End Select\\n Next\\n\\n If dead Then\\n Throw New Exception(\\\"Entered sample is dead.\\\")\\n Return Nothing\\n End If\\n\\n Return PetriDish\\n End Function\\n\\n Private Function GetNextGeneration(ByRef PetriDish As BitArray) As PetriStatus\\n Dim petriCache = New BitArray(PetriDish.Length)\\n Dim neighbours As Integer\\n Dim stable As Boolean = True\\n Dim dead As Boolean = True\\n\\n For i As Integer = 0 To PetriDish.Length - 1\\n neighbours = 0\\n If i > 0 AndAlso PetriDish(i - 1) Then neighbours += 1\\n If i < PetriDish.Length - 1 AndAlso PetriDish(i + 1) Then neighbours += 1\\n\\n petriCache(i) = (PetriDish(i) And neighbours = 1) OrElse (Not PetriDish(i) And neighbours = 2)\\n If PetriDish(i) <> petriCache(i) Then stable = False\\n If petriCache(i) Then dead = False\\n Next\\n\\n PetriDish = petriCache\\n\\n If dead Then Return PetriStatus.Dead\\n If stable Then Return PetriStatus.Stable\\n Return PetriStatus.Active\\n\\n End Function\\n\\n Private Function BuildDishString(ByVal PetriDish As BitArray) As String\\n Dim sw As New StringBuilder()\\n For Each b As Boolean In PetriDish\\n sw.Append(IIf(b, \\\"#\\\", \\\"_\\\"))\\n Next\\n\\n Return sw.ToString()\\n End Function\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"def (gens n l)\\n prn l\\n repeat n\\n zap! gen l\\n prn l\\n\\ndef (gen l)\\n with (a nil b nil c l.0)\\n collect nil # won't insert paren without second token\\n each x cdr.l\\n shift! a b c x\\n yield (next a b c)\\n yield (next b c nil)\\n\\ndef (next a b c) # next state of b given neighbors a and c\\n if (and a c) not.b\\n (or a c) b\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"def (uca l) # new datatype: Uni-dimensional Cellular Automaton\\n (tag uca (list l len.l))\\n\\ndef (len l) :case (isa uca l) # how to compute its length\\n rep.l.1\\n\\ndefcoerce uca list # how to convert it to a list\\n (fn(_) rep._.0)\\n\\ndef (pr l) :case (isa uca l) # how to print it\\n each x l # transparently coerces to a list for iterating over\\n pr (if x \\\"#\\\" \\\"_\\\")\\n\\n# (l i) returns ith cell when l is a uca, and nil when i is out-of-bounds\\ndefcall uca (l i)\\n if (0 <= i < len.l)\\n rep.l.0.i\\n\\ndef (gens n l)\\n prn l\\n repeat n\\n zap! gen l\\n prn l\\n\\ndef (gen l)\\n uca+collect+for i 0 (i < len.l) ++i\\n yield (next (l i-1) l.i (l i+1))\\n\\n# next state of b, given neighbors a and c\\ndef (next a b c)\\n if (and a c) not.b\\n (or a c) b\\n\",\n \"language\": \"Wart\"\n },\n {\n \"code\": \"var trans = \\\"___#_##_\\\"\\n\\nvar v = Fn.new { |cell, i| (cell[i] != \\\"_\\\") ? 1 : 0 }\\n\\nvar evolve = Fn.new { |cell, backup|\\n var len = cell.count - 2\\n var diff = 0\\n for (i in 1...len) {\\n /* use left, self, right as binary number bits for table index */\\n backup[i] = trans[v.call(cell, i - 1) * 4 + v.call(cell, i) * 2 + v.call(cell, i + 1)]\\n diff = diff + ((backup[i] != cell[i]) ? 1 : 0)\\n }\\n cell.clear()\\n cell.addAll(backup)\\n return diff != 0\\n}\\n\\nvar c = \\\"_###_##_#_#_#_#__#__\\\".toList\\nvar b = \\\"____________________\\\".toList\\nwhile(true) {\\n System.print(c[1..-1].join())\\n if (!evolve.call(c,b)) break\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"code ChOut=8, CrLf=9;\\nint Gen, Now, New, I;\\n[Now:= $076A_A400;\\nfor Gen:= 1 to 10 do\\n [for I:= 31 downto 0 do ChOut(0, if Now & 1<<I then ^# else ^_);\\n CrLf(0);\\n New:= 0;\\n for I:= 30 downto 1 do\\n case Now>>(I-1) & 7 of %011, %101, %110: New:= New ! 1<<I other;\\n Now:= New;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"10 n=10:READ w:DIM x(w+1),x2(w+1):FOR i=1 to w:READ x(i):NEXT\\n20 FOR k=1 TO n\\n30 FOR j=1 TO w\\n40 IF x(j) THEN PRINT \\\"#\\\"; ELSE PRINT \\\"_\\\"; END IF\\n50 IF x(j-1)+x(j)+x(j+1)=2 THEN x2(j)=1 ELSE x2(j)=0 END IF\\n60 NEXT:PRINT\\n70 FOR j=1 TO w:x(j)=x2(j):NEXT\\n80 NEXT\\n90 DATA 20,0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"start$ = \\\"0,1,1,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,0\\\"\\n\\ndim x$(1)\\n\\nfor k = 1 to 10\\n n = token(start$, x$(), \\\",\\\")\\n redim x$(n+1)\\n start$ = \\\"\\\"\\n for j = 1 to n\\n if val(x$(j)) then print \\\"#\\\"; else print \\\"_\\\"; end if\\n test = abs(val(x$(j-1)) + val(x$(j)) + val(x$(j+1)) = 2)\\n start$ = start$ + str$(test) + \\\",\\\"\\n next j\\n print\\nnext k\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"fcn life1D(line){\\n right:=line[1,*] + False; // shift left, False fill\\n left :=T(False).extend(line[0,-1]); // shift right\\n left.zip(line,right).apply(fcn(hood){ hood.sum(0)==2 });\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"chars:=T(\\\"_\\\",\\\"#\\\");\\ncells:=\\\"_###_##_#_#_#_#__#__\\\".split(\\\"\\\").apply('==(\\\"#\\\")); //-->L(False,True,True,True,False...)\\ndo(10){ cells.apply(chars.get).concat().println(); cells=life1D(cells); }\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn life1D(line){\\n right:=line[1,*] + \\\"_\\\"; // shift left, \\\"_\\\" fill\\n left :=\\\"_\\\" + line[0,-1]; // shift right\\n Utils.Helpers.zipWith(\\n fcn(a,b,c){ (String(a,b,c) - \\\"_\\\") == \\\"##\\\" and \\\"#\\\" or \\\"_\\\" },\\n left,line,right).concat();\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"cells:=\\\"_###_##_#_#_#_#__#__\\\";\\ndo(10){ cells.println(); cells=life1D(cells); }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"One-dimensional-cellular-automata"}}},{"rowIdx":1463,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Encryption\n- File_handling\nfrom: http://rosettacode.org/wiki/One-time_pad\n","language":"00-META"},{"code":"Implement a [[wp:One-time pad|One-time pad]], for encrypting and decrypting messages.<br>\nTo keep it simple, we will be using letters only.\n\n;Sub-Tasks:\n* '''Generate''' the data for a One-time pad (user needs to specify a filename and length)\n: The important part is to get \"true random\" numbers, e.g. from /dev/random\n* '''encryption / decryption''' ( basically the same operation, much like [[Rot-13]] )\n: For this step, much of [[Vigenère cipher]] could be reused,<br>with the key to be read from the file containing the One-time pad.\n* optional: '''management''' of One-time pads: list, mark as used, delete, etc.\n: Somehow, the users needs to keep track which pad to use for which partner.\n\nTo support the management of pad-files:\n* Such files have a file-extension \".1tp\"\n* Lines starting with \"#\" may contain arbitary meta-data (i.e. comments)\n* Lines starting with \"-\" count as \"used\"\n* Whitespace within the otp-data is ignored\n<!-- \nmaybe support for 1tp-files on readonly-media,\ni.e. an indexfile that stores which parts have been used\n-->\n\n\nFor example, here is the data from [http://upload.wikimedia.org/wikipedia/commons/6/60/One-time_pad.svg Wikipedia]:\n<pre>\n# Example data - Wikipedia - 2014-11-13\n-ZDXWWW EJKAWO FECIFE WSNZIP PXPKIY URMZHI JZTLBC YLGDYJ \n-HTSVTV RRYYEG EXNCGA GGQVRF FHZCIB EWLGGR BZXQDQ DGGIAK \n YHJYEQ TDLCQT HZBSIZ IRZDYS RBYJFZ AIRCWI UCVXTW YKPQMK \n CKHVEX VXYVCS WOGAAZ OUVVON GCNEVR LMBLYB SBDCDC PCGVJX \n QXAUIP PXZQIJ JIUWYH COVWMJ UZOJHL DWHPER UBSRUJ HGAAPR \n CRWVHI FRNTQW AJVWRT ACAKRD OZKIIB VIQGBK IJCWHF GTTSSE \n EXFIPJ KICASQ IOUQTP ZSGXGH YTYCTI BAZSTN JKMFXI RERYWE \n</pre>\n<br><br>\n;See also\n* [https://breakingcode.wordpress.com/2010/02/17/one-time-pad-encryption-in-python/ one time pad encryption in Python]\n* [https://github.com/snapfractalpop/1tp snapfractalpop] - One-Time-Pad Command-Line-Utility (C).\n* [http://search.cpan.org/~sifukurt/Crypt-OTP-2.00/OTP.pm Crypt-OTP-2.00] on CPAN (Perl)\n<br><br>\n\n","language":"00-TASK"},{"code":"package main\n\nimport (\n \"bufio\"\n \"crypto/rand\"\n \"fmt\"\n \"io/ioutil\"\n \"log\"\n \"math/big\"\n \"os\"\n \"strconv\"\n \"strings\"\n \"unicode\"\n)\n\nconst (\n charsPerLine = 48\n chunkSize = 6\n cols = 8\n demo = true // would normally be set to false\n)\n\ntype fileType int\n\nconst (\n otp fileType = iota\n enc\n dec\n)\n\nvar scnr = bufio.NewScanner(os.Stdin)\n\nfunc check(err error) {\n if err != nil {\n log.Fatal(err)\n }\n}\n\nfunc toAlpha(s string) string {\n var filtered []rune\n for _, r := range s {\n if unicode.IsUpper(r) {\n filtered = append(filtered, r)\n }\n }\n return string(filtered)\n}\n\nfunc isOtpRelated(s string) bool {\n return strings.HasSuffix(s, \".1tp\") || strings.HasSuffix(s, \"1tp_cpy\") ||\n strings.HasSuffix(s, \".1tp_enc\") || strings.HasSuffix(s, \"1tp_dec\")\n}\n\nfunc makePad(nLines int) string {\n nChars := nLines * charsPerLine\n bytes := make([]byte, nChars)\n /* generate random upper case letters */\n max := big.NewInt(26)\n for i := 0; i < nChars; i++ {\n n, err := rand.Int(rand.Reader, max)\n check(err)\n bytes[i] = byte(65 + n.Uint64())\n }\n return inChunks(string(bytes), nLines, otp)\n}\n\nfunc vigenere(text, key string, encrypt bool) string {\n bytes := make([]byte, len(text))\n var ci byte\n for i, c := range text {\n if encrypt {\n ci = (byte(c) + key[i] - 130) % 26\n } else {\n ci = (byte(c) + 26 - key[i]) % 26\n }\n bytes[i] = ci + 65\n }\n temp := len(bytes) % charsPerLine\n if temp > 0 { // pad with random characters so each line is a full one\n max := big.NewInt(26)\n for i := temp; i < charsPerLine; i++ {\n n, err := rand.Int(rand.Reader, max)\n check(err)\n bytes = append(bytes, byte(65+n.Uint64()))\n }\n }\n ft := enc\n if !encrypt {\n ft = dec\n }\n return inChunks(string(bytes), len(bytes)/charsPerLine, ft)\n}\n\nfunc inChunks(s string, nLines int, ft fileType) string {\n nChunks := len(s) / chunkSize\n remainder := len(s) % chunkSize\n chunks := make([]string, nChunks)\n for i := 0; i < nChunks; i++ {\n chunks[i] = s[i*chunkSize : (i+1)*chunkSize]\n }\n if remainder > 0 {\n chunks = append(chunks, s[nChunks*chunkSize:])\n }\n var sb strings.Builder\n for i := 0; i < nLines; i++ {\n j := i * cols\n sb.WriteString(\" \" + strings.Join(chunks[j:j+cols], \" \") + \"\\n\")\n }\n ss := \" file\\n\" + sb.String()\n switch ft {\n case otp:\n return \"# OTP\" + ss\n case enc:\n return \"# Encrypted\" + ss\n default: // case dec:\n return \"# Decrypted\" + ss\n }\n}\n\nfunc menu() int {\n fmt.Println(`\n1. Create one time pad file.\n\n2. Delete one time pad file.\n\n3. List one time pad files.\n\n4. Encrypt plain text.\n\n5. Decrypt cipher text.\n\n6. Quit program.\n`)\n choice := 0\n for choice < 1 || choice > 6 {\n fmt.Print(\"Your choice (1 to 6) : \")\n scnr.Scan()\n choice, _ = strconv.Atoi(scnr.Text())\n check(scnr.Err())\n }\n return choice\n}\n\nfunc main() {\n for {\n choice := menu()\n fmt.Println()\n switch choice {\n case 1: // Create OTP\n fmt.Println(\"Note that encrypted lines always contain 48 characters.\\n\")\n fmt.Print(\"OTP file name to create (without extension) : \")\n scnr.Scan()\n fileName := scnr.Text() + \".1tp\"\n nLines := 0\n for nLines < 1 || nLines > 1000 {\n fmt.Print(\"Number of lines in OTP (max 1000) : \")\n scnr.Scan()\n nLines, _ = strconv.Atoi(scnr.Text())\n }\n check(scnr.Err())\n key := makePad(nLines)\n file, err := os.Create(fileName)\n check(err)\n _, err = file.WriteString(key)\n check(err)\n file.Close()\n fmt.Printf(\"\\n'%s' has been created in the current directory.\\n\", fileName)\n if demo {\n // a copy of the OTP file would normally be on a different machine\n fileName2 := fileName + \"_cpy\" // copy for decryption\n file, err := os.Create(fileName2)\n check(err)\n _, err = file.WriteString(key)\n check(err)\n file.Close()\n fmt.Printf(\"'%s' has been created in the current directory.\\n\", fileName2)\n fmt.Println(\"\\nThe contents of these files are :\\n\")\n fmt.Println(key)\n }\n case 2: // Delete OTP\n fmt.Println(\"Note that this will also delete ALL associated files.\\n\")\n fmt.Print(\"OTP file name to delete (without extension) : \")\n scnr.Scan()\n toDelete1 := scnr.Text() + \".1tp\"\n check(scnr.Err())\n toDelete2 := toDelete1 + \"_cpy\"\n toDelete3 := toDelete1 + \"_enc\"\n toDelete4 := toDelete1 + \"_dec\"\n allToDelete := []string{toDelete1, toDelete2, toDelete3, toDelete4}\n deleted := 0\n fmt.Println()\n for _, name := range allToDelete {\n if _, err := os.Stat(name); !os.IsNotExist(err) {\n err = os.Remove(name)\n check(err)\n deleted++\n fmt.Printf(\"'%s' has been deleted from the current directory.\\n\", name)\n }\n }\n if deleted == 0 {\n fmt.Println(\"There are no files to delete.\")\n }\n case 3: // List OTPs\n fmt.Println(\"The OTP (and related) files in the current directory are:\\n\")\n files, err := ioutil.ReadDir(\".\") // already sorted by file name\n check(err)\n for _, fi := range files {\n name := fi.Name()\n if !fi.IsDir() && isOtpRelated(name) {\n fmt.Println(name)\n }\n }\n case 4: // Encrypt\n fmt.Print(\"OTP file name to use (without extension) : \")\n scnr.Scan()\n keyFile := scnr.Text() + \".1tp\"\n if _, err := os.Stat(keyFile); !os.IsNotExist(err) {\n file, err := os.Open(keyFile)\n check(err)\n bytes, err := ioutil.ReadAll(file)\n check(err)\n file.Close()\n lines := strings.Split(string(bytes), \"\\n\")\n le := len(lines)\n first := le\n for i := 0; i < le; i++ {\n if strings.HasPrefix(lines[i], \" \") {\n first = i\n break\n }\n }\n if first == le {\n fmt.Println(\"\\nThat file has no unused lines.\")\n continue\n }\n lines2 := lines[first:] // get rid of comments and used lines\n\n fmt.Println(\"Text to encrypt :-\\n\")\n scnr.Scan()\n text := toAlpha(strings.ToUpper(scnr.Text()))\n check(scnr.Err())\n tl := len(text)\n nLines := tl / charsPerLine\n if tl%charsPerLine > 0 {\n nLines++\n }\n if len(lines2) >= nLines {\n key := toAlpha(strings.Join(lines2[0:nLines], \"\"))\n encrypted := vigenere(text, key, true)\n encFile := keyFile + \"_enc\"\n file2, err := os.Create(encFile)\n check(err)\n _, err = file2.WriteString(encrypted)\n check(err)\n file2.Close()\n fmt.Printf(\"\\n'%s' has been created in the current directory.\\n\", encFile)\n for i := first; i < first+nLines; i++ {\n lines[i] = \"-\" + lines[i][1:]\n }\n file3, err := os.Create(keyFile)\n check(err)\n _, err = file3.WriteString(strings.Join(lines, \"\\n\"))\n check(err)\n file3.Close()\n if demo {\n fmt.Println(\"\\nThe contents of the encrypted file are :\\n\")\n fmt.Println(encrypted)\n }\n } else {\n fmt.Println(\"Not enough lines left in that file to do encryption.\")\n }\n } else {\n fmt.Println(\"\\nThat file does not exist.\")\n }\n case 5: // Decrypt\n fmt.Print(\"OTP file name to use (without extension) : \")\n scnr.Scan()\n keyFile := scnr.Text() + \".1tp_cpy\"\n check(scnr.Err())\n if _, err := os.Stat(keyFile); !os.IsNotExist(err) {\n file, err := os.Open(keyFile)\n check(err)\n bytes, err := ioutil.ReadAll(file)\n check(err)\n file.Close()\n keyLines := strings.Split(string(bytes), \"\\n\")\n le := len(keyLines)\n first := le\n for i := 0; i < le; i++ {\n if strings.HasPrefix(keyLines[i], \" \") {\n first = i\n break\n }\n }\n if first == le {\n fmt.Println(\"\\nThat file has no unused lines.\")\n continue\n }\n keyLines2 := keyLines[first:] // get rid of comments and used lines\n\n encFile := keyFile[0:len(keyFile)-3] + \"enc\"\n if _, err := os.Stat(encFile); !os.IsNotExist(err) {\n file2, err := os.Open(encFile)\n check(err)\n bytes, err := ioutil.ReadAll(file2)\n check(err)\n file2.Close()\n encLines := strings.Split(string(bytes), \"\\n\")[1:] // exclude comment line\n nLines := len(encLines)\n if len(keyLines2) >= nLines {\n encrypted := toAlpha(strings.Join(encLines, \"\"))\n key := toAlpha(strings.Join(keyLines2[0:nLines], \"\"))\n decrypted := vigenere(encrypted, key, false)\n decFile := keyFile[0:len(keyFile)-3] + \"dec\"\n file3, err := os.Create(decFile)\n check(err)\n _, err = file3.WriteString(decrypted)\n check(err)\n file3.Close()\n fmt.Printf(\"\\n'%s' has been created in the current directory.\\n\", decFile)\n for i := first; i < first+nLines; i++ {\n keyLines[i] = \"-\" + keyLines[i][1:]\n }\n file4, err := os.Create(keyFile)\n check(err)\n _, err = file4.WriteString(strings.Join(keyLines, \"\\n\"))\n check(err)\n file4.Close()\n if demo {\n fmt.Println(\"\\nThe contents of the decrypted file are :\\n\")\n fmt.Println(decrypted)\n }\n }\n } else {\n fmt.Println(\"Not enough lines left in that file to do decryption.\")\n }\n } else {\n fmt.Println(\"\\nThat file does not exist.\")\n }\n case 6: // Quit program\n return\n }\n }\n}\n","language":"Go"},{"code":"-- To compile into an executable:\n-- ghc -main-is OneTimePad OneTimePad.hs\n-- To run:\n-- ./OneTimePad --help\n\nmodule OneTimePad (main) where\n\nimport Control.Monad\nimport Data.Char\nimport Data.Function (on)\nimport qualified Data.Text as T\nimport qualified Data.Text.IO as TI\nimport Data.Time\nimport System.Console.GetOpt\nimport System.Environment\nimport System.Exit\nimport System.IO\n\n-- Command-line options parsing\ndata Options = Options { optCommand :: String\n , optInput :: IO T.Text\n , optOutput :: T.Text -> IO ()\n , optPad :: (IO T.Text, T.Text -> IO ())\n , optLines :: Int\n }\n\nstartOptions :: Options\nstartOptions = Options { optCommand = \"decrypt\"\n , optInput = TI.getContents\n , optOutput = TI.putStr\n , optPad = (TI.getContents, TI.putStr)\n , optLines = 0\n }\n\noptions :: [ OptDescr (Options -> IO Options) ]\noptions =\n [ Option \"e\" [\"encrypt\"]\n (NoArg\n (\\opt -> return opt { optCommand = \"encrypt\" }))\n \"Encrypt file\"\n , Option \"d\" [\"decrypt\"]\n (NoArg\n (\\opt -> return opt { optCommand = \"decrypt\" }))\n \"Decrypt file (default)\"\n , Option \"g\" [\"generate\"]\n (NoArg\n (\\opt -> return opt { optCommand = \"generate\" }))\n \"Generate a one-time pad\"\n , Option \"i\" [\"input\"]\n (ReqArg\n (\\arg opt -> return opt { optInput = TI.readFile arg })\n \"FILE\")\n \"Input file (for decryption and encryption)\"\n , Option \"o\" [\"output\"]\n (ReqArg\n (\\arg opt -> return opt { optOutput = TI.writeFile arg })\n \"FILE\")\n \"Output file (for generation, decryption, and encryption)\"\n , Option \"p\" [\"pad\"]\n (ReqArg\n (\\arg opt -> return opt { optPad = (TI.readFile arg,\n TI.writeFile arg) })\n \"FILE\")\n \"One-time pad to use (for decryption and encryption)\"\n , Option \"l\" [\"lines\"]\n (ReqArg\n (\\arg opt -> return opt { optLines = read arg :: Int })\n \"LINES\")\n \"New one-time pad's length (in lines of 48 characters) (for generation)\"\n , Option \"V\" [\"version\"]\n (NoArg\n (\\_ -> do\n hPutStrLn stderr \"Version 0.01\"\n exitWith ExitSuccess))\n \"Print version\"\n , Option \"h\" [\"help\"]\n (NoArg\n (\\_ -> do\n prg <- getProgName\n putStrLn \"usage: OneTimePad [-h] [-V] [--lines LINES] [-i FILE] [-o FILE] [-p FILE] [--encrypt | --decrypt | --generate]\"\n hPutStrLn stderr (usageInfo prg options)\n exitWith ExitSuccess))\n \"Show this help message and exit\"\n ]\n\nmain :: IO ()\nmain = do\n args <- getArgs\n let (actions, nonOptions, errors) = getOpt RequireOrder options args\n opts <- Prelude.foldl (>>=) (return startOptions) actions\n let Options { optCommand = command\n , optInput = input\n , optOutput = output\n , optPad = (inPad, outPad)\n , optLines = linecnt } = opts\n\n case command of\n \"generate\" -> generate linecnt output\n \"encrypt\" -> do\n inputContents <- clean <$> input\n padContents <- inPad\n output $ format $ encrypt inputContents $ unformat $ T.concat\n $ dropWhile (\\t -> T.head t == '-' || T.head t == '#')\n $ T.lines padContents\n \"decrypt\" -> do\n inputContents <- unformat <$> input\n padContents <- inPad\n output $ decrypt inputContents $ unformat $ T.concat\n $ dropWhile (\\t -> T.head t == '-' || T.head t == '#')\n $ T.lines padContents\n let discardLines = ceiling\n $ ((/) `on` fromIntegral) (T.length inputContents) 48\n outPad $ discard discardLines $ T.lines padContents\n\n{- | Discard used pad lines. Is only called at decryption to enable using the\nsame pad file for both encryption and decryption.\n-}\ndiscard :: Int -> [T.Text] -> T.Text\ndiscard 0 ts = T.unlines ts\ndiscard x (t:ts) = if (T.head t == '-' || T.head t == '#')\n then T.unlines [t, (discard x ts)]\n else T.unlines [(T.append (T.pack \"- \") t), (discard (x-1) ts)]\n\n{- | Clean the text from symbols that cannot be encrypted.\n-}\nclean :: T.Text -> T.Text\nclean = T.map toUpper . T.filter (\\c -> let oc = ord c\n in oc >= 65 && oc <= 122\n && (not $ oc >=91 && oc <= 96))\n\n{- | Format text (usually encrypted text) for pretty-printing it in a similar\nway to the example from Wikipedia (see Rosetta Code page for this task)\n-}\nformat :: T.Text -> T.Text\nformat = T.unlines . map (T.intercalate (T.pack \" \") . T.chunksOf 6)\n . T.chunksOf 48\n\n{- | Unformat encrypted text, getting rid of characters that are irrelevant for\ndecryption.\n-}\nunformat :: T.Text -> T.Text\nunformat = T.filter (\\c -> c/='\\n' && c/=' ')\n\n{- | Generate a one-time pad and write it to file (specified as second\nparameter). Note: this only works on operating systems that have the\n\"/dev/random\" file.\n-}\ngenerate :: Int -> (T.Text -> IO ()) -> IO ()\ngenerate lines output = do\n withBinaryFile \"/dev/random\" ReadMode\n (\\handle -> do\n contents <- replicateM (48 * lines) $ hGetChar handle\n time <- getCurrentTime\n output\n $ T.unlines [ T.pack\n $ \"# OTP pad, generated by https://github.com/kssytsrk/one-time-pad on \"\n ++ show time\n , format $ T.pack\n $ map (chr . (65 +) . flip mod 26 . ord) contents\n ])\n\n-- Helper function for encryption/decryption.\ncrypt :: (Int -> Int -> Int) -> T.Text -> T.Text -> T.Text\ncrypt f = T.zipWith ((chr .) . f `on` ord)\n\n-- Encrypt first parameter's contents, using the second parameter as a key.\nencrypt :: T.Text -> T.Text -> T.Text\nencrypt = crypt ((((+65) . flip mod 26 . subtract 130) .) . (+))\n\n-- Decrypt first parameter's contents, using the second parameter as a key.\ndecrypt :: T.Text -> T.Text -> T.Text\ndecrypt = crypt ((((+65) . flip mod 26) .) . (-))\n","language":"Haskell"},{"code":"require'convert/misc/vig convert/misc/ascii85'\nrandseq=: {{ 2!:0'dd 2>/dev/null if=/dev/urandom count=1 bs=',\":y }}\ngenpad=: {{ EMPTY [ (randseq y) fwrite x }}\nencrypt=: {{ toascii85 (fread x) 0 vig a. y }}\ndecrypt=: {{ (fread x) 1 vig a. fromascii85 y }}\n","language":"J"},{"code":" 'example' genpad 1000\n 'example' encrypt 'this is a test'\nhc>*>I2nEB,6b#MdE;~>\n\n 'example' decrypt 'hc>*>I2nEB,6b#MdE;~>'\nthis is a test\n","language":"J"},{"code":"import java.io.BufferedReader;\nimport java.io.BufferedWriter;\nimport java.io.FileReader;\nimport java.io.FileWriter;\nimport java.io.IOException;\nimport java.util.Random;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\npublic class OneTimePad {\n\n public static void main(String[] args) {\n String controlName = \"AtomicBlonde\";\n generatePad(controlName, 5, 60, 65, 90);\n String text = \"IT WAS THE BEST OF TIMES IT WAS THE WORST OF TIMES\";\n String encrypted = parse(true, controlName, text.replaceAll(\" \", \"\"));\n String decrypted = parse(false, controlName, encrypted);\n System.out.println(\"Input text = \" + text);\n System.out.println(\"Encrypted text = \" + encrypted);\n System.out.println(\"Decrypted text = \" + decrypted);\n\n controlName = \"AtomicBlondeCaseSensitive\";\n generatePad(controlName, 5, 60, 32, 126);\n text = \"It was the best of times, it was the worst of times.\";\n encrypted = parse(true, controlName, text);\n decrypted = parse(false, controlName, encrypted);\n System.out.println();\n System.out.println(\"Input text = \" + text);\n System.out.println(\"Encrypted text = \" + encrypted);\n System.out.println(\"Decrypted text = \" + decrypted);\n }\n\n private static String parse(boolean encryptText, String controlName, String text) {\n StringBuilder sb = new StringBuilder();\n int minCh = 0;\n int maxCh = 0;\n Pattern minChPattern = Pattern.compile(\"^# MIN_CH = ([\\\\d]+)$\");\n Pattern maxChPattern = Pattern.compile(\"^# MAX_CH = ([\\\\d]+)$\");\n boolean validated = false;\n try (BufferedReader in = new BufferedReader(new FileReader(getFileName(controlName))); ) {\n String inLine = null;\n while ( (inLine = in.readLine()) != null ) {\n Matcher minMatcher = minChPattern.matcher(inLine);\n if ( minMatcher.matches() ) {\n minCh = Integer.parseInt(minMatcher.group(1));\n continue;\n }\n Matcher maxMatcher = maxChPattern.matcher(inLine);\n if ( maxMatcher.matches() ) {\n maxCh = Integer.parseInt(maxMatcher.group(1));\n continue;\n }\n if ( ! validated && minCh > 0 && maxCh > 0 ) {\n validateText(text, minCh, maxCh);\n validated = true;\n }\n // # is comment. - is used key.\n if ( inLine.startsWith(\"#\") || inLine.startsWith(\"-\") ) {\n continue;\n }\n // Have encryption key.\n String key = inLine;\n if ( encryptText ) {\n for ( int i = 0 ; i < text.length(); i++) {\n sb.append((char) (((text.charAt(i) - minCh + key.charAt(i) - minCh) % (maxCh - minCh + 1)) + minCh));\n }\n }\n else {\n for ( int i = 0 ; i < text.length(); i++) {\n int decrypt = text.charAt(i) - key.charAt(i);\n if ( decrypt < 0 ) {\n decrypt += maxCh - minCh + 1;\n }\n decrypt += minCh;\n sb.append((char) decrypt);\n }\n }\n break;\n }\n } catch (IOException e) {\n throw new RuntimeException(e);\n }\n return sb.toString();\n }\n\n private static void validateText(String text, int minCh, int maxCh) {\n // Validate text is in range\n for ( char ch : text.toCharArray() ) {\n if ( ch != ' ' && (ch < minCh || ch > maxCh) ) {\n throw new IllegalArgumentException(\"ERROR 103: Invalid text.\");\n }\n }\n\n }\n\n private static String getFileName(String controlName) {\n return controlName + \".1tp\";\n }\n\n private static void generatePad(String controlName, int keys, int keyLength, int minCh, int maxCh) {\n Random random = new Random();\n try ( BufferedWriter writer = new BufferedWriter(new FileWriter(getFileName(controlName), false)); ) {\n writer.write(\"# Lines starting with '#' are ignored.\");\n writer.newLine();\n writer.write(\"# Lines starting with '-' are previously used.\");\n writer.newLine();\n writer.write(\"# MIN_CH = \" + minCh);\n writer.newLine();\n writer.write(\"# MAX_CH = \" + maxCh);\n writer.newLine();\n for ( int line = 0 ; line < keys ; line++ ) {\n StringBuilder sb = new StringBuilder();\n for ( int ch = 0 ; ch < keyLength ; ch++ ) {\n sb.append((char) (random.nextInt(maxCh - minCh + 1) + minCh));\n }\n writer.write(sb.toString());\n writer.newLine();\n }\n writer.write(\"# EOF\");\n writer.newLine();\n } catch (Exception e) {\n throw new RuntimeException(e);\n }\n }\n\n}\n","language":"Java"},{"code":"// version 1.2.31\n\nimport java.io.File\nimport java.security.SecureRandom\n\nconst val CHARS_PER_LINE = 48\nconst val CHUNK_SIZE = 6\nconst val COLS = 8\nconst val DEMO = true // would normally be set to false\n\nenum class FileType { OTP, ENC, DEC }\n\nfun Char.isAlpha() = this in 'A'..'Z'\n\nfun String.toAlpha() = this.filter { it.isAlpha() }\n\nfun String.isOtpRelated() = endsWith(\".1tp\") || endsWith(\".1tp_cpy\") ||\n endsWith(\".1tp_enc\") || endsWith(\".1tp_dec\")\n\nfun makePad(nLines: Int): String {\n val nChars = nLines * CHARS_PER_LINE\n val sr = SecureRandom()\n val sb = StringBuilder(nChars)\n /* generate random upper case letters */\n for (i in 0 until nChars) sb.append((sr.nextInt(26) + 65).toChar())\n return sb.toString().inChunks(nLines, FileType.OTP)\n}\n\nfun vigenere(text: String, key: String, encrypt: Boolean = true): String {\n val sb = StringBuilder(text.length)\n for ((i, c) in text.withIndex()) {\n val ci = if (encrypt)\n (c.toInt() + key[i].toInt() - 130) % 26\n else\n (c.toInt() - key[i].toInt() + 26) % 26\n sb.append((ci + 65).toChar())\n }\n val temp = sb.length % CHARS_PER_LINE\n if (temp > 0) { // pad with random characters so each line is a full one\n val sr = SecureRandom()\n for (i in temp until CHARS_PER_LINE) sb.append((sr.nextInt(26) + 65).toChar())\n }\n val ft = if (encrypt) FileType.ENC else FileType.DEC\n return sb.toString().inChunks(sb.length / CHARS_PER_LINE, ft)\n}\n\nfun String.inChunks(nLines: Int, ft: FileType): String {\n val chunks = this.chunked(CHUNK_SIZE)\n val sb = StringBuilder(this.length + nLines * (COLS + 1))\n for (i in 0 until nLines) {\n val j = i * COLS\n sb.append(\" ${chunks.subList(j, j + COLS).joinToString(\" \")}\\n\")\n }\n val s = \" file\\n\" + sb.toString()\n return when (ft) {\n FileType.OTP -> \"# OTP\" + s\n FileType.ENC -> \"# Encrypted\" + s\n FileType.DEC -> \"# Decrypted\" + s\n }\n}\n\nfun menu(): Int {\n println(\"\"\"\n |\n |1. Create one time pad file.\n |\n |2. Delete one time pad file.\n |\n |3. List one time pad files.\n |\n |4. Encrypt plain text.\n |\n |5. Decrypt cipher text.\n |\n |6. Quit program.\n |\n \"\"\".trimMargin())\n var choice: Int?\n do {\n print(\"Your choice (1 to 6) : \")\n choice = readLine()!!.toIntOrNull()\n }\n while (choice == null || choice !in 1..6)\n return choice\n}\n\nfun main(args: Array<String>) {\n mainLoop@ while (true) {\n val choice = menu()\n println()\n when (choice) {\n 1 -> { // Create OTP\n println(\"Note that encrypted lines always contain 48 characters.\\n\")\n print(\"OTP file name to create (without extension) : \")\n val fileName = readLine()!! + \".1tp\"\n var nLines: Int?\n\n do {\n print(\"Number of lines in OTP (max 1000) : \")\n nLines = readLine()!!.toIntOrNull()\n }\n while (nLines == null || nLines !in 1..1000)\n\n val key = makePad(nLines)\n File(fileName).writeText(key)\n println(\"\\n'$fileName' has been created in the current directory.\")\n if (DEMO) {\n // a copy of the OTP file would normally be on a different machine\n val fileName2 = fileName + \"_cpy\" // copy for decryption\n File(fileName2).writeText(key)\n println(\"'$fileName2' has been created in the current directory.\")\n println(\"\\nThe contents of these files are :\\n\")\n println(key)\n }\n }\n\n 2 -> { // Delete OTP\n println(\"Note that this will also delete ALL associated files.\\n\")\n print(\"OTP file name to delete (without extension) : \")\n val toDelete1 = readLine()!! + \".1tp\"\n val toDelete2 = toDelete1 + \"_cpy\"\n val toDelete3 = toDelete1 + \"_enc\"\n val toDelete4 = toDelete1 + \"_dec\"\n val allToDelete = listOf(toDelete1, toDelete2, toDelete3, toDelete4)\n var deleted = 0\n println()\n for (name in allToDelete) {\n val f = File(name)\n if (f.exists()) {\n f.delete()\n deleted++\n println(\"'$name' has been deleted from the current directory.\")\n }\n }\n if (deleted == 0) println(\"There are no files to delete.\")\n }\n\n 3 -> { // List OTPs\n println(\"The OTP (and related) files in the current directory are:\\n\")\n val otpFiles = File(\".\").listFiles().filter {\n it.isFile() && it.name.isOtpRelated()\n }.map { it.name }.toMutableList()\n otpFiles.sort()\n println(otpFiles.joinToString(\"\\n\"))\n }\n\n 4 -> { // Encrypt\n print(\"OTP file name to use (without extension) : \")\n val keyFile = readLine()!! + \".1tp\"\n val kf = File(keyFile)\n if (kf.exists()) {\n val lines = File(keyFile).readLines().toMutableList()\n var first = lines.size\n for (i in 0 until lines.size) {\n if (lines[i].startsWith(\" \")) {\n first = i\n break\n }\n }\n if (first == lines.size) {\n println(\"\\nThat file has no unused lines.\")\n continue@mainLoop\n }\n val lines2 = lines.drop(first) // get rid of comments and used lines\n\n println(\"Text to encrypt :-\\n\")\n val text = readLine()!!.toUpperCase().toAlpha()\n val len = text.length\n var nLines = len / CHARS_PER_LINE\n if (len % CHARS_PER_LINE > 0) nLines++\n\n if (lines2.size >= nLines) {\n val key = lines2.take(nLines).joinToString(\"\").toAlpha()\n val encrypted = vigenere(text, key)\n val encFile = keyFile + \"_enc\"\n File(encFile).writeText(encrypted)\n println(\"\\n'$encFile' has been created in the current directory.\")\n for (i in first until first + nLines) {\n lines[i] = \"-\" + lines[i].drop(1)\n }\n File(keyFile).writeText(lines.joinToString(\"\\n\"))\n if (DEMO) {\n println(\"\\nThe contents of the encrypted file are :\\n\")\n println(encrypted)\n }\n }\n else println(\"Not enough lines left in that file to do encryption\")\n }\n else println(\"\\nThat file does not exist.\")\n }\n\n 5 -> { // Decrypt\n print(\"OTP file name to use (without extension) : \")\n val keyFile = readLine()!! + \".1tp_cpy\"\n val kf = File(keyFile)\n if (kf.exists()) {\n val keyLines = File(keyFile).readLines().toMutableList()\n var first = keyLines.size\n for (i in 0 until keyLines.size) {\n if (keyLines[i].startsWith(\" \")) {\n first = i\n break\n }\n }\n if (first == keyLines.size) {\n println(\"\\nThat file has no unused lines.\")\n continue@mainLoop\n }\n val keyLines2 = keyLines.drop(first) // get rid of comments and used lines\n\n val encFile = keyFile.dropLast(3) + \"enc\"\n val ef = File(encFile)\n if (ef.exists()) {\n val encLines = File(encFile).readLines().drop(1) // exclude comment line\n val nLines = encLines.size\n if (keyLines2.size >= nLines) {\n val encrypted = encLines.joinToString(\"\").toAlpha()\n val key = keyLines2.take(nLines).joinToString(\"\").toAlpha()\n val decrypted = vigenere(encrypted, key, false)\n val decFile = keyFile.dropLast(3) + \"dec\"\n File(decFile).writeText(decrypted)\n println(\"\\n'$decFile' has been created in the current directory.\")\n for (i in first until first + nLines) {\n keyLines[i] = \"-\" + keyLines[i].drop(1)\n }\n File(keyFile).writeText(keyLines.joinToString(\"\\n\"))\n if (DEMO) {\n println(\"\\nThe contents of the decrypted file are :\\n\")\n println(decrypted)\n }\n }\n else println(\"Not enough lines left in that file to do decryption\")\n }\n else println(\"\\n'$encFile' is missing.\")\n }\n else println(\"\\nThat file does not exist.\")\n }\n\n else -> return // Quit\n }\n }\n}\n","language":"Kotlin"},{"code":"import os, re, sequtils, strformat, strutils\nimport nimcrypto\n\n# One-time pad file signature.\nconst Magic = \"#one-time pad\"\n\n# Suffix for pad files.\nconst Suffix = \".1tp\"\n\nproc log(msg: string) =\n ## Log a message.\n stderr.write msg\n stderr.write '\\n'\n\nproc makeKeys(n, size: Positive): seq[string] =\n ## Generate \"n\" secure, random keys of \"size\" bytes.\n\n # We're generating and storing keys in their hexadecimal form to make\n # one-time pad files a little more human readable and to ensure a key\n # can not start with a hyphen.\n var bytes = newSeq[byte](size)\n for _ in 1..n:\n if randomBytes(bytes) != size:\n raise newException(ValueError, \"unable to build keys.\")\n result.add bytes.mapIt(it.toHex).join()\n\nproc makePad(name: string; padSize, keySize: Positive): string =\n ## Create a new one-time pad identified by the given name.\n ## Args:\n ## name: unique one-time pad identifier.\n ## padSize: the number of keys (or pages) in the pad.\n ## keySize: the number of bytes per key.\n ## Returns:\n ## the new one-time pad as a string.\n\n let pad = @[Magic, &\"#name={name}\", &\"#size={padSize}\"] & makeKeys(padSize, keySize)\n result = pad.join(\"\\n\")\n\nproc `xor`(message, key: string): string =\n ## Return \"message\" XOR-ed with \"key\".\n ##\n ## Args:\n ## message: plaintext or cyphertext to be encrypted or decrypted.\n ## key: encryption and decryption key.\n ## Returns:\n ## plaintext or cyphertext as a string.\n\n if key.len < message.len:\n quit(\"Key size is too short to encrypt/decrypt the message.\", QuitFailure)\n result = newStringOfCap(message.len)\n var keyIndex = 0\n for msgChar in message:\n result.add chr(ord(msgChar) xor ord(key[keyIndex]))\n inc keyIndex\n\nproc useKey(pad: var string): string =\n ## Use the next available key from the given one-time pad.\n ##\n ## Args:\n ## pad: a one-time pad, updated.\n ## Returns:\n ## the key.\n\n var matches: array[1, string]\n let pos = pad.find(re\"(?m)(^[A-F0-9]+$)\", matches)\n if pos < 0:\n quit(\"Pad is all used up.\", QuitFailure)\n\n pad.insert(\"-\", pos)\n result = matches[0]\n\nproc writePad(path: string; padSize, keySize: Positive) =\n ## Write a new one-time pad to the given path.\n ##\n ## Args:\n ## path: path to write one-time pad to.\n ## padSize: the number of keys (or pages) in the pad.\n ## keySize: the number of bytes per key.\n\n if fileExists(path):\n quit(\"Pad \" & path & \" already exists\", QuitFailure)\n try:\n path.writeFile(makePad(path.extractFilename(), padSize, keySize))\n except IOError:\n quit(\"Unable to write file \" & path, QuitFailure)\n log(\"New one-time pad written to \" & path)\n\nproc process(pad, message: string; outfile: File) =\n ## Encrypt or decrypt \"message\" using the given pad.\n ##\n ## Args:\n ## pad: path to one-time pad.\n ## message: plaintext or ciphertext message to encrypt or decrypt.\n ## outfile: file-like object to write to.\n\n if not fileExists(pad):\n quit(\"No such pad: \" & pad, QuitFailure)\n let start = pad.readLines(1)\n if start.len == 0 or start[0] != Magic:\n quit(&\"file '{pad}' does not look like a one-time pad\", QuitFailure)\n\n # Rewrites the entire one-time pad every time\n var padData = pad.readFile()\n let key = padData.useKey().parseHexStr()\n pad.writeFile(padData)\n\n outfile.write(message xor key)\n\n\nwhen isMainModule:\n\n import parseopt\n\n proc printUsage() =\n echo \"Usage: \", getAppFilename().lastPathPart,\n \" [-h] [--length LENGTH] [--key-size KEY_SIZE] [-o OUTFILE]\"\n echo \" [--encrypt FILE | --decrypt FILE] pad\"\n echo \"\"\n echo \"\"\"One-time pad.\n\npositional arguments:\n pad Path to one-time pad. If neither --encrypt or --decrypt\n are given, will create a new pad.\n\noptional arguments:\n -h, --help show this help message and exit\n --length LENGTH Pad size. Ignored if --encrypt or --decrypt are given.\n Defaults to 10.\n --key-size KEY_SIZE Key size in bytes. Ignored if --encrypt or --decrypt\n are given. Defaults to 64.\n --outfile OUTFILE Write encoded/decoded message to a file. Ignored if\n --encrypt or --decrypt is not given. Defaults to\n stdout.\n --encrypt FILE Encrypt FILE using the next available key from pad.\n --decrypt FILE Decrypt FILE using the next available key from pad.\n \"\"\"\n\n var\n parser = initOptParser(shortNoVal = {'h'}, longNoval = @[\"help\"])\n padPath: string\n length = 10\n outpath = \"\"\n encryptPath = \"\"\n decryptPath = \"\"\n keySize = 64\n encrypt = false\n decrypt = false\n\n for kind, key, val in parser.getopt():\n case kind\n\n of cmdShortOption:\n printUsage()\n if key != \"h\":\n quit(\"Wrong option: \" & key, QuitFailure)\n elif val.len != 0:\n quit(\"Wrong value for option -h\", QuitFailure)\n else:\n quit(QuitSuccess)\n\n of cmdLongOption:\n case key\n\n of \"help\":\n printUsage()\n quit(QuitSuccess)\n\n of \"length\":\n try:\n length = parseInt(val)\n if length < 2: raise newException(ValueError, \"\")\n except ValueError:\n quit(\"Wrong length: \" & val, QuitFailure)\n\n of \"encrypt\":\n encryptPath = val\n encrypt = true\n\n of \"decrypt\":\n decryptPath = val\n decrypt = true\n\n of \"outfile\":\n outPath = val\n\n of \"key-size\":\n try:\n keySize = parseInt(val)\n if length < 2: raise newException(ValueError, \"\")\n except ValueError:\n quit(\"Wrong key size: \" & val, QuitFailure)\n\n else:\n quit(\"Invalid option: \" & key, QuitFailure)\n\n of cmdArgument:\n padPath = if key.endsWith(Suffix): key else: key & Suffix\n\n of cmdEnd:\n discard # Cannot not occur.\n\n if padPath.len == 0:\n quit(\"Missing pad file.\", QuitFailure)\n\n if encrypt and decrypt:\n quit(\"Incompatible options: encrypt and decrypt\", QuitFailure)\n\n if encrypt or decrypt:\n\n var outfile: File\n if outpath.len == 0:\n outfile = stdout\n else:\n try:\n outfile = outpath.open(fmWrite)\n except IOError:\n quit(\"Unable to open output file.\", QuitFailure)\n\n let message = try:\n if encrypt: encryptPath.readFile()\n else: decryptPath.readFile()\n except IOError:\n quit(\"Unable to open file to encrypt or decrypt.\", QuitFailure)\n\n padPath.process(message, outfile)\n if outfile != stdout: outfile.close()\n\n else:\n padPath.writePad(length, keySize)\n","language":"Nim"},{"code":"# 20200814 added Perl programming solution\n\nuse strict;\nuse warnings;\n\nuse Crypt::OTP;\nuse Bytes::Random::Secure qw( random_bytes );\n\nprint \"Message : \", my $message = \"show me the monKey\", \"\\n\";\n\nmy $otp = random_bytes(length $message);\nprint \"Ord(OTP) : \", ( map { ord($_).' ' } (split //, $otp) ) , \"\\n\";\n\nmy $cipher = OTP( $otp, $message, 1 );\nprint \"Ord(Cipher) : \", ( map { ord($_).' ' } (split //, $cipher) ) , \"\\n\";\n\nprint \"Decoded : \", OTP( $otp, $cipher, 1 ), \"\\n\";\n","language":"Perl"},{"code":"\"\"\"One-time pad using an XOR cipher. Requires Python >=3.6.\"\"\"\n\nimport argparse\nimport itertools\nimport pathlib\nimport re\nimport secrets\nimport sys\n\n# One-time pad file signature.\nMAGIC = \"#one-time pad\"\n\n\ndef make_keys(n, size):\n \"\"\"Generate ``n`` secure, random keys of ``size`` bytes.\"\"\"\n # We're generating and storing keys in their hexadecimal form to make\n # one-time pad files a little more human-readable and to ensure a key\n # can not start with a hyphen.\n return (secrets.token_hex(size) for _ in range(n))\n\n\ndef make_pad(name, pad_size, key_size):\n \"\"\"Create a new one-time pad identified by the given name.\n\n Args:\n name (str): Unique one-time pad identifier.\n pad_size (int): The number of keys (or pages) in the pad.\n key_size (int): The number of bytes per key.\n Returns:\n The new one-time pad as a string.\n \"\"\"\n pad = [\n MAGIC,\n f\"#name={name}\",\n f\"#size={pad_size}\",\n *make_keys(pad_size, key_size),\n ]\n\n return \"\\n\".join(pad)\n\n\ndef xor(message, key):\n \"\"\"Return ``message`` XOR-ed with ``key``.\n\n Args:\n message (bytes): Plaintext or cyphertext to be encrypted or decrypted.\n key (bytes): Encryption and decryption key.\n Returns:\n Plaintext or cyphertext as a byte string.\n \"\"\"\n return bytes(mc ^ kc for mc, kc in zip(message, itertools.cycle(key)))\n\n\ndef use_key(pad):\n \"\"\"Use the next available key from the given one-time pad.\n\n Args:\n pad (str): A one-time pad.\n Returns:\n (str, str) A two-tuple of updated pad and key.\n \"\"\"\n match = re.search(r\"^[a-f0-9]+$\", pad, re.MULTILINE)\n if not match:\n error(\"pad is all used up\")\n\n key = match.group()\n pos = match.start()\n\n return (f\"{pad[:pos]}-{pad[pos:]}\", key)\n\n\ndef log(msg):\n \"\"\"Log a message.\"\"\"\n sys.stderr.write(msg)\n sys.stderr.write(\"\\n\")\n\n\ndef error(msg):\n \"\"\"Exit with an error message.\"\"\"\n sys.stderr.write(msg)\n sys.stderr.write(\"\\n\")\n sys.exit(1)\n\n\ndef write_pad(path, pad_size, key_size):\n \"\"\"Write a new one-time pad to the given path.\n\n Args:\n path (pathlib.Path): Path to write one-time pad to.\n pad_size (int): The number of keys (or pages) in the pad.\n key_size (int): The number of bytes per key.\n \"\"\"\n if path.exists():\n error(f\"pad '{path}' already exists\")\n\n with path.open(\"w\") as fd:\n fd.write(make_pad(path.name, pad_size, key_size))\n\n log(f\"New one-time pad written to {path}\")\n\n\ndef main(pad, message, outfile):\n \"\"\"Encrypt or decrypt ``message`` using the given pad.\n\n Args:\n pad (pathlib.Path): Path to one-time pad.\n message (bytes): Plaintext or ciphertext message to encrypt or decrypt.\n outfile: File-like object to write to.\n \"\"\"\n if not pad.exists():\n error(f\"no such pad '{pad}'\")\n\n with pad.open(\"r\") as fd:\n if fd.readline().strip() != MAGIC:\n error(f\"file '{pad}' does not look like a one-time pad\")\n\n # Rewrites the entire one-time pad every time\n with pad.open(\"r+\") as fd:\n updated, key = use_key(fd.read())\n\n fd.seek(0)\n fd.write(updated)\n\n outfile.write(xor(message, bytes.fromhex(key)))\n\n\nif __name__ == \"__main__\":\n # Command line interface\n parser = argparse.ArgumentParser(description=\"One-time pad.\")\n\n parser.add_argument(\n \"pad\",\n help=(\n \"Path to one-time pad. If neither --encrypt or --decrypt \"\n \"are given, will create a new pad.\"\n ),\n )\n\n parser.add_argument(\n \"--length\",\n type=int,\n default=10,\n help=\"Pad size. Ignored if --encrypt or --decrypt are given. Defaults to 10.\",\n )\n\n parser.add_argument(\n \"--key-size\",\n type=int,\n default=64,\n help=\"Key size in bytes. Ignored if --encrypt or --decrypt are given. Defaults to 64.\",\n )\n\n parser.add_argument(\n \"-o\",\n \"--outfile\",\n type=argparse.FileType(\"wb\"),\n default=sys.stdout.buffer,\n help=(\n \"Write encoded/decoded message to a file. Ignored if --encrypt or \"\n \"--decrypt is not given. Defaults to stdout.\"\n ),\n )\n\n group = parser.add_mutually_exclusive_group()\n\n group.add_argument(\n \"--encrypt\",\n metavar=\"FILE\",\n type=argparse.FileType(\"rb\"),\n help=\"Encrypt FILE using the next available key from pad.\",\n )\n group.add_argument(\n \"--decrypt\",\n metavar=\"FILE\",\n type=argparse.FileType(\"rb\"),\n help=\"Decrypt FILE using the next available key from pad.\",\n )\n\n args = parser.parse_args()\n\n if args.encrypt:\n message = args.encrypt.read()\n elif args.decrypt:\n message = args.decrypt.read()\n else:\n message = None\n\n # Sometimes necessary if message came from stdin\n if isinstance(message, str):\n message = message.encode()\n\n pad = pathlib.Path(args.pad).with_suffix(\".1tp\")\n\n if message:\n main(pad, message, args.outfile)\n else:\n write_pad(pad, args.length, args.key_size)\n","language":"Python"},{"code":"sub MAIN {\n put \"Generate data for one time pad encryption.\\n\" ~\n \"File will have .1tp extension.\";\n my $fn;\n loop {\n $fn = prompt 'Filename for one time pad data: ';\n if $fn !~~ /'.1tp' $/ { $fn ~= '.1tp' }\n if $fn.IO.e {\n my $ow = prompt \"$fn aready exists, over-write? y/[n] \";\n last if $ow ~~ m:i/'y'/;\n redo;\n }\n last;\n }\n\n put 'Each line will contain 48 characters of encyption data.';\n my $lines = prompt 'How many lines of data to generate? [1000] ';\n $lines ||= 1000;\n generate($fn, $lines);\n say \"One-time-pad data saved to: \", $fn.IO.absolute;\n\n sub generate ( $fn, $lines) {\n use Crypt::Random;\n $fn.IO.spurt: \"# one-time-pad encryption data\\n\" ~\n ((sprintf(\" %s %s %s %s %s %s %s %s\\n\",\n ((('A'..'Z')[crypt_random_uniform(26)] xx 6).join) xx 8))\n xx $lines).join;\n }\n}\n","language":"Raku"},{"code":"sub s2v ($s) { $s.uc.comb(/ <[ A..Z ]> /)».ord »-» 65 }\nsub v2s (@v) { (@v »%» 26 »+» 65)».chr.join }\n\nsub hide ($secret, $otp) { v2s(s2v($secret) »+» s2v($otp)) }\nsub reveal ($hidden, $otp) { v2s(s2v($hidden) »-» s2v($otp)) }\n\nsub otp-data ($fn, $lines) {\n my $fh = $fn.IO.open :rw;\n my $data;\n my $count = 0;\n repeat {\n my $pos = $fh.tell;\n my $line = $fh.get;\n if $line.substr(0,1) ne '-'|'#' {\n $data ~= $line;\n $fh.seek($pos);\n $fh.put: '-' ~ $line.substr(1);\n $count++;\n }\n } until $count == $lines or $fh.eof;\n note \"Insufficient lines of data remaining in $fn\" if $count != $lines;\n $data;\n}\n\nsub otp-size (Str $string) { ceiling $string.uc.comb(/ <[ A..Z ]> /) / 48 }\n\nsub otp-encrypt ( $secret, $fn ) {\n my $otp-size = otp-size $secret;\n my $otp-data = otp-data($fn, $otp-size);\n my $encrypted = hide $secret, $otp-data;\n # pad encryted text out to a full line with random text\n $encrypted ~= ('A'..'Z').roll while $encrypted.chars % 48;\n join \"\\n\", $encrypted.comb(6).rotor(8, :partial).map:\n { sprintf \"{ join ' ', \"%s\" xx $_ }\", $_ };\n}\n\nsub otp-decrypt ( $secret, $fn ) {\n my $otp-size = otp-size $secret;\n my $otp-data = otp-data($fn, $otp-size);\n my $plain-text = reveal $secret, $otp-data;\n join \"\\n\", $plain-text.comb(6).rotor(8, :partial).map:\n { sprintf \"{ join ' ', \"%s\" xx $_ }\", $_ };\n}\n\nmy $otp-encrypt-fn = 'rosettacode.1tp';\nmy $otp-decrypt-fn = 'rosettacopy.1tp';\n\nmy $secret = \"Beware the Jabberwock, my son! The jaws that bite, the claws that catch!\";\n\nsay \"Secret:\\n$secret\\n\\nEncrypted:\";\nsay my $encrypted = otp-encrypt $secret, $otp-encrypt-fn;\nsay \"\\nDecrypted:\\n\", otp-decrypt $encrypted, $otp-decrypt-fn;\n","language":"Raku"},{"code":"puts \"# True random chars for one-time pad\"\n\nproc randInt { min max } {\n set randDev [open /dev/urandom rb]\n set random [read $randDev 8]\n binary scan $random H16 random\n set random [expr {([scan $random %x] % (($max-$min) + 1) + $min)}]\n close $randDev\n return $random\n}\n\nproc randStr { sLen grp alfa } {\n set aLen [string length $alfa]; incr aLen -1\n set rs \"\"\n for {set i 0} {$i < $sLen} {incr i} {\n if { [expr {$i % $grp} ] == 0} { append rs \" \" }\n set r [randInt 0 $aLen]\n set char [string index $alfa $r]\n append rs $char\n ##puts \"$i: $r $char\"\n }\n return $rs\n}\n\nset alfa \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nset len 48\nset lines 4\nset fn \"test.1tp\"\n\n# Write file:\nset fh [open $fn w]\nputs $fh \"# OTP\"\nfor {set ln 0} {$ln < $lines} {incr ln} {\n set line [randStr $len 6 $alfa]\n ##puts \"$ln :$line.\"\n puts $fh $line\n}\nclose $fh\n\n# Read file:\nputs \"# File $fn:\"\nset fh [open $fn]\nputs [read $fh [file size $fn]]\nclose $fh\n\nputs \"# Done.\"\n","language":"Tcl"},{"code":"#!/usr/bin/env node\nimport { writeFileSync, existsSync, readFileSync, unlinkSync } from 'node:fs';\n//https://www.elitizon.com/2021/01-09-how-to-create-a-cli-command-with-typescript/#:~:text=%20Boost%20your%20productivity%20by%20creating%20your%20own,information.%20Required%3A%20string.%20%20...%20%20More%20\n\nconst a:string[] = process.argv;\nconst argv:string[] = a.splice(2)\n/**\n * Extension of the pad files\n */\nconst padExtension:string = \".1tp\";\n/**\n * Extension of the key generated\n */\nconst keyExtension:string = \".key\";\n/**\n * Array of commands usable\n */\nconst commands:string[] = [\"--generate\", \"--encrypt\",\"--decrypt\"];\n/**\n * The alphabet\n */\nconst stringLetter = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\n\n/**\n * Main function\n */\nconst main = ():void => {\n // if no args have been give display help\n if(argv.length == 0){\n help();\n return;\n }\n\n // Check if there is a command in the file\n if(commands.includes(argv[0])){\n let choise = argv[0].trim().toLowerCase();\n if(choise === \"--generate\"){\n console.log(\"Generating action chosen\");\n\n // Check if the arguments have been given to generate a new key\n if(!argv[1]){\n (\"Pad name not specified\")\n help();\n return;\n }\n\n // Check if the length of the filename is at least 4 characters\n if(argv[1].length <= 3){\n console.log(\"The name of the pad should be at least 4 letters long\");\n help();\n return;\n }\n\n // Check if the filesize is a number(should be the second argv)\n let fileSize = +argv[2];\n if(isNaN(fileSize)){\n console.log(\"File size should be a number\");\n help();\n return\n }\n\n createFile(argv[1], fileSize)\n }\n\n // If the selected action is to encrypt\n if( choise === \"--encrypt\"){\n console.log(\"Encrypting action chosen\");\n let padDataName = argv[2] ? `${argv[2].trim()}${padExtension}` : `${argv[1].trim()}${padExtension}`\n\n // Check if the files exist\n if(!argv[1] && !argv[2]){\n console.log(\"Parameters not given\");\n help();\n return;\n }\n\n // Check if the text file exists and the pad file\n if(!existsSync(`${argv[1].trim().toLowerCase()}.txt`)){\n console.log(\"Text file doesn't exit\");\n help();\n return;\n }\n\n console.log(\"Reading file\")\n // Get the data from the file as well as the data from the padfile\n let fileDataEnc = readFileSync(`${argv[1].trim().toLowerCase()}.txt`, 'utf-8');\n\n if(!existsSync(`${argv[2]}${padExtension}`)){\n console.log(\"1tp file doesn't exist, generating new 1pt file\");\n createFile(argv[1], fileDataEnc.length);\n }\n\n console.log(\"Reading 1pt file\");\n // Get the pad data\n let padDataEnc = RetrievePadData(padDataName);\n\n // if the file 1pt file has been specified but it's not big enough\n if(fileDataEnc.length > padDataEnc.length){\n console.log(\"The file is bigger than the 1tp file. Generating a new padfile\");\n createFile(argv[1], fileDataEnc.length);\n padDataEnc = RetrievePadData(`${argv[1]}${padExtension}`)\n }\n\n console.log(\"Converting the file\");\n let keyEnc = padFunction(fileDataEnc,padDataEnc);\n createFile(`${argv[1]}.key`, keyEnc.length, false, keyEnc);\n\n }\n\n\n if(choise === \"--decrypt\"){\n console.log(\"Decrypting action chosen\");\n\n // Check if the necessary args were given\n if(!argv[1]){\n console.log(\"No file specified For decryption specified\")\n return;\n }\n if(!argv[2]){\n console.log(\"No 1pt file was given, Please specify the file to use\");\n return;\n }\n if(!argv[3] || argv[3].trim() != '-o') {\n console.log(\"No file for output specified\");\n }\n\n\n let fileNameDec = `${argv[1].trim()}${keyExtension}`;\n let padNameDec = `${argv[2].trim()}${padExtension}`;\n\n // Check if the files exists or not\n if(!existsSync(fileNameDec)){\n console.log(\"File specified does not exist\");\n return;\n }\n if(!existsSync(padNameDec)){\n console.log(\"1pt file specified doesn't exist\");\n return;\n }\n\n console.log(\"Read the encrypted file\");\n let fileDataDec = readFileSync(fileNameDec, 'utf-8');\n console.log(\"Reading the 1pt file\");\n let padDataDec = RetrievePadData(padNameDec);\n\n // decrypt the file\n console.log(\"Generating the file\");\n let keyDec = padFunction(fileDataDec, padDataDec)\n\n\n if(argv[3] && argv[3].trim()==='-o'){\n let textFileDec = `${argv[1].trim()}.txt`;\n if(!argv[4]){\n console.log(\"No output file specified, creating a new file\")\n }\n if(argv[4] && argv[4].trim().length < 3){\n console.log(\"The name of the output file should be greater than 4 characters\");\n console.log(`Creating new file`)\n }else {\n argv[4] ? textFileDec = `${argv[4].trim()}.txt` : textFileDec = `${argv[1].trim()}.txt`\n }\n\n console.log(\"Generating text file\");\n createFile(textFileDec, 0, false, keyDec );\n // https://sebhastian.com/javascript-delete-file/\n console.log(\"Deleting encrypted file\");\n unlinkSync(fileNameDec);\n console.log(\"Deleting 1pt file\");\n unlinkSync(padNameDec);\n }else {\n console.log(\"The decrypted file is: \\n\\n\")\n console.log(keyDec);\n }\n }\n\n }else {\n console.log(\"Invalid action\");\n help();\n return;\n }\n\n}\n\n/**\n * Display help messages\n */\nconst help = ():void => {\n console.log(\"\\n\\n\\n1tp is a tool used to encrypt and decrypt text files\");\n console.log(\"Look at the commands below to learn the use of it\");\n console.log(\"The input file for encryption should be a txt file\");\n console.log(\"The output will be a .kye file and a .1pt file\");\n console.log(\"\\n\\n**Note: Don't add file extensios while running the command**\");\n console.log(\"**Note: if during creation, the application encouters a file already existing, it will overwrite the file**\");\n console.log(\"Options: \");\n console.log(\"\\t -h | --help \\t\\t\\t\\t\\t\\t\\t View help\");\n console.log(\"\\t --generate <pad name> <size of file> \\t\\t\\t\\t Create a pad file given a size\");\n console.log(\"\\t --encrypt <txt file> <pad name> \\t\\t\\t\\t Encrypt a file give a pad file\");\n console.log(\"\\t\\t\\t\\t All parameters for encryption are required\");\n console.log(\"\\t --decrypt <key file> <pad name> -o <txt file> \\t Decrypt a file give a key and 1tp files\");\n console.log(\"\\t\\t\\t\\t If output file is not specified it will display the text inside the console\");\n console.log(\"\\t\\t\\t\\t If only the `-o` option is defined without a txt file, it will create a new file\");\n console.log(\"\\n** Note: Decrypting a file will delete the key and the 1pt files**\");\n}\n\n/**\n * Create a file with a random key\n * @param file Name of the file being created\n * @param fileSize Size of the file being created\n */\nconst createFile = (file:string, fileSize:number = 1024, key:boolean = true, data:string = \"\"):void => {\n let fileName:string;\n if(key){\n fileName = `${file.trim().toLowerCase()}${padExtension}`;\n\n // https://flaviocopes.com/how-to-check-if-file-exists-node/#:~:text=The%20way%20to%20check%20if%20a%20file%20exists,the%20existence%20of%20a%20file%20without%20opening%20it%3A\n\n console.log(\"Generating the One time pad\");\n const pad = generateOneTimePad(fileSize);\n //https://code-boxx.com/create-save-files-javascript/#:~:text=%20The%20possible%20ways%20to%20create%20and%20save,the%20server.%0Avar%20data%20%3D%20new%20FormData...%20More%20\n console.log(\"Writing to file\");\n writeFileSync(fileName, pad);\n return;\n\n }\n\n console.log(\"Writing to file\");\n writeFileSync(file, data);\n};\n\n/**\n * Generate a pad\n * @param fileSize Size of the new pad being created\n * @returns the new pad\n */\nconst generateOneTimePad = (fileSize:number):string => {\n /**\n * String in which we will put the one time pad\n */\n let otp:string = \"\";\n /**\n * used to organize the key\n */\n let splitCounter = 0;\n let columnCounter = 0;\n\n for (let i = 0; i <= fileSize;) {\n if(splitCounter < 6){\n // Generate a random letter from the alphabet given\n otp += (stringLetter.charAt(Math.random()*1000%stringLetter.length))\n splitCounter++;\n i++;\n continue;\n }\n // Used to organize the key so it looks estetic\n if(columnCounter < 7){\n splitCounter = 0;\n columnCounter++;\n otp += (\"\\t\");\n continue;\n }else{\n splitCounter = 0;\n columnCounter = 0;\n otp += (\"\\n\");\n continue;\n }\n\n }\n return otp\n}\n\n/**\n * Get the pad data from the file\n * @returns Text pad data\n */\nconst RetrievePadData = (padFile:string):string => {\n // Retrieve the pad data\n let padData = \"\"\n // read the file\n const data = readFileSync(`${padFile}`, 'utf-8')\n\n // Take out all the tabs and new lines we added while generating the key\n const stringArray = data.toString().split(\"\\n\");\n for (let index = 0; index < stringArray.length; index++) {\n const element = stringArray[index].split(\"\\t\");\n for (let i = 0; i < element.length; i++) {\n padData += element[i];\n }\n }\n\n return padData;\n}\n\n/**\n * One time pad function\n * @param fileData Data of the file to encrypt or decrypt\n * @param padData Data of the pad file\n * @returns The generated encryption or decryption\n */\nconst padFunction = (fileData:string, padData:string ):string => {\n let key = \"\";\n for (let i = 0; i < fileData.length; i++) {\n key += String.fromCharCode(-fileData[i].charCodeAt(0)+padData[i].toLowerCase().charCodeAt(0)+97);\n // console.log(`File char: ${fileData[i]} ${fileData[i].charCodeAt(0)} Pad Data: ${padData[i]} ${padData[i].toLocaleLowerCase().charCodeAt(0)} Key: ${key[i]} ${key[i].charCodeAt(0)}`)\n }\n return key;\n}\n\nmain();\n","language":"TypeScript"},{"code":"import \"io\" for File, Directory\nimport \"./srandom\" for SRandom\nimport \"./ioutil\" for FileUtil, Input\nimport \"./dynamic\" for Enum\nimport \"./str\" for Char, Str\n\nvar CHARS_PER_LINE = 48\nvar CHUNK_SIZE = 6\nvar COLS = 8\nvar DEMO = true // would normally be set to false\n\nvar FileType = Enum.create(\"FileType\", [\"OTP\", \"ENC\", \"DEC\"])\n\nvar toAlpha = Fn.new { |s| s.where { |c| Char.isAsciiUpper(c) }.join() }\n\nvar isOtpRelated = Fn.new { |s|\n return s.endsWith(\".1tp\") || s.endsWith(\".1tp_cpy\") ||\n s.endsWith(\".1tp_enc\") || s.endsWith(\".1tp_dec\")\n}\n\nvar inChunks = Fn.new { |s, nLines, ft|\n var chunks = Str.chunks(s, CHUNK_SIZE)\n var sb = \"\"\n for (i in 0...nLines) {\n var j = i * COLS\n var ch = chunks[j...j+COLS].join(\" \")\n sb = sb + \" \" + ch + \"\\n\"\n }\n sb = \" file\\n\" + sb\n return (ft == FileType.OTP) ? \"# OTP\" + sb :\n (ft == FileType.ENC) ? \"# Encrypted\" + sb :\n (ft == FileType.DEC) ? \"# Decrypted\" + sb : \"\"\n}\n\nvar makePad = Fn.new { |nLines|\n var nChars = nLines * CHARS_PER_LINE\n var sb = \"\"\n /* generate random upper case letters */\n for (i in 0...nChars) sb = sb + String.fromByte(SRandom.int(65, 91))\n return inChunks.call(sb, nLines, FileType.OTP)\n}\n\nvar vigenere = Fn.new { |text, key, encrypt|\n var sb = \"\"\n var i = 0\n for (c in text) {\n var ci = encrypt ? (c.bytes[0] + key[i].bytes[0] - 130) % 26 :\n (c.bytes[0] - key[i].bytes[0] + 26) % 26\n sb = sb + String.fromByte(ci + 65)\n i = i + 1\n }\n var temp = sb.count % CHARS_PER_LINE\n if (temp > 0) { // pad with random characters so each line is a full one\n for (i in temp...CHARS_PER_LINE) sb = sb + String.fromByte(SRandom.int(65, 91))\n }\n var ft = encrypt ? FileType.ENC : FileType.DEC\n return inChunks.call(sb, (sb.count / CHARS_PER_LINE).floor, ft)\n}\n\nvar menu = Fn.new {\n System.print(\"\"\"\n\n1. Create one time pad file.\n\n2. Delete one time pad file.\n\n3. List one time pad files.\n\n4. Encrypt plain text.\n\n5. Decrypt cipher text.\n\n6. Quit program.\n\n\"\"\")\n return Input.integer(\"Your choice (1 to 6) : \", 1, 6)\n}\n\nwhile (true) {\n var choice = menu.call()\n System.print()\n if (choice == 1) { // Create OTP\n System.print(\"Note that encrypted lines always contain 48 characters.\\n\")\n var fileName = Input.text(\"OTP file name to create (without extension) : \", 1) + \".1tp\"\n var nLines = Input.integer(\"Number of lines in OTP (max 1000) : \", 1, 1000)\n var key = makePad.call(nLines)\n File.create(fileName) { |f| f.writeBytes(key) }\n System.print(\"\\n'%(fileName)' has been created in the current directory.\")\n if (DEMO) {\n // a copy of the OTP file would normally be on a different machine\n var fileName2 = fileName + \"_cpy\" // copy for decryption\n File.create(fileName2) { |f| f.writeBytes(key) }\n System.print(\"'%(fileName2)' has been created in the current directory.\")\n System.print(\"\\nThe contents of these files are :\\n\")\n System.print(key)\n }\n } else if (choice == 2) { // Delete OTP\n System.print(\"Note that this will also delete ALL associated files.\\n\")\n var toDelete1 = Input.text(\"OTP file name to delete (without extension) : \", 1) + \".1tp\"\n var toDelete2 = toDelete1 + \"_cpy\"\n var toDelete3 = toDelete1 + \"_enc\"\n var toDelete4 = toDelete1 + \"_dec\"\n var allToDelete = [toDelete1, toDelete2, toDelete3, toDelete4]\n var deleted = 0\n System.print()\n for (name in allToDelete) {\n if (File.exists(name)) {\n File.delete(name)\n deleted = deleted + 1\n System.print(\"'%(name)' has been deleted from the current directory.\")\n }\n }\n if (deleted == 0) System.print(\"There are no files to delete.\")\n } else if (choice == 3) { // List OTPs\n System.print(\"The OTP (and related) files in the current directory are:\\n\")\n var otpFiles = Directory.list(\"./\").where { |f| File.exists(f) && isOtpRelated.call(f) }.toList\n System.print(otpFiles.join(\"\\n\")) // already sorted\n } else if (choice == 4) { // Encrypt\n var keyFile = Input.text(\"OTP file name to use (without extension) : \", 1) + \".1tp\"\n if (File.exists(keyFile)) {\n var lines = FileUtil.readLines(keyFile)\n var first = lines.count\n for (i in 0...lines.count) {\n if (lines[i].startsWith(\" \")) {\n first = i\n break\n }\n }\n if (first == lines.count) {\n System.print(\"\\nThat file has no unused lines.\")\n continue\n }\n var lines2 = lines.skip(first).toList // get rid of comments and used lines\n var text = toAlpha.call(Str.upper(Input.text(\"Text to encrypt :-\\n\\n\", 1)))\n var len = text.count\n var nLines = (len / CHARS_PER_LINE).floor\n if (len % CHARS_PER_LINE > 0) nLines = nLines + 1\n if (lines2.count >= nLines) {\n var key = toAlpha.call(lines2.take(nLines).join(\"\"))\n var encrypted = vigenere.call(text, key, true)\n var encFile = keyFile + \"_enc\"\n File.create(encFile) { |f| f.writeBytes(encrypted) }\n System.print(\"\\n'%(encFile)' has been created in the current directory.\")\n for (i in first...first + nLines) {\n lines[i] = \"-\" + lines[i][1..-1]\n }\n File.create(keyFile) { |f| f.writeBytes(lines.join(\"\\n\")) }\n if (DEMO) {\n System.print(\"\\nThe contents of the encrypted file are :\\n\")\n System.print(encrypted)\n }\n } else System.print(\"Not enough lines left in that file to do encryption\")\n } else System.print(\"\\nhat file does not exist.\")\n } else if (choice == 5) { // Decrypt\n var keyFile = Input.text(\"OTP file name to use (without extension) : \", 1) + \".1tp_cpy\"\n if (File.exists(keyFile)) {\n var keyLines = FileUtil.readLines(keyFile)\n var first = keyLines.count\n for (i in 0...keyLines.count) {\n if (keyLines[i].startsWith(\" \")) {\n first = i\n break\n }\n }\n if (first == keyLines.count) {\n System.print(\"\\nThat file has no unused lines.\")\n continue\n }\n var keyLines2 = keyLines[first..-1] // get rid of comments and used lines\n var encFile = keyFile[0..-4] + \"enc\"\n if (File.exists(encFile)) {\n var encLines = FileUtil.readLines(encFile)[1..-1] // exclude comment line\n var nLines = encLines.count\n if (keyLines2.count >= nLines) {\n var encrypted = toAlpha.call(encLines.join(\"\"))\n var key = toAlpha.call(keyLines2.take(nLines).join(\"\"))\n var decrypted = vigenere.call(encrypted, key, false)\n var decFile = keyFile[0..-4] + \"dec\"\n File.create(decFile) { |f| f.writeBytes(decrypted) }\n System.print(\"\\n'%(decFile)' has been created in the current directory.\")\n for (i in first...first + nLines) {\n keyLines[i] = \"-\" + keyLines[i][1..-1]\n }\n File.create(keyFile) { |f| f.writeBytes(keyLines.join(\"\\n\")) }\n if (DEMO) {\n System.print(\"\\nThe contents of the decrypted file are :\\n\")\n System.print(decrypted)\n }\n } else System.print(\"Not enough lines left in that file to do decryption\")\n } else System.print(\"\\n'%(encFile)' is missing.\")\n } else System.print(\"\\nThat file does not exist.\")\n } else {\n return // Quit\n }\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Encryption\\n- File_handling\\nfrom: http://rosettacode.org/wiki/One-time_pad\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Implement a [[wp:One-time pad|One-time pad]], for encrypting and decrypting messages.<br>\\nTo keep it simple, we will be using letters only.\\n\\n;Sub-Tasks:\\n* '''Generate''' the data for a One-time pad (user needs to specify a filename and length)\\n: The important part is to get \\\"true random\\\" numbers, e.g. from /dev/random\\n* '''encryption / decryption''' ( basically the same operation, much like [[Rot-13]] )\\n: For this step, much of [[Vigenère cipher]] could be reused,<br>with the key to be read from the file containing the One-time pad.\\n* optional: '''management''' of One-time pads: list, mark as used, delete, etc.\\n: Somehow, the users needs to keep track which pad to use for which partner.\\n\\nTo support the management of pad-files:\\n* Such files have a file-extension \\\".1tp\\\"\\n* Lines starting with \\\"#\\\" may contain arbitary meta-data (i.e. comments)\\n* Lines starting with \\\"-\\\" count as \\\"used\\\"\\n* Whitespace within the otp-data is ignored\\n<!-- \\nmaybe support for 1tp-files on readonly-media,\\ni.e. an indexfile that stores which parts have been used\\n-->\\n\\n\\nFor example, here is the data from [http://upload.wikimedia.org/wikipedia/commons/6/60/One-time_pad.svg Wikipedia]:\\n<pre>\\n# Example data - Wikipedia - 2014-11-13\\n-ZDXWWW EJKAWO FECIFE WSNZIP PXPKIY URMZHI JZTLBC YLGDYJ \\n-HTSVTV RRYYEG EXNCGA GGQVRF FHZCIB EWLGGR BZXQDQ DGGIAK \\n YHJYEQ TDLCQT HZBSIZ IRZDYS RBYJFZ AIRCWI UCVXTW YKPQMK \\n CKHVEX VXYVCS WOGAAZ OUVVON GCNEVR LMBLYB SBDCDC PCGVJX \\n QXAUIP PXZQIJ JIUWYH COVWMJ UZOJHL DWHPER UBSRUJ HGAAPR \\n CRWVHI FRNTQW AJVWRT ACAKRD OZKIIB VIQGBK IJCWHF GTTSSE \\n EXFIPJ KICASQ IOUQTP ZSGXGH YTYCTI BAZSTN JKMFXI RERYWE \\n</pre>\\n<br><br>\\n;See also\\n* [https://breakingcode.wordpress.com/2010/02/17/one-time-pad-encryption-in-python/ one time pad encryption in Python]\\n* [https://github.com/snapfractalpop/1tp snapfractalpop] - One-Time-Pad Command-Line-Utility (C).\\n* [http://search.cpan.org/~sifukurt/Crypt-OTP-2.00/OTP.pm Crypt-OTP-2.00] on CPAN (Perl)\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bufio\\\"\\n \\\"crypto/rand\\\"\\n \\\"fmt\\\"\\n \\\"io/ioutil\\\"\\n \\\"log\\\"\\n \\\"math/big\\\"\\n \\\"os\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n \\\"unicode\\\"\\n)\\n\\nconst (\\n charsPerLine = 48\\n chunkSize = 6\\n cols = 8\\n demo = true // would normally be set to false\\n)\\n\\ntype fileType int\\n\\nconst (\\n otp fileType = iota\\n enc\\n dec\\n)\\n\\nvar scnr = bufio.NewScanner(os.Stdin)\\n\\nfunc check(err error) {\\n if err != nil {\\n log.Fatal(err)\\n }\\n}\\n\\nfunc toAlpha(s string) string {\\n var filtered []rune\\n for _, r := range s {\\n if unicode.IsUpper(r) {\\n filtered = append(filtered, r)\\n }\\n }\\n return string(filtered)\\n}\\n\\nfunc isOtpRelated(s string) bool {\\n return strings.HasSuffix(s, \\\".1tp\\\") || strings.HasSuffix(s, \\\"1tp_cpy\\\") ||\\n strings.HasSuffix(s, \\\".1tp_enc\\\") || strings.HasSuffix(s, \\\"1tp_dec\\\")\\n}\\n\\nfunc makePad(nLines int) string {\\n nChars := nLines * charsPerLine\\n bytes := make([]byte, nChars)\\n /* generate random upper case letters */\\n max := big.NewInt(26)\\n for i := 0; i < nChars; i++ {\\n n, err := rand.Int(rand.Reader, max)\\n check(err)\\n bytes[i] = byte(65 + n.Uint64())\\n }\\n return inChunks(string(bytes), nLines, otp)\\n}\\n\\nfunc vigenere(text, key string, encrypt bool) string {\\n bytes := make([]byte, len(text))\\n var ci byte\\n for i, c := range text {\\n if encrypt {\\n ci = (byte(c) + key[i] - 130) % 26\\n } else {\\n ci = (byte(c) + 26 - key[i]) % 26\\n }\\n bytes[i] = ci + 65\\n }\\n temp := len(bytes) % charsPerLine\\n if temp > 0 { // pad with random characters so each line is a full one\\n max := big.NewInt(26)\\n for i := temp; i < charsPerLine; i++ {\\n n, err := rand.Int(rand.Reader, max)\\n check(err)\\n bytes = append(bytes, byte(65+n.Uint64()))\\n }\\n }\\n ft := enc\\n if !encrypt {\\n ft = dec\\n }\\n return inChunks(string(bytes), len(bytes)/charsPerLine, ft)\\n}\\n\\nfunc inChunks(s string, nLines int, ft fileType) string {\\n nChunks := len(s) / chunkSize\\n remainder := len(s) % chunkSize\\n chunks := make([]string, nChunks)\\n for i := 0; i < nChunks; i++ {\\n chunks[i] = s[i*chunkSize : (i+1)*chunkSize]\\n }\\n if remainder > 0 {\\n chunks = append(chunks, s[nChunks*chunkSize:])\\n }\\n var sb strings.Builder\\n for i := 0; i < nLines; i++ {\\n j := i * cols\\n sb.WriteString(\\\" \\\" + strings.Join(chunks[j:j+cols], \\\" \\\") + \\\"\\\\n\\\")\\n }\\n ss := \\\" file\\\\n\\\" + sb.String()\\n switch ft {\\n case otp:\\n return \\\"# OTP\\\" + ss\\n case enc:\\n return \\\"# Encrypted\\\" + ss\\n default: // case dec:\\n return \\\"# Decrypted\\\" + ss\\n }\\n}\\n\\nfunc menu() int {\\n fmt.Println(`\\n1. Create one time pad file.\\n\\n2. Delete one time pad file.\\n\\n3. List one time pad files.\\n\\n4. Encrypt plain text.\\n\\n5. Decrypt cipher text.\\n\\n6. Quit program.\\n`)\\n choice := 0\\n for choice < 1 || choice > 6 {\\n fmt.Print(\\\"Your choice (1 to 6) : \\\")\\n scnr.Scan()\\n choice, _ = strconv.Atoi(scnr.Text())\\n check(scnr.Err())\\n }\\n return choice\\n}\\n\\nfunc main() {\\n for {\\n choice := menu()\\n fmt.Println()\\n switch choice {\\n case 1: // Create OTP\\n fmt.Println(\\\"Note that encrypted lines always contain 48 characters.\\\\n\\\")\\n fmt.Print(\\\"OTP file name to create (without extension) : \\\")\\n scnr.Scan()\\n fileName := scnr.Text() + \\\".1tp\\\"\\n nLines := 0\\n for nLines < 1 || nLines > 1000 {\\n fmt.Print(\\\"Number of lines in OTP (max 1000) : \\\")\\n scnr.Scan()\\n nLines, _ = strconv.Atoi(scnr.Text())\\n }\\n check(scnr.Err())\\n key := makePad(nLines)\\n file, err := os.Create(fileName)\\n check(err)\\n _, err = file.WriteString(key)\\n check(err)\\n file.Close()\\n fmt.Printf(\\\"\\\\n'%s' has been created in the current directory.\\\\n\\\", fileName)\\n if demo {\\n // a copy of the OTP file would normally be on a different machine\\n fileName2 := fileName + \\\"_cpy\\\" // copy for decryption\\n file, err := os.Create(fileName2)\\n check(err)\\n _, err = file.WriteString(key)\\n check(err)\\n file.Close()\\n fmt.Printf(\\\"'%s' has been created in the current directory.\\\\n\\\", fileName2)\\n fmt.Println(\\\"\\\\nThe contents of these files are :\\\\n\\\")\\n fmt.Println(key)\\n }\\n case 2: // Delete OTP\\n fmt.Println(\\\"Note that this will also delete ALL associated files.\\\\n\\\")\\n fmt.Print(\\\"OTP file name to delete (without extension) : \\\")\\n scnr.Scan()\\n toDelete1 := scnr.Text() + \\\".1tp\\\"\\n check(scnr.Err())\\n toDelete2 := toDelete1 + \\\"_cpy\\\"\\n toDelete3 := toDelete1 + \\\"_enc\\\"\\n toDelete4 := toDelete1 + \\\"_dec\\\"\\n allToDelete := []string{toDelete1, toDelete2, toDelete3, toDelete4}\\n deleted := 0\\n fmt.Println()\\n for _, name := range allToDelete {\\n if _, err := os.Stat(name); !os.IsNotExist(err) {\\n err = os.Remove(name)\\n check(err)\\n deleted++\\n fmt.Printf(\\\"'%s' has been deleted from the current directory.\\\\n\\\", name)\\n }\\n }\\n if deleted == 0 {\\n fmt.Println(\\\"There are no files to delete.\\\")\\n }\\n case 3: // List OTPs\\n fmt.Println(\\\"The OTP (and related) files in the current directory are:\\\\n\\\")\\n files, err := ioutil.ReadDir(\\\".\\\") // already sorted by file name\\n check(err)\\n for _, fi := range files {\\n name := fi.Name()\\n if !fi.IsDir() && isOtpRelated(name) {\\n fmt.Println(name)\\n }\\n }\\n case 4: // Encrypt\\n fmt.Print(\\\"OTP file name to use (without extension) : \\\")\\n scnr.Scan()\\n keyFile := scnr.Text() + \\\".1tp\\\"\\n if _, err := os.Stat(keyFile); !os.IsNotExist(err) {\\n file, err := os.Open(keyFile)\\n check(err)\\n bytes, err := ioutil.ReadAll(file)\\n check(err)\\n file.Close()\\n lines := strings.Split(string(bytes), \\\"\\\\n\\\")\\n le := len(lines)\\n first := le\\n for i := 0; i < le; i++ {\\n if strings.HasPrefix(lines[i], \\\" \\\") {\\n first = i\\n break\\n }\\n }\\n if first == le {\\n fmt.Println(\\\"\\\\nThat file has no unused lines.\\\")\\n continue\\n }\\n lines2 := lines[first:] // get rid of comments and used lines\\n\\n fmt.Println(\\\"Text to encrypt :-\\\\n\\\")\\n scnr.Scan()\\n text := toAlpha(strings.ToUpper(scnr.Text()))\\n check(scnr.Err())\\n tl := len(text)\\n nLines := tl / charsPerLine\\n if tl%charsPerLine > 0 {\\n nLines++\\n }\\n if len(lines2) >= nLines {\\n key := toAlpha(strings.Join(lines2[0:nLines], \\\"\\\"))\\n encrypted := vigenere(text, key, true)\\n encFile := keyFile + \\\"_enc\\\"\\n file2, err := os.Create(encFile)\\n check(err)\\n _, err = file2.WriteString(encrypted)\\n check(err)\\n file2.Close()\\n fmt.Printf(\\\"\\\\n'%s' has been created in the current directory.\\\\n\\\", encFile)\\n for i := first; i < first+nLines; i++ {\\n lines[i] = \\\"-\\\" + lines[i][1:]\\n }\\n file3, err := os.Create(keyFile)\\n check(err)\\n _, err = file3.WriteString(strings.Join(lines, \\\"\\\\n\\\"))\\n check(err)\\n file3.Close()\\n if demo {\\n fmt.Println(\\\"\\\\nThe contents of the encrypted file are :\\\\n\\\")\\n fmt.Println(encrypted)\\n }\\n } else {\\n fmt.Println(\\\"Not enough lines left in that file to do encryption.\\\")\\n }\\n } else {\\n fmt.Println(\\\"\\\\nThat file does not exist.\\\")\\n }\\n case 5: // Decrypt\\n fmt.Print(\\\"OTP file name to use (without extension) : \\\")\\n scnr.Scan()\\n keyFile := scnr.Text() + \\\".1tp_cpy\\\"\\n check(scnr.Err())\\n if _, err := os.Stat(keyFile); !os.IsNotExist(err) {\\n file, err := os.Open(keyFile)\\n check(err)\\n bytes, err := ioutil.ReadAll(file)\\n check(err)\\n file.Close()\\n keyLines := strings.Split(string(bytes), \\\"\\\\n\\\")\\n le := len(keyLines)\\n first := le\\n for i := 0; i < le; i++ {\\n if strings.HasPrefix(keyLines[i], \\\" \\\") {\\n first = i\\n break\\n }\\n }\\n if first == le {\\n fmt.Println(\\\"\\\\nThat file has no unused lines.\\\")\\n continue\\n }\\n keyLines2 := keyLines[first:] // get rid of comments and used lines\\n\\n encFile := keyFile[0:len(keyFile)-3] + \\\"enc\\\"\\n if _, err := os.Stat(encFile); !os.IsNotExist(err) {\\n file2, err := os.Open(encFile)\\n check(err)\\n bytes, err := ioutil.ReadAll(file2)\\n check(err)\\n file2.Close()\\n encLines := strings.Split(string(bytes), \\\"\\\\n\\\")[1:] // exclude comment line\\n nLines := len(encLines)\\n if len(keyLines2) >= nLines {\\n encrypted := toAlpha(strings.Join(encLines, \\\"\\\"))\\n key := toAlpha(strings.Join(keyLines2[0:nLines], \\\"\\\"))\\n decrypted := vigenere(encrypted, key, false)\\n decFile := keyFile[0:len(keyFile)-3] + \\\"dec\\\"\\n file3, err := os.Create(decFile)\\n check(err)\\n _, err = file3.WriteString(decrypted)\\n check(err)\\n file3.Close()\\n fmt.Printf(\\\"\\\\n'%s' has been created in the current directory.\\\\n\\\", decFile)\\n for i := first; i < first+nLines; i++ {\\n keyLines[i] = \\\"-\\\" + keyLines[i][1:]\\n }\\n file4, err := os.Create(keyFile)\\n check(err)\\n _, err = file4.WriteString(strings.Join(keyLines, \\\"\\\\n\\\"))\\n check(err)\\n file4.Close()\\n if demo {\\n fmt.Println(\\\"\\\\nThe contents of the decrypted file are :\\\\n\\\")\\n fmt.Println(decrypted)\\n }\\n }\\n } else {\\n fmt.Println(\\\"Not enough lines left in that file to do decryption.\\\")\\n }\\n } else {\\n fmt.Println(\\\"\\\\nThat file does not exist.\\\")\\n }\\n case 6: // Quit program\\n return\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"-- To compile into an executable:\\n-- ghc -main-is OneTimePad OneTimePad.hs\\n-- To run:\\n-- ./OneTimePad --help\\n\\nmodule OneTimePad (main) where\\n\\nimport Control.Monad\\nimport Data.Char\\nimport Data.Function (on)\\nimport qualified Data.Text as T\\nimport qualified Data.Text.IO as TI\\nimport Data.Time\\nimport System.Console.GetOpt\\nimport System.Environment\\nimport System.Exit\\nimport System.IO\\n\\n-- Command-line options parsing\\ndata Options = Options { optCommand :: String\\n , optInput :: IO T.Text\\n , optOutput :: T.Text -> IO ()\\n , optPad :: (IO T.Text, T.Text -> IO ())\\n , optLines :: Int\\n }\\n\\nstartOptions :: Options\\nstartOptions = Options { optCommand = \\\"decrypt\\\"\\n , optInput = TI.getContents\\n , optOutput = TI.putStr\\n , optPad = (TI.getContents, TI.putStr)\\n , optLines = 0\\n }\\n\\noptions :: [ OptDescr (Options -> IO Options) ]\\noptions =\\n [ Option \\\"e\\\" [\\\"encrypt\\\"]\\n (NoArg\\n (\\\\opt -> return opt { optCommand = \\\"encrypt\\\" }))\\n \\\"Encrypt file\\\"\\n , Option \\\"d\\\" [\\\"decrypt\\\"]\\n (NoArg\\n (\\\\opt -> return opt { optCommand = \\\"decrypt\\\" }))\\n \\\"Decrypt file (default)\\\"\\n , Option \\\"g\\\" [\\\"generate\\\"]\\n (NoArg\\n (\\\\opt -> return opt { optCommand = \\\"generate\\\" }))\\n \\\"Generate a one-time pad\\\"\\n , Option \\\"i\\\" [\\\"input\\\"]\\n (ReqArg\\n (\\\\arg opt -> return opt { optInput = TI.readFile arg })\\n \\\"FILE\\\")\\n \\\"Input file (for decryption and encryption)\\\"\\n , Option \\\"o\\\" [\\\"output\\\"]\\n (ReqArg\\n (\\\\arg opt -> return opt { optOutput = TI.writeFile arg })\\n \\\"FILE\\\")\\n \\\"Output file (for generation, decryption, and encryption)\\\"\\n , Option \\\"p\\\" [\\\"pad\\\"]\\n (ReqArg\\n (\\\\arg opt -> return opt { optPad = (TI.readFile arg,\\n TI.writeFile arg) })\\n \\\"FILE\\\")\\n \\\"One-time pad to use (for decryption and encryption)\\\"\\n , Option \\\"l\\\" [\\\"lines\\\"]\\n (ReqArg\\n (\\\\arg opt -> return opt { optLines = read arg :: Int })\\n \\\"LINES\\\")\\n \\\"New one-time pad's length (in lines of 48 characters) (for generation)\\\"\\n , Option \\\"V\\\" [\\\"version\\\"]\\n (NoArg\\n (\\\\_ -> do\\n hPutStrLn stderr \\\"Version 0.01\\\"\\n exitWith ExitSuccess))\\n \\\"Print version\\\"\\n , Option \\\"h\\\" [\\\"help\\\"]\\n (NoArg\\n (\\\\_ -> do\\n prg <- getProgName\\n putStrLn \\\"usage: OneTimePad [-h] [-V] [--lines LINES] [-i FILE] [-o FILE] [-p FILE] [--encrypt | --decrypt | --generate]\\\"\\n hPutStrLn stderr (usageInfo prg options)\\n exitWith ExitSuccess))\\n \\\"Show this help message and exit\\\"\\n ]\\n\\nmain :: IO ()\\nmain = do\\n args <- getArgs\\n let (actions, nonOptions, errors) = getOpt RequireOrder options args\\n opts <- Prelude.foldl (>>=) (return startOptions) actions\\n let Options { optCommand = command\\n , optInput = input\\n , optOutput = output\\n , optPad = (inPad, outPad)\\n , optLines = linecnt } = opts\\n\\n case command of\\n \\\"generate\\\" -> generate linecnt output\\n \\\"encrypt\\\" -> do\\n inputContents <- clean <$> input\\n padContents <- inPad\\n output $ format $ encrypt inputContents $ unformat $ T.concat\\n $ dropWhile (\\\\t -> T.head t == '-' || T.head t == '#')\\n $ T.lines padContents\\n \\\"decrypt\\\" -> do\\n inputContents <- unformat <$> input\\n padContents <- inPad\\n output $ decrypt inputContents $ unformat $ T.concat\\n $ dropWhile (\\\\t -> T.head t == '-' || T.head t == '#')\\n $ T.lines padContents\\n let discardLines = ceiling\\n $ ((/) `on` fromIntegral) (T.length inputContents) 48\\n outPad $ discard discardLines $ T.lines padContents\\n\\n{- | Discard used pad lines. Is only called at decryption to enable using the\\nsame pad file for both encryption and decryption.\\n-}\\ndiscard :: Int -> [T.Text] -> T.Text\\ndiscard 0 ts = T.unlines ts\\ndiscard x (t:ts) = if (T.head t == '-' || T.head t == '#')\\n then T.unlines [t, (discard x ts)]\\n else T.unlines [(T.append (T.pack \\\"- \\\") t), (discard (x-1) ts)]\\n\\n{- | Clean the text from symbols that cannot be encrypted.\\n-}\\nclean :: T.Text -> T.Text\\nclean = T.map toUpper . T.filter (\\\\c -> let oc = ord c\\n in oc >= 65 && oc <= 122\\n && (not $ oc >=91 && oc <= 96))\\n\\n{- | Format text (usually encrypted text) for pretty-printing it in a similar\\nway to the example from Wikipedia (see Rosetta Code page for this task)\\n-}\\nformat :: T.Text -> T.Text\\nformat = T.unlines . map (T.intercalate (T.pack \\\" \\\") . T.chunksOf 6)\\n . T.chunksOf 48\\n\\n{- | Unformat encrypted text, getting rid of characters that are irrelevant for\\ndecryption.\\n-}\\nunformat :: T.Text -> T.Text\\nunformat = T.filter (\\\\c -> c/='\\\\n' && c/=' ')\\n\\n{- | Generate a one-time pad and write it to file (specified as second\\nparameter). Note: this only works on operating systems that have the\\n\\\"/dev/random\\\" file.\\n-}\\ngenerate :: Int -> (T.Text -> IO ()) -> IO ()\\ngenerate lines output = do\\n withBinaryFile \\\"/dev/random\\\" ReadMode\\n (\\\\handle -> do\\n contents <- replicateM (48 * lines) $ hGetChar handle\\n time <- getCurrentTime\\n output\\n $ T.unlines [ T.pack\\n $ \\\"# OTP pad, generated by https://github.com/kssytsrk/one-time-pad on \\\"\\n ++ show time\\n , format $ T.pack\\n $ map (chr . (65 +) . flip mod 26 . ord) contents\\n ])\\n\\n-- Helper function for encryption/decryption.\\ncrypt :: (Int -> Int -> Int) -> T.Text -> T.Text -> T.Text\\ncrypt f = T.zipWith ((chr .) . f `on` ord)\\n\\n-- Encrypt first parameter's contents, using the second parameter as a key.\\nencrypt :: T.Text -> T.Text -> T.Text\\nencrypt = crypt ((((+65) . flip mod 26 . subtract 130) .) . (+))\\n\\n-- Decrypt first parameter's contents, using the second parameter as a key.\\ndecrypt :: T.Text -> T.Text -> T.Text\\ndecrypt = crypt ((((+65) . flip mod 26) .) . (-))\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require'convert/misc/vig convert/misc/ascii85'\\nrandseq=: {{ 2!:0'dd 2>/dev/null if=/dev/urandom count=1 bs=',\\\":y }}\\ngenpad=: {{ EMPTY [ (randseq y) fwrite x }}\\nencrypt=: {{ toascii85 (fread x) 0 vig a. y }}\\ndecrypt=: {{ (fread x) 1 vig a. fromascii85 y }}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 'example' genpad 1000\\n 'example' encrypt 'this is a test'\\nhc>*>I2nEB,6b#MdE;~>\\n\\n 'example' decrypt 'hc>*>I2nEB,6b#MdE;~>'\\nthis is a test\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.BufferedWriter;\\nimport java.io.FileReader;\\nimport java.io.FileWriter;\\nimport java.io.IOException;\\nimport java.util.Random;\\nimport java.util.regex.Matcher;\\nimport java.util.regex.Pattern;\\n\\npublic class OneTimePad {\\n\\n public static void main(String[] args) {\\n String controlName = \\\"AtomicBlonde\\\";\\n generatePad(controlName, 5, 60, 65, 90);\\n String text = \\\"IT WAS THE BEST OF TIMES IT WAS THE WORST OF TIMES\\\";\\n String encrypted = parse(true, controlName, text.replaceAll(\\\" \\\", \\\"\\\"));\\n String decrypted = parse(false, controlName, encrypted);\\n System.out.println(\\\"Input text = \\\" + text);\\n System.out.println(\\\"Encrypted text = \\\" + encrypted);\\n System.out.println(\\\"Decrypted text = \\\" + decrypted);\\n\\n controlName = \\\"AtomicBlondeCaseSensitive\\\";\\n generatePad(controlName, 5, 60, 32, 126);\\n text = \\\"It was the best of times, it was the worst of times.\\\";\\n encrypted = parse(true, controlName, text);\\n decrypted = parse(false, controlName, encrypted);\\n System.out.println();\\n System.out.println(\\\"Input text = \\\" + text);\\n System.out.println(\\\"Encrypted text = \\\" + encrypted);\\n System.out.println(\\\"Decrypted text = \\\" + decrypted);\\n }\\n\\n private static String parse(boolean encryptText, String controlName, String text) {\\n StringBuilder sb = new StringBuilder();\\n int minCh = 0;\\n int maxCh = 0;\\n Pattern minChPattern = Pattern.compile(\\\"^# MIN_CH = ([\\\\\\\\d]+)$\\\");\\n Pattern maxChPattern = Pattern.compile(\\\"^# MAX_CH = ([\\\\\\\\d]+)$\\\");\\n boolean validated = false;\\n try (BufferedReader in = new BufferedReader(new FileReader(getFileName(controlName))); ) {\\n String inLine = null;\\n while ( (inLine = in.readLine()) != null ) {\\n Matcher minMatcher = minChPattern.matcher(inLine);\\n if ( minMatcher.matches() ) {\\n minCh = Integer.parseInt(minMatcher.group(1));\\n continue;\\n }\\n Matcher maxMatcher = maxChPattern.matcher(inLine);\\n if ( maxMatcher.matches() ) {\\n maxCh = Integer.parseInt(maxMatcher.group(1));\\n continue;\\n }\\n if ( ! validated && minCh > 0 && maxCh > 0 ) {\\n validateText(text, minCh, maxCh);\\n validated = true;\\n }\\n // # is comment. - is used key.\\n if ( inLine.startsWith(\\\"#\\\") || inLine.startsWith(\\\"-\\\") ) {\\n continue;\\n }\\n // Have encryption key.\\n String key = inLine;\\n if ( encryptText ) {\\n for ( int i = 0 ; i < text.length(); i++) {\\n sb.append((char) (((text.charAt(i) - minCh + key.charAt(i) - minCh) % (maxCh - minCh + 1)) + minCh));\\n }\\n }\\n else {\\n for ( int i = 0 ; i < text.length(); i++) {\\n int decrypt = text.charAt(i) - key.charAt(i);\\n if ( decrypt < 0 ) {\\n decrypt += maxCh - minCh + 1;\\n }\\n decrypt += minCh;\\n sb.append((char) decrypt);\\n }\\n }\\n break;\\n }\\n } catch (IOException e) {\\n throw new RuntimeException(e);\\n }\\n return sb.toString();\\n }\\n\\n private static void validateText(String text, int minCh, int maxCh) {\\n // Validate text is in range\\n for ( char ch : text.toCharArray() ) {\\n if ( ch != ' ' && (ch < minCh || ch > maxCh) ) {\\n throw new IllegalArgumentException(\\\"ERROR 103: Invalid text.\\\");\\n }\\n }\\n\\n }\\n\\n private static String getFileName(String controlName) {\\n return controlName + \\\".1tp\\\";\\n }\\n\\n private static void generatePad(String controlName, int keys, int keyLength, int minCh, int maxCh) {\\n Random random = new Random();\\n try ( BufferedWriter writer = new BufferedWriter(new FileWriter(getFileName(controlName), false)); ) {\\n writer.write(\\\"# Lines starting with '#' are ignored.\\\");\\n writer.newLine();\\n writer.write(\\\"# Lines starting with '-' are previously used.\\\");\\n writer.newLine();\\n writer.write(\\\"# MIN_CH = \\\" + minCh);\\n writer.newLine();\\n writer.write(\\\"# MAX_CH = \\\" + maxCh);\\n writer.newLine();\\n for ( int line = 0 ; line < keys ; line++ ) {\\n StringBuilder sb = new StringBuilder();\\n for ( int ch = 0 ; ch < keyLength ; ch++ ) {\\n sb.append((char) (random.nextInt(maxCh - minCh + 1) + minCh));\\n }\\n writer.write(sb.toString());\\n writer.newLine();\\n }\\n writer.write(\\\"# EOF\\\");\\n writer.newLine();\\n } catch (Exception e) {\\n throw new RuntimeException(e);\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// version 1.2.31\\n\\nimport java.io.File\\nimport java.security.SecureRandom\\n\\nconst val CHARS_PER_LINE = 48\\nconst val CHUNK_SIZE = 6\\nconst val COLS = 8\\nconst val DEMO = true // would normally be set to false\\n\\nenum class FileType { OTP, ENC, DEC }\\n\\nfun Char.isAlpha() = this in 'A'..'Z'\\n\\nfun String.toAlpha() = this.filter { it.isAlpha() }\\n\\nfun String.isOtpRelated() = endsWith(\\\".1tp\\\") || endsWith(\\\".1tp_cpy\\\") ||\\n endsWith(\\\".1tp_enc\\\") || endsWith(\\\".1tp_dec\\\")\\n\\nfun makePad(nLines: Int): String {\\n val nChars = nLines * CHARS_PER_LINE\\n val sr = SecureRandom()\\n val sb = StringBuilder(nChars)\\n /* generate random upper case letters */\\n for (i in 0 until nChars) sb.append((sr.nextInt(26) + 65).toChar())\\n return sb.toString().inChunks(nLines, FileType.OTP)\\n}\\n\\nfun vigenere(text: String, key: String, encrypt: Boolean = true): String {\\n val sb = StringBuilder(text.length)\\n for ((i, c) in text.withIndex()) {\\n val ci = if (encrypt)\\n (c.toInt() + key[i].toInt() - 130) % 26\\n else\\n (c.toInt() - key[i].toInt() + 26) % 26\\n sb.append((ci + 65).toChar())\\n }\\n val temp = sb.length % CHARS_PER_LINE\\n if (temp > 0) { // pad with random characters so each line is a full one\\n val sr = SecureRandom()\\n for (i in temp until CHARS_PER_LINE) sb.append((sr.nextInt(26) + 65).toChar())\\n }\\n val ft = if (encrypt) FileType.ENC else FileType.DEC\\n return sb.toString().inChunks(sb.length / CHARS_PER_LINE, ft)\\n}\\n\\nfun String.inChunks(nLines: Int, ft: FileType): String {\\n val chunks = this.chunked(CHUNK_SIZE)\\n val sb = StringBuilder(this.length + nLines * (COLS + 1))\\n for (i in 0 until nLines) {\\n val j = i * COLS\\n sb.append(\\\" ${chunks.subList(j, j + COLS).joinToString(\\\" \\\")}\\\\n\\\")\\n }\\n val s = \\\" file\\\\n\\\" + sb.toString()\\n return when (ft) {\\n FileType.OTP -> \\\"# OTP\\\" + s\\n FileType.ENC -> \\\"# Encrypted\\\" + s\\n FileType.DEC -> \\\"# Decrypted\\\" + s\\n }\\n}\\n\\nfun menu(): Int {\\n println(\\\"\\\"\\\"\\n |\\n |1. Create one time pad file.\\n |\\n |2. Delete one time pad file.\\n |\\n |3. List one time pad files.\\n |\\n |4. Encrypt plain text.\\n |\\n |5. Decrypt cipher text.\\n |\\n |6. Quit program.\\n |\\n \\\"\\\"\\\".trimMargin())\\n var choice: Int?\\n do {\\n print(\\\"Your choice (1 to 6) : \\\")\\n choice = readLine()!!.toIntOrNull()\\n }\\n while (choice == null || choice !in 1..6)\\n return choice\\n}\\n\\nfun main(args: Array<String>) {\\n mainLoop@ while (true) {\\n val choice = menu()\\n println()\\n when (choice) {\\n 1 -> { // Create OTP\\n println(\\\"Note that encrypted lines always contain 48 characters.\\\\n\\\")\\n print(\\\"OTP file name to create (without extension) : \\\")\\n val fileName = readLine()!! + \\\".1tp\\\"\\n var nLines: Int?\\n\\n do {\\n print(\\\"Number of lines in OTP (max 1000) : \\\")\\n nLines = readLine()!!.toIntOrNull()\\n }\\n while (nLines == null || nLines !in 1..1000)\\n\\n val key = makePad(nLines)\\n File(fileName).writeText(key)\\n println(\\\"\\\\n'$fileName' has been created in the current directory.\\\")\\n if (DEMO) {\\n // a copy of the OTP file would normally be on a different machine\\n val fileName2 = fileName + \\\"_cpy\\\" // copy for decryption\\n File(fileName2).writeText(key)\\n println(\\\"'$fileName2' has been created in the current directory.\\\")\\n println(\\\"\\\\nThe contents of these files are :\\\\n\\\")\\n println(key)\\n }\\n }\\n\\n 2 -> { // Delete OTP\\n println(\\\"Note that this will also delete ALL associated files.\\\\n\\\")\\n print(\\\"OTP file name to delete (without extension) : \\\")\\n val toDelete1 = readLine()!! + \\\".1tp\\\"\\n val toDelete2 = toDelete1 + \\\"_cpy\\\"\\n val toDelete3 = toDelete1 + \\\"_enc\\\"\\n val toDelete4 = toDelete1 + \\\"_dec\\\"\\n val allToDelete = listOf(toDelete1, toDelete2, toDelete3, toDelete4)\\n var deleted = 0\\n println()\\n for (name in allToDelete) {\\n val f = File(name)\\n if (f.exists()) {\\n f.delete()\\n deleted++\\n println(\\\"'$name' has been deleted from the current directory.\\\")\\n }\\n }\\n if (deleted == 0) println(\\\"There are no files to delete.\\\")\\n }\\n\\n 3 -> { // List OTPs\\n println(\\\"The OTP (and related) files in the current directory are:\\\\n\\\")\\n val otpFiles = File(\\\".\\\").listFiles().filter {\\n it.isFile() && it.name.isOtpRelated()\\n }.map { it.name }.toMutableList()\\n otpFiles.sort()\\n println(otpFiles.joinToString(\\\"\\\\n\\\"))\\n }\\n\\n 4 -> { // Encrypt\\n print(\\\"OTP file name to use (without extension) : \\\")\\n val keyFile = readLine()!! + \\\".1tp\\\"\\n val kf = File(keyFile)\\n if (kf.exists()) {\\n val lines = File(keyFile).readLines().toMutableList()\\n var first = lines.size\\n for (i in 0 until lines.size) {\\n if (lines[i].startsWith(\\\" \\\")) {\\n first = i\\n break\\n }\\n }\\n if (first == lines.size) {\\n println(\\\"\\\\nThat file has no unused lines.\\\")\\n continue@mainLoop\\n }\\n val lines2 = lines.drop(first) // get rid of comments and used lines\\n\\n println(\\\"Text to encrypt :-\\\\n\\\")\\n val text = readLine()!!.toUpperCase().toAlpha()\\n val len = text.length\\n var nLines = len / CHARS_PER_LINE\\n if (len % CHARS_PER_LINE > 0) nLines++\\n\\n if (lines2.size >= nLines) {\\n val key = lines2.take(nLines).joinToString(\\\"\\\").toAlpha()\\n val encrypted = vigenere(text, key)\\n val encFile = keyFile + \\\"_enc\\\"\\n File(encFile).writeText(encrypted)\\n println(\\\"\\\\n'$encFile' has been created in the current directory.\\\")\\n for (i in first until first + nLines) {\\n lines[i] = \\\"-\\\" + lines[i].drop(1)\\n }\\n File(keyFile).writeText(lines.joinToString(\\\"\\\\n\\\"))\\n if (DEMO) {\\n println(\\\"\\\\nThe contents of the encrypted file are :\\\\n\\\")\\n println(encrypted)\\n }\\n }\\n else println(\\\"Not enough lines left in that file to do encryption\\\")\\n }\\n else println(\\\"\\\\nThat file does not exist.\\\")\\n }\\n\\n 5 -> { // Decrypt\\n print(\\\"OTP file name to use (without extension) : \\\")\\n val keyFile = readLine()!! + \\\".1tp_cpy\\\"\\n val kf = File(keyFile)\\n if (kf.exists()) {\\n val keyLines = File(keyFile).readLines().toMutableList()\\n var first = keyLines.size\\n for (i in 0 until keyLines.size) {\\n if (keyLines[i].startsWith(\\\" \\\")) {\\n first = i\\n break\\n }\\n }\\n if (first == keyLines.size) {\\n println(\\\"\\\\nThat file has no unused lines.\\\")\\n continue@mainLoop\\n }\\n val keyLines2 = keyLines.drop(first) // get rid of comments and used lines\\n\\n val encFile = keyFile.dropLast(3) + \\\"enc\\\"\\n val ef = File(encFile)\\n if (ef.exists()) {\\n val encLines = File(encFile).readLines().drop(1) // exclude comment line\\n val nLines = encLines.size\\n if (keyLines2.size >= nLines) {\\n val encrypted = encLines.joinToString(\\\"\\\").toAlpha()\\n val key = keyLines2.take(nLines).joinToString(\\\"\\\").toAlpha()\\n val decrypted = vigenere(encrypted, key, false)\\n val decFile = keyFile.dropLast(3) + \\\"dec\\\"\\n File(decFile).writeText(decrypted)\\n println(\\\"\\\\n'$decFile' has been created in the current directory.\\\")\\n for (i in first until first + nLines) {\\n keyLines[i] = \\\"-\\\" + keyLines[i].drop(1)\\n }\\n File(keyFile).writeText(keyLines.joinToString(\\\"\\\\n\\\"))\\n if (DEMO) {\\n println(\\\"\\\\nThe contents of the decrypted file are :\\\\n\\\")\\n println(decrypted)\\n }\\n }\\n else println(\\\"Not enough lines left in that file to do decryption\\\")\\n }\\n else println(\\\"\\\\n'$encFile' is missing.\\\")\\n }\\n else println(\\\"\\\\nThat file does not exist.\\\")\\n }\\n\\n else -> return // Quit\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import os, re, sequtils, strformat, strutils\\nimport nimcrypto\\n\\n# One-time pad file signature.\\nconst Magic = \\\"#one-time pad\\\"\\n\\n# Suffix for pad files.\\nconst Suffix = \\\".1tp\\\"\\n\\nproc log(msg: string) =\\n ## Log a message.\\n stderr.write msg\\n stderr.write '\\\\n'\\n\\nproc makeKeys(n, size: Positive): seq[string] =\\n ## Generate \\\"n\\\" secure, random keys of \\\"size\\\" bytes.\\n\\n # We're generating and storing keys in their hexadecimal form to make\\n # one-time pad files a little more human readable and to ensure a key\\n # can not start with a hyphen.\\n var bytes = newSeq[byte](size)\\n for _ in 1..n:\\n if randomBytes(bytes) != size:\\n raise newException(ValueError, \\\"unable to build keys.\\\")\\n result.add bytes.mapIt(it.toHex).join()\\n\\nproc makePad(name: string; padSize, keySize: Positive): string =\\n ## Create a new one-time pad identified by the given name.\\n ## Args:\\n ## name: unique one-time pad identifier.\\n ## padSize: the number of keys (or pages) in the pad.\\n ## keySize: the number of bytes per key.\\n ## Returns:\\n ## the new one-time pad as a string.\\n\\n let pad = @[Magic, &\\\"#name={name}\\\", &\\\"#size={padSize}\\\"] & makeKeys(padSize, keySize)\\n result = pad.join(\\\"\\\\n\\\")\\n\\nproc `xor`(message, key: string): string =\\n ## Return \\\"message\\\" XOR-ed with \\\"key\\\".\\n ##\\n ## Args:\\n ## message: plaintext or cyphertext to be encrypted or decrypted.\\n ## key: encryption and decryption key.\\n ## Returns:\\n ## plaintext or cyphertext as a string.\\n\\n if key.len < message.len:\\n quit(\\\"Key size is too short to encrypt/decrypt the message.\\\", QuitFailure)\\n result = newStringOfCap(message.len)\\n var keyIndex = 0\\n for msgChar in message:\\n result.add chr(ord(msgChar) xor ord(key[keyIndex]))\\n inc keyIndex\\n\\nproc useKey(pad: var string): string =\\n ## Use the next available key from the given one-time pad.\\n ##\\n ## Args:\\n ## pad: a one-time pad, updated.\\n ## Returns:\\n ## the key.\\n\\n var matches: array[1, string]\\n let pos = pad.find(re\\\"(?m)(^[A-F0-9]+$)\\\", matches)\\n if pos < 0:\\n quit(\\\"Pad is all used up.\\\", QuitFailure)\\n\\n pad.insert(\\\"-\\\", pos)\\n result = matches[0]\\n\\nproc writePad(path: string; padSize, keySize: Positive) =\\n ## Write a new one-time pad to the given path.\\n ##\\n ## Args:\\n ## path: path to write one-time pad to.\\n ## padSize: the number of keys (or pages) in the pad.\\n ## keySize: the number of bytes per key.\\n\\n if fileExists(path):\\n quit(\\\"Pad \\\" & path & \\\" already exists\\\", QuitFailure)\\n try:\\n path.writeFile(makePad(path.extractFilename(), padSize, keySize))\\n except IOError:\\n quit(\\\"Unable to write file \\\" & path, QuitFailure)\\n log(\\\"New one-time pad written to \\\" & path)\\n\\nproc process(pad, message: string; outfile: File) =\\n ## Encrypt or decrypt \\\"message\\\" using the given pad.\\n ##\\n ## Args:\\n ## pad: path to one-time pad.\\n ## message: plaintext or ciphertext message to encrypt or decrypt.\\n ## outfile: file-like object to write to.\\n\\n if not fileExists(pad):\\n quit(\\\"No such pad: \\\" & pad, QuitFailure)\\n let start = pad.readLines(1)\\n if start.len == 0 or start[0] != Magic:\\n quit(&\\\"file '{pad}' does not look like a one-time pad\\\", QuitFailure)\\n\\n # Rewrites the entire one-time pad every time\\n var padData = pad.readFile()\\n let key = padData.useKey().parseHexStr()\\n pad.writeFile(padData)\\n\\n outfile.write(message xor key)\\n\\n\\nwhen isMainModule:\\n\\n import parseopt\\n\\n proc printUsage() =\\n echo \\\"Usage: \\\", getAppFilename().lastPathPart,\\n \\\" [-h] [--length LENGTH] [--key-size KEY_SIZE] [-o OUTFILE]\\\"\\n echo \\\" [--encrypt FILE | --decrypt FILE] pad\\\"\\n echo \\\"\\\"\\n echo \\\"\\\"\\\"One-time pad.\\n\\npositional arguments:\\n pad Path to one-time pad. If neither --encrypt or --decrypt\\n are given, will create a new pad.\\n\\noptional arguments:\\n -h, --help show this help message and exit\\n --length LENGTH Pad size. Ignored if --encrypt or --decrypt are given.\\n Defaults to 10.\\n --key-size KEY_SIZE Key size in bytes. Ignored if --encrypt or --decrypt\\n are given. Defaults to 64.\\n --outfile OUTFILE Write encoded/decoded message to a file. Ignored if\\n --encrypt or --decrypt is not given. Defaults to\\n stdout.\\n --encrypt FILE Encrypt FILE using the next available key from pad.\\n --decrypt FILE Decrypt FILE using the next available key from pad.\\n \\\"\\\"\\\"\\n\\n var\\n parser = initOptParser(shortNoVal = {'h'}, longNoval = @[\\\"help\\\"])\\n padPath: string\\n length = 10\\n outpath = \\\"\\\"\\n encryptPath = \\\"\\\"\\n decryptPath = \\\"\\\"\\n keySize = 64\\n encrypt = false\\n decrypt = false\\n\\n for kind, key, val in parser.getopt():\\n case kind\\n\\n of cmdShortOption:\\n printUsage()\\n if key != \\\"h\\\":\\n quit(\\\"Wrong option: \\\" & key, QuitFailure)\\n elif val.len != 0:\\n quit(\\\"Wrong value for option -h\\\", QuitFailure)\\n else:\\n quit(QuitSuccess)\\n\\n of cmdLongOption:\\n case key\\n\\n of \\\"help\\\":\\n printUsage()\\n quit(QuitSuccess)\\n\\n of \\\"length\\\":\\n try:\\n length = parseInt(val)\\n if length < 2: raise newException(ValueError, \\\"\\\")\\n except ValueError:\\n quit(\\\"Wrong length: \\\" & val, QuitFailure)\\n\\n of \\\"encrypt\\\":\\n encryptPath = val\\n encrypt = true\\n\\n of \\\"decrypt\\\":\\n decryptPath = val\\n decrypt = true\\n\\n of \\\"outfile\\\":\\n outPath = val\\n\\n of \\\"key-size\\\":\\n try:\\n keySize = parseInt(val)\\n if length < 2: raise newException(ValueError, \\\"\\\")\\n except ValueError:\\n quit(\\\"Wrong key size: \\\" & val, QuitFailure)\\n\\n else:\\n quit(\\\"Invalid option: \\\" & key, QuitFailure)\\n\\n of cmdArgument:\\n padPath = if key.endsWith(Suffix): key else: key & Suffix\\n\\n of cmdEnd:\\n discard # Cannot not occur.\\n\\n if padPath.len == 0:\\n quit(\\\"Missing pad file.\\\", QuitFailure)\\n\\n if encrypt and decrypt:\\n quit(\\\"Incompatible options: encrypt and decrypt\\\", QuitFailure)\\n\\n if encrypt or decrypt:\\n\\n var outfile: File\\n if outpath.len == 0:\\n outfile = stdout\\n else:\\n try:\\n outfile = outpath.open(fmWrite)\\n except IOError:\\n quit(\\\"Unable to open output file.\\\", QuitFailure)\\n\\n let message = try:\\n if encrypt: encryptPath.readFile()\\n else: decryptPath.readFile()\\n except IOError:\\n quit(\\\"Unable to open file to encrypt or decrypt.\\\", QuitFailure)\\n\\n padPath.process(message, outfile)\\n if outfile != stdout: outfile.close()\\n\\n else:\\n padPath.writePad(length, keySize)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"# 20200814 added Perl programming solution\\n\\nuse strict;\\nuse warnings;\\n\\nuse Crypt::OTP;\\nuse Bytes::Random::Secure qw( random_bytes );\\n\\nprint \\\"Message : \\\", my $message = \\\"show me the monKey\\\", \\\"\\\\n\\\";\\n\\nmy $otp = random_bytes(length $message);\\nprint \\\"Ord(OTP) : \\\", ( map { ord($_).' ' } (split //, $otp) ) , \\\"\\\\n\\\";\\n\\nmy $cipher = OTP( $otp, $message, 1 );\\nprint \\\"Ord(Cipher) : \\\", ( map { ord($_).' ' } (split //, $cipher) ) , \\\"\\\\n\\\";\\n\\nprint \\\"Decoded : \\\", OTP( $otp, $cipher, 1 ), \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"\\\"\\\"\\\"One-time pad using an XOR cipher. Requires Python >=3.6.\\\"\\\"\\\"\\n\\nimport argparse\\nimport itertools\\nimport pathlib\\nimport re\\nimport secrets\\nimport sys\\n\\n# One-time pad file signature.\\nMAGIC = \\\"#one-time pad\\\"\\n\\n\\ndef make_keys(n, size):\\n \\\"\\\"\\\"Generate ``n`` secure, random keys of ``size`` bytes.\\\"\\\"\\\"\\n # We're generating and storing keys in their hexadecimal form to make\\n # one-time pad files a little more human-readable and to ensure a key\\n # can not start with a hyphen.\\n return (secrets.token_hex(size) for _ in range(n))\\n\\n\\ndef make_pad(name, pad_size, key_size):\\n \\\"\\\"\\\"Create a new one-time pad identified by the given name.\\n\\n Args:\\n name (str): Unique one-time pad identifier.\\n pad_size (int): The number of keys (or pages) in the pad.\\n key_size (int): The number of bytes per key.\\n Returns:\\n The new one-time pad as a string.\\n \\\"\\\"\\\"\\n pad = [\\n MAGIC,\\n f\\\"#name={name}\\\",\\n f\\\"#size={pad_size}\\\",\\n *make_keys(pad_size, key_size),\\n ]\\n\\n return \\\"\\\\n\\\".join(pad)\\n\\n\\ndef xor(message, key):\\n \\\"\\\"\\\"Return ``message`` XOR-ed with ``key``.\\n\\n Args:\\n message (bytes): Plaintext or cyphertext to be encrypted or decrypted.\\n key (bytes): Encryption and decryption key.\\n Returns:\\n Plaintext or cyphertext as a byte string.\\n \\\"\\\"\\\"\\n return bytes(mc ^ kc for mc, kc in zip(message, itertools.cycle(key)))\\n\\n\\ndef use_key(pad):\\n \\\"\\\"\\\"Use the next available key from the given one-time pad.\\n\\n Args:\\n pad (str): A one-time pad.\\n Returns:\\n (str, str) A two-tuple of updated pad and key.\\n \\\"\\\"\\\"\\n match = re.search(r\\\"^[a-f0-9]+$\\\", pad, re.MULTILINE)\\n if not match:\\n error(\\\"pad is all used up\\\")\\n\\n key = match.group()\\n pos = match.start()\\n\\n return (f\\\"{pad[:pos]}-{pad[pos:]}\\\", key)\\n\\n\\ndef log(msg):\\n \\\"\\\"\\\"Log a message.\\\"\\\"\\\"\\n sys.stderr.write(msg)\\n sys.stderr.write(\\\"\\\\n\\\")\\n\\n\\ndef error(msg):\\n \\\"\\\"\\\"Exit with an error message.\\\"\\\"\\\"\\n sys.stderr.write(msg)\\n sys.stderr.write(\\\"\\\\n\\\")\\n sys.exit(1)\\n\\n\\ndef write_pad(path, pad_size, key_size):\\n \\\"\\\"\\\"Write a new one-time pad to the given path.\\n\\n Args:\\n path (pathlib.Path): Path to write one-time pad to.\\n pad_size (int): The number of keys (or pages) in the pad.\\n key_size (int): The number of bytes per key.\\n \\\"\\\"\\\"\\n if path.exists():\\n error(f\\\"pad '{path}' already exists\\\")\\n\\n with path.open(\\\"w\\\") as fd:\\n fd.write(make_pad(path.name, pad_size, key_size))\\n\\n log(f\\\"New one-time pad written to {path}\\\")\\n\\n\\ndef main(pad, message, outfile):\\n \\\"\\\"\\\"Encrypt or decrypt ``message`` using the given pad.\\n\\n Args:\\n pad (pathlib.Path): Path to one-time pad.\\n message (bytes): Plaintext or ciphertext message to encrypt or decrypt.\\n outfile: File-like object to write to.\\n \\\"\\\"\\\"\\n if not pad.exists():\\n error(f\\\"no such pad '{pad}'\\\")\\n\\n with pad.open(\\\"r\\\") as fd:\\n if fd.readline().strip() != MAGIC:\\n error(f\\\"file '{pad}' does not look like a one-time pad\\\")\\n\\n # Rewrites the entire one-time pad every time\\n with pad.open(\\\"r+\\\") as fd:\\n updated, key = use_key(fd.read())\\n\\n fd.seek(0)\\n fd.write(updated)\\n\\n outfile.write(xor(message, bytes.fromhex(key)))\\n\\n\\nif __name__ == \\\"__main__\\\":\\n # Command line interface\\n parser = argparse.ArgumentParser(description=\\\"One-time pad.\\\")\\n\\n parser.add_argument(\\n \\\"pad\\\",\\n help=(\\n \\\"Path to one-time pad. If neither --encrypt or --decrypt \\\"\\n \\\"are given, will create a new pad.\\\"\\n ),\\n )\\n\\n parser.add_argument(\\n \\\"--length\\\",\\n type=int,\\n default=10,\\n help=\\\"Pad size. Ignored if --encrypt or --decrypt are given. Defaults to 10.\\\",\\n )\\n\\n parser.add_argument(\\n \\\"--key-size\\\",\\n type=int,\\n default=64,\\n help=\\\"Key size in bytes. Ignored if --encrypt or --decrypt are given. Defaults to 64.\\\",\\n )\\n\\n parser.add_argument(\\n \\\"-o\\\",\\n \\\"--outfile\\\",\\n type=argparse.FileType(\\\"wb\\\"),\\n default=sys.stdout.buffer,\\n help=(\\n \\\"Write encoded/decoded message to a file. Ignored if --encrypt or \\\"\\n \\\"--decrypt is not given. Defaults to stdout.\\\"\\n ),\\n )\\n\\n group = parser.add_mutually_exclusive_group()\\n\\n group.add_argument(\\n \\\"--encrypt\\\",\\n metavar=\\\"FILE\\\",\\n type=argparse.FileType(\\\"rb\\\"),\\n help=\\\"Encrypt FILE using the next available key from pad.\\\",\\n )\\n group.add_argument(\\n \\\"--decrypt\\\",\\n metavar=\\\"FILE\\\",\\n type=argparse.FileType(\\\"rb\\\"),\\n help=\\\"Decrypt FILE using the next available key from pad.\\\",\\n )\\n\\n args = parser.parse_args()\\n\\n if args.encrypt:\\n message = args.encrypt.read()\\n elif args.decrypt:\\n message = args.decrypt.read()\\n else:\\n message = None\\n\\n # Sometimes necessary if message came from stdin\\n if isinstance(message, str):\\n message = message.encode()\\n\\n pad = pathlib.Path(args.pad).with_suffix(\\\".1tp\\\")\\n\\n if message:\\n main(pad, message, args.outfile)\\n else:\\n write_pad(pad, args.length, args.key_size)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"sub MAIN {\\n put \\\"Generate data for one time pad encryption.\\\\n\\\" ~\\n \\\"File will have .1tp extension.\\\";\\n my $fn;\\n loop {\\n $fn = prompt 'Filename for one time pad data: ';\\n if $fn !~~ /'.1tp' $/ { $fn ~= '.1tp' }\\n if $fn.IO.e {\\n my $ow = prompt \\\"$fn aready exists, over-write? y/[n] \\\";\\n last if $ow ~~ m:i/'y'/;\\n redo;\\n }\\n last;\\n }\\n\\n put 'Each line will contain 48 characters of encyption data.';\\n my $lines = prompt 'How many lines of data to generate? [1000] ';\\n $lines ||= 1000;\\n generate($fn, $lines);\\n say \\\"One-time-pad data saved to: \\\", $fn.IO.absolute;\\n\\n sub generate ( $fn, $lines) {\\n use Crypt::Random;\\n $fn.IO.spurt: \\\"# one-time-pad encryption data\\\\n\\\" ~\\n ((sprintf(\\\" %s %s %s %s %s %s %s %s\\\\n\\\",\\n ((('A'..'Z')[crypt_random_uniform(26)] xx 6).join) xx 8))\\n xx $lines).join;\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub s2v ($s) { $s.uc.comb(/ <[ A..Z ]> /)».ord »-» 65 }\\nsub v2s (@v) { (@v »%» 26 »+» 65)».chr.join }\\n\\nsub hide ($secret, $otp) { v2s(s2v($secret) »+» s2v($otp)) }\\nsub reveal ($hidden, $otp) { v2s(s2v($hidden) »-» s2v($otp)) }\\n\\nsub otp-data ($fn, $lines) {\\n my $fh = $fn.IO.open :rw;\\n my $data;\\n my $count = 0;\\n repeat {\\n my $pos = $fh.tell;\\n my $line = $fh.get;\\n if $line.substr(0,1) ne '-'|'#' {\\n $data ~= $line;\\n $fh.seek($pos);\\n $fh.put: '-' ~ $line.substr(1);\\n $count++;\\n }\\n } until $count == $lines or $fh.eof;\\n note \\\"Insufficient lines of data remaining in $fn\\\" if $count != $lines;\\n $data;\\n}\\n\\nsub otp-size (Str $string) { ceiling $string.uc.comb(/ <[ A..Z ]> /) / 48 }\\n\\nsub otp-encrypt ( $secret, $fn ) {\\n my $otp-size = otp-size $secret;\\n my $otp-data = otp-data($fn, $otp-size);\\n my $encrypted = hide $secret, $otp-data;\\n # pad encryted text out to a full line with random text\\n $encrypted ~= ('A'..'Z').roll while $encrypted.chars % 48;\\n join \\\"\\\\n\\\", $encrypted.comb(6).rotor(8, :partial).map:\\n { sprintf \\\"{ join ' ', \\\"%s\\\" xx $_ }\\\", $_ };\\n}\\n\\nsub otp-decrypt ( $secret, $fn ) {\\n my $otp-size = otp-size $secret;\\n my $otp-data = otp-data($fn, $otp-size);\\n my $plain-text = reveal $secret, $otp-data;\\n join \\\"\\\\n\\\", $plain-text.comb(6).rotor(8, :partial).map:\\n { sprintf \\\"{ join ' ', \\\"%s\\\" xx $_ }\\\", $_ };\\n}\\n\\nmy $otp-encrypt-fn = 'rosettacode.1tp';\\nmy $otp-decrypt-fn = 'rosettacopy.1tp';\\n\\nmy $secret = \\\"Beware the Jabberwock, my son! The jaws that bite, the claws that catch!\\\";\\n\\nsay \\\"Secret:\\\\n$secret\\\\n\\\\nEncrypted:\\\";\\nsay my $encrypted = otp-encrypt $secret, $otp-encrypt-fn;\\nsay \\\"\\\\nDecrypted:\\\\n\\\", otp-decrypt $encrypted, $otp-decrypt-fn;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"puts \\\"# True random chars for one-time pad\\\"\\n\\nproc randInt { min max } {\\n set randDev [open /dev/urandom rb]\\n set random [read $randDev 8]\\n binary scan $random H16 random\\n set random [expr {([scan $random %x] % (($max-$min) + 1) + $min)}]\\n close $randDev\\n return $random\\n}\\n\\nproc randStr { sLen grp alfa } {\\n set aLen [string length $alfa]; incr aLen -1\\n set rs \\\"\\\"\\n for {set i 0} {$i < $sLen} {incr i} {\\n if { [expr {$i % $grp} ] == 0} { append rs \\\" \\\" }\\n set r [randInt 0 $aLen]\\n set char [string index $alfa $r]\\n append rs $char\\n ##puts \\\"$i: $r $char\\\"\\n }\\n return $rs\\n}\\n\\nset alfa \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nset len 48\\nset lines 4\\nset fn \\\"test.1tp\\\"\\n\\n# Write file:\\nset fh [open $fn w]\\nputs $fh \\\"# OTP\\\"\\nfor {set ln 0} {$ln < $lines} {incr ln} {\\n set line [randStr $len 6 $alfa]\\n ##puts \\\"$ln :$line.\\\"\\n puts $fh $line\\n}\\nclose $fh\\n\\n# Read file:\\nputs \\\"# File $fn:\\\"\\nset fh [open $fn]\\nputs [read $fh [file size $fn]]\\nclose $fh\\n\\nputs \\\"# Done.\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/usr/bin/env node\\nimport { writeFileSync, existsSync, readFileSync, unlinkSync } from 'node:fs';\\n//https://www.elitizon.com/2021/01-09-how-to-create-a-cli-command-with-typescript/#:~:text=%20Boost%20your%20productivity%20by%20creating%20your%20own,information.%20Required%3A%20string.%20%20...%20%20More%20\\n\\nconst a:string[] = process.argv;\\nconst argv:string[] = a.splice(2)\\n/**\\n * Extension of the pad files\\n */\\nconst padExtension:string = \\\".1tp\\\";\\n/**\\n * Extension of the key generated\\n */\\nconst keyExtension:string = \\\".key\\\";\\n/**\\n * Array of commands usable\\n */\\nconst commands:string[] = [\\\"--generate\\\", \\\"--encrypt\\\",\\\"--decrypt\\\"];\\n/**\\n * The alphabet\\n */\\nconst stringLetter = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n\\n\\n/**\\n * Main function\\n */\\nconst main = ():void => {\\n // if no args have been give display help\\n if(argv.length == 0){\\n help();\\n return;\\n }\\n\\n // Check if there is a command in the file\\n if(commands.includes(argv[0])){\\n let choise = argv[0].trim().toLowerCase();\\n if(choise === \\\"--generate\\\"){\\n console.log(\\\"Generating action chosen\\\");\\n\\n // Check if the arguments have been given to generate a new key\\n if(!argv[1]){\\n (\\\"Pad name not specified\\\")\\n help();\\n return;\\n }\\n\\n // Check if the length of the filename is at least 4 characters\\n if(argv[1].length <= 3){\\n console.log(\\\"The name of the pad should be at least 4 letters long\\\");\\n help();\\n return;\\n }\\n\\n // Check if the filesize is a number(should be the second argv)\\n let fileSize = +argv[2];\\n if(isNaN(fileSize)){\\n console.log(\\\"File size should be a number\\\");\\n help();\\n return\\n }\\n\\n createFile(argv[1], fileSize)\\n }\\n\\n // If the selected action is to encrypt\\n if( choise === \\\"--encrypt\\\"){\\n console.log(\\\"Encrypting action chosen\\\");\\n let padDataName = argv[2] ? `${argv[2].trim()}${padExtension}` : `${argv[1].trim()}${padExtension}`\\n\\n // Check if the files exist\\n if(!argv[1] && !argv[2]){\\n console.log(\\\"Parameters not given\\\");\\n help();\\n return;\\n }\\n\\n // Check if the text file exists and the pad file\\n if(!existsSync(`${argv[1].trim().toLowerCase()}.txt`)){\\n console.log(\\\"Text file doesn't exit\\\");\\n help();\\n return;\\n }\\n\\n console.log(\\\"Reading file\\\")\\n // Get the data from the file as well as the data from the padfile\\n let fileDataEnc = readFileSync(`${argv[1].trim().toLowerCase()}.txt`, 'utf-8');\\n\\n if(!existsSync(`${argv[2]}${padExtension}`)){\\n console.log(\\\"1tp file doesn't exist, generating new 1pt file\\\");\\n createFile(argv[1], fileDataEnc.length);\\n }\\n\\n console.log(\\\"Reading 1pt file\\\");\\n // Get the pad data\\n let padDataEnc = RetrievePadData(padDataName);\\n\\n // if the file 1pt file has been specified but it's not big enough\\n if(fileDataEnc.length > padDataEnc.length){\\n console.log(\\\"The file is bigger than the 1tp file. Generating a new padfile\\\");\\n createFile(argv[1], fileDataEnc.length);\\n padDataEnc = RetrievePadData(`${argv[1]}${padExtension}`)\\n }\\n\\n console.log(\\\"Converting the file\\\");\\n let keyEnc = padFunction(fileDataEnc,padDataEnc);\\n createFile(`${argv[1]}.key`, keyEnc.length, false, keyEnc);\\n\\n }\\n\\n\\n if(choise === \\\"--decrypt\\\"){\\n console.log(\\\"Decrypting action chosen\\\");\\n\\n // Check if the necessary args were given\\n if(!argv[1]){\\n console.log(\\\"No file specified For decryption specified\\\")\\n return;\\n }\\n if(!argv[2]){\\n console.log(\\\"No 1pt file was given, Please specify the file to use\\\");\\n return;\\n }\\n if(!argv[3] || argv[3].trim() != '-o') {\\n console.log(\\\"No file for output specified\\\");\\n }\\n\\n\\n let fileNameDec = `${argv[1].trim()}${keyExtension}`;\\n let padNameDec = `${argv[2].trim()}${padExtension}`;\\n\\n // Check if the files exists or not\\n if(!existsSync(fileNameDec)){\\n console.log(\\\"File specified does not exist\\\");\\n return;\\n }\\n if(!existsSync(padNameDec)){\\n console.log(\\\"1pt file specified doesn't exist\\\");\\n return;\\n }\\n\\n console.log(\\\"Read the encrypted file\\\");\\n let fileDataDec = readFileSync(fileNameDec, 'utf-8');\\n console.log(\\\"Reading the 1pt file\\\");\\n let padDataDec = RetrievePadData(padNameDec);\\n\\n // decrypt the file\\n console.log(\\\"Generating the file\\\");\\n let keyDec = padFunction(fileDataDec, padDataDec)\\n\\n\\n if(argv[3] && argv[3].trim()==='-o'){\\n let textFileDec = `${argv[1].trim()}.txt`;\\n if(!argv[4]){\\n console.log(\\\"No output file specified, creating a new file\\\")\\n }\\n if(argv[4] && argv[4].trim().length < 3){\\n console.log(\\\"The name of the output file should be greater than 4 characters\\\");\\n console.log(`Creating new file`)\\n }else {\\n argv[4] ? textFileDec = `${argv[4].trim()}.txt` : textFileDec = `${argv[1].trim()}.txt`\\n }\\n\\n console.log(\\\"Generating text file\\\");\\n createFile(textFileDec, 0, false, keyDec );\\n // https://sebhastian.com/javascript-delete-file/\\n console.log(\\\"Deleting encrypted file\\\");\\n unlinkSync(fileNameDec);\\n console.log(\\\"Deleting 1pt file\\\");\\n unlinkSync(padNameDec);\\n }else {\\n console.log(\\\"The decrypted file is: \\\\n\\\\n\\\")\\n console.log(keyDec);\\n }\\n }\\n\\n }else {\\n console.log(\\\"Invalid action\\\");\\n help();\\n return;\\n }\\n\\n}\\n\\n/**\\n * Display help messages\\n */\\nconst help = ():void => {\\n console.log(\\\"\\\\n\\\\n\\\\n1tp is a tool used to encrypt and decrypt text files\\\");\\n console.log(\\\"Look at the commands below to learn the use of it\\\");\\n console.log(\\\"The input file for encryption should be a txt file\\\");\\n console.log(\\\"The output will be a .kye file and a .1pt file\\\");\\n console.log(\\\"\\\\n\\\\n**Note: Don't add file extensios while running the command**\\\");\\n console.log(\\\"**Note: if during creation, the application encouters a file already existing, it will overwrite the file**\\\");\\n console.log(\\\"Options: \\\");\\n console.log(\\\"\\\\t -h | --help \\\\t\\\\t\\\\t\\\\t\\\\t\\\\t\\\\t View help\\\");\\n console.log(\\\"\\\\t --generate <pad name> <size of file> \\\\t\\\\t\\\\t\\\\t Create a pad file given a size\\\");\\n console.log(\\\"\\\\t --encrypt <txt file> <pad name> \\\\t\\\\t\\\\t\\\\t Encrypt a file give a pad file\\\");\\n console.log(\\\"\\\\t\\\\t\\\\t\\\\t All parameters for encryption are required\\\");\\n console.log(\\\"\\\\t --decrypt <key file> <pad name> -o <txt file> \\\\t Decrypt a file give a key and 1tp files\\\");\\n console.log(\\\"\\\\t\\\\t\\\\t\\\\t If output file is not specified it will display the text inside the console\\\");\\n console.log(\\\"\\\\t\\\\t\\\\t\\\\t If only the `-o` option is defined without a txt file, it will create a new file\\\");\\n console.log(\\\"\\\\n** Note: Decrypting a file will delete the key and the 1pt files**\\\");\\n}\\n\\n/**\\n * Create a file with a random key\\n * @param file Name of the file being created\\n * @param fileSize Size of the file being created\\n */\\nconst createFile = (file:string, fileSize:number = 1024, key:boolean = true, data:string = \\\"\\\"):void => {\\n let fileName:string;\\n if(key){\\n fileName = `${file.trim().toLowerCase()}${padExtension}`;\\n\\n // https://flaviocopes.com/how-to-check-if-file-exists-node/#:~:text=The%20way%20to%20check%20if%20a%20file%20exists,the%20existence%20of%20a%20file%20without%20opening%20it%3A\\n\\n console.log(\\\"Generating the One time pad\\\");\\n const pad = generateOneTimePad(fileSize);\\n //https://code-boxx.com/create-save-files-javascript/#:~:text=%20The%20possible%20ways%20to%20create%20and%20save,the%20server.%0Avar%20data%20%3D%20new%20FormData...%20More%20\\n console.log(\\\"Writing to file\\\");\\n writeFileSync(fileName, pad);\\n return;\\n\\n }\\n\\n console.log(\\\"Writing to file\\\");\\n writeFileSync(file, data);\\n};\\n\\n/**\\n * Generate a pad\\n * @param fileSize Size of the new pad being created\\n * @returns the new pad\\n */\\nconst generateOneTimePad = (fileSize:number):string => {\\n /**\\n * String in which we will put the one time pad\\n */\\n let otp:string = \\\"\\\";\\n /**\\n * used to organize the key\\n */\\n let splitCounter = 0;\\n let columnCounter = 0;\\n\\n for (let i = 0; i <= fileSize;) {\\n if(splitCounter < 6){\\n // Generate a random letter from the alphabet given\\n otp += (stringLetter.charAt(Math.random()*1000%stringLetter.length))\\n splitCounter++;\\n i++;\\n continue;\\n }\\n // Used to organize the key so it looks estetic\\n if(columnCounter < 7){\\n splitCounter = 0;\\n columnCounter++;\\n otp += (\\\"\\\\t\\\");\\n continue;\\n }else{\\n splitCounter = 0;\\n columnCounter = 0;\\n otp += (\\\"\\\\n\\\");\\n continue;\\n }\\n\\n }\\n return otp\\n}\\n\\n/**\\n * Get the pad data from the file\\n * @returns Text pad data\\n */\\nconst RetrievePadData = (padFile:string):string => {\\n // Retrieve the pad data\\n let padData = \\\"\\\"\\n // read the file\\n const data = readFileSync(`${padFile}`, 'utf-8')\\n\\n // Take out all the tabs and new lines we added while generating the key\\n const stringArray = data.toString().split(\\\"\\\\n\\\");\\n for (let index = 0; index < stringArray.length; index++) {\\n const element = stringArray[index].split(\\\"\\\\t\\\");\\n for (let i = 0; i < element.length; i++) {\\n padData += element[i];\\n }\\n }\\n\\n return padData;\\n}\\n\\n/**\\n * One time pad function\\n * @param fileData Data of the file to encrypt or decrypt\\n * @param padData Data of the pad file\\n * @returns The generated encryption or decryption\\n */\\nconst padFunction = (fileData:string, padData:string ):string => {\\n let key = \\\"\\\";\\n for (let i = 0; i < fileData.length; i++) {\\n key += String.fromCharCode(-fileData[i].charCodeAt(0)+padData[i].toLowerCase().charCodeAt(0)+97);\\n // console.log(`File char: ${fileData[i]} ${fileData[i].charCodeAt(0)} Pad Data: ${padData[i]} ${padData[i].toLocaleLowerCase().charCodeAt(0)} Key: ${key[i]} ${key[i].charCodeAt(0)}`)\\n }\\n return key;\\n}\\n\\nmain();\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"import \\\"io\\\" for File, Directory\\nimport \\\"./srandom\\\" for SRandom\\nimport \\\"./ioutil\\\" for FileUtil, Input\\nimport \\\"./dynamic\\\" for Enum\\nimport \\\"./str\\\" for Char, Str\\n\\nvar CHARS_PER_LINE = 48\\nvar CHUNK_SIZE = 6\\nvar COLS = 8\\nvar DEMO = true // would normally be set to false\\n\\nvar FileType = Enum.create(\\\"FileType\\\", [\\\"OTP\\\", \\\"ENC\\\", \\\"DEC\\\"])\\n\\nvar toAlpha = Fn.new { |s| s.where { |c| Char.isAsciiUpper(c) }.join() }\\n\\nvar isOtpRelated = Fn.new { |s|\\n return s.endsWith(\\\".1tp\\\") || s.endsWith(\\\".1tp_cpy\\\") ||\\n s.endsWith(\\\".1tp_enc\\\") || s.endsWith(\\\".1tp_dec\\\")\\n}\\n\\nvar inChunks = Fn.new { |s, nLines, ft|\\n var chunks = Str.chunks(s, CHUNK_SIZE)\\n var sb = \\\"\\\"\\n for (i in 0...nLines) {\\n var j = i * COLS\\n var ch = chunks[j...j+COLS].join(\\\" \\\")\\n sb = sb + \\\" \\\" + ch + \\\"\\\\n\\\"\\n }\\n sb = \\\" file\\\\n\\\" + sb\\n return (ft == FileType.OTP) ? \\\"# OTP\\\" + sb :\\n (ft == FileType.ENC) ? \\\"# Encrypted\\\" + sb :\\n (ft == FileType.DEC) ? \\\"# Decrypted\\\" + sb : \\\"\\\"\\n}\\n\\nvar makePad = Fn.new { |nLines|\\n var nChars = nLines * CHARS_PER_LINE\\n var sb = \\\"\\\"\\n /* generate random upper case letters */\\n for (i in 0...nChars) sb = sb + String.fromByte(SRandom.int(65, 91))\\n return inChunks.call(sb, nLines, FileType.OTP)\\n}\\n\\nvar vigenere = Fn.new { |text, key, encrypt|\\n var sb = \\\"\\\"\\n var i = 0\\n for (c in text) {\\n var ci = encrypt ? (c.bytes[0] + key[i].bytes[0] - 130) % 26 :\\n (c.bytes[0] - key[i].bytes[0] + 26) % 26\\n sb = sb + String.fromByte(ci + 65)\\n i = i + 1\\n }\\n var temp = sb.count % CHARS_PER_LINE\\n if (temp > 0) { // pad with random characters so each line is a full one\\n for (i in temp...CHARS_PER_LINE) sb = sb + String.fromByte(SRandom.int(65, 91))\\n }\\n var ft = encrypt ? FileType.ENC : FileType.DEC\\n return inChunks.call(sb, (sb.count / CHARS_PER_LINE).floor, ft)\\n}\\n\\nvar menu = Fn.new {\\n System.print(\\\"\\\"\\\"\\n\\n1. Create one time pad file.\\n\\n2. Delete one time pad file.\\n\\n3. List one time pad files.\\n\\n4. Encrypt plain text.\\n\\n5. Decrypt cipher text.\\n\\n6. Quit program.\\n\\n\\\"\\\"\\\")\\n return Input.integer(\\\"Your choice (1 to 6) : \\\", 1, 6)\\n}\\n\\nwhile (true) {\\n var choice = menu.call()\\n System.print()\\n if (choice == 1) { // Create OTP\\n System.print(\\\"Note that encrypted lines always contain 48 characters.\\\\n\\\")\\n var fileName = Input.text(\\\"OTP file name to create (without extension) : \\\", 1) + \\\".1tp\\\"\\n var nLines = Input.integer(\\\"Number of lines in OTP (max 1000) : \\\", 1, 1000)\\n var key = makePad.call(nLines)\\n File.create(fileName) { |f| f.writeBytes(key) }\\n System.print(\\\"\\\\n'%(fileName)' has been created in the current directory.\\\")\\n if (DEMO) {\\n // a copy of the OTP file would normally be on a different machine\\n var fileName2 = fileName + \\\"_cpy\\\" // copy for decryption\\n File.create(fileName2) { |f| f.writeBytes(key) }\\n System.print(\\\"'%(fileName2)' has been created in the current directory.\\\")\\n System.print(\\\"\\\\nThe contents of these files are :\\\\n\\\")\\n System.print(key)\\n }\\n } else if (choice == 2) { // Delete OTP\\n System.print(\\\"Note that this will also delete ALL associated files.\\\\n\\\")\\n var toDelete1 = Input.text(\\\"OTP file name to delete (without extension) : \\\", 1) + \\\".1tp\\\"\\n var toDelete2 = toDelete1 + \\\"_cpy\\\"\\n var toDelete3 = toDelete1 + \\\"_enc\\\"\\n var toDelete4 = toDelete1 + \\\"_dec\\\"\\n var allToDelete = [toDelete1, toDelete2, toDelete3, toDelete4]\\n var deleted = 0\\n System.print()\\n for (name in allToDelete) {\\n if (File.exists(name)) {\\n File.delete(name)\\n deleted = deleted + 1\\n System.print(\\\"'%(name)' has been deleted from the current directory.\\\")\\n }\\n }\\n if (deleted == 0) System.print(\\\"There are no files to delete.\\\")\\n } else if (choice == 3) { // List OTPs\\n System.print(\\\"The OTP (and related) files in the current directory are:\\\\n\\\")\\n var otpFiles = Directory.list(\\\"./\\\").where { |f| File.exists(f) && isOtpRelated.call(f) }.toList\\n System.print(otpFiles.join(\\\"\\\\n\\\")) // already sorted\\n } else if (choice == 4) { // Encrypt\\n var keyFile = Input.text(\\\"OTP file name to use (without extension) : \\\", 1) + \\\".1tp\\\"\\n if (File.exists(keyFile)) {\\n var lines = FileUtil.readLines(keyFile)\\n var first = lines.count\\n for (i in 0...lines.count) {\\n if (lines[i].startsWith(\\\" \\\")) {\\n first = i\\n break\\n }\\n }\\n if (first == lines.count) {\\n System.print(\\\"\\\\nThat file has no unused lines.\\\")\\n continue\\n }\\n var lines2 = lines.skip(first).toList // get rid of comments and used lines\\n var text = toAlpha.call(Str.upper(Input.text(\\\"Text to encrypt :-\\\\n\\\\n\\\", 1)))\\n var len = text.count\\n var nLines = (len / CHARS_PER_LINE).floor\\n if (len % CHARS_PER_LINE > 0) nLines = nLines + 1\\n if (lines2.count >= nLines) {\\n var key = toAlpha.call(lines2.take(nLines).join(\\\"\\\"))\\n var encrypted = vigenere.call(text, key, true)\\n var encFile = keyFile + \\\"_enc\\\"\\n File.create(encFile) { |f| f.writeBytes(encrypted) }\\n System.print(\\\"\\\\n'%(encFile)' has been created in the current directory.\\\")\\n for (i in first...first + nLines) {\\n lines[i] = \\\"-\\\" + lines[i][1..-1]\\n }\\n File.create(keyFile) { |f| f.writeBytes(lines.join(\\\"\\\\n\\\")) }\\n if (DEMO) {\\n System.print(\\\"\\\\nThe contents of the encrypted file are :\\\\n\\\")\\n System.print(encrypted)\\n }\\n } else System.print(\\\"Not enough lines left in that file to do encryption\\\")\\n } else System.print(\\\"\\\\nhat file does not exist.\\\")\\n } else if (choice == 5) { // Decrypt\\n var keyFile = Input.text(\\\"OTP file name to use (without extension) : \\\", 1) + \\\".1tp_cpy\\\"\\n if (File.exists(keyFile)) {\\n var keyLines = FileUtil.readLines(keyFile)\\n var first = keyLines.count\\n for (i in 0...keyLines.count) {\\n if (keyLines[i].startsWith(\\\" \\\")) {\\n first = i\\n break\\n }\\n }\\n if (first == keyLines.count) {\\n System.print(\\\"\\\\nThat file has no unused lines.\\\")\\n continue\\n }\\n var keyLines2 = keyLines[first..-1] // get rid of comments and used lines\\n var encFile = keyFile[0..-4] + \\\"enc\\\"\\n if (File.exists(encFile)) {\\n var encLines = FileUtil.readLines(encFile)[1..-1] // exclude comment line\\n var nLines = encLines.count\\n if (keyLines2.count >= nLines) {\\n var encrypted = toAlpha.call(encLines.join(\\\"\\\"))\\n var key = toAlpha.call(keyLines2.take(nLines).join(\\\"\\\"))\\n var decrypted = vigenere.call(encrypted, key, false)\\n var decFile = keyFile[0..-4] + \\\"dec\\\"\\n File.create(decFile) { |f| f.writeBytes(decrypted) }\\n System.print(\\\"\\\\n'%(decFile)' has been created in the current directory.\\\")\\n for (i in first...first + nLines) {\\n keyLines[i] = \\\"-\\\" + keyLines[i][1..-1]\\n }\\n File.create(keyFile) { |f| f.writeBytes(keyLines.join(\\\"\\\\n\\\")) }\\n if (DEMO) {\\n System.print(\\\"\\\\nThe contents of the decrypted file are :\\\\n\\\")\\n System.print(decrypted)\\n }\\n } else System.print(\\\"Not enough lines left in that file to do decryption\\\")\\n } else System.print(\\\"\\\\n'%(encFile)' is missing.\\\")\\n } else System.print(\\\"\\\\nThat file does not exist.\\\")\\n } else {\\n return // Quit\\n }\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"One-time-pad"}}},{"rowIdx":1464,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- GUI\n- Temporal media\nfrom: http://rosettacode.org/wiki/OpenGL\nnote: 3D\nrequires:\n- Graphics\n","language":"00-META"},{"code":";Task:\nDisplay a smooth shaded triangle with OpenGL.\n\n[[image:Triangle.png|right|thumb|300px|Triangle created using C example compiled with [[GCC]] 4.1.2 and [[freeglut3]].]]\n<br><br>\n\n","language":"00-TASK"},{"code":"with Lumen.Window;\nwith Lumen.Events;\nwith Lumen.Events.Animate;\nwith GL;\nwith GLU;\n\nprocedure OpenGL is\n\n The_Window : Lumen.Window.Handle;\n\n Program_Exit : Exception;\n\n -- simply exit this program\n procedure Quit_Handler (Event : in Lumen.Events.Event_Data) is\n begin\n raise Program_Exit;\n end;\n\n -- Resize the scene\n procedure Resize_Scene (Width, Height : in Natural) is\n use GL;\n use GLU;\n begin\n -- reset current viewport\n glViewport (0, 0, GLsizei (Width), GLsizei (Height));\n\n -- select projection matrix and reset it\n glMatrixMode (GL_PROJECTION);\n glLoadIdentity;\n\n -- calculate aspect ratio\n gluPerspective (45.0, GLdouble (Width) / GLdouble (Height), 0.1, 100.0);\n\n -- select modelview matrix and reset it\n glMatrixMode (GL_MODELVIEW);\n glLoadIdentity;\n end Resize_Scene;\n\n procedure Init_GL is\n use GL;\n use GLU;\n begin\n -- smooth shading\n glShadeModel (GL_SMOOTH);\n\n -- black background\n glClearColor (0.0, 0.0, 0.0, 0.0);\n\n -- depth buffer setup\n glClearDepth (1.0);\n -- enable depth testing\n glEnable (GL_DEPTH_TEST);\n -- type of depth test\n glDepthFunc (GL_LEQUAL);\n\n glHint (GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\n end Init_GL;\n\n -- Resize and Initialize the GL window\n procedure Resize_Handler (Event : in Lumen.Events.Event_Data) is\n Height : Natural := Event.Resize_Data.Height;\n Width : Natural := Event.Resize_Data.Width;\n begin\n -- prevent div by zero\n if Height = 0 then\n Height := 1;\n end if;\n\n Resize_Scene (Width, Height);\n end;\n\n procedure Draw is\n use GL;\n begin\n -- clear screen and depth buffer\n glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\n -- reset current modelview matrix\n glLoadIdentity;\n\n -- draw triangle\n glBegin (GL_TRIANGLES);\n glColor3f (1.0, 0.0, 0.0);\n glVertex3f ( 0.0, 1.0, 0.0);\n glColor3f (0.0, 1.0, 0.0);\n glVertex3f (-1.0, -1.0, 0.0);\n glColor3f (0.0, 0.0, 1.0);\n glVertex3f ( 1.0, -1.0, 0.0);\n glEnd;\n end Draw;\n\n procedure Frame_Handler (Frame_Delta : in Duration) is\n begin\n Draw;\n Lumen.Window.Swap (The_Window);\n end Frame_Handler;\n\nbegin\n\n Lumen.Window.Create (Win => The_Window,\n Name => \"OpenGL Demo\",\n Width => 640,\n Height => 480,\n Events => (Lumen.Window.Want_Key_Press => True,\n Lumen.Window.Want_Exposure => True,\n others => False));\n\n Resize_Scene (640, 480);\n Init_GL;\n\n Lumen.Events.Animate.Select_Events\n (Win => The_Window,\n FPS => Lumen.Events.Animate.Flat_Out,\n Frame => Frame_Handler'Unrestricted_Access,\n Calls => (Lumen.Events.Resized => Resize_Handler'Unrestricted_Access,\n Lumen.Events.Close_Window => Quit_Handler'Unrestricted_Access,\n others => Lumen.Events.No_Callback));\n\nexception\n when Program_Exit =>\n null; -- normal termination\nend OpenGL;\n","language":"Ada"},{"code":"hOpenGL32 := DllCall(\"LoadLibrary\", \"Str\", \"opengl32\")\nGui, +LastFound +Resize\nhDC := DllCall(\"GetDC\", \"uInt\", WinExist())\n\nVarSetCapacity(pfd, 40, 0)\nNumPut(40, pfd, 0, \"uShort\")\nNumPut(1, pfd, 2, \"uShort\")\nNumPut(37, pfd, 4, \"uInt\")\nNumPut(24, pfd, 9, \"uChar\")\nNumPut(16, pfd, 23, \"uChar\")\nDllCall(\"SetPixelFormat\", \"uInt\", hDC, \"uInt\", DllCall(\"ChoosePixelFormat\", \"uInt\", hDC, \"uInt\", &pfd), \"uInt\", &pfd)\n\nhRC := DllCall(\"opengl32\\wglCreateContext\", \"uInt\", hDC)\nDllCall(\"opengl32\\wglMakeCurrent\", \"uInt\", hDC, \"uInt\", hRC)\nGui, Show, w640 h480, Triangle\nOnExit, ExitSub\nSetTimer, Paint, 50\nreturn\n\n\nPaint:\nDllCall(\"opengl32\\glClearColor\", \"Float\", 0.3, \"Float\", 0.3, \"Float\", 0.3, \"Float\", 0)\nDllCall(\"opengl32\\glClear\", \"uInt\", 0x4100) ;GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT\n\nDllCall(\"opengl32\\glShadeModel\", \"uInt\", 0x1D01) ;GL_SMOOTH\n\nDllCall(\"opengl32\\glLoadIdentity\")\nDllCall(\"opengl32\\glTranslatef\", \"Float\", -15, \"Float\", -15, \"Float\", 0)\n\nDllCall(\"opengl32\\glBegin\", \"uInt\", 0x0004) ;GL_TRIANGLES\nDllCall(\"opengl32\\glColor3f\", \"Float\", 1, \"Float\", 0, \"Float\", 0)\nDllCall(\"opengl32\\glVertex2f\", \"Float\", 0, \"Float\", 0)\nDllCall(\"opengl32\\glColor3f\", \"Float\", 0, \"Float\", 1, \"Float\", 0)\nDllCall(\"opengl32\\glVertex2f\", \"Float\", 30, \"Float\", 0)\nDllCall(\"opengl32\\glColor3f\", \"Float\", 0, \"Float\", 0, \"Float\", 1)\nDllCall(\"opengl32\\glVertex2f\", \"Float\", 0, \"Float\", 30)\nDllCall(\"opengl32\\glEnd\")\n\nDllCall(\"SwapBuffers\", \"uInt\", hDC)\nreturn\n\n\nGuiSize:\nDllCall(\"opengl32\\glViewport\", \"Int\", 0, \"Int\", 0, \"Int\", A_GuiWidth, \"Int\", A_GuiHeight)\nDllCall(\"opengl32\\glMatrixMode\", \"uInt\", 0x1701) ;GL_PROJECTION\nDllCall(\"opengl32\\glLoadIdentity\")\nDllCall(\"opengl32\\glOrtho\", \"Double\", -30, \"Double\", 30, \"Double\", -30, \"Double\", 30, \"Double\", -30, \"Double\", 30)\nDllCall(\"opengl32\\glMatrixMode\", \"uInt\", 0x1700) ;GL_MODELVIEW\nreturn\n\n\nGuiClose:\nExitApp\n\n\nExitSub:\nDllCall(\"opengl32\\wglMakeCurrent\", \"uInt\", 0, \"uInt\", 0)\nDllCall(\"opengl32\\wglDeleteContext\", \"uInt\", hRC)\nDllCall(\"ReleaseDC\", \"uInt\", hDC)\nDllCall(\"FreeLibrary\", \"uInt\", hOpenGL32)\nExitApp\n","language":"AutoHotkey"},{"code":"PRAGMA INCLUDE <GL/gl.h> <GL/freeglut.h>\nPRAGMA LDFLAGS GL glut\n\nOPTION PARSE FALSE\n\nSUB Triangle\n\n glViewport(0, 0, 640, 480)\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n\n glClearColor(0.0, 0.0, 0.0, 1.0)\n glClear(GL_COLOR_BUFFER_BIT)\n\n glTranslatef(-15.0, -15.0, 0.0)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0, 0.0, 0.0)\n glVertex2f(0.0, 0.0)\n glColor3f(0.0, 1.0, 0.0)\n glVertex2f(30.0, 0.0)\n glColor3f(0.0, 0.0, 1.0)\n glVertex2f(0.0, 30.0)\n glEnd()\n\n glutSwapBuffers()\n\nEND SUB\n\nglutInit(&argc, argv)\nglutInitWindowSize(640, 480)\nglutCreateWindow(\"Triangle\")\n\nglutDisplayFunc(Triangle)\nglutMainLoop()\n","language":"BaCon"},{"code":" *FLOAT64\n\n SYS \"LoadLibrary\", \"OPENGL32.DLL\" TO opengl%\n SYS \"GetProcAddress\", opengl%, \"wglCreateContext\" TO `wglCreateContext`\n SYS \"GetProcAddress\", opengl%, \"wglDeleteContext\" TO `wglDeleteContext`\n SYS \"GetProcAddress\", opengl%, \"wglMakeCurrent\" TO `wglMakeCurrent`\n SYS \"GetProcAddress\", opengl%, \"glMatrixMode\" TO `glMatrixMode`\n SYS \"GetProcAddress\", opengl%, \"glClear\" TO `glClear`\n SYS \"GetProcAddress\", opengl%, \"glBegin\" TO `glBegin`\n SYS \"GetProcAddress\", opengl%, \"glColor3dv\" TO `glColor3dv`\n SYS \"GetProcAddress\", opengl%, \"glVertex2dv\" TO `glVertex2dv`\n SYS \"GetProcAddress\", opengl%, \"glEnd\" TO `glEnd`\n\n MODE 8\n\n PFD_MAIN_PLANE = 0\n PFD_TYPE_RGBA = 0\n PFD_DOUBLEBUFFER = 1\n PFD_DRAW_TO_WINDOW = 4\n PFD_SUPPORT_OPENGL = &20\n\n GL_MODELVIEW = &1700\n GL_TRIANGLES = 4\n GL_DEPTH_BUFFER_BIT = &00000100\n GL_COLOR_BUFFER_BIT = &00004000\n\n ON CLOSE PROCcleanup : QUIT\n ON ERROR PROCcleanup : SYS \"MessageBox\", @hwnd%, REPORT$, 0, 48 : QUIT\n\n DIM GLcolor{r#, g#, b#}, GLvertex{x#, y#}\n DIM pfd{nSize{l&,h&}, nVersion{l&,h&}, dwFlags%, iPixelType&, cColorBits&, \\\n \\ cRedBits&, cRedShift&, cGreenBits&, cGreenShift&, cBlueBits&, cBlueShift&, \\\n \\ cAlphaBits&, cAlphaShift&, cAccumBits&, cAccumRedBits&, cAccumGreenBits&, \\\n \\ cAccumBlueBits&, cAccumAlphaBits&, cDepthBits&, cStencilBits&, cAuxBuffers&, \\\n \\ iLayerType&, bReserved&, dwLayerMask%, dwVisibleMask%, dwDamageMask%}\n\n pfd.nSize.l& = DIM(pfd{})\n pfd.nVersion.l& = 1\n pfd.dwFlags% = PFD_DRAW_TO_WINDOW OR PFD_SUPPORT_OPENGL OR PFD_DOUBLEBUFFER\n pfd.dwLayerMask% = PFD_MAIN_PLANE\n pfd.iPixelType& = PFD_TYPE_RGBA\n pfd.cColorBits& = 24\n pfd.cDepthBits& = 16\n\n SYS \"GetDC\", @hwnd% TO ghDC%\n\n SYS \"ChoosePixelFormat\", ghDC%, pfd{} TO pixelformat%\n IF pixelformat% = 0 ERROR 100, \"ChoosePixelFormat failed\"\n\n SYS \"SetPixelFormat\", ghDC%, pixelformat%, pfd{} TO res%\n IF res% = 0 ERROR 100, \"SetPixelFormat failed\"\n\n SYS `wglCreateContext`, ghDC% TO ghRC%\n SYS `wglMakeCurrent`, ghDC%, ghRC%\n SYS `glMatrixMode`, GL_MODELVIEW\n\n REPEAT\n WAIT 2\n SYS `glClear`, GL_COLOR_BUFFER_BIT OR GL_DEPTH_BUFFER_BIT\n SYS `glBegin`, GL_TRIANGLES\n GLcolor.r# = 1.0 : GLcolor.g# = 0.0 : GLcolor.b# = 0.0\n SYS `glColor3dv`, GLcolor{}\n GLvertex.x# = 0.0 : GLvertex.y# = 0.8\n SYS `glVertex2dv`, GLvertex{}\n GLcolor.r# = 0.0 : GLcolor.g# = 1.0 : GLcolor.b# = 0.0\n SYS `glColor3dv`, GLcolor{}\n GLvertex.x# = 0.8 : GLvertex.y# = -0.8\n SYS `glVertex2dv`, GLvertex{}\n GLcolor.r# = 0.0 : GLcolor.g# = 0.0 : GLcolor.b# = 1.0\n SYS `glColor3dv`, GLcolor{}\n GLvertex.x# = -0.8 : GLvertex.y# = -0.8\n SYS `glVertex2dv`, GLvertex{}\n SYS `glEnd`\n SYS \"SwapBuffers\", ghDC%\n UNTIL FALSE\n END\n\n DEF PROCcleanup\n ON ERROR OFF\n ghRC% += 0 : IF ghRC% SYS `wglDeleteContext`, ghRC% : ghRC% = 0\n ghDC% += 0 : IF ghDC% SYS \"ReleaseDC\", @hwnd%, ghDC% : ghDC% = 0\n ENDPROC\n","language":"BBC-BASIC"},{"code":"#include <stdlib.h>\n#include <GL/gl.h>\n#include <GL/glut.h>\n\nvoid paint(void)\n{\n glClearColor(0.3,0.3,0.3,0.0);\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n glShadeModel(GL_SMOOTH);\n\n glLoadIdentity();\n glTranslatef(-15.0, -15.0, 0.0);\n\n glBegin(GL_TRIANGLES);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(0.0, 0.0);\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(30.0, 0.0);\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.0, 30.0);\n glEnd();\n\n glFlush();\n}\n\nvoid reshape(int width, int height)\n{\n glViewport(0, 0, width, height);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\n glMatrixMode(GL_MODELVIEW);\n}\n\nint main(int argc, char *argv[])\n{\n glutInit(&argc, argv);\n glutInitWindowSize(640, 480);\n glutCreateWindow(\"Triangle\");\n\n glutDisplayFunc(paint);\n glutReshapeFunc(reshape);\n\n glutMainLoop();\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"using OpenTK;\nusing OpenTK.Graphics;\nnamespace OpenGLTest\n{\n class Program\n {\n static void Main(string[] args)\n {\n //Create the OpenGL window\n GameWindow window = new GameWindow(640, 480, GraphicsMode.Default, \"OpenGL Example\");\n\n GL.MatrixMode(MatrixMode.Projection);\n GL.LoadIdentity();\n GL.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\n GL.MatrixMode(MatrixMode.Modelview);\n\n //Add event handler to render to the window when called\n window.RenderFrame += new RenderFrameEvent(a_RenderFrame);\n //Starts the window's updating/rendering events\n window.Run();\n }\n static void a_RenderFrame(GameWindow sender, RenderFrameEventArgs e)\n {\n GL.ClearColor(0.3f, 0.3f, 0.3f, 0f);\n GL.Clear(ClearBufferMask.ColorBufferBit | ClearBufferMask.DepthBufferBit);\n\n GL.ShadeModel(ShadingModel.Smooth);\n\n GL.LoadIdentity();\n GL.Translate(-15.0f, -15.0f, 0.0f);\n\n GL.Begin(BeginMode.Triangles);\n GL.Color3(1.0f, 0.0f, 0.0f);\n GL.Vertex2(0.0f, 0.0f);\n GL.Color3(0.0f, 1.0f, 0.0f);\n GL.Vertex2(30f, 0.0f);\n GL.Color3(0.0f, 0.0f, 1.0f);\n GL.Vertex2(0.0f, 30.0f);\n GL.End();\n //Swaps the buffers on the window so that what we draw becomes visible\n sender.SwapBuffers();\n }\n }\n}\n","language":"C-sharp"},{"code":"(use 'penumbra.opengl)\n(require '[penumbra.app :as app])\n\n(defn init [state]\n (app/title! \"Triangle\")\n (clear-color 0.3 0.3 0.3 0)\n (shade-model :smooth)\n state)\n\n(defn reshape [[x y w h] state]\n (ortho-view -30 30 -30 30 -30 30)\n (load-identity)\n (translate -15 -15)\n state)\n\n(defn display [[dt time] state]\n (draw-triangles\n (color 1 0 0) (vertex 0 0)\n (color 0 1 0) (vertex 30 0)\n (color 0 0 1) (vertex 0 30)))\n\n(app/start {:display display, :reshape reshape, :init init} {})\n","language":"Clojure"},{"code":"(defun draw-triangle (x y &key (z 0) (type 'right))\n (case type\n (right\n (gl:with-primitive :triangles\n (gl:color 0 0 1)\n (gl:vertex x y z)\n (gl:color 0 1 0)\n (gl:vertex x (- y 1) z)\n (gl:color 1 0 0)\n (gl:vertex (+ x 1) (1- y) z)))\n (equilateral\n (gl:with-primitive :triangles\n (gl:color 0 0 1)\n (gl:vertex (+ x 0.5) y z)\n (gl:color 1 0 0)\n (gl:vertex (- x 0.5) (- y 1) z)\n (gl:color 0 1 0)\n (gl:vertex (+ x 1.5) (- y 1) z)))))\n\n(defun draw-update ()\n (gl:clear :color-buffer :depth-buffer :color-buffer-bit)\n (gl:matrix-mode :modelview)\n (gl:load-identity)\n\n (gl:color 1.0 1.0 1.0)\n (gl:translate 0 0 -2)\n\n (draw-triangle -0.5 0.5 :type 'equilateral))\n\n(defun main-loop ()\n (sdl:with-events ()\n (:quit-event () t)\n (:key-down-event (:key key)\n (cond ((sdl:key= key :sdl-key-escape)\n (sdl:push-quit-event))))\n (:idle ()\n (draw-update)\n (sdl:update-display))))\n\n(defun setup-gl (w h)\n (gl:clear-color 0.5 0.5 0.5 1)\n (gl:clear-depth 1)\n\n (gl:viewport 0 0 w h)\n\n (gl:depth-func :lequal)\n (gl:hint :perspective-correction-hint :nicest)\n (gl:shade-model :smooth)\n (gl:enable :depth-test :cull-face)\n\n (gl:matrix-mode :projection)\n (gl:load-identity)\n (glu:perspective 45 (/ w (max h 1)) 0.1 20)\n\n (gl:matrix-mode :modelview)\n (gl:load-identity))\n\n(defun triangle (&optional (w 640) (h 480))\n (sdl:with-init ()\n (sdl:set-gl-attribute :SDL-GL-DEPTH-SIZE 16)\n (sdl:window w h\n :bpp 32\n :flags sdl:sdl-opengl\n :title-caption \"Rosettacode.org OpenGL Demo\")\n (setup-gl w h)\n (setf (sdl:frame-rate) 2)\n (main-loop)))\n","language":"Common-Lisp"},{"code":"module opengl_sample; // file name + directory\nimport dglut.core, dglut.window, dglut.opengl;\n\nvoid main() {\n with (new Canvas) {\n setName(\"Triangle\");\n map;\n\n onResize = (Canvas self) { // A delegate literal that takes a parameter.\n with (self) glViewport(0, 0, width, height);\n MatrixMode.Projection.Identity; // For functions without parameters, the () can be omitted.\n glOrtho(-30, 30, -30, 30, -30, 30);\n MatrixMode.Modelview;\n };\n\n onDisplay=(Canvas self) {\n scope(exit) self.swap; // Scope guards ease exception-safe programming\n glClearColor(0.3f, 0.3f, 0.3f, 0f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n glLoadIdentity;\n // A convenience wrapper around glTranslatef. Supports numbers, arrays and vectors.\n Translate(-15, -15, 0);\n // This is a delegate literal as well. Triangles is a wrapper around glBegin and glEnd.\n Triangles = {\n Color(1f, 0f, 0f); Vertex(0, 0);\n Color(0f, 1f, 0f); Vertex(30, 0);\n Color(0f, 0f, 1f); Vertex(0, 30);\n };\n };\n }\n loop;\n}\n","language":"D"},{"code":"program OpenGLTriangle;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.Classes,\n Sample.App,\n Winapi.OpenGL,\n System.UITypes;\n\ntype\n TTriangleApp = class(TApplication)\n public\n procedure Initialize; override;\n procedure Update(const ADeltaTimeSec, ATotalTimeSec: Double); override;\n procedure Shutdown; override;\n procedure KeyDown(const AKey: Integer; const AShift: TShiftState); override;\n end;\n\n{ TTriangleApp }\n\nprocedure TTriangleApp.Initialize;\nbegin\n inherited;\n glViewport(0, 0, width, height);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\n glMatrixMode(GL_MODELVIEW);\nend;\n\nprocedure TTriangleApp.KeyDown(const AKey: Integer; const AShift: TShiftState);\nbegin\n inherited;\n if (AKey = vkEscape) then\n Terminate;\nend;\n\nprocedure TTriangleApp.Shutdown;\nbegin\n inherited;\n // Writeln('App is Shutdown');\nend;\n\nprocedure TTriangleApp.Update(const ADeltaTimeSec, ATotalTimeSec: Double);\nbegin\n inherited;\n\n glClearColor(0.3, 0.3, 0.3, 0.0);\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\n\n glShadeModel(GL_SMOOTH);\n\n glLoadIdentity();\n glTranslatef(-15.0, -15.0, 0.0);\n\n glBegin(GL_TRIANGLES);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(0.0, 0.0);\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(30.0, 0.0);\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.0, 30.0);\n glEnd();\n\n glFlush();\nend;\n\nbegin\n RunApp(TTriangleApp, 640, 480, 'OpenGL Triangle');\nend.\n","language":"Delphi"},{"code":"#include <GL/gl.h>\nimport \"ecere\"\n\nclass GLTriangle : Window\n{\n text = \"Triangle\";\n displayDriver = \"OpenGL\";\n background = activeBorder;\n nativeDecorations = true;\n borderStyle = sizable;\n hasMaximize = true, hasMinimize = true, hasClose = true;\n size = { 640, 480 };\n\n void OnRedraw(Surface surface)\n {\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-30, 30, -30, 30, -30, 30);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glTranslatef(-15, -15, 0);\n glShadeModel(GL_SMOOTH);\n\n glBegin(GL_TRIANGLES);\n glColor3f(1, 0, 0);\n glVertex2f(0, 0);\n glColor3f(0, 1, 0);\n glVertex2f(30, 0);\n glColor3f(0, 0, 1);\n glVertex2f(0, 30);\n glEnd();\n }\n}\n\nGLTriangle window {};\n","language":"EC"},{"code":"include get.e\ninclude dll.e\ninclude machine.e\ninclude msgbox.e\ninclude constants.ew\ninclude GLfunc.ew\ninclude GLconst.ew\n\nwithout warning\n\natom hRC, hDC, hWnd, hInstance, ClassName\nsequence keys keys = repeat(0,256) -- array to hold key presses\n\ninteger active, fullscreen, retval\nactive = TRUE\nfullscreen = TRUE\nhRC = NULL\nhDC = NULL\nhWnd = NULL\nhInstance = NULL\n\natom rtri, rquad\nrtri = 0.0\nrquad = 0.0\n\ninteger dmScreenSettings, WindowRect\n\nprocedure ReSizeGLScene(integer width, integer height)\n if height = 0 then\n height = 1\n end if\n c_proc(glViewport,{0,0,width,height})\n c_proc(glMatrixMode,{GL_PROJECTION})\n c_proc(glLoadIdentity,{})\n c_proc(gluPerspective,{45.0,width/height,0.1,100.0})\n c_proc(glMatrixMode,{GL_MODELVIEW})\n c_proc(glLoadIdentity,{})\nend procedure\n\nprocedure InitGL()\n c_proc(glShadeModel,{GL_SMOOTH})\n c_proc(glClearColor,{0.0,0.0,0.0,0.0})\n c_proc(glClearDepth,{1.0})\n c_proc(glEnable,{GL_DEPTH_TEST})\n c_proc(glDepthFunc,{GL_LEQUAL})\n c_proc(glHint,{GL_PERSPECTIVE_CORRECTION_HINT,GL_NICEST})\nend procedure\n\nfunction DrawGLScene()\n c_proc(glClear, {or_bits(GL_COLOR_BUFFER_BIT,GL_DEPTH_BUFFER_BIT)})\n c_proc(glLoadIdentity, {})\n c_proc(glTranslatef, {-1.5,0.0,-6.0})\n c_proc(glRotatef, {rtri,0.0,1.0,0.0})\n c_proc(glBegin, {GL_TRIANGLES})\n c_proc(glColor3f, {1.0,0.0,0.0})\n c_proc(glVertex3f, {0.0,1.0,0.0})\n c_proc(glColor3f, {0.0,1.0,0.0})\n c_proc(glVertex3f, {-1.0,-1.0,0.0})\n c_proc(glColor3f, {0.0,0.0,1.0})\n c_proc(glVertex3f, {1.0,-1.0,0.0})\n c_proc(glEnd, {})\n c_proc(glLoadIdentity, {})\n c_proc(glTranslatef, {1.5,0.0,-6.0})\n c_proc(glRotatef, {rquad,1.0,0.0,0.0})\n c_proc(glColor3f, {0.5,0.5,1.0})\n c_proc(glBegin, {GL_QUADS})\n c_proc(glVertex3f, {1.0,1.0,0.0})\n c_proc(glVertex3f, {-1.0,1.0,0.0})\n c_proc(glVertex3f, {-1.0,-1.0,0.0})\n c_proc(glVertex3f, {1.0,-1.0,0.0})\n c_proc(glEnd, {})\n rtri += 0.2\n rquad -= 0.15\n return TRUE\nend function\n\nprocedure KillGLWindow()\n if fullscreen then\n if c_func(ChangeDisplaySettingsA,{NULL,0}) then end if\n if c_func(ShowCursor,{TRUE}) then end if\n end if\n if hRC then\n if c_func(wglMakeCurrent,{NULL,NULL}) then end if\n if c_func(wglDeleteContext,{hRC}) then end if\n hRC = NULL\n end if\n if hRC and not c_func(ReleaseDC,{hWnd,hDC}) then\n hDC = NULL\n end if\n if hWnd and not c_func(DestroyWindow,{hWnd}) then\n hWnd = NULL\n end if\n if dmScreenSettings then\n free(dmScreenSettings)\n end if\n free(WindowRect)\nend procedure\n\nfunction WndProc(atom hWnd, integer uMsg, atom wParam, atom lParam)\n if uMsg = WM_ACTIVATE then\n if not floor(wParam/#10000) then\n active = TRUE\n else\n active = FALSE\n end if\n elsif uMsg = WM_SYSCOMMAND then\n if wParam = SC_SCREENSAVE then end if\n if wParam = SC_MONITORPOWER then end if\n elsif uMsg = WM_CLOSE then\n c_proc(PostQuitMessage,{0})\n elsif uMsg = WM_KEYDOWN then\n keys[wParam] = TRUE\n elsif uMsg = WM_KEYUP then\n keys[wParam] = FALSE\n elsif uMsg = WM_SIZE then\n ReSizeGLScene(and_bits(lParam,#FFFF),floor(lParam/#10000))\n end if\n return c_func(DefWindowProcA,{hWnd, uMsg, wParam, lParam})\nend function\n\ninteger wc wc = allocate(40)\nfunction ClassRegistration()\ninteger WndProcAddress, id\n id = routine_id(\"WndProc\")\n if id = -1 then\n puts(1, \"routine_id failed!\\n\")\n abort(1)\n end if\n WndProcAddress = call_back(id)\n hInstance = c_func(GetModuleHandleA,{NULL})\n ClassName = allocate_string(\"OpenGL\")\n poke4(wc,or_all({CS_HREDRAW, CS_VREDRAW, CS_OWNDC}))\n poke4(wc+4,WndProcAddress)\n poke4(wc+8,0)\n poke4(wc+12,0)\n poke4(wc+16,hInstance)\n poke4(wc+20,c_func(LoadIconA,{NULL,IDI_WINLOGO}))\n poke4(wc+24,c_func(LoadCursorA,{NULL, IDC_ARROW}))\n poke4(wc+28,NULL)\n poke4(wc+32,NULL)\n poke4(wc+36,ClassName)\n if not c_func(RegisterClassA,{wc}) then\n retval = message_box(\"Failed to register class\",\"Error\", or_bits(MB_OK,MB_ICONINFORMATION))\n return FALSE\n else\n return TRUE\n end if\nend function\n\ninteger regd regd = FALSE\nprocedure CreateGLWindow(atom title, integer width, integer height, integer bits, integer fullscreenflag)\n atom PixelFormat, pfd, dwExStyle, dwStyle\n sequence s\n if regd = FALSE then\n if ClassRegistration() then\n regd = TRUE\n end if\n end if\n fullscreen = fullscreenflag\n if fullscreen then\n dmScreenSettings = allocate(156)\n mem_set(dmScreenSettings,0,156)\n s = int_to_bytes(156)\n poke(dmScreenSettings + 36,{s[1],s[2]})\n poke4(dmScreenSettings + 40,or_all({DM_BITSPERPEL,DM_PELSWIDTH,DM_PELSHEIGHT}))\n poke4(dmScreenSettings + 104, bits)\n poke4(dmScreenSettings + 108, width)\n poke4(dmScreenSettings + 112, height)\n if c_func(ChangeDisplaySettingsA,{dmScreenSettings,CDS_FULLSCREEN}) != DISP_CHANGE_SUCCESSFUL then\n if message_box(\"The requested fullscreen mode is not supported by\\nyour video card. \" &\n \"Use windowed mode instead?\",\"Error\", or_bits(MB_YESNO,MB_ICONEXCLAMATION)) = IDYES then\n else\n retval = message_box(\"Program will now close\",\"Error\",or_bits(MB_OK,MB_ICONSTOP))\n end if\n end if\n else\n dmScreenSettings = NULL\n end if\n if fullscreen then\n dwExStyle = WS_EX_APPWINDOW\n dwStyle = WS_POPUP\n if c_func(ShowCursor,{FALSE}) then end if\n else\n dwExStyle = or_bits(WS_EX_APPWINDOW,WS_EX_WINDOWEDGE)\n dwStyle = WS_OVERLAPPEDWINDOW\n end if\n WindowRect = allocate(16)\n poke4(WindowRect,0)\n poke4(WindowRect + 4,width)\n poke4(WindowRect + 8, 0)\n poke4(WindowRect + 12, height)\n if c_func(AdjustWindowRectEx,{WindowRect, dwStyle, FALSE, dwExStyle}) then end if\n hWnd = c_func(CreateWindowExA,{dwExStyle, --extended window style\n ClassName, --class\n title, --window caption\n or_all({WS_CLIPSIBLINGS,WS_CLIPCHILDREN,dwStyle}), --window style\n 0,\n 0,\n peek4u(WindowRect + 4) - peek4u(WindowRect),\n peek4u(WindowRect + 12) - peek4u(WindowRect + 8),\n NULL,\n NULL,\n hInstance,\n NULL})\n if hWnd = NULL then\n KillGLWindow()\n retval = message_box(\"Window creation error\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n pfd = allocate(40) --PIXELFORMATDESCRIPTOR\n mem_set(pfd,0,40)\n poke(pfd, 40) --size of pfd structure\n poke(pfd + 2, 1) --version\n poke4(pfd + 4, or_all({PFD_DRAW_TO_WINDOW,PFD_SUPPORT_OPENGL,PFD_DOUBLEBUFFER})) --properties flags\n poke(pfd + 8, PFD_TYPE_RGBA) --request an rgba format\n poke(pfd + 9, 24) --select color depth\n poke(pfd + 23, 24) --32bit Z-buffer\n\n hDC = c_func(GetDC,{hWnd}) --create GL device context to match window device context\n if not hDC then\n KillGLWindow()\n retval = message_box(\"Can't create a GL device context\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n PixelFormat = c_func(ChoosePixelFormat,{hDC,pfd}) --find a pixel format matching PIXELFORMATDESCRIPTOR\n if not PixelFormat then\n KillGLWindow()\n retval = message_box(\"Can't find a suitable pixel format\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n if not (c_func(SetPixelFormat,{hDC,PixelFormat,pfd})) then --set the pixel format\n KillGLWindow()\n retval = message_box(\"Can't set the pixel format\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n if not c_func(DescribePixelFormat, {hDC,PixelFormat,40,pfd}) then\n retval = message_box(\"Can't describe the pixel format\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n hRC = c_func(wglCreateContext,{hDC}) --create GL rendering context\n if not hRC then\n KillGLWindow()\n retval = message_box(\"Can't create a GL rendering context\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n if not (c_func(wglMakeCurrent,{hDC,hRC})) then --make the GL rendering context active\n KillGLWindow()\n retval = message_box(\"Can't activate the GL rendering context\",\"Error\",or_bits(MB_OK,MB_ICONEXCLAMATION))\n end if\n retval = c_func(ShowWindow,{hWnd,SW_SHOW}) --show the window\n retval = c_func(SetForegroundWindow,{hWnd}) --set it to always be in foreground\n retval = c_func(SetFocus,{hWnd}) --give it focus\n ReSizeGLScene(width, height) --draw the GL scene to match the window size\n InitGL() --initialize OpenGL\nend procedure\n\ninteger MSG MSG = allocate(28)\ninteger title title = allocate_string(\"OpenGL\")\nprocedure WinMain()\ninteger done, msg_message\n done = FALSE\n if message_box(\"Would you like to run in fullscreen mode?\",\"Start Fullscreen?\",or_bits(MB_YESNO,MB_ICONQUESTION)) = IDNO then\n fullscreen = FALSE\n else\n fullscreen = TRUE\n end if\n CreateGLWindow(title,640,480,24,fullscreen)\n while not done do\n if c_func(PeekMessageA,{MSG,NULL,0,0,PM_REMOVE}) then\n msg_message = peek4u(MSG+4)\n if msg_message = WM_QUIT then\n done = TRUE\n else\n retval = c_func(TranslateMessage,{MSG})\n retval = c_func(DispatchMessageA,{MSG})\n end if\n else\n if ((active and not DrawGLScene()) or keys[VK_ESCAPE]) then\n done = TRUE\n else\n retval = c_func(SwapBuffers,{hDC})\n if keys[VK_F1] then\n keys[VK_F1] = FALSE\n KillGLWindow()\n if fullscreen = 0 then\n fullscreen = 1\n else\n fullscreen = 0\n end if\n CreateGLWindow(title,640,480,24,fullscreen)\n end if\n end if\n end if\n end while\n KillGLWindow()\nend procedure\n\nWinMain()\n","language":"Euphoria"},{"code":"USING: kernel math math.rectangles opengl.gl sequences ui\nui.gadgets ui.render ;\nIN: rosettacode.opengl\n\nTUPLE: triangle-gadget < gadget ;\n\n: reshape ( width height -- )\n [ 0 0 ] 2dip glViewport\n GL_PROJECTION glMatrixMode\n glLoadIdentity\n -30.0 30.0 -30.0 30.0 -30.0 30.0 glOrtho\n GL_MODELVIEW glMatrixMode ;\n\n: paint ( -- )\n 0.3 0.3 0.3 0.0 glClearColor\n GL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT bitor glClear\n GL_SMOOTH glShadeModel\n glLoadIdentity\n -15.0 -15.0 0.0 glTranslatef\n GL_TRIANGLES glBegin\n 1.0 0.0 0.0 glColor3f 0.0 0.0 glVertex2f\n 0.0 1.0 0.0 glColor3f 30.0 0.0 glVertex2f\n 0.0 0.0 1.0 glColor3f 0.0 30.0 glVertex2f\n glEnd\n glFlush ;\n\nM: triangle-gadget pref-dim* drop { 640 480 } ;\nM: triangle-gadget draw-gadget*\n rect-bounds nip first2 reshape paint ;\n\n: triangle-window ( -- )\n [ triangle-gadget new \"Triangle\" open-window ] with-ui ;\nMAIN: triangle-window\n","language":"Factor"},{"code":"import glconst import float\nglconst also float also opengl also\n","language":"Forth"},{"code":"#! xbigforth\n\\ automatic generated code\n\\ do not edit\n\nalso editor also minos also forth\n\ninclude triangle.fs\ncomponent class triangle\npublic:\n early widget\n early open\n early dialog\n early open-app\n ( [varstart] ) ( [varend] )\nhow:\n : open new DF[ 0 ]DF s\" Triangle\" open-component ;\n : dialog new DF[ 0 ]DF s\" Triangle\" open-dialog ;\n : open-app new DF[ 0 ]DF s\" Triangle\" open-application ;\nclass;\n\ntriangle implements\n ( [methodstart] ) ( [methodend] )\n : widget ( [dumpstart] )\n GL[ ^ glcanvas with\n0 0 w @ h @ glViewport\nGL_PROJECTION glMatrixMode\nglLoadIdentity\n-30e 30e -30e 30e -30e 30e glOrtho\nGL_MODELVIEW glMatrixMode\n0.3e 0.3e 0.3e 0.0e glClearColor\nGL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT or glClear\nGL_SMOOTH glShadeModel\nglLoadIdentity\n-15e -15e 0e glTranslatef\nGL_TRIANGLES glBegin\n1e 0e 0e glColor3f\n0e 0e glVertex2f\n0e 1e 0e glColor3f\n30e 0e glVertex2f\n0e 0e 1e glColor3f\n0e 30e glVertex2f\nglEnd\nglFlush\nendwith ]GL ( MINOS ) ^^ CK[ ( x y b n -- ) 2drop 2drop ]CK ( MINOS ) $280 $1 *hfil $1E0 $1 *vfil glcanvas new\n &1 vabox new\n ( [dumpend] ) ;\n : init ^>^^ assign widget 1 :: init ;\nclass;\n\n: main\n triangle open-app\n $1 0 ?DO stop LOOP bye ;\nscript? [IF] main [THEN]\nprevious previous previous\n","language":"Forth"},{"code":"#include \"fbgfx.bi\"\n#include once \"GL/gl.bi\"\n#include once \"GL/glu.bi\"\n\nscreen 18, 16, , 2\n\nglViewport 0, 0, 640, 480 'Set the viewport\nglMatrixMode GL_PROJECTION ' Select projection\nglLoadIdentity ' Set this to default\ngluPerspective 45.0, 640./480., 0.1, 100.0 ' Set perspective view options\nglMatrixMode GL_MODELVIEW ' Set to modelview mode\nglLoadIdentity ' ...and set it to default\nglClearColor 0.5, 0.5, 0.5, 0.0 ' Set clearscreen color to middle grey\nglShadeModel GL_SMOOTH ' set to smooth shading\nglClearDepth 1.0 ' Allow the deletion of the depth buffer\nglEnable GL_DEPTH_TEST ' turn on depth testing\nglDepthFunc GL_LEQUAL ' The Type Of Depth Test To Do\nglHint GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST ' niceness tweaks\n\ndo\n\nglClear GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT ' clear screen and depth\nglLoadIdentity\n\nglTranslatef 0.0f, 0.0f, -6.0f ' move camera back so we can see the triangle\n\nglBegin GL_TRIANGLES ' Drawing Using Triangles\n glColor3f 1.0f, 0.0f, 0.0f ' red\n glVertex3f 0.0f, 1.0f, 0.0f ' Top\n glColor3f 0.0f, 1.0f, 0.0f ' green\n glVertex3f -1.0f,-1.0f, 0.0f ' Bottom Left\n glColor3f 0.0f, 0.0f, 1.0f ' blue\n glVertex3f 1.0f,-1.0f, 0.0f ' Bottom Right\nglEnd ' Finished Drawing The Triangle\n\nflip\n\nloop while inkey = \"\"\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n gl \"github.com/chsc/gogl/gl21\"\n \"github.com/go-gl/glfw/v3.2/glfw\"\n \"log\"\n \"runtime\"\n)\n\n// Window dimensions.\nconst (\n Width = 640\n Height = 480\n)\n\nfunc check(err error) {\n if err != nil {\n log.Fatal(err)\n }\n}\n\nfunc main() {\n // OpenGL requires a dedicated OS thread.\n runtime.LockOSThread()\n defer runtime.UnlockOSThread()\n\n err := glfw.Init()\n check(err)\n defer glfw.Terminate()\n\n // Open window with the specified dimensions.\n window, err := glfw.CreateWindow(Width, Height, \"Triangle\", nil, nil)\n check(err)\n\n window.MakeContextCurrent()\n\n err = gl.Init()\n check(err) /* may need to comment out this line for this program to work on Windows 10 */\n\n // Initiate viewport.\n resize(Width, Height)\n\n // Register that we are interested in receiving close and resize events.\n window.SetCloseCallback(func(w *glfw.Window) {\n return\n })\n window.SetSizeCallback(func(w *glfw.Window, width, height int) {\n resize(width, height)\n })\n\n for !window.ShouldClose() {\n draw()\n window.SwapBuffers()\n glfw.PollEvents()\n }\n}\n\n// resize resizes the window to the specified dimensions.\nfunc resize(width, height int) {\n gl.Viewport(0, 0, gl.Sizei(width), gl.Sizei(height))\n gl.MatrixMode(gl.PROJECTION)\n gl.LoadIdentity()\n gl.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n gl.MatrixMode(gl.MODELVIEW)\n}\n\n// draw draws the triangle.\nfunc draw() {\n gl.ClearColor(0.3, 0.3, 0.3, 0.0)\n gl.Clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT)\n\n gl.ShadeModel(gl.SMOOTH)\n\n gl.LoadIdentity()\n gl.Translatef(-15.0, -15.0, 0.0)\n\n gl.Begin(gl.TRIANGLES)\n\n gl.Color3f(1.0, 0.0, 0.0)\n gl.Vertex2f(0.0, 0.0)\n\n gl.Color3f(0.0, 1.0, 0.0)\n gl.Vertex2f(30.0, 0.0)\n\n gl.Color3f(0.0, 0.0, 1.0)\n gl.Vertex2f(0.0, 30.0)\n\n gl.End()\n\n gl.Flush()\n}\n","language":"Go"},{"code":"import Graphics.Rendering.OpenGL\nimport Graphics.UI.GLUT\n\nmain = do\n getArgsAndInitialize\n createWindow \"Triangle\"\n displayCallback $= display\n\n matrixMode $= Projection\n loadIdentity\n ortho2D 0 30 0 30\n matrixMode $= Modelview 0\n\n mainLoop\n\ndisplay = do\n clear [ColorBuffer]\n renderPrimitive Triangles $ do\n corner 1 0 0 5 5\n corner 0 1 0 25 5\n corner 0 0 1 5 25\n swapBuffers\n\ncorner r g b x y = do color (Color3 r g b :: Color3 GLfloat)\n vertex (Vertex2 x y :: Vertex2 GLfloat)\n","language":"Haskell"},{"code":"coclass 'example'\n(coinsert[require) 'jzopengl'\n\ncreate=:3 :0\n ogl=: ''conew'jzopengl'\n wd 'pc p;cc c isigraph opengl rightmove bottommove;pas 0 0;pshow;'\n)\n\np_close=: destroy=:3 :0\n destroy__ogl''\n wd'pclose'\n codestroy''\n)\n\ncorner=:4 :0\n glColor3d x\n glVertex2d y\n)\n\np_c_paint=:3 :0\n rc__ogl''\n glClear GL_COLOR_BUFFER_BIT\n glBegin GL_TRIANGLES\n 1 0 0 corner 0 0-0.5\n 0 1 0 corner 1 0-0.5\n 0 0 1 corner 0 1-0.5\n glEnd''\n show__ogl''\n)\n\nconew~'example'\n","language":"J"},{"code":"import org.lwjgl.LWJGLException;\nimport org.lwjgl.opengl.Display;\nimport org.lwjgl.opengl.DisplayMode;\nimport static org.lwjgl.opengl.GL11.*;\n\n\npublic class OpenGlExample {\n\n\tpublic void run() throws LWJGLException {\n\t\tDisplay.setDisplayMode(new DisplayMode(640, 480));\n\t\tDisplay.create();\n\t\t\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglLoadIdentity();\n\t\tglOrtho(-30, 30, -30, 30, -30, 30);\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\t\n\t\twhile(!Display.isCloseRequested()) {\n\t\t\trender();\n\t\t\t\n\t\t\tDisplay.update();\n\t\t}\n\t\t\n\t\tDisplay.destroy();\n\t}\n\t\n\tpublic void render() {\n\t\t\n\t\tglClearColor(0.3f, 0.3f, 0.3f, 0.0f);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\t\n\t\tglShadeModel(GL_SMOOTH);\n\t\t\n\t\tglLoadIdentity();\n\t\tglTranslatef(-15.0f, -15.0f, 0.0f);\n\t\t\n\t\tglBegin(GL_TRIANGLES);\n\t\tglColor3f(1.0f, 0.0f, 0.0f);\n\t\tglVertex2f(0.0f, 0.0f);\n\t\tglColor3f(0.0f, 1.0f, 0.0f);\n\t\tglVertex2f(30f, 0.0f);\n\t\tglColor3f(0.0f, 0.0f, 1.0f);\n\t\tglVertex2f(0.0f, 30.0f);\n\t\tglEnd();\n\t\t\n\t}\n\t\n\tpublic static void main(String[] args) {\n\t\tOpenGlExample openGlExmpl = new OpenGlExample();\n\t\ttry {\n\t\t\topenGlExmpl.run();\n\t\t} catch(LWJGLException e) {\n\t\t\tSystem.err.println(e);\n\t\t}\n\t}\n\t\n}\n","language":"Java"},{"code":"<html style=\"margin: 0;\">\n <head>\n <title>Minimal WebGL Example</title>\n <!-- This use of <script> elements is so that we can have multiline text\n without quoting it inside of JavaScript; the web browser doesn't\n actually do anything besides store the text of these. -->\n <script id=\"shader-fs\" type=\"x-shader/x-fragment\">\n precision highp float;\n varying vec4 v_color;\n void main(void) {\n // \"Varying\" variables are implicitly interpolated across triangles.\n gl_FragColor = v_color;\n }\n </script>\n <script id=\"shader-vs\" type=\"x-shader/x-vertex\">\n attribute vec3 a_position;\n attribute vec4 a_color;\n varying vec4 v_color;\n void main(void) {\n gl_Position = vec4(a_position, 1.0);\n v_color = a_color;\n }\n </script>\n <script type=\"text/javascript\">\n function getShader(gl, id) {\n var scriptElement = document.getElementById(id);\n // Create shader object\n var shader;\n if (scriptElement.type == \"x-shader/x-fragment\")\n shader = gl.createShader(gl.FRAGMENT_SHADER);\n else if (scriptElement.type == \"x-shader/x-vertex\")\n shader = gl.createShader(gl.VERTEX_SHADER);\n else\n throw new Error(\"unknown shader script type\");\n // Compile shader from source\n gl.shaderSource(shader, scriptElement.textContent);\n gl.compileShader(shader);\n if (!gl.getShaderParameter(shader, gl.COMPILE_STATUS))\n throw new Error(gl.getShaderInfoLog(shader));\n return shader;\n }\n </script>\n </head>\n <body style=\"margin: 0;\">\n <canvas id=\"glcanvas\" style=\"border: none; margin: auto; display: block;\" width=\"640\" height=\"480\"></canvas>\n <script type=\"text/javascript\">\n var canvas = document.getElementById(\"glcanvas\");\n\n // Get WebGL context.\n var gl = canvas.getContext(\"webgl\")\n || canvas.getContext(\"experimental-webgl\");\n if (!gl)\n throw new Error(\"WebGL context not found\");\n\n // Create shader program from vertex and fragment shader code.\n var shaderProgram = gl.createProgram();\n gl.attachShader(shaderProgram, getShader(gl, \"shader-vs\"));\n gl.attachShader(shaderProgram, getShader(gl, \"shader-fs\"));\n gl.linkProgram(shaderProgram);\n if (!gl.getProgramParameter(shaderProgram, gl.LINK_STATUS))\n throw new Error(gl.getProgramInfoLog(shaderProgram));\n\n // Specify to render using that program.\n gl.useProgram(shaderProgram);\n\n // Get the indexes to communicate vertex attributes to the program.\n var positionAttr = gl.getAttribLocation(shaderProgram, \"a_position\");\n var colorAttr = gl.getAttribLocation(shaderProgram, \"a_color\");\n // And specify that we will be actually delivering data to those attributes.\n gl.enableVertexAttribArray(positionAttr);\n gl.enableVertexAttribArray(colorAttr);\n\n // Store vertex positions and colors in array buffer objects.\n var vertices;\n var positionBuffer = gl.createBuffer();\n gl.bindBuffer(gl.ARRAY_BUFFER, positionBuffer);\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vertices = [\n -0.5, -0.5, 0,\n +0.5, -0.5, 0,\n -0.5, +0.5, 0\n ]), gl.STATIC_DRAW);\n var colorBuffer = gl.createBuffer();\n gl.bindBuffer(gl.ARRAY_BUFFER, colorBuffer);\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array([\n 1, 0, 0, 1,\n 0, 1, 0, 1,\n 0, 0, 1, 1\n ]), gl.STATIC_DRAW);\n var numVertices = vertices.length / 3; // 3 coordinates per vertex\n\n // Set GL state\n gl.clearColor(0.3, 0.3, 0.3, 1.0);\n gl.enable(gl.DEPTH_TEST);\n gl.viewport(0, 0, gl.drawingBufferWidth || canvas.width,\n gl.drawingBufferHeight || canvas.height);\n\n // Draw scene.\n // If this were an animation, everything after this point would go in a main loop.\n // Clear frame.\n gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT);\n // Specify the array data to render.\n // 3 and 4 are the lengths of the vectors (3 for XYZ, 4 for RGBA).\n gl.bindBuffer(gl.ARRAY_BUFFER, positionBuffer);\n gl.vertexAttribPointer(positionAttr, 3, gl.FLOAT, false, 0, 0);\n gl.bindBuffer(gl.ARRAY_BUFFER, colorBuffer);\n gl.vertexAttribPointer(colorAttr, 4, gl.FLOAT, false, 0, 0);\n // Draw triangles using the specified arrays.\n gl.drawArrays(gl.TRIANGLES, 0, numVertices);\n\n // Check for errors.\n var e;\n while (e = gl.getError())\n console.log(\"GL error\", e);\n </script>\n </body>\n</html>\n","language":"JavaScript"},{"code":"using Makie\n\nmesh([(0.0, 0.0), (0.5, 1.0), (1.0, 0.0)], color = [:red, :green, :blue], shading = false)\n","language":"Julia"},{"code":"// Kotlin Native version 0.3\n\nimport kotlinx.cinterop.*\nimport opengl.*\n\nfun paint() {\n glClearColor(0.3f, 0.3f, 0.3f, 0.0f)\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT)\n\n glShadeModel(GL_SMOOTH)\n\n glLoadIdentity()\n glTranslatef(-15.0f, -15.0f, 0.0f)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0f, 0.0f, 0.0f)\n glVertex2f(0.0f, 0.0f)\n glColor3f(0.0f, 1.0f, 0.0f)\n glVertex2f(30.0f, 0.0f)\n glColor3f(0.0f, 0.0f, 1.0f)\n glVertex2f(0.0f, 30.0f)\n glEnd()\n\n glFlush()\n}\n\nfun reshape(width: Int, height: Int) {\n glViewport(0, 0, width, height)\n glMatrixMode(GL_PROJECTION)\n glLoadIdentity()\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n glMatrixMode(GL_MODELVIEW)\n}\n\nfun main(args: Array<String>) {\n memScoped {\n val argc = alloc<IntVar>().apply { value = 0 }\n glutInit(argc.ptr, null)\n }\n\n glutInitWindowSize(640, 480)\n glutCreateWindow(\"Triangle\")\n\n glutDisplayFunc(staticCFunction(::paint))\n glutReshapeFunc(staticCFunction(::reshape))\n\n glutMainLoop()\n}\n","language":"Kotlin"},{"code":"nomainwin\n struct rect, x as long, y as long, x2 as long, y2 as long\n struct PFD, Size as word, Version as word, Flags as long,_\n PixelType as char[1], ColorBits as char[1], RedBits as char[1],_\n RedShift as char[1], GreenBits as char[1], GreenShift as char[1],_\n BlueBits as char[1], BlueShift as char[1], AlphaBits as char[1],_\n AlphaShift as char[1],AccumBits as char[1], AccumRedBits as char[1],_\n AccumGreenBits as char[1], AccumBlueBits as char[1], AccumAlphaBits as char[1],_\n DepthBits as char[1], StencilBits as char[1], AuxBuffers as char[1],_\n LayerType as char[1], Reserved as char[1], LayerMask as long,_\n VisibleMask as long, DamageMask as long\n PFD.Version.struct=1\n PFD.ColorBits.struct=24\n PFD.DepthBits.struct=16\n PFD.Size.struct=len(PFD.struct)\n PFD.Flags.struct=37\n GlColorBufferBit=16384\n open \"opengl32.dll\" for dll as #gl\n open \"glu32.dll\" for dll as #glu\n WindowWidth=500\n WindowHeight=500\n UpperLeftX=1\n UpperLeftY=1\n open \"Triangle\" for window_nf as #main\n print #main,\"trapclose [quit]\"\n MainH=hwnd(#main)\n calldll #user32,\"GetDC\", MainH as ulong, MainDC as ulong\n calldll #gdi32,\"ChoosePixelFormat\", MainDC as ulong, PFD as struct, ret as long\n calldll #gdi32, \"SetPixelFormat\", MainDC as ulong, ret as long, PFD as struct, t as long\n calldll #gl,\"wglCreateContext\", MainDC as ulong, GLContext as ulong\n calldll #gl,\"wglMakeCurrent\", MainDC as ulong, GLContext as ulong, ret as long\n calldll #gl,\"glClear\", GlColorBufferBit as long, ret as long\n calldll #gl,\"glRotated\", 0 as double, 0 as double, 0 as double, 0 as double, ret as long\n calldll #gl,\"glBegin\", 4 as long, ret as long\n calldll #gl,\"glColor3d\", 0 as double, 0 as double, 255 as double, ret as long\n calldll #gl,\"glVertex3i\", -1 as long, -1 as long, 0 as long, ret as long\n calldll #gl,\"glColor3d\", 255 as double, 0 as double, 0 as double, ret as long\n calldll #gl,\"glVertex3i\", 0 as long, 1 as long, 0 as long, ret as long\n calldll #gl,\"glColor3d\", 0 as double, 255 as double, 0 as double, ret as long\n calldll #gl,\"glVertex3i\", 1 as long, -1 as long, 0 as long, ret as long\n calldll #gl,\"glEnd\", ret as void\n calldll #gdi32,\"SwapBuffers\", MainDC as ulong, ret as long\n wait\n[quit]\n calldll #gl,\"wglMakeCurrent\", 0 as ulong, 0 as ulong, ret as long\n calldll #gl,\"wglDeleteContext\", GLContext as ulong, ret as long\n calldll #user32, \"ReleaseDC\", MainH as ulong, MainDC as ulong,ret as long\n close #main\n close #glu\n close #gl\n end\n","language":"Liberty-BASIC"},{"code":"global gOpenGL -- RavOpenGL xtra instance\nglobal GL -- OpenGL constants\n\non startMovie\n -- Load the OpenGL script xtra\n gOpenGL = xtra(\"RavOpenGL\").new()\n\n -- Load GL DLL\n gOpenGL.RavLoadGL(\"\", \"\")\n\n -- Function omitted in demo code: loads OpenGL constants into namespace GL\n loadGLConstants()\n\n -- Window settings\n w = 640\n h = 480\n _movie.stage.title = \"Triangle\"\n _movie.stage.rect = rect(0, 0, w, h)\n _movie.centerStage = TRUE\n\n -- Create OpenGL display sprite\n m = new(#RavOpenGLDisplay)\n _movie.puppetSprite(1, TRUE)\n sprite(1).rect = rect(0, 0, w, h)\n sprite(1).member = m\n _movie.updateStage()\n\n -- Create the OpenGL buffer\n mainBufferID = gOpenGL.RavCreateBuffer(w, h, 32, 32)\n\n -- Set the sharing mode between script and sprite xtras\n dcID = gOpenGL.RavGetBufferProp(mainBufferID, #ravGC)\n sprite(1).RavShareBuffer(dcID, #true)\n\n gOpenGL.glViewport(0, 0, w, h)\n gOpenGL.glMatrixMode(GL.PROJECTION)\n gOpenGL.glLoadIdentity()\n gOpenGL.glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n gOpenGL.glMatrixMode(GL.MODELVIEW)\n\n gOpenGL.glClearColor(0.3, 0.3, 0.3, 0.0)\n gOpenGL.glClear(GL.COLOR_BUFFER_BIT + GL.DEPTH_BUFFER_BIT)\n gOpenGL.glShadeModel(GL.SMOOTH)\n gOpenGL.glLoadIdentity()\n gOpenGL.glTranslatef(-15.0, -15.0, 0.0)\n gOpenGL.glBegin(GL.TRIANGLES)\n gOpenGL.glColor3f(1.0, 0.0, 0.0)\n gOpenGL.glVertex2f(0.0, 0.0)\n gOpenGL.glColor3f(0.0, 1.0, 0.0)\n gOpenGL.glVertex2f(30.0, 0.0)\n gOpenGL.glColor3f(0.0, 0.0, 1.0)\n gOpenGL.glVertex2f(0.0, 30.0)\n gOpenGL.glEnd()\n gOpenGL.glFlush()\n\n -- Show the window\n _movie.stage.visible = TRUE\nend\n","language":"Lingo"},{"code":"local gl = require \"luagl\"\nlocal iup = require \"iuplua\"\nrequire \"iupluagl\"\n\nlocal function paint()\n gl.ClearColor(0.3,0.3,0.3,0.0)\n gl.Clear\"COLOR_BUFFER_BIT,DEPTH_BUFFER_BIT\"\n\n gl.ShadeModel\"SMOOTH\"\n\n gl.LoadIdentity()\n gl.Translate(-15.0, -15.0, 0.0)\n\n gl.Begin\"TRIANGLES\"\n gl.Color(1.0, 0.0, 0.0)\n gl.Vertex(0.0, 0.0)\n gl.Color(0.0, 1.0, 0.0)\n gl.Vertex(30.0, 0.0)\n gl.Color(0.0, 0.0, 1.0)\n gl.Vertex(0.0, 30.0)\n gl.End()\n\n gl.Flush()\nend\n\nlocal function reshape(width, height)\n gl.Viewport(0, 0, width, height)\n gl.MatrixMode\"PROJECTION\"\n gl.LoadIdentity()\n gl.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n gl.MatrixMode\"MODELVIEW\"\nend\n\nlocal glc = iup.glcanvas{rastersize=\"640x480\"}\nfunction glc:action() paint() end\nfunction glc:resize_cb(w,h) reshape(w,h) end\nfunction glc:map_cb() iup.GLMakeCurrent(self) end\n\nlocal dlg = iup.dialog{title=\"Triangle\", shrink=\"yes\"; glc}\ndlg:show()\n\niup.MainLoop()\n","language":"Lua"},{"code":"Style[Graphics3D[{Polygon[{{-1, 0, 0}, {1, 0, 0}, {0, Sqrt[3], 0.5}},\n VertexColors -> {Red, Green, Blue}]}, Boxed -> False],\n RenderingOptions -> {\"3DRenderingEngine\" -> \"OpenGL\"}]\n","language":"Mathematica"},{"code":"newMesh = mesh numVerts:3 numFaces:1\nsetMesh newMesh vertices:#([-100, -100, 0], [100, -100, 0], [-100, 100, 0]) faces:#([1, 2, 3])\ndefaultVCFaces newMesh\nsetVertColor newMesh 1 red\nsetVertColor newMesh 2 green\nsetVertColor newMesh 3 blue\nsetCVertMode newMesh true\nupdate newMesh\nviewport.setType #view_top\nmax tool maximize\nviewport.SetRenderLevel #smoothhighlights\n","language":"MAXScript"},{"code":":- module opengl.\n:- interface.\n\n:- import_module io.\n:- pred main(io::di, io::uo) is det.\n\n:- implementation.\n:- import_module list, glut, glut.callback, glut.window, mogl.\n\nmain(!IO) :-\n glut.init_window_size(640, 480, !IO),\n glut.window.create(\"Triangle\", !IO),\n glut.callback.display_func(opengl.paint, !IO),\n glut.callback.reshape_func(opengl.reshape, !IO),\n glut.main_loop(!IO).\n\n:- pred paint(io::di, io::uo) is det.\n\npaint(!IO) :-\n mogl.clear_color(0.3, 0.3, 0.3 , 0.0, !IO),\n mogl.clear([color, depth], !IO),\n\n mogl.shade_model(smooth, !IO),\n\n mogl.load_identity(!IO),\n mogl.translate(-15.0, -15.0, 0.0, !IO),\n\n mogl.begin(triangles, !IO),\n mogl.color3(1.0, 0.0, 0.0, !IO),\n mogl.vertex2(0.0, 0.0, !IO),\n mogl.color3(0.0, 1.0, 0.0, !IO),\n mogl.vertex2(30.0, 0.0, !IO),\n mogl.color3(0.0, 0.0, 1.0, !IO),\n mogl.vertex2(0.0, 30.0, !IO),\n mogl.end(!IO),\n\n mogl.flush(!IO).\n\n:- pred reshape(int::in, int::in, io::di, io::uo) is det.\n\nreshape(Width, Height, !IO) :-\n mogl.viewport(0, 0, Width, Height, !IO),\n mogl.matrix_mode(projection, !IO),\n mogl.load_identity(!IO),\n mogl.ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0, !IO),\n mogl.matrix_mode(modelview, !IO).\n","language":"Mercury"},{"code":"import opengl, opengl/glut\n\nproc paint() {.cdecl.} =\n glClearColor(0.3,0.3,0.3,0.0)\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT)\n\n glShadeModel(GL_SMOOTH)\n\n glLoadIdentity()\n glTranslatef(-15.0, -15.0, 0.0)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0, 0.0, 0.0)\n glVertex2f(0.0, 0.0)\n glColor3f(0.0, 1.0, 0.0)\n glVertex2f(30.0, 0.0)\n glColor3f(0.0, 0.0, 1.0)\n glVertex2f(0.0, 30.0)\n glEnd()\n\n glFlush()\n\nproc reshape(width, height: cint) {.cdecl.} =\n glViewport(0, 0, width, height)\n glMatrixMode(GL_PROJECTION)\n glLoadIdentity()\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n glMatrixMode(GL_MODELVIEW)\n\nenableAutoGlErrorCheck(false)\nloadExtensions()\nglutInit()\nglutInitWindowSize(640, 480)\ndiscard glutCreateWindow(\"Triangle\")\n\nglutDisplayFunc(paint)\nglutReshapeFunc(reshape)\n\nglutMainLoop()\n","language":"Nim"},{"code":"open GL\nopen Glut\n\nlet display() =\n glClearColor 0.3 0.3 0.3 0.0;\n glClear[GL_COLOR_BUFFER_BIT; GL_DEPTH_BUFFER_BIT];\n\n glShadeModel GL_SMOOTH;\n\n glLoadIdentity();\n glTranslate (-15.0) (-15.0) (0.0);\n\n glBegin GL_TRIANGLES;\n glColor3 1.0 0.0 0.0;\n glVertex2 0.0 0.0;\n glColor3 0.0 1.0 0.0;\n glVertex2 30.0 0.0;\n glColor3 0.0 0.0 1.0;\n glVertex2 0.0 30.0;\n glEnd();\n\n glFlush();\n;;\n\nlet reshape ~width ~height =\n glViewport 0 0 width height;\n glMatrixMode GL_PROJECTION;\n glLoadIdentity();\n glOrtho(-30.0) 30.0 (-30.0) 30.0 (-30.0) 30.0;\n glMatrixMode GL_MODELVIEW;\n;;\n\nlet () =\n ignore(glutInit Sys.argv);\n glutInitWindowSize 640 480;\n ignore(glutCreateWindow \"Triangle\");\n\n glutDisplayFunc ~display;\n glutReshapeFunc ~reshape;\n\n glutMainLoop();\n;;\n","language":"OCaml"},{"code":"(import (lib gl))\n(gl:set-window-title \"Rosettacode OpenGL example\")\n\n(import (OpenGL version-1-0))\n\n(glShadeModel GL_SMOOTH)\n(glClearColor 0.3 0.3 0.3 1)\n(glMatrixMode GL_PROJECTION)\n(glLoadIdentity)\n(glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0)\n\n(gl:set-renderer (lambda (mouse)\n (glClear GL_COLOR_BUFFER_BIT)\n\n (glMatrixMode GL_MODELVIEW)\n (glLoadIdentity)\n (glTranslatef -15.0 -15.0 0.0)\n\n (glBegin GL_TRIANGLES)\n (glColor3f 1.0 0.0 0.0)\n (glVertex2f 0.0 0.0)\n (glColor3f 0.0 1.0 0.0)\n (glVertex2f 30.0 0.0)\n (glColor3f 0.0 0.0 1.0)\n (glVertex2f 0.0 30.0)\n (glEnd)\n))\n","language":"Ol"},{"code":" title=\"Rotating Triangle\"\n include \"OpenglSceneFrame.inc\"\n\n\n sub Initialize(sys hWnd)\n '=======================\n SetTimer hWnd,1,10,NULL\n end sub\n '\n sub Scene(sys hWnd)\n '==================\n '\n static single ang1,angi1=1\n '\n glClearColor 0.3, 0.3, 0.5, 0\n glClear GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT\n '\n glLoadIdentity\n '\n '\n gltranslatef 0.0, 0.0, -4.0\n glrotatef ang1, 0.0, 0.0, 1.0\n '\n glBegin GL_TRIANGLES\n glColor3f 1.0, 0.0, 0.0 : glVertex3f 0.0, 1.0, 0.0\n glColor3f 0.0, 1.0, 0.0 : glVertex3f -1.0, -1.0, 0.0\n glColor3f 0.0, 0.0, 1.0 : glVertex3f 1.0, -1.0, 0.0\n glEnd\n '\n 'UPDATE ROTATION ANGLES\n '\n ang1+=angi1\n if ang1>360 then ang1-=360\n '\n end sub\n\n\n sub Release(sys hwnd)\n '====================\n killTimer hwnd, 1\n end sub\n","language":"OxygenBasic"},{"code":"Program OpenGLDemo;\n\nuses\n SysUtils,\n ctypes,\n gl,\n Glut;\n\nprocedure paint; cdecl;\nbegin\n glClearColor(0.3,0.3,0.3,0.0);\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\n\n glShadeModel(GL_SMOOTH);\n\n glLoadIdentity();\n glTranslatef(-15.0, -15.0, 0.0);\n\n glBegin(GL_TRIANGLES);\n glColor3f(1.0, 0.0, 0.0);\n glVertex2f(0.0, 0.0);\n glColor3f(0.0, 1.0, 0.0);\n glVertex2f(30.0, 0.0);\n glColor3f(0.0, 0.0, 1.0);\n glVertex2f(0.0, 30.0);\n glEnd();\n\n glFlush();\nend;\n\nprocedure reshape(width, height: cint); cdecl;\nbegin\n glViewport(0, 0, width, height);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\n glMatrixMode(GL_MODELVIEW);\nend;\n\nbegin\n glutInit(@argc, @argv);\n glutInitWindowSize(640, 480);\n glutCreateWindow('Triangle');\n\n glutDisplayFunc(@paint);\n glutReshapeFunc(@reshape);\n\n glutMainLoop();\nend.\n","language":"Pascal"},{"code":"use OpenGL;\n\nsub triangle {\n glBegin GL_TRIANGLES;\n glColor3f 1.0, 0.0, 0.0;\n glVertex2f 5.0, 5.0;\n glColor3f 0.0, 1.0, 0.0;\n glVertex2f 25.0, 5.0;\n glColor3f 0.0, 0.0, 1.0;\n glVertex2f 5.0, 25.0;\n glEnd;\n};\n\nglpOpenWindow;\nglMatrixMode GL_PROJECTION;\nglLoadIdentity;\ngluOrtho2D 0.0, 30.0, 0.0, 30.0;\nglMatrixMode GL_MODELVIEW;\n\nglClear GL_COLOR_BUFFER_BIT;\ntriangle;\nglpFlush;\n\nglpMainLoop;\n","language":"Perl"},{"code":"use SDL::App;\nuse SDL::Event;\nuse SDL::OpenGL;\n\n$app = SDL::App->new(\n -gl => 1,\n);\n\nsub triangle {\n glBegin(GL_TRIANGLES);\n glColor(1.0, 0.0, 0.0);\n glVertex(5.0, 5.0);\n glColor(0.0, 1.0, 0.0);\n glVertex(25.0, 5.0);\n glColor(0.0, 0.0, 1.0);\n glVertex(5.0, 25.0);\n glEnd();\n}\n\nglMatrixMode(GL_PROJECTION);\nglLoadIdentity();\ngluOrtho2D(0.0, 30.0, 0.0, 30.0);\nglMatrixMode(GL_MODELVIEW);\nglClear(GL_COLOR_BUFFER_BIT);\ntriangle();\n$app->sync;\n$app->loop ({\n SDL_QUIT() => sub { exit; },\n});\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\OpenGL.exw\n -- =======================\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.1\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">opengl</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandln</span> <span style=\"color: #000000;\">dlg</span>\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">canvas</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">fragment_shader</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n precision highp float;\n varying vec4 v_color;\n void main(void) {\n // \"Varying\" variables are implicitly interpolated across triangles.\n gl_FragColor = v_color;\n }\"\"\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">vertex_shader</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n attribute vec3 a_position;\n attribute vec4 a_color;\n varying vec4 v_color;\n void main(void) {\n gl_Position = vec4(a_position, 1.0);\n v_color = a_color;\n }\"\"\"</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">get_shader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">stype</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">shader</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glCreateShader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stype</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glShaderSource</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shader</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">src</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glCompileShader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shader</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">glGetShaderParameter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shader</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_COMPILE_STATUS</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">glGetShaderInfoLog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shader</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">shader</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">vertices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- (bl)</span>\n <span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- (br)</span>\n <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- (tl)\n -- +0.5, +0.5, 0 }, -- (tr)</span>\n <span style=\"color: #000000;\">colours</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- red (bl)</span>\n <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- green (br)</span>\n <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- blue (tl)</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">set_shader</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupGLMakeCurrent</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">shaderProgram</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glCreateProgram</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">glAttachShader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">get_shader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vertex_shader</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">GL_VERTEX_SHADER</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">glAttachShader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">get_shader</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fragment_shader</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">GL_FRAGMENT_SHADER</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">glLinkProgram</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">glGetProgramParameter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_LINK_STATUS</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">glGetProgramInfoLog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">glUseProgram</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">// Get the indexes to communicate vertex attributes to the program.</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">positionAttr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glGetAttribLocation</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"a_position\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">colorAttr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glGetAttribLocation</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shaderProgram</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"a_color\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">// And specify that we will be actually delivering data to those attributes.</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">positionAttr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colorAttr</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">// Store vertex positions and colors in array buffer objects.</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">positionBuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glCreateBuffer</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">glBindBuffer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">positionBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glFloat32Array</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vertices</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glBufferData</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_STATIC_DRAW</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">positionBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">colorBuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glCreateBuffer</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">glBindBuffer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">colorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glFloat32Array</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colours</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glBufferData</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pData</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_STATIC_DRAW</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnable</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_DEPTH_TEST</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">// Specify the array data to render.\n // 3 and 4 are the lengths of the vectors (3 for XYZ, 4 for RGBA).</span>\n <span style=\"color: #7060A8;\">glBindBuffer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">positionBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glVertexAttribPointer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">positionAttr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_FLOAT</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">positionAttr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glBindBuffer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_ARRAY_BUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">colorBuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glVertexAttribPointer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colorAttr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">GL_FLOAT</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glEnableVertexAttribArray</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colorAttr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">drawn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">action</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">drawn</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">glClearColor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0.3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetIntInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"DRAWSIZE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glViewport</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">glClear</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_COLOR_BUFFER_BIT</span> <span style=\"color: #0000FF;\">||</span> <span style=\"color: #004600;\">GL_DEPTH_BUFFER_BIT</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">// Draw triangles using the specified arrays.</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">numVertices</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">vertices</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">3</span> <span style=\"color: #000080;font-style:italic;\">// 3 coordinates per vertex</span>\n <span style=\"color: #7060A8;\">glDrawArrays</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">GL_TRIANGLES</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numVertices</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">// Check for errors.</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">glGetError</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">GL_NO_ERROR</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"GL error %d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #7060A8;\">glFlush</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">drawn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">canvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGLCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"action\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #008000;\">\"RASTERSIZE=640x480\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"TITLE=OpenGLShader, SHRINK=YES\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupMap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">set_shader</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDestroy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"(load \"@lib/openGl.l\")\n\n(glutInit)\n(glutInitWindowSize 400 300)\n(glutCreateWindow \"Triangle\")\n\n(displayPrg\n (glClearColor 0.3 0.3 0.3 0.0)\n (glClear (| GL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT))\n (glShadeModel GL_SMOOTH)\n (glLoadIdentity)\n (glTranslatef -15.0 -15.0 0.0)\n (glBegin GL_TRIANGLES)\n (glColor3f 1.0 0.0 0.0)\n (glVertex2f 0.0 0.0)\n (glColor3f 0.0 1.0 0.0)\n (glVertex2f 30.0 0.0)\n (glColor3f 0.0 0.0 1.0)\n (glVertex2f 0.0 30.0)\n (glEnd)\n (glFlush) )\n\n(reshapeFunc\n '((Width Height)\n (glViewport 0 0 Width Height)\n (glMatrixMode GL_PROJECTION)\n (glLoadIdentity)\n (glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0)\n (glMatrixMode GL_MODELVIEW) ) )\n\n# Exit upon mouse click\n(mouseFunc '((Btn State X Y) (bye)))\n\n(glutMainLoop)\n","language":"PicoLisp"},{"code":"int main() {\n\tGLUE.init(([\n\t\t\"fullscreen\": 0,\n\t\t\"resolution\": ({ 640, 480 }),\n\t]));\n\t\n\twhile (1) {\n\t\tGL.glViewport(0, 0, 640, 480);\n\t\tGL.glMatrixMode(GL.GL_PROJECTION);\n\t\tGL.glLoadIdentity();\n\t\tGL.glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\n\t\tGL.glMatrixMode(GL.GL_MODELVIEW);\n\t\t\n\t\tGL.glClearColor(0.3,0.3,0.3,0.0);\n\t\tGL.glClear(GL.GL_COLOR_BUFFER_BIT | GL.GL_DEPTH_BUFFER_BIT);\n\t\t\n\t\tGL.glShadeModel(GL.GL_SMOOTH);\n\t\t\n\t\tGL.glLoadIdentity();\n\t\tGL.glTranslate(-15.0, -15.0, 0.0);\n\t\t\n\t\tGL.glBegin(GL.GL_TRIANGLES);\n\t\tGL.glColor(1.0, 0.0, 0.0);\n\t\tGL.glVertex(0.0, 0.0);\n\t\tGL.glColor(0.0, 1.0, 0.0);\n\t\tGL.glVertex(30.0, 0.0);\n\t\tGL.glColor(0.0, 0.0, 1.0);\n\t\tGL.glVertex(0.0, 30.0);\n\t\tGL.glEnd();\n\t\t\n\t\tGL.glFlush();\n\t\t\n\t\tGLUE.swap_buffers();\n\t\tPike.DefaultBackend(0.0);\n\t\tsleep(0.01);\n\t}\n}\n","language":"Pike"},{"code":"XIncludeFile \"OpenGL.pbi\"\npfd.PIXELFORMATDESCRIPTOR\nFlatMode = 0 ; Enable Or disable the 'Flat' rendering\nWindowWidth = 800 ; The window & GLViewport dimensions\nWindowHeight = 600\nhWnd = OpenWindow(0, 0, 0, WindowWidth, WindowHeight, \"OpenGL Triangle\", #PB_Window_SystemMenu)\nhdc = GetDC_(hWnd)\npfd\\nSize = SizeOf(PIXELFORMATDESCRIPTOR)\npfd\\nVersion = 1\npfd\\dwFlags = #PFD_SUPPORT_OPENGL | #PFD_DOUBLEBUFFER | #PFD_DRAW_TO_WINDOW\npfd\\dwLayerMask = #PFD_MAIN_PLANE\npfd\\iPixelType = #PFD_TYPE_RGBA\npfd\\cColorBits = 24\npfd\\cDepthBits = 16\npixformat = ChoosePixelFormat_(hdc, pfd)\nSetPixelFormat_(hdc, pixformat, pfd)\nhrc = wglCreateContext_(hdc)\nwglMakeCurrent_(hdc,hrc)\nglViewport_ (0, 0, WindowWidth-30, WindowHeight-30)\nglPushMatrix_()\nglMatrixMode_(#GL_MODELVIEW)\nglBegin_(#GL_TRIANGLES );\nglColor3f_(1.0, 0.0, 0.0 )\nglVertex2f_( 0.0, 1.0 )\nglColor3f_( 0.0, 1.0, 0.0 )\nglVertex2f_( 0.87, -0.5 );\nglColor3f_( 0.0, 0.0, 1.0 )\nglVertex2f_( -0.87, -0.5 );\nglEnd_()\nglPopMatrix_()\nglFinish_()\nSwapBuffers_(hdc)\nWhile Quit = 0\n Repeat\n EventID = WindowEvent()\n Select EventID\n Case #PB_Event_CloseWindow\n Quit = 1\n EndSelect\n Until EventID = 0\nWend\n","language":"PureBasic"},{"code":"#!/usr/bin/env python\n#-*- coding: utf-8 -*-\n\nfrom OpenGL.GL import *\nfrom OpenGL.GLUT import *\n\ndef paint():\n glClearColor(0.3,0.3,0.3,0.0)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT)\n\n glShadeModel(GL_SMOOTH)\n\n glLoadIdentity()\n glTranslatef(-15.0, -15.0, 0.0)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0, 0.0, 0.0)\n glVertex2f(0.0, 0.0)\n glColor3f(0.0, 1.0, 0.0)\n glVertex2f(30.0, 0.0)\n glColor3f(0.0, 0.0, 1.0)\n glVertex2f(0.0, 30.0)\n glEnd()\n\n glFlush()\n\ndef reshape(width, height):\n glViewport(0, 0, width, height)\n glMatrixMode(GL_PROJECTION)\n glLoadIdentity()\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n glMatrixMode(GL_MODELVIEW)\n\nif __name__ == '__main__':\n glutInit(1, 1)\n glutInitWindowSize(640, 480)\n glutCreateWindow(\"Triangle\")\n\n glutDisplayFunc(paint)\n glutReshapeFunc(reshape)\n\n glutMainLoop()\n","language":"Python"},{"code":"'Task\n'Display a smooth shaded triangle with OpenGL.\nScreen _NewImage(600, 600, 32)\nDim Shared glInit As Integer\nglInput = 0\nDo While InKey$ = \"\": Loop\nEnd\n\n\nSub _GL ()\n If glInit = 0 Then\n _glViewport 1, 1, 600, 600\n _glClearColor 0, 0, 0, 1\n glInit = -1\n End If\n _glClear _GL_COLOR_BUFFER_BIT\n _glBegin _GL_TRIANGLES\n _glColor4f 1, 0, 0, 1\n _glVertex2f -1, -1\n _glColor4f 0, 1, 0, 1\n _glVertex2f 0, 0\n _glColor4f 0, 0, 1, 1\n _glVertex2f 1, -1\n _glEnd\nEnd Sub\n","language":"QB64"},{"code":"library(rgl)\nx <- c(-1, -1, 1)\ny <- c(0, -1, -1)\nz <- c(0, 0, 0)\nM <- cbind(x,y,z)\nrgl.bg(color=\"gray15\")\ntriangles3d(M, col=rainbow(8))\n","language":"R"},{"code":"#lang racket/gui\n(require sgl/gl)\n\n(define (resize w h)\n (glViewport 0 0 w h))\n\n(define (draw-opengl)\n (glClearColor 0.0 0.0 0.0 0.0)\n (glClear GL_COLOR_BUFFER_BIT)\n\n (glShadeModel GL_SMOOTH)\n\n (glMatrixMode GL_PROJECTION)\n (glLoadIdentity)\n (glOrtho 0.0 1.0 0.0 1.0 -1.0 1.0)\n (glMatrixMode GL_MODELVIEW)\n (glLoadIdentity)\n\n (glBegin GL_TRIANGLES)\n (glColor3f 1 0 0)\n (glVertex3d 0.25 0.25 0.0)\n (glColor3f 0 1 0)\n (glVertex3d 0.75 0.25 0.0)\n (glColor3f 0 0 1)\n (glVertex3d 0.75 0.75 0.0)\n (glEnd))\n\n\n(define my-canvas%\n (class* canvas% ()\n (inherit with-gl-context swap-gl-buffers)\n (define/override (on-paint)\n (with-gl-context (λ() (draw-opengl) (swap-gl-buffers))))\n (define/override (on-size width height)\n (with-gl-context (λ() (resize width height) (on-paint))))\n (super-instantiate () (style '(gl)))))\n\n(define win (new frame% [label \"Racket Rosetta Code OpenGL example\"]\n [min-width 200] [min-height 200]))\n(define gl (new my-canvas% [parent win]))\n\n(send win show #t)\n","language":"Racket"},{"code":"use NativeCall;\n\nclass Window is repr('CPointer') {}\nclass Monitor is repr('CPointer') {}\n\n# GLFW\n\nconstant $lib = ('glfw', v3);\n\nsub glfwInit(--> int32) is native($lib) {*}\nsub glfwCreateWindow(int32, int32, Str, Monitor, Window --> Window) is native($lib) {*}\nsub glfwTerminate() is native($lib) {*}\nsub glfwMakeContextCurrent(Window) is native($lib) {*}\nsub glfwSetWindowShouldClose(Window, int32) is native($lib) {*}\nsub glfwWindowShouldClose(Window --> int32) is native($lib) {*}\nsub glfwSwapBuffers(Window) is native($lib) {*}\nsub glfwSwapInterval(int32) is native($lib) {*}\nsub glfwPollEvents() is native($lib) {*}\nsub glfwGetFramebufferSize(Window, int32 is rw, int32 is rw) is native($lib) {*}\n\n# OpenGL\n\nenum PrimitiveMode(\n GL_TRIANGLES =>\t0x0004,\n);\n\nenum MatrixMode(\n GL_MATRIX_MODE => 0x0BA0,\n GL_MODELVIEW => 0x1700,\n GL_PROJECTION => 0x1701,\n);\n\nconstant $gllib = 'GL';\n\nsub glViewport(int32, int32, int32, int32) is native($gllib) {*}\nsub glClear(int32) is native($gllib) {*}\nsub glMatrixMode(int32) is native($gllib) {*}\nsub glLoadIdentity() is native($gllib) {*}\nsub glOrtho(num64, num64, num64, num64, num64, num64) is native($gllib) {*}\nsub glRotatef(num32, num32, num32, num32) is native($gllib) {*}\nsub glBegin(int32) is native($gllib) {*}\nsub glColor3f(num32, num32, num32) is native($gllib) {*}\nsub glVertex3f(num32, num32, num32) is native($gllib) {*}\nsub glEnd() is native($gllib) {*}\n\nconstant GL_COLOR_BUFFER_BIT = 0x00004000;\n\ndie 'Failed to initialize GLFW' unless glfwInit().so;\n\nmy $w = glfwCreateWindow(640, 480, \"OpenGL Triangle\", Nil, Nil);\nwithout $w { glfwTerminate(); die 'Failed to create window' }\n\nglfwMakeContextCurrent($w);\nglfwSwapInterval(1);\n\nwhile not glfwWindowShouldClose($w) {\n my num32 $ratio;\n my int32 $width;\n my int32 $height;\n\n glfwGetFramebufferSize($w, $width, $height);\n $ratio = ($width / $height).Num;\n\n glViewport(0, 0, $width, $height);\n glClear(GL_COLOR_BUFFER_BIT);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(-$ratio, $ratio, -1e0, 1e0, 1e0, -1e0);\n glMatrixMode(GL_MODELVIEW);\n\n glLoadIdentity();\n glRotatef((now % 360 * 100e0) , 0e0, 0e0, 1e0);\n\n glBegin(GL_TRIANGLES);\n glColor3f(1e0, 0e0, 0e0);\n glVertex3f(5e-1, -2.88e-1, 0e0);\n glColor3f(0e0, 1e0, 0e0);\n glVertex3f(-5e-1, -2.88e-1, 0e0);\n glColor3f(0e0, 0e0, 1e0);\n glVertex3f( 0e0, 5.73e-1, 0e0);\n glEnd();\n\n glfwSwapBuffers($w);\n glfwPollEvents();\n}\n\nglfwTerminate();\n","language":"Raku"},{"code":"# Project: OpenGL\n\nload \"freeglut.ring\"\nload \"opengl21lib.ring\"\n\nfunc main\n glutInit()\n glutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA)\n glutInitWindowSize(320,320)\n glutInitWindowPosition(100, 10)\n glutCreateWindow(\"OpenGL\")\n glutDisplayFunc(:renderScene)\n glutMainLoop()\n\nfunc renderScene\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\n glBegin(GL_TRIANGLES)\n glVertex3f(-0.5,-0.5,0.0)\n glVertex3f(0.5,0.0,0.0)\n glVertex3f(0.0,0.5,0.0)\n glEnd()\n glutSwapBuffers()\n","language":"Ring"},{"code":"require 'rubygems'\nrequire 'gl'\nrequire 'glut'\n\ninclude Gl\ninclude Glut\n\npaint = lambda do\n glClearColor(0.3,0.3,0.3,0.0)\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\n\n glShadeModel(GL_SMOOTH)\n\n glLoadIdentity\n glTranslatef(-15.0, -15.0, 0.0)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0, 0.0, 0.0)\n glVertex2f(0.0, 0.0)\n glColor3f(0.0, 1.0, 0.0)\n glVertex2f(30.0, 0.0)\n glColor3f(0.0, 0.0, 1.0)\n glVertex2f(0.0, 30.0)\n glEnd\n\n glFlush\nend\n\nreshape = lambda do |width, height|\n glViewport(0, 0, width, height)\n glMatrixMode(GL_PROJECTION)\n glLoadIdentity\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\n glMatrixMode(GL_MODELVIEW)\nend\n\nglutInit\nglutInitWindowSize(640, 480)\nglutCreateWindow(\"Triangle\")\n\nglutDisplayFunc(paint)\nglutReshapeFunc(reshape)\n\nglutMainLoop\n","language":"Ruby"},{"code":"use glow::*;\nuse glutin::event::*;\nuse glutin::event_loop::{ControlFlow, EventLoop};\nuse std::os::raw::c_uint;\n\nconst VERTEX: &str = \"#version 410\nconst vec2 verts[3] = vec2[3](\n vec2(0.5f, 1.0f),\n vec2(0.0f, 0.0f),\n vec2(1.0f, 0.0f)\n);\nout vec2 vert;\nvoid main() {\n vert = verts[gl_VertexID];\n gl_Position = vec4(vert - 0.5, 0.0, 1.0);\n}\";\n\nconst FRAGMENT: &str = \"#version 410\nprecision mediump float;\nin vec2 vert;\nout vec4 color;\nvoid main() {\n color = vec4(vert, 0.5, 1.0);\n}\";\n\nunsafe fn create_program(gl: &Context, vert: &str, frag: &str) -> c_uint {\n let program = gl.create_program().expect(\"Cannot create program\");\n let shader_sources = [(glow::VERTEX_SHADER, vert), (glow::FRAGMENT_SHADER, frag)];\n\n let mut shaders = Vec::new();\n for (shader_type, shader_source) in shader_sources.iter() {\n let shader = gl\n .create_shader(*shader_type)\n .expect(\"Cannot create shader\");\n gl.shader_source(shader, shader_source);\n gl.compile_shader(shader);\n if !gl.get_shader_compile_status(shader) {\n panic!(gl.get_shader_info_log(shader));\n }\n gl.attach_shader(program, shader);\n shaders.push(shader);\n }\n\n gl.link_program(program);\n if !gl.get_program_link_status(program) {\n panic!(gl.get_program_info_log(program));\n }\n\n for shader in shaders {\n gl.detach_shader(program, shader);\n gl.delete_shader(shader);\n }\n program\n}\n\nfn main() {\n let (gl, event_loop, window) = unsafe {\n let el = EventLoop::new();\n let wb = glutin::window::WindowBuilder::new()\n .with_title(\"Hello triangle!\")\n .with_inner_size(glutin::dpi::LogicalSize::new(1024.0, 768.0));\n let windowed_context = glutin::ContextBuilder::new()\n .with_vsync(true)\n .build_windowed(wb, &el)\n .unwrap();\n let windowed_context = windowed_context.make_current().unwrap();\n let context = glow::Context::from_loader_function(|s| {\n windowed_context.get_proc_address(s) as *const _\n });\n (context, el, windowed_context)\n };\n\n let (program, vab) = unsafe {\n let vertex_array = gl\n .create_vertex_array()\n .expect(\"Cannot create vertex array\");\n gl.bind_vertex_array(Some(vertex_array));\n\n let program = create_program(&gl, VERTEX, FRAGMENT);\n gl.use_program(Some(program));\n\n (program, vertex_array)\n };\n\n event_loop.run(move |ev, _, flow| match ev {\n Event::WindowEvent {\n event: WindowEvent::CloseRequested, ..\n } => {\n unsafe {\n gl.delete_program(program);\n gl.delete_vertex_array(vab);\n }\n *flow = ControlFlow::Exit;\n }\n Event::WindowEvent {\n event: WindowEvent::Resized(size), ..\n } => {\n unsafe {\n gl.viewport(0, 0, size.width as i32, size.height as i32);\n }\n window.resize(size);\n }\n Event::RedrawRequested(_) => unsafe {\n gl.clear_color(0.1, 0.2, 0.3, 1.0);\n gl.clear(glow::COLOR_BUFFER_BIT);\n gl.draw_arrays(glow::TRIANGLES, 0, 3);\n window.swap_buffers().unwrap();\n },\n _ => {}\n });\n}\n","language":"Rust"},{"code":"import org.lwjgl.opengl.{ Display, DisplayMode }\nimport org.lwjgl.opengl.GL11._\n\nobject OpenGlExample extends App {\n\n def render() {\n\n glClearColor(0.3f, 0.3f, 0.3f, 0.0f)\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\n\n glShadeModel(GL_SMOOTH)\n\n glLoadIdentity()\n glTranslatef(-15.0f, -15.0f, 0.0f)\n\n glBegin(GL_TRIANGLES)\n glColor3f(1.0f, 0.0f, 0.0f)\n glVertex2f(0.0f, 0.0f)\n glColor3f(0.0f, 1.0f, 0.0f)\n glVertex2f(30f, 0.0f)\n glColor3f(0.0f, 0.0f, 1.0f)\n glVertex2f(0.0f, 30.0f)\n glEnd()\n }\n\n Display.setDisplayMode(new DisplayMode(640, 480))\n Display.create()\n\n glMatrixMode(GL_PROJECTION)\n glLoadIdentity()\n glOrtho(-30, 30, -30, 30, -30, 30)\n glMatrixMode(GL_MODELVIEW)\n\n while (!Display.isCloseRequested()) {\n render()\n Display.update()\n Thread.sleep(1000)\n }\n}\n","language":"Scala"},{"code":"package require Tk\npackage require tcl3d\n\nproc resizedWin {win w h} {\n glViewport 0 0 $w $h\n glMatrixMode GL_PROJECTION\n glLoadIdentity\n glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0\n glMatrixMode GL_MODELVIEW\n}\nproc paintShape {win} {\n glClearColor 0.0 0.0 0.0 0.5\n glClear [expr {$::GL_COLOR_BUFFER_BIT+$::GL_DEPTH_BUFFER_BIT}]\n glShadeModel GL_SMOOTH\n glLoadIdentity\n glTranslatef -15.0 -15.0 0.0\n glBegin GL_TRIANGLES\n glColor3f 1.0 0.0 0.0\n glVertex2f 5.0 5.0\n glColor3f 0.0 1.0 0.0\n glVertex2f 25.0 5.0\n glColor3f 0.0 0.0 1.0\n glVertex2f 5.0 25.0\n glEnd\n $win swapbuffers\n}\n\ntogl .surface -width 640 -height 480 -double true -depth true \\\n -displayproc paintShape -reshapeproc resizedWin\npack .surface -fill both -expand 1\n","language":"Tcl"},{"code":"/* OpenGL.wren */\n\nvar GL_COLOR_BUFFER_BIT = 0x4000\nvar GL_DEPTH_BUFFER_BIT = 0x0100\n\nvar GL_SMOOTH = 0x1d01\nvar GL_MODELVIEW = 0x1700\nvar GL_PROJECTION = 0x1701\n\nvar GL_TRIANGLES = 0x0004\n\nvar GLUT_ACTION_ON_WINDOW_CLOSE = 0x01f9\nvar GLUT_ACTION_GLUTMAINLOOP_RETURNS = 0x0001\n\nclass GL {\n foreign static clearColor(red, green, blue, alpha)\n\n foreign static clear(mask)\n\n foreign static shadeModel(mode)\n\n foreign static loadIdentity()\n\n foreign static translatef(x, y, z)\n\n foreign static begin(mode)\n\n foreign static color3f(red, green, blue)\n\n foreign static vertex2f(x, y)\n\n foreign static end()\n\n foreign static flush()\n\n foreign static viewport(x, y, width, height)\n\n foreign static matrixMode(mode)\n\n foreign static ortho(left, right, bottom, top, nearVal, farVal)\n}\n\nclass Glut {\n foreign static initWindowSize(width, height)\n\n foreign static createWindow(name)\n\n foreign static displayFunc(clazz, signature)\n\n foreign static reshapeFunc(clazz, signature)\n\n foreign static setOption(eWhat, value)\n}\n\nclass GLCallbacks {\n static paint() {\n GL.clearColor(0.3, 0.3, 0.3, 0)\n GL.clear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\n GL.shadeModel(GL_SMOOTH)\n GL.loadIdentity()\n GL.translatef(-15, -15, 0)\n GL.begin(GL_TRIANGLES)\n GL.color3f(1, 0, 0)\n GL.vertex2f(0, 0)\n GL.color3f(0, 1, 0)\n GL.vertex2f(30, 0)\n GL.color3f(0, 0, 1)\n GL.vertex2f(0, 30)\n GL.end()\n GL.flush()\n }\n\n static reshape(width, height) {\n GL.viewport(0, 0, width, height)\n GL.matrixMode(GL_PROJECTION)\n GL.loadIdentity()\n GL.ortho(-30, 30, -30, 30, -30, 30)\n GL.matrixMode(GL_MODELVIEW)\n }\n}\n\nGlut.initWindowSize(640, 480)\nGlut.createWindow(\"Triangle\")\nGlut.displayFunc(\"GLCallbacks\", \"paint()\")\nGlut.reshapeFunc(\"GLCallbacks\", \"reshape(_,_)\")\nGlut.setOption(GLUT_ACTION_ON_WINDOW_CLOSE, GLUT_ACTION_GLUTMAINLOOP_RETURNS)\n","language":"Wren"},{"code":"#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <GL/gl.h>\n#include <GL/freeglut.h>\n#include \"wren.h\"\n\n/* C <=> Wren interface functions */\n\nWrenVM *vm;\n\nconst char *displayClass, *displayMethod, *reshapeClass, *reshapeMethod;\n\nvoid display() {\n wrenEnsureSlots(vm, 1);\n wrenGetVariable(vm, \"main\", displayClass, 0);\n WrenHandle *method = wrenMakeCallHandle(vm, displayMethod);\n wrenCall(vm, method);\n wrenReleaseHandle(vm, method);\n}\n\nvoid reshape(int width, int height) {\n wrenEnsureSlots(vm, 3);\n wrenGetVariable(vm, \"main\", reshapeClass, 0);\n WrenHandle *method = wrenMakeCallHandle(vm, reshapeMethod);\n wrenSetSlotDouble(vm, 1, (double)width);\n wrenSetSlotDouble(vm, 2, (double)height);\n wrenCall(vm, method);\n wrenReleaseHandle(vm, method);\n}\n\nvoid C_clearColor(WrenVM* vm) {\n GLclampf red = (GLclampf)wrenGetSlotDouble(vm, 1);\n GLclampf green = (GLclampf)wrenGetSlotDouble(vm, 2);\n GLclampf blue = (GLclampf)wrenGetSlotDouble(vm, 3);\n GLclampf alpha = (GLclampf)wrenGetSlotDouble(vm, 4);\n glClearColor(red, green, blue, alpha);\n}\n\nvoid C_clear(WrenVM* vm) {\n GLbitfield mask = (GLbitfield)wrenGetSlotDouble(vm, 1);\n glClear(mask);\n}\n\nvoid C_shadeModel(WrenVM* vm) {\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\n glShadeModel(mode);\n}\n\nvoid C_loadIdentity(WrenVM* vm) {\n glLoadIdentity();\n}\n\nvoid C_translatef(WrenVM* vm) {\n GLfloat x = (GLfloat)wrenGetSlotDouble(vm, 1);\n GLfloat y = (GLfloat)wrenGetSlotDouble(vm, 2);\n GLfloat z = (GLfloat)wrenGetSlotDouble(vm, 3);\n glTranslatef(x, y, z);\n}\n\nvoid C_begin(WrenVM* vm) {\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\n glBegin(mode);\n}\n\nvoid C_color3f(WrenVM* vm) {\n GLfloat red = (GLfloat)wrenGetSlotDouble(vm, 1);\n GLfloat green = (GLfloat)wrenGetSlotDouble(vm, 2);\n GLfloat blue = (GLfloat)wrenGetSlotDouble(vm, 3);\n glColor3f(red, green, blue);\n}\n\nvoid C_vertex2f(WrenVM* vm) {\n GLfloat x = (GLfloat)wrenGetSlotDouble(vm, 1);\n GLfloat y = (GLfloat)wrenGetSlotDouble(vm, 2);\n glVertex2f(x, y);\n}\n\nvoid C_end(WrenVM* vm) {\n glEnd();\n}\n\nvoid C_flush(WrenVM* vm) {\n glFlush();\n}\n\nvoid C_viewport(WrenVM* vm) {\n GLint x = (GLint) wrenGetSlotDouble(vm, 1);\n GLint y = (GLint) wrenGetSlotDouble(vm, 2);\n GLsizei width = (GLsizei)wrenGetSlotDouble(vm, 3);\n GLsizei height = (GLsizei)wrenGetSlotDouble(vm, 4);\n glViewport(x, y, width, height);\n}\n\nvoid C_matrixMode(WrenVM* vm) {\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\n glMatrixMode(mode);\n}\n\nvoid C_ortho(WrenVM* vm) {\n GLdouble left = (GLdouble)wrenGetSlotDouble(vm, 1);\n GLdouble right = (GLdouble)wrenGetSlotDouble(vm, 2);\n GLdouble bottom = (GLdouble)wrenGetSlotDouble(vm, 3);\n GLdouble top = (GLdouble)wrenGetSlotDouble(vm, 4);\n GLdouble nearVal = (GLdouble)wrenGetSlotDouble(vm, 5);\n GLdouble farVal = (GLdouble)wrenGetSlotDouble(vm, 6);\n glOrtho(left, right, bottom, top, nearVal, farVal);\n}\n\nvoid C_initWindowSize(WrenVM* vm) {\n int width = (int)wrenGetSlotDouble(vm, 1);\n int height = (int)wrenGetSlotDouble(vm, 2);\n glutInitWindowSize(width, height);\n}\n\nvoid C_createWindow(WrenVM* vm) {\n const char *name = wrenGetSlotString(vm, 1);\n glutCreateWindow(name);\n}\n\nvoid C_displayFunc(WrenVM* vm) {\n displayClass = wrenGetSlotString(vm, 1);\n displayMethod = wrenGetSlotString(vm, 2);\n glutDisplayFunc(&display);\n}\n\nvoid C_reshapeFunc(WrenVM* vm) {\n reshapeClass = wrenGetSlotString(vm, 1);\n reshapeMethod = wrenGetSlotString(vm, 2);\n glutReshapeFunc(&reshape);\n}\n\nvoid C_setOption(WrenVM* vm) {\n GLenum eWhat = (GLenum)wrenGetSlotDouble(vm, 1);\n int value = (int)wrenGetSlotDouble(vm, 2);\n glutSetOption(eWhat, value);\n}\n\nWrenForeignMethodFn bindForeignMethod(\n WrenVM* vm,\n const char* module,\n const char* className,\n bool isStatic,\n const char* signature) {\n if (strcmp(module, \"main\") == 0) {\n if (strcmp(className, \"GL\") == 0) {\n if (isStatic && strcmp(signature, \"clearColor(_,_,_,_)\") == 0) return C_clearColor;\n if (isStatic && strcmp(signature, \"clear(_)\") == 0) return C_clear;\n if (isStatic && strcmp(signature, \"shadeModel(_)\") == 0) return C_shadeModel;\n if (isStatic && strcmp(signature, \"loadIdentity()\") == 0) return C_loadIdentity;\n if (isStatic && strcmp(signature, \"translatef(_,_,_)\") == 0) return C_translatef;\n if (isStatic && strcmp(signature, \"begin(_)\") == 0) return C_begin;\n if (isStatic && strcmp(signature, \"color3f(_,_,_)\") == 0) return C_color3f;\n if (isStatic && strcmp(signature, \"vertex2f(_,_)\") == 0) return C_vertex2f;\n if (isStatic && strcmp(signature, \"end()\") == 0) return C_end;\n if (isStatic && strcmp(signature, \"flush()\") == 0) return C_flush;\n if (isStatic && strcmp(signature, \"viewport(_,_,_,_)\") == 0) return C_viewport;\n if (isStatic && strcmp(signature, \"matrixMode(_)\") == 0) return C_matrixMode;\n if (isStatic && strcmp(signature, \"ortho(_,_,_,_,_,_)\") == 0) return C_ortho;\n } else if (strcmp(className, \"Glut\") == 0) {\n if (isStatic && strcmp(signature, \"initWindowSize(_,_)\") == 0) return C_initWindowSize;\n if (isStatic && strcmp(signature, \"createWindow(_)\") == 0) return C_createWindow;\n if (isStatic && strcmp(signature, \"displayFunc(_,_)\") == 0) return C_displayFunc;\n if (isStatic && strcmp(signature, \"reshapeFunc(_,_)\") == 0) return C_reshapeFunc;\n if (isStatic && strcmp(signature, \"setOption(_,_)\") == 0) return C_setOption;\n }\n }\n return NULL;\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nint main(int argc, char **argv) {\n glutInit(&argc, argv);\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.bindForeignMethodFn = &bindForeignMethod;\n vm = wrenNewVM(&config);\n const char* module = \"main\";\n const char* fileName = \"OpenGL.wren\";\n char *script = readFile(fileName);\n WrenInterpretResult result = wrenInterpret(vm, module, script);\n switch (result) {\n case WREN_RESULT_COMPILE_ERROR:\n printf(\"Compile Error!\\n\");\n break;\n case WREN_RESULT_RUNTIME_ERROR:\n printf(\"Runtime Error!\\n\");\n break;\n case WREN_RESULT_SUCCESS:\n break;\n }\n glutMainLoop();\n wrenFreeVM(vm);\n free(script);\n return 0;\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- GUI\\n- Temporal media\\nfrom: http://rosettacode.org/wiki/OpenGL\\nnote: 3D\\nrequires:\\n- Graphics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nDisplay a smooth shaded triangle with OpenGL.\\n\\n[[image:Triangle.png|right|thumb|300px|Triangle created using C example compiled with [[GCC]] 4.1.2 and [[freeglut3]].]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"with Lumen.Window;\\nwith Lumen.Events;\\nwith Lumen.Events.Animate;\\nwith GL;\\nwith GLU;\\n\\nprocedure OpenGL is\\n\\n The_Window : Lumen.Window.Handle;\\n\\n Program_Exit : Exception;\\n\\n -- simply exit this program\\n procedure Quit_Handler (Event : in Lumen.Events.Event_Data) is\\n begin\\n raise Program_Exit;\\n end;\\n\\n -- Resize the scene\\n procedure Resize_Scene (Width, Height : in Natural) is\\n use GL;\\n use GLU;\\n begin\\n -- reset current viewport\\n glViewport (0, 0, GLsizei (Width), GLsizei (Height));\\n\\n -- select projection matrix and reset it\\n glMatrixMode (GL_PROJECTION);\\n glLoadIdentity;\\n\\n -- calculate aspect ratio\\n gluPerspective (45.0, GLdouble (Width) / GLdouble (Height), 0.1, 100.0);\\n\\n -- select modelview matrix and reset it\\n glMatrixMode (GL_MODELVIEW);\\n glLoadIdentity;\\n end Resize_Scene;\\n\\n procedure Init_GL is\\n use GL;\\n use GLU;\\n begin\\n -- smooth shading\\n glShadeModel (GL_SMOOTH);\\n\\n -- black background\\n glClearColor (0.0, 0.0, 0.0, 0.0);\\n\\n -- depth buffer setup\\n glClearDepth (1.0);\\n -- enable depth testing\\n glEnable (GL_DEPTH_TEST);\\n -- type of depth test\\n glDepthFunc (GL_LEQUAL);\\n\\n glHint (GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);\\n end Init_GL;\\n\\n -- Resize and Initialize the GL window\\n procedure Resize_Handler (Event : in Lumen.Events.Event_Data) is\\n Height : Natural := Event.Resize_Data.Height;\\n Width : Natural := Event.Resize_Data.Width;\\n begin\\n -- prevent div by zero\\n if Height = 0 then\\n Height := 1;\\n end if;\\n\\n Resize_Scene (Width, Height);\\n end;\\n\\n procedure Draw is\\n use GL;\\n begin\\n -- clear screen and depth buffer\\n glClear (GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\\n -- reset current modelview matrix\\n glLoadIdentity;\\n\\n -- draw triangle\\n glBegin (GL_TRIANGLES);\\n glColor3f (1.0, 0.0, 0.0);\\n glVertex3f ( 0.0, 1.0, 0.0);\\n glColor3f (0.0, 1.0, 0.0);\\n glVertex3f (-1.0, -1.0, 0.0);\\n glColor3f (0.0, 0.0, 1.0);\\n glVertex3f ( 1.0, -1.0, 0.0);\\n glEnd;\\n end Draw;\\n\\n procedure Frame_Handler (Frame_Delta : in Duration) is\\n begin\\n Draw;\\n Lumen.Window.Swap (The_Window);\\n end Frame_Handler;\\n\\nbegin\\n\\n Lumen.Window.Create (Win => The_Window,\\n Name => \\\"OpenGL Demo\\\",\\n Width => 640,\\n Height => 480,\\n Events => (Lumen.Window.Want_Key_Press => True,\\n Lumen.Window.Want_Exposure => True,\\n others => False));\\n\\n Resize_Scene (640, 480);\\n Init_GL;\\n\\n Lumen.Events.Animate.Select_Events\\n (Win => The_Window,\\n FPS => Lumen.Events.Animate.Flat_Out,\\n Frame => Frame_Handler'Unrestricted_Access,\\n Calls => (Lumen.Events.Resized => Resize_Handler'Unrestricted_Access,\\n Lumen.Events.Close_Window => Quit_Handler'Unrestricted_Access,\\n others => Lumen.Events.No_Callback));\\n\\nexception\\n when Program_Exit =>\\n null; -- normal termination\\nend OpenGL;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"hOpenGL32 := DllCall(\\\"LoadLibrary\\\", \\\"Str\\\", \\\"opengl32\\\")\\nGui, +LastFound +Resize\\nhDC := DllCall(\\\"GetDC\\\", \\\"uInt\\\", WinExist())\\n\\nVarSetCapacity(pfd, 40, 0)\\nNumPut(40, pfd, 0, \\\"uShort\\\")\\nNumPut(1, pfd, 2, \\\"uShort\\\")\\nNumPut(37, pfd, 4, \\\"uInt\\\")\\nNumPut(24, pfd, 9, \\\"uChar\\\")\\nNumPut(16, pfd, 23, \\\"uChar\\\")\\nDllCall(\\\"SetPixelFormat\\\", \\\"uInt\\\", hDC, \\\"uInt\\\", DllCall(\\\"ChoosePixelFormat\\\", \\\"uInt\\\", hDC, \\\"uInt\\\", &pfd), \\\"uInt\\\", &pfd)\\n\\nhRC := DllCall(\\\"opengl32\\\\wglCreateContext\\\", \\\"uInt\\\", hDC)\\nDllCall(\\\"opengl32\\\\wglMakeCurrent\\\", \\\"uInt\\\", hDC, \\\"uInt\\\", hRC)\\nGui, Show, w640 h480, Triangle\\nOnExit, ExitSub\\nSetTimer, Paint, 50\\nreturn\\n\\n\\nPaint:\\nDllCall(\\\"opengl32\\\\glClearColor\\\", \\\"Float\\\", 0.3, \\\"Float\\\", 0.3, \\\"Float\\\", 0.3, \\\"Float\\\", 0)\\nDllCall(\\\"opengl32\\\\glClear\\\", \\\"uInt\\\", 0x4100) ;GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT\\n\\nDllCall(\\\"opengl32\\\\glShadeModel\\\", \\\"uInt\\\", 0x1D01) ;GL_SMOOTH\\n\\nDllCall(\\\"opengl32\\\\glLoadIdentity\\\")\\nDllCall(\\\"opengl32\\\\glTranslatef\\\", \\\"Float\\\", -15, \\\"Float\\\", -15, \\\"Float\\\", 0)\\n\\nDllCall(\\\"opengl32\\\\glBegin\\\", \\\"uInt\\\", 0x0004) ;GL_TRIANGLES\\nDllCall(\\\"opengl32\\\\glColor3f\\\", \\\"Float\\\", 1, \\\"Float\\\", 0, \\\"Float\\\", 0)\\nDllCall(\\\"opengl32\\\\glVertex2f\\\", \\\"Float\\\", 0, \\\"Float\\\", 0)\\nDllCall(\\\"opengl32\\\\glColor3f\\\", \\\"Float\\\", 0, \\\"Float\\\", 1, \\\"Float\\\", 0)\\nDllCall(\\\"opengl32\\\\glVertex2f\\\", \\\"Float\\\", 30, \\\"Float\\\", 0)\\nDllCall(\\\"opengl32\\\\glColor3f\\\", \\\"Float\\\", 0, \\\"Float\\\", 0, \\\"Float\\\", 1)\\nDllCall(\\\"opengl32\\\\glVertex2f\\\", \\\"Float\\\", 0, \\\"Float\\\", 30)\\nDllCall(\\\"opengl32\\\\glEnd\\\")\\n\\nDllCall(\\\"SwapBuffers\\\", \\\"uInt\\\", hDC)\\nreturn\\n\\n\\nGuiSize:\\nDllCall(\\\"opengl32\\\\glViewport\\\", \\\"Int\\\", 0, \\\"Int\\\", 0, \\\"Int\\\", A_GuiWidth, \\\"Int\\\", A_GuiHeight)\\nDllCall(\\\"opengl32\\\\glMatrixMode\\\", \\\"uInt\\\", 0x1701) ;GL_PROJECTION\\nDllCall(\\\"opengl32\\\\glLoadIdentity\\\")\\nDllCall(\\\"opengl32\\\\glOrtho\\\", \\\"Double\\\", -30, \\\"Double\\\", 30, \\\"Double\\\", -30, \\\"Double\\\", 30, \\\"Double\\\", -30, \\\"Double\\\", 30)\\nDllCall(\\\"opengl32\\\\glMatrixMode\\\", \\\"uInt\\\", 0x1700) ;GL_MODELVIEW\\nreturn\\n\\n\\nGuiClose:\\nExitApp\\n\\n\\nExitSub:\\nDllCall(\\\"opengl32\\\\wglMakeCurrent\\\", \\\"uInt\\\", 0, \\\"uInt\\\", 0)\\nDllCall(\\\"opengl32\\\\wglDeleteContext\\\", \\\"uInt\\\", hRC)\\nDllCall(\\\"ReleaseDC\\\", \\\"uInt\\\", hDC)\\nDllCall(\\\"FreeLibrary\\\", \\\"uInt\\\", hOpenGL32)\\nExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"PRAGMA INCLUDE <GL/gl.h> <GL/freeglut.h>\\nPRAGMA LDFLAGS GL glut\\n\\nOPTION PARSE FALSE\\n\\nSUB Triangle\\n\\n glViewport(0, 0, 640, 480)\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n\\n glClearColor(0.0, 0.0, 0.0, 1.0)\\n glClear(GL_COLOR_BUFFER_BIT)\\n\\n glTranslatef(-15.0, -15.0, 0.0)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0, 0.0, 0.0)\\n glVertex2f(0.0, 0.0)\\n glColor3f(0.0, 1.0, 0.0)\\n glVertex2f(30.0, 0.0)\\n glColor3f(0.0, 0.0, 1.0)\\n glVertex2f(0.0, 30.0)\\n glEnd()\\n\\n glutSwapBuffers()\\n\\nEND SUB\\n\\nglutInit(&argc, argv)\\nglutInitWindowSize(640, 480)\\nglutCreateWindow(\\\"Triangle\\\")\\n\\nglutDisplayFunc(Triangle)\\nglutMainLoop()\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" *FLOAT64\\n\\n SYS \\\"LoadLibrary\\\", \\\"OPENGL32.DLL\\\" TO opengl%\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"wglCreateContext\\\" TO `wglCreateContext`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"wglDeleteContext\\\" TO `wglDeleteContext`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"wglMakeCurrent\\\" TO `wglMakeCurrent`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glMatrixMode\\\" TO `glMatrixMode`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glClear\\\" TO `glClear`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glBegin\\\" TO `glBegin`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glColor3dv\\\" TO `glColor3dv`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glVertex2dv\\\" TO `glVertex2dv`\\n SYS \\\"GetProcAddress\\\", opengl%, \\\"glEnd\\\" TO `glEnd`\\n\\n MODE 8\\n\\n PFD_MAIN_PLANE = 0\\n PFD_TYPE_RGBA = 0\\n PFD_DOUBLEBUFFER = 1\\n PFD_DRAW_TO_WINDOW = 4\\n PFD_SUPPORT_OPENGL = &20\\n\\n GL_MODELVIEW = &1700\\n GL_TRIANGLES = 4\\n GL_DEPTH_BUFFER_BIT = &00000100\\n GL_COLOR_BUFFER_BIT = &00004000\\n\\n ON CLOSE PROCcleanup : QUIT\\n ON ERROR PROCcleanup : SYS \\\"MessageBox\\\", @hwnd%, REPORT$, 0, 48 : QUIT\\n\\n DIM GLcolor{r#, g#, b#}, GLvertex{x#, y#}\\n DIM pfd{nSize{l&,h&}, nVersion{l&,h&}, dwFlags%, iPixelType&, cColorBits&, \\\\\\n \\\\ cRedBits&, cRedShift&, cGreenBits&, cGreenShift&, cBlueBits&, cBlueShift&, \\\\\\n \\\\ cAlphaBits&, cAlphaShift&, cAccumBits&, cAccumRedBits&, cAccumGreenBits&, \\\\\\n \\\\ cAccumBlueBits&, cAccumAlphaBits&, cDepthBits&, cStencilBits&, cAuxBuffers&, \\\\\\n \\\\ iLayerType&, bReserved&, dwLayerMask%, dwVisibleMask%, dwDamageMask%}\\n\\n pfd.nSize.l& = DIM(pfd{})\\n pfd.nVersion.l& = 1\\n pfd.dwFlags% = PFD_DRAW_TO_WINDOW OR PFD_SUPPORT_OPENGL OR PFD_DOUBLEBUFFER\\n pfd.dwLayerMask% = PFD_MAIN_PLANE\\n pfd.iPixelType& = PFD_TYPE_RGBA\\n pfd.cColorBits& = 24\\n pfd.cDepthBits& = 16\\n\\n SYS \\\"GetDC\\\", @hwnd% TO ghDC%\\n\\n SYS \\\"ChoosePixelFormat\\\", ghDC%, pfd{} TO pixelformat%\\n IF pixelformat% = 0 ERROR 100, \\\"ChoosePixelFormat failed\\\"\\n\\n SYS \\\"SetPixelFormat\\\", ghDC%, pixelformat%, pfd{} TO res%\\n IF res% = 0 ERROR 100, \\\"SetPixelFormat failed\\\"\\n\\n SYS `wglCreateContext`, ghDC% TO ghRC%\\n SYS `wglMakeCurrent`, ghDC%, ghRC%\\n SYS `glMatrixMode`, GL_MODELVIEW\\n\\n REPEAT\\n WAIT 2\\n SYS `glClear`, GL_COLOR_BUFFER_BIT OR GL_DEPTH_BUFFER_BIT\\n SYS `glBegin`, GL_TRIANGLES\\n GLcolor.r# = 1.0 : GLcolor.g# = 0.0 : GLcolor.b# = 0.0\\n SYS `glColor3dv`, GLcolor{}\\n GLvertex.x# = 0.0 : GLvertex.y# = 0.8\\n SYS `glVertex2dv`, GLvertex{}\\n GLcolor.r# = 0.0 : GLcolor.g# = 1.0 : GLcolor.b# = 0.0\\n SYS `glColor3dv`, GLcolor{}\\n GLvertex.x# = 0.8 : GLvertex.y# = -0.8\\n SYS `glVertex2dv`, GLvertex{}\\n GLcolor.r# = 0.0 : GLcolor.g# = 0.0 : GLcolor.b# = 1.0\\n SYS `glColor3dv`, GLcolor{}\\n GLvertex.x# = -0.8 : GLvertex.y# = -0.8\\n SYS `glVertex2dv`, GLvertex{}\\n SYS `glEnd`\\n SYS \\\"SwapBuffers\\\", ghDC%\\n UNTIL FALSE\\n END\\n\\n DEF PROCcleanup\\n ON ERROR OFF\\n ghRC% += 0 : IF ghRC% SYS `wglDeleteContext`, ghRC% : ghRC% = 0\\n ghDC% += 0 : IF ghDC% SYS \\\"ReleaseDC\\\", @hwnd%, ghDC% : ghDC% = 0\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <GL/gl.h>\\n#include <GL/glut.h>\\n\\nvoid paint(void)\\n{\\n glClearColor(0.3,0.3,0.3,0.0);\\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\\n\\n glShadeModel(GL_SMOOTH);\\n\\n glLoadIdentity();\\n glTranslatef(-15.0, -15.0, 0.0);\\n\\n glBegin(GL_TRIANGLES);\\n glColor3f(1.0, 0.0, 0.0);\\n glVertex2f(0.0, 0.0);\\n glColor3f(0.0, 1.0, 0.0);\\n glVertex2f(30.0, 0.0);\\n glColor3f(0.0, 0.0, 1.0);\\n glVertex2f(0.0, 30.0);\\n glEnd();\\n\\n glFlush();\\n}\\n\\nvoid reshape(int width, int height)\\n{\\n glViewport(0, 0, width, height);\\n glMatrixMode(GL_PROJECTION);\\n glLoadIdentity();\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\\n glMatrixMode(GL_MODELVIEW);\\n}\\n\\nint main(int argc, char *argv[])\\n{\\n glutInit(&argc, argv);\\n glutInitWindowSize(640, 480);\\n glutCreateWindow(\\\"Triangle\\\");\\n\\n glutDisplayFunc(paint);\\n glutReshapeFunc(reshape);\\n\\n glutMainLoop();\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"using OpenTK;\\nusing OpenTK.Graphics;\\nnamespace OpenGLTest\\n{\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n //Create the OpenGL window\\n GameWindow window = new GameWindow(640, 480, GraphicsMode.Default, \\\"OpenGL Example\\\");\\n\\n GL.MatrixMode(MatrixMode.Projection);\\n GL.LoadIdentity();\\n GL.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\\n GL.MatrixMode(MatrixMode.Modelview);\\n\\n //Add event handler to render to the window when called\\n window.RenderFrame += new RenderFrameEvent(a_RenderFrame);\\n //Starts the window's updating/rendering events\\n window.Run();\\n }\\n static void a_RenderFrame(GameWindow sender, RenderFrameEventArgs e)\\n {\\n GL.ClearColor(0.3f, 0.3f, 0.3f, 0f);\\n GL.Clear(ClearBufferMask.ColorBufferBit | ClearBufferMask.DepthBufferBit);\\n\\n GL.ShadeModel(ShadingModel.Smooth);\\n\\n GL.LoadIdentity();\\n GL.Translate(-15.0f, -15.0f, 0.0f);\\n\\n GL.Begin(BeginMode.Triangles);\\n GL.Color3(1.0f, 0.0f, 0.0f);\\n GL.Vertex2(0.0f, 0.0f);\\n GL.Color3(0.0f, 1.0f, 0.0f);\\n GL.Vertex2(30f, 0.0f);\\n GL.Color3(0.0f, 0.0f, 1.0f);\\n GL.Vertex2(0.0f, 30.0f);\\n GL.End();\\n //Swaps the buffers on the window so that what we draw becomes visible\\n sender.SwapBuffers();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use 'penumbra.opengl)\\n(require '[penumbra.app :as app])\\n\\n(defn init [state]\\n (app/title! \\\"Triangle\\\")\\n (clear-color 0.3 0.3 0.3 0)\\n (shade-model :smooth)\\n state)\\n\\n(defn reshape [[x y w h] state]\\n (ortho-view -30 30 -30 30 -30 30)\\n (load-identity)\\n (translate -15 -15)\\n state)\\n\\n(defn display [[dt time] state]\\n (draw-triangles\\n (color 1 0 0) (vertex 0 0)\\n (color 0 1 0) (vertex 30 0)\\n (color 0 0 1) (vertex 0 30)))\\n\\n(app/start {:display display, :reshape reshape, :init init} {})\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun draw-triangle (x y &key (z 0) (type 'right))\\n (case type\\n (right\\n (gl:with-primitive :triangles\\n (gl:color 0 0 1)\\n (gl:vertex x y z)\\n (gl:color 0 1 0)\\n (gl:vertex x (- y 1) z)\\n (gl:color 1 0 0)\\n (gl:vertex (+ x 1) (1- y) z)))\\n (equilateral\\n (gl:with-primitive :triangles\\n (gl:color 0 0 1)\\n (gl:vertex (+ x 0.5) y z)\\n (gl:color 1 0 0)\\n (gl:vertex (- x 0.5) (- y 1) z)\\n (gl:color 0 1 0)\\n (gl:vertex (+ x 1.5) (- y 1) z)))))\\n\\n(defun draw-update ()\\n (gl:clear :color-buffer :depth-buffer :color-buffer-bit)\\n (gl:matrix-mode :modelview)\\n (gl:load-identity)\\n\\n (gl:color 1.0 1.0 1.0)\\n (gl:translate 0 0 -2)\\n\\n (draw-triangle -0.5 0.5 :type 'equilateral))\\n\\n(defun main-loop ()\\n (sdl:with-events ()\\n (:quit-event () t)\\n (:key-down-event (:key key)\\n (cond ((sdl:key= key :sdl-key-escape)\\n (sdl:push-quit-event))))\\n (:idle ()\\n (draw-update)\\n (sdl:update-display))))\\n\\n(defun setup-gl (w h)\\n (gl:clear-color 0.5 0.5 0.5 1)\\n (gl:clear-depth 1)\\n\\n (gl:viewport 0 0 w h)\\n\\n (gl:depth-func :lequal)\\n (gl:hint :perspective-correction-hint :nicest)\\n (gl:shade-model :smooth)\\n (gl:enable :depth-test :cull-face)\\n\\n (gl:matrix-mode :projection)\\n (gl:load-identity)\\n (glu:perspective 45 (/ w (max h 1)) 0.1 20)\\n\\n (gl:matrix-mode :modelview)\\n (gl:load-identity))\\n\\n(defun triangle (&optional (w 640) (h 480))\\n (sdl:with-init ()\\n (sdl:set-gl-attribute :SDL-GL-DEPTH-SIZE 16)\\n (sdl:window w h\\n :bpp 32\\n :flags sdl:sdl-opengl\\n :title-caption \\\"Rosettacode.org OpenGL Demo\\\")\\n (setup-gl w h)\\n (setf (sdl:frame-rate) 2)\\n (main-loop)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"module opengl_sample; // file name + directory\\nimport dglut.core, dglut.window, dglut.opengl;\\n\\nvoid main() {\\n with (new Canvas) {\\n setName(\\\"Triangle\\\");\\n map;\\n\\n onResize = (Canvas self) { // A delegate literal that takes a parameter.\\n with (self) glViewport(0, 0, width, height);\\n MatrixMode.Projection.Identity; // For functions without parameters, the () can be omitted.\\n glOrtho(-30, 30, -30, 30, -30, 30);\\n MatrixMode.Modelview;\\n };\\n\\n onDisplay=(Canvas self) {\\n scope(exit) self.swap; // Scope guards ease exception-safe programming\\n glClearColor(0.3f, 0.3f, 0.3f, 0f);\\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\\n glLoadIdentity;\\n // A convenience wrapper around glTranslatef. Supports numbers, arrays and vectors.\\n Translate(-15, -15, 0);\\n // This is a delegate literal as well. Triangles is a wrapper around glBegin and glEnd.\\n Triangles = {\\n Color(1f, 0f, 0f); Vertex(0, 0);\\n Color(0f, 1f, 0f); Vertex(30, 0);\\n Color(0f, 0f, 1f); Vertex(0, 30);\\n };\\n };\\n }\\n loop;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program OpenGLTriangle;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.Classes,\\n Sample.App,\\n Winapi.OpenGL,\\n System.UITypes;\\n\\ntype\\n TTriangleApp = class(TApplication)\\n public\\n procedure Initialize; override;\\n procedure Update(const ADeltaTimeSec, ATotalTimeSec: Double); override;\\n procedure Shutdown; override;\\n procedure KeyDown(const AKey: Integer; const AShift: TShiftState); override;\\n end;\\n\\n{ TTriangleApp }\\n\\nprocedure TTriangleApp.Initialize;\\nbegin\\n inherited;\\n glViewport(0, 0, width, height);\\n\\n glMatrixMode(GL_PROJECTION);\\n glLoadIdentity();\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\\n glMatrixMode(GL_MODELVIEW);\\nend;\\n\\nprocedure TTriangleApp.KeyDown(const AKey: Integer; const AShift: TShiftState);\\nbegin\\n inherited;\\n if (AKey = vkEscape) then\\n Terminate;\\nend;\\n\\nprocedure TTriangleApp.Shutdown;\\nbegin\\n inherited;\\n // Writeln('App is Shutdown');\\nend;\\n\\nprocedure TTriangleApp.Update(const ADeltaTimeSec, ATotalTimeSec: Double);\\nbegin\\n inherited;\\n\\n glClearColor(0.3, 0.3, 0.3, 0.0);\\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\\n\\n glShadeModel(GL_SMOOTH);\\n\\n glLoadIdentity();\\n glTranslatef(-15.0, -15.0, 0.0);\\n\\n glBegin(GL_TRIANGLES);\\n glColor3f(1.0, 0.0, 0.0);\\n glVertex2f(0.0, 0.0);\\n glColor3f(0.0, 1.0, 0.0);\\n glVertex2f(30.0, 0.0);\\n glColor3f(0.0, 0.0, 1.0);\\n glVertex2f(0.0, 30.0);\\n glEnd();\\n\\n glFlush();\\nend;\\n\\nbegin\\n RunApp(TTriangleApp, 640, 480, 'OpenGL Triangle');\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"#include <GL/gl.h>\\nimport \\\"ecere\\\"\\n\\nclass GLTriangle : Window\\n{\\n text = \\\"Triangle\\\";\\n displayDriver = \\\"OpenGL\\\";\\n background = activeBorder;\\n nativeDecorations = true;\\n borderStyle = sizable;\\n hasMaximize = true, hasMinimize = true, hasClose = true;\\n size = { 640, 480 };\\n\\n void OnRedraw(Surface surface)\\n {\\n glMatrixMode(GL_PROJECTION);\\n glLoadIdentity();\\n glOrtho(-30, 30, -30, 30, -30, 30);\\n glMatrixMode(GL_MODELVIEW);\\n glLoadIdentity();\\n glTranslatef(-15, -15, 0);\\n glShadeModel(GL_SMOOTH);\\n\\n glBegin(GL_TRIANGLES);\\n glColor3f(1, 0, 0);\\n glVertex2f(0, 0);\\n glColor3f(0, 1, 0);\\n glVertex2f(30, 0);\\n glColor3f(0, 0, 1);\\n glVertex2f(0, 30);\\n glEnd();\\n }\\n}\\n\\nGLTriangle window {};\\n\",\n \"language\": \"EC\"\n },\n {\n \"code\": \"include get.e\\ninclude dll.e\\ninclude machine.e\\ninclude msgbox.e\\ninclude constants.ew\\ninclude GLfunc.ew\\ninclude GLconst.ew\\n\\nwithout warning\\n\\natom hRC, hDC, hWnd, hInstance, ClassName\\nsequence keys keys = repeat(0,256) -- array to hold key presses\\n\\ninteger active, fullscreen, retval\\nactive = TRUE\\nfullscreen = TRUE\\nhRC = NULL\\nhDC = NULL\\nhWnd = NULL\\nhInstance = NULL\\n\\natom rtri, rquad\\nrtri = 0.0\\nrquad = 0.0\\n\\ninteger dmScreenSettings, WindowRect\\n\\nprocedure ReSizeGLScene(integer width, integer height)\\n if height = 0 then\\n height = 1\\n end if\\n c_proc(glViewport,{0,0,width,height})\\n c_proc(glMatrixMode,{GL_PROJECTION})\\n c_proc(glLoadIdentity,{})\\n c_proc(gluPerspective,{45.0,width/height,0.1,100.0})\\n c_proc(glMatrixMode,{GL_MODELVIEW})\\n c_proc(glLoadIdentity,{})\\nend procedure\\n\\nprocedure InitGL()\\n c_proc(glShadeModel,{GL_SMOOTH})\\n c_proc(glClearColor,{0.0,0.0,0.0,0.0})\\n c_proc(glClearDepth,{1.0})\\n c_proc(glEnable,{GL_DEPTH_TEST})\\n c_proc(glDepthFunc,{GL_LEQUAL})\\n c_proc(glHint,{GL_PERSPECTIVE_CORRECTION_HINT,GL_NICEST})\\nend procedure\\n\\nfunction DrawGLScene()\\n c_proc(glClear, {or_bits(GL_COLOR_BUFFER_BIT,GL_DEPTH_BUFFER_BIT)})\\n c_proc(glLoadIdentity, {})\\n c_proc(glTranslatef, {-1.5,0.0,-6.0})\\n c_proc(glRotatef, {rtri,0.0,1.0,0.0})\\n c_proc(glBegin, {GL_TRIANGLES})\\n c_proc(glColor3f, {1.0,0.0,0.0})\\n c_proc(glVertex3f, {0.0,1.0,0.0})\\n c_proc(glColor3f, {0.0,1.0,0.0})\\n c_proc(glVertex3f, {-1.0,-1.0,0.0})\\n c_proc(glColor3f, {0.0,0.0,1.0})\\n c_proc(glVertex3f, {1.0,-1.0,0.0})\\n c_proc(glEnd, {})\\n c_proc(glLoadIdentity, {})\\n c_proc(glTranslatef, {1.5,0.0,-6.0})\\n c_proc(glRotatef, {rquad,1.0,0.0,0.0})\\n c_proc(glColor3f, {0.5,0.5,1.0})\\n c_proc(glBegin, {GL_QUADS})\\n c_proc(glVertex3f, {1.0,1.0,0.0})\\n c_proc(glVertex3f, {-1.0,1.0,0.0})\\n c_proc(glVertex3f, {-1.0,-1.0,0.0})\\n c_proc(glVertex3f, {1.0,-1.0,0.0})\\n c_proc(glEnd, {})\\n rtri += 0.2\\n rquad -= 0.15\\n return TRUE\\nend function\\n\\nprocedure KillGLWindow()\\n if fullscreen then\\n if c_func(ChangeDisplaySettingsA,{NULL,0}) then end if\\n if c_func(ShowCursor,{TRUE}) then end if\\n end if\\n if hRC then\\n if c_func(wglMakeCurrent,{NULL,NULL}) then end if\\n if c_func(wglDeleteContext,{hRC}) then end if\\n hRC = NULL\\n end if\\n if hRC and not c_func(ReleaseDC,{hWnd,hDC}) then\\n hDC = NULL\\n end if\\n if hWnd and not c_func(DestroyWindow,{hWnd}) then\\n hWnd = NULL\\n end if\\n if dmScreenSettings then\\n free(dmScreenSettings)\\n end if\\n free(WindowRect)\\nend procedure\\n\\nfunction WndProc(atom hWnd, integer uMsg, atom wParam, atom lParam)\\n if uMsg = WM_ACTIVATE then\\n if not floor(wParam/#10000) then\\n active = TRUE\\n else\\n active = FALSE\\n end if\\n elsif uMsg = WM_SYSCOMMAND then\\n if wParam = SC_SCREENSAVE then end if\\n if wParam = SC_MONITORPOWER then end if\\n elsif uMsg = WM_CLOSE then\\n c_proc(PostQuitMessage,{0})\\n elsif uMsg = WM_KEYDOWN then\\n keys[wParam] = TRUE\\n elsif uMsg = WM_KEYUP then\\n keys[wParam] = FALSE\\n elsif uMsg = WM_SIZE then\\n ReSizeGLScene(and_bits(lParam,#FFFF),floor(lParam/#10000))\\n end if\\n return c_func(DefWindowProcA,{hWnd, uMsg, wParam, lParam})\\nend function\\n\\ninteger wc wc = allocate(40)\\nfunction ClassRegistration()\\ninteger WndProcAddress, id\\n id = routine_id(\\\"WndProc\\\")\\n if id = -1 then\\n puts(1, \\\"routine_id failed!\\\\n\\\")\\n abort(1)\\n end if\\n WndProcAddress = call_back(id)\\n hInstance = c_func(GetModuleHandleA,{NULL})\\n ClassName = allocate_string(\\\"OpenGL\\\")\\n poke4(wc,or_all({CS_HREDRAW, CS_VREDRAW, CS_OWNDC}))\\n poke4(wc+4,WndProcAddress)\\n poke4(wc+8,0)\\n poke4(wc+12,0)\\n poke4(wc+16,hInstance)\\n poke4(wc+20,c_func(LoadIconA,{NULL,IDI_WINLOGO}))\\n poke4(wc+24,c_func(LoadCursorA,{NULL, IDC_ARROW}))\\n poke4(wc+28,NULL)\\n poke4(wc+32,NULL)\\n poke4(wc+36,ClassName)\\n if not c_func(RegisterClassA,{wc}) then\\n retval = message_box(\\\"Failed to register class\\\",\\\"Error\\\", or_bits(MB_OK,MB_ICONINFORMATION))\\n return FALSE\\n else\\n return TRUE\\n end if\\nend function\\n\\ninteger regd regd = FALSE\\nprocedure CreateGLWindow(atom title, integer width, integer height, integer bits, integer fullscreenflag)\\n atom PixelFormat, pfd, dwExStyle, dwStyle\\n sequence s\\n if regd = FALSE then\\n if ClassRegistration() then\\n regd = TRUE\\n end if\\n end if\\n fullscreen = fullscreenflag\\n if fullscreen then\\n dmScreenSettings = allocate(156)\\n mem_set(dmScreenSettings,0,156)\\n s = int_to_bytes(156)\\n poke(dmScreenSettings + 36,{s[1],s[2]})\\n poke4(dmScreenSettings + 40,or_all({DM_BITSPERPEL,DM_PELSWIDTH,DM_PELSHEIGHT}))\\n poke4(dmScreenSettings + 104, bits)\\n poke4(dmScreenSettings + 108, width)\\n poke4(dmScreenSettings + 112, height)\\n if c_func(ChangeDisplaySettingsA,{dmScreenSettings,CDS_FULLSCREEN}) != DISP_CHANGE_SUCCESSFUL then\\n if message_box(\\\"The requested fullscreen mode is not supported by\\\\nyour video card. \\\" &\\n \\\"Use windowed mode instead?\\\",\\\"Error\\\", or_bits(MB_YESNO,MB_ICONEXCLAMATION)) = IDYES then\\n else\\n retval = message_box(\\\"Program will now close\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONSTOP))\\n end if\\n end if\\n else\\n dmScreenSettings = NULL\\n end if\\n if fullscreen then\\n dwExStyle = WS_EX_APPWINDOW\\n dwStyle = WS_POPUP\\n if c_func(ShowCursor,{FALSE}) then end if\\n else\\n dwExStyle = or_bits(WS_EX_APPWINDOW,WS_EX_WINDOWEDGE)\\n dwStyle = WS_OVERLAPPEDWINDOW\\n end if\\n WindowRect = allocate(16)\\n poke4(WindowRect,0)\\n poke4(WindowRect + 4,width)\\n poke4(WindowRect + 8, 0)\\n poke4(WindowRect + 12, height)\\n if c_func(AdjustWindowRectEx,{WindowRect, dwStyle, FALSE, dwExStyle}) then end if\\n hWnd = c_func(CreateWindowExA,{dwExStyle, --extended window style\\n ClassName, --class\\n title, --window caption\\n or_all({WS_CLIPSIBLINGS,WS_CLIPCHILDREN,dwStyle}), --window style\\n 0,\\n 0,\\n peek4u(WindowRect + 4) - peek4u(WindowRect),\\n peek4u(WindowRect + 12) - peek4u(WindowRect + 8),\\n NULL,\\n NULL,\\n hInstance,\\n NULL})\\n if hWnd = NULL then\\n KillGLWindow()\\n retval = message_box(\\\"Window creation error\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n pfd = allocate(40) --PIXELFORMATDESCRIPTOR\\n mem_set(pfd,0,40)\\n poke(pfd, 40) --size of pfd structure\\n poke(pfd + 2, 1) --version\\n poke4(pfd + 4, or_all({PFD_DRAW_TO_WINDOW,PFD_SUPPORT_OPENGL,PFD_DOUBLEBUFFER})) --properties flags\\n poke(pfd + 8, PFD_TYPE_RGBA) --request an rgba format\\n poke(pfd + 9, 24) --select color depth\\n poke(pfd + 23, 24) --32bit Z-buffer\\n\\n hDC = c_func(GetDC,{hWnd}) --create GL device context to match window device context\\n if not hDC then\\n KillGLWindow()\\n retval = message_box(\\\"Can't create a GL device context\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n PixelFormat = c_func(ChoosePixelFormat,{hDC,pfd}) --find a pixel format matching PIXELFORMATDESCRIPTOR\\n if not PixelFormat then\\n KillGLWindow()\\n retval = message_box(\\\"Can't find a suitable pixel format\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n if not (c_func(SetPixelFormat,{hDC,PixelFormat,pfd})) then --set the pixel format\\n KillGLWindow()\\n retval = message_box(\\\"Can't set the pixel format\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n if not c_func(DescribePixelFormat, {hDC,PixelFormat,40,pfd}) then\\n retval = message_box(\\\"Can't describe the pixel format\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n hRC = c_func(wglCreateContext,{hDC}) --create GL rendering context\\n if not hRC then\\n KillGLWindow()\\n retval = message_box(\\\"Can't create a GL rendering context\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n if not (c_func(wglMakeCurrent,{hDC,hRC})) then --make the GL rendering context active\\n KillGLWindow()\\n retval = message_box(\\\"Can't activate the GL rendering context\\\",\\\"Error\\\",or_bits(MB_OK,MB_ICONEXCLAMATION))\\n end if\\n retval = c_func(ShowWindow,{hWnd,SW_SHOW}) --show the window\\n retval = c_func(SetForegroundWindow,{hWnd}) --set it to always be in foreground\\n retval = c_func(SetFocus,{hWnd}) --give it focus\\n ReSizeGLScene(width, height) --draw the GL scene to match the window size\\n InitGL() --initialize OpenGL\\nend procedure\\n\\ninteger MSG MSG = allocate(28)\\ninteger title title = allocate_string(\\\"OpenGL\\\")\\nprocedure WinMain()\\ninteger done, msg_message\\n done = FALSE\\n if message_box(\\\"Would you like to run in fullscreen mode?\\\",\\\"Start Fullscreen?\\\",or_bits(MB_YESNO,MB_ICONQUESTION)) = IDNO then\\n fullscreen = FALSE\\n else\\n fullscreen = TRUE\\n end if\\n CreateGLWindow(title,640,480,24,fullscreen)\\n while not done do\\n if c_func(PeekMessageA,{MSG,NULL,0,0,PM_REMOVE}) then\\n msg_message = peek4u(MSG+4)\\n if msg_message = WM_QUIT then\\n done = TRUE\\n else\\n retval = c_func(TranslateMessage,{MSG})\\n retval = c_func(DispatchMessageA,{MSG})\\n end if\\n else\\n if ((active and not DrawGLScene()) or keys[VK_ESCAPE]) then\\n done = TRUE\\n else\\n retval = c_func(SwapBuffers,{hDC})\\n if keys[VK_F1] then\\n keys[VK_F1] = FALSE\\n KillGLWindow()\\n if fullscreen = 0 then\\n fullscreen = 1\\n else\\n fullscreen = 0\\n end if\\n CreateGLWindow(title,640,480,24,fullscreen)\\n end if\\n end if\\n end if\\n end while\\n KillGLWindow()\\nend procedure\\n\\nWinMain()\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"USING: kernel math math.rectangles opengl.gl sequences ui\\nui.gadgets ui.render ;\\nIN: rosettacode.opengl\\n\\nTUPLE: triangle-gadget < gadget ;\\n\\n: reshape ( width height -- )\\n [ 0 0 ] 2dip glViewport\\n GL_PROJECTION glMatrixMode\\n glLoadIdentity\\n -30.0 30.0 -30.0 30.0 -30.0 30.0 glOrtho\\n GL_MODELVIEW glMatrixMode ;\\n\\n: paint ( -- )\\n 0.3 0.3 0.3 0.0 glClearColor\\n GL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT bitor glClear\\n GL_SMOOTH glShadeModel\\n glLoadIdentity\\n -15.0 -15.0 0.0 glTranslatef\\n GL_TRIANGLES glBegin\\n 1.0 0.0 0.0 glColor3f 0.0 0.0 glVertex2f\\n 0.0 1.0 0.0 glColor3f 30.0 0.0 glVertex2f\\n 0.0 0.0 1.0 glColor3f 0.0 30.0 glVertex2f\\n glEnd\\n glFlush ;\\n\\nM: triangle-gadget pref-dim* drop { 640 480 } ;\\nM: triangle-gadget draw-gadget*\\n rect-bounds nip first2 reshape paint ;\\n\\n: triangle-window ( -- )\\n [ triangle-gadget new \\\"Triangle\\\" open-window ] with-ui ;\\nMAIN: triangle-window\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"import glconst import float\\nglconst also float also opengl also\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#! xbigforth\\n\\\\ automatic generated code\\n\\\\ do not edit\\n\\nalso editor also minos also forth\\n\\ninclude triangle.fs\\ncomponent class triangle\\npublic:\\n early widget\\n early open\\n early dialog\\n early open-app\\n ( [varstart] ) ( [varend] )\\nhow:\\n : open new DF[ 0 ]DF s\\\" Triangle\\\" open-component ;\\n : dialog new DF[ 0 ]DF s\\\" Triangle\\\" open-dialog ;\\n : open-app new DF[ 0 ]DF s\\\" Triangle\\\" open-application ;\\nclass;\\n\\ntriangle implements\\n ( [methodstart] ) ( [methodend] )\\n : widget ( [dumpstart] )\\n GL[ ^ glcanvas with\\n0 0 w @ h @ glViewport\\nGL_PROJECTION glMatrixMode\\nglLoadIdentity\\n-30e 30e -30e 30e -30e 30e glOrtho\\nGL_MODELVIEW glMatrixMode\\n0.3e 0.3e 0.3e 0.0e glClearColor\\nGL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT or glClear\\nGL_SMOOTH glShadeModel\\nglLoadIdentity\\n-15e -15e 0e glTranslatef\\nGL_TRIANGLES glBegin\\n1e 0e 0e glColor3f\\n0e 0e glVertex2f\\n0e 1e 0e glColor3f\\n30e 0e glVertex2f\\n0e 0e 1e glColor3f\\n0e 30e glVertex2f\\nglEnd\\nglFlush\\nendwith ]GL ( MINOS ) ^^ CK[ ( x y b n -- ) 2drop 2drop ]CK ( MINOS ) $280 $1 *hfil $1E0 $1 *vfil glcanvas new\\n &1 vabox new\\n ( [dumpend] ) ;\\n : init ^>^^ assign widget 1 :: init ;\\nclass;\\n\\n: main\\n triangle open-app\\n $1 0 ?DO stop LOOP bye ;\\nscript? [IF] main [THEN]\\nprevious previous previous\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"#include \\\"fbgfx.bi\\\"\\n#include once \\\"GL/gl.bi\\\"\\n#include once \\\"GL/glu.bi\\\"\\n\\nscreen 18, 16, , 2\\n\\nglViewport 0, 0, 640, 480 'Set the viewport\\nglMatrixMode GL_PROJECTION ' Select projection\\nglLoadIdentity ' Set this to default\\ngluPerspective 45.0, 640./480., 0.1, 100.0 ' Set perspective view options\\nglMatrixMode GL_MODELVIEW ' Set to modelview mode\\nglLoadIdentity ' ...and set it to default\\nglClearColor 0.5, 0.5, 0.5, 0.0 ' Set clearscreen color to middle grey\\nglShadeModel GL_SMOOTH ' set to smooth shading\\nglClearDepth 1.0 ' Allow the deletion of the depth buffer\\nglEnable GL_DEPTH_TEST ' turn on depth testing\\nglDepthFunc GL_LEQUAL ' The Type Of Depth Test To Do\\nglHint GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST ' niceness tweaks\\n\\ndo\\n\\nglClear GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT ' clear screen and depth\\nglLoadIdentity\\n\\nglTranslatef 0.0f, 0.0f, -6.0f ' move camera back so we can see the triangle\\n\\nglBegin GL_TRIANGLES ' Drawing Using Triangles\\n glColor3f 1.0f, 0.0f, 0.0f ' red\\n glVertex3f 0.0f, 1.0f, 0.0f ' Top\\n glColor3f 0.0f, 1.0f, 0.0f ' green\\n glVertex3f -1.0f,-1.0f, 0.0f ' Bottom Left\\n glColor3f 0.0f, 0.0f, 1.0f ' blue\\n glVertex3f 1.0f,-1.0f, 0.0f ' Bottom Right\\nglEnd ' Finished Drawing The Triangle\\n\\nflip\\n\\nloop while inkey = \\\"\\\"\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n gl \\\"github.com/chsc/gogl/gl21\\\"\\n \\\"github.com/go-gl/glfw/v3.2/glfw\\\"\\n \\\"log\\\"\\n \\\"runtime\\\"\\n)\\n\\n// Window dimensions.\\nconst (\\n Width = 640\\n Height = 480\\n)\\n\\nfunc check(err error) {\\n if err != nil {\\n log.Fatal(err)\\n }\\n}\\n\\nfunc main() {\\n // OpenGL requires a dedicated OS thread.\\n runtime.LockOSThread()\\n defer runtime.UnlockOSThread()\\n\\n err := glfw.Init()\\n check(err)\\n defer glfw.Terminate()\\n\\n // Open window with the specified dimensions.\\n window, err := glfw.CreateWindow(Width, Height, \\\"Triangle\\\", nil, nil)\\n check(err)\\n\\n window.MakeContextCurrent()\\n\\n err = gl.Init()\\n check(err) /* may need to comment out this line for this program to work on Windows 10 */\\n\\n // Initiate viewport.\\n resize(Width, Height)\\n\\n // Register that we are interested in receiving close and resize events.\\n window.SetCloseCallback(func(w *glfw.Window) {\\n return\\n })\\n window.SetSizeCallback(func(w *glfw.Window, width, height int) {\\n resize(width, height)\\n })\\n\\n for !window.ShouldClose() {\\n draw()\\n window.SwapBuffers()\\n glfw.PollEvents()\\n }\\n}\\n\\n// resize resizes the window to the specified dimensions.\\nfunc resize(width, height int) {\\n gl.Viewport(0, 0, gl.Sizei(width), gl.Sizei(height))\\n gl.MatrixMode(gl.PROJECTION)\\n gl.LoadIdentity()\\n gl.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n gl.MatrixMode(gl.MODELVIEW)\\n}\\n\\n// draw draws the triangle.\\nfunc draw() {\\n gl.ClearColor(0.3, 0.3, 0.3, 0.0)\\n gl.Clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT)\\n\\n gl.ShadeModel(gl.SMOOTH)\\n\\n gl.LoadIdentity()\\n gl.Translatef(-15.0, -15.0, 0.0)\\n\\n gl.Begin(gl.TRIANGLES)\\n\\n gl.Color3f(1.0, 0.0, 0.0)\\n gl.Vertex2f(0.0, 0.0)\\n\\n gl.Color3f(0.0, 1.0, 0.0)\\n gl.Vertex2f(30.0, 0.0)\\n\\n gl.Color3f(0.0, 0.0, 1.0)\\n gl.Vertex2f(0.0, 30.0)\\n\\n gl.End()\\n\\n gl.Flush()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Graphics.Rendering.OpenGL\\nimport Graphics.UI.GLUT\\n\\nmain = do\\n getArgsAndInitialize\\n createWindow \\\"Triangle\\\"\\n displayCallback $= display\\n\\n matrixMode $= Projection\\n loadIdentity\\n ortho2D 0 30 0 30\\n matrixMode $= Modelview 0\\n\\n mainLoop\\n\\ndisplay = do\\n clear [ColorBuffer]\\n renderPrimitive Triangles $ do\\n corner 1 0 0 5 5\\n corner 0 1 0 25 5\\n corner 0 0 1 5 25\\n swapBuffers\\n\\ncorner r g b x y = do color (Color3 r g b :: Color3 GLfloat)\\n vertex (Vertex2 x y :: Vertex2 GLfloat)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"coclass 'example'\\n(coinsert[require) 'jzopengl'\\n\\ncreate=:3 :0\\n ogl=: ''conew'jzopengl'\\n wd 'pc p;cc c isigraph opengl rightmove bottommove;pas 0 0;pshow;'\\n)\\n\\np_close=: destroy=:3 :0\\n destroy__ogl''\\n wd'pclose'\\n codestroy''\\n)\\n\\ncorner=:4 :0\\n glColor3d x\\n glVertex2d y\\n)\\n\\np_c_paint=:3 :0\\n rc__ogl''\\n glClear GL_COLOR_BUFFER_BIT\\n glBegin GL_TRIANGLES\\n 1 0 0 corner 0 0-0.5\\n 0 1 0 corner 1 0-0.5\\n 0 0 1 corner 0 1-0.5\\n glEnd''\\n show__ogl''\\n)\\n\\nconew~'example'\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import org.lwjgl.LWJGLException;\\nimport org.lwjgl.opengl.Display;\\nimport org.lwjgl.opengl.DisplayMode;\\nimport static org.lwjgl.opengl.GL11.*;\\n\\n\\npublic class OpenGlExample {\\n\\n\\tpublic void run() throws LWJGLException {\\n\\t\\tDisplay.setDisplayMode(new DisplayMode(640, 480));\\n\\t\\tDisplay.create();\\n\\t\\t\\n\\t\\tglMatrixMode(GL_PROJECTION);\\n\\t\\tglLoadIdentity();\\n\\t\\tglOrtho(-30, 30, -30, 30, -30, 30);\\n\\t\\tglMatrixMode(GL_MODELVIEW);\\n\\t\\t\\n\\t\\twhile(!Display.isCloseRequested()) {\\n\\t\\t\\trender();\\n\\t\\t\\t\\n\\t\\t\\tDisplay.update();\\n\\t\\t}\\n\\t\\t\\n\\t\\tDisplay.destroy();\\n\\t}\\n\\t\\n\\tpublic void render() {\\n\\t\\t\\n\\t\\tglClearColor(0.3f, 0.3f, 0.3f, 0.0f);\\n\\t\\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\\n\\t\\t\\n\\t\\tglShadeModel(GL_SMOOTH);\\n\\t\\t\\n\\t\\tglLoadIdentity();\\n\\t\\tglTranslatef(-15.0f, -15.0f, 0.0f);\\n\\t\\t\\n\\t\\tglBegin(GL_TRIANGLES);\\n\\t\\tglColor3f(1.0f, 0.0f, 0.0f);\\n\\t\\tglVertex2f(0.0f, 0.0f);\\n\\t\\tglColor3f(0.0f, 1.0f, 0.0f);\\n\\t\\tglVertex2f(30f, 0.0f);\\n\\t\\tglColor3f(0.0f, 0.0f, 1.0f);\\n\\t\\tglVertex2f(0.0f, 30.0f);\\n\\t\\tglEnd();\\n\\t\\t\\n\\t}\\n\\t\\n\\tpublic static void main(String[] args) {\\n\\t\\tOpenGlExample openGlExmpl = new OpenGlExample();\\n\\t\\ttry {\\n\\t\\t\\topenGlExmpl.run();\\n\\t\\t} catch(LWJGLException e) {\\n\\t\\t\\tSystem.err.println(e);\\n\\t\\t}\\n\\t}\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"<html style=\\\"margin: 0;\\\">\\n <head>\\n <title>Minimal WebGL Example</title>\\n <!-- This use of <script> elements is so that we can have multiline text\\n without quoting it inside of JavaScript; the web browser doesn't\\n actually do anything besides store the text of these. -->\\n <script id=\\\"shader-fs\\\" type=\\\"x-shader/x-fragment\\\">\\n precision highp float;\\n varying vec4 v_color;\\n void main(void) {\\n // \\\"Varying\\\" variables are implicitly interpolated across triangles.\\n gl_FragColor = v_color;\\n }\\n </script>\\n <script id=\\\"shader-vs\\\" type=\\\"x-shader/x-vertex\\\">\\n attribute vec3 a_position;\\n attribute vec4 a_color;\\n varying vec4 v_color;\\n void main(void) {\\n gl_Position = vec4(a_position, 1.0);\\n v_color = a_color;\\n }\\n </script>\\n <script type=\\\"text/javascript\\\">\\n function getShader(gl, id) {\\n var scriptElement = document.getElementById(id);\\n // Create shader object\\n var shader;\\n if (scriptElement.type == \\\"x-shader/x-fragment\\\")\\n shader = gl.createShader(gl.FRAGMENT_SHADER);\\n else if (scriptElement.type == \\\"x-shader/x-vertex\\\")\\n shader = gl.createShader(gl.VERTEX_SHADER);\\n else\\n throw new Error(\\\"unknown shader script type\\\");\\n // Compile shader from source\\n gl.shaderSource(shader, scriptElement.textContent);\\n gl.compileShader(shader);\\n if (!gl.getShaderParameter(shader, gl.COMPILE_STATUS))\\n throw new Error(gl.getShaderInfoLog(shader));\\n return shader;\\n }\\n </script>\\n </head>\\n <body style=\\\"margin: 0;\\\">\\n <canvas id=\\\"glcanvas\\\" style=\\\"border: none; margin: auto; display: block;\\\" width=\\\"640\\\" height=\\\"480\\\"></canvas>\\n <script type=\\\"text/javascript\\\">\\n var canvas = document.getElementById(\\\"glcanvas\\\");\\n\\n // Get WebGL context.\\n var gl = canvas.getContext(\\\"webgl\\\")\\n || canvas.getContext(\\\"experimental-webgl\\\");\\n if (!gl)\\n throw new Error(\\\"WebGL context not found\\\");\\n\\n // Create shader program from vertex and fragment shader code.\\n var shaderProgram = gl.createProgram();\\n gl.attachShader(shaderProgram, getShader(gl, \\\"shader-vs\\\"));\\n gl.attachShader(shaderProgram, getShader(gl, \\\"shader-fs\\\"));\\n gl.linkProgram(shaderProgram);\\n if (!gl.getProgramParameter(shaderProgram, gl.LINK_STATUS))\\n throw new Error(gl.getProgramInfoLog(shaderProgram));\\n\\n // Specify to render using that program.\\n gl.useProgram(shaderProgram);\\n\\n // Get the indexes to communicate vertex attributes to the program.\\n var positionAttr = gl.getAttribLocation(shaderProgram, \\\"a_position\\\");\\n var colorAttr = gl.getAttribLocation(shaderProgram, \\\"a_color\\\");\\n // And specify that we will be actually delivering data to those attributes.\\n gl.enableVertexAttribArray(positionAttr);\\n gl.enableVertexAttribArray(colorAttr);\\n\\n // Store vertex positions and colors in array buffer objects.\\n var vertices;\\n var positionBuffer = gl.createBuffer();\\n gl.bindBuffer(gl.ARRAY_BUFFER, positionBuffer);\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vertices = [\\n -0.5, -0.5, 0,\\n +0.5, -0.5, 0,\\n -0.5, +0.5, 0\\n ]), gl.STATIC_DRAW);\\n var colorBuffer = gl.createBuffer();\\n gl.bindBuffer(gl.ARRAY_BUFFER, colorBuffer);\\n gl.bufferData(gl.ARRAY_BUFFER, new Float32Array([\\n 1, 0, 0, 1,\\n 0, 1, 0, 1,\\n 0, 0, 1, 1\\n ]), gl.STATIC_DRAW);\\n var numVertices = vertices.length / 3; // 3 coordinates per vertex\\n\\n // Set GL state\\n gl.clearColor(0.3, 0.3, 0.3, 1.0);\\n gl.enable(gl.DEPTH_TEST);\\n gl.viewport(0, 0, gl.drawingBufferWidth || canvas.width,\\n gl.drawingBufferHeight || canvas.height);\\n\\n // Draw scene.\\n // If this were an animation, everything after this point would go in a main loop.\\n // Clear frame.\\n gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT);\\n // Specify the array data to render.\\n // 3 and 4 are the lengths of the vectors (3 for XYZ, 4 for RGBA).\\n gl.bindBuffer(gl.ARRAY_BUFFER, positionBuffer);\\n gl.vertexAttribPointer(positionAttr, 3, gl.FLOAT, false, 0, 0);\\n gl.bindBuffer(gl.ARRAY_BUFFER, colorBuffer);\\n gl.vertexAttribPointer(colorAttr, 4, gl.FLOAT, false, 0, 0);\\n // Draw triangles using the specified arrays.\\n gl.drawArrays(gl.TRIANGLES, 0, numVertices);\\n\\n // Check for errors.\\n var e;\\n while (e = gl.getError())\\n console.log(\\\"GL error\\\", e);\\n </script>\\n </body>\\n</html>\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Makie\\n\\nmesh([(0.0, 0.0), (0.5, 1.0), (1.0, 0.0)], color = [:red, :green, :blue], shading = false)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Kotlin Native version 0.3\\n\\nimport kotlinx.cinterop.*\\nimport opengl.*\\n\\nfun paint() {\\n glClearColor(0.3f, 0.3f, 0.3f, 0.0f)\\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT)\\n\\n glShadeModel(GL_SMOOTH)\\n\\n glLoadIdentity()\\n glTranslatef(-15.0f, -15.0f, 0.0f)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0f, 0.0f, 0.0f)\\n glVertex2f(0.0f, 0.0f)\\n glColor3f(0.0f, 1.0f, 0.0f)\\n glVertex2f(30.0f, 0.0f)\\n glColor3f(0.0f, 0.0f, 1.0f)\\n glVertex2f(0.0f, 30.0f)\\n glEnd()\\n\\n glFlush()\\n}\\n\\nfun reshape(width: Int, height: Int) {\\n glViewport(0, 0, width, height)\\n glMatrixMode(GL_PROJECTION)\\n glLoadIdentity()\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n glMatrixMode(GL_MODELVIEW)\\n}\\n\\nfun main(args: Array<String>) {\\n memScoped {\\n val argc = alloc<IntVar>().apply { value = 0 }\\n glutInit(argc.ptr, null)\\n }\\n\\n glutInitWindowSize(640, 480)\\n glutCreateWindow(\\\"Triangle\\\")\\n\\n glutDisplayFunc(staticCFunction(::paint))\\n glutReshapeFunc(staticCFunction(::reshape))\\n\\n glutMainLoop()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"nomainwin\\n struct rect, x as long, y as long, x2 as long, y2 as long\\n struct PFD, Size as word, Version as word, Flags as long,_\\n PixelType as char[1], ColorBits as char[1], RedBits as char[1],_\\n RedShift as char[1], GreenBits as char[1], GreenShift as char[1],_\\n BlueBits as char[1], BlueShift as char[1], AlphaBits as char[1],_\\n AlphaShift as char[1],AccumBits as char[1], AccumRedBits as char[1],_\\n AccumGreenBits as char[1], AccumBlueBits as char[1], AccumAlphaBits as char[1],_\\n DepthBits as char[1], StencilBits as char[1], AuxBuffers as char[1],_\\n LayerType as char[1], Reserved as char[1], LayerMask as long,_\\n VisibleMask as long, DamageMask as long\\n PFD.Version.struct=1\\n PFD.ColorBits.struct=24\\n PFD.DepthBits.struct=16\\n PFD.Size.struct=len(PFD.struct)\\n PFD.Flags.struct=37\\n GlColorBufferBit=16384\\n open \\\"opengl32.dll\\\" for dll as #gl\\n open \\\"glu32.dll\\\" for dll as #glu\\n WindowWidth=500\\n WindowHeight=500\\n UpperLeftX=1\\n UpperLeftY=1\\n open \\\"Triangle\\\" for window_nf as #main\\n print #main,\\\"trapclose [quit]\\\"\\n MainH=hwnd(#main)\\n calldll #user32,\\\"GetDC\\\", MainH as ulong, MainDC as ulong\\n calldll #gdi32,\\\"ChoosePixelFormat\\\", MainDC as ulong, PFD as struct, ret as long\\n calldll #gdi32, \\\"SetPixelFormat\\\", MainDC as ulong, ret as long, PFD as struct, t as long\\n calldll #gl,\\\"wglCreateContext\\\", MainDC as ulong, GLContext as ulong\\n calldll #gl,\\\"wglMakeCurrent\\\", MainDC as ulong, GLContext as ulong, ret as long\\n calldll #gl,\\\"glClear\\\", GlColorBufferBit as long, ret as long\\n calldll #gl,\\\"glRotated\\\", 0 as double, 0 as double, 0 as double, 0 as double, ret as long\\n calldll #gl,\\\"glBegin\\\", 4 as long, ret as long\\n calldll #gl,\\\"glColor3d\\\", 0 as double, 0 as double, 255 as double, ret as long\\n calldll #gl,\\\"glVertex3i\\\", -1 as long, -1 as long, 0 as long, ret as long\\n calldll #gl,\\\"glColor3d\\\", 255 as double, 0 as double, 0 as double, ret as long\\n calldll #gl,\\\"glVertex3i\\\", 0 as long, 1 as long, 0 as long, ret as long\\n calldll #gl,\\\"glColor3d\\\", 0 as double, 255 as double, 0 as double, ret as long\\n calldll #gl,\\\"glVertex3i\\\", 1 as long, -1 as long, 0 as long, ret as long\\n calldll #gl,\\\"glEnd\\\", ret as void\\n calldll #gdi32,\\\"SwapBuffers\\\", MainDC as ulong, ret as long\\n wait\\n[quit]\\n calldll #gl,\\\"wglMakeCurrent\\\", 0 as ulong, 0 as ulong, ret as long\\n calldll #gl,\\\"wglDeleteContext\\\", GLContext as ulong, ret as long\\n calldll #user32, \\\"ReleaseDC\\\", MainH as ulong, MainDC as ulong,ret as long\\n close #main\\n close #glu\\n close #gl\\n end\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"global gOpenGL -- RavOpenGL xtra instance\\nglobal GL -- OpenGL constants\\n\\non startMovie\\n -- Load the OpenGL script xtra\\n gOpenGL = xtra(\\\"RavOpenGL\\\").new()\\n\\n -- Load GL DLL\\n gOpenGL.RavLoadGL(\\\"\\\", \\\"\\\")\\n\\n -- Function omitted in demo code: loads OpenGL constants into namespace GL\\n loadGLConstants()\\n\\n -- Window settings\\n w = 640\\n h = 480\\n _movie.stage.title = \\\"Triangle\\\"\\n _movie.stage.rect = rect(0, 0, w, h)\\n _movie.centerStage = TRUE\\n\\n -- Create OpenGL display sprite\\n m = new(#RavOpenGLDisplay)\\n _movie.puppetSprite(1, TRUE)\\n sprite(1).rect = rect(0, 0, w, h)\\n sprite(1).member = m\\n _movie.updateStage()\\n\\n -- Create the OpenGL buffer\\n mainBufferID = gOpenGL.RavCreateBuffer(w, h, 32, 32)\\n\\n -- Set the sharing mode between script and sprite xtras\\n dcID = gOpenGL.RavGetBufferProp(mainBufferID, #ravGC)\\n sprite(1).RavShareBuffer(dcID, #true)\\n\\n gOpenGL.glViewport(0, 0, w, h)\\n gOpenGL.glMatrixMode(GL.PROJECTION)\\n gOpenGL.glLoadIdentity()\\n gOpenGL.glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n gOpenGL.glMatrixMode(GL.MODELVIEW)\\n\\n gOpenGL.glClearColor(0.3, 0.3, 0.3, 0.0)\\n gOpenGL.glClear(GL.COLOR_BUFFER_BIT + GL.DEPTH_BUFFER_BIT)\\n gOpenGL.glShadeModel(GL.SMOOTH)\\n gOpenGL.glLoadIdentity()\\n gOpenGL.glTranslatef(-15.0, -15.0, 0.0)\\n gOpenGL.glBegin(GL.TRIANGLES)\\n gOpenGL.glColor3f(1.0, 0.0, 0.0)\\n gOpenGL.glVertex2f(0.0, 0.0)\\n gOpenGL.glColor3f(0.0, 1.0, 0.0)\\n gOpenGL.glVertex2f(30.0, 0.0)\\n gOpenGL.glColor3f(0.0, 0.0, 1.0)\\n gOpenGL.glVertex2f(0.0, 30.0)\\n gOpenGL.glEnd()\\n gOpenGL.glFlush()\\n\\n -- Show the window\\n _movie.stage.visible = TRUE\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"local gl = require \\\"luagl\\\"\\nlocal iup = require \\\"iuplua\\\"\\nrequire \\\"iupluagl\\\"\\n\\nlocal function paint()\\n gl.ClearColor(0.3,0.3,0.3,0.0)\\n gl.Clear\\\"COLOR_BUFFER_BIT,DEPTH_BUFFER_BIT\\\"\\n\\n gl.ShadeModel\\\"SMOOTH\\\"\\n\\n gl.LoadIdentity()\\n gl.Translate(-15.0, -15.0, 0.0)\\n\\n gl.Begin\\\"TRIANGLES\\\"\\n gl.Color(1.0, 0.0, 0.0)\\n gl.Vertex(0.0, 0.0)\\n gl.Color(0.0, 1.0, 0.0)\\n gl.Vertex(30.0, 0.0)\\n gl.Color(0.0, 0.0, 1.0)\\n gl.Vertex(0.0, 30.0)\\n gl.End()\\n\\n gl.Flush()\\nend\\n\\nlocal function reshape(width, height)\\n gl.Viewport(0, 0, width, height)\\n gl.MatrixMode\\\"PROJECTION\\\"\\n gl.LoadIdentity()\\n gl.Ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n gl.MatrixMode\\\"MODELVIEW\\\"\\nend\\n\\nlocal glc = iup.glcanvas{rastersize=\\\"640x480\\\"}\\nfunction glc:action() paint() end\\nfunction glc:resize_cb(w,h) reshape(w,h) end\\nfunction glc:map_cb() iup.GLMakeCurrent(self) end\\n\\nlocal dlg = iup.dialog{title=\\\"Triangle\\\", shrink=\\\"yes\\\"; glc}\\ndlg:show()\\n\\niup.MainLoop()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Style[Graphics3D[{Polygon[{{-1, 0, 0}, {1, 0, 0}, {0, Sqrt[3], 0.5}},\\n VertexColors -> {Red, Green, Blue}]}, Boxed -> False],\\n RenderingOptions -> {\\\"3DRenderingEngine\\\" -> \\\"OpenGL\\\"}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"newMesh = mesh numVerts:3 numFaces:1\\nsetMesh newMesh vertices:#([-100, -100, 0], [100, -100, 0], [-100, 100, 0]) faces:#([1, 2, 3])\\ndefaultVCFaces newMesh\\nsetVertColor newMesh 1 red\\nsetVertColor newMesh 2 green\\nsetVertColor newMesh 3 blue\\nsetCVertMode newMesh true\\nupdate newMesh\\nviewport.setType #view_top\\nmax tool maximize\\nviewport.SetRenderLevel #smoothhighlights\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \":- module opengl.\\n:- interface.\\n\\n:- import_module io.\\n:- pred main(io::di, io::uo) is det.\\n\\n:- implementation.\\n:- import_module list, glut, glut.callback, glut.window, mogl.\\n\\nmain(!IO) :-\\n glut.init_window_size(640, 480, !IO),\\n glut.window.create(\\\"Triangle\\\", !IO),\\n glut.callback.display_func(opengl.paint, !IO),\\n glut.callback.reshape_func(opengl.reshape, !IO),\\n glut.main_loop(!IO).\\n\\n:- pred paint(io::di, io::uo) is det.\\n\\npaint(!IO) :-\\n mogl.clear_color(0.3, 0.3, 0.3 , 0.0, !IO),\\n mogl.clear([color, depth], !IO),\\n\\n mogl.shade_model(smooth, !IO),\\n\\n mogl.load_identity(!IO),\\n mogl.translate(-15.0, -15.0, 0.0, !IO),\\n\\n mogl.begin(triangles, !IO),\\n mogl.color3(1.0, 0.0, 0.0, !IO),\\n mogl.vertex2(0.0, 0.0, !IO),\\n mogl.color3(0.0, 1.0, 0.0, !IO),\\n mogl.vertex2(30.0, 0.0, !IO),\\n mogl.color3(0.0, 0.0, 1.0, !IO),\\n mogl.vertex2(0.0, 30.0, !IO),\\n mogl.end(!IO),\\n\\n mogl.flush(!IO).\\n\\n:- pred reshape(int::in, int::in, io::di, io::uo) is det.\\n\\nreshape(Width, Height, !IO) :-\\n mogl.viewport(0, 0, Width, Height, !IO),\\n mogl.matrix_mode(projection, !IO),\\n mogl.load_identity(!IO),\\n mogl.ortho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0, !IO),\\n mogl.matrix_mode(modelview, !IO).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"import opengl, opengl/glut\\n\\nproc paint() {.cdecl.} =\\n glClearColor(0.3,0.3,0.3,0.0)\\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT)\\n\\n glShadeModel(GL_SMOOTH)\\n\\n glLoadIdentity()\\n glTranslatef(-15.0, -15.0, 0.0)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0, 0.0, 0.0)\\n glVertex2f(0.0, 0.0)\\n glColor3f(0.0, 1.0, 0.0)\\n glVertex2f(30.0, 0.0)\\n glColor3f(0.0, 0.0, 1.0)\\n glVertex2f(0.0, 30.0)\\n glEnd()\\n\\n glFlush()\\n\\nproc reshape(width, height: cint) {.cdecl.} =\\n glViewport(0, 0, width, height)\\n glMatrixMode(GL_PROJECTION)\\n glLoadIdentity()\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n glMatrixMode(GL_MODELVIEW)\\n\\nenableAutoGlErrorCheck(false)\\nloadExtensions()\\nglutInit()\\nglutInitWindowSize(640, 480)\\ndiscard glutCreateWindow(\\\"Triangle\\\")\\n\\nglutDisplayFunc(paint)\\nglutReshapeFunc(reshape)\\n\\nglutMainLoop()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"open GL\\nopen Glut\\n\\nlet display() =\\n glClearColor 0.3 0.3 0.3 0.0;\\n glClear[GL_COLOR_BUFFER_BIT; GL_DEPTH_BUFFER_BIT];\\n\\n glShadeModel GL_SMOOTH;\\n\\n glLoadIdentity();\\n glTranslate (-15.0) (-15.0) (0.0);\\n\\n glBegin GL_TRIANGLES;\\n glColor3 1.0 0.0 0.0;\\n glVertex2 0.0 0.0;\\n glColor3 0.0 1.0 0.0;\\n glVertex2 30.0 0.0;\\n glColor3 0.0 0.0 1.0;\\n glVertex2 0.0 30.0;\\n glEnd();\\n\\n glFlush();\\n;;\\n\\nlet reshape ~width ~height =\\n glViewport 0 0 width height;\\n glMatrixMode GL_PROJECTION;\\n glLoadIdentity();\\n glOrtho(-30.0) 30.0 (-30.0) 30.0 (-30.0) 30.0;\\n glMatrixMode GL_MODELVIEW;\\n;;\\n\\nlet () =\\n ignore(glutInit Sys.argv);\\n glutInitWindowSize 640 480;\\n ignore(glutCreateWindow \\\"Triangle\\\");\\n\\n glutDisplayFunc ~display;\\n glutReshapeFunc ~reshape;\\n\\n glutMainLoop();\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(import (lib gl))\\n(gl:set-window-title \\\"Rosettacode OpenGL example\\\")\\n\\n(import (OpenGL version-1-0))\\n\\n(glShadeModel GL_SMOOTH)\\n(glClearColor 0.3 0.3 0.3 1)\\n(glMatrixMode GL_PROJECTION)\\n(glLoadIdentity)\\n(glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0)\\n\\n(gl:set-renderer (lambda (mouse)\\n (glClear GL_COLOR_BUFFER_BIT)\\n\\n (glMatrixMode GL_MODELVIEW)\\n (glLoadIdentity)\\n (glTranslatef -15.0 -15.0 0.0)\\n\\n (glBegin GL_TRIANGLES)\\n (glColor3f 1.0 0.0 0.0)\\n (glVertex2f 0.0 0.0)\\n (glColor3f 0.0 1.0 0.0)\\n (glVertex2f 30.0 0.0)\\n (glColor3f 0.0 0.0 1.0)\\n (glVertex2f 0.0 30.0)\\n (glEnd)\\n))\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \" title=\\\"Rotating Triangle\\\"\\n include \\\"OpenglSceneFrame.inc\\\"\\n\\n\\n sub Initialize(sys hWnd)\\n '=======================\\n SetTimer hWnd,1,10,NULL\\n end sub\\n '\\n sub Scene(sys hWnd)\\n '==================\\n '\\n static single ang1,angi1=1\\n '\\n glClearColor 0.3, 0.3, 0.5, 0\\n glClear GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT\\n '\\n glLoadIdentity\\n '\\n '\\n gltranslatef 0.0, 0.0, -4.0\\n glrotatef ang1, 0.0, 0.0, 1.0\\n '\\n glBegin GL_TRIANGLES\\n glColor3f 1.0, 0.0, 0.0 : glVertex3f 0.0, 1.0, 0.0\\n glColor3f 0.0, 1.0, 0.0 : glVertex3f -1.0, -1.0, 0.0\\n glColor3f 0.0, 0.0, 1.0 : glVertex3f 1.0, -1.0, 0.0\\n glEnd\\n '\\n 'UPDATE ROTATION ANGLES\\n '\\n ang1+=angi1\\n if ang1>360 then ang1-=360\\n '\\n end sub\\n\\n\\n sub Release(sys hwnd)\\n '====================\\n killTimer hwnd, 1\\n end sub\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"Program OpenGLDemo;\\n\\nuses\\n SysUtils,\\n ctypes,\\n gl,\\n Glut;\\n\\nprocedure paint; cdecl;\\nbegin\\n glClearColor(0.3,0.3,0.3,0.0);\\n glClear(GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT);\\n\\n glShadeModel(GL_SMOOTH);\\n\\n glLoadIdentity();\\n glTranslatef(-15.0, -15.0, 0.0);\\n\\n glBegin(GL_TRIANGLES);\\n glColor3f(1.0, 0.0, 0.0);\\n glVertex2f(0.0, 0.0);\\n glColor3f(0.0, 1.0, 0.0);\\n glVertex2f(30.0, 0.0);\\n glColor3f(0.0, 0.0, 1.0);\\n glVertex2f(0.0, 30.0);\\n glEnd();\\n\\n glFlush();\\nend;\\n\\nprocedure reshape(width, height: cint); cdecl;\\nbegin\\n glViewport(0, 0, width, height);\\n glMatrixMode(GL_PROJECTION);\\n glLoadIdentity();\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\\n glMatrixMode(GL_MODELVIEW);\\nend;\\n\\nbegin\\n glutInit(@argc, @argv);\\n glutInitWindowSize(640, 480);\\n glutCreateWindow('Triangle');\\n\\n glutDisplayFunc(@paint);\\n glutReshapeFunc(@reshape);\\n\\n glutMainLoop();\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use OpenGL;\\n\\nsub triangle {\\n glBegin GL_TRIANGLES;\\n glColor3f 1.0, 0.0, 0.0;\\n glVertex2f 5.0, 5.0;\\n glColor3f 0.0, 1.0, 0.0;\\n glVertex2f 25.0, 5.0;\\n glColor3f 0.0, 0.0, 1.0;\\n glVertex2f 5.0, 25.0;\\n glEnd;\\n};\\n\\nglpOpenWindow;\\nglMatrixMode GL_PROJECTION;\\nglLoadIdentity;\\ngluOrtho2D 0.0, 30.0, 0.0, 30.0;\\nglMatrixMode GL_MODELVIEW;\\n\\nglClear GL_COLOR_BUFFER_BIT;\\ntriangle;\\nglpFlush;\\n\\nglpMainLoop;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use SDL::App;\\nuse SDL::Event;\\nuse SDL::OpenGL;\\n\\n$app = SDL::App->new(\\n -gl => 1,\\n);\\n\\nsub triangle {\\n glBegin(GL_TRIANGLES);\\n glColor(1.0, 0.0, 0.0);\\n glVertex(5.0, 5.0);\\n glColor(0.0, 1.0, 0.0);\\n glVertex(25.0, 5.0);\\n glColor(0.0, 0.0, 1.0);\\n glVertex(5.0, 25.0);\\n glEnd();\\n}\\n\\nglMatrixMode(GL_PROJECTION);\\nglLoadIdentity();\\ngluOrtho2D(0.0, 30.0, 0.0, 30.0);\\nglMatrixMode(GL_MODELVIEW);\\nglClear(GL_COLOR_BUFFER_BIT);\\ntriangle();\\n$app->sync;\\n$app->loop ({\\n SDL_QUIT() => sub { exit; },\\n});\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\OpenGL.exw\\n -- =======================\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.1\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">opengl</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandln</span> <span style=\\\"color: #000000;\\\">dlg</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">canvas</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">fragment_shader</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n precision highp float;\\n varying vec4 v_color;\\n void main(void) {\\n // \\\"Varying\\\" variables are implicitly interpolated across triangles.\\n gl_FragColor = v_color;\\n }\\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">vertex_shader</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n attribute vec3 a_position;\\n attribute vec4 a_color;\\n varying vec4 v_color;\\n void main(void) {\\n gl_Position = vec4(a_position, 1.0);\\n v_color = a_color;\\n }\\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">get_shader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">stype</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">shader</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glCreateShader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stype</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glShaderSource</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shader</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">src</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glCompileShader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shader</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">glGetShaderParameter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shader</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_COMPILE_STATUS</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">glGetShaderInfoLog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shader</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">shader</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">vertices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (bl)</span>\\n <span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (br)</span>\\n <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (tl)\\n -- +0.5, +0.5, 0 }, -- (tr)</span>\\n <span style=\\\"color: #000000;\\\">colours</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- red (bl)</span>\\n <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- green (br)</span>\\n <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- blue (tl)</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">set_shader</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupGLMakeCurrent</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">shaderProgram</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glCreateProgram</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">glAttachShader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">get_shader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vertex_shader</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">GL_VERTEX_SHADER</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">glAttachShader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">get_shader</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fragment_shader</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">GL_FRAGMENT_SHADER</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">glLinkProgram</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">glGetProgramParameter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_LINK_STATUS</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">glGetProgramInfoLog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">glUseProgram</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Get the indexes to communicate vertex attributes to the program.</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">positionAttr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glGetAttribLocation</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"a_position\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">colorAttr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glGetAttribLocation</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shaderProgram</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"a_color\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// And specify that we will be actually delivering data to those attributes.</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">positionAttr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colorAttr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Store vertex positions and colors in array buffer objects.</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">positionBuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glCreateBuffer</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">glBindBuffer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">positionBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glFloat32Array</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vertices</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glBufferData</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_STATIC_DRAW</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">positionBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">colorBuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glCreateBuffer</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">glBindBuffer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">colorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glFloat32Array</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colours</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glBufferData</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pData</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_STATIC_DRAW</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnable</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_DEPTH_TEST</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Specify the array data to render.\\n // 3 and 4 are the lengths of the vectors (3 for XYZ, 4 for RGBA).</span>\\n <span style=\\\"color: #7060A8;\\\">glBindBuffer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">positionBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glVertexAttribPointer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">positionAttr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_FLOAT</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">positionAttr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glBindBuffer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_ARRAY_BUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">colorBuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glVertexAttribPointer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colorAttr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">GL_FLOAT</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glEnableVertexAttribArray</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colorAttr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">drawn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">action</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">drawn</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">glClearColor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0.3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glViewport</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">glClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_COLOR_BUFFER_BIT</span> <span style=\\\"color: #0000FF;\\\">||</span> <span style=\\\"color: #004600;\\\">GL_DEPTH_BUFFER_BIT</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Draw triangles using the specified arrays.</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">numVertices</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">vertices</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #000080;font-style:italic;\\\">// 3 coordinates per vertex</span>\\n <span style=\\\"color: #7060A8;\\\">glDrawArrays</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">GL_TRIANGLES</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numVertices</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Check for errors.</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">glGetError</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">GL_NO_ERROR</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"GL error %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #7060A8;\\\">glFlush</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">drawn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">canvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGLCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"action\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #008000;\\\">\\\"RASTERSIZE=640x480\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"TITLE=OpenGLShader, SHRINK=YES\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupMap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">set_shader</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDestroy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(load \\\"@lib/openGl.l\\\")\\n\\n(glutInit)\\n(glutInitWindowSize 400 300)\\n(glutCreateWindow \\\"Triangle\\\")\\n\\n(displayPrg\\n (glClearColor 0.3 0.3 0.3 0.0)\\n (glClear (| GL_COLOR_BUFFER_BIT GL_DEPTH_BUFFER_BIT))\\n (glShadeModel GL_SMOOTH)\\n (glLoadIdentity)\\n (glTranslatef -15.0 -15.0 0.0)\\n (glBegin GL_TRIANGLES)\\n (glColor3f 1.0 0.0 0.0)\\n (glVertex2f 0.0 0.0)\\n (glColor3f 0.0 1.0 0.0)\\n (glVertex2f 30.0 0.0)\\n (glColor3f 0.0 0.0 1.0)\\n (glVertex2f 0.0 30.0)\\n (glEnd)\\n (glFlush) )\\n\\n(reshapeFunc\\n '((Width Height)\\n (glViewport 0 0 Width Height)\\n (glMatrixMode GL_PROJECTION)\\n (glLoadIdentity)\\n (glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0)\\n (glMatrixMode GL_MODELVIEW) ) )\\n\\n# Exit upon mouse click\\n(mouseFunc '((Btn State X Y) (bye)))\\n\\n(glutMainLoop)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int main() {\\n\\tGLUE.init(([\\n\\t\\t\\\"fullscreen\\\": 0,\\n\\t\\t\\\"resolution\\\": ({ 640, 480 }),\\n\\t]));\\n\\t\\n\\twhile (1) {\\n\\t\\tGL.glViewport(0, 0, 640, 480);\\n\\t\\tGL.glMatrixMode(GL.GL_PROJECTION);\\n\\t\\tGL.glLoadIdentity();\\n\\t\\tGL.glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0);\\n\\t\\tGL.glMatrixMode(GL.GL_MODELVIEW);\\n\\t\\t\\n\\t\\tGL.glClearColor(0.3,0.3,0.3,0.0);\\n\\t\\tGL.glClear(GL.GL_COLOR_BUFFER_BIT | GL.GL_DEPTH_BUFFER_BIT);\\n\\t\\t\\n\\t\\tGL.glShadeModel(GL.GL_SMOOTH);\\n\\t\\t\\n\\t\\tGL.glLoadIdentity();\\n\\t\\tGL.glTranslate(-15.0, -15.0, 0.0);\\n\\t\\t\\n\\t\\tGL.glBegin(GL.GL_TRIANGLES);\\n\\t\\tGL.glColor(1.0, 0.0, 0.0);\\n\\t\\tGL.glVertex(0.0, 0.0);\\n\\t\\tGL.glColor(0.0, 1.0, 0.0);\\n\\t\\tGL.glVertex(30.0, 0.0);\\n\\t\\tGL.glColor(0.0, 0.0, 1.0);\\n\\t\\tGL.glVertex(0.0, 30.0);\\n\\t\\tGL.glEnd();\\n\\t\\t\\n\\t\\tGL.glFlush();\\n\\t\\t\\n\\t\\tGLUE.swap_buffers();\\n\\t\\tPike.DefaultBackend(0.0);\\n\\t\\tsleep(0.01);\\n\\t}\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"XIncludeFile \\\"OpenGL.pbi\\\"\\npfd.PIXELFORMATDESCRIPTOR\\nFlatMode = 0 ; Enable Or disable the 'Flat' rendering\\nWindowWidth = 800 ; The window & GLViewport dimensions\\nWindowHeight = 600\\nhWnd = OpenWindow(0, 0, 0, WindowWidth, WindowHeight, \\\"OpenGL Triangle\\\", #PB_Window_SystemMenu)\\nhdc = GetDC_(hWnd)\\npfd\\\\nSize = SizeOf(PIXELFORMATDESCRIPTOR)\\npfd\\\\nVersion = 1\\npfd\\\\dwFlags = #PFD_SUPPORT_OPENGL | #PFD_DOUBLEBUFFER | #PFD_DRAW_TO_WINDOW\\npfd\\\\dwLayerMask = #PFD_MAIN_PLANE\\npfd\\\\iPixelType = #PFD_TYPE_RGBA\\npfd\\\\cColorBits = 24\\npfd\\\\cDepthBits = 16\\npixformat = ChoosePixelFormat_(hdc, pfd)\\nSetPixelFormat_(hdc, pixformat, pfd)\\nhrc = wglCreateContext_(hdc)\\nwglMakeCurrent_(hdc,hrc)\\nglViewport_ (0, 0, WindowWidth-30, WindowHeight-30)\\nglPushMatrix_()\\nglMatrixMode_(#GL_MODELVIEW)\\nglBegin_(#GL_TRIANGLES );\\nglColor3f_(1.0, 0.0, 0.0 )\\nglVertex2f_( 0.0, 1.0 )\\nglColor3f_( 0.0, 1.0, 0.0 )\\nglVertex2f_( 0.87, -0.5 );\\nglColor3f_( 0.0, 0.0, 1.0 )\\nglVertex2f_( -0.87, -0.5 );\\nglEnd_()\\nglPopMatrix_()\\nglFinish_()\\nSwapBuffers_(hdc)\\nWhile Quit = 0\\n Repeat\\n EventID = WindowEvent()\\n Select EventID\\n Case #PB_Event_CloseWindow\\n Quit = 1\\n EndSelect\\n Until EventID = 0\\nWend\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"#!/usr/bin/env python\\n#-*- coding: utf-8 -*-\\n\\nfrom OpenGL.GL import *\\nfrom OpenGL.GLUT import *\\n\\ndef paint():\\n glClearColor(0.3,0.3,0.3,0.0)\\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT)\\n\\n glShadeModel(GL_SMOOTH)\\n\\n glLoadIdentity()\\n glTranslatef(-15.0, -15.0, 0.0)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0, 0.0, 0.0)\\n glVertex2f(0.0, 0.0)\\n glColor3f(0.0, 1.0, 0.0)\\n glVertex2f(30.0, 0.0)\\n glColor3f(0.0, 0.0, 1.0)\\n glVertex2f(0.0, 30.0)\\n glEnd()\\n\\n glFlush()\\n\\ndef reshape(width, height):\\n glViewport(0, 0, width, height)\\n glMatrixMode(GL_PROJECTION)\\n glLoadIdentity()\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n glMatrixMode(GL_MODELVIEW)\\n\\nif __name__ == '__main__':\\n glutInit(1, 1)\\n glutInitWindowSize(640, 480)\\n glutCreateWindow(\\\"Triangle\\\")\\n\\n glutDisplayFunc(paint)\\n glutReshapeFunc(reshape)\\n\\n glutMainLoop()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'Task\\n'Display a smooth shaded triangle with OpenGL.\\nScreen _NewImage(600, 600, 32)\\nDim Shared glInit As Integer\\nglInput = 0\\nDo While InKey$ = \\\"\\\": Loop\\nEnd\\n\\n\\nSub _GL ()\\n If glInit = 0 Then\\n _glViewport 1, 1, 600, 600\\n _glClearColor 0, 0, 0, 1\\n glInit = -1\\n End If\\n _glClear _GL_COLOR_BUFFER_BIT\\n _glBegin _GL_TRIANGLES\\n _glColor4f 1, 0, 0, 1\\n _glVertex2f -1, -1\\n _glColor4f 0, 1, 0, 1\\n _glVertex2f 0, 0\\n _glColor4f 0, 0, 1, 1\\n _glVertex2f 1, -1\\n _glEnd\\nEnd Sub\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"library(rgl)\\nx <- c(-1, -1, 1)\\ny <- c(0, -1, -1)\\nz <- c(0, 0, 0)\\nM <- cbind(x,y,z)\\nrgl.bg(color=\\\"gray15\\\")\\ntriangles3d(M, col=rainbow(8))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket/gui\\n(require sgl/gl)\\n\\n(define (resize w h)\\n (glViewport 0 0 w h))\\n\\n(define (draw-opengl)\\n (glClearColor 0.0 0.0 0.0 0.0)\\n (glClear GL_COLOR_BUFFER_BIT)\\n\\n (glShadeModel GL_SMOOTH)\\n\\n (glMatrixMode GL_PROJECTION)\\n (glLoadIdentity)\\n (glOrtho 0.0 1.0 0.0 1.0 -1.0 1.0)\\n (glMatrixMode GL_MODELVIEW)\\n (glLoadIdentity)\\n\\n (glBegin GL_TRIANGLES)\\n (glColor3f 1 0 0)\\n (glVertex3d 0.25 0.25 0.0)\\n (glColor3f 0 1 0)\\n (glVertex3d 0.75 0.25 0.0)\\n (glColor3f 0 0 1)\\n (glVertex3d 0.75 0.75 0.0)\\n (glEnd))\\n\\n\\n(define my-canvas%\\n (class* canvas% ()\\n (inherit with-gl-context swap-gl-buffers)\\n (define/override (on-paint)\\n (with-gl-context (λ() (draw-opengl) (swap-gl-buffers))))\\n (define/override (on-size width height)\\n (with-gl-context (λ() (resize width height) (on-paint))))\\n (super-instantiate () (style '(gl)))))\\n\\n(define win (new frame% [label \\\"Racket Rosetta Code OpenGL example\\\"]\\n [min-width 200] [min-height 200]))\\n(define gl (new my-canvas% [parent win]))\\n\\n(send win show #t)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use NativeCall;\\n\\nclass Window is repr('CPointer') {}\\nclass Monitor is repr('CPointer') {}\\n\\n# GLFW\\n\\nconstant $lib = ('glfw', v3);\\n\\nsub glfwInit(--> int32) is native($lib) {*}\\nsub glfwCreateWindow(int32, int32, Str, Monitor, Window --> Window) is native($lib) {*}\\nsub glfwTerminate() is native($lib) {*}\\nsub glfwMakeContextCurrent(Window) is native($lib) {*}\\nsub glfwSetWindowShouldClose(Window, int32) is native($lib) {*}\\nsub glfwWindowShouldClose(Window --> int32) is native($lib) {*}\\nsub glfwSwapBuffers(Window) is native($lib) {*}\\nsub glfwSwapInterval(int32) is native($lib) {*}\\nsub glfwPollEvents() is native($lib) {*}\\nsub glfwGetFramebufferSize(Window, int32 is rw, int32 is rw) is native($lib) {*}\\n\\n# OpenGL\\n\\nenum PrimitiveMode(\\n GL_TRIANGLES =>\\t0x0004,\\n);\\n\\nenum MatrixMode(\\n GL_MATRIX_MODE => 0x0BA0,\\n GL_MODELVIEW => 0x1700,\\n GL_PROJECTION => 0x1701,\\n);\\n\\nconstant $gllib = 'GL';\\n\\nsub glViewport(int32, int32, int32, int32) is native($gllib) {*}\\nsub glClear(int32) is native($gllib) {*}\\nsub glMatrixMode(int32) is native($gllib) {*}\\nsub glLoadIdentity() is native($gllib) {*}\\nsub glOrtho(num64, num64, num64, num64, num64, num64) is native($gllib) {*}\\nsub glRotatef(num32, num32, num32, num32) is native($gllib) {*}\\nsub glBegin(int32) is native($gllib) {*}\\nsub glColor3f(num32, num32, num32) is native($gllib) {*}\\nsub glVertex3f(num32, num32, num32) is native($gllib) {*}\\nsub glEnd() is native($gllib) {*}\\n\\nconstant GL_COLOR_BUFFER_BIT = 0x00004000;\\n\\ndie 'Failed to initialize GLFW' unless glfwInit().so;\\n\\nmy $w = glfwCreateWindow(640, 480, \\\"OpenGL Triangle\\\", Nil, Nil);\\nwithout $w { glfwTerminate(); die 'Failed to create window' }\\n\\nglfwMakeContextCurrent($w);\\nglfwSwapInterval(1);\\n\\nwhile not glfwWindowShouldClose($w) {\\n my num32 $ratio;\\n my int32 $width;\\n my int32 $height;\\n\\n glfwGetFramebufferSize($w, $width, $height);\\n $ratio = ($width / $height).Num;\\n\\n glViewport(0, 0, $width, $height);\\n glClear(GL_COLOR_BUFFER_BIT);\\n\\n glMatrixMode(GL_PROJECTION);\\n glLoadIdentity();\\n glOrtho(-$ratio, $ratio, -1e0, 1e0, 1e0, -1e0);\\n glMatrixMode(GL_MODELVIEW);\\n\\n glLoadIdentity();\\n glRotatef((now % 360 * 100e0) , 0e0, 0e0, 1e0);\\n\\n glBegin(GL_TRIANGLES);\\n glColor3f(1e0, 0e0, 0e0);\\n glVertex3f(5e-1, -2.88e-1, 0e0);\\n glColor3f(0e0, 1e0, 0e0);\\n glVertex3f(-5e-1, -2.88e-1, 0e0);\\n glColor3f(0e0, 0e0, 1e0);\\n glVertex3f( 0e0, 5.73e-1, 0e0);\\n glEnd();\\n\\n glfwSwapBuffers($w);\\n glfwPollEvents();\\n}\\n\\nglfwTerminate();\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"# Project: OpenGL\\n\\nload \\\"freeglut.ring\\\"\\nload \\\"opengl21lib.ring\\\"\\n\\nfunc main\\n glutInit()\\n glutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA)\\n glutInitWindowSize(320,320)\\n glutInitWindowPosition(100, 10)\\n glutCreateWindow(\\\"OpenGL\\\")\\n glutDisplayFunc(:renderScene)\\n glutMainLoop()\\n\\nfunc renderScene\\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\\n glBegin(GL_TRIANGLES)\\n glVertex3f(-0.5,-0.5,0.0)\\n glVertex3f(0.5,0.0,0.0)\\n glVertex3f(0.0,0.5,0.0)\\n glEnd()\\n glutSwapBuffers()\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'rubygems'\\nrequire 'gl'\\nrequire 'glut'\\n\\ninclude Gl\\ninclude Glut\\n\\npaint = lambda do\\n glClearColor(0.3,0.3,0.3,0.0)\\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\\n\\n glShadeModel(GL_SMOOTH)\\n\\n glLoadIdentity\\n glTranslatef(-15.0, -15.0, 0.0)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0, 0.0, 0.0)\\n glVertex2f(0.0, 0.0)\\n glColor3f(0.0, 1.0, 0.0)\\n glVertex2f(30.0, 0.0)\\n glColor3f(0.0, 0.0, 1.0)\\n glVertex2f(0.0, 30.0)\\n glEnd\\n\\n glFlush\\nend\\n\\nreshape = lambda do |width, height|\\n glViewport(0, 0, width, height)\\n glMatrixMode(GL_PROJECTION)\\n glLoadIdentity\\n glOrtho(-30.0, 30.0, -30.0, 30.0, -30.0, 30.0)\\n glMatrixMode(GL_MODELVIEW)\\nend\\n\\nglutInit\\nglutInitWindowSize(640, 480)\\nglutCreateWindow(\\\"Triangle\\\")\\n\\nglutDisplayFunc(paint)\\nglutReshapeFunc(reshape)\\n\\nglutMainLoop\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use glow::*;\\nuse glutin::event::*;\\nuse glutin::event_loop::{ControlFlow, EventLoop};\\nuse std::os::raw::c_uint;\\n\\nconst VERTEX: &str = \\\"#version 410\\nconst vec2 verts[3] = vec2[3](\\n vec2(0.5f, 1.0f),\\n vec2(0.0f, 0.0f),\\n vec2(1.0f, 0.0f)\\n);\\nout vec2 vert;\\nvoid main() {\\n vert = verts[gl_VertexID];\\n gl_Position = vec4(vert - 0.5, 0.0, 1.0);\\n}\\\";\\n\\nconst FRAGMENT: &str = \\\"#version 410\\nprecision mediump float;\\nin vec2 vert;\\nout vec4 color;\\nvoid main() {\\n color = vec4(vert, 0.5, 1.0);\\n}\\\";\\n\\nunsafe fn create_program(gl: &Context, vert: &str, frag: &str) -> c_uint {\\n let program = gl.create_program().expect(\\\"Cannot create program\\\");\\n let shader_sources = [(glow::VERTEX_SHADER, vert), (glow::FRAGMENT_SHADER, frag)];\\n\\n let mut shaders = Vec::new();\\n for (shader_type, shader_source) in shader_sources.iter() {\\n let shader = gl\\n .create_shader(*shader_type)\\n .expect(\\\"Cannot create shader\\\");\\n gl.shader_source(shader, shader_source);\\n gl.compile_shader(shader);\\n if !gl.get_shader_compile_status(shader) {\\n panic!(gl.get_shader_info_log(shader));\\n }\\n gl.attach_shader(program, shader);\\n shaders.push(shader);\\n }\\n\\n gl.link_program(program);\\n if !gl.get_program_link_status(program) {\\n panic!(gl.get_program_info_log(program));\\n }\\n\\n for shader in shaders {\\n gl.detach_shader(program, shader);\\n gl.delete_shader(shader);\\n }\\n program\\n}\\n\\nfn main() {\\n let (gl, event_loop, window) = unsafe {\\n let el = EventLoop::new();\\n let wb = glutin::window::WindowBuilder::new()\\n .with_title(\\\"Hello triangle!\\\")\\n .with_inner_size(glutin::dpi::LogicalSize::new(1024.0, 768.0));\\n let windowed_context = glutin::ContextBuilder::new()\\n .with_vsync(true)\\n .build_windowed(wb, &el)\\n .unwrap();\\n let windowed_context = windowed_context.make_current().unwrap();\\n let context = glow::Context::from_loader_function(|s| {\\n windowed_context.get_proc_address(s) as *const _\\n });\\n (context, el, windowed_context)\\n };\\n\\n let (program, vab) = unsafe {\\n let vertex_array = gl\\n .create_vertex_array()\\n .expect(\\\"Cannot create vertex array\\\");\\n gl.bind_vertex_array(Some(vertex_array));\\n\\n let program = create_program(&gl, VERTEX, FRAGMENT);\\n gl.use_program(Some(program));\\n\\n (program, vertex_array)\\n };\\n\\n event_loop.run(move |ev, _, flow| match ev {\\n Event::WindowEvent {\\n event: WindowEvent::CloseRequested, ..\\n } => {\\n unsafe {\\n gl.delete_program(program);\\n gl.delete_vertex_array(vab);\\n }\\n *flow = ControlFlow::Exit;\\n }\\n Event::WindowEvent {\\n event: WindowEvent::Resized(size), ..\\n } => {\\n unsafe {\\n gl.viewport(0, 0, size.width as i32, size.height as i32);\\n }\\n window.resize(size);\\n }\\n Event::RedrawRequested(_) => unsafe {\\n gl.clear_color(0.1, 0.2, 0.3, 1.0);\\n gl.clear(glow::COLOR_BUFFER_BIT);\\n gl.draw_arrays(glow::TRIANGLES, 0, 3);\\n window.swap_buffers().unwrap();\\n },\\n _ => {}\\n });\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import org.lwjgl.opengl.{ Display, DisplayMode }\\nimport org.lwjgl.opengl.GL11._\\n\\nobject OpenGlExample extends App {\\n\\n def render() {\\n\\n glClearColor(0.3f, 0.3f, 0.3f, 0.0f)\\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\\n\\n glShadeModel(GL_SMOOTH)\\n\\n glLoadIdentity()\\n glTranslatef(-15.0f, -15.0f, 0.0f)\\n\\n glBegin(GL_TRIANGLES)\\n glColor3f(1.0f, 0.0f, 0.0f)\\n glVertex2f(0.0f, 0.0f)\\n glColor3f(0.0f, 1.0f, 0.0f)\\n glVertex2f(30f, 0.0f)\\n glColor3f(0.0f, 0.0f, 1.0f)\\n glVertex2f(0.0f, 30.0f)\\n glEnd()\\n }\\n\\n Display.setDisplayMode(new DisplayMode(640, 480))\\n Display.create()\\n\\n glMatrixMode(GL_PROJECTION)\\n glLoadIdentity()\\n glOrtho(-30, 30, -30, 30, -30, 30)\\n glMatrixMode(GL_MODELVIEW)\\n\\n while (!Display.isCloseRequested()) {\\n render()\\n Display.update()\\n Thread.sleep(1000)\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"package require Tk\\npackage require tcl3d\\n\\nproc resizedWin {win w h} {\\n glViewport 0 0 $w $h\\n glMatrixMode GL_PROJECTION\\n glLoadIdentity\\n glOrtho -30.0 30.0 -30.0 30.0 -30.0 30.0\\n glMatrixMode GL_MODELVIEW\\n}\\nproc paintShape {win} {\\n glClearColor 0.0 0.0 0.0 0.5\\n glClear [expr {$::GL_COLOR_BUFFER_BIT+$::GL_DEPTH_BUFFER_BIT}]\\n glShadeModel GL_SMOOTH\\n glLoadIdentity\\n glTranslatef -15.0 -15.0 0.0\\n glBegin GL_TRIANGLES\\n glColor3f 1.0 0.0 0.0\\n glVertex2f 5.0 5.0\\n glColor3f 0.0 1.0 0.0\\n glVertex2f 25.0 5.0\\n glColor3f 0.0 0.0 1.0\\n glVertex2f 5.0 25.0\\n glEnd\\n $win swapbuffers\\n}\\n\\ntogl .surface -width 640 -height 480 -double true -depth true \\\\\\n -displayproc paintShape -reshapeproc resizedWin\\npack .surface -fill both -expand 1\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"/* OpenGL.wren */\\n\\nvar GL_COLOR_BUFFER_BIT = 0x4000\\nvar GL_DEPTH_BUFFER_BIT = 0x0100\\n\\nvar GL_SMOOTH = 0x1d01\\nvar GL_MODELVIEW = 0x1700\\nvar GL_PROJECTION = 0x1701\\n\\nvar GL_TRIANGLES = 0x0004\\n\\nvar GLUT_ACTION_ON_WINDOW_CLOSE = 0x01f9\\nvar GLUT_ACTION_GLUTMAINLOOP_RETURNS = 0x0001\\n\\nclass GL {\\n foreign static clearColor(red, green, blue, alpha)\\n\\n foreign static clear(mask)\\n\\n foreign static shadeModel(mode)\\n\\n foreign static loadIdentity()\\n\\n foreign static translatef(x, y, z)\\n\\n foreign static begin(mode)\\n\\n foreign static color3f(red, green, blue)\\n\\n foreign static vertex2f(x, y)\\n\\n foreign static end()\\n\\n foreign static flush()\\n\\n foreign static viewport(x, y, width, height)\\n\\n foreign static matrixMode(mode)\\n\\n foreign static ortho(left, right, bottom, top, nearVal, farVal)\\n}\\n\\nclass Glut {\\n foreign static initWindowSize(width, height)\\n\\n foreign static createWindow(name)\\n\\n foreign static displayFunc(clazz, signature)\\n\\n foreign static reshapeFunc(clazz, signature)\\n\\n foreign static setOption(eWhat, value)\\n}\\n\\nclass GLCallbacks {\\n static paint() {\\n GL.clearColor(0.3, 0.3, 0.3, 0)\\n GL.clear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT)\\n GL.shadeModel(GL_SMOOTH)\\n GL.loadIdentity()\\n GL.translatef(-15, -15, 0)\\n GL.begin(GL_TRIANGLES)\\n GL.color3f(1, 0, 0)\\n GL.vertex2f(0, 0)\\n GL.color3f(0, 1, 0)\\n GL.vertex2f(30, 0)\\n GL.color3f(0, 0, 1)\\n GL.vertex2f(0, 30)\\n GL.end()\\n GL.flush()\\n }\\n\\n static reshape(width, height) {\\n GL.viewport(0, 0, width, height)\\n GL.matrixMode(GL_PROJECTION)\\n GL.loadIdentity()\\n GL.ortho(-30, 30, -30, 30, -30, 30)\\n GL.matrixMode(GL_MODELVIEW)\\n }\\n}\\n\\nGlut.initWindowSize(640, 480)\\nGlut.createWindow(\\\"Triangle\\\")\\nGlut.displayFunc(\\\"GLCallbacks\\\", \\\"paint()\\\")\\nGlut.reshapeFunc(\\\"GLCallbacks\\\", \\\"reshape(_,_)\\\")\\nGlut.setOption(GLUT_ACTION_ON_WINDOW_CLOSE, GLUT_ACTION_GLUTMAINLOOP_RETURNS)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <stdio.h>\\n#include <string.h>\\n#include <GL/gl.h>\\n#include <GL/freeglut.h>\\n#include \\\"wren.h\\\"\\n\\n/* C <=> Wren interface functions */\\n\\nWrenVM *vm;\\n\\nconst char *displayClass, *displayMethod, *reshapeClass, *reshapeMethod;\\n\\nvoid display() {\\n wrenEnsureSlots(vm, 1);\\n wrenGetVariable(vm, \\\"main\\\", displayClass, 0);\\n WrenHandle *method = wrenMakeCallHandle(vm, displayMethod);\\n wrenCall(vm, method);\\n wrenReleaseHandle(vm, method);\\n}\\n\\nvoid reshape(int width, int height) {\\n wrenEnsureSlots(vm, 3);\\n wrenGetVariable(vm, \\\"main\\\", reshapeClass, 0);\\n WrenHandle *method = wrenMakeCallHandle(vm, reshapeMethod);\\n wrenSetSlotDouble(vm, 1, (double)width);\\n wrenSetSlotDouble(vm, 2, (double)height);\\n wrenCall(vm, method);\\n wrenReleaseHandle(vm, method);\\n}\\n\\nvoid C_clearColor(WrenVM* vm) {\\n GLclampf red = (GLclampf)wrenGetSlotDouble(vm, 1);\\n GLclampf green = (GLclampf)wrenGetSlotDouble(vm, 2);\\n GLclampf blue = (GLclampf)wrenGetSlotDouble(vm, 3);\\n GLclampf alpha = (GLclampf)wrenGetSlotDouble(vm, 4);\\n glClearColor(red, green, blue, alpha);\\n}\\n\\nvoid C_clear(WrenVM* vm) {\\n GLbitfield mask = (GLbitfield)wrenGetSlotDouble(vm, 1);\\n glClear(mask);\\n}\\n\\nvoid C_shadeModel(WrenVM* vm) {\\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\\n glShadeModel(mode);\\n}\\n\\nvoid C_loadIdentity(WrenVM* vm) {\\n glLoadIdentity();\\n}\\n\\nvoid C_translatef(WrenVM* vm) {\\n GLfloat x = (GLfloat)wrenGetSlotDouble(vm, 1);\\n GLfloat y = (GLfloat)wrenGetSlotDouble(vm, 2);\\n GLfloat z = (GLfloat)wrenGetSlotDouble(vm, 3);\\n glTranslatef(x, y, z);\\n}\\n\\nvoid C_begin(WrenVM* vm) {\\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\\n glBegin(mode);\\n}\\n\\nvoid C_color3f(WrenVM* vm) {\\n GLfloat red = (GLfloat)wrenGetSlotDouble(vm, 1);\\n GLfloat green = (GLfloat)wrenGetSlotDouble(vm, 2);\\n GLfloat blue = (GLfloat)wrenGetSlotDouble(vm, 3);\\n glColor3f(red, green, blue);\\n}\\n\\nvoid C_vertex2f(WrenVM* vm) {\\n GLfloat x = (GLfloat)wrenGetSlotDouble(vm, 1);\\n GLfloat y = (GLfloat)wrenGetSlotDouble(vm, 2);\\n glVertex2f(x, y);\\n}\\n\\nvoid C_end(WrenVM* vm) {\\n glEnd();\\n}\\n\\nvoid C_flush(WrenVM* vm) {\\n glFlush();\\n}\\n\\nvoid C_viewport(WrenVM* vm) {\\n GLint x = (GLint) wrenGetSlotDouble(vm, 1);\\n GLint y = (GLint) wrenGetSlotDouble(vm, 2);\\n GLsizei width = (GLsizei)wrenGetSlotDouble(vm, 3);\\n GLsizei height = (GLsizei)wrenGetSlotDouble(vm, 4);\\n glViewport(x, y, width, height);\\n}\\n\\nvoid C_matrixMode(WrenVM* vm) {\\n GLenum mode = (GLenum)wrenGetSlotDouble(vm, 1);\\n glMatrixMode(mode);\\n}\\n\\nvoid C_ortho(WrenVM* vm) {\\n GLdouble left = (GLdouble)wrenGetSlotDouble(vm, 1);\\n GLdouble right = (GLdouble)wrenGetSlotDouble(vm, 2);\\n GLdouble bottom = (GLdouble)wrenGetSlotDouble(vm, 3);\\n GLdouble top = (GLdouble)wrenGetSlotDouble(vm, 4);\\n GLdouble nearVal = (GLdouble)wrenGetSlotDouble(vm, 5);\\n GLdouble farVal = (GLdouble)wrenGetSlotDouble(vm, 6);\\n glOrtho(left, right, bottom, top, nearVal, farVal);\\n}\\n\\nvoid C_initWindowSize(WrenVM* vm) {\\n int width = (int)wrenGetSlotDouble(vm, 1);\\n int height = (int)wrenGetSlotDouble(vm, 2);\\n glutInitWindowSize(width, height);\\n}\\n\\nvoid C_createWindow(WrenVM* vm) {\\n const char *name = wrenGetSlotString(vm, 1);\\n glutCreateWindow(name);\\n}\\n\\nvoid C_displayFunc(WrenVM* vm) {\\n displayClass = wrenGetSlotString(vm, 1);\\n displayMethod = wrenGetSlotString(vm, 2);\\n glutDisplayFunc(&display);\\n}\\n\\nvoid C_reshapeFunc(WrenVM* vm) {\\n reshapeClass = wrenGetSlotString(vm, 1);\\n reshapeMethod = wrenGetSlotString(vm, 2);\\n glutReshapeFunc(&reshape);\\n}\\n\\nvoid C_setOption(WrenVM* vm) {\\n GLenum eWhat = (GLenum)wrenGetSlotDouble(vm, 1);\\n int value = (int)wrenGetSlotDouble(vm, 2);\\n glutSetOption(eWhat, value);\\n}\\n\\nWrenForeignMethodFn bindForeignMethod(\\n WrenVM* vm,\\n const char* module,\\n const char* className,\\n bool isStatic,\\n const char* signature) {\\n if (strcmp(module, \\\"main\\\") == 0) {\\n if (strcmp(className, \\\"GL\\\") == 0) {\\n if (isStatic && strcmp(signature, \\\"clearColor(_,_,_,_)\\\") == 0) return C_clearColor;\\n if (isStatic && strcmp(signature, \\\"clear(_)\\\") == 0) return C_clear;\\n if (isStatic && strcmp(signature, \\\"shadeModel(_)\\\") == 0) return C_shadeModel;\\n if (isStatic && strcmp(signature, \\\"loadIdentity()\\\") == 0) return C_loadIdentity;\\n if (isStatic && strcmp(signature, \\\"translatef(_,_,_)\\\") == 0) return C_translatef;\\n if (isStatic && strcmp(signature, \\\"begin(_)\\\") == 0) return C_begin;\\n if (isStatic && strcmp(signature, \\\"color3f(_,_,_)\\\") == 0) return C_color3f;\\n if (isStatic && strcmp(signature, \\\"vertex2f(_,_)\\\") == 0) return C_vertex2f;\\n if (isStatic && strcmp(signature, \\\"end()\\\") == 0) return C_end;\\n if (isStatic && strcmp(signature, \\\"flush()\\\") == 0) return C_flush;\\n if (isStatic && strcmp(signature, \\\"viewport(_,_,_,_)\\\") == 0) return C_viewport;\\n if (isStatic && strcmp(signature, \\\"matrixMode(_)\\\") == 0) return C_matrixMode;\\n if (isStatic && strcmp(signature, \\\"ortho(_,_,_,_,_,_)\\\") == 0) return C_ortho;\\n } else if (strcmp(className, \\\"Glut\\\") == 0) {\\n if (isStatic && strcmp(signature, \\\"initWindowSize(_,_)\\\") == 0) return C_initWindowSize;\\n if (isStatic && strcmp(signature, \\\"createWindow(_)\\\") == 0) return C_createWindow;\\n if (isStatic && strcmp(signature, \\\"displayFunc(_,_)\\\") == 0) return C_displayFunc;\\n if (isStatic && strcmp(signature, \\\"reshapeFunc(_,_)\\\") == 0) return C_reshapeFunc;\\n if (isStatic && strcmp(signature, \\\"setOption(_,_)\\\") == 0) return C_setOption;\\n }\\n }\\n return NULL;\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nint main(int argc, char **argv) {\\n glutInit(&argc, argv);\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.bindForeignMethodFn = &bindForeignMethod;\\n vm = wrenNewVM(&config);\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"OpenGL.wren\\\";\\n char *script = readFile(fileName);\\n WrenInterpretResult result = wrenInterpret(vm, module, script);\\n switch (result) {\\n case WREN_RESULT_COMPILE_ERROR:\\n printf(\\\"Compile Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_RUNTIME_ERROR:\\n printf(\\\"Runtime Error!\\\\n\\\");\\n break;\\n case WREN_RESULT_SUCCESS:\\n break;\\n }\\n glutMainLoop();\\n wrenFreeVM(vm);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"OpenGL"}}},{"rowIdx":1465,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/OpenWebNet_password\n","language":"00-META"},{"code":"Calculate the password requested by ethernet gateways from the Legrand / Bticino MyHome OpenWebNet home automation system when the user's ip address is not in the gateway's whitelist\n\n'''Note:''' Factory default password is '12345'. Changing it is highly recommended !\n\nconversation goes as follows\n\n<pre>← *#*1##\n→ *99*0##\n← *#603356072##</pre>\n\nat which point a password should be sent back, calculated from the \"password open\" that is set in the gateway, and the nonce that was just sent\n\n<pre>→ *#25280520##\n← *#*1##</pre>\n\n","language":"00-TASK"},{"code":"F ownCalcPass(password, nonce)\n UInt32 result\n V start = 1B\n L(c) nonce\n I c != ‘0’ & start\n result = UInt32(Int(password))\n start = 0B\n S c\n ‘0’\n {}\n ‘1’\n result = rotr(result, 7)\n ‘2’\n result = rotr(result, 4)\n ‘3’\n result = rotr(result, 3)\n ‘4’\n result = rotl(result, 1)\n ‘5’\n result = rotl(result, 5)\n ‘6’\n result = rotl(result, 12)\n ‘7’\n result = (result [&] 0000'FF00) [|] result << 24 [|]\n (result [&] 00FF'0000) >> 16 [|] (result [&] FF00'0000) >> 8\n ‘8’\n result = result << 16 [|] result >> 24 [|] (result [&] 00FF'0000) >> 8\n ‘9’\n result = ~result\n E\n X.throw ValueError(‘non-digit in nonce.’)\n R result\n\nF test_passwd_calc(passwd, nonce, expected)\n V res = ownCalcPass(passwd, nonce)\n V m = passwd‘ ’nonce‘ ’res‘ ’expected\n I res == expected\n print(‘PASS ’m)\n E\n print(‘FAIL ’m)\n\ntest_passwd_calc(‘12345’, ‘603356072’, 25280520)\ntest_passwd_calc(‘12345’, ‘410501656’, 119537670)\ntest_passwd_calc(‘12345’, ‘630292165’, 4269684735)\n","language":"11l"},{"code":"#include <cstdint>\n#include <iostream>\n#include <string>\n\nint64_t own_password_calculation(const int64_t& password, const std::string& nonce) {\n\tconst int64_t m1 = 0xFFFF'FFFF;\n\tconst int64_t m8 = 0xFFFF'FFF8;\n\tconst int64_t m16 = 0xFFFF'FFF0;\n\tconst int64_t m128 = 0xFFFF'FF80;\n\tconst int64_t m16777216 = 0xFF00'0000;\n\n\tbool flag = true;\n\tint64_t number1 = 0;\n\tint64_t number2 = 0;\n\n\tfor ( char ch : nonce ) {\n\t\tnumber2 = number2 & m1;\n\n\t\tswitch (ch) {\n\t\t\tcase '1':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 & m128;\n\t\t\t\tnumber1 = number1 >> 7;\n\t\t\t\tnumber2 = number2 << 25;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '2':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 & m16;\n\t\t\t\tnumber1 = number1 >> 4;\n\t\t\t\tnumber2 = number2 << 28;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '3':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 & m8;\n\t\t\t\tnumber1 = number1 >> 3;\n\t\t\t\tnumber2 = number2 << 29;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '4':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 << 1;\n\t\t\t\tnumber2 = number2 >> 31;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '5':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 << 5;\n\t\t\t\tnumber2 = number2 >> 27;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '6':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 << 12;\n\t\t\t\tnumber2 = number2 >> 20;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '7':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 & 0xFF00L;\n\t\t\t\tnumber1 = number1 + ( ( number2 & 0xFFL ) << 24 );\n\t\t\t\tnumber1 = number1 + ( ( number2 & 0xFF0000L ) >> 16 );\n\t\t\t\tnumber2 = ( number2 & m16777216 ) >> 8;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '8':\n\t\t\t\tif ( flag ) { number2 = password;}\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = number2 & 0xFFFFL;\n\t\t\t\tnumber1 = number1 << 16;\n\t\t\t\tnumber1 = number1 + ( number2 >> 24 );\n\t\t\t\tnumber2 = number2 & 0xFF0000L;\n\t\t\t\tnumber2 = number2 >> 8;\n\t\t\t\tnumber1 = number1 + number2;\n\t\t\t\tbreak;\n\n\t\t\tcase '9':\n\t\t\t\tif ( flag ) { number2 = password; }\n\t\t\t\tflag = false;\n\t\t\t\tnumber1 = ~number2;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tnumber1 = number2;\n\t\t\t\tbreak;\n\t\t}\n\t\tnumber2 = number1;\n\t}\n\n\treturn number1 & m1;\n}\n\nvoid own_password_calculation_test(const std::string& password, const std::string& nonce, const int64_t& expected) {\n\tconst int64_t result = own_password_calculation(std::stoll(password), nonce);\n\tstd::string message = password + \" \" + nonce + \" \" + std::to_string(result) + \" \" + std::to_string(expected);\n\tstd::cout << ( ( result == expected ) ? \"PASS \" + message : \"FAIL \" + message ) << std::endl;\n}\n\nint main() {\n\town_password_calculation_test(\"12345\", \"603356072\", 25280520);\n\town_password_calculation_test(\"12345\", \"410501656\", 119537670);\n}\n","language":"C++"},{"code":"import std.stdio, std.string, std.conv, std.ascii, std.algorithm;\n\nulong ownCalcPass(in ulong password, in string nonce)\npure nothrow @safe @nogc\nin {\n assert(nonce.representation.all!isDigit);\n} body {\n enum ulong m_1 = 0x_FFFF_FFFF_UL;\n enum ulong m_8 = 0x_FFFF_FFF8_UL;\n enum ulong m_16 = 0x_FFFF_FFF0_UL;\n enum ulong m_128 = 0x_FFFF_FF80_UL;\n enum ulong m_16777216 = 0X_FF00_0000_UL;\n\n auto flag = true;\n ulong num1 = 0, num2 = 0;\n\n foreach (immutable char c; nonce) {\n num1 &= m_1;\n num2 &= m_1;\n\n switch (c) {\n case '0':\n num1 = num2;\n break;\n case '1':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 & m_128;\n num1 = num1 >> 7;\n num2 = num2 << 25;\n num1 = num1 + num2;\n break;\n case '2':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 & m_16;\n num1 = num1 >> 4;\n num2 = num2 << 28;\n num1 = num1 + num2;\n break;\n case '3':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 & m_8;\n num1 = num1 >> 3;\n num2 = num2 << 29;\n num1 = num1 + num2;\n break;\n case '4':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 << 1;\n num2 = num2 >> 31;\n num1 = num1 + num2;\n break;\n case '5':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 << 5;\n num2 = num2 >> 27;\n num1 = num1 + num2;\n break;\n case '6':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 << 12;\n num2 = num2 >> 20;\n num1 = num1 + num2;\n break;\n case '7':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 & 0xFF00UL;\n num1 = num1 + ((num2 & 0xFFUL) << 24);\n num1 = num1 + ((num2 & 0xFF0000UL) >> 16);\n num2 = (num2 & m_16777216) >> 8;\n num1 = num1 + num2;\n break;\n case '8':\n if (flag)\n num2 = password;\n flag = false;\n num1 = num2 & 0xFFFFUL;\n num1 = num1 << 16;\n num1 = num1 + (num2 >> 24);\n num2 = num2 & 0xFF0000UL;\n num2 = num2 >> 8;\n num1 = num1 + num2;\n break;\n case '9':\n if (flag)\n num2 = password;\n flag = false;\n num1 = ~num2;\n break;\n default: // Impossible if contracts are active.\n assert(0, \"Non-digit in nonce\");\n }\n\n num2 = num1;\n }\n\n return num1 & m_1;\n}\n\nvoid ownTestCalcPass(in string sPassword, in string nonce, in ulong expected)\nin {\n assert(sPassword.representation.all!isDigit);\n assert(nonce.representation.all!isDigit);\n} body {\n immutable password = sPassword.to!ulong;\n immutable res = ownCalcPass(password, nonce);\n immutable m = format(\"%d %s %d %d\", password, nonce, res, expected);\n writeln((res == expected) ? \"PASS \" : \"FAIL \", m);\n}\n\nvoid main() {\n ownTestCalcPass(\"12345\", \"603356072\", 25280520UL);\n ownTestCalcPass(\"12345\", \"410501656\", 119537670UL);\n}\n","language":"D"},{"code":"program OpenWebNet_password;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\nfunction ownCalcPass(password, nonce: string): Cardinal;\nbegin\n var start := True;\n var num1 := 0;\n var num2 := num1;\n var i := password.ToInteger();\n var pwd := i;\n\n for var c in nonce do\n begin\n if c <> '0' then\n begin\n if start then\n num2 := pwd;\n start := False;\n end;\n\n case c of\n '1':\n begin\n num1 := (num2 and $FFFFFF80) shr 7;\n num2 := num2 shl 25;\n end;\n '2':\n begin\n num1 := (num2 and $FFFFFFF0) shr 4;\n num2 := num2 shl 28;\n end;\n '3':\n begin\n num1 := (num2 and $FFFFFFF8) shr 3;\n num2 := num2 shl 29;\n end;\n '4':\n begin\n num1 := num2 shl 1;\n num2 := num2 shr 31;\n end;\n '5':\n begin\n num1 := num2 shl 5;\n num2 := num2 shr 27;\n end;\n '6':\n begin\n num1 := num2 shl 12;\n num2 := num2 shr 20;\n end;\n '7':\n begin\n var num3 := num2 and $0000FF00;\n var num4 := ((num2 and $000000FF) shl 24) or ((num2 and $00FF0000) shr 16);\n num1 := num3 or num4;\n num2 := (num2 and $FF000000) shr 8;\n end;\n '8':\n begin\n ;\n num1 := (num2 and $0000FFFF) shl 16 or (num2 shr 24);\n num2 := (num2 and $00FF0000) shr 8;\n end;\n '9':\n begin\n num1 := not num2;\n end;\n else\n num1 := num2;\n end;\n\n num1 := num1 and $FFFFFFFF;\n num2 := num2 and $FFFFFFFF;\n if (c <> '0') and (c <> '9') then\n num1 := num1 or num2;\n num2 := num1;\n end;\n Result := num1;\nend;\n\nfunction TestPasswordCalc(Password, nonce: string; expected: Cardinal): Integer;\nbegin\n var res := ownCalcPass(Password, nonce);\n var m := format('%s %s %-10u %-10u', [Password, nonce, res, expected]);\n if res = expected then\n writeln('PASS ' + m)\n else\n writeln('FAIL ' + m);\nend;\n\nbegin\n testPasswordCalc('12345', '603356072', 25280520);\n testPasswordCalc('12345', '410501656', 119537670);\n testPasswordCalc('12345', '630292165', 4269684735);\n readln;\nend.\n","language":"Delphi"},{"code":"func calcpass passw$ nonce$ .\n start = 1\n passw = number passw$\n for c$ in strchars nonce$\n if c$ <> \"0\"\n if start = 1\n num2 = passw\n .\n start = 0\n .\n if c$ = \"1\"\n num1 = bitshift bitand num2 0xFFFFFF80 -7\n num2 = bitshift num2 25\n elif c$ = \"2\"\n num1 = bitshift bitand num2 0xFFFFFFF0 -4\n num2 = bitshift num2 28\n elif c$ = \"3\"\n num1 = bitshift bitand num2 0xFFFFFFF8 -3\n num2 = bitshift num2 29\n elif c$ = \"4\"\n num1 = bitshift num2 1\n num2 = bitshift num2 -31\n elif c$ = \"5\"\n num1 = bitshift num2 5\n num2 = bitshift num2 -27\n elif c$ = \"6\"\n num1 = bitshift num2 12\n num2 = bitshift num2 -20\n elif c$ = \"7\"\n h1 = bitand num2 0x0000FF00\n h2 = bitshift bitand num2 0x000000FF 24\n h3 = bitshift bitand num2 0x00FF0000 -16\n num1 = bitor bitor h1 h2 h3\n num2 = bitshift bitand num2 0xFF000000 -8\n elif c$ = \"8\"\n num1 = bitor bitshift bitand num2 0x0000FFFF 16 bitshift num2 -24\n num2 = bitshift bitand num2 0x00FF0000 -8\n elif c$ = \"9\"\n num1 = bitnot num2\n else\n num1 = num2\n .\n if c$ <> \"0\" and c$ <> \"9\"\n num1 = bitor num1 num2\n .\n num2 = num1\n .\n return num1\n.\nproc test_passwd passwd$ nonce$ expected$ . .\n res = calcpass passwd$ nonce$\n m$ = passwd$ & \" \" & nonce$ & \" \" & res & \" \" & expected$\n if res = number expected$\n print \"PASS \" & m$\n else\n print \"FAIL \" & m$\n .\n.\ntest_passwd \"12345\" \"603356072\" \"25280520\"\ntest_passwd \"12345\" \"410501656\" \"119537670\"\ntest_passwd \"12345\" \"630292165\" \"4269684735\"\n","language":"EasyLang"},{"code":"Function ownCalcPass(password As String, nonce As String) As Integer\n Dim As Boolean start = True\n Dim As Integer b, num1 = 0, num2 = 0\n\n For b = 0 To Len(nonce)\n Dim As String c = Mid(nonce,b,1)\n If c <> \"0\" And start Then\n num2 = Cint(password)\n start = False\n End If\n\n Select Case c\n Case \"1\"\n num1 = (num2 And &HFFFFFF80) Shr 7\n num2 = num2 Shl 25\n Case \"2\"\n num1 = (num2 And &HFFFFFFF0) Shr 4\n num2 = num2 Shl 28\n Case \"3\"\n num1 = (num2 And &HFFFFFFF8) Shr 3\n num2 = num2 Shl 29\n Case \"4\"\n num1 = num2 Shl 1\n num2 = num2 Shr 31\n Case \"5\"\n num1 = num2 Shl 5\n num2 = num2 Shr 27\n Case \"6\"\n num1 = num2 Shl 12\n num2 = num2 Shr 20\n Case \"7\"\n num1 = num2 And &H0000FF00 Or ((num2 And &H000000FF) Shl 24) Or ((num2 And &H00FF0000) Shr 16)\n num2 = (num2 And &HFF000000) Shr 8\n Case \"8\"\n num1 = (num2 And &H0000FFFF) Shl 16 Or (num2 Shr 24)\n num2 = (num2 And &H00FF0000) Shr 8\n Case \"9\"\n num1 = Not num2\n Case Else\n num1 = num2\n End Select\n\n num1 And= &HFFFFFFFF\n num2 And= &HFFFFFFFF\n If c <> \"0\" And c <> \"9\" Then num1 Or= num2\n num2 = num1\n Next b\n Return num1\nEnd Function\n\nSub testPasswordCalc(password As String, nonce As String, expected As Integer)\n Dim As Integer res = ownCalcPass(password, nonce)\n Print Iif(res = expected, \"PASS \", \"FAIL \");\n Print Using \"& & & ##########\"; password; nonce; res; expected\nEnd Sub\n\ntestPasswordCalc(\"12345\", \"603356072\", 25280520)\ntestPasswordCalc(\"12345\", \"410501656\", 119537670)\ntestPasswordCalc(\"12345\", \"630292165\", 4269684735)\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strconv\"\n)\n\nfunc ownCalcPass(password, nonce string) uint32 {\n start := true\n num1 := uint32(0)\n num2 := num1\n i, _ := strconv.Atoi(password)\n pwd := uint32(i)\n for _, c := range nonce {\n if c != '0' {\n if start {\n num2 = pwd\n }\n start = false\n }\n switch c {\n case '1':\n num1 = (num2 & 0xFFFFFF80) >> 7\n num2 = num2 << 25\n case '2':\n num1 = (num2 & 0xFFFFFFF0) >> 4\n num2 = num2 << 28\n case '3':\n num1 = (num2 & 0xFFFFFFF8) >> 3\n num2 = num2 << 29\n case '4':\n num1 = num2 << 1\n num2 = num2 >> 31\n case '5':\n num1 = num2 << 5\n num2 = num2 >> 27\n case '6':\n num1 = num2 << 12\n num2 = num2 >> 20\n case '7':\n num3 := num2 & 0x0000FF00\n num4 := ((num2 & 0x000000FF) << 24) | ((num2 & 0x00FF0000) >> 16)\n num1 = num3 | num4\n num2 = (num2 & 0xFF000000) >> 8\n case '8':\n num1 = (num2&0x0000FFFF)<<16 | (num2 >> 24)\n num2 = (num2 & 0x00FF0000) >> 8\n case '9':\n num1 = ^num2\n default:\n num1 = num2\n }\n\n num1 &= 0xFFFFFFFF\n num2 &= 0xFFFFFFFF\n if c != '0' && c != '9' {\n num1 |= num2\n }\n num2 = num1\n }\n return num1\n}\n\nfunc testPasswordCalc(password, nonce string, expected uint32) {\n res := ownCalcPass(password, nonce)\n m := fmt.Sprintf(\"%s %s %-10d %-10d\", password, nonce, res, expected)\n if res == expected {\n fmt.Println(\"PASS\", m)\n } else {\n fmt.Println(\"FAIL\", m)\n }\n}\n\nfunc main() {\n testPasswordCalc(\"12345\", \"603356072\", 25280520)\n testPasswordCalc(\"12345\", \"410501656\", 119537670)\n testPasswordCalc(\"12345\", \"630292165\", 4269684735)\n}\n","language":"Go"},{"code":"\tpublic static void main(String[] aArgs) {\n\t\townPasswordCalculationTest(\"12345\", \"603356072\", 25280520);\n\t ownPasswordCalculationTest(\"12345\", \"410501656\", 119537670);\n\t}\n\t\n\tprivate static void ownPasswordCalculationTest(String password, String nonce, long expected) {\n\t final long result = ownPasswordCalculation(Long.valueOf(password), nonce);\n\t String message = password + \" \" + nonce + \" \" + result + \" \" + expected;\n\t System.out.println( ( result == expected ) ? \"PASS \" + message : \"FAIL \" + message );\n\t}\n\t\n\tprivate static long ownPasswordCalculation(long password, String nonce) {\n\t final long m1 = 0xFFFF_FFFFL;\n\t final long m8 = 0xFFFF_FFF8L;\n\t final long m16 = 0xFFFF_FFF0L;\n\t final long m128 = 0xFFFF_FF80L;\n\t final long m16777216 = 0xFF00_0000L;\n\n\t boolean flag = true;\n\t long number1 = 0;\n\t long number2 = 0;\n\n\t for ( char ch : nonce.toCharArray() ) {\n\t number2 = number2 & m1;\n\n\t switch (ch) {\n\t\t case '1' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 & m128;\n\t number1 = number1 >>> 7;\n\t number2 = number2 << 25;\n\t number1 = number1 + number2;\n\t\t }\n\t\n\t\t case '2' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 & m16;\n\t number1 = number1 >>> 4;\n\t number2 = number2 << 28;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '3' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 & m8;\n\t number1 = number1 >>> 3;\n\t number2 = number2 << 29;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '4' -> {\n\t\t \tif ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 << 1;\n\t number2 = number2 >>> 31;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '5' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 << 5;\n\t number2 = number2 >>> 27;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '6' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 << 12;\n\t number2 = number2 >>> 20;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '7' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = number2 & 0xFF00L;\n\t number1 = number1 + ( ( number2 & 0xFFL ) << 24 );\n\t number1 = number1 + ( ( number2 & 0xFF0000L ) >>> 16 );\n\t number2 = ( number2 & m16777216 ) >>> 8;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '8' -> {\n\t\t if ( flag ) { number2 = password;}\n\t flag = false;\n\t number1 = number2 & 0xFFFFL;\n\t number1 = number1 << 16;\n\t number1 = number1 + ( number2 >>> 24 );\n\t number2 = number2 & 0xFF0000L;\n\t number2 = number2 >>> 8;\n\t number1 = number1 + number2;\n\t }\n\t\n\t\t case '9' -> {\n\t\t if ( flag ) { number2 = password; }\n\t flag = false;\n\t number1 = ~number2;\n\t }\n\t\t\n\t\t default -> number1 = number2;\n\t }\n\t number2 = number1;\n\t }\n\t\n\t return number1 & m1;\n\t}\n\n}\n","language":"Java"},{"code":"function calcPass (pass, nonce) {\n\tvar flag = true;\n\tvar num1 = 0x0;\n\tvar num2 = 0x0;\n\tvar password = parseInt(pass, 10);\n\t\n\tfor (var c in nonce) {\n\t\tc = nonce[c];\n\t\tif (c!='0') {\n\t\t\tif (flag) num2 = password;\n\t\t\tflag = false;\n\t\t}\n\t\tswitch (c) {\n\t\t\tcase '1':\n\t\t\t\tnum1 = num2 & 0xFFFFFF80;\n\t\t\t\tnum1 = num1 >>> 7;\n\t\t\t\tnum2 = num2 << 25;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '2':\n\t\t\t\tnum1 = num2 & 0xFFFFFFF0;\n\t\t\t\tnum1 = num1 >>> 4;\n\t\t\t\tnum2 = num2 << 28;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '3':\n\t\t\t\tnum1 = num2 & 0xFFFFFFF8;\n\t\t\t\tnum1 = num1 >>> 3;\n\t\t\t\tnum2 = num2 << 29;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '4':\n\t\t\t\tnum1 = num2 << 1;\n\t\t\t\tnum2 = num2 >>> 31;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '5':\n\t\t\t\tnum1 = num2 << 5;\n\t\t\t\tnum2 = num2 >>> 27;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '6':\n\t\t\t\tnum1 = num2 << 12;\n\t\t\t\tnum2 = num2 >>> 20;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '7':\n\t\t\t\tnum1 = num2 & 0x0000FF00;\n\t\t\t\tnum1 = num1 + (( num2 & 0x000000FF ) << 24 );\n\t\t\t\tnum1 = num1 + (( num2 & 0x00FF0000 ) >>> 16 );\n\t\t\t\tnum2 = ( num2 & 0xFF000000 ) >>> 8;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '8':\n\t\t\t\tnum1 = num2 & 0x0000FFFF;\n\t\t\t\tnum1 = num1 << 16;\n\t\t\t\tnum1 = num1 + ( num2 >>> 24 );\n\t\t\t\tnum2 = num2 & 0x00FF0000;\n\t\t\t\tnum2 = num2 >>> 8;\n\t\t\t\tnum1 = num1 + num2;\n\t\t\t\tbreak;\n\t\t\tcase '9':\n\t\t\t\tnum1 = ~num2;\n\t\t\t\tbreak;\n\t\t\tcase '0':\n\t\t\t\tnum1 = num2;\n\t\t\t\tbreak;\n\t\t}\n\t\tnum2 = num1;\n\t}\n\treturn (num1 >>> 0).toString();\n}\n\nexports.calcPass = calcPass;\n\nconsole.log ('openpass initialization');\nfunction testCalcPass (pass, nonce, expected) {\n\tvar res = calcPass (pass, nonce);\n\tvar m = pass + ' ' + nonce + ' ' + res + ' ' + expected;\n\tif (res == parseInt(expected, 10))\n\t\tconsole.log ('PASS '+m);\n\telse\n\t\tconsole.log ('FAIL '+m);\n}\n\ntestCalcPass ('12345', '603356072', '25280520');\ntestCalcPass ('12345', '410501656', '119537670');\ntestCalcPass ('12345', '630292165', '4269684735');\ntestCalcPass ('12345', '523781130', '537331200');\n","language":"JavaScript"},{"code":"function calcpass(passwd, nonce::String)\n startflag = true\n n1 = 0\n n2 = 0\n password = parse(Int, passwd)\n dact = Dict(\n '1' => () -> begin n1 = (n2 & 0xffffff80) >> 7; n2 <<= 25 end,\n '2' => () -> begin n1 = (n2 & 0xfffffff0) >> 4; n2 <<= 28 end,\n '3' => () -> begin n1 = (n2 & 0xfffffff8) >> 3; n2 <<= 29 end,\n '4' => () -> begin n1 = n2 << 1; n2 >>= 31 end,\n '5' => () -> begin n1 = n2 << 5; n2 >>= 27 end,\n '6' => () -> begin n1 = n2 << 12; n2 >>= 20 end,\n '7' => () -> begin n1 = (n2 & 0x0000ff00) | ((n2 & 0x000000ff) << 24) |\n ((n2 & 0x00ff0000) >> 16); n2 = (n2 & 0xff000000) >> 8 end,\n '8' => () -> begin n1 = ((n2 & 0x0000ffff) << 16) | (n2 >> 24);\n n2 = (n2 & 0x00ff0000) >> 8 end,\n '9' => () -> begin n1 = ~n2 end)\n\n for c in nonce\n if !haskey(dact, c)\n n1 = n2\n else\n if startflag\n n2 = password\n end\n startflag = false\n dact[c]()\n n1 &= 0xffffffff\n n2 &= 0xffffffff\n if c != '9'\n n1 |= n2\n end\n end\n n2 = n1\n end\n n1\nend\n\nfunction testcalcpass()\n tdata = [[\"12345\", \"603356072\", \"25280520\"], [\"12345\", \"410501656\", \"119537670\"],\n [\"12345\", \"630292165\", \"4269684735\"], [\"12345\", \"523781130\", \"537331200\"]]\n\tfor td in tdata\n pf = calcpass(td[1], td[2]) == parse(Int, td[3]) ? \"Passes test.\" : \"Fails test.\"\n println(\"Calculating pass for [$(td[1]), $(td[2])] = $(td[3]): $pf\")\n end\nend\n\ntestcalcpass()\n","language":"Julia"},{"code":"// version 1.1.51\n\nfun ownCalcPass(password: Long, nonce: String): Long {\n val m1 = 0xFFFF_FFFFL\n val m8 = 0xFFFF_FFF8L\n val m16 = 0xFFFF_FFF0L\n val m128 = 0xFFFF_FF80L\n val m16777216 = 0xFF00_0000L\n\n var flag = true\n var num1 = 0L\n var num2 = 0L\n\n for (c in nonce) {\n num2 = num2 and m1\n\n when (c) {\n '1' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 and m128\n num1 = num1 ushr 7\n num2 = num2 shl 25\n num1 = num1 + num2\n }\n\n '2' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 and m16\n num1 = num1 ushr 4\n num2 = num2 shl 28\n num1 = num1 + num2\n }\n\n '3' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 and m8\n num1 = num1 ushr 3\n num2 = num2 shl 29\n num1 = num1 + num2\n }\n\n '4' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 shl 1\n num2 = num2 ushr 31\n num1 = num1 + num2\n }\n\n '5' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 shl 5\n num2 = num2 ushr 27\n num1 = num1 + num2\n }\n\n '6' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 shl 12\n num2 = num2 ushr 20\n num1 = num1 + num2\n }\n\n '7' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 and 0xFF00L\n num1 = num1 + ((num2 and 0xFFL) shl 24)\n num1 = num1 + ((num2 and 0xFF0000L) ushr 16)\n num2 = (num2 and m16777216) ushr 8\n num1 = num1 + num2\n }\n\n '8' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2 and 0xFFFFL\n num1 = num1 shl 16\n num1 = num1 + (num2 ushr 24)\n num2 = num2 and 0xFF0000L\n num2 = num2 ushr 8\n num1 = num1 + num2\n }\n\n '9' -> {\n if (flag) num2 = password\n flag = false\n num1 = num2.inv()\n }\n\n else -> num1 = num2\n }\n num2 = num1\n }\n return num1 and m1\n}\n\nfun ownTestCalcPass(passwd: String, nonce: String, expected: Long) {\n val res = ownCalcPass(passwd.toLong(), nonce)\n val m = \"$passwd $nonce $res $expected\"\n println(if (res == expected) \"PASS $m\" else \"FAIL $m\")\n}\n\nfun main(args: Array<String>) {\n ownTestCalcPass(\"12345\", \"603356072\", 25280520)\n ownTestCalcPass(\"12345\", \"410501656\", 119537670)\n}\n","language":"Kotlin"},{"code":"import bitops, strutils\n\nfunc ownCalcPass(password, nonce: string): uint32 =\n\n var start = true\n\n for c in nonce:\n if c != '0' and start:\n result = parseInt(password).uint32\n start = false\n case c\n of '0':\n discard\n of '1':\n result = result.rotateRightBits(7)\n of '2':\n result = result.rotateRightBits(4)\n of '3':\n result = result.rotateRightBits(3)\n of '4':\n result = result.rotateLeftBits(1)\n of '5':\n result = result.rotateLeftBits(5)\n of '6':\n result = result.rotateLeftBits(12)\n of '7':\n result = (result and 0x0000FF00) or result shl 24 or\n (result and 0x00FF0000) shr 16 or (result and 0xFF000000u32) shr 8\n of '8':\n result = result shl 16 or result shr 24 or (result and 0x00FF0000) shr 8\n of '9':\n result = not result\n else:\n raise newException(ValueError, \"non-digit in nonce.\")\n\n\nwhen isMainModule:\n\n proc testPasswordCalc(password, nonce: string; expected: uint32) =\n\n let res = ownCalcPass(password, nonce)\n let m = \"$# $# $# $#\".format(password, nonce, res, expected)\n echo if res == expected: \"PASS \" else: \"FAIL \", m\n\n testPasswordCalc(\"12345\", \"603356072\", 25280520u32)\n testPasswordCalc(\"12345\", \"410501656\", 119537670u32)\n testPasswordCalc(\"12345\", \"630292165\", 4269684735u32)\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse integer; # required solely for 2's complement operation: $n1 = ~$n2\n\nsub own_password {\n my($password, $nonce) = @_;\n my $n1 = 0;\n my $n2 = $password;\n for my $d (split //, $nonce) {\n if ($d == 1) {\n $n1 = ($n2 & 0xFFFFFF80) >> 7;\n $n2 <<= 25;\n } elsif ($d == 2) {\n $n1 = ($n2 & 0xFFFFFFF0) >> 4;\n $n2 <<= 28;\n } elsif ($d == 3) {\n $n1 = ($n2 & 0xFFFFFFF8) >> 3;\n $n2 <<= 29;\n } elsif ($d == 4) {\n $n1 = $n2 << 1;\n $n2 >>= 31;\n } elsif ($d == 5) {\n $n1 = $n2 << 5;\n $n2 >>= 27;\n } elsif ($d == 6) {\n $n1 = $n2 << 12;\n $n2 >>= 20;\n } elsif ($d == 7) {\n $n1 = ($n2 & 0x0000FF00) | (($n2 & 0x000000FF) << 24) | (($n2 & 0x00FF0000) >> 16);\n $n2 = ($n2 & 0xFF000000) >> 8;\n } elsif ($d == 8) {\n $n1 = ($n2 & 0x0000FFFF) << 16 | $n2 >> 24;\n $n2 = ($n2 & 0x00FF0000) >> 8;\n } elsif ($d == 9) {\n $n1 = ~$n2;\n } else {\n $n1 = $n2\n }\n $n1 = ($n1 | $n2) & 0xFFFFFFFF if $d != 0 and $d != 9;\n $n2 = $n1;\n }\n $n1\n}\n\nsay own_password( 12345, 603356072 );\nsay own_password( 12345, 410501656 );\nsay own_password( 12345, 630292165 );\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ownCalcPass</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pwd</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">start</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pwd</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'1'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'2'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">28</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'3'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">29</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'4'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">31</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'5'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">27</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'6'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">12</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'7'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0x0000FF00</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0x000000FF</span><span style=\"color: #0000FF;\">),-</span><span style=\"color: #000000;\">24</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0x00FF0000</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0xFF000000</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'8'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0x0000FFFF</span><span style=\"color: #0000FF;\">),-</span><span style=\"color: #000000;\">16</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">24</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shift_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0x00FF0000</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">'9'</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">not_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">default</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">num2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">'0'</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">'9'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">or_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">num1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">num2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">num2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">num1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">num1</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">num1</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">#1_0000_0000</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">num1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">testPasswordCalc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pwd</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">ownCalcPass</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pwd</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">pf</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"PASS\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"FAIL\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s %d %s %-10d %-10d\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pf</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pwd</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nonce</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">testPasswordCalc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12345</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"603356072\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">25280520</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">testPasswordCalc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12345</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"410501656\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">119537670</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">testPasswordCalc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12345</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"630292165\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4269684735</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">testPasswordCalc</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">12345</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"523781130\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">537331200</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"function ownCalcPass($password, $nonce) {\n $msr = 0x7FFFFFFF;\n $m_1 = (int)0xFFFFFFFF;\n $m_8 = (int)0xFFFFFFF8;\n $m_16 = (int)0xFFFFFFF0;\n $m_128 = (int)0xFFFFFF80;\n $m_16777216 = (int)0xFF000000;\n $flag = True;\n $num1 = 0;\n $num2 = 0;\n\n foreach (str_split($nonce) as $c) {\n $num1 = $num1 & $m_1;\n $num2 = $num2 & $m_1;\n if ($c == '1') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 & $m_128;\n $num1 = $num1 >> 1;\n $num1 = $num1 & $msr;\n $num1 = $num1 >> 6;\n $num2 = $num2 << 25;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '2') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 & $m_16;\n $num1 = $num1 >> 1;\n $num1 = $num1 & $msr;\n $num1 = $num1 >> 3;\n $num2 = $num2 << 28;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '3') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 & $m_8;\n $num1 = $num1 >> 1;\n $num1 = $num1 & $msr;\n $num1 = $num1 >> 2;\n $num2 = $num2 << 29;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '4') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 << 1;\n $num2 = $num2 >> 1;\n $num2 = $num2 & $msr;\n $num2 = $num2 >> 30;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '5') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 << 5;\n $num2 = $num2 >> 1;\n $num2 = $num2 & $msr;\n $num2 = $num2 >> 26;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '6') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 << 12;\n $num2 = $num2 >> 1;\n $num2 = $num2 & $msr;\n $num2 = $num2 >> 19;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '7') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 & 0xFF00;\n $num1 = $num1 + (( $num2 & 0xFF ) << 24 );\n $num1 = $num1 + (( $num2 & 0xFF0000 ) >> 16 );\n $num2 = $num2 & $m_16777216;\n $num2 = $num2 >> 1;\n $num2 = $num2 & $msr;\n $num2 = $num2 >> 7;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '8') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = $num2 & 0xFFFF;\n $num1 = $num1 << 16;\n $numx = $num2 >> 1;\n $numx = $numx & $msr;\n $numx = $numx >> 23;\n $num1 = $num1 + $numx;\n $num2 = $num2 & 0xFF0000;\n $num2 = $num2 >> 1;\n $num2 = $num2 & $msr;\n $num2 = $num2 >> 7;\n $num1 = $num1 + $num2;\n $flag = False;\n } elseif ($c == '9') {\n $length = !$flag;\n if (!$length) {\n $num2 = $password;\n }\n $num1 = ~(int)$num2;\n $flag = False;\n } else {\n $num1 = $num2;\n }\n $num2 = $num1;\n }\n return sprintf('%u', $num1 & $m_1);\n}\n","language":"PHP"},{"code":"def ownCalcPass (password, nonce, test=False) :\n start = True\n num1 = 0\n num2 = 0\n password = int(password)\n if test:\n print(\"password: %08x\" % (password))\n for c in nonce :\n if c != \"0\":\n if start:\n num2 = password\n start = False\n if test:\n print(\"c: %s num1: %08x num2: %08x\" % (c, num1, num2))\n if c == '1':\n num1 = (num2 & 0xFFFFFF80) >> 7\n num2 = num2 << 25\n elif c == '2':\n num1 = (num2 & 0xFFFFFFF0) >> 4\n num2 = num2 << 28\n elif c == '3':\n num1 = (num2 & 0xFFFFFFF8) >> 3\n num2 = num2 << 29\n elif c == '4':\n num1 = num2 << 1\n num2 = num2 >> 31\n elif c == '5':\n num1 = num2 << 5\n num2 = num2 >> 27\n elif c == '6':\n num1 = num2 << 12\n num2 = num2 >> 20\n elif c == '7':\n num1 = num2 & 0x0000FF00 | (( num2 & 0x000000FF ) << 24 ) | (( num2 & 0x00FF0000 ) >> 16 )\n num2 = ( num2 & 0xFF000000 ) >> 8\n elif c == '8':\n num1 = (num2 & 0x0000FFFF) << 16 | ( num2 >> 24 )\n num2 = (num2 & 0x00FF0000) >> 8\n elif c == '9':\n num1 = ~num2\n else :\n num1 = num2\n\n num1 &= 0xFFFFFFFF\n num2 &= 0xFFFFFFFF\n if (c not in \"09\"):\n num1 |= num2\n if test:\n print(\" num1: %08x num2: %08x\" % (num1, num2))\n num2 = num1\n return num1\n\ndef test_passwd_calc(passwd, nonce, expected):\n res = ownCalcPass(passwd, nonce, False)\n m = passwd+' '+nonce+' '+str(res)+' '+str(expected)\n if res == int(expected) :\n print('PASS '+m)\n else :\n print('FAIL '+m)\n\nif __name__ == '__main__':\n test_passwd_calc('12345','603356072','25280520')\n test_passwd_calc('12345','410501656','119537670')\n test_passwd_calc('12345','630292165','4269684735')\n","language":"Python"},{"code":"#lang racket/base\n(define (32-bit-truncate n)\n (bitwise-and n #xFFFFFFFF))\n\n(define (own-calc-pass password-string nonce)\n (define-values (num-1 flag)\n (for/fold ((num-1 0) (flag #t))\n ((c (in-string nonce)))\n (let* ((num-1 (32-bit-truncate num-1))\n (num-2 (if flag (string->number password-string) num-1)))\n\n (define (and-right-left-add mask right left)\n (values (+ (arithmetic-shift (bitwise-and num-2 mask) (- right))\n (arithmetic-shift num-2 left))\n #f))\n\n (define (left-right-add left right)\n (values (+ (arithmetic-shift num-2 left) (arithmetic-shift num-2 (- right))) #f))\n\n (define (stage-7)\n (values (+ (+ (+ (bitwise-and num-2 #xff00)\n (arithmetic-shift (bitwise-and num-2 #xff) 24))\n (arithmetic-shift (bitwise-and num-2 #xff0000) -16))\n (arithmetic-shift (bitwise-and num-2 #xFF000000) -8))\n #f))\n\n (define (stage-8)\n (values (+ (+ (arithmetic-shift (bitwise-and num-2 #xffff) 16)\n (arithmetic-shift num-2 -24))\n (arithmetic-shift (bitwise-and num-2 #xff0000) -8))\n #f))\n\n (define (stage-9) (values (bitwise-not num-2) #f))\n\n (case c\n ([#\\1] (and-right-left-add #xFFFFFF80 7 25))\n ([#\\2] (and-right-left-add #xFFFFFFF0 4 28))\n ([#\\3] (and-right-left-add #xFFFFFFF8 3 29))\n ([#\\4] (left-right-add 1 31))\n ([#\\5] (left-right-add 5 27))\n ([#\\6] (left-right-add 12 20))\n ([#\\7] (stage-7))\n ([#\\8] (stage-8))\n ([#\\9] (stage-9))\n (else (values num-1 flag))))))\n (32-bit-truncate num-1))\n\n(module+ test\n (require rackunit)\n\n (define (own-test-calc-pass passwd nonce expected)\n (let* ((res (own-calc-pass passwd nonce))\n (msg (format \"~a ~a ~a ~a\" passwd nonce res expected)))\n (string-append (if (= res expected) \"PASS\" \"FAIL\") \" \" msg)))\n\n\n (own-test-calc-pass \"12345\" \"603356072\" 25280520)\n (own-test-calc-pass \"12345\" \"410501656\" 119537670))\n","language":"Racket"},{"code":"sub own-password (Int $password, Int $nonce) {\n my int $n1 = 0;\n my int $n2 = $password;\n for $nonce.comb {\n given $_ {\n when 1 {\n $n1 = $n2 +& 0xFFFFFF80 +> 7;\n $n2 +<= 25;\n }\n when 2 {\n $n1 = $n2 +& 0xFFFFFFF0 +> 4;\n $n2 +<= 28;\n }\n when 3 {\n $n1 = $n2 +& 0xFFFFFFF8 +> 3;\n $n2 +<= 29;\n }\n when 4 {\n $n1 = $n2 +< 1;\n $n2 +>= 31;\n }\n when 5 {\n $n1 = $n2 +< 5;\n $n2 +>= 27;\n }\n when 6 {\n $n1 = $n2 +< 12;\n $n2 +>= 20;\n }\n when 7 {\n $n1 = $n2 +& 0x0000FF00 +| ($n2 +& 0x000000FF +< 24) +| ($n2 +& 0x00FF0000 +> 16);\n $n2 = $n2 +& 0xFF000000 +> 8;\n }\n when 8 {\n $n1 = $n2 +& 0x0000FFFF +< 16 +| $n2 +> 24;\n $n2 = $n2 +& 0x00FF0000 +> 8;\n }\n when 9 { $n1 = +^$n2 }\n default { $n1 = $n2 }\n }\n given $_ {\n when 0 {}\n when 9 {}\n default { $n1 = ($n1 +| $n2) +& 0xFFFFFFFF }\n }\n $n2 = $n1;\n }\n $n1\n}\n\nsay own-password( 12345, 603356072 );\nsay own-password( 12345, 410501656 );\nsay own-password( 12345, 630292165 );\n","language":"Raku"},{"code":"func openAuthenticationResponse(_password: String, operations: String) -> String? {\n var num1 = UInt32(0)\n var num2 = UInt32(0)\n var start = true\n let password = UInt32(_password)!\n for c in operations {\n if (c != \"0\") {\n if start {\n num2 = password\n }\n start = false\n }\n switch c {\n case \"1\":\n num1 = (num2 & 0xffffff80) >> 7\n num2 = num2 << 25\n case \"2\":\n num1 = (num2 & 0xfffffff0) >> 4\n num2 = num2 << 28\n case \"3\":\n num1 = (num2 & 0xfffffff8) >> 3\n num2 = num2 << 29\n case \"4\":\n num1 = num2 << 1\n num2 = num2 >> 31\n case \"5\":\n num1 = num1 << 5\n num2 = num2 >> 27\n case \"6\":\n num1 = num2 << 12\n num2 = num2 >> 20\n case \"7\":\n num1 = (num2 & 0x0000ff00) | ((num2 & 0x000000ff) << 24) | ((num2 & 0x00ff0000) >> 16)\n num2 = (num2 & 0xff000000) >> 8\n case \"8\":\n num1 = ((num2 & 0x0000ffff) << 16) | (num2 >> 24)\n num2 = (num2 & 0x00ff0000) >> 8\n case \"9\":\n num1 = ~num2\n case \"0\":\n num1 = num2\n default:\n print(\"unexpected char \\(c)\")\n return nil\n }\n if (c != \"9\") && (c != \"0\") {\n num1 |= num2\n }\n num2 = num1\n }\n return String(num1)\n}\n","language":"Swift"},{"code":"import \"./fmt\" for Fmt\n\nvar ownCalcPass = Fn.new { |password, nonce|\n var start = true\n var num1 = 0\n var num2 = 0\n var pwd = Num.fromString(password)\n for (c in nonce) {\n if (c != \"0\") {\n if (start) num2 = pwd\n start = false\n }\n if (c == \"1\") {\n num1 = (num2 & 0xFFFFFF80) >> 7\n num2 = num2 << 25\n } else if (c == \"2\") {\n num1 = (num2 & 0xFFFFFFF0) >> 4\n num2 = num2 << 28\n } else if (c == \"3\") {\n num1 = (num2 & 0xFFFFFFF8) >> 3\n num2 = num2 << 29\n } else if (c == \"4\") {\n num1 = num2 << 1\n num2 = num2 >> 31\n } else if (c == \"5\") {\n num1 = num2 << 5\n num2 = num2 >> 27\n } else if (c == \"6\") {\n num1 = num2 << 12\n num2 = num2 >> 20\n } else if (c == \"7\") {\n var num3 = num2 & 0x0000FF00\n var num4 = ((num2 & 0x000000FF) << 24) | ((num2 & 0x00FF0000) >> 16)\n num1 = num3 | num4\n num2 = (num2 & 0xFF000000) >> 8\n } else if (c == \"8\") {\n num1 = (num2&0x0000FFFF)<<16 | (num2 >> 24)\n num2 = (num2 & 0x00FF0000) >> 8\n } else if (c == \"9\") {\n num1 = ~num2\n } else {\n num1 = num2\n }\n num1 = num1 & 0xFFFFFFFF\n num2 = num2 & 0xFFFFFFFF\n if (c != \"0\" && c != \"9\") num1 = num1 | num2\n num2 = num1\n }\n return num1\n}\n\nvar testPasswordCalc = Fn.new { |password, nonce, expected|\n var res = ownCalcPass.call(password, nonce)\n var m = Fmt.swrite(\"$s $s $-10d $-10d\", password, nonce, res, expected)\n if (res == expected) {\n System.print(\"PASS %(m)\")\n } else {\n System.print(\"FAIL %(m)\")\n }\n}\n\ntestPasswordCalc.call(\"12345\", \"603356072\", 25280520)\ntestPasswordCalc.call(\"12345\", \"410501656\", 119537670)\ntestPasswordCalc.call(\"12345\", \"630292165\", 4269684735)\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/OpenWebNet_password\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Calculate the password requested by ethernet gateways from the Legrand / Bticino MyHome OpenWebNet home automation system when the user's ip address is not in the gateway's whitelist\\n\\n'''Note:''' Factory default password is '12345'. Changing it is highly recommended !\\n\\nconversation goes as follows\\n\\n<pre>← *#*1##\\n→ *99*0##\\n← *#603356072##</pre>\\n\\nat which point a password should be sent back, calculated from the \\\"password open\\\" that is set in the gateway, and the nonce that was just sent\\n\\n<pre>→ *#25280520##\\n← *#*1##</pre>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F ownCalcPass(password, nonce)\\n UInt32 result\\n V start = 1B\\n L(c) nonce\\n I c != ‘0’ & start\\n result = UInt32(Int(password))\\n start = 0B\\n S c\\n ‘0’\\n {}\\n ‘1’\\n result = rotr(result, 7)\\n ‘2’\\n result = rotr(result, 4)\\n ‘3’\\n result = rotr(result, 3)\\n ‘4’\\n result = rotl(result, 1)\\n ‘5’\\n result = rotl(result, 5)\\n ‘6’\\n result = rotl(result, 12)\\n ‘7’\\n result = (result [&] 0000'FF00) [|] result << 24 [|]\\n (result [&] 00FF'0000) >> 16 [|] (result [&] FF00'0000) >> 8\\n ‘8’\\n result = result << 16 [|] result >> 24 [|] (result [&] 00FF'0000) >> 8\\n ‘9’\\n result = ~result\\n E\\n X.throw ValueError(‘non-digit in nonce.’)\\n R result\\n\\nF test_passwd_calc(passwd, nonce, expected)\\n V res = ownCalcPass(passwd, nonce)\\n V m = passwd‘ ’nonce‘ ’res‘ ’expected\\n I res == expected\\n print(‘PASS ’m)\\n E\\n print(‘FAIL ’m)\\n\\ntest_passwd_calc(‘12345’, ‘603356072’, 25280520)\\ntest_passwd_calc(‘12345’, ‘410501656’, 119537670)\\ntest_passwd_calc(‘12345’, ‘630292165’, 4269684735)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <string>\\n\\nint64_t own_password_calculation(const int64_t& password, const std::string& nonce) {\\n\\tconst int64_t m1 = 0xFFFF'FFFF;\\n\\tconst int64_t m8 = 0xFFFF'FFF8;\\n\\tconst int64_t m16 = 0xFFFF'FFF0;\\n\\tconst int64_t m128 = 0xFFFF'FF80;\\n\\tconst int64_t m16777216 = 0xFF00'0000;\\n\\n\\tbool flag = true;\\n\\tint64_t number1 = 0;\\n\\tint64_t number2 = 0;\\n\\n\\tfor ( char ch : nonce ) {\\n\\t\\tnumber2 = number2 & m1;\\n\\n\\t\\tswitch (ch) {\\n\\t\\t\\tcase '1':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 & m128;\\n\\t\\t\\t\\tnumber1 = number1 >> 7;\\n\\t\\t\\t\\tnumber2 = number2 << 25;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '2':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 & m16;\\n\\t\\t\\t\\tnumber1 = number1 >> 4;\\n\\t\\t\\t\\tnumber2 = number2 << 28;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '3':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 & m8;\\n\\t\\t\\t\\tnumber1 = number1 >> 3;\\n\\t\\t\\t\\tnumber2 = number2 << 29;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '4':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 << 1;\\n\\t\\t\\t\\tnumber2 = number2 >> 31;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '5':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 << 5;\\n\\t\\t\\t\\tnumber2 = number2 >> 27;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '6':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 << 12;\\n\\t\\t\\t\\tnumber2 = number2 >> 20;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '7':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 & 0xFF00L;\\n\\t\\t\\t\\tnumber1 = number1 + ( ( number2 & 0xFFL ) << 24 );\\n\\t\\t\\t\\tnumber1 = number1 + ( ( number2 & 0xFF0000L ) >> 16 );\\n\\t\\t\\t\\tnumber2 = ( number2 & m16777216 ) >> 8;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '8':\\n\\t\\t\\t\\tif ( flag ) { number2 = password;}\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = number2 & 0xFFFFL;\\n\\t\\t\\t\\tnumber1 = number1 << 16;\\n\\t\\t\\t\\tnumber1 = number1 + ( number2 >> 24 );\\n\\t\\t\\t\\tnumber2 = number2 & 0xFF0000L;\\n\\t\\t\\t\\tnumber2 = number2 >> 8;\\n\\t\\t\\t\\tnumber1 = number1 + number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tcase '9':\\n\\t\\t\\t\\tif ( flag ) { number2 = password; }\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tnumber1 = ~number2;\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tnumber1 = number2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tnumber2 = number1;\\n\\t}\\n\\n\\treturn number1 & m1;\\n}\\n\\nvoid own_password_calculation_test(const std::string& password, const std::string& nonce, const int64_t& expected) {\\n\\tconst int64_t result = own_password_calculation(std::stoll(password), nonce);\\n\\tstd::string message = password + \\\" \\\" + nonce + \\\" \\\" + std::to_string(result) + \\\" \\\" + std::to_string(expected);\\n\\tstd::cout << ( ( result == expected ) ? \\\"PASS \\\" + message : \\\"FAIL \\\" + message ) << std::endl;\\n}\\n\\nint main() {\\n\\town_password_calculation_test(\\\"12345\\\", \\\"603356072\\\", 25280520);\\n\\town_password_calculation_test(\\\"12345\\\", \\\"410501656\\\", 119537670);\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.conv, std.ascii, std.algorithm;\\n\\nulong ownCalcPass(in ulong password, in string nonce)\\npure nothrow @safe @nogc\\nin {\\n assert(nonce.representation.all!isDigit);\\n} body {\\n enum ulong m_1 = 0x_FFFF_FFFF_UL;\\n enum ulong m_8 = 0x_FFFF_FFF8_UL;\\n enum ulong m_16 = 0x_FFFF_FFF0_UL;\\n enum ulong m_128 = 0x_FFFF_FF80_UL;\\n enum ulong m_16777216 = 0X_FF00_0000_UL;\\n\\n auto flag = true;\\n ulong num1 = 0, num2 = 0;\\n\\n foreach (immutable char c; nonce) {\\n num1 &= m_1;\\n num2 &= m_1;\\n\\n switch (c) {\\n case '0':\\n num1 = num2;\\n break;\\n case '1':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 & m_128;\\n num1 = num1 >> 7;\\n num2 = num2 << 25;\\n num1 = num1 + num2;\\n break;\\n case '2':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 & m_16;\\n num1 = num1 >> 4;\\n num2 = num2 << 28;\\n num1 = num1 + num2;\\n break;\\n case '3':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 & m_8;\\n num1 = num1 >> 3;\\n num2 = num2 << 29;\\n num1 = num1 + num2;\\n break;\\n case '4':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 << 1;\\n num2 = num2 >> 31;\\n num1 = num1 + num2;\\n break;\\n case '5':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 << 5;\\n num2 = num2 >> 27;\\n num1 = num1 + num2;\\n break;\\n case '6':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 << 12;\\n num2 = num2 >> 20;\\n num1 = num1 + num2;\\n break;\\n case '7':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 & 0xFF00UL;\\n num1 = num1 + ((num2 & 0xFFUL) << 24);\\n num1 = num1 + ((num2 & 0xFF0000UL) >> 16);\\n num2 = (num2 & m_16777216) >> 8;\\n num1 = num1 + num2;\\n break;\\n case '8':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = num2 & 0xFFFFUL;\\n num1 = num1 << 16;\\n num1 = num1 + (num2 >> 24);\\n num2 = num2 & 0xFF0000UL;\\n num2 = num2 >> 8;\\n num1 = num1 + num2;\\n break;\\n case '9':\\n if (flag)\\n num2 = password;\\n flag = false;\\n num1 = ~num2;\\n break;\\n default: // Impossible if contracts are active.\\n assert(0, \\\"Non-digit in nonce\\\");\\n }\\n\\n num2 = num1;\\n }\\n\\n return num1 & m_1;\\n}\\n\\nvoid ownTestCalcPass(in string sPassword, in string nonce, in ulong expected)\\nin {\\n assert(sPassword.representation.all!isDigit);\\n assert(nonce.representation.all!isDigit);\\n} body {\\n immutable password = sPassword.to!ulong;\\n immutable res = ownCalcPass(password, nonce);\\n immutable m = format(\\\"%d %s %d %d\\\", password, nonce, res, expected);\\n writeln((res == expected) ? \\\"PASS \\\" : \\\"FAIL \\\", m);\\n}\\n\\nvoid main() {\\n ownTestCalcPass(\\\"12345\\\", \\\"603356072\\\", 25280520UL);\\n ownTestCalcPass(\\\"12345\\\", \\\"410501656\\\", 119537670UL);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program OpenWebNet_password;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\nfunction ownCalcPass(password, nonce: string): Cardinal;\\nbegin\\n var start := True;\\n var num1 := 0;\\n var num2 := num1;\\n var i := password.ToInteger();\\n var pwd := i;\\n\\n for var c in nonce do\\n begin\\n if c <> '0' then\\n begin\\n if start then\\n num2 := pwd;\\n start := False;\\n end;\\n\\n case c of\\n '1':\\n begin\\n num1 := (num2 and $FFFFFF80) shr 7;\\n num2 := num2 shl 25;\\n end;\\n '2':\\n begin\\n num1 := (num2 and $FFFFFFF0) shr 4;\\n num2 := num2 shl 28;\\n end;\\n '3':\\n begin\\n num1 := (num2 and $FFFFFFF8) shr 3;\\n num2 := num2 shl 29;\\n end;\\n '4':\\n begin\\n num1 := num2 shl 1;\\n num2 := num2 shr 31;\\n end;\\n '5':\\n begin\\n num1 := num2 shl 5;\\n num2 := num2 shr 27;\\n end;\\n '6':\\n begin\\n num1 := num2 shl 12;\\n num2 := num2 shr 20;\\n end;\\n '7':\\n begin\\n var num3 := num2 and $0000FF00;\\n var num4 := ((num2 and $000000FF) shl 24) or ((num2 and $00FF0000) shr 16);\\n num1 := num3 or num4;\\n num2 := (num2 and $FF000000) shr 8;\\n end;\\n '8':\\n begin\\n ;\\n num1 := (num2 and $0000FFFF) shl 16 or (num2 shr 24);\\n num2 := (num2 and $00FF0000) shr 8;\\n end;\\n '9':\\n begin\\n num1 := not num2;\\n end;\\n else\\n num1 := num2;\\n end;\\n\\n num1 := num1 and $FFFFFFFF;\\n num2 := num2 and $FFFFFFFF;\\n if (c <> '0') and (c <> '9') then\\n num1 := num1 or num2;\\n num2 := num1;\\n end;\\n Result := num1;\\nend;\\n\\nfunction TestPasswordCalc(Password, nonce: string; expected: Cardinal): Integer;\\nbegin\\n var res := ownCalcPass(Password, nonce);\\n var m := format('%s %s %-10u %-10u', [Password, nonce, res, expected]);\\n if res = expected then\\n writeln('PASS ' + m)\\n else\\n writeln('FAIL ' + m);\\nend;\\n\\nbegin\\n testPasswordCalc('12345', '603356072', 25280520);\\n testPasswordCalc('12345', '410501656', 119537670);\\n testPasswordCalc('12345', '630292165', 4269684735);\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func calcpass passw$ nonce$ .\\n start = 1\\n passw = number passw$\\n for c$ in strchars nonce$\\n if c$ <> \\\"0\\\"\\n if start = 1\\n num2 = passw\\n .\\n start = 0\\n .\\n if c$ = \\\"1\\\"\\n num1 = bitshift bitand num2 0xFFFFFF80 -7\\n num2 = bitshift num2 25\\n elif c$ = \\\"2\\\"\\n num1 = bitshift bitand num2 0xFFFFFFF0 -4\\n num2 = bitshift num2 28\\n elif c$ = \\\"3\\\"\\n num1 = bitshift bitand num2 0xFFFFFFF8 -3\\n num2 = bitshift num2 29\\n elif c$ = \\\"4\\\"\\n num1 = bitshift num2 1\\n num2 = bitshift num2 -31\\n elif c$ = \\\"5\\\"\\n num1 = bitshift num2 5\\n num2 = bitshift num2 -27\\n elif c$ = \\\"6\\\"\\n num1 = bitshift num2 12\\n num2 = bitshift num2 -20\\n elif c$ = \\\"7\\\"\\n h1 = bitand num2 0x0000FF00\\n h2 = bitshift bitand num2 0x000000FF 24\\n h3 = bitshift bitand num2 0x00FF0000 -16\\n num1 = bitor bitor h1 h2 h3\\n num2 = bitshift bitand num2 0xFF000000 -8\\n elif c$ = \\\"8\\\"\\n num1 = bitor bitshift bitand num2 0x0000FFFF 16 bitshift num2 -24\\n num2 = bitshift bitand num2 0x00FF0000 -8\\n elif c$ = \\\"9\\\"\\n num1 = bitnot num2\\n else\\n num1 = num2\\n .\\n if c$ <> \\\"0\\\" and c$ <> \\\"9\\\"\\n num1 = bitor num1 num2\\n .\\n num2 = num1\\n .\\n return num1\\n.\\nproc test_passwd passwd$ nonce$ expected$ . .\\n res = calcpass passwd$ nonce$\\n m$ = passwd$ & \\\" \\\" & nonce$ & \\\" \\\" & res & \\\" \\\" & expected$\\n if res = number expected$\\n print \\\"PASS \\\" & m$\\n else\\n print \\\"FAIL \\\" & m$\\n .\\n.\\ntest_passwd \\\"12345\\\" \\\"603356072\\\" \\\"25280520\\\"\\ntest_passwd \\\"12345\\\" \\\"410501656\\\" \\\"119537670\\\"\\ntest_passwd \\\"12345\\\" \\\"630292165\\\" \\\"4269684735\\\"\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"Function ownCalcPass(password As String, nonce As String) As Integer\\n Dim As Boolean start = True\\n Dim As Integer b, num1 = 0, num2 = 0\\n\\n For b = 0 To Len(nonce)\\n Dim As String c = Mid(nonce,b,1)\\n If c <> \\\"0\\\" And start Then\\n num2 = Cint(password)\\n start = False\\n End If\\n\\n Select Case c\\n Case \\\"1\\\"\\n num1 = (num2 And &HFFFFFF80) Shr 7\\n num2 = num2 Shl 25\\n Case \\\"2\\\"\\n num1 = (num2 And &HFFFFFFF0) Shr 4\\n num2 = num2 Shl 28\\n Case \\\"3\\\"\\n num1 = (num2 And &HFFFFFFF8) Shr 3\\n num2 = num2 Shl 29\\n Case \\\"4\\\"\\n num1 = num2 Shl 1\\n num2 = num2 Shr 31\\n Case \\\"5\\\"\\n num1 = num2 Shl 5\\n num2 = num2 Shr 27\\n Case \\\"6\\\"\\n num1 = num2 Shl 12\\n num2 = num2 Shr 20\\n Case \\\"7\\\"\\n num1 = num2 And &H0000FF00 Or ((num2 And &H000000FF) Shl 24) Or ((num2 And &H00FF0000) Shr 16)\\n num2 = (num2 And &HFF000000) Shr 8\\n Case \\\"8\\\"\\n num1 = (num2 And &H0000FFFF) Shl 16 Or (num2 Shr 24)\\n num2 = (num2 And &H00FF0000) Shr 8\\n Case \\\"9\\\"\\n num1 = Not num2\\n Case Else\\n num1 = num2\\n End Select\\n\\n num1 And= &HFFFFFFFF\\n num2 And= &HFFFFFFFF\\n If c <> \\\"0\\\" And c <> \\\"9\\\" Then num1 Or= num2\\n num2 = num1\\n Next b\\n Return num1\\nEnd Function\\n\\nSub testPasswordCalc(password As String, nonce As String, expected As Integer)\\n Dim As Integer res = ownCalcPass(password, nonce)\\n Print Iif(res = expected, \\\"PASS \\\", \\\"FAIL \\\");\\n Print Using \\\"& & & ##########\\\"; password; nonce; res; expected\\nEnd Sub\\n\\ntestPasswordCalc(\\\"12345\\\", \\\"603356072\\\", 25280520)\\ntestPasswordCalc(\\\"12345\\\", \\\"410501656\\\", 119537670)\\ntestPasswordCalc(\\\"12345\\\", \\\"630292165\\\", 4269684735)\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n)\\n\\nfunc ownCalcPass(password, nonce string) uint32 {\\n start := true\\n num1 := uint32(0)\\n num2 := num1\\n i, _ := strconv.Atoi(password)\\n pwd := uint32(i)\\n for _, c := range nonce {\\n if c != '0' {\\n if start {\\n num2 = pwd\\n }\\n start = false\\n }\\n switch c {\\n case '1':\\n num1 = (num2 & 0xFFFFFF80) >> 7\\n num2 = num2 << 25\\n case '2':\\n num1 = (num2 & 0xFFFFFFF0) >> 4\\n num2 = num2 << 28\\n case '3':\\n num1 = (num2 & 0xFFFFFFF8) >> 3\\n num2 = num2 << 29\\n case '4':\\n num1 = num2 << 1\\n num2 = num2 >> 31\\n case '5':\\n num1 = num2 << 5\\n num2 = num2 >> 27\\n case '6':\\n num1 = num2 << 12\\n num2 = num2 >> 20\\n case '7':\\n num3 := num2 & 0x0000FF00\\n num4 := ((num2 & 0x000000FF) << 24) | ((num2 & 0x00FF0000) >> 16)\\n num1 = num3 | num4\\n num2 = (num2 & 0xFF000000) >> 8\\n case '8':\\n num1 = (num2&0x0000FFFF)<<16 | (num2 >> 24)\\n num2 = (num2 & 0x00FF0000) >> 8\\n case '9':\\n num1 = ^num2\\n default:\\n num1 = num2\\n }\\n\\n num1 &= 0xFFFFFFFF\\n num2 &= 0xFFFFFFFF\\n if c != '0' && c != '9' {\\n num1 |= num2\\n }\\n num2 = num1\\n }\\n return num1\\n}\\n\\nfunc testPasswordCalc(password, nonce string, expected uint32) {\\n res := ownCalcPass(password, nonce)\\n m := fmt.Sprintf(\\\"%s %s %-10d %-10d\\\", password, nonce, res, expected)\\n if res == expected {\\n fmt.Println(\\\"PASS\\\", m)\\n } else {\\n fmt.Println(\\\"FAIL\\\", m)\\n }\\n}\\n\\nfunc main() {\\n testPasswordCalc(\\\"12345\\\", \\\"603356072\\\", 25280520)\\n testPasswordCalc(\\\"12345\\\", \\\"410501656\\\", 119537670)\\n testPasswordCalc(\\\"12345\\\", \\\"630292165\\\", 4269684735)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"\\tpublic static void main(String[] aArgs) {\\n\\t\\townPasswordCalculationTest(\\\"12345\\\", \\\"603356072\\\", 25280520);\\n\\t ownPasswordCalculationTest(\\\"12345\\\", \\\"410501656\\\", 119537670);\\n\\t}\\n\\t\\n\\tprivate static void ownPasswordCalculationTest(String password, String nonce, long expected) {\\n\\t final long result = ownPasswordCalculation(Long.valueOf(password), nonce);\\n\\t String message = password + \\\" \\\" + nonce + \\\" \\\" + result + \\\" \\\" + expected;\\n\\t System.out.println( ( result == expected ) ? \\\"PASS \\\" + message : \\\"FAIL \\\" + message );\\n\\t}\\n\\t\\n\\tprivate static long ownPasswordCalculation(long password, String nonce) {\\n\\t final long m1 = 0xFFFF_FFFFL;\\n\\t final long m8 = 0xFFFF_FFF8L;\\n\\t final long m16 = 0xFFFF_FFF0L;\\n\\t final long m128 = 0xFFFF_FF80L;\\n\\t final long m16777216 = 0xFF00_0000L;\\n\\n\\t boolean flag = true;\\n\\t long number1 = 0;\\n\\t long number2 = 0;\\n\\n\\t for ( char ch : nonce.toCharArray() ) {\\n\\t number2 = number2 & m1;\\n\\n\\t switch (ch) {\\n\\t\\t case '1' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 & m128;\\n\\t number1 = number1 >>> 7;\\n\\t number2 = number2 << 25;\\n\\t number1 = number1 + number2;\\n\\t\\t }\\n\\t\\n\\t\\t case '2' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 & m16;\\n\\t number1 = number1 >>> 4;\\n\\t number2 = number2 << 28;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '3' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 & m8;\\n\\t number1 = number1 >>> 3;\\n\\t number2 = number2 << 29;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '4' -> {\\n\\t\\t \\tif ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 << 1;\\n\\t number2 = number2 >>> 31;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '5' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 << 5;\\n\\t number2 = number2 >>> 27;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '6' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 << 12;\\n\\t number2 = number2 >>> 20;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '7' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = number2 & 0xFF00L;\\n\\t number1 = number1 + ( ( number2 & 0xFFL ) << 24 );\\n\\t number1 = number1 + ( ( number2 & 0xFF0000L ) >>> 16 );\\n\\t number2 = ( number2 & m16777216 ) >>> 8;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '8' -> {\\n\\t\\t if ( flag ) { number2 = password;}\\n\\t flag = false;\\n\\t number1 = number2 & 0xFFFFL;\\n\\t number1 = number1 << 16;\\n\\t number1 = number1 + ( number2 >>> 24 );\\n\\t number2 = number2 & 0xFF0000L;\\n\\t number2 = number2 >>> 8;\\n\\t number1 = number1 + number2;\\n\\t }\\n\\t\\n\\t\\t case '9' -> {\\n\\t\\t if ( flag ) { number2 = password; }\\n\\t flag = false;\\n\\t number1 = ~number2;\\n\\t }\\n\\t\\t\\n\\t\\t default -> number1 = number2;\\n\\t }\\n\\t number2 = number1;\\n\\t }\\n\\t\\n\\t return number1 & m1;\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function calcPass (pass, nonce) {\\n\\tvar flag = true;\\n\\tvar num1 = 0x0;\\n\\tvar num2 = 0x0;\\n\\tvar password = parseInt(pass, 10);\\n\\t\\n\\tfor (var c in nonce) {\\n\\t\\tc = nonce[c];\\n\\t\\tif (c!='0') {\\n\\t\\t\\tif (flag) num2 = password;\\n\\t\\t\\tflag = false;\\n\\t\\t}\\n\\t\\tswitch (c) {\\n\\t\\t\\tcase '1':\\n\\t\\t\\t\\tnum1 = num2 & 0xFFFFFF80;\\n\\t\\t\\t\\tnum1 = num1 >>> 7;\\n\\t\\t\\t\\tnum2 = num2 << 25;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '2':\\n\\t\\t\\t\\tnum1 = num2 & 0xFFFFFFF0;\\n\\t\\t\\t\\tnum1 = num1 >>> 4;\\n\\t\\t\\t\\tnum2 = num2 << 28;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '3':\\n\\t\\t\\t\\tnum1 = num2 & 0xFFFFFFF8;\\n\\t\\t\\t\\tnum1 = num1 >>> 3;\\n\\t\\t\\t\\tnum2 = num2 << 29;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '4':\\n\\t\\t\\t\\tnum1 = num2 << 1;\\n\\t\\t\\t\\tnum2 = num2 >>> 31;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '5':\\n\\t\\t\\t\\tnum1 = num2 << 5;\\n\\t\\t\\t\\tnum2 = num2 >>> 27;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '6':\\n\\t\\t\\t\\tnum1 = num2 << 12;\\n\\t\\t\\t\\tnum2 = num2 >>> 20;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '7':\\n\\t\\t\\t\\tnum1 = num2 & 0x0000FF00;\\n\\t\\t\\t\\tnum1 = num1 + (( num2 & 0x000000FF ) << 24 );\\n\\t\\t\\t\\tnum1 = num1 + (( num2 & 0x00FF0000 ) >>> 16 );\\n\\t\\t\\t\\tnum2 = ( num2 & 0xFF000000 ) >>> 8;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '8':\\n\\t\\t\\t\\tnum1 = num2 & 0x0000FFFF;\\n\\t\\t\\t\\tnum1 = num1 << 16;\\n\\t\\t\\t\\tnum1 = num1 + ( num2 >>> 24 );\\n\\t\\t\\t\\tnum2 = num2 & 0x00FF0000;\\n\\t\\t\\t\\tnum2 = num2 >>> 8;\\n\\t\\t\\t\\tnum1 = num1 + num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '9':\\n\\t\\t\\t\\tnum1 = ~num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '0':\\n\\t\\t\\t\\tnum1 = num2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tnum2 = num1;\\n\\t}\\n\\treturn (num1 >>> 0).toString();\\n}\\n\\nexports.calcPass = calcPass;\\n\\nconsole.log ('openpass initialization');\\nfunction testCalcPass (pass, nonce, expected) {\\n\\tvar res = calcPass (pass, nonce);\\n\\tvar m = pass + ' ' + nonce + ' ' + res + ' ' + expected;\\n\\tif (res == parseInt(expected, 10))\\n\\t\\tconsole.log ('PASS '+m);\\n\\telse\\n\\t\\tconsole.log ('FAIL '+m);\\n}\\n\\ntestCalcPass ('12345', '603356072', '25280520');\\ntestCalcPass ('12345', '410501656', '119537670');\\ntestCalcPass ('12345', '630292165', '4269684735');\\ntestCalcPass ('12345', '523781130', '537331200');\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function calcpass(passwd, nonce::String)\\n startflag = true\\n n1 = 0\\n n2 = 0\\n password = parse(Int, passwd)\\n dact = Dict(\\n '1' => () -> begin n1 = (n2 & 0xffffff80) >> 7; n2 <<= 25 end,\\n '2' => () -> begin n1 = (n2 & 0xfffffff0) >> 4; n2 <<= 28 end,\\n '3' => () -> begin n1 = (n2 & 0xfffffff8) >> 3; n2 <<= 29 end,\\n '4' => () -> begin n1 = n2 << 1; n2 >>= 31 end,\\n '5' => () -> begin n1 = n2 << 5; n2 >>= 27 end,\\n '6' => () -> begin n1 = n2 << 12; n2 >>= 20 end,\\n '7' => () -> begin n1 = (n2 & 0x0000ff00) | ((n2 & 0x000000ff) << 24) |\\n ((n2 & 0x00ff0000) >> 16); n2 = (n2 & 0xff000000) >> 8 end,\\n '8' => () -> begin n1 = ((n2 & 0x0000ffff) << 16) | (n2 >> 24);\\n n2 = (n2 & 0x00ff0000) >> 8 end,\\n '9' => () -> begin n1 = ~n2 end)\\n\\n for c in nonce\\n if !haskey(dact, c)\\n n1 = n2\\n else\\n if startflag\\n n2 = password\\n end\\n startflag = false\\n dact[c]()\\n n1 &= 0xffffffff\\n n2 &= 0xffffffff\\n if c != '9'\\n n1 |= n2\\n end\\n end\\n n2 = n1\\n end\\n n1\\nend\\n\\nfunction testcalcpass()\\n tdata = [[\\\"12345\\\", \\\"603356072\\\", \\\"25280520\\\"], [\\\"12345\\\", \\\"410501656\\\", \\\"119537670\\\"],\\n [\\\"12345\\\", \\\"630292165\\\", \\\"4269684735\\\"], [\\\"12345\\\", \\\"523781130\\\", \\\"537331200\\\"]]\\n\\tfor td in tdata\\n pf = calcpass(td[1], td[2]) == parse(Int, td[3]) ? \\\"Passes test.\\\" : \\\"Fails test.\\\"\\n println(\\\"Calculating pass for [$(td[1]), $(td[2])] = $(td[3]): $pf\\\")\\n end\\nend\\n\\ntestcalcpass()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nfun ownCalcPass(password: Long, nonce: String): Long {\\n val m1 = 0xFFFF_FFFFL\\n val m8 = 0xFFFF_FFF8L\\n val m16 = 0xFFFF_FFF0L\\n val m128 = 0xFFFF_FF80L\\n val m16777216 = 0xFF00_0000L\\n\\n var flag = true\\n var num1 = 0L\\n var num2 = 0L\\n\\n for (c in nonce) {\\n num2 = num2 and m1\\n\\n when (c) {\\n '1' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 and m128\\n num1 = num1 ushr 7\\n num2 = num2 shl 25\\n num1 = num1 + num2\\n }\\n\\n '2' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 and m16\\n num1 = num1 ushr 4\\n num2 = num2 shl 28\\n num1 = num1 + num2\\n }\\n\\n '3' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 and m8\\n num1 = num1 ushr 3\\n num2 = num2 shl 29\\n num1 = num1 + num2\\n }\\n\\n '4' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 shl 1\\n num2 = num2 ushr 31\\n num1 = num1 + num2\\n }\\n\\n '5' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 shl 5\\n num2 = num2 ushr 27\\n num1 = num1 + num2\\n }\\n\\n '6' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 shl 12\\n num2 = num2 ushr 20\\n num1 = num1 + num2\\n }\\n\\n '7' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 and 0xFF00L\\n num1 = num1 + ((num2 and 0xFFL) shl 24)\\n num1 = num1 + ((num2 and 0xFF0000L) ushr 16)\\n num2 = (num2 and m16777216) ushr 8\\n num1 = num1 + num2\\n }\\n\\n '8' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2 and 0xFFFFL\\n num1 = num1 shl 16\\n num1 = num1 + (num2 ushr 24)\\n num2 = num2 and 0xFF0000L\\n num2 = num2 ushr 8\\n num1 = num1 + num2\\n }\\n\\n '9' -> {\\n if (flag) num2 = password\\n flag = false\\n num1 = num2.inv()\\n }\\n\\n else -> num1 = num2\\n }\\n num2 = num1\\n }\\n return num1 and m1\\n}\\n\\nfun ownTestCalcPass(passwd: String, nonce: String, expected: Long) {\\n val res = ownCalcPass(passwd.toLong(), nonce)\\n val m = \\\"$passwd $nonce $res $expected\\\"\\n println(if (res == expected) \\\"PASS $m\\\" else \\\"FAIL $m\\\")\\n}\\n\\nfun main(args: Array<String>) {\\n ownTestCalcPass(\\\"12345\\\", \\\"603356072\\\", 25280520)\\n ownTestCalcPass(\\\"12345\\\", \\\"410501656\\\", 119537670)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import bitops, strutils\\n\\nfunc ownCalcPass(password, nonce: string): uint32 =\\n\\n var start = true\\n\\n for c in nonce:\\n if c != '0' and start:\\n result = parseInt(password).uint32\\n start = false\\n case c\\n of '0':\\n discard\\n of '1':\\n result = result.rotateRightBits(7)\\n of '2':\\n result = result.rotateRightBits(4)\\n of '3':\\n result = result.rotateRightBits(3)\\n of '4':\\n result = result.rotateLeftBits(1)\\n of '5':\\n result = result.rotateLeftBits(5)\\n of '6':\\n result = result.rotateLeftBits(12)\\n of '7':\\n result = (result and 0x0000FF00) or result shl 24 or\\n (result and 0x00FF0000) shr 16 or (result and 0xFF000000u32) shr 8\\n of '8':\\n result = result shl 16 or result shr 24 or (result and 0x00FF0000) shr 8\\n of '9':\\n result = not result\\n else:\\n raise newException(ValueError, \\\"non-digit in nonce.\\\")\\n\\n\\nwhen isMainModule:\\n\\n proc testPasswordCalc(password, nonce: string; expected: uint32) =\\n\\n let res = ownCalcPass(password, nonce)\\n let m = \\\"$# $# $# $#\\\".format(password, nonce, res, expected)\\n echo if res == expected: \\\"PASS \\\" else: \\\"FAIL \\\", m\\n\\n testPasswordCalc(\\\"12345\\\", \\\"603356072\\\", 25280520u32)\\n testPasswordCalc(\\\"12345\\\", \\\"410501656\\\", 119537670u32)\\n testPasswordCalc(\\\"12345\\\", \\\"630292165\\\", 4269684735u32)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse integer; # required solely for 2's complement operation: $n1 = ~$n2\\n\\nsub own_password {\\n my($password, $nonce) = @_;\\n my $n1 = 0;\\n my $n2 = $password;\\n for my $d (split //, $nonce) {\\n if ($d == 1) {\\n $n1 = ($n2 & 0xFFFFFF80) >> 7;\\n $n2 <<= 25;\\n } elsif ($d == 2) {\\n $n1 = ($n2 & 0xFFFFFFF0) >> 4;\\n $n2 <<= 28;\\n } elsif ($d == 3) {\\n $n1 = ($n2 & 0xFFFFFFF8) >> 3;\\n $n2 <<= 29;\\n } elsif ($d == 4) {\\n $n1 = $n2 << 1;\\n $n2 >>= 31;\\n } elsif ($d == 5) {\\n $n1 = $n2 << 5;\\n $n2 >>= 27;\\n } elsif ($d == 6) {\\n $n1 = $n2 << 12;\\n $n2 >>= 20;\\n } elsif ($d == 7) {\\n $n1 = ($n2 & 0x0000FF00) | (($n2 & 0x000000FF) << 24) | (($n2 & 0x00FF0000) >> 16);\\n $n2 = ($n2 & 0xFF000000) >> 8;\\n } elsif ($d == 8) {\\n $n1 = ($n2 & 0x0000FFFF) << 16 | $n2 >> 24;\\n $n2 = ($n2 & 0x00FF0000) >> 8;\\n } elsif ($d == 9) {\\n $n1 = ~$n2;\\n } else {\\n $n1 = $n2\\n }\\n $n1 = ($n1 | $n2) & 0xFFFFFFFF if $d != 0 and $d != 9;\\n $n2 = $n1;\\n }\\n $n1\\n}\\n\\nsay own_password( 12345, 603356072 );\\nsay own_password( 12345, 410501656 );\\nsay own_password( 12345, 630292165 );\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ownCalcPass</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pwd</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pwd</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'1'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'2'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">28</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'3'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">29</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'4'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">31</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'5'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">27</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'6'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">12</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'7'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0x0000FF00</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0x000000FF</span><span style=\\\"color: #0000FF;\\\">),-</span><span style=\\\"color: #000000;\\\">24</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0x00FF0000</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0xFF000000</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'8'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0x0000FFFF</span><span style=\\\"color: #0000FF;\\\">),-</span><span style=\\\"color: #000000;\\\">16</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">24</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shift_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0x00FF0000</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">'9'</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">not_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">default</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">num2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">'0'</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">'9'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">or_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">num1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">num2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">num2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">num1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">num1</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">num1</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">#1_0000_0000</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">num1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">testPasswordCalc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pwd</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">ownCalcPass</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pwd</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">pf</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"PASS\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"FAIL\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s %d %s %-10d %-10d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pf</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pwd</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nonce</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">testPasswordCalc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12345</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"603356072\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">25280520</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">testPasswordCalc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12345</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"410501656\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">119537670</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">testPasswordCalc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12345</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"630292165\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4269684735</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">testPasswordCalc</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">12345</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"523781130\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">537331200</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"function ownCalcPass($password, $nonce) {\\n $msr = 0x7FFFFFFF;\\n $m_1 = (int)0xFFFFFFFF;\\n $m_8 = (int)0xFFFFFFF8;\\n $m_16 = (int)0xFFFFFFF0;\\n $m_128 = (int)0xFFFFFF80;\\n $m_16777216 = (int)0xFF000000;\\n $flag = True;\\n $num1 = 0;\\n $num2 = 0;\\n\\n foreach (str_split($nonce) as $c) {\\n $num1 = $num1 & $m_1;\\n $num2 = $num2 & $m_1;\\n if ($c == '1') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 & $m_128;\\n $num1 = $num1 >> 1;\\n $num1 = $num1 & $msr;\\n $num1 = $num1 >> 6;\\n $num2 = $num2 << 25;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '2') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 & $m_16;\\n $num1 = $num1 >> 1;\\n $num1 = $num1 & $msr;\\n $num1 = $num1 >> 3;\\n $num2 = $num2 << 28;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '3') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 & $m_8;\\n $num1 = $num1 >> 1;\\n $num1 = $num1 & $msr;\\n $num1 = $num1 >> 2;\\n $num2 = $num2 << 29;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '4') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 << 1;\\n $num2 = $num2 >> 1;\\n $num2 = $num2 & $msr;\\n $num2 = $num2 >> 30;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '5') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 << 5;\\n $num2 = $num2 >> 1;\\n $num2 = $num2 & $msr;\\n $num2 = $num2 >> 26;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '6') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 << 12;\\n $num2 = $num2 >> 1;\\n $num2 = $num2 & $msr;\\n $num2 = $num2 >> 19;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '7') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 & 0xFF00;\\n $num1 = $num1 + (( $num2 & 0xFF ) << 24 );\\n $num1 = $num1 + (( $num2 & 0xFF0000 ) >> 16 );\\n $num2 = $num2 & $m_16777216;\\n $num2 = $num2 >> 1;\\n $num2 = $num2 & $msr;\\n $num2 = $num2 >> 7;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '8') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = $num2 & 0xFFFF;\\n $num1 = $num1 << 16;\\n $numx = $num2 >> 1;\\n $numx = $numx & $msr;\\n $numx = $numx >> 23;\\n $num1 = $num1 + $numx;\\n $num2 = $num2 & 0xFF0000;\\n $num2 = $num2 >> 1;\\n $num2 = $num2 & $msr;\\n $num2 = $num2 >> 7;\\n $num1 = $num1 + $num2;\\n $flag = False;\\n } elseif ($c == '9') {\\n $length = !$flag;\\n if (!$length) {\\n $num2 = $password;\\n }\\n $num1 = ~(int)$num2;\\n $flag = False;\\n } else {\\n $num1 = $num2;\\n }\\n $num2 = $num1;\\n }\\n return sprintf('%u', $num1 & $m_1);\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"def ownCalcPass (password, nonce, test=False) :\\n start = True\\n num1 = 0\\n num2 = 0\\n password = int(password)\\n if test:\\n print(\\\"password: %08x\\\" % (password))\\n for c in nonce :\\n if c != \\\"0\\\":\\n if start:\\n num2 = password\\n start = False\\n if test:\\n print(\\\"c: %s num1: %08x num2: %08x\\\" % (c, num1, num2))\\n if c == '1':\\n num1 = (num2 & 0xFFFFFF80) >> 7\\n num2 = num2 << 25\\n elif c == '2':\\n num1 = (num2 & 0xFFFFFFF0) >> 4\\n num2 = num2 << 28\\n elif c == '3':\\n num1 = (num2 & 0xFFFFFFF8) >> 3\\n num2 = num2 << 29\\n elif c == '4':\\n num1 = num2 << 1\\n num2 = num2 >> 31\\n elif c == '5':\\n num1 = num2 << 5\\n num2 = num2 >> 27\\n elif c == '6':\\n num1 = num2 << 12\\n num2 = num2 >> 20\\n elif c == '7':\\n num1 = num2 & 0x0000FF00 | (( num2 & 0x000000FF ) << 24 ) | (( num2 & 0x00FF0000 ) >> 16 )\\n num2 = ( num2 & 0xFF000000 ) >> 8\\n elif c == '8':\\n num1 = (num2 & 0x0000FFFF) << 16 | ( num2 >> 24 )\\n num2 = (num2 & 0x00FF0000) >> 8\\n elif c == '9':\\n num1 = ~num2\\n else :\\n num1 = num2\\n\\n num1 &= 0xFFFFFFFF\\n num2 &= 0xFFFFFFFF\\n if (c not in \\\"09\\\"):\\n num1 |= num2\\n if test:\\n print(\\\" num1: %08x num2: %08x\\\" % (num1, num2))\\n num2 = num1\\n return num1\\n\\ndef test_passwd_calc(passwd, nonce, expected):\\n res = ownCalcPass(passwd, nonce, False)\\n m = passwd+' '+nonce+' '+str(res)+' '+str(expected)\\n if res == int(expected) :\\n print('PASS '+m)\\n else :\\n print('FAIL '+m)\\n\\nif __name__ == '__main__':\\n test_passwd_calc('12345','603356072','25280520')\\n test_passwd_calc('12345','410501656','119537670')\\n test_passwd_calc('12345','630292165','4269684735')\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket/base\\n(define (32-bit-truncate n)\\n (bitwise-and n #xFFFFFFFF))\\n\\n(define (own-calc-pass password-string nonce)\\n (define-values (num-1 flag)\\n (for/fold ((num-1 0) (flag #t))\\n ((c (in-string nonce)))\\n (let* ((num-1 (32-bit-truncate num-1))\\n (num-2 (if flag (string->number password-string) num-1)))\\n\\n (define (and-right-left-add mask right left)\\n (values (+ (arithmetic-shift (bitwise-and num-2 mask) (- right))\\n (arithmetic-shift num-2 left))\\n #f))\\n\\n (define (left-right-add left right)\\n (values (+ (arithmetic-shift num-2 left) (arithmetic-shift num-2 (- right))) #f))\\n\\n (define (stage-7)\\n (values (+ (+ (+ (bitwise-and num-2 #xff00)\\n (arithmetic-shift (bitwise-and num-2 #xff) 24))\\n (arithmetic-shift (bitwise-and num-2 #xff0000) -16))\\n (arithmetic-shift (bitwise-and num-2 #xFF000000) -8))\\n #f))\\n\\n (define (stage-8)\\n (values (+ (+ (arithmetic-shift (bitwise-and num-2 #xffff) 16)\\n (arithmetic-shift num-2 -24))\\n (arithmetic-shift (bitwise-and num-2 #xff0000) -8))\\n #f))\\n\\n (define (stage-9) (values (bitwise-not num-2) #f))\\n\\n (case c\\n ([#\\\\1] (and-right-left-add #xFFFFFF80 7 25))\\n ([#\\\\2] (and-right-left-add #xFFFFFFF0 4 28))\\n ([#\\\\3] (and-right-left-add #xFFFFFFF8 3 29))\\n ([#\\\\4] (left-right-add 1 31))\\n ([#\\\\5] (left-right-add 5 27))\\n ([#\\\\6] (left-right-add 12 20))\\n ([#\\\\7] (stage-7))\\n ([#\\\\8] (stage-8))\\n ([#\\\\9] (stage-9))\\n (else (values num-1 flag))))))\\n (32-bit-truncate num-1))\\n\\n(module+ test\\n (require rackunit)\\n\\n (define (own-test-calc-pass passwd nonce expected)\\n (let* ((res (own-calc-pass passwd nonce))\\n (msg (format \\\"~a ~a ~a ~a\\\" passwd nonce res expected)))\\n (string-append (if (= res expected) \\\"PASS\\\" \\\"FAIL\\\") \\\" \\\" msg)))\\n\\n\\n (own-test-calc-pass \\\"12345\\\" \\\"603356072\\\" 25280520)\\n (own-test-calc-pass \\\"12345\\\" \\\"410501656\\\" 119537670))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub own-password (Int $password, Int $nonce) {\\n my int $n1 = 0;\\n my int $n2 = $password;\\n for $nonce.comb {\\n given $_ {\\n when 1 {\\n $n1 = $n2 +& 0xFFFFFF80 +> 7;\\n $n2 +<= 25;\\n }\\n when 2 {\\n $n1 = $n2 +& 0xFFFFFFF0 +> 4;\\n $n2 +<= 28;\\n }\\n when 3 {\\n $n1 = $n2 +& 0xFFFFFFF8 +> 3;\\n $n2 +<= 29;\\n }\\n when 4 {\\n $n1 = $n2 +< 1;\\n $n2 +>= 31;\\n }\\n when 5 {\\n $n1 = $n2 +< 5;\\n $n2 +>= 27;\\n }\\n when 6 {\\n $n1 = $n2 +< 12;\\n $n2 +>= 20;\\n }\\n when 7 {\\n $n1 = $n2 +& 0x0000FF00 +| ($n2 +& 0x000000FF +< 24) +| ($n2 +& 0x00FF0000 +> 16);\\n $n2 = $n2 +& 0xFF000000 +> 8;\\n }\\n when 8 {\\n $n1 = $n2 +& 0x0000FFFF +< 16 +| $n2 +> 24;\\n $n2 = $n2 +& 0x00FF0000 +> 8;\\n }\\n when 9 { $n1 = +^$n2 }\\n default { $n1 = $n2 }\\n }\\n given $_ {\\n when 0 {}\\n when 9 {}\\n default { $n1 = ($n1 +| $n2) +& 0xFFFFFFFF }\\n }\\n $n2 = $n1;\\n }\\n $n1\\n}\\n\\nsay own-password( 12345, 603356072 );\\nsay own-password( 12345, 410501656 );\\nsay own-password( 12345, 630292165 );\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"func openAuthenticationResponse(_password: String, operations: String) -> String? {\\n var num1 = UInt32(0)\\n var num2 = UInt32(0)\\n var start = true\\n let password = UInt32(_password)!\\n for c in operations {\\n if (c != \\\"0\\\") {\\n if start {\\n num2 = password\\n }\\n start = false\\n }\\n switch c {\\n case \\\"1\\\":\\n num1 = (num2 & 0xffffff80) >> 7\\n num2 = num2 << 25\\n case \\\"2\\\":\\n num1 = (num2 & 0xfffffff0) >> 4\\n num2 = num2 << 28\\n case \\\"3\\\":\\n num1 = (num2 & 0xfffffff8) >> 3\\n num2 = num2 << 29\\n case \\\"4\\\":\\n num1 = num2 << 1\\n num2 = num2 >> 31\\n case \\\"5\\\":\\n num1 = num1 << 5\\n num2 = num2 >> 27\\n case \\\"6\\\":\\n num1 = num2 << 12\\n num2 = num2 >> 20\\n case \\\"7\\\":\\n num1 = (num2 & 0x0000ff00) | ((num2 & 0x000000ff) << 24) | ((num2 & 0x00ff0000) >> 16)\\n num2 = (num2 & 0xff000000) >> 8\\n case \\\"8\\\":\\n num1 = ((num2 & 0x0000ffff) << 16) | (num2 >> 24)\\n num2 = (num2 & 0x00ff0000) >> 8\\n case \\\"9\\\":\\n num1 = ~num2\\n case \\\"0\\\":\\n num1 = num2\\n default:\\n print(\\\"unexpected char \\\\(c)\\\")\\n return nil\\n }\\n if (c != \\\"9\\\") && (c != \\\"0\\\") {\\n num1 |= num2\\n }\\n num2 = num1\\n }\\n return String(num1)\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar ownCalcPass = Fn.new { |password, nonce|\\n var start = true\\n var num1 = 0\\n var num2 = 0\\n var pwd = Num.fromString(password)\\n for (c in nonce) {\\n if (c != \\\"0\\\") {\\n if (start) num2 = pwd\\n start = false\\n }\\n if (c == \\\"1\\\") {\\n num1 = (num2 & 0xFFFFFF80) >> 7\\n num2 = num2 << 25\\n } else if (c == \\\"2\\\") {\\n num1 = (num2 & 0xFFFFFFF0) >> 4\\n num2 = num2 << 28\\n } else if (c == \\\"3\\\") {\\n num1 = (num2 & 0xFFFFFFF8) >> 3\\n num2 = num2 << 29\\n } else if (c == \\\"4\\\") {\\n num1 = num2 << 1\\n num2 = num2 >> 31\\n } else if (c == \\\"5\\\") {\\n num1 = num2 << 5\\n num2 = num2 >> 27\\n } else if (c == \\\"6\\\") {\\n num1 = num2 << 12\\n num2 = num2 >> 20\\n } else if (c == \\\"7\\\") {\\n var num3 = num2 & 0x0000FF00\\n var num4 = ((num2 & 0x000000FF) << 24) | ((num2 & 0x00FF0000) >> 16)\\n num1 = num3 | num4\\n num2 = (num2 & 0xFF000000) >> 8\\n } else if (c == \\\"8\\\") {\\n num1 = (num2&0x0000FFFF)<<16 | (num2 >> 24)\\n num2 = (num2 & 0x00FF0000) >> 8\\n } else if (c == \\\"9\\\") {\\n num1 = ~num2\\n } else {\\n num1 = num2\\n }\\n num1 = num1 & 0xFFFFFFFF\\n num2 = num2 & 0xFFFFFFFF\\n if (c != \\\"0\\\" && c != \\\"9\\\") num1 = num1 | num2\\n num2 = num1\\n }\\n return num1\\n}\\n\\nvar testPasswordCalc = Fn.new { |password, nonce, expected|\\n var res = ownCalcPass.call(password, nonce)\\n var m = Fmt.swrite(\\\"$s $s $-10d $-10d\\\", password, nonce, res, expected)\\n if (res == expected) {\\n System.print(\\\"PASS %(m)\\\")\\n } else {\\n System.print(\\\"FAIL %(m)\\\")\\n }\\n}\\n\\ntestPasswordCalc.call(\\\"12345\\\", \\\"603356072\\\", 25280520)\\ntestPasswordCalc.call(\\\"12345\\\", \\\"410501656\\\", 119537670)\\ntestPasswordCalc.call(\\\"12345\\\", \\\"630292165\\\", 4269684735)\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"OpenWebNet-password"}}},{"rowIdx":1466,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Optional_parameters\nnote: Basic language learning\n","language":"00-META"},{"code":";Task:\nDefine a function/method/subroutine which sorts a sequence (\"table\") of sequences (\"rows\") of strings (\"cells\"), by one of the strings. Besides the input to be sorted, it shall have the following optional parameters:\n:{|\n|\n----\n; ordering\n: A function specifying the ordering of strings; lexicographic by default.\n; column\n: An integer specifying which string of each row to compare; the first by default.\n; reverse\n: Reverses the ordering.\n----\n|}\n\nThis task should be considered to include both positional and named optional parameters, as well as overloading on argument count as in Java or selector name as in Smalltalk, or, in the extreme, using different function names. Provide these variations of sorting '''in whatever way is most natural to your language'''. If the language supports both methods naturally, you are encouraged to describe both.\n\nDo not implement a sorting algorithm; this task is about the interface. If you can't use a built-in sort routine, just omit the implementation (with a comment).\n\nSee also:\n* [[Named Arguments]]\n<br><br>\n\n","language":"00-TASK"},{"code":"package Tables is\n\n type Table is private;\n\n type Ordering is (Lexicographic, Psionic, ...); -- add others\n\n procedure Sort (It : in out Table;\n Order_By : in Ordering := Lexicographic;\n Column : in Positive := 1;\n Reverse_Ordering : in Boolean := False);\n\nprivate\n ... -- implementation specific\nend Tables;\n","language":"Ada"},{"code":"with Tables;\nprocedure Table_Test is\n My_Table : Tables.Table;\nbegin\n ... -- insert stuff in table\n Sort (My_Table); -- use default sorting\n Sort (My_Table, Psionic, 5, True); -- use psionic sorting by 5th column in reverse order\n Sort (It => My_Table, Reverse_Ordering => True); -- use default sorting in reverse order\n ... -- other stuff\nend Table_Test;\n","language":"Ada"},{"code":"# as the options have distinct types (INT, BOOL and PROC( STRING, STRING )INT) the #\n# easiest way to support these optional parameters in Algol 68 would be to have an array #\n# with elements of these types #\n# See the Named Arguments sample for cases where the option types are not distinct #\n\n# default comparison function #\nPROC default compare = ( STRING a, b )INT: IF a < b THEN -1 ELIF a = b THEN 0 ELSE 1 FI;\n\n# sorting procedure #\nPROC configurable sort = ( [,]STRING data, []UNION( INT, BOOL, PROC( STRING, STRING )INT ) options )VOID:\nBEGIN\n # set initial values for the options #\n INT sort column := 2 LWB data;\n BOOL reverse sort := FALSE;\n PROC( STRING, STRING )INT comparator := default compare;\n # overide from the supplied options #\n FOR opt pos FROM LWB options TO UPB options DO\n CASE options[ opt pos ]\n IN ( PROC( STRING, STRING )INT p ): comparator := p\n , ( INT c ): sort column := c\n , ( BOOL r ): reverse sort := r\n ESAC\n OD\n # do the sort .... #\nEND # configurable sort # ;\n\n# example calls #\n[ 1 : 2, 1 : 3 ]STRING data := ( ( \"a\", \"bb\", \"cde\" ), ( \"x\", \"abcdef\", \"Q\" ) );\n\n# sort data, default comparison, first column, reverse order #\nconfigurable sort( data, ( TRUE ) );\n# sort data, second column, ignore first chaacter when sorting, normal order #\nconfigurable sort( data, ( 2, ( STRING a, STRING b )INT: default compare( a[ LWB a + 1 : ], b[ LWB b + 1 : ] ) ) );\n# default sort #\nconfigurable sort( data, () )\n","language":"ALGOL-68"},{"code":"on sortTable(x)\n\tset {sortOrdering, sortColumn, sortReverse} to {sort_lexicographic, 1, false}\n\ttry\n\t\tset sortOrdering to x's ordering\n\tend try\n\ttry\n\t\tset sortColumn to x's column\n\tend try\n\ttry\n\t\tset sortReverse to x's reverse\n\tend try\n\treturn sortOrdering's sort(x's sequence, sortColumn, sortReverse)\nend sortTable\n\nscript sort_lexicographic\n\ton sort(table, column, reverse)\n\t\t-- Implement lexicographic Sorting process here.\n\t\treturn table\n\tend sort\nend script\n","language":"AppleScript"},{"code":"-- Another sort function.\nscript sort_colex\n\ton sort(table, column, reverse)\n\t\t-- Implement colexicographic Sorting process here.\n\t\treturn table\n\tend sort\nend script\n\n-- Populate a table (list) with data.\nset table to {{1,2},{3,4}}\n\nsortTable({sequence:table, ordering:sort_lexicographic, column:1, reverse:false})\nsortTable({sequence:table, ordering:sort_colex, column:2, reverse:true})\nsortTable({sequence:table, reverse:true})\nsortTable({sequence:table})\n","language":"AppleScript"},{"code":"sortTable: function [tbl][\n column: \"0\"\n reversed?: false\n unless null? c: <= attr 'column -> column: to :string c\n unless null? attr 'reverse -> reversed?: true\n\n result: new sort.by: column map tbl 'r [\n to :dictionary flatten couple 0..dec size r r\n ]\n\n if reversed? -> reverse 'result\n\n return map result 'r -> values r\n]\n\nprintTable: function [tbl, title][\n print [\"==\" title]\n loop tbl 'row [\n print row\n ]\n print \"\"\n]\n\nlst: [\n [\"a\", \"b\", \"c\"]\n [\"\", \"q\", \"z\"]\n [\"zap\", \"zip\", \"Zot\"]\n]\n\nprintTable sortTable lst \"Default sort\"\nprintTable sortTable.column:1 lst \"Sorting by column=1\"\nprintTable sortTable.reverse lst \"Sorting, reversed\"\nprintTable sortTable.reverse.column:1 lst \"Sorting by column=1, reversed\"\n","language":"Arturo"},{"code":"Gosub start ; create and show the gui\nsort_table(\"Text\", column := 2, reverse := 1) ; lexicographic sort\nSleep, 2000\nsort_table(\"Integer\", column := 2, reverse := 1) ; numerical sort\nReturn\n\nstart:\n Gui, Add, ListView, r20 w200, 1|2|3\n data =\n (\n 1,2,3\n b,q,z\n c,z,z\n )\n Loop, Parse, data, `n\n {\n StringSplit, row, A_LoopField, `,\n LV_Add(row, row1, row2, row3)\n }\n LV_ModifyCol(50) ; Auto-size columns\n Gui, Show\nReturn\n\n; The function supporting named, defaulted arguments\nsort_table(ordering = \"Text\", column = 0, reverse = 0)\n{\n If reverse\n desc = desc\n LV_ModifyCol(column, \"sort\" . desc . \" \" . ordering)\n}\n\nGuiClose:\n ExitApp\n","language":"AutoHotkey"},{"code":" DIM table$(100,100)\n PROCsort_default(table$())\n PROCsort_options(table$(), TRUE, 1, FALSE)\n END\n\n DEF PROCsort_options(table$(), ordering%, column%, reverse%)\n DEF PROCsort_default(table$()) : LOCAL ordering%, column%, reverse%\n REM The sort goes here, controlled by the options\n REM Zero/FALSE values for the options shall select the defaults\n ENDPROC\n","language":"BBC-BASIC"},{"code":"( ( sortTable\n = table ordering column reverse\n . !arg\n : ( ?table\n . ( ? (ordering.?ordering) ?\n | ?&lexicographic:?ordering\n )\n : ( ? (column.?column) ?\n | ?&1:?column\n )\n : ( ? (reverse.?reverse) ?\n | ?&no:?reverse\n )\n )\n & (...)\n )\n& (12.Claes.left)\n (11.Otto.right)\n (8.Frederikke.middle)\n : ?table\n& sortTable$(!table.(column.2) (reverse.yes))\n);\n","language":"Bracmat"},{"code":"#include <stdlib.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <ctype.h>\n#include <string.h>\n\ntypedef const char * String;\ntypedef struct sTable {\n String * *rows;\n int n_rows,n_cols;\n} *Table;\n\ntypedef int (*CompareFctn)(String a, String b);\n\nstruct {\n CompareFctn compare;\n int column;\n int reversed;\n} sortSpec;\n\nint CmprRows( const void *aa, const void *bb)\n{\n String *rA = *(String *const *)aa;\n String *rB = *(String *const *)bb;\n int sortCol = sortSpec.column;\n\n String left = sortSpec.reversed ? rB[sortCol] : rA[sortCol];\n String right = sortSpec.reversed ? rA[sortCol] : rB[sortCol];\n return sortSpec.compare( left, right );\n}\n\n/** * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\n * tbl parameter is a table of rows of strings\n * argSpec is a string containing zero or more of the letters o,c,r\n * if o is present - the corresponding optional argument is a function which\n * determines the ordering of the strings.\n * if c is present - the corresponding optional argument is an integer that\n * specifies the column to sort on.\n * if r is present - the corresponding optional argument is either\n * true(nonzero) or false(zero) and if true, the sort will b in reverse order\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */\nint sortTable(Table tbl, const char* argSpec,... )\n{\n va_list vl;\n const char *p;\n int c;\n sortSpec.compare = &strcmp;\n sortSpec.column = 0;\n sortSpec.reversed = 0;\n\n va_start(vl, argSpec);\n if (argSpec)\n for (p=argSpec; *p; p++) {\n switch (*p) {\n case 'o':\n sortSpec.compare = va_arg(vl,CompareFctn);\n break;\n case 'c':\n c = va_arg(vl,int);\n if ( 0<=c && c<tbl->n_cols)\n sortSpec.column = c;\n break;\n case 'r':\n sortSpec.reversed = (0!=va_arg(vl,int));\n break;\n }\n }\n va_end(vl);\n qsort( tbl->rows, tbl->n_rows, sizeof(String *), CmprRows);\n return 0;\n}\n\nvoid printTable( Table tbl, FILE *fout, const char *colFmts[])\n{\n int row, col;\n\n for (row=0; row<tbl->n_rows; row++) {\n fprintf(fout, \" \");\n for(col=0; col<tbl->n_cols; col++) {\n fprintf(fout, colFmts[col], tbl->rows[row][col]);\n }\n fprintf(fout, \"\\n\");\n }\n fprintf(fout, \"\\n\");\n}\n\nint ord(char v)\n{\n return v-'0';\n}\n\n/* an alternative comparison function */\nint cmprStrgs(String s1, String s2)\n{\n const char *p1 = s1;\n const char *p2 = s2;\n const char *mrk1, *mrk2;\n while ((tolower(*p1) == tolower(*p2)) && *p1) {\n p1++; p2++;\n }\n if (isdigit(*p1) && isdigit(*p2)) {\n long v1, v2;\n if ((*p1 == '0') ||(*p2 == '0')) {\n while (p1 > s1) {\n p1--; p2--;\n if (*p1 != '0') break;\n }\n if (!isdigit(*p1)) {\n p1++; p2++;\n }\n }\n mrk1 = p1; mrk2 = p2;\n v1 = 0;\n while(isdigit(*p1)) {\n v1 = 10*v1+ord(*p1);\n p1++;\n }\n v2 = 0;\n while(isdigit(*p2)) {\n v2 = 10*v2+ord(*p2);\n p2++;\n }\n if (v1 == v2)\n return(p2-mrk2)-(p1-mrk1);\n return v1 - v2;\n }\n if (tolower(*p1) != tolower(*p2))\n return (tolower(*p1) - tolower(*p2));\n for(p1=s1, p2=s2; (*p1 == *p2) && *p1; p1++, p2++);\n return (*p1 -*p2);\n}\n\nint main()\n{\n const char *colFmts[] = {\" %-5.5s\",\" %-5.5s\",\" %-9.9s\"};\n String r1[] = { \"a101\", \"red\", \"Java\" };\n String r2[] = { \"ab40\", \"gren\", \"Smalltalk\" };\n String r3[] = { \"ab9\", \"blue\", \"Fortran\" };\n String r4[] = { \"ab09\", \"ylow\", \"Python\" };\n String r5[] = { \"ab1a\", \"blak\", \"Factor\" };\n String r6[] = { \"ab1b\", \"brwn\", \"C Sharp\" };\n String r7[] = { \"Ab1b\", \"pink\", \"Ruby\" };\n String r8[] = { \"ab1\", \"orng\", \"Scheme\" };\n\n String *rows[] = { r1, r2, r3, r4, r5, r6, r7, r8 };\n struct sTable table;\n table.rows = rows;\n table.n_rows = 8;\n table.n_cols = 3;\n\n sortTable(&table, \"\");\n printf(\"sort on col 0, ascending\\n\");\n printTable(&table, stdout, colFmts);\n\n sortTable(&table, \"ro\", 1, &cmprStrgs);\n printf(\"sort on col 0, reverse.special\\n\");\n printTable(&table, stdout, colFmts);\n\n sortTable(&table, \"c\", 1);\n printf(\"sort on col 1, ascending\\n\");\n printTable(&table, stdout, colFmts);\n\n sortTable(&table, \"cr\", 2, 1);\n printf(\"sort on col 2, reverse\\n\");\n printTable(&table, stdout, colFmts);\n return 0;\n}\n","language":"C"},{"code":"#include <vector>\n#include <algorithm>\n#include <string>\n\n// helper comparator that is passed to std::sort()\ntemplate <class T>\nstruct sort_table_functor {\n typedef bool (*CompFun)(const T &, const T &);\n const CompFun ordering;\n const int column;\n const bool reverse;\n sort_table_functor(CompFun o, int c, bool r) :\n ordering(o), column(c), reverse(r) { }\n bool operator()(const std::vector<T> &x, const std::vector<T> &y) const {\n const T &a = x[column],\n &b = y[column];\n return reverse ? ordering(b, a)\n : ordering(a, b);\n }\n};\n\n// natural-order less-than comparator\ntemplate <class T>\nbool myLess(const T &x, const T &y) { return x < y; }\n\n// this is the function we call, which takes optional parameters\ntemplate <class T>\nvoid sort_table(std::vector<std::vector<T> > &table,\n int column = 0, bool reverse = false,\n bool (*ordering)(const T &, const T &) = myLess) {\n std::sort(table.begin(), table.end(),\n sort_table_functor<T>(ordering, column, reverse));\n}\n\n#include <iostream>\n\n// helper function to print our 3x3 matrix\ntemplate <class T>\nvoid print_matrix(std::vector<std::vector<T> > &data) {\n for () {\n for (int j = 0; j < 3; j++)\n std::cout << data[i][j] << \"\\t\";\n std::cout << std::endl;\n }\n}\n\n// order in descending length\nbool desc_len_comparator(const std::string &x, const std::string &y) {\n return x.length() > y.length();\n}\n\nint main() {\n\n std::string data_array[3][3] =\n {\n {\"a\", \"b\", \"c\"},\n {\"\", \"q\", \"z\"},\n {\"zap\", \"zip\", \"Zot\"}\n };\n\n std::vector<std::vector<std::string> > data_orig;\n for (int i = 0; i < 3; i++) {\n std::vector<std::string> row;\n for (int j = 0; j < 3; j++)\n row.push_back(data_array[i][j]);\n data_orig.push_back(row);\n }\n print_matrix(data_orig);\n\n std::vector<std::vector<std::string> > data = data_orig;\n sort_table(data);\n print_matrix(data);\n\n data = data_orig;\n sort_table(data, 2);\n print_matrix(data);\n\n data = data_orig;\n sort_table(data, 1);\n print_matrix(data);\n\n data = data_orig;\n sort_table(data, 1, true);\n print_matrix(data);\n\n data = data_orig;\n sort_table(data, 0, false, desc_len_comparator);\n print_matrix(data);\n\n return 0;\n}\n","language":"C++"},{"code":"(defn sort [table & {:keys [ordering column reverse?]\n :or {ordering :lex, column 1}}]\n (println table ordering column reverse?))\n\n(sort [1 8 3] :reverse? true)\n[1 8 3] :lex 1 true\n","language":"Clojure"},{"code":"(defun sort-table (table &key (ordering #'string<)\n (column 0)\n reverse)\n (sort table (if reverse\n (complement ordering)\n ordering)\n :key (lambda (row) (elt row column))))\n","language":"Common-Lisp"},{"code":"CL-USER> (defparameter *data* '((\"a\" \"b\" \"c\") (\"\" \"q\" \"z\") (\"zap\" \"zip\" \"Zot\")))\n*DATA*\n\nCL-USER> (sort-table *data*)\n((\"\" \"q\" \"z\") (\"a\" \"b\" \"c\") (\"zap\" \"zip\" \"Zot\"))\n\nCL-USER> (sort-table *data* :column 2)\n((\"zap\" \"zip\" \"Zot\") (\"a\" \"b\" \"c\") (\"\" \"q\" \"z\"))\n\nCL-USER> (sort-table *data* :column 1)\n((\"a\" \"b\" \"c\") (\"\" \"q\" \"z\") (\"zap\" \"zip\" \"Zot\"))\n\nCL-USER> (sort-table *data* :column 1 :reverse t)\n((\"zap\" \"zip\" \"Zot\") (\"\" \"q\" \"z\") (\"a\" \"b\" \"c\"))\n\nCL-USER> (sort-table *data* :ordering (lambda (a b) (> (length a) (length b))))\n((\"zap\" \"zip\" \"Zot\") (\"a\" \"b\" \"c\") (\"\" \"q\" \"z\"))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.algorithm, std.functional;\n\nstring[][] sortTable(string[][] table,\n in bool function(string[],string[]) ordering=null,\n in int column = 0,\n in bool reverse = false) {\n if (ordering is null)\n table.schwartzSort!(row => row[column])();\n else\n table.sort!ordering();\n if (reverse)\n table.reverse();\n return table;\n}\n\nvoid main() {\n auto data = [[\"a\", \"b\", \"c\"],\n [\"\", \"q\", \"z\"],\n [\"zap\", \"zip\", \"Zot\"]];\n\n alias show = curry!(writefln, \"%-(%s\\n%)\\n\");\n show(data);\n show(sortTable(data));\n show(sortTable(data, null, 2));\n show(sortTable(data, null, 1));\n show(sortTable(data, null, 1, true));\n show(sortTable(data, (a,b) => b.length > a.length));\n}\n","language":"D"},{"code":"program Optional_parameters;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils;\n\ntype\n TRow = TArray<string>;\n\n TOrderingFun = TFunc<TRow, TRow, Boolean>;\n\n TTable = array of TRow;\n\n TRowHelper = record helper for TRow\n public\n procedure Swap(var other: TRow);\n function ToString: string;\n function Length: Integer;\n end;\n\n TTableHelper = record helper for TTable\n private\n procedure ExchangeRow(i, j: Integer);\n public\n procedure Sort(OrderingFun: TOrderingFun);\n procedure Reverse;\n function ToString: string;\n end;\n\nfunction Max(a, b: Integer): Integer;\nbegin\n if a > b then\n exit(a);\n Result := b;\nend;\n\n{ TRowHelper }\n\nfunction TRowHelper.Length: Integer;\nbegin\n Result := System.Length(self);\nend;\n\nprocedure TRowHelper.Swap(var other: TRow);\nvar\n aLengthOther, aLengthSelf, aLength: Integer;\n tmp: string;\n i: Integer;\nbegin\n aLengthOther := other.Length;\n aLengthSelf := self.Length;\n aLength := max(aLengthOther, aLengthSelf);\n if aLength = 0 then\n exit;\n\n SetLength(self, aLength);\n SetLength(other, aLength);\n\n for i := 0 to aLength - 1 do\n begin\n tmp := self[i];\n self[i] := other[i];\n other[i] := tmp;\n end;\n\n SetLength(self, aLengthOther);\n SetLength(other, aLengthSelf);\nend;\n\nfunction TRowHelper.ToString: string;\nvar\n i: Integer;\nbegin\n Result := '[';\n for i := 0 to High(self) do\n begin\n if i > 0 then\n Result := Result + ', ';\n Result := Result + '\"' + self[i] + '\"';\n end;\n Result := Result + ']';\nend;\n\n{ TTableHelper }\n\nprocedure TTableHelper.ExchangeRow(i, j: Integer);\nbegin\n Self[i].Swap(self[j]);\nend;\n\nprocedure TTableHelper.reverse;\nvar\n aLength, aHalfLength: Integer;\n i: Integer;\nbegin\n aLength := Length(self);\n aHalfLength := aLength div 2;\n for i := 0 to aHalfLength - 1 do\n ExchangeRow(i, aLength - i - 1);\nend;\n\nprocedure TTableHelper.Sort(OrderingFun: TOrderingFun);\nvar\n i, j, aLength: Integer;\nbegin\n if not Assigned(OrderingFun) then\n exit;\n\n aLength := Length(self);\n for i := 0 to aLength - 2 do\n for j := i + 1 to aLength - 1 do\n if OrderingFun(self[i], self[j]) then\n ExchangeRow(i, j);\nend;\n\nfunction TTableHelper.ToString: string;\nvar\n i: Integer;\nbegin\n Result := '[';\n for i := 0 to High(self) do\n begin\n if i > 0 then\n Result := Result + #10;\n Result := Result + self[i].ToString;\n end;\n Result := Result + ']';\nend;\n\nfunction SortTable(table: TTable; Ordering: TOrderingFun = nil; column: Integer\n = 0; reverse: Boolean = false): TTable;\nvar\n acolumn: Integer;\nbegin\n acolumn := column;\n if not Assigned(Ordering) then\n Ordering :=\n function(left, right: TRow): Boolean\n begin\n Result := left[acolumn] > right[acolumn];\n end;\n\n table.Sort(Ordering);\n if (reverse) then\n table.reverse();\n Result := table;\nend;\n\nvar\n data: TTable = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']];\n\nbegin\n Writeln(data.ToString, #10);\n Writeln(SortTable(data).ToString, #10);\n Writeln(SortTable(data).ToString, #10);\n Writeln(SortTable(data, nil, 2).ToString, #10);\n Writeln(SortTable(data, nil, 1).ToString, #10);\n Writeln(SortTable(data, nil, 1, True).ToString, #10);\n Writeln(SortTable(data,\n function(left, right: TRow): Boolean\n begin\n Result := left.Length > right.Length;\n end).ToString, #10);\n Readln;\nend.\n","language":"Delphi"},{"code":"def defaultOrdering(a, b) { return a.op__cmp(b) }\n\ndef sort {\n\n to run(table) {\n return sort(table, 0, false, defaultOrdering)\n }\n to run(table, column) {\n return sort(table, column, false, defaultOrdering)\n }\n to run(table, column, reverse) {\n return sort(table, column, reverse, defaultOrdering)\n }\n\n to run(table :List[List[String]], column :int, reverse :boolean, ordering) {\n return table.sort(fn a, b {\n def ord := ordering(a[column], b[column])\n if (reverse) { -ord } else { ord }\n })\n }\n\n}\n","language":"E"},{"code":"module OptionalParameters {\n typedef Type<String >.Orderer as ColumnOrderer;\n typedef Type<String[]>.Orderer as RowOrderer;\n\n static String[][] sort(String[][] table,\n ColumnOrderer? orderer = Null,\n Int column = 0,\n Boolean reverse = False,\n ) {\n // provide a default orderer\n orderer ?:= (s1, s2) -> s1 <=> s2;\n\n // optionally reverse the order\n ColumnOrderer byString = reverse\n ? ((s1, s2) -> orderer(s1, s2).reversed)\n : orderer;\n\n // sort the indicated column\n RowOrderer byColumn = (row1, row2) -> byString(row1[column], row2[column]);\n\n return table.sorted(byColumn);\n }\n\n void run() {\n String[][] table =\n [\n [\"c\", \"x\", \"i\"],\n [\"a\", \"y\", \"p\"],\n [\"b\", \"z\", \"a\"],\n ];\n\n show(\"original input\", table);\n show(\"by default sort on column 0\", sort(table));\n show(\"by column 2\", sort(table, column=2));\n show(\"by column 2 reversed\", sort(table, column=2, reverse=True));\n }\n\n void show(String title, String[][] table) {\n @Inject Console console;\n console.print($\"{title}:\");\n for (val row : table) {\n console.print($\" {row}\");\n }\n console.print();\n }\n}\n","language":"Ecstasy"},{"code":"defmodule Optional_parameters do\n def sort( table, options\\\\[] ) do\n options = options ++ [ ordering: :lexicographic, column: 0, reverse: false ]\n ordering = options[ :ordering ]\n column = options[ :column ]\n reverse = options[ :reverse ]\n sorted = sort( table, ordering, column )\n if reverse, do: Enum.reverse( sorted ), else: sorted\n end\n\n defp sort( table, :lexicographic, column ) do\n Enum.sort_by( table, &elem( &1, column ) )\n end\n defp sort( table, :numeric, column ) do\n Enum.sort_by( table, &elem( &1, column ) |> String.to_integer )\n end\n\n def task do\n table = [ { \"123\", \"456\", \"0789\" },\n { \"456\", \"0789\", \"123\" },\n { \"0789\", \"123\", \"456\" } ]\n IO.write \"sort defaults \"; IO.inspect sort( table )\n IO.write \" & reverse \"; IO.inspect sort( table, reverse: true )\n IO.write \"sort column 2 \"; IO.inspect sort( table, column: 2)\n IO.write \" & reverse \"; IO.inspect sort( table, column: 2, reverse: true)\n IO.write \"sort numeric \"; IO.inspect sort( table, ordering: :numeric)\n IO.write \" & reverse \"; IO.inspect sort( table, ordering: :numeric, reverse: true)\n end\nend\n\nOptional_parameters.task\n","language":"Elixir"},{"code":"-module( optional_parameters ).\n\n-export( [sort/2, task/0] ).\n\nsort( Table, Options ) ->\n\tOrdering = proplists:get_value( ordering, Options, lexicographic ),\n\tColumn = proplists:get_value( column, Options, 1 ),\n\tIs_reverse = proplists:get_value( reverse, Options, false ),\n\tSorted = sort( Table, Ordering, Column ),\n\tsorted_reverse( Is_reverse, Sorted ).\n\ntask() ->\n\tio:fwrite( \"sort defaults ~p~n\", [sort( table(), [])] ),\n\tio:fwrite( \"reverse ~p~n\", [sort( table(), [reverse])] ),\n\tio:fwrite( \"sort column 3 ~p~n\", [sort( table(), [{column, 3}])] ),\n\tio:fwrite( \"reverse ~p~n\", [sort( table(), [{column, 3}, reverse])] ),\n\tio:fwrite( \"sort numeric ~p~n\", [sort( table(), [{ordering, numeric}])] ),\n\tio:fwrite( \"reverse ~p~n\", [sort( table(), [{ordering, numeric}, reverse])] ).\n\n\n\nrow_numeric( Tuple ) -> erlang:list_to_tuple( [{erlang:list_to_integer(X), X} || X <- erlang:tuple_to_list(Tuple)] ).\n\nrow_remove_numeric( Tuple ) -> erlang:list_to_tuple( [Y || {_X, Y} <- erlang:tuple_to_list(Tuple)] ).\n\nsort( Table, lexicographic, Column ) -> lists:keysort( Column, Table );\nsort( Table, numeric, Column ) ->\n\tNumeric_table = [row_numeric(X) || X <- Table],\n\tSorted_numeric = lists:keysort( Column, Numeric_table ),\n\t[row_remove_numeric(X) || X <- Sorted_numeric].\n\nsorted_reverse( true, Sorted ) -> lists:reverse( Sorted );\nsorted_reverse( false, Sorted ) -> Sorted.\n\ntable() -> [table_row1(), table_row2(), table_row3()].\n\ntable_row1() -> {\"123\", \"456\", \"0789\"}.\ntable_row2() -> {\"456\", \"0789\", \"123\"}.\ntable_row3() -> {\"0789\", \"123\", \"456\"}.\n","language":"Erlang"},{"code":"type Table(rows:string[][]) =\n // in-place sorting of rows\n member x.Sort(?ordering, ?column, ?reverse) =\n let ordering = defaultArg ordering compare\n let column = defaultArg column 0\n let reverse = defaultArg reverse false\n\n let factor = if reverse then -1 else 1\n let comparer (row1:string[]) (row2:string[]) =\n factor * ordering row1.[column] row2.[column]\n\n Array.sortInPlaceWith comparer rows\n\n member x.Print() =\n for row in rows do printfn \"%A\" row\n\n// Example usage\nlet t = new Table([| [|\"a\"; \"b\"; \"c\"|]\n [|\"\"; \"q\"; \"z\"|]\n [|\"can\"; \"z\"; \"a\"|] |])\n\nprintfn \"Unsorted\"; t.Print()\n\nt.Sort()\nprintfn \"Default sort\"; t.Print()\n\nt.Sort(column=2)\nprintfn \"Sorted by col. 2\"; t.Print()\n\nt.Sort(column=1)\nprintfn \"Sorted by col. 1\"; t.Print()\n\nt.Sort(column=1, reverse=true)\nprintfn \"Reverse sorted by col. 1\"; t.Print()\n\nt.Sort(ordering=fun s1 s2 -> compare s2.Length s1.Length)\nprintfn \"Sorted by decreasing length\"; t.Print()\n","language":"F-Sharp"},{"code":"USING: accessors combinators io kernel math.order prettyprint\nsequences sorting ;\n\nTUPLE: table-sorter\n data\n { column initial: 0 }\n reversed?\n { ordering initial: [ ] } ;\n\n: <table-sorter> ( -- obj ) table-sorter new ;\n\n: sort-table ( table-sorter -- matrix )\n {\n [ data>> ]\n [ column>> [ swap nth ] curry ]\n [ ordering>> compose ]\n [ reversed?>> [ >=< ] [ <=> ] ? [ bi@ ] prepose curry ]\n } cleave [ sort ] curry call( x -- x ) ;\n\n\n! ===== Now we can use the interface defined above =====\n\nCONSTANT: table\n { { \"a\" \"b\" \"c\" } { \"\" \"q\" \"z\" } { \"can\" \"z\" \"a\" } }\n\n\"Unsorted\" print\ntable simple-table.\n\n\"Default sort\" print\n<table-sorter>\n table >>data\nsort-table simple-table.\n\n\"Sorted by col 2\" print\n<table-sorter>\n table >>data\n 2 >>column\nsort-table simple-table.\n\n\"Sorted by col 1\" print\n<table-sorter>\n table >>data\n 1 >>column\nsort-table simple-table.\n\n\"Reverse sorted by col 1\" print\n<table-sorter>\n table >>data\n 1 >>column\n t >>reversed?\nsort-table simple-table.\n\n\"Sorted by decreasing length\" print\n<table-sorter>\n table >>data\n t >>reversed?\n [ length ] >>ordering\nsort-table simple-table.\n","language":"Factor"},{"code":"module ExampleOptionalParameter\n ! use any module needed for the sort function(s)\n ! and all the interfaces needed to make the code work\n implicit none\ncontains\n\n subroutine sort_table(table, ordering, column, reverse)\n type(table_type), intent(inout) :: table\n integer, optional :: column\n logical, optional :: reverse\n optional :: ordering\n interface\n integer function ordering(a, b)\n type(table_element), intent(in) :: a, b\n end function ordering\n end interface\n\n integer :: the_column, i\n logical :: reversing\n type(table_row) :: rowA, rowB\n\n if ( present(column) ) then\n if ( column > get_num_of_columns(table) ) then\n ! raise an error?\n else\n the_column = column\n end if\n else\n the_column = 1 ! a default value, de facto\n end if\n\n reversing = .false. ! default value\n if ( present(reverse) ) reversing = reverse\n\n do\n ! loops over the rows to sort... at some point, we need\n ! comparing an element (cell) of the row, with the element\n ! in another row; ... let us suppose rowA and rowB are\n ! the two rows we are considering\n ea = get_element(rowA, the_column)\n eb = get_element(rowB, the_column)\n if ( present(ordering) ) then\n if ( .not. reversing ) then\n if ( ordering(ea, eb) > 0 ) then\n ! swap the rowA with the rowB\n end if\n else ! < instead of >\n if ( ordering(ea, eb) < 0 ) then\n ! swap the rowA with the rowB\n end if\n end if\n else\n if ( .not. reversing ) then\n if ( lexinternal(ea, eb) > 0 ) then\n ! swap the rowA with the rowB\n end if\n else ! < instead of >\n if ( lexinternal(ea, eb) < 0 ) then\n ! swap the rowA with the rowB\n end if\n end if\n end if\n ! ... more of the sorting algo ...\n ! ... and rows traversing ... (and an exit condition of course!)\n end do\n\n end subroutine sort_table\n\nend module ExampleOptionalParameter\n","language":"Fortran"},{"code":"program UsingTest\n use ExampleOptionalParameter\n implicit none\n\n type(table_type) :: table\n\n ! create the table...\n\n ! sorting taking from column 1, not reversed, using internal\n ! default comparator\n call sort_table(table)\n\n ! the same as above, but in reversed order; we MUST specify\n ! the name of the argument since it is not given in the same\n ! order of the subroutine spec\n call sort_table(table, reverse=.true.)\n\n ! sort the table using a custom comparator\n call sort_table(table, my_cmp)\n ! or\n call sort_table(table, ordering=my_cmp)\n\n ! as above, but taking from column 2\n call sort_table(table, my_cmp, 2)\n ! or (swapping the order of args for fun)\n call sort_table(table, column=2, ordering=my_cmp)\n\n ! with custom comparator, column 2 and reversing...\n call sort_table(table, my_cmp, 2, .true.)\n ! of course we can swap the order of optional args\n ! by prefixing them with the name of the arg\n\n ! sort from column 2, with internal comparator\n call sort_table(table, column=2)\n\nend program UsingTest\n","language":"Fortran"},{"code":"Function power(n As Integer, p As Integer = 2) As Double\n\tReturn n ^ p\nEnd Function\n\nPrint power(2) ' muestra 4\nPrint power(2, 3) ' muestra 8\nSleep\n","language":"FreeBASIC"},{"code":"type cell string\n\ntype spec struct {\n less func(cell, cell) bool\n column int\n reverse bool\n}\n\nfunc newSpec() (s spec) {\n // initialize any defaults\n return\n}\n\n// sort with all defaults\nt.sort(newSpec())\n\n// reverse sort\ns := newSpec\ns.reverse = true\nt.sort(s)\n","language":"Go"},{"code":"type spec struct {\n ordering func(cell, cell) bool\n column int\n reverse bool\n}\n","language":"Go"},{"code":"spec{reverse: true}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sort\"\n)\n\ntype cell string\ntype row []cell\ntype table struct {\n rows []row\n column int\n less func(cell, cell) bool\n}\n\nfunc (c cell) String() string {\n return fmt.Sprintf(\"%q\", string(c))\n}\n\nfunc (t table) printRows(heading string) {\n fmt.Println(\"--\", heading)\n for _, row := range t.rows {\n fmt.Println(row)\n }\n fmt.Println()\n}\n\n// sort.Interface\nfunc (t table) Len() int { return len(t.rows) }\nfunc (t table) Swap(i, j int) { t.rows[i], t.rows[j] = t.rows[j], t.rows[i] }\nfunc (t table) Less(i, j int) bool {\n return t.less(t.rows[i][t.column], t.rows[j][t.column])\n}\n\n// struct implements named parameter-like capability\ntype spec struct {\n ordering func(cell, cell) bool\n column int\n reverse bool\n}\n\n\nfunc (t *table) sort(s spec) {\n // set up column and comparison function for sort\n t.column = s.column\n switch {\n case s.ordering != nil:\n t.less = s.ordering\n case s.reverse:\n t.less = func(a, b cell) bool { return a > b }\n default:\n t.less = func(a, b cell) bool { return a < b }\n }\n\n // sort\n sort.Sort(t)\n\n // reverse if necessary\n if s.ordering == nil || !s.reverse {\n return\n }\n last := len(t.rows) - 1\n for i := last / 2; i >= 0; i-- {\n t.rows[i], t.rows[last-i] = t.rows[last-i], t.rows[i]\n }\n}\n\nfunc main() {\n t := table{rows: []row{\n {\"pail\", \"food\"},\n {\"pillbox\", \"nurse maids\"},\n {\"suitcase\", \"airedales\"},\n {\"bathtub\", \"chocolate\"},\n {\"schooner\", \"ice cream sodas\"},\n }}\n\n t.printRows(\"song\")\n\n // no \"parameters\"\n t.sort(spec{})\n t.printRows(\"sorted on first column\")\n\n // \"named parameter\" reverse.\n t.sort(spec{reverse: true})\n t.printRows(\"reverse sorted on first column\")\n\n // \"named parameters\" column and ordering\n t.sort(spec{\n column: 1,\n ordering: func(a, b cell) bool { return len(a) > len(b) },\n })\n t.printRows(\"sorted by descending string length on second column\")\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sort\"\n)\n\ntype cell string\ntype row []cell\ntype table struct {\n rows []row\n column int\n less func(cell, cell) bool\n}\n\nfunc (c cell) String() string {\n return fmt.Sprintf(\"%q\", string(c))\n}\n\nfunc (t table) printRows(heading string) {\n fmt.Println(\"--\", heading)\n for _, row := range t.rows {\n fmt.Println(row)\n }\n fmt.Println()\n}\n\n// sort.Interface\nfunc (t table) Len() int { return len(t.rows) }\nfunc (t table) Swap(i, j int) { t.rows[i], t.rows[j] = t.rows[j], t.rows[i] }\nfunc (t table) Less(i, j int) bool {\n return t.less(t.rows[i][t.column], t.rows[j][t.column])\n}\n\n// struct implements named parameter-like capability\ntype spec struct {\n ordering func(cell, cell) bool\n column int\n reverse bool\n}\n\n// A defined option type is not really needed by the technique, but has\n// a nice advantage for documentation. If this type is exported, then\n// the the Go documentation tool go doc will organize all of the option\n// functions together under the type. (Go doc will see them as constructors\n// for the type.)\ntype Option func(*spec)\n\nfunc ordering(o func(cell, cell) bool) Option {\n return func(s *spec) { s.ordering = o }\n}\n\nfunc column(c int) Option {\n return func(s *spec) { s.column = c }\n}\n\nfunc reverse() Option {\n return func(s *spec) { s.reverse = true }\n}\n\nfunc (t *table) sort(options ...Option) {\n var s spec\n for _, o := range options {\n o(&s)\n }\n // set up column and comparison function for sort\n t.column = s.column\n switch {\n case s.ordering != nil:\n t.less = s.ordering\n case s.reverse:\n t.less = func(a, b cell) bool { return a > b }\n default:\n t.less = func(a, b cell) bool { return a < b }\n }\n\n // sort\n sort.Sort(t)\n\n // reverse if necessary\n if s.ordering == nil || !s.reverse {\n return\n }\n last := len(t.rows) - 1\n for i := last / 2; i >= 0; i-- {\n t.rows[i], t.rows[last-i] = t.rows[last-i], t.rows[i]\n }\n}\n\nfunc main() {\n t := table{rows: []row{\n {\"pail\", \"food\"},\n {\"pillbox\", \"nurse maids\"},\n {\"suitcase\", \"airedales\"},\n {\"bathtub\", \"chocolate\"},\n {\"schooner\", \"ice cream sodas\"},\n }}\n\n t.printRows(\"song\")\n // no parameters\n t.sort()\n t.printRows(\"sorted on first column\")\n\n // \"named parameter\" reverse.\n t.sort(reverse())\n t.printRows(\"reverse sorted on first column\")\n\n // \"named parameters\" column and ordering\n byLen := func(a, b cell) bool { return len(a) > len(b) }\n t.sort(column(1), ordering(byLen))\n t.printRows(\"sorted by descending string length on second column\")\n}\n","language":"Go"},{"code":"def orderedSort(Collection table, column = 0, reverse = false, ordering = {x, y -> x <=> y } as Comparator) {\n table.sort(false) { x, y -> (reverse ? -1 : 1) * ordering.compare(x[column], y[column])}\n}\n","language":"Groovy"},{"code":"def table = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\n\nassert orderedSort(table) == [['', 'q', 'z'], ['a', 'b', 'c'], ['zap', 'zip', 'Zot']]\nassert orderedSort(table, 2) == [['zap', 'zip', 'Zot'], ['a', 'b', 'c'], ['', 'q', 'z']]\nassert orderedSort(table, 1) == [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\nassert orderedSort(table, 1, true) == [['zap', 'zip', 'Zot'],['', 'q', 'z'],['a', 'b', 'c']]\nassert orderedSort(table, 0, false, {x, y -> y?.size() <=> x?.size()} as Comparator) == [['zap', 'zip', 'Zot'],['a', 'b', 'c'],['', 'q', 'z']]\n","language":"Groovy"},{"code":"Collection.metaClass.orderedSort = { params ->\n def column = params?.column ?: 0\n def reverse = params?.reverse ?: false\n def ordering = params?.ordering ?: {x, y -> x <=> y } as Comparator\n\n table.sort(false) { x, y -> (reverse ? -1 : 1) * ordering.compare(x[column], y[column])}\n}\n","language":"Groovy"},{"code":"def table = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\n\nassert table.orderedSort() == [['', 'q', 'z'], ['a', 'b', 'c'], ['zap', 'zip', 'Zot']]\nassert table.orderedSort(column: 2) == [['zap', 'zip', 'Zot'], ['a', 'b', 'c'], ['', 'q', 'z']]\nassert table.orderedSort(column: 1) == [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\nassert table.orderedSort(column: 1, reverse: true) == [['zap', 'zip', 'Zot'],['', 'q', 'z'],['a', 'b', 'c']]\nassert table.orderedSort(ordering: {x, y -> y?.size() <=> x?.size()} as Comparator) == [['zap', 'zip', 'Zot'],['a', 'b', 'c'],['', 'q', 'z']]\n","language":"Groovy"},{"code":"{-# LANGUAGE RecordWildCards #-}\n\ndata SorterArgs = SorterArgs { cmp :: String, col :: Int, rev :: Bool } deriving Show\ndefSortArgs = SorterArgs \"lex\" 0 False\n\n\nsorter :: SorterArgs -> [[String]] -> [[String]]\nsorter (SorterArgs{..}) = case cmp of\n _ -> undefined\n\nmain = do\n sorter defSortArgs{cmp = \"foo\", col=1, rev=True} [[]]\n sorter defSortArgs{cmp = \"foo\"} [[]]\n sorter defSortArgs [[]]\n return ()\n","language":"Haskell"},{"code":"import Data.Maybe (fromMaybe)\n-- Use fromMaybe as an operator because its prettier\n(//) = flip fromMaybe\n\nsorter :: Maybe String -> Maybe Int -> Maybe Bool -> [[String]] -> [[String]]\nsorter ((// \"lex\") -> cmp)\n ((// 0) -> col)\n ((// False) -> rev) = undefined\n\nmain = do\n sorter (Just \"foo\") (Just 1) (Just True)\n sorter Nothing Nothing Nothing\n","language":"Haskell"},{"code":"procedure main()\n X := [ [1,2,3], [2,3,1], [3,1,2]) # A list of lists\n Sort(X) # vanilla sort\n Sort(X,\"ordering\",\"numeric\",\"column\",2,\"reverse\") # using optional parameters\nend\n\nprocedure Sort(X,A[]) # A[] provides for a variable number of arguments\n while a := get(A) do {\n case a of {\n \"ordering\" : op := case get(A) | runerr(205,a) of {\n \"lexicographic\"|\"string\": \"<<\"\n \"numeric\": \"<\"\n default: runerr(205,op)\n }\n \"column\" : col := 0 < integer(col := get(A)) | runerr(205,col)\n \"reverse\" : reverseorder := reverse\n default: runerr(205,a)\n }\n return (\\reverseorder|1)(bubblesortf(X,\\c|1,\\op|\"<<\")) # reverse or return the sorted list\nend\n","language":"Icon"},{"code":"srtbl=: verb define\n '' srtbl y\n:\n '`ordering column reverse'=. x , (#x)}. ]`0:`0:\n |.^:reverse y /: ordering (column {\"1 ])y\n)\n","language":"J"},{"code":" ]Table=: ('a';'b';'c'),('';'q';'z'),:'zip';'zap';'Zot'\n┌───┬───┬───┐\n│a │b │c │\n├───┼───┼───┤\n│ │q │z │\n├───┼───┼───┤\n│zip│zap│Zot│\n└───┴───┴───┘\n srtbl Table NB. default sort\n┌───┬───┬───┐\n│ │q │z │\n├───┼───┼───┤\n│a │b │c │\n├───┼───┼───┤\n│zip│zap│Zot│\n└───┴───┴───┘\n ]`1: srtbl Table NB. sort by column 1\n┌───┬───┬───┐\n│a │b │c │\n├───┼───┼───┤\n│ │q │z │\n├───┼───┼───┤\n│zip│zap│Zot│\n└───┴───┴───┘\n ]`2:`1: srtbl Table NB. reverse sort by column 2\n┌───┬───┬───┐\n│zip│zap│Zot│\n├───┼───┼───┤\n│ │q │z │\n├───┼───┼───┤\n│a │b │c │\n└───┴───┴───┘\n #&>`0: srtbl Table NB. sort by length\n┌───┬───┬───┐\n│ │q │z │\n├───┼───┼───┤\n│a │b │c │\n├───┼───┼───┤\n│zip│zap│Zot│\n└───┴───┴───┘\n","language":"J"},{"code":"import java.util.*;\n\npublic class OptionalParams {\n // \"natural ordering\" comparator\n static <T extends Comparable<? super T>> Comparator<T> naturalOrdering() {\n return Collections.reverseOrder(Collections.<T>reverseOrder());\n }\n\n public static <T extends Comparable<? super T>> void\n sortTable(T[][] table) {\n sortTable(table, 0);\n }\n public static <T extends Comparable<? super T>> void\n sortTable(T[][] table,\n int column) {\n sortTable(table, column, false);\n }\n public static <T extends Comparable<? super T>> void\n sortTable(T[][] table,\n int column, boolean reverse) {\n sortTable(table, column, reverse, OptionalParams.<T>naturalOrdering());\n }\n public static <T> void sortTable(T[][] table,\n final int column,\n final boolean reverse,\n final Comparator<T> ordering) {\n Comparator<T[]> myCmp = new Comparator<T[]>() {\n public int compare(T[] x, T[] y) {\n return (reverse ? -1 : 1) *\n ordering.compare(x[column], y[column]);\n }\n };\n Arrays.sort(table, myCmp);\n }\n\n public static void main(String[] args) {\n String[][] data0 = {{\"a\", \"b\", \"c\"},\n {\"\", \"q\", \"z\"},\n {\"zap\", \"zip\", \"Zot\"}};\n System.out.println(Arrays.deepToString(data0));\n // prints: [[a, b, c], [, q, z], [zap, zip, Zot]]\n\n // we copy it so that we don't change the original copy\n String[][] data = data0.clone();\n sortTable(data);\n System.out.println(Arrays.deepToString(data));\n // prints: [[, q, z], [a, b, c], [zap, zip, Zot]]\n\n data = data0.clone();\n sortTable(data, 2);\n System.out.println(Arrays.deepToString(data));\n // prints: [[zap, zip, Zot], [a, b, c], [, q, z]]\n\n data = data0.clone();\n sortTable(data, 1);\n System.out.println(Arrays.deepToString(data));\n // prints: [[a, b, c], [, q, z], [zap, zip, Zot]]\n\n data = data0.clone();\n sortTable(data, 1, true);\n System.out.println(Arrays.deepToString(data));\n // prints: [[zap, zip, Zot], [, q, z], [a, b, c]]\n\n data = data0.clone();\n sortTable(data, 0, false, new Comparator<String>() {\n public int compare(String a, String b) {\n return b.length() - a.length();\n }\n });\n System.out.println(Arrays.deepToString(data));\n // prints: [[zap, zip, Zot], [a, b, c], [, q, z]]\n }\n}\n","language":"Java"},{"code":"function sorter(table, options) {\n opts = {}\n opts.ordering = options.ordering || 'lexicographic';\n opts.column = options.column || 0;\n opts.reverse = options.reverse || false;\n\n // ...\n}\n\nsorter(the_data, {reverse: true, ordering: 'numeric'});\n","language":"JavaScript"},{"code":"def bar: 2 *.;\n\ndef foo: {\"a\": bar};\n","language":"Jq"},{"code":"def less_than_or_equal: .[0] <= .[1];\n","language":"Jq"},{"code":"def sorter(options):\n sort_table( if (options|has(\"ordering\")) then options.ordering\n else less_than_or_equal\n end;\n options.column or 0;\n options.reverse or false );\n\n# If jq > 1.4 is being used, we may also define:\ndef sorter: sorter({});\n","language":"Jq"},{"code":"[1,2] | sorter({ \"reverse\": true, \"ordering\": less_than_or_equal } )\n\n[1,2] | sorter({ \"reverse\": true })\n\n# If sorter/0 has also been defined:\n[1,2] | sorter\n","language":"Jq"},{"code":"sorttable(T; ordering=<, column=1, reverse=false) =\n sort(T, by = t -> t[column], lt = reverse ? (a,b) -> ordering(b,a) : ordering)\nsorttable(T, ordering=<, column=1, reverse=false) =\n sorttable(T, ordering=ordering, column=column, reverse=reverse)\n","language":"Julia"},{"code":"julia> data = {[\"a\", \"b\", \"c\"], [\"\", \"q\", \"z\"], [\"zap\", \"zip\", \"Zot\"]}\n3-element Array{Any,1}:\n [\"a\",\"b\",\"c\"]\n [\"\",\"q\",\"z\"]\n [\"zap\",\"zip\",\"Zot\"]\n\njulia> sorttable(data, column=2, reverse=true) # named arguments\n3-element Array{Any,1}:\n [\"zap\",\"zip\",\"Zot\"]\n [\"\",\"q\",\"z\"]\n [\"a\",\"b\",\"c\"]\n\njulia> sorttable(data, >, 2) # the same thing, with positional arguments\n3-element Array{Any,1}:\n [\"zap\",\"zip\",\"Zot\"]\n [\"\",\"q\",\"z\"]\n [\"a\",\"b\",\"c\"]\n","language":"Julia"},{"code":"include ..\\Utilitys.tlhy\n\n:mypower\n 1 tolist flatten len\n 1 equal\n ( [pop drop 2]\n [pop pop drop]\n ) if\n power\n;\n\n\"2 ^2 = \" print 2 mypower ?\n\"2 ^3 = \" print ( 2 3 ) mypower ?\n\n\"End \" input\n","language":"Klingphix"},{"code":"// version 1.1.51\n\ntypealias Table = List<List<String>>\n\n/* Note that if ordering is specified, first two parameters are ignored */\nfun Table.sort(\n column: Int = 0,\n reverse: Boolean = false,\n ordering: Comparator<List<String>> =\n if (!reverse) compareBy { it[column] }\n else compareByDescending { it[column] }\n) = this.sortedWith(ordering)\n\nfun Table.print(title: String) {\n println(title)\n for (i in 0 until this.size) {\n for (j in 0 until this[0].size) System.out.print(\"%-3s \".format(this[i][j]))\n println()\n }\n println()\n}\n\nfun main(args: Array<String>) {\n val table = listOf(\n listOf(\"a\", \"b\", \"c\"),\n listOf(\"\", \"q\", \"z\"),\n listOf(\"zap\", \"zip\", \"Zot\")\n )\n table.print(\"Original:\")\n\n val titles = listOf(\n \"Sorted by col 0:\", \"Sorted by col 1:\", \"Sorted by col 2:\",\n \"Reverse sorted by col 0:\", \"Reverse sorted by col 1:\", \"Reverse Sorted by col 2\"\n )\n val params = listOf(\n 0 to false, 1 to false, 2 to false, 0 to true, 1 to true, 2 to true\n )\n for ((i, title) in titles.withIndex()) {\n val table2 = table.sort(params[i].first, params[i].second)\n table2.print(title)\n }\n // using non-default Comparator (case insensitive by col 2, reversed)\n val comp: Comparator<List<String>> = compareByDescending { it[2].toLowerCase() }\n val table3 = table.sort(ordering = comp)\n table3.print(\"Reverse case insensitive sort by col 2:\")\n}\n","language":"Kotlin"},{"code":"define sortarray( // params are set by position\n\titems::array, // required param\n\tordering::string\t= 'lexicographic', // optional param\n\tcolumn::integer\t\t= 1,\n\treverse::boolean\t= false\n) => {\n\t// sorting process\n\tlocal(sorteditems = array)\n\t// Lasso has no build in method to sort an array of arrays by position in the contained arrays\n\t// But a method could be built for it\n\treturn #sorteditems\n}\n\ndefine sortarray(\n\t-items::array, // required param\n\t-ordering::string\t= 'lexicographic', // optional param\n\t-column::integer\t= 1,\n\t-reverse::boolean\t= false\n) => sortarray(#items, #ordering, #column, #reverse)\n\nlocal(items = array(\n\tarray(10, 'red', 'Volvo'),\n\tarray(15, 'gren', 'Ford'),\n\tarray(48, 'yellow', 'Kia'),\n\tarray(12, 'black', 'Holden'),\n\tarray(19, 'brown', 'Fiat'),\n\tarray(8, 'pink', 'Batmobile'),\n\tarray(74, 'orange', 'Bicycle')\n))\n\nsortarray(-items = #items, -reverse)\n\nsortarray(#items)\n","language":"Lasso"},{"code":"to sort :table [:column 1] [:ordering \"before?] [:reverse \"false]\n ; ...\nend\n","language":"Logo"},{"code":"sort :table\n(sort :table 2)\n(sort :table 3 \"less? \"true)\n","language":"Logo"},{"code":"function showTable(tbl)\n\tif type(tbl)=='table' then\n\t\tlocal result = {}\n\t\tfor _, val in pairs(tbl) do\n\t\t\ttable.insert(result, showTable(val))\n\t\tend\n\t\treturn '{' .. table.concat(result, ', ') .. '}'\n\telse\n\t\treturn (tostring(tbl))\n\tend\nend\n\nfunction sortTable(op)\n\tlocal tbl = op.table or {}\n\tlocal column = op.column or 1\n\tlocal reverse = op.reverse or false\n\tlocal cmp = op.cmp or (function (a, b) return a < b end)\n\tlocal compareTables = function (a, b)\n\t\tlocal result = cmp(a[column], b[column])\n\t\tif reverse then return not result else return result end\n\tend\n\ttable.sort(tbl, compareTables)\nend\n\nA = {{\"quail\", \"deer\", \"snake\"},\n\t{\"dalmation\", \"bear\", \"fox\"},\n\t{\"ant\", \"cougar\", \"coyote\"}}\nprint('original', showTable(A))\n\nsortTable{table=A}\nprint('defaults', showTable(A))\n\nsortTable{table=A, column=2}\nprint('col 2 ', showTable(A))\n\nsortTable{table=A, column=3}\nprint('col 3 ', showTable(A))\n\nsortTable{table=A, column=3, reverse=true}\nprint('col 3 rev', showTable(A))\n\nsortTable{table=A, cmp=(function (a, b) return #a < #b end)}\nprint('by length', showTable(A))\n","language":"Lua"},{"code":"OptionalSort := proc(input, {\n ordering :: Or(procedures,identical(\"lexicographic\")) := \"lexicographic\",\n column :: posint := 1,\n reverse :: truefalse := false\n} )\n local compare;\n if ordering = \"lexicographic\" then\n compare := (x,y)->evalb(`if`(reverse,x[column]>=y[column],x[column]<=y[column]));\n else\n \tcompare := (x,y)->`if`(reverse,ordering(x[column],y),ordering(y,x));\n end if;\n sort( input, compare );\nend proc:\n","language":"Maple"},{"code":"> L := [[1, 2], [3, 4], [-5, 7]]:\n> OptionalSort(L);\n [[-5, 7], [1, 2], [3, 4]]\n> OptionalSort(L, reverse);\n [[3, 4], [1, 2], [-5, 7]]\n> OptionalSort(L, reverse, column = 2);\n [[-5, 7], [3, 4], [1, 2]]\n","language":"Maple"},{"code":"Options[OptionalSort]={ordering->lexicographic,column->1,reverse-> False};\nOptionalSort[x_List,OptionsPattern[]]:=If[OptionValue[reverse]==True,\nSortBy[x ,#[[OptionValue[column]]]&]//Reverse,\nSortBy[x,#[[OptionValue[column]]]&] ]\n\nOptionalSort[{{\"a\" ,\"b\", \"c\"}, {\"\", \"q\", \"z\"},{\"zap\" ,\"zip\", \"Zot\"}} ]\n->{{,q,z},{a,b,c},{zap,zip,Zot}}\n\nOptionalSort[{{\"a\" ,\"b\", \"c\"}, {\"\", \"q\", \"z\"},{\"zap\" ,\"zip\", \"Zot\"}},{ordering->lexicographic,column->2,reverse-> True} ]\n->{{zap,zip,Zot},{,q,z},{a,b,c}}\n","language":"Mathematica"},{"code":"Sorter (table : list[list[string]], ordering = \"lexicographic\", column = 0, reverse = false) : list[list[string]]\n{\n // implementation goes here\n}\n","language":"Nemerle"},{"code":"import algorithm, strutils, sugar\n\nproc printTable(a: seq[seq[string]]) =\n for row in a:\n for x in row: stdout.write x, repeat(' ', 4 - x.len)\n echo \"\"\n echo \"\"\n\nproc sortTable(a: seq[seq[string]], column = 0, reverse = false,\n ordering: (proc(a,b: string): int) = system.cmp) : seq[seq[string]] =\n let order = if reverse: Descending else: Ascending\n result = a\n result.sort(proc(x,y:seq[string]):int = ordering(x[column],y[column]), order)\n\nconst data = @[@[\"a\", \"b\", \"c\"], @[\"\", \"q\", \"z\"], @[\"zap\", \"zip\", \"Zot\"]]\n\nprintTable data\nprintTable sortTable(data)\nprintTable sortTable(data, column = 2)\nprintTable sortTable(data, column = 1)\nprintTable sortTable(data, column = 1, reverse = true)\nprintTable sortTable(data, ordering = (a,b) => cmp[int](b.len,a.len))\n","language":"Nim"},{"code":"typedef enum { kOrdNone, kOrdLex, kOrdByAddress, kOrdNumeric } SortOrder;\n\n@interface MyArray : NSObject {}\n// . . .\n@end\n\n@implementation MyArray\n\n- (void)sort {\n [self sortWithOrdering:kOrdLex onColumn:0 reversed:NO];\n}\n\n- (void)sortWithOrdering:(SortOrder)ord {\n [self sortWithOrdering:ord onColumn:0 reversed:NO];\n}\n\n- (void)sortWithOrdering:(SortOrder)ord onColumn:(int)col {\n [self sortWithOrdering:ord onColumn:col reversed:NO];\n}\n\n- (void)sortWithOrdering:(SortOrder)ord onColumn:(int)col reversed:(BOOL)rev {\n // . . . Actual sort goes here . . .\n}\n\n@end\n","language":"Objective-C"},{"code":"let sort_table ?(ordering = compare) ?(column = 0) ?(reverse = false) table =\n let cmp x y = ordering (List.nth x column) (List.nth y column) * (if reverse then -1 else 1) in\n List.sort cmp table\n","language":"OCaml"},{"code":"# let data = [[\"a\"; \"b\"; \"c\"]; [\"\"; \"q\"; \"z\"]; [\"zap\"; \"zip\"; \"Zot\"]];;\nval data : string list list =\n [[\"a\"; \"b\"; \"c\"]; [\"\"; \"q\"; \"z\"]; [\"zap\"; \"zip\"; \"Zot\"]]\n# sort_table data;;\n- : string list list =\n[[\"\"; \"q\"; \"z\"]; [\"a\"; \"b\"; \"c\"]; [\"zap\"; \"zip\"; \"Zot\"]]\n# sort_table ~column:2 data;;\n- : string list list =\n[[\"zap\"; \"zip\"; \"Zot\"]; [\"a\"; \"b\"; \"c\"]; [\"\"; \"q\"; \"z\"]]\n# sort_table ~column:1 data;;\n- : string list list =\n[[\"a\"; \"b\"; \"c\"]; [\"\"; \"q\"; \"z\"]; [\"zap\"; \"zip\"; \"Zot\"]]\n# sort_table ~column:1 ~reverse:true data;;\n- : string list list =\n[[\"zap\"; \"zip\"; \"Zot\"]; [\"\"; \"q\"; \"z\"]; [\"a\"; \"b\"; \"c\"]]\n# sort_table ~ordering:(fun a b -> compare (String.length b) (String.length a)) data;;\n- : string list list =\n[[\"zap\"; \"zip\"; \"Zot\"]; [\"a\"; \"b\"; \"c\"]; [\"\"; \"q\"; \"z\"]]\n","language":"OCaml"},{"code":"declare\n class Table\n attr\n rows\n\n meth init(Rows)\n rows := Rows\n end\n\n meth sort(ordering:O<=Lexicographic column:C<=1 reverse:R<=false)\n fun {Predicate Row1 Row2}\n Res = {O {Nth Row1 C} {Nth Row2 C}}\n in\n if R then {Not Res} else Res end\n end\n in\n rows := {Sort @rows Predicate}\n end\n end\n\n fun {Lexicographic As Bs} %% omitted for brevity\n end\n\n T = {New Table init([[\"a\" \"b\" \"c\"] [\"\" \"q\" \"z\"] [\"zap\" \"zip\" \"Zot\"]])}\nin\n {T sort}\n {T sort(column:3)}\n {T sort(column:2)}\n {T sort(column:2 reverse:true)}\n {T sort(ordering:fun {$ A B} {Length B} < {Length A} end)}\n","language":"Oz"},{"code":"sort(v, ordering=0, column=0, reverse=0)\n","language":"PARI-GP"},{"code":"/*\nGP;install(\"test_func\", \"vDG\", \"test\", \"path/to/test.gp.so\");\n*/\nvoid\ntest_func(GEN x) {\n if (x == NULL)\n pari_printf(\"Argument omitted.\\n\");\n else\n pari_printf(\"Argument was: %Ps\\n\", x);\n}\n","language":"PARI-GP"},{"code":"sub sorttable\n {my @table = @{shift()};\n my %opt =\n (ordering => sub {$_[0] cmp $_[1]}, column => 0, reverse => 0, @_);\n my $col = $opt{column};\n my $func = $opt{ordering};\n my @result = sort\n {$func->($a->[$col], $b->[$col])}\n @table;\n return ($opt{reverse} ? [reverse @result] : \\@result);}\n","language":"Perl"},{"code":"my $a = [[\"a\", \"b\", \"c\"], [\"\", \"q\", \"z\"], [\"zap\", \"zip\", \"Zot\"]];\nforeach (@{sorttable $a, column => 1, reverse => 1})\n {foreach (@$_)\n {printf \"%-5s\", $_;}\n print \"\\n\";}\n","language":"Perl"},{"code":"-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">increment</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">inc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">inc</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">increment</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- shows 6</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">increment</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- shows 7</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d records sorted in %3.2s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">records</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"-->\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sortcol</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">sortdir</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">by_column</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">sortdir</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">compare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">sortcol</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">sortcol</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tags</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">table_size</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- {1,2,..table_size}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">click_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">self</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">pStatus</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">...</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">sortc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"SORTSIGN%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sortdir</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">IupGetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">self</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sortc</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #008000;\">\"DOWN\"</span><span style=\"color: #0000FF;\">?-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">self</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sortc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sortdir</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"UP\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"DOWN\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">sortcol</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #000000;\">tags</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">custom_sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">routine_id</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"by_column\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">tags</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">value_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*self*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tags</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n<!--\n","language":"Phix"},{"code":"def mypower\n\t1 tolist flatten len\n\t1 == if\n\t\t1 get 2\n\telse\n\t\t2 get swap 1 get rot\n\tendif\n\tpower\n\tnip\nenddef\n\n\"2 ^2 = \" print 2 mypower print nl\n\"2 ^3 = \" print 2 3 2 tolist mypower print\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\ndef mypower\n\t1 tolist flatten len\n\t1 == if\n\t\tpop drop 2\n\telse\n\t\tpop pop drop\n\tendif\n\tpower\nenddef\n\n\"2 ^2: \" print 2 mypower ?\n\"2 ^3: \" print ( 2 3 ) mypower ?\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\n( ( \"a\" \"b\" \"c\" )\n ( \"\" \"q\" \"z\" )\n ( \"zap\" \"zip\" \"Zot\" ) )\n\n\ndef mysort /# column reverse #/\n len >ps\n tps 0 == if drop ( 1 false ) endif\n ps> 1 == if false 0 put endif\n pop swap >ps pop drop swap\n len for var i\n i get\n tps extract swap 1 put\n i set\n endfor\n sort\n swap if reverse endif\n len for var i\n i get\n pop swap tps put\n i set\n endfor\n ps> drop\nenddef\n\npstack\n( ) mysort pstack\n( 3 ) mysort pstack\n( 2 ) mysort pstack\n( 2 true ) mysort pstack\n","language":"Phixmonti"},{"code":"(de sortTable (Tbl . @)\n (let (Ordering prog Column 1 Reverse NIL) # Set defaults\n (bind (rest) # Bind optional params\n (setq Tbl\n (by '((L) (Ordering (get L Column)))\n sort\n Tbl ) )\n (if Reverse (flip Tbl) Tbl) ) ) )\n","language":"PicoLisp"},{"code":">>> def printtable(data):\n for row in data:\n print ' '.join('%-5s' % ('\"%s\"' % cell) for cell in row)\n\n\n>>> import operator\n>>> def sorttable(table, ordering=None, column=0, reverse=False):\n return sorted(table, cmp=ordering, key=operator.itemgetter(column), reverse=reverse)\n\n>>> data = [[\"a\", \"b\", \"c\"], [\"\", \"q\", \"z\"], [\"zap\", \"zip\", \"Zot\"]]\n>>> printtable(data)\n\"a\" \"b\" \"c\"\n\"\" \"q\" \"z\"\n\"zap\" \"zip\" \"Zot\"\n>>> printtable( sorttable(data) )\n\"\" \"q\" \"z\"\n\"a\" \"b\" \"c\"\n\"zap\" \"zip\" \"Zot\"\n>>> printtable( sorttable(data, column=2) )\n\"zap\" \"zip\" \"Zot\"\n\"a\" \"b\" \"c\"\n\"\" \"q\" \"z\"\n>>> printtable( sorttable(data, column=1) )\n\"a\" \"b\" \"c\"\n\"\" \"q\" \"z\"\n\"zap\" \"zip\" \"Zot\"\n>>> printtable( sorttable(data, column=1, reverse=True) )\n\"zap\" \"zip\" \"Zot\"\n\"\" \"q\" \"z\"\n\"a\" \"b\" \"c\"\n>>> printtable( sorttable(data, ordering=lambda a,b: cmp(len(b),len(a))) )\n\"zap\" \"zip\" \"Zot\"\n\"a\" \"b\" \"c\"\n\"\" \"q\" \"z\"\n>>>\n","language":"Python"},{"code":"tablesort <- function(x, ordering=\"lexicographic\", column=1, reverse=false)\n{\n # Implementation\n}\n\n# Usage is e.g.\ntablesort(mytable, column=3)\n","language":"R"},{"code":"#lang racket\n\n(define (sort-table table\n [ordering string<=?]\n [column 0]\n [reverse? #f])\n (sort table (if reverse?\n (negate ordering)\n ordering)\n #:key (λ (row) (list-ref row column))))\n","language":"Racket"},{"code":"method sorttable(:$column = 0, :$reverse, :&ordering = &infix:<cmp>) {\n my @result = self»[$column].sort: &ordering;\n return $reverse ?? @result.reverse !! @result;\n}\n","language":"Raku"},{"code":"method sorttable-pos($column = 0, $reverse?, &ordering = &infix:<cmp>) {\n my @result = self»[$column].sort: &ordering;\n return $reverse ?? @result.reverse !! @result;\n}\n","language":"Raku"},{"code":"sortStrings: procedure expose @. /*the stemmed array is named: @. */\ncol= 1 /*set some defaults (here and below). */\nreverse= 'NO'\norder= 'LEXICOGRAPHIC'\narg options /*obtain the options (in uppercase). */\n do j=1 for words(options) /*examine all the words (options). */\n x= word(options, j)\n select\n when datatype(x, 'W') then col= x / 1 /*normalize the number. */\n when pos('=', x)==0 then order= x /*has it an equal sign? */\n otherwise parse var x nam '=' value /*get value.*/\n end /*select*/\n end /*j*/\n\n /*╔═══════════════════════════════════════════════════════════╗\n ║ check for errors here: COL isn't a positive integer ···, ║\n ║ REVERSE value isn't NO or YES, ║\n ║ ORDER value is recognized ··· ║\n ╚═══════════════════════════════════════════════════════════╝*/\n\n ... main body of string sort here ...\n\nreturn /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"/*REXX example uses the SortStrings subroutine with some (passed) optional arguments. */\n\n\n@.1= 'one'; @.2= \"two\"; @.3= 'three' /*define an array (@.) of strings here.*/\n\n\ncall sortStrings 'Reverse=no' 3\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"def table_sort(table, ordering=:<=>, column=0, reverse=false)\n # ...\n","language":"Ruby"},{"code":"def table_sort(table, ordering: :<=>, column: 0, reverse: false)\n p = ordering.to_proc\n if reverse\n table.sort {|a, b| p.(b[column], a[column])}\n else\n table.sort {|a, b| p.(a[column], b[column])}\n end\nend\n\n# Quick example:\ntable = [\n [\"Ottowa\", \"Canada\"],\n [\"Washington\", \"USA\"],\n [\"Mexico City\", \"Mexico\"],\n]\np table_sort(table, column: 1)\n","language":"Ruby"},{"code":"def table_sort(table, opts = {})\n defaults = {:ordering => :<=>, :column => 0, :reverse => false}\n opts = defaults.merge(opts)\n\n c = opts[:column]\n p = opts[:ordering].to_proc\n if opts[:reverse]\n table.sort {|a, b| p.call(b[c], a[c])}\n else\n table.sort {|a, b| p.call(a[c], b[c])}\n end\nend\n","language":"Ruby"},{"code":"use std::cmp::Ordering;\n\nstruct Table {\n rows: Vec<Vec<String>>,\n ordering_function: fn(&str, &str) -> Ordering,\n ordering_column: usize,\n reverse: bool,\n}\n\nimpl Table {\n fn new(rows: Vec<Vec<String>>) -> Table {\n Table {\n rows: rows,\n ordering_column: 0,\n reverse: false,\n ordering_function: |str1, str2| str1.cmp(str2),\n }\n }\n}\n\nimpl Table {\n fn with_ordering_column(&mut self, ordering_column: usize) -> &mut Table {\n self.ordering_column = ordering_column;\n self\n }\n\n fn with_reverse(&mut self, reverse: bool) -> &mut Table {\n self.reverse = reverse;\n self\n }\n\n fn with_ordering_fun(&mut self, compare: fn(&str, &str) -> Ordering) -> &mut Table {\n self.ordering_function = compare;\n self\n }\n\n fn sort(&mut self) {\n let fun = &mut self.ordering_function;\n let idx = self.ordering_column;\n if self.reverse {\n self.rows\n .sort_unstable_by(|vec1, vec2| (fun)(&vec1[idx], &vec2[idx]).reverse());\n } else {\n self.rows\n .sort_unstable_by(|vec1, vec2| (fun)(&vec1[idx], &vec2[idx]));\n }\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::Table;\n\n fn generate_test_table() -> Table {\n Table::new(vec![\n vec![\"0\".to_string(), \"fff\".to_string()],\n vec![\"2\".to_string(), \"aab\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n ])\n }\n\n #[test]\n fn test_simple_sort() {\n let mut table = generate_test_table();\n table.sort();\n assert_eq!(\n table.rows,\n vec![\n vec![\"0\".to_string(), \"fff\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n vec![\"2\".to_string(), \"aab\".to_string()],\n ],\n )\n }\n\n #[test]\n fn test_ordering_column() {\n let mut table = generate_test_table();\n table.with_ordering_column(1).sort();\n assert_eq!(\n table.rows,\n vec![\n vec![\"2\".to_string(), \"aab\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n vec![\"0\".to_string(), \"fff\".to_string()],\n ],\n )\n }\n\n #[test]\n fn test_with_reverse() {\n let mut table = generate_test_table();\n table.with_reverse(true).sort();\n assert_eq!(\n table.rows,\n vec![\n vec![\"2\".to_string(), \"aab\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n vec![\"0\".to_string(), \"fff\".to_string()],\n ],\n )\n }\n\n #[test]\n fn test_custom_ordering_fun() {\n let mut table = generate_test_table();\n // Simple ordering function that reverses stuff.\n // Should operate like the test before.\n table.with_ordering_fun(|x, y| x.cmp(y).reverse()).sort();\n assert_eq!(\n table.rows,\n vec![\n vec![\"2\".to_string(), \"aab\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n vec![\"0\".to_string(), \"fff\".to_string()],\n ],\n )\n }\n\n #[test]\n fn test_everything_together() {\n let mut table = generate_test_table();\n // Using the reversing cmp function, then reverse (= don't do anything)\n // then sort from column 1.\n table\n .with_ordering_fun(|x, y| x.cmp(y).reverse())\n .with_reverse(true)\n .with_ordering_column(1)\n .sort();\n assert_eq!(\n table.rows,\n vec![\n vec![\"2\".to_string(), \"aab\".to_string()],\n vec![\"1\".to_string(), \"ccc\".to_string()],\n vec![\"0\".to_string(), \"fff\".to_string()],\n ],\n )\n }\n}\n","language":"Rust"},{"code":" def sortTable(data: List[List[String]],\n ordering: (String, String) => Boolean = (_ < _),\n column: Int = 0,\n reverse: Boolean = false) = {\n val result = data.sortWith((a, b) => ordering(a(column), b(column)))\n if (reverse) result.reverse else result\n }\n","language":"Scala"},{"code":"val data=List(List(\"a\",\"b\",\"c\"), List(\"\",\"q\",\"z\"), List(\"zap\",\"zip\",\"Zot\"))\nprintln(data)\n //-> List(List(a, b, c), List(, q, z), List(zap, zip, Zot))\nprintln(sortTable(data))\n //-> List(List(, q, z), List(a, b, c), List(zap, zip, Zot))\nprintln(sortTable(data, reverse=true))\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\nprintln(sortTable(data, column=2))\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\nprintln(sortTable(data, ((a, b)=> b.size<a.size)))\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\n","language":"Scala"},{"code":"func table_sort(table, ordering: '<=>', column: 0, reverse: false) {\n if (reverse) {\n table.sort {|a,b| b[column].$ordering(a[column])}\n } else {\n table.sort {|a,b| a[column].$ordering(b[column])}\n }\n}\n\n# Quick example:\nvar table = [\n [\"Ottowa\", \"Canada\"],\n [\"Washington\", \"USA\"],\n [\"Mexico City\", \"Mexico\"],\n];\n\nsay table_sort(table, column: 1);\n","language":"Sidef"},{"code":"class String {\n method my_sort(arg) {\n (self.len <=> arg.len) ->\n || (self.lc <=> arg.lc) ->\n || (self <=> arg)\n }\n}\n\nsay table_sort(table, column: 1, ordering: 'my_sort');\n","language":"Sidef"},{"code":"s@(Sequence traits) tableSort &column: column &sortBy: sortBlock &reverse: reverse\n[\n column `defaultsTo: 0.\n sortBlock `defaultsTo: [| :a :b | (a lexicographicallyCompare: b) isNegative].\n (reverse `defaultsTo: False)\n ifTrue: [sortBlock := [| :a :b | (sortBlock applyTo: {a. b}) not]].\n s sortBy: [| :a :b | sortBlock applyTo: {a at: column. b at: column}]\n].\n","language":"Slate"},{"code":"enum SortOrder { case kOrdNone, kOrdLex, kOrdByAddress, kOrdNumeric }\n\nfunc sortTable(table: [[String]], less: (String,String)->Bool = (<), column: Int = 0, reversed: Bool = false) {\n // . . . Actual sort goes here . . .\n}\n","language":"Swift"},{"code":"proc tablesort {table {ordering \"\"} {column 0} {reverse 0}} {\n set direction [expr {$reverse ? \"-decreasing\" : \"-increasing\"}]\n if {$ordering ne \"\"} {\n lsort -command $ordering $direction -index $column $table\n } else {\n lsort $direction -index $column $table\n }\n}\n\nputs [tablesort $data]\nputs [tablesort $data \"\" 1]\nputs [tablesort $data \"\" 0 1]\nputs [tablesort $data {\n apply {{a b} {expr {[string length $a]-[string length $b]}}}\n}]\n","language":"Tcl"},{"code":"package require Tcl 8.5; # Only for the list expansion syntax\n\nproc tablesort {table args} {\n array set opt {ordering \"\" column 0 reverse 0}\n array set opt $args\n set pars [list -index $opt(column)]\n if {$opt(reverse)} {lappend pars -decreasing}\n if {$opt(ordering) ne \"\"} {lappend pars -command $opt(ordering)}\n lsort {*}$pars $table\n}\n\nputs [tablesort $data]\nputs [tablesort $data column 1]\nputs [tablesort $data column 0]\nputs [tablesort $data column 0 reverse 1]\nputs [tablesort $data ordering {\n apply {{a b} {expr {[string length $b]-[string length $a]}}}\n}]\n","language":"Tcl"},{"code":"function sorter(table, ordering = \"lexicographic\", column = 0, reverse = false) {\n // ...\n}\n\nsorter(the_data,\"numeric\");\n","language":"TIScript"},{"code":"#!/usr/bin/env bash\n# sort-args.sh\n\ndata() {\n cat <<EOF\n 123 456 0789\n 456 0789 123\n 0789 123 456\nEOF\n}\n\n# sort_table [column NUM | KIND | reverse] ... <INPUT >OUTPUT\n# KIND = lexicographical | numeric | human\n\nsort_table() {\n local opts='-b'\n local column=1\n while (( $# > 0 )) ; do\n case \"$1\" in\n column|col|c) column=${2?Missing column number} ; shift ;;\n lexicographical|lex|l) opts+=' -d' ;;\n numeric|num|n) opts+=' -g' ;;\n human|hum|h) opts+=' -h' ;;\n reverse|rev|r) opts+=' -r' ;;\n esac\n shift\n done\n eval \"sort $opts -k $column,$column -\"\n}\n\necho sort defaults ; data | sort_table\necho sort defaults reverse ; data | sort_table reverse\necho sort column 2 ; data | sort_table col 2\necho sort column 2 reverse ; data | sort_table col 2 reverse\necho sort numeric ; data | sort_table numeric\necho sort numeric reverse ; data | sort_table numeric reverse\n","language":"UNIX-Shell"},{"code":"#import std\n#import nat\n\nss ::\n\nordering %fZ ~ordering||lleq!\ncolumn %n ~column||1!\nreversed %b\n\nsorter = +^(~reversed?/~&x! ~&!,-<+ +^/~ordering ~~+ ~&h++ //skip+ predecessor+ ~column)\n","language":"Ursala"},{"code":"example_table =\n\n<\n <'foo','b '>,\n <'barr','a '>,\n <'bazzz','c'>>\n\n#cast %sLLL\n\nexamples =\n\n<\n (sorter ss&) example_table, # default sorting algorithm\n (sorter ss[ordering: leql]) example_table, # sort by field lengths but otherwise default\n (sorter ss[column: 2]) example_table, # etc.\n (sorter ss[reversed: true]) example_table,\n (sorter ss[reversed: true,column: 2]) example_table>\n","language":"Ursala"},{"code":"Private Sub optional_parameters(theRange As String, _\n Optional ordering As Integer = 0, _\n Optional column As Integer = 1, _\n Optional reverse As Integer = 1)\n ActiveSheet.Sort.SortFields.Clear\n ActiveSheet.Sort.SortFields.Add _\n Key:=Range(theRange).Columns(column), _\n SortOn:=SortOnValues, _\n Order:=reverse, _\n DataOption:=ordering 'the optional parameter ordering and above reverse\n With ActiveSheet.Sort\n .SetRange Range(theRange)\n .Header = xlGuess\n .MatchCase = False\n .Orientation = xlTopToBottom\n .SortMethod = xlPinYin\n .Apply\n End With\nEnd Sub\nPublic Sub main()\n 'Sort the strings in the active sheet in Excel\n 'Supply the range of cells to be sorted\n 'Optionally specify ordering, default is 0,\n 'which is normal sort, text and data separately;\n 'ordering:=1 treats text as numeric data.\n 'Optionally specify column number, default is 1\n 'Optionally specify reverse, default is 1\n 'which sorts in ascending order.\n 'Specifying reverse:=2 will sort in descending order.\n optional_parameters theRange:=\"A1:C4\", ordering:=1, column:=2, reverse:=1\nEnd Sub\n","language":"VBA"},{"code":"import \"./sort\" for Cmp, Sort\nimport \"./seq\" for Lst\n\nclass TableSorter {\n // uses 'merge' sort to avoid mutating original table\n // column is zero based\n static sort(table, ordering, column, reverse) {\n if (ordering == null) ordering = Fn.new { |r1, r2| Cmp.string.call(r1[column], r2[column]) }\n var sorted = Sort.merge(table, ordering)\n if (reverse) Lst.reverse(sorted)\n return sorted\n }\n\n // overloads to simulate optional parameters\n static sort(table) { sort(table, null, 0, false) }\n static sort(table, ordering) { sort(table, ordering, 0, false) }\n static sort(table, ordering, column) { sort(table, ordering, column, false) }\n}\n\nvar table = [\n [\"first\", \"1\"],\n [\"second\", \"2\"],\n [\"fourth\", \"4\"],\n [\"fifth\", \"5\"],\n [\"third\", \"3\"]\n]\n\nSystem.print(\"Original table:\")\nSystem.print(table.join(\"\\n\"))\n\nSystem.print(\"\\nAfter lexicographic sort by first column:\")\nvar table2 = TableSorter.sort(table)\nSystem.print(table2.join(\"\\n\"))\n\nSystem.print(\"\\nAfter sorting in length order of first column:\")\nvar ordering = Fn.new { |r1, r2| (r1[0].count - r2[0].count).sign }\ntable2 = TableSorter.sort(table, ordering)\nSystem.print(table2.join(\"\\n\"))\n\nSystem.print(\"\\nAfter lexicographic sort by second column:\")\ntable2 = TableSorter.sort(table, null, 1)\nSystem.print(table2.join(\"\\n\"))\n\nSystem.print(\"\\nAfter reverse lexicographic sort by second column:\")\ntable2 = TableSorter.sort(table, null, 1, true)\nSystem.print(table2.join(\"\\n\"))\n","language":"Wren"},{"code":"<xsl:template name=\"sort\">\n <xsl:param name=\"table\" />\n <xsl:param name=\"ordering\" select=\"'lexicographic'\" />\n <xsl:param name=\"column\" select=\"1\" />\n <xsl:param name=\"reversed\" select=\"false()\" />\n ...\n</xsl:template>\n","language":"XSLT"},{"code":"sub power(n, p)\n\tif numparams = 1 p = 2\n\treturn n^p\nend sub\n\nprint power(2)\nprint power(2, 3)\n","language":"Yabasic"},{"code":"const lex=\"L\";\nfcn mystrySort(table,ordering=lex,column=0,reverse=False,other){\n vm.arglist.println();\n}\nmystrySort.prototype.println();\nmystrySort(\"table\");\nmystrySort(\"table\",lex,1);\nmystrySort(\"table\",lex,1,True,D(\"row\",35,\"type\",\"foobar\"));\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Optional_parameters\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nDefine a function/method/subroutine which sorts a sequence (\\\"table\\\") of sequences (\\\"rows\\\") of strings (\\\"cells\\\"), by one of the strings. Besides the input to be sorted, it shall have the following optional parameters:\\n:{|\\n|\\n----\\n; ordering\\n: A function specifying the ordering of strings; lexicographic by default.\\n; column\\n: An integer specifying which string of each row to compare; the first by default.\\n; reverse\\n: Reverses the ordering.\\n----\\n|}\\n\\nThis task should be considered to include both positional and named optional parameters, as well as overloading on argument count as in Java or selector name as in Smalltalk, or, in the extreme, using different function names. Provide these variations of sorting '''in whatever way is most natural to your language'''. If the language supports both methods naturally, you are encouraged to describe both.\\n\\nDo not implement a sorting algorithm; this task is about the interface. If you can't use a built-in sort routine, just omit the implementation (with a comment).\\n\\nSee also:\\n* [[Named Arguments]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"package Tables is\\n\\n type Table is private;\\n\\n type Ordering is (Lexicographic, Psionic, ...); -- add others\\n\\n procedure Sort (It : in out Table;\\n Order_By : in Ordering := Lexicographic;\\n Column : in Positive := 1;\\n Reverse_Ordering : in Boolean := False);\\n\\nprivate\\n ... -- implementation specific\\nend Tables;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Tables;\\nprocedure Table_Test is\\n My_Table : Tables.Table;\\nbegin\\n ... -- insert stuff in table\\n Sort (My_Table); -- use default sorting\\n Sort (My_Table, Psionic, 5, True); -- use psionic sorting by 5th column in reverse order\\n Sort (It => My_Table, Reverse_Ordering => True); -- use default sorting in reverse order\\n ... -- other stuff\\nend Table_Test;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# as the options have distinct types (INT, BOOL and PROC( STRING, STRING )INT) the #\\n# easiest way to support these optional parameters in Algol 68 would be to have an array #\\n# with elements of these types #\\n# See the Named Arguments sample for cases where the option types are not distinct #\\n\\n# default comparison function #\\nPROC default compare = ( STRING a, b )INT: IF a < b THEN -1 ELIF a = b THEN 0 ELSE 1 FI;\\n\\n# sorting procedure #\\nPROC configurable sort = ( [,]STRING data, []UNION( INT, BOOL, PROC( STRING, STRING )INT ) options )VOID:\\nBEGIN\\n # set initial values for the options #\\n INT sort column := 2 LWB data;\\n BOOL reverse sort := FALSE;\\n PROC( STRING, STRING )INT comparator := default compare;\\n # overide from the supplied options #\\n FOR opt pos FROM LWB options TO UPB options DO\\n CASE options[ opt pos ]\\n IN ( PROC( STRING, STRING )INT p ): comparator := p\\n , ( INT c ): sort column := c\\n , ( BOOL r ): reverse sort := r\\n ESAC\\n OD\\n # do the sort .... #\\nEND # configurable sort # ;\\n\\n# example calls #\\n[ 1 : 2, 1 : 3 ]STRING data := ( ( \\\"a\\\", \\\"bb\\\", \\\"cde\\\" ), ( \\\"x\\\", \\\"abcdef\\\", \\\"Q\\\" ) );\\n\\n# sort data, default comparison, first column, reverse order #\\nconfigurable sort( data, ( TRUE ) );\\n# sort data, second column, ignore first chaacter when sorting, normal order #\\nconfigurable sort( data, ( 2, ( STRING a, STRING b )INT: default compare( a[ LWB a + 1 : ], b[ LWB b + 1 : ] ) ) );\\n# default sort #\\nconfigurable sort( data, () )\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"on sortTable(x)\\n\\tset {sortOrdering, sortColumn, sortReverse} to {sort_lexicographic, 1, false}\\n\\ttry\\n\\t\\tset sortOrdering to x's ordering\\n\\tend try\\n\\ttry\\n\\t\\tset sortColumn to x's column\\n\\tend try\\n\\ttry\\n\\t\\tset sortReverse to x's reverse\\n\\tend try\\n\\treturn sortOrdering's sort(x's sequence, sortColumn, sortReverse)\\nend sortTable\\n\\nscript sort_lexicographic\\n\\ton sort(table, column, reverse)\\n\\t\\t-- Implement lexicographic Sorting process here.\\n\\t\\treturn table\\n\\tend sort\\nend script\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"-- Another sort function.\\nscript sort_colex\\n\\ton sort(table, column, reverse)\\n\\t\\t-- Implement colexicographic Sorting process here.\\n\\t\\treturn table\\n\\tend sort\\nend script\\n\\n-- Populate a table (list) with data.\\nset table to {{1,2},{3,4}}\\n\\nsortTable({sequence:table, ordering:sort_lexicographic, column:1, reverse:false})\\nsortTable({sequence:table, ordering:sort_colex, column:2, reverse:true})\\nsortTable({sequence:table, reverse:true})\\nsortTable({sequence:table})\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"sortTable: function [tbl][\\n column: \\\"0\\\"\\n reversed?: false\\n unless null? c: <= attr 'column -> column: to :string c\\n unless null? attr 'reverse -> reversed?: true\\n\\n result: new sort.by: column map tbl 'r [\\n to :dictionary flatten couple 0..dec size r r\\n ]\\n\\n if reversed? -> reverse 'result\\n\\n return map result 'r -> values r\\n]\\n\\nprintTable: function [tbl, title][\\n print [\\\"==\\\" title]\\n loop tbl 'row [\\n print row\\n ]\\n print \\\"\\\"\\n]\\n\\nlst: [\\n [\\\"a\\\", \\\"b\\\", \\\"c\\\"]\\n [\\\"\\\", \\\"q\\\", \\\"z\\\"]\\n [\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]\\n]\\n\\nprintTable sortTable lst \\\"Default sort\\\"\\nprintTable sortTable.column:1 lst \\\"Sorting by column=1\\\"\\nprintTable sortTable.reverse lst \\\"Sorting, reversed\\\"\\nprintTable sortTable.reverse.column:1 lst \\\"Sorting by column=1, reversed\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Gosub start ; create and show the gui\\nsort_table(\\\"Text\\\", column := 2, reverse := 1) ; lexicographic sort\\nSleep, 2000\\nsort_table(\\\"Integer\\\", column := 2, reverse := 1) ; numerical sort\\nReturn\\n\\nstart:\\n Gui, Add, ListView, r20 w200, 1|2|3\\n data =\\n (\\n 1,2,3\\n b,q,z\\n c,z,z\\n )\\n Loop, Parse, data, `n\\n {\\n StringSplit, row, A_LoopField, `,\\n LV_Add(row, row1, row2, row3)\\n }\\n LV_ModifyCol(50) ; Auto-size columns\\n Gui, Show\\nReturn\\n\\n; The function supporting named, defaulted arguments\\nsort_table(ordering = \\\"Text\\\", column = 0, reverse = 0)\\n{\\n If reverse\\n desc = desc\\n LV_ModifyCol(column, \\\"sort\\\" . desc . \\\" \\\" . ordering)\\n}\\n\\nGuiClose:\\n ExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" DIM table$(100,100)\\n PROCsort_default(table$())\\n PROCsort_options(table$(), TRUE, 1, FALSE)\\n END\\n\\n DEF PROCsort_options(table$(), ordering%, column%, reverse%)\\n DEF PROCsort_default(table$()) : LOCAL ordering%, column%, reverse%\\n REM The sort goes here, controlled by the options\\n REM Zero/FALSE values for the options shall select the defaults\\n ENDPROC\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( sortTable\\n = table ordering column reverse\\n . !arg\\n : ( ?table\\n . ( ? (ordering.?ordering) ?\\n | ?&lexicographic:?ordering\\n )\\n : ( ? (column.?column) ?\\n | ?&1:?column\\n )\\n : ( ? (reverse.?reverse) ?\\n | ?&no:?reverse\\n )\\n )\\n & (...)\\n )\\n& (12.Claes.left)\\n (11.Otto.right)\\n (8.Frederikke.middle)\\n : ?table\\n& sortTable$(!table.(column.2) (reverse.yes))\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <stdarg.h>\\n#include <stdio.h>\\n#include <ctype.h>\\n#include <string.h>\\n\\ntypedef const char * String;\\ntypedef struct sTable {\\n String * *rows;\\n int n_rows,n_cols;\\n} *Table;\\n\\ntypedef int (*CompareFctn)(String a, String b);\\n\\nstruct {\\n CompareFctn compare;\\n int column;\\n int reversed;\\n} sortSpec;\\n\\nint CmprRows( const void *aa, const void *bb)\\n{\\n String *rA = *(String *const *)aa;\\n String *rB = *(String *const *)bb;\\n int sortCol = sortSpec.column;\\n\\n String left = sortSpec.reversed ? rB[sortCol] : rA[sortCol];\\n String right = sortSpec.reversed ? rA[sortCol] : rB[sortCol];\\n return sortSpec.compare( left, right );\\n}\\n\\n/** * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\\n * tbl parameter is a table of rows of strings\\n * argSpec is a string containing zero or more of the letters o,c,r\\n * if o is present - the corresponding optional argument is a function which\\n * determines the ordering of the strings.\\n * if c is present - the corresponding optional argument is an integer that\\n * specifies the column to sort on.\\n * if r is present - the corresponding optional argument is either\\n * true(nonzero) or false(zero) and if true, the sort will b in reverse order\\n * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */\\nint sortTable(Table tbl, const char* argSpec,... )\\n{\\n va_list vl;\\n const char *p;\\n int c;\\n sortSpec.compare = &strcmp;\\n sortSpec.column = 0;\\n sortSpec.reversed = 0;\\n\\n va_start(vl, argSpec);\\n if (argSpec)\\n for (p=argSpec; *p; p++) {\\n switch (*p) {\\n case 'o':\\n sortSpec.compare = va_arg(vl,CompareFctn);\\n break;\\n case 'c':\\n c = va_arg(vl,int);\\n if ( 0<=c && c<tbl->n_cols)\\n sortSpec.column = c;\\n break;\\n case 'r':\\n sortSpec.reversed = (0!=va_arg(vl,int));\\n break;\\n }\\n }\\n va_end(vl);\\n qsort( tbl->rows, tbl->n_rows, sizeof(String *), CmprRows);\\n return 0;\\n}\\n\\nvoid printTable( Table tbl, FILE *fout, const char *colFmts[])\\n{\\n int row, col;\\n\\n for (row=0; row<tbl->n_rows; row++) {\\n fprintf(fout, \\\" \\\");\\n for(col=0; col<tbl->n_cols; col++) {\\n fprintf(fout, colFmts[col], tbl->rows[row][col]);\\n }\\n fprintf(fout, \\\"\\\\n\\\");\\n }\\n fprintf(fout, \\\"\\\\n\\\");\\n}\\n\\nint ord(char v)\\n{\\n return v-'0';\\n}\\n\\n/* an alternative comparison function */\\nint cmprStrgs(String s1, String s2)\\n{\\n const char *p1 = s1;\\n const char *p2 = s2;\\n const char *mrk1, *mrk2;\\n while ((tolower(*p1) == tolower(*p2)) && *p1) {\\n p1++; p2++;\\n }\\n if (isdigit(*p1) && isdigit(*p2)) {\\n long v1, v2;\\n if ((*p1 == '0') ||(*p2 == '0')) {\\n while (p1 > s1) {\\n p1--; p2--;\\n if (*p1 != '0') break;\\n }\\n if (!isdigit(*p1)) {\\n p1++; p2++;\\n }\\n }\\n mrk1 = p1; mrk2 = p2;\\n v1 = 0;\\n while(isdigit(*p1)) {\\n v1 = 10*v1+ord(*p1);\\n p1++;\\n }\\n v2 = 0;\\n while(isdigit(*p2)) {\\n v2 = 10*v2+ord(*p2);\\n p2++;\\n }\\n if (v1 == v2)\\n return(p2-mrk2)-(p1-mrk1);\\n return v1 - v2;\\n }\\n if (tolower(*p1) != tolower(*p2))\\n return (tolower(*p1) - tolower(*p2));\\n for(p1=s1, p2=s2; (*p1 == *p2) && *p1; p1++, p2++);\\n return (*p1 -*p2);\\n}\\n\\nint main()\\n{\\n const char *colFmts[] = {\\\" %-5.5s\\\",\\\" %-5.5s\\\",\\\" %-9.9s\\\"};\\n String r1[] = { \\\"a101\\\", \\\"red\\\", \\\"Java\\\" };\\n String r2[] = { \\\"ab40\\\", \\\"gren\\\", \\\"Smalltalk\\\" };\\n String r3[] = { \\\"ab9\\\", \\\"blue\\\", \\\"Fortran\\\" };\\n String r4[] = { \\\"ab09\\\", \\\"ylow\\\", \\\"Python\\\" };\\n String r5[] = { \\\"ab1a\\\", \\\"blak\\\", \\\"Factor\\\" };\\n String r6[] = { \\\"ab1b\\\", \\\"brwn\\\", \\\"C Sharp\\\" };\\n String r7[] = { \\\"Ab1b\\\", \\\"pink\\\", \\\"Ruby\\\" };\\n String r8[] = { \\\"ab1\\\", \\\"orng\\\", \\\"Scheme\\\" };\\n\\n String *rows[] = { r1, r2, r3, r4, r5, r6, r7, r8 };\\n struct sTable table;\\n table.rows = rows;\\n table.n_rows = 8;\\n table.n_cols = 3;\\n\\n sortTable(&table, \\\"\\\");\\n printf(\\\"sort on col 0, ascending\\\\n\\\");\\n printTable(&table, stdout, colFmts);\\n\\n sortTable(&table, \\\"ro\\\", 1, &cmprStrgs);\\n printf(\\\"sort on col 0, reverse.special\\\\n\\\");\\n printTable(&table, stdout, colFmts);\\n\\n sortTable(&table, \\\"c\\\", 1);\\n printf(\\\"sort on col 1, ascending\\\\n\\\");\\n printTable(&table, stdout, colFmts);\\n\\n sortTable(&table, \\\"cr\\\", 2, 1);\\n printf(\\\"sort on col 2, reverse\\\\n\\\");\\n printTable(&table, stdout, colFmts);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <vector>\\n#include <algorithm>\\n#include <string>\\n\\n// helper comparator that is passed to std::sort()\\ntemplate <class T>\\nstruct sort_table_functor {\\n typedef bool (*CompFun)(const T &, const T &);\\n const CompFun ordering;\\n const int column;\\n const bool reverse;\\n sort_table_functor(CompFun o, int c, bool r) :\\n ordering(o), column(c), reverse(r) { }\\n bool operator()(const std::vector<T> &x, const std::vector<T> &y) const {\\n const T &a = x[column],\\n &b = y[column];\\n return reverse ? ordering(b, a)\\n : ordering(a, b);\\n }\\n};\\n\\n// natural-order less-than comparator\\ntemplate <class T>\\nbool myLess(const T &x, const T &y) { return x < y; }\\n\\n// this is the function we call, which takes optional parameters\\ntemplate <class T>\\nvoid sort_table(std::vector<std::vector<T> > &table,\\n int column = 0, bool reverse = false,\\n bool (*ordering)(const T &, const T &) = myLess) {\\n std::sort(table.begin(), table.end(),\\n sort_table_functor<T>(ordering, column, reverse));\\n}\\n\\n#include <iostream>\\n\\n// helper function to print our 3x3 matrix\\ntemplate <class T>\\nvoid print_matrix(std::vector<std::vector<T> > &data) {\\n for () {\\n for (int j = 0; j < 3; j++)\\n std::cout << data[i][j] << \\\"\\\\t\\\";\\n std::cout << std::endl;\\n }\\n}\\n\\n// order in descending length\\nbool desc_len_comparator(const std::string &x, const std::string &y) {\\n return x.length() > y.length();\\n}\\n\\nint main() {\\n\\n std::string data_array[3][3] =\\n {\\n {\\\"a\\\", \\\"b\\\", \\\"c\\\"},\\n {\\\"\\\", \\\"q\\\", \\\"z\\\"},\\n {\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"}\\n };\\n\\n std::vector<std::vector<std::string> > data_orig;\\n for (int i = 0; i < 3; i++) {\\n std::vector<std::string> row;\\n for (int j = 0; j < 3; j++)\\n row.push_back(data_array[i][j]);\\n data_orig.push_back(row);\\n }\\n print_matrix(data_orig);\\n\\n std::vector<std::vector<std::string> > data = data_orig;\\n sort_table(data);\\n print_matrix(data);\\n\\n data = data_orig;\\n sort_table(data, 2);\\n print_matrix(data);\\n\\n data = data_orig;\\n sort_table(data, 1);\\n print_matrix(data);\\n\\n data = data_orig;\\n sort_table(data, 1, true);\\n print_matrix(data);\\n\\n data = data_orig;\\n sort_table(data, 0, false, desc_len_comparator);\\n print_matrix(data);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(defn sort [table & {:keys [ordering column reverse?]\\n :or {ordering :lex, column 1}}]\\n (println table ordering column reverse?))\\n\\n(sort [1 8 3] :reverse? true)\\n[1 8 3] :lex 1 true\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defun sort-table (table &key (ordering #'string<)\\n (column 0)\\n reverse)\\n (sort table (if reverse\\n (complement ordering)\\n ordering)\\n :key (lambda (row) (elt row column))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"CL-USER> (defparameter *data* '((\\\"a\\\" \\\"b\\\" \\\"c\\\") (\\\"\\\" \\\"q\\\" \\\"z\\\") (\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\")))\\n*DATA*\\n\\nCL-USER> (sort-table *data*)\\n((\\\"\\\" \\\"q\\\" \\\"z\\\") (\\\"a\\\" \\\"b\\\" \\\"c\\\") (\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"))\\n\\nCL-USER> (sort-table *data* :column 2)\\n((\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\") (\\\"a\\\" \\\"b\\\" \\\"c\\\") (\\\"\\\" \\\"q\\\" \\\"z\\\"))\\n\\nCL-USER> (sort-table *data* :column 1)\\n((\\\"a\\\" \\\"b\\\" \\\"c\\\") (\\\"\\\" \\\"q\\\" \\\"z\\\") (\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"))\\n\\nCL-USER> (sort-table *data* :column 1 :reverse t)\\n((\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\") (\\\"\\\" \\\"q\\\" \\\"z\\\") (\\\"a\\\" \\\"b\\\" \\\"c\\\"))\\n\\nCL-USER> (sort-table *data* :ordering (lambda (a b) (> (length a) (length b))))\\n((\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\") (\\\"a\\\" \\\"b\\\" \\\"c\\\") (\\\"\\\" \\\"q\\\" \\\"z\\\"))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.functional;\\n\\nstring[][] sortTable(string[][] table,\\n in bool function(string[],string[]) ordering=null,\\n in int column = 0,\\n in bool reverse = false) {\\n if (ordering is null)\\n table.schwartzSort!(row => row[column])();\\n else\\n table.sort!ordering();\\n if (reverse)\\n table.reverse();\\n return table;\\n}\\n\\nvoid main() {\\n auto data = [[\\\"a\\\", \\\"b\\\", \\\"c\\\"],\\n [\\\"\\\", \\\"q\\\", \\\"z\\\"],\\n [\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]];\\n\\n alias show = curry!(writefln, \\\"%-(%s\\\\n%)\\\\n\\\");\\n show(data);\\n show(sortTable(data));\\n show(sortTable(data, null, 2));\\n show(sortTable(data, null, 1));\\n show(sortTable(data, null, 1, true));\\n show(sortTable(data, (a,b) => b.length > a.length));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Optional_parameters;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils;\\n\\ntype\\n TRow = TArray<string>;\\n\\n TOrderingFun = TFunc<TRow, TRow, Boolean>;\\n\\n TTable = array of TRow;\\n\\n TRowHelper = record helper for TRow\\n public\\n procedure Swap(var other: TRow);\\n function ToString: string;\\n function Length: Integer;\\n end;\\n\\n TTableHelper = record helper for TTable\\n private\\n procedure ExchangeRow(i, j: Integer);\\n public\\n procedure Sort(OrderingFun: TOrderingFun);\\n procedure Reverse;\\n function ToString: string;\\n end;\\n\\nfunction Max(a, b: Integer): Integer;\\nbegin\\n if a > b then\\n exit(a);\\n Result := b;\\nend;\\n\\n{ TRowHelper }\\n\\nfunction TRowHelper.Length: Integer;\\nbegin\\n Result := System.Length(self);\\nend;\\n\\nprocedure TRowHelper.Swap(var other: TRow);\\nvar\\n aLengthOther, aLengthSelf, aLength: Integer;\\n tmp: string;\\n i: Integer;\\nbegin\\n aLengthOther := other.Length;\\n aLengthSelf := self.Length;\\n aLength := max(aLengthOther, aLengthSelf);\\n if aLength = 0 then\\n exit;\\n\\n SetLength(self, aLength);\\n SetLength(other, aLength);\\n\\n for i := 0 to aLength - 1 do\\n begin\\n tmp := self[i];\\n self[i] := other[i];\\n other[i] := tmp;\\n end;\\n\\n SetLength(self, aLengthOther);\\n SetLength(other, aLengthSelf);\\nend;\\n\\nfunction TRowHelper.ToString: string;\\nvar\\n i: Integer;\\nbegin\\n Result := '[';\\n for i := 0 to High(self) do\\n begin\\n if i > 0 then\\n Result := Result + ', ';\\n Result := Result + '\\\"' + self[i] + '\\\"';\\n end;\\n Result := Result + ']';\\nend;\\n\\n{ TTableHelper }\\n\\nprocedure TTableHelper.ExchangeRow(i, j: Integer);\\nbegin\\n Self[i].Swap(self[j]);\\nend;\\n\\nprocedure TTableHelper.reverse;\\nvar\\n aLength, aHalfLength: Integer;\\n i: Integer;\\nbegin\\n aLength := Length(self);\\n aHalfLength := aLength div 2;\\n for i := 0 to aHalfLength - 1 do\\n ExchangeRow(i, aLength - i - 1);\\nend;\\n\\nprocedure TTableHelper.Sort(OrderingFun: TOrderingFun);\\nvar\\n i, j, aLength: Integer;\\nbegin\\n if not Assigned(OrderingFun) then\\n exit;\\n\\n aLength := Length(self);\\n for i := 0 to aLength - 2 do\\n for j := i + 1 to aLength - 1 do\\n if OrderingFun(self[i], self[j]) then\\n ExchangeRow(i, j);\\nend;\\n\\nfunction TTableHelper.ToString: string;\\nvar\\n i: Integer;\\nbegin\\n Result := '[';\\n for i := 0 to High(self) do\\n begin\\n if i > 0 then\\n Result := Result + #10;\\n Result := Result + self[i].ToString;\\n end;\\n Result := Result + ']';\\nend;\\n\\nfunction SortTable(table: TTable; Ordering: TOrderingFun = nil; column: Integer\\n = 0; reverse: Boolean = false): TTable;\\nvar\\n acolumn: Integer;\\nbegin\\n acolumn := column;\\n if not Assigned(Ordering) then\\n Ordering :=\\n function(left, right: TRow): Boolean\\n begin\\n Result := left[acolumn] > right[acolumn];\\n end;\\n\\n table.Sort(Ordering);\\n if (reverse) then\\n table.reverse();\\n Result := table;\\nend;\\n\\nvar\\n data: TTable = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']];\\n\\nbegin\\n Writeln(data.ToString, #10);\\n Writeln(SortTable(data).ToString, #10);\\n Writeln(SortTable(data).ToString, #10);\\n Writeln(SortTable(data, nil, 2).ToString, #10);\\n Writeln(SortTable(data, nil, 1).ToString, #10);\\n Writeln(SortTable(data, nil, 1, True).ToString, #10);\\n Writeln(SortTable(data,\\n function(left, right: TRow): Boolean\\n begin\\n Result := left.Length > right.Length;\\n end).ToString, #10);\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"def defaultOrdering(a, b) { return a.op__cmp(b) }\\n\\ndef sort {\\n\\n to run(table) {\\n return sort(table, 0, false, defaultOrdering)\\n }\\n to run(table, column) {\\n return sort(table, column, false, defaultOrdering)\\n }\\n to run(table, column, reverse) {\\n return sort(table, column, reverse, defaultOrdering)\\n }\\n\\n to run(table :List[List[String]], column :int, reverse :boolean, ordering) {\\n return table.sort(fn a, b {\\n def ord := ordering(a[column], b[column])\\n if (reverse) { -ord } else { ord }\\n })\\n }\\n\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"module OptionalParameters {\\n typedef Type<String >.Orderer as ColumnOrderer;\\n typedef Type<String[]>.Orderer as RowOrderer;\\n\\n static String[][] sort(String[][] table,\\n ColumnOrderer? orderer = Null,\\n Int column = 0,\\n Boolean reverse = False,\\n ) {\\n // provide a default orderer\\n orderer ?:= (s1, s2) -> s1 <=> s2;\\n\\n // optionally reverse the order\\n ColumnOrderer byString = reverse\\n ? ((s1, s2) -> orderer(s1, s2).reversed)\\n : orderer;\\n\\n // sort the indicated column\\n RowOrderer byColumn = (row1, row2) -> byString(row1[column], row2[column]);\\n\\n return table.sorted(byColumn);\\n }\\n\\n void run() {\\n String[][] table =\\n [\\n [\\\"c\\\", \\\"x\\\", \\\"i\\\"],\\n [\\\"a\\\", \\\"y\\\", \\\"p\\\"],\\n [\\\"b\\\", \\\"z\\\", \\\"a\\\"],\\n ];\\n\\n show(\\\"original input\\\", table);\\n show(\\\"by default sort on column 0\\\", sort(table));\\n show(\\\"by column 2\\\", sort(table, column=2));\\n show(\\\"by column 2 reversed\\\", sort(table, column=2, reverse=True));\\n }\\n\\n void show(String title, String[][] table) {\\n @Inject Console console;\\n console.print($\\\"{title}:\\\");\\n for (val row : table) {\\n console.print($\\\" {row}\\\");\\n }\\n console.print();\\n }\\n}\\n\",\n \"language\": \"Ecstasy\"\n },\n {\n \"code\": \"defmodule Optional_parameters do\\n def sort( table, options\\\\\\\\[] ) do\\n options = options ++ [ ordering: :lexicographic, column: 0, reverse: false ]\\n ordering = options[ :ordering ]\\n column = options[ :column ]\\n reverse = options[ :reverse ]\\n sorted = sort( table, ordering, column )\\n if reverse, do: Enum.reverse( sorted ), else: sorted\\n end\\n\\n defp sort( table, :lexicographic, column ) do\\n Enum.sort_by( table, &elem( &1, column ) )\\n end\\n defp sort( table, :numeric, column ) do\\n Enum.sort_by( table, &elem( &1, column ) |> String.to_integer )\\n end\\n\\n def task do\\n table = [ { \\\"123\\\", \\\"456\\\", \\\"0789\\\" },\\n { \\\"456\\\", \\\"0789\\\", \\\"123\\\" },\\n { \\\"0789\\\", \\\"123\\\", \\\"456\\\" } ]\\n IO.write \\\"sort defaults \\\"; IO.inspect sort( table )\\n IO.write \\\" & reverse \\\"; IO.inspect sort( table, reverse: true )\\n IO.write \\\"sort column 2 \\\"; IO.inspect sort( table, column: 2)\\n IO.write \\\" & reverse \\\"; IO.inspect sort( table, column: 2, reverse: true)\\n IO.write \\\"sort numeric \\\"; IO.inspect sort( table, ordering: :numeric)\\n IO.write \\\" & reverse \\\"; IO.inspect sort( table, ordering: :numeric, reverse: true)\\n end\\nend\\n\\nOptional_parameters.task\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( optional_parameters ).\\n\\n-export( [sort/2, task/0] ).\\n\\nsort( Table, Options ) ->\\n\\tOrdering = proplists:get_value( ordering, Options, lexicographic ),\\n\\tColumn = proplists:get_value( column, Options, 1 ),\\n\\tIs_reverse = proplists:get_value( reverse, Options, false ),\\n\\tSorted = sort( Table, Ordering, Column ),\\n\\tsorted_reverse( Is_reverse, Sorted ).\\n\\ntask() ->\\n\\tio:fwrite( \\\"sort defaults ~p~n\\\", [sort( table(), [])] ),\\n\\tio:fwrite( \\\"reverse ~p~n\\\", [sort( table(), [reverse])] ),\\n\\tio:fwrite( \\\"sort column 3 ~p~n\\\", [sort( table(), [{column, 3}])] ),\\n\\tio:fwrite( \\\"reverse ~p~n\\\", [sort( table(), [{column, 3}, reverse])] ),\\n\\tio:fwrite( \\\"sort numeric ~p~n\\\", [sort( table(), [{ordering, numeric}])] ),\\n\\tio:fwrite( \\\"reverse ~p~n\\\", [sort( table(), [{ordering, numeric}, reverse])] ).\\n\\n\\n\\nrow_numeric( Tuple ) -> erlang:list_to_tuple( [{erlang:list_to_integer(X), X} || X <- erlang:tuple_to_list(Tuple)] ).\\n\\nrow_remove_numeric( Tuple ) -> erlang:list_to_tuple( [Y || {_X, Y} <- erlang:tuple_to_list(Tuple)] ).\\n\\nsort( Table, lexicographic, Column ) -> lists:keysort( Column, Table );\\nsort( Table, numeric, Column ) ->\\n\\tNumeric_table = [row_numeric(X) || X <- Table],\\n\\tSorted_numeric = lists:keysort( Column, Numeric_table ),\\n\\t[row_remove_numeric(X) || X <- Sorted_numeric].\\n\\nsorted_reverse( true, Sorted ) -> lists:reverse( Sorted );\\nsorted_reverse( false, Sorted ) -> Sorted.\\n\\ntable() -> [table_row1(), table_row2(), table_row3()].\\n\\ntable_row1() -> {\\\"123\\\", \\\"456\\\", \\\"0789\\\"}.\\ntable_row2() -> {\\\"456\\\", \\\"0789\\\", \\\"123\\\"}.\\ntable_row3() -> {\\\"0789\\\", \\\"123\\\", \\\"456\\\"}.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"type Table(rows:string[][]) =\\n // in-place sorting of rows\\n member x.Sort(?ordering, ?column, ?reverse) =\\n let ordering = defaultArg ordering compare\\n let column = defaultArg column 0\\n let reverse = defaultArg reverse false\\n\\n let factor = if reverse then -1 else 1\\n let comparer (row1:string[]) (row2:string[]) =\\n factor * ordering row1.[column] row2.[column]\\n\\n Array.sortInPlaceWith comparer rows\\n\\n member x.Print() =\\n for row in rows do printfn \\\"%A\\\" row\\n\\n// Example usage\\nlet t = new Table([| [|\\\"a\\\"; \\\"b\\\"; \\\"c\\\"|]\\n [|\\\"\\\"; \\\"q\\\"; \\\"z\\\"|]\\n [|\\\"can\\\"; \\\"z\\\"; \\\"a\\\"|] |])\\n\\nprintfn \\\"Unsorted\\\"; t.Print()\\n\\nt.Sort()\\nprintfn \\\"Default sort\\\"; t.Print()\\n\\nt.Sort(column=2)\\nprintfn \\\"Sorted by col. 2\\\"; t.Print()\\n\\nt.Sort(column=1)\\nprintfn \\\"Sorted by col. 1\\\"; t.Print()\\n\\nt.Sort(column=1, reverse=true)\\nprintfn \\\"Reverse sorted by col. 1\\\"; t.Print()\\n\\nt.Sort(ordering=fun s1 s2 -> compare s2.Length s1.Length)\\nprintfn \\\"Sorted by decreasing length\\\"; t.Print()\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: accessors combinators io kernel math.order prettyprint\\nsequences sorting ;\\n\\nTUPLE: table-sorter\\n data\\n { column initial: 0 }\\n reversed?\\n { ordering initial: [ ] } ;\\n\\n: <table-sorter> ( -- obj ) table-sorter new ;\\n\\n: sort-table ( table-sorter -- matrix )\\n {\\n [ data>> ]\\n [ column>> [ swap nth ] curry ]\\n [ ordering>> compose ]\\n [ reversed?>> [ >=< ] [ <=> ] ? [ bi@ ] prepose curry ]\\n } cleave [ sort ] curry call( x -- x ) ;\\n\\n\\n! ===== Now we can use the interface defined above =====\\n\\nCONSTANT: table\\n { { \\\"a\\\" \\\"b\\\" \\\"c\\\" } { \\\"\\\" \\\"q\\\" \\\"z\\\" } { \\\"can\\\" \\\"z\\\" \\\"a\\\" } }\\n\\n\\\"Unsorted\\\" print\\ntable simple-table.\\n\\n\\\"Default sort\\\" print\\n<table-sorter>\\n table >>data\\nsort-table simple-table.\\n\\n\\\"Sorted by col 2\\\" print\\n<table-sorter>\\n table >>data\\n 2 >>column\\nsort-table simple-table.\\n\\n\\\"Sorted by col 1\\\" print\\n<table-sorter>\\n table >>data\\n 1 >>column\\nsort-table simple-table.\\n\\n\\\"Reverse sorted by col 1\\\" print\\n<table-sorter>\\n table >>data\\n 1 >>column\\n t >>reversed?\\nsort-table simple-table.\\n\\n\\\"Sorted by decreasing length\\\" print\\n<table-sorter>\\n table >>data\\n t >>reversed?\\n [ length ] >>ordering\\nsort-table simple-table.\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"module ExampleOptionalParameter\\n ! use any module needed for the sort function(s)\\n ! and all the interfaces needed to make the code work\\n implicit none\\ncontains\\n\\n subroutine sort_table(table, ordering, column, reverse)\\n type(table_type), intent(inout) :: table\\n integer, optional :: column\\n logical, optional :: reverse\\n optional :: ordering\\n interface\\n integer function ordering(a, b)\\n type(table_element), intent(in) :: a, b\\n end function ordering\\n end interface\\n\\n integer :: the_column, i\\n logical :: reversing\\n type(table_row) :: rowA, rowB\\n\\n if ( present(column) ) then\\n if ( column > get_num_of_columns(table) ) then\\n ! raise an error?\\n else\\n the_column = column\\n end if\\n else\\n the_column = 1 ! a default value, de facto\\n end if\\n\\n reversing = .false. ! default value\\n if ( present(reverse) ) reversing = reverse\\n\\n do\\n ! loops over the rows to sort... at some point, we need\\n ! comparing an element (cell) of the row, with the element\\n ! in another row; ... let us suppose rowA and rowB are\\n ! the two rows we are considering\\n ea = get_element(rowA, the_column)\\n eb = get_element(rowB, the_column)\\n if ( present(ordering) ) then\\n if ( .not. reversing ) then\\n if ( ordering(ea, eb) > 0 ) then\\n ! swap the rowA with the rowB\\n end if\\n else ! < instead of >\\n if ( ordering(ea, eb) < 0 ) then\\n ! swap the rowA with the rowB\\n end if\\n end if\\n else\\n if ( .not. reversing ) then\\n if ( lexinternal(ea, eb) > 0 ) then\\n ! swap the rowA with the rowB\\n end if\\n else ! < instead of >\\n if ( lexinternal(ea, eb) < 0 ) then\\n ! swap the rowA with the rowB\\n end if\\n end if\\n end if\\n ! ... more of the sorting algo ...\\n ! ... and rows traversing ... (and an exit condition of course!)\\n end do\\n\\n end subroutine sort_table\\n\\nend module ExampleOptionalParameter\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program UsingTest\\n use ExampleOptionalParameter\\n implicit none\\n\\n type(table_type) :: table\\n\\n ! create the table...\\n\\n ! sorting taking from column 1, not reversed, using internal\\n ! default comparator\\n call sort_table(table)\\n\\n ! the same as above, but in reversed order; we MUST specify\\n ! the name of the argument since it is not given in the same\\n ! order of the subroutine spec\\n call sort_table(table, reverse=.true.)\\n\\n ! sort the table using a custom comparator\\n call sort_table(table, my_cmp)\\n ! or\\n call sort_table(table, ordering=my_cmp)\\n\\n ! as above, but taking from column 2\\n call sort_table(table, my_cmp, 2)\\n ! or (swapping the order of args for fun)\\n call sort_table(table, column=2, ordering=my_cmp)\\n\\n ! with custom comparator, column 2 and reversing...\\n call sort_table(table, my_cmp, 2, .true.)\\n ! of course we can swap the order of optional args\\n ! by prefixing them with the name of the arg\\n\\n ! sort from column 2, with internal comparator\\n call sort_table(table, column=2)\\n\\nend program UsingTest\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Function power(n As Integer, p As Integer = 2) As Double\\n\\tReturn n ^ p\\nEnd Function\\n\\nPrint power(2) ' muestra 4\\nPrint power(2, 3) ' muestra 8\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"type cell string\\n\\ntype spec struct {\\n less func(cell, cell) bool\\n column int\\n reverse bool\\n}\\n\\nfunc newSpec() (s spec) {\\n // initialize any defaults\\n return\\n}\\n\\n// sort with all defaults\\nt.sort(newSpec())\\n\\n// reverse sort\\ns := newSpec\\ns.reverse = true\\nt.sort(s)\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"type spec struct {\\n ordering func(cell, cell) bool\\n column int\\n reverse bool\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"spec{reverse: true}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sort\\\"\\n)\\n\\ntype cell string\\ntype row []cell\\ntype table struct {\\n rows []row\\n column int\\n less func(cell, cell) bool\\n}\\n\\nfunc (c cell) String() string {\\n return fmt.Sprintf(\\\"%q\\\", string(c))\\n}\\n\\nfunc (t table) printRows(heading string) {\\n fmt.Println(\\\"--\\\", heading)\\n for _, row := range t.rows {\\n fmt.Println(row)\\n }\\n fmt.Println()\\n}\\n\\n// sort.Interface\\nfunc (t table) Len() int { return len(t.rows) }\\nfunc (t table) Swap(i, j int) { t.rows[i], t.rows[j] = t.rows[j], t.rows[i] }\\nfunc (t table) Less(i, j int) bool {\\n return t.less(t.rows[i][t.column], t.rows[j][t.column])\\n}\\n\\n// struct implements named parameter-like capability\\ntype spec struct {\\n ordering func(cell, cell) bool\\n column int\\n reverse bool\\n}\\n\\n\\nfunc (t *table) sort(s spec) {\\n // set up column and comparison function for sort\\n t.column = s.column\\n switch {\\n case s.ordering != nil:\\n t.less = s.ordering\\n case s.reverse:\\n t.less = func(a, b cell) bool { return a > b }\\n default:\\n t.less = func(a, b cell) bool { return a < b }\\n }\\n\\n // sort\\n sort.Sort(t)\\n\\n // reverse if necessary\\n if s.ordering == nil || !s.reverse {\\n return\\n }\\n last := len(t.rows) - 1\\n for i := last / 2; i >= 0; i-- {\\n t.rows[i], t.rows[last-i] = t.rows[last-i], t.rows[i]\\n }\\n}\\n\\nfunc main() {\\n t := table{rows: []row{\\n {\\\"pail\\\", \\\"food\\\"},\\n {\\\"pillbox\\\", \\\"nurse maids\\\"},\\n {\\\"suitcase\\\", \\\"airedales\\\"},\\n {\\\"bathtub\\\", \\\"chocolate\\\"},\\n {\\\"schooner\\\", \\\"ice cream sodas\\\"},\\n }}\\n\\n t.printRows(\\\"song\\\")\\n\\n // no \\\"parameters\\\"\\n t.sort(spec{})\\n t.printRows(\\\"sorted on first column\\\")\\n\\n // \\\"named parameter\\\" reverse.\\n t.sort(spec{reverse: true})\\n t.printRows(\\\"reverse sorted on first column\\\")\\n\\n // \\\"named parameters\\\" column and ordering\\n t.sort(spec{\\n column: 1,\\n ordering: func(a, b cell) bool { return len(a) > len(b) },\\n })\\n t.printRows(\\\"sorted by descending string length on second column\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sort\\\"\\n)\\n\\ntype cell string\\ntype row []cell\\ntype table struct {\\n rows []row\\n column int\\n less func(cell, cell) bool\\n}\\n\\nfunc (c cell) String() string {\\n return fmt.Sprintf(\\\"%q\\\", string(c))\\n}\\n\\nfunc (t table) printRows(heading string) {\\n fmt.Println(\\\"--\\\", heading)\\n for _, row := range t.rows {\\n fmt.Println(row)\\n }\\n fmt.Println()\\n}\\n\\n// sort.Interface\\nfunc (t table) Len() int { return len(t.rows) }\\nfunc (t table) Swap(i, j int) { t.rows[i], t.rows[j] = t.rows[j], t.rows[i] }\\nfunc (t table) Less(i, j int) bool {\\n return t.less(t.rows[i][t.column], t.rows[j][t.column])\\n}\\n\\n// struct implements named parameter-like capability\\ntype spec struct {\\n ordering func(cell, cell) bool\\n column int\\n reverse bool\\n}\\n\\n// A defined option type is not really needed by the technique, but has\\n// a nice advantage for documentation. If this type is exported, then\\n// the the Go documentation tool go doc will organize all of the option\\n// functions together under the type. (Go doc will see them as constructors\\n// for the type.)\\ntype Option func(*spec)\\n\\nfunc ordering(o func(cell, cell) bool) Option {\\n return func(s *spec) { s.ordering = o }\\n}\\n\\nfunc column(c int) Option {\\n return func(s *spec) { s.column = c }\\n}\\n\\nfunc reverse() Option {\\n return func(s *spec) { s.reverse = true }\\n}\\n\\nfunc (t *table) sort(options ...Option) {\\n var s spec\\n for _, o := range options {\\n o(&s)\\n }\\n // set up column and comparison function for sort\\n t.column = s.column\\n switch {\\n case s.ordering != nil:\\n t.less = s.ordering\\n case s.reverse:\\n t.less = func(a, b cell) bool { return a > b }\\n default:\\n t.less = func(a, b cell) bool { return a < b }\\n }\\n\\n // sort\\n sort.Sort(t)\\n\\n // reverse if necessary\\n if s.ordering == nil || !s.reverse {\\n return\\n }\\n last := len(t.rows) - 1\\n for i := last / 2; i >= 0; i-- {\\n t.rows[i], t.rows[last-i] = t.rows[last-i], t.rows[i]\\n }\\n}\\n\\nfunc main() {\\n t := table{rows: []row{\\n {\\\"pail\\\", \\\"food\\\"},\\n {\\\"pillbox\\\", \\\"nurse maids\\\"},\\n {\\\"suitcase\\\", \\\"airedales\\\"},\\n {\\\"bathtub\\\", \\\"chocolate\\\"},\\n {\\\"schooner\\\", \\\"ice cream sodas\\\"},\\n }}\\n\\n t.printRows(\\\"song\\\")\\n // no parameters\\n t.sort()\\n t.printRows(\\\"sorted on first column\\\")\\n\\n // \\\"named parameter\\\" reverse.\\n t.sort(reverse())\\n t.printRows(\\\"reverse sorted on first column\\\")\\n\\n // \\\"named parameters\\\" column and ordering\\n byLen := func(a, b cell) bool { return len(a) > len(b) }\\n t.sort(column(1), ordering(byLen))\\n t.printRows(\\\"sorted by descending string length on second column\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def orderedSort(Collection table, column = 0, reverse = false, ordering = {x, y -> x <=> y } as Comparator) {\\n table.sort(false) { x, y -> (reverse ? -1 : 1) * ordering.compare(x[column], y[column])}\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def table = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\\n\\nassert orderedSort(table) == [['', 'q', 'z'], ['a', 'b', 'c'], ['zap', 'zip', 'Zot']]\\nassert orderedSort(table, 2) == [['zap', 'zip', 'Zot'], ['a', 'b', 'c'], ['', 'q', 'z']]\\nassert orderedSort(table, 1) == [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\\nassert orderedSort(table, 1, true) == [['zap', 'zip', 'Zot'],['', 'q', 'z'],['a', 'b', 'c']]\\nassert orderedSort(table, 0, false, {x, y -> y?.size() <=> x?.size()} as Comparator) == [['zap', 'zip', 'Zot'],['a', 'b', 'c'],['', 'q', 'z']]\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"Collection.metaClass.orderedSort = { params ->\\n def column = params?.column ?: 0\\n def reverse = params?.reverse ?: false\\n def ordering = params?.ordering ?: {x, y -> x <=> y } as Comparator\\n\\n table.sort(false) { x, y -> (reverse ? -1 : 1) * ordering.compare(x[column], y[column])}\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def table = [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\\n\\nassert table.orderedSort() == [['', 'q', 'z'], ['a', 'b', 'c'], ['zap', 'zip', 'Zot']]\\nassert table.orderedSort(column: 2) == [['zap', 'zip', 'Zot'], ['a', 'b', 'c'], ['', 'q', 'z']]\\nassert table.orderedSort(column: 1) == [['a', 'b', 'c'], ['', 'q', 'z'], ['zap', 'zip', 'Zot']]\\nassert table.orderedSort(column: 1, reverse: true) == [['zap', 'zip', 'Zot'],['', 'q', 'z'],['a', 'b', 'c']]\\nassert table.orderedSort(ordering: {x, y -> y?.size() <=> x?.size()} as Comparator) == [['zap', 'zip', 'Zot'],['a', 'b', 'c'],['', 'q', 'z']]\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"{-# LANGUAGE RecordWildCards #-}\\n\\ndata SorterArgs = SorterArgs { cmp :: String, col :: Int, rev :: Bool } deriving Show\\ndefSortArgs = SorterArgs \\\"lex\\\" 0 False\\n\\n\\nsorter :: SorterArgs -> [[String]] -> [[String]]\\nsorter (SorterArgs{..}) = case cmp of\\n _ -> undefined\\n\\nmain = do\\n sorter defSortArgs{cmp = \\\"foo\\\", col=1, rev=True} [[]]\\n sorter defSortArgs{cmp = \\\"foo\\\"} [[]]\\n sorter defSortArgs [[]]\\n return ()\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Maybe (fromMaybe)\\n-- Use fromMaybe as an operator because its prettier\\n(//) = flip fromMaybe\\n\\nsorter :: Maybe String -> Maybe Int -> Maybe Bool -> [[String]] -> [[String]]\\nsorter ((// \\\"lex\\\") -> cmp)\\n ((// 0) -> col)\\n ((// False) -> rev) = undefined\\n\\nmain = do\\n sorter (Just \\\"foo\\\") (Just 1) (Just True)\\n sorter Nothing Nothing Nothing\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n X := [ [1,2,3], [2,3,1], [3,1,2]) # A list of lists\\n Sort(X) # vanilla sort\\n Sort(X,\\\"ordering\\\",\\\"numeric\\\",\\\"column\\\",2,\\\"reverse\\\") # using optional parameters\\nend\\n\\nprocedure Sort(X,A[]) # A[] provides for a variable number of arguments\\n while a := get(A) do {\\n case a of {\\n \\\"ordering\\\" : op := case get(A) | runerr(205,a) of {\\n \\\"lexicographic\\\"|\\\"string\\\": \\\"<<\\\"\\n \\\"numeric\\\": \\\"<\\\"\\n default: runerr(205,op)\\n }\\n \\\"column\\\" : col := 0 < integer(col := get(A)) | runerr(205,col)\\n \\\"reverse\\\" : reverseorder := reverse\\n default: runerr(205,a)\\n }\\n return (\\\\reverseorder|1)(bubblesortf(X,\\\\c|1,\\\\op|\\\"<<\\\")) # reverse or return the sorted list\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"srtbl=: verb define\\n '' srtbl y\\n:\\n '`ordering column reverse'=. x , (#x)}. ]`0:`0:\\n |.^:reverse y /: ordering (column {\\\"1 ])y\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ]Table=: ('a';'b';'c'),('';'q';'z'),:'zip';'zap';'Zot'\\n┌───┬───┬───┐\\n│a │b │c │\\n├───┼───┼───┤\\n│ │q │z │\\n├───┼───┼───┤\\n│zip│zap│Zot│\\n└───┴───┴───┘\\n srtbl Table NB. default sort\\n┌───┬───┬───┐\\n│ │q │z │\\n├───┼───┼───┤\\n│a │b │c │\\n├───┼───┼───┤\\n│zip│zap│Zot│\\n└───┴───┴───┘\\n ]`1: srtbl Table NB. sort by column 1\\n┌───┬───┬───┐\\n│a │b │c │\\n├───┼───┼───┤\\n│ │q │z │\\n├───┼───┼───┤\\n│zip│zap│Zot│\\n└───┴───┴───┘\\n ]`2:`1: srtbl Table NB. reverse sort by column 2\\n┌───┬───┬───┐\\n│zip│zap│Zot│\\n├───┼───┼───┤\\n│ │q │z │\\n├───┼───┼───┤\\n│a │b │c │\\n└───┴───┴───┘\\n #&>`0: srtbl Table NB. sort by length\\n┌───┬───┬───┐\\n│ │q │z │\\n├───┼───┼───┤\\n│a │b │c │\\n├───┼───┼───┤\\n│zip│zap│Zot│\\n└───┴───┴───┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class OptionalParams {\\n // \\\"natural ordering\\\" comparator\\n static <T extends Comparable<? super T>> Comparator<T> naturalOrdering() {\\n return Collections.reverseOrder(Collections.<T>reverseOrder());\\n }\\n\\n public static <T extends Comparable<? super T>> void\\n sortTable(T[][] table) {\\n sortTable(table, 0);\\n }\\n public static <T extends Comparable<? super T>> void\\n sortTable(T[][] table,\\n int column) {\\n sortTable(table, column, false);\\n }\\n public static <T extends Comparable<? super T>> void\\n sortTable(T[][] table,\\n int column, boolean reverse) {\\n sortTable(table, column, reverse, OptionalParams.<T>naturalOrdering());\\n }\\n public static <T> void sortTable(T[][] table,\\n final int column,\\n final boolean reverse,\\n final Comparator<T> ordering) {\\n Comparator<T[]> myCmp = new Comparator<T[]>() {\\n public int compare(T[] x, T[] y) {\\n return (reverse ? -1 : 1) *\\n ordering.compare(x[column], y[column]);\\n }\\n };\\n Arrays.sort(table, myCmp);\\n }\\n\\n public static void main(String[] args) {\\n String[][] data0 = {{\\\"a\\\", \\\"b\\\", \\\"c\\\"},\\n {\\\"\\\", \\\"q\\\", \\\"z\\\"},\\n {\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"}};\\n System.out.println(Arrays.deepToString(data0));\\n // prints: [[a, b, c], [, q, z], [zap, zip, Zot]]\\n\\n // we copy it so that we don't change the original copy\\n String[][] data = data0.clone();\\n sortTable(data);\\n System.out.println(Arrays.deepToString(data));\\n // prints: [[, q, z], [a, b, c], [zap, zip, Zot]]\\n\\n data = data0.clone();\\n sortTable(data, 2);\\n System.out.println(Arrays.deepToString(data));\\n // prints: [[zap, zip, Zot], [a, b, c], [, q, z]]\\n\\n data = data0.clone();\\n sortTable(data, 1);\\n System.out.println(Arrays.deepToString(data));\\n // prints: [[a, b, c], [, q, z], [zap, zip, Zot]]\\n\\n data = data0.clone();\\n sortTable(data, 1, true);\\n System.out.println(Arrays.deepToString(data));\\n // prints: [[zap, zip, Zot], [, q, z], [a, b, c]]\\n\\n data = data0.clone();\\n sortTable(data, 0, false, new Comparator<String>() {\\n public int compare(String a, String b) {\\n return b.length() - a.length();\\n }\\n });\\n System.out.println(Arrays.deepToString(data));\\n // prints: [[zap, zip, Zot], [a, b, c], [, q, z]]\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function sorter(table, options) {\\n opts = {}\\n opts.ordering = options.ordering || 'lexicographic';\\n opts.column = options.column || 0;\\n opts.reverse = options.reverse || false;\\n\\n // ...\\n}\\n\\nsorter(the_data, {reverse: true, ordering: 'numeric'});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def bar: 2 *.;\\n\\ndef foo: {\\\"a\\\": bar};\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def less_than_or_equal: .[0] <= .[1];\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def sorter(options):\\n sort_table( if (options|has(\\\"ordering\\\")) then options.ordering\\n else less_than_or_equal\\n end;\\n options.column or 0;\\n options.reverse or false );\\n\\n# If jq > 1.4 is being used, we may also define:\\ndef sorter: sorter({});\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[1,2] | sorter({ \\\"reverse\\\": true, \\\"ordering\\\": less_than_or_equal } )\\n\\n[1,2] | sorter({ \\\"reverse\\\": true })\\n\\n# If sorter/0 has also been defined:\\n[1,2] | sorter\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"sorttable(T; ordering=<, column=1, reverse=false) =\\n sort(T, by = t -> t[column], lt = reverse ? (a,b) -> ordering(b,a) : ordering)\\nsorttable(T, ordering=<, column=1, reverse=false) =\\n sorttable(T, ordering=ordering, column=column, reverse=reverse)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"julia> data = {[\\\"a\\\", \\\"b\\\", \\\"c\\\"], [\\\"\\\", \\\"q\\\", \\\"z\\\"], [\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]}\\n3-element Array{Any,1}:\\n [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\n [\\\"\\\",\\\"q\\\",\\\"z\\\"]\\n [\\\"zap\\\",\\\"zip\\\",\\\"Zot\\\"]\\n\\njulia> sorttable(data, column=2, reverse=true) # named arguments\\n3-element Array{Any,1}:\\n [\\\"zap\\\",\\\"zip\\\",\\\"Zot\\\"]\\n [\\\"\\\",\\\"q\\\",\\\"z\\\"]\\n [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\n\\njulia> sorttable(data, >, 2) # the same thing, with positional arguments\\n3-element Array{Any,1}:\\n [\\\"zap\\\",\\\"zip\\\",\\\"Zot\\\"]\\n [\\\"\\\",\\\"q\\\",\\\"z\\\"]\\n [\\\"a\\\",\\\"b\\\",\\\"c\\\"]\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.tlhy\\n\\n:mypower\\n 1 tolist flatten len\\n 1 equal\\n ( [pop drop 2]\\n [pop pop drop]\\n ) if\\n power\\n;\\n\\n\\\"2 ^2 = \\\" print 2 mypower ?\\n\\\"2 ^3 = \\\" print ( 2 3 ) mypower ?\\n\\n\\\"End \\\" input\\n\",\n \"language\": \"Klingphix\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\ntypealias Table = List<List<String>>\\n\\n/* Note that if ordering is specified, first two parameters are ignored */\\nfun Table.sort(\\n column: Int = 0,\\n reverse: Boolean = false,\\n ordering: Comparator<List<String>> =\\n if (!reverse) compareBy { it[column] }\\n else compareByDescending { it[column] }\\n) = this.sortedWith(ordering)\\n\\nfun Table.print(title: String) {\\n println(title)\\n for (i in 0 until this.size) {\\n for (j in 0 until this[0].size) System.out.print(\\\"%-3s \\\".format(this[i][j]))\\n println()\\n }\\n println()\\n}\\n\\nfun main(args: Array<String>) {\\n val table = listOf(\\n listOf(\\\"a\\\", \\\"b\\\", \\\"c\\\"),\\n listOf(\\\"\\\", \\\"q\\\", \\\"z\\\"),\\n listOf(\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\")\\n )\\n table.print(\\\"Original:\\\")\\n\\n val titles = listOf(\\n \\\"Sorted by col 0:\\\", \\\"Sorted by col 1:\\\", \\\"Sorted by col 2:\\\",\\n \\\"Reverse sorted by col 0:\\\", \\\"Reverse sorted by col 1:\\\", \\\"Reverse Sorted by col 2\\\"\\n )\\n val params = listOf(\\n 0 to false, 1 to false, 2 to false, 0 to true, 1 to true, 2 to true\\n )\\n for ((i, title) in titles.withIndex()) {\\n val table2 = table.sort(params[i].first, params[i].second)\\n table2.print(title)\\n }\\n // using non-default Comparator (case insensitive by col 2, reversed)\\n val comp: Comparator<List<String>> = compareByDescending { it[2].toLowerCase() }\\n val table3 = table.sort(ordering = comp)\\n table3.print(\\\"Reverse case insensitive sort by col 2:\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"define sortarray( // params are set by position\\n\\titems::array, // required param\\n\\tordering::string\\t= 'lexicographic', // optional param\\n\\tcolumn::integer\\t\\t= 1,\\n\\treverse::boolean\\t= false\\n) => {\\n\\t// sorting process\\n\\tlocal(sorteditems = array)\\n\\t// Lasso has no build in method to sort an array of arrays by position in the contained arrays\\n\\t// But a method could be built for it\\n\\treturn #sorteditems\\n}\\n\\ndefine sortarray(\\n\\t-items::array, // required param\\n\\t-ordering::string\\t= 'lexicographic', // optional param\\n\\t-column::integer\\t= 1,\\n\\t-reverse::boolean\\t= false\\n) => sortarray(#items, #ordering, #column, #reverse)\\n\\nlocal(items = array(\\n\\tarray(10, 'red', 'Volvo'),\\n\\tarray(15, 'gren', 'Ford'),\\n\\tarray(48, 'yellow', 'Kia'),\\n\\tarray(12, 'black', 'Holden'),\\n\\tarray(19, 'brown', 'Fiat'),\\n\\tarray(8, 'pink', 'Batmobile'),\\n\\tarray(74, 'orange', 'Bicycle')\\n))\\n\\nsortarray(-items = #items, -reverse)\\n\\nsortarray(#items)\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"to sort :table [:column 1] [:ordering \\\"before?] [:reverse \\\"false]\\n ; ...\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"sort :table\\n(sort :table 2)\\n(sort :table 3 \\\"less? \\\"true)\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function showTable(tbl)\\n\\tif type(tbl)=='table' then\\n\\t\\tlocal result = {}\\n\\t\\tfor _, val in pairs(tbl) do\\n\\t\\t\\ttable.insert(result, showTable(val))\\n\\t\\tend\\n\\t\\treturn '{' .. table.concat(result, ', ') .. '}'\\n\\telse\\n\\t\\treturn (tostring(tbl))\\n\\tend\\nend\\n\\nfunction sortTable(op)\\n\\tlocal tbl = op.table or {}\\n\\tlocal column = op.column or 1\\n\\tlocal reverse = op.reverse or false\\n\\tlocal cmp = op.cmp or (function (a, b) return a < b end)\\n\\tlocal compareTables = function (a, b)\\n\\t\\tlocal result = cmp(a[column], b[column])\\n\\t\\tif reverse then return not result else return result end\\n\\tend\\n\\ttable.sort(tbl, compareTables)\\nend\\n\\nA = {{\\\"quail\\\", \\\"deer\\\", \\\"snake\\\"},\\n\\t{\\\"dalmation\\\", \\\"bear\\\", \\\"fox\\\"},\\n\\t{\\\"ant\\\", \\\"cougar\\\", \\\"coyote\\\"}}\\nprint('original', showTable(A))\\n\\nsortTable{table=A}\\nprint('defaults', showTable(A))\\n\\nsortTable{table=A, column=2}\\nprint('col 2 ', showTable(A))\\n\\nsortTable{table=A, column=3}\\nprint('col 3 ', showTable(A))\\n\\nsortTable{table=A, column=3, reverse=true}\\nprint('col 3 rev', showTable(A))\\n\\nsortTable{table=A, cmp=(function (a, b) return #a < #b end)}\\nprint('by length', showTable(A))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"OptionalSort := proc(input, {\\n ordering :: Or(procedures,identical(\\\"lexicographic\\\")) := \\\"lexicographic\\\",\\n column :: posint := 1,\\n reverse :: truefalse := false\\n} )\\n local compare;\\n if ordering = \\\"lexicographic\\\" then\\n compare := (x,y)->evalb(`if`(reverse,x[column]>=y[column],x[column]<=y[column]));\\n else\\n \\tcompare := (x,y)->`if`(reverse,ordering(x[column],y),ordering(y,x));\\n end if;\\n sort( input, compare );\\nend proc:\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"> L := [[1, 2], [3, 4], [-5, 7]]:\\n> OptionalSort(L);\\n [[-5, 7], [1, 2], [3, 4]]\\n> OptionalSort(L, reverse);\\n [[3, 4], [1, 2], [-5, 7]]\\n> OptionalSort(L, reverse, column = 2);\\n [[-5, 7], [3, 4], [1, 2]]\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Options[OptionalSort]={ordering->lexicographic,column->1,reverse-> False};\\nOptionalSort[x_List,OptionsPattern[]]:=If[OptionValue[reverse]==True,\\nSortBy[x ,#[[OptionValue[column]]]&]//Reverse,\\nSortBy[x,#[[OptionValue[column]]]&] ]\\n\\nOptionalSort[{{\\\"a\\\" ,\\\"b\\\", \\\"c\\\"}, {\\\"\\\", \\\"q\\\", \\\"z\\\"},{\\\"zap\\\" ,\\\"zip\\\", \\\"Zot\\\"}} ]\\n->{{,q,z},{a,b,c},{zap,zip,Zot}}\\n\\nOptionalSort[{{\\\"a\\\" ,\\\"b\\\", \\\"c\\\"}, {\\\"\\\", \\\"q\\\", \\\"z\\\"},{\\\"zap\\\" ,\\\"zip\\\", \\\"Zot\\\"}},{ordering->lexicographic,column->2,reverse-> True} ]\\n->{{zap,zip,Zot},{,q,z},{a,b,c}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Sorter (table : list[list[string]], ordering = \\\"lexicographic\\\", column = 0, reverse = false) : list[list[string]]\\n{\\n // implementation goes here\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"import algorithm, strutils, sugar\\n\\nproc printTable(a: seq[seq[string]]) =\\n for row in a:\\n for x in row: stdout.write x, repeat(' ', 4 - x.len)\\n echo \\\"\\\"\\n echo \\\"\\\"\\n\\nproc sortTable(a: seq[seq[string]], column = 0, reverse = false,\\n ordering: (proc(a,b: string): int) = system.cmp) : seq[seq[string]] =\\n let order = if reverse: Descending else: Ascending\\n result = a\\n result.sort(proc(x,y:seq[string]):int = ordering(x[column],y[column]), order)\\n\\nconst data = @[@[\\\"a\\\", \\\"b\\\", \\\"c\\\"], @[\\\"\\\", \\\"q\\\", \\\"z\\\"], @[\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]]\\n\\nprintTable data\\nprintTable sortTable(data)\\nprintTable sortTable(data, column = 2)\\nprintTable sortTable(data, column = 1)\\nprintTable sortTable(data, column = 1, reverse = true)\\nprintTable sortTable(data, ordering = (a,b) => cmp[int](b.len,a.len))\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"typedef enum { kOrdNone, kOrdLex, kOrdByAddress, kOrdNumeric } SortOrder;\\n\\n@interface MyArray : NSObject {}\\n// . . .\\n@end\\n\\n@implementation MyArray\\n\\n- (void)sort {\\n [self sortWithOrdering:kOrdLex onColumn:0 reversed:NO];\\n}\\n\\n- (void)sortWithOrdering:(SortOrder)ord {\\n [self sortWithOrdering:ord onColumn:0 reversed:NO];\\n}\\n\\n- (void)sortWithOrdering:(SortOrder)ord onColumn:(int)col {\\n [self sortWithOrdering:ord onColumn:col reversed:NO];\\n}\\n\\n- (void)sortWithOrdering:(SortOrder)ord onColumn:(int)col reversed:(BOOL)rev {\\n // . . . Actual sort goes here . . .\\n}\\n\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"let sort_table ?(ordering = compare) ?(column = 0) ?(reverse = false) table =\\n let cmp x y = ordering (List.nth x column) (List.nth y column) * (if reverse then -1 else 1) in\\n List.sort cmp table\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"# let data = [[\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]; [\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]];;\\nval data : string list list =\\n [[\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]; [\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]]\\n# sort_table data;;\\n- : string list list =\\n[[\\\"\\\"; \\\"q\\\"; \\\"z\\\"]; [\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]]\\n# sort_table ~column:2 data;;\\n- : string list list =\\n[[\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]; [\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]]\\n# sort_table ~column:1 data;;\\n- : string list list =\\n[[\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]; [\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]]\\n# sort_table ~column:1 ~reverse:true data;;\\n- : string list list =\\n[[\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]; [\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]]\\n# sort_table ~ordering:(fun a b -> compare (String.length b) (String.length a)) data;;\\n- : string list list =\\n[[\\\"zap\\\"; \\\"zip\\\"; \\\"Zot\\\"]; [\\\"a\\\"; \\\"b\\\"; \\\"c\\\"]; [\\\"\\\"; \\\"q\\\"; \\\"z\\\"]]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"declare\\n class Table\\n attr\\n rows\\n\\n meth init(Rows)\\n rows := Rows\\n end\\n\\n meth sort(ordering:O<=Lexicographic column:C<=1 reverse:R<=false)\\n fun {Predicate Row1 Row2}\\n Res = {O {Nth Row1 C} {Nth Row2 C}}\\n in\\n if R then {Not Res} else Res end\\n end\\n in\\n rows := {Sort @rows Predicate}\\n end\\n end\\n\\n fun {Lexicographic As Bs} %% omitted for brevity\\n end\\n\\n T = {New Table init([[\\\"a\\\" \\\"b\\\" \\\"c\\\"] [\\\"\\\" \\\"q\\\" \\\"z\\\"] [\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"]])}\\nin\\n {T sort}\\n {T sort(column:3)}\\n {T sort(column:2)}\\n {T sort(column:2 reverse:true)}\\n {T sort(ordering:fun {$ A B} {Length B} < {Length A} end)}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"sort(v, ordering=0, column=0, reverse=0)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"/*\\nGP;install(\\\"test_func\\\", \\\"vDG\\\", \\\"test\\\", \\\"path/to/test.gp.so\\\");\\n*/\\nvoid\\ntest_func(GEN x) {\\n if (x == NULL)\\n pari_printf(\\\"Argument omitted.\\\\n\\\");\\n else\\n pari_printf(\\\"Argument was: %Ps\\\\n\\\", x);\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"sub sorttable\\n {my @table = @{shift()};\\n my %opt =\\n (ordering => sub {$_[0] cmp $_[1]}, column => 0, reverse => 0, @_);\\n my $col = $opt{column};\\n my $func = $opt{ordering};\\n my @result = sort\\n {$func->($a->[$col], $b->[$col])}\\n @table;\\n return ($opt{reverse} ? [reverse @result] : \\\\@result);}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"my $a = [[\\\"a\\\", \\\"b\\\", \\\"c\\\"], [\\\"\\\", \\\"q\\\", \\\"z\\\"], [\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]];\\nforeach (@{sorttable $a, column => 1, reverse => 1})\\n {foreach (@$_)\\n {printf \\\"%-5s\\\", $_;}\\n print \\\"\\\\n\\\";}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">increment</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">inc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">inc</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">increment</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- shows 6</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">increment</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- shows 7</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d records sorted in %3.2s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">records</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sortcol</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">sortdir</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">by_column</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">sortdir</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">compare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">sortcol</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">sortcol</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tags</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">table_size</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {1,2,..table_size}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">click_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">self</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">pStatus</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">...</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">sortc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"SORTSIGN%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sortdir</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">IupGetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">self</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sortc</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #008000;\\\">\\\"DOWN\\\"</span><span style=\\\"color: #0000FF;\\\">?-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">self</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sortc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sortdir</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"UP\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"DOWN\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">sortcol</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #000000;\\\">tags</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">custom_sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">routine_id</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"by_column\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">tags</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">value_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*self*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tags</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def mypower\\n\\t1 tolist flatten len\\n\\t1 == if\\n\\t\\t1 get 2\\n\\telse\\n\\t\\t2 get swap 1 get rot\\n\\tendif\\n\\tpower\\n\\tnip\\nenddef\\n\\n\\\"2 ^2 = \\\" print 2 mypower print nl\\n\\\"2 ^3 = \\\" print 2 3 2 tolist mypower print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef mypower\\n\\t1 tolist flatten len\\n\\t1 == if\\n\\t\\tpop drop 2\\n\\telse\\n\\t\\tpop pop drop\\n\\tendif\\n\\tpower\\nenddef\\n\\n\\\"2 ^2: \\\" print 2 mypower ?\\n\\\"2 ^3: \\\" print ( 2 3 ) mypower ?\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n( ( \\\"a\\\" \\\"b\\\" \\\"c\\\" )\\n ( \\\"\\\" \\\"q\\\" \\\"z\\\" )\\n ( \\\"zap\\\" \\\"zip\\\" \\\"Zot\\\" ) )\\n\\n\\ndef mysort /# column reverse #/\\n len >ps\\n tps 0 == if drop ( 1 false ) endif\\n ps> 1 == if false 0 put endif\\n pop swap >ps pop drop swap\\n len for var i\\n i get\\n tps extract swap 1 put\\n i set\\n endfor\\n sort\\n swap if reverse endif\\n len for var i\\n i get\\n pop swap tps put\\n i set\\n endfor\\n ps> drop\\nenddef\\n\\npstack\\n( ) mysort pstack\\n( 3 ) mysort pstack\\n( 2 ) mysort pstack\\n( 2 true ) mysort pstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"(de sortTable (Tbl . @)\\n (let (Ordering prog Column 1 Reverse NIL) # Set defaults\\n (bind (rest) # Bind optional params\\n (setq Tbl\\n (by '((L) (Ordering (get L Column)))\\n sort\\n Tbl ) )\\n (if Reverse (flip Tbl) Tbl) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \">>> def printtable(data):\\n for row in data:\\n print ' '.join('%-5s' % ('\\\"%s\\\"' % cell) for cell in row)\\n\\n\\n>>> import operator\\n>>> def sorttable(table, ordering=None, column=0, reverse=False):\\n return sorted(table, cmp=ordering, key=operator.itemgetter(column), reverse=reverse)\\n\\n>>> data = [[\\\"a\\\", \\\"b\\\", \\\"c\\\"], [\\\"\\\", \\\"q\\\", \\\"z\\\"], [\\\"zap\\\", \\\"zip\\\", \\\"Zot\\\"]]\\n>>> printtable(data)\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n>>> printtable( sorttable(data) )\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n>>> printtable( sorttable(data, column=2) )\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n>>> printtable( sorttable(data, column=1) )\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n>>> printtable( sorttable(data, column=1, reverse=True) )\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n>>> printtable( sorttable(data, ordering=lambda a,b: cmp(len(b),len(a))) )\\n\\\"zap\\\" \\\"zip\\\" \\\"Zot\\\"\\n\\\"a\\\" \\\"b\\\" \\\"c\\\"\\n\\\"\\\" \\\"q\\\" \\\"z\\\"\\n>>>\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"tablesort <- function(x, ordering=\\\"lexicographic\\\", column=1, reverse=false)\\n{\\n # Implementation\\n}\\n\\n# Usage is e.g.\\ntablesort(mytable, column=3)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (sort-table table\\n [ordering string<=?]\\n [column 0]\\n [reverse? #f])\\n (sort table (if reverse?\\n (negate ordering)\\n ordering)\\n #:key (λ (row) (list-ref row column))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"method sorttable(:$column = 0, :$reverse, :&ordering = &infix:<cmp>) {\\n my @result = self»[$column].sort: &ordering;\\n return $reverse ?? @result.reverse !! @result;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"method sorttable-pos($column = 0, $reverse?, &ordering = &infix:<cmp>) {\\n my @result = self»[$column].sort: &ordering;\\n return $reverse ?? @result.reverse !! @result;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sortStrings: procedure expose @. /*the stemmed array is named: @. */\\ncol= 1 /*set some defaults (here and below). */\\nreverse= 'NO'\\norder= 'LEXICOGRAPHIC'\\narg options /*obtain the options (in uppercase). */\\n do j=1 for words(options) /*examine all the words (options). */\\n x= word(options, j)\\n select\\n when datatype(x, 'W') then col= x / 1 /*normalize the number. */\\n when pos('=', x)==0 then order= x /*has it an equal sign? */\\n otherwise parse var x nam '=' value /*get value.*/\\n end /*select*/\\n end /*j*/\\n\\n /*╔═══════════════════════════════════════════════════════════╗\\n ║ check for errors here: COL isn't a positive integer ···, ║\\n ║ REVERSE value isn't NO or YES, ║\\n ║ ORDER value is recognized ··· ║\\n ╚═══════════════════════════════════════════════════════════╝*/\\n\\n ... main body of string sort here ...\\n\\nreturn /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX example uses the SortStrings subroutine with some (passed) optional arguments. */\\n\\n\\n@.1= 'one'; @.2= \\\"two\\\"; @.3= 'three' /*define an array (@.) of strings here.*/\\n\\n\\ncall sortStrings 'Reverse=no' 3\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"def table_sort(table, ordering=:<=>, column=0, reverse=false)\\n # ...\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def table_sort(table, ordering: :<=>, column: 0, reverse: false)\\n p = ordering.to_proc\\n if reverse\\n table.sort {|a, b| p.(b[column], a[column])}\\n else\\n table.sort {|a, b| p.(a[column], b[column])}\\n end\\nend\\n\\n# Quick example:\\ntable = [\\n [\\\"Ottowa\\\", \\\"Canada\\\"],\\n [\\\"Washington\\\", \\\"USA\\\"],\\n [\\\"Mexico City\\\", \\\"Mexico\\\"],\\n]\\np table_sort(table, column: 1)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def table_sort(table, opts = {})\\n defaults = {:ordering => :<=>, :column => 0, :reverse => false}\\n opts = defaults.merge(opts)\\n\\n c = opts[:column]\\n p = opts[:ordering].to_proc\\n if opts[:reverse]\\n table.sort {|a, b| p.call(b[c], a[c])}\\n else\\n table.sort {|a, b| p.call(a[c], b[c])}\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::cmp::Ordering;\\n\\nstruct Table {\\n rows: Vec<Vec<String>>,\\n ordering_function: fn(&str, &str) -> Ordering,\\n ordering_column: usize,\\n reverse: bool,\\n}\\n\\nimpl Table {\\n fn new(rows: Vec<Vec<String>>) -> Table {\\n Table {\\n rows: rows,\\n ordering_column: 0,\\n reverse: false,\\n ordering_function: |str1, str2| str1.cmp(str2),\\n }\\n }\\n}\\n\\nimpl Table {\\n fn with_ordering_column(&mut self, ordering_column: usize) -> &mut Table {\\n self.ordering_column = ordering_column;\\n self\\n }\\n\\n fn with_reverse(&mut self, reverse: bool) -> &mut Table {\\n self.reverse = reverse;\\n self\\n }\\n\\n fn with_ordering_fun(&mut self, compare: fn(&str, &str) -> Ordering) -> &mut Table {\\n self.ordering_function = compare;\\n self\\n }\\n\\n fn sort(&mut self) {\\n let fun = &mut self.ordering_function;\\n let idx = self.ordering_column;\\n if self.reverse {\\n self.rows\\n .sort_unstable_by(|vec1, vec2| (fun)(&vec1[idx], &vec2[idx]).reverse());\\n } else {\\n self.rows\\n .sort_unstable_by(|vec1, vec2| (fun)(&vec1[idx], &vec2[idx]));\\n }\\n }\\n}\\n\\n#[cfg(test)]\\nmod test {\\n use super::Table;\\n\\n fn generate_test_table() -> Table {\\n Table::new(vec![\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n ])\\n }\\n\\n #[test]\\n fn test_simple_sort() {\\n let mut table = generate_test_table();\\n table.sort();\\n assert_eq!(\\n table.rows,\\n vec![\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n ],\\n )\\n }\\n\\n #[test]\\n fn test_ordering_column() {\\n let mut table = generate_test_table();\\n table.with_ordering_column(1).sort();\\n assert_eq!(\\n table.rows,\\n vec![\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n ],\\n )\\n }\\n\\n #[test]\\n fn test_with_reverse() {\\n let mut table = generate_test_table();\\n table.with_reverse(true).sort();\\n assert_eq!(\\n table.rows,\\n vec![\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n ],\\n )\\n }\\n\\n #[test]\\n fn test_custom_ordering_fun() {\\n let mut table = generate_test_table();\\n // Simple ordering function that reverses stuff.\\n // Should operate like the test before.\\n table.with_ordering_fun(|x, y| x.cmp(y).reverse()).sort();\\n assert_eq!(\\n table.rows,\\n vec![\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n ],\\n )\\n }\\n\\n #[test]\\n fn test_everything_together() {\\n let mut table = generate_test_table();\\n // Using the reversing cmp function, then reverse (= don't do anything)\\n // then sort from column 1.\\n table\\n .with_ordering_fun(|x, y| x.cmp(y).reverse())\\n .with_reverse(true)\\n .with_ordering_column(1)\\n .sort();\\n assert_eq!(\\n table.rows,\\n vec![\\n vec![\\\"2\\\".to_string(), \\\"aab\\\".to_string()],\\n vec![\\\"1\\\".to_string(), \\\"ccc\\\".to_string()],\\n vec![\\\"0\\\".to_string(), \\\"fff\\\".to_string()],\\n ],\\n )\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" def sortTable(data: List[List[String]],\\n ordering: (String, String) => Boolean = (_ < _),\\n column: Int = 0,\\n reverse: Boolean = false) = {\\n val result = data.sortWith((a, b) => ordering(a(column), b(column)))\\n if (reverse) result.reverse else result\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"val data=List(List(\\\"a\\\",\\\"b\\\",\\\"c\\\"), List(\\\"\\\",\\\"q\\\",\\\"z\\\"), List(\\\"zap\\\",\\\"zip\\\",\\\"Zot\\\"))\\nprintln(data)\\n //-> List(List(a, b, c), List(, q, z), List(zap, zip, Zot))\\nprintln(sortTable(data))\\n //-> List(List(, q, z), List(a, b, c), List(zap, zip, Zot))\\nprintln(sortTable(data, reverse=true))\\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\\nprintln(sortTable(data, column=2))\\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\\nprintln(sortTable(data, ((a, b)=> b.size<a.size)))\\n //-> List(List(zap, zip, Zot), List(a, b, c), List(, q, z))\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func table_sort(table, ordering: '<=>', column: 0, reverse: false) {\\n if (reverse) {\\n table.sort {|a,b| b[column].$ordering(a[column])}\\n } else {\\n table.sort {|a,b| a[column].$ordering(b[column])}\\n }\\n}\\n\\n# Quick example:\\nvar table = [\\n [\\\"Ottowa\\\", \\\"Canada\\\"],\\n [\\\"Washington\\\", \\\"USA\\\"],\\n [\\\"Mexico City\\\", \\\"Mexico\\\"],\\n];\\n\\nsay table_sort(table, column: 1);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"class String {\\n method my_sort(arg) {\\n (self.len <=> arg.len) ->\\n || (self.lc <=> arg.lc) ->\\n || (self <=> arg)\\n }\\n}\\n\\nsay table_sort(table, column: 1, ordering: 'my_sort');\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"s@(Sequence traits) tableSort &column: column &sortBy: sortBlock &reverse: reverse\\n[\\n column `defaultsTo: 0.\\n sortBlock `defaultsTo: [| :a :b | (a lexicographicallyCompare: b) isNegative].\\n (reverse `defaultsTo: False)\\n ifTrue: [sortBlock := [| :a :b | (sortBlock applyTo: {a. b}) not]].\\n s sortBy: [| :a :b | sortBlock applyTo: {a at: column. b at: column}]\\n].\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"enum SortOrder { case kOrdNone, kOrdLex, kOrdByAddress, kOrdNumeric }\\n\\nfunc sortTable(table: [[String]], less: (String,String)->Bool = (<), column: Int = 0, reversed: Bool = false) {\\n // . . . Actual sort goes here . . .\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc tablesort {table {ordering \\\"\\\"} {column 0} {reverse 0}} {\\n set direction [expr {$reverse ? \\\"-decreasing\\\" : \\\"-increasing\\\"}]\\n if {$ordering ne \\\"\\\"} {\\n lsort -command $ordering $direction -index $column $table\\n } else {\\n lsort $direction -index $column $table\\n }\\n}\\n\\nputs [tablesort $data]\\nputs [tablesort $data \\\"\\\" 1]\\nputs [tablesort $data \\\"\\\" 0 1]\\nputs [tablesort $data {\\n apply {{a b} {expr {[string length $a]-[string length $b]}}}\\n}]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require Tcl 8.5; # Only for the list expansion syntax\\n\\nproc tablesort {table args} {\\n array set opt {ordering \\\"\\\" column 0 reverse 0}\\n array set opt $args\\n set pars [list -index $opt(column)]\\n if {$opt(reverse)} {lappend pars -decreasing}\\n if {$opt(ordering) ne \\\"\\\"} {lappend pars -command $opt(ordering)}\\n lsort {*}$pars $table\\n}\\n\\nputs [tablesort $data]\\nputs [tablesort $data column 1]\\nputs [tablesort $data column 0]\\nputs [tablesort $data column 0 reverse 1]\\nputs [tablesort $data ordering {\\n apply {{a b} {expr {[string length $b]-[string length $a]}}}\\n}]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"function sorter(table, ordering = \\\"lexicographic\\\", column = 0, reverse = false) {\\n // ...\\n}\\n\\nsorter(the_data,\\\"numeric\\\");\\n\",\n \"language\": \"TIScript\"\n },\n {\n \"code\": \"#!/usr/bin/env bash\\n# sort-args.sh\\n\\ndata() {\\n cat <<EOF\\n 123 456 0789\\n 456 0789 123\\n 0789 123 456\\nEOF\\n}\\n\\n# sort_table [column NUM | KIND | reverse] ... <INPUT >OUTPUT\\n# KIND = lexicographical | numeric | human\\n\\nsort_table() {\\n local opts='-b'\\n local column=1\\n while (( $# > 0 )) ; do\\n case \\\"$1\\\" in\\n column|col|c) column=${2?Missing column number} ; shift ;;\\n lexicographical|lex|l) opts+=' -d' ;;\\n numeric|num|n) opts+=' -g' ;;\\n human|hum|h) opts+=' -h' ;;\\n reverse|rev|r) opts+=' -r' ;;\\n esac\\n shift\\n done\\n eval \\\"sort $opts -k $column,$column -\\\"\\n}\\n\\necho sort defaults ; data | sort_table\\necho sort defaults reverse ; data | sort_table reverse\\necho sort column 2 ; data | sort_table col 2\\necho sort column 2 reverse ; data | sort_table col 2 reverse\\necho sort numeric ; data | sort_table numeric\\necho sort numeric reverse ; data | sort_table numeric reverse\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\nss ::\\n\\nordering %fZ ~ordering||lleq!\\ncolumn %n ~column||1!\\nreversed %b\\n\\nsorter = +^(~reversed?/~&x! ~&!,-<+ +^/~ordering ~~+ ~&h++ //skip+ predecessor+ ~column)\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"example_table =\\n\\n<\\n <'foo','b '>,\\n <'barr','a '>,\\n <'bazzz','c'>>\\n\\n#cast %sLLL\\n\\nexamples =\\n\\n<\\n (sorter ss&) example_table, # default sorting algorithm\\n (sorter ss[ordering: leql]) example_table, # sort by field lengths but otherwise default\\n (sorter ss[column: 2]) example_table, # etc.\\n (sorter ss[reversed: true]) example_table,\\n (sorter ss[reversed: true,column: 2]) example_table>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Private Sub optional_parameters(theRange As String, _\\n Optional ordering As Integer = 0, _\\n Optional column As Integer = 1, _\\n Optional reverse As Integer = 1)\\n ActiveSheet.Sort.SortFields.Clear\\n ActiveSheet.Sort.SortFields.Add _\\n Key:=Range(theRange).Columns(column), _\\n SortOn:=SortOnValues, _\\n Order:=reverse, _\\n DataOption:=ordering 'the optional parameter ordering and above reverse\\n With ActiveSheet.Sort\\n .SetRange Range(theRange)\\n .Header = xlGuess\\n .MatchCase = False\\n .Orientation = xlTopToBottom\\n .SortMethod = xlPinYin\\n .Apply\\n End With\\nEnd Sub\\nPublic Sub main()\\n 'Sort the strings in the active sheet in Excel\\n 'Supply the range of cells to be sorted\\n 'Optionally specify ordering, default is 0,\\n 'which is normal sort, text and data separately;\\n 'ordering:=1 treats text as numeric data.\\n 'Optionally specify column number, default is 1\\n 'Optionally specify reverse, default is 1\\n 'which sorts in ascending order.\\n 'Specifying reverse:=2 will sort in descending order.\\n optional_parameters theRange:=\\\"A1:C4\\\", ordering:=1, column:=2, reverse:=1\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./sort\\\" for Cmp, Sort\\nimport \\\"./seq\\\" for Lst\\n\\nclass TableSorter {\\n // uses 'merge' sort to avoid mutating original table\\n // column is zero based\\n static sort(table, ordering, column, reverse) {\\n if (ordering == null) ordering = Fn.new { |r1, r2| Cmp.string.call(r1[column], r2[column]) }\\n var sorted = Sort.merge(table, ordering)\\n if (reverse) Lst.reverse(sorted)\\n return sorted\\n }\\n\\n // overloads to simulate optional parameters\\n static sort(table) { sort(table, null, 0, false) }\\n static sort(table, ordering) { sort(table, ordering, 0, false) }\\n static sort(table, ordering, column) { sort(table, ordering, column, false) }\\n}\\n\\nvar table = [\\n [\\\"first\\\", \\\"1\\\"],\\n [\\\"second\\\", \\\"2\\\"],\\n [\\\"fourth\\\", \\\"4\\\"],\\n [\\\"fifth\\\", \\\"5\\\"],\\n [\\\"third\\\", \\\"3\\\"]\\n]\\n\\nSystem.print(\\\"Original table:\\\")\\nSystem.print(table.join(\\\"\\\\n\\\"))\\n\\nSystem.print(\\\"\\\\nAfter lexicographic sort by first column:\\\")\\nvar table2 = TableSorter.sort(table)\\nSystem.print(table2.join(\\\"\\\\n\\\"))\\n\\nSystem.print(\\\"\\\\nAfter sorting in length order of first column:\\\")\\nvar ordering = Fn.new { |r1, r2| (r1[0].count - r2[0].count).sign }\\ntable2 = TableSorter.sort(table, ordering)\\nSystem.print(table2.join(\\\"\\\\n\\\"))\\n\\nSystem.print(\\\"\\\\nAfter lexicographic sort by second column:\\\")\\ntable2 = TableSorter.sort(table, null, 1)\\nSystem.print(table2.join(\\\"\\\\n\\\"))\\n\\nSystem.print(\\\"\\\\nAfter reverse lexicographic sort by second column:\\\")\\ntable2 = TableSorter.sort(table, null, 1, true)\\nSystem.print(table2.join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"<xsl:template name=\\\"sort\\\">\\n <xsl:param name=\\\"table\\\" />\\n <xsl:param name=\\\"ordering\\\" select=\\\"'lexicographic'\\\" />\\n <xsl:param name=\\\"column\\\" select=\\\"1\\\" />\\n <xsl:param name=\\\"reversed\\\" select=\\\"false()\\\" />\\n ...\\n</xsl:template>\\n\",\n \"language\": \"XSLT\"\n },\n {\n \"code\": \"sub power(n, p)\\n\\tif numparams = 1 p = 2\\n\\treturn n^p\\nend sub\\n\\nprint power(2)\\nprint power(2, 3)\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"const lex=\\\"L\\\";\\nfcn mystrySort(table,ordering=lex,column=0,reverse=False,other){\\n vm.arglist.println();\\n}\\nmystrySort.prototype.println();\\nmystrySort(\\\"table\\\");\\nmystrySort(\\\"table\\\",lex,1);\\nmystrySort(\\\"table\\\",lex,1,True,D(\\\"row\\\",35,\\\"type\\\",\\\"foobar\\\"));\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Optional-parameters"}}},{"rowIdx":1467,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Order_by_pair_comparisons\nnote: Sorting Algorithms\n","language":"00-META"},{"code":"{{Sorting Algorithm}}\n[[Category:Sorting]]\n\nAssume we have a set of items that can be sorted into an order by the user.\n\nThe user is presented with pairs of items from the set in ''no'' order,\nthe user states which item\nis less than, equal to, or greater than the other (with respect to their\nrelative positions if fully ordered).\n\nWrite a function that given items that the user can order, '''asks the user''' to\ngive the result of ''comparing two items at a time'' and uses the comparison results\nto eventually return the items in order. \n\nTry and minimise the comparisons the user is asked for.\n\nShow on this page, the function ordering the colours of the rainbow:\n violet red green indigo blue yellow orange\n\nThe correct ordering being:\n red orange yellow green blue indigo violet\n\nNote:\n* Asking for/receiving user comparisons is a part of the task.\n* Code ''inputs'' should not assume an ordering.\n* The seven colours can form twenty-one different pairs.\n* A routine that does not ask the user \"too many\" comparison questions should be used.\n<br><br>\n\n","language":"00-TASK"},{"code":"F user_cmp(String a, b)\n R Int(input(‘IS #6 <, ==, or > #6 answer -1, 0 or 1:’.format(a, b)))\n\nV items = ‘violet red green indigo blue yellow orange’.split(‘ ’)\nV ans = sorted(items, key' cmp_to_key(user_cmp))\nprint(\"\\n\"ans.join(‘ ’))\n","language":"11l"},{"code":"DEFINE PTR=\"CARD\"\n\nPROC PrintArray(PTR ARRAY a BYTE size)\n BYTE i\n\n Put('[)\n FOR i=0 TO size-1\n DO\n IF i>0 THEN Put(' ) FI\n Print(a(i))\n OD\n Put(']) PutE()\nRETURN\n\nBYTE FUNC IsBefore(CHAR ARRAY a,b)\n DEFINE NO_KEY=\"255\"\n DEFINE KEY_Y=\"43\"\n DEFINE KEY_N=\"35\"\n BYTE CH=$02FC ;Internal hardware value for last key pressed\n BYTE k\n\n PrintF(\"Is %S before %S (y/n)? \",a,b)\n CH=NO_KEY ;Flush the keyboard\n DO\n k=CH\n UNTIL k=KEY_Y OR k=KEY_N\n OD\n CH=NO_KEY ;Flush the keyboard\n IF k=KEY_Y THEN\n PrintE(\"yes\")\n RETURN (1)\n FI\n PrintE(\"no\")\nRETURN (0)\n\nPROC InteractiveInsertionSort(PTR ARRAY a BYTE size)\n INT i,j\n PTR value\n\n FOR i=1 TO size-1\n DO\n value=a(i)\n j=i-1\n WHILE j>=0 AND IsBefore(value,a(j))=1\n DO\n a(j+1)=a(j)\n j==-1\n OD\n a(j+1)=value\n OD\nRETURN\n\nPROC Main()\n DEFINE COUNT=\"7\"\n PTR ARRAY arr(COUNT)\n\n arr(0)=\"violet\" arr(1)=\"red\"\n arr(2)=\"green\" arr(3)=\"indigo\"\n arr(4)=\"blue\" arr(5)=\"yellow\"\n arr(6)=\"orange\"\n\n Print(\"Shuffled array: \")\n PrintArray(arr,COUNT) PutE()\n\n InteractiveInsertionSort(arr,COUNT)\n PutE() Print(\"Sorted array: \")\n PrintArray(arr,COUNT)\nRETURN\n","language":"Action-"},{"code":"lst: [\"violet\" \"red\" \"green\" \"indigo\" \"blue\" \"yellow\" \"orange\"]\ncount: 0\n\nfindSpot: function [l,e][\n if empty? l -> return 0\n\n loop.with:'i l 'item [\n answer: input ~\"Is |item| greater than |e| [y/n]? \"\n if answer=\"y\" -> return i\n ]\n return dec size l\n]\n\nsortedLst: new []\n\nloop lst 'element ->\n insert 'sortedLst findSpot sortedLst element element\n\nprint \"\"\nprint [\"sorted =>\" sortedLst]\n","language":"Arturo"},{"code":"data := [\"Violet\", \"Red\", \"Green\", \"Indigo\", \"Blue\", \"Yellow\", \"Orange\"]\nresult := [], num := 0, Questions :=\"\"\n\nfor i, Color1 in data{\n found :=false\n if !result.count(){\n result.Push(Color1)\n continue\n }\n\n for j, Color2 in result\t{\n if (color1 = color2)\n continue\n MsgBox, 262180,, % (Q := \"Q\" ++num \" is \" Color1 \" > \" Color2 \"?\")\n ifMsgBox, Yes\n Questions .= Q \"`t`tYES`n\"\n else {\n Questions .= Q \"`t`tNO`n\"\n result.InsertAt(j, Color1)\n found := true\n break\n }\n }\n if !found\n result.Push(Color1)\n}\nfor i, color in result\n output .= color \", \"\nMsgBox % Questions \"`nSorted Output :`n\" Trim(output, \", \")\nreturn\n","language":"AutoHotkey"},{"code":"#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint interactiveCompare(const void *x1, const void *x2)\n{\n const char *s1 = *(const char * const *)x1;\n const char *s2 = *(const char * const *)x2;\n static int count = 0;\n printf(\"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \", ++count, s1, s2);\n int response;\n scanf(\"%d\", &response);\n return response;\n}\n\nvoid printOrder(const char *items[], int len)\n{\n printf(\"{ \");\n for (int i = 0; i < len; ++i) printf(\"%s \", items[i]);\n printf(\"}\\n\");\n}\n\nint main(void)\n{\n const char *items[] =\n {\n \"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"\n };\n\n qsort(items, sizeof(items)/sizeof(*items), sizeof(*items), interactiveCompare);\n printOrder(items, sizeof(items)/sizeof(*items));\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool InteractiveCompare(const string& s1, const string& s2)\n{\n if(s1 == s2) return false; // don't ask to compare items that are the same\n static int count = 0;\n string response;\n cout << \"(\" << ++count << \") Is \" << s1 << \" < \" << s2 << \"? \";\n getline(cin, response);\n return !response.empty() && response.front() == 'y';\n}\n\nvoid PrintOrder(const vector<string>& items)\n{\n cout << \"{ \";\n for(auto& item : items) cout << item << \" \";\n cout << \"}\\n\";\n}\n\nint main()\n{\n const vector<string> items\n {\n \"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"\n };\n\n vector<string> sortedItems;\n\n // Use a binary insertion sort to order the items. It should ask for\n // close to the minimum number of questions required\n for(auto& item : items)\n {\n cout << \"Inserting '\" << item << \"' into \";\n PrintOrder(sortedItems);\n // lower_bound performs the binary search using InteractiveCompare to\n // rank the items\n auto spotToInsert = lower_bound(sortedItems.begin(),\n sortedItems.end(), item, InteractiveCompare);\n sortedItems.insert(spotToInsert, item);\n }\n PrintOrder(sortedItems);\n return 0;\n}\n","language":"C++"},{"code":"#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nbool InteractiveCompare(const string& s1, const string& s2)\n{\n if(s1 == s2) return false; // don't ask to compare items that are the same\n static int count = 0;\n string response;\n cout << \"(\" << ++count << \") Is \" << s1 << \" < \" << s2 << \"? \";\n getline(cin, response);\n return !response.empty() && response.front() == 'y';\n}\n\nvoid PrintOrder(const vector<string>& items)\n{\n cout << \"{ \";\n for(auto& item : items) cout << item << \" \";\n cout << \"}\\n\";\n}\n\nint main()\n{\n vector<string> items\n {\n \"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"\n };\n\n sort(items.begin(), items.end(), InteractiveCompare);\n PrintOrder(items);\n return 0;\n}\n","language":"C++"},{"code":"100 REM SORT BY COMPARISON\n110 DIM IN$(6), OU$(6)\n120 FOR I=0 TO 6:READ IN$(I): NEXT I\n130 DATA VIOLET,RED,GREEN,INDIGO,BLUE,YELLOW,ORANGE\n140 OU$(0)=IN$(0):N=1\n150 FOR I=1 TO 6\n160 : IN$=IN$(I)\n180 : GOSUB 390\n190 : FOR J=0 TO N-1\n200 : OU$ = OU$(J)\n210 : GOSUB 340\n220 : IF R>=0 THEN 280\n230 : FOR K=N TO J+1 STEP -1\n240 : OU$(K) = OU$(K-1)\n250 : NEXT K\n260 : OU$(J) = IN$\n270 : GOTO 300\n280 : NEXT J\n290 : OU$(N) = IN$\n300 : N=N+1\n310 NEXT I\n320 GOSUB 390\n330 END\n340 PRINT \"IS \"IN$\" < \"OU$\"? (Y/N)\";\n350 GET K$: IF K$<>\"Y\" AND K$<>\"N\" THEN 350\n360 PRINT K$\n370 R = K$=\"Y\"\n380 RETURN\n390 PRINT \"(\";\n400 IF N=1 THEN 420\n410 FOR Q=0 TO N-2:PRINT OU$(Q)\",\";:NEXT Q\n420 PRINT OU$(N-1)\")\"\n430 RETURN\n","language":"Commodore-BASIC"},{"code":"// Order by pair comparisons. Nigel Galloway: April 23rd., 2021\nlet clrs=let n=System.Random() in lN2p [|for g in 7..-1..2->n.Next(g)|] [|\"Red\";\"Orange\";\"Yellow\";\"Green\";\"Blue\";\"Indigo\";\"Violet\"|]\nlet rec fG n g=printfn \"Is %s less than %s\" n g; match System.Console.ReadLine() with \"Yes\"-> -1|\"No\"->1 |_->printfn \"Enter Yes or No\"; fG n g\nlet mutable z=0 in printfn \"%A sorted to %A using %d questions\" clrs (clrs|>Array.sortWith(fun n g->z<-z+1; fG n g)) z\n","language":"F-Sharp"},{"code":"USING: formatting io kernel math.order prettyprint qw sorting ;\n\nqw{ violet red green indigo blue yellow orange }\n[ \"Is %s > %s? (y/n) \" printf readln \"y\" = +gt+ +lt+ ? ] sort .\n","language":"Factor"},{"code":"Dim Shared As Byte r, n = 1\nDim Shared As String IN1, OU1\nDim Shared As String IN(6), OU(6)\nDim As Byte i, j, k\nFor i = 0 To 6 : Read IN(i) : Next i\nData \"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"\nOU(0) = IN(0)\n\nSub PrintOrder\n Print : Print \"{\";\n If n = 1 Then Print OU(n-1);\")\" : Exit Sub\n For q As Byte = 0 To n-2\n Print OU(q);\", \";\n Next q\n Print OU(n-1);\"}\"\nEnd Sub\n\nSub InteractiveCompare\n Dim As String*1 T\n Print \"Es \"; IN1; \" < \"; OU1; \"? (S/N) \";\n Do: T = Inkey$: Loop Until T <> \"\"\n If Instr(\"snSN\", T) Then Print Ucase(T)\n r = T = \"S\"\nEnd Sub\n\nFor i = 1 To 6\n IN1 = IN(i)\n For j = 0 To n-1\n OU1 = OU(j)\n InteractiveCompare\n If r < 0 Then\n For k = n To j+1 Step -1\n OU(k) = OU(k-1)\n Next k\n OU(j) = IN1\n n += 1\n Exit For, For\n End If\n Next j\n OU(n) = IN1\n n += 1\nNext i\nPrintOrder\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sort\"\n \"strings\"\n)\n\nvar count int = 0\n\nfunc interactiveCompare(s1, s2 string) bool {\n count++\n fmt.Printf(\"(%d) Is %s < %s? \", count, s1, s2)\n var response string\n _, err := fmt.Scanln(&response)\n return err == nil && strings.HasPrefix(response, \"y\")\n}\n\nfunc main() {\n items := []string{\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"}\n\n var sortedItems []string\n\n // Use a binary insertion sort to order the items. It should ask for\n // close to the minimum number of questions required\n for _, item := range items {\n fmt.Printf(\"Inserting '%s' into %s\\n\", item, sortedItems)\n // sort.Search performs the binary search using interactiveCompare to\n // rank the items\n spotToInsert := sort.Search(len(sortedItems), func(i int) bool {\n return interactiveCompare(item, sortedItems[i])\n })\n sortedItems = append(sortedItems[:spotToInsert],\n append([]string{item}, sortedItems[spotToInsert:]...)...)\n }\n fmt.Println(sortedItems)\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sort\"\n \"strings\"\n)\n\nvar count int = 0\n\ntype sortable []string\nfunc (s sortable) Len() int { return len(s) }\nfunc (s sortable) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\nfunc (s sortable) Less(i, j int) bool {\n s1, s2 := s[i], s[j]\n count++\n fmt.Printf(\"(%d) Is %s < %s? \", count, s1, s2)\n var response string\n _, err := fmt.Scanln(&response)\n return err == nil && strings.HasPrefix(response, \"y\")\n}\n\nfunc main() {\n items := sortable{\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"}\n sort.Sort(items)\n fmt.Println(items)\n}\n","language":"Go"},{"code":"import Control.Monad\nimport Control.Monad.ListM (sortByM, insertByM, partitionM, minimumByM)\nimport Data.Bool (bool)\nimport Data.Monoid\nimport Data.List\n\n--------------------------------------------------------------------------------\nisortM, msortM, tsortM :: Monad m => (a -> a -> m Ordering) -> [a] -> m [a]\n\n-- merge sort from the Control.Monad.ListM library\nmsortM = sortByM\n\n-- insertion sort\nisortM cmp = foldM (flip (insertByM cmp)) []\n\n-- tree sort aka qsort (which is not)\ntsortM cmp = go\n where\n go [] = pure []\n go (h:t) = do (l, g) <- partitionM (fmap (LT /=) . cmp h) t\n go l <+> pure [h] <+> go g\n (<+>) = liftM2 (++)\n","language":"Haskell"},{"code":"ask a b = do\n putStr $ show a ++ \" ≤ \" ++ show b ++ \" ? [y/n] \"\n bool GT LT . (\"y\" ==) <$> getLine\n\ncolors = [\"Violet\", \"Red\", \"Green\", \"Indigo\", \"Blue\", \"Yellow\", \"Orange\"]\n","language":"Haskell"},{"code":"test method = do\n mapM_ showHist $ hist res\n putStrLn $ \"Median number of comparisons: \" ++ show (median res)\n putStrLn $ \"Mean number of comparisons: \" ++ show (mean res)\n where\n res = getSum . fst . method cmp <$> permutations [1..7]\n cmp a b = (Sum 1, compare a b)\n median lst = sort lst !! (length lst `div` 2)\n mean lst = sum (fromIntegral <$> lst) / genericLength lst\n hist lst = (\\x -> (head x, length x)) <$> group (sort lst)\n showHist (n, l) = putStrLn line\n where\n line = show n ++ \"\\t\" ++ bar ++ \" \" ++ show perc ++ \"%\"\n bar = replicate (max perc 1) '*'\n perc = (100 * l) `div` product [1..7]\n","language":"Haskell"},{"code":"require'general/misc/prompt'\nsel=: {{ u#[ }}\n\nquicksort=: {{\n if. 1 >: #y do. y\n else.\n (u quicksort y u sel e),(y =sel e),u quicksort y u~ sel e=.y{~?#y\n end.\n}}\n\nptc=: {{\n t=. (+. +./ .*.~)^:_ y=1\n j=. I.,t+.|:t\n ($y)$(j{,t) j} ,y\n}}\n\naskless=: {{\n coord=. x ,&(items&i.) y\n lt=. LT {~<coord\n if. 1<lt do.\n lt=. 'y' e. tolower prompt 'Is ',(\":;x),' less than ',(\":;y),'? '\n LT=: ptc (lt,-.lt) (coord;|.coord)} LT\n end.\n lt\n}}\"0\n\nasksort=: {{\n items=: ~.y\n LT=: <:%=i.#items\n askless quicksort y\n}}\n","language":"J"},{"code":" asksort&.;:' violet red green indigo blue yellow orange'\nIs indigo less than violet? yes\nIs indigo less than red? no\nIs indigo less than green? no\nIs indigo less than blue? no\nIs indigo less than yellow? no\nIs indigo less than orange? no\nIs yellow less than red? no\nIs yellow less than green? yes\nIs yellow less than blue? yes\nIs yellow less than orange? no\nIs green less than blue? yes\nIs red less than orange? yes\nred orange yellow green blue indigo violet\n","language":"J"},{"code":"import java.util.*;\n\npublic class SortComp1 {\n public static void main(String[] args) {\n List<String> items = Arrays.asList(\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\");\n List<String> sortedItems = new ArrayList<>();\n Comparator<String> interactiveCompare = new Comparator<String>() {\n int count = 0;\n Scanner s = new Scanner(System.in);\n public int compare(String s1, String s2) {\n System.out.printf(\"(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: \", ++count, s1, s2);\n return s.nextInt();\n }\n };\n for (String item : items) {\n System.out.printf(\"Inserting '%s' into %s\\n\", item, sortedItems);\n int spotToInsert = Collections.binarySearch(sortedItems, item, interactiveCompare);\n // when item does not equal an element in sortedItems,\n // it returns bitwise complement of insertion point\n if (spotToInsert < 0) spotToInsert = ~spotToInsert;\n sortedItems.add(spotToInsert, item);\n }\n System.out.println(sortedItems);\n }\n}\n","language":"Java"},{"code":"import java.util.*;\n\npublic class OrderByPair {\n public static void main(String[] args) {\n List<String> items = Arrays.asList(\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\");\n Collections.sort(items, new Comparator<String>() {\n int count = 0;\n Scanner s = new Scanner(System.in);\n public int compare(String s1, String s2) {\n System.out.printf(\"(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: \", ++count, s1, s2);\n return s.nextInt();\n }\n });\n System.out.println(items);\n }\n}\n","language":"Java"},{"code":"def inputOption($prompt; $options):\n def r:\n $prompt | stderr\n | input as $in\n | if $in|test($options) then $in else r end;\n r;\n\n# Inserts item $x in the array input, which is kept sorted as per user input\n# assuming it is already sorted. $q is the prompt number.\n# Input: [$q; $a]\n# Output: [$qPrime, $aPrime]\ndef insortRight($x):\n . as [$q, $a]\n | { lo: 0, hi: ($a|length), $q }\n | until( .lo >= .hi;\n ( ((.lo + .hi)/2)|floor) as $mid\n | .q += 1\n | \"\\(.q): Is \\($x) less than \\($a[$mid])? y/n: \" as $prompt\n | (inputOption($prompt; \"[yn]\") == \"y\") as $less\n | if ($less) then .hi = $mid\n else .lo = $mid + 1\n end)\n # insert at position .lo\n | [ .q, ($a[: .lo] + [x] + $a[.lo :]) ];\n\ndef order:\n reduce .[] as $item ( [0, []]; insortRight($item) )\n | .[1];\n\n[\"violet red green indigo blue yellow orange\"|splits(\" \")]\n| order as $ordered\n| (\"\\nThe colors of the rainbow, in sorted order, are:\",\n $ordered )\n","language":"Jq"},{"code":"const nrequests = [0]\nconst ordering = Dict(\"violet\" => 7, \"red\" => 1, \"green\" => 4, \"indigo\" => 6, \"blue\" => 5,\n \"yellow\" => 3, \"orange\" => 2)\n\nfunction tellmeifgt(x, y)\n nrequests[1] += 1\n while true\n print(\"Is $x greater than $y? (Y/N) => \")\n s = strip(readline())\n if length(s) > 0\n (s[1] == 'Y' || s[1] == 'y') && return true\n (s[1] == 'N' || s[1] == 'n') && return false\n end\n end\nend\n\nfunction orderbypair!(a::Vector)\n incr = div(length(a), 2)\n while incr > 0\n for i in incr+1:length(a)\n j = i\n tmp = a[i]\n while j > incr && tellmeifgt(a[j - incr], tmp)\n a[j] = a[j-incr]\n j -= incr\n end\n a[j] = tmp\n end\n if incr == 2\n incr = 1\n else\n incr = floor(Int, incr * 5.0 / 11)\n end\n end\n return a\nend\n\nconst words = String.(split(\"violet red green indigo blue yellow orange\", r\"\\s+\"))\nprintln(\"Unsorted: $words\")\nprintln(\"Sorted: $(orderbypair!(words)). Total requests: $(nrequests[1]).\")\n","language":"Julia"},{"code":"colors = { \"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\" }\nprint(\"unsorted: \" .. table.concat(colors,\" \"))\nknown, notyn, nc, nq = {}, {n=\"y\",y=\"n\"}, 0, 0\ntable.sort(colors, function(a,b)\n nc = nc + 1\n if not known[a] then known[a]={[a]=\"n\"} end\n if not known[b] then known[b]={[b]=\"n\"} end\n if not (known[a][b] or known[b][a]) then\n io.write(\"Is '\" .. a .. \"' < '\" .. b ..\"'? (y/n): \")\n nq, known[a][b] = nq+1, io.read()\n if a~=b then known[b][a] = notyn[known[a][b]] end\n end\n return known[a][b]==\"y\"\nend)\nprint(\"sorted: \" .. table.concat(colors,\" \"))\nprint(\"(\" .. nq .. \" questions needed to resolve \" .. nc .. \" comparisons)\")\n","language":"Lua"},{"code":"ClearAll[HumanOrderCheck]\nHumanOrderCheck[opt1_,opt2_]:=ChoiceDialog[Row@{\"Is {\",opt1,\", \", opt2, \"} ordered?\"},{\"Yes\"->True,\"No\"->False}]\nSort[{\"violet\",\"red\",\"green\",\"indigo\",\"blue\",\"yellow\",\"orange\"},HumanOrderCheck]\n","language":"Mathematica"},{"code":"insertSort = function(arr, item)\n\tlo = 0\n\thi = arr.len\n\twhile lo < hi\n\t\tmid = floor((lo + hi) / 2)\n\t\tans = input(\"Is \" + item + \" less than \" + arr[mid] + \"? y/n: \")\n\t\tans = ans[0].lower\n\t\tif ans == \"y\" then\n\t\t\thi = mid\n\t\telse\n\t\t\tlo = mid + 1\n\t\tend if\n\tend while\n\tarr.insert(lo, item)\nend function\n\nitems = \"violet red green indigo blue yellow orange\".split\nordered = []\nfor item in items\n\tinsertSort(ordered, item)\nend for\nprint ordered\n","language":"MiniScript"},{"code":"import algorithm, strformat, strutils\n\nlet list = [\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"]\n\nvar count = 0\n\nproc comp(x, y: string): int =\n if x == y: return 0\n inc count\n while true:\n stdout.write &\"{count:>2}) Is {x} less than {y} (y/n)? \"\n let answer = stdin.readLine()[0]\n case answer\n of 'y': return -1\n of 'n': return 1\n else: echo \"Incorrect answer.\"\n\nvar sortedList: seq[string]\n\nfor elem in list:\n sortedList.insert(elem, sortedList.upperBound(elem, comp))\n\necho \"Sorted list: \", sortedList.join(\", \")\n","language":"Nim"},{"code":"let () =\n let count = ref 0 in\n let mycmp s1 s2 = (\n incr count;\n Printf.printf \"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \" (!count) s1 s2;\n read_int ()\n ) in\n let items = [\"violet\"; \"red\"; \"green\"; \"indigo\"; \"blue\"; \"yellow\"; \"orange\"] in\n let sorted = List.sort mycmp items in\n List.iter (Printf.printf \"%s \") sorted;\n print_newline ()\n","language":"OCaml"},{"code":"let () =\n let count = ref 0 in\n let mycmp s1 s2 = (\n incr count;\n Printf.printf \"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \" (!count) s1 s2;\n read_int ()\n ) in\n let items = [|\"violet\"; \"red\"; \"green\"; \"indigo\"; \"blue\"; \"yellow\"; \"orange\"|] in\n Array.sort mycmp items;\n Array.iter (Printf.printf \"%s \") items;\n print_newline ()\n","language":"OCaml"},{"code":"#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/Order_by_pair_comparisons\nuse warnings;\n\nsub ask\n {\n while( 1 )\n {\n print \"Compare $a to $b [<,=,>]: \";\n <STDIN> =~ /[<=>]/ and return +{qw( < -1 = 0 > 1 )}->{$&};\n }\n }\n\nmy @sorted = sort ask qw( violet red green indigo blue yellow orange );\nprint \"sorted: @sorted\\n\";\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">qn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ask</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">qn</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d: Is %s < %s (Y/N)?:\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">qn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">())</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'Y'</span><span style=\"color: #0000FF;\">?-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">custom_sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ask</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"violet orange red yellow green blue indigo\"</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"def _insort_right(a, x, q):\n \"\"\"\n Insert item x in list a, and keep it sorted assuming a is sorted.\n If x is already in a, insert it to the right of the rightmost x.\n \"\"\"\n\n lo, hi = 0, len(a)\n while lo < hi:\n mid = (lo+hi)//2\n q += 1\n less = input(f\"{q:2}: IS {x:>6} LESS-THAN {a[mid]:>6} ? y/n: \").strip().lower() == 'y'\n if less: hi = mid\n else: lo = mid+1\n a.insert(lo, x)\n return q\n\ndef order(items):\n ordered, q = [], 0\n for item in items:\n q = _insort_right(ordered, item, q)\n return ordered, q\n\nif __name__ == '__main__':\n items = 'violet red green indigo blue yellow orange'.split()\n ans, questions = order(items)\n print('\\n' + ' '.join(ans))\n","language":"Python"},{"code":"from functools import cmp_to_key\n\ndef user_cmp(a, b):\n return int(input(f\"IS {a:>6} <, ==, or > {b:>6} answer -1, 0 or 1:\"))\n\nif __name__ == '__main__':\n items = 'violet red green indigo blue yellow orange'.split()\n ans = sorted(items, key=cmp_to_key(user_cmp))\n print('\\n' + ' '.join(ans))\n","language":"Python"},{"code":" [ $ \"Is \" swap join\n $ \" before \" join\n swap join\n $ \"? (y/n) \" join\n input $ \"y\" = ] is askuser\n\n$ \"red orange yellow green blue indigo violet\"\nsay \"Correct order --> \"\ndup echo$ cr cr\nnest$ shuffle\ndup witheach [ echo$ sp ] cr cr\nsortwith askuser cr\nwitheach [ echo$ sp ] cr\n","language":"Quackery"},{"code":"my $ask_count = 0;\nsub by_asking ( $a, $b ) {\n $ask_count++;\n constant $fmt = '%2d. Is %-6s [ less than | greater than | equal to ] %-6s? ( < = > ) ';\n constant %o = '<' => Order::Less,\n '=' => Order::Same,\n '>' => Order::More;\n\n loop {\n my $input = prompt sprintf $fmt, $ask_count, $a, $b;\n return $_ with %o{ $input.trim };\n say \"Invalid input '$input'\";\n }\n}\n\nmy @colors = <violet red green indigo blue yellow orange>;\nmy @sorted = @colors.sort: &by_asking;\nsay (:@sorted);\n\ndie if @sorted».substr(0,1).join ne 'roygbiv';\nmy $expected_ask_count = @colors.elems * log(@colors.elems);\nwarn \"Too many questions? ({:$ask_count} > {:$expected_ask_count})\" if $ask_count > $expected_ask_count;\n","language":"Raku"},{"code":"/*REXX pgm orders some items based on (correct) answers from a carbon─based life form. */\ncolors= 'violet red green indigo blue yellow orange'\n q= 0; #= 0; $=\n do j=1 for words(colors); q= inSort( word(colors, j), q)\n end /*j*/ /*poise questions the CBLF about order.*/\nsay\n do i=1 for #; say ' query' right(i, length(#) )\":\" !.i\n end /*i*/ /* [↑] show the list of queries to CBLF*/\nsay\nsay 'final ordering: ' $\nexit 0\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngetAns: #= # + 1; _= copies('─', 8); y_n= ' Answer y/n'\n do try=0 until ansU='Y' | ansU='N'\n if try>0 then say _ '(***error***) incorrect answer.'\n ask= _ ' is ' center(x,6) \" less than \" center(word($, mid+1),6) '?'\n say ask y_n; parse pull ans 1 ansU; ansU= space(ans); upper ansU\n end /*until*/; !.#= ask ' ' ans; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ninSort: parse arg x, q; hi= words($); lo= 0\n do q=q-1 while lo<hi; mid= (lo+hi) % 2\n call getAns; if ansU=='Y' then hi= mid\n else lo= mid + 1\n end /*q*/\n $= subword($, 1, lo) x subword($, lo+1); return q\n","language":"REXX"},{"code":"items = [\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"]\ncount = 0\nsortedItems = []\nitems.each {|item|\n puts \"Inserting '#{item}' into #{sortedItems}\"\n spotToInsert = sortedItems.bsearch_index{|x|\n count += 1\n print \"(#{count}) Is #{item} < #{x}? \"\n gets.start_with?('y')\n } || sortedItems.length # if insertion point is at the end, bsearch_index returns nil\n sortedItems.insert(spotToInsert, item)\n}\np sortedItems\n","language":"Ruby"},{"code":"items = [\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"]\ncount = 0\np items.sort {|a, b|\n count += 1\n print \"(#{count}) Is #{a} <, =, or > #{b}. Answer -1, 0, or 1: \"\n gets.to_i\n}\n","language":"Ruby"},{"code":"import \"./ioutil\" for Input\nimport \"./fmt\" for Fmt\n\n// Inserts item x in list a, and keeps it sorted assuming a is already sorted.\n// If x is already in a, inserts it to the right of the rightmost x.\nvar insortRight = Fn.new{ |a, x, q|\n var lo = 0\n var hi = a.count\n while (lo < hi) {\n var mid = ((lo + hi)/2).floor\n q = q + 1\n var prompt = Fmt.swrite(\"$2d: Is $6s less than $6s ? y/n: \", q, x, a[mid])\n var less = Input.option(prompt, \"yn\") == \"y\"\n if (less) {\n hi = mid\n } else {\n lo = mid + 1\n }\n }\n a.insert(lo, x)\n return q\n}\n\nvar order = Fn.new { |items|\n var ordered = []\n var q = 0\n for (item in items) {\n q = insortRight.call(ordered, item, q)\n }\n return ordered\n}\n\nvar items = \"violet red green indigo blue yellow orange\".split(\" \")\nvar ordered = order.call(items)\nSystem.print(\"\\nThe colors of the rainbow, in sorted order, are:\")\nSystem.print(ordered)\n","language":"Wren"},{"code":"include xpllib; \\for Print\n\nint Items, Size, I, J, Gap, JG, T, C, Count;\n[Items:= [\"violet\", \"red\", \"green\", \"indigo\", \"blue\", \"yellow\", \"orange\"];\nSize:= 7;\nCount:= 0;\nGap:= Size>>1;\nwhile Gap > 0 do\n [for I:= Gap to Size-1 do\n [J:= I - Gap;\n loop [JG:= J + Gap;\n Count:= Count+1;\n Print(\"%2d: Is %6s less than %6s (y/n)? \",\n Count, Items(J), Items(JG));\n repeat OpenI(1);\n C:= ChIn(1);\n until C=^y or C=^n;\n ChOut(0, C); CrLf(0);\n if C = ^y then quit;\n T:= Items(J); Items(J):= Items(JG); Items(JG):= T;\n J:= J - Gap;\n if J < 0 then quit;\n ];\n ];\n Gap:= Gap>>1;\n ];\nPrint(\"The colors of the rainbow, in sorted order, are:\\n\");\nfor I:= 0 to Size-2 do Print(\"%s, \", Items(I));\nPrint(\"%s\\n\", Items(I));\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Order_by_pair_comparisons\\nnote: Sorting Algorithms\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Sorting Algorithm}}\\n[[Category:Sorting]]\\n\\nAssume we have a set of items that can be sorted into an order by the user.\\n\\nThe user is presented with pairs of items from the set in ''no'' order,\\nthe user states which item\\nis less than, equal to, or greater than the other (with respect to their\\nrelative positions if fully ordered).\\n\\nWrite a function that given items that the user can order, '''asks the user''' to\\ngive the result of ''comparing two items at a time'' and uses the comparison results\\nto eventually return the items in order. \\n\\nTry and minimise the comparisons the user is asked for.\\n\\nShow on this page, the function ordering the colours of the rainbow:\\n violet red green indigo blue yellow orange\\n\\nThe correct ordering being:\\n red orange yellow green blue indigo violet\\n\\nNote:\\n* Asking for/receiving user comparisons is a part of the task.\\n* Code ''inputs'' should not assume an ordering.\\n* The seven colours can form twenty-one different pairs.\\n* A routine that does not ask the user \\\"too many\\\" comparison questions should be used.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F user_cmp(String a, b)\\n R Int(input(‘IS #6 <, ==, or > #6 answer -1, 0 or 1:’.format(a, b)))\\n\\nV items = ‘violet red green indigo blue yellow orange’.split(‘ ’)\\nV ans = sorted(items, key' cmp_to_key(user_cmp))\\nprint(\\\"\\\\n\\\"ans.join(‘ ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"DEFINE PTR=\\\"CARD\\\"\\n\\nPROC PrintArray(PTR ARRAY a BYTE size)\\n BYTE i\\n\\n Put('[)\\n FOR i=0 TO size-1\\n DO\\n IF i>0 THEN Put(' ) FI\\n Print(a(i))\\n OD\\n Put(']) PutE()\\nRETURN\\n\\nBYTE FUNC IsBefore(CHAR ARRAY a,b)\\n DEFINE NO_KEY=\\\"255\\\"\\n DEFINE KEY_Y=\\\"43\\\"\\n DEFINE KEY_N=\\\"35\\\"\\n BYTE CH=$02FC ;Internal hardware value for last key pressed\\n BYTE k\\n\\n PrintF(\\\"Is %S before %S (y/n)? \\\",a,b)\\n CH=NO_KEY ;Flush the keyboard\\n DO\\n k=CH\\n UNTIL k=KEY_Y OR k=KEY_N\\n OD\\n CH=NO_KEY ;Flush the keyboard\\n IF k=KEY_Y THEN\\n PrintE(\\\"yes\\\")\\n RETURN (1)\\n FI\\n PrintE(\\\"no\\\")\\nRETURN (0)\\n\\nPROC InteractiveInsertionSort(PTR ARRAY a BYTE size)\\n INT i,j\\n PTR value\\n\\n FOR i=1 TO size-1\\n DO\\n value=a(i)\\n j=i-1\\n WHILE j>=0 AND IsBefore(value,a(j))=1\\n DO\\n a(j+1)=a(j)\\n j==-1\\n OD\\n a(j+1)=value\\n OD\\nRETURN\\n\\nPROC Main()\\n DEFINE COUNT=\\\"7\\\"\\n PTR ARRAY arr(COUNT)\\n\\n arr(0)=\\\"violet\\\" arr(1)=\\\"red\\\"\\n arr(2)=\\\"green\\\" arr(3)=\\\"indigo\\\"\\n arr(4)=\\\"blue\\\" arr(5)=\\\"yellow\\\"\\n arr(6)=\\\"orange\\\"\\n\\n Print(\\\"Shuffled array: \\\")\\n PrintArray(arr,COUNT) PutE()\\n\\n InteractiveInsertionSort(arr,COUNT)\\n PutE() Print(\\\"Sorted array: \\\")\\n PrintArray(arr,COUNT)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"lst: [\\\"violet\\\" \\\"red\\\" \\\"green\\\" \\\"indigo\\\" \\\"blue\\\" \\\"yellow\\\" \\\"orange\\\"]\\ncount: 0\\n\\nfindSpot: function [l,e][\\n if empty? l -> return 0\\n\\n loop.with:'i l 'item [\\n answer: input ~\\\"Is |item| greater than |e| [y/n]? \\\"\\n if answer=\\\"y\\\" -> return i\\n ]\\n return dec size l\\n]\\n\\nsortedLst: new []\\n\\nloop lst 'element ->\\n insert 'sortedLst findSpot sortedLst element element\\n\\nprint \\\"\\\"\\nprint [\\\"sorted =>\\\" sortedLst]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"data := [\\\"Violet\\\", \\\"Red\\\", \\\"Green\\\", \\\"Indigo\\\", \\\"Blue\\\", \\\"Yellow\\\", \\\"Orange\\\"]\\nresult := [], num := 0, Questions :=\\\"\\\"\\n\\nfor i, Color1 in data{\\n found :=false\\n if !result.count(){\\n result.Push(Color1)\\n continue\\n }\\n\\n for j, Color2 in result\\t{\\n if (color1 = color2)\\n continue\\n MsgBox, 262180,, % (Q := \\\"Q\\\" ++num \\\" is \\\" Color1 \\\" > \\\" Color2 \\\"?\\\")\\n ifMsgBox, Yes\\n Questions .= Q \\\"`t`tYES`n\\\"\\n else {\\n Questions .= Q \\\"`t`tNO`n\\\"\\n result.InsertAt(j, Color1)\\n found := true\\n break\\n }\\n }\\n if !found\\n result.Push(Color1)\\n}\\nfor i, color in result\\n output .= color \\\", \\\"\\nMsgBox % Questions \\\"`nSorted Output :`n\\\" Trim(output, \\\", \\\")\\nreturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n#include <stdlib.h>\\n\\nint interactiveCompare(const void *x1, const void *x2)\\n{\\n const char *s1 = *(const char * const *)x1;\\n const char *s2 = *(const char * const *)x2;\\n static int count = 0;\\n printf(\\\"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \\\", ++count, s1, s2);\\n int response;\\n scanf(\\\"%d\\\", &response);\\n return response;\\n}\\n\\nvoid printOrder(const char *items[], int len)\\n{\\n printf(\\\"{ \\\");\\n for (int i = 0; i < len; ++i) printf(\\\"%s \\\", items[i]);\\n printf(\\\"}\\\\n\\\");\\n}\\n\\nint main(void)\\n{\\n const char *items[] =\\n {\\n \\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"\\n };\\n\\n qsort(items, sizeof(items)/sizeof(*items), sizeof(*items), interactiveCompare);\\n printOrder(items, sizeof(items)/sizeof(*items));\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\nbool InteractiveCompare(const string& s1, const string& s2)\\n{\\n if(s1 == s2) return false; // don't ask to compare items that are the same\\n static int count = 0;\\n string response;\\n cout << \\\"(\\\" << ++count << \\\") Is \\\" << s1 << \\\" < \\\" << s2 << \\\"? \\\";\\n getline(cin, response);\\n return !response.empty() && response.front() == 'y';\\n}\\n\\nvoid PrintOrder(const vector<string>& items)\\n{\\n cout << \\\"{ \\\";\\n for(auto& item : items) cout << item << \\\" \\\";\\n cout << \\\"}\\\\n\\\";\\n}\\n\\nint main()\\n{\\n const vector<string> items\\n {\\n \\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"\\n };\\n\\n vector<string> sortedItems;\\n\\n // Use a binary insertion sort to order the items. It should ask for\\n // close to the minimum number of questions required\\n for(auto& item : items)\\n {\\n cout << \\\"Inserting '\\\" << item << \\\"' into \\\";\\n PrintOrder(sortedItems);\\n // lower_bound performs the binary search using InteractiveCompare to\\n // rank the items\\n auto spotToInsert = lower_bound(sortedItems.begin(),\\n sortedItems.end(), item, InteractiveCompare);\\n sortedItems.insert(spotToInsert, item);\\n }\\n PrintOrder(sortedItems);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\nbool InteractiveCompare(const string& s1, const string& s2)\\n{\\n if(s1 == s2) return false; // don't ask to compare items that are the same\\n static int count = 0;\\n string response;\\n cout << \\\"(\\\" << ++count << \\\") Is \\\" << s1 << \\\" < \\\" << s2 << \\\"? \\\";\\n getline(cin, response);\\n return !response.empty() && response.front() == 'y';\\n}\\n\\nvoid PrintOrder(const vector<string>& items)\\n{\\n cout << \\\"{ \\\";\\n for(auto& item : items) cout << item << \\\" \\\";\\n cout << \\\"}\\\\n\\\";\\n}\\n\\nint main()\\n{\\n vector<string> items\\n {\\n \\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"\\n };\\n\\n sort(items.begin(), items.end(), InteractiveCompare);\\n PrintOrder(items);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"100 REM SORT BY COMPARISON\\n110 DIM IN$(6), OU$(6)\\n120 FOR I=0 TO 6:READ IN$(I): NEXT I\\n130 DATA VIOLET,RED,GREEN,INDIGO,BLUE,YELLOW,ORANGE\\n140 OU$(0)=IN$(0):N=1\\n150 FOR I=1 TO 6\\n160 : IN$=IN$(I)\\n180 : GOSUB 390\\n190 : FOR J=0 TO N-1\\n200 : OU$ = OU$(J)\\n210 : GOSUB 340\\n220 : IF R>=0 THEN 280\\n230 : FOR K=N TO J+1 STEP -1\\n240 : OU$(K) = OU$(K-1)\\n250 : NEXT K\\n260 : OU$(J) = IN$\\n270 : GOTO 300\\n280 : NEXT J\\n290 : OU$(N) = IN$\\n300 : N=N+1\\n310 NEXT I\\n320 GOSUB 390\\n330 END\\n340 PRINT \\\"IS \\\"IN$\\\" < \\\"OU$\\\"? (Y/N)\\\";\\n350 GET K$: IF K$<>\\\"Y\\\" AND K$<>\\\"N\\\" THEN 350\\n360 PRINT K$\\n370 R = K$=\\\"Y\\\"\\n380 RETURN\\n390 PRINT \\\"(\\\";\\n400 IF N=1 THEN 420\\n410 FOR Q=0 TO N-2:PRINT OU$(Q)\\\",\\\";:NEXT Q\\n420 PRINT OU$(N-1)\\\")\\\"\\n430 RETURN\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"// Order by pair comparisons. Nigel Galloway: April 23rd., 2021\\nlet clrs=let n=System.Random() in lN2p [|for g in 7..-1..2->n.Next(g)|] [|\\\"Red\\\";\\\"Orange\\\";\\\"Yellow\\\";\\\"Green\\\";\\\"Blue\\\";\\\"Indigo\\\";\\\"Violet\\\"|]\\nlet rec fG n g=printfn \\\"Is %s less than %s\\\" n g; match System.Console.ReadLine() with \\\"Yes\\\"-> -1|\\\"No\\\"->1 |_->printfn \\\"Enter Yes or No\\\"; fG n g\\nlet mutable z=0 in printfn \\\"%A sorted to %A using %d questions\\\" clrs (clrs|>Array.sortWith(fun n g->z<-z+1; fG n g)) z\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting io kernel math.order prettyprint qw sorting ;\\n\\nqw{ violet red green indigo blue yellow orange }\\n[ \\\"Is %s > %s? (y/n) \\\" printf readln \\\"y\\\" = +gt+ +lt+ ? ] sort .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim Shared As Byte r, n = 1\\nDim Shared As String IN1, OU1\\nDim Shared As String IN(6), OU(6)\\nDim As Byte i, j, k\\nFor i = 0 To 6 : Read IN(i) : Next i\\nData \\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"\\nOU(0) = IN(0)\\n\\nSub PrintOrder\\n Print : Print \\\"{\\\";\\n If n = 1 Then Print OU(n-1);\\\")\\\" : Exit Sub\\n For q As Byte = 0 To n-2\\n Print OU(q);\\\", \\\";\\n Next q\\n Print OU(n-1);\\\"}\\\"\\nEnd Sub\\n\\nSub InteractiveCompare\\n Dim As String*1 T\\n Print \\\"Es \\\"; IN1; \\\" < \\\"; OU1; \\\"? (S/N) \\\";\\n Do: T = Inkey$: Loop Until T <> \\\"\\\"\\n If Instr(\\\"snSN\\\", T) Then Print Ucase(T)\\n r = T = \\\"S\\\"\\nEnd Sub\\n\\nFor i = 1 To 6\\n IN1 = IN(i)\\n For j = 0 To n-1\\n OU1 = OU(j)\\n InteractiveCompare\\n If r < 0 Then\\n For k = n To j+1 Step -1\\n OU(k) = OU(k-1)\\n Next k\\n OU(j) = IN1\\n n += 1\\n Exit For, For\\n End If\\n Next j\\n OU(n) = IN1\\n n += 1\\nNext i\\nPrintOrder\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sort\\\"\\n \\\"strings\\\"\\n)\\n\\nvar count int = 0\\n\\nfunc interactiveCompare(s1, s2 string) bool {\\n count++\\n fmt.Printf(\\\"(%d) Is %s < %s? \\\", count, s1, s2)\\n var response string\\n _, err := fmt.Scanln(&response)\\n return err == nil && strings.HasPrefix(response, \\\"y\\\")\\n}\\n\\nfunc main() {\\n items := []string{\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"}\\n\\n var sortedItems []string\\n\\n // Use a binary insertion sort to order the items. It should ask for\\n // close to the minimum number of questions required\\n for _, item := range items {\\n fmt.Printf(\\\"Inserting '%s' into %s\\\\n\\\", item, sortedItems)\\n // sort.Search performs the binary search using interactiveCompare to\\n // rank the items\\n spotToInsert := sort.Search(len(sortedItems), func(i int) bool {\\n return interactiveCompare(item, sortedItems[i])\\n })\\n sortedItems = append(sortedItems[:spotToInsert],\\n append([]string{item}, sortedItems[spotToInsert:]...)...)\\n }\\n fmt.Println(sortedItems)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sort\\\"\\n \\\"strings\\\"\\n)\\n\\nvar count int = 0\\n\\ntype sortable []string\\nfunc (s sortable) Len() int { return len(s) }\\nfunc (s sortable) Swap(i, j int) { s[i], s[j] = s[j], s[i] }\\nfunc (s sortable) Less(i, j int) bool {\\n s1, s2 := s[i], s[j]\\n count++\\n fmt.Printf(\\\"(%d) Is %s < %s? \\\", count, s1, s2)\\n var response string\\n _, err := fmt.Scanln(&response)\\n return err == nil && strings.HasPrefix(response, \\\"y\\\")\\n}\\n\\nfunc main() {\\n items := sortable{\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"}\\n sort.Sort(items)\\n fmt.Println(items)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad\\nimport Control.Monad.ListM (sortByM, insertByM, partitionM, minimumByM)\\nimport Data.Bool (bool)\\nimport Data.Monoid\\nimport Data.List\\n\\n--------------------------------------------------------------------------------\\nisortM, msortM, tsortM :: Monad m => (a -> a -> m Ordering) -> [a] -> m [a]\\n\\n-- merge sort from the Control.Monad.ListM library\\nmsortM = sortByM\\n\\n-- insertion sort\\nisortM cmp = foldM (flip (insertByM cmp)) []\\n\\n-- tree sort aka qsort (which is not)\\ntsortM cmp = go\\n where\\n go [] = pure []\\n go (h:t) = do (l, g) <- partitionM (fmap (LT /=) . cmp h) t\\n go l <+> pure [h] <+> go g\\n (<+>) = liftM2 (++)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"ask a b = do\\n putStr $ show a ++ \\\" ≤ \\\" ++ show b ++ \\\" ? [y/n] \\\"\\n bool GT LT . (\\\"y\\\" ==) <$> getLine\\n\\ncolors = [\\\"Violet\\\", \\\"Red\\\", \\\"Green\\\", \\\"Indigo\\\", \\\"Blue\\\", \\\"Yellow\\\", \\\"Orange\\\"]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"test method = do\\n mapM_ showHist $ hist res\\n putStrLn $ \\\"Median number of comparisons: \\\" ++ show (median res)\\n putStrLn $ \\\"Mean number of comparisons: \\\" ++ show (mean res)\\n where\\n res = getSum . fst . method cmp <$> permutations [1..7]\\n cmp a b = (Sum 1, compare a b)\\n median lst = sort lst !! (length lst `div` 2)\\n mean lst = sum (fromIntegral <$> lst) / genericLength lst\\n hist lst = (\\\\x -> (head x, length x)) <$> group (sort lst)\\n showHist (n, l) = putStrLn line\\n where\\n line = show n ++ \\\"\\\\t\\\" ++ bar ++ \\\" \\\" ++ show perc ++ \\\"%\\\"\\n bar = replicate (max perc 1) '*'\\n perc = (100 * l) `div` product [1..7]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require'general/misc/prompt'\\nsel=: {{ u#[ }}\\n\\nquicksort=: {{\\n if. 1 >: #y do. y\\n else.\\n (u quicksort y u sel e),(y =sel e),u quicksort y u~ sel e=.y{~?#y\\n end.\\n}}\\n\\nptc=: {{\\n t=. (+. +./ .*.~)^:_ y=1\\n j=. I.,t+.|:t\\n ($y)$(j{,t) j} ,y\\n}}\\n\\naskless=: {{\\n coord=. x ,&(items&i.) y\\n lt=. LT {~<coord\\n if. 1<lt do.\\n lt=. 'y' e. tolower prompt 'Is ',(\\\":;x),' less than ',(\\\":;y),'? '\\n LT=: ptc (lt,-.lt) (coord;|.coord)} LT\\n end.\\n lt\\n}}\\\"0\\n\\nasksort=: {{\\n items=: ~.y\\n LT=: <:%=i.#items\\n askless quicksort y\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" asksort&.;:' violet red green indigo blue yellow orange'\\nIs indigo less than violet? yes\\nIs indigo less than red? no\\nIs indigo less than green? no\\nIs indigo less than blue? no\\nIs indigo less than yellow? no\\nIs indigo less than orange? no\\nIs yellow less than red? no\\nIs yellow less than green? yes\\nIs yellow less than blue? yes\\nIs yellow less than orange? no\\nIs green less than blue? yes\\nIs red less than orange? yes\\nred orange yellow green blue indigo violet\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class SortComp1 {\\n public static void main(String[] args) {\\n List<String> items = Arrays.asList(\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\");\\n List<String> sortedItems = new ArrayList<>();\\n Comparator<String> interactiveCompare = new Comparator<String>() {\\n int count = 0;\\n Scanner s = new Scanner(System.in);\\n public int compare(String s1, String s2) {\\n System.out.printf(\\\"(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: \\\", ++count, s1, s2);\\n return s.nextInt();\\n }\\n };\\n for (String item : items) {\\n System.out.printf(\\\"Inserting '%s' into %s\\\\n\\\", item, sortedItems);\\n int spotToInsert = Collections.binarySearch(sortedItems, item, interactiveCompare);\\n // when item does not equal an element in sortedItems,\\n // it returns bitwise complement of insertion point\\n if (spotToInsert < 0) spotToInsert = ~spotToInsert;\\n sortedItems.add(spotToInsert, item);\\n }\\n System.out.println(sortedItems);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class OrderByPair {\\n public static void main(String[] args) {\\n List<String> items = Arrays.asList(\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\");\\n Collections.sort(items, new Comparator<String>() {\\n int count = 0;\\n Scanner s = new Scanner(System.in);\\n public int compare(String s1, String s2) {\\n System.out.printf(\\\"(%d) Is %s <, =, or > %s. Answer -1, 0, or 1: \\\", ++count, s1, s2);\\n return s.nextInt();\\n }\\n });\\n System.out.println(items);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def inputOption($prompt; $options):\\n def r:\\n $prompt | stderr\\n | input as $in\\n | if $in|test($options) then $in else r end;\\n r;\\n\\n# Inserts item $x in the array input, which is kept sorted as per user input\\n# assuming it is already sorted. $q is the prompt number.\\n# Input: [$q; $a]\\n# Output: [$qPrime, $aPrime]\\ndef insortRight($x):\\n . as [$q, $a]\\n | { lo: 0, hi: ($a|length), $q }\\n | until( .lo >= .hi;\\n ( ((.lo + .hi)/2)|floor) as $mid\\n | .q += 1\\n | \\\"\\\\(.q): Is \\\\($x) less than \\\\($a[$mid])? y/n: \\\" as $prompt\\n | (inputOption($prompt; \\\"[yn]\\\") == \\\"y\\\") as $less\\n | if ($less) then .hi = $mid\\n else .lo = $mid + 1\\n end)\\n # insert at position .lo\\n | [ .q, ($a[: .lo] + [x] + $a[.lo :]) ];\\n\\ndef order:\\n reduce .[] as $item ( [0, []]; insortRight($item) )\\n | .[1];\\n\\n[\\\"violet red green indigo blue yellow orange\\\"|splits(\\\" \\\")]\\n| order as $ordered\\n| (\\\"\\\\nThe colors of the rainbow, in sorted order, are:\\\",\\n $ordered )\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"const nrequests = [0]\\nconst ordering = Dict(\\\"violet\\\" => 7, \\\"red\\\" => 1, \\\"green\\\" => 4, \\\"indigo\\\" => 6, \\\"blue\\\" => 5,\\n \\\"yellow\\\" => 3, \\\"orange\\\" => 2)\\n\\nfunction tellmeifgt(x, y)\\n nrequests[1] += 1\\n while true\\n print(\\\"Is $x greater than $y? (Y/N) => \\\")\\n s = strip(readline())\\n if length(s) > 0\\n (s[1] == 'Y' || s[1] == 'y') && return true\\n (s[1] == 'N' || s[1] == 'n') && return false\\n end\\n end\\nend\\n\\nfunction orderbypair!(a::Vector)\\n incr = div(length(a), 2)\\n while incr > 0\\n for i in incr+1:length(a)\\n j = i\\n tmp = a[i]\\n while j > incr && tellmeifgt(a[j - incr], tmp)\\n a[j] = a[j-incr]\\n j -= incr\\n end\\n a[j] = tmp\\n end\\n if incr == 2\\n incr = 1\\n else\\n incr = floor(Int, incr * 5.0 / 11)\\n end\\n end\\n return a\\nend\\n\\nconst words = String.(split(\\\"violet red green indigo blue yellow orange\\\", r\\\"\\\\s+\\\"))\\nprintln(\\\"Unsorted: $words\\\")\\nprintln(\\\"Sorted: $(orderbypair!(words)). Total requests: $(nrequests[1]).\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"colors = { \\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\" }\\nprint(\\\"unsorted: \\\" .. table.concat(colors,\\\" \\\"))\\nknown, notyn, nc, nq = {}, {n=\\\"y\\\",y=\\\"n\\\"}, 0, 0\\ntable.sort(colors, function(a,b)\\n nc = nc + 1\\n if not known[a] then known[a]={[a]=\\\"n\\\"} end\\n if not known[b] then known[b]={[b]=\\\"n\\\"} end\\n if not (known[a][b] or known[b][a]) then\\n io.write(\\\"Is '\\\" .. a .. \\\"' < '\\\" .. b ..\\\"'? (y/n): \\\")\\n nq, known[a][b] = nq+1, io.read()\\n if a~=b then known[b][a] = notyn[known[a][b]] end\\n end\\n return known[a][b]==\\\"y\\\"\\nend)\\nprint(\\\"sorted: \\\" .. table.concat(colors,\\\" \\\"))\\nprint(\\\"(\\\" .. nq .. \\\" questions needed to resolve \\\" .. nc .. \\\" comparisons)\\\")\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[HumanOrderCheck]\\nHumanOrderCheck[opt1_,opt2_]:=ChoiceDialog[Row@{\\\"Is {\\\",opt1,\\\", \\\", opt2, \\\"} ordered?\\\"},{\\\"Yes\\\"->True,\\\"No\\\"->False}]\\nSort[{\\\"violet\\\",\\\"red\\\",\\\"green\\\",\\\"indigo\\\",\\\"blue\\\",\\\"yellow\\\",\\\"orange\\\"},HumanOrderCheck]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"insertSort = function(arr, item)\\n\\tlo = 0\\n\\thi = arr.len\\n\\twhile lo < hi\\n\\t\\tmid = floor((lo + hi) / 2)\\n\\t\\tans = input(\\\"Is \\\" + item + \\\" less than \\\" + arr[mid] + \\\"? y/n: \\\")\\n\\t\\tans = ans[0].lower\\n\\t\\tif ans == \\\"y\\\" then\\n\\t\\t\\thi = mid\\n\\t\\telse\\n\\t\\t\\tlo = mid + 1\\n\\t\\tend if\\n\\tend while\\n\\tarr.insert(lo, item)\\nend function\\n\\nitems = \\\"violet red green indigo blue yellow orange\\\".split\\nordered = []\\nfor item in items\\n\\tinsertSort(ordered, item)\\nend for\\nprint ordered\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"import algorithm, strformat, strutils\\n\\nlet list = [\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"]\\n\\nvar count = 0\\n\\nproc comp(x, y: string): int =\\n if x == y: return 0\\n inc count\\n while true:\\n stdout.write &\\\"{count:>2}) Is {x} less than {y} (y/n)? \\\"\\n let answer = stdin.readLine()[0]\\n case answer\\n of 'y': return -1\\n of 'n': return 1\\n else: echo \\\"Incorrect answer.\\\"\\n\\nvar sortedList: seq[string]\\n\\nfor elem in list:\\n sortedList.insert(elem, sortedList.upperBound(elem, comp))\\n\\necho \\\"Sorted list: \\\", sortedList.join(\\\", \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let () =\\n let count = ref 0 in\\n let mycmp s1 s2 = (\\n incr count;\\n Printf.printf \\\"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \\\" (!count) s1 s2;\\n read_int ()\\n ) in\\n let items = [\\\"violet\\\"; \\\"red\\\"; \\\"green\\\"; \\\"indigo\\\"; \\\"blue\\\"; \\\"yellow\\\"; \\\"orange\\\"] in\\n let sorted = List.sort mycmp items in\\n List.iter (Printf.printf \\\"%s \\\") sorted;\\n print_newline ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let () =\\n let count = ref 0 in\\n let mycmp s1 s2 = (\\n incr count;\\n Printf.printf \\\"(%d) Is %s <, ==, or > %s? Answer -1, 0, or 1: \\\" (!count) s1 s2;\\n read_int ()\\n ) in\\n let items = [|\\\"violet\\\"; \\\"red\\\"; \\\"green\\\"; \\\"indigo\\\"; \\\"blue\\\"; \\\"yellow\\\"; \\\"orange\\\"|] in\\n Array.sort mycmp items;\\n Array.iter (Printf.printf \\\"%s \\\") items;\\n print_newline ()\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # https://rosettacode.org/wiki/Order_by_pair_comparisons\\nuse warnings;\\n\\nsub ask\\n {\\n while( 1 )\\n {\\n print \\\"Compare $a to $b [<,=,>]: \\\";\\n <STDIN> =~ /[<=>]/ and return +{qw( < -1 = 0 > 1 )}->{$&};\\n }\\n }\\n\\nmy @sorted = sort ask qw( violet red green indigo blue yellow orange );\\nprint \\\"sorted: @sorted\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">qn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ask</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">qn</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d: Is %s < %s (Y/N)?:\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">qn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">())</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'Y'</span><span style=\\\"color: #0000FF;\\\">?-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">custom_sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ask</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"violet orange red yellow green blue indigo\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"def _insort_right(a, x, q):\\n \\\"\\\"\\\"\\n Insert item x in list a, and keep it sorted assuming a is sorted.\\n If x is already in a, insert it to the right of the rightmost x.\\n \\\"\\\"\\\"\\n\\n lo, hi = 0, len(a)\\n while lo < hi:\\n mid = (lo+hi)//2\\n q += 1\\n less = input(f\\\"{q:2}: IS {x:>6} LESS-THAN {a[mid]:>6} ? y/n: \\\").strip().lower() == 'y'\\n if less: hi = mid\\n else: lo = mid+1\\n a.insert(lo, x)\\n return q\\n\\ndef order(items):\\n ordered, q = [], 0\\n for item in items:\\n q = _insort_right(ordered, item, q)\\n return ordered, q\\n\\nif __name__ == '__main__':\\n items = 'violet red green indigo blue yellow orange'.split()\\n ans, questions = order(items)\\n print('\\\\n' + ' '.join(ans))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from functools import cmp_to_key\\n\\ndef user_cmp(a, b):\\n return int(input(f\\\"IS {a:>6} <, ==, or > {b:>6} answer -1, 0 or 1:\\\"))\\n\\nif __name__ == '__main__':\\n items = 'violet red green indigo blue yellow orange'.split()\\n ans = sorted(items, key=cmp_to_key(user_cmp))\\n print('\\\\n' + ' '.join(ans))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ $ \\\"Is \\\" swap join\\n $ \\\" before \\\" join\\n swap join\\n $ \\\"? (y/n) \\\" join\\n input $ \\\"y\\\" = ] is askuser\\n\\n$ \\\"red orange yellow green blue indigo violet\\\"\\nsay \\\"Correct order --> \\\"\\ndup echo$ cr cr\\nnest$ shuffle\\ndup witheach [ echo$ sp ] cr cr\\nsortwith askuser cr\\nwitheach [ echo$ sp ] cr\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my $ask_count = 0;\\nsub by_asking ( $a, $b ) {\\n $ask_count++;\\n constant $fmt = '%2d. Is %-6s [ less than | greater than | equal to ] %-6s? ( < = > ) ';\\n constant %o = '<' => Order::Less,\\n '=' => Order::Same,\\n '>' => Order::More;\\n\\n loop {\\n my $input = prompt sprintf $fmt, $ask_count, $a, $b;\\n return $_ with %o{ $input.trim };\\n say \\\"Invalid input '$input'\\\";\\n }\\n}\\n\\nmy @colors = <violet red green indigo blue yellow orange>;\\nmy @sorted = @colors.sort: &by_asking;\\nsay (:@sorted);\\n\\ndie if @sorted».substr(0,1).join ne 'roygbiv';\\nmy $expected_ask_count = @colors.elems * log(@colors.elems);\\nwarn \\\"Too many questions? ({:$ask_count} > {:$expected_ask_count})\\\" if $ask_count > $expected_ask_count;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm orders some items based on (correct) answers from a carbon─based life form. */\\ncolors= 'violet red green indigo blue yellow orange'\\n q= 0; #= 0; $=\\n do j=1 for words(colors); q= inSort( word(colors, j), q)\\n end /*j*/ /*poise questions the CBLF about order.*/\\nsay\\n do i=1 for #; say ' query' right(i, length(#) )\\\":\\\" !.i\\n end /*i*/ /* [↑] show the list of queries to CBLF*/\\nsay\\nsay 'final ordering: ' $\\nexit 0\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngetAns: #= # + 1; _= copies('─', 8); y_n= ' Answer y/n'\\n do try=0 until ansU='Y' | ansU='N'\\n if try>0 then say _ '(***error***) incorrect answer.'\\n ask= _ ' is ' center(x,6) \\\" less than \\\" center(word($, mid+1),6) '?'\\n say ask y_n; parse pull ans 1 ansU; ansU= space(ans); upper ansU\\n end /*until*/; !.#= ask ' ' ans; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ninSort: parse arg x, q; hi= words($); lo= 0\\n do q=q-1 while lo<hi; mid= (lo+hi) % 2\\n call getAns; if ansU=='Y' then hi= mid\\n else lo= mid + 1\\n end /*q*/\\n $= subword($, 1, lo) x subword($, lo+1); return q\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"items = [\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"]\\ncount = 0\\nsortedItems = []\\nitems.each {|item|\\n puts \\\"Inserting '#{item}' into #{sortedItems}\\\"\\n spotToInsert = sortedItems.bsearch_index{|x|\\n count += 1\\n print \\\"(#{count}) Is #{item} < #{x}? \\\"\\n gets.start_with?('y')\\n } || sortedItems.length # if insertion point is at the end, bsearch_index returns nil\\n sortedItems.insert(spotToInsert, item)\\n}\\np sortedItems\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"items = [\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"]\\ncount = 0\\np items.sort {|a, b|\\n count += 1\\n print \\\"(#{count}) Is #{a} <, =, or > #{b}. Answer -1, 0, or 1: \\\"\\n gets.to_i\\n}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import \\\"./ioutil\\\" for Input\\nimport \\\"./fmt\\\" for Fmt\\n\\n// Inserts item x in list a, and keeps it sorted assuming a is already sorted.\\n// If x is already in a, inserts it to the right of the rightmost x.\\nvar insortRight = Fn.new{ |a, x, q|\\n var lo = 0\\n var hi = a.count\\n while (lo < hi) {\\n var mid = ((lo + hi)/2).floor\\n q = q + 1\\n var prompt = Fmt.swrite(\\\"$2d: Is $6s less than $6s ? y/n: \\\", q, x, a[mid])\\n var less = Input.option(prompt, \\\"yn\\\") == \\\"y\\\"\\n if (less) {\\n hi = mid\\n } else {\\n lo = mid + 1\\n }\\n }\\n a.insert(lo, x)\\n return q\\n}\\n\\nvar order = Fn.new { |items|\\n var ordered = []\\n var q = 0\\n for (item in items) {\\n q = insortRight.call(ordered, item, q)\\n }\\n return ordered\\n}\\n\\nvar items = \\\"violet red green indigo blue yellow orange\\\".split(\\\" \\\")\\nvar ordered = order.call(items)\\nSystem.print(\\\"\\\\nThe colors of the rainbow, in sorted order, are:\\\")\\nSystem.print(ordered)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include xpllib; \\\\for Print\\n\\nint Items, Size, I, J, Gap, JG, T, C, Count;\\n[Items:= [\\\"violet\\\", \\\"red\\\", \\\"green\\\", \\\"indigo\\\", \\\"blue\\\", \\\"yellow\\\", \\\"orange\\\"];\\nSize:= 7;\\nCount:= 0;\\nGap:= Size>>1;\\nwhile Gap > 0 do\\n [for I:= Gap to Size-1 do\\n [J:= I - Gap;\\n loop [JG:= J + Gap;\\n Count:= Count+1;\\n Print(\\\"%2d: Is %6s less than %6s (y/n)? \\\",\\n Count, Items(J), Items(JG));\\n repeat OpenI(1);\\n C:= ChIn(1);\\n until C=^y or C=^n;\\n ChOut(0, C); CrLf(0);\\n if C = ^y then quit;\\n T:= Items(J); Items(J):= Items(JG); Items(JG):= T;\\n J:= J - Gap;\\n if J < 0 then quit;\\n ];\\n ];\\n Gap:= Gap>>1;\\n ];\\nPrint(\\\"The colors of the rainbow, in sorted order, are:\\\\n\\\");\\nfor I:= 0 to Size-2 do Print(\\\"%s, \\\", Items(I));\\nPrint(\\\"%s\\\\n\\\", Items(I));\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Order-by-pair-comparisons"}}},{"rowIdx":1468,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Order_disjoint_list_items\nnote: Sorting Algorithms\n","language":"00-META"},{"code":"{{Sorting Algorithm}}\n\nGiven <code>M</code> as a list of items and another list <code>N</code> of items chosen from <code>M</code>, create <code>M'</code> as a list with the ''first'' occurrences of items from N sorted to be in one of the set of indices of their original occurrence in <code>M</code> but in the order given by their order in <code>N</code>. \n\nThat is, items in <code>N</code> are taken from <code>M</code> without replacement, then the corresponding positions in <code>M'</code> are filled by successive items from <code>N</code>.\n\n\n;For example:\n:if <code>M</code> is <code>'the cat sat on the mat'</code>\n:And <code>N</code> is <code>'mat cat'</code> \n:Then the result <code>M'</code> is <code>'the mat sat on the cat'</code>. \n\nThe words not in <code>N</code> are left in their original positions.\n\n\nIf there are duplications then only the first instances in <code>M</code> up to as many as are mentioned in <code>N</code> are potentially re-ordered.\n\n\n;For example:\n: <code> M = 'A B C A B C A B C' </code>\n: <code> N = 'C A C A' </code>\n\nIs ordered as:\n:<code> M' = 'C B A C B A A B C' </code>\n\n<br>\nShow the output, here, for at least the following inputs:\n<pre>\nData M: 'the cat sat on the mat' Order N: 'mat cat'\nData M: 'the cat sat on the mat' Order N: 'cat mat'\nData M: 'A B C A B C A B C' Order N: 'C A C A'\nData M: 'A B C A B D A B E' Order N: 'E A D A'\nData M: 'A B' Order N: 'B' \nData M: 'A B' Order N: 'B A' \nData M: 'A B B A' Order N: 'B A'\n</pre>\n\n\n;Cf:\n* [[Sort disjoint sublist]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F order_disjoint_list_items(&data, items)\n [Int] itemindices\n L(item) Set(items)\n V itemcount = items.count(item)\n V lastindex = [-1]\n L(i) 0 .< itemcount\n lastindex.append(data.index(item, lastindex.last + 1))\n itemindices [+]= lastindex[1..]\n itemindices.sort()\n L(index, item) zip(itemindices, items)\n data[index] = item\n\nF slist(s)\n R Array(s).map(String)\n\nF tostring(l)\n R ‘'’l.join(‘ ’)‘'’\n\nL(data, items) [(‘the cat sat on the mat’.split(‘ ’), (‘mat cat’).split(‘ ’)),\n (‘the cat sat on the mat’.split(‘ ’), (‘cat mat’).split(‘ ’)),\n (slist(‘ABCABCABC’), slist(‘CACA’)),\n (slist(‘ABCABDABE’), slist(‘EADA’)),\n (slist(‘AB’), slist(‘B’)),\n (slist(‘AB’), slist(‘BA’)),\n (slist(‘ABBA’), slist(‘BA’)),\n (slist(‘’), slist(‘’)),\n (slist(‘A’), slist(‘A’)),\n (slist(‘AB’), slist(‘’)),\n (slist(‘ABBA’), slist(‘AB’)),\n (slist(‘ABAB’), slist(‘AB’)),\n (slist(‘ABAB’), slist(‘BABA’)),\n (slist(‘ABCCBA’), slist(‘ACAC’)),\n (slist(‘ABCCBA’), slist(‘CACA’))]\n print(‘Data M: #<24 Order N: #<9’.format(tostring(data), tostring(items)), end' ‘ ’)\n order_disjoint_list_items(&data, items)\n print(‘-> M' #.’.format(tostring(data)))\n","language":"11l"},{"code":"order(list a, b)\n{\n integer j;\n record r;\n text s;\n\n a.ucall(o_, 0, \" \");\n\n o_(\"| \");\n\n for (, s in b) {\n r[s] += 1;\n o_(s, \" \");\n }\n\n o_(\"->\");\n\n j = -1;\n for (, s in a) {\n if ((r[s] -= 1) < 0) {\n o_(\" \", s);\n } else {\n o_(\" \", b[j += 1]);\n }\n }\n\n o_newline();\n}\n\nmain(void)\n{\n order(list(\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"), list(\"mat\", \"cat\"));\n order(list(\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"), list(\"cat\", \"mat\"));\n order(list(\"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\"), list(\"C\", \"A\", \"C\", \"A\"));\n order(list(\"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\"), list(\"E\", \"A\", \"D\", \"A\"));\n order(list(\"A\", \"B\"), list(\"B\"));\n order(list(\"A\", \"B\"), list(\"B\", \"A\"));\n order(list(\"A\", \"B\", \"B\", \"A\"), list(\"B\", \"A\"));\n\n 0;\n}\n","language":"Aime"},{"code":"---------------------- DISJOINT ORDER --------------------\n\n-- disjointOrder :: String -> String -> String\non disjointOrder(m, n)\n set {ms, ns} to map(my |words|, {m, n})\n\n unwords(flatten(zip(segments(ms, ns), ns & \"\")))\nend disjointOrder\n\n\n-- segments :: [String] -> [String] -> [String]\non segments(ms, ns)\n script segmentation\n on |λ|(a, x)\n set wds to |words| of a\n\n if wds contains x then\n {parts:(parts of a) & ¬\n [current of a], current:[], |words|:deleteFirst(x, wds)} ¬\n\n else\n {parts:(parts of a), current:(current of a) & x, |words|:wds}\n end if\n end |λ|\n end script\n\n tell foldl(segmentation, {|words|:ns, parts:[], current:[]}, ms)\n (parts of it) & [current of it]\n end tell\nend segments\n\n\n--------------------------- TEST -------------------------\non run\n script order\n on |λ|(rec)\n tell rec\n [its m, its n, my disjointOrder(its m, its n)]\n end tell\n end |λ|\n end script\n\n\n arrowTable(map(order, [¬\n {m:\"the cat sat on the mat\", n:\"mat cat\"}, ¬\n {m:\"the cat sat on the mat\", n:\"cat mat\"}, ¬\n {m:\"A B C A B C A B C\", n:\"C A C A\"}, ¬\n {m:\"A B C A B D A B E\", n:\"E A D A\"}, ¬\n {m:\"A B\", n:\"B\"}, {m:\"A B\", n:\"B A\"}, ¬\n {m:\"A B B A\", n:\"B A\"}]))\n\n -- the cat sat on the mat -> mat cat -> the mat sat on the cat\n -- the cat sat on the mat -> cat mat -> the cat sat on the mat\n -- A B C A B C A B C -> C A C A -> C B A C B A A B C\n -- A B C A B D A B E -> E A D A -> E B C A B D A B A\n -- A B -> B -> A B\n -- A B -> B A -> B A\n -- A B B A -> B A -> B A B A\n\nend run\n\n\n------------------------ FORMATTING ----------------------\n\n-- arrowTable :: [[String]] -> String\non arrowTable(rows)\n\n script leftAligned\n script width\n on |λ|(a, b)\n (length of a) - (length of b)\n end |λ|\n end script\n\n on |λ|(col)\n set widest to length of maximumBy(width, col)\n\n script padding\n on |λ|(s)\n justifyLeft(widest, space, s)\n end |λ|\n end script\n\n map(padding, col)\n end |λ|\n end script\n\n script arrows\n on |λ|(row)\n intercalate(\" -> \", row)\n end |λ|\n end script\n\n intercalate(linefeed, ¬\n map(arrows, ¬\n transpose(map(leftAligned, transpose(rows)))))\nend arrowTable\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- concatMap :: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n script append\n on |λ|(a, b)\n a & b\n end |λ|\n end script\n\n foldl(append, {}, map(f, xs))\nend concatMap\n\n\n-- deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]\non deleteBy(fnEq, x, xs)\n if length of xs > 0 then\n set {h, t} to uncons(xs)\n if |λ|(x, h) of mReturn(fnEq) then\n t\n else\n {h} & deleteBy(fnEq, x, t)\n end if\n else\n {}\n end if\nend deleteBy\n\n\n-- deleteFirst :: a -> [a] -> [a]\non deleteFirst(x, xs)\n script Eq\n on |λ|(a, b)\n a = b\n end |λ|\n end script\n\n deleteBy(Eq, x, xs)\nend deleteFirst\n\n\n-- flatten :: Tree a -> [a]\non flatten(t)\n if class of t is list then\n concatMap(my flatten, t)\n else\n t\n end if\nend flatten\n\n\n-- foldl :: (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 |λ|(v, item i of xs, i, xs)\n end repeat\n return v\n end tell\nend foldl\n\n\n-- intercalate :: 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\n-- justifyLeft :: Int -> Char -> Text -> Text\non justifyLeft(n, cFiller, strText)\n if n > length of strText then\n text 1 thru n of (strText & replicate(n, cFiller))\n else\n strText\n end if\nend justifyLeft\n\n\n-- map :: (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 |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- maximumBy :: (a -> a -> Ordering) -> [a] -> a\non maximumBy(f, xs)\n set cmp to mReturn(f)\n script max\n on |λ|(a, b)\n if a is missing value or cmp's |λ|(a, b) < 0 then\n b\n else\n a\n end if\n end |λ|\n end script\n\n foldl(max, missing value, xs)\nend maximumBy\n\n\n-- minimum :: [a] -> a\non minimum(xs)\n script min\n on |λ|(a, x)\n if x < a or a is missing value then\n x\n else\n a\n end if\n end |λ|\n end script\n\n foldl(min, missing value, xs)\nend minimum\n\n\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- Egyptian multiplication - progressively doubling a list, appending\n-- stages of doubling to an accumulator where needed for binary\n-- assembly of a target length\n\n-- replicate :: 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\n-- transpose :: [[a]] -> [[a]]\non transpose(xss)\n script column\n on |λ|(_, iCol)\n script row\n on |λ|(xs)\n item iCol of xs\n end |λ|\n end script\n\n map(row, xss)\n end |λ|\n end script\n\n map(column, item 1 of xss)\nend transpose\n\n\n-- uncons :: [a] -> Maybe (a, [a])\non uncons(xs)\n if length of xs > 0 then\n {item 1 of xs, rest of xs}\n else\n missing value\n end if\nend uncons\n\n\n-- unwords :: [String] -> String\non unwords(xs)\n intercalate(space, xs)\nend unwords\n\n\n-- words :: String -> [String]\non |words|(s)\n words of s\nend |words|\n\n\n-- zip :: [a] -> [b] -> [(a, b)]\non zip(xs, ys)\n script pair\n on |λ|(x, i)\n [x, item i of ys]\n end |λ|\n end script\n\n map(pair, items 1 thru minimum([length of xs, length of ys]) of xs)\nend zip\n","language":"AppleScript"},{"code":"(*\n The task description talks about items in lists, but the examples are space-delimited substrings of strings.\n The handler here deals with items in lists and leaves it to the calling code to sort out the rest.\n*)\non odli(m, n)\n -- Use shallow copies of the lists in case the calling process wants the passed originals to remain intact.\n set m to m's items\n set n_source to n's items\n set n_check to n's items\n\n repeat with i from 1 to (count m)\n set thisItem to item i of m\n if ({thisItem} is in n_check) then\n set item i of m to beginning of n_source\n set n_source to rest of n_source\n if (n_source is {}) then exit repeat\n repeat with j from 1 to (count n_check)\n if (item j of n_check is thisItem) then\n set item j of n_check to beginning of n_check\n set n_check to rest of n_check\n exit repeat\n end if\n end repeat\n end if\n end repeat\n\n return m\nend odli\n\n-- Task code:\nset textPairs to {{\"the cat sat on the mat\", \"mat cat\"}, {\"the cat sat on the mat\", \"cat mat\"}, ¬\n {\"A B C A B C A B C\", \"C A C A\"}, {\"A B C A B D A B E\", \"E A D A\"}, ¬\n {\"A B\", \"B\"}, {\"A B\", \"B A\"}, {\"A B B A\", \"B A\"}}\nset output to {}\nset astid to AppleScript's text item delimiters\nset AppleScript's text item delimiters to space\nrepeat with thisPair in textPairs\n set {m, n} to thisPair\n set spiel to \"Data M: '\" & m & \"'\\tOrder N: '\" & n & \"'\\t--> '\"\n set end of output to spiel & odli(m's text items, n's text items) & \"'\"\nend repeat\nset AppleScript's text item delimiters to linefeed\nset output to output as text\nset AppleScript's text item delimiters to astid\nreturn output\n","language":"AppleScript"},{"code":"\"Data M: 'the cat sat on the mat'\tOrder N: 'mat cat'\t--> 'the mat sat on the cat'\nData M: 'the cat sat on the mat'\tOrder N: 'cat mat'\t--> 'the cat sat on the mat'\nData M: 'A B C A B C A B C'\tOrder N: 'C A C A'\t--> 'C B A C B A A B C'\nData M: 'A B C A B D A B E'\tOrder N: 'E A D A'\t--> 'E B C A B D A B A'\nData M: 'A B'\tOrder N: 'B'\t--> 'A B'\nData M: 'A B'\tOrder N: 'B A'\t--> 'B A'\nData M: 'A B B A'\tOrder N: 'B A'\t--> 'B A B A'\"\n","language":"AppleScript"},{"code":"set listOfLists1 to {{1, 2, 3, 4, 5}, {5, 4, 3, 2, 1}, {\"aardvark\", \"duck-billed platypus\", \"banana\"}}\nset listOfLists2 to {{\"aardvark\", \"duck-billed platypus\", \"banana\"}, {1, 2, 3, 4, 5}}\nreturn odli(listOfLists1, listOfLists2)\n","language":"AppleScript"},{"code":"{{\"aardvark\", \"duck-billed platypus\", \"banana\"}, {5, 4, 3, 2, 1}, {1, 2, 3, 4, 5}}\n","language":"AppleScript"},{"code":"orderDisjoint: function [m,n][\n ms: split.words m\n ns: split.words n\n\n indexes: new []\n\n loop ns 'item [\n idx: index ms item\n unless null? idx [\n 'indexes ++ idx\n ms\\[idx]: \"\"\n ]\n ]\n sort 'indexes\n\n loop.with:'i indexes 'idx ->\n ms\\[idx]: ns\\[i]\n\n return join.with:\" \" ms\n]\n\nprocess: function [a,b][\n print [a \"|\" b \"->\" orderDisjoint a b]\n]\n\nprocess \"the cat sat on the mat\" \"mat cat\"\nprocess \"the cat sat on the mat\" \"cat mat\"\nprocess \"A B C A B C A B C\" \"C A C A\"\nprocess \"A B C A B D A B E\" \"E A D A\"\nprocess \"A B\" \"B\"\nprocess \"A B\" \"B A\"\nprocess \"A B B A\" \"B A\"\n","language":"Arturo"},{"code":"Data := [ {M: \"the cat sat on the mat\", N: \"mat cat\"}\n\t, {M: \"the cat sat on the mat\", N: \"cat mat\"}\n\t, {M: \"A B C A B C A B C\", N: \"C A C A\"}\n\t, {M: \"A B C A B D A B E\", N: \"E A D A\"}\n\t, {M: \"A B\", N: \"B\"}\n\t, {M: \"A B\", N: \"B A\"}\n\t, {M: \"A B B A\", N: \"B A\"} ]\n\nfor Key, Val in Data\n\tOutput .= Val.M \" :: \" Val.N \" -> \" OrderDisjointList(Val.M, Val.N) \"`n\"\nMsgBox, % RTrim(Output, \"`n\")\n\nOrderDisjointList(M, N) {\n\tItemsN := []\n\tLoop, Parse, N, % A_Space\n\t\tItemsN[A_LoopField] := ItemsN[A_LoopField] ? ItemsN[A_LoopField] + 1 : 1\n\tN := StrSplit(N, A_Space)\n\tLoop, Parse, M, % A_Space\n\t\tResult .= (ItemsN[A_LoopField]-- > 0 ? N.Remove(1) : A_LoopField) \" \"\n\treturn RTrim(Result)\n}\n","language":"AutoHotkey"},{"code":"( ( odli\n = M N NN item A Z R\n . !arg:(?M.?N)\n & :?NN\n & whl\n ' ( !N:%?item ?N\n & ( !M:?A !item ?Z\n & !A (.) !Z:?M\n & !NN !item:?NN\n |\n )\n )\n & :?R\n & whl\n ' ( !M:?A (.) ?M\n & !NN:%?item ?NN\n & !R !A !item:?R\n )\n & !R !M\n )\n& (the cat sat on the mat.mat cat)\n (the cat sat on the mat.cat mat)\n (A B C A B C A B C.C A C A)\n (A B C A B D A B E.E A D A)\n (A B.B)\n (A B.B A)\n (A B B A.B A)\n : ?tests\n& whl\n ' ( !tests:(?M.?N) ?tests\n & put$(\"Data M:\" !M)\n & put$(\"\\tOrder N:\" !N)\n & out$(\\t odli$(!M.!N))\n )\n);\n","language":"Bracmat"},{"code":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <string>\n\ntemplate <typename T>\nvoid print(const std::vector<T> v) {\n std::cout << \"{ \";\n for (const auto& e : v) {\n std::cout << e << \" \";\n }\n std::cout << \"}\";\n}\n\ntemplate <typename T>\nauto orderDisjointArrayItems(std::vector<T> M, std::vector<T> N) {\n std::vector<T*> M_p(std::size(M));\n for (auto i = 0; i < std::size(M_p); ++i) {\n M_p[i] = &M[i];\n }\n for (auto e : N) {\n auto i = std::find_if(std::begin(M_p), std::end(M_p), [e](auto c) -> bool {\n if (c != nullptr) {\n if (*c == e) return true;\n }\n return false;\n });\n if (i != std::end(M_p)) {\n *i = nullptr;\n }\n }\n for (auto i = 0; i < std::size(N); ++i) {\n auto j = std::find_if(std::begin(M_p), std::end(M_p), [](auto c) -> bool {\n return c == nullptr;\n });\n if (j != std::end(M_p)) {\n *j = &M[std::distance(std::begin(M_p), j)];\n **j = N[i];\n }\n }\n return M;\n}\n\nint main() {\n std::vector<std::vector<std::vector<std::string>>> l = {\n { { \"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\" }, { \"mat\", \"cat\" } },\n { { \"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\" },{ \"cat\", \"mat\" } },\n { { \"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\" },{ \"C\", \"A\", \"C\", \"A\" } },\n { { \"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\" },{ \"E\", \"A\", \"D\", \"A\" } },\n { { \"A\", \"B\" },{ \"B\" } },\n { { \"A\", \"B\" },{ \"B\", \"A\" } },\n { { \"A\", \"B\", \"B\", \"A\" },{ \"B\", \"A\" } }\n };\n for (const auto& e : l) {\n std::cout << \"M: \";\n print(e[0]);\n std::cout << \", N: \";\n print(e[1]);\n std::cout << \", M': \";\n auto res = orderDisjointArrayItems<std::string>(e[0], e[1]);\n print(res);\n std::cout << std::endl;\n }\n std::cin.ignore();\n std::cin.get();\n return 0;\n}\n","language":"C++"},{"code":"(defun order-disjoint (data order)\n (let ((order-b (make-hash-table :test 'equal)))\n (loop :for n :in order :do (incf (gethash n order-b 0)))\n (loop :for m :in data :collect\n (cond ((< 0 (gethash m order-b 0))\n (decf (gethash m order-b))\n (pop order))\n (t m)))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.string, std.algorithm, std.array, std.range,\n std.conv;\n\nT[] orderDisjointArrayItems(T)(in T[] data, in T[] items)\npure /*nothrow*/ @safe {\n int[] itemIndices;\n foreach (item; items.dup.sort().uniq) {\n immutable int itemCount = items.count(item);\n assert(data.count(item) >= itemCount,\n text(\"More of \", item, \" than in data\"));\n auto lastIndex = [-1];\n foreach (immutable _; 0 .. itemCount) {\n immutable start = lastIndex.back + 1;\n lastIndex ~= data[start .. $].countUntil(item) + start;\n }\n itemIndices ~= lastIndex.dropOne;\n }\n\n itemIndices.sort();\n auto result = data.dup;\n foreach (index, item; zip(itemIndices, items))\n result[index] = item;\n return result;\n}\n\nvoid main() {\n immutable problems =\n \"the cat sat on the mat | mat cat\n the cat sat on the mat | cat mat\n A B C A B C A B C | C A C A\n A B C A B D A B E | E A D A\n A B | B\n A B | B A\n A B B A | B A\n |\n A | A\n A B |\n A B B A | A B\n A B A B | A B\n A B A B | B A B A\n A B C C B A | A C A C\n A B C C B A | C A C A\"\n .splitLines.map!(r => r.split(\"|\")).array;\n\n foreach (immutable p; problems) {\n immutable a = p[0].split;\n immutable b = p[1].split;\n writefln(\"%s | %s -> %-(%s %)\", p[0].strip, p[1].strip,\n orderDisjointArrayItems(a, b));\n }\n}\n","language":"D"},{"code":"(lib 'list) ;; for list-delete\n\n(define dataM\n'((the cat sat on the mat)\n(the cat sat on the mat)\n(A B C A B C A B C)\n(A B C A B D A B E)\n(A B)\n(A B)\n(A B B A)))\n\t\t\n(define orderM\n'((mat cat)\n(cat mat)\n(C A C A)\n(E A D A)\n(B)\n(B A)\n(B A)))\n\n(define (order-disjoint M N)\n(define R (append N null)) ;; tmp copy of N : delete w when used\n\t(for/list [(w M)]\n\t(if\n\t\t(not (member w R)) w ;; output as is\n\t\t(begin0\n\t\t(first N) ;; replacer\n\t\t(set! N (rest N))\n\t\t(set! R (list-delete R w))))))\n\t\t\n","language":"EchoLisp"},{"code":"defmodule Order do\n def disjoint(m,n) do\n IO.write \"#{Enum.join(m,\" \")} | #{Enum.join(n,\" \")} -> \"\n Enum.chunk(n,2)\n |> Enum.reduce({m,0}, fn [x,y],{m,from} ->\n md = Enum.drop(m, from)\n if x > y and x in md and y in md do\n if Enum.find_index(md,&(&1==x)) > Enum.find_index(md,&(&1==y)) do\n new_from = max(Enum.find_index(m,&(&1==x)), Enum.find_index(m,&(&1==y))) + 1\n m = swap(m,from,x,y)\n from = new_from\n end\n end\n {m,from}\n end)\n |> elem(0)\n |> Enum.join(\" \")\n |> IO.puts\n end\n\n defp swap(m,from,x,y) do\n ix = Enum.find_index(m,&(&1==x)) + from\n iy = Enum.find_index(m,&(&1==y)) + from\n vx = Enum.at(m,ix)\n vy = Enum.at(m,iy)\n m |> List.replace_at(ix,vy) |> List.replace_at(iy,vx)\n end\nend\n\n[ {\"the cat sat on the mat\", \"mat cat\"},\n {\"the cat sat on the mat\", \"cat mat\"},\n {\"A B C A B C A B C\" , \"C A C A\"},\n {\"A B C A B D A B E\" , \"E A D A\"},\n {\"A B\" , \"B\"},\n {\"A B\" , \"B A\"},\n {\"A B B A\" , \"B A\"} ]\n|> Enum.each(fn {m,n} ->\n Order.disjoint(String.split(m),String.split(n))\n end)\n","language":"Elixir"},{"code":"qw{ the cat sat on the mat } qw{ mat cat } make-slots\n","language":"Factor"},{"code":"USING: assocs combinators combinators.smart effects formatting\nfry kernel qw sequences ;\nIN: rosetta-code.order-disjoint-list\n\n: make-slot ( seq elt -- )\n dupd [ = ] curry find drop swap [ \\ _ ] 2dip set-nth ;\n\n: make-slots ( seq elts -- seq' ) dupd [ make-slot ] with each ;\n\n: reorder ( seq elts -- seq' )\n tuck make-slots [ ] like over { \"x\" } <effect>\n '[ _ fry _ call-effect ] input<sequence ; inline\n\n: show-reordering ( seq elts -- )\n 2dup [ clone ] dip reorder [ \" \" join ] tri@\n \"M: %-23s N: %-8s M': %s\\n\" printf ; inline\n\n{\n { qw{ the cat sat on the mat } qw{ mat cat } }\n { qw{ the cat sat on the mat } qw{ cat mat } }\n { qw{ A B C A B C A B C } qw{ C A C A } }\n { qw{ A B C A B D A B E } qw{ E A D A } }\n { qw{ A B } qw{ B } }\n { qw{ A B } qw{ B A } }\n { qw{ A B B A } qw{ B A } }\n}\n[ show-reordering ] assoc-each\n","language":"Factor"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n\t\"strings\"\n)\n\ntype indexSort struct {\n\tval sort.Interface\n\tind []int\n}\n\nfunc (s indexSort) Len() int { return len(s.ind) }\nfunc (s indexSort) Less(i, j int) bool { return s.ind[i] < s.ind[j] }\nfunc (s indexSort) Swap(i, j int) {\n\ts.val.Swap(s.ind[i], s.ind[j])\n\ts.ind[i], s.ind[j] = s.ind[j], s.ind[i]\n}\n\nfunc disjointSliceSort(m, n []string) []string {\n\ts := indexSort{sort.StringSlice(m), make([]int, 0, len(n))}\n\tused := make(map[int]bool)\n\tfor _, nw := range n {\n\t\tfor i, mw := range m {\n\t\t\tif used[i] || mw != nw {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tused[i] = true\n\t\t\ts.ind = append(s.ind, i)\n\t\t\tbreak\n\t\t}\n\t}\n\tsort.Sort(s)\n\treturn s.val.(sort.StringSlice)\n}\n\nfunc disjointStringSort(m, n string) string {\n\treturn strings.Join(\n\t\tdisjointSliceSort(strings.Fields(m), strings.Fields(n)), \" \")\n}\n\nfunc main() {\n\tfor _, data := range []struct{ m, n string }{\n\t\t{\"the cat sat on the mat\", \"mat cat\"},\n\t\t{\"the cat sat on the mat\", \"cat mat\"},\n\t\t{\"A B C A B C A B C\", \"C A C A\"},\n\t\t{\"A B C A B D A B E\", \"E A D A\"},\n\t\t{\"A B\", \"B\"},\n\t\t{\"A B\", \"B A\"},\n\t\t{\"A B B A\", \"B A\"},\n\t} {\n\t\tmp := disjointStringSort(data.m, data.n)\n\t\tfmt.Printf(\"%s → %s » %s\\n\", data.m, data.n, mp)\n\t}\n\n}\n","language":"Go"},{"code":"import Data.List (mapAccumL, sort)\n\norder\n :: Ord a\n => [[a]] -> [a]\norder [ms, ns] = snd . mapAccumL yu ls $ ks\n where\n ks = zip ms [(0 :: Int) ..]\n ls = zip ns . sort . snd . foldl go (sort ns, []) . sort $ ks\n yu ((u, v):us) (_, y)\n | v == y = (us, u)\n yu ys (x, _) = (ys, x)\n go (u:us, ys) (x, y)\n | u == x = (us, y : ys)\n go ts _ = ts\n\ntask :: [String] -> IO ()\ntask ls@[ms, ns] =\n putStrLn $\n \"M: \" ++ ms ++ \" | N: \" ++ ns ++ \" |> \" ++ (unwords . order . map words $ ls)\n\nmain :: IO ()\nmain =\n mapM_\n task\n [ [\"the cat sat on the mat\", \"mat cat\"]\n , [\"the cat sat on the mat\", \"cat mat\"]\n , [\"A B C A B C A B C\", \"C A C A\"]\n , [\"A B C A B D A B E\", \"E A D A\"]\n , [\"A B\", \"B\"]\n , [\"A B\", \"B A\"]\n , [\"A B B A\", \"B A\"]\n ]\n","language":"Haskell"},{"code":"import Control.Monad (join)\nimport Data.Bifunctor (bimap)\nimport Data.List (delete, transpose)\nimport Data.Text hiding\n ( concat,\n foldl,\n maximum,\n transpose,\n zipWith,\n )\nimport Prelude hiding (length, unlines, unwords, words)\n\ndisjointOrder ::\n Eq a =>\n [a] ->\n [a] ->\n [a]\ndisjointOrder m n = concat $ zipWith (<>) ms ns\n where\n ms = segments m n\n -- As a list of lists, lengthened by 1\n ns = ((: []) <$> n) <> [[]]\n segments ::\n Eq a =>\n [a] ->\n [a] ->\n [[a]]\n segments m n = _m <> [_acc]\n where\n (_m, _, _acc) = foldl split ([], n, []) m\n split ::\n Eq a =>\n ([[a]], [a], [a]) ->\n a ->\n ([[a]], [a], [a])\n split (ms, ns, acc) x\n | x `elem` ns = (ms <> [acc], delete x ns, [])\n | otherwise = (ms, ns, acc <> [x])\n\n--------------------------- TEST -------------------------\ntests :: [(Text, Text)]\ntests =\n join bimap pack\n <$> [ (\"the cat sat on the mat\", \"mat cat\"),\n (\"the cat sat on the mat\", \"cat mat\"),\n (\"A B C A B C A B C\", \"C A C A\"),\n (\"A B C A B D A B E\", \"E A D A\"),\n (\"A B\", \"B\"),\n (\"A B\", \"B A\"),\n (\"A B B A\", \"B A\")\n ]\n\ntable :: Text -> [[Text]] -> Text\ntable delim rows =\n unlines $\n intercalate delim\n <$> transpose\n ( ( \\col ->\n let width = (length $ maximum col)\n in justifyLeft width ' ' <$> col\n )\n <$> transpose rows\n )\n\nmain :: IO ()\nmain =\n (putStr . unpack) $\n table (pack \" -> \") $\n ( \\(m, n) ->\n [ m,\n n,\n unwords (disjointOrder (words m) (words n))\n ]\n )\n <$> tests\n","language":"Haskell"},{"code":"procedure main(A)\n every write(\" -> \",odli(\"the cat sat on the mat\",\"mat cat\"))\n every write(\" -> \",odli(\"the cat sat on the mat\",\"cat mat\"))\n every write(\" -> \",odli(\"A B C A B C A B C\",\"C A C A\"))\n every write(\" -> \",odli(\"A B C A B D A B E\",\"E A D A\"))\n every write(\" -> \",odli(\"A B\",\"B\"))\n every write(\" -> \",odli(\"A B\",\"B A\"))\n every write(\" -> \",odli(\"A B B A\",\"B A\"))\nend\n\nprocedure odli(M,N)\n writes(M,\" :: \",N)\n Mp := \"\"\n P := N ||:= \" \"\n (M||\" \") ? while item := tab(upto(' '))||move(1) do {\n if find(item,P) then {\n P ?:= 1(tab(find(item)),move(*item))||tab(0)\n N ?:= (item := tab(upto(' '))||move(1), tab(0))\n }\n Mp ||:= item\n }\n return Mp\nend\n","language":"Icon"},{"code":"disjorder=:3 :0&.;:\n:\n clusters=. (</. i.@#) x\n order=. x i.&~. y\n need=. #/.~ y\n from=. ;need (#{.)each (/:~order){clusters\n to=. ;need {.!._ each order{clusters\n (from{x) to} x\n)\n","language":"J"},{"code":" 'the cat sat on the mat' disjorder 'mat cat'\nthe mat sat on the cat\n 'the cat sat on the mat' disjorder 'cat mat'\nthe cat sat on the mat\n 'A B C A B C A B C' disjorder 'C A C A'\nC B A C B A A B C\n 'A B C A B D A B E' disjorder 'E A D A'\nD B C D B E A B A\n 'A B' disjorder 'B'\nA B\n 'A B' disjorder 'B A'\nB A\n 'A B B A' disjorder 'B A'\nB A B A\n","language":"J"},{"code":"import java.util.Arrays;\nimport java.util.BitSet;\nimport org.apache.commons.lang3.ArrayUtils;\n\npublic class OrderDisjointItems {\n\n public static void main(String[] args) {\n final String[][] MNs = {{\"the cat sat on the mat\", \"mat cat\"},\n {\"the cat sat on the mat\", \"cat mat\"},\n {\"A B C A B C A B C\", \"C A C A\"}, {\"A B C A B D A B E\", \"E A D A\"},\n {\"A B\", \"B\"}, {\"A B\", \"B A\"}, {\"A B B A\", \"B A\"}, {\"X X Y\", \"X\"}};\n\n for (String[] a : MNs) {\n String[] r = orderDisjointItems(a[0].split(\" \"), a[1].split(\" \"));\n System.out.printf(\"%s | %s -> %s%n\", a[0], a[1], Arrays.toString(r));\n }\n }\n\n // if input items cannot be null\n static String[] orderDisjointItems(String[] m, String[] n) {\n for (String e : n) {\n int idx = ArrayUtils.indexOf(m, e);\n if (idx != -1)\n m[idx] = null;\n }\n for (int i = 0, j = 0; i < m.length; i++) {\n if (m[i] == null)\n m[i] = n[j++];\n }\n return m;\n }\n\n // otherwise\n static String[] orderDisjointItems2(String[] m, String[] n) {\n BitSet bitSet = new BitSet(m.length);\n for (String e : n) {\n int idx = -1;\n do {\n idx = ArrayUtils.indexOf(m, e, idx + 1);\n } while (idx != -1 && bitSet.get(idx));\n if (idx != -1)\n bitSet.set(idx);\n }\n for (int i = 0, j = 0; i < m.length; i++) {\n if (bitSet.get(i))\n m[i] = n[j++];\n }\n return m;\n }\n}\n","language":"Java"},{"code":"(() => {\n \"use strict\";\n\n // ------------ ORDER DISJOINT LIST ITEMS ------------\n\n // disjointOrder :: [String] -> [String] -> [String]\n const disjointOrder = ms =>\n ns => zipWith(\n a => b => [...a, b]\n )(\n segments(ms)(ns)\n )(\n ns.concat(\"\")\n )\n .flat();\n\n\n // segments :: [String] -> [String] -> [String]\n const segments = ms =>\n ns => {\n const dct = ms.reduce((a, x) => {\n const\n wds = a.words,\n found = wds.indexOf(x) !== -1;\n\n return {\n parts: [\n ...a.parts,\n ...(found ? [a.current] : [])\n ],\n current: found ? [] : [...a.current, x],\n words: found ? deleteFirst(x)(wds) : wds\n };\n }, {\n words: ns,\n parts: [],\n current: []\n });\n\n return [...dct.parts, dct.current];\n };\n\n\n // ---------------------- TEST -----------------------\n const main = () =>\n transpose(transpose([{\n M: \"the cat sat on the mat\",\n N: \"mat cat\"\n }, {\n M: \"the cat sat on the mat\",\n N: \"cat mat\"\n }, {\n M: \"A B C A B C A B C\",\n N: \"C A C A\"\n }, {\n M: \"A B C A B D A B E\",\n N: \"E A D A\"\n }, {\n M: \"A B\",\n N: \"B\"\n }, {\n M: \"A B\",\n N: \"B A\"\n }, {\n M: \"A B B A\",\n N: \"B A\"\n }].map(dct => [\n dct.M, dct.N,\n unwords(\n disjointOrder(\n words(dct.M)\n )(\n words(dct.N)\n )\n )\n ]))\n .map(col => {\n const\n w = maximumBy(\n comparing(x => x.length)\n )(col).length;\n\n return col.map(justifyLeft(w)(\" \"));\n }))\n .map(\n ([a, b, c]) => `${a} -> ${b} -> ${c}`\n )\n .join(\"\\n\");\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // comparing :: (a -> b) -> (a -> a -> Ordering)\n const comparing = f =>\n // The ordering of f(x) and f(y) as a value\n // drawn from {-1, 0, 1}, representing {LT, EQ, GT}.\n x => y => {\n const\n a = f(x),\n b = f(y);\n\n return a < b ? -1 : (a > b ? 1 : 0);\n };\n\n\n // deleteFirst :: a -> [a] -> [a]\n const deleteFirst = x => {\n const go = xs => 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 // unwords :: [String] -> String\n const unwords = xs =>\n // A space-separated string derived\n // from a list of words.\n xs.join(\" \");\n\n\n // words :: String -> [String]\n const words = s =>\n // List of space-delimited sub-strings.\n s.split(/\\s+/u);\n\n\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\n const zipWith = f =>\n // A list constructed by zipping with a\n // custom function, rather than with the\n // default tuple constructor.\n xs => ys => xs.map(\n (x, i) => f(x)(ys[i])\n ).slice(\n 0, Math.min(xs.length, ys.length)\n );\n\n // ---------------- FORMATTING OUTPUT ----------------\n\n // justifyLeft :: Int -> Char -> String -> String\n const justifyLeft = n =>\n // The string s, followed by enough padding (with\n // the character c) to reach the string length n.\n c => s => n > s.length ? (\n s.padEnd(n, c)\n ) : s;\n\n\n // maximumBy :: (a -> a -> Ordering) -> [a] -> a\n const maximumBy = f =>\n xs => Boolean(xs.length) ? (\n xs.slice(1).reduce(\n (a, x) => 0 < f(x)(a) ? (\n x\n ) : a,\n xs[0]\n )\n ) : undefined;\n\n\n // transpose :: [[a]] -> [[a]]\n const transpose = rows =>\n // The columns of a matrix of consistent row length,\n // transposed into corresponding rows.\n Boolean(rows.length) ? rows[0].map(\n (_, i) => rows.flatMap(\n v => v[i]\n )\n ) : [];\n\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def disjoint_order(N):\n # The helper function, indices, ensures that successive occurrences\n # of a particular value in N are matched by successive occurrences\n # in the input on the assumption that null is not initially in the input.\n def indices:\n . as $in\n | reduce range(0; N|length) as $i\n # state: [ array, indices ]\n ( [$in, []];\n (.[0] | index(N[$i])) as $ix | .[0][$ix] = null | .[1] += [$ix])\n | .[1];\n\n . as $in\n | (indices | sort) as $sorted\n | reduce range(0; N|length) as $i ($in; .[$sorted[$i]] = N[$i] ) ;\n","language":"Jq"},{"code":"[\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"] | indices( [\"mat\", \"cat\"] )\n#=> [\"the\",\"mat\",\"sat\",\"on\",\"the\",\"cat\"]\n","language":"Jq"},{"code":"[\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"] | disjoint_order( [\"cat\", \"mat\"] )\n#=> [\"the\",\"cat\",\"sat\",\"on\",\"the\",\"mat\"]\n","language":"Jq"},{"code":"[\"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\"] | disjoint_order( [\"C\", \"A\", \"C\", \"A\"] )\n#=> [\"C\",\"B\",\"A\",\"C\",\"B\",\"A\",\"A\",\"B\",\"C\"]\n","language":"Jq"},{"code":"[\"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\"] | disjoint_order( [\"E\", \"A\", \"D\", \"A\"] )\n#=> [\"E\",\"B\",\"C\",\"A\",\"B\",\"D\",\"A\",\"B\",\"A\"]\n","language":"Jq"},{"code":"[\"A\", \"B\"] | disjoint_order( [\"B\"] )\n#=> [\"A\",\"B\"]\n","language":"Jq"},{"code":"[\"A\", \"B\"] | disjoint_order( [\"B\", \"A\"] )\n#=> [\"B\",\"A\"]\n","language":"Jq"},{"code":"[\"A\", \"B\", \"B\", \"A\"] | disjoint_order( [\"B\", \"A\"] )\n#=> [\"B\",\"A\",\"B\",\"A\"]\n","language":"Jq"},{"code":"[\"X\", \"X\", \"Y\"] | disjoint_order([\"X\"])\n#=> [X, X, Y]\n","language":"Jq"},{"code":"function order_disjoint{T<:AbstractArray}(m::T, n::T)\n rlen = length(n)\n rdis = zeros(Int, rlen)\n for (i, e) in enumerate(n)\n j = findfirst(m, e)\n while j in rdis && j != 0\n j = findnext(m, e, j+1)\n end\n rdis[i] = j\n end\n if 0 in rdis\n throw(DomainError())\n end\n sort!(rdis)\n p = copy(m)\n p[rdis] = n\n return p\nend\n","language":"Julia"},{"code":"testm = {[\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"],\n [\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"],\n [\"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\"],\n [\"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\"],\n [\"A\", \"B\"],\n [\"A\", \"B\"],\n [\"A\", \"B\", \"B\", \"A\"],\n }\n\ntestn = {[\"mat\", \"cat\"],\n [\"cat\", \"mat\"],\n [\"C\", \"A\", \"C\", \"A\"],\n [\"E\", \"A\", \"D\", \"A\"],\n [\"B\"],\n [\"B\", \"A\"],\n [\"B\", \"A\"],\n }\n\nfor i in 1:length(testm)\n m = join(testm[i], \" \")\n n = join(testn[i], \" \")\n p = join(order_disjoint(testm[i], testn[i]), \" \")\n println(\" (\", m, \", \", n, \") => \", p)\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nconst val NULL = \"\\u0000\"\n\nfun orderDisjointList(m: String, n: String): String {\n val nList = n.split(' ')\n // first replace the first occurrence of items of 'n' in 'm' with the NULL character\n // which we can safely assume won't occur in 'm' naturally\n var p = m\n for (item in nList) p = p.replaceFirst(item, NULL)\n // now successively replace the NULLs with items from nList\n val mList = p.split(NULL)\n val sb = StringBuilder()\n for (i in 0 until nList.size) sb.append(mList[i], nList[i])\n return sb.append(mList.last()).toString()\n}\n\nfun main(args: Array<String>) {\n val m = arrayOf(\n \"the cat sat on the mat\",\n \"the cat sat on the mat\",\n \"A B C A B C A B C\",\n \"A B C A B D A B E\",\n \"A B\",\n \"A B\",\n \"A B B A\"\n )\n val n = arrayOf(\n \"mat cat\",\n \"cat mat\",\n \"C A C A\",\n \"E A D A\",\n \"B\",\n \"B A\",\n \"B A\"\n )\n for (i in 0 until m.size)\n println(\"${m[i].padEnd(22)} -> ${n[i].padEnd(7)} -> ${orderDisjointList(m[i], n[i])}\")\n}\n","language":"Kotlin"},{"code":"-- Split str on any space characters and return as a table\nfunction split (str)\n local t = {}\n for word in str:gmatch(\"%S+\") do table.insert(t, word) end\n return t\nend\n\n-- Order disjoint list items\nfunction orderList (dataStr, orderStr)\n local data, order = split(dataStr), split(orderStr)\n for orderPos, orderWord in pairs(order) do\n for dataPos, dataWord in pairs(data) do\n if dataWord == orderWord then\n data[dataPos] = false\n break\n end\n end\n end\n local orderPos = 1\n for dataPos, dataWord in pairs(data) do\n if not dataWord then\n data[dataPos] = order[orderPos]\n orderPos = orderPos + 1\n if orderPos > #order then return data end\n end\n end\n return data\nend\n\n-- Main procedure\nlocal testCases = {\n {'the cat sat on the mat', 'mat cat'},\n {'the cat sat on the mat', 'cat mat'},\n {'A B C A B C A B C' , 'C A C A'},\n {'A B C A B D A B E' , 'E A D A'},\n {'A B' , 'B'},\n {'A B' , 'B A'},\n {'A B B A' , 'B A'}\n}\nfor _, example in pairs(testCases) do\n print(table.concat(orderList(unpack(example)), \" \"))\nend\n","language":"Lua"},{"code":"Function Checkit$ {\n\tDocument Ret$\n\tFlush\n\tData \"the cat sat on the mat\", \"mat cat\"\n\tData \"the cat sat on the mat\",\"cat mat\"'\n\tData \"A B C A B C A B C\", \"C A C A\"\n\tData \"A B C A B D A B E\", \"E A D A\"\n\tData \"A B\", \"B\"\n\tData \"A B\", \"B A\"\n\tData \"A B B A\",\"B A\"\n\tDim A$()\n\twhile not empty\n\t\tread m$, n$\n\t\tA$()=piece$(m$, \" \")\n\t\tLet w=piece$(n$, \" \")\n\t\tLet z=A$()\n\t\tx=each(w)\n\t\twhile x\n\t\t\ty=z#pos(array$(x))\n\t\t\tif y>-1 then a$(y)=\"\"\n\t\tend while\n\t\tp=0\n\t\tx=each(w)\n\t\twhile x\n\t\t\twhile a$(p)<>\"\" : p++: end while\n\t\t\ta$(p)=array$(x)\n\t\tend while\n\t\tret$=m$+\" | \"+n$+\" -> \"+z#str$()+{\n\t\t}\n\tend while\n\t=ret$\n}\nReport Checkit$()\nClipboard Checkit$()\n","language":"M2000-Interpreter"},{"code":"Function Checkit2$ {\n\tDocument Ret$\n\tFlush\n\tData \"the cat sat on the mat\", \"mat cat\"\n\tData \"the cat sat on the mat\",\"cat mat\"'\n\tData \"A B C A B C A B C\", \"C A C A\"\n\tData \"A B C A B D A B E\", \"E A D A\"\n\tData \"A B\", \"B\"\n\tData \"A B\", \"B A\"\n\tData \"A B B A\",\"B A\"\n\tDim A$()\n\twhile not empty\n\t\tread m$, n$\n\t\tA$()=piece$(m$, \" \")\n\t\tLet w=piece$(n$, \" \")\n\t\tLet z=A$()\n\t\tdim p(len(w))\n\t\tx=each(w)\n\t\tp=0\n\t\twhile x\n\t\t\ty=z#pos(array$(x))\n\t\t\tif y>-1 then a$(y)=\"\": p(p)=y : p++\n\t\tend while\n\t\tu=p()#Sort()\n\t\tx=each(u)\n\t\twhile x\n\t\t\ta$(array(x))=w#val$(x^)\n\t\tend while\n\t\tret$=m$+\" | \"+n$+\" -> \"+z#str$()+{\n\t\t}\n\tend while\n\t=ret$\n}\nReport Checkit2$()\nClipboard Checkit2$()\n","language":"M2000-Interpreter"},{"code":"order[m_, n_] :=\n ReplacePart[m,\n MapThread[\n Rule, {Position[m, Alternatives @@ n][[;; Length[n]]], n}]];\nPrint[StringRiffle[\n order[{\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"}, {\"mat\",\n \"cat\"}]]];\nPrint[StringRiffle[\n order[{\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"}, {\"cat\",\n \"mat\"}]]];\nPrint[StringRiffle[\n order[{\"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\"}, {\"C\", \"A\",\n \"C\", \"A\"}]]];\nPrint[StringRiffle[\n order[{\"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\"}, {\"E\", \"A\",\n \"D\", \"A\"}]]];\nPrint[StringRiffle[order[{\"A\", \"B\"}, {\"B\"}]]];\nPrint[StringRiffle[order[{\"A\", \"B\"}, {\"B\", \"A\"}]]];\nPrint[StringRiffle[order[{\"A\", \"B\", \"B\", \"A\"}, {\"B\", \"A\"}]]];\n","language":"Mathematica"},{"code":"import algorithm, strutils\n\n\nproc orderDisjoint(m, n: string): string =\n\n # Build the list of items.\n var m = m.splitWhitespace()\n let n = n.splitWhitespace()\n\n # Find the indexes of items to replace.\n var indexes: seq[int]\n for item in n:\n let idx = m.find(item)\n if idx >= 0:\n indexes.add idx\n m[idx] = \"\" # Set to empty string for next searches.\n indexes.sort()\n\n # Do the replacements.\n for i, idx in indexes:\n m[idx] = n[i]\n\n result = m.join(\" \")\n\n\nwhen isMainModule:\n\n template process(a, b: string) =\n echo a, \" | \", b, \" → \", orderDisjoint(a, b)\n\n process(\"the cat sat on the mat\", \"mat cat\")\n process(\"the cat sat on the mat\", \"cat mat\")\n process(\"A B C A B C A B C\", \"C A C A\")\n process(\"A B C A B D A B E\", \"E A D A\")\n process(\"A B\", \"B\")\n process(\"A B\", \"B A\")\n process(\"A B B A\", \"B A\")\n","language":"Nim"},{"code":"sub dsort {\n my ($m, $n) = @_;\n my %h;\n $h{$_}++ for @$n;\n map $h{$_}-- > 0 ? shift @$n : $_, @$m;\n}\n\nfor (split \"\\n\", <<\"IN\")\n the cat sat on the mat | mat cat\n the cat sat on the mat | cat mat\n A B C A B C A B C | C A C A\n A B C A B D A B E | E A D A\n A B | B\n A B | B A\n A B B A | B A\nIN\n{\n\n my ($a, $b) = map([split], split '\\|');\n print \"@$a | @$b -> @{[dsort($a, $b)]}\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">order_disjoint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rlen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rdis</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rlen</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">rlen</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">j</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">j</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">j</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">rdis</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">rlen</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">rdis</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #000000;\">rlen</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">rlen</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">rdis</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]]=</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #008000;\">\"the cat sat on the mat\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"mat cat\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"the cat sat on the mat\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"cat mat\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B C A B C A B C\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"C A C A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B C A B D A B E\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"E A D A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"B\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"B A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B B A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"B A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B B A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"A B\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B A B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"A B\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B A B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"B A B A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B C C B A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"A C A C\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A B C C B A\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"C A C A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A X\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Y A\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A X\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Y A X\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"A X\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Y X A\"</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\\"%s\\\",\\\"%s\\\" => \\\"%s\\\"\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order_disjoint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">))})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(de orderDisjoint (M N)\n (for S N\n (and (memq S M) (set @ NIL)) )\n (mapcar\n '((S) (or S (pop 'N)))\n M ) )\n","language":"PicoLisp"},{"code":": (orderDisjoint '(the cat sat on the mat) '(mat cat))\n-> (the mat sat on the cat)\n\n: (orderDisjoint '(the cat sat on the mat) '(cat mat))\n-> (the cat sat on the mat)\n\n: (orderDisjoint '(A B C A B C A B C) '(C A C A))\n-> (C B A C B A A B C)\n\n: (orderDisjoint '(A B C A B D A B E) '(E A D A))\n-> (E B C A B D A B A)\n\n: (orderDisjoint '(A B) '(B))\n-> (A B)\n\n: (orderDisjoint '(A B) '(B A))\n-> (B A)\n\n: (orderDisjoint '(A B B A) '(B A))\n-> (B A B A)\n","language":"PicoLisp"},{"code":"function sublistsort($M, $N) {\n $arr = $M.Split(' ')\n $array = $N.Split(' ') | group\n $Count = @($array |foreach {$_.Count})\n $ip, $i = @(), 0\n $arr | foreach{\n $name = \"$_\"\n $j = $array.Name.IndexOf($name)\n if($j -gt -1){\n $k = $Count[$j] - 1\n if($k -ge 0) {\n $ip += @($i)\n $Count[$j] = $k\n }\n }\n $i++\n }\n $i = 0\n $N.Split(' ') | foreach{ $arr[$ip[$i++]] = \"$_\"}\n [pscustomobject]@{\n \"M\" = \"$M \"\n \"N\" = \"$N \"\n \"M'\" = \"$($arr)\"\n }\n}\n$M1 = 'the cat sat on the mat'\n$N1 = 'mat cat'\n$M2 = 'the cat sat on the mat'\n$N2 = 'cat mat'\n$M3 = 'A B C A B C A B C'\n$N3 = 'C A C A'\n$M4 = 'A B C A B D A B E'\n$N4 = 'E A D A'\n$M5 = 'A B'\n$N5 = 'B'\n$M6 = 'A B'\n$N6 = 'B A'\n$M7 = 'A B B A'\n$N7 = 'B A'\nsublistsort $M1 $N1\nsublistsort $M2 $N2\nsublistsort $M3 $N3\nsublistsort $M4 $N4\nsublistsort $M5 $N5\nsublistsort $M6 $N6\nsublistsort $M7 $N7\n","language":"PowerShell"},{"code":"from __future__ import print_function\n\ndef order_disjoint_list_items(data, items):\n #Modifies data list in-place\n itemindices = []\n for item in set(items):\n itemcount = items.count(item)\n #assert data.count(item) >= itemcount, 'More of %r than in data' % item\n lastindex = [-1]\n for i in range(itemcount):\n lastindex.append(data.index(item, lastindex[-1] + 1))\n itemindices += lastindex[1:]\n itemindices.sort()\n for index, item in zip(itemindices, items):\n data[index] = item\n\nif __name__ == '__main__':\n tostring = ' '.join\n for data, items in [ (str.split('the cat sat on the mat'), str.split('mat cat')),\n (str.split('the cat sat on the mat'), str.split('cat mat')),\n (list('ABCABCABC'), list('CACA')),\n (list('ABCABDABE'), list('EADA')),\n (list('AB'), list('B')),\n (list('AB'), list('BA')),\n (list('ABBA'), list('BA')),\n (list(''), list('')),\n (list('A'), list('A')),\n (list('AB'), list('')),\n (list('ABBA'), list('AB')),\n (list('ABAB'), list('AB')),\n (list('ABAB'), list('BABA')),\n (list('ABCCBA'), list('ACAC')),\n (list('ABCCBA'), list('CACA')),\n ]:\n print('Data M: %-24r Order N: %-9r' % (tostring(data), tostring(items)), end=' ')\n order_disjoint_list_items(data, items)\n print(\"-> M' %r\" % tostring(data))\n","language":"Python"},{"code":"#lang racket\n(define disjorder\n (match-lambda**\n (((list) n) '())\n ((m (list)) m)\n (((list h m-tail ...) (list h n-tail ...))\n (list* h (disjorder m-tail n-tail)))\n ;; the (not g/h) below stop greedy matching of the list which\n ;; would pick out orderings from the right first.\n (((list h (and (not g) m-tail-left) ... g m-tail-right ...)\n (list g (and (not h) n-tail-left) ... h n-tail-right ...))\n (disjorder `(,g ,@m-tail-left ,h ,@m-tail-right)\n `(,g ,@n-tail-left ,h ,@n-tail-right)))\n (((list h m-tail ...) n)\n (list* h (disjorder m-tail n)))))\n\n(define (report-disjorder m n)\n (printf \"Data M: ~a Order N: ~a -> ~a~%\"\n (~a #:min-width 25 m) (~a #:min-width 10 n) (disjorder m n)))\n\n;; Do the task tests\n(report-disjorder '(the cat sat on the mat) '(mat cat))\n(report-disjorder '(the cat sat on the mat) '(cat mat))\n(report-disjorder '(A B C A B C A B C) '(C A C A))\n(report-disjorder '(A B C A B D A B E) '(E A D A))\n(report-disjorder '(A B) '(B))\n(report-disjorder '(A B) '(B A))\n(report-disjorder '(A B B A) '(B A))\n;; Do all of the other python tests\n(report-disjorder '() '())\n(report-disjorder '(A) '(A))\n(report-disjorder '(A B) '())\n(report-disjorder '(A B B A) '(A B))\n(report-disjorder '(A B A B) '(A B))\n(report-disjorder '(A B A B) '(B A B A))\n(report-disjorder '(A B C C B A) '(A C A C))\n(report-disjorder '(A B C C B A) '(C A C A))\n","language":"Racket"},{"code":"sub order-disjoint-list-items(\\M, \\N) {\n my \\bag = N.BagHash;\n M.map: { bag{$_}-- ?? N.shift !! $_ }\n}\n\n# Testing:\n\nfor q:to/---/.comb(/ [\\S+]+ % ' ' /).map({[.words]})\n the cat sat on the mat mat cat\n the cat sat on the mat cat mat\n A B C A B C A B C C A C A\n A B C A B D A B E E A D A\n A B B\n A B B A\n A B B A B A\n X X Y X\n A X Y A\n ---\n-> $m, $n { say \"\\n$m ==> $n\\n\", order-disjoint-list-items($m, $n) }\n","language":"Raku"},{"code":"/*REXX program orders a disjoint list of M items with a list of N items. */\nused = '0'x /*indicates that a word has been parsed*/\n @. = /*placeholder indicates end─of─array, */\n @.1 = \" the cat sat on the mat | mat cat \" /*a string.*/\n @.2 = \" the cat sat on the mat | cat mat \" /*\" \" */\n @.3 = \" A B C A B C A B C | C A C A \" /*\" \" */\n @.4 = \" A B C A B D A B E | E A D A \" /*\" \" */\n @.5 = \" A B | B \" /*\" \" */\n @.6 = \" A B | B A \" /*\" \" */\n @.7 = \" A B B A | B A \" /*\" \" */\n @.8 = \" | \" /*\" \" */\n @.9 = \" A | A \" /*\" \" */\n @.10 = \" A B | \" /*\" \" */\n @.11 = \" A B B A | A B \" /*\" \" */\n @.12 = \" A B A B | A B \" /*\" \" */\n @.13 = \" A B A B | B A B A \" /*\" \" */\n @.14 = \" A B C C B A | A C A C \" /*\" \" */\n @.15 = \" A B C C B A | C A C A \" /*\" \" */\n /* ════════════M═══════════ ════N════ */\n\n do j=1 while @.j\\=='' /* [↓] process each input string (@.).*/\n parse var @.j m '|' n /*parse input string into M and N. */\n #= words(m) /*#: number of words in the M list.*/\n do i=# for # by -1 /*process list items in reverse order. */\n _= word(m, i); !.i= _; $._= i /*construct the !. and $. arrays.*/\n end /*i*/\n r.= /*nullify the replacement string [R.] */\n do k=1 by 2 for words(n)%2 /* [↓] process the N array. */\n _= word(n, k); v= word(n, k+1) /*get an order word and the replacement*/\n p1= wordpos(_, m); p2= wordpos(v, m) /*positions of \" \" \" \" */\n if p1==0 | p2==0 then iterate /*if either not found, then skip them. */\n if $._>>$.v then do; r.p2= !.p1; r.p1= !.p2; end /*switch the words.*/\n else do; r.p1= !.p1; r.p2= !.p2; end /*don't switch. */\n !.p1= used; !.p2= used /*mark 'em as used.*/\n m=\n do i=1 for #; m= m !.i; _= word(m, i); !.i= _; $._= i\n end /*i*/\n end /*k*/ /* [↑] rebuild the !. and $. arrays.*/\n mp= /*the MP (aka M') string (so far). */\n do q=1 for #; if !.q==used then mp= mp r.q /*use the original.*/\n else mp= mp !.q /*use substitute. */\n end /*q*/ /* [↑] re─build the (output) string. */\n\n say @.j ' ────► ' space(mp) /*display new re─ordered text ──► term.*/\n end /*j*/ /* [↑] end of processing for N words*/\n /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"def order_disjoint(m,n)\n print \"#{m} | #{n} -> \"\n m, n = m.split, n.split\n from = 0\n n.each_slice(2) do |x,y|\n next unless y\n sd = m[from..-1]\n if x > y && (sd.include? x) && (sd.include? y) && (sd.index(x) > sd.index(y))\n new_from = m.index(x)+1\n m[m.index(x)+from], m[m.index(y)+from] = m[m.index(y)+from], m[m.index(x)+from]\n from = new_from\n end\n end\n puts m.join(' ')\nend\n\n[\n ['the cat sat on the mat', 'mat cat'],\n ['the cat sat on the mat', 'cat mat'],\n ['A B C A B C A B C' , 'C A C A'],\n ['A B C A B D A B E' , 'E A D A'],\n ['A B' , 'B' ],\n ['A B' , 'B A' ],\n ['A B B A' , 'B A' ]\n].each {|m,n| order_disjoint(m,n)}\n","language":"Ruby"},{"code":"ar = [\n ['the cat sat on the mat', 'mat cat'],\n ['the cat sat on the mat', 'cat mat'],\n ['A B C A B C A B C' , 'C A C A'],\n ['A B C A B D A B E' , 'E A D A'],\n ['A B' , 'B' ],\n ['A B' , 'B A' ],\n ['A B B A' , 'B A' ]\n]\n\nres = ar.map do |m,n|\n mm = m.dup\n nn = n.split\n nn.each {|item| mm.sub!(item, \"%s\")} #sub! only subs the first match\n mm % nn #\"the %s sat on the %s\" % [mat\", \"cat\"] #does what you hope it does.\nend\n\nputs res\n","language":"Ruby"},{"code":"def order[T](input: Seq[T], using: Seq[T], used: Seq[T] = Seq()): Seq[T] =\n if (input.isEmpty || used.size >= using.size) input\n else if (using diff used contains input.head)\n using(used.size) +: order(input.tail, using, used :+ input.head)\n else input.head +: order(input.tail, using, used)\n","language":"Scala"},{"code":"val tests = List(\n \"the cat sat on the mat\" -> \"mat cat\",\n \"the cat sat on the mat\" -> \"cat mat\",\n \"A B C A B C A B C\" -> \"C A C A\",\n \"A B C A B D A B E\" -> \"E A D A\",\n \"A B\" -> \"B\",\n \"A B\" -> \"B A\",\n \"A B B A\" -> \"B A\"\n)\n\ntests.foreach{case (input, using) =>\n val done = order(input.split(\" \"), using.split(\" \"))\n println(f\"\"\"Data M: $input%-24s Order N: $using%-9s -> Result M': ${done mkString \" \"}\"\"\")\n}\n","language":"Scala"},{"code":"func dsort(m, n) {\n var h = Hash()\n n.each {|item| h{item} := 0 ++ }\n m.map {|item| h{item} := 0 -- > 0 ? n.shift : item}\n}\n\n<<'EOT'.lines.each { |line|\n the cat sat on the mat | mat cat\n the cat sat on the mat | cat mat\n A B C A B C A B C | C A C A\n A B C A B D A B E | E A D A\n A B | B\n A B | B A\n A B B A | B A\nEOT\n var (a, b) = line.split('|').map{.words}...\n say \"#{a.join(' ')} | #{b.join(' ')} -> #{dsort(a.clone, b.clone).join(' ')}\"\n}\n","language":"Sidef"},{"code":"func disjointOrder<T: Hashable>(m: [T], n: [T]) -> [T] {\n let replaceCounts = n.reduce(into: [T: Int](), { $0[$1, default: 0] += 1 })\n let reduced = m.reduce(into: ([T](), n, replaceCounts), {cur, el in\n cur.0.append(cur.2[el, default: 0] > 0 ? cur.1.removeFirst() : el)\n cur.2[el]? -= 1\n })\n\n return reduced.0\n}\n\nprint(disjointOrder(m: [\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"], n: [\"mat\", \"cat\"]))\nprint(disjointOrder(m: [\"the\", \"cat\", \"sat\", \"on\", \"the\", \"mat\"], n: [\"cat\", \"mat\"]))\nprint(disjointOrder(m: [\"A\", \"B\", \"C\", \"A\", \"B\", \"C\", \"A\", \"B\", \"C\"], n: [\"C\", \"A\", \"C\", \"A\"]))\nprint(disjointOrder(m: [\"A\", \"B\", \"C\", \"A\", \"B\", \"D\", \"A\", \"B\", \"E\"], n: [\"E\", \"A\", \"D\", \"A\"]))\nprint(disjointOrder(m: [\"A\", \"B\"], n: [\"B\"]))\nprint(disjointOrder(m: [\"A\", \"B\"], n: [\"B\", \"A\"]))\nprint(disjointOrder(m: [\"A\", \"B\", \"B\", \"A\"], n: [\"B\", \"A\"]))\n","language":"Swift"},{"code":"proc orderDisjoint {theList theOrderList} {\n foreach item $theOrderList {incr n($item)}\n set is {}\n set i 0\n foreach item $theList {\n\tif {[info exist n($item)] && [incr n($item) -1] >= 0} {\n\t lappend is $i\n\t}\n\tincr i\n }\n foreach item $theOrderList i $is {lset theList $i $item}\n return $theList\n}\n","language":"Tcl"},{"code":"proc orderDisjoint {theList theOrderList} {\n foreach item $theOrderList {incr n($item)}\n set is -\n set i 0\n foreach item $theList {\n\tif {[info exist n($item)] && [incr n($item) -1] >= 0} {\n\t lappend is $i\n\t}\n\tincr i\n }\n set i 0\n foreach item $theOrderList {\n\tif {[incr n($item)] <= 1} {\n\t lset theList [lindex $is [incr i]] $item\n\t}\n }\n return $theList\n}\n","language":"Tcl"},{"code":"foreach {items order} {\n \"the cat sat on the mat\" \"mat cat\"\n \"the cat sat on the mat\" \"cat mat\"\n \"A B C A B C A B C\" \"C A C A\"\n \"A B C A B D A B E\" \"E A D A\"\n \"A B\" \"B\"\n \"A B\" \"B A\"\n \"A B B A\" \"B A\"\n} {\n puts \"'$items' with '$order' => '[orderDisjoint $items $order]'\"\n}\n","language":"Tcl"},{"code":"import \"./fmt\" for Fmt\n\nvar NULL = \"\\0\"\n\nvar orderDisjointList = Fn.new { |m, n|\n var nList = n.split(\" \")\n // first replace the first occurrence of items of 'n' in 'm' with the NULL character\n // which we can safely assume won't occur in 'm' naturally\n for (item in nList) {\n var ix = m.indexOf(item)\n if (ix >= 0) {\n var le = item.count\n m = m[0...ix] + NULL + m[ix + le..-1]\n }\n }\n // now successively replace the NULLs with items from nList\n var mList = m.split(NULL)\n var sb = \"\"\n for (i in 0...nList.count) sb = sb + mList[i] + nList[i]\n return sb + mList[-1]\n}\n\nvar ma = [\n \"the cat sat on the mat\",\n \"the cat sat on the mat\",\n \"A B C A B C A B C\",\n \"A B C A B D A B E\",\n \"A B\",\n \"A B\",\n \"A B B A\"\n]\n\nvar na = [\n \"mat cat\",\n \"cat mat\",\n \"C A C A\",\n \"E A D A\",\n \"B\",\n \"B A\",\n \"B A\"\n]\n\nfor (i in 0...ma.count) {\n Fmt.print(\"$-22s -> $-7s -> $s\", ma[i], na[i], orderDisjointList.call(ma[i], na[i]))\n}\n","language":"Wren"},{"code":"fcn disOrder(sm,sn){\n M:=sm.split(\" \");\n N:=sn.split(\" \"); nc:=Walker.cycle(Utils.Helpers.listUnique(N));\n dn:=Dictionary(); N.pump(Void,'wrap(w){ dn[w] = dn.find(w,0) + 1; });\n M.pump(String,'wrap(w){\n if (Void==(n:=dn.find(w))) return(w); // not replaced\n if (n) { dn[w]=n-1; nc.next(); } // swaps left--\n else { nc.next(); w }\t // exhausted\n }, String.fp(\" \") )[1,*]\t// remove leading blank\n}\n","language":"Zkl"},{"code":"sets:=T(T(\"the cat sat on the mat\",\"mat cat\"),\n T(\"the cat sat on the mat\",\"cat mat\"),\n T(\"A B C A B C A B C\",\"C A C A\"),\n T(\"A B C A B D A B E\",\"E A D A\"),\n T(\"A B\",\"B\"), T(\"A B\",\"B A\"), T(\"A B B A\",\"B A\") );\nforeach m,n in (sets){\n m.println(\" / \",n,\" --> \",disOrder(m,n));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Sorting\\nfrom: http://rosettacode.org/wiki/Order_disjoint_list_items\\nnote: Sorting Algorithms\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Sorting Algorithm}}\\n\\nGiven <code>M</code> as a list of items and another list <code>N</code> of items chosen from <code>M</code>, create <code>M'</code> as a list with the ''first'' occurrences of items from N sorted to be in one of the set of indices of their original occurrence in <code>M</code> but in the order given by their order in <code>N</code>. \\n\\nThat is, items in <code>N</code> are taken from <code>M</code> without replacement, then the corresponding positions in <code>M'</code> are filled by successive items from <code>N</code>.\\n\\n\\n;For example:\\n:if <code>M</code> is <code>'the cat sat on the mat'</code>\\n:And <code>N</code> is <code>'mat cat'</code> \\n:Then the result <code>M'</code> is <code>'the mat sat on the cat'</code>. \\n\\nThe words not in <code>N</code> are left in their original positions.\\n\\n\\nIf there are duplications then only the first instances in <code>M</code> up to as many as are mentioned in <code>N</code> are potentially re-ordered.\\n\\n\\n;For example:\\n: <code> M = 'A B C A B C A B C' </code>\\n: <code> N = 'C A C A' </code>\\n\\nIs ordered as:\\n:<code> M' = 'C B A C B A A B C' </code>\\n\\n<br>\\nShow the output, here, for at least the following inputs:\\n<pre>\\nData M: 'the cat sat on the mat' Order N: 'mat cat'\\nData M: 'the cat sat on the mat' Order N: 'cat mat'\\nData M: 'A B C A B C A B C' Order N: 'C A C A'\\nData M: 'A B C A B D A B E' Order N: 'E A D A'\\nData M: 'A B' Order N: 'B' \\nData M: 'A B' Order N: 'B A' \\nData M: 'A B B A' Order N: 'B A'\\n</pre>\\n\\n\\n;Cf:\\n* [[Sort disjoint sublist]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F order_disjoint_list_items(&data, items)\\n [Int] itemindices\\n L(item) Set(items)\\n V itemcount = items.count(item)\\n V lastindex = [-1]\\n L(i) 0 .< itemcount\\n lastindex.append(data.index(item, lastindex.last + 1))\\n itemindices [+]= lastindex[1..]\\n itemindices.sort()\\n L(index, item) zip(itemindices, items)\\n data[index] = item\\n\\nF slist(s)\\n R Array(s).map(String)\\n\\nF tostring(l)\\n R ‘'’l.join(‘ ’)‘'’\\n\\nL(data, items) [(‘the cat sat on the mat’.split(‘ ’), (‘mat cat’).split(‘ ’)),\\n (‘the cat sat on the mat’.split(‘ ’), (‘cat mat’).split(‘ ’)),\\n (slist(‘ABCABCABC’), slist(‘CACA’)),\\n (slist(‘ABCABDABE’), slist(‘EADA’)),\\n (slist(‘AB’), slist(‘B’)),\\n (slist(‘AB’), slist(‘BA’)),\\n (slist(‘ABBA’), slist(‘BA’)),\\n (slist(‘’), slist(‘’)),\\n (slist(‘A’), slist(‘A’)),\\n (slist(‘AB’), slist(‘’)),\\n (slist(‘ABBA’), slist(‘AB’)),\\n (slist(‘ABAB’), slist(‘AB’)),\\n (slist(‘ABAB’), slist(‘BABA’)),\\n (slist(‘ABCCBA’), slist(‘ACAC’)),\\n (slist(‘ABCCBA’), slist(‘CACA’))]\\n print(‘Data M: #<24 Order N: #<9’.format(tostring(data), tostring(items)), end' ‘ ’)\\n order_disjoint_list_items(&data, items)\\n print(‘-> M' #.’.format(tostring(data)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"order(list a, b)\\n{\\n integer j;\\n record r;\\n text s;\\n\\n a.ucall(o_, 0, \\\" \\\");\\n\\n o_(\\\"| \\\");\\n\\n for (, s in b) {\\n r[s] += 1;\\n o_(s, \\\" \\\");\\n }\\n\\n o_(\\\"->\\\");\\n\\n j = -1;\\n for (, s in a) {\\n if ((r[s] -= 1) < 0) {\\n o_(\\\" \\\", s);\\n } else {\\n o_(\\\" \\\", b[j += 1]);\\n }\\n }\\n\\n o_newline();\\n}\\n\\nmain(void)\\n{\\n order(list(\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"), list(\\\"mat\\\", \\\"cat\\\"));\\n order(list(\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"), list(\\\"cat\\\", \\\"mat\\\"));\\n order(list(\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\"), list(\\\"C\\\", \\\"A\\\", \\\"C\\\", \\\"A\\\"));\\n order(list(\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\"), list(\\\"E\\\", \\\"A\\\", \\\"D\\\", \\\"A\\\"));\\n order(list(\\\"A\\\", \\\"B\\\"), list(\\\"B\\\"));\\n order(list(\\\"A\\\", \\\"B\\\"), list(\\\"B\\\", \\\"A\\\"));\\n order(list(\\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\"), list(\\\"B\\\", \\\"A\\\"));\\n\\n 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"---------------------- DISJOINT ORDER --------------------\\n\\n-- disjointOrder :: String -> String -> String\\non disjointOrder(m, n)\\n set {ms, ns} to map(my |words|, {m, n})\\n\\n unwords(flatten(zip(segments(ms, ns), ns & \\\"\\\")))\\nend disjointOrder\\n\\n\\n-- segments :: [String] -> [String] -> [String]\\non segments(ms, ns)\\n script segmentation\\n on |λ|(a, x)\\n set wds to |words| of a\\n\\n if wds contains x then\\n {parts:(parts of a) & ¬\\n [current of a], current:[], |words|:deleteFirst(x, wds)} ¬\\n\\n else\\n {parts:(parts of a), current:(current of a) & x, |words|:wds}\\n end if\\n end |λ|\\n end script\\n\\n tell foldl(segmentation, {|words|:ns, parts:[], current:[]}, ms)\\n (parts of it) & [current of it]\\n end tell\\nend segments\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n script order\\n on |λ|(rec)\\n tell rec\\n [its m, its n, my disjointOrder(its m, its n)]\\n end tell\\n end |λ|\\n end script\\n\\n\\n arrowTable(map(order, [¬\\n {m:\\\"the cat sat on the mat\\\", n:\\\"mat cat\\\"}, ¬\\n {m:\\\"the cat sat on the mat\\\", n:\\\"cat mat\\\"}, ¬\\n {m:\\\"A B C A B C A B C\\\", n:\\\"C A C A\\\"}, ¬\\n {m:\\\"A B C A B D A B E\\\", n:\\\"E A D A\\\"}, ¬\\n {m:\\\"A B\\\", n:\\\"B\\\"}, {m:\\\"A B\\\", n:\\\"B A\\\"}, ¬\\n {m:\\\"A B B A\\\", n:\\\"B A\\\"}]))\\n\\n -- the cat sat on the mat -> mat cat -> the mat sat on the cat\\n -- the cat sat on the mat -> cat mat -> the cat sat on the mat\\n -- A B C A B C A B C -> C A C A -> C B A C B A A B C\\n -- A B C A B D A B E -> E A D A -> E B C A B D A B A\\n -- A B -> B -> A B\\n -- A B -> B A -> B A\\n -- A B B A -> B A -> B A B A\\n\\nend run\\n\\n\\n------------------------ FORMATTING ----------------------\\n\\n-- arrowTable :: [[String]] -> String\\non arrowTable(rows)\\n\\n script leftAligned\\n script width\\n on |λ|(a, b)\\n (length of a) - (length of b)\\n end |λ|\\n end script\\n\\n on |λ|(col)\\n set widest to length of maximumBy(width, col)\\n\\n script padding\\n on |λ|(s)\\n justifyLeft(widest, space, s)\\n end |λ|\\n end script\\n\\n map(padding, col)\\n end |λ|\\n end script\\n\\n script arrows\\n on |λ|(row)\\n intercalate(\\\" -> \\\", row)\\n end |λ|\\n end script\\n\\n intercalate(linefeed, ¬\\n map(arrows, ¬\\n transpose(map(leftAligned, transpose(rows)))))\\nend arrowTable\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- concatMap :: (a -> [b]) -> [a] -> [b]\\non concatMap(f, xs)\\n script append\\n on |λ|(a, b)\\n a & b\\n end |λ|\\n end script\\n\\n foldl(append, {}, map(f, xs))\\nend concatMap\\n\\n\\n-- deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]\\non deleteBy(fnEq, x, xs)\\n if length of xs > 0 then\\n set {h, t} to uncons(xs)\\n if |λ|(x, h) of mReturn(fnEq) then\\n t\\n else\\n {h} & deleteBy(fnEq, x, t)\\n end if\\n else\\n {}\\n end if\\nend deleteBy\\n\\n\\n-- deleteFirst :: a -> [a] -> [a]\\non deleteFirst(x, xs)\\n script Eq\\n on |λ|(a, b)\\n a = b\\n end |λ|\\n end script\\n\\n deleteBy(Eq, x, xs)\\nend deleteFirst\\n\\n\\n-- flatten :: Tree a -> [a]\\non flatten(t)\\n if class of t is list then\\n concatMap(my flatten, t)\\n else\\n t\\n end if\\nend flatten\\n\\n\\n-- foldl :: (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 |λ|(v, item i of xs, i, xs)\\n end repeat\\n return v\\n end tell\\nend foldl\\n\\n\\n-- intercalate :: 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\\n-- justifyLeft :: Int -> Char -> Text -> Text\\non justifyLeft(n, cFiller, strText)\\n if n > length of strText then\\n text 1 thru n of (strText & replicate(n, cFiller))\\n else\\n strText\\n end if\\nend justifyLeft\\n\\n\\n-- map :: (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 |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- maximumBy :: (a -> a -> Ordering) -> [a] -> a\\non maximumBy(f, xs)\\n set cmp to mReturn(f)\\n script max\\n on |λ|(a, b)\\n if a is missing value or cmp's |λ|(a, b) < 0 then\\n b\\n else\\n a\\n end if\\n end |λ|\\n end script\\n\\n foldl(max, missing value, xs)\\nend maximumBy\\n\\n\\n-- minimum :: [a] -> a\\non minimum(xs)\\n script min\\n on |λ|(a, x)\\n if x < a or a is missing value then\\n x\\n else\\n a\\n end if\\n end |λ|\\n end script\\n\\n foldl(min, missing value, xs)\\nend minimum\\n\\n\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- Egyptian multiplication - progressively doubling a list, appending\\n-- stages of doubling to an accumulator where needed for binary\\n-- assembly of a target length\\n\\n-- replicate :: 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\\n-- transpose :: [[a]] -> [[a]]\\non transpose(xss)\\n script column\\n on |λ|(_, iCol)\\n script row\\n on |λ|(xs)\\n item iCol of xs\\n end |λ|\\n end script\\n\\n map(row, xss)\\n end |λ|\\n end script\\n\\n map(column, item 1 of xss)\\nend transpose\\n\\n\\n-- uncons :: [a] -> Maybe (a, [a])\\non uncons(xs)\\n if length of xs > 0 then\\n {item 1 of xs, rest of xs}\\n else\\n missing value\\n end if\\nend uncons\\n\\n\\n-- unwords :: [String] -> String\\non unwords(xs)\\n intercalate(space, xs)\\nend unwords\\n\\n\\n-- words :: String -> [String]\\non |words|(s)\\n words of s\\nend |words|\\n\\n\\n-- zip :: [a] -> [b] -> [(a, b)]\\non zip(xs, ys)\\n script pair\\n on |λ|(x, i)\\n [x, item i of ys]\\n end |λ|\\n end script\\n\\n map(pair, items 1 thru minimum([length of xs, length of ys]) of xs)\\nend zip\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"(*\\n The task description talks about items in lists, but the examples are space-delimited substrings of strings.\\n The handler here deals with items in lists and leaves it to the calling code to sort out the rest.\\n*)\\non odli(m, n)\\n -- Use shallow copies of the lists in case the calling process wants the passed originals to remain intact.\\n set m to m's items\\n set n_source to n's items\\n set n_check to n's items\\n\\n repeat with i from 1 to (count m)\\n set thisItem to item i of m\\n if ({thisItem} is in n_check) then\\n set item i of m to beginning of n_source\\n set n_source to rest of n_source\\n if (n_source is {}) then exit repeat\\n repeat with j from 1 to (count n_check)\\n if (item j of n_check is thisItem) then\\n set item j of n_check to beginning of n_check\\n set n_check to rest of n_check\\n exit repeat\\n end if\\n end repeat\\n end if\\n end repeat\\n\\n return m\\nend odli\\n\\n-- Task code:\\nset textPairs to {{\\\"the cat sat on the mat\\\", \\\"mat cat\\\"}, {\\\"the cat sat on the mat\\\", \\\"cat mat\\\"}, ¬\\n {\\\"A B C A B C A B C\\\", \\\"C A C A\\\"}, {\\\"A B C A B D A B E\\\", \\\"E A D A\\\"}, ¬\\n {\\\"A B\\\", \\\"B\\\"}, {\\\"A B\\\", \\\"B A\\\"}, {\\\"A B B A\\\", \\\"B A\\\"}}\\nset output to {}\\nset astid to AppleScript's text item delimiters\\nset AppleScript's text item delimiters to space\\nrepeat with thisPair in textPairs\\n set {m, n} to thisPair\\n set spiel to \\\"Data M: '\\\" & m & \\\"'\\\\tOrder N: '\\\" & n & \\\"'\\\\t--> '\\\"\\n set end of output to spiel & odli(m's text items, n's text items) & \\\"'\\\"\\nend repeat\\nset AppleScript's text item delimiters to linefeed\\nset output to output as text\\nset AppleScript's text item delimiters to astid\\nreturn output\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"\\\"Data M: 'the cat sat on the mat'\\tOrder N: 'mat cat'\\t--> 'the mat sat on the cat'\\nData M: 'the cat sat on the mat'\\tOrder N: 'cat mat'\\t--> 'the cat sat on the mat'\\nData M: 'A B C A B C A B C'\\tOrder N: 'C A C A'\\t--> 'C B A C B A A B C'\\nData M: 'A B C A B D A B E'\\tOrder N: 'E A D A'\\t--> 'E B C A B D A B A'\\nData M: 'A B'\\tOrder N: 'B'\\t--> 'A B'\\nData M: 'A B'\\tOrder N: 'B A'\\t--> 'B A'\\nData M: 'A B B A'\\tOrder N: 'B A'\\t--> 'B A B A'\\\"\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"set listOfLists1 to {{1, 2, 3, 4, 5}, {5, 4, 3, 2, 1}, {\\\"aardvark\\\", \\\"duck-billed platypus\\\", \\\"banana\\\"}}\\nset listOfLists2 to {{\\\"aardvark\\\", \\\"duck-billed platypus\\\", \\\"banana\\\"}, {1, 2, 3, 4, 5}}\\nreturn odli(listOfLists1, listOfLists2)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{{\\\"aardvark\\\", \\\"duck-billed platypus\\\", \\\"banana\\\"}, {5, 4, 3, 2, 1}, {1, 2, 3, 4, 5}}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"orderDisjoint: function [m,n][\\n ms: split.words m\\n ns: split.words n\\n\\n indexes: new []\\n\\n loop ns 'item [\\n idx: index ms item\\n unless null? idx [\\n 'indexes ++ idx\\n ms\\\\[idx]: \\\"\\\"\\n ]\\n ]\\n sort 'indexes\\n\\n loop.with:'i indexes 'idx ->\\n ms\\\\[idx]: ns\\\\[i]\\n\\n return join.with:\\\" \\\" ms\\n]\\n\\nprocess: function [a,b][\\n print [a \\\"|\\\" b \\\"->\\\" orderDisjoint a b]\\n]\\n\\nprocess \\\"the cat sat on the mat\\\" \\\"mat cat\\\"\\nprocess \\\"the cat sat on the mat\\\" \\\"cat mat\\\"\\nprocess \\\"A B C A B C A B C\\\" \\\"C A C A\\\"\\nprocess \\\"A B C A B D A B E\\\" \\\"E A D A\\\"\\nprocess \\\"A B\\\" \\\"B\\\"\\nprocess \\\"A B\\\" \\\"B A\\\"\\nprocess \\\"A B B A\\\" \\\"B A\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"Data := [ {M: \\\"the cat sat on the mat\\\", N: \\\"mat cat\\\"}\\n\\t, {M: \\\"the cat sat on the mat\\\", N: \\\"cat mat\\\"}\\n\\t, {M: \\\"A B C A B C A B C\\\", N: \\\"C A C A\\\"}\\n\\t, {M: \\\"A B C A B D A B E\\\", N: \\\"E A D A\\\"}\\n\\t, {M: \\\"A B\\\", N: \\\"B\\\"}\\n\\t, {M: \\\"A B\\\", N: \\\"B A\\\"}\\n\\t, {M: \\\"A B B A\\\", N: \\\"B A\\\"} ]\\n\\nfor Key, Val in Data\\n\\tOutput .= Val.M \\\" :: \\\" Val.N \\\" -> \\\" OrderDisjointList(Val.M, Val.N) \\\"`n\\\"\\nMsgBox, % RTrim(Output, \\\"`n\\\")\\n\\nOrderDisjointList(M, N) {\\n\\tItemsN := []\\n\\tLoop, Parse, N, % A_Space\\n\\t\\tItemsN[A_LoopField] := ItemsN[A_LoopField] ? ItemsN[A_LoopField] + 1 : 1\\n\\tN := StrSplit(N, A_Space)\\n\\tLoop, Parse, M, % A_Space\\n\\t\\tResult .= (ItemsN[A_LoopField]-- > 0 ? N.Remove(1) : A_LoopField) \\\" \\\"\\n\\treturn RTrim(Result)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"( ( odli\\n = M N NN item A Z R\\n . !arg:(?M.?N)\\n & :?NN\\n & whl\\n ' ( !N:%?item ?N\\n & ( !M:?A !item ?Z\\n & !A (.) !Z:?M\\n & !NN !item:?NN\\n |\\n )\\n )\\n & :?R\\n & whl\\n ' ( !M:?A (.) ?M\\n & !NN:%?item ?NN\\n & !R !A !item:?R\\n )\\n & !R !M\\n )\\n& (the cat sat on the mat.mat cat)\\n (the cat sat on the mat.cat mat)\\n (A B C A B C A B C.C A C A)\\n (A B C A B D A B E.E A D A)\\n (A B.B)\\n (A B.B A)\\n (A B B A.B A)\\n : ?tests\\n& whl\\n ' ( !tests:(?M.?N) ?tests\\n & put$(\\\"Data M:\\\" !M)\\n & put$(\\\"\\\\tOrder N:\\\" !N)\\n & out$(\\\\t odli$(!M.!N))\\n )\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <string>\\n\\ntemplate <typename T>\\nvoid print(const std::vector<T> v) {\\n std::cout << \\\"{ \\\";\\n for (const auto& e : v) {\\n std::cout << e << \\\" \\\";\\n }\\n std::cout << \\\"}\\\";\\n}\\n\\ntemplate <typename T>\\nauto orderDisjointArrayItems(std::vector<T> M, std::vector<T> N) {\\n std::vector<T*> M_p(std::size(M));\\n for (auto i = 0; i < std::size(M_p); ++i) {\\n M_p[i] = &M[i];\\n }\\n for (auto e : N) {\\n auto i = std::find_if(std::begin(M_p), std::end(M_p), [e](auto c) -> bool {\\n if (c != nullptr) {\\n if (*c == e) return true;\\n }\\n return false;\\n });\\n if (i != std::end(M_p)) {\\n *i = nullptr;\\n }\\n }\\n for (auto i = 0; i < std::size(N); ++i) {\\n auto j = std::find_if(std::begin(M_p), std::end(M_p), [](auto c) -> bool {\\n return c == nullptr;\\n });\\n if (j != std::end(M_p)) {\\n *j = &M[std::distance(std::begin(M_p), j)];\\n **j = N[i];\\n }\\n }\\n return M;\\n}\\n\\nint main() {\\n std::vector<std::vector<std::vector<std::string>>> l = {\\n { { \\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\" }, { \\\"mat\\\", \\\"cat\\\" } },\\n { { \\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\" },{ \\\"cat\\\", \\\"mat\\\" } },\\n { { \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\" },{ \\\"C\\\", \\\"A\\\", \\\"C\\\", \\\"A\\\" } },\\n { { \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\" },{ \\\"E\\\", \\\"A\\\", \\\"D\\\", \\\"A\\\" } },\\n { { \\\"A\\\", \\\"B\\\" },{ \\\"B\\\" } },\\n { { \\\"A\\\", \\\"B\\\" },{ \\\"B\\\", \\\"A\\\" } },\\n { { \\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\" },{ \\\"B\\\", \\\"A\\\" } }\\n };\\n for (const auto& e : l) {\\n std::cout << \\\"M: \\\";\\n print(e[0]);\\n std::cout << \\\", N: \\\";\\n print(e[1]);\\n std::cout << \\\", M': \\\";\\n auto res = orderDisjointArrayItems<std::string>(e[0], e[1]);\\n print(res);\\n std::cout << std::endl;\\n }\\n std::cin.ignore();\\n std::cin.get();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"(defun order-disjoint (data order)\\n (let ((order-b (make-hash-table :test 'equal)))\\n (loop :for n :in order :do (incf (gethash n order-b 0)))\\n (loop :for m :in data :collect\\n (cond ((< 0 (gethash m order-b 0))\\n (decf (gethash m order-b))\\n (pop order))\\n (t m)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.algorithm, std.array, std.range,\\n std.conv;\\n\\nT[] orderDisjointArrayItems(T)(in T[] data, in T[] items)\\npure /*nothrow*/ @safe {\\n int[] itemIndices;\\n foreach (item; items.dup.sort().uniq) {\\n immutable int itemCount = items.count(item);\\n assert(data.count(item) >= itemCount,\\n text(\\\"More of \\\", item, \\\" than in data\\\"));\\n auto lastIndex = [-1];\\n foreach (immutable _; 0 .. itemCount) {\\n immutable start = lastIndex.back + 1;\\n lastIndex ~= data[start .. $].countUntil(item) + start;\\n }\\n itemIndices ~= lastIndex.dropOne;\\n }\\n\\n itemIndices.sort();\\n auto result = data.dup;\\n foreach (index, item; zip(itemIndices, items))\\n result[index] = item;\\n return result;\\n}\\n\\nvoid main() {\\n immutable problems =\\n \\\"the cat sat on the mat | mat cat\\n the cat sat on the mat | cat mat\\n A B C A B C A B C | C A C A\\n A B C A B D A B E | E A D A\\n A B | B\\n A B | B A\\n A B B A | B A\\n |\\n A | A\\n A B |\\n A B B A | A B\\n A B A B | A B\\n A B A B | B A B A\\n A B C C B A | A C A C\\n A B C C B A | C A C A\\\"\\n .splitLines.map!(r => r.split(\\\"|\\\")).array;\\n\\n foreach (immutable p; problems) {\\n immutable a = p[0].split;\\n immutable b = p[1].split;\\n writefln(\\\"%s | %s -> %-(%s %)\\\", p[0].strip, p[1].strip,\\n orderDisjointArrayItems(a, b));\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(lib 'list) ;; for list-delete\\n\\n(define dataM\\n'((the cat sat on the mat)\\n(the cat sat on the mat)\\n(A B C A B C A B C)\\n(A B C A B D A B E)\\n(A B)\\n(A B)\\n(A B B A)))\\n\\t\\t\\n(define orderM\\n'((mat cat)\\n(cat mat)\\n(C A C A)\\n(E A D A)\\n(B)\\n(B A)\\n(B A)))\\n\\n(define (order-disjoint M N)\\n(define R (append N null)) ;; tmp copy of N : delete w when used\\n\\t(for/list [(w M)]\\n\\t(if\\n\\t\\t(not (member w R)) w ;; output as is\\n\\t\\t(begin0\\n\\t\\t(first N) ;; replacer\\n\\t\\t(set! N (rest N))\\n\\t\\t(set! R (list-delete R w))))))\\n\\t\\t\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Order do\\n def disjoint(m,n) do\\n IO.write \\\"#{Enum.join(m,\\\" \\\")} | #{Enum.join(n,\\\" \\\")} -> \\\"\\n Enum.chunk(n,2)\\n |> Enum.reduce({m,0}, fn [x,y],{m,from} ->\\n md = Enum.drop(m, from)\\n if x > y and x in md and y in md do\\n if Enum.find_index(md,&(&1==x)) > Enum.find_index(md,&(&1==y)) do\\n new_from = max(Enum.find_index(m,&(&1==x)), Enum.find_index(m,&(&1==y))) + 1\\n m = swap(m,from,x,y)\\n from = new_from\\n end\\n end\\n {m,from}\\n end)\\n |> elem(0)\\n |> Enum.join(\\\" \\\")\\n |> IO.puts\\n end\\n\\n defp swap(m,from,x,y) do\\n ix = Enum.find_index(m,&(&1==x)) + from\\n iy = Enum.find_index(m,&(&1==y)) + from\\n vx = Enum.at(m,ix)\\n vy = Enum.at(m,iy)\\n m |> List.replace_at(ix,vy) |> List.replace_at(iy,vx)\\n end\\nend\\n\\n[ {\\\"the cat sat on the mat\\\", \\\"mat cat\\\"},\\n {\\\"the cat sat on the mat\\\", \\\"cat mat\\\"},\\n {\\\"A B C A B C A B C\\\" , \\\"C A C A\\\"},\\n {\\\"A B C A B D A B E\\\" , \\\"E A D A\\\"},\\n {\\\"A B\\\" , \\\"B\\\"},\\n {\\\"A B\\\" , \\\"B A\\\"},\\n {\\\"A B B A\\\" , \\\"B A\\\"} ]\\n|> Enum.each(fn {m,n} ->\\n Order.disjoint(String.split(m),String.split(n))\\n end)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"qw{ the cat sat on the mat } qw{ mat cat } make-slots\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: assocs combinators combinators.smart effects formatting\\nfry kernel qw sequences ;\\nIN: rosetta-code.order-disjoint-list\\n\\n: make-slot ( seq elt -- )\\n dupd [ = ] curry find drop swap [ \\\\ _ ] 2dip set-nth ;\\n\\n: make-slots ( seq elts -- seq' ) dupd [ make-slot ] with each ;\\n\\n: reorder ( seq elts -- seq' )\\n tuck make-slots [ ] like over { \\\"x\\\" } <effect>\\n '[ _ fry _ call-effect ] input<sequence ; inline\\n\\n: show-reordering ( seq elts -- )\\n 2dup [ clone ] dip reorder [ \\\" \\\" join ] tri@\\n \\\"M: %-23s N: %-8s M': %s\\\\n\\\" printf ; inline\\n\\n{\\n { qw{ the cat sat on the mat } qw{ mat cat } }\\n { qw{ the cat sat on the mat } qw{ cat mat } }\\n { qw{ A B C A B C A B C } qw{ C A C A } }\\n { qw{ A B C A B D A B E } qw{ E A D A } }\\n { qw{ A B } qw{ B } }\\n { qw{ A B } qw{ B A } }\\n { qw{ A B B A } qw{ B A } }\\n}\\n[ show-reordering ] assoc-each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"sort\\\"\\n\\t\\\"strings\\\"\\n)\\n\\ntype indexSort struct {\\n\\tval sort.Interface\\n\\tind []int\\n}\\n\\nfunc (s indexSort) Len() int { return len(s.ind) }\\nfunc (s indexSort) Less(i, j int) bool { return s.ind[i] < s.ind[j] }\\nfunc (s indexSort) Swap(i, j int) {\\n\\ts.val.Swap(s.ind[i], s.ind[j])\\n\\ts.ind[i], s.ind[j] = s.ind[j], s.ind[i]\\n}\\n\\nfunc disjointSliceSort(m, n []string) []string {\\n\\ts := indexSort{sort.StringSlice(m), make([]int, 0, len(n))}\\n\\tused := make(map[int]bool)\\n\\tfor _, nw := range n {\\n\\t\\tfor i, mw := range m {\\n\\t\\t\\tif used[i] || mw != nw {\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\tused[i] = true\\n\\t\\t\\ts.ind = append(s.ind, i)\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t}\\n\\tsort.Sort(s)\\n\\treturn s.val.(sort.StringSlice)\\n}\\n\\nfunc disjointStringSort(m, n string) string {\\n\\treturn strings.Join(\\n\\t\\tdisjointSliceSort(strings.Fields(m), strings.Fields(n)), \\\" \\\")\\n}\\n\\nfunc main() {\\n\\tfor _, data := range []struct{ m, n string }{\\n\\t\\t{\\\"the cat sat on the mat\\\", \\\"mat cat\\\"},\\n\\t\\t{\\\"the cat sat on the mat\\\", \\\"cat mat\\\"},\\n\\t\\t{\\\"A B C A B C A B C\\\", \\\"C A C A\\\"},\\n\\t\\t{\\\"A B C A B D A B E\\\", \\\"E A D A\\\"},\\n\\t\\t{\\\"A B\\\", \\\"B\\\"},\\n\\t\\t{\\\"A B\\\", \\\"B A\\\"},\\n\\t\\t{\\\"A B B A\\\", \\\"B A\\\"},\\n\\t} {\\n\\t\\tmp := disjointStringSort(data.m, data.n)\\n\\t\\tfmt.Printf(\\\"%s → %s » %s\\\\n\\\", data.m, data.n, mp)\\n\\t}\\n\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (mapAccumL, sort)\\n\\norder\\n :: Ord a\\n => [[a]] -> [a]\\norder [ms, ns] = snd . mapAccumL yu ls $ ks\\n where\\n ks = zip ms [(0 :: Int) ..]\\n ls = zip ns . sort . snd . foldl go (sort ns, []) . sort $ ks\\n yu ((u, v):us) (_, y)\\n | v == y = (us, u)\\n yu ys (x, _) = (ys, x)\\n go (u:us, ys) (x, y)\\n | u == x = (us, y : ys)\\n go ts _ = ts\\n\\ntask :: [String] -> IO ()\\ntask ls@[ms, ns] =\\n putStrLn $\\n \\\"M: \\\" ++ ms ++ \\\" | N: \\\" ++ ns ++ \\\" |> \\\" ++ (unwords . order . map words $ ls)\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n task\\n [ [\\\"the cat sat on the mat\\\", \\\"mat cat\\\"]\\n , [\\\"the cat sat on the mat\\\", \\\"cat mat\\\"]\\n , [\\\"A B C A B C A B C\\\", \\\"C A C A\\\"]\\n , [\\\"A B C A B D A B E\\\", \\\"E A D A\\\"]\\n , [\\\"A B\\\", \\\"B\\\"]\\n , [\\\"A B\\\", \\\"B A\\\"]\\n , [\\\"A B B A\\\", \\\"B A\\\"]\\n ]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad (join)\\nimport Data.Bifunctor (bimap)\\nimport Data.List (delete, transpose)\\nimport Data.Text hiding\\n ( concat,\\n foldl,\\n maximum,\\n transpose,\\n zipWith,\\n )\\nimport Prelude hiding (length, unlines, unwords, words)\\n\\ndisjointOrder ::\\n Eq a =>\\n [a] ->\\n [a] ->\\n [a]\\ndisjointOrder m n = concat $ zipWith (<>) ms ns\\n where\\n ms = segments m n\\n -- As a list of lists, lengthened by 1\\n ns = ((: []) <$> n) <> [[]]\\n segments ::\\n Eq a =>\\n [a] ->\\n [a] ->\\n [[a]]\\n segments m n = _m <> [_acc]\\n where\\n (_m, _, _acc) = foldl split ([], n, []) m\\n split ::\\n Eq a =>\\n ([[a]], [a], [a]) ->\\n a ->\\n ([[a]], [a], [a])\\n split (ms, ns, acc) x\\n | x `elem` ns = (ms <> [acc], delete x ns, [])\\n | otherwise = (ms, ns, acc <> [x])\\n\\n--------------------------- TEST -------------------------\\ntests :: [(Text, Text)]\\ntests =\\n join bimap pack\\n <$> [ (\\\"the cat sat on the mat\\\", \\\"mat cat\\\"),\\n (\\\"the cat sat on the mat\\\", \\\"cat mat\\\"),\\n (\\\"A B C A B C A B C\\\", \\\"C A C A\\\"),\\n (\\\"A B C A B D A B E\\\", \\\"E A D A\\\"),\\n (\\\"A B\\\", \\\"B\\\"),\\n (\\\"A B\\\", \\\"B A\\\"),\\n (\\\"A B B A\\\", \\\"B A\\\")\\n ]\\n\\ntable :: Text -> [[Text]] -> Text\\ntable delim rows =\\n unlines $\\n intercalate delim\\n <$> transpose\\n ( ( \\\\col ->\\n let width = (length $ maximum col)\\n in justifyLeft width ' ' <$> col\\n )\\n <$> transpose rows\\n )\\n\\nmain :: IO ()\\nmain =\\n (putStr . unpack) $\\n table (pack \\\" -> \\\") $\\n ( \\\\(m, n) ->\\n [ m,\\n n,\\n unwords (disjointOrder (words m) (words n))\\n ]\\n )\\n <$> tests\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n every write(\\\" -> \\\",odli(\\\"the cat sat on the mat\\\",\\\"mat cat\\\"))\\n every write(\\\" -> \\\",odli(\\\"the cat sat on the mat\\\",\\\"cat mat\\\"))\\n every write(\\\" -> \\\",odli(\\\"A B C A B C A B C\\\",\\\"C A C A\\\"))\\n every write(\\\" -> \\\",odli(\\\"A B C A B D A B E\\\",\\\"E A D A\\\"))\\n every write(\\\" -> \\\",odli(\\\"A B\\\",\\\"B\\\"))\\n every write(\\\" -> \\\",odli(\\\"A B\\\",\\\"B A\\\"))\\n every write(\\\" -> \\\",odli(\\\"A B B A\\\",\\\"B A\\\"))\\nend\\n\\nprocedure odli(M,N)\\n writes(M,\\\" :: \\\",N)\\n Mp := \\\"\\\"\\n P := N ||:= \\\" \\\"\\n (M||\\\" \\\") ? while item := tab(upto(' '))||move(1) do {\\n if find(item,P) then {\\n P ?:= 1(tab(find(item)),move(*item))||tab(0)\\n N ?:= (item := tab(upto(' '))||move(1), tab(0))\\n }\\n Mp ||:= item\\n }\\n return Mp\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"disjorder=:3 :0&.;:\\n:\\n clusters=. (</. i.@#) x\\n order=. x i.&~. y\\n need=. #/.~ y\\n from=. ;need (#{.)each (/:~order){clusters\\n to=. ;need {.!._ each order{clusters\\n (from{x) to} x\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 'the cat sat on the mat' disjorder 'mat cat'\\nthe mat sat on the cat\\n 'the cat sat on the mat' disjorder 'cat mat'\\nthe cat sat on the mat\\n 'A B C A B C A B C' disjorder 'C A C A'\\nC B A C B A A B C\\n 'A B C A B D A B E' disjorder 'E A D A'\\nD B C D B E A B A\\n 'A B' disjorder 'B'\\nA B\\n 'A B' disjorder 'B A'\\nB A\\n 'A B B A' disjorder 'B A'\\nB A B A\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.BitSet;\\nimport org.apache.commons.lang3.ArrayUtils;\\n\\npublic class OrderDisjointItems {\\n\\n public static void main(String[] args) {\\n final String[][] MNs = {{\\\"the cat sat on the mat\\\", \\\"mat cat\\\"},\\n {\\\"the cat sat on the mat\\\", \\\"cat mat\\\"},\\n {\\\"A B C A B C A B C\\\", \\\"C A C A\\\"}, {\\\"A B C A B D A B E\\\", \\\"E A D A\\\"},\\n {\\\"A B\\\", \\\"B\\\"}, {\\\"A B\\\", \\\"B A\\\"}, {\\\"A B B A\\\", \\\"B A\\\"}, {\\\"X X Y\\\", \\\"X\\\"}};\\n\\n for (String[] a : MNs) {\\n String[] r = orderDisjointItems(a[0].split(\\\" \\\"), a[1].split(\\\" \\\"));\\n System.out.printf(\\\"%s | %s -> %s%n\\\", a[0], a[1], Arrays.toString(r));\\n }\\n }\\n\\n // if input items cannot be null\\n static String[] orderDisjointItems(String[] m, String[] n) {\\n for (String e : n) {\\n int idx = ArrayUtils.indexOf(m, e);\\n if (idx != -1)\\n m[idx] = null;\\n }\\n for (int i = 0, j = 0; i < m.length; i++) {\\n if (m[i] == null)\\n m[i] = n[j++];\\n }\\n return m;\\n }\\n\\n // otherwise\\n static String[] orderDisjointItems2(String[] m, String[] n) {\\n BitSet bitSet = new BitSet(m.length);\\n for (String e : n) {\\n int idx = -1;\\n do {\\n idx = ArrayUtils.indexOf(m, e, idx + 1);\\n } while (idx != -1 && bitSet.get(idx));\\n if (idx != -1)\\n bitSet.set(idx);\\n }\\n for (int i = 0, j = 0; i < m.length; i++) {\\n if (bitSet.get(i))\\n m[i] = n[j++];\\n }\\n return m;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ------------ ORDER DISJOINT LIST ITEMS ------------\\n\\n // disjointOrder :: [String] -> [String] -> [String]\\n const disjointOrder = ms =>\\n ns => zipWith(\\n a => b => [...a, b]\\n )(\\n segments(ms)(ns)\\n )(\\n ns.concat(\\\"\\\")\\n )\\n .flat();\\n\\n\\n // segments :: [String] -> [String] -> [String]\\n const segments = ms =>\\n ns => {\\n const dct = ms.reduce((a, x) => {\\n const\\n wds = a.words,\\n found = wds.indexOf(x) !== -1;\\n\\n return {\\n parts: [\\n ...a.parts,\\n ...(found ? [a.current] : [])\\n ],\\n current: found ? [] : [...a.current, x],\\n words: found ? deleteFirst(x)(wds) : wds\\n };\\n }, {\\n words: ns,\\n parts: [],\\n current: []\\n });\\n\\n return [...dct.parts, dct.current];\\n };\\n\\n\\n // ---------------------- TEST -----------------------\\n const main = () =>\\n transpose(transpose([{\\n M: \\\"the cat sat on the mat\\\",\\n N: \\\"mat cat\\\"\\n }, {\\n M: \\\"the cat sat on the mat\\\",\\n N: \\\"cat mat\\\"\\n }, {\\n M: \\\"A B C A B C A B C\\\",\\n N: \\\"C A C A\\\"\\n }, {\\n M: \\\"A B C A B D A B E\\\",\\n N: \\\"E A D A\\\"\\n }, {\\n M: \\\"A B\\\",\\n N: \\\"B\\\"\\n }, {\\n M: \\\"A B\\\",\\n N: \\\"B A\\\"\\n }, {\\n M: \\\"A B B A\\\",\\n N: \\\"B A\\\"\\n }].map(dct => [\\n dct.M, dct.N,\\n unwords(\\n disjointOrder(\\n words(dct.M)\\n )(\\n words(dct.N)\\n )\\n )\\n ]))\\n .map(col => {\\n const\\n w = maximumBy(\\n comparing(x => x.length)\\n )(col).length;\\n\\n return col.map(justifyLeft(w)(\\\" \\\"));\\n }))\\n .map(\\n ([a, b, c]) => `${a} -> ${b} -> ${c}`\\n )\\n .join(\\\"\\\\n\\\");\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // comparing :: (a -> b) -> (a -> a -> Ordering)\\n const comparing = f =>\\n // The ordering of f(x) and f(y) as a value\\n // drawn from {-1, 0, 1}, representing {LT, EQ, GT}.\\n x => y => {\\n const\\n a = f(x),\\n b = f(y);\\n\\n return a < b ? -1 : (a > b ? 1 : 0);\\n };\\n\\n\\n // deleteFirst :: a -> [a] -> [a]\\n const deleteFirst = x => {\\n const go = xs => 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 // unwords :: [String] -> String\\n const unwords = xs =>\\n // A space-separated string derived\\n // from a list of words.\\n xs.join(\\\" \\\");\\n\\n\\n // words :: String -> [String]\\n const words = s =>\\n // List of space-delimited sub-strings.\\n s.split(/\\\\s+/u);\\n\\n\\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\n const zipWith = f =>\\n // A list constructed by zipping with a\\n // custom function, rather than with the\\n // default tuple constructor.\\n xs => ys => xs.map(\\n (x, i) => f(x)(ys[i])\\n ).slice(\\n 0, Math.min(xs.length, ys.length)\\n );\\n\\n // ---------------- FORMATTING OUTPUT ----------------\\n\\n // justifyLeft :: Int -> Char -> String -> String\\n const justifyLeft = n =>\\n // The string s, followed by enough padding (with\\n // the character c) to reach the string length n.\\n c => s => n > s.length ? (\\n s.padEnd(n, c)\\n ) : s;\\n\\n\\n // maximumBy :: (a -> a -> Ordering) -> [a] -> a\\n const maximumBy = f =>\\n xs => Boolean(xs.length) ? (\\n xs.slice(1).reduce(\\n (a, x) => 0 < f(x)(a) ? (\\n x\\n ) : a,\\n xs[0]\\n )\\n ) : undefined;\\n\\n\\n // transpose :: [[a]] -> [[a]]\\n const transpose = rows =>\\n // The columns of a matrix of consistent row length,\\n // transposed into corresponding rows.\\n Boolean(rows.length) ? rows[0].map(\\n (_, i) => rows.flatMap(\\n v => v[i]\\n )\\n ) : [];\\n\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def disjoint_order(N):\\n # The helper function, indices, ensures that successive occurrences\\n # of a particular value in N are matched by successive occurrences\\n # in the input on the assumption that null is not initially in the input.\\n def indices:\\n . as $in\\n | reduce range(0; N|length) as $i\\n # state: [ array, indices ]\\n ( [$in, []];\\n (.[0] | index(N[$i])) as $ix | .[0][$ix] = null | .[1] += [$ix])\\n | .[1];\\n\\n . as $in\\n | (indices | sort) as $sorted\\n | reduce range(0; N|length) as $i ($in; .[$sorted[$i]] = N[$i] ) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"] | indices( [\\\"mat\\\", \\\"cat\\\"] )\\n#=> [\\\"the\\\",\\\"mat\\\",\\\"sat\\\",\\\"on\\\",\\\"the\\\",\\\"cat\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"] | disjoint_order( [\\\"cat\\\", \\\"mat\\\"] )\\n#=> [\\\"the\\\",\\\"cat\\\",\\\"sat\\\",\\\"on\\\",\\\"the\\\",\\\"mat\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\"] | disjoint_order( [\\\"C\\\", \\\"A\\\", \\\"C\\\", \\\"A\\\"] )\\n#=> [\\\"C\\\",\\\"B\\\",\\\"A\\\",\\\"C\\\",\\\"B\\\",\\\"A\\\",\\\"A\\\",\\\"B\\\",\\\"C\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\"] | disjoint_order( [\\\"E\\\", \\\"A\\\", \\\"D\\\", \\\"A\\\"] )\\n#=> [\\\"E\\\",\\\"B\\\",\\\"C\\\",\\\"A\\\",\\\"B\\\",\\\"D\\\",\\\"A\\\",\\\"B\\\",\\\"A\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"A\\\", \\\"B\\\"] | disjoint_order( [\\\"B\\\"] )\\n#=> [\\\"A\\\",\\\"B\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"A\\\", \\\"B\\\"] | disjoint_order( [\\\"B\\\", \\\"A\\\"] )\\n#=> [\\\"B\\\",\\\"A\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\"] | disjoint_order( [\\\"B\\\", \\\"A\\\"] )\\n#=> [\\\"B\\\",\\\"A\\\",\\\"B\\\",\\\"A\\\"]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"[\\\"X\\\", \\\"X\\\", \\\"Y\\\"] | disjoint_order([\\\"X\\\"])\\n#=> [X, X, Y]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function order_disjoint{T<:AbstractArray}(m::T, n::T)\\n rlen = length(n)\\n rdis = zeros(Int, rlen)\\n for (i, e) in enumerate(n)\\n j = findfirst(m, e)\\n while j in rdis && j != 0\\n j = findnext(m, e, j+1)\\n end\\n rdis[i] = j\\n end\\n if 0 in rdis\\n throw(DomainError())\\n end\\n sort!(rdis)\\n p = copy(m)\\n p[rdis] = n\\n return p\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"testm = {[\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"],\\n [\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"],\\n [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\"],\\n [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\"],\\n [\\\"A\\\", \\\"B\\\"],\\n [\\\"A\\\", \\\"B\\\"],\\n [\\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\"],\\n }\\n\\ntestn = {[\\\"mat\\\", \\\"cat\\\"],\\n [\\\"cat\\\", \\\"mat\\\"],\\n [\\\"C\\\", \\\"A\\\", \\\"C\\\", \\\"A\\\"],\\n [\\\"E\\\", \\\"A\\\", \\\"D\\\", \\\"A\\\"],\\n [\\\"B\\\"],\\n [\\\"B\\\", \\\"A\\\"],\\n [\\\"B\\\", \\\"A\\\"],\\n }\\n\\nfor i in 1:length(testm)\\n m = join(testm[i], \\\" \\\")\\n n = join(testn[i], \\\" \\\")\\n p = join(order_disjoint(testm[i], testn[i]), \\\" \\\")\\n println(\\\" (\\\", m, \\\", \\\", n, \\\") => \\\", p)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nconst val NULL = \\\"\\\\u0000\\\"\\n\\nfun orderDisjointList(m: String, n: String): String {\\n val nList = n.split(' ')\\n // first replace the first occurrence of items of 'n' in 'm' with the NULL character\\n // which we can safely assume won't occur in 'm' naturally\\n var p = m\\n for (item in nList) p = p.replaceFirst(item, NULL)\\n // now successively replace the NULLs with items from nList\\n val mList = p.split(NULL)\\n val sb = StringBuilder()\\n for (i in 0 until nList.size) sb.append(mList[i], nList[i])\\n return sb.append(mList.last()).toString()\\n}\\n\\nfun main(args: Array<String>) {\\n val m = arrayOf(\\n \\\"the cat sat on the mat\\\",\\n \\\"the cat sat on the mat\\\",\\n \\\"A B C A B C A B C\\\",\\n \\\"A B C A B D A B E\\\",\\n \\\"A B\\\",\\n \\\"A B\\\",\\n \\\"A B B A\\\"\\n )\\n val n = arrayOf(\\n \\\"mat cat\\\",\\n \\\"cat mat\\\",\\n \\\"C A C A\\\",\\n \\\"E A D A\\\",\\n \\\"B\\\",\\n \\\"B A\\\",\\n \\\"B A\\\"\\n )\\n for (i in 0 until m.size)\\n println(\\\"${m[i].padEnd(22)} -> ${n[i].padEnd(7)} -> ${orderDisjointList(m[i], n[i])}\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Split str on any space characters and return as a table\\nfunction split (str)\\n local t = {}\\n for word in str:gmatch(\\\"%S+\\\") do table.insert(t, word) end\\n return t\\nend\\n\\n-- Order disjoint list items\\nfunction orderList (dataStr, orderStr)\\n local data, order = split(dataStr), split(orderStr)\\n for orderPos, orderWord in pairs(order) do\\n for dataPos, dataWord in pairs(data) do\\n if dataWord == orderWord then\\n data[dataPos] = false\\n break\\n end\\n end\\n end\\n local orderPos = 1\\n for dataPos, dataWord in pairs(data) do\\n if not dataWord then\\n data[dataPos] = order[orderPos]\\n orderPos = orderPos + 1\\n if orderPos > #order then return data end\\n end\\n end\\n return data\\nend\\n\\n-- Main procedure\\nlocal testCases = {\\n {'the cat sat on the mat', 'mat cat'},\\n {'the cat sat on the mat', 'cat mat'},\\n {'A B C A B C A B C' , 'C A C A'},\\n {'A B C A B D A B E' , 'E A D A'},\\n {'A B' , 'B'},\\n {'A B' , 'B A'},\\n {'A B B A' , 'B A'}\\n}\\nfor _, example in pairs(testCases) do\\n print(table.concat(orderList(unpack(example)), \\\" \\\"))\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Function Checkit$ {\\n\\tDocument Ret$\\n\\tFlush\\n\\tData \\\"the cat sat on the mat\\\", \\\"mat cat\\\"\\n\\tData \\\"the cat sat on the mat\\\",\\\"cat mat\\\"'\\n\\tData \\\"A B C A B C A B C\\\", \\\"C A C A\\\"\\n\\tData \\\"A B C A B D A B E\\\", \\\"E A D A\\\"\\n\\tData \\\"A B\\\", \\\"B\\\"\\n\\tData \\\"A B\\\", \\\"B A\\\"\\n\\tData \\\"A B B A\\\",\\\"B A\\\"\\n\\tDim A$()\\n\\twhile not empty\\n\\t\\tread m$, n$\\n\\t\\tA$()=piece$(m$, \\\" \\\")\\n\\t\\tLet w=piece$(n$, \\\" \\\")\\n\\t\\tLet z=A$()\\n\\t\\tx=each(w)\\n\\t\\twhile x\\n\\t\\t\\ty=z#pos(array$(x))\\n\\t\\t\\tif y>-1 then a$(y)=\\\"\\\"\\n\\t\\tend while\\n\\t\\tp=0\\n\\t\\tx=each(w)\\n\\t\\twhile x\\n\\t\\t\\twhile a$(p)<>\\\"\\\" : p++: end while\\n\\t\\t\\ta$(p)=array$(x)\\n\\t\\tend while\\n\\t\\tret$=m$+\\\" | \\\"+n$+\\\" -> \\\"+z#str$()+{\\n\\t\\t}\\n\\tend while\\n\\t=ret$\\n}\\nReport Checkit$()\\nClipboard Checkit$()\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Function Checkit2$ {\\n\\tDocument Ret$\\n\\tFlush\\n\\tData \\\"the cat sat on the mat\\\", \\\"mat cat\\\"\\n\\tData \\\"the cat sat on the mat\\\",\\\"cat mat\\\"'\\n\\tData \\\"A B C A B C A B C\\\", \\\"C A C A\\\"\\n\\tData \\\"A B C A B D A B E\\\", \\\"E A D A\\\"\\n\\tData \\\"A B\\\", \\\"B\\\"\\n\\tData \\\"A B\\\", \\\"B A\\\"\\n\\tData \\\"A B B A\\\",\\\"B A\\\"\\n\\tDim A$()\\n\\twhile not empty\\n\\t\\tread m$, n$\\n\\t\\tA$()=piece$(m$, \\\" \\\")\\n\\t\\tLet w=piece$(n$, \\\" \\\")\\n\\t\\tLet z=A$()\\n\\t\\tdim p(len(w))\\n\\t\\tx=each(w)\\n\\t\\tp=0\\n\\t\\twhile x\\n\\t\\t\\ty=z#pos(array$(x))\\n\\t\\t\\tif y>-1 then a$(y)=\\\"\\\": p(p)=y : p++\\n\\t\\tend while\\n\\t\\tu=p()#Sort()\\n\\t\\tx=each(u)\\n\\t\\twhile x\\n\\t\\t\\ta$(array(x))=w#val$(x^)\\n\\t\\tend while\\n\\t\\tret$=m$+\\\" | \\\"+n$+\\\" -> \\\"+z#str$()+{\\n\\t\\t}\\n\\tend while\\n\\t=ret$\\n}\\nReport Checkit2$()\\nClipboard Checkit2$()\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"order[m_, n_] :=\\n ReplacePart[m,\\n MapThread[\\n Rule, {Position[m, Alternatives @@ n][[;; Length[n]]], n}]];\\nPrint[StringRiffle[\\n order[{\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"}, {\\\"mat\\\",\\n \\\"cat\\\"}]]];\\nPrint[StringRiffle[\\n order[{\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"}, {\\\"cat\\\",\\n \\\"mat\\\"}]]];\\nPrint[StringRiffle[\\n order[{\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\"}, {\\\"C\\\", \\\"A\\\",\\n \\\"C\\\", \\\"A\\\"}]]];\\nPrint[StringRiffle[\\n order[{\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\"}, {\\\"E\\\", \\\"A\\\",\\n \\\"D\\\", \\\"A\\\"}]]];\\nPrint[StringRiffle[order[{\\\"A\\\", \\\"B\\\"}, {\\\"B\\\"}]]];\\nPrint[StringRiffle[order[{\\\"A\\\", \\\"B\\\"}, {\\\"B\\\", \\\"A\\\"}]]];\\nPrint[StringRiffle[order[{\\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\"}, {\\\"B\\\", \\\"A\\\"}]]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import algorithm, strutils\\n\\n\\nproc orderDisjoint(m, n: string): string =\\n\\n # Build the list of items.\\n var m = m.splitWhitespace()\\n let n = n.splitWhitespace()\\n\\n # Find the indexes of items to replace.\\n var indexes: seq[int]\\n for item in n:\\n let idx = m.find(item)\\n if idx >= 0:\\n indexes.add idx\\n m[idx] = \\\"\\\" # Set to empty string for next searches.\\n indexes.sort()\\n\\n # Do the replacements.\\n for i, idx in indexes:\\n m[idx] = n[i]\\n\\n result = m.join(\\\" \\\")\\n\\n\\nwhen isMainModule:\\n\\n template process(a, b: string) =\\n echo a, \\\" | \\\", b, \\\" → \\\", orderDisjoint(a, b)\\n\\n process(\\\"the cat sat on the mat\\\", \\\"mat cat\\\")\\n process(\\\"the cat sat on the mat\\\", \\\"cat mat\\\")\\n process(\\\"A B C A B C A B C\\\", \\\"C A C A\\\")\\n process(\\\"A B C A B D A B E\\\", \\\"E A D A\\\")\\n process(\\\"A B\\\", \\\"B\\\")\\n process(\\\"A B\\\", \\\"B A\\\")\\n process(\\\"A B B A\\\", \\\"B A\\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"sub dsort {\\n my ($m, $n) = @_;\\n my %h;\\n $h{$_}++ for @$n;\\n map $h{$_}-- > 0 ? shift @$n : $_, @$m;\\n}\\n\\nfor (split \\\"\\\\n\\\", <<\\\"IN\\\")\\n the cat sat on the mat | mat cat\\n the cat sat on the mat | cat mat\\n A B C A B C A B C | C A C A\\n A B C A B D A B E | E A D A\\n A B | B\\n A B | B A\\n A B B A | B A\\nIN\\n{\\n\\n my ($a, $b) = map([split], split '\\\\|');\\n print \\\"@$a | @$b -> @{[dsort($a, $b)]}\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">order_disjoint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rlen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rdis</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rlen</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">rlen</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">j</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">rdis</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">rlen</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">rdis</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #000000;\\\">rlen</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">rlen</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">rdis</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]]=</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #008000;\\\">\\\"the cat sat on the mat\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"mat cat\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"the cat sat on the mat\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"cat mat\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B C A B C A B C\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"C A C A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B C A B D A B E\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"E A D A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"B\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"B A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B B A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"B A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B B A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"A B\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B A B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"A B\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B A B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"B A B A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B C C B A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"A C A C\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A B C C B A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"C A C A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A X\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Y A\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A X\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Y A X\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"A X\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Y X A\\\"</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\\\\"%s\\\\\\\",\\\\\\\"%s\\\\\\\" => \\\\\\\"%s\\\\\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order_disjoint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">))})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de orderDisjoint (M N)\\n (for S N\\n (and (memq S M) (set @ NIL)) )\\n (mapcar\\n '((S) (or S (pop 'N)))\\n M ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (orderDisjoint '(the cat sat on the mat) '(mat cat))\\n-> (the mat sat on the cat)\\n\\n: (orderDisjoint '(the cat sat on the mat) '(cat mat))\\n-> (the cat sat on the mat)\\n\\n: (orderDisjoint '(A B C A B C A B C) '(C A C A))\\n-> (C B A C B A A B C)\\n\\n: (orderDisjoint '(A B C A B D A B E) '(E A D A))\\n-> (E B C A B D A B A)\\n\\n: (orderDisjoint '(A B) '(B))\\n-> (A B)\\n\\n: (orderDisjoint '(A B) '(B A))\\n-> (B A)\\n\\n: (orderDisjoint '(A B B A) '(B A))\\n-> (B A B A)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function sublistsort($M, $N) {\\n $arr = $M.Split(' ')\\n $array = $N.Split(' ') | group\\n $Count = @($array |foreach {$_.Count})\\n $ip, $i = @(), 0\\n $arr | foreach{\\n $name = \\\"$_\\\"\\n $j = $array.Name.IndexOf($name)\\n if($j -gt -1){\\n $k = $Count[$j] - 1\\n if($k -ge 0) {\\n $ip += @($i)\\n $Count[$j] = $k\\n }\\n }\\n $i++\\n }\\n $i = 0\\n $N.Split(' ') | foreach{ $arr[$ip[$i++]] = \\\"$_\\\"}\\n [pscustomobject]@{\\n \\\"M\\\" = \\\"$M \\\"\\n \\\"N\\\" = \\\"$N \\\"\\n \\\"M'\\\" = \\\"$($arr)\\\"\\n }\\n}\\n$M1 = 'the cat sat on the mat'\\n$N1 = 'mat cat'\\n$M2 = 'the cat sat on the mat'\\n$N2 = 'cat mat'\\n$M3 = 'A B C A B C A B C'\\n$N3 = 'C A C A'\\n$M4 = 'A B C A B D A B E'\\n$N4 = 'E A D A'\\n$M5 = 'A B'\\n$N5 = 'B'\\n$M6 = 'A B'\\n$N6 = 'B A'\\n$M7 = 'A B B A'\\n$N7 = 'B A'\\nsublistsort $M1 $N1\\nsublistsort $M2 $N2\\nsublistsort $M3 $N3\\nsublistsort $M4 $N4\\nsublistsort $M5 $N5\\nsublistsort $M6 $N6\\nsublistsort $M7 $N7\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"from __future__ import print_function\\n\\ndef order_disjoint_list_items(data, items):\\n #Modifies data list in-place\\n itemindices = []\\n for item in set(items):\\n itemcount = items.count(item)\\n #assert data.count(item) >= itemcount, 'More of %r than in data' % item\\n lastindex = [-1]\\n for i in range(itemcount):\\n lastindex.append(data.index(item, lastindex[-1] + 1))\\n itemindices += lastindex[1:]\\n itemindices.sort()\\n for index, item in zip(itemindices, items):\\n data[index] = item\\n\\nif __name__ == '__main__':\\n tostring = ' '.join\\n for data, items in [ (str.split('the cat sat on the mat'), str.split('mat cat')),\\n (str.split('the cat sat on the mat'), str.split('cat mat')),\\n (list('ABCABCABC'), list('CACA')),\\n (list('ABCABDABE'), list('EADA')),\\n (list('AB'), list('B')),\\n (list('AB'), list('BA')),\\n (list('ABBA'), list('BA')),\\n (list(''), list('')),\\n (list('A'), list('A')),\\n (list('AB'), list('')),\\n (list('ABBA'), list('AB')),\\n (list('ABAB'), list('AB')),\\n (list('ABAB'), list('BABA')),\\n (list('ABCCBA'), list('ACAC')),\\n (list('ABCCBA'), list('CACA')),\\n ]:\\n print('Data M: %-24r Order N: %-9r' % (tostring(data), tostring(items)), end=' ')\\n order_disjoint_list_items(data, items)\\n print(\\\"-> M' %r\\\" % tostring(data))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(define disjorder\\n (match-lambda**\\n (((list) n) '())\\n ((m (list)) m)\\n (((list h m-tail ...) (list h n-tail ...))\\n (list* h (disjorder m-tail n-tail)))\\n ;; the (not g/h) below stop greedy matching of the list which\\n ;; would pick out orderings from the right first.\\n (((list h (and (not g) m-tail-left) ... g m-tail-right ...)\\n (list g (and (not h) n-tail-left) ... h n-tail-right ...))\\n (disjorder `(,g ,@m-tail-left ,h ,@m-tail-right)\\n `(,g ,@n-tail-left ,h ,@n-tail-right)))\\n (((list h m-tail ...) n)\\n (list* h (disjorder m-tail n)))))\\n\\n(define (report-disjorder m n)\\n (printf \\\"Data M: ~a Order N: ~a -> ~a~%\\\"\\n (~a #:min-width 25 m) (~a #:min-width 10 n) (disjorder m n)))\\n\\n;; Do the task tests\\n(report-disjorder '(the cat sat on the mat) '(mat cat))\\n(report-disjorder '(the cat sat on the mat) '(cat mat))\\n(report-disjorder '(A B C A B C A B C) '(C A C A))\\n(report-disjorder '(A B C A B D A B E) '(E A D A))\\n(report-disjorder '(A B) '(B))\\n(report-disjorder '(A B) '(B A))\\n(report-disjorder '(A B B A) '(B A))\\n;; Do all of the other python tests\\n(report-disjorder '() '())\\n(report-disjorder '(A) '(A))\\n(report-disjorder '(A B) '())\\n(report-disjorder '(A B B A) '(A B))\\n(report-disjorder '(A B A B) '(A B))\\n(report-disjorder '(A B A B) '(B A B A))\\n(report-disjorder '(A B C C B A) '(A C A C))\\n(report-disjorder '(A B C C B A) '(C A C A))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub order-disjoint-list-items(\\\\M, \\\\N) {\\n my \\\\bag = N.BagHash;\\n M.map: { bag{$_}-- ?? N.shift !! $_ }\\n}\\n\\n# Testing:\\n\\nfor q:to/---/.comb(/ [\\\\S+]+ % ' ' /).map({[.words]})\\n the cat sat on the mat mat cat\\n the cat sat on the mat cat mat\\n A B C A B C A B C C A C A\\n A B C A B D A B E E A D A\\n A B B\\n A B B A\\n A B B A B A\\n X X Y X\\n A X Y A\\n ---\\n-> $m, $n { say \\\"\\\\n$m ==> $n\\\\n\\\", order-disjoint-list-items($m, $n) }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program orders a disjoint list of M items with a list of N items. */\\nused = '0'x /*indicates that a word has been parsed*/\\n @. = /*placeholder indicates end─of─array, */\\n @.1 = \\\" the cat sat on the mat | mat cat \\\" /*a string.*/\\n @.2 = \\\" the cat sat on the mat | cat mat \\\" /*\\\" \\\" */\\n @.3 = \\\" A B C A B C A B C | C A C A \\\" /*\\\" \\\" */\\n @.4 = \\\" A B C A B D A B E | E A D A \\\" /*\\\" \\\" */\\n @.5 = \\\" A B | B \\\" /*\\\" \\\" */\\n @.6 = \\\" A B | B A \\\" /*\\\" \\\" */\\n @.7 = \\\" A B B A | B A \\\" /*\\\" \\\" */\\n @.8 = \\\" | \\\" /*\\\" \\\" */\\n @.9 = \\\" A | A \\\" /*\\\" \\\" */\\n @.10 = \\\" A B | \\\" /*\\\" \\\" */\\n @.11 = \\\" A B B A | A B \\\" /*\\\" \\\" */\\n @.12 = \\\" A B A B | A B \\\" /*\\\" \\\" */\\n @.13 = \\\" A B A B | B A B A \\\" /*\\\" \\\" */\\n @.14 = \\\" A B C C B A | A C A C \\\" /*\\\" \\\" */\\n @.15 = \\\" A B C C B A | C A C A \\\" /*\\\" \\\" */\\n /* ════════════M═══════════ ════N════ */\\n\\n do j=1 while @.j\\\\=='' /* [↓] process each input string (@.).*/\\n parse var @.j m '|' n /*parse input string into M and N. */\\n #= words(m) /*#: number of words in the M list.*/\\n do i=# for # by -1 /*process list items in reverse order. */\\n _= word(m, i); !.i= _; $._= i /*construct the !. and $. arrays.*/\\n end /*i*/\\n r.= /*nullify the replacement string [R.] */\\n do k=1 by 2 for words(n)%2 /* [↓] process the N array. */\\n _= word(n, k); v= word(n, k+1) /*get an order word and the replacement*/\\n p1= wordpos(_, m); p2= wordpos(v, m) /*positions of \\\" \\\" \\\" \\\" */\\n if p1==0 | p2==0 then iterate /*if either not found, then skip them. */\\n if $._>>$.v then do; r.p2= !.p1; r.p1= !.p2; end /*switch the words.*/\\n else do; r.p1= !.p1; r.p2= !.p2; end /*don't switch. */\\n !.p1= used; !.p2= used /*mark 'em as used.*/\\n m=\\n do i=1 for #; m= m !.i; _= word(m, i); !.i= _; $._= i\\n end /*i*/\\n end /*k*/ /* [↑] rebuild the !. and $. arrays.*/\\n mp= /*the MP (aka M') string (so far). */\\n do q=1 for #; if !.q==used then mp= mp r.q /*use the original.*/\\n else mp= mp !.q /*use substitute. */\\n end /*q*/ /* [↑] re─build the (output) string. */\\n\\n say @.j ' ────► ' space(mp) /*display new re─ordered text ──► term.*/\\n end /*j*/ /* [↑] end of processing for N words*/\\n /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"def order_disjoint(m,n)\\n print \\\"#{m} | #{n} -> \\\"\\n m, n = m.split, n.split\\n from = 0\\n n.each_slice(2) do |x,y|\\n next unless y\\n sd = m[from..-1]\\n if x > y && (sd.include? x) && (sd.include? y) && (sd.index(x) > sd.index(y))\\n new_from = m.index(x)+1\\n m[m.index(x)+from], m[m.index(y)+from] = m[m.index(y)+from], m[m.index(x)+from]\\n from = new_from\\n end\\n end\\n puts m.join(' ')\\nend\\n\\n[\\n ['the cat sat on the mat', 'mat cat'],\\n ['the cat sat on the mat', 'cat mat'],\\n ['A B C A B C A B C' , 'C A C A'],\\n ['A B C A B D A B E' , 'E A D A'],\\n ['A B' , 'B' ],\\n ['A B' , 'B A' ],\\n ['A B B A' , 'B A' ]\\n].each {|m,n| order_disjoint(m,n)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"ar = [\\n ['the cat sat on the mat', 'mat cat'],\\n ['the cat sat on the mat', 'cat mat'],\\n ['A B C A B C A B C' , 'C A C A'],\\n ['A B C A B D A B E' , 'E A D A'],\\n ['A B' , 'B' ],\\n ['A B' , 'B A' ],\\n ['A B B A' , 'B A' ]\\n]\\n\\nres = ar.map do |m,n|\\n mm = m.dup\\n nn = n.split\\n nn.each {|item| mm.sub!(item, \\\"%s\\\")} #sub! only subs the first match\\n mm % nn #\\\"the %s sat on the %s\\\" % [mat\\\", \\\"cat\\\"] #does what you hope it does.\\nend\\n\\nputs res\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def order[T](input: Seq[T], using: Seq[T], used: Seq[T] = Seq()): Seq[T] =\\n if (input.isEmpty || used.size >= using.size) input\\n else if (using diff used contains input.head)\\n using(used.size) +: order(input.tail, using, used :+ input.head)\\n else input.head +: order(input.tail, using, used)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"val tests = List(\\n \\\"the cat sat on the mat\\\" -> \\\"mat cat\\\",\\n \\\"the cat sat on the mat\\\" -> \\\"cat mat\\\",\\n \\\"A B C A B C A B C\\\" -> \\\"C A C A\\\",\\n \\\"A B C A B D A B E\\\" -> \\\"E A D A\\\",\\n \\\"A B\\\" -> \\\"B\\\",\\n \\\"A B\\\" -> \\\"B A\\\",\\n \\\"A B B A\\\" -> \\\"B A\\\"\\n)\\n\\ntests.foreach{case (input, using) =>\\n val done = order(input.split(\\\" \\\"), using.split(\\\" \\\"))\\n println(f\\\"\\\"\\\"Data M: $input%-24s Order N: $using%-9s -> Result M': ${done mkString \\\" \\\"}\\\"\\\"\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func dsort(m, n) {\\n var h = Hash()\\n n.each {|item| h{item} := 0 ++ }\\n m.map {|item| h{item} := 0 -- > 0 ? n.shift : item}\\n}\\n\\n<<'EOT'.lines.each { |line|\\n the cat sat on the mat | mat cat\\n the cat sat on the mat | cat mat\\n A B C A B C A B C | C A C A\\n A B C A B D A B E | E A D A\\n A B | B\\n A B | B A\\n A B B A | B A\\nEOT\\n var (a, b) = line.split('|').map{.words}...\\n say \\\"#{a.join(' ')} | #{b.join(' ')} -> #{dsort(a.clone, b.clone).join(' ')}\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func disjointOrder<T: Hashable>(m: [T], n: [T]) -> [T] {\\n let replaceCounts = n.reduce(into: [T: Int](), { $0[$1, default: 0] += 1 })\\n let reduced = m.reduce(into: ([T](), n, replaceCounts), {cur, el in\\n cur.0.append(cur.2[el, default: 0] > 0 ? cur.1.removeFirst() : el)\\n cur.2[el]? -= 1\\n })\\n\\n return reduced.0\\n}\\n\\nprint(disjointOrder(m: [\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"], n: [\\\"mat\\\", \\\"cat\\\"]))\\nprint(disjointOrder(m: [\\\"the\\\", \\\"cat\\\", \\\"sat\\\", \\\"on\\\", \\\"the\\\", \\\"mat\\\"], n: [\\\"cat\\\", \\\"mat\\\"]))\\nprint(disjointOrder(m: [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"C\\\"], n: [\\\"C\\\", \\\"A\\\", \\\"C\\\", \\\"A\\\"]))\\nprint(disjointOrder(m: [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"A\\\", \\\"B\\\", \\\"D\\\", \\\"A\\\", \\\"B\\\", \\\"E\\\"], n: [\\\"E\\\", \\\"A\\\", \\\"D\\\", \\\"A\\\"]))\\nprint(disjointOrder(m: [\\\"A\\\", \\\"B\\\"], n: [\\\"B\\\"]))\\nprint(disjointOrder(m: [\\\"A\\\", \\\"B\\\"], n: [\\\"B\\\", \\\"A\\\"]))\\nprint(disjointOrder(m: [\\\"A\\\", \\\"B\\\", \\\"B\\\", \\\"A\\\"], n: [\\\"B\\\", \\\"A\\\"]))\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc orderDisjoint {theList theOrderList} {\\n foreach item $theOrderList {incr n($item)}\\n set is {}\\n set i 0\\n foreach item $theList {\\n\\tif {[info exist n($item)] && [incr n($item) -1] >= 0} {\\n\\t lappend is $i\\n\\t}\\n\\tincr i\\n }\\n foreach item $theOrderList i $is {lset theList $i $item}\\n return $theList\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc orderDisjoint {theList theOrderList} {\\n foreach item $theOrderList {incr n($item)}\\n set is -\\n set i 0\\n foreach item $theList {\\n\\tif {[info exist n($item)] && [incr n($item) -1] >= 0} {\\n\\t lappend is $i\\n\\t}\\n\\tincr i\\n }\\n set i 0\\n foreach item $theOrderList {\\n\\tif {[incr n($item)] <= 1} {\\n\\t lset theList [lindex $is [incr i]] $item\\n\\t}\\n }\\n return $theList\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"foreach {items order} {\\n \\\"the cat sat on the mat\\\" \\\"mat cat\\\"\\n \\\"the cat sat on the mat\\\" \\\"cat mat\\\"\\n \\\"A B C A B C A B C\\\" \\\"C A C A\\\"\\n \\\"A B C A B D A B E\\\" \\\"E A D A\\\"\\n \\\"A B\\\" \\\"B\\\"\\n \\\"A B\\\" \\\"B A\\\"\\n \\\"A B B A\\\" \\\"B A\\\"\\n} {\\n puts \\\"'$items' with '$order' => '[orderDisjoint $items $order]'\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar NULL = \\\"\\\\0\\\"\\n\\nvar orderDisjointList = Fn.new { |m, n|\\n var nList = n.split(\\\" \\\")\\n // first replace the first occurrence of items of 'n' in 'm' with the NULL character\\n // which we can safely assume won't occur in 'm' naturally\\n for (item in nList) {\\n var ix = m.indexOf(item)\\n if (ix >= 0) {\\n var le = item.count\\n m = m[0...ix] + NULL + m[ix + le..-1]\\n }\\n }\\n // now successively replace the NULLs with items from nList\\n var mList = m.split(NULL)\\n var sb = \\\"\\\"\\n for (i in 0...nList.count) sb = sb + mList[i] + nList[i]\\n return sb + mList[-1]\\n}\\n\\nvar ma = [\\n \\\"the cat sat on the mat\\\",\\n \\\"the cat sat on the mat\\\",\\n \\\"A B C A B C A B C\\\",\\n \\\"A B C A B D A B E\\\",\\n \\\"A B\\\",\\n \\\"A B\\\",\\n \\\"A B B A\\\"\\n]\\n\\nvar na = [\\n \\\"mat cat\\\",\\n \\\"cat mat\\\",\\n \\\"C A C A\\\",\\n \\\"E A D A\\\",\\n \\\"B\\\",\\n \\\"B A\\\",\\n \\\"B A\\\"\\n]\\n\\nfor (i in 0...ma.count) {\\n Fmt.print(\\\"$-22s -> $-7s -> $s\\\", ma[i], na[i], orderDisjointList.call(ma[i], na[i]))\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn disOrder(sm,sn){\\n M:=sm.split(\\\" \\\");\\n N:=sn.split(\\\" \\\"); nc:=Walker.cycle(Utils.Helpers.listUnique(N));\\n dn:=Dictionary(); N.pump(Void,'wrap(w){ dn[w] = dn.find(w,0) + 1; });\\n M.pump(String,'wrap(w){\\n if (Void==(n:=dn.find(w))) return(w); // not replaced\\n if (n) { dn[w]=n-1; nc.next(); } // swaps left--\\n else { nc.next(); w }\\t // exhausted\\n }, String.fp(\\\" \\\") )[1,*]\\t// remove leading blank\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"sets:=T(T(\\\"the cat sat on the mat\\\",\\\"mat cat\\\"),\\n T(\\\"the cat sat on the mat\\\",\\\"cat mat\\\"),\\n T(\\\"A B C A B C A B C\\\",\\\"C A C A\\\"),\\n T(\\\"A B C A B D A B E\\\",\\\"E A D A\\\"),\\n T(\\\"A B\\\",\\\"B\\\"), T(\\\"A B\\\",\\\"B A\\\"), T(\\\"A B B A\\\",\\\"B A\\\") );\\nforeach m,n in (sets){\\n m.println(\\\" / \\\",n,\\\" --> \\\",disOrder(m,n));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Order-disjoint-list-items"}}},{"rowIdx":1469,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ordered_partitions\nnote: Discrete math\n","language":"00-META"},{"code":"In this task we want to find the ordered partitions into fixed-size blocks. \n\nThis task is related to [[Combinations]] in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task.\n\n<math>partitions(\\mathit{arg}_1,\\mathit{arg}_2,...,\\mathit{arg}_n)</math> should generate all distributions of the elements in <math>\\{1,...,\\Sigma_{i=1}^n\\mathit{arg}_i\\}</math> into <math>n</math> blocks of respective size <math>\\mathit{arg}_1,\\mathit{arg}_2,...,\\mathit{arg}_n</math>.\n\nExample 1: <math>partitions(2,0,2)</math> would create:\n\n<pre>\n{({1, 2}, {}, {3, 4}), \n ({1, 3}, {}, {2, 4}), \n ({1, 4}, {}, {2, 3}), \n ({2, 3}, {}, {1, 4}), \n ({2, 4}, {}, {1, 3}), \n ({3, 4}, {}, {1, 2})}\n</pre>\n\nExample 2: <math>partitions(1,1,1)</math> would create:\n\n<pre>\n{({1}, {2}, {3}), \n ({1}, {3}, {2}), \n ({2}, {1}, {3}), \n ({2}, {3}, {1}), \n ({3}, {1}, {2}), \n ({3}, {2}, {1})}\n</pre>\n\nNote that the number of elements in the list is \n:<math>{\\mathit{arg}_1+\\mathit{arg}_2+...+\\mathit{arg}_n \\choose \\mathit{arg}_1} \\cdot {\\mathit{arg}_2+\\mathit{arg}_3+...+\\mathit{arg}_n \\choose \\mathit{arg}_2} \\cdot \\ldots \\cdot {\\mathit{arg}_n \\choose \\mathit{arg}_n}</math>\n(see [http://en.wikipedia.org/wiki/Binomial_coefficient the definition of the binomial coefficient] if you are not familiar with this notation) and the number of elements remains the same regardless of how the argument is permuted\n(i.e. the [http://en.wikipedia.org/wiki/Multinomial_coefficient multinomial coefficient]). \n\nAlso, <math>partitions(1,1,1)</math> creates the permutations of <math>\\{1,2,3\\}</math> and thus there would be <math>3! = 6</math> elements in the list.\n\nNote: Do not use functions that are not in the standard library of the programming language you use. Your file should be written so that it can be executed on the command line and by default outputs the result of <math>partitions(2,0,2)</math>. If the programming language does not support polyvariadic functions pass a list as an argument.\n\n'''Notation'''\n\nHere are some explanatory remarks on the notation used in the task description:\n\n<math>\\{1, \\ldots, n\\}</math> denotes the set of consecutive numbers from <math>1</math> to <math>n</math>, e.g. <math>\\{1,2,3\\}</math> if <math>n = 3</math>.\n\n<math>\\Sigma</math> is the mathematical notation for summation, e.g. <math>\\Sigma_{i=1}^3 i = 6</math> (see also [http://en.wikipedia.org/wiki/Summation#Capital-sigma_notation]). \n\n<math>\\mathit{arg}_1,\\mathit{arg}_2,...,\\mathit{arg}_n</math> are the arguments — natural numbers — that the sought function receives.\n<br><br>\n\n","language":"00-TASK"},{"code":"F partitions(lengths)\n [[[Int]]] r\n [(Int, Int)] slices\n V delta = -1\n V idx = 0\n L(length) lengths\n assert(length >= 0, ‘lengths must not be negative.’)\n delta += length\n slices.append((idx, delta))\n idx += length\n\n V n = sum(lengths)\n V perm = Array(1 .. n)\n\n L\n [[Int]] part\n L(start, end) slices\n V s = perm[start .. end]\n I !s.is_sorted()\n L.break\n part.append(s)\n L.was_no_break\n r.append(part)\n\n I !perm.next_permutation()\n L.break\n\n R r\n\nF toString(part)\n V result = ‘(’\n L(s) part\n I result.len > 1\n result ‘’= ‘, ’\n result ‘’= ‘{’s.join(‘, ’)‘}’\n R result‘)’\n\nF displayPermutations(lengths)\n print(‘Ordered permutations for (’lengths.join(‘, ’)‘):’)\n L(part) partitions(lengths)\n print(toString(part))\n\n:start:\nI :argv.len > 1\n displayPermutations(:argv[1..].map(Int))\nE\n displayPermutations([2, 0, 2])\n","language":"11l"},{"code":"with Ada.Containers.Indefinite_Ordered_Sets;\nwith Ada.Containers.Ordered_Sets;\npackage Partitions is\n -- Argument type for Create_Partitions: Array of Numbers\n type Arguments is array (Positive range <>) of Natural;\n package Number_Sets is new Ada.Containers.Ordered_Sets\n (Natural);\n type Partition is array (Positive range <>) of Number_Sets.Set;\n function \"<\" (Left, Right : Partition) return Boolean;\n package Partition_Sets is new Ada.Containers.Indefinite_Ordered_Sets\n (Partition);\n function Create_Partitions (Args : Arguments) return Partition_Sets.Set;\nend Partitions;\n","language":"Ada"},{"code":"package body Partitions is\n -- compare number sets (not provided)\n function \"<\" (Left, Right : Number_Sets.Set) return Boolean is\n use type Ada.Containers.Count_Type;\n use Number_Sets;\n Left_Pos : Cursor := Left.First;\n Right_Pos : Cursor := Right.First;\n begin\n -- compare each element, until one or both lists finishes\n while Left_Pos /= No_Element and then Right_Pos /= No_Element loop\n -- compare elements\n if Element (Left_Pos) < Element (Right_Pos) then\n return True;\n elsif Element (Left_Pos) > Element (Right_Pos) then\n return False;\n end if;\n -- increase iterator\n Next (Left_Pos);\n Next (Right_Pos);\n end loop;\n -- Right is longer\n if Right_Pos /= No_Element then\n return True;\n else\n -- Left is longer, or Left and Right are identical.\n return False;\n end if;\n end \"<\";\n -- compare two Partitions\n function \"<\" (Left, Right : Partition) return Boolean is\n use type Ada.Containers.Count_Type;\n use type Number_Sets.Set;\n begin\n -- check length\n if Left'Length < Right'Length then\n return True;\n elsif Left'Length > Right'Length then\n return False;\n end if;\n -- same length\n if Left'Length > 0 then\n for I in Left'Range loop\n if Left (I) < Right (I) then\n return True;\n elsif Left (I) /= Right (I) then\n return False;\n end if;\n end loop;\n end if;\n -- length = 0 are always smallest\n return False;\n end \"<\";\n -- create partitions (as the task describes)\n function Create_Partitions (Args : Arguments) return Partition_Sets.Set is\n -- permutations needed\n type Permutation is array (Positive range <>) of Natural;\n -- exception to be thrown after last permutation reached\n No_More_Permutations : exception;\n -- get initial permutation (ordered small->big)\n function Initial_Permutation (Max : Natural) return Permutation is\n Result : Permutation (1 .. Max);\n begin\n for I in 1 .. Max loop\n Result (I) := I;\n end loop;\n return Result;\n end Initial_Permutation;\n -- get next permutation\n function Next_Permutation (Current : Permutation) return Permutation is\n K : Natural := Current'Last - 1;\n L : Positive := Current'Last;\n Result : Permutation := Current;\n begin\n -- 1. Find the largest index k such that a[k] < a[k + 1].\n while K /= 0 and then Current (K) > Current (K + 1) loop\n K := K - 1;\n end loop;\n -- If no such index exists, the permutation is the last permutation.\n if K = 0 then\n raise No_More_Permutations;\n end if;\n -- 2. Find the largest index l such that a[k] < a[l].\n -- Since k + 1 is such an index, l is well defined\n -- and satisfies k < l.\n while Current (K) > Current (L) loop\n L := L - 1;\n end loop;\n -- 3. Swap a[k] with a[l].\n Result (K) := Current (L);\n Result (L) := Current (K);\n -- 4. Reverse the sequence from a[k + 1] up to and including the\n -- final element a[n].\n for I in 1 .. (Result'Last - K) / 2 loop\n declare\n Temp : constant Natural := Result (K + I);\n begin\n Result (K + I) := Result (Result'Last - I + 1);\n Result (Result'Last - I + 1) := Temp;\n end;\n end loop;\n return Result;\n end Next_Permutation;\n Result : Partition_Sets.Set;\n Sum : Natural := 0;\n begin\n -- get number of elements\n for I in Args'Range loop\n Sum := Sum + Args (I);\n end loop;\n declare\n -- initial permutation\n Current_Permutation : Permutation := Initial_Permutation (Sum);\n begin\n -- loop through permutations\n loop\n -- create Partition (same count of Number_Sets.Set as Args)\n declare\n Item : Natural := Current_Permutation'First;\n Current_Partition : Partition (Args'Range);\n begin\n -- loop each partition\n for I in Args'Range loop\n -- fill in the number of elements requested\n for J in 1 .. Args (I) loop\n Current_Partition (I).Insert\n (New_Item => Current_Permutation (Item));\n Item := Item + 1;\n end loop;\n end loop;\n -- insert partition into result set\n Result.Insert (New_Item => Current_Partition);\n exception\n when Constraint_Error =>\n -- partition was already inserted, ignore it.\n -- this happens when one of the args > 1.\n null;\n end;\n -- create next permutation\n Current_Permutation := Next_Permutation (Current_Permutation);\n end loop;\n exception\n when No_More_Permutations =>\n -- no more permutations, we are finished\n null;\n end;\n return Result;\n end Create_Partitions;\nend Partitions;\n","language":"Ada"},{"code":"with Ada.Text_IO;\nwith Partitions;\nprocedure Main is\n package Natural_IO is new Ada.Text_IO.Integer_IO (Natural);\n Example_Partitions : Partitions.Partition_Sets.Set;\nbegin\n Ada.Text_IO.Put_Line (\"Partitions for (2, 0, 2):\");\n -- create partition\n Example_Partitions := Partitions.Create_Partitions (Args => (2, 0, 2));\n -- pretty print the result\n declare\n use type Partitions.Partition_Sets.Cursor;\n Position : Partitions.Partition_Sets.Cursor := Example_Partitions.First;\n begin\n Ada.Text_IO.Put ('{');\n while Position /= Partitions.Partition_Sets.No_Element loop\n if Position /= Example_Partitions.First then\n Ada.Text_IO.Put (' ');\n end if;\n declare\n Current_Partition : constant Partitions.Partition :=\n Partitions.Partition_Sets.Element (Position);\n begin\n Ada.Text_IO.Put ('(');\n for I in Current_Partition'Range loop\n Ada.Text_IO.Put ('{');\n declare\n use type Partitions.Number_Sets.Cursor;\n Current_Number : Partitions.Number_Sets.Cursor :=\n Current_Partition (I).First;\n begin\n while Current_Number /= Partitions.Number_Sets.No_Element\n loop\n Natural_IO.Put\n (Item =>\n Partitions.Number_Sets.Element (Current_Number),\n Width => 1);\n Partitions.Number_Sets.Next (Current_Number);\n if Current_Number /=\n Partitions.Number_Sets.No_Element then\n Ada.Text_IO.Put (',');\n end if;\n end loop;\n end;\n Ada.Text_IO.Put ('}');\n if I /= Current_Partition'Last then\n Ada.Text_IO.Put (\", \");\n end if;\n end loop;\n end;\n Ada.Text_IO.Put (')');\n Partitions.Partition_Sets.Next (Position);\n if Position /= Partitions.Partition_Sets.No_Element then\n Ada.Text_IO.Put (',');\n Ada.Text_IO.New_Line;\n end if;\n end loop;\n Ada.Text_IO.Put ('}');\n Ada.Text_IO.New_Line;\n end;\nend Main;\n","language":"Ada"},{"code":" DIM list1%(2) : list1%() = 2, 0, 2\n PRINT \"partitions(2,0,2):\"\n PRINT FNpartitions(list1%())\n DIM list2%(2) : list2%() = 1, 1, 1\n PRINT \"partitions(1,1,1):\"\n PRINT FNpartitions(list2%())\n DIM list3%(3) : list3%() = 1, 2, 0, 1\n PRINT \"partitions(1,2,0,1):\"\n PRINT FNpartitions(list3%())\n END\n\n DEF FNpartitions(list%())\n LOCAL i%, j%, n%, p%, o$, x%()\n n% = DIM(list%(),1)\n DIM x%(SUM(list%())-1)\n FOR i% = 0 TO n%\n IF list%(i%) THEN\n FOR j% = 1 TO list%(i%)\n x%(p%) = i%\n p% += 1\n NEXT\n ENDIF\n NEXT i%\n REPEAT\n FOR i% = 0 TO n%\n o$ += \" ( \"\n FOR j% = 0 TO DIM(x%(),1)\n IF x%(j%) = i% o$ += STR$(j%+1) + \" \"\n NEXT\n o$ += \")\"\n NEXT i%\n o$ += CHR$13 + CHR$10\n UNTIL NOT FNperm(x%())\n = o$\n\n DEF FNperm(x%())\n LOCAL i%, j%\n FOR i% = DIM(x%(),1)-1 TO 0 STEP -1\n IF x%(i%) < x%(i%+1) EXIT FOR\n NEXT\n IF i% < 0 THEN = FALSE\n j% = DIM(x%(),1)\n WHILE x%(j%) <= x%(i%) j% -= 1 : ENDWHILE\n SWAP x%(i%), x%(j%)\n i% += 1\n j% = DIM(x%(),1)\n WHILE i% < j%\n SWAP x%(i%), x%(j%)\n i% += 1\n j% -= 1\n ENDWHILE\n = TRUE\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n\nint next_perm(int size, int * nums)\n{\n int *l, *k, tmp;\n\n for (k = nums + size - 2; k >= nums && k[0] >= k[1]; k--) {};\n if (k < nums) return 0;\n\n for (l = nums + size - 1; *l <= *k; l--) {};\n tmp = *k; *k = *l; *l = tmp;\n\n for (l = nums + size - 1, k++; k < l; k++, l--) {\n tmp = *k; *k = *l; *l = tmp;\n }\n\n return 1;\n}\n\nvoid make_part(int n, int * sizes)\n{\n int x[1024], i, j, *ptr, len = 0;\n\n for (ptr = x, i = 0; i < n; i++)\n for (j = 0, len += sizes[i]; j < sizes[i]; j++, *(ptr++) = i);\n\n do {\n for (i = 0; i < n; i++) {\n printf(\" { \");\n for (j = 0; j < len; j++)\n if (x[j] == i) printf(\"%d \", j);\n\n printf(\"}\");\n }\n printf(\"\\n\");\n } while (next_perm(len, x));\n}\n\nint main()\n{\n int s1[] = {2, 0, 2};\n int s2[] = {1, 2, 3, 4};\n\n printf(\"Part 2 0 2:\\n\");\n make_part(3, s1);\n\n printf(\"\\nPart 1 2 3 4:\\n\");\n make_part(4, s2);\n\n return 1;\n}\n","language":"C"},{"code":"#include <stdio.h>\n\ntypedef unsigned int uint;\n\nint parts[] = {2, 1, 2};\n#define n_parts sizeof(parts)/sizeof(parts[0])\nint bits[n_parts];\n\nvoid show_part(uint x)\n{\n\tuint i;\n\tputchar('{');\n\tfor (i = 0; (1 << i) <= x; i ++)\n\t\tif (x & (1 << i)) printf(\" %d\", i + 1);\n\n\tprintf(\"%s\", \" } \");\n}\n\nvoid gen_bits(uint mask, uint all, uint res, int n, int pid)\n{\n\tuint i;\n\twhile (!n) {\n\t\tbits[pid++] = res;\n\t\tif (pid == n_parts) {\n\t\t\tfor (i = 0; i < n_parts; i++)\n\t\t\t\tshow_part(bits[i]);\n\t\t\tputchar('\\n');\n\t\t\treturn;\n\t\t}\n\t\tmask = all &= ~res;\n\t\tres = 0;\n\t\tn = parts[pid];\n\t}\n\n\twhile (mask) {\n\t\tmask &= ~(i = mask & -(int)mask);\n\t\tgen_bits(mask, all, res | i, n - 1, pid);\n\t}\n}\n\nint main(void)\n{\n\tuint i, m;\n\tfor (m = 1, i = 0; i < n_parts; i++)\n\t\tm <<= parts[i];\n\tm--;\n\n\tgen_bits(m, m, 0, parts[0], 0);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <numeric>\n\nvoid partitions(std::vector<size_t> args) {\n size_t sum = std::accumulate(std::begin(args), std::end(args), 0);\n std::vector<size_t> nums(sum);\n std::iota(std::begin(nums), std::end(nums), 1);\n do {\n size_t total_index = 0;\n std::vector<std::vector<size_t>> parts;\n for (const auto& a : args) {\n std::vector<size_t> part;\n bool cont = true;\n for (size_t j = 0; j < a; ++j) {\n for (const auto& p : part) {\n if (nums[total_index] < p) {\n cont = false;\n break;\n }\n }\n if (cont) {\n part.push_back(nums[total_index]);\n ++total_index;\n }\n }\n if (part.size() != a) {\n break;\n }\n parts.push_back(part);\n }\n if (parts.size() == args.size()) {\n std::cout << \"(\";\n for (const auto& p : parts) {\n std::cout << \"{ \";\n for (const auto& e : p) {\n std::cout << e << \" \";\n }\n std::cout << \"},\";\n }\n std::cout << \"),\" << std::endl;\n }\n } while (std::next_permutation(std::begin(nums), std::end(nums)));\n}\n\nint main() {\n std::vector<size_t> args = { 2, 0, 2 };\n partitions(args);\n std::cin.ignore();\n std::cin.get();\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\npublic static class OrderedPartitions\n{\n public static void Main() {\n var input = new [] { new[] { 0, 0, 0, 0, 0 }, new[] { 2, 0, 2 }, new[] { 1, 1, 1 } };\n foreach (int[] sizes in input) {\n foreach (var partition in Partitions(sizes)) {\n Console.WriteLine(partition.Select(set => set.Delimit(\", \").Encase('{','}')).Delimit(\", \").Encase('(', ')'));\n }\n Console.WriteLine();\n }\n }\n\n static IEnumerable<IEnumerable<int[]>> Partitions(params int[] sizes) {\n var enumerators = new IEnumerator<int[]>[sizes.Length];\n var unused = Enumerable.Range(1, sizes.Sum()).ToSortedSet();\n var arrays = sizes.Select(size => new int[size]).ToArray();\n\n for (int s = 0; s >= 0; ) {\n if (s == sizes.Length) {\n yield return arrays;\n s--;\n }\n if (enumerators[s] == null) {\n enumerators[s] = Combinations(sizes[s], unused.ToArray()).GetEnumerator();\n } else {\n unused.UnionWith(arrays[s]);\n }\n if (enumerators[s].MoveNext()) {\n enumerators[s].Current.CopyTo(arrays[s], 0);\n unused.ExceptWith(arrays[s]);\n s++;\n } else {\n enumerators[s] = null;\n s--;\n }\n }\n }\n\n static IEnumerable<T[]> Combinations<T>(int count, params T[] array) {\n T[] result = new T[count];\n foreach (int pattern in BitPatterns(array.Length - count, array.Length)) {\n for (int b = 1 << (array.Length - 1), i = 0, r = 0; b > 0; b >>= 1, i++) {\n if ((pattern & b) == 0) result[r++] = array[i];\n }\n yield return result;\n }\n }\n\n static IEnumerable<int> BitPatterns(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 if (v == 0) break;\n\n int w = (v | (v - 1)) + 1;\n w |= (((w & -w) / (v & -v)) >> 1) - 1;\n v = w & blockMask;\n }\n }\n\n static string Delimit<T>(this IEnumerable<T> source, string separator) => string.Join(separator, source);\n static string Encase(this string s, char start, char end) => start + s + end;\n}\n","language":"C-sharp"},{"code":"(defun fill-part (x i j l)\n (let ((e (elt x i)))\n (loop for c in l do\n\t (loop while (>= j (length e)) do\n\t\t (setf j 0 e (elt x (incf i))))\n\t (setf (elt e j) c)\n\t (incf j))))\n\n;;; take a list of lists and return next partitioning\n;;; it's caller's responsibility to ensure each sublist is sorted\n(defun next-part (list cmp)\n (let* ((l (coerce list 'vector))\n\t (i (1- (length l)))\n\t (e (elt l i)))\n (loop while (<= 0 (decf i)) do\n\t ;; e holds all the right most elements\n\t (let ((p (elt l i)) (q (car (last e))))\n\t ;; find the right-most list that has an element that's smaller\n\t ;; than _something_ in later lists\n\t (when (and p (funcall cmp (first p) q))\n\t ;; find largest element that can be increased\n\t (loop for j from (1- (length p)) downto 0 do\n\t\t (when (funcall cmp (elt p j) q)\n\t\t ;; find the smallest element that's larger than\n\t\t ;; that largest\n\t\t (loop for x from 0 to (1- (length e)) do\n\t\t\t (when (funcall cmp (elt p j) (elt e x))\n\t\t\t (rotatef (elt p j) (elt e x))\n\t\t\t (loop while (< (incf j) (length p)) do\n\t\t\t \t(setf (elt p j) (elt e (incf x))\n\t\t\t\t (elt e x) nil))\n\t\t\t (fill-part l i j (remove nil e))\n\t\t\t (return-from next-part l))))\n\t\t (setf e (append e (list (elt p j))))))\n\t (setf e (append e p))))))\n\n(let ((a '#((1 2) () (3 4))))\n (loop while a do\n\t(format t \"~a~%\" a)\n\t(setf a (next-part a #'<))))\n\n(write-line \"with dupe elements:\")\n(let ((a '#((a c) (c c d))))\n (loop while a do\n\t(format t \"~a~%\" a)\n\t(setf a (next-part a #'string<))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.algorithm, std.range, std.array, std.conv,\n combinations3;\n\nalias iRNG = int[];\n\niRNG[][] orderPart(iRNG blockSize...) {\n iRNG tot = iota(1, 1 + blockSize.sum).array;\n\n iRNG[][] p(iRNG s, in iRNG b) {\n if (b.empty)\n return [[]];\n iRNG[][] res;\n foreach (c; s.combinations(b[0]))\n foreach (r; p(setDifference(s, c).array, b.dropOne))\n res ~= c.dup ~ r;\n return res;\n }\n\n return p(tot, blockSize);\n}\n\nvoid main(in string[] args) {\n auto b = args.length > 1 ? args.dropOne.to!(int[]) : [2, 0, 2];\n writefln(\"%(%s\\n%)\", b.orderPart);\n}\n","language":"D"},{"code":"import core.stdc.stdio;\n\nvoid genBits(size_t N)(ref uint[N] bits, in ref uint[N] parts,\n uint mask, uint all, uint res, uint n, uint pid)\nnothrow @nogc {\n static void showPart(in uint x) nothrow @nogc {\n '['.putchar;\n for (uint i = 0; (1 << i) <= x; i++)\n if (x & (1 << i))\n printf(\"%d \", i + 1);\n ']'.putchar;\n }\n\n while (!n) {\n bits[pid] = res;\n pid++;\n if (pid == N) {\n foreach (immutable b; bits)\n showPart(b);\n '\\n'.putchar;\n return;\n }\n all &= ~res;\n mask = all;\n res = 0;\n n = parts[pid];\n }\n\n while (mask) {\n immutable uint i = mask & -int(mask);\n mask &= ~i;\n genBits(bits, parts, mask, all, res | i, n - 1, pid);\n }\n}\n\nvoid main() nothrow @nogc {\n immutable uint[3] parts = [2, 0, 2];\n uint m = 1;\n foreach (immutable p; parts)\n m <<= p;\n\n uint[parts.length] bits;\n genBits(bits, parts, m - 1, m - 1, 0, parts[0], 0);\n}\n","language":"D"},{"code":"(lib 'list) ;; (combinations L k)\n\n;; add a combination to each partition in ps\n(define (pproduct c ps) (for/list ((x ps)) (cons c x)))\n\n;; apply to any type of set S\n;; ns is list of cardinals for each partition\n;; for all combinations Ci of n objects from S\n;; set S <- LS minus Ci , set n <- next n , and recurse\n\n(define (_partitions S ns )\n (cond\n ([empty? (rest ns)] (list (combinations S (first ns))))\n (else\n (for/fold (parts null)\n ([c (combinations S (first ns))])\n (append\n parts\n (pproduct c (_partitions (set-substract S c) (rest ns))))))))\n\n;; task : S = ( 0 , 1 ... n-1) args = ns\n(define (partitions . args)\n (for-each\n\t writeln\n (_partitions (range 1 (1+ (apply + args))) args )))\n","language":"EchoLisp"},{"code":"defmodule Ordered do\n def partition([]), do: [[]]\n def partition(mask) do\n sum = Enum.sum(mask)\n if sum == 0 do\n [Enum.map(mask, fn _ -> [] end)]\n else\n Enum.to_list(1..sum)\n |> permute\n |> Enum.reduce([], fn perm,acc ->\n {_, part} = Enum.reduce(mask, {perm,[]}, fn num,{pm,a} ->\n {p, rest} = Enum.split(pm, num)\n {rest, [Enum.sort(p) | a]}\n end)\n [Enum.reverse(part) | acc]\n end)\n |> Enum.uniq\n end\n end\n\n defp permute([]), do: [[]]\n defp permute(list), do: for x <- list, y <- permute(list -- [x]), do: [x|y]\nend\n\nEnum.each([[],[0,0,0],[1,1,1],[2,0,2]], fn test_case ->\n IO.puts \"\\npartitions #{inspect test_case}:\"\n Enum.each(Ordered.partition(test_case), fn part ->\n IO.inspect part\n end)\nend)\n","language":"Elixir"},{"code":"Function Perm(x() As Integer) As Boolean\n Dim As Integer i, j\n For i = Ubound(x,1)-1 To 0 Step -1\n If x(i) < x(i+1) Then Exit For\n Next i\n If i < 0 Then Return False\n j = Ubound(x,1)\n While x(j) <= x(i)\n j -= 1\n Wend\n Swap x(i), x(j)\n i += 1\n j = Ubound(x,1)\n While i < j\n Swap x(i), x(j)\n i += 1\n j -= 1\n Wend\n Return True\nEnd Function\n\nFunction Particiones(list() As Integer) As String\n Dim As Integer i, j, n, p ', x()\n Dim As String oSS = \"\"\n n = Ubound(list)\n Dim As Integer x(n)\n For i = 0 To n\n If list(i) Then\n For j = 1 To list(i)\n x(p) = i\n p += 1\n Next j\n End If\n Next i\n Do\n For i = 0 To n\n oSS += \" ( \"\n For j = 0 To Ubound(x,1)\n If x(j) = i Then oSS += Str(j+1) + \" \"\n Next j\n oSS += \")\"\n Next i\n oSS += Chr(13) + Chr(10)\n Loop Until Not Perm(x())\n Return oSS\nEnd Function\n\nDim list2(2) As Integer = {1, 1, 1}\nPrint \"Particiones(1, 1, 1):\"\nPrint Particiones(list2())\nDim list3(3) As Integer = {1, 2, 0, 1}\nPrint !\"\\nParticiones(1, 2, 0, 1):\"\nPrint Particiones(list3())\n\nSleep\n","language":"FreeBASIC"},{"code":"FixedPartitions := function(arg)\n\tlocal aux;\n\taux := function(i, u)\n\t\tlocal r, v, w;\n\t\tif i = Size(arg) then\n\t\t\treturn [[u]];\n\t\telse\n\t\t\tr := [ ];\n\t\t\tfor v in Combinations(u, arg[i]) do\n\t\t\t\tfor w in aux(i + 1, Difference(u, v)) do\n\t\t\t\t\tAdd(r, Concatenation([v], w));\n\t\t\t\tod;\n\t\t\tod;\n\t\t\treturn r;\n\t\tfi;\n\tend;\n\treturn aux(1, [1 .. Sum(arg)]);\nend;\n\n\nFixedPartitions(2, 0, 2);\n# [ [ [ 1, 2 ], [ ], [ 3, 4 ] ], [ [ 1, 3 ], [ ], [ 2, 4 ] ],\n# [ [ 1, 4 ], [ ], [ 2, 3 ] ], [ [ 2, 3 ], [ ], [ 1, 4 ] ],\n# [ [ 2, 4 ], [ ], [ 1, 3 ] ], [ [ 3, 4 ], [ ], [ 1, 2 ] ] ]\n\nFixedPartitions(1, 1, 1);\n# [ [ [ 1 ], [ 2 ], [ 3 ] ], [ [ 1 ], [ 3 ], [ 2 ] ], [ [ 2 ], [ 1 ], [ 3 ] ],\n# [ [ 2 ], [ 3 ], [ 1 ] ], [ [ 3 ], [ 1 ], [ 2 ] ], [ [ 3 ], [ 2 ], [ 1 ] ] ]\n","language":"GAP"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"strconv\"\n)\n\nfunc gen_part(n, res []int, pos int) {\n\tif pos == len(res) {\n\t\tx := make([][]int, len(n))\n\t\tfor i, c := range res {\n\t\t\tx[c] = append(x[c], i+1)\n\t\t}\n\n\t\tfmt.Println(x)\n\t\treturn\n\t}\n\n\tfor i := range n {\n\t\tif n[i] == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tn[i], res[pos] = n[i]-1, i\n\t\tgen_part(n, res, pos+1)\n\t\tn[i]++\n\t}\n}\n\nfunc ordered_part(n_parts []int) {\n\tfmt.Println(\"Ordered\", n_parts)\n\n\tsum := 0\n\tfor _, c := range n_parts {\n\t\tsum += c\n\t}\n\n\tgen_part(n_parts, make([]int, sum), 0)\n}\n\nfunc main() {\n\tif len(os.Args) < 2 {\n\t\tordered_part([]int{2, 0, 2})\n\t\treturn\n\t}\n\tn := make([]int, len(os.Args)-1)\n\tvar err error\n\tfor i, a := range os.Args[1:] {\n\t\tn[i], err = strconv.Atoi(a)\n\t\tif err != nil {\n\t\t\tfmt.Println(err)\n\t\t\treturn\n\t\t}\n\t\tif n[i] < 0 {\n\t\t\tfmt.Println(\"negative partition size not meaningful\")\n\t\t\treturn\n\t\t}\n\t}\n\tordered_part(n)\n}\n","language":"Go"},{"code":"def partitions = { int... sizes ->\n int n = (sizes as List).sum()\n def perms = n == 0 ? [[]] : (1..n).permutations()\n Set parts = perms.collect { p -> sizes.collect { s -> (0..<s).collect { p.pop() } as Set } }\n parts.sort{ a, b ->\n if (!a) return 0\n def comp = [a,b].transpose().find { aa, bb -> aa != bb }\n if (!comp) return 0\n def recomp = comp.collect{ it as List }.transpose().find { aa, bb -> aa != bb }\n if (!recomp) return 0\n return recomp[0] <=> recomp[1]\n }\n}\n","language":"Groovy"},{"code":"partitions(2, 0, 2).each {\n println it\n}\n","language":"Groovy"},{"code":"import Data.List ((\\\\))\n\ncomb :: Int -> [a] -> [[a]]\ncomb 0 _ = [[]]\ncomb _ [] = []\ncomb k (x:xs) = map (x:) (comb (k-1) xs) ++ comb k xs\n\npartitions :: [Int] -> [[[Int]]]\npartitions xs = p [1..sum xs] xs\n where p _ [] = [[]]\n p xs (k:ks) = [ cs:rs | cs <- comb k xs, rs <- p (xs \\\\ cs) ks ]\n\nmain = print $ partitions [2,0,2]\n","language":"Haskell"},{"code":"comb :: Int -> [a] -> [([a],[a])]\ncomb 0 xs = [([],xs)]\ncomb _ [] = []\ncomb k (x:xs) = [ (x:cs,zs) | (cs,zs) <- comb (k-1) xs ] ++\n [ (cs,x:zs) | (cs,zs) <- comb k xs ]\n\npartitions :: [Int] -> [[[Int]]]\npartitions xs = p [1..sum xs] xs\n where p _ [] = [[]]\n p xs (k:ks) = [ cs:rs | (cs,zs) <- comb k xs, rs <- p zs ks ]\n\nmain = print $ partitions [2,0,2]\n","language":"Haskell"},{"code":"import Data.Bifunctor (first, second)\n\n-- choose m out of n items, return tuple of chosen and the rest\n\nchoose :: [Int] -> Int -> Int -> [([Int], [Int])]\nchoose [] _ _ = [([], [])]\nchoose aa _ 0 = [([], aa)]\nchoose aa@(a : as) n m\n | n == m = [(aa, [])]\n | otherwise =\n (first (a :) <$> choose as (n - 1) (m - 1))\n <> (second (a :) <$> choose as (n - 1) m)\n\npartitions :: [Int] -> [[[Int]]]\npartitions x = combos [1 .. n] n x\n where\n n = sum x\n combos _ _ [] = [[]]\n combos s n (x : xs) =\n [ l : r\n | (l, rest) <- choose s n x,\n r <- combos rest (n - x) xs\n ]\n\nmain :: IO ()\nmain = mapM_ print $ partitions [5, 5, 5]\n","language":"Haskell"},{"code":"require'stats'\npartitions=: ([,] {L:0 (i.@#@, -. [)&;)/\"1@>@,@{@({@comb&.> +/\\.)\n","language":"J"},{"code":" partitions 2 0 2\n┌───┬┬───┐\n│0 1││2 3│\n├───┼┼───┤\n│0 2││1 3│\n├───┼┼───┤\n│0 3││1 2│\n├───┼┼───┤\n│1 2││0 3│\n├───┼┼───┤\n│1 3││0 2│\n├───┼┼───┤\n│2 3││0 1│\n└───┴┴───┘\n partitions 1 1 1\n┌─┬─┬─┐\n│0│1│2│\n├─┼─┼─┤\n│0│2│1│\n├─┼─┼─┤\n│1│0│2│\n├─┼─┼─┤\n│1│2│0│\n├─┼─┼─┤\n│2│0│1│\n├─┼─┼─┤\n│2│1│0│\n└─┴─┴─┘\n #partitions 2 3 5\n2520\n #partitions 5 7 11\n|out of memory: partitions\n| # partitions 5 7 11\n */ (! +/\\.)5 7 11\n1070845776\n #partitions 3 5 7\n360360\n */ (! +/\\.)3 5 7\n360360\n","language":"J"},{"code":" +/\\. 2 0 2\n4 2 2\n ({@comb&.> +/\\.) 2 0 2\n┌─────────────────────────┬──┬─────┐\n│┌───┬───┬───┬───┬───┬───┐│┌┐│┌───┐│\n││0 1│0 2│0 3│1 2│1 3│2 3││││││0 1││\n│└───┴───┴───┴───┴───┴───┘│└┘│└───┘│\n└─────────────────────────┴──┴─────┘\n >@,@{@({@comb&.> +/\\.) 2 0 2\n┌───┬┬───┐\n│0 1││0 1│\n├───┼┼───┤\n│0 2││0 1│\n├───┼┼───┤\n│0 3││0 1│\n├───┼┼───┤\n│1 2││0 1│\n├───┼┼───┤\n│1 3││0 1│\n├───┼┼───┤\n│2 3││0 1│\n└───┴┴───┘\n","language":"J"},{"code":" ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1\n┌───┬───┐\n│0 1│2 3│\n└───┴───┘\n ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1;0 1\n┌───┬───┬───┐\n│0 1│2 3│4 5│\n└───┴───┴───┘\n ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1;0 1;0 1\n┌───┬───┬───┬───┐\n│0 1│2 3│4 5│6 7│\n└───┴───┴───┴───┘\n","language":"J"},{"code":" (<0 1) ([,] {L:0 (i.@#@, -. [)&;)0 1;2 3;4 5\n┌───┬───┬───┬───┐\n│0 1│2 3│4 5│6 7│\n└───┴───┴───┴───┘\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\nimport java.util.stream.Collectors;\nimport java.util.stream.IntStream;\n\npublic final class OrderedPartitions {\n\n\tpublic static void main(String[] aArgs) {\n\t\tList<Integer> sizes = ( aArgs == null || aArgs.length == 0 ) ?\n\t\t\tList.of( 2, 0, 2 ) : Arrays.stream(aArgs).map( s -> Integer.valueOf(s) ).toList();\n\t\t\n\t\tSystem.out.println(\"Partitions for \" + sizes + \":\");\n\t\tfinal int total = sizes.stream().reduce(0, Integer::sum);\n\t\tList<Integer> permutation = IntStream.rangeClosed(1, total).boxed().collect(Collectors.toList());\n\t\n\t\twhile ( hasNextPermutation(permutation) ) {\n\t List<List<Integer>> partition = new ArrayList<List<Integer>>();\n\t int sum = 0;\n\t boolean isValid = true;\n\t for ( int size : sizes ) {\n \tList<Integer> subList = permutation.subList(sum, sum + size);\n if ( ! isIncreasing(subList) ) {\n isValid = false;\n break;\n }\n partition.add(subList);\n\t sum += size;\n\t }\n\t\n\t if ( isValid ) {\n\t \tSystem.out.println(\" \".repeat(4) + partition);\n\t }\t\n\t }\n\t}\n\t\n\tprivate static boolean hasNextPermutation(List<Integer> aPerm) {\n\t final int lastIndex = aPerm.size() - 1;\n\t int i = lastIndex;\n\t while ( i > 0 && aPerm.get(i - 1) >= aPerm.get(i) ) {\n\t i--;\n\t }\n\t\n\t if ( i <= 0 ) {\n\t return false;\n\t }\n\t\n\t int j = lastIndex;\n\t while ( aPerm.get(j) <= aPerm.get(i - 1) ) {\n\t j--;\n\t }\t\n\t swap(aPerm, i - 1, j);\n\t\n\t j = lastIndex;\n\t while ( i < j ) {\n\t \tswap(aPerm, i++, j--);\n\t }\n\t\n\t return true;\n\t}\n\t\n\tprivate static boolean isIncreasing(List<Integer> aList) {\n\t return aList.stream().sorted().toList().equals(aList);\n\t}\n\t\n\tprivate static void swap(List<Integer> aList, int aOne, int aTwo) {\n\t\tfinal int temp = aList.get(aOne);\n\t aList.set(aOne, aList.get(aTwo));\n\t aList.set(aTwo, temp);\n\t}\n\n}\n","language":"Java"},{"code":"(function () {\n 'use strict';\n\n // [n] -> [[[n]]]\n function partitions(a1, a2, a3) {\n var n = a1 + a2 + a3;\n\n return combos(range(1, n), n, [a1, a2, a3]);\n }\n\n function combos(s, n, xxs) {\n if (!xxs.length) return [[]];\n\n var x = xxs[0],\n xs = xxs.slice(1);\n\n return mb( choose(s, n, x), function (l_rest) {\n return mb( combos(l_rest[1], (n - x), xs), function (r) {\n // monadic return/injection requires 1 additional\n // layer of list nesting:\n return [ [l_rest[0]].concat(r) ];\n\n })});\n }\n\n function choose(aa, n, m) {\n if (!m) return [[[], aa]];\n\n var a = aa[0],\n as = aa.slice(1);\n\n return n === m ? (\n [[aa, []]]\n ) : (\n choose(as, n - 1, m - 1).map(function (xy) {\n return [[a].concat(xy[0]), xy[1]];\n }).concat(choose(as, n - 1, m).map(function (xy) {\n return [xy[0], [a].concat(xy[1])];\n }))\n );\n }\n\n // GENERIC\n\n // Monadic bind (chain) for lists\n function mb(xs, f) {\n return [].concat.apply([], xs.map(f));\n }\n\n // [m..n]\n function range(m, n) {\n return Array.apply(null, Array(n - m + 1)).map(function (x, i) {\n return m + i;\n });\n }\n\n // EXAMPLE\n\n return partitions(2, 0, 2);\n\n})();\n","language":"JavaScript"},{"code":"[[[1, 2], [], [3, 4]],\n [[1, 3], [], [2, 4]],\n [[1, 4], [], [2, 3]],\n [[2, 3], [], [1, 4]],\n [[2, 4], [], [1, 3]],\n [[3, 4], [], [1, 2]]]\n","language":"JavaScript"},{"code":"# Generate a stream of the distinct combinations of r items taken from the input array.\ndef combination(r):\n if r > length or r < 0 then empty\n elif r == length then .\n else ( [.[0]] + (.[1:]|combination(r-1))),\n ( .[1:]|combination(r))\n end;\n\n# Input: a mask, that is, an array of lengths.\n# Output: a stream of the distinct partitions defined by the mask.\ndef partition:\n\n # partition an array of entities, s, according to a mask presented as input:\n def p(s):\n if length == 0 then []\n else . as $mask\n | (s | combination($mask[0])) as $c\n | [$c] + ($mask[1:] | p(s - $c))\n end;\n . as $mask | p( [range(1; 1 + ($mask|add))] );\n","language":"Jq"},{"code":"([],[0,0,0],[1,1,1],[2,0,2])\n | . as $test_case\n | \"partitions \\($test_case):\" , ($test_case | partition), \"\"\n","language":"Jq"},{"code":"$ jq -M -n -c -r -f Ordered_partitions.jq\n\npartitions []:\n[]\n\npartitions [0,0,0]:\n[[],[],[]]\n\npartitions [1,1,1]:\n[[1],[2],[3]]\n[[1],[3],[2]]\n[[2],[1],[3]]\n[[2],[3],[1]]\n[[3],[1],[2]]\n[[3],[2],[1]]\n\npartitions [2,0,2]:\n[[1,2],[],[3,4]]\n[[1,3],[],[2,4]]\n[[1,4],[],[2,3]]\n[[2,3],[],[1,4]]\n[[2,4],[],[1,3]]\n[[3,4],[],[1,2]]\n","language":"Jq"},{"code":"using Combinatorics\n\nfunction masked(mask, lis)\n combos = []\n idx = 1\n for step in mask\n if(step < 1)\n push!(combos, Array{Int,1}[])\n else\n push!(combos, sort(lis[idx:idx+step-1]))\n idx += step\n end\n end\n Array{Array{Int, 1}, 1}(combos)\nend\n\nfunction orderedpartitions(mask)\n tostring(masklis) = replace(\"$masklis\", r\"Array{Int\\d?\\d?,1}|Int\\d?\\d?\", \"\")\n join([tostring(lis) for lis in unique([masked(mask, p)\n for p in permutations(1:sum(mask))])], \"\\n\")\nend\n\nprintln(orderedpartitions([2, 0, 2]))\nprintln(orderedpartitions([1, 1, 1]))\n","language":"Julia"},{"code":"// version 1.1.3\n\nfun nextPerm(perm: IntArray): Boolean {\n val size = perm.size\n var k = -1\n for (i in size - 2 downTo 0) {\n if (perm[i] < perm[i + 1]) {\n k = i\n break\n }\n }\n if (k == -1) return false // last permutation\n for (l in size - 1 downTo k) {\n if (perm[k] < perm[l]) {\n val temp = perm[k]\n perm[k] = perm[l]\n perm[l] = temp\n var m = k + 1\n var n = size - 1\n while (m < n) {\n val temp2 = perm[m]\n perm[m++] = perm[n]\n perm[n--] = temp2\n }\n break\n }\n }\n return true\n}\n\nfun List<Int>.isMonotonic(): Boolean {\n for (i in 1 until this.size) {\n if (this[i] < this[i - 1]) return false\n }\n return true\n}\n\nfun main(args: Array<String>) {\n val sizes = args.map { it.toInt() }\n println(\"Partitions for $sizes:\\n[\")\n val totalSize = sizes.sum()\n val perm = IntArray(totalSize) { it + 1 }\n\n do {\n val partition = mutableListOf<List<Int>>()\n var sum = 0\n var isValid = true\n for (size in sizes) {\n if (size == 0) {\n partition.add(emptyList<Int>())\n }\n else if (size == 1) {\n partition.add(listOf(perm[sum]))\n }\n else {\n val sl = perm.slice(sum until sum + size)\n if (!sl.isMonotonic()) {\n isValid = false\n break\n }\n partition.add(sl)\n }\n sum += size\n }\n if (isValid) println(\" $partition\")\n }\n while (nextPerm(perm))\n println(\"]\")\n}\n","language":"Kotlin"},{"code":"--- Create a list {1,...,n}.\nlocal function range(n)\n local res = {}\n for i=1,n do\n res[i] = i\n end\n return res\nend\n\n--- Return true if the element x is in t.\nlocal function isin(t, x)\n for _,x_t in ipairs(t) do\n if x_t == x then return true end\n end\n return false\nend\n\n--- Return the sublist from index u to o (inclusive) from t.\nlocal function slice(t, u, o)\n local res = {}\n for i=u,o do\n res[#res+1] = t[i]\n end\n return res\nend\n\n--- Compute the sum of the elements in t.\n-- Assume that t is a list of numbers.\nlocal function sum(t)\n local s = 0\n for _,x in ipairs(t) do\n s = s + x\n end\n return s\nend\n\n--- Generate all combinations of t of length k (optional, default is #t).\nlocal function combinations(m, r)\n local function combgen(m, n)\n if n == 0 then coroutine.yield({}) end\n for i=1,#m do\n if n == 1 then coroutine.yield({m[i]})\n else\n for m0 in coroutine.wrap(function() combgen(slice(m, i+1, #m), n-1) end) do\n coroutine.yield({m[i], unpack(m0)})\n end\n end\n end\n end\n return coroutine.wrap(function() combgen(m, r) end)\nend\n\n--- Generate a list of partitions into fized-size blocks.\nlocal function partitions(...)\n local function helper(s, ...)\n local args = {...}\n if #args == 0 then return {% templatetag openvariable %}{% templatetag closevariable %} end\n local res = {}\n for c in combinations(s, args[1]) do\n local s0 = {}\n for _,x in ipairs(s) do if not isin(c, x) then s0[#s0+1] = x end end\n for _,r in ipairs(helper(s0, unpack(slice(args, 2, #args)))) do\n res[#res+1] = {{unpack(c)}, unpack(r)}\n end\n end\n return res\n end\n return helper(range(sum({...})), ...)\nend\n\n-- Print the solution\nio.write \"[\"\nlocal parts = partitions(2,0,2)\nfor i,tuple in ipairs(parts) do\n io.write \"(\"\n for j,set in ipairs(tuple) do\n io.write \"{\"\n for k,element in ipairs(set) do\n io.write(element)\n if k ~= #set then io.write(\", \") end\n end\n io.write \"}\"\n if j ~= #tuple then io.write(\", \") end\n end\n io.write \")\"\n if i ~= #parts then io.write(\", \") end\nend\nio.write \"]\"\nio.write \"\\n\"\n","language":"Lua"},{"code":"w[partitions_]:=Module[{s={},t=Total@partitions,list=partitions,k}, n=Length[list];\n While[n>0,s=Join[s,{Take[t,(k=First[list])]}];t=Drop[t,k];list=Rest[list];n--]; s]\nm[p_]:=(Sort/@#)&/@(w[#,p]&/@Permutations[Range@Total[p]])//Union\n","language":"Mathematica"},{"code":"Grid@m[{2, 0, 2}]\nGrid@m[{1, 1, 1}]\n","language":"Mathematica"},{"code":"import algorithm, math, sequtils, strutils\n\ntype Partition = seq[seq[int]]\n\n\nfunc isIncreasing(s: seq[int]): bool =\n ## Return true if the sequence is sorted in increasing order.\n var prev = 0\n for val in s:\n if prev >= val: return false\n prev = val\n result = true\n\n\niterator partitions(lengths: varargs[int]): Partition =\n ## Yield the partitions for lengths \"lengths\".\n\n # Build the list of slices to use for partitionning.\n var slices: seq[Slice[int]]\n var delta = -1\n var idx = 0\n for length in lengths:\n assert length >= 0, \"lengths must not be negative.\"\n inc delta, length\n slices.add idx..delta\n inc idx, length\n\n # Build the partitions.\n let n = sum(lengths)\n var perm = toSeq(1..n)\n while true:\n\n block buildPartition:\n var part: Partition\n for slice in slices:\n let s = perm[slice]\n if not s.isIncreasing():\n break buildPartition\n part.add s\n yield part\n\n if not perm.nextPermutation():\n break\n\n\nfunc toString(part: Partition): string =\n ## Return the string representation of a partition.\n result = \"(\"\n for s in part:\n result.addSep(\", \", 1)\n result.add '{' & s.join(\", \") & '}'\n result.add ')'\n\n\nwhen isMainModule:\n\n import os\n\n proc displayPermutations(lengths: varargs[int]) =\n ## Display the permutations.\n echo \"Ordered permutations for (\", lengths.join(\", \"), \"):\"\n for part in partitions(lengths):\n echo part.toString\n\n if paramCount() > 0:\n var args: seq[int]\n for param in commandLineParams():\n try:\n let val = param.parseInt()\n if val < 0: raise newException(ValueError, \"\")\n args.add val\n except ValueError:\n quit \"Wrong parameter: \" & param\n displayPermutations(args)\n\n else:\n displayPermutations(2, 0, 2)\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse Thread 'async';\nuse Thread::Queue;\n\nsub make_slices {\n my ($n, @avail) = (shift, @{ +shift });\n\n my ($q, @part, $gen);\n $gen = sub {\n my $pos = shift; # where to start in the list\n if (@part == $n) {\n # we accumulated enough for a partition, emit them and\n # wait for main thread to pick them up, then back up\n $q->enqueue(\\@part, \\@avail);\n return;\n }\n\n # obviously not enough elements left to make a partition, back up\n return if (@part + @avail < $n);\n\n for my $i ($pos .. @avail - 1) { # try each in turn\n push @part, splice @avail, $i, 1; # take one\n $gen->($i); # go deeper\n splice @avail, $i, 0, pop @part; # put it back\n }\n };\n\n $q = Thread::Queue->new;\n (async{ &$gen; # start the main work load\n $q->enqueue(undef) # signal that there's no more data\n })->detach; # let the thread clean up after itself, not my problem\n\n return $q;\n}\n\nmy $qa = make_slices(4, [ 0 .. 9 ]);\nwhile (my $a = $qa->dequeue) {\n my $qb = make_slices(2, $qa->dequeue);\n\n while (my $b = $qb->dequeue) {\n my $rb = $qb->dequeue;\n print \"@$a | @$b | @$rb\\n\";\n }\n}\n","language":"Perl"},{"code":"use strict;\nuse warnings;\nuse List::Util 1.33 qw(sum pairmap);\n\nsub partition {\n my @mask = @_;\n my $last = sum @mask or return [map {[]} 0..$#mask];\n\n return pairmap {\n $b ? do {\n local $mask[$a] = $b - 1;\n map { push @{$_->[$a]}, $last; $_ }\n partition(@mask);\n } : ()\n } %mask[0..$#mask];\n}\n\n# Input & Output handling:\n\nprint \"(\" . join(', ', map { \"{\".join(', ', @$_).\"}\" } @$_) . \")\\n\"\n for partition( @ARGV ? @ARGV : (2, 0, 2) );\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">partitions</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">N</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pset</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000080;font-style:italic;\">-- eg s==={2,0,2} -> {1,1,3,3}</span>\n <span style=\"color: #000000;\">rn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- \"\" -> <nowiki>{{</nowiki>0,0},{},{0,0<nowiki>}}</nowiki></span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">pset</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #000000;\">rn</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pset</span><span style=\"color: #0000FF;\">={}</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">rn</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span> <span style=\"color: #000080;font-style:italic;\">-- edge case</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">permutes</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pset</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- eg {1,1,3,3} means put 1,2 in [1], 3,4 in [3]\n -- .. {3,3,1,1} means put 1,2 in [3], 3,4 in [1]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000080;font-style:italic;\">-- a \"flat\" permute</span>\n <span style=\"color: #000000;\">rdii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- where per set</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000080;font-style:italic;\">-- which set</span>\n <span style=\"color: #000000;\">rnx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rdii</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">rdx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #000080;font-style:italic;\">-- wherein\"\"</span>\n <span style=\"color: #000000;\">rii</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">rn</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">rdx</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">rnx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rii</span> <span style=\"color: #000080;font-style:italic;\">-- plant 1..N</span>\n <span style=\"color: #000000;\">rdii</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">rdx</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rnx</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rii</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">N</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">partitions</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">ia</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">?{</span><span style=\"color: #008000;\">\"is\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">}:{</span><span style=\"color: #008000;\">\"are\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"s\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"There %s %,d ordered partion%s for %v:\\n{%s}\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">ia</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">shorten</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%v\"</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n \"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #7060A8;\">papply</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">},{},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}},</span><span style=\"color: #000000;\">test</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(de partitions (Args)\n (let Lst (range 1 (apply + Args))\n (recur (Args Lst)\n (ifn Args\n '(NIL)\n (mapcan\n '((L)\n (mapcar\n '((R) (cons L R))\n (recurse (cdr Args) (diff Lst L)) ) )\n (comb (car Args) Lst) ) ) ) ) )\n","language":"PicoLisp"},{"code":"from itertools import combinations\n\ndef partitions(*args):\n def p(s, *args):\n if not args: return [[]]\n res = []\n for c in combinations(s, args[0]):\n s0 = [x for x in s if x not in c]\n for r in p(s0, *args[1:]):\n res.append([c] + r)\n return res\n s = range(sum(args))\n return p(s, *args)\n\nprint partitions(2, 0, 2)\n","language":"Python"},{"code":"from itertools import combinations as comb\n\ndef partitions(*args):\n def minus(s1, s2): return [x for x in s1 if x not in s2]\n def p(s, *args):\n if not args: return [[]]\n return [[c] + r for c in comb(s, args[0]) for r in p(minus(s, c), *args[1:])]\n return p(range(1, sum(args) + 1), *args)\n\nprint partitions(2, 0, 2)\n","language":"Python"},{"code":"'''Ordered Partitions'''\n\n\n# partitions :: [Int] -> [[[Int]]]\ndef partitions(xs):\n '''Ordered partitions of xs.'''\n n = sum(xs)\n\n def go(s, n, ys):\n return [\n [l] + r\n for (l, rest) in choose(s)(n)(ys[0])\n for r in go(rest, n - ys[0], ys[1:])\n ] if ys else [[]]\n return go(enumFromTo(1)(n), n, xs)\n\n\n# choose :: [Int] -> Int -> Int -> [([Int], [Int])]\ndef choose(xs):\n '''(m items chosen from n items, the rest)'''\n def go(xs, n, m):\n f = cons(xs[0])\n choice = choose(xs[1:])(n - 1)\n return [([], xs)] if 0 == m else (\n [(xs, [])] if n == m else (\n [first(f)(x) for x in choice(m - 1)] +\n [second(f)(x) for x in choice(m)]\n )\n )\n return lambda n: lambda m: go(xs, n, m)\n\n\n# TEST ----------------------------------------------------\n# main :: IO ()\ndef main():\n '''Tests of the partitions function'''\n\n f = partitions\n print(\n fTable(main.__doc__ + ':')(\n lambda x: '\\n' + f.__name__ + '(' + repr(x) + ')'\n )(\n lambda ps: '\\n\\n' + '\\n'.join(\n ' ' + repr(p) for p in ps\n )\n )(f)([\n [2, 0, 2],\n [1, 1, 1]\n ])\n )\n\n\n# DISPLAY -------------------------------------------------\n\n# fTable :: 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# GENERIC -------------------------------------------------\n\n# cons :: a -> [a] -> [a]\ndef cons(x):\n '''Construction of a list from x as head,\n and xs as tail.\n '''\n return lambda xs: [x] + xs\n\n\n# enumFromTo :: (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# first :: (a -> b) -> ((a, c) -> (b, c))\ndef first(f):\n '''A simple function lifted to a function over a tuple,\n with f applied only the first of two values.\n '''\n return lambda xy: (f(xy[0]), xy[1])\n\n\n# second :: (a -> b) -> ((c, a) -> (c, b))\ndef second(f):\n '''A simple function lifted to a function over a tuple,\n with f applied only the second of two values.\n '''\n return lambda xy: (xy[0], f(xy[1]))\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"#lang racket\n(define (comb k xs)\n (cond [(zero? k) (list (cons '() xs))]\n [(null? xs) '()]\n [else (append (for/list ([cszs (comb (sub1 k) (cdr xs))])\n (cons (cons (car xs) (car cszs)) (cdr cszs)))\n (for/list ([cszs (comb k (cdr xs))])\n (cons (car cszs) (cons (car xs) (cdr cszs)))))]))\n(define (partitions xs)\n (define (p xs ks)\n (if (null? ks)\n '(())\n (for*/list ([cszs (comb (car ks) xs)] [rs (p (cdr cszs) (cdr ks))])\n (cons (car cszs) rs))))\n (p (range 1 (add1 (foldl + 0 xs))) xs))\n\n(define (run . xs)\n (printf \"partitions~s:\\n\" xs)\n (for ([x (partitions xs)]) (printf \" ~s\\n\" x))\n (newline))\n\n(run 2 0 2)\n(run 1 1 1)\n","language":"Racket"},{"code":"sub partition(@mask is copy) {\n my @op;\n my $last = [+] @mask or return [] xx 1;\n for @mask.kv -> $k, $v {\n next unless $v;\n temp @mask[$k] -= 1;\n for partition @mask -> @p {\n @p[$k].push: $last;\n @op.push: @p;\n }\n }\n return @op;\n}\n\n.say for reverse partition [2,0,2];\n","language":"Raku"},{"code":"//*REXX program displays the ordered partitions as: orderedPartitions(i, j, k, ···). */\ncall orderedPartitions 2,0,2 /*Note: 2,,2 will also work. */\ncall orderedPartitions 1,1,1\ncall orderedPartitions 1,2,0,1 /*Note: 1,2,,1 will also work. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\norderedPartitions: procedure; #=arg(); bot.=; top.=; low=; high=; d=123456789\nt=0 /*T: is the sum of all the arguments.*/\n do i=1 for #; t=t + arg(i) /*sum all the highest numbers in parts.*/\n end /*i*/ /* [↑] may have an omitted argument. */\nhdr= ' partitions for: ' /*define the start of the header text. */\n do j=1 for #; _= arg(j) /* _: is the Jth argument. */\n len.j=max(1, _) /*LEN: length of args. «0 is special»*/\n bot.j=left(d, _); if _==0 then bot.j=0 /*define the bottom number for range.*/\n top.j=right(left(d,t),_); if _==0 then top.j=0 /* \" \" top \" \" \" */\n @.j=left(d, t); if _==0 then @.j=0 /*define the digits used for VERIFY. */\n hdr=hdr _ /*build (by appending) display header.*/\n low=low || bot.j; high=high || top.j /*the low and high numbers for DO below*/\n end /*j*/\n /* [↓] same as: okD=left('0'd, t+1) */\n /*define the legal digits to be used. */\nokD=left(0 || d, t + 1) /*define the legal digits to be used. */\nsay; hdr=center(hdr\" \", 60, '═'); say hdr /*display centered title for the output*/\nsay /*show a blank line (as a separator). */\n do g=low to high /* [↑] generate the ordered partitions*/\n if verify(g, okD) \\==0 then iterate /*filter out unwanted partitions (digs)*/\n p=1 /*P: is the position of a decimal dig.*/\n $= /*$: will be the transformed numbers. */\n do k=1 for #; _=substr(g, p, len.k) /*verify the partitions numbers. */\n if verify(_, @.k) \\==0 then iterate g /*is the decimal digit not valid ? */\n != /* [↓] validate the decimal number. */\n if @.k\\==0 then do j=1 for length(_); z=substr(_, j, 1) /*get a dig.*/\n if pos(z, $)\\==0 then iterate g /*previous ?*/\n !=!','z /*add comma.*/\n if j==1 then iterate /*is firstt?*/\n if z<=substr(_, j-1, 1) then iterate g /*ordered ?*/\n if pos(z, _, 1 +pos(z, _))\\==0 then iterate g /*duplicate?*/\n end /*j*/\n p=p + len.k /*point to the next decimal digit (num)*/\n $=$ ' {'strip(translate(!, ,0), ,\",\")'}' /*dress number up by suppessing LZ ··· */\n end /*k*/\n say center($, length(hdr) ) /*display numbers in ordered partition.*/\n end /*g*/\nreturn\n","language":"REXX"},{"code":"def partition(mask)\n return [[]] if mask.empty?\n [*1..mask.inject(:+)].permutation.map {|perm|\n mask.map {|num_elts| perm.shift(num_elts).sort }\n }.uniq\nend\n","language":"Ruby"},{"code":"def part(s, args)\n return [[]] if args.empty?\n s.combination(args[0]).each_with_object([]) do |c, res|\n part(s - c, args[1..-1]).each{|r| res << ([c] + r)}\n end\nend\ndef partitions(args)\n return [[]] if args.empty?\n part((1..args.inject(:+)).to_a, args)\nend\n","language":"Ruby"},{"code":"[[],[0,0,0],[1,1,1],[2,0,2]].each do |test_case|\n puts \"partitions #{test_case}:\"\n partition(test_case).each{|part| p part }\n puts\nend\n","language":"Ruby"},{"code":"use itertools::Itertools;\n\ntype NArray = Vec<Vec<Vec<usize>>>;\n\nfn generate_partitions(args: &[usize]) -> NArray {\n // calculate the sum of all partitions\n let max = args.iter().sum();\n\n // generate combinations with the given lengths\n // for each partition\n let c = args.iter().fold(vec![], |mut acc, arg| {\n acc.push((1..=max).combinations(*arg).collect::<Vec<_>>());\n acc\n });\n\n // create a cartesian product of all individual combinations\n // filter/keep only where all the elements are there and exactly once\n c.iter()\n .map(|i| i.iter().cloned())\n .multi_cartesian_product()\n .unique()\n .filter(|x| x.iter().cloned().flatten().unique().count() == max)\n .collect::<Vec<_>>()\n}\n\n#[allow(clippy::clippy::ptr_arg)]\nfn print_partitions(result: &NArray) {\n println!(\"Partitions:\");\n for partition in result {\n println!(\"{:?}\", partition);\n }\n}\nfn main() {\n print_partitions(generate_partitions(&[2, 0, 2]).as_ref());\n print_partitions(generate_partitions(&[1, 1, 1]).as_ref());\n print_partitions(generate_partitions(&[2, 3]).as_ref());\n print_partitions(generate_partitions(&[0]).as_ref());\n}\n","language":"Rust"},{"code":"func part(_, {.is_empty}) { [[]] }\nfunc partitions({.is_empty}) { [[]] }\n\nfunc part(s, args) {\n gather {\n s.combinations(args[0], { |*c|\n part(s - c, args.slice(1)).each{|r| take([c] + r) }\n })\n }\n}\n\nfunc partitions(args) {\n part(@(1..args.sum), args)\n}\n\n[[],[0,0,0],[1,1,1],[2,0,2]].each { |test_case|\n say \"partitions #{test_case}:\"\n partitions(test_case).each{|part| say part }\n print \"\\n\"\n}\n","language":"Sidef"},{"code":"package require Tcl 8.5\npackage require struct::set\n\n# Selects all k-sized combinations from a list.\n# \"Borrowed\" from elsewhere on RC\nproc selectCombinationsFrom {k l} {\n if {$k == 0} {return {}} elseif {$k == [llength $l]} {return [list $l]}\n set all {}\n set n [expr {[llength $l] - [incr k -1]}]\n for {set i 0} {$i < $n} {} {\n set first [lindex $l $i]\n\tincr i\n if {$k == 0} {\n lappend all $first\n\t} else {\n\t foreach s [selectCombinationsFrom $k [lrange $l $i end]] {\n\t\tlappend all [list $first {*}$s]\n\t }\n }\n }\n return $all\n}\n\n# Construct the partitioning of a given list\nproc buildPartitions {lst n args} {\n # Base case when we have no further partitions to process\n if {[llength $args] == 0} {\n\treturn [list [list $lst]]\n }\n set result {}\n set c [selectCombinationsFrom $n $lst]\n if {[llength $c] == 0} {set c [list $c]}\n foreach comb $c {\n\t# Sort necessary for \"nice\" order\n\tset rest [lsort -integer [struct::set difference $lst $comb]]\n\tforeach p [buildPartitions $rest {*}$args] {\n\t lappend result [list $comb {*}$p]\n\t}\n }\n return $result\n}\n\n# Wrapper that assembles the initial list and calls the partitioner\nproc partitions args {\n set sum [tcl::mathop::+ {*}$args]\n set startingSet {}\n for {set i 1} {$i <= $sum} {incr i} {\n\tlappend startingSet $i\n }\n\n return [buildPartitions $startingSet {*}$args]\n}\n","language":"Tcl"},{"code":"puts [partitions 1 1 1]\nputs [partitions 2 2]\nputs [partitions 2 0 2]\nputs [partitions 2 2 0]\n","language":"Tcl"},{"code":"#import std\n#import nat\n\nopart =\n\n-+\n ~&art^?\\~&alNCNC ^|JalSPfarSPMplrDSL/~& ^DrlPrrPlXXS/~&rt ^DrlrjXS/~&l choices@lrhPX,\n ^\\~& nrange/1+ sum:-0+-\n","language":"Ursala"},{"code":"#cast %nLLL\n\ntest = opart <2,0,2>\n","language":"Ursala"},{"code":"import \"os\" for Process\n\nvar genPart // recursive so predeclare\ngenPart = Fn.new { |n, res, pos|\n if (pos == res.count) {\n var x = List.filled(n.count, null)\n for (i in 0...x.count) x[i] = []\n var i = 0\n for (c in res) {\n x[c].add(i+1)\n i = i + 1\n }\n System.print(x)\n return\n }\n for (i in 0...n.count) {\n if (n[i] != 0) {\n n[i] = n[i] - 1\n res[pos] = i\n genPart.call(n, res, pos+1)\n n[i] = n[i] + 1\n }\n }\n}\n\nvar orderedPart = Fn.new { |nParts|\n System.print(\"Ordered %(nParts)\")\n var sum = 0\n for (c in nParts) sum = sum + c\n genPart.call(nParts, List.filled(sum, 0), 0)\n}\n\nvar args = Process.arguments\nif (args.count == 0) {\n orderedPart.call([2, 0, 2])\n return\n}\nvar n = List.filled(args.count, 0)\nvar i = 0\nfor (a in args) {\n n[i] = Num.fromString(a)\n if (n[i] < 0) {\n System.print(\"negative partition size not meaningful\")\n return\n }\n i = i + 1\n}\norderedPart.call(n)\n","language":"Wren"},{"code":"fcn partitions(args){\n args=vm.arglist;\n s:=(1).pump(args.sum(0),List); // (1,2,3,...)\n fcn(s,args,p){\n if(not args) return(T(T));\n res:=List();\n foreach c in (Utils.Helpers.pickNFrom(args[0],s)){\n\t s0:=s.copy().removeEach(c);\n\t foreach r in (self.fcn(s0,args[1,*])){ res.append(T(c).extend(r)) }\n }\n res\n }(s,args)\n}\n","language":"Zkl"},{"code":"args:=vm.arglist.apply(\"toInt\"); // aka argv[1..]\nif(not args) args=T(2,0,2);\npartitions(args.xplode()).pump(Console.println,Void);\n// or: foreach p in (partitions(1,1,1)){ println(p) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ordered_partitions\\nnote: Discrete math\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"In this task we want to find the ordered partitions into fixed-size blocks. \\n\\nThis task is related to [[Combinations]] in that it has to do with discrete mathematics and moreover a helper function to compute combinations is (probably) needed to solve this task.\\n\\n<math>partitions(\\\\mathit{arg}_1,\\\\mathit{arg}_2,...,\\\\mathit{arg}_n)</math> should generate all distributions of the elements in <math>\\\\{1,...,\\\\Sigma_{i=1}^n\\\\mathit{arg}_i\\\\}</math> into <math>n</math> blocks of respective size <math>\\\\mathit{arg}_1,\\\\mathit{arg}_2,...,\\\\mathit{arg}_n</math>.\\n\\nExample 1: <math>partitions(2,0,2)</math> would create:\\n\\n<pre>\\n{({1, 2}, {}, {3, 4}), \\n ({1, 3}, {}, {2, 4}), \\n ({1, 4}, {}, {2, 3}), \\n ({2, 3}, {}, {1, 4}), \\n ({2, 4}, {}, {1, 3}), \\n ({3, 4}, {}, {1, 2})}\\n</pre>\\n\\nExample 2: <math>partitions(1,1,1)</math> would create:\\n\\n<pre>\\n{({1}, {2}, {3}), \\n ({1}, {3}, {2}), \\n ({2}, {1}, {3}), \\n ({2}, {3}, {1}), \\n ({3}, {1}, {2}), \\n ({3}, {2}, {1})}\\n</pre>\\n\\nNote that the number of elements in the list is \\n:<math>{\\\\mathit{arg}_1+\\\\mathit{arg}_2+...+\\\\mathit{arg}_n \\\\choose \\\\mathit{arg}_1} \\\\cdot {\\\\mathit{arg}_2+\\\\mathit{arg}_3+...+\\\\mathit{arg}_n \\\\choose \\\\mathit{arg}_2} \\\\cdot \\\\ldots \\\\cdot {\\\\mathit{arg}_n \\\\choose \\\\mathit{arg}_n}</math>\\n(see [http://en.wikipedia.org/wiki/Binomial_coefficient the definition of the binomial coefficient] if you are not familiar with this notation) and the number of elements remains the same regardless of how the argument is permuted\\n(i.e. the [http://en.wikipedia.org/wiki/Multinomial_coefficient multinomial coefficient]). \\n\\nAlso, <math>partitions(1,1,1)</math> creates the permutations of <math>\\\\{1,2,3\\\\}</math> and thus there would be <math>3! = 6</math> elements in the list.\\n\\nNote: Do not use functions that are not in the standard library of the programming language you use. Your file should be written so that it can be executed on the command line and by default outputs the result of <math>partitions(2,0,2)</math>. If the programming language does not support polyvariadic functions pass a list as an argument.\\n\\n'''Notation'''\\n\\nHere are some explanatory remarks on the notation used in the task description:\\n\\n<math>\\\\{1, \\\\ldots, n\\\\}</math> denotes the set of consecutive numbers from <math>1</math> to <math>n</math>, e.g. <math>\\\\{1,2,3\\\\}</math> if <math>n = 3</math>.\\n\\n<math>\\\\Sigma</math> is the mathematical notation for summation, e.g. <math>\\\\Sigma_{i=1}^3 i = 6</math> (see also [http://en.wikipedia.org/wiki/Summation#Capital-sigma_notation]). \\n\\n<math>\\\\mathit{arg}_1,\\\\mathit{arg}_2,...,\\\\mathit{arg}_n</math> are the arguments — natural numbers — that the sought function receives.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F partitions(lengths)\\n [[[Int]]] r\\n [(Int, Int)] slices\\n V delta = -1\\n V idx = 0\\n L(length) lengths\\n assert(length >= 0, ‘lengths must not be negative.’)\\n delta += length\\n slices.append((idx, delta))\\n idx += length\\n\\n V n = sum(lengths)\\n V perm = Array(1 .. n)\\n\\n L\\n [[Int]] part\\n L(start, end) slices\\n V s = perm[start .. end]\\n I !s.is_sorted()\\n L.break\\n part.append(s)\\n L.was_no_break\\n r.append(part)\\n\\n I !perm.next_permutation()\\n L.break\\n\\n R r\\n\\nF toString(part)\\n V result = ‘(’\\n L(s) part\\n I result.len > 1\\n result ‘’= ‘, ’\\n result ‘’= ‘{’s.join(‘, ’)‘}’\\n R result‘)’\\n\\nF displayPermutations(lengths)\\n print(‘Ordered permutations for (’lengths.join(‘, ’)‘):’)\\n L(part) partitions(lengths)\\n print(toString(part))\\n\\n:start:\\nI :argv.len > 1\\n displayPermutations(:argv[1..].map(Int))\\nE\\n displayPermutations([2, 0, 2])\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Containers.Indefinite_Ordered_Sets;\\nwith Ada.Containers.Ordered_Sets;\\npackage Partitions is\\n -- Argument type for Create_Partitions: Array of Numbers\\n type Arguments is array (Positive range <>) of Natural;\\n package Number_Sets is new Ada.Containers.Ordered_Sets\\n (Natural);\\n type Partition is array (Positive range <>) of Number_Sets.Set;\\n function \\\"<\\\" (Left, Right : Partition) return Boolean;\\n package Partition_Sets is new Ada.Containers.Indefinite_Ordered_Sets\\n (Partition);\\n function Create_Partitions (Args : Arguments) return Partition_Sets.Set;\\nend Partitions;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Partitions is\\n -- compare number sets (not provided)\\n function \\\"<\\\" (Left, Right : Number_Sets.Set) return Boolean is\\n use type Ada.Containers.Count_Type;\\n use Number_Sets;\\n Left_Pos : Cursor := Left.First;\\n Right_Pos : Cursor := Right.First;\\n begin\\n -- compare each element, until one or both lists finishes\\n while Left_Pos /= No_Element and then Right_Pos /= No_Element loop\\n -- compare elements\\n if Element (Left_Pos) < Element (Right_Pos) then\\n return True;\\n elsif Element (Left_Pos) > Element (Right_Pos) then\\n return False;\\n end if;\\n -- increase iterator\\n Next (Left_Pos);\\n Next (Right_Pos);\\n end loop;\\n -- Right is longer\\n if Right_Pos /= No_Element then\\n return True;\\n else\\n -- Left is longer, or Left and Right are identical.\\n return False;\\n end if;\\n end \\\"<\\\";\\n -- compare two Partitions\\n function \\\"<\\\" (Left, Right : Partition) return Boolean is\\n use type Ada.Containers.Count_Type;\\n use type Number_Sets.Set;\\n begin\\n -- check length\\n if Left'Length < Right'Length then\\n return True;\\n elsif Left'Length > Right'Length then\\n return False;\\n end if;\\n -- same length\\n if Left'Length > 0 then\\n for I in Left'Range loop\\n if Left (I) < Right (I) then\\n return True;\\n elsif Left (I) /= Right (I) then\\n return False;\\n end if;\\n end loop;\\n end if;\\n -- length = 0 are always smallest\\n return False;\\n end \\\"<\\\";\\n -- create partitions (as the task describes)\\n function Create_Partitions (Args : Arguments) return Partition_Sets.Set is\\n -- permutations needed\\n type Permutation is array (Positive range <>) of Natural;\\n -- exception to be thrown after last permutation reached\\n No_More_Permutations : exception;\\n -- get initial permutation (ordered small->big)\\n function Initial_Permutation (Max : Natural) return Permutation is\\n Result : Permutation (1 .. Max);\\n begin\\n for I in 1 .. Max loop\\n Result (I) := I;\\n end loop;\\n return Result;\\n end Initial_Permutation;\\n -- get next permutation\\n function Next_Permutation (Current : Permutation) return Permutation is\\n K : Natural := Current'Last - 1;\\n L : Positive := Current'Last;\\n Result : Permutation := Current;\\n begin\\n -- 1. Find the largest index k such that a[k] < a[k + 1].\\n while K /= 0 and then Current (K) > Current (K + 1) loop\\n K := K - 1;\\n end loop;\\n -- If no such index exists, the permutation is the last permutation.\\n if K = 0 then\\n raise No_More_Permutations;\\n end if;\\n -- 2. Find the largest index l such that a[k] < a[l].\\n -- Since k + 1 is such an index, l is well defined\\n -- and satisfies k < l.\\n while Current (K) > Current (L) loop\\n L := L - 1;\\n end loop;\\n -- 3. Swap a[k] with a[l].\\n Result (K) := Current (L);\\n Result (L) := Current (K);\\n -- 4. Reverse the sequence from a[k + 1] up to and including the\\n -- final element a[n].\\n for I in 1 .. (Result'Last - K) / 2 loop\\n declare\\n Temp : constant Natural := Result (K + I);\\n begin\\n Result (K + I) := Result (Result'Last - I + 1);\\n Result (Result'Last - I + 1) := Temp;\\n end;\\n end loop;\\n return Result;\\n end Next_Permutation;\\n Result : Partition_Sets.Set;\\n Sum : Natural := 0;\\n begin\\n -- get number of elements\\n for I in Args'Range loop\\n Sum := Sum + Args (I);\\n end loop;\\n declare\\n -- initial permutation\\n Current_Permutation : Permutation := Initial_Permutation (Sum);\\n begin\\n -- loop through permutations\\n loop\\n -- create Partition (same count of Number_Sets.Set as Args)\\n declare\\n Item : Natural := Current_Permutation'First;\\n Current_Partition : Partition (Args'Range);\\n begin\\n -- loop each partition\\n for I in Args'Range loop\\n -- fill in the number of elements requested\\n for J in 1 .. Args (I) loop\\n Current_Partition (I).Insert\\n (New_Item => Current_Permutation (Item));\\n Item := Item + 1;\\n end loop;\\n end loop;\\n -- insert partition into result set\\n Result.Insert (New_Item => Current_Partition);\\n exception\\n when Constraint_Error =>\\n -- partition was already inserted, ignore it.\\n -- this happens when one of the args > 1.\\n null;\\n end;\\n -- create next permutation\\n Current_Permutation := Next_Permutation (Current_Permutation);\\n end loop;\\n exception\\n when No_More_Permutations =>\\n -- no more permutations, we are finished\\n null;\\n end;\\n return Result;\\n end Create_Partitions;\\nend Partitions;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Partitions;\\nprocedure Main is\\n package Natural_IO is new Ada.Text_IO.Integer_IO (Natural);\\n Example_Partitions : Partitions.Partition_Sets.Set;\\nbegin\\n Ada.Text_IO.Put_Line (\\\"Partitions for (2, 0, 2):\\\");\\n -- create partition\\n Example_Partitions := Partitions.Create_Partitions (Args => (2, 0, 2));\\n -- pretty print the result\\n declare\\n use type Partitions.Partition_Sets.Cursor;\\n Position : Partitions.Partition_Sets.Cursor := Example_Partitions.First;\\n begin\\n Ada.Text_IO.Put ('{');\\n while Position /= Partitions.Partition_Sets.No_Element loop\\n if Position /= Example_Partitions.First then\\n Ada.Text_IO.Put (' ');\\n end if;\\n declare\\n Current_Partition : constant Partitions.Partition :=\\n Partitions.Partition_Sets.Element (Position);\\n begin\\n Ada.Text_IO.Put ('(');\\n for I in Current_Partition'Range loop\\n Ada.Text_IO.Put ('{');\\n declare\\n use type Partitions.Number_Sets.Cursor;\\n Current_Number : Partitions.Number_Sets.Cursor :=\\n Current_Partition (I).First;\\n begin\\n while Current_Number /= Partitions.Number_Sets.No_Element\\n loop\\n Natural_IO.Put\\n (Item =>\\n Partitions.Number_Sets.Element (Current_Number),\\n Width => 1);\\n Partitions.Number_Sets.Next (Current_Number);\\n if Current_Number /=\\n Partitions.Number_Sets.No_Element then\\n Ada.Text_IO.Put (',');\\n end if;\\n end loop;\\n end;\\n Ada.Text_IO.Put ('}');\\n if I /= Current_Partition'Last then\\n Ada.Text_IO.Put (\\\", \\\");\\n end if;\\n end loop;\\n end;\\n Ada.Text_IO.Put (')');\\n Partitions.Partition_Sets.Next (Position);\\n if Position /= Partitions.Partition_Sets.No_Element then\\n Ada.Text_IO.Put (',');\\n Ada.Text_IO.New_Line;\\n end if;\\n end loop;\\n Ada.Text_IO.Put ('}');\\n Ada.Text_IO.New_Line;\\n end;\\nend Main;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \" DIM list1%(2) : list1%() = 2, 0, 2\\n PRINT \\\"partitions(2,0,2):\\\"\\n PRINT FNpartitions(list1%())\\n DIM list2%(2) : list2%() = 1, 1, 1\\n PRINT \\\"partitions(1,1,1):\\\"\\n PRINT FNpartitions(list2%())\\n DIM list3%(3) : list3%() = 1, 2, 0, 1\\n PRINT \\\"partitions(1,2,0,1):\\\"\\n PRINT FNpartitions(list3%())\\n END\\n\\n DEF FNpartitions(list%())\\n LOCAL i%, j%, n%, p%, o$, x%()\\n n% = DIM(list%(),1)\\n DIM x%(SUM(list%())-1)\\n FOR i% = 0 TO n%\\n IF list%(i%) THEN\\n FOR j% = 1 TO list%(i%)\\n x%(p%) = i%\\n p% += 1\\n NEXT\\n ENDIF\\n NEXT i%\\n REPEAT\\n FOR i% = 0 TO n%\\n o$ += \\\" ( \\\"\\n FOR j% = 0 TO DIM(x%(),1)\\n IF x%(j%) = i% o$ += STR$(j%+1) + \\\" \\\"\\n NEXT\\n o$ += \\\")\\\"\\n NEXT i%\\n o$ += CHR$13 + CHR$10\\n UNTIL NOT FNperm(x%())\\n = o$\\n\\n DEF FNperm(x%())\\n LOCAL i%, j%\\n FOR i% = DIM(x%(),1)-1 TO 0 STEP -1\\n IF x%(i%) < x%(i%+1) EXIT FOR\\n NEXT\\n IF i% < 0 THEN = FALSE\\n j% = DIM(x%(),1)\\n WHILE x%(j%) <= x%(i%) j% -= 1 : ENDWHILE\\n SWAP x%(i%), x%(j%)\\n i% += 1\\n j% = DIM(x%(),1)\\n WHILE i% < j%\\n SWAP x%(i%), x%(j%)\\n i% += 1\\n j% -= 1\\n ENDWHILE\\n = TRUE\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint next_perm(int size, int * nums)\\n{\\n int *l, *k, tmp;\\n\\n for (k = nums + size - 2; k >= nums && k[0] >= k[1]; k--) {};\\n if (k < nums) return 0;\\n\\n for (l = nums + size - 1; *l <= *k; l--) {};\\n tmp = *k; *k = *l; *l = tmp;\\n\\n for (l = nums + size - 1, k++; k < l; k++, l--) {\\n tmp = *k; *k = *l; *l = tmp;\\n }\\n\\n return 1;\\n}\\n\\nvoid make_part(int n, int * sizes)\\n{\\n int x[1024], i, j, *ptr, len = 0;\\n\\n for (ptr = x, i = 0; i < n; i++)\\n for (j = 0, len += sizes[i]; j < sizes[i]; j++, *(ptr++) = i);\\n\\n do {\\n for (i = 0; i < n; i++) {\\n printf(\\\" { \\\");\\n for (j = 0; j < len; j++)\\n if (x[j] == i) printf(\\\"%d \\\", j);\\n\\n printf(\\\"}\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n } while (next_perm(len, x));\\n}\\n\\nint main()\\n{\\n int s1[] = {2, 0, 2};\\n int s2[] = {1, 2, 3, 4};\\n\\n printf(\\\"Part 2 0 2:\\\\n\\\");\\n make_part(3, s1);\\n\\n printf(\\\"\\\\nPart 1 2 3 4:\\\\n\\\");\\n make_part(4, s2);\\n\\n return 1;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\ntypedef unsigned int uint;\\n\\nint parts[] = {2, 1, 2};\\n#define n_parts sizeof(parts)/sizeof(parts[0])\\nint bits[n_parts];\\n\\nvoid show_part(uint x)\\n{\\n\\tuint i;\\n\\tputchar('{');\\n\\tfor (i = 0; (1 << i) <= x; i ++)\\n\\t\\tif (x & (1 << i)) printf(\\\" %d\\\", i + 1);\\n\\n\\tprintf(\\\"%s\\\", \\\" } \\\");\\n}\\n\\nvoid gen_bits(uint mask, uint all, uint res, int n, int pid)\\n{\\n\\tuint i;\\n\\twhile (!n) {\\n\\t\\tbits[pid++] = res;\\n\\t\\tif (pid == n_parts) {\\n\\t\\t\\tfor (i = 0; i < n_parts; i++)\\n\\t\\t\\t\\tshow_part(bits[i]);\\n\\t\\t\\tputchar('\\\\n');\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tmask = all &= ~res;\\n\\t\\tres = 0;\\n\\t\\tn = parts[pid];\\n\\t}\\n\\n\\twhile (mask) {\\n\\t\\tmask &= ~(i = mask & -(int)mask);\\n\\t\\tgen_bits(mask, all, res | i, n - 1, pid);\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tuint i, m;\\n\\tfor (m = 1, i = 0; i < n_parts; i++)\\n\\t\\tm <<= parts[i];\\n\\tm--;\\n\\n\\tgen_bits(m, m, 0, parts[0], 0);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <numeric>\\n\\nvoid partitions(std::vector<size_t> args) {\\n size_t sum = std::accumulate(std::begin(args), std::end(args), 0);\\n std::vector<size_t> nums(sum);\\n std::iota(std::begin(nums), std::end(nums), 1);\\n do {\\n size_t total_index = 0;\\n std::vector<std::vector<size_t>> parts;\\n for (const auto& a : args) {\\n std::vector<size_t> part;\\n bool cont = true;\\n for (size_t j = 0; j < a; ++j) {\\n for (const auto& p : part) {\\n if (nums[total_index] < p) {\\n cont = false;\\n break;\\n }\\n }\\n if (cont) {\\n part.push_back(nums[total_index]);\\n ++total_index;\\n }\\n }\\n if (part.size() != a) {\\n break;\\n }\\n parts.push_back(part);\\n }\\n if (parts.size() == args.size()) {\\n std::cout << \\\"(\\\";\\n for (const auto& p : parts) {\\n std::cout << \\\"{ \\\";\\n for (const auto& e : p) {\\n std::cout << e << \\\" \\\";\\n }\\n std::cout << \\\"},\\\";\\n }\\n std::cout << \\\"),\\\" << std::endl;\\n }\\n } while (std::next_permutation(std::begin(nums), std::end(nums)));\\n}\\n\\nint main() {\\n std::vector<size_t> args = { 2, 0, 2 };\\n partitions(args);\\n std::cin.ignore();\\n std::cin.get();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Collections.Generic;\\n\\npublic static class OrderedPartitions\\n{\\n public static void Main() {\\n var input = new [] { new[] { 0, 0, 0, 0, 0 }, new[] { 2, 0, 2 }, new[] { 1, 1, 1 } };\\n foreach (int[] sizes in input) {\\n foreach (var partition in Partitions(sizes)) {\\n Console.WriteLine(partition.Select(set => set.Delimit(\\\", \\\").Encase('{','}')).Delimit(\\\", \\\").Encase('(', ')'));\\n }\\n Console.WriteLine();\\n }\\n }\\n\\n static IEnumerable<IEnumerable<int[]>> Partitions(params int[] sizes) {\\n var enumerators = new IEnumerator<int[]>[sizes.Length];\\n var unused = Enumerable.Range(1, sizes.Sum()).ToSortedSet();\\n var arrays = sizes.Select(size => new int[size]).ToArray();\\n\\n for (int s = 0; s >= 0; ) {\\n if (s == sizes.Length) {\\n yield return arrays;\\n s--;\\n }\\n if (enumerators[s] == null) {\\n enumerators[s] = Combinations(sizes[s], unused.ToArray()).GetEnumerator();\\n } else {\\n unused.UnionWith(arrays[s]);\\n }\\n if (enumerators[s].MoveNext()) {\\n enumerators[s].Current.CopyTo(arrays[s], 0);\\n unused.ExceptWith(arrays[s]);\\n s++;\\n } else {\\n enumerators[s] = null;\\n s--;\\n }\\n }\\n }\\n\\n static IEnumerable<T[]> Combinations<T>(int count, params T[] array) {\\n T[] result = new T[count];\\n foreach (int pattern in BitPatterns(array.Length - count, array.Length)) {\\n for (int b = 1 << (array.Length - 1), i = 0, r = 0; b > 0; b >>= 1, i++) {\\n if ((pattern & b) == 0) result[r++] = array[i];\\n }\\n yield return result;\\n }\\n }\\n\\n static IEnumerable<int> BitPatterns(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 if (v == 0) break;\\n\\n int w = (v | (v - 1)) + 1;\\n w |= (((w & -w) / (v & -v)) >> 1) - 1;\\n v = w & blockMask;\\n }\\n }\\n\\n static string Delimit<T>(this IEnumerable<T> source, string separator) => string.Join(separator, source);\\n static string Encase(this string s, char start, char end) => start + s + end;\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defun fill-part (x i j l)\\n (let ((e (elt x i)))\\n (loop for c in l do\\n\\t (loop while (>= j (length e)) do\\n\\t\\t (setf j 0 e (elt x (incf i))))\\n\\t (setf (elt e j) c)\\n\\t (incf j))))\\n\\n;;; take a list of lists and return next partitioning\\n;;; it's caller's responsibility to ensure each sublist is sorted\\n(defun next-part (list cmp)\\n (let* ((l (coerce list 'vector))\\n\\t (i (1- (length l)))\\n\\t (e (elt l i)))\\n (loop while (<= 0 (decf i)) do\\n\\t ;; e holds all the right most elements\\n\\t (let ((p (elt l i)) (q (car (last e))))\\n\\t ;; find the right-most list that has an element that's smaller\\n\\t ;; than _something_ in later lists\\n\\t (when (and p (funcall cmp (first p) q))\\n\\t ;; find largest element that can be increased\\n\\t (loop for j from (1- (length p)) downto 0 do\\n\\t\\t (when (funcall cmp (elt p j) q)\\n\\t\\t ;; find the smallest element that's larger than\\n\\t\\t ;; that largest\\n\\t\\t (loop for x from 0 to (1- (length e)) do\\n\\t\\t\\t (when (funcall cmp (elt p j) (elt e x))\\n\\t\\t\\t (rotatef (elt p j) (elt e x))\\n\\t\\t\\t (loop while (< (incf j) (length p)) do\\n\\t\\t\\t \\t(setf (elt p j) (elt e (incf x))\\n\\t\\t\\t\\t (elt e x) nil))\\n\\t\\t\\t (fill-part l i j (remove nil e))\\n\\t\\t\\t (return-from next-part l))))\\n\\t\\t (setf e (append e (list (elt p j))))))\\n\\t (setf e (append e p))))))\\n\\n(let ((a '#((1 2) () (3 4))))\\n (loop while a do\\n\\t(format t \\\"~a~%\\\" a)\\n\\t(setf a (next-part a #'<))))\\n\\n(write-line \\\"with dupe elements:\\\")\\n(let ((a '#((a c) (c c d))))\\n (loop while a do\\n\\t(format t \\\"~a~%\\\" a)\\n\\t(setf a (next-part a #'string<))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range, std.array, std.conv,\\n combinations3;\\n\\nalias iRNG = int[];\\n\\niRNG[][] orderPart(iRNG blockSize...) {\\n iRNG tot = iota(1, 1 + blockSize.sum).array;\\n\\n iRNG[][] p(iRNG s, in iRNG b) {\\n if (b.empty)\\n return [[]];\\n iRNG[][] res;\\n foreach (c; s.combinations(b[0]))\\n foreach (r; p(setDifference(s, c).array, b.dropOne))\\n res ~= c.dup ~ r;\\n return res;\\n }\\n\\n return p(tot, blockSize);\\n}\\n\\nvoid main(in string[] args) {\\n auto b = args.length > 1 ? args.dropOne.to!(int[]) : [2, 0, 2];\\n writefln(\\\"%(%s\\\\n%)\\\", b.orderPart);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import core.stdc.stdio;\\n\\nvoid genBits(size_t N)(ref uint[N] bits, in ref uint[N] parts,\\n uint mask, uint all, uint res, uint n, uint pid)\\nnothrow @nogc {\\n static void showPart(in uint x) nothrow @nogc {\\n '['.putchar;\\n for (uint i = 0; (1 << i) <= x; i++)\\n if (x & (1 << i))\\n printf(\\\"%d \\\", i + 1);\\n ']'.putchar;\\n }\\n\\n while (!n) {\\n bits[pid] = res;\\n pid++;\\n if (pid == N) {\\n foreach (immutable b; bits)\\n showPart(b);\\n '\\\\n'.putchar;\\n return;\\n }\\n all &= ~res;\\n mask = all;\\n res = 0;\\n n = parts[pid];\\n }\\n\\n while (mask) {\\n immutable uint i = mask & -int(mask);\\n mask &= ~i;\\n genBits(bits, parts, mask, all, res | i, n - 1, pid);\\n }\\n}\\n\\nvoid main() nothrow @nogc {\\n immutable uint[3] parts = [2, 0, 2];\\n uint m = 1;\\n foreach (immutable p; parts)\\n m <<= p;\\n\\n uint[parts.length] bits;\\n genBits(bits, parts, m - 1, m - 1, 0, parts[0], 0);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(lib 'list) ;; (combinations L k)\\n\\n;; add a combination to each partition in ps\\n(define (pproduct c ps) (for/list ((x ps)) (cons c x)))\\n\\n;; apply to any type of set S\\n;; ns is list of cardinals for each partition\\n;; for all combinations Ci of n objects from S\\n;; set S <- LS minus Ci , set n <- next n , and recurse\\n\\n(define (_partitions S ns )\\n (cond\\n ([empty? (rest ns)] (list (combinations S (first ns))))\\n (else\\n (for/fold (parts null)\\n ([c (combinations S (first ns))])\\n (append\\n parts\\n (pproduct c (_partitions (set-substract S c) (rest ns))))))))\\n\\n;; task : S = ( 0 , 1 ... n-1) args = ns\\n(define (partitions . args)\\n (for-each\\n\\t writeln\\n (_partitions (range 1 (1+ (apply + args))) args )))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"defmodule Ordered do\\n def partition([]), do: [[]]\\n def partition(mask) do\\n sum = Enum.sum(mask)\\n if sum == 0 do\\n [Enum.map(mask, fn _ -> [] end)]\\n else\\n Enum.to_list(1..sum)\\n |> permute\\n |> Enum.reduce([], fn perm,acc ->\\n {_, part} = Enum.reduce(mask, {perm,[]}, fn num,{pm,a} ->\\n {p, rest} = Enum.split(pm, num)\\n {rest, [Enum.sort(p) | a]}\\n end)\\n [Enum.reverse(part) | acc]\\n end)\\n |> Enum.uniq\\n end\\n end\\n\\n defp permute([]), do: [[]]\\n defp permute(list), do: for x <- list, y <- permute(list -- [x]), do: [x|y]\\nend\\n\\nEnum.each([[],[0,0,0],[1,1,1],[2,0,2]], fn test_case ->\\n IO.puts \\\"\\\\npartitions #{inspect test_case}:\\\"\\n Enum.each(Ordered.partition(test_case), fn part ->\\n IO.inspect part\\n end)\\nend)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"Function Perm(x() As Integer) As Boolean\\n Dim As Integer i, j\\n For i = Ubound(x,1)-1 To 0 Step -1\\n If x(i) < x(i+1) Then Exit For\\n Next i\\n If i < 0 Then Return False\\n j = Ubound(x,1)\\n While x(j) <= x(i)\\n j -= 1\\n Wend\\n Swap x(i), x(j)\\n i += 1\\n j = Ubound(x,1)\\n While i < j\\n Swap x(i), x(j)\\n i += 1\\n j -= 1\\n Wend\\n Return True\\nEnd Function\\n\\nFunction Particiones(list() As Integer) As String\\n Dim As Integer i, j, n, p ', x()\\n Dim As String oSS = \\\"\\\"\\n n = Ubound(list)\\n Dim As Integer x(n)\\n For i = 0 To n\\n If list(i) Then\\n For j = 1 To list(i)\\n x(p) = i\\n p += 1\\n Next j\\n End If\\n Next i\\n Do\\n For i = 0 To n\\n oSS += \\\" ( \\\"\\n For j = 0 To Ubound(x,1)\\n If x(j) = i Then oSS += Str(j+1) + \\\" \\\"\\n Next j\\n oSS += \\\")\\\"\\n Next i\\n oSS += Chr(13) + Chr(10)\\n Loop Until Not Perm(x())\\n Return oSS\\nEnd Function\\n\\nDim list2(2) As Integer = {1, 1, 1}\\nPrint \\\"Particiones(1, 1, 1):\\\"\\nPrint Particiones(list2())\\nDim list3(3) As Integer = {1, 2, 0, 1}\\nPrint !\\\"\\\\nParticiones(1, 2, 0, 1):\\\"\\nPrint Particiones(list3())\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"FixedPartitions := function(arg)\\n\\tlocal aux;\\n\\taux := function(i, u)\\n\\t\\tlocal r, v, w;\\n\\t\\tif i = Size(arg) then\\n\\t\\t\\treturn [[u]];\\n\\t\\telse\\n\\t\\t\\tr := [ ];\\n\\t\\t\\tfor v in Combinations(u, arg[i]) do\\n\\t\\t\\t\\tfor w in aux(i + 1, Difference(u, v)) do\\n\\t\\t\\t\\t\\tAdd(r, Concatenation([v], w));\\n\\t\\t\\t\\tod;\\n\\t\\t\\tod;\\n\\t\\t\\treturn r;\\n\\t\\tfi;\\n\\tend;\\n\\treturn aux(1, [1 .. Sum(arg)]);\\nend;\\n\\n\\nFixedPartitions(2, 0, 2);\\n# [ [ [ 1, 2 ], [ ], [ 3, 4 ] ], [ [ 1, 3 ], [ ], [ 2, 4 ] ],\\n# [ [ 1, 4 ], [ ], [ 2, 3 ] ], [ [ 2, 3 ], [ ], [ 1, 4 ] ],\\n# [ [ 2, 4 ], [ ], [ 1, 3 ] ], [ [ 3, 4 ], [ ], [ 1, 2 ] ] ]\\n\\nFixedPartitions(1, 1, 1);\\n# [ [ [ 1 ], [ 2 ], [ 3 ] ], [ [ 1 ], [ 3 ], [ 2 ] ], [ [ 2 ], [ 1 ], [ 3 ] ],\\n# [ [ 2 ], [ 3 ], [ 1 ] ], [ [ 3 ], [ 1 ], [ 2 ] ], [ [ 3 ], [ 2 ], [ 1 ] ] ]\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"os\\\"\\n\\t\\\"strconv\\\"\\n)\\n\\nfunc gen_part(n, res []int, pos int) {\\n\\tif pos == len(res) {\\n\\t\\tx := make([][]int, len(n))\\n\\t\\tfor i, c := range res {\\n\\t\\t\\tx[c] = append(x[c], i+1)\\n\\t\\t}\\n\\n\\t\\tfmt.Println(x)\\n\\t\\treturn\\n\\t}\\n\\n\\tfor i := range n {\\n\\t\\tif n[i] == 0 {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\t\\tn[i], res[pos] = n[i]-1, i\\n\\t\\tgen_part(n, res, pos+1)\\n\\t\\tn[i]++\\n\\t}\\n}\\n\\nfunc ordered_part(n_parts []int) {\\n\\tfmt.Println(\\\"Ordered\\\", n_parts)\\n\\n\\tsum := 0\\n\\tfor _, c := range n_parts {\\n\\t\\tsum += c\\n\\t}\\n\\n\\tgen_part(n_parts, make([]int, sum), 0)\\n}\\n\\nfunc main() {\\n\\tif len(os.Args) < 2 {\\n\\t\\tordered_part([]int{2, 0, 2})\\n\\t\\treturn\\n\\t}\\n\\tn := make([]int, len(os.Args)-1)\\n\\tvar err error\\n\\tfor i, a := range os.Args[1:] {\\n\\t\\tn[i], err = strconv.Atoi(a)\\n\\t\\tif err != nil {\\n\\t\\t\\tfmt.Println(err)\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t\\tif n[i] < 0 {\\n\\t\\t\\tfmt.Println(\\\"negative partition size not meaningful\\\")\\n\\t\\t\\treturn\\n\\t\\t}\\n\\t}\\n\\tordered_part(n)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def partitions = { int... sizes ->\\n int n = (sizes as List).sum()\\n def perms = n == 0 ? [[]] : (1..n).permutations()\\n Set parts = perms.collect { p -> sizes.collect { s -> (0..<s).collect { p.pop() } as Set } }\\n parts.sort{ a, b ->\\n if (!a) return 0\\n def comp = [a,b].transpose().find { aa, bb -> aa != bb }\\n if (!comp) return 0\\n def recomp = comp.collect{ it as List }.transpose().find { aa, bb -> aa != bb }\\n if (!recomp) return 0\\n return recomp[0] <=> recomp[1]\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"partitions(2, 0, 2).each {\\n println it\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Data.List ((\\\\\\\\))\\n\\ncomb :: Int -> [a] -> [[a]]\\ncomb 0 _ = [[]]\\ncomb _ [] = []\\ncomb k (x:xs) = map (x:) (comb (k-1) xs) ++ comb k xs\\n\\npartitions :: [Int] -> [[[Int]]]\\npartitions xs = p [1..sum xs] xs\\n where p _ [] = [[]]\\n p xs (k:ks) = [ cs:rs | cs <- comb k xs, rs <- p (xs \\\\\\\\ cs) ks ]\\n\\nmain = print $ partitions [2,0,2]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"comb :: Int -> [a] -> [([a],[a])]\\ncomb 0 xs = [([],xs)]\\ncomb _ [] = []\\ncomb k (x:xs) = [ (x:cs,zs) | (cs,zs) <- comb (k-1) xs ] ++\\n [ (cs,x:zs) | (cs,zs) <- comb k xs ]\\n\\npartitions :: [Int] -> [[[Int]]]\\npartitions xs = p [1..sum xs] xs\\n where p _ [] = [[]]\\n p xs (k:ks) = [ cs:rs | (cs,zs) <- comb k xs, rs <- p zs ks ]\\n\\nmain = print $ partitions [2,0,2]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bifunctor (first, second)\\n\\n-- choose m out of n items, return tuple of chosen and the rest\\n\\nchoose :: [Int] -> Int -> Int -> [([Int], [Int])]\\nchoose [] _ _ = [([], [])]\\nchoose aa _ 0 = [([], aa)]\\nchoose aa@(a : as) n m\\n | n == m = [(aa, [])]\\n | otherwise =\\n (first (a :) <$> choose as (n - 1) (m - 1))\\n <> (second (a :) <$> choose as (n - 1) m)\\n\\npartitions :: [Int] -> [[[Int]]]\\npartitions x = combos [1 .. n] n x\\n where\\n n = sum x\\n combos _ _ [] = [[]]\\n combos s n (x : xs) =\\n [ l : r\\n | (l, rest) <- choose s n x,\\n r <- combos rest (n - x) xs\\n ]\\n\\nmain :: IO ()\\nmain = mapM_ print $ partitions [5, 5, 5]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require'stats'\\npartitions=: ([,] {L:0 (i.@#@, -. [)&;)/\\\"1@>@,@{@({@comb&.> +/\\\\.)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" partitions 2 0 2\\n┌───┬┬───┐\\n│0 1││2 3│\\n├───┼┼───┤\\n│0 2││1 3│\\n├───┼┼───┤\\n│0 3││1 2│\\n├───┼┼───┤\\n│1 2││0 3│\\n├───┼┼───┤\\n│1 3││0 2│\\n├───┼┼───┤\\n│2 3││0 1│\\n└───┴┴───┘\\n partitions 1 1 1\\n┌─┬─┬─┐\\n│0│1│2│\\n├─┼─┼─┤\\n│0│2│1│\\n├─┼─┼─┤\\n│1│0│2│\\n├─┼─┼─┤\\n│1│2│0│\\n├─┼─┼─┤\\n│2│0│1│\\n├─┼─┼─┤\\n│2│1│0│\\n└─┴─┴─┘\\n #partitions 2 3 5\\n2520\\n #partitions 5 7 11\\n|out of memory: partitions\\n| # partitions 5 7 11\\n */ (! +/\\\\.)5 7 11\\n1070845776\\n #partitions 3 5 7\\n360360\\n */ (! +/\\\\.)3 5 7\\n360360\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" +/\\\\. 2 0 2\\n4 2 2\\n ({@comb&.> +/\\\\.) 2 0 2\\n┌─────────────────────────┬──┬─────┐\\n│┌───┬───┬───┬───┬───┬───┐│┌┐│┌───┐│\\n││0 1│0 2│0 3│1 2│1 3│2 3││││││0 1││\\n│└───┴───┴───┴───┴───┴───┘│└┘│└───┘│\\n└─────────────────────────┴──┴─────┘\\n >@,@{@({@comb&.> +/\\\\.) 2 0 2\\n┌───┬┬───┐\\n│0 1││0 1│\\n├───┼┼───┤\\n│0 2││0 1│\\n├───┼┼───┤\\n│0 3││0 1│\\n├───┼┼───┤\\n│1 2││0 1│\\n├───┼┼───┤\\n│1 3││0 1│\\n├───┼┼───┤\\n│2 3││0 1│\\n└───┴┴───┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1\\n┌───┬───┐\\n│0 1│2 3│\\n└───┴───┘\\n ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1;0 1\\n┌───┬───┬───┐\\n│0 1│2 3│4 5│\\n└───┴───┴───┘\\n ([,] {L:0 (i.@#@, -. [)&;)/0 1;0 1;0 1;0 1\\n┌───┬───┬───┬───┐\\n│0 1│2 3│4 5│6 7│\\n└───┴───┴───┴───┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (<0 1) ([,] {L:0 (i.@#@, -. [)&;)0 1;2 3;4 5\\n┌───┬───┬───┬───┐\\n│0 1│2 3│4 5│6 7│\\n└───┴───┴───┴───┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.List;\\nimport java.util.stream.Collectors;\\nimport java.util.stream.IntStream;\\n\\npublic final class OrderedPartitions {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tList<Integer> sizes = ( aArgs == null || aArgs.length == 0 ) ?\\n\\t\\t\\tList.of( 2, 0, 2 ) : Arrays.stream(aArgs).map( s -> Integer.valueOf(s) ).toList();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Partitions for \\\" + sizes + \\\":\\\");\\n\\t\\tfinal int total = sizes.stream().reduce(0, Integer::sum);\\n\\t\\tList<Integer> permutation = IntStream.rangeClosed(1, total).boxed().collect(Collectors.toList());\\n\\t\\n\\t\\twhile ( hasNextPermutation(permutation) ) {\\n\\t List<List<Integer>> partition = new ArrayList<List<Integer>>();\\n\\t int sum = 0;\\n\\t boolean isValid = true;\\n\\t for ( int size : sizes ) {\\n \\tList<Integer> subList = permutation.subList(sum, sum + size);\\n if ( ! isIncreasing(subList) ) {\\n isValid = false;\\n break;\\n }\\n partition.add(subList);\\n\\t sum += size;\\n\\t }\\n\\t\\n\\t if ( isValid ) {\\n\\t \\tSystem.out.println(\\\" \\\".repeat(4) + partition);\\n\\t }\\t\\n\\t }\\n\\t}\\n\\t\\n\\tprivate static boolean hasNextPermutation(List<Integer> aPerm) {\\n\\t final int lastIndex = aPerm.size() - 1;\\n\\t int i = lastIndex;\\n\\t while ( i > 0 && aPerm.get(i - 1) >= aPerm.get(i) ) {\\n\\t i--;\\n\\t }\\n\\t\\n\\t if ( i <= 0 ) {\\n\\t return false;\\n\\t }\\n\\t\\n\\t int j = lastIndex;\\n\\t while ( aPerm.get(j) <= aPerm.get(i - 1) ) {\\n\\t j--;\\n\\t }\\t\\n\\t swap(aPerm, i - 1, j);\\n\\t\\n\\t j = lastIndex;\\n\\t while ( i < j ) {\\n\\t \\tswap(aPerm, i++, j--);\\n\\t }\\n\\t\\n\\t return true;\\n\\t}\\n\\t\\n\\tprivate static boolean isIncreasing(List<Integer> aList) {\\n\\t return aList.stream().sorted().toList().equals(aList);\\n\\t}\\n\\t\\n\\tprivate static void swap(List<Integer> aList, int aOne, int aTwo) {\\n\\t\\tfinal int temp = aList.get(aOne);\\n\\t aList.set(aOne, aList.get(aTwo));\\n\\t aList.set(aTwo, temp);\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(function () {\\n 'use strict';\\n\\n // [n] -> [[[n]]]\\n function partitions(a1, a2, a3) {\\n var n = a1 + a2 + a3;\\n\\n return combos(range(1, n), n, [a1, a2, a3]);\\n }\\n\\n function combos(s, n, xxs) {\\n if (!xxs.length) return [[]];\\n\\n var x = xxs[0],\\n xs = xxs.slice(1);\\n\\n return mb( choose(s, n, x), function (l_rest) {\\n return mb( combos(l_rest[1], (n - x), xs), function (r) {\\n // monadic return/injection requires 1 additional\\n // layer of list nesting:\\n return [ [l_rest[0]].concat(r) ];\\n\\n })});\\n }\\n\\n function choose(aa, n, m) {\\n if (!m) return [[[], aa]];\\n\\n var a = aa[0],\\n as = aa.slice(1);\\n\\n return n === m ? (\\n [[aa, []]]\\n ) : (\\n choose(as, n - 1, m - 1).map(function (xy) {\\n return [[a].concat(xy[0]), xy[1]];\\n }).concat(choose(as, n - 1, m).map(function (xy) {\\n return [xy[0], [a].concat(xy[1])];\\n }))\\n );\\n }\\n\\n // GENERIC\\n\\n // Monadic bind (chain) for lists\\n function mb(xs, f) {\\n return [].concat.apply([], xs.map(f));\\n }\\n\\n // [m..n]\\n function range(m, n) {\\n return Array.apply(null, Array(n - m + 1)).map(function (x, i) {\\n return m + i;\\n });\\n }\\n\\n // EXAMPLE\\n\\n return partitions(2, 0, 2);\\n\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[[[1, 2], [], [3, 4]],\\n [[1, 3], [], [2, 4]],\\n [[1, 4], [], [2, 3]],\\n [[2, 3], [], [1, 4]],\\n [[2, 4], [], [1, 3]],\\n [[3, 4], [], [1, 2]]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Generate a stream of the distinct combinations of r items taken from the input array.\\ndef combination(r):\\n if r > length or r < 0 then empty\\n elif r == length then .\\n else ( [.[0]] + (.[1:]|combination(r-1))),\\n ( .[1:]|combination(r))\\n end;\\n\\n# Input: a mask, that is, an array of lengths.\\n# Output: a stream of the distinct partitions defined by the mask.\\ndef partition:\\n\\n # partition an array of entities, s, according to a mask presented as input:\\n def p(s):\\n if length == 0 then []\\n else . as $mask\\n | (s | combination($mask[0])) as $c\\n | [$c] + ($mask[1:] | p(s - $c))\\n end;\\n . as $mask | p( [range(1; 1 + ($mask|add))] );\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"([],[0,0,0],[1,1,1],[2,0,2])\\n | . as $test_case\\n | \\\"partitions \\\\($test_case):\\\" , ($test_case | partition), \\\"\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -M -n -c -r -f Ordered_partitions.jq\\n\\npartitions []:\\n[]\\n\\npartitions [0,0,0]:\\n[[],[],[]]\\n\\npartitions [1,1,1]:\\n[[1],[2],[3]]\\n[[1],[3],[2]]\\n[[2],[1],[3]]\\n[[2],[3],[1]]\\n[[3],[1],[2]]\\n[[3],[2],[1]]\\n\\npartitions [2,0,2]:\\n[[1,2],[],[3,4]]\\n[[1,3],[],[2,4]]\\n[[1,4],[],[2,3]]\\n[[2,3],[],[1,4]]\\n[[2,4],[],[1,3]]\\n[[3,4],[],[1,2]]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Combinatorics\\n\\nfunction masked(mask, lis)\\n combos = []\\n idx = 1\\n for step in mask\\n if(step < 1)\\n push!(combos, Array{Int,1}[])\\n else\\n push!(combos, sort(lis[idx:idx+step-1]))\\n idx += step\\n end\\n end\\n Array{Array{Int, 1}, 1}(combos)\\nend\\n\\nfunction orderedpartitions(mask)\\n tostring(masklis) = replace(\\\"$masklis\\\", r\\\"Array{Int\\\\d?\\\\d?,1}|Int\\\\d?\\\\d?\\\", \\\"\\\")\\n join([tostring(lis) for lis in unique([masked(mask, p)\\n for p in permutations(1:sum(mask))])], \\\"\\\\n\\\")\\nend\\n\\nprintln(orderedpartitions([2, 0, 2]))\\nprintln(orderedpartitions([1, 1, 1]))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\nfun nextPerm(perm: IntArray): Boolean {\\n val size = perm.size\\n var k = -1\\n for (i in size - 2 downTo 0) {\\n if (perm[i] < perm[i + 1]) {\\n k = i\\n break\\n }\\n }\\n if (k == -1) return false // last permutation\\n for (l in size - 1 downTo k) {\\n if (perm[k] < perm[l]) {\\n val temp = perm[k]\\n perm[k] = perm[l]\\n perm[l] = temp\\n var m = k + 1\\n var n = size - 1\\n while (m < n) {\\n val temp2 = perm[m]\\n perm[m++] = perm[n]\\n perm[n--] = temp2\\n }\\n break\\n }\\n }\\n return true\\n}\\n\\nfun List<Int>.isMonotonic(): Boolean {\\n for (i in 1 until this.size) {\\n if (this[i] < this[i - 1]) return false\\n }\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n val sizes = args.map { it.toInt() }\\n println(\\\"Partitions for $sizes:\\\\n[\\\")\\n val totalSize = sizes.sum()\\n val perm = IntArray(totalSize) { it + 1 }\\n\\n do {\\n val partition = mutableListOf<List<Int>>()\\n var sum = 0\\n var isValid = true\\n for (size in sizes) {\\n if (size == 0) {\\n partition.add(emptyList<Int>())\\n }\\n else if (size == 1) {\\n partition.add(listOf(perm[sum]))\\n }\\n else {\\n val sl = perm.slice(sum until sum + size)\\n if (!sl.isMonotonic()) {\\n isValid = false\\n break\\n }\\n partition.add(sl)\\n }\\n sum += size\\n }\\n if (isValid) println(\\\" $partition\\\")\\n }\\n while (nextPerm(perm))\\n println(\\\"]\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"--- Create a list {1,...,n}.\\nlocal function range(n)\\n local res = {}\\n for i=1,n do\\n res[i] = i\\n end\\n return res\\nend\\n\\n--- Return true if the element x is in t.\\nlocal function isin(t, x)\\n for _,x_t in ipairs(t) do\\n if x_t == x then return true end\\n end\\n return false\\nend\\n\\n--- Return the sublist from index u to o (inclusive) from t.\\nlocal function slice(t, u, o)\\n local res = {}\\n for i=u,o do\\n res[#res+1] = t[i]\\n end\\n return res\\nend\\n\\n--- Compute the sum of the elements in t.\\n-- Assume that t is a list of numbers.\\nlocal function sum(t)\\n local s = 0\\n for _,x in ipairs(t) do\\n s = s + x\\n end\\n return s\\nend\\n\\n--- Generate all combinations of t of length k (optional, default is #t).\\nlocal function combinations(m, r)\\n local function combgen(m, n)\\n if n == 0 then coroutine.yield({}) end\\n for i=1,#m do\\n if n == 1 then coroutine.yield({m[i]})\\n else\\n for m0 in coroutine.wrap(function() combgen(slice(m, i+1, #m), n-1) end) do\\n coroutine.yield({m[i], unpack(m0)})\\n end\\n end\\n end\\n end\\n return coroutine.wrap(function() combgen(m, r) end)\\nend\\n\\n--- Generate a list of partitions into fized-size blocks.\\nlocal function partitions(...)\\n local function helper(s, ...)\\n local args = {...}\\n if #args == 0 then return {% templatetag openvariable %}{% templatetag closevariable %} end\\n local res = {}\\n for c in combinations(s, args[1]) do\\n local s0 = {}\\n for _,x in ipairs(s) do if not isin(c, x) then s0[#s0+1] = x end end\\n for _,r in ipairs(helper(s0, unpack(slice(args, 2, #args)))) do\\n res[#res+1] = {{unpack(c)}, unpack(r)}\\n end\\n end\\n return res\\n end\\n return helper(range(sum({...})), ...)\\nend\\n\\n-- Print the solution\\nio.write \\\"[\\\"\\nlocal parts = partitions(2,0,2)\\nfor i,tuple in ipairs(parts) do\\n io.write \\\"(\\\"\\n for j,set in ipairs(tuple) do\\n io.write \\\"{\\\"\\n for k,element in ipairs(set) do\\n io.write(element)\\n if k ~= #set then io.write(\\\", \\\") end\\n end\\n io.write \\\"}\\\"\\n if j ~= #tuple then io.write(\\\", \\\") end\\n end\\n io.write \\\")\\\"\\n if i ~= #parts then io.write(\\\", \\\") end\\nend\\nio.write \\\"]\\\"\\nio.write \\\"\\\\n\\\"\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"w[partitions_]:=Module[{s={},t=Total@partitions,list=partitions,k}, n=Length[list];\\n While[n>0,s=Join[s,{Take[t,(k=First[list])]}];t=Drop[t,k];list=Rest[list];n--]; s]\\nm[p_]:=(Sort/@#)&/@(w[#,p]&/@Permutations[Range@Total[p]])//Union\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"Grid@m[{2, 0, 2}]\\nGrid@m[{1, 1, 1}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import algorithm, math, sequtils, strutils\\n\\ntype Partition = seq[seq[int]]\\n\\n\\nfunc isIncreasing(s: seq[int]): bool =\\n ## Return true if the sequence is sorted in increasing order.\\n var prev = 0\\n for val in s:\\n if prev >= val: return false\\n prev = val\\n result = true\\n\\n\\niterator partitions(lengths: varargs[int]): Partition =\\n ## Yield the partitions for lengths \\\"lengths\\\".\\n\\n # Build the list of slices to use for partitionning.\\n var slices: seq[Slice[int]]\\n var delta = -1\\n var idx = 0\\n for length in lengths:\\n assert length >= 0, \\\"lengths must not be negative.\\\"\\n inc delta, length\\n slices.add idx..delta\\n inc idx, length\\n\\n # Build the partitions.\\n let n = sum(lengths)\\n var perm = toSeq(1..n)\\n while true:\\n\\n block buildPartition:\\n var part: Partition\\n for slice in slices:\\n let s = perm[slice]\\n if not s.isIncreasing():\\n break buildPartition\\n part.add s\\n yield part\\n\\n if not perm.nextPermutation():\\n break\\n\\n\\nfunc toString(part: Partition): string =\\n ## Return the string representation of a partition.\\n result = \\\"(\\\"\\n for s in part:\\n result.addSep(\\\", \\\", 1)\\n result.add '{' & s.join(\\\", \\\") & '}'\\n result.add ')'\\n\\n\\nwhen isMainModule:\\n\\n import os\\n\\n proc displayPermutations(lengths: varargs[int]) =\\n ## Display the permutations.\\n echo \\\"Ordered permutations for (\\\", lengths.join(\\\", \\\"), \\\"):\\\"\\n for part in partitions(lengths):\\n echo part.toString\\n\\n if paramCount() > 0:\\n var args: seq[int]\\n for param in commandLineParams():\\n try:\\n let val = param.parseInt()\\n if val < 0: raise newException(ValueError, \\\"\\\")\\n args.add val\\n except ValueError:\\n quit \\\"Wrong parameter: \\\" & param\\n displayPermutations(args)\\n\\n else:\\n displayPermutations(2, 0, 2)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse Thread 'async';\\nuse Thread::Queue;\\n\\nsub make_slices {\\n my ($n, @avail) = (shift, @{ +shift });\\n\\n my ($q, @part, $gen);\\n $gen = sub {\\n my $pos = shift; # where to start in the list\\n if (@part == $n) {\\n # we accumulated enough for a partition, emit them and\\n # wait for main thread to pick them up, then back up\\n $q->enqueue(\\\\@part, \\\\@avail);\\n return;\\n }\\n\\n # obviously not enough elements left to make a partition, back up\\n return if (@part + @avail < $n);\\n\\n for my $i ($pos .. @avail - 1) { # try each in turn\\n push @part, splice @avail, $i, 1; # take one\\n $gen->($i); # go deeper\\n splice @avail, $i, 0, pop @part; # put it back\\n }\\n };\\n\\n $q = Thread::Queue->new;\\n (async{ &$gen; # start the main work load\\n $q->enqueue(undef) # signal that there's no more data\\n })->detach; # let the thread clean up after itself, not my problem\\n\\n return $q;\\n}\\n\\nmy $qa = make_slices(4, [ 0 .. 9 ]);\\nwhile (my $a = $qa->dequeue) {\\n my $qb = make_slices(2, $qa->dequeue);\\n\\n while (my $b = $qb->dequeue) {\\n my $rb = $qb->dequeue;\\n print \\\"@$a | @$b | @$rb\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse List::Util 1.33 qw(sum pairmap);\\n\\nsub partition {\\n my @mask = @_;\\n my $last = sum @mask or return [map {[]} 0..$#mask];\\n\\n return pairmap {\\n $b ? do {\\n local $mask[$a] = $b - 1;\\n map { push @{$_->[$a]}, $last; $_ }\\n partition(@mask);\\n } : ()\\n } %mask[0..$#mask];\\n}\\n\\n# Input & Output handling:\\n\\nprint \\\"(\\\" . join(', ', map { \\\"{\\\".join(', ', @$_).\\\"}\\\" } @$_) . \\\")\\\\n\\\"\\n for partition( @ARGV ? @ARGV : (2, 0, 2) );\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">partitions</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">N</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pset</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- eg s==={2,0,2} -> {1,1,3,3}</span>\\n <span style=\\\"color: #000000;\\\">rn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- \\\"\\\" -> <nowiki>{{</nowiki>0,0},{},{0,0<nowiki>}}</nowiki></span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">pset</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #000000;\\\">rn</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pset</span><span style=\\\"color: #0000FF;\\\">={}</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">rn</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- edge case</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">permutes</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pset</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- eg {1,1,3,3} means put 1,2 in [1], 3,4 in [3]\\n -- .. {3,3,1,1} means put 1,2 in [3], 3,4 in [1]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- a \\\"flat\\\" permute</span>\\n <span style=\\\"color: #000000;\\\">rdii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- where per set</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- which set</span>\\n <span style=\\\"color: #000000;\\\">rnx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rdii</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">rdx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- wherein\\\"\\\"</span>\\n <span style=\\\"color: #000000;\\\">rii</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">rn</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">rdx</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">rnx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rii</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- plant 1..N</span>\\n <span style=\\\"color: #000000;\\\">rdii</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">rdx</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rnx</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rii</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">N</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">partitions</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ia</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">?{</span><span style=\\\"color: #008000;\\\">\\\"is\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">}:{</span><span style=\\\"color: #008000;\\\">\\\"are\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"s\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"There %s %,d ordered partion%s for %v:\\\\n{%s}\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ia</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">shorten</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%v\\\"</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n \\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #7060A8;\\\">papply</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">},{},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}},</span><span style=\\\"color: #000000;\\\">test</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de partitions (Args)\\n (let Lst (range 1 (apply + Args))\\n (recur (Args Lst)\\n (ifn Args\\n '(NIL)\\n (mapcan\\n '((L)\\n (mapcar\\n '((R) (cons L R))\\n (recurse (cdr Args) (diff Lst L)) ) )\\n (comb (car Args) Lst) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"from itertools import combinations\\n\\ndef partitions(*args):\\n def p(s, *args):\\n if not args: return [[]]\\n res = []\\n for c in combinations(s, args[0]):\\n s0 = [x for x in s if x not in c]\\n for r in p(s0, *args[1:]):\\n res.append([c] + r)\\n return res\\n s = range(sum(args))\\n return p(s, *args)\\n\\nprint partitions(2, 0, 2)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import combinations as comb\\n\\ndef partitions(*args):\\n def minus(s1, s2): return [x for x in s1 if x not in s2]\\n def p(s, *args):\\n if not args: return [[]]\\n return [[c] + r for c in comb(s, args[0]) for r in p(minus(s, c), *args[1:])]\\n return p(range(1, sum(args) + 1), *args)\\n\\nprint partitions(2, 0, 2)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Ordered Partitions'''\\n\\n\\n# partitions :: [Int] -> [[[Int]]]\\ndef partitions(xs):\\n '''Ordered partitions of xs.'''\\n n = sum(xs)\\n\\n def go(s, n, ys):\\n return [\\n [l] + r\\n for (l, rest) in choose(s)(n)(ys[0])\\n for r in go(rest, n - ys[0], ys[1:])\\n ] if ys else [[]]\\n return go(enumFromTo(1)(n), n, xs)\\n\\n\\n# choose :: [Int] -> Int -> Int -> [([Int], [Int])]\\ndef choose(xs):\\n '''(m items chosen from n items, the rest)'''\\n def go(xs, n, m):\\n f = cons(xs[0])\\n choice = choose(xs[1:])(n - 1)\\n return [([], xs)] if 0 == m else (\\n [(xs, [])] if n == m else (\\n [first(f)(x) for x in choice(m - 1)] +\\n [second(f)(x) for x in choice(m)]\\n )\\n )\\n return lambda n: lambda m: go(xs, n, m)\\n\\n\\n# TEST ----------------------------------------------------\\n# main :: IO ()\\ndef main():\\n '''Tests of the partitions function'''\\n\\n f = partitions\\n print(\\n fTable(main.__doc__ + ':')(\\n lambda x: '\\\\n' + f.__name__ + '(' + repr(x) + ')'\\n )(\\n lambda ps: '\\\\n\\\\n' + '\\\\n'.join(\\n ' ' + repr(p) for p in ps\\n )\\n )(f)([\\n [2, 0, 2],\\n [1, 1, 1]\\n ])\\n )\\n\\n\\n# DISPLAY -------------------------------------------------\\n\\n# fTable :: 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# GENERIC -------------------------------------------------\\n\\n# cons :: a -> [a] -> [a]\\ndef cons(x):\\n '''Construction of a list from x as head,\\n and xs as tail.\\n '''\\n return lambda xs: [x] + xs\\n\\n\\n# enumFromTo :: (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# first :: (a -> b) -> ((a, c) -> (b, c))\\ndef first(f):\\n '''A simple function lifted to a function over a tuple,\\n with f applied only the first of two values.\\n '''\\n return lambda xy: (f(xy[0]), xy[1])\\n\\n\\n# second :: (a -> b) -> ((c, a) -> (c, b))\\ndef second(f):\\n '''A simple function lifted to a function over a tuple,\\n with f applied only the second of two values.\\n '''\\n return lambda xy: (xy[0], f(xy[1]))\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(define (comb k xs)\\n (cond [(zero? k) (list (cons '() xs))]\\n [(null? xs) '()]\\n [else (append (for/list ([cszs (comb (sub1 k) (cdr xs))])\\n (cons (cons (car xs) (car cszs)) (cdr cszs)))\\n (for/list ([cszs (comb k (cdr xs))])\\n (cons (car cszs) (cons (car xs) (cdr cszs)))))]))\\n(define (partitions xs)\\n (define (p xs ks)\\n (if (null? ks)\\n '(())\\n (for*/list ([cszs (comb (car ks) xs)] [rs (p (cdr cszs) (cdr ks))])\\n (cons (car cszs) rs))))\\n (p (range 1 (add1 (foldl + 0 xs))) xs))\\n\\n(define (run . xs)\\n (printf \\\"partitions~s:\\\\n\\\" xs)\\n (for ([x (partitions xs)]) (printf \\\" ~s\\\\n\\\" x))\\n (newline))\\n\\n(run 2 0 2)\\n(run 1 1 1)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub partition(@mask is copy) {\\n my @op;\\n my $last = [+] @mask or return [] xx 1;\\n for @mask.kv -> $k, $v {\\n next unless $v;\\n temp @mask[$k] -= 1;\\n for partition @mask -> @p {\\n @p[$k].push: $last;\\n @op.push: @p;\\n }\\n }\\n return @op;\\n}\\n\\n.say for reverse partition [2,0,2];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"//*REXX program displays the ordered partitions as: orderedPartitions(i, j, k, ···). */\\ncall orderedPartitions 2,0,2 /*Note: 2,,2 will also work. */\\ncall orderedPartitions 1,1,1\\ncall orderedPartitions 1,2,0,1 /*Note: 1,2,,1 will also work. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\norderedPartitions: procedure; #=arg(); bot.=; top.=; low=; high=; d=123456789\\nt=0 /*T: is the sum of all the arguments.*/\\n do i=1 for #; t=t + arg(i) /*sum all the highest numbers in parts.*/\\n end /*i*/ /* [↑] may have an omitted argument. */\\nhdr= ' partitions for: ' /*define the start of the header text. */\\n do j=1 for #; _= arg(j) /* _: is the Jth argument. */\\n len.j=max(1, _) /*LEN: length of args. «0 is special»*/\\n bot.j=left(d, _); if _==0 then bot.j=0 /*define the bottom number for range.*/\\n top.j=right(left(d,t),_); if _==0 then top.j=0 /* \\\" \\\" top \\\" \\\" \\\" */\\n @.j=left(d, t); if _==0 then @.j=0 /*define the digits used for VERIFY. */\\n hdr=hdr _ /*build (by appending) display header.*/\\n low=low || bot.j; high=high || top.j /*the low and high numbers for DO below*/\\n end /*j*/\\n /* [↓] same as: okD=left('0'd, t+1) */\\n /*define the legal digits to be used. */\\nokD=left(0 || d, t + 1) /*define the legal digits to be used. */\\nsay; hdr=center(hdr\\\" \\\", 60, '═'); say hdr /*display centered title for the output*/\\nsay /*show a blank line (as a separator). */\\n do g=low to high /* [↑] generate the ordered partitions*/\\n if verify(g, okD) \\\\==0 then iterate /*filter out unwanted partitions (digs)*/\\n p=1 /*P: is the position of a decimal dig.*/\\n $= /*$: will be the transformed numbers. */\\n do k=1 for #; _=substr(g, p, len.k) /*verify the partitions numbers. */\\n if verify(_, @.k) \\\\==0 then iterate g /*is the decimal digit not valid ? */\\n != /* [↓] validate the decimal number. */\\n if @.k\\\\==0 then do j=1 for length(_); z=substr(_, j, 1) /*get a dig.*/\\n if pos(z, $)\\\\==0 then iterate g /*previous ?*/\\n !=!','z /*add comma.*/\\n if j==1 then iterate /*is firstt?*/\\n if z<=substr(_, j-1, 1) then iterate g /*ordered ?*/\\n if pos(z, _, 1 +pos(z, _))\\\\==0 then iterate g /*duplicate?*/\\n end /*j*/\\n p=p + len.k /*point to the next decimal digit (num)*/\\n $=$ ' {'strip(translate(!, ,0), ,\\\",\\\")'}' /*dress number up by suppessing LZ ··· */\\n end /*k*/\\n say center($, length(hdr) ) /*display numbers in ordered partition.*/\\n end /*g*/\\nreturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"def partition(mask)\\n return [[]] if mask.empty?\\n [*1..mask.inject(:+)].permutation.map {|perm|\\n mask.map {|num_elts| perm.shift(num_elts).sort }\\n }.uniq\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def part(s, args)\\n return [[]] if args.empty?\\n s.combination(args[0]).each_with_object([]) do |c, res|\\n part(s - c, args[1..-1]).each{|r| res << ([c] + r)}\\n end\\nend\\ndef partitions(args)\\n return [[]] if args.empty?\\n part((1..args.inject(:+)).to_a, args)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"[[],[0,0,0],[1,1,1],[2,0,2]].each do |test_case|\\n puts \\\"partitions #{test_case}:\\\"\\n partition(test_case).each{|part| p part }\\n puts\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use itertools::Itertools;\\n\\ntype NArray = Vec<Vec<Vec<usize>>>;\\n\\nfn generate_partitions(args: &[usize]) -> NArray {\\n // calculate the sum of all partitions\\n let max = args.iter().sum();\\n\\n // generate combinations with the given lengths\\n // for each partition\\n let c = args.iter().fold(vec![], |mut acc, arg| {\\n acc.push((1..=max).combinations(*arg).collect::<Vec<_>>());\\n acc\\n });\\n\\n // create a cartesian product of all individual combinations\\n // filter/keep only where all the elements are there and exactly once\\n c.iter()\\n .map(|i| i.iter().cloned())\\n .multi_cartesian_product()\\n .unique()\\n .filter(|x| x.iter().cloned().flatten().unique().count() == max)\\n .collect::<Vec<_>>()\\n}\\n\\n#[allow(clippy::clippy::ptr_arg)]\\nfn print_partitions(result: &NArray) {\\n println!(\\\"Partitions:\\\");\\n for partition in result {\\n println!(\\\"{:?}\\\", partition);\\n }\\n}\\nfn main() {\\n print_partitions(generate_partitions(&[2, 0, 2]).as_ref());\\n print_partitions(generate_partitions(&[1, 1, 1]).as_ref());\\n print_partitions(generate_partitions(&[2, 3]).as_ref());\\n print_partitions(generate_partitions(&[0]).as_ref());\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"func part(_, {.is_empty}) { [[]] }\\nfunc partitions({.is_empty}) { [[]] }\\n\\nfunc part(s, args) {\\n gather {\\n s.combinations(args[0], { |*c|\\n part(s - c, args.slice(1)).each{|r| take([c] + r) }\\n })\\n }\\n}\\n\\nfunc partitions(args) {\\n part(@(1..args.sum), args)\\n}\\n\\n[[],[0,0,0],[1,1,1],[2,0,2]].each { |test_case|\\n say \\\"partitions #{test_case}:\\\"\\n partitions(test_case).each{|part| say part }\\n print \\\"\\\\n\\\"\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\npackage require struct::set\\n\\n# Selects all k-sized combinations from a list.\\n# \\\"Borrowed\\\" from elsewhere on RC\\nproc selectCombinationsFrom {k l} {\\n if {$k == 0} {return {}} elseif {$k == [llength $l]} {return [list $l]}\\n set all {}\\n set n [expr {[llength $l] - [incr k -1]}]\\n for {set i 0} {$i < $n} {} {\\n set first [lindex $l $i]\\n\\tincr i\\n if {$k == 0} {\\n lappend all $first\\n\\t} else {\\n\\t foreach s [selectCombinationsFrom $k [lrange $l $i end]] {\\n\\t\\tlappend all [list $first {*}$s]\\n\\t }\\n }\\n }\\n return $all\\n}\\n\\n# Construct the partitioning of a given list\\nproc buildPartitions {lst n args} {\\n # Base case when we have no further partitions to process\\n if {[llength $args] == 0} {\\n\\treturn [list [list $lst]]\\n }\\n set result {}\\n set c [selectCombinationsFrom $n $lst]\\n if {[llength $c] == 0} {set c [list $c]}\\n foreach comb $c {\\n\\t# Sort necessary for \\\"nice\\\" order\\n\\tset rest [lsort -integer [struct::set difference $lst $comb]]\\n\\tforeach p [buildPartitions $rest {*}$args] {\\n\\t lappend result [list $comb {*}$p]\\n\\t}\\n }\\n return $result\\n}\\n\\n# Wrapper that assembles the initial list and calls the partitioner\\nproc partitions args {\\n set sum [tcl::mathop::+ {*}$args]\\n set startingSet {}\\n for {set i 1} {$i <= $sum} {incr i} {\\n\\tlappend startingSet $i\\n }\\n\\n return [buildPartitions $startingSet {*}$args]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"puts [partitions 1 1 1]\\nputs [partitions 2 2]\\nputs [partitions 2 0 2]\\nputs [partitions 2 2 0]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\nopart =\\n\\n-+\\n ~&art^?\\\\~&alNCNC ^|JalSPfarSPMplrDSL/~& ^DrlPrrPlXXS/~&rt ^DrlrjXS/~&l choices@lrhPX,\\n ^\\\\~& nrange/1+ sum:-0+-\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %nLLL\\n\\ntest = opart <2,0,2>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"import \\\"os\\\" for Process\\n\\nvar genPart // recursive so predeclare\\ngenPart = Fn.new { |n, res, pos|\\n if (pos == res.count) {\\n var x = List.filled(n.count, null)\\n for (i in 0...x.count) x[i] = []\\n var i = 0\\n for (c in res) {\\n x[c].add(i+1)\\n i = i + 1\\n }\\n System.print(x)\\n return\\n }\\n for (i in 0...n.count) {\\n if (n[i] != 0) {\\n n[i] = n[i] - 1\\n res[pos] = i\\n genPart.call(n, res, pos+1)\\n n[i] = n[i] + 1\\n }\\n }\\n}\\n\\nvar orderedPart = Fn.new { |nParts|\\n System.print(\\\"Ordered %(nParts)\\\")\\n var sum = 0\\n for (c in nParts) sum = sum + c\\n genPart.call(nParts, List.filled(sum, 0), 0)\\n}\\n\\nvar args = Process.arguments\\nif (args.count == 0) {\\n orderedPart.call([2, 0, 2])\\n return\\n}\\nvar n = List.filled(args.count, 0)\\nvar i = 0\\nfor (a in args) {\\n n[i] = Num.fromString(a)\\n if (n[i] < 0) {\\n System.print(\\\"negative partition size not meaningful\\\")\\n return\\n }\\n i = i + 1\\n}\\norderedPart.call(n)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn partitions(args){\\n args=vm.arglist;\\n s:=(1).pump(args.sum(0),List); // (1,2,3,...)\\n fcn(s,args,p){\\n if(not args) return(T(T));\\n res:=List();\\n foreach c in (Utils.Helpers.pickNFrom(args[0],s)){\\n\\t s0:=s.copy().removeEach(c);\\n\\t foreach r in (self.fcn(s0,args[1,*])){ res.append(T(c).extend(r)) }\\n }\\n res\\n }(s,args)\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"args:=vm.arglist.apply(\\\"toInt\\\"); // aka argv[1..]\\nif(not args) args=T(2,0,2);\\npartitions(args.xplode()).pump(Console.println,Void);\\n// or: foreach p in (partitions(1,1,1)){ println(p) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ordered-partitions"}}},{"rowIdx":1470,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ordered_words\nnote: text processing\n","language":"00-META"},{"code":"An ''ordered word'' is a word in which the letters appear in alphabetic order. \n\nExamples include '''abbey''' and '''dirt'''. \n\n{{task heading}}\n\nFind ''and display'' all the ordered words in the dictionary [https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt] that have the longest word length. \n\n(Examples that access the dictionary file locally assume that you have downloaded this file yourself.) \n\nThe display needs to be shown on this page.\n\n{{task heading|Related tasks}}\n\n{{Related tasks/Word plays}}\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"V words = File(‘unixdict.txt’).read().split(\"\\n\")\nV ordered = words.filter(word -> word == sorted(word))\nV maxlen = max(ordered, key' w -> w.len).len\nV maxorderedwords = ordered.filter(word -> word.len == :maxlen)\nprint(maxorderedwords.join(‘ ’))\n","language":"11l"},{"code":"(defun longest-ordered-words ()\n (find-longest-ordered-words\n (open 'notes/unixdict!.txt t)))\n\n(defun find-longest-ordered-words\n (h (len . 0) (word) (words))\n (loop\n (until (eof h)\n (close h)\n words)\n (setq word (readline h))\n (cond ((lessp (chars word) len))\n ((not (ordered-p word)))\n ((eq (chars word) len)\n (setq words (cons word words)))\n (t\n (setq len (chars word))\n (setq words (list word))))))\n\n(defun ordered-p (word)\n (nondecreasing-p\n (mapc ordinal (explode word))))\n\n(defun nondecreasing-p (numbers)\n (or (null numbers)\n (null (cdr numbers))\n (and (not (greaterp (car numbers) (cadr numbers)))\n (nondecreasing-p (cdr numbers)))))\n","language":"Acornsoft-Lisp"},{"code":"CHAR ARRAY line(256)\n\nBYTE FUNC IsOrderedWord(CHAR ARRAY word)\n BYTE len,i\n\n len=word(0)\n IF len<=1 THEN RETURN (1) FI\n\n FOR i=1 TO len-1\n DO\n IF word(i)>word(i+1) THEN\n RETURN (0)\n FI\n OD\nRETURN (1)\n\nBYTE FUNC FindLongestOrdered(CHAR ARRAY fname)\n BYTE max,dev=[1]\n\n max=0\n Close(dev)\n Open(dev,fname,4)\n WHILE Eof(dev)=0\n DO\n InputSD(dev,line)\n IF line(0)>max AND IsOrderedWord(line)=1 THEN\n max=line(0)\n FI\n OD\n Close(dev)\nRETURN (max)\n\nPROC FindWords(CHAR ARRAY fname BYTE n)\n BYTE count,dev=[1]\n\n Close(dev)\n Open(dev,fname,4)\n WHILE Eof(dev)=0\n DO\n InputSD(dev,line)\n IF line(0)=n AND IsOrderedWord(line)=1 THEN\n Print(line) Put(32)\n FI\n OD\n Close(dev)\nRETURN\n\nPROC Main()\n CHAR ARRAY fname=\"H6:UNIXDICT.TXT\"\n BYTE max\n\n PrintE(\"Finding the longest words...\")\n PutE()\n max=FindLongestOrdered(fname)\n\n FindWords(fname,max)\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO, Ada.Containers.Indefinite_Vectors;\nuse Ada.Text_IO;\n\nprocedure Ordered_Words is\n package Word_Vectors is new Ada.Containers.Indefinite_Vectors\n (Index_Type => Positive, Element_Type => String);\n use Word_Vectors;\n File : File_Type;\n Ordered_Words : Vector;\n Max_Length : Positive := 1;\nbegin\n Open (File, In_File, \"unixdict.txt\");\n while not End_Of_File (File) loop\n declare\n Word : String := Get_Line (File);\n begin\n if (for all i in Word'First..Word'Last-1 => Word (i) <= Word(i+1)) then\n if Word'Length > Max_Length then\n Max_Length := Word'Length;\n Ordered_Words.Clear;\n Ordered_Words.Append (Word);\n elsif Word'Length = Max_Length then\n Ordered_Words.Append (Word);\n end if;\n end if;\n end;\n end loop;\n for Word of Ordered_Words loop\n Put_Line (Word);\n end loop;\n Close (File);\nend Ordered_Words;\n","language":"Ada"},{"code":"integer\nordered(data s)\n{\n integer a, c, p;\n\n a = 1;\n\n p = -1;\n for (, c in s) {\n if (c < p) {\n a = 0;\n break;\n } else {\n p = c;\n }\n }\n\n a;\n}\n\ninteger\nmain(void)\n{\n file f;\n text s;\n index x;\n\n f.affix(\"unixdict.txt\");\n\n while (f.line(s) != -1) {\n if (ordered(s)) {\n x.v_list(~s).append(s);\n }\n }\n\n l_ucall(x.back, o_, 0, \"\\n\");\n\n return 0;\n}\n","language":"Aime"},{"code":"PROC ordered = (STRING s)BOOL:\n BEGIN\n FOR i TO UPB s - 1 DO IF s[i] > s[i+1] THEN return false FI OD;\n TRUE EXIT\n return false: FALSE\n END;\n\nIF FILE input file;\n STRING file name = \"unixdict.txt\";\n open(input file, file name, stand in channel) /= 0\nTHEN\n print((\"Unable to open file \"\"\" + file name + \"\"\"\", newline))\nELSE\n BOOL at eof := FALSE;\n on logical file end (input file, (REF FILE f)BOOL: at eof := TRUE);\n\n FLEX [1:0] STRING words;\n INT idx := 1;\n INT max length := 0;\n\n WHILE NOT at eof\n DO\n STRING word;\n get(input file, (word, newline));\n IF UPB word >= max length\n THEN IF ordered(word)\n THEN\n max length := UPB word;\n IF idx > UPB words\n THEN\n [1 : UPB words + 20] STRING tmp;\n tmp[1 : UPB words] := words;\n words := tmp\n FI;\n words[idx] := word;\n idx +:= 1\n FI\n FI\n OD;\n print((\"Maximum length of ordered words: \", whole(max length, -4), newline));\n FOR i TO idx-1\n DO\n IF UPB words[i] = max length THEN print((words[i], newline)) FI\n OD\nFI\n","language":"ALGOL-68"},{"code":"#include <basico.h>\n\n#define MAX_LINE 30\n\nalgoritmo\n\n fd=0\n word={}, result={}\n old_word=\"\",new_word=\"\"\n\n fijar separador (NULO)\n\n abrir para leer(\"basica/unixdict.txt\",fd)\n\n iterar mientras ' no es fin de archivo (fd) '\n usando 'MAX_LINE', leer línea desde(fd),\n ---copiar en 'old_word'---, separar para 'word '\n word, ---retener--- ordenar esto,\n encadenar en 'new_word'\n\n new_word, meter según (#(old_word == new_word), result)\n\n reiterar\n\n cerrar archivo(fd)\n\n result ---retener---, obtener largo ---retener---\n obtener máximo valor, es mayor o igual?, replicar esto\n compactar esto\n\n fijar separador 'NL', luego imprime todo\n\nterminar\n","language":"Amazing-Hopper"},{"code":"result←longest_ordered_words file_path\n\nf←file_path ⎕NTIE 0 ⍝ open file\ntext←⎕NREAD f 'char8' ⍝ read vector of 8bit chars\n⎕NUNTIE f ⍝ close file\n\nlines←text⊂⍨~text∊(⎕UCS 10 13) ⍝ split into lines (\\r\\n)\n\n⍝ filter only words with ordered characters\nordered_words←lines/⍨{(⍳∘≢≡⍋)⍵}¨lines\n\n⍝ find max of word lengths, filter only words with that length\nresult←ordered_words/⍨lengths=⍨⌈/lengths←≢¨ordered_words\n","language":"APL"},{"code":"use AppleScript version \"2.3.1\" -- Mac OS 10.9 (Mavericks) or later — for these 'use' commands.\nuse sorter : script \"Insertion sort\" -- https://www.rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#AppleScript.\nuse scripting additions\n\non longestOrderedWords(wordList)\n script o\n property allWords : wordList\n property orderedWords : {}\n end script\n\n set longestWordLength to 0\n set astid to AppleScript's text item delimiters\n set AppleScript's text item delimiters to \"\"\n ignoring case\n repeat with i from 1 to (count o's allWords)\n set thisWord to item i of o's allWords\n set thisWordLength to (count thisWord)\n if (thisWordLength ≥ longestWordLength) then\n set theseCharacters to thisWord's characters\n tell sorter to sort(theseCharacters, 1, -1)\n set sortedWord to theseCharacters as text\n if (sortedWord = thisWord) then\n if (thisWordLength > longestWordLength) then\n set o's orderedWords to {thisWord}\n set longestWordLength to thisWordLength\n else\n set end of o's orderedWords to thisWord\n end if\n end if\n end if\n end repeat\n end ignoring\n set AppleScript's text item delimiters to astid\n\n return (o's orderedWords)\nend longestOrderedWords\n\n-- Test code:\nlocal wordList\nset wordList to paragraphs of (read (((path to desktop as text) & \"www.rosettacode.org:unixdict.txt\") as alias) as «class utf8»)\n-- ignoring white space, punctuation and diacriticals\nreturn longestOrderedWords(wordList)\n--- end ignoring\n","language":"AppleScript"},{"code":"{\"abbott\", \"accent\", \"accept\", \"access\", \"accost\", \"almost\", \"bellow\", \"billow\", \"biopsy\", \"chilly\", \"choosy\", \"choppy\", \"effort\", \"floppy\", \"glossy\", \"knotty\"}\n","language":"AppleScript"},{"code":"ordered?: function [w]->\n w = join sort split w\n\nwords: read.lines relative \"unixdict.txt\"\nret: new []\nloop words 'wrd [\n if ordered? wrd ->\n 'ret ++ #[w: wrd l: size wrd]\n]\n\nsort.descending.by: 'l 'ret\nmaxl: get first ret 'l\nprint sort map select ret 'x -> maxl = x\\l\n 'x -> x\\w\n","language":"Arturo"},{"code":"MaxLen=0\nLoop, Read, UnixDict.txt ; Assigns A_LoopReadLine to each line of the file\n{\n thisword := A_LoopReadLine ; Just for readability\n blSort := isSorted(thisWord) ; reduce calls to IsSorted to improve performance\n ThisLen := StrLen(ThisWord) ; reduce calls to StrLen to improve performance\n If (blSort = true and ThisLen = maxlen)\n list .= \", \" . thisword\n Else If (blSort = true and ThisLen > maxlen)\n {\n list := thisword\n maxlen := ThisLen\n }\n}\n\nIsSorted(word){ ; This function uses the ASCII value of the letter to determine its place in the alphabet.\n ; Thankfully, the dictionary is in all lowercase\n lastchar=0\n Loop, parse, word\n {\n if ( Asc(A_LoopField) < lastchar )\n return false\n lastchar := Asc(A_loopField)\n }\n return true\n}\n\nGUI, Add, Edit, w300 ReadOnly, %list%\nGUI, Show\nreturn ; End Auto-Execute Section\n\nGUIClose:\nExitApp\n","language":"AutoHotkey"},{"code":"BEGIN {\n\tabc = \"abcdefghijklmnopqrstuvwxyz\"\n}\n\n{\n\t# Check if this line is an ordered word.\n\tordered = 1 # true\n\tleft = -1\n\tfor (i = 1; i <= length($0); i++) {\n\t\tright = index(abc, substr($0, i, 1))\n\t\tif (right == 0 || left > right) {\n\t\t\tordered = 0 # false\n\t\t\tbreak\n\t\t}\n\t\tleft = right\n\t}\n\n\tif (ordered) {\n\t\tscore = length($0)\n\t\tif (score > best[\"score\"]) {\n\t\t\t# Reset the list of best ordered words.\n\t\t\tbest[\"score\"] = score\n\t\t\tbest[\"count\"] = 1\n\t\t\tbest[1] = $0\n\t\t} else if (score == best[\"score\"]) {\n\t\t\t# Add this word to the list.\n\t\t\tbest[++best[\"count\"]] = $0\n\t\t}\n\t}\n}\n\nEND {\n\t# Print the list of best ordered words.\n\tfor (i = 1; i <= best[\"count\"]; i++)\n\t\tprint best[i]\n}\n","language":"AWK"},{"code":"'Ordered words - improved version\nOPTION COLLAPSE TRUE\n\nlist$ = LOAD$(\"unixdict.txt\")\n\nFOR word$ IN list$ STEP NL$\n\n term$ = EXTRACT$(SORT$(EXPLODE$(word$, 1)), \" \")\n\n IF word$ = term$ THEN\n IF LEN(term$) > MaxLen THEN\n MaxLen = LEN(term$)\n result$ = word$\n ELIF LEN(term$) = MaxLen THEN\n result$ = APPEND$(result$, 0, word$, NL$)\n END IF\n END IF\nNEXT\n\nPRINT result$\n","language":"BaCon"},{"code":" dict% = OPENIN(\"unixdict.txt\")\n IF dict%=0 ERROR 100, \"Failed to open dictionary file\"\n\n max% = 2\n REPEAT\n A$ = GET$#dict%\n IF LENA$ >= max% THEN\n i% = 0\n REPEAT i% += 1\n UNTIL ASCMID$(A$,i%) > ASCMID$(A$,i%+1)\n IF i% = LENA$ THEN\n IF i% > max% max% = i% : list$ = \"\"\n list$ += A$ + CHR$13 + CHR$10\n ENDIF\n ENDIF\n UNTIL EOF#dict%\n CLOSE #dict%\n PRINT list$\n END\n","language":"BBC-BASIC"},{"code":"00p30p>_010p120p0>#v0~>>\\$::48*\\`\\\"~\"`+!>>#v_$:#v_>30g:!#v_1-30p55+0>:30g3+g\\1v\n>0#v _$^#::\\p04:<^+>#1^#\\p01:p02*g02!`\\g01:<@$ _ ,#!>#:<$<^<!:g03$<_^#!`\\g00:+<\n^<o>\\30g2+p40g1+^0p00p03+1*g03!-g00 < < < < < <:>#$:#$00g#<\\#<`#<!#<2#$0g#<*#<_\n","language":"Befunge"},{"code":" words←•FLines \"unixdict.txt\"\n ¯1⊑(≠¨⊔⊢)(↕∘≠≡⍋)¨⊸/words\n⟨ \"abbott\" \"accent\" \"accept\" \"access\" \"accost\" \"almost\" \"bellow\" \"billow\" \"biopsy\" \"chilly\" \"choosy\" \"choppy\" \"effort\" \"floppy\" \"glossy\" \"knotty\" ⟩\n","language":"BQN"},{"code":" ( orderedWords\n = bow result longestLength word character\n . 0:?bow\n & :?result\n & 0:?longestLength\n & @( get$(!arg,STR)\n : ?\n ( [!bow %?word \\n [?bow ?\n & @( !word\n : ( ? %@?character <%@!character ?\n | ?\n ( [!longestLength\n & !word !result:?result\n | [>!longestLength:[?longestLength\n & !word:?result\n |\n )\n )\n )\n & ~`\n )\n )\n | !result\n )\n& orderedWords$\"unixdict.txt\"\n","language":"Bracmat"},{"code":"ln{so}f[^^{L[}>mL[bx(==)[+(L[)+]f[uN\n","language":"Burlesque"},{"code":"#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <assert.h>\n\n\n#define MAXLEN 100\ntypedef char TWord[MAXLEN];\n\n\ntypedef struct Node {\n TWord word;\n struct Node *next;\n} Node;\n\n\nint is_ordered_word(const TWord word) {\n assert(word != NULL);\n int i;\n\n for (i = 0; word[i] != '\\0'; i++)\n if (word[i] > word[i + 1] && word[i + 1] != '\\0')\n return 0;\n\n return 1;\n}\n\n\nNode* list_prepend(Node* words_list, const TWord new_word) {\n assert(new_word != NULL);\n Node *new_node = malloc(sizeof(Node));\n if (new_node == NULL)\n exit(EXIT_FAILURE);\n\n strcpy(new_node->word, new_word);\n new_node->next = words_list;\n return new_node;\n}\n\n\nNode* list_destroy(Node *words_list) {\n while (words_list != NULL) {\n Node *temp = words_list;\n words_list = words_list->next;\n free(temp);\n }\n\n return words_list;\n}\n\n\nvoid list_print(Node *words_list) {\n while (words_list != NULL) {\n printf(\"\\n%s\", words_list->word);\n words_list = words_list->next;\n }\n}\n\n\nint main() {\n FILE *fp = fopen(\"unixdict.txt\", \"r\");\n if (fp == NULL)\n return EXIT_FAILURE;\n\n Node *words = NULL;\n TWord line;\n unsigned int max_len = 0;\n\n while (fscanf(fp, \"%99s\\n\", line) != EOF) {\n if (strlen(line) > max_len && is_ordered_word(line)) {\n max_len = strlen(line);\n words = list_destroy(words);\n words = list_prepend(words, line);\n } else if (strlen(line) == max_len && is_ordered_word(line)) {\n words = list_prepend(words, line);\n }\n }\n\n fclose(fp);\n list_print(words);\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <assert.h>\n\n\n#define MAXLEN 100\ntypedef char TWord[MAXLEN];\n\n\ntypedef struct WordsArray {\n TWord *words;\n size_t len;\n} WordsArray;\n\n\nint is_ordered_word(const TWord word) {\n assert(word != NULL);\n int i;\n\n for (i = 0; word[i] != '\\0'; i++)\n if (word[i] > word[i + 1] && word[i + 1] != '\\0')\n return 0;\n\n return 1;\n}\n\n\nvoid array_append(WordsArray *words_array, const TWord new_word) {\n assert(words_array != NULL);\n assert(new_word != NULL);\n assert((words_array->len == 0) == (words_array->words == NULL));\n\n words_array->len++;\n words_array->words = realloc(words_array->words,\n words_array->len * sizeof(words_array->words[0]));\n if (words_array->words == NULL)\n exit(EXIT_FAILURE);\n strcpy(words_array->words[words_array->len-1], new_word);\n}\n\n\nvoid array_free(WordsArray *words_array) {\n assert(words_array != NULL);\n free(words_array->words);\n words_array->words = NULL;\n words_array->len = 0;\n}\n\n\nvoid list_print(WordsArray *words_array) {\n assert(words_array != NULL);\n size_t i;\n for (i = 0; i < words_array->len; i++)\n printf(\"\\n%s\", words_array->words[i]);\n}\n\n\nint main() {\n FILE *fp = fopen(\"unixdict.txt\", \"r\");\n if (fp == NULL)\n return EXIT_FAILURE;\n\n WordsArray words;\n words.len = 0;\n words.words = NULL;\n\n TWord line;\n line[0] = '\\0';\n unsigned int max_len = 0;\n\n while (fscanf(fp, \"%99s\\n\", line) != EOF) { // 99 = MAXLEN - 1\n if (strlen(line) > max_len && is_ordered_word(line)) {\n max_len = strlen(line);\n array_free(&words);\n array_append(&words, line);\n } else if (strlen(line) == max_len && is_ordered_word(line)) {\n array_append(&words, line);\n }\n }\n\n fclose(fp);\n list_print(&words);\n array_free(&words);\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <sys/mman.h>\n#include <sys/types.h>\n#include <sys/stat.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <err.h>\n#include <string.h>\n\nint ordered(char *s, char **end)\n{\n\tint r = 1;\n\twhile (*++s != '\\n' && *s != '\\r' && *s != '\\0')\n\t\tif (s[0] < s[-1]) r = 0;\n\n\t*end = s;\n\treturn r;\n}\n\nint main()\n{\n\tchar *buf, *word, *end, *tail;\n\tstruct stat st;\n\tint longest = 0, len, fd;\n\n\tif ((fd = open(\"unixdict.txt\", O_RDONLY)) == -1) err(1, \"read error\");\n\n\tfstat(fd, &st);\n\tif (!(buf = mmap(0, st.st_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0)))\n\t\terr(1, \"mmap\");\n\n\tfor (word = end = buf; end < buf + st.st_size; word = end) {\n\t\twhile (*word == '\\r' || *word == '\\n') word++;\n\t\tif (!ordered(word, &end)) continue;\n\t\tif ((len = end - word + 1) < longest) continue;\n\t\tif (len > longest) {\n\t\t\ttail = buf; /* longer words found; reset out buffer */\n\t\t\tlongest = len;\n\t\t}\n\t\t/* use the same mmap'd region to store output. because of MAP_PRIVATE,\n\t\t * change will not go back to file. mmap is copy on write, and we are using\n\t\t * only the head space to store output, so kernel doesn't need to copy more\n\t\t * than the words we saved--in this case, one page tops.\n\t\t */\n\t\tmemcpy(tail, word, len);\n\t\ttail += len;\n\t\t*tail = '\\0';\n\t}\n\tprintf(buf);\n\n\tmunmap(buf, st.st_size);\n\tclose(fd);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <iterator>\n#include <string>\n#include <vector>\n\nbool ordered(const std::string &word)\n{\n return std::is_sorted(word.begin(), word.end()); // C++11\n}\n\nint main()\n{\n std::ifstream infile(\"unixdict.txt\");\n if (!infile) {\n std::cerr << \"Can't open word file\\n\";\n return -1;\n }\n\n std::vector<std::string> words;\n std::string word;\n int longest = 0;\n\n while (std::getline(infile, word)) {\n int length = word.length();\n if (length < longest) continue; // don't test short words\n\n if (ordered(word)) {\n if (longest < length) {\n longest = length; // set new minimum length\n words.clear(); // reset the container\n }\n words.push_back(word);\n }\n }\n std::copy(words.begin(), words.end(), std::ostream_iterator<std::string>(std::cout, \"\\n\"));\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Net;\n\nstatic class Program\n{\n static void Main(string[] args)\n {\n WebClient client = new WebClient();\n string text = client.DownloadString(\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\");\n string[] words = text.Split(new char[] { '\\r', '\\n' }, StringSplitOptions.RemoveEmptyEntries);\n\n var query = from w in words\n where IsOrderedWord(w)\n group w by w.Length into ows\n orderby ows.Key descending\n select ows;\n\n Console.WriteLine(string.Join(\", \", query.First().ToArray()));\n }\n\n private static bool IsOrderedWord(string w)\n {\n for (int i = 1; i < w.Length; i++)\n if (w[i] < w[i - 1])\n return false;\n\n return true;\n }\n}\n","language":"C-sharp"},{"code":"(defn is-sorted? [coll]\n (not-any? pos? (map compare coll (next coll))))\n\n(defn take-while-eqcount [coll]\n (let [n (count (first coll))]\n (take-while #(== n (count %)) coll)))\n\n(with-open [rdr (clojure.java.io/reader \"unixdict.txt\")]\n (->> rdr\n line-seq\n (filter is-sorted?)\n (sort-by count >)\n take-while-eqcount\n (clojure.string/join \", \")\n println))\n","language":"Clojure"},{"code":"abbott, accent, accept, access, accost, almost, bellow, billow, biopsy, chilly, choosy, choppy, effort, floppy, glossy, knotty\n","language":"Clojure"},{"code":"is_ordered = proc (s: string) returns (bool)\n last: char := '\\000'\n for c: char in string$chars(s) do\n if last > c then return(false) end\n last := c\n end\n return(true)\nend is_ordered\n\nlines = iter (s: stream) yields (string)\n while true do\n yield(stream$getl(s))\n except when end_of_file: break end\n end\nend lines\n\nordered_words = proc (s: stream) returns (array[string])\n words: array[string]\n max_len: int := 0\n for word: string in lines(s) do\n if is_ordered(word) then\n len: int := string$size(word)\n if len > max_len then\n max_len := len\n words := array[string]$[]\n elseif len = max_len then\n array[string]$addh(words,word)\n end\n end\n end\n return(words)\nend ordered_words\n\nstart_up = proc ()\n dict: stream := stream$open(file_name$parse(\"unixdict.txt\"), \"read\")\n words: array[string] := ordered_words(dict)\n stream$close(dict)\n\n po: stream := stream$primary_output()\n for word: string in array[string]$elements(words) do\n stream$putl(po, word)\n end\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. ABC-WORDS.\n\n ENVIRONMENT DIVISION.\n INPUT-OUTPUT SECTION.\n FILE-CONTROL.\n SELECT DICT ASSIGN TO DISK\n ORGANIZATION LINE SEQUENTIAL.\n\n DATA DIVISION.\n FILE SECTION.\n FD DICT\n LABEL RECORD STANDARD\n VALUE OF FILE-ID IS \"unixdict.txt\".\n 01 ENTRY.\n 03 WORD PIC X(32).\n 03 LETTERS PIC X OCCURS 32 TIMES, REDEFINES WORD.\n\n WORKING-STORAGE SECTION.\n 01 LEN PIC 99.\n 01 MAXLEN PIC 99 VALUE 0.\n 01 I PIC 99.\n 01 OK-FLAG PIC X.\n 88 OK VALUE '*'.\n\n PROCEDURE DIVISION.\n BEGIN.\n OPEN INPUT DICT.\n\n FIND-LONGEST-WORD.\n READ DICT, AT END CLOSE DICT, GO TO PRINT-LONGEST-WORDS.\n PERFORM CHECK-WORD.\n GO TO FIND-LONGEST-WORD.\n\n PRINT-LONGEST-WORDS.\n ALTER VALID-WORD TO PROCEED TO SHOW-WORD.\n OPEN INPUT DICT.\n\n READ-WORDS.\n READ DICT, AT END CLOSE DICT, STOP RUN.\n PERFORM CHECK-WORD.\n GO TO READ-WORDS.\n\n CHECK-WORD.\n MOVE ZERO TO LEN.\n INSPECT WORD TALLYING LEN\n FOR CHARACTERS BEFORE INITIAL SPACE.\n MOVE '*' TO OK-FLAG.\n PERFORM CHECK-CHAR-PAIR VARYING I FROM 2 BY 1\n UNTIL NOT OK OR I IS GREATER THAN LEN.\n IF OK, PERFORM DO-WORD.\n\n CHECK-CHAR-PAIR.\n IF LETTERS(I - 1) IS GREATER THAN LETTERS(I),\n MOVE SPACE TO OK-FLAG.\n\n DO-WORD SECTION.\n VALID-WORD.\n GO TO CHECK-LENGTH.\n CHECK-LENGTH.\n IF LEN IS GREATER THAN MAXLEN, MOVE LEN TO MAXLEN.\n GO TO DONE.\n SHOW-WORD.\n IF LEN IS EQUAL TO MAXLEN, DISPLAY WORD.\n DONE.\n EXIT.\n","language":"COBOL"},{"code":"ordered_word = (word) ->\n for i in [0...word.length - 1]\n return false unless word[i] <= word[i+1]\n true\n\nshow_longest_ordered_words = (candidates, dict_file_name) ->\n words = ['']\n for word in candidates\n continue if word.length < words[0].length\n if ordered_word word\n words = [] if word.length > words[0].length\n words.push word\n return if words[0] == '' # we came up empty\n console.log \"Longest Ordered Words (source=#{dict_file_name}):\"\n for word in words\n console.log word\n\ndict_file_name = 'unixdict.txt'\nfile_content = require('fs').readFileSync dict_file_name\ndict_words = file_content.toString().split '\\n'\nshow_longest_ordered_words dict_words, dict_file_name\n","language":"CoffeeScript"},{"code":"> coffee ordered_words.coffee\nLongest Ordered Words (source=unixdict.txt):\nabbott\naccent\naccept\naccess\naccost\nalmost\nbellow\nbillow\nbiopsy\nchilly\nchoosy\nchoppy\neffort\nfloppy\nglossy\nknotty\n","language":"CoffeeScript"},{"code":"(defun orderedp (word)\n (reduce (lambda (prev curr)\n (when (char> prev curr) (return-from orderedp nil))\n curr)\n word)\n t)\n\n(defun longest-ordered-words (filename)\n (let ((result nil))\n (with-open-file (s filename)\n (loop\n with greatest-length = 0\n for word = (read-line s nil)\n until (null word)\n do (let ((length (length word)))\n (when (and (>= length greatest-length)\n (orderedp word))\n (when (> length greatest-length)\n (setf greatest-length length\n result nil))\n (push word result)))))\n (nreverse result)))\n\nCL-USER> (longest-ordered-words \"unixdict.txt\")\n(\"abbott\" \"accent\" \"accept\" \"access\" \"accost\" \"almost\" \"bellow\" \"billow\"\n \"biopsy\" \"chilly\" \"choosy\" \"choppy\" \"effort\" \"floppy\" \"glossy\" \"knotty\")\n","language":"Common-Lisp"},{"code":"(defun orderedp (word)\n (apply #'char<= (coerce word 'list)))\n\n(let* ((words (uiop:read-file-lines \"unixdict.txt\"))\n\t (ordered (delete-if-not #'orderedp words))\n\t (maxlen (apply #'max (mapcar #'length ordered)))\n\t (result (delete-if-not (lambda (l) (= l maxlen)) ordered :key #'length)))\n (format t \"~{~A~^, ~}\" result))\n","language":"Common-Lisp"},{"code":"include \"cowgol.coh\";\ninclude \"strings.coh\";\ninclude \"file.coh\";\n\nvar filename: [uint8] := \"unixdict.txt\";\n\n# Call a subroutine for every line in a file\ninterface LineCb(line: [uint8]);\nsub ForEachLine(fcb: [FCB], fn: LineCb) is\n var linebuf: uint8[256];\n var bufptr := &linebuf[0];\n\n var len := FCBExt(fcb); # get length of file\n FCBSeek(fcb, 0); # start at beginning of file\n\n while len > 0 loop\n var ch := FCBGetChar(fcb);\n if ch == '\\n' then\n # end of line, terminate string\n [bufptr] := 0;\n fn(&linebuf[0]);\n bufptr := &linebuf[0];\n else\n # add char to buffer\n [bufptr] := ch;\n bufptr := @next bufptr;\n end if;\n len := len - 1;\n end loop;\n\n # If the file doesn't cleanly end on a line terminator,\n # also call for last incomplete line\n if ch != '\\n' then\n [bufptr] := 0;\n fn(&linebuf[0]);\n end if;\nend sub;\n\n# Check if the letters in a word appear in alphabetical order\nsub isOrdered(word: [uint8]): (r: uint8) is\n var cr := [word];\n word := @next word;\n loop\n var cl := cr;\n cr := [word];\n word := @next word;\n if cr < 32 then\n r := 1;\n return;\n elseif (cl | 32) > (cr | 32) then\n r := 0;\n return;\n end if;\n end loop;\nend sub;\n\n# Find maximum length of ordered words\nvar maxLen: uint8 := 0;\nsub MaxOrderedLength implements LineCb is\n var len := StrLen(line) as uint8;\n if maxLen < len and isOrdered(line) != 0 then\n maxLen := len;\n end if;\nend sub;\n\n# Print all ordered words matching maximum length\nsub PrintMaxLenWord implements LineCb is\n if maxLen == StrLen(line) as uint8 and isOrdered(line) != 0 then\n print(line);\n print_nl();\n end if;\nend sub;\n\nvar fcb: FCB;\nif FCBOpenIn(&fcb, filename) != 0 then\n print(\"cannot open unixdict.txt\\n\");\n ExitWithError();\nend if;\n\nForEachLine(&fcb, MaxOrderedLength);\nForEachLine(&fcb, PrintMaxLenWord);\n\nvar foo := FCBClose(&fcb);\n","language":"Cowgol"},{"code":"void main() {\n import std.stdio, std.algorithm, std.range, std.string;\n\n string[] result;\n size_t maxLen;\n\n foreach (string word; \"unixdict.txt\".File.lines) {\n word = word.chomp;\n immutable len = word.walkLength;\n if (len < maxLen || !word.isSorted)\n continue;\n if (len > maxLen) {\n result = [word];\n maxLen = len;\n } else\n result ~= word;\n }\n\n writefln(\"%-(%s\\n%)\", result);\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.algorithm, std.file, std.range;\n\n string[] result;\n size_t maxWalkLen;\n\n foreach (word; \"unixdict.txt\".readText.splitter) {\n if (word.length >= maxWalkLen && word.isSorted) {\n immutable wlen = word.walkLength;\n if (wlen > maxWalkLen) {\n result.length = 0;\n maxWalkLen = wlen;\n }\n result ~= word.idup;\n }\n }\n\n writefln(\"%-(%s\\n%)\", result);\n}\n","language":"D"},{"code":"void main() {\n import std.stdio, std.algorithm, std.range, std.file, std.string;\n\n auto words = \"unixdict.txt\".readText.split.filter!isSorted;\n immutable maxLen = words.map!q{a.length}.reduce!max;\n writefln(\"%-(%s\\n%)\", words.filter!(w => w.length == maxLen));\n}\n","language":"D"},{"code":"import std.stdio, core.stdc.string, std.mmfile, std.algorithm;\n\nconst(char)[] findWord(const char[] s) pure nothrow @safe @nogc {\n size_t wordEnd = 0;\n while (wordEnd < s.length && s[wordEnd] != '\\n' && s[wordEnd] != '\\r')\n wordEnd++;\n return s[0 .. wordEnd];\n}\n\nvoid main() {\n auto mmf = new MmFile(\"unixdict.txt\", MmFile.Mode.readCopyOnWrite, 0, null);\n auto txt = cast(char[])(mmf[]);\n size_t maxLen = 0, outStart = 0;\n\n for (size_t wordStart = 0; wordStart < txt.length; ) {\n while (wordStart < txt.length &&\n (txt[wordStart] == '\\r' || txt[wordStart] == '\\n'))\n wordStart++;\n const word = findWord(txt[wordStart .. $]);\n wordStart += word.length;\n\n if (word.length < maxLen || !word.isSorted)\n continue;\n if (word.length > maxLen) {\n // Longer ordered word found, reset the out buffer.\n outStart = 0;\n maxLen = word.length;\n }\n\n // Use the same mmap'd region to store output. Because of\n // Mode.readCopyOnWrite, change will not go back to file.\n // We are using only the head space to store output, so\n // kernel doesn't need to copy more than the words we saved,\n // in this case, one page tops.\n memcpy(&txt[outStart], word.ptr, word.length);\n outStart += word.length;\n txt[outStart++] = '\\n'; // Words separator in out buffer.\n }\n\n txt[0 .. outStart].write;\n}\n","language":"D"},{"code":"program POrderedWords;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils, Classes, IdHTTP;\n\nfunction IsOrdered(const s:string): Boolean;\nvar\n I: Integer;\nbegin\n Result := Length(s)<2; // empty or 1 char strings are ordered\n for I := 2 to Length(s) do\n if s[I]<s[I-1] then // can improve using case/localization to order...\n Exit;\n Result := True;\nend;\n\nfunction ProcessDictionary(const AUrl: string): string;\nvar\n slInput: TStringList;\n I, WordSize: Integer;\nbegin\n slInput := TStringList.Create;\n try\n with TIdHTTP.Create(nil) do try\n slInput.Text := Get(AUrl);\n finally\n Free;\n end;\n // or use slInput.LoadFromFile('yourfilename') to load from a local file\n WordSize :=0;\n for I := 0 to slInput.Count-1 do begin\n if IsOrdered(slInput[I]) then\n if (Length(slInput[I]) = WordSize) then\n Result := Result + slInput[I] + ' '\n else if (Length(slInput[I]) > WordSize) then begin\n Result := slInput[I] + ' ';\n WordSize := Length(slInput[I]);\n end;\n end;\n finally\n slInput.Free;\n end;\nend;\n\nbegin\n try\n WriteLn(ProcessDictionary('http://www.puzzlers.org/pub/wordlists/unixdict.txt'));\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n","language":"Delphi"},{"code":"abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty\n","language":"Delphi"},{"code":"\\util.g\n\nproc nonrec is_ordered(*char str) bool:\n while str* /= '\\e' and str* <= (str+1)* do\n str := str + 1\n od;\n str* = '\\e' or (str+1)* = '\\e'\ncorp\n\nproc nonrec main() void:\n [64]char buf;\n *char str;\n word length, max_length;\n file(1024) dictfile;\n channel input text dict;\n\n str := &buf[0];\n max_length := 0;\n open(dict, dictfile, \"unixdict.txt\");\n while readln(dict; str) do\n if is_ordered(str) then\n length := CharsLen(str);\n if length > max_length then max_length := length fi\n fi\n od;\n close(dict);\n\n open(dict, dictfile, \"unixdict.txt\");\n while readln(dict; str) do\n if is_ordered(str) then\n length := CharsLen(str);\n if length = max_length then writeln(str) fi\n fi\n od;\n close(dict)\ncorp\n","language":"Draco"},{"code":"pragma.enable(\"accumulator\")\n\ndef words := <http://www.puzzlers.org/pub/wordlists/unixdict.txt>.getText().split(\"\\n\")\ndef ordered := accum [] for word ? (word.sort() <=> word) in words { _.with(word) }\ndef maxLen := accum 0 for word in ordered { _.max(word.size()) }\ndef maxOrderedWords := accum [] for word ? (word.size() <=> maxLen) in ordered { _.with(word) }\nprintln(\" \".rjoin(maxOrderedWords))\n","language":"E"},{"code":"def best := [].diverge()\nfor `@word$\\n` ? (word.sort() <=> word) in <http://www.puzzlers.org/pub/wordlists/unixdict.txt> {\n if (best.size() == 0) {\n best.push(word)\n } else if (word.size() > best[0].size()) {\n best(0) := [word] # replace all\n } else if (word.size() <=> best[0].size()) {\n best.push(word)\n }\n}\nprintln(\" \".rjoin(best.snapshot()))\n","language":"E"},{"code":"(define (ordered? str)\n (for/and ([i (in-range 1 (string-length str))])\n (string-ci<=? (string-ref str (1- i)) (string-ref str i))))\n\n(define (ordre words)\n(define wl 0)\n(define s 's)\n\t(for/fold (len 0) ((w words))\n\t\t(set! wl (string-length w))\n\t\t#:continue (< wl len)\n\t\t#:when (ordered? w)\n\t\t#:continue (and (= len wl) (push s w))\n\t\t(push (stack s) w) ;; start a new list of length wl\n\t\twl)\n\t(stack->list s))\n\t\n;; output\n(load 'unixdict)\n(ordre (text-parse unixdict))\n → (abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty)\n\n;; with the dictionaries provided with EchoLisp\n;; french\n → (accentué) ;; ordered, longest, and ... self-reference\n;; english\n → (Adelops alloquy beefily begorry billowy egilops)\n","language":"EchoLisp"},{"code":"File.read!(\"unixdict.txt\")\n|> String.split\n|> Enum.filter(fn word -> String.codepoints(word) |> Enum.sort |> Enum.join == word end)\n|> Enum.group_by(fn word -> String.length(word) end)\n|> Enum.max_by(fn {length,_words} -> length end)\n|> elem(1)\n|> Enum.sort\n|> Enum.each(fn word -> IO.puts word end)\n","language":"Elixir"},{"code":"-module( ordered_words ).\n\n-export( [is_ordered/1, task/0] ).\n\nis_ordered( Word ) -> lists:sort( Word ) =:= Word.\n\ntask() ->\n ok = find_unimplemented_tasks:init_http(),\n Ordered_words = [X || X <- words(), is_ordered(X)],\n Sorted_longest_length_first = lists:reverse( sort_with_length( Ordered_words ) ),\n [{Max_length, _Word1} | _T] = Sorted_longest_length_first,\n Longest_length_first = lists:takewhile( fun({Length, _Word2}) -> Length =:= Max_length end, Sorted_longest_length_first ),\n [X || {_Length, X} <- Longest_length_first].\n\n\n\nsort_with_length( Words ) ->\n Words_with_length_first = [{erlang:length(X), X} || X <- Words],\n lists:sort( Words_with_length_first ).\n\nwords() -> anagrams_deranged:words_from_url( \"http://www.puzzlers.org/pub/wordlists/unixdict.txt\" ).\n","language":"Erlang"},{"code":"include misc.e\n\ntype ordered(sequence s)\n for i = 1 to length(s)-1 do\n -- assume all items in the sequence are atoms\n if s[i]>s[i+1] then\n return 0\n end if\n end for\n return 1\nend type\n\ninteger maxlen\nsequence words\nobject word\nconstant fn = open(\"unixdict.txt\",\"r\")\nmaxlen = -1\n\nwhile 1 do\n word = gets(fn)\n if atom(word) then\n exit\n end if\n word = word[1..$-1] -- truncate new-line\n if length(word) >= maxlen and ordered(word) then\n if length(word) > maxlen then\n maxlen = length(word)\n words = {}\n end if\n words = append(words,word)\n end if\nend while\n\nclose(fn)\n\npretty_print(1,words,{2})\n","language":"Euphoria"},{"code":"open System\nopen System.IO\n\nlet longestOrderedWords() =\n let isOrdered = Seq.pairwise >> Seq.forall (fun (a,b) -> a <= b)\n\n File.ReadLines(\"unixdict.txt\")\n |> Seq.filter isOrdered\n |> Seq.groupBy (fun s -> s.Length)\n |> Seq.sortBy (fst >> (~-))\n |> Seq.head |> snd\n\nlongestOrderedWords() |> Seq.iter (printfn \"%s\")\n","language":"F-Sharp"},{"code":"USING: grouping http.client io io.encodings.utf8 io.files\nio.files.temp kernel math memoize sequences sequences.extras\nunicode.case urls ;\nIN: rosetta-code.ordered-words\n\nMEMO: word-list ( -- seq )\n \"unixdict.txt\" temp-file dup exists? [\n URL\" http://puzzlers.org/pub/wordlists/unixdict.txt\"\n over download-to\n ] unless utf8 file-lines ;\n\n: ordered-word? ( word -- ? )\n >lower [ <= ] monotonic? ;\n\n: ordered-words-main ( -- )\n word-list [ ordered-word? ] filter\n all-longest [ print ] each ;\n","language":"Factor"},{"code":"class Main\n{\n public static Bool ordered (Str word)\n {\n word.chars.all |Int c, Int i -> Bool|\n {\n (i == (word.size-1) || c <= word.chars[i+1])\n }\n }\n\n public static Void main ()\n {\n Str[] words := [,]\n File(`unixdict.txt`).eachLine |Str word|\n {\n if (ordered(word))\n {\n if (words.isEmpty || words.first.size < word.size)\n { // reset the list\n words = [word]\n }\n else if (words.size >= 1 && words.first.size == word.size)\n { // add word to existing ones\n words.add (word)\n }\n }\n }\n echo (words.join (\" \"))\n }\n}\n","language":"Fantom"},{"code":"#APPTYPE CONSOLE\n\nFUNCTION RESTfulGET(url)\n DIM %HTTP = CREATEOBJECT(\"WinHttp.WinHttpRequest.5.1\")\n CALLMETHOD(HTTP, \".open %s, %s, %d\", \"GET\", url, FALSE)\n CALLMETHOD(HTTP, \".send\")\n RETURN GETVALUE(\"%s\", HTTP, \".ResponseText\")\nEND FUNCTION\n\nDIM $TEXT = RESTfulGET(\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\")\nDIM dict[] = Split(TEXT, CHR(10))\nDIM max AS INTEGER = UBOUND(dict)\nDIM theword AS STRING\nDIM words[]\nFOR DIM i = 0 TO max\n theWord = dict[i]\n IF isOrdered(theWord) THEN\n words[LEN(theWord)] = words[LEN(theWord)] & \" \" & theWord\n END IF\nNEXT\n\nPRINT words[UBOUND(words)]\n\nPAUSE\n\nFUNCTION isOrdered(s)\n FOR DIM i = 1 TO LEN(s) - 1\n IF s{i} > s{i + 1} THEN\n RETURN FALSE\n END IF\n NEXT\n RETURN TRUE\nEND FUNCTION\n","language":"FBSL"},{"code":"include lib/stmstack.4th \\ include string stack library\n\n: check-word ( a n -- a n f)\n 2dup bl >r \\ start off with a space\n begin\n dup \\ when not end of word\n while\n over c@ r@ >= \\ check character\n while\n r> drop over c@ >r chop \\ chop character off\n repeat r> drop nip 0= \\ cleanup and set flag\n;\n\n: open-file ( -- h)\n 1 dup argn = abort\" Usage: ordered infile\"\n args input open error? abort\" Cannot open file\"\n dup use \\ return and use the handle\n;\n\n: read-file ( --)\n 0 >r \\ begin with zero length\n begin\n refill \\ EOF detected?\n while\n 0 parse dup r@ >= \\ equal or longer string length?\n if \\ check the word and adjust length\n check-word if r> drop dup >r >s else 2drop then\n else \\ if it checks out, put on the stack\n 2drop \\ otherwise drop the word\n then\n repeat r> drop \\ clean it up\n;\n\n: read-back ( --)\n s> dup >r type cr \\ longest string is on top of stack\n begin s> dup r@ >= while type cr repeat\n 2drop r> drop \\ keep printing until shorter word\n; \\ has been found\n\n: ordered ( --)\n open-file s.clear read-file read-back close\n; \\ open file, clear the stack, read file\n \\ read it back and close the file\nordered\n","language":"Forth"},{"code":"!***************************************************************************************\n module ordered_module\n!***************************************************************************************\n implicit none\n\n\t!the dictionary file:\n\tinteger,parameter :: file_unit = 1000\n\tcharacter(len=*),parameter :: filename = 'unixdict.txt'\n\n\t!maximum number of characters in a word:\n\tinteger,parameter :: max_chars = 50\n\n\ttype word\n\t character(len=max_chars) :: str !the word from the dictionary\n\t integer\t:: n = 0 !length of this word\n\t logical\t:: ordered = .false. !if it is an ordered word\n\tend type word\n\n\t!the dictionary structure:\n\ttype(word),dimension(:),allocatable :: dict\n\n\tcontains\n!***************************************************************************************\n\n\t!******************************************************************************\n\t\tfunction count_lines_in_file(fid) result(n_lines)\n\t!******************************************************************************\n\t\timplicit none\n\n\t\tinteger :: n_lines\n\t\tinteger,intent(in) :: fid\t\t\n\t\tcharacter(len=1) :: tmp\n\t\tinteger :: i\n\t\tinteger :: ios\n\n\t\t!the file is assumed to be open already.\n\n\t\trewind(fid)\t !rewind to beginning of the file\n\n\t\tn_lines = 0\n\t\tdo !read each line until the end of the file.\n\t\t\tread(fid,'(A1)',iostat=ios) tmp\n\t\t\tif (ios < 0) exit !End of file\n\t\t\tn_lines = n_lines + 1 !row counter\n\t\tend do\n\n\t\trewind(fid) !rewind to beginning of the file\t\n\n\t!******************************************************************************\n\t\tend function count_lines_in_file\n\t!******************************************************************************\n\n\t!******************************************************************************\n\t pure elemental function ordered_word(word) result(yn)\n\t!******************************************************************************\n\t! turns true if word is an ordered word, false if it is not.\n\t!******************************************************************************\n\t\n\t implicit none\n\t character(len=*),intent(in) :: word\n\t logical :: yn\n\t\n\t integer :: i\n\t\n\t yn = .true.\n\t do i=1,len_trim(word)-1\n\t \tif (ichar(word(i+1:i+1))<ichar(word(i:i))) then\n\t \t\tyn = .false.\n\t \t\texit\n\t \tend if\n\t end do\n\t\n\t!******************************************************************************\n\t end function ordered_word\n\t!******************************************************************************\n\n!***************************************************************************************\n end module ordered_module\n!***************************************************************************************\n\n!****************************************************\n program main\n!****************************************************\n use ordered_module\n implicit none\n\n\tinteger :: i,n,n_max\n\n\t!open the dictionary and read in all the words:\n\topen(unit=file_unit,file=filename) \t\t!open the file\n\tn = count_lines_in_file(file_unit) !count lines in the file\n\tallocate(dict(n)) !allocate dictionary structure\n\tdo i=1,n !\n\t\tread(file_unit,'(A)') dict(i)%str !each line is a word in the dictionary\n\t\tdict(i)%n = len_trim(dict(i)%str) !save word length\n\tend do\t\t\n\tclose(file_unit) !close the file\n\n\t!use elemental procedure to get ordered words:\n\tdict%ordered = ordered_word(dict%str)\t\n\n\t!max length of an ordered word:\n\tn_max = maxval(dict%n, mask=dict%ordered)\n\t\t\n\t!write the output:\n\tdo i=1,n\n\t\tif (dict(i)%ordered .and. dict(i)%n==n_max) write(*,'(A,A)',advance='NO') trim(dict(i)%str),' '\n\tend do\n\twrite(*,*) ''\n\n!****************************************************\n end program main\n!****************************************************\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction isOrdered(s As Const String) As Boolean\n If Len(s) <= 1 Then Return True\n For i As Integer = 1 To Len(s) - 1\n If s[i] < s[i - 1] Then Return False\n Next\n Return True\nEnd Function\n\nDim words() As String\nDim word As String\nDim maxLength As Integer = 0\nDim count As Integer = 0\nOpen \"undict.txt\" For Input As #1\nWhile Not Eof(1)\n Line Input #1, word\n If isOrdered(word) Then\n If Len(word) = maxLength Then\n Redim Preserve words(0 To count)\n words(count) = word\n count += 1\n ElseIf Len(word) > maxLength Then\n Erase words\n maxLength = Len(word)\n Redim words(0 To 0)\n words(0) = word\n count = 1\n End If\n End If\nWend\n\nClose #1\n\nPrint \"The ordered words with the longest length (\"; Str(maxLength); \") in undict.txt are :\"\nPrint\nFor i As Integer = 0 To UBound(words)\n Print words(i)\nNext\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"url=\"https://web.archive.org/web/20180611003215if_/http://www.puzzlers.org:80/pub/wordlists/unixdict.txt\"\na = sort[select[lines[url], {|w| charList[w] == sort[charList[w]] } ], {|a,b| length[a] <=> length[b]}]\nprintln[sort[select[a, {|w, longest| length[w] == longest}, length[last[a]]]]]\n","language":"Frink"},{"code":"#plist NSAppTransportSecurity @{NSAllowsArbitraryLoads:YES}\n\nlocal fn Words as CFArrayRef\n CFURLRef url = fn URLWithString( @\"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\" )\n CFStringRef string = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )\nend fn = fn StringComponentsSeparatedByCharactersInSet( string, fn CharacterSetNewlineSet )\n\n\nlocal fn IsOrderedWord( string as CFStringRef ) as BOOL\n BOOL flag = YES\n long i\n unichar chr, prevChr = 0\n\n for i = 0 to len(string) - 1\n chr = fn StringCharacterAtIndex( string, i )\n if ( chr < prevChr )\n flag = NO : break\n end if\n prevChr = chr\n next\nend fn = flag\n\n\nvoid local fn DoIt\n CFStringRef string\n CFArrayRef words = fn Words\n long length, maxLen = 0\n CFMutableStringRef orderedWords = fn MutableStringWithCapacity(0)\n\n for string in words\n length = len(string)\n if ( length < maxLen ) then continue\n if ( fn IsOrderedWord( string ) )\n if ( length > maxLen )\n MutableStringSetString( orderedWords, @\"\" )\n maxLen = length\n end if\n MutableStringAppendFormat( orderedWords, @\"%@\\n\", string )\n end if\n next\n\n print orderedWords\nend fn\n\nfn DoIt\n\nHandleEvents\n","language":"FutureBasic"},{"code":"Public Sub Main()\nDim sDict As String = File.Load(User.Home &/ \"unixdict.txt\") 'Store the 'Dictionary'\nDim sOrdered As New String[] 'To store ordered words\nDim sHold As New String[] 'General store\nDim sTemp As String 'Temp variable\nDim siCount As Short 'Counter\n\nFor Each sTemp In Split(sDict, gb.NewLine) 'For each word in the Dictionary\n For siCount = 1 To Len(sTemp) 'Loop for each letter in the word\n sHold.Add(Mid(sTemp, siCount, 1)) 'Put each letter in sHold array\n Next\n sHold.Sort() 'Sort sHold (abbott = abboot, zoom = mooz)\n If sTemp = sHold.Join(\"\") Then sOrdered.Add(sTemp) 'If they are the same (abbott(OK) mooz(not OK)) then add to sOrdered\n sHold.Clear 'Empty sHold\nNext\n\nsiCount = 0 'Reset siCount\n\nFor Each sTemp In sOrdered 'For each of the Ordered words\n If Len(sTemp) > siCount Then siCount = Len(sTemp) 'Count the length of the word and keep a record of the longest length\nNext\n\nFor Each sTemp In sOrdered 'For each of the Ordered words\n If Len(sTemp) = siCount Then sHold.Add(sTemp) 'If it is one of the longest add it to sHold\nNext\n\nsHold.Sort() 'Sort sHold\nPrint sHold.Join(gb.NewLine) 'Display the result\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n \"bytes\"\n \"fmt\"\n \"io/ioutil\"\n)\n\nfunc main() {\n // read into memory in one chunk\n b, err := ioutil.ReadFile(\"unixdict.txt\")\n if err != nil {\n fmt.Println(err)\n return\n }\n // split at line ends\n bss := bytes.Split(b, []byte{'\\n'})\n\n // accumulate result\n var longest int\n var list [][]byte\n for _, bs := range bss {\n // don't bother with words shorter than\n // our current longest ordered word\n if len(bs) < longest {\n continue\n }\n // check for ordered property\n var lastLetter byte\n for i := 0; ; i++ {\n if i == len(bs) {\n // end of word. it's an ordered word.\n // save it and break from loop\n if len(bs) > longest {\n longest = len(bs)\n list = list[:0]\n }\n list = append(list, bs)\n break\n }\n // check next letter\n b := bs[i]\n if b < 'a' || b > 'z' {\n continue // not a letter. ignore.\n }\n if b < lastLetter {\n break // word not ordered.\n }\n // letter passes test\n lastLetter = b\n }\n }\n // print result\n for _, bs := range list {\n fmt.Println(string(bs))\n }\n}\n","language":"Go"},{"code":"def isOrdered = { word -> def letters = word as List; letters == ([] + letters).sort() }\nassert isOrdered('abbey')\nassert !isOrdered('cat')\n\ndef dictUrl = new URL('http://www.puzzlers.org/pub/wordlists/unixdict.txt')\ndef orderedWords = dictUrl.readLines().findAll { isOrdered(it) }\ndef owMax = orderedWords*.size().max()\n\norderedWords.findAll { it.size() == owMax }.each { println it }\n","language":"Groovy"},{"code":"-- Words are read from the standard input. We keep in memory only the current\n-- set of longest, ordered words.\n--\n-- Limitation: the locale's collation order is not take into consideration.\n\nisOrdered wws@(_:ws) = and $ zipWith (<=) wws ws\n\nlongestOrderedWords = reverse . snd . foldl f (0,[]) . filter isOrdered\n where f (max, acc) w =\n let len = length w in\n case compare len max of\n LT -> (max, acc)\n EQ -> (max, w:acc)\n GT -> (len, [w])\n\nmain = do\n str <- getContents\n let ws = longestOrderedWords $ words str\n mapM_ putStrLn ws\n","language":"Haskell"},{"code":"abbott\naccent\naccept\naccess\naccost\nalmost\nbellow\nbillow\nbiopsy\nchilly\nchoosy\nchoppy\neffort\nfloppy\nglossy\nknotty\n","language":"Haskell"},{"code":"import Control.Monad (liftM)\n\nisSorted wws@(_ : ws) = and $ zipWith (<=) wws ws\n\ngetLines = liftM lines . readFile\n\nmain = do\n ls <- getLines \"unixdict.txt\"\n let ow = filter isSorted ls\n let maxl = foldr max 0 (map length ow)\n print $ filter (\\w -> (length w) == maxl) ow\n","language":"Haskell"},{"code":"import Algorithms as algo;\nimport Mathematics as math;\nimport Network as net;\nimport Text as text;\n\nmain( argv_ ) {\n url = size( argv_ ) > 1\n ? argv_[1]\n : \"http://wiki.puzzlers.org/pub/wordlists/unixdict.txt\";\n words = algo.materialize( algo.map( net.get( url ).stream, string.strip ), list );\n ordered = algo.materialize(\n algo.filter(\n words,\n @( word ){ word == ∑( algo.map( algo.sorted( word ), string ) ); }\n ),\n list\n );\n maxLen = algo.reduce( ordered, @( x, y ){ math.max( x, size( y ) ); }, 0 );\n maxOrderedWords = algo.materialize(\n algo.filter( ordered, @[maxLen]( word ){ size( word ) == maxLen; } ),\n list\n );\n print( \"{}\\n\".format( text.join( algo.sorted( maxOrderedWords ), \" \" ) ) );\n return ( 0 );\n}\n","language":"Huginn"},{"code":"link strings\n\nprocedure main(A)\n f := open(\\A[1]) | stop(\"Give dictionary file name on command line\")\n every (maxLen := 0, maxLen <= *(w := !f), w == csort(w)) do {\n if maxLen <:= *w then maxList := [] #discard any shorter sorted words\n put(maxList, w)\n }\n every write(!\\maxList)\nend\n","language":"Icon"},{"code":"file := File clone openForReading(\"./unixdict.txt\")\nwords := file readLines\nfile close\n\nmaxLen := 0\norderedWords := list()\nwords foreach(word,\n if( (word size >= maxLen) and (word == (word asMutable sort)),\n if( word size > maxLen,\n maxLen = word size\n orderedWords empty\n )\n orderedWords append(word)\n )\n)\n\norderedWords join(\" \") println\n","language":"Io"},{"code":"NB. from http://wiki.puzzlers.org/pub/wordlists/unixdict.txt\n oWords=: (#~ ] = /:~L:0) cutLF fread 'unixdict.txt'\n ;:inv (#~ (= >./)@:(#@>)) oWords\nabbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty\n","language":"J"},{"code":"import java.io.BufferedReader;\nimport java.io.FileReader;\nimport java.io.IOException;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.Comparator;\nimport java.util.LinkedList;\nimport java.util.List;\n\npublic class Ordered {\n\n\tprivate static boolean isOrderedWord(String word){\n\t\tchar[] sortedWord = word.toCharArray();\n\t\tArrays.sort(sortedWord);\n\t\treturn word.equals(new String(sortedWord));\n\t}\n\t\n\tpublic static void main(String[] args) throws IOException{\n\t\tList<String> orderedWords = new LinkedList<String>();\n\t\tBufferedReader in = new BufferedReader(new FileReader(args[0]));\n\t\twhile(in.ready()){\n\t\t\tString word = in.readLine();\n\t\t\tif(isOrderedWord(word)) orderedWords.add(word);\n\t\t}\n\t\tin.close();\n\t\t\n\t\tCollections.<String>sort(orderedWords, new Comparator<String>() {\n\t\t\t@Override\n\t\t\tpublic int compare(String o1, String o2) {\n\t\t\t\treturn new Integer(o2.length()).compareTo(o1.length());\n\t\t\t}\n\t\t});\n\t\t\n\t\tint maxLen = orderedWords.get(0).length();\n\t\tfor(String word: orderedWords){\n\t\t\tif(word.length() == maxLen){\n\t\t\t\tSystem.out.println(word);\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n}\n","language":"Java"},{"code":"import java.io.IOException;\nimport java.nio.file.Files;\nimport java.nio.file.Path;\nimport java.util.List;\n\npublic final class OrderedWords {\n\n\tpublic static void main(String[] aArgs) throws IOException {\n\t\tList<String> ordered = Files.lines(Path.of(\"unixdict.txt\"))\n\t\t\t\t .filter( word -> isOrdered(word) ).toList();\n\t \t\n\t final int maxLength = ordered.stream().map( word -> word.length() ).max(Integer::compare).get();\n\t ordered.stream().filter( word -> word.length() == maxLength ).forEach(System.out::println);\t\n\t}\n\t\n\tprivate static boolean isOrdered(String aWord) {\n\t\treturn aWord.chars()\n\t\t\t\t .mapToObj( i -> (char) i )\n\t\t\t\t .sorted()\n\t\t\t\t .map(String::valueOf)\n\t\t\t\t .reduce(\"\", String::concat)\n\t\t\t\t .equals(aWord);\n\t}\n\n}\n","language":"Java"},{"code":"var fs = require('fs'), print = require('sys').print;\nfs.readFile('./unixdict.txt', 'ascii', function (err, data) {\n var is_ordered = function(word){return word.split('').sort().join('') === word;},\n ordered_words = data.split('\\n').filter(is_ordered).sort(function(a, b){return a.length - b.length}).reverse(),\n longest = [], curr = len = ordered_words[0].length, lcv = 0;\n while (curr === len){\n longest.push(ordered_words[lcv]);\n curr = ordered_words[++lcv].length;\n };\n print(longest.sort().join(', ') + '\\n');\n});\n","language":"JavaScript"},{"code":"var http = require('http');\n\nhttp.get({\n host: 'www.puzzlers.org',\n path: '/pub/wordlists/unixdict.txt'\n}, function(res) {\n var data = '';\n res.on('data', function(chunk) {\n data += chunk;\n });\n res.on('end', function() {\n var words = data.split('\\n');\n var max = 0;\n var ordered = [];\n words.forEach(function(word) {\n if (word.split('').sort().join('') != word) return;\n if (word.length == max) {\n ordered.push(word);\n } else if (word.length > max) {\n ordered = [word];\n max = word.length;\n }\n });\n console.log(ordered.join(', '));\n });\n});\n","language":"JavaScript"},{"code":"def is_sorted:\n if length <= 1 then true\n else .[0] <= .[1] and (.[1:] | is_sorted)\n end;\n\ndef longest_ordered_words:\n # avoid string manipulation:\n def is_ordered: explode | is_sorted;\n map(select(is_ordered))\n | (map(length)|max) as $max\n | map( select(length == $max) );\n\n\nsplit(\"\\n\") | longest_ordered_words\n","language":"Jq"},{"code":"issorted(\"abc\") # true\n","language":"Julia"},{"code":"lst = readlines(\"data/unixdict.txt\")\nfilter!(issorted, lst)\nfilter!(x -> length(x) == maximum(length, lst), lst)\nprintln.(lst)\n","language":"Julia"},{"code":" w@&d=|/d:#:'w:d@&&/'{~x<y}':'d:0:\"unixdict.txt\"\n(\"abbott\"\n \"accent\"\n \"accept\"\n \"access\"\n \"accost\"\n \"almost\"\n \"bellow\"\n \"billow\"\n \"biopsy\"\n \"chilly\"\n \"choosy\"\n \"choppy\"\n \"effort\"\n \"floppy\"\n \"glossy\"\n \"knotty\")\n","language":"K"},{"code":"import java.net.URI\n\nfun main() {\n val url = URI(\n \"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\"\n ).toURL()\n val words = url.openStream().bufferedReader().use {\n var max = 0\n it.lineSequence()\n .filter { it.asSequence().windowed(2).all { it[0] <= it[1] } }\n .sortedByDescending(String::length)\n .takeWhile { word -> word.length >= max.also { max = word.length } }\n .toList()\n }\n words.forEach(::println)\n}\n","language":"Kotlin"},{"code":"{def maxOrderedWords\n\n {def isOrdered\n {lambda {:w}\n {W.equal? :w {W.sort before :w}}}}\n\n {def getOrdered\n {lambda {:w}\n {if {isOrdered :w} then :w else}}}\n\n {def pushOrdered\n {lambda {:m :w}\n {if {= {W.length :w} :m} then {br}:w else}}}\n\n {def maxOrderedWords.i\n {lambda {:sortedWords}\n {let { {:orderedWords {S.map getOrdered :sortedWords}} }\n {S.map {{lambda {:m :w} {pushOrdered :m :w}}\n {max {S.map {lambda {:w} {W.length :w}}\n :orderedWords}}}\n :orderedWords}}}}\n\n {lambda {:s}\n {maxOrderedWords.i {S.replace else by el_se in :s}}}}\n-> maxOrderedWords\n\n{maxOrderedWords UNIX.DICT}\n->\nabbott\naccent\naccept\naccess\naccost\nalmost\nbellow\nbillow\nbiopsy\nchilly\nchoosy\nchoppy\neffort\nfloppy\nglossy\nknotty\n","language":"Lambdatalk"},{"code":": >string-index\n \"\" split\n \"&'0123456789abcdefghijklmnopqrstuvwxyz\" \"\" split\n swap index collapse ;\n: chars \"\" split length swap drop ;\n: cr \"\\n\" . ;\n: nip swap drop ;\n: ordered?\n dup grade subscript != '+ reduce if 0 else -1 then ;\n\n: filtering\n [] '_ set\n 0 do read\n 2dup chars\n <=\n if dup >string-index ordered?\n if 2dup chars\n <\n if nip dup chars swap\n [] '_ set\n then\n _ swap append '_ set\n '. . # progress dot\n else drop\n then\n else drop\n then\n eof if break then loop\n\n cr _ . cr\n ;\n\n: ordered-words\n '< 'unixdict.txt open 'fh set\n fh fin filtering fh close ;\n\nordered-words\n","language":"Lang5"},{"code":"local(f = file('unixdict.txt'), words = array, ordered = array, maxleng = 0)\n#f->dowithclose => {\n\t#f->foreachLine => {\n\t\t#words->insert(#1)\n\t}\n}\nwith w in #words\ndo => {\n\tlocal(tosort = #w->asString->values)\n\t#tosort->sort\n\tif(#w->asString == #tosort->join('')) => {\n\t\t#ordered->insert(#w->asString)\n\t\t#w->asString->size > #maxleng ? #maxleng = #w->asString->size\n\t}\n}\nwith w in #ordered\nwhere #w->size == #maxleng\ndo => {^ #w + '\\r' ^}\n","language":"Lasso"},{"code":"'Ordered wordsFrom Rosetta Code\nopen \"unixdict.txt\" for input as #1\n'this is not normal DOS/Windows file.\n'It LF delimited, not CR LF\n'So Line input would not work.\n\nlf$=chr$(10)\ncurLen=0\nwordList$=\"\"\nwhile not(eof(#1))\n a$=inputto$(#1, lf$)\n 'now, check word\n flag = 1\n c$ = left$(a$,1)\n for i = 2 to len(a$)\n d$ = mid$(a$,i,1)\n if c$>d$ then flag=0: exit for\n c$=d$\n next\n 'ckecked, proceed if ordered word\n if flag then\n if curLen=len(a$) then\n wordList$=wordList$+\" \"+a$\n else\n if curLen<len(a$) then\n curLen=len(a$)\n wordList$=a$\n end if\n end if\n end if\nwend\nclose #1\nprint wordList$\n","language":"Liberty-BASIC"},{"code":"-- Contents of unixdict.txt passed as string\non printLongestOrderedWords (words)\n res = []\n maxlen = 0\n _player.itemDelimiter = numtochar(10)\n cnt = words.item.count\n repeat with i = 1 to cnt\n w = words.item[i]\n len = w.length\n ordered = TRUE\n repeat with j = 2 to len\n if chartonum(w.char[j-1])>chartonum(w.char[j]) then\n ordered = FALSE\n exit repeat\n end if\n end repeat\n if ordered then\n if len > maxlen then\n res = [w]\n maxlen = len\n else if len = maxlen then\n res.add(w)\n end if\n end if\n end repeat\n put res\nend\n","language":"Lingo"},{"code":"fp = io.open( \"dictionary.txt\" )\n\nmaxlen = 0\nlist = {}\n\nfor w in fp:lines() do\n ordered = true\n for l = 2, string.len(w) do\n\tif string.byte( w, l-1 ) > string.byte( w, l ) then\n\t ordered = false\n \t break\n\tend\n end\n if ordered then\n\tif string.len(w) > maxlen then\n\t list = {}\n\t list[1] = w\n\t maxlen = string.len(w)\n\telseif string.len(w) == maxlen then\n\t list[#list+1] = w\n\tend\n end\nend\n\nfor _, w in pairs(list) do\n print( w )\nend\n\nfp:close()\n","language":"Lua"},{"code":"lst := StringTools:-Split(Import(\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\"), \"\\n\"):\nlongest := 0:\nwords := Array():\ni := 1:\nfor word in lst do\n\tif StringTools:-IsSorted(word) then\n\t\tlen := StringTools:-Length(word):\n\t\tif len > longest then\n\t\t\tlongest := len:\n\t\t\twords := Array():\n\t\t\twords(1) := word:\n\t\t\ti := 2:\n\t\telif len = longest then\n\t\t\twords(i) := word:\n\t\t\ti++:\n\t\tend if;\n\tend if;\nend do;\nfor word in words do print(word); end do;\n","language":"Maple"},{"code":"Module[{max,\n data = Select[Import[\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\", \"List\"],\n OrderedQ[Characters[#]] &]},\n max = Max[StringLength /@ data];\n Select[data, StringLength[#] == max &]]\n","language":"Mathematica"},{"code":"maxWords[language_String] := Module[{max,data = Select[DictionaryLookup[{language, \"*\"}],OrderedQ[Characters[#]] &]},\n max = Max[StringLength /@ data];\n Select[data, StringLength[#] == max &]]\n","language":"Mathematica"},{"code":"maxlen = 0;\nlistlen= 0;\nfid = fopen('unixdict.txt','r');\nwhile ~feof(fid)\n str = fgetl(fid);\n if any(diff(abs(str))<0) continue; end;\n\n if length(str)>maxlen,\n\tlist = {str};\n\tmaxlen = length(str);\n elseif length(str)==maxlen,\n\tlist{end+1} = str;\n end;\nend\nfclose(fid);\nprintf('%s\\n',list{:});\n","language":"MATLAB"},{"code":"import Nanoquery.IO\n\ndef is_ordered(word)\n word = str(word)\n if len(word) < 2\n return true\n end\n\n for i in range(1, len(word) - 1)\n if str(word[i]) < str(word[i - 1])\n return false\n end\n end\n\n return true\nend\n\nlongest = 0\nwords = {}\nfor word in new(File, \"unixdict.txt\").read()\n if is_ordered(word)\n if len(word) > longest\n longest = len(word)\n words.clear()\n words.append(word)\n else if len(word) = longest\n words.append(word)\n end\n end\nend\nprintln words\n","language":"Nanoquery"},{"code":"/* NetRexx */\noptions replace format comments java crossref savelog symbols binary\n\nunixdict = 'unixdict.txt'\ndo\n wmax = Integer.MIN_VALUE\n dwords = ArrayList()\n inrdr = BufferedReader(FileReader(File(unixdict)))\n loop label ln while inrdr.ready\n dword = Rexx(inrdr.readLine).strip\n if isOrdered(dword) then do\n dwords.add(dword)\n if dword.length > wmax then\n wmax = dword.length\n end\n end ln\n inrdr.close\n\n witerator = dwords.listIterator\n loop label wd while witerator.hasNext\n dword = Rexx witerator.next\n if dword.length < wmax then do\n witerator.remove\n end\n end wd\n dwords.trimToSize\n\n say dwords.toString\n\ncatch ex = IOException\n ex.printStackTrace\nend\n\nreturn\n\nmethod isOrdered(dword = String) inheritable static binary returns boolean\n wchars = dword.toCharArray\n Arrays.sort(wchars)\n return dword.equalsIgnoreCase(String(wchars))\n","language":"NetRexx"},{"code":"import strutils\n\nconst DictFile = \"unixdict.txt\"\n\nfunc isSorted(s: string): bool =\n var last = char.low\n for c in s:\n if c < last: return false\n last = c\n result = true\n\nvar\n mx = 0\n words: seq[string]\n\nfor word in DictFile.lines:\n if word.len >= mx and word.isSorted:\n if word.len > mx:\n words.setLen(0)\n mx = word.len\n words.add word\necho words.join(\" \")\n","language":"Nim"},{"code":"let input_line_opt ic =\n try Some(input_line ic)\n with End_of_file -> None\n\n(* load each line in a list *)\nlet read_lines ic =\n let rec aux acc =\n match input_line_opt ic with\n | Some line -> aux (line :: acc)\n | None -> (List.rev acc)\n in\n aux []\n\nlet char_list_of_string str =\n let lst = ref [] in\n String.iter (fun c -> lst := c :: !lst) str;\n (List.rev !lst)\n\nlet is_ordered word =\n let rec aux = function\n | c1::c2::tl ->\n if c1 <= c2\n then aux (c2::tl)\n else false\n | c::[] -> true\n | [] -> true (* should only occur with an empty string *)\n in\n aux (char_list_of_string word)\n\nlet longest_words words =\n let res, _ =\n List.fold_left\n (fun (lst, n) word ->\n let len = String.length word in\n let comp = compare len n in\n match lst, comp with\n | lst, 0 -> ((word::lst), n) (* len = n *)\n | lst, -1 -> (lst, n) (* len < n *)\n | _, 1 -> ([word], len) (* len > n *)\n | _ -> assert false\n )\n ([\"\"], 0) words\n in\n (List.rev res)\n\nlet () =\n let ic = open_in \"unixdict.txt\" in\n let words = read_lines ic in\n let lower_words = List.map String.lowercase words in\n let ordered_words = List.filter is_ordered lower_words in\n let longest_ordered_words = longest_words ordered_words in\n List.iter print_endline longest_ordered_words\n","language":"OCaml"},{"code":": longWords\n| w longest l s |\n 0 ->longest\n File new(\"unixdict.txt\") forEach: w [\n w size dup ->s longest < ifTrue: [ continue ]\n w sort w == ifFalse: [ continue ]\n s longest > ifTrue: [ s ->longest ListBuffer new ->l ]\n l add(w)\n ] l ;\n","language":"Oforth"},{"code":"/*REXX list (the longest) ordered word(s) from a supplied dictionary. */\niFID= 'UNIXDICT.TXT'\nw.=''\nmL=0\nDo j=1 While lines(iFID)\\==0\n x=linein(iFID)\n w=length(x)\n If w>=mL Then Do\n Parse Upper Var x xU 1 z 2\n Do k=2 To w\n _=substr(xU, k, 1)\n If \\datatype(_, 'U') Then Iterate\n If _<z Then Iterate j\n z=_\n End\n mL=w\n w.w=w.w x\n End\n End\nnn=words(w.mL)\nSay nn 'word's(nn) \"found (of length\" mL')'\nSay ''\nDo n=1 To nn\n Say word(w.mL, n)\n End\nExit\ns: Return left('s',arg(1)>1)\n","language":"OoRexx"},{"code":"ordered(s)=my(v=Vecsmall(s),t=97);for(i=1,#v,if(v[i]>64&&v[i]<91,v[i]+=32);if(v[i]<97||v[i]>122||v[i]<t,return(0),t=v[i]));1\nv=select(ordered,readstr(\"~/unixdict.txt\"));\nN=vecmax(apply(length,v));\nselect(s->#s==N, v)\n","language":"PARI-GP"},{"code":"#!/usr/bin/perl\nuse strict;\nuse warnings;\n\nopen(FH, \"<\", \"unixdict.txt\") or die \"Can't open file!\\n\";\nmy @words;\nwhile (<FH>) {\n chomp;\n push @{$words[length]}, $_ if $_ eq join(\"\", sort split(//));\n}\nclose FH;\nprint \"@{$words[-1]}\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">words</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">unix_dict</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">maxlen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">word</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">maxlen</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">word</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">maxlen</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">maxlen</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">word</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The %d longest ordered words:\\n %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">words</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n \"</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\n0 var maxlen\n( ) var words\n0 var f\n\ndef getword f fgets dup -1 == if drop false else -1 del endif enddef\ndef ordered? dup dup sort == enddef\ndef greater? len maxlen > enddef\n\n\"unixdict.txt\" \"r\" fopen var f\nf -1 !=\nwhile\n getword dup if\n ordered? if\n greater? if\n len var maxlen\n ( ) var words\n endif\n len maxlen == if\n words over 0 put var words\n endif\n endif\n endif\nendwhile\nf fclose\nwords print\n","language":"Phixmonti"},{"code":"include ..\\Utilitys.pmt\n\n0 var f\n\ndef getword f fgets dup -1 == if drop false else -1 del endif enddef\ndef ordered? dup dup sort == enddef\ndef greater? len rot 1 get len nip rot swap over over > enddef\ndef append over 0 put enddef\n\n( \" \" )\n\n\"unixdict.txt\" \"r\" fopen var f\nf -1 !=\nwhile\n getword dup if\n ordered? if\n greater? if\n drop drop flush append\n else\n == if append endif\n endif\n swap\n endif\n endif\nendwhile\nf fclose\nprint\n","language":"Phixmonti"},{"code":"go =>\n Dict = \"unixdict.txt\",\n Words = new_map([Word=Word.length : Word in read_file_lines(Dict), Word == Word.sort()]),\n MaxLen = max([Len : _Word=Len in Words]),\n println([Word : Word=Len in Words, Len=MaxLen].sort).\n","language":"Picat"},{"code":"(in \"unixdict.txt\"\n (mapc prinl\n (maxi '((L) (length (car L)))\n (by length group\n (filter '((S) (apply <= S))\n (make (while (line) (link @))) ) ) ) ) )\n","language":"PicoLisp"},{"code":"order: procedure options (main); /* 24/11/2011 */\n declare word character (20) varying;\n declare word_list character (20) varying controlled;\n declare max_length fixed binary;\n declare input file;\n\n open file (input) title ('/ORDER.DAT,TYPE(TEXT),RECSIZE(100)');\n\n on endfile (input) go to completed_search;\n\n max_length = 0;\n do forever;\n get file (input) edit (word) (L);\n if length(word) > max_length then\n do;\n if in_order(word) then\n do;\n /* Get rid of any stockpiled shorter words. */\n do while (allocation(word_list) > 0);\n free word_list;\n end;\n /* Add the eligible word to the stockpile. */\n allocate word_list;\n word_list = word;\n max_length = length(word);\n end;\n end;\n else if max_length = length(word) then\n do; /* we have an eligle word of the same (i.e., maximum) length. */\n if in_order(word) then\n do; /* Add it to the stockpile. */\n allocate word_list;\n word_list = word;\n end;\n end;\n end;\ncompleted_search:\n put skip list ('There are ' || trim(allocation(word_list)) ||\n ' eligible words of length ' || trim(length(word)) || ':');\n do while (allocation(word_list) > 0);\n put skip list (word_list);\n free word_list;\n end;\n\n/* Check that the letters of the word are in non-decreasing order of rank. */\nin_order: procedure (word) returns (bit(1));\n declare word character (*) varying;\n declare i fixed binary;\n\n do i = 1 to length(word)-1;\n if substr(word, i, 1) > substr(word, i+1, 1) then return ('0'b);\n end;\n return ('1'b);\nend in_order;\nend order;\n","language":"PL-I"},{"code":"$url = 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\n\n(New-Object System.Net.WebClient).DownloadFile($url, \"$env:TEMP\\unixdict.txt\")\n\n$ordered = Get-Content -Path \"$env:TEMP\\unixdict.txt\" |\n ForEach-Object {if (($_.ToCharArray() | Sort-Object) -join '' -eq $_) {$_}} |\n Group-Object -Property Length |\n Sort-Object -Property Name |\n Select-Object -Property @{Name=\"WordCount\" ; Expression={$_.Count}},\n @{Name=\"WordLength\"; Expression={[int]$_.Name}},\n @{Name=\"Words\" ; Expression={$_.Group}} -Last 1\n\n\"There are {0} ordered words of the longest word length ({1} characters):`n`n{2}\" -f $ordered.WordCount,\n $ordered.WordLength,\n ($ordered.Words -join \", \")\nRemove-Item -Path \"$env:TEMP\\unixdict.txt\" -Force -ErrorAction SilentlyContinue\n","language":"PowerShell"},{"code":":- use_module(library( http/http_open )).\n\nordered_words :-\n % we read the URL of the words\n\thttp_open('http://www.puzzlers.org/pub/wordlists/unixdict.txt',\tIn, []),\n\tread_file(In, [], Out),\n\tclose(In),\n\n % we get a list of pairs key-value where key = Length and value = <list-of-its-codes>\n % this list must be sorted\n\tmsort(Out, MOut),\n\n\tgroup_pairs_by_key(MOut, POut),\n\n % we sorted this list in decreasing order of the length of values\n\tpredsort(my_compare, POut, [_N-V | _OutSort]),\n\tmaplist(mwritef, V).\n\n\nmwritef(V) :-\n\twritef('%s\\n', [V]).\n\nread_file(In, L, L1) :-\n\tread_line_to_codes(In, W),\n\t( W == end_of_file ->\n % the file is read\n\t L1 = L\n\t ;\n % we sort the list of codes of the line\n\t % and keep only the \"goods word\"\n\t ( msort(W, W) ->\n\t length(W, N), L2 = [N-W | L], (len = 6 -> writef('%s\\n', [W]); true)\n\t ;\n\t L2 = L\n\t ),\n\n % and we have the pair Key-Value in the result list\n\t read_file(In, L2, L1)).\n\n% predicate for sorting list of pairs Key-Values\n% if the lentgh of values is the same\n% we sort the keys in alhabetic order\nmy_compare(R, K1-_V1, K2-_V2) :-\n\t( K1 < K2 -> R = >; K1 > K2 -> R = <; =).\n","language":"Prolog"},{"code":"Procedure.s sortLetters(*word.Character, wordLength) ;returns a string with the letters of a word sorted\n Protected Dim letters.c(wordLength)\n Protected *letAdr = @letters()\n\n CopyMemoryString(*word, @*letAdr)\n SortArray(letters(), #PB_Sort_Ascending, 0, wordLength - 1)\n ProcedureReturn PeekS(@letters(), wordLength)\nEndProcedure\n\nStructure orderedWord\n word.s\n length.i\nEndStructure\n\nDefine filename.s = \"unixdict.txt\", fileNum = 0, word.s\n\nIf OpenConsole()\n NewList orderedWords.orderedWord()\n If ReadFile(fileNum, filename)\n While Not Eof(fileNum)\n word = ReadString(fileNum)\n If word = sortLetters(@word, Len(word))\n AddElement(orderedWords())\n orderedWords()\\word = word\n orderedWords()\\length = Len(word)\n EndIf\n Wend\n Else\n MessageRequester(\"Error\", \"Unable to find dictionary '\" + filename + \"'\")\n End\n EndIf\n\n SortStructuredList(orderedWords(), #PB_Sort_Ascending, OffsetOf(orderedWord\\word), #PB_String)\n SortStructuredList(orderedWords(), #PB_Sort_Descending, OffsetOf(orderedWord\\length), #PB_Integer)\n Define maxLength\n FirstElement(orderedWords())\n maxLength = orderedWords()\\length\n ForEach orderedWords()\n If orderedWords()\\length = maxLength\n Print(orderedWords()\\word + \" \")\n EndIf\n Next\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"import urllib.request\n\nurl = 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\nwords = urllib.request.urlopen(url).read().decode(\"utf-8\").split()\nordered = [word for word in words if word==''.join(sorted(word))]\nmaxlen = len(max(ordered, key=len))\nmaxorderedwords = [word for word in ordered if len(word) == maxlen]\nprint(' '.join(maxorderedwords))\n","language":"Python"},{"code":"import urllib.request\n\nmx, url = 0, 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\n\nfor word in urllib.request.urlopen(url).read().decode(\"utf-8\").split():\n lenword = len(word)\n if lenword >= mx and word==''.join(sorted(word)):\n if lenword > mx:\n words, mx = [], lenword\n words.append(word)\nprint(' '.join(words))\n","language":"Python"},{"code":"'''The longest ordered words in a list'''\n\nfrom functools import reduce\nfrom operator import le\nimport urllib.request\n\n\n# longestOrds :: [String] -> [String]\ndef longestOrds(ws):\n '''The longest ordered words in a given list.\n '''\n return reduce(triage, ws, (0, []))[1]\n\n\n# triage :: (Int, [String]) -> String -> (Int, [String])\ndef triage(nxs, w):\n '''The maximum length seen for an ordered word,\n and the ordered words of this length seen so far.\n '''\n n, xs = nxs\n lng = len(w)\n return (\n (lng, ([w] if n != lng else xs + [w])) if (\n ordered(w)\n ) else nxs\n ) if lng >= n else nxs\n\n\n# ordered :: String -> Bool\ndef ordered(w):\n '''True if the word w is ordered.'''\n return all(map(le, w, w[1:]))\n\n\n# ------------------------- TEST -------------------------\nif __name__ == '__main__':\n print(\n '\\n'.join(longestOrds(\n urllib.request.urlopen(\n 'http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'\n ).read().decode(\"utf-8\").split()\n ))\n )\n","language":"Python"},{"code":" [ - -1 1 clamp 1+ ]'[ swap peek do ] is <=> ( n n --> )\n\n [ true swap\n behead swap witheach\n [ tuck > if\n [ dip not conclude ] ]\n drop ] is ordered ( [ --> b )\n\n [ stack ] is largest ( [ --> s )\n\n [ 1 largest put\n [] swap witheach\n [ dup size\n largest share <=>\n [ drop\n [ dup ordered iff\n [ nested join ]\n else drop ]\n [ dup ordered iff\n [ dup size largest replace\n nip nested ]\n else drop ] ] ]\n largest release ] is task ( [ --> [ )\n\n $ 'unixdict.txt' sharefile drop nest$\n task\n witheach [ echo$ sp ]\n","language":"Quackery"},{"code":"words = scan(\"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\",what = \"character\")\n\nordered = logical()\nfor(i in 1:length(words)){\n first = strsplit(words[i],\"\")[[1]][1:nchar(words[i])-1]\n second = strsplit(words[i],\"\")[[1]][2:nchar(words[i])]\n ordered[i] = all(first<=second)\n}\n\ncat(words[ordered][which(nchar(words[ordered])==max(nchar(words[ordered])))],sep=\"\\n\")\n","language":"R"},{"code":"#lang racket\n(require net/url)\n\n(define dict \"http://www.puzzlers.org/pub/wordlists/unixdict.txt\")\n\n(define (ordered? str)\n (define lower (string-downcase str))\n (for/and ([i (in-range 1 (string-length str))])\n (char<=? (string-ref lower (sub1 i)) (string-ref lower i))))\n\n(define words (port->lines (get-pure-port (string->url dict))))\n\n(let loop ([len 0] [longs '()] [words words])\n (if (null? words)\n (for-each displayln (reverse longs))\n (let* ([word (car words)] [words (cdr words)]\n [wlen (string-length word)])\n (if (or (< wlen len) (not (ordered? word)))\n (loop len longs words)\n (loop wlen (cons word (if (> wlen len) '() longs)) words)))))\n","language":"Racket"},{"code":"say lines.grep({ [le] .comb }).classify(*.chars).max(*.key).value\n","language":"Raku"},{"code":"Red []\n;; code to read url and save to local file:\n;;data: read/binary http://www.puzzlers.org/pub/wordlists/unixdict.txt\n;;write %unixdict.txt data\n\nmax: [ \"\" ] ;; init array with one empty string (length 0 )\n\nforeach word read/lines %unixdict.txt [ ;; read local file\n len: either word = sort copy word [ length? word ] [ -1 ] ;; check if ordered and get length\n case [\n len > length? first max [ max: reduce [ word ]] ;; init new block\n len = length? first max [ append max word ]\n ]\n]\nprobe max\n","language":"Red"},{"code":"/*REXX program lists (the longest) ordered word(s) from a supplied dictionary. */\niFID= 'UNIXDICT.TXT' /*the filename of the word dictionary. */\nm= 1 /*maximum length of an ordered word(s).*/\ncall linein iFID, 1, 0 /*point to the first word in dictionary*/\n@.= /*placeholder array for list of words. */\n do j=1 while lines(iFID)\\==0; x=linein(iFID) /*keep reading until file is exhausted.*/\n w= length(x); if w<m then iterate /*Word not long enough? Then ignore it.*/\n if \\datatype(x, 'M') then iterate /*Is it not a letter? Then ignore it. */\n parse upper var x xU 1 z 2 /*get uppercase version of X & 1st char*/\n do k=2 for w-1; _= substr(xU, k, 1) /*process each letter in uppercase word*/\n if _<z then iterate j /*is letter < than the previous letter?*/\n z= _ /*we have a newer current letter. */\n end /*k*/ /* [↑] logic includes ≥ order. */\n m= w /*maybe define a new maximum length. */\n @.w= @.w x /*add the original word to a word list.*/\n end /*j*/ /*the 1st DO needs an index for ITERATE*/\n #= words(@.m) /*just a handy─dandy variable to have. */\nsay # 'word's(#) \"found (of length\" m')'; say /*show the number of words and length. */\n do n=1 for #; say word(@.m, n); end /*display all the words, one to a line.*/\nexit /*stick a fork in it, we're all done. */\nghijk\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ns: if arg(1)==1 then return ''; return \"s\" /*a simple pluralizer (merely adds \"S\")*/\n","language":"REXX"},{"code":"load \"stdlib.ring\"\n\n\ncStr = read(\"unixdict.txt\")\nwordList = str2list(cStr)\nsum = 0\nsortList = []\n\nsee \"working...\" + nl + nl\n\nfor n = 1 to len(wordList)\n num = 0\n len = len(wordList[n])-1\n for m = 1 to len\n asc1 = ascii(wordList[n][m])\n asc2 = ascii(wordList[n][m+1])\n if asc1 <= asc2\n num = num + 1\n ok\n next\n if num = len\n sum = sum + 1\n add(sortList,[wordList[n],len])\n ok\nnext\n\nsortList = sort(sortList,2)\nsortList = reverse(sortList)\nendList = []\n\nlen = sortList[1][2]\n\nfor n = 1 to len(sortList)\n if sortList[n][2] = len\n add(endList,sortList[n][1])\n else\n exit\n ok\nnext\n\nendList = sort(endList)\nsee endList\n\nsee nl + \"done...\" + nl\n","language":"Ring"},{"code":"require 'open-uri'\nordered_words = open('http://www.puzzlers.org/pub/wordlists/unixdict.txt', 'r').select do |word|\n word.strip!\n word.chars.sort.join == word\nend\n\ngrouped = ordered_words.group_by &:size\nputs grouped[grouped.keys.max]\n","language":"Ruby"},{"code":"words = IO.foreach('unixdict.txt').map(&:chomp).select {|word| word.chars.sort.join == word}\nputs words.group_by(&:size).sort_by(&:first).last.last\n","language":"Ruby"},{"code":"a$\t= httpget$(\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\")\nj\t= 1\ni \t= instr(a$,chr$(10),j)\nwhile i <> 0\n a1$ \t= mid$(a$,j,i-j)\n for k\t= 1 to len(a1$) - 1\n if mid$(a1$,k,1) > mid$(a1$,k+1,1) then goto [noWay]\n next k\n maxL\t= max(maxL,len(a1$))\nif len(a1$) >= maxL then a2$ = a2$ + a1$ + \"||\"\n[noWay]\nj\t= i + 1\ni \t= instr(a$,chr$(10),j)\nwend\nn\t= 1\nwhile word$(a2$,n,\"||\") <> \"\"\n a3$ = word$(a2$,n,\"||\")\n if len(a3$) = maxL then print a3$\n n = n + 1\nwend\n","language":"Run-BASIC"},{"code":"const FILE: &'static str = include_str!(\"./unixdict.txt\");\n\nfn is_ordered(s: &str) -> bool {\n let mut prev = '\\x00';\n for c in s.to_lowercase().chars() {\n if c < prev {\n return false;\n }\n prev = c;\n }\n\n return true;\n}\n\nfn find_longest_ordered_words(dict: Vec<&str>) -> Vec<&str> {\n let mut result = Vec::new();\n let mut longest_length = 0;\n\n for s in dict.into_iter() {\n if is_ordered(&s) {\n let n = s.len();\n if n > longest_length {\n longest_length = n;\n result.truncate(0);\n }\n if n == longest_length {\n result.push(s);\n }\n }\n }\n\n return result;\n}\n\nfn main() {\n let lines = FILE.lines().collect();\n\n let longest_ordered = find_longest_ordered_words(lines);\n\n for s in longest_ordered.iter() {\n println!(\"{}\", s.to_string());\n }\n}\n","language":"Rust"},{"code":"val wordsAll = scala.io.Source.fromURL(\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\").getLines.toSeq\n\n/**\n * Given a sequence of words return a sub-sequence of the\n * words that have characters in sorted order.\n */\ndef orderedWords( words:Seq[String] ) : Seq[(String)] = {\n\n def isOrdered( s:String ) : Boolean =\n (s.foldLeft( (true,'@') ){\n case ((false,_),_) => return false\n case ((true,prev),c) => ((prev <= c),c)\n })._1\n\n wordsAll.filter( isOrdered(_) ).toSeq\n}\n\nval ww = orderedWords( wordsAll ).sortBy( -_.length )\n\nprintln( ww.takeWhile( _.length == ww.head.length ).mkString(\"\\n\") )\n","language":"Scala"},{"code":"(define sorted-words\n (let ((port (open-input-file \"unixdict.txt\")))\n (let loop ((char (read-char port)) (word '()) (result '(())))\n (cond\n ((eof-object? char)\n\t(reverse (map (lambda (word) (apply string word)) result)))\n ((eq? #\\newline char)\n\t(loop (read-char port) '()\n\t (let ((best-length (length (car result))) (word-length (length word)))\n\t\t(cond\n\t\t ((or (< word-length best-length) (not (apply char>=? word))) result)\n\t\t ((> word-length best-length) (list (reverse word)))\n\t\t (else (cons (reverse word) result))))))\n (else (loop (read-char port) (cons char word) result))))))\n\n(map (lambda (x)\n (begin\n\t (display x)\n\t (newline)))\n sorted-words)\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func boolean: isOrdered (in string: word) is func\n result\n var boolean: ordered is TRUE;\n local\n var integer: index is 0;\n begin\n for index range 1 to pred(length(word)) do\n if word[index] > word[succ(index)] then\n ordered := FALSE;\n end if;\n end for;\n end func;\n\nconst proc: write (in array string: wordList) is func\n local\n var string: word is \"\";\n begin\n for word range wordList do\n writeln(word);\n end for;\n end func;\n\nconst proc: main is func\n local\n var file: dictionary is STD_NULL;\n var string: word is \"\";\n var integer: length is 0;\n var array string: wordList is 0 times \"\";\n begin\n dictionary := open(\"unixdict.txt\", \"r\");\n if dictionary <> STD_NULL then\n readln(dictionary, word);\n while not eof(dictionary) do\n if isOrdered(lower(word)) then\n if length(word) > length then\n length := length(word);\n wordList := [] (word);\n elsif length(word) = length then\n wordList &:= word;\n end if;\n end if;\n readln(dictionary, word);\n end while;\n close(dictionary);\n end if;\n write(wordList);\n end func;\n","language":"Seed7"},{"code":"var words = [[]]\nvar file = %f'unixdict.txt'\n\nfile.open_r(\\var fh, \\var err) ->\n || die \"Can't open file #{file}: $#{err}\"\n\nfh.each { |line|\n line.trim!\n if (line == line.sort) {\n words[line.length] := [] << line\n }\n}\n\nsay words[-1].join(' ')\n","language":"Sidef"},{"code":"BEGIN\n\n BOOLEAN PROCEDURE ISORDERED(W); TEXT W;\n BEGIN\n BOOLEAN B;\n B := TRUE;\n W.SETPOS(1);\n IF W.MORE THEN\n BEGIN\n CHARACTER CURR, LAST;\n CURR := W.GETCHAR;\n WHILE W.MORE AND B DO\n BEGIN\n LAST := CURR;\n CURR := W.GETCHAR;\n B := LAST <= CURR;\n END;\n END;\n ISORDERED := B;\n END;\n\n REF (INFILE) INF;\n INTEGER LONGEST;\n TEXT W;\n\n COMMENT FIND LONGEST LENGTH;\n INF :- NEW INFILE(\"unixdict.txt\");\n INF.OPEN(BLANKS(132));\n WHILE NOT INF.LASTITEM DO\n BEGIN\n W :- COPY(INF.IMAGE).STRIP;\n IF ISORDERED(W) THEN\n IF W.LENGTH > LONGEST THEN\n LONGEST := W.LENGTH;\n INF.INIMAGE;\n END;\n INF.CLOSE;\n\n COMMENT OUTPUT ORDRERED WORDS OF LONGEST LENGTH;\n INF :- NEW INFILE(\"unixdict.txt\");\n INF.OPEN(BLANKS(132));\n WHILE NOT INF.LASTITEM DO\n BEGIN\n W :- COPY(INF.IMAGE).STRIP;\n IF W.LENGTH = LONGEST AND THEN ISORDERED(W) THEN\n BEGIN\n OUTTEXT(W);\n OUTIMAGE;\n END;\n INF.INIMAGE;\n END;\n INF.CLOSE;\n\nEND.\n","language":"Simula"},{"code":"|file dict r t|\nfile := FileStream open: 'unixdict.txt' mode: FileStream read.\ndict := Set new.\n\n\"load the whole dict into the set before, 'filter' later\"\n[ file atEnd ] whileFalse: [\n dict add: (file upTo: Character nl) ].\n\n\"find those with the sorted letters, and sort them by length\"\nr := ((dict\n select: [ :w | (w asOrderedCollection sort) = (w asOrderedCollection) ] )\n asSortedCollection: [:a :b| (a size) > (b size) ] ).\n\n\"get those that have length = to the max length, and sort alphabetically\"\nr := (r select: [:w| (w size) = ((r at: 1) size)]) asSortedCollection.\n\nr do: [:e| e displayNl].\n","language":"Smalltalk"},{"code":"words = #.split(#.readtext(\"unixdict.txt\",\"ascii\"),#.lf)\nmax = 0\n> i, 1..#.size(words,1)\n word = words[i]\n wordb = #.array(word)\n wordbc = #.size(wordb,1)\n > j, 3..wordbc,2\n << wordb[j]<wordb[j-2]\n <\n >> j!>wordbc|wordbc<max\n ? wordbc>max, result = \"\"\n ? wordbc>max, max = wordbc\n result += word+#.crlf\n<\n#.output(result)\n","language":"SPL"},{"code":"fun isOrdered s =\n let\n fun loop (i, c) =\n let\n val c' = String.sub (s, i)\n in\n c <= c' andalso loop (i + 1, c')\n end\n handle Subscript => true\n in\n loop (0, #\"\\^@\")\n end\n\nfun longestOrdereds (s, prev as (len, lst)) =\n let\n val len' = size s\n in\n if len' >= len andalso isOrdered s then\n if len' = len then (len, s :: lst) else (len', [s])\n else\n prev\n end\n\nval () = print ((String.concatWith \" \"\n o #2\n o foldr longestOrdereds (0, [])\n o String.tokens Char.isSpace\n o TextIO.inputAll) TextIO.stdIn ^ \"\\n\")\n","language":"Standard-ML"},{"code":"import Foundation\n\nguard\n let url = NSURL(string: \"http://www.puzzlers.org/pub/wordlists/unixdict.txt\"),\n let input = try? NSString(contentsOfURL: url,encoding: NSUTF8StringEncoding) as String\n else { exit(EXIT_FAILURE) }\n\nlet words = input.componentsSeparatedByCharactersInSet(NSCharacterSet.newlineCharacterSet())\nlet group: ([Int: [String]], String) -> [Int: [String]] = {\n var d = $0; let g = d[$1.characters.count] ?? []\n d[$1.characters.count] = g + [$1]\n return d\n}\nlet ordered: ([String], String) -> [String] = {\n guard String($1.characters.sort()) == $1 else { return $0 }\n return $0 + [$1]\n}\n\nlet groups = words\n .reduce([String](), combine: ordered)\n .reduce([Int: [String]](), combine: group)\n\nguard\n let maxLength = groups.keys.maxElement(),\n let maxLengthGroup = groups[maxLength]\n else { exit(EXIT_FAILURE) }\n\nmaxLengthGroup.forEach { print($0) }\n","language":"Swift"},{"code":"package require http\n\n# Pick the ordered words (of maximal length) from a list\nproc chooseOrderedWords list {\n set len 0\n foreach word $list {\n\t# Condition to determine whether a word is ordered; are its characters\n\t# in sorted order?\n\tif {$word eq [join [lsort [split $word \"\"]] \"\"]} {\n\t if {[string length $word] > $len} {\n\t\tset len [string length $word]\n\t\tset orderedOfMaxLen {}\n\t }\n\t if {[string length $word] == $len} {\n\t\tlappend orderedOfMaxLen $word\n\t }\n\t}\n }\n return $orderedOfMaxLen\n}\n\n# Get the dictionary and print the ordered words from it\nset t [http::geturl \"http://www.puzzlers.org/pub/wordlists/unixdict.txt\"]\nputs [chooseOrderedWords [http::data $t]]\nhttp::cleanup $t\n","language":"Tcl"},{"code":"#lang transd\n\nMainModule: {\n_start: (lambda\n (with fs FileStream() len 0 maxlen 0 words Vector<String>()\n (open-r fs \"/mnt/vault/tmp/unixdict.txt\") )\n\n (for w in (read-lines fs) do\n (= len (size w))\n (if (< len maxlen) continue)\n (if (is-sorted w)\n (if (< maxlen len)\n (clear words) (= maxlen len))\n (append words w)\n ))\n (lout words)\n))\n\n}\n","language":"Transd"},{"code":"$$ MODE TUSCRIPT\nSET data = REQUEST (\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\")\nDICT orderdwords CREATE 99999\nCOMPILE\nLOOP word=data\n - \"<%\" = any token\n SET letters=STRINGS (word,\":<%:\")\n SET wordsignatur= ALPHA_SORT (letters)\n IF (wordsignatur==letters) THEN\n SET wordlength=LENGTH (word)\n DICT orderdwords ADD/COUNT word,num,cnt,wordlength\n ENDIF\nENDLOOP\n\nDICT orderdwords UNLOAD words,num,cnt,wordlength\nSET maxlength=MAX_LENGTH (words)\nSET rtable=QUOTES (maxlength)\nBUILD R_TABLE maxlength = rtable\nSET index=FILTER_INDEX (wordlength,maxlength,-)\nSET longestwords=SELECT (words,#index)\nPRINT num,\" ordered words - max length is \",maxlength,\":\"\n\nLOOP n,w=longestwords\nSET n=CONCAT (n,\".\"), n=CENTER(n,4)\nPRINT n,w\nENDLOOP\nENDCOMPILE\n","language":"TUSCRIPT"},{"code":"#import std\n\n#show+\n\nmain = leql@bh$^ eql|= (ordered lleq)*~ unixdict_dot_txt\n","language":"Ursala"},{"code":"fn main() {\n words := os.read_file(\"./unixdict.txt\") or {println(err) exit(-1)}.split_into_lines()\n\tmut longest_len := 0\n\tmut longest := []string{}\n\tmut u_word := []u8{}\n\tfor word in words {\n\t\tfor chars in word {u_word << chars}\n\t\tu_word.sort()\n\t\tif word.len > longest_len {\n\t\t\tif word == u_word.bytestr() {\n\t\t\t\tlongest_len = word.len\n\t\t\t\tlongest.clear()\n\t\t\t\tlongest << word\n\t\t\t}\n\t\t}\n\t\telse if word.len == longest_len {\n\t\t\tif word == u_word.bytestr() {longest << word}\n\t\t}\n\t\tu_word.clear()\n\t}\n\tprintln(\"The ${longest.len} ordered words with the longest length (${longest_len}) are:\")\n\tprint(longest.join(\"\\n\"))\n}\n","language":"V-(Vlang)"},{"code":"Public Sub orderedwords(fname As String)\n ' find ordered words in dict file that have the longest word length\n ' fname is the name of the input file\n ' the words are printed in the immediate window\n ' this subroutine uses boolean function IsOrdered\n\nDim word As String 'word to be tested\nDim l As Integer 'length of word\nDim wordlength As Integer 'current longest word length\nDim orderedword() As String 'dynamic array holding the ordered words with the current longest word length\nDim wordsfound As Integer 'length of the array orderedword()\n\nOn Error GoTo NotFound 'catch incorrect/missing file name\nOpen fname For Input As #1\nOn Error GoTo 0\n\n'initialize\nwordsfound = 0\nwordlength = 0\n\n'process file line per line\nWhile Not EOF(1)\n Line Input #1, word\n If IsOrdered(word) Then 'found one, is it equal to or longer than current word length?\n l = Len(word)\n If l >= wordlength Then 'yes, so add to list or start a new list\n If l > wordlength Then 'it's longer, we must start a new list\n wordsfound = 1\n wordlength = l\n Else 'equal length, increase the list size\n wordsfound = wordsfound + 1\n End If\n 'add the word to the list\n ReDim Preserve orderedword(wordsfound)\n orderedword(wordsfound) = word\n End If\n End If\nWend\nClose #1\n\n'print the list\nDebug.Print \"Found\"; wordsfound; \"ordered words of length\"; wordlength\nFor i = 1 To wordsfound\n Debug.Print orderedword(i)\nNext\nExit Sub\n\nNotFound:\n debug.print \"Error: Cannot find or open file \"\"\" & fname & \"\"\"!\"\nEnd Sub\n\n\n\nPublic Function IsOrdered(someWord As String) As Boolean\n'true if letters in word are in ascending (ascii) sequence\n\nDim l As Integer 'length of someWord\nDim wordLcase As String 'the word in lower case\nDim ascStart As Integer 'ascii code of first char\nDim asc2 As Integer 'ascii code of next char\n\nwordLcase = LCase(someWord) 'convert to lower case\nl = Len(someWord)\nIsOrdered = True\nIf l > 0 Then 'this skips empty string - it is considered ordered...\n ascStart = Asc(Left$(wordLcase, 1))\n For i = 2 To l\n asc2 = Asc(Mid$(wordLcase, i, 1))\n If asc2 < ascStart Then 'failure!\n IsOrdered = False\n Exit Function\n End If\n ascStart = asc2\n Next i\nEnd If\nEnd Function\n","language":"VBA"},{"code":"Set objFSO = CreateObject(\"Scripting.FileSystemObject\")\nSet infile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) & \"\\\" &_\n\t\t\t\"unixdict.txt\",1)\nlist = \"\"\nlength = 0\n\nDo Until inFile.AtEndOfStream\n\tline = infile.ReadLine\n\tIf IsOrdered(line) Then\n\t\tIf Len(line) > length Then\n\t\t\tlength = Len(line)\n\t\t\tlist = line & vbCrLf\n\t\tElseIf Len(line) = length Then\n\t\t\tlist = list & line & vbCrLf\n\t\tEnd If\n\tEnd If\nLoop\n\nWScript.StdOut.Write list\n\nFunction IsOrdered(word)\n\tIsOrdered = True\n\tprev_val = 0\n\tFor i = 1 To Len(word)\n\t\tIf i = 1 Then\n\t\t\tprev_val = Asc(Mid(word,i,1))\n\t\tElseIf Asc(Mid(word,i,1)) >= prev_val Then\n\t\t\tprev_val = Asc(Mid(word,i,1))\n\t\tElse\n\t\t\tIsOrdered = False\n\t\t\tExit For\n\t\tEnd If\n\tNext\nEnd Function\n","language":"VBScript"},{"code":"File_Open(\"unixdict.txt\", BROWSE)\n#1 = 2 // length of longest word found\nRepeat (ALL) {\n #2 = EOL_Pos-Cur_Pos // length of this word\n if (#2 >= #1) {\n #3 = 1 // flag: is ordered word\n Char(1)\n While (!At_EOL) {\n if (Cur_Char < Cur_Char(-1)) {\n #3 = 0 // not an ordered word\n break\n }\n Char(1)\n }\n if (#3) { // ordered word found\n if (#2 > #1) { // new longer word found\n #1 = #2\n Reg_Empty(10) // clear list\n }\n BOL Reg_Copy(10,1,APPEND) // add word to list\n }\n }\n Line(1,ERRBREAK) // next word\n}\nBuf_Quit(OK) // close file\nReg_Type(10) // display results\n","language":"Vedit-macro-language"},{"code":"import \"io\" for File\nimport \"./sort\" for Sort\n\nvar words = File.read(\"unixdict.txt\").split(\"\\n\")\nvar longestLen = 0\nvar longest = []\nfor (word in words) {\n if (word.count > longestLen) {\n if (Sort.isSorted(word.toList)) {\n longestLen = word.count\n longest.clear()\n longest.add(word)\n }\n } else if (word.count == longestLen) {\n if (Sort.isSorted(word.toList)) longest.add(word)\n }\n}\nSystem.print(\"The %(longest.count) ordered words with the longest length (%(longestLen)) are:\")\nSystem.print(longest.join(\"\\n\"))\n","language":"Wren"},{"code":"string 0; \\use zero-terminated strings\nint MaxLen, Pass, I, Ch, Ch0;\nchar Word(25);\ndef LF=$0A, CR=$0D, EOF=$1A;\n[FSet(FOpen(\"unixdict.txt\", 0), ^I);\nMaxLen:= 0;\nfor Pass:= 1 to 2 do\n [OpenI(3);\n repeat I:= 0; Ch0:= 0;\n loop [repeat Ch:= ChIn(3) until Ch # CR; \\remove possible CR\n if Ch=LF or Ch=EOF then\n [if I > MaxLen then MaxLen:= I;\n if I=MaxLen & Pass=2 then\n [Word(I):= 0; Text(0, Word); CrLf(0)];\n quit;\n ];\n Word(I):= Ch;\n if Ch < Ch0 then\n [repeat Ch:= ChIn(3) until Ch=LF or Ch=EOF;\n quit;\n ];\n Ch0:= Ch;\n I:= I+1;\n ];\n until Ch = EOF;\n ];\n]\n","language":"XPL0"},{"code":"var words=L(), sz=0; // some state\nfcn isLex(word){ word.reduce(fcn(p,c){ (p<=c) and c or T(Void.Stop,False) }) }\nFile(\"dict.txt\").pump(Void,fcn(w){\n w=w.strip(); // get rid of newline\n if(isLex(w)){ n:=w.len();\n if(n>sz){ words.clear(w); sz=n }\n else if(n==sz) words.append(w)\n }\n})\nprintln(\"Num words: %d, all size %d\\n\".fmt(words.len(),sz));\nwords.pump(Console.println);\n","language":"Zkl"},{"code":"fcn isLex(word){ word.reduce(fcn(p,c){ (p<=c) and c or T(Void.Stop,False) }) }\nlwords:=File(\"dict.txt\").readln(*).apply(\"strip\").filter(isLex);\nmax:=lwords.reduce(fcn(n,w){ w.len()>n and w.len() or n },0);\nlwords=lwords.filter(fcn(w,n){ w.len()==n },max);\nprintln(\"Num words: %d, all size %d\\n\".fmt(lwords.len(),max));\nwords.pump(Console.println);\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ordered_words\\nnote: text processing\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"An ''ordered word'' is a word in which the letters appear in alphabetic order. \\n\\nExamples include '''abbey''' and '''dirt'''. \\n\\n{{task heading}}\\n\\nFind ''and display'' all the ordered words in the dictionary [https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt unixdict.txt] that have the longest word length. \\n\\n(Examples that access the dictionary file locally assume that you have downloaded this file yourself.) \\n\\nThe display needs to be shown on this page.\\n\\n{{task heading|Related tasks}}\\n\\n{{Related tasks/Word plays}}\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V words = File(‘unixdict.txt’).read().split(\\\"\\\\n\\\")\\nV ordered = words.filter(word -> word == sorted(word))\\nV maxlen = max(ordered, key' w -> w.len).len\\nV maxorderedwords = ordered.filter(word -> word.len == :maxlen)\\nprint(maxorderedwords.join(‘ ’))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"(defun longest-ordered-words ()\\n (find-longest-ordered-words\\n (open 'notes/unixdict!.txt t)))\\n\\n(defun find-longest-ordered-words\\n (h (len . 0) (word) (words))\\n (loop\\n (until (eof h)\\n (close h)\\n words)\\n (setq word (readline h))\\n (cond ((lessp (chars word) len))\\n ((not (ordered-p word)))\\n ((eq (chars word) len)\\n (setq words (cons word words)))\\n (t\\n (setq len (chars word))\\n (setq words (list word))))))\\n\\n(defun ordered-p (word)\\n (nondecreasing-p\\n (mapc ordinal (explode word))))\\n\\n(defun nondecreasing-p (numbers)\\n (or (null numbers)\\n (null (cdr numbers))\\n (and (not (greaterp (car numbers) (cadr numbers)))\\n (nondecreasing-p (cdr numbers)))))\\n\",\n \"language\": \"Acornsoft-Lisp\"\n },\n {\n \"code\": \"CHAR ARRAY line(256)\\n\\nBYTE FUNC IsOrderedWord(CHAR ARRAY word)\\n BYTE len,i\\n\\n len=word(0)\\n IF len<=1 THEN RETURN (1) FI\\n\\n FOR i=1 TO len-1\\n DO\\n IF word(i)>word(i+1) THEN\\n RETURN (0)\\n FI\\n OD\\nRETURN (1)\\n\\nBYTE FUNC FindLongestOrdered(CHAR ARRAY fname)\\n BYTE max,dev=[1]\\n\\n max=0\\n Close(dev)\\n Open(dev,fname,4)\\n WHILE Eof(dev)=0\\n DO\\n InputSD(dev,line)\\n IF line(0)>max AND IsOrderedWord(line)=1 THEN\\n max=line(0)\\n FI\\n OD\\n Close(dev)\\nRETURN (max)\\n\\nPROC FindWords(CHAR ARRAY fname BYTE n)\\n BYTE count,dev=[1]\\n\\n Close(dev)\\n Open(dev,fname,4)\\n WHILE Eof(dev)=0\\n DO\\n InputSD(dev,line)\\n IF line(0)=n AND IsOrderedWord(line)=1 THEN\\n Print(line) Put(32)\\n FI\\n OD\\n Close(dev)\\nRETURN\\n\\nPROC Main()\\n CHAR ARRAY fname=\\\"H6:UNIXDICT.TXT\\\"\\n BYTE max\\n\\n PrintE(\\\"Finding the longest words...\\\")\\n PutE()\\n max=FindLongestOrdered(fname)\\n\\n FindWords(fname,max)\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Containers.Indefinite_Vectors;\\nuse Ada.Text_IO;\\n\\nprocedure Ordered_Words is\\n package Word_Vectors is new Ada.Containers.Indefinite_Vectors\\n (Index_Type => Positive, Element_Type => String);\\n use Word_Vectors;\\n File : File_Type;\\n Ordered_Words : Vector;\\n Max_Length : Positive := 1;\\nbegin\\n Open (File, In_File, \\\"unixdict.txt\\\");\\n while not End_Of_File (File) loop\\n declare\\n Word : String := Get_Line (File);\\n begin\\n if (for all i in Word'First..Word'Last-1 => Word (i) <= Word(i+1)) then\\n if Word'Length > Max_Length then\\n Max_Length := Word'Length;\\n Ordered_Words.Clear;\\n Ordered_Words.Append (Word);\\n elsif Word'Length = Max_Length then\\n Ordered_Words.Append (Word);\\n end if;\\n end if;\\n end;\\n end loop;\\n for Word of Ordered_Words loop\\n Put_Line (Word);\\n end loop;\\n Close (File);\\nend Ordered_Words;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"integer\\nordered(data s)\\n{\\n integer a, c, p;\\n\\n a = 1;\\n\\n p = -1;\\n for (, c in s) {\\n if (c < p) {\\n a = 0;\\n break;\\n } else {\\n p = c;\\n }\\n }\\n\\n a;\\n}\\n\\ninteger\\nmain(void)\\n{\\n file f;\\n text s;\\n index x;\\n\\n f.affix(\\\"unixdict.txt\\\");\\n\\n while (f.line(s) != -1) {\\n if (ordered(s)) {\\n x.v_list(~s).append(s);\\n }\\n }\\n\\n l_ucall(x.back, o_, 0, \\\"\\\\n\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"Aime\"\n },\n {\n \"code\": \"PROC ordered = (STRING s)BOOL:\\n BEGIN\\n FOR i TO UPB s - 1 DO IF s[i] > s[i+1] THEN return false FI OD;\\n TRUE EXIT\\n return false: FALSE\\n END;\\n\\nIF FILE input file;\\n STRING file name = \\\"unixdict.txt\\\";\\n open(input file, file name, stand in channel) /= 0\\nTHEN\\n print((\\\"Unable to open file \\\"\\\"\\\" + file name + \\\"\\\"\\\"\\\", newline))\\nELSE\\n BOOL at eof := FALSE;\\n on logical file end (input file, (REF FILE f)BOOL: at eof := TRUE);\\n\\n FLEX [1:0] STRING words;\\n INT idx := 1;\\n INT max length := 0;\\n\\n WHILE NOT at eof\\n DO\\n STRING word;\\n get(input file, (word, newline));\\n IF UPB word >= max length\\n THEN IF ordered(word)\\n THEN\\n max length := UPB word;\\n IF idx > UPB words\\n THEN\\n [1 : UPB words + 20] STRING tmp;\\n tmp[1 : UPB words] := words;\\n words := tmp\\n FI;\\n words[idx] := word;\\n idx +:= 1\\n FI\\n FI\\n OD;\\n print((\\\"Maximum length of ordered words: \\\", whole(max length, -4), newline));\\n FOR i TO idx-1\\n DO\\n IF UPB words[i] = max length THEN print((words[i], newline)) FI\\n OD\\nFI\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"#include <basico.h>\\n\\n#define MAX_LINE 30\\n\\nalgoritmo\\n\\n fd=0\\n word={}, result={}\\n old_word=\\\"\\\",new_word=\\\"\\\"\\n\\n fijar separador (NULO)\\n\\n abrir para leer(\\\"basica/unixdict.txt\\\",fd)\\n\\n iterar mientras ' no es fin de archivo (fd) '\\n usando 'MAX_LINE', leer línea desde(fd),\\n ---copiar en 'old_word'---, separar para 'word '\\n word, ---retener--- ordenar esto,\\n encadenar en 'new_word'\\n\\n new_word, meter según (#(old_word == new_word), result)\\n\\n reiterar\\n\\n cerrar archivo(fd)\\n\\n result ---retener---, obtener largo ---retener---\\n obtener máximo valor, es mayor o igual?, replicar esto\\n compactar esto\\n\\n fijar separador 'NL', luego imprime todo\\n\\nterminar\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"result←longest_ordered_words file_path\\n\\nf←file_path ⎕NTIE 0 ⍝ open file\\ntext←⎕NREAD f 'char8' ⍝ read vector of 8bit chars\\n⎕NUNTIE f ⍝ close file\\n\\nlines←text⊂⍨~text∊(⎕UCS 10 13) ⍝ split into lines (\\\\r\\\\n)\\n\\n⍝ filter only words with ordered characters\\nordered_words←lines/⍨{(⍳∘≢≡⍋)⍵}¨lines\\n\\n⍝ find max of word lengths, filter only words with that length\\nresult←ordered_words/⍨lengths=⍨⌈/lengths←≢¨ordered_words\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.3.1\\\" -- Mac OS 10.9 (Mavericks) or later — for these 'use' commands.\\nuse sorter : script \\\"Insertion sort\\\" -- https://www.rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#AppleScript.\\nuse scripting additions\\n\\non longestOrderedWords(wordList)\\n script o\\n property allWords : wordList\\n property orderedWords : {}\\n end script\\n\\n set longestWordLength to 0\\n set astid to AppleScript's text item delimiters\\n set AppleScript's text item delimiters to \\\"\\\"\\n ignoring case\\n repeat with i from 1 to (count o's allWords)\\n set thisWord to item i of o's allWords\\n set thisWordLength to (count thisWord)\\n if (thisWordLength ≥ longestWordLength) then\\n set theseCharacters to thisWord's characters\\n tell sorter to sort(theseCharacters, 1, -1)\\n set sortedWord to theseCharacters as text\\n if (sortedWord = thisWord) then\\n if (thisWordLength > longestWordLength) then\\n set o's orderedWords to {thisWord}\\n set longestWordLength to thisWordLength\\n else\\n set end of o's orderedWords to thisWord\\n end if\\n end if\\n end if\\n end repeat\\n end ignoring\\n set AppleScript's text item delimiters to astid\\n\\n return (o's orderedWords)\\nend longestOrderedWords\\n\\n-- Test code:\\nlocal wordList\\nset wordList to paragraphs of (read (((path to desktop as text) & \\\"www.rosettacode.org:unixdict.txt\\\") as alias) as «class utf8»)\\n-- ignoring white space, punctuation and diacriticals\\nreturn longestOrderedWords(wordList)\\n--- end ignoring\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{\\\"abbott\\\", \\\"accent\\\", \\\"accept\\\", \\\"access\\\", \\\"accost\\\", \\\"almost\\\", \\\"bellow\\\", \\\"billow\\\", \\\"biopsy\\\", \\\"chilly\\\", \\\"choosy\\\", \\\"choppy\\\", \\\"effort\\\", \\\"floppy\\\", \\\"glossy\\\", \\\"knotty\\\"}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"ordered?: function [w]->\\n w = join sort split w\\n\\nwords: read.lines relative \\\"unixdict.txt\\\"\\nret: new []\\nloop words 'wrd [\\n if ordered? wrd ->\\n 'ret ++ #[w: wrd l: size wrd]\\n]\\n\\nsort.descending.by: 'l 'ret\\nmaxl: get first ret 'l\\nprint sort map select ret 'x -> maxl = x\\\\l\\n 'x -> x\\\\w\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"MaxLen=0\\nLoop, Read, UnixDict.txt ; Assigns A_LoopReadLine to each line of the file\\n{\\n thisword := A_LoopReadLine ; Just for readability\\n blSort := isSorted(thisWord) ; reduce calls to IsSorted to improve performance\\n ThisLen := StrLen(ThisWord) ; reduce calls to StrLen to improve performance\\n If (blSort = true and ThisLen = maxlen)\\n list .= \\\", \\\" . thisword\\n Else If (blSort = true and ThisLen > maxlen)\\n {\\n list := thisword\\n maxlen := ThisLen\\n }\\n}\\n\\nIsSorted(word){ ; This function uses the ASCII value of the letter to determine its place in the alphabet.\\n ; Thankfully, the dictionary is in all lowercase\\n lastchar=0\\n Loop, parse, word\\n {\\n if ( Asc(A_LoopField) < lastchar )\\n return false\\n lastchar := Asc(A_loopField)\\n }\\n return true\\n}\\n\\nGUI, Add, Edit, w300 ReadOnly, %list%\\nGUI, Show\\nreturn ; End Auto-Execute Section\\n\\nGUIClose:\\nExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"BEGIN {\\n\\tabc = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n}\\n\\n{\\n\\t# Check if this line is an ordered word.\\n\\tordered = 1 # true\\n\\tleft = -1\\n\\tfor (i = 1; i <= length($0); i++) {\\n\\t\\tright = index(abc, substr($0, i, 1))\\n\\t\\tif (right == 0 || left > right) {\\n\\t\\t\\tordered = 0 # false\\n\\t\\t\\tbreak\\n\\t\\t}\\n\\t\\tleft = right\\n\\t}\\n\\n\\tif (ordered) {\\n\\t\\tscore = length($0)\\n\\t\\tif (score > best[\\\"score\\\"]) {\\n\\t\\t\\t# Reset the list of best ordered words.\\n\\t\\t\\tbest[\\\"score\\\"] = score\\n\\t\\t\\tbest[\\\"count\\\"] = 1\\n\\t\\t\\tbest[1] = $0\\n\\t\\t} else if (score == best[\\\"score\\\"]) {\\n\\t\\t\\t# Add this word to the list.\\n\\t\\t\\tbest[++best[\\\"count\\\"]] = $0\\n\\t\\t}\\n\\t}\\n}\\n\\nEND {\\n\\t# Print the list of best ordered words.\\n\\tfor (i = 1; i <= best[\\\"count\\\"]; i++)\\n\\t\\tprint best[i]\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"'Ordered words - improved version\\nOPTION COLLAPSE TRUE\\n\\nlist$ = LOAD$(\\\"unixdict.txt\\\")\\n\\nFOR word$ IN list$ STEP NL$\\n\\n term$ = EXTRACT$(SORT$(EXPLODE$(word$, 1)), \\\" \\\")\\n\\n IF word$ = term$ THEN\\n IF LEN(term$) > MaxLen THEN\\n MaxLen = LEN(term$)\\n result$ = word$\\n ELIF LEN(term$) = MaxLen THEN\\n result$ = APPEND$(result$, 0, word$, NL$)\\n END IF\\n END IF\\nNEXT\\n\\nPRINT result$\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \" dict% = OPENIN(\\\"unixdict.txt\\\")\\n IF dict%=0 ERROR 100, \\\"Failed to open dictionary file\\\"\\n\\n max% = 2\\n REPEAT\\n A$ = GET$#dict%\\n IF LENA$ >= max% THEN\\n i% = 0\\n REPEAT i% += 1\\n UNTIL ASCMID$(A$,i%) > ASCMID$(A$,i%+1)\\n IF i% = LENA$ THEN\\n IF i% > max% max% = i% : list$ = \\\"\\\"\\n list$ += A$ + CHR$13 + CHR$10\\n ENDIF\\n ENDIF\\n UNTIL EOF#dict%\\n CLOSE #dict%\\n PRINT list$\\n END\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"00p30p>_010p120p0>#v0~>>\\\\$::48*\\\\`\\\\\\\"~\\\"`+!>>#v_$:#v_>30g:!#v_1-30p55+0>:30g3+g\\\\1v\\n>0#v _$^#::\\\\p04:<^+>#1^#\\\\p01:p02*g02!`\\\\g01:<@$ _ ,#!>#:<$<^<!:g03$<_^#!`\\\\g00:+<\\n^<o>\\\\30g2+p40g1+^0p00p03+1*g03!-g00 < < < < < <:>#$:#$00g#<\\\\#<`#<!#<2#$0g#<*#<_\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \" words←•FLines \\\"unixdict.txt\\\"\\n ¯1⊑(≠¨⊔⊢)(↕∘≠≡⍋)¨⊸/words\\n⟨ \\\"abbott\\\" \\\"accent\\\" \\\"accept\\\" \\\"access\\\" \\\"accost\\\" \\\"almost\\\" \\\"bellow\\\" \\\"billow\\\" \\\"biopsy\\\" \\\"chilly\\\" \\\"choosy\\\" \\\"choppy\\\" \\\"effort\\\" \\\"floppy\\\" \\\"glossy\\\" \\\"knotty\\\" ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \" ( orderedWords\\n = bow result longestLength word character\\n . 0:?bow\\n & :?result\\n & 0:?longestLength\\n & @( get$(!arg,STR)\\n : ?\\n ( [!bow %?word \\\\n [?bow ?\\n & @( !word\\n : ( ? %@?character <%@!character ?\\n | ?\\n ( [!longestLength\\n & !word !result:?result\\n | [>!longestLength:[?longestLength\\n & !word:?result\\n |\\n )\\n )\\n )\\n & ~`\\n )\\n )\\n | !result\\n )\\n& orderedWords$\\\"unixdict.txt\\\"\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"ln{so}f[^^{L[}>mL[bx(==)[+(L[)+]f[uN\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <string.h>\\n#include <stdio.h>\\n#include <assert.h>\\n\\n\\n#define MAXLEN 100\\ntypedef char TWord[MAXLEN];\\n\\n\\ntypedef struct Node {\\n TWord word;\\n struct Node *next;\\n} Node;\\n\\n\\nint is_ordered_word(const TWord word) {\\n assert(word != NULL);\\n int i;\\n\\n for (i = 0; word[i] != '\\\\0'; i++)\\n if (word[i] > word[i + 1] && word[i + 1] != '\\\\0')\\n return 0;\\n\\n return 1;\\n}\\n\\n\\nNode* list_prepend(Node* words_list, const TWord new_word) {\\n assert(new_word != NULL);\\n Node *new_node = malloc(sizeof(Node));\\n if (new_node == NULL)\\n exit(EXIT_FAILURE);\\n\\n strcpy(new_node->word, new_word);\\n new_node->next = words_list;\\n return new_node;\\n}\\n\\n\\nNode* list_destroy(Node *words_list) {\\n while (words_list != NULL) {\\n Node *temp = words_list;\\n words_list = words_list->next;\\n free(temp);\\n }\\n\\n return words_list;\\n}\\n\\n\\nvoid list_print(Node *words_list) {\\n while (words_list != NULL) {\\n printf(\\\"\\\\n%s\\\", words_list->word);\\n words_list = words_list->next;\\n }\\n}\\n\\n\\nint main() {\\n FILE *fp = fopen(\\\"unixdict.txt\\\", \\\"r\\\");\\n if (fp == NULL)\\n return EXIT_FAILURE;\\n\\n Node *words = NULL;\\n TWord line;\\n unsigned int max_len = 0;\\n\\n while (fscanf(fp, \\\"%99s\\\\n\\\", line) != EOF) {\\n if (strlen(line) > max_len && is_ordered_word(line)) {\\n max_len = strlen(line);\\n words = list_destroy(words);\\n words = list_prepend(words, line);\\n } else if (strlen(line) == max_len && is_ordered_word(line)) {\\n words = list_prepend(words, line);\\n }\\n }\\n\\n fclose(fp);\\n list_print(words);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <string.h>\\n#include <stdio.h>\\n#include <assert.h>\\n\\n\\n#define MAXLEN 100\\ntypedef char TWord[MAXLEN];\\n\\n\\ntypedef struct WordsArray {\\n TWord *words;\\n size_t len;\\n} WordsArray;\\n\\n\\nint is_ordered_word(const TWord word) {\\n assert(word != NULL);\\n int i;\\n\\n for (i = 0; word[i] != '\\\\0'; i++)\\n if (word[i] > word[i + 1] && word[i + 1] != '\\\\0')\\n return 0;\\n\\n return 1;\\n}\\n\\n\\nvoid array_append(WordsArray *words_array, const TWord new_word) {\\n assert(words_array != NULL);\\n assert(new_word != NULL);\\n assert((words_array->len == 0) == (words_array->words == NULL));\\n\\n words_array->len++;\\n words_array->words = realloc(words_array->words,\\n words_array->len * sizeof(words_array->words[0]));\\n if (words_array->words == NULL)\\n exit(EXIT_FAILURE);\\n strcpy(words_array->words[words_array->len-1], new_word);\\n}\\n\\n\\nvoid array_free(WordsArray *words_array) {\\n assert(words_array != NULL);\\n free(words_array->words);\\n words_array->words = NULL;\\n words_array->len = 0;\\n}\\n\\n\\nvoid list_print(WordsArray *words_array) {\\n assert(words_array != NULL);\\n size_t i;\\n for (i = 0; i < words_array->len; i++)\\n printf(\\\"\\\\n%s\\\", words_array->words[i]);\\n}\\n\\n\\nint main() {\\n FILE *fp = fopen(\\\"unixdict.txt\\\", \\\"r\\\");\\n if (fp == NULL)\\n return EXIT_FAILURE;\\n\\n WordsArray words;\\n words.len = 0;\\n words.words = NULL;\\n\\n TWord line;\\n line[0] = '\\\\0';\\n unsigned int max_len = 0;\\n\\n while (fscanf(fp, \\\"%99s\\\\n\\\", line) != EOF) { // 99 = MAXLEN - 1\\n if (strlen(line) > max_len && is_ordered_word(line)) {\\n max_len = strlen(line);\\n array_free(&words);\\n array_append(&words, line);\\n } else if (strlen(line) == max_len && is_ordered_word(line)) {\\n array_append(&words, line);\\n }\\n }\\n\\n fclose(fp);\\n list_print(&words);\\n array_free(&words);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <sys/mman.h>\\n#include <sys/types.h>\\n#include <sys/stat.h>\\n#include <unistd.h>\\n#include <fcntl.h>\\n#include <err.h>\\n#include <string.h>\\n\\nint ordered(char *s, char **end)\\n{\\n\\tint r = 1;\\n\\twhile (*++s != '\\\\n' && *s != '\\\\r' && *s != '\\\\0')\\n\\t\\tif (s[0] < s[-1]) r = 0;\\n\\n\\t*end = s;\\n\\treturn r;\\n}\\n\\nint main()\\n{\\n\\tchar *buf, *word, *end, *tail;\\n\\tstruct stat st;\\n\\tint longest = 0, len, fd;\\n\\n\\tif ((fd = open(\\\"unixdict.txt\\\", O_RDONLY)) == -1) err(1, \\\"read error\\\");\\n\\n\\tfstat(fd, &st);\\n\\tif (!(buf = mmap(0, st.st_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0)))\\n\\t\\terr(1, \\\"mmap\\\");\\n\\n\\tfor (word = end = buf; end < buf + st.st_size; word = end) {\\n\\t\\twhile (*word == '\\\\r' || *word == '\\\\n') word++;\\n\\t\\tif (!ordered(word, &end)) continue;\\n\\t\\tif ((len = end - word + 1) < longest) continue;\\n\\t\\tif (len > longest) {\\n\\t\\t\\ttail = buf; /* longer words found; reset out buffer */\\n\\t\\t\\tlongest = len;\\n\\t\\t}\\n\\t\\t/* use the same mmap'd region to store output. because of MAP_PRIVATE,\\n\\t\\t * change will not go back to file. mmap is copy on write, and we are using\\n\\t\\t * only the head space to store output, so kernel doesn't need to copy more\\n\\t\\t * than the words we saved--in this case, one page tops.\\n\\t\\t */\\n\\t\\tmemcpy(tail, word, len);\\n\\t\\ttail += len;\\n\\t\\t*tail = '\\\\0';\\n\\t}\\n\\tprintf(buf);\\n\\n\\tmunmap(buf, st.st_size);\\n\\tclose(fd);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <fstream>\\n#include <iostream>\\n#include <iterator>\\n#include <string>\\n#include <vector>\\n\\nbool ordered(const std::string &word)\\n{\\n return std::is_sorted(word.begin(), word.end()); // C++11\\n}\\n\\nint main()\\n{\\n std::ifstream infile(\\\"unixdict.txt\\\");\\n if (!infile) {\\n std::cerr << \\\"Can't open word file\\\\n\\\";\\n return -1;\\n }\\n\\n std::vector<std::string> words;\\n std::string word;\\n int longest = 0;\\n\\n while (std::getline(infile, word)) {\\n int length = word.length();\\n if (length < longest) continue; // don't test short words\\n\\n if (ordered(word)) {\\n if (longest < length) {\\n longest = length; // set new minimum length\\n words.clear(); // reset the container\\n }\\n words.push_back(word);\\n }\\n }\\n std::copy(words.begin(), words.end(), std::ostream_iterator<std::string>(std::cout, \\\"\\\\n\\\"));\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Net;\\n\\nstatic class Program\\n{\\n static void Main(string[] args)\\n {\\n WebClient client = new WebClient();\\n string text = client.DownloadString(\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\");\\n string[] words = text.Split(new char[] { '\\\\r', '\\\\n' }, StringSplitOptions.RemoveEmptyEntries);\\n\\n var query = from w in words\\n where IsOrderedWord(w)\\n group w by w.Length into ows\\n orderby ows.Key descending\\n select ows;\\n\\n Console.WriteLine(string.Join(\\\", \\\", query.First().ToArray()));\\n }\\n\\n private static bool IsOrderedWord(string w)\\n {\\n for (int i = 1; i < w.Length; i++)\\n if (w[i] < w[i - 1])\\n return false;\\n\\n return true;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn is-sorted? [coll]\\n (not-any? pos? (map compare coll (next coll))))\\n\\n(defn take-while-eqcount [coll]\\n (let [n (count (first coll))]\\n (take-while #(== n (count %)) coll)))\\n\\n(with-open [rdr (clojure.java.io/reader \\\"unixdict.txt\\\")]\\n (->> rdr\\n line-seq\\n (filter is-sorted?)\\n (sort-by count >)\\n take-while-eqcount\\n (clojure.string/join \\\", \\\")\\n println))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"abbott, accent, accept, access, accost, almost, bellow, billow, biopsy, chilly, choosy, choppy, effort, floppy, glossy, knotty\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"is_ordered = proc (s: string) returns (bool)\\n last: char := '\\\\000'\\n for c: char in string$chars(s) do\\n if last > c then return(false) end\\n last := c\\n end\\n return(true)\\nend is_ordered\\n\\nlines = iter (s: stream) yields (string)\\n while true do\\n yield(stream$getl(s))\\n except when end_of_file: break end\\n end\\nend lines\\n\\nordered_words = proc (s: stream) returns (array[string])\\n words: array[string]\\n max_len: int := 0\\n for word: string in lines(s) do\\n if is_ordered(word) then\\n len: int := string$size(word)\\n if len > max_len then\\n max_len := len\\n words := array[string]$[]\\n elseif len = max_len then\\n array[string]$addh(words,word)\\n end\\n end\\n end\\n return(words)\\nend ordered_words\\n\\nstart_up = proc ()\\n dict: stream := stream$open(file_name$parse(\\\"unixdict.txt\\\"), \\\"read\\\")\\n words: array[string] := ordered_words(dict)\\n stream$close(dict)\\n\\n po: stream := stream$primary_output()\\n for word: string in array[string]$elements(words) do\\n stream$putl(po, word)\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. ABC-WORDS.\\n\\n ENVIRONMENT DIVISION.\\n INPUT-OUTPUT SECTION.\\n FILE-CONTROL.\\n SELECT DICT ASSIGN TO DISK\\n ORGANIZATION LINE SEQUENTIAL.\\n\\n DATA DIVISION.\\n FILE SECTION.\\n FD DICT\\n LABEL RECORD STANDARD\\n VALUE OF FILE-ID IS \\\"unixdict.txt\\\".\\n 01 ENTRY.\\n 03 WORD PIC X(32).\\n 03 LETTERS PIC X OCCURS 32 TIMES, REDEFINES WORD.\\n\\n WORKING-STORAGE SECTION.\\n 01 LEN PIC 99.\\n 01 MAXLEN PIC 99 VALUE 0.\\n 01 I PIC 99.\\n 01 OK-FLAG PIC X.\\n 88 OK VALUE '*'.\\n\\n PROCEDURE DIVISION.\\n BEGIN.\\n OPEN INPUT DICT.\\n\\n FIND-LONGEST-WORD.\\n READ DICT, AT END CLOSE DICT, GO TO PRINT-LONGEST-WORDS.\\n PERFORM CHECK-WORD.\\n GO TO FIND-LONGEST-WORD.\\n\\n PRINT-LONGEST-WORDS.\\n ALTER VALID-WORD TO PROCEED TO SHOW-WORD.\\n OPEN INPUT DICT.\\n\\n READ-WORDS.\\n READ DICT, AT END CLOSE DICT, STOP RUN.\\n PERFORM CHECK-WORD.\\n GO TO READ-WORDS.\\n\\n CHECK-WORD.\\n MOVE ZERO TO LEN.\\n INSPECT WORD TALLYING LEN\\n FOR CHARACTERS BEFORE INITIAL SPACE.\\n MOVE '*' TO OK-FLAG.\\n PERFORM CHECK-CHAR-PAIR VARYING I FROM 2 BY 1\\n UNTIL NOT OK OR I IS GREATER THAN LEN.\\n IF OK, PERFORM DO-WORD.\\n\\n CHECK-CHAR-PAIR.\\n IF LETTERS(I - 1) IS GREATER THAN LETTERS(I),\\n MOVE SPACE TO OK-FLAG.\\n\\n DO-WORD SECTION.\\n VALID-WORD.\\n GO TO CHECK-LENGTH.\\n CHECK-LENGTH.\\n IF LEN IS GREATER THAN MAXLEN, MOVE LEN TO MAXLEN.\\n GO TO DONE.\\n SHOW-WORD.\\n IF LEN IS EQUAL TO MAXLEN, DISPLAY WORD.\\n DONE.\\n EXIT.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"ordered_word = (word) ->\\n for i in [0...word.length - 1]\\n return false unless word[i] <= word[i+1]\\n true\\n\\nshow_longest_ordered_words = (candidates, dict_file_name) ->\\n words = ['']\\n for word in candidates\\n continue if word.length < words[0].length\\n if ordered_word word\\n words = [] if word.length > words[0].length\\n words.push word\\n return if words[0] == '' # we came up empty\\n console.log \\\"Longest Ordered Words (source=#{dict_file_name}):\\\"\\n for word in words\\n console.log word\\n\\ndict_file_name = 'unixdict.txt'\\nfile_content = require('fs').readFileSync dict_file_name\\ndict_words = file_content.toString().split '\\\\n'\\nshow_longest_ordered_words dict_words, dict_file_name\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"> coffee ordered_words.coffee\\nLongest Ordered Words (source=unixdict.txt):\\nabbott\\naccent\\naccept\\naccess\\naccost\\nalmost\\nbellow\\nbillow\\nbiopsy\\nchilly\\nchoosy\\nchoppy\\neffort\\nfloppy\\nglossy\\nknotty\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun orderedp (word)\\n (reduce (lambda (prev curr)\\n (when (char> prev curr) (return-from orderedp nil))\\n curr)\\n word)\\n t)\\n\\n(defun longest-ordered-words (filename)\\n (let ((result nil))\\n (with-open-file (s filename)\\n (loop\\n with greatest-length = 0\\n for word = (read-line s nil)\\n until (null word)\\n do (let ((length (length word)))\\n (when (and (>= length greatest-length)\\n (orderedp word))\\n (when (> length greatest-length)\\n (setf greatest-length length\\n result nil))\\n (push word result)))))\\n (nreverse result)))\\n\\nCL-USER> (longest-ordered-words \\\"unixdict.txt\\\")\\n(\\\"abbott\\\" \\\"accent\\\" \\\"accept\\\" \\\"access\\\" \\\"accost\\\" \\\"almost\\\" \\\"bellow\\\" \\\"billow\\\"\\n \\\"biopsy\\\" \\\"chilly\\\" \\\"choosy\\\" \\\"choppy\\\" \\\"effort\\\" \\\"floppy\\\" \\\"glossy\\\" \\\"knotty\\\")\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun orderedp (word)\\n (apply #'char<= (coerce word 'list)))\\n\\n(let* ((words (uiop:read-file-lines \\\"unixdict.txt\\\"))\\n\\t (ordered (delete-if-not #'orderedp words))\\n\\t (maxlen (apply #'max (mapcar #'length ordered)))\\n\\t (result (delete-if-not (lambda (l) (= l maxlen)) ordered :key #'length)))\\n (format t \\\"~{~A~^, ~}\\\" result))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\ninclude \\\"strings.coh\\\";\\ninclude \\\"file.coh\\\";\\n\\nvar filename: [uint8] := \\\"unixdict.txt\\\";\\n\\n# Call a subroutine for every line in a file\\ninterface LineCb(line: [uint8]);\\nsub ForEachLine(fcb: [FCB], fn: LineCb) is\\n var linebuf: uint8[256];\\n var bufptr := &linebuf[0];\\n\\n var len := FCBExt(fcb); # get length of file\\n FCBSeek(fcb, 0); # start at beginning of file\\n\\n while len > 0 loop\\n var ch := FCBGetChar(fcb);\\n if ch == '\\\\n' then\\n # end of line, terminate string\\n [bufptr] := 0;\\n fn(&linebuf[0]);\\n bufptr := &linebuf[0];\\n else\\n # add char to buffer\\n [bufptr] := ch;\\n bufptr := @next bufptr;\\n end if;\\n len := len - 1;\\n end loop;\\n\\n # If the file doesn't cleanly end on a line terminator,\\n # also call for last incomplete line\\n if ch != '\\\\n' then\\n [bufptr] := 0;\\n fn(&linebuf[0]);\\n end if;\\nend sub;\\n\\n# Check if the letters in a word appear in alphabetical order\\nsub isOrdered(word: [uint8]): (r: uint8) is\\n var cr := [word];\\n word := @next word;\\n loop\\n var cl := cr;\\n cr := [word];\\n word := @next word;\\n if cr < 32 then\\n r := 1;\\n return;\\n elseif (cl | 32) > (cr | 32) then\\n r := 0;\\n return;\\n end if;\\n end loop;\\nend sub;\\n\\n# Find maximum length of ordered words\\nvar maxLen: uint8 := 0;\\nsub MaxOrderedLength implements LineCb is\\n var len := StrLen(line) as uint8;\\n if maxLen < len and isOrdered(line) != 0 then\\n maxLen := len;\\n end if;\\nend sub;\\n\\n# Print all ordered words matching maximum length\\nsub PrintMaxLenWord implements LineCb is\\n if maxLen == StrLen(line) as uint8 and isOrdered(line) != 0 then\\n print(line);\\n print_nl();\\n end if;\\nend sub;\\n\\nvar fcb: FCB;\\nif FCBOpenIn(&fcb, filename) != 0 then\\n print(\\\"cannot open unixdict.txt\\\\n\\\");\\n ExitWithError();\\nend if;\\n\\nForEachLine(&fcb, MaxOrderedLength);\\nForEachLine(&fcb, PrintMaxLenWord);\\n\\nvar foo := FCBClose(&fcb);\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.range, std.string;\\n\\n string[] result;\\n size_t maxLen;\\n\\n foreach (string word; \\\"unixdict.txt\\\".File.lines) {\\n word = word.chomp;\\n immutable len = word.walkLength;\\n if (len < maxLen || !word.isSorted)\\n continue;\\n if (len > maxLen) {\\n result = [word];\\n maxLen = len;\\n } else\\n result ~= word;\\n }\\n\\n writefln(\\\"%-(%s\\\\n%)\\\", result);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.file, std.range;\\n\\n string[] result;\\n size_t maxWalkLen;\\n\\n foreach (word; \\\"unixdict.txt\\\".readText.splitter) {\\n if (word.length >= maxWalkLen && word.isSorted) {\\n immutable wlen = word.walkLength;\\n if (wlen > maxWalkLen) {\\n result.length = 0;\\n maxWalkLen = wlen;\\n }\\n result ~= word.idup;\\n }\\n }\\n\\n writefln(\\\"%-(%s\\\\n%)\\\", result);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.algorithm, std.range, std.file, std.string;\\n\\n auto words = \\\"unixdict.txt\\\".readText.split.filter!isSorted;\\n immutable maxLen = words.map!q{a.length}.reduce!max;\\n writefln(\\\"%-(%s\\\\n%)\\\", words.filter!(w => w.length == maxLen));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, core.stdc.string, std.mmfile, std.algorithm;\\n\\nconst(char)[] findWord(const char[] s) pure nothrow @safe @nogc {\\n size_t wordEnd = 0;\\n while (wordEnd < s.length && s[wordEnd] != '\\\\n' && s[wordEnd] != '\\\\r')\\n wordEnd++;\\n return s[0 .. wordEnd];\\n}\\n\\nvoid main() {\\n auto mmf = new MmFile(\\\"unixdict.txt\\\", MmFile.Mode.readCopyOnWrite, 0, null);\\n auto txt = cast(char[])(mmf[]);\\n size_t maxLen = 0, outStart = 0;\\n\\n for (size_t wordStart = 0; wordStart < txt.length; ) {\\n while (wordStart < txt.length &&\\n (txt[wordStart] == '\\\\r' || txt[wordStart] == '\\\\n'))\\n wordStart++;\\n const word = findWord(txt[wordStart .. $]);\\n wordStart += word.length;\\n\\n if (word.length < maxLen || !word.isSorted)\\n continue;\\n if (word.length > maxLen) {\\n // Longer ordered word found, reset the out buffer.\\n outStart = 0;\\n maxLen = word.length;\\n }\\n\\n // Use the same mmap'd region to store output. Because of\\n // Mode.readCopyOnWrite, change will not go back to file.\\n // We are using only the head space to store output, so\\n // kernel doesn't need to copy more than the words we saved,\\n // in this case, one page tops.\\n memcpy(&txt[outStart], word.ptr, word.length);\\n outStart += word.length;\\n txt[outStart++] = '\\\\n'; // Words separator in out buffer.\\n }\\n\\n txt[0 .. outStart].write;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program POrderedWords;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n SysUtils, Classes, IdHTTP;\\n\\nfunction IsOrdered(const s:string): Boolean;\\nvar\\n I: Integer;\\nbegin\\n Result := Length(s)<2; // empty or 1 char strings are ordered\\n for I := 2 to Length(s) do\\n if s[I]<s[I-1] then // can improve using case/localization to order...\\n Exit;\\n Result := True;\\nend;\\n\\nfunction ProcessDictionary(const AUrl: string): string;\\nvar\\n slInput: TStringList;\\n I, WordSize: Integer;\\nbegin\\n slInput := TStringList.Create;\\n try\\n with TIdHTTP.Create(nil) do try\\n slInput.Text := Get(AUrl);\\n finally\\n Free;\\n end;\\n // or use slInput.LoadFromFile('yourfilename') to load from a local file\\n WordSize :=0;\\n for I := 0 to slInput.Count-1 do begin\\n if IsOrdered(slInput[I]) then\\n if (Length(slInput[I]) = WordSize) then\\n Result := Result + slInput[I] + ' '\\n else if (Length(slInput[I]) > WordSize) then begin\\n Result := slInput[I] + ' ';\\n WordSize := Length(slInput[I]);\\n end;\\n end;\\n finally\\n slInput.Free;\\n end;\\nend;\\n\\nbegin\\n try\\n WriteLn(ProcessDictionary('http://www.puzzlers.org/pub/wordlists/unixdict.txt'));\\n except\\n on E: Exception do\\n Writeln(E.ClassName, ': ', E.Message);\\n end;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"\\\\util.g\\n\\nproc nonrec is_ordered(*char str) bool:\\n while str* /= '\\\\e' and str* <= (str+1)* do\\n str := str + 1\\n od;\\n str* = '\\\\e' or (str+1)* = '\\\\e'\\ncorp\\n\\nproc nonrec main() void:\\n [64]char buf;\\n *char str;\\n word length, max_length;\\n file(1024) dictfile;\\n channel input text dict;\\n\\n str := &buf[0];\\n max_length := 0;\\n open(dict, dictfile, \\\"unixdict.txt\\\");\\n while readln(dict; str) do\\n if is_ordered(str) then\\n length := CharsLen(str);\\n if length > max_length then max_length := length fi\\n fi\\n od;\\n close(dict);\\n\\n open(dict, dictfile, \\\"unixdict.txt\\\");\\n while readln(dict; str) do\\n if is_ordered(str) then\\n length := CharsLen(str);\\n if length = max_length then writeln(str) fi\\n fi\\n od;\\n close(dict)\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"pragma.enable(\\\"accumulator\\\")\\n\\ndef words := <http://www.puzzlers.org/pub/wordlists/unixdict.txt>.getText().split(\\\"\\\\n\\\")\\ndef ordered := accum [] for word ? (word.sort() <=> word) in words { _.with(word) }\\ndef maxLen := accum 0 for word in ordered { _.max(word.size()) }\\ndef maxOrderedWords := accum [] for word ? (word.size() <=> maxLen) in ordered { _.with(word) }\\nprintln(\\\" \\\".rjoin(maxOrderedWords))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def best := [].diverge()\\nfor `@word$\\\\n` ? (word.sort() <=> word) in <http://www.puzzlers.org/pub/wordlists/unixdict.txt> {\\n if (best.size() == 0) {\\n best.push(word)\\n } else if (word.size() > best[0].size()) {\\n best(0) := [word] # replace all\\n } else if (word.size() <=> best[0].size()) {\\n best.push(word)\\n }\\n}\\nprintln(\\\" \\\".rjoin(best.snapshot()))\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"(define (ordered? str)\\n (for/and ([i (in-range 1 (string-length str))])\\n (string-ci<=? (string-ref str (1- i)) (string-ref str i))))\\n\\n(define (ordre words)\\n(define wl 0)\\n(define s 's)\\n\\t(for/fold (len 0) ((w words))\\n\\t\\t(set! wl (string-length w))\\n\\t\\t#:continue (< wl len)\\n\\t\\t#:when (ordered? w)\\n\\t\\t#:continue (and (= len wl) (push s w))\\n\\t\\t(push (stack s) w) ;; start a new list of length wl\\n\\t\\twl)\\n\\t(stack->list s))\\n\\t\\n;; output\\n(load 'unixdict)\\n(ordre (text-parse unixdict))\\n → (abbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty)\\n\\n;; with the dictionaries provided with EchoLisp\\n;; french\\n → (accentué) ;; ordered, longest, and ... self-reference\\n;; english\\n → (Adelops alloquy beefily begorry billowy egilops)\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"File.read!(\\\"unixdict.txt\\\")\\n|> String.split\\n|> Enum.filter(fn word -> String.codepoints(word) |> Enum.sort |> Enum.join == word end)\\n|> Enum.group_by(fn word -> String.length(word) end)\\n|> Enum.max_by(fn {length,_words} -> length end)\\n|> elem(1)\\n|> Enum.sort\\n|> Enum.each(fn word -> IO.puts word end)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module( ordered_words ).\\n\\n-export( [is_ordered/1, task/0] ).\\n\\nis_ordered( Word ) -> lists:sort( Word ) =:= Word.\\n\\ntask() ->\\n ok = find_unimplemented_tasks:init_http(),\\n Ordered_words = [X || X <- words(), is_ordered(X)],\\n Sorted_longest_length_first = lists:reverse( sort_with_length( Ordered_words ) ),\\n [{Max_length, _Word1} | _T] = Sorted_longest_length_first,\\n Longest_length_first = lists:takewhile( fun({Length, _Word2}) -> Length =:= Max_length end, Sorted_longest_length_first ),\\n [X || {_Length, X} <- Longest_length_first].\\n\\n\\n\\nsort_with_length( Words ) ->\\n Words_with_length_first = [{erlang:length(X), X} || X <- Words],\\n lists:sort( Words_with_length_first ).\\n\\nwords() -> anagrams_deranged:words_from_url( \\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\" ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"include misc.e\\n\\ntype ordered(sequence s)\\n for i = 1 to length(s)-1 do\\n -- assume all items in the sequence are atoms\\n if s[i]>s[i+1] then\\n return 0\\n end if\\n end for\\n return 1\\nend type\\n\\ninteger maxlen\\nsequence words\\nobject word\\nconstant fn = open(\\\"unixdict.txt\\\",\\\"r\\\")\\nmaxlen = -1\\n\\nwhile 1 do\\n word = gets(fn)\\n if atom(word) then\\n exit\\n end if\\n word = word[1..$-1] -- truncate new-line\\n if length(word) >= maxlen and ordered(word) then\\n if length(word) > maxlen then\\n maxlen = length(word)\\n words = {}\\n end if\\n words = append(words,word)\\n end if\\nend while\\n\\nclose(fn)\\n\\npretty_print(1,words,{2})\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"open System\\nopen System.IO\\n\\nlet longestOrderedWords() =\\n let isOrdered = Seq.pairwise >> Seq.forall (fun (a,b) -> a <= b)\\n\\n File.ReadLines(\\\"unixdict.txt\\\")\\n |> Seq.filter isOrdered\\n |> Seq.groupBy (fun s -> s.Length)\\n |> Seq.sortBy (fst >> (~-))\\n |> Seq.head |> snd\\n\\nlongestOrderedWords() |> Seq.iter (printfn \\\"%s\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: grouping http.client io io.encodings.utf8 io.files\\nio.files.temp kernel math memoize sequences sequences.extras\\nunicode.case urls ;\\nIN: rosetta-code.ordered-words\\n\\nMEMO: word-list ( -- seq )\\n \\\"unixdict.txt\\\" temp-file dup exists? [\\n URL\\\" http://puzzlers.org/pub/wordlists/unixdict.txt\\\"\\n over download-to\\n ] unless utf8 file-lines ;\\n\\n: ordered-word? ( word -- ? )\\n >lower [ <= ] monotonic? ;\\n\\n: ordered-words-main ( -- )\\n word-list [ ordered-word? ] filter\\n all-longest [ print ] each ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Main\\n{\\n public static Bool ordered (Str word)\\n {\\n word.chars.all |Int c, Int i -> Bool|\\n {\\n (i == (word.size-1) || c <= word.chars[i+1])\\n }\\n }\\n\\n public static Void main ()\\n {\\n Str[] words := [,]\\n File(`unixdict.txt`).eachLine |Str word|\\n {\\n if (ordered(word))\\n {\\n if (words.isEmpty || words.first.size < word.size)\\n { // reset the list\\n words = [word]\\n }\\n else if (words.size >= 1 && words.first.size == word.size)\\n { // add word to existing ones\\n words.add (word)\\n }\\n }\\n }\\n echo (words.join (\\\" \\\"))\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"#APPTYPE CONSOLE\\n\\nFUNCTION RESTfulGET(url)\\n DIM %HTTP = CREATEOBJECT(\\\"WinHttp.WinHttpRequest.5.1\\\")\\n CALLMETHOD(HTTP, \\\".open %s, %s, %d\\\", \\\"GET\\\", url, FALSE)\\n CALLMETHOD(HTTP, \\\".send\\\")\\n RETURN GETVALUE(\\\"%s\\\", HTTP, \\\".ResponseText\\\")\\nEND FUNCTION\\n\\nDIM $TEXT = RESTfulGET(\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\")\\nDIM dict[] = Split(TEXT, CHR(10))\\nDIM max AS INTEGER = UBOUND(dict)\\nDIM theword AS STRING\\nDIM words[]\\nFOR DIM i = 0 TO max\\n theWord = dict[i]\\n IF isOrdered(theWord) THEN\\n words[LEN(theWord)] = words[LEN(theWord)] & \\\" \\\" & theWord\\n END IF\\nNEXT\\n\\nPRINT words[UBOUND(words)]\\n\\nPAUSE\\n\\nFUNCTION isOrdered(s)\\n FOR DIM i = 1 TO LEN(s) - 1\\n IF s{i} > s{i + 1} THEN\\n RETURN FALSE\\n END IF\\n NEXT\\n RETURN TRUE\\nEND FUNCTION\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \"include lib/stmstack.4th \\\\ include string stack library\\n\\n: check-word ( a n -- a n f)\\n 2dup bl >r \\\\ start off with a space\\n begin\\n dup \\\\ when not end of word\\n while\\n over c@ r@ >= \\\\ check character\\n while\\n r> drop over c@ >r chop \\\\ chop character off\\n repeat r> drop nip 0= \\\\ cleanup and set flag\\n;\\n\\n: open-file ( -- h)\\n 1 dup argn = abort\\\" Usage: ordered infile\\\"\\n args input open error? abort\\\" Cannot open file\\\"\\n dup use \\\\ return and use the handle\\n;\\n\\n: read-file ( --)\\n 0 >r \\\\ begin with zero length\\n begin\\n refill \\\\ EOF detected?\\n while\\n 0 parse dup r@ >= \\\\ equal or longer string length?\\n if \\\\ check the word and adjust length\\n check-word if r> drop dup >r >s else 2drop then\\n else \\\\ if it checks out, put on the stack\\n 2drop \\\\ otherwise drop the word\\n then\\n repeat r> drop \\\\ clean it up\\n;\\n\\n: read-back ( --)\\n s> dup >r type cr \\\\ longest string is on top of stack\\n begin s> dup r@ >= while type cr repeat\\n 2drop r> drop \\\\ keep printing until shorter word\\n; \\\\ has been found\\n\\n: ordered ( --)\\n open-file s.clear read-file read-back close\\n; \\\\ open file, clear the stack, read file\\n \\\\ read it back and close the file\\nordered\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"!***************************************************************************************\\n module ordered_module\\n!***************************************************************************************\\n implicit none\\n\\n\\t!the dictionary file:\\n\\tinteger,parameter :: file_unit = 1000\\n\\tcharacter(len=*),parameter :: filename = 'unixdict.txt'\\n\\n\\t!maximum number of characters in a word:\\n\\tinteger,parameter :: max_chars = 50\\n\\n\\ttype word\\n\\t character(len=max_chars) :: str !the word from the dictionary\\n\\t integer\\t:: n = 0 !length of this word\\n\\t logical\\t:: ordered = .false. !if it is an ordered word\\n\\tend type word\\n\\n\\t!the dictionary structure:\\n\\ttype(word),dimension(:),allocatable :: dict\\n\\n\\tcontains\\n!***************************************************************************************\\n\\n\\t!******************************************************************************\\n\\t\\tfunction count_lines_in_file(fid) result(n_lines)\\n\\t!******************************************************************************\\n\\t\\timplicit none\\n\\n\\t\\tinteger :: n_lines\\n\\t\\tinteger,intent(in) :: fid\\t\\t\\n\\t\\tcharacter(len=1) :: tmp\\n\\t\\tinteger :: i\\n\\t\\tinteger :: ios\\n\\n\\t\\t!the file is assumed to be open already.\\n\\n\\t\\trewind(fid)\\t !rewind to beginning of the file\\n\\n\\t\\tn_lines = 0\\n\\t\\tdo !read each line until the end of the file.\\n\\t\\t\\tread(fid,'(A1)',iostat=ios) tmp\\n\\t\\t\\tif (ios < 0) exit !End of file\\n\\t\\t\\tn_lines = n_lines + 1 !row counter\\n\\t\\tend do\\n\\n\\t\\trewind(fid) !rewind to beginning of the file\\t\\n\\n\\t!******************************************************************************\\n\\t\\tend function count_lines_in_file\\n\\t!******************************************************************************\\n\\n\\t!******************************************************************************\\n\\t pure elemental function ordered_word(word) result(yn)\\n\\t!******************************************************************************\\n\\t! turns true if word is an ordered word, false if it is not.\\n\\t!******************************************************************************\\n\\t\\n\\t implicit none\\n\\t character(len=*),intent(in) :: word\\n\\t logical :: yn\\n\\t\\n\\t integer :: i\\n\\t\\n\\t yn = .true.\\n\\t do i=1,len_trim(word)-1\\n\\t \\tif (ichar(word(i+1:i+1))<ichar(word(i:i))) then\\n\\t \\t\\tyn = .false.\\n\\t \\t\\texit\\n\\t \\tend if\\n\\t end do\\n\\t\\n\\t!******************************************************************************\\n\\t end function ordered_word\\n\\t!******************************************************************************\\n\\n!***************************************************************************************\\n end module ordered_module\\n!***************************************************************************************\\n\\n!****************************************************\\n program main\\n!****************************************************\\n use ordered_module\\n implicit none\\n\\n\\tinteger :: i,n,n_max\\n\\n\\t!open the dictionary and read in all the words:\\n\\topen(unit=file_unit,file=filename) \\t\\t!open the file\\n\\tn = count_lines_in_file(file_unit) !count lines in the file\\n\\tallocate(dict(n)) !allocate dictionary structure\\n\\tdo i=1,n !\\n\\t\\tread(file_unit,'(A)') dict(i)%str !each line is a word in the dictionary\\n\\t\\tdict(i)%n = len_trim(dict(i)%str) !save word length\\n\\tend do\\t\\t\\n\\tclose(file_unit) !close the file\\n\\n\\t!use elemental procedure to get ordered words:\\n\\tdict%ordered = ordered_word(dict%str)\\t\\n\\n\\t!max length of an ordered word:\\n\\tn_max = maxval(dict%n, mask=dict%ordered)\\n\\t\\t\\n\\t!write the output:\\n\\tdo i=1,n\\n\\t\\tif (dict(i)%ordered .and. dict(i)%n==n_max) write(*,'(A,A)',advance='NO') trim(dict(i)%str),' '\\n\\tend do\\n\\twrite(*,*) ''\\n\\n!****************************************************\\n end program main\\n!****************************************************\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction isOrdered(s As Const String) As Boolean\\n If Len(s) <= 1 Then Return True\\n For i As Integer = 1 To Len(s) - 1\\n If s[i] < s[i - 1] Then Return False\\n Next\\n Return True\\nEnd Function\\n\\nDim words() As String\\nDim word As String\\nDim maxLength As Integer = 0\\nDim count As Integer = 0\\nOpen \\\"undict.txt\\\" For Input As #1\\nWhile Not Eof(1)\\n Line Input #1, word\\n If isOrdered(word) Then\\n If Len(word) = maxLength Then\\n Redim Preserve words(0 To count)\\n words(count) = word\\n count += 1\\n ElseIf Len(word) > maxLength Then\\n Erase words\\n maxLength = Len(word)\\n Redim words(0 To 0)\\n words(0) = word\\n count = 1\\n End If\\n End If\\nWend\\n\\nClose #1\\n\\nPrint \\\"The ordered words with the longest length (\\\"; Str(maxLength); \\\") in undict.txt are :\\\"\\nPrint\\nFor i As Integer = 0 To UBound(words)\\n Print words(i)\\nNext\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"url=\\\"https://web.archive.org/web/20180611003215if_/http://www.puzzlers.org:80/pub/wordlists/unixdict.txt\\\"\\na = sort[select[lines[url], {|w| charList[w] == sort[charList[w]] } ], {|a,b| length[a] <=> length[b]}]\\nprintln[sort[select[a, {|w, longest| length[w] == longest}, length[last[a]]]]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"#plist NSAppTransportSecurity @{NSAllowsArbitraryLoads:YES}\\n\\nlocal fn Words as CFArrayRef\\n CFURLRef url = fn URLWithString( @\\\"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\" )\\n CFStringRef string = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )\\nend fn = fn StringComponentsSeparatedByCharactersInSet( string, fn CharacterSetNewlineSet )\\n\\n\\nlocal fn IsOrderedWord( string as CFStringRef ) as BOOL\\n BOOL flag = YES\\n long i\\n unichar chr, prevChr = 0\\n\\n for i = 0 to len(string) - 1\\n chr = fn StringCharacterAtIndex( string, i )\\n if ( chr < prevChr )\\n flag = NO : break\\n end if\\n prevChr = chr\\n next\\nend fn = flag\\n\\n\\nvoid local fn DoIt\\n CFStringRef string\\n CFArrayRef words = fn Words\\n long length, maxLen = 0\\n CFMutableStringRef orderedWords = fn MutableStringWithCapacity(0)\\n\\n for string in words\\n length = len(string)\\n if ( length < maxLen ) then continue\\n if ( fn IsOrderedWord( string ) )\\n if ( length > maxLen )\\n MutableStringSetString( orderedWords, @\\\"\\\" )\\n maxLen = length\\n end if\\n MutableStringAppendFormat( orderedWords, @\\\"%@\\\\n\\\", string )\\n end if\\n next\\n\\n print orderedWords\\nend fn\\n\\nfn DoIt\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"Public Sub Main()\\nDim sDict As String = File.Load(User.Home &/ \\\"unixdict.txt\\\") 'Store the 'Dictionary'\\nDim sOrdered As New String[] 'To store ordered words\\nDim sHold As New String[] 'General store\\nDim sTemp As String 'Temp variable\\nDim siCount As Short 'Counter\\n\\nFor Each sTemp In Split(sDict, gb.NewLine) 'For each word in the Dictionary\\n For siCount = 1 To Len(sTemp) 'Loop for each letter in the word\\n sHold.Add(Mid(sTemp, siCount, 1)) 'Put each letter in sHold array\\n Next\\n sHold.Sort() 'Sort sHold (abbott = abboot, zoom = mooz)\\n If sTemp = sHold.Join(\\\"\\\") Then sOrdered.Add(sTemp) 'If they are the same (abbott(OK) mooz(not OK)) then add to sOrdered\\n sHold.Clear 'Empty sHold\\nNext\\n\\nsiCount = 0 'Reset siCount\\n\\nFor Each sTemp In sOrdered 'For each of the Ordered words\\n If Len(sTemp) > siCount Then siCount = Len(sTemp) 'Count the length of the word and keep a record of the longest length\\nNext\\n\\nFor Each sTemp In sOrdered 'For each of the Ordered words\\n If Len(sTemp) = siCount Then sHold.Add(sTemp) 'If it is one of the longest add it to sHold\\nNext\\n\\nsHold.Sort() 'Sort sHold\\nPrint sHold.Join(gb.NewLine) 'Display the result\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"bytes\\\"\\n \\\"fmt\\\"\\n \\\"io/ioutil\\\"\\n)\\n\\nfunc main() {\\n // read into memory in one chunk\\n b, err := ioutil.ReadFile(\\\"unixdict.txt\\\")\\n if err != nil {\\n fmt.Println(err)\\n return\\n }\\n // split at line ends\\n bss := bytes.Split(b, []byte{'\\\\n'})\\n\\n // accumulate result\\n var longest int\\n var list [][]byte\\n for _, bs := range bss {\\n // don't bother with words shorter than\\n // our current longest ordered word\\n if len(bs) < longest {\\n continue\\n }\\n // check for ordered property\\n var lastLetter byte\\n for i := 0; ; i++ {\\n if i == len(bs) {\\n // end of word. it's an ordered word.\\n // save it and break from loop\\n if len(bs) > longest {\\n longest = len(bs)\\n list = list[:0]\\n }\\n list = append(list, bs)\\n break\\n }\\n // check next letter\\n b := bs[i]\\n if b < 'a' || b > 'z' {\\n continue // not a letter. ignore.\\n }\\n if b < lastLetter {\\n break // word not ordered.\\n }\\n // letter passes test\\n lastLetter = b\\n }\\n }\\n // print result\\n for _, bs := range list {\\n fmt.Println(string(bs))\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def isOrdered = { word -> def letters = word as List; letters == ([] + letters).sort() }\\nassert isOrdered('abbey')\\nassert !isOrdered('cat')\\n\\ndef dictUrl = new URL('http://www.puzzlers.org/pub/wordlists/unixdict.txt')\\ndef orderedWords = dictUrl.readLines().findAll { isOrdered(it) }\\ndef owMax = orderedWords*.size().max()\\n\\norderedWords.findAll { it.size() == owMax }.each { println it }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"-- Words are read from the standard input. We keep in memory only the current\\n-- set of longest, ordered words.\\n--\\n-- Limitation: the locale's collation order is not take into consideration.\\n\\nisOrdered wws@(_:ws) = and $ zipWith (<=) wws ws\\n\\nlongestOrderedWords = reverse . snd . foldl f (0,[]) . filter isOrdered\\n where f (max, acc) w =\\n let len = length w in\\n case compare len max of\\n LT -> (max, acc)\\n EQ -> (max, w:acc)\\n GT -> (len, [w])\\n\\nmain = do\\n str <- getContents\\n let ws = longestOrderedWords $ words str\\n mapM_ putStrLn ws\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"abbott\\naccent\\naccept\\naccess\\naccost\\nalmost\\nbellow\\nbillow\\nbiopsy\\nchilly\\nchoosy\\nchoppy\\neffort\\nfloppy\\nglossy\\nknotty\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad (liftM)\\n\\nisSorted wws@(_ : ws) = and $ zipWith (<=) wws ws\\n\\ngetLines = liftM lines . readFile\\n\\nmain = do\\n ls <- getLines \\\"unixdict.txt\\\"\\n let ow = filter isSorted ls\\n let maxl = foldr max 0 (map length ow)\\n print $ filter (\\\\w -> (length w) == maxl) ow\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Algorithms as algo;\\nimport Mathematics as math;\\nimport Network as net;\\nimport Text as text;\\n\\nmain( argv_ ) {\\n url = size( argv_ ) > 1\\n ? argv_[1]\\n : \\\"http://wiki.puzzlers.org/pub/wordlists/unixdict.txt\\\";\\n words = algo.materialize( algo.map( net.get( url ).stream, string.strip ), list );\\n ordered = algo.materialize(\\n algo.filter(\\n words,\\n @( word ){ word == ∑( algo.map( algo.sorted( word ), string ) ); }\\n ),\\n list\\n );\\n maxLen = algo.reduce( ordered, @( x, y ){ math.max( x, size( y ) ); }, 0 );\\n maxOrderedWords = algo.materialize(\\n algo.filter( ordered, @[maxLen]( word ){ size( word ) == maxLen; } ),\\n list\\n );\\n print( \\\"{}\\\\n\\\".format( text.join( algo.sorted( maxOrderedWords ), \\\" \\\" ) ) );\\n return ( 0 );\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"link strings\\n\\nprocedure main(A)\\n f := open(\\\\A[1]) | stop(\\\"Give dictionary file name on command line\\\")\\n every (maxLen := 0, maxLen <= *(w := !f), w == csort(w)) do {\\n if maxLen <:= *w then maxList := [] #discard any shorter sorted words\\n put(maxList, w)\\n }\\n every write(!\\\\maxList)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"file := File clone openForReading(\\\"./unixdict.txt\\\")\\nwords := file readLines\\nfile close\\n\\nmaxLen := 0\\norderedWords := list()\\nwords foreach(word,\\n if( (word size >= maxLen) and (word == (word asMutable sort)),\\n if( word size > maxLen,\\n maxLen = word size\\n orderedWords empty\\n )\\n orderedWords append(word)\\n )\\n)\\n\\norderedWords join(\\\" \\\") println\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"NB. from http://wiki.puzzlers.org/pub/wordlists/unixdict.txt\\n oWords=: (#~ ] = /:~L:0) cutLF fread 'unixdict.txt'\\n ;:inv (#~ (= >./)@:(#@>)) oWords\\nabbott accent accept access accost almost bellow billow biopsy chilly choosy choppy effort floppy glossy knotty\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.BufferedReader;\\nimport java.io.FileReader;\\nimport java.io.IOException;\\nimport java.util.Arrays;\\nimport java.util.Collections;\\nimport java.util.Comparator;\\nimport java.util.LinkedList;\\nimport java.util.List;\\n\\npublic class Ordered {\\n\\n\\tprivate static boolean isOrderedWord(String word){\\n\\t\\tchar[] sortedWord = word.toCharArray();\\n\\t\\tArrays.sort(sortedWord);\\n\\t\\treturn word.equals(new String(sortedWord));\\n\\t}\\n\\t\\n\\tpublic static void main(String[] args) throws IOException{\\n\\t\\tList<String> orderedWords = new LinkedList<String>();\\n\\t\\tBufferedReader in = new BufferedReader(new FileReader(args[0]));\\n\\t\\twhile(in.ready()){\\n\\t\\t\\tString word = in.readLine();\\n\\t\\t\\tif(isOrderedWord(word)) orderedWords.add(word);\\n\\t\\t}\\n\\t\\tin.close();\\n\\t\\t\\n\\t\\tCollections.<String>sort(orderedWords, new Comparator<String>() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic int compare(String o1, String o2) {\\n\\t\\t\\t\\treturn new Integer(o2.length()).compareTo(o1.length());\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tint maxLen = orderedWords.get(0).length();\\n\\t\\tfor(String word: orderedWords){\\n\\t\\t\\tif(word.length() == maxLen){\\n\\t\\t\\t\\tSystem.out.println(word);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import java.io.IOException;\\nimport java.nio.file.Files;\\nimport java.nio.file.Path;\\nimport java.util.List;\\n\\npublic final class OrderedWords {\\n\\n\\tpublic static void main(String[] aArgs) throws IOException {\\n\\t\\tList<String> ordered = Files.lines(Path.of(\\\"unixdict.txt\\\"))\\n\\t\\t\\t\\t .filter( word -> isOrdered(word) ).toList();\\n\\t \\t\\n\\t final int maxLength = ordered.stream().map( word -> word.length() ).max(Integer::compare).get();\\n\\t ordered.stream().filter( word -> word.length() == maxLength ).forEach(System.out::println);\\t\\n\\t}\\n\\t\\n\\tprivate static boolean isOrdered(String aWord) {\\n\\t\\treturn aWord.chars()\\n\\t\\t\\t\\t .mapToObj( i -> (char) i )\\n\\t\\t\\t\\t .sorted()\\n\\t\\t\\t\\t .map(String::valueOf)\\n\\t\\t\\t\\t .reduce(\\\"\\\", String::concat)\\n\\t\\t\\t\\t .equals(aWord);\\n\\t}\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var fs = require('fs'), print = require('sys').print;\\nfs.readFile('./unixdict.txt', 'ascii', function (err, data) {\\n var is_ordered = function(word){return word.split('').sort().join('') === word;},\\n ordered_words = data.split('\\\\n').filter(is_ordered).sort(function(a, b){return a.length - b.length}).reverse(),\\n longest = [], curr = len = ordered_words[0].length, lcv = 0;\\n while (curr === len){\\n longest.push(ordered_words[lcv]);\\n curr = ordered_words[++lcv].length;\\n };\\n print(longest.sort().join(', ') + '\\\\n');\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var http = require('http');\\n\\nhttp.get({\\n host: 'www.puzzlers.org',\\n path: '/pub/wordlists/unixdict.txt'\\n}, function(res) {\\n var data = '';\\n res.on('data', function(chunk) {\\n data += chunk;\\n });\\n res.on('end', function() {\\n var words = data.split('\\\\n');\\n var max = 0;\\n var ordered = [];\\n words.forEach(function(word) {\\n if (word.split('').sort().join('') != word) return;\\n if (word.length == max) {\\n ordered.push(word);\\n } else if (word.length > max) {\\n ordered = [word];\\n max = word.length;\\n }\\n });\\n console.log(ordered.join(', '));\\n });\\n});\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def is_sorted:\\n if length <= 1 then true\\n else .[0] <= .[1] and (.[1:] | is_sorted)\\n end;\\n\\ndef longest_ordered_words:\\n # avoid string manipulation:\\n def is_ordered: explode | is_sorted;\\n map(select(is_ordered))\\n | (map(length)|max) as $max\\n | map( select(length == $max) );\\n\\n\\nsplit(\\\"\\\\n\\\") | longest_ordered_words\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"issorted(\\\"abc\\\") # true\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"lst = readlines(\\\"data/unixdict.txt\\\")\\nfilter!(issorted, lst)\\nfilter!(x -> length(x) == maximum(length, lst), lst)\\nprintln.(lst)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \" w@&d=|/d:#:'w:d@&&/'{~x<y}':'d:0:\\\"unixdict.txt\\\"\\n(\\\"abbott\\\"\\n \\\"accent\\\"\\n \\\"accept\\\"\\n \\\"access\\\"\\n \\\"accost\\\"\\n \\\"almost\\\"\\n \\\"bellow\\\"\\n \\\"billow\\\"\\n \\\"biopsy\\\"\\n \\\"chilly\\\"\\n \\\"choosy\\\"\\n \\\"choppy\\\"\\n \\\"effort\\\"\\n \\\"floppy\\\"\\n \\\"glossy\\\"\\n \\\"knotty\\\")\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"import java.net.URI\\n\\nfun main() {\\n val url = URI(\\n \\\"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\"\\n ).toURL()\\n val words = url.openStream().bufferedReader().use {\\n var max = 0\\n it.lineSequence()\\n .filter { it.asSequence().windowed(2).all { it[0] <= it[1] } }\\n .sortedByDescending(String::length)\\n .takeWhile { word -> word.length >= max.also { max = word.length } }\\n .toList()\\n }\\n words.forEach(::println)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{def maxOrderedWords\\n\\n {def isOrdered\\n {lambda {:w}\\n {W.equal? :w {W.sort before :w}}}}\\n\\n {def getOrdered\\n {lambda {:w}\\n {if {isOrdered :w} then :w else}}}\\n\\n {def pushOrdered\\n {lambda {:m :w}\\n {if {= {W.length :w} :m} then {br}:w else}}}\\n\\n {def maxOrderedWords.i\\n {lambda {:sortedWords}\\n {let { {:orderedWords {S.map getOrdered :sortedWords}} }\\n {S.map {{lambda {:m :w} {pushOrdered :m :w}}\\n {max {S.map {lambda {:w} {W.length :w}}\\n :orderedWords}}}\\n :orderedWords}}}}\\n\\n {lambda {:s}\\n {maxOrderedWords.i {S.replace else by el_se in :s}}}}\\n-> maxOrderedWords\\n\\n{maxOrderedWords UNIX.DICT}\\n->\\nabbott\\naccent\\naccept\\naccess\\naccost\\nalmost\\nbellow\\nbillow\\nbiopsy\\nchilly\\nchoosy\\nchoppy\\neffort\\nfloppy\\nglossy\\nknotty\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \": >string-index\\n \\\"\\\" split\\n \\\"&'0123456789abcdefghijklmnopqrstuvwxyz\\\" \\\"\\\" split\\n swap index collapse ;\\n: chars \\\"\\\" split length swap drop ;\\n: cr \\\"\\\\n\\\" . ;\\n: nip swap drop ;\\n: ordered?\\n dup grade subscript != '+ reduce if 0 else -1 then ;\\n\\n: filtering\\n [] '_ set\\n 0 do read\\n 2dup chars\\n <=\\n if dup >string-index ordered?\\n if 2dup chars\\n <\\n if nip dup chars swap\\n [] '_ set\\n then\\n _ swap append '_ set\\n '. . # progress dot\\n else drop\\n then\\n else drop\\n then\\n eof if break then loop\\n\\n cr _ . cr\\n ;\\n\\n: ordered-words\\n '< 'unixdict.txt open 'fh set\\n fh fin filtering fh close ;\\n\\nordered-words\\n\",\n \"language\": \"Lang5\"\n },\n {\n \"code\": \"local(f = file('unixdict.txt'), words = array, ordered = array, maxleng = 0)\\n#f->dowithclose => {\\n\\t#f->foreachLine => {\\n\\t\\t#words->insert(#1)\\n\\t}\\n}\\nwith w in #words\\ndo => {\\n\\tlocal(tosort = #w->asString->values)\\n\\t#tosort->sort\\n\\tif(#w->asString == #tosort->join('')) => {\\n\\t\\t#ordered->insert(#w->asString)\\n\\t\\t#w->asString->size > #maxleng ? #maxleng = #w->asString->size\\n\\t}\\n}\\nwith w in #ordered\\nwhere #w->size == #maxleng\\ndo => {^ #w + '\\\\r' ^}\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"'Ordered wordsFrom Rosetta Code\\nopen \\\"unixdict.txt\\\" for input as #1\\n'this is not normal DOS/Windows file.\\n'It LF delimited, not CR LF\\n'So Line input would not work.\\n\\nlf$=chr$(10)\\ncurLen=0\\nwordList$=\\\"\\\"\\nwhile not(eof(#1))\\n a$=inputto$(#1, lf$)\\n 'now, check word\\n flag = 1\\n c$ = left$(a$,1)\\n for i = 2 to len(a$)\\n d$ = mid$(a$,i,1)\\n if c$>d$ then flag=0: exit for\\n c$=d$\\n next\\n 'ckecked, proceed if ordered word\\n if flag then\\n if curLen=len(a$) then\\n wordList$=wordList$+\\\" \\\"+a$\\n else\\n if curLen<len(a$) then\\n curLen=len(a$)\\n wordList$=a$\\n end if\\n end if\\n end if\\nwend\\nclose #1\\nprint wordList$\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"-- Contents of unixdict.txt passed as string\\non printLongestOrderedWords (words)\\n res = []\\n maxlen = 0\\n _player.itemDelimiter = numtochar(10)\\n cnt = words.item.count\\n repeat with i = 1 to cnt\\n w = words.item[i]\\n len = w.length\\n ordered = TRUE\\n repeat with j = 2 to len\\n if chartonum(w.char[j-1])>chartonum(w.char[j]) then\\n ordered = FALSE\\n exit repeat\\n end if\\n end repeat\\n if ordered then\\n if len > maxlen then\\n res = [w]\\n maxlen = len\\n else if len = maxlen then\\n res.add(w)\\n end if\\n end if\\n end repeat\\n put res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"fp = io.open( \\\"dictionary.txt\\\" )\\n\\nmaxlen = 0\\nlist = {}\\n\\nfor w in fp:lines() do\\n ordered = true\\n for l = 2, string.len(w) do\\n\\tif string.byte( w, l-1 ) > string.byte( w, l ) then\\n\\t ordered = false\\n \\t break\\n\\tend\\n end\\n if ordered then\\n\\tif string.len(w) > maxlen then\\n\\t list = {}\\n\\t list[1] = w\\n\\t maxlen = string.len(w)\\n\\telseif string.len(w) == maxlen then\\n\\t list[#list+1] = w\\n\\tend\\n end\\nend\\n\\nfor _, w in pairs(list) do\\n print( w )\\nend\\n\\nfp:close()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"lst := StringTools:-Split(Import(\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\"), \\\"\\\\n\\\"):\\nlongest := 0:\\nwords := Array():\\ni := 1:\\nfor word in lst do\\n\\tif StringTools:-IsSorted(word) then\\n\\t\\tlen := StringTools:-Length(word):\\n\\t\\tif len > longest then\\n\\t\\t\\tlongest := len:\\n\\t\\t\\twords := Array():\\n\\t\\t\\twords(1) := word:\\n\\t\\t\\ti := 2:\\n\\t\\telif len = longest then\\n\\t\\t\\twords(i) := word:\\n\\t\\t\\ti++:\\n\\t\\tend if;\\n\\tend if;\\nend do;\\nfor word in words do print(word); end do;\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Module[{max,\\n data = Select[Import[\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\", \\\"List\\\"],\\n OrderedQ[Characters[#]] &]},\\n max = Max[StringLength /@ data];\\n Select[data, StringLength[#] == max &]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"maxWords[language_String] := Module[{max,data = Select[DictionaryLookup[{language, \\\"*\\\"}],OrderedQ[Characters[#]] &]},\\n max = Max[StringLength /@ data];\\n Select[data, StringLength[#] == max &]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"maxlen = 0;\\nlistlen= 0;\\nfid = fopen('unixdict.txt','r');\\nwhile ~feof(fid)\\n str = fgetl(fid);\\n if any(diff(abs(str))<0) continue; end;\\n\\n if length(str)>maxlen,\\n\\tlist = {str};\\n\\tmaxlen = length(str);\\n elseif length(str)==maxlen,\\n\\tlist{end+1} = str;\\n end;\\nend\\nfclose(fid);\\nprintf('%s\\\\n',list{:});\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import Nanoquery.IO\\n\\ndef is_ordered(word)\\n word = str(word)\\n if len(word) < 2\\n return true\\n end\\n\\n for i in range(1, len(word) - 1)\\n if str(word[i]) < str(word[i - 1])\\n return false\\n end\\n end\\n\\n return true\\nend\\n\\nlongest = 0\\nwords = {}\\nfor word in new(File, \\\"unixdict.txt\\\").read()\\n if is_ordered(word)\\n if len(word) > longest\\n longest = len(word)\\n words.clear()\\n words.append(word)\\n else if len(word) = longest\\n words.append(word)\\n end\\n end\\nend\\nprintln words\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref savelog symbols binary\\n\\nunixdict = 'unixdict.txt'\\ndo\\n wmax = Integer.MIN_VALUE\\n dwords = ArrayList()\\n inrdr = BufferedReader(FileReader(File(unixdict)))\\n loop label ln while inrdr.ready\\n dword = Rexx(inrdr.readLine).strip\\n if isOrdered(dword) then do\\n dwords.add(dword)\\n if dword.length > wmax then\\n wmax = dword.length\\n end\\n end ln\\n inrdr.close\\n\\n witerator = dwords.listIterator\\n loop label wd while witerator.hasNext\\n dword = Rexx witerator.next\\n if dword.length < wmax then do\\n witerator.remove\\n end\\n end wd\\n dwords.trimToSize\\n\\n say dwords.toString\\n\\ncatch ex = IOException\\n ex.printStackTrace\\nend\\n\\nreturn\\n\\nmethod isOrdered(dword = String) inheritable static binary returns boolean\\n wchars = dword.toCharArray\\n Arrays.sort(wchars)\\n return dword.equalsIgnoreCase(String(wchars))\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import strutils\\n\\nconst DictFile = \\\"unixdict.txt\\\"\\n\\nfunc isSorted(s: string): bool =\\n var last = char.low\\n for c in s:\\n if c < last: return false\\n last = c\\n result = true\\n\\nvar\\n mx = 0\\n words: seq[string]\\n\\nfor word in DictFile.lines:\\n if word.len >= mx and word.isSorted:\\n if word.len > mx:\\n words.setLen(0)\\n mx = word.len\\n words.add word\\necho words.join(\\\" \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let input_line_opt ic =\\n try Some(input_line ic)\\n with End_of_file -> None\\n\\n(* load each line in a list *)\\nlet read_lines ic =\\n let rec aux acc =\\n match input_line_opt ic with\\n | Some line -> aux (line :: acc)\\n | None -> (List.rev acc)\\n in\\n aux []\\n\\nlet char_list_of_string str =\\n let lst = ref [] in\\n String.iter (fun c -> lst := c :: !lst) str;\\n (List.rev !lst)\\n\\nlet is_ordered word =\\n let rec aux = function\\n | c1::c2::tl ->\\n if c1 <= c2\\n then aux (c2::tl)\\n else false\\n | c::[] -> true\\n | [] -> true (* should only occur with an empty string *)\\n in\\n aux (char_list_of_string word)\\n\\nlet longest_words words =\\n let res, _ =\\n List.fold_left\\n (fun (lst, n) word ->\\n let len = String.length word in\\n let comp = compare len n in\\n match lst, comp with\\n | lst, 0 -> ((word::lst), n) (* len = n *)\\n | lst, -1 -> (lst, n) (* len < n *)\\n | _, 1 -> ([word], len) (* len > n *)\\n | _ -> assert false\\n )\\n ([\\\"\\\"], 0) words\\n in\\n (List.rev res)\\n\\nlet () =\\n let ic = open_in \\\"unixdict.txt\\\" in\\n let words = read_lines ic in\\n let lower_words = List.map String.lowercase words in\\n let ordered_words = List.filter is_ordered lower_words in\\n let longest_ordered_words = longest_words ordered_words in\\n List.iter print_endline longest_ordered_words\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \": longWords\\n| w longest l s |\\n 0 ->longest\\n File new(\\\"unixdict.txt\\\") forEach: w [\\n w size dup ->s longest < ifTrue: [ continue ]\\n w sort w == ifFalse: [ continue ]\\n s longest > ifTrue: [ s ->longest ListBuffer new ->l ]\\n l add(w)\\n ] l ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"/*REXX list (the longest) ordered word(s) from a supplied dictionary. */\\niFID= 'UNIXDICT.TXT'\\nw.=''\\nmL=0\\nDo j=1 While lines(iFID)\\\\==0\\n x=linein(iFID)\\n w=length(x)\\n If w>=mL Then Do\\n Parse Upper Var x xU 1 z 2\\n Do k=2 To w\\n _=substr(xU, k, 1)\\n If \\\\datatype(_, 'U') Then Iterate\\n If _<z Then Iterate j\\n z=_\\n End\\n mL=w\\n w.w=w.w x\\n End\\n End\\nnn=words(w.mL)\\nSay nn 'word's(nn) \\\"found (of length\\\" mL')'\\nSay ''\\nDo n=1 To nn\\n Say word(w.mL, n)\\n End\\nExit\\ns: Return left('s',arg(1)>1)\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"ordered(s)=my(v=Vecsmall(s),t=97);for(i=1,#v,if(v[i]>64&&v[i]<91,v[i]+=32);if(v[i]<97||v[i]>122||v[i]<t,return(0),t=v[i]));1\\nv=select(ordered,readstr(\\\"~/unixdict.txt\\\"));\\nN=vecmax(apply(length,v));\\nselect(s->#s==N, v)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse strict;\\nuse warnings;\\n\\nopen(FH, \\\"<\\\", \\\"unixdict.txt\\\") or die \\\"Can't open file!\\\\n\\\";\\nmy @words;\\nwhile (<FH>) {\\n chomp;\\n push @{$words[length]}, $_ if $_ eq join(\\\"\\\", sort split(//));\\n}\\nclose FH;\\nprint \\\"@{$words[-1]}\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">words</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">unix_dict</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">maxlen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">word</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">maxlen</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">word</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">maxlen</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">maxlen</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">word</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The %d longest ordered words:\\\\n %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">words</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n \\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n0 var maxlen\\n( ) var words\\n0 var f\\n\\ndef getword f fgets dup -1 == if drop false else -1 del endif enddef\\ndef ordered? dup dup sort == enddef\\ndef greater? len maxlen > enddef\\n\\n\\\"unixdict.txt\\\" \\\"r\\\" fopen var f\\nf -1 !=\\nwhile\\n getword dup if\\n ordered? if\\n greater? if\\n len var maxlen\\n ( ) var words\\n endif\\n len maxlen == if\\n words over 0 put var words\\n endif\\n endif\\n endif\\nendwhile\\nf fclose\\nwords print\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\n0 var f\\n\\ndef getword f fgets dup -1 == if drop false else -1 del endif enddef\\ndef ordered? dup dup sort == enddef\\ndef greater? len rot 1 get len nip rot swap over over > enddef\\ndef append over 0 put enddef\\n\\n( \\\" \\\" )\\n\\n\\\"unixdict.txt\\\" \\\"r\\\" fopen var f\\nf -1 !=\\nwhile\\n getword dup if\\n ordered? if\\n greater? if\\n drop drop flush append\\n else\\n == if append endif\\n endif\\n swap\\n endif\\n endif\\nendwhile\\nf fclose\\nprint\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"go =>\\n Dict = \\\"unixdict.txt\\\",\\n Words = new_map([Word=Word.length : Word in read_file_lines(Dict), Word == Word.sort()]),\\n MaxLen = max([Len : _Word=Len in Words]),\\n println([Word : Word=Len in Words, Len=MaxLen].sort).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(in \\\"unixdict.txt\\\"\\n (mapc prinl\\n (maxi '((L) (length (car L)))\\n (by length group\\n (filter '((S) (apply <= S))\\n (make (while (line) (link @))) ) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"order: procedure options (main); /* 24/11/2011 */\\n declare word character (20) varying;\\n declare word_list character (20) varying controlled;\\n declare max_length fixed binary;\\n declare input file;\\n\\n open file (input) title ('/ORDER.DAT,TYPE(TEXT),RECSIZE(100)');\\n\\n on endfile (input) go to completed_search;\\n\\n max_length = 0;\\n do forever;\\n get file (input) edit (word) (L);\\n if length(word) > max_length then\\n do;\\n if in_order(word) then\\n do;\\n /* Get rid of any stockpiled shorter words. */\\n do while (allocation(word_list) > 0);\\n free word_list;\\n end;\\n /* Add the eligible word to the stockpile. */\\n allocate word_list;\\n word_list = word;\\n max_length = length(word);\\n end;\\n end;\\n else if max_length = length(word) then\\n do; /* we have an eligle word of the same (i.e., maximum) length. */\\n if in_order(word) then\\n do; /* Add it to the stockpile. */\\n allocate word_list;\\n word_list = word;\\n end;\\n end;\\n end;\\ncompleted_search:\\n put skip list ('There are ' || trim(allocation(word_list)) ||\\n ' eligible words of length ' || trim(length(word)) || ':');\\n do while (allocation(word_list) > 0);\\n put skip list (word_list);\\n free word_list;\\n end;\\n\\n/* Check that the letters of the word are in non-decreasing order of rank. */\\nin_order: procedure (word) returns (bit(1));\\n declare word character (*) varying;\\n declare i fixed binary;\\n\\n do i = 1 to length(word)-1;\\n if substr(word, i, 1) > substr(word, i+1, 1) then return ('0'b);\\n end;\\n return ('1'b);\\nend in_order;\\nend order;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"$url = 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\\n\\n(New-Object System.Net.WebClient).DownloadFile($url, \\\"$env:TEMP\\\\unixdict.txt\\\")\\n\\n$ordered = Get-Content -Path \\\"$env:TEMP\\\\unixdict.txt\\\" |\\n ForEach-Object {if (($_.ToCharArray() | Sort-Object) -join '' -eq $_) {$_}} |\\n Group-Object -Property Length |\\n Sort-Object -Property Name |\\n Select-Object -Property @{Name=\\\"WordCount\\\" ; Expression={$_.Count}},\\n @{Name=\\\"WordLength\\\"; Expression={[int]$_.Name}},\\n @{Name=\\\"Words\\\" ; Expression={$_.Group}} -Last 1\\n\\n\\\"There are {0} ordered words of the longest word length ({1} characters):`n`n{2}\\\" -f $ordered.WordCount,\\n $ordered.WordLength,\\n ($ordered.Words -join \\\", \\\")\\nRemove-Item -Path \\\"$env:TEMP\\\\unixdict.txt\\\" -Force -ErrorAction SilentlyContinue\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \":- use_module(library( http/http_open )).\\n\\nordered_words :-\\n % we read the URL of the words\\n\\thttp_open('http://www.puzzlers.org/pub/wordlists/unixdict.txt',\\tIn, []),\\n\\tread_file(In, [], Out),\\n\\tclose(In),\\n\\n % we get a list of pairs key-value where key = Length and value = <list-of-its-codes>\\n % this list must be sorted\\n\\tmsort(Out, MOut),\\n\\n\\tgroup_pairs_by_key(MOut, POut),\\n\\n % we sorted this list in decreasing order of the length of values\\n\\tpredsort(my_compare, POut, [_N-V | _OutSort]),\\n\\tmaplist(mwritef, V).\\n\\n\\nmwritef(V) :-\\n\\twritef('%s\\\\n', [V]).\\n\\nread_file(In, L, L1) :-\\n\\tread_line_to_codes(In, W),\\n\\t( W == end_of_file ->\\n % the file is read\\n\\t L1 = L\\n\\t ;\\n % we sort the list of codes of the line\\n\\t % and keep only the \\\"goods word\\\"\\n\\t ( msort(W, W) ->\\n\\t length(W, N), L2 = [N-W | L], (len = 6 -> writef('%s\\\\n', [W]); true)\\n\\t ;\\n\\t L2 = L\\n\\t ),\\n\\n % and we have the pair Key-Value in the result list\\n\\t read_file(In, L2, L1)).\\n\\n% predicate for sorting list of pairs Key-Values\\n% if the lentgh of values is the same\\n% we sort the keys in alhabetic order\\nmy_compare(R, K1-_V1, K2-_V2) :-\\n\\t( K1 < K2 -> R = >; K1 > K2 -> R = <; =).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure.s sortLetters(*word.Character, wordLength) ;returns a string with the letters of a word sorted\\n Protected Dim letters.c(wordLength)\\n Protected *letAdr = @letters()\\n\\n CopyMemoryString(*word, @*letAdr)\\n SortArray(letters(), #PB_Sort_Ascending, 0, wordLength - 1)\\n ProcedureReturn PeekS(@letters(), wordLength)\\nEndProcedure\\n\\nStructure orderedWord\\n word.s\\n length.i\\nEndStructure\\n\\nDefine filename.s = \\\"unixdict.txt\\\", fileNum = 0, word.s\\n\\nIf OpenConsole()\\n NewList orderedWords.orderedWord()\\n If ReadFile(fileNum, filename)\\n While Not Eof(fileNum)\\n word = ReadString(fileNum)\\n If word = sortLetters(@word, Len(word))\\n AddElement(orderedWords())\\n orderedWords()\\\\word = word\\n orderedWords()\\\\length = Len(word)\\n EndIf\\n Wend\\n Else\\n MessageRequester(\\\"Error\\\", \\\"Unable to find dictionary '\\\" + filename + \\\"'\\\")\\n End\\n EndIf\\n\\n SortStructuredList(orderedWords(), #PB_Sort_Ascending, OffsetOf(orderedWord\\\\word), #PB_String)\\n SortStructuredList(orderedWords(), #PB_Sort_Descending, OffsetOf(orderedWord\\\\length), #PB_Integer)\\n Define maxLength\\n FirstElement(orderedWords())\\n maxLength = orderedWords()\\\\length\\n ForEach orderedWords()\\n If orderedWords()\\\\length = maxLength\\n Print(orderedWords()\\\\word + \\\" \\\")\\n EndIf\\n Next\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import urllib.request\\n\\nurl = 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\\nwords = urllib.request.urlopen(url).read().decode(\\\"utf-8\\\").split()\\nordered = [word for word in words if word==''.join(sorted(word))]\\nmaxlen = len(max(ordered, key=len))\\nmaxorderedwords = [word for word in ordered if len(word) == maxlen]\\nprint(' '.join(maxorderedwords))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import urllib.request\\n\\nmx, url = 0, 'http://www.puzzlers.org/pub/wordlists/unixdict.txt'\\n\\nfor word in urllib.request.urlopen(url).read().decode(\\\"utf-8\\\").split():\\n lenword = len(word)\\n if lenword >= mx and word==''.join(sorted(word)):\\n if lenword > mx:\\n words, mx = [], lenword\\n words.append(word)\\nprint(' '.join(words))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''The longest ordered words in a list'''\\n\\nfrom functools import reduce\\nfrom operator import le\\nimport urllib.request\\n\\n\\n# longestOrds :: [String] -> [String]\\ndef longestOrds(ws):\\n '''The longest ordered words in a given list.\\n '''\\n return reduce(triage, ws, (0, []))[1]\\n\\n\\n# triage :: (Int, [String]) -> String -> (Int, [String])\\ndef triage(nxs, w):\\n '''The maximum length seen for an ordered word,\\n and the ordered words of this length seen so far.\\n '''\\n n, xs = nxs\\n lng = len(w)\\n return (\\n (lng, ([w] if n != lng else xs + [w])) if (\\n ordered(w)\\n ) else nxs\\n ) if lng >= n else nxs\\n\\n\\n# ordered :: String -> Bool\\ndef ordered(w):\\n '''True if the word w is ordered.'''\\n return all(map(le, w, w[1:]))\\n\\n\\n# ------------------------- TEST -------------------------\\nif __name__ == '__main__':\\n print(\\n '\\\\n'.join(longestOrds(\\n urllib.request.urlopen(\\n 'http://wiki.puzzlers.org/pub/wordlists/unixdict.txt'\\n ).read().decode(\\\"utf-8\\\").split()\\n ))\\n )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ - -1 1 clamp 1+ ]'[ swap peek do ] is <=> ( n n --> )\\n\\n [ true swap\\n behead swap witheach\\n [ tuck > if\\n [ dip not conclude ] ]\\n drop ] is ordered ( [ --> b )\\n\\n [ stack ] is largest ( [ --> s )\\n\\n [ 1 largest put\\n [] swap witheach\\n [ dup size\\n largest share <=>\\n [ drop\\n [ dup ordered iff\\n [ nested join ]\\n else drop ]\\n [ dup ordered iff\\n [ dup size largest replace\\n nip nested ]\\n else drop ] ] ]\\n largest release ] is task ( [ --> [ )\\n\\n $ 'unixdict.txt' sharefile drop nest$\\n task\\n witheach [ echo$ sp ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"words = scan(\\\"https://web.archive.org/web/20180611003215/http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\",what = \\\"character\\\")\\n\\nordered = logical()\\nfor(i in 1:length(words)){\\n first = strsplit(words[i],\\\"\\\")[[1]][1:nchar(words[i])-1]\\n second = strsplit(words[i],\\\"\\\")[[1]][2:nchar(words[i])]\\n ordered[i] = all(first<=second)\\n}\\n\\ncat(words[ordered][which(nchar(words[ordered])==max(nchar(words[ordered])))],sep=\\\"\\\\n\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require net/url)\\n\\n(define dict \\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\")\\n\\n(define (ordered? str)\\n (define lower (string-downcase str))\\n (for/and ([i (in-range 1 (string-length str))])\\n (char<=? (string-ref lower (sub1 i)) (string-ref lower i))))\\n\\n(define words (port->lines (get-pure-port (string->url dict))))\\n\\n(let loop ([len 0] [longs '()] [words words])\\n (if (null? words)\\n (for-each displayln (reverse longs))\\n (let* ([word (car words)] [words (cdr words)]\\n [wlen (string-length word)])\\n (if (or (< wlen len) (not (ordered? word)))\\n (loop len longs words)\\n (loop wlen (cons word (if (> wlen len) '() longs)) words)))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"say lines.grep({ [le] .comb }).classify(*.chars).max(*.key).value\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red []\\n;; code to read url and save to local file:\\n;;data: read/binary http://www.puzzlers.org/pub/wordlists/unixdict.txt\\n;;write %unixdict.txt data\\n\\nmax: [ \\\"\\\" ] ;; init array with one empty string (length 0 )\\n\\nforeach word read/lines %unixdict.txt [ ;; read local file\\n len: either word = sort copy word [ length? word ] [ -1 ] ;; check if ordered and get length\\n case [\\n len > length? first max [ max: reduce [ word ]] ;; init new block\\n len = length? first max [ append max word ]\\n ]\\n]\\nprobe max\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/*REXX program lists (the longest) ordered word(s) from a supplied dictionary. */\\niFID= 'UNIXDICT.TXT' /*the filename of the word dictionary. */\\nm= 1 /*maximum length of an ordered word(s).*/\\ncall linein iFID, 1, 0 /*point to the first word in dictionary*/\\n@.= /*placeholder array for list of words. */\\n do j=1 while lines(iFID)\\\\==0; x=linein(iFID) /*keep reading until file is exhausted.*/\\n w= length(x); if w<m then iterate /*Word not long enough? Then ignore it.*/\\n if \\\\datatype(x, 'M') then iterate /*Is it not a letter? Then ignore it. */\\n parse upper var x xU 1 z 2 /*get uppercase version of X & 1st char*/\\n do k=2 for w-1; _= substr(xU, k, 1) /*process each letter in uppercase word*/\\n if _<z then iterate j /*is letter < than the previous letter?*/\\n z= _ /*we have a newer current letter. */\\n end /*k*/ /* [↑] logic includes ≥ order. */\\n m= w /*maybe define a new maximum length. */\\n @.w= @.w x /*add the original word to a word list.*/\\n end /*j*/ /*the 1st DO needs an index for ITERATE*/\\n #= words(@.m) /*just a handy─dandy variable to have. */\\nsay # 'word's(#) \\\"found (of length\\\" m')'; say /*show the number of words and length. */\\n do n=1 for #; say word(@.m, n); end /*display all the words, one to a line.*/\\nexit /*stick a fork in it, we're all done. */\\nghijk\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ns: if arg(1)==1 then return ''; return \\\"s\\\" /*a simple pluralizer (merely adds \\\"S\\\")*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\n\\n\\ncStr = read(\\\"unixdict.txt\\\")\\nwordList = str2list(cStr)\\nsum = 0\\nsortList = []\\n\\nsee \\\"working...\\\" + nl + nl\\n\\nfor n = 1 to len(wordList)\\n num = 0\\n len = len(wordList[n])-1\\n for m = 1 to len\\n asc1 = ascii(wordList[n][m])\\n asc2 = ascii(wordList[n][m+1])\\n if asc1 <= asc2\\n num = num + 1\\n ok\\n next\\n if num = len\\n sum = sum + 1\\n add(sortList,[wordList[n],len])\\n ok\\nnext\\n\\nsortList = sort(sortList,2)\\nsortList = reverse(sortList)\\nendList = []\\n\\nlen = sortList[1][2]\\n\\nfor n = 1 to len(sortList)\\n if sortList[n][2] = len\\n add(endList,sortList[n][1])\\n else\\n exit\\n ok\\nnext\\n\\nendList = sort(endList)\\nsee endList\\n\\nsee nl + \\\"done...\\\" + nl\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'open-uri'\\nordered_words = open('http://www.puzzlers.org/pub/wordlists/unixdict.txt', 'r').select do |word|\\n word.strip!\\n word.chars.sort.join == word\\nend\\n\\ngrouped = ordered_words.group_by &:size\\nputs grouped[grouped.keys.max]\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"words = IO.foreach('unixdict.txt').map(&:chomp).select {|word| word.chars.sort.join == word}\\nputs words.group_by(&:size).sort_by(&:first).last.last\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a$\\t= httpget$(\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\")\\nj\\t= 1\\ni \\t= instr(a$,chr$(10),j)\\nwhile i <> 0\\n a1$ \\t= mid$(a$,j,i-j)\\n for k\\t= 1 to len(a1$) - 1\\n if mid$(a1$,k,1) > mid$(a1$,k+1,1) then goto [noWay]\\n next k\\n maxL\\t= max(maxL,len(a1$))\\nif len(a1$) >= maxL then a2$ = a2$ + a1$ + \\\"||\\\"\\n[noWay]\\nj\\t= i + 1\\ni \\t= instr(a$,chr$(10),j)\\nwend\\nn\\t= 1\\nwhile word$(a2$,n,\\\"||\\\") <> \\\"\\\"\\n a3$ = word$(a2$,n,\\\"||\\\")\\n if len(a3$) = maxL then print a3$\\n n = n + 1\\nwend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"const FILE: &'static str = include_str!(\\\"./unixdict.txt\\\");\\n\\nfn is_ordered(s: &str) -> bool {\\n let mut prev = '\\\\x00';\\n for c in s.to_lowercase().chars() {\\n if c < prev {\\n return false;\\n }\\n prev = c;\\n }\\n\\n return true;\\n}\\n\\nfn find_longest_ordered_words(dict: Vec<&str>) -> Vec<&str> {\\n let mut result = Vec::new();\\n let mut longest_length = 0;\\n\\n for s in dict.into_iter() {\\n if is_ordered(&s) {\\n let n = s.len();\\n if n > longest_length {\\n longest_length = n;\\n result.truncate(0);\\n }\\n if n == longest_length {\\n result.push(s);\\n }\\n }\\n }\\n\\n return result;\\n}\\n\\nfn main() {\\n let lines = FILE.lines().collect();\\n\\n let longest_ordered = find_longest_ordered_words(lines);\\n\\n for s in longest_ordered.iter() {\\n println!(\\\"{}\\\", s.to_string());\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"val wordsAll = scala.io.Source.fromURL(\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\").getLines.toSeq\\n\\n/**\\n * Given a sequence of words return a sub-sequence of the\\n * words that have characters in sorted order.\\n */\\ndef orderedWords( words:Seq[String] ) : Seq[(String)] = {\\n\\n def isOrdered( s:String ) : Boolean =\\n (s.foldLeft( (true,'@') ){\\n case ((false,_),_) => return false\\n case ((true,prev),c) => ((prev <= c),c)\\n })._1\\n\\n wordsAll.filter( isOrdered(_) ).toSeq\\n}\\n\\nval ww = orderedWords( wordsAll ).sortBy( -_.length )\\n\\nprintln( ww.takeWhile( _.length == ww.head.length ).mkString(\\\"\\\\n\\\") )\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define sorted-words\\n (let ((port (open-input-file \\\"unixdict.txt\\\")))\\n (let loop ((char (read-char port)) (word '()) (result '(())))\\n (cond\\n ((eof-object? char)\\n\\t(reverse (map (lambda (word) (apply string word)) result)))\\n ((eq? #\\\\newline char)\\n\\t(loop (read-char port) '()\\n\\t (let ((best-length (length (car result))) (word-length (length word)))\\n\\t\\t(cond\\n\\t\\t ((or (< word-length best-length) (not (apply char>=? word))) result)\\n\\t\\t ((> word-length best-length) (list (reverse word)))\\n\\t\\t (else (cons (reverse word) result))))))\\n (else (loop (read-char port) (cons char word) result))))))\\n\\n(map (lambda (x)\\n (begin\\n\\t (display x)\\n\\t (newline)))\\n sorted-words)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func boolean: isOrdered (in string: word) is func\\n result\\n var boolean: ordered is TRUE;\\n local\\n var integer: index is 0;\\n begin\\n for index range 1 to pred(length(word)) do\\n if word[index] > word[succ(index)] then\\n ordered := FALSE;\\n end if;\\n end for;\\n end func;\\n\\nconst proc: write (in array string: wordList) is func\\n local\\n var string: word is \\\"\\\";\\n begin\\n for word range wordList do\\n writeln(word);\\n end for;\\n end func;\\n\\nconst proc: main is func\\n local\\n var file: dictionary is STD_NULL;\\n var string: word is \\\"\\\";\\n var integer: length is 0;\\n var array string: wordList is 0 times \\\"\\\";\\n begin\\n dictionary := open(\\\"unixdict.txt\\\", \\\"r\\\");\\n if dictionary <> STD_NULL then\\n readln(dictionary, word);\\n while not eof(dictionary) do\\n if isOrdered(lower(word)) then\\n if length(word) > length then\\n length := length(word);\\n wordList := [] (word);\\n elsif length(word) = length then\\n wordList &:= word;\\n end if;\\n end if;\\n readln(dictionary, word);\\n end while;\\n close(dictionary);\\n end if;\\n write(wordList);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"var words = [[]]\\nvar file = %f'unixdict.txt'\\n\\nfile.open_r(\\\\var fh, \\\\var err) ->\\n || die \\\"Can't open file #{file}: $#{err}\\\"\\n\\nfh.each { |line|\\n line.trim!\\n if (line == line.sort) {\\n words[line.length] := [] << line\\n }\\n}\\n\\nsay words[-1].join(' ')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n\\n BOOLEAN PROCEDURE ISORDERED(W); TEXT W;\\n BEGIN\\n BOOLEAN B;\\n B := TRUE;\\n W.SETPOS(1);\\n IF W.MORE THEN\\n BEGIN\\n CHARACTER CURR, LAST;\\n CURR := W.GETCHAR;\\n WHILE W.MORE AND B DO\\n BEGIN\\n LAST := CURR;\\n CURR := W.GETCHAR;\\n B := LAST <= CURR;\\n END;\\n END;\\n ISORDERED := B;\\n END;\\n\\n REF (INFILE) INF;\\n INTEGER LONGEST;\\n TEXT W;\\n\\n COMMENT FIND LONGEST LENGTH;\\n INF :- NEW INFILE(\\\"unixdict.txt\\\");\\n INF.OPEN(BLANKS(132));\\n WHILE NOT INF.LASTITEM DO\\n BEGIN\\n W :- COPY(INF.IMAGE).STRIP;\\n IF ISORDERED(W) THEN\\n IF W.LENGTH > LONGEST THEN\\n LONGEST := W.LENGTH;\\n INF.INIMAGE;\\n END;\\n INF.CLOSE;\\n\\n COMMENT OUTPUT ORDRERED WORDS OF LONGEST LENGTH;\\n INF :- NEW INFILE(\\\"unixdict.txt\\\");\\n INF.OPEN(BLANKS(132));\\n WHILE NOT INF.LASTITEM DO\\n BEGIN\\n W :- COPY(INF.IMAGE).STRIP;\\n IF W.LENGTH = LONGEST AND THEN ISORDERED(W) THEN\\n BEGIN\\n OUTTEXT(W);\\n OUTIMAGE;\\n END;\\n INF.INIMAGE;\\n END;\\n INF.CLOSE;\\n\\nEND.\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \"|file dict r t|\\nfile := FileStream open: 'unixdict.txt' mode: FileStream read.\\ndict := Set new.\\n\\n\\\"load the whole dict into the set before, 'filter' later\\\"\\n[ file atEnd ] whileFalse: [\\n dict add: (file upTo: Character nl) ].\\n\\n\\\"find those with the sorted letters, and sort them by length\\\"\\nr := ((dict\\n select: [ :w | (w asOrderedCollection sort) = (w asOrderedCollection) ] )\\n asSortedCollection: [:a :b| (a size) > (b size) ] ).\\n\\n\\\"get those that have length = to the max length, and sort alphabetically\\\"\\nr := (r select: [:w| (w size) = ((r at: 1) size)]) asSortedCollection.\\n\\nr do: [:e| e displayNl].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"words = #.split(#.readtext(\\\"unixdict.txt\\\",\\\"ascii\\\"),#.lf)\\nmax = 0\\n> i, 1..#.size(words,1)\\n word = words[i]\\n wordb = #.array(word)\\n wordbc = #.size(wordb,1)\\n > j, 3..wordbc,2\\n << wordb[j]<wordb[j-2]\\n <\\n >> j!>wordbc|wordbc<max\\n ? wordbc>max, result = \\\"\\\"\\n ? wordbc>max, max = wordbc\\n result += word+#.crlf\\n<\\n#.output(result)\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"fun isOrdered s =\\n let\\n fun loop (i, c) =\\n let\\n val c' = String.sub (s, i)\\n in\\n c <= c' andalso loop (i + 1, c')\\n end\\n handle Subscript => true\\n in\\n loop (0, #\\\"\\\\^@\\\")\\n end\\n\\nfun longestOrdereds (s, prev as (len, lst)) =\\n let\\n val len' = size s\\n in\\n if len' >= len andalso isOrdered s then\\n if len' = len then (len, s :: lst) else (len', [s])\\n else\\n prev\\n end\\n\\nval () = print ((String.concatWith \\\" \\\"\\n o #2\\n o foldr longestOrdereds (0, [])\\n o String.tokens Char.isSpace\\n o TextIO.inputAll) TextIO.stdIn ^ \\\"\\\\n\\\")\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"import Foundation\\n\\nguard\\n let url = NSURL(string: \\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\"),\\n let input = try? NSString(contentsOfURL: url,encoding: NSUTF8StringEncoding) as String\\n else { exit(EXIT_FAILURE) }\\n\\nlet words = input.componentsSeparatedByCharactersInSet(NSCharacterSet.newlineCharacterSet())\\nlet group: ([Int: [String]], String) -> [Int: [String]] = {\\n var d = $0; let g = d[$1.characters.count] ?? []\\n d[$1.characters.count] = g + [$1]\\n return d\\n}\\nlet ordered: ([String], String) -> [String] = {\\n guard String($1.characters.sort()) == $1 else { return $0 }\\n return $0 + [$1]\\n}\\n\\nlet groups = words\\n .reduce([String](), combine: ordered)\\n .reduce([Int: [String]](), combine: group)\\n\\nguard\\n let maxLength = groups.keys.maxElement(),\\n let maxLengthGroup = groups[maxLength]\\n else { exit(EXIT_FAILURE) }\\n\\nmaxLengthGroup.forEach { print($0) }\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require http\\n\\n# Pick the ordered words (of maximal length) from a list\\nproc chooseOrderedWords list {\\n set len 0\\n foreach word $list {\\n\\t# Condition to determine whether a word is ordered; are its characters\\n\\t# in sorted order?\\n\\tif {$word eq [join [lsort [split $word \\\"\\\"]] \\\"\\\"]} {\\n\\t if {[string length $word] > $len} {\\n\\t\\tset len [string length $word]\\n\\t\\tset orderedOfMaxLen {}\\n\\t }\\n\\t if {[string length $word] == $len} {\\n\\t\\tlappend orderedOfMaxLen $word\\n\\t }\\n\\t}\\n }\\n return $orderedOfMaxLen\\n}\\n\\n# Get the dictionary and print the ordered words from it\\nset t [http::geturl \\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\"]\\nputs [chooseOrderedWords [http::data $t]]\\nhttp::cleanup $t\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#lang transd\\n\\nMainModule: {\\n_start: (lambda\\n (with fs FileStream() len 0 maxlen 0 words Vector<String>()\\n (open-r fs \\\"/mnt/vault/tmp/unixdict.txt\\\") )\\n\\n (for w in (read-lines fs) do\\n (= len (size w))\\n (if (< len maxlen) continue)\\n (if (is-sorted w)\\n (if (< maxlen len)\\n (clear words) (= maxlen len))\\n (append words w)\\n ))\\n (lout words)\\n))\\n\\n}\\n\",\n \"language\": \"Transd\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\nSET data = REQUEST (\\\"http://www.puzzlers.org/pub/wordlists/unixdict.txt\\\")\\nDICT orderdwords CREATE 99999\\nCOMPILE\\nLOOP word=data\\n - \\\"<%\\\" = any token\\n SET letters=STRINGS (word,\\\":<%:\\\")\\n SET wordsignatur= ALPHA_SORT (letters)\\n IF (wordsignatur==letters) THEN\\n SET wordlength=LENGTH (word)\\n DICT orderdwords ADD/COUNT word,num,cnt,wordlength\\n ENDIF\\nENDLOOP\\n\\nDICT orderdwords UNLOAD words,num,cnt,wordlength\\nSET maxlength=MAX_LENGTH (words)\\nSET rtable=QUOTES (maxlength)\\nBUILD R_TABLE maxlength = rtable\\nSET index=FILTER_INDEX (wordlength,maxlength,-)\\nSET longestwords=SELECT (words,#index)\\nPRINT num,\\\" ordered words - max length is \\\",maxlength,\\\":\\\"\\n\\nLOOP n,w=longestwords\\nSET n=CONCAT (n,\\\".\\\"), n=CENTER(n,4)\\nPRINT n,w\\nENDLOOP\\nENDCOMPILE\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"#import std\\n\\n#show+\\n\\nmain = leql@bh$^ eql|= (ordered lleq)*~ unixdict_dot_txt\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"fn main() {\\n words := os.read_file(\\\"./unixdict.txt\\\") or {println(err) exit(-1)}.split_into_lines()\\n\\tmut longest_len := 0\\n\\tmut longest := []string{}\\n\\tmut u_word := []u8{}\\n\\tfor word in words {\\n\\t\\tfor chars in word {u_word << chars}\\n\\t\\tu_word.sort()\\n\\t\\tif word.len > longest_len {\\n\\t\\t\\tif word == u_word.bytestr() {\\n\\t\\t\\t\\tlongest_len = word.len\\n\\t\\t\\t\\tlongest.clear()\\n\\t\\t\\t\\tlongest << word\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if word.len == longest_len {\\n\\t\\t\\tif word == u_word.bytestr() {longest << word}\\n\\t\\t}\\n\\t\\tu_word.clear()\\n\\t}\\n\\tprintln(\\\"The ${longest.len} ordered words with the longest length (${longest_len}) are:\\\")\\n\\tprint(longest.join(\\\"\\\\n\\\"))\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Public Sub orderedwords(fname As String)\\n ' find ordered words in dict file that have the longest word length\\n ' fname is the name of the input file\\n ' the words are printed in the immediate window\\n ' this subroutine uses boolean function IsOrdered\\n\\nDim word As String 'word to be tested\\nDim l As Integer 'length of word\\nDim wordlength As Integer 'current longest word length\\nDim orderedword() As String 'dynamic array holding the ordered words with the current longest word length\\nDim wordsfound As Integer 'length of the array orderedword()\\n\\nOn Error GoTo NotFound 'catch incorrect/missing file name\\nOpen fname For Input As #1\\nOn Error GoTo 0\\n\\n'initialize\\nwordsfound = 0\\nwordlength = 0\\n\\n'process file line per line\\nWhile Not EOF(1)\\n Line Input #1, word\\n If IsOrdered(word) Then 'found one, is it equal to or longer than current word length?\\n l = Len(word)\\n If l >= wordlength Then 'yes, so add to list or start a new list\\n If l > wordlength Then 'it's longer, we must start a new list\\n wordsfound = 1\\n wordlength = l\\n Else 'equal length, increase the list size\\n wordsfound = wordsfound + 1\\n End If\\n 'add the word to the list\\n ReDim Preserve orderedword(wordsfound)\\n orderedword(wordsfound) = word\\n End If\\n End If\\nWend\\nClose #1\\n\\n'print the list\\nDebug.Print \\\"Found\\\"; wordsfound; \\\"ordered words of length\\\"; wordlength\\nFor i = 1 To wordsfound\\n Debug.Print orderedword(i)\\nNext\\nExit Sub\\n\\nNotFound:\\n debug.print \\\"Error: Cannot find or open file \\\"\\\"\\\" & fname & \\\"\\\"\\\"!\\\"\\nEnd Sub\\n\\n\\n\\nPublic Function IsOrdered(someWord As String) As Boolean\\n'true if letters in word are in ascending (ascii) sequence\\n\\nDim l As Integer 'length of someWord\\nDim wordLcase As String 'the word in lower case\\nDim ascStart As Integer 'ascii code of first char\\nDim asc2 As Integer 'ascii code of next char\\n\\nwordLcase = LCase(someWord) 'convert to lower case\\nl = Len(someWord)\\nIsOrdered = True\\nIf l > 0 Then 'this skips empty string - it is considered ordered...\\n ascStart = Asc(Left$(wordLcase, 1))\\n For i = 2 To l\\n asc2 = Asc(Mid$(wordLcase, i, 1))\\n If asc2 < ascStart Then 'failure!\\n IsOrdered = False\\n Exit Function\\n End If\\n ascStart = asc2\\n Next i\\nEnd If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Set objFSO = CreateObject(\\\"Scripting.FileSystemObject\\\")\\nSet infile = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) & \\\"\\\\\\\" &_\\n\\t\\t\\t\\\"unixdict.txt\\\",1)\\nlist = \\\"\\\"\\nlength = 0\\n\\nDo Until inFile.AtEndOfStream\\n\\tline = infile.ReadLine\\n\\tIf IsOrdered(line) Then\\n\\t\\tIf Len(line) > length Then\\n\\t\\t\\tlength = Len(line)\\n\\t\\t\\tlist = line & vbCrLf\\n\\t\\tElseIf Len(line) = length Then\\n\\t\\t\\tlist = list & line & vbCrLf\\n\\t\\tEnd If\\n\\tEnd If\\nLoop\\n\\nWScript.StdOut.Write list\\n\\nFunction IsOrdered(word)\\n\\tIsOrdered = True\\n\\tprev_val = 0\\n\\tFor i = 1 To Len(word)\\n\\t\\tIf i = 1 Then\\n\\t\\t\\tprev_val = Asc(Mid(word,i,1))\\n\\t\\tElseIf Asc(Mid(word,i,1)) >= prev_val Then\\n\\t\\t\\tprev_val = Asc(Mid(word,i,1))\\n\\t\\tElse\\n\\t\\t\\tIsOrdered = False\\n\\t\\t\\tExit For\\n\\t\\tEnd If\\n\\tNext\\nEnd Function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"File_Open(\\\"unixdict.txt\\\", BROWSE)\\n#1 = 2 // length of longest word found\\nRepeat (ALL) {\\n #2 = EOL_Pos-Cur_Pos // length of this word\\n if (#2 >= #1) {\\n #3 = 1 // flag: is ordered word\\n Char(1)\\n While (!At_EOL) {\\n if (Cur_Char < Cur_Char(-1)) {\\n #3 = 0 // not an ordered word\\n break\\n }\\n Char(1)\\n }\\n if (#3) { // ordered word found\\n if (#2 > #1) { // new longer word found\\n #1 = #2\\n Reg_Empty(10) // clear list\\n }\\n BOL Reg_Copy(10,1,APPEND) // add word to list\\n }\\n }\\n Line(1,ERRBREAK) // next word\\n}\\nBuf_Quit(OK) // close file\\nReg_Type(10) // display results\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"import \\\"io\\\" for File\\nimport \\\"./sort\\\" for Sort\\n\\nvar words = File.read(\\\"unixdict.txt\\\").split(\\\"\\\\n\\\")\\nvar longestLen = 0\\nvar longest = []\\nfor (word in words) {\\n if (word.count > longestLen) {\\n if (Sort.isSorted(word.toList)) {\\n longestLen = word.count\\n longest.clear()\\n longest.add(word)\\n }\\n } else if (word.count == longestLen) {\\n if (Sort.isSorted(word.toList)) longest.add(word)\\n }\\n}\\nSystem.print(\\\"The %(longest.count) ordered words with the longest length (%(longestLen)) are:\\\")\\nSystem.print(longest.join(\\\"\\\\n\\\"))\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string 0; \\\\use zero-terminated strings\\nint MaxLen, Pass, I, Ch, Ch0;\\nchar Word(25);\\ndef LF=$0A, CR=$0D, EOF=$1A;\\n[FSet(FOpen(\\\"unixdict.txt\\\", 0), ^I);\\nMaxLen:= 0;\\nfor Pass:= 1 to 2 do\\n [OpenI(3);\\n repeat I:= 0; Ch0:= 0;\\n loop [repeat Ch:= ChIn(3) until Ch # CR; \\\\remove possible CR\\n if Ch=LF or Ch=EOF then\\n [if I > MaxLen then MaxLen:= I;\\n if I=MaxLen & Pass=2 then\\n [Word(I):= 0; Text(0, Word); CrLf(0)];\\n quit;\\n ];\\n Word(I):= Ch;\\n if Ch < Ch0 then\\n [repeat Ch:= ChIn(3) until Ch=LF or Ch=EOF;\\n quit;\\n ];\\n Ch0:= Ch;\\n I:= I+1;\\n ];\\n until Ch = EOF;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var words=L(), sz=0; // some state\\nfcn isLex(word){ word.reduce(fcn(p,c){ (p<=c) and c or T(Void.Stop,False) }) }\\nFile(\\\"dict.txt\\\").pump(Void,fcn(w){\\n w=w.strip(); // get rid of newline\\n if(isLex(w)){ n:=w.len();\\n if(n>sz){ words.clear(w); sz=n }\\n else if(n==sz) words.append(w)\\n }\\n})\\nprintln(\\\"Num words: %d, all size %d\\\\n\\\".fmt(words.len(),sz));\\nwords.pump(Console.println);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn isLex(word){ word.reduce(fcn(p,c){ (p<=c) and c or T(Void.Stop,False) }) }\\nlwords:=File(\\\"dict.txt\\\").readln(*).apply(\\\"strip\\\").filter(isLex);\\nmax:=lwords.reduce(fcn(n,w){ w.len()>n and w.len() or n },0);\\nlwords=lwords.filter(fcn(w,n){ w.len()==n },max);\\nprintln(\\\"Num words: %d, all size %d\\\\n\\\".fmt(lwords.len(),max));\\nwords.pump(Console.println);\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ordered-words"}}},{"rowIdx":1471,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Ormiston_triples\n","language":"00-META"},{"code":";Definition\nAn '''Ormiston triple''' is three consecutive prime numbers which are anagrams, i.e. contain the same decimal digits but in a different order.\n\n;Example\nThe three consecutive primes '''(11117123, 11117213, 11117321)''' are an Ormiston triple.\n\n;Task \n\n* Find and show the smallest member of the first '''25''' Ormiston triples.\n\n* Find and show the '''count''' of Ormiston triples up to one billion.\n\n;Stretch\n\n* Find and show the '''count''' of Ormiston triples up to ten billion.\n\n;Reference\n\n* [[oeis:A075093 |OEIS:A075093 - Smallest member of Ormiston prime triple]]\n \n;Related task\n* [[Ormiston pairs]]\n<br>\n\n","language":"00-TASK"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <locale.h>\n\nbool *sieve(uint64_t limit) {\n uint64_t i, p;\n limit++;\n // True denotes composite, false denotes prime.\n bool *c = calloc(limit, sizeof(bool)); // all false by default\n c[0] = true;\n c[1] = true;\n for (i = 4; i < limit; i += 2) c[i] = true;\n p = 3; // Start from 3.\n while (true) {\n uint64_t p2 = p * p;\n if (p2 >= limit) break;\n for (i = p2; i < limit; i += 2 * p) c[i] = true;\n while (true) {\n p += 2;\n if (!c[p]) break;\n }\n }\n return c;\n}\n\ntypedef struct {\n char digs[20];\n int count;\n} digits;\n\ndigits getDigits(uint64_t n) {\n if (n == 0) return (digits){ {0}, 1 };\n digits d;\n d.count = 0;\n while (n > 0) {\n d.digs[d.count++] = n % 10;\n n = n / 10;\n }\n return d; // note digits are in reverse order\n}\n\nint main() {\n const uint64_t limit = 10000000000;\n uint64_t i, j, pc = 0, p1, p2, p3, key1, key2, key3;\n int k, count, count2;\n digits d;\n bool *c = sieve(limit);\n for (i = 0; i < limit; ++i) {\n if (!c[i]) ++pc;\n }\n uint64_t *primes = (uint64_t *)malloc(pc * sizeof(uint64_t));\n for (i = 0, j = 0; i < limit; ++i) {\n if (!c[i]) primes[j++] = i;\n }\n free(c);\n uint64_t orm25[25];\n int counts[2];\n j = limit/10;\n for (i = 0; i < pc-2; ++i) {\n p1 = primes[i];\n p2 = primes[i+1];\n p3 = primes[i+2];\n if ((p2 - p1) % 18 || (p3 - p2) % 18) continue;\n key1 = 1;\n d = getDigits(p1);\n for (k = 0; k < d.count; ++k) key1 *= primes[d.digs[k]];\n key2 = 1;\n d = getDigits(p2);\n for (k = 0; k < d.count; ++k) key2 *= primes[d.digs[k]];\n if (key1 != key2) continue;\n key3 = 1;\n d = getDigits(p3);\n for (k = 0; k < d.count; ++k) key3 *= primes[d.digs[k]];\n if (key2 == key3) {\n if (count < 25) orm25[count] = p1;\n if (p1 >= j) {\n counts[count2++] = count;\n j *= 10;\n }\n ++count;\n }\n }\n counts[count2] = count;\n printf(\"Smallest members of first 25 Ormiston triples:\\n\");\n setlocale(LC_NUMERIC, \"\");\n for (i = 0; i < 25; ++i) {\n printf(\"%'10ld \", orm25[i]);\n if (!((i+1) % 5)) printf(\"\\n\");\n }\n printf(\"\\n\");\n j = limit/10;\n for (i = 0; i < 2; ++i) {\n printf(\"%'d Ormiston triples before %'ld\\n\", counts[i], j);\n j *= 10;\n printf(\"\\n\");\n }\n free(primes);\n return 0;\n}\n","language":"C"},{"code":"#include <array>\n#include <iostream>\n\n#include <primesieve.hpp>\n\nclass ormiston_triple_generator {\npublic:\n ormiston_triple_generator() {\n for (int i = 0; i < 2; ++i) {\n primes_[i] = pi_.next_prime();\n digits_[i] = get_digits(primes_[i]);\n }\n }\n std::array<uint64_t, 3> next_triple() {\n for (;;) {\n uint64_t prime = pi_.next_prime();\n auto digits = get_digits(prime);\n bool is_triple = digits == digits_[0] && digits == digits_[1];\n uint64_t prime0 = primes_[0];\n primes_[0] = primes_[1];\n primes_[1] = prime;\n digits_[0] = digits_[1];\n digits_[1] = digits;\n if (is_triple)\n return {prime0, primes_[0], primes_[1]};\n }\n }\n\nprivate:\n static std::array<int, 10> get_digits(uint64_t n) {\n std::array<int, 10> result = {};\n for (; n > 0; n /= 10)\n ++result[n % 10];\n return result;\n }\n primesieve::iterator pi_;\n std::array<uint64_t, 2> primes_;\n std::array<std::array<int, 10>, 2> digits_;\n};\n\nint main() {\n ormiston_triple_generator generator;\n int count = 0;\n std::cout << \"Smallest members of first 25 Ormiston triples:\\n\";\n for (; count < 25; ++count) {\n auto primes = generator.next_triple();\n std::cout << primes[0] << ((count + 1) % 5 == 0 ? '\\n' : ' ');\n }\n std::cout << '\\n';\n for (uint64_t limit = 1000000000; limit <= 10000000000; ++count) {\n auto primes = generator.next_triple();\n if (primes[2] > limit) {\n std::cout << \"Number of Ormiston triples < \" << limit << \": \"\n << count << '\\n';\n limit *= 10;\n }\n }\n}\n","language":"C++"},{"code":"#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <vector>\n\nclass SegmentedPrimeIterator {\npublic:\n\tSegmentedPrimeIterator(const uint64_t& aLimit) {\n\t\tsquare_root = std::sqrt(aLimit);\n\t\tindex = 0;\n low = 0;\n high = square_root;\n small_sieve(square_root);\n\t}\n\n\tuint64_t next() {\n\t\tif ( index == primes.size() ) {\n\t\t\tindex = 0;\n\t\t\tsegmented_sieve();\n\t\t}\n\t\treturn primes[index++];\n\t}\n\nprivate:\n\tvoid segmented_sieve() {\n\t\tlow += square_root;\n\t\thigh += square_root;\n\n\t\tstd::vector<bool> marked_prime(square_root, true);\n\n\t\tfor ( uint64_t i = 0; i < small_primes.size(); ++i ) {\n\t\t\tuint64_t low_limit = ( low / small_primes[i] ) * small_primes[i];\n\t\t\tif ( low_limit < low ) {\n\t\t\t\tlow_limit += small_primes[i];\n\t\t\t}\n\n\t\t\tfor ( uint64_t j = low_limit; j < high; j += small_primes[i] ) {\n\t\t\t\tmarked_prime[j - low] = false;\n\t\t\t}\n\t\t}\n\n\t\tprimes.clear();\n\t\tfor ( uint64_t i = low; i < high; ++i ) {\n\t\t\tif ( marked_prime[i - low] ) {\n\t\t\t\tprimes.emplace_back(i);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid small_sieve(const uint32_t& square_root) {\n\t\tstd::vector<bool> marked_prime(square_root + 1, true);\n\n\t\tfor ( uint32_t p = 2; p * p <= square_root; ++p ) {\n\t\t\tif ( marked_prime[p] ) {\n\t\t\t\tfor ( uint32_t i = p * p; i <= square_root; i += p ) {\n\t\t\t\t\tmarked_prime[i] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor ( uint32_t p = 2; p <= square_root; ++p ) {\n\t\t\tif ( marked_prime[p] ) {\n\t\t\t\tprimes.emplace_back(p);\n\t\t\t}\n\t\t}\n\t\tsmall_primes.insert(small_primes.end(), primes.begin(), primes.end());\n\t}\n\n\tuint32_t index, square_root;\n\tuint64_t low, high;\n\tstd::vector<uint64_t> primes;\n\tstd::vector<uint64_t> small_primes;\n};\n\nstd::vector<uint32_t> digits(uint64_t number) {\n\tstd::vector<uint32_t> result;\n\twhile ( number > 0 ) {\n\t\tresult.emplace_back(number % 10);\n\t\tnumber /= 10;\n\t}\n\tstd::sort(result.begin(), result.end());\n\treturn result;\n}\n\nbool haveSameDigits(uint64_t first, uint64_t second) {\n\treturn digits(first) == digits(second);\n}\n\nint main() {\n\tconst uint64_t limit = 10'000'000'000;\n\tSegmentedPrimeIterator primes(limit);\n\tstd::vector<uint64_t> ormistons;\n\tuint64_t lower_limit = limit / 10;\n\tuint32_t count = 0;\n\tstd::vector<uint32_t> counts;\n\tuint64_t p1 = 0, p2 = 0, p3 = 0;\n\n\twhile ( p3 < limit ) {\n\t\tp1 = p2; p2 = p3; p3 = primes.next();\n\n\t\tif ( ( p2 - p1 ) % 18 != 0 || ( p3 - p2 ) % 18 != 0 ) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ( ! haveSameDigits(p1, p2) ) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif ( haveSameDigits(p2, p3) ) {\n\t\t\tif ( count < 25 ) {\n\t\t\t\tormistons.emplace_back(p1);\n\t\t\t}\n\t\t\tif ( p1 >= lower_limit ) {\n\t\t\t\tcounts.emplace_back(count);\n\t\t\t\tlower_limit *= 10;\n\t\t\t}\n\t\t\tcount += 1;\n\t\t}\n\t}\n\tcounts.emplace_back(count);\n\n\tstd::cout << \"The smallest member of the first 25 Ormiston triples:\" << std::endl;\n\tfor ( uint64_t i = 0; i < ormistons.size(); ++i ) {\n\t\tstd::cout << std::setw(10) << ormistons[i] << ( i % 5 == 4 ? \"\\n\" : \"\" );\n\t}\n\tstd::cout << std::endl;\n\n\tlower_limit = limit / 10;\n\tfor ( uint64_t i = 0; i < counts.size(); ++i ) {\n\t\tstd::cout << counts[i] << \" Ormiston triples less than \" << lower_limit << std::endl;\n\t\tlower_limit *= 10;\n\t}\n}\n","language":"C++"},{"code":"{Bit boolean - because it stores 8 bools per bytye, it will}\n{handle up to 16 gigabyte in a 32 bit programming environment}\n\ntype TBitBoolArray = class(TObject)\n private\n FSize: int64;\n ByteArray: array of Byte;\n function GetValue(Index: int64): boolean;\n procedure WriteValue(Index: int64; const Value: boolean);\n function GetSize: int64;\n procedure SetSize(const Value: int64);\n protected\n public\n property Value[Index: int64]: boolean read GetValue write WriteValue; default;\n constructor Create;\n property Count: int64 read GetSize write SetSize;\n procedure Clear(Value: boolean);\n end;\n\n\n\n{ TBitBoolArray }\n\nconst BitArray: array [0..7] of byte = ($01, $02, $04, $08, $10, $20, $40, $80);\n\nfunction TBitBoolArray.GetValue(Index: int64): boolean;\nbegin\n{Note: (Index and 7) is faster than (Index mod 8)}\nResult:=(ByteArray[Index shr 3] and BitArray[Index and 7])<>0;\nend;\n\n\nprocedure TBitBoolArray.WriteValue(Index: int64; const Value: boolean);\nvar Inx: int64;\nbegin\nInx:=Index shr 3;\n{Note: (Index and 7) is faster than (Index mod 8)}\nif Value then ByteArray[Inx]:=ByteArray[Inx] or BitArray[Index and 7]\nelse ByteArray[Inx]:=ByteArray[Inx] and not BitArray[Index and 7]\nend;\n\n\nconstructor TBitBoolArray.Create;\nbegin\nSetLength(ByteArray,0);\nend;\n\n\nfunction TBitBoolArray.GetSize: int64;\nbegin\nResult:=FSize;\nend;\n\n\nprocedure TBitBoolArray.SetSize(const Value: int64);\nvar Len: int64;\nbegin\nFSize:=Value;\n{Storing 8 items per byte}\nLen:=Value div 8;\n{We need one more to fill partial bits}\nif (Value mod 8)<>0 then Inc(Len);\nSetLength(ByteArray,Len);\nend;\n\n\nprocedure TBitBoolArray.Clear(Value: boolean);\nvar Fill: byte;\nbegin\nif Value then Fill:=$FF else Fill:=0;\nFillChar(ByteArray[0],Length(ByteArray),Fill);\nend;\n\n\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n\n{Sieve object the generates and holds prime values}\n\n{Enable this flag if you need primes past 2 billion.\nThe flag signals the code to use bit-booleans arrays\nwhich can contain up to 8 x 4 gigabytes = 32 gig booleans.}\n\n{$define BITBOOL}\n\ntype TPrimeSieve = class(TObject)\n private\n {$ifdef BITBOOL}\n PrimeArray: TBitBoolArray;\n {$else}\n PrimeArray: array of boolean;\n {$endif}\n FArraySize: int64;\n function GetPrime(Index: int64): boolean;\n procedure Clear;\n protected\n procedure DoSieve;\n property ArraySize: int64 read FArraySize;\n public\n BitBoolean: boolean;\n constructor Create;\n destructor Destroy; override;\n procedure Intialize(Size: int64);\n property Prime[Index: int64]: boolean read GetPrime; default;\n function NextPrime(Start: int64): int64;\n end;\n\n\nprocedure TPrimeSieve.Clear;\nbegin\n{$ifdef BITBOOL}\nPrimeArray.Clear(True);\n{$else}\nFillChar(PrimeArray[0],Length(PrimeArray),True);\n{$endif}\nend;\n\n\n\nconstructor TPrimeSieve.Create;\nbegin\n{$ifdef BITBOOL}\nPrimeArray:=TBitBoolArray.Create;\nBitBoolean:=True;\n{$else}\nBitBoolean:=False;\n{$endif}\nend;\n\n\ndestructor TPrimeSieve.Destroy;\nbegin\n{$ifdef BITBOOL}\nPrimeArray.Free;\n{$endif}\ninherited;\nend;\n\n\nprocedure TPrimeSieve.DoSieve;\n{Load flags with true/false to flag that number is prime}\n{Note: does not store even values, because except for 2, all primes are even}\n{Starts storing flags at Index=3, so reading/writing routines compensate}\n{Uses for-loops for boolean arrays and while-loops for bitbooleans arrays}\n{$ifdef BITBOOL}\nvar Offset, I, K: int64;\n{$else}\nvar Offset, I, K: cardinal;\n{$endif}\nbegin\nClear;\n{$ifdef BITBOOL}\nI:=0;\nwhile I<ArraySize do\n{$else}\nfor I:=0 to ArraySize-1 do\n{$endif}\n\tbegin\n\tif PrimeArray[I] then\n\t\tbegin\n\t\tOffset:= I + I + 3;\n\t\tK:= I + Offset;\n\t\twhile K <=(ArraySize-1) do\n\t\t\tbegin\n\t\t\tPrimeArray[K]:= False;\n\t\t\tK:= K + Offset;\n\t\t\tend;\n\t\tend;\n\t{$ifdef BITBOOL} Inc(I); {$endif}\n\tend;\nend;\n\n\n\nfunction TPrimeSieve.GetPrime(Index: int64): boolean;\n{Get a prime flag from array - compensates}\n{ for 0,1,2 and even numbers not being stored}\nbegin\nif Index in [0,1,2] then Result:=True\nelse if (Index and 1)=0 then Result:=false\nelse Result:=PrimeArray[(Index div 2)-1];\nend;\n\n\nfunction TPrimeSieve.NextPrime(Start: int64): int64;\n{Get next prime after Start}\nbegin\nResult:=Start+1;\nwhile Result<=((ArraySize-1) * 2) do\n\tbegin\n\tif Self.Prime[Result] then break;\n\tInc(Result);\n\tend;\nend;\n\n\nprocedure TPrimeSieve.Intialize(Size: int64);\n{Set array size and do Sieve to load flag array with}\nbegin\nFArraySize:=Size div 2;\n{$ifdef BITBOOL}\nPrimeArray.Count:=FArraySize;\n{$else}\nSetLength(PrimeArray,FArraySize);\n{$endif}\nDoSieve;\nend;\n\n{-------------------------------------------------------------------------------}\n\n\n\ntype TTripleInfo = record\n Prime1,Prime2,Prime3: int64;\n Count: int64;\n end;\n\n{Iterator for Ormiston Triple}\n\ntype TOrm3Iterator = class(TObject)\n FInfo: TTripleInfo;\n PS: TPrimeSieve;\n private\n function IsOrmistonTriple(P1, P2, P3: int64): boolean;\n function EncodeNumber(N: int64): int64;\n protected\n public\n procedure Reset;\n procedure SetSize(Size: int64);\n function GetNext(Limit: int64; var Info: TTripleInfo): boolean;\n constructor Create;\n destructor Destroy; override;\n end;\n\n\n\nprocedure TOrm3Iterator.Reset;\n{Restart iterator}\nbegin\nFInfo.Count:=0;\nFInfo.Prime1:=1; FInfo.Prime2:=3; FInfo.Prime3:=5;\nend;\n\n\n\nprocedure TOrm3Iterator.SetSize(Size: int64);\nbegin\nPS.Intialize(Size);\nReset;\nend;\n\n\nconstructor TOrm3Iterator.Create;\nbegin\nPS:=TPrimeSieve.Create;\n{Start with trivial prime set}\nSetSize(100);\nend;\n\n\ndestructor TOrm3Iterator.Destroy;\nbegin\nPS.Free;\ninherited;\nend;\n\n\n\nfunction TOrm3Iterator.EncodeNumber(N: int64): int64;\n{Encode N by counting digits 0..9 into nibbles}\n{Get the product of the integers in a number}\nvar T: integer;\nconst NibMap: array [0..9] of int64 = (\n\t{0} $1, {1} $10, {2} $100, {3} $1000, {4} $10000, {5} $100000,\n\t{6} $1000000, {7} $10000000, {8} $100000000, {9} $1000000000);\nbegin\nResult:=0;\nrepeat\n\tbegin\n\tT:=N mod 10;\n\tN:=N div 10;\n\tResult:=Result + NibMap[T];\n\tend\nuntil N<1;\nend;\n\n\nfunction TOrm3Iterator.IsOrmistonTriple(P1,P2,P3: int64): boolean;\nvar Pd1,Pd2,Pd3: int64;\nbegin\nResult:=False;\n{Optimization - difference in primes should be multiple of 18}\nif (((P2 - P1) mod 18)<>0) or (((p3 - p2) mod 18)<>0) then exit;\nPd1:=EncodeNumber(P1);\nPd2:=EncodeNumber(P2);\nif Pd1<>Pd2 then exit;\nPd3:=EncodeNumber(P3);\nResult:=Pd2=Pd3;\nend;\n\n\nfunction TOrm3Iterator.GetNext(Limit: int64; var Info: TTripleInfo): boolean;\n{Iterate to next Ormiston Pair - automatically stop at prime>Limit}\n{Returns false if it hits limit - true if it found Next Ormiston Pair}\nbegin\nResult:=False;\nwhile true do\n\tbegin\n\t{Get next set of primes}\n\tFInfo.Prime1:=FInfo.Prime2;\n\tFInfo.Prime2:=FInfo.Prime3;\n\tFInfo.Prime3:=PS.NextPrime(FInfo.Prime3);\n\t{Abort if 3rd prime is ove limit}\n\tif FInfo.Prime3>=Limit then break;\n\t{Test if it is an Ormiston triple}\n\tif IsOrmistonTriple(FInfo.Prime1,FInfo.Prime2,FInfo.Prime3) then\n\t\tbegin\n\t\t{Return info on triple}\n\t\tInc(FInfo.Count);\n\t\tInfo:=FInfo;\n\t\tResult:=True;\n\t\tbreak;\n\t\tend;\n\tend;\nend;\n\n\nprocedure ShowOrmistonTriple(Memo: TMemo);\nvar I: integer;\nvar S: string;\nvar OI: TOrm3Iterator;\nvar Info: TTripleInfo;\nconst Limit = 10000000000;\nconst DisMod = Limit div 10000000;\nconst Bill = Limit div 1000000000;\nvar NS: string;\n\n\tprocedure DisplayTitle;\n\tbegin\n\tNS:=IntToStr(Bill)+'-Billion';\n\tMemo.Lines.Add('====== Find Ormiston Triples ======');\n\tMemo.Lines.Add('First 25 plus number to '+NS);\n\tS:='Bit-Boolean Array: ';\n\tif OI.PS.BitBoolean then S:=S+'Yes' else S:=S+'No';\n\tMemo.Lines.Add(S);\n\tend;\n\nbegin\n{Create iterator}\nOI:=TOrm3Iterator.Create;\ntry\nDisplayTitle;\nMemo.Lines.Add('Sieving Primes');\nOI.SetSize(Limit);\nMemo.Lines.Add('Finding first 25 Triples');\n{Iterate throug 1st 25 tuples}\nfor I:=1 to 25 do\n\tbegin\n\tOI.GetNext(High(Int64),Info);\n\tMemo.Lines.Add(Format('%3d - (%6D %6D %6D) ',[I,Info.Prime1,Info.Prime2,Info.Prime3]));\n\tend;\nMemo.Lines.Add('Count='+IntToStr(Info.Count));\nMemo.Lines.Add('Counting triples to '+NS);\n{Iterate to limit number of triples}\nwhile OI.GetNext(Limit,Info) do\nif (Info.Count mod DisMod)=0 then Memo.Lines.Add('Count='+IntToStr(Info.Count));\nMemo.Lines.Add(NS+'='+IntToStr(Info.Count));\nfinally OI.Free; end;\nend;\n","language":"Delphi"},{"code":"fastfunc isprim num .\n if num mod 3 = 0\n return 0\n .\n i = 5\n while i <= sqrt num\n if num mod i = 0\n return 0\n .\n i += 2\n if num mod i = 0\n return 0\n .\n i += 4\n .\n return 1\n.\nfunc nextprim n .\n repeat\n n += 2\n until isprim n = 1\n .\n return n\n.\nfunc digs n .\n while n > 0\n r += pow 10 (n mod 10)\n n = n div 10\n .\n return r\n.\nprint \"Smallest member of the first 25 Ormiston triples:\"\nb = 2\na = 3\nrepeat\n c = b\n dc = db\n b = a\n db = da\n a = nextprim a\n until a > 1000000000\n da = digs a\n if da = db and da = dc\n cnt += 1\n if cnt <= 25\n write c & \" \"\n .\n .\n.\nprint \"Ormiston triples before 1 billion: \" & cnt\n","language":"EasyLang"},{"code":"// Ormiston triples. Nigel Galloway: February 3rd., 2023\nlet oTriples n=n|>Seq.pairwise|>Seq.filter(fun((n,i),(g,l))->i=g)|>Seq.map(fun((n,i),(g,l))->(n,g,l))\nprimes32()|>oPairs|>oTriples|>Seq.take 25|>Seq.iter(fun(n,_,_)->printf \"%d \" n); printfn \"\"\nprintfn $\"<100 million: %d{primes32()|>Seq.takeWhile((>)100000000)|>oPairs|>oTriples|>Seq.length}\"\nprintfn $\"<1 billion: %d{primes32()|>Seq.takeWhile((>)1000000000)|>oPairs|>oTriples|>Seq.length}\"\n","language":"F-Sharp"},{"code":"program Ormiston;\n{$IFDEF FPC}{$MODE DELPHI} {$OPTIMIZATION ON,ALL}{$ENDIF}\n{$IFDEF WINDOWS}{$APPLICATION CONSOLE}{$ENDIF}\n\nuses\n sysutils,strUtils;\n\n//********* segmented sieve of erathostenes *********\n{segmented sieve of Erathostenes using only odd numbers}\n{using presieved sieve of small primes, to reduce the most time consuming}\nconst\n smlPrimes :array [0..10] of Byte = (2,3,5,7,11,13,17,19,23,29,31);\n maxPreSievePrimeNum = 7;\n maxPreSievePrime = 17;//smlPrimes[maxPreSievePrimeNum];\n cSieveSize = 4*16384;//<= High(Word)+1 // Level I Data Cache\ntype\n tSievePrim = record\n svdeltaPrime:word;//diff between actual and new prime\n svSivOfs:word; //Offset in sieve\n svSivNum:LongWord;//1 shl (1+16+32) = 5.6e14\n end;\n tpSievePrim = ^tSievePrim;\n\nvar\n//sieved with primes 3..maxPreSievePrime.here about 255255 Byte\n{$ALIGN 32}\n preSieve :array[0..3*5*7*11*13*17-1] of Byte;//must be > cSieveSize\n{$ALIGN 32}\n Sieve :array[0..cSieveSize-1] of Byte;\n{$ALIGN 32}\n//prime = FoundPrimesOffset + 2*FoundPrimes[0..FoundPrimesCnt]\n FoundPrimes : array[0..12252] of Word;\n{$ALIGN 32}\n sievePrimes : array[0..1077863] of tSievePrim;\n FoundPrimesOffset : Uint64;\n FoundPrimesCnt,\n FoundPrimesIdx,\n FoundPrimesTotal,\n SieveNum,\n SieveMaxIdx,\n preSieveOffset,\n LastInsertedSievePrime :NativeUInt;\n\nprocedure CopyPreSieveInSieve; forward;\nprocedure CollectPrimes; forward;\nprocedure sieveOneSieve; forward;\nprocedure Init0Sieve; forward;\nprocedure SieveOneBlock; forward;\n\nprocedure preSieveInit;\nvar\n i,pr,j,umf : NativeInt;\nBegin\n fillchar(preSieve[0],SizeOf(preSieve),#1);\n i := 1;\n pr := 3;// starts with pr = 3\n umf := 1;\n repeat\n IF preSieve[i] =1 then\n Begin\n pr := 2*i+1;\n j := i;\n repeat\n preSieve[j] := 0;\n inc(j,pr);\n until j> High(preSieve);\n umf := umf*pr;\n end;\n inc(i);\n until (pr = maxPreSievePrime)OR(umf>High(preSieve)) ;\n preSieveOffset := 0;\nend;\n\nfunction InsertSievePrimes(PrimPos:NativeInt):NativeInt;\nvar\n j :NativeUINt;\n i,pr : NativeUInt;\nbegin\n i := 0;\n //ignore first primes already sieved with\n if SieveNum = 0 then\n i := maxPreSievePrimeNum;\n pr :=0;\n j := Uint64(SieveNum)*cSieveSize*2-LastInsertedSievePrime;\n with sievePrimes[PrimPos] do\n Begin\n pr := FoundPrimes[i]*2+1;\n svdeltaPrime := pr+j;\n j := pr;\n end;\n inc(PrimPos);\n for i := i+1 to FoundPrimesCnt-1 do\n Begin\n IF PrimPos > High(sievePrimes) then\n BREAK;\n with sievePrimes[PrimPos] do\n Begin\n pr := FoundPrimes[i]*2+1;\n svdeltaPrime := (pr-j);\n j := pr;\n end;\n inc(PrimPos);\n end;\n LastInsertedSievePrime :=Uint64(SieveNum)*cSieveSize*2+pr;\n result := PrimPos;\nend;\n\nprocedure CalcSievePrimOfs(lmt:NativeUint);\n//lmt High(sievePrimes)\nvar\n i,pr : NativeUInt;\n sq : Uint64;\nbegin\n pr := 0;\n i := 0;\n repeat\n with sievePrimes[i] do\n Begin\n pr := pr+svdeltaPrime;\n IF sqr(pr) < (cSieveSize*2) then\n Begin\n svSivNum := 0;\n svSivOfs := (pr*pr-1) DIV 2;\n end\n else\n Begin\n SieveMaxIdx := i;\n pr := pr-svdeltaPrime;\n BREAK;\n end;\n end;\n inc(i);\n until i > lmt;\n\n for i := i to lmt do\n begin\n with sievePrimes[i] do\n Begin\n pr := pr+svdeltaPrime;\n sq := sqr(pr);\n svSivNum := sq DIV (2*cSieveSize);\n svSivOfs := ( (sq - Uint64(svSivNum)*(2*cSieveSize))-1)DIV 2;\n end;\n end;\nend;\n\nprocedure sievePrimesInit;\nvar\n i,j,pr,PrimPos:NativeInt;\nBegin\n LastInsertedSievePrime := 0;\n preSieveOffset := 0;\n SieveNum :=0;\n CopyPreSieveInSieve;\n //normal sieving of first sieve\n i := 1; // start with 3\n repeat\n while Sieve[i] = 0 do\n inc(i);\n pr := 2*i+1;\n inc(i);\n j := ((pr*pr)-1) DIV 2;\n if j > High(Sieve) then\n BREAK;\n repeat\n Sieve[j] := 0;\n inc(j,pr);\n until j > High(Sieve);\n until false;\n\n CollectPrimes;\n PrimPos := InsertSievePrimes(0);\n LastInsertedSievePrime := FoundPrimes[PrimPos]*2+1;\n\n IF PrimPos < High(sievePrimes) then\n Begin\n Init0Sieve;\n sieveOneBlock;\n repeat\n sieveOneBlock;\n dec(SieveNum);\n PrimPos := InsertSievePrimes(PrimPos);\n inc(SieveNum);\n until PrimPos > High(sievePrimes);\n end;\n Init0Sieve;\nend;\n\nprocedure Init0Sieve;\nbegin\n FoundPrimesTotal :=0;\n preSieveOffset := 0;\n SieveNum :=0;\n CalcSievePrimOfs(High(sievePrimes));\nend;\n\nprocedure CopyPreSieveInSieve;\nvar\n lmt : NativeInt;\nBegin\n lmt := preSieveOffset+cSieveSize;\n lmt := lmt-(High(preSieve)+1);\n IF lmt<= 0 then\n begin\n Move(preSieve[preSieveOffset],Sieve[0],cSieveSize);\n if lmt <> 0 then\n inc(preSieveOffset,cSieveSize)\n else\n preSieveOffset := 0;\n end\n else\n begin\n Move(preSieve[preSieveOffset],Sieve[0],cSieveSize-lmt);\n Move(preSieve[0],Sieve[cSieveSize-lmt],lmt);\n preSieveOffset := lmt\n end;\nend;\n\nprocedure sieveOneSieve;\nvar\n sp:tpSievePrim;\n pSieve :pByte;\n i,j,pr,sn,dSievNum :NativeUint;\nBegin\n pr := 0;\n sn := sieveNum;\n sp := @sievePrimes[0];\n pSieve := @Sieve[0];\n For i := SieveMaxIdx downto 0 do\n with sp^ do\n begin\n pr := pr+svdeltaPrime;\n IF svSivNum = sn then\n Begin\n j := svSivOfs;\n repeat\n pSieve[j] := 0;\n inc(j,pr);\n until j > High(Sieve);\n dSievNum := j DIV cSieveSize;\n svSivOfs := j-dSievNum*cSieveSize;\n svSivNum := sn+dSievNum;\n end;\n inc(sp);\n end;\n i := SieveMaxIdx+1;\n repeat\n if i > High(SievePrimes) then\n BREAK;\n with sp^ do\n begin\n if svSivNum > sn then\n Begin\n SieveMaxIdx := I-1;\n Break;\n end;\n pr := pr+svdeltaPrime;\n j := svSivOfs;\n repeat\n Sieve[j] := 0;\n inc(j,pr);\n until j > High(Sieve);\n dSievNum := j DIV cSieveSize;\n svSivOfs := j-dSievNum*cSieveSize;\n svSivNum := sn+dSievNum;\n end;\n inc(i);\n inc(sp);\n until false;\nend;\n\nprocedure CollectPrimes;\n//extract primes to FoundPrimes\nvar\n pSieve : pbyte;\n pFound : pWord;\n i,idx : NativeUint;\nBegin\n FoundPrimesOffset := SieveNum*2*cSieveSize;\n FoundPrimesIdx := 0;\n pFound :=@FoundPrimes[0];\n i := 0;\n idx := 0;\n IF SieveNum = 0 then\n //include small primes used to pre-sieve\n Begin\n repeat\n pFound[idx]:= (smlPrimes[idx]-1) DIV 2;\n inc(idx);\n until smlPrimes[idx]>maxPreSievePrime;\n i := (smlPrimes[idx] -1) DIV 2;\n end;\n //grabbing the primes without if then -> reduces time extremly\n //primes are born to let branch-prediction fail.\n pSieve:= @Sieve[Low(Sieve)];\n repeat\n //store every value until a prime aka 1 is found\n pFound[idx]:= i;\n inc(idx,pSieve[i]);\n inc(i);\n until i>High(Sieve);\n FoundPrimesCnt:= idx;\n inc(FoundPrimesTotal,Idx);\nend;\n\nprocedure SieveOneBlock;\nbegin\n CopyPreSieveInSieve;\n sieveOneSieve;\n CollectPrimes;\n inc(SieveNum);\nend;\n\nfunction Nextprime:Uint64;\nBegin\n result := FoundPrimes[FoundPrimesIdx]*2+1+FoundPrimesOffset;\n if (FoundPrimesIdx=0) AND (sievenum = 1) then\n inc(result);\n inc(FoundPrimesIdx);\n If FoundPrimesIdx>= FoundPrimesCnt then\n SieveOneBlock;\nend;\n\nfunction PosOfPrime: Uint64;inline;\nBegin\n result := FoundPrimesTotal-FoundPrimesCnt+FoundPrimesIdx;\nend;\n\nfunction TotalCount :Uint64;inline;\nbegin\n result := FoundPrimesTotal;\nend;\n\nfunction SieveSize :LongInt;inline;\nBegin\n result := 2*cSieveSize;\nend;\n\nfunction SieveStart:Uint64;inline;\nBegin\n result := (SieveNum-1)*2*cSieveSize;\nend;\n\nprocedure InitPrime;\nBegin\n Init0Sieve;\n SieveOneBlock;\nend;\n//********* segmented sieve of erathostenes *********\n\nconst\n Limit= 10*1000*1000*1000;\ntype\n tDigits10 = array[0..15] of byte;\n td10_UsedDgts2 = array[0..3] of Uint32;\n td10_UsedDgts3 = array[0..1] of Uint64;\n tpd10_UsedDgts3 = ^td10_UsedDgts3;\n\nprocedure OutIn(cnt,p1:NativeInt);\nBegin\n write(Numb2USA(IntToStr(p1)):13,' ');\n if cnt MOD 5 = 0 then\n writeln;\nend;\n\nfunction OutByPot10(cnt,prLimit:NativeInt):NativeInt;\nBegin\n writeln(Numb2USA(IntToStr(cnt)):12,' Ormiston triples before ',Numb2USA(IntToStr(prLimit)):14);\n result := 10*prLimit;\nend;\n\nfunction Convert2Digits10(p:NativeUint):Uint64;inline;\nconst\n smlPrimes : array[0..9] of integer = (2,3,5,7,11,13,17,19,23,29);\nvar\n r : NativeUint;\nbegin\n result := 1;\n repeat\n r := p DIV 10;\n result := result*smlPrimes[p-10*r];\n p := r;\n until r = 0;\nend;\n{$align 32}\nvar\n IsMod18 : array[0..(1000 DIV 18)*18] of boolean;\nprocedure OneRun;\nvar\n{$align 32}\n p1 : Uint64;\n pr1,pr2,pr3,prLimit :nativeUInt;\n cnt,prCnt : NativeUint;\nbegin\n pr1 := 0;\n pr2 := 0;\n prCnt := 0;\n prLimit := 10*1000*1000;\n repeat\n inc(prCnt);\n pr3 := pr2;\n pr2 := pr1;\n pr1 := nextprime;\n until pr1 > prLimit;\n prLimit *= 10;\n\n cnt := 0;\n repeat\n inc(prCnt);\n if IsMod18[pr2-pr3] then\n begin\n p1 := Convert2Digits10(pr3);\n if Convert2Digits10(pr2) = p1 then\n if IsMod18[pr1-pr2] then\n begin\n if Convert2Digits10(pr1) =p1 then\n begin\n inc(cnt);\n IF cnt <= 25 then\n OutIn(cnt,pr1);\n end\n end\n end;\n if pr1 >=prLimit then\n prlimit:= OutByPot10(cnt,prlimit);\n pr3 := pr2;\n pr2 := pr1;\n pr1 := nextprime;\n until pr2 > limit;\n writeln(' prime count ',prCnt);\n writeln(' last primes ',pr3:12,pr2:12,pr1:12);\nend;\n\nvar\n j :Int32;\nBegin\n preSieveInit;\n sievePrimesInit;\n InitPrime;\n\n j := 0;\n while j < High(IsMod18)do\n Begin\n IsMod18[j] := true;\n j += 18;\n end;\n\n OneRun;\nend.\n","language":"Free-Pascal-Lazarus"},{"code":"Function GetSig(Byval N As Uinteger) As Uinteger 'Return signature of N\n 'A \"signature\" is the count of each digit in N packed into a 32-bit word\n Dim As Uinteger Sig = 0\n Do While N > 0\n Sig += 1 Shl (N Mod 10)\n N \\= 10\n Loop\n Return Sig\nEnd Function\n\nDim As Uinteger limite = 1e9\nDim Shared As Boolean Sieve(limite)\n\nSub MakeSieve(Size As Uinteger) 'Make prime number sieve\n Dim As Uinteger Prime, i, K\n Size \\= 2 'ignore even numbers\n For i = 0 To Size 'set Sieve flags all true\n Sieve(i) = True\n Next\n For i = 0 To Size\n If Sieve(i) Then 'found a prime, which is equal to\n Prime = i * 2 + 3 ' twice the index + 3\n K = i + Prime 'first multiple to strike off\n While K <= Size 'strike off all multiples\n Sieve(K) = False\n K += Prime\n Wend\n End If\n Next\nEnd Sub\n\nMakeSieve(limite)\nPrint \"Smallest members of first 25 Ormiston triples:\"\nDim As Uinteger Cnt = 0, N0 = 0, N1 = 0, Sig0 = 0, Sig1 = 0, N = 3, Sig\nDim As Double t0 = Timer\nDo\n If Sieve(N \\ 2 - 1) Then ' is prime\n Sig = GetSig(N)\n If Sig = Sig0 Andalso Sig = Sig1 Then\n Cnt += 1\n If Cnt <= 25 Then\n Print Using \"#,###,###,###\"; N0;\n If Cnt Mod 5 = 0 Then Print\n End If\n End If\n Sig0 = Sig1: Sig1 = Sig\n N0 = N1: N1 = N\n End If\n If N >= limite Then Print Cnt; \" Ormiston triples before one billion.\" : Exit Do\n N += 2\nLoop\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"rcu\"\n)\n\nfunc main() {\n const limit = 1e10\n primes := rcu.Primes(limit)\n var orm25 []int\n j := int(1e9)\n count := 0\n var counts []int\n for i := 0; i < len(primes)-2; i++ {\n p1 := primes[i]\n p2 := primes[i+1]\n p3 := primes[i+2]\n if (p2-p1)%18 != 0 || (p3-p2)%18 != 0 {\n continue\n }\n key1 := 1\n for _, dig := range rcu.Digits(p1, 10) {\n key1 *= primes[dig]\n }\n key2 := 1\n for _, dig := range rcu.Digits(p2, 10) {\n key2 *= primes[dig]\n }\n if key1 != key2 {\n continue\n }\n key3 := 1\n for _, dig := range rcu.Digits(p3, 10) {\n key3 *= primes[dig]\n }\n if key2 == key3 {\n if count < 25 {\n orm25 = append(orm25, p1)\n }\n if p1 >= j {\n counts = append(counts, count)\n j *= 10\n }\n count++\n }\n }\n counts = append(counts, count)\n fmt.Println(\"Smallest members of first 25 Ormiston triples:\")\n for i := 0; i < 25; i++ {\n fmt.Printf(\"%8v \", orm25[i])\n if (i+1)%5 == 0 {\n fmt.Println()\n }\n }\n fmt.Println()\n j = int(1e9)\n for i := 0; i < len(counts); i++ {\n fmt.Printf(\"%s Ormiston triples before %s\\n\", rcu.Commatize(counts[i]), rcu.Commatize(j))\n j *= 10\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"import Data.Numbers.Primes (primes)\nimport Data.List (sort)\n\n\n--------------------- ORMISTON TRIPLES -------------------\n\normistons :: [(Integer, Integer, Integer)]\normistons =\n concat $ zipWith3\n (\\(dx, x) (dy, y) (dz, z)\n -> [(x, y, z) | dx == dy && dx == dz])\n primeDigits\n (tail primeDigits)\n (drop 2 primeDigits)\n\n\nprimeDigits :: [(Integer, Integer)]\nprimeDigits = ((,) =<< read . sort . show) <$> primes\n\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain = do\n putStrLn \"First 25 Ormistons:\"\n mapM_ print $ take 25 ormistons\n\n putStrLn \"\\nCount of Ormistons up to 10^8:\"\n let limit = 10^8\n print $ length $\n takeWhile (\\(_, _, c) -> c <= limit) ormistons\n","language":"Haskell"},{"code":" omt=: (#~ isorm) _4 p: (#~ isorm) i.&.(p:inv) 1e9\n #omt NB. number of ormiston triples less than a billion\n368\n 5 5$omt NB. first prime of the first 25 triples.\n11117123 12980783 14964017 32638213 32964341\n33539783 35868013 44058013 46103237 48015013\n50324237 52402783 58005239 60601237 61395239\n74699789 76012879 78163123 80905879 81966341\n82324237 82523017 83279783 86050781 92514341\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.Collections;\nimport java.util.List;\n\npublic final class OrmistonTriples {\n\n\tpublic static void main(String[] aArgs) {\n\t\tfinal long limit = 10_000_000_000L;\n\t\tSegmentedPrimeIterator primes = new SegmentedPrimeIterator(limit);\n\t\tList<Long> ormistons = new ArrayList<Long>();\n\t\tlong lowerLimit = limit / 10;\n\t\tint count = 0;\n\t\tList<Integer> counts = new ArrayList<Integer>();\n\t\tlong p1 = 0, p2 = 0, p3 = 0;\n\t\t\n\t\twhile ( p3 < limit ) {\n\t\t\tp1 = p2; p2 = p3; p3 = primes.next();\n\t\t\n\t\t if ( ( p2 - p1 ) % 18 != 0 || ( p3 - p2 ) % 18 != 0 ) {\n\t\t \tcontinue;\n\t\t }\n\t\n\t\t if ( ! haveSameDigits(p1, p2) ) {\n\t\t \tcontinue;\n\t\t }\n\t\n\t\t if ( haveSameDigits(p2, p3) ) {\n\t\t if ( count < 25 ) {\n\t\t \tormistons.add(p1);\n\t\t }\n\t\t if ( p1 >= lowerLimit ) {\n\t\t counts.add(count);\n\t\t lowerLimit *= 10;\n\t\t }\n\t\t count += 1;\n\t\t }\n\t\t}\t\t\n\t\tcounts.add(count);\n\t\t\n\t\tSystem.out.println(\"The smallest member of the first 25 Ormiston triples:\");\n\t\tfor ( int i = 0; i < ormistons.size(); i++ ) {\n\t\t\tSystem.out.print(String.format(\"%10d%s\", ormistons.get(i), ( i % 5 == 4 ? \"\\n\" : \"\" )));\n\t\t}\n\t\tSystem.out.println();\t\t\n\t\t\n\t\tlowerLimit = limit / 10;\n\t\tfor ( int i = 0; i < counts.size(); i++ ) {\n\t\t\tSystem.out.println(counts.get(i) + \" Ormiston triples less than \" + lowerLimit);\n\t\t lowerLimit *= 10;\n\t\t}\n\n\t}\t\n \t\n\tprivate static boolean haveSameDigits(long aOne, long aTwo) {\n\t\treturn digits(aOne).equals(digits(aTwo));\t\n\t}\n\t\n\tprivate static List<Integer> digits(long aNumber) {\n\t\tList<Integer> result = new ArrayList<Integer>();\n\t\twhile ( aNumber > 0 ) {\n\t\t\tresult.add((int) ( aNumber % 10 ));\n\t\t\taNumber /= 10;\n\t\t}\n\t\tCollections.sort(result);\n\t\treturn result;\n\t}\t\n\n}\n\nfinal class SegmentedPrimeIterator {\n\t\n\tpublic SegmentedPrimeIterator(long aLimit) {\n\t\tsquareRoot = (int) Math.sqrt(aLimit);\t\n high = squareRoot;\n smallSieve(squareRoot);\n\t}\n\t\n\tpublic long next() {\n\t\tif ( index == primes.size() ) {\n\t\t\tindex = 0;\n\t\t\tsegmentedSieve();\n\t\t} \t\t\n\t\treturn primes.get(index++); \t\t\n\t}\n\n private void segmentedSieve() {\n low += squareRoot;\n high += squareRoot;\t \t\n\n boolean[] markedPrime = new boolean[squareRoot];\n Arrays.fill(markedPrime, true);\n\n for ( int i = 0; i < smallPrimes.size(); i++ ) {\n long lowLimit = ( low / smallPrimes.get(i) ) * smallPrimes.get(i);\n if ( lowLimit < low ) {\n lowLimit += smallPrimes.get(i);\n }\n\n for ( long j = lowLimit; j < high; j += smallPrimes.get(i) ) {\n markedPrime[(int) ( j - low )] = false;\n }\n }\n\n primes.clear();\n for ( long i = low; i < high; i++ ) {\n if ( markedPrime[(int) ( i - low )] ) {\n \tprimes.add(i);\n }\n }\n }\n\n private void smallSieve(int aSquareRoot) {\n boolean[] markedPrime = new boolean[aSquareRoot + 1];\n Arrays.fill(markedPrime, true);\n\n for ( int p = 2; p * p <= aSquareRoot; p++ ) {\n if ( markedPrime[p] ) {\n for ( int i = p * p; i <= aSquareRoot; i += p ) {\n markedPrime[i] = false;\n }\n }\n }\n\n for ( int p = 2; p <= aSquareRoot; p++ ) {\n if ( markedPrime[p] ) {\n primes.add((long) p);\n }\n }\n smallPrimes.addAll(primes);\n }\n\n private static int index, squareRoot;\n private static long low, high;\n private static List<Long> primes = new ArrayList<Long>();\n private static List<Long> smallPrimes = new ArrayList<Long>();\t\n\n}\n","language":"Java"},{"code":"using Primes\n\nconst dig = zeros(Int, 10)\nconst primes10B = primes(10_000_000_000)\nconst sort10B = map(n -> evalpoly(10, sort!(digits!(dig, n))), primes10B)\n\nconst ormiston_indices = filter(i -> sort10B[i] == sort10B[i + 1] == sort10B[i + 2],\n firstindex(sort10B):lastindex(sort10B) - 2)\n\nprintln(\"First 25 Ormiston triples:\")\nfor i in 1:25\n println(primes10B[ormiston_indices[i]:ormiston_indices[i]+2])\nend\nprintln(\"\\nOrmiston triples before 1 billion: \",\n count(t -> primes10B[t] < 1_000_000_000, ormiston_indices))\nprintln(\"Ormiston triples before 10 billion: \", length(ormiston_indices))\n","language":"Julia"},{"code":"import std/[algorithm, bitops, math, strformat, strutils]\n\ntype Sieve = object\n data: seq[byte]\n\nfunc `[]`(sieve: Sieve; idx: Positive): bool =\n ## Return value of element at index \"idx\".\n let idx = idx shr 1\n let iByte = idx shr 3\n let iBit = idx and 7\n result = sieve.data[iByte].testBit(iBit)\n\nfunc `[]=`(sieve: var Sieve; idx: Positive; val: bool) =\n ## Set value of element at index \"idx\".\n let idx = idx shr 1\n let iByte = idx shr 3\n let iBit = idx and 7\n if val: sieve.data[iByte].setBit(iBit)\n else: sieve.data[iByte].clearBit(iBit)\n\nfunc initSieve(lim: Positive): Sieve =\n ## Initialize a sieve from 2 to \"lim\".\n result.data = newSeq[byte]((lim + 16) shr 4)\n result[1] = true\n for n in countup(3, sqrt(lim.toFloat).int, 2):\n if not result[n]:\n for k in countup(n * n, lim, 2 * n):\n result[k] = true\n\nfunc isPrime(sieve: Sieve; n: int): bool =\n ## Return true if \"n\" is prime.\n result = if (n and 1) == 0: n == 2 else: not sieve[n]\n\nfunc nextPrime(sieve: Sieve; n: int): int =\n ## Return next prime greater than \"n\".\n result = n\n while true:\n inc result\n if sieve.isPrime(result):\n return\n\nfunc digits(n: Positive): seq[byte] =\n ## Return the sorted list of digits of \"n\".\n var n = n.Natural\n while n != 0:\n result.add byte(n mod 10)\n n = n div 10\n result.sort()\n\nproc main() =\n\n const N = 10_000_000_000\n let sieve = initSieve(N)\n\n echo \"Smallest member of the first 25 Ormiston triples:\"\n var count = 0\n var limit = N div 10\n var p1 = 2\n\n while true:\n if p1 >= limit:\n echo &\"Number of Ormiston pairs below {insertSep($limit)}: {count}\"\n limit *= 10\n if limit > N: break\n # Check p1 and p2.\n let p2 = sieve.nextPrime(p1)\n if (p2 - p1) mod 18 != 0:\n p1 = p2\n continue\n # Check p2 and p3.\n let p3 = sieve.nextPrime(p2)\n if (p3 - p2) mod 18 != 0:\n p1 = p3 # Skip p2.\n continue\n # Check p1.digits and p2.digits.\n let d1 = p1.digits\n if p2.digits != d1:\n p1 = p2\n continue\n # Check p1.digits and p3.digits.\n if p3.digits != d1:\n p1 = p3 # Skip p2.\n continue\n # Ormiston triple found.\n inc count\n if count <= 25:\n stdout.write &\"{p1:8}\"\n stdout.write if count mod 5 == 0: '\\n' else: ' '\n if count == 25: echo()\n # Try next.\n p1 = p2\n\nmain()\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse ntheory <primes vecfirstidx>;\n\nmy(@O,$pairs);\nmy @primes = @{ primes(1,1e8) };\nmy @A = map { join '', sort split '', $_ } @primes;\nfor (1..$#primes-2) { push @O, $_ if $A[$_] eq $A[$_+1] and $A[$_] eq $A[$_+2] }\n\nsay \"First 25 Ormiston triples:\";\n$pairs .= sprintf \"%8d, \", $primes[$_] for @O[0..24];\n$pairs =~ s/, $//;\nsay $pairs =~ s/.{50}\\K/\\n/gr;\n\nfor (\n [1e8, 'one hundred million'],\n [1e9, 'one billion'],\n) {\n my($limit,$text) = @$_;\n my $i = vecfirstidx { $primes[$_] >= $limit } @O;\n printf \"%3d Ormiston triples before %s\\n\", $i, $text;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Ormiston_triplets.exw\n -- ==================================\n --\n -- Uses a segmented sieve, which is about half the speed of get_primes_le(), but uses far less memory.\n -- If permited, get_primes_le(1e10) would generate a result of 455,052,511 primes, more than 32 bit\n -- can cope with, and use over 6GB of ram, and take about 11mins 44s, that is on this box at least,\n -- whereas this processes them on-the-fly, and only uses about 6MB of memory (ie 0.1% of 6GB).\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">ormiston_triplets</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">// Generate primes using the segmented sieve of Eratosthenes.\n // credit: https://gist.github.com/kimwalisch/3dc39786fab8d5b34fee</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">segment_size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">)),</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">triplen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1e9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">low</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">isprime</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">segment_size</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">primes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">multiples</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">orm25</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">low</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">limit</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sieve</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">segment_size</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Processing %,d/%,d (%3.2f%%)\\r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">low</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">,(</span><span style=\"color: #000000;\">low</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #000080;font-style:italic;\">// current segment = [low, high]</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">high</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">low</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">segment_size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">limit</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">// generate sieving primes using simple sieve of Eratosthenes</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">high</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">segment_size</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">isprime</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">segment_size</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">i</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">isprime</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">i</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000080;font-style:italic;\">// initialize sieving primes for segmented sieve</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">high</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">isprime</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">primes</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">s</span>\n <span style=\"color: #000000;\">multiples</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">low</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n\n <span style=\"color: #000080;font-style:italic;\">// sieve the current segment</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">mi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span> <span style=\"color: #008080;\">in</span> <span style=\"color: #000000;\">multiples</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">primes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">mi</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">segment_size</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">sieve</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">j</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">k</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">multiples</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">mi</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">j</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #000000;\">segment_size</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">high</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sieve</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">low</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000080;font-style:italic;\">// n is a prime</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">triplen</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">p2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #000000;\">triplen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">triplen</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- triplet found!</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">nc</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">elapsed_short</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,d Ormiston triplets before %,d (%s)\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nc</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">nc</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">orm25</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Smallest members of first 25 Ormiston triplets:\\n%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">orm25</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">-- overlapping (and leave triplen set to 2):</span>\n <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p2</span>\n <span style=\"color: #000000;\">p2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #000080;font-style:italic;\">-- (for disjoint-only just set triplen to 0)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #000000;\">triplen</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">low</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">segment_size</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">elapsed_short</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,d Ormiston triplets before %,d (%s)\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nc</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">ormiston_triplets</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">JS</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">1e8</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">1e9</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"(notonline)-->\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">WINDOWS</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">primesieve</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">(),</span> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">primesieve_next_prime</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">nc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1e9</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">orm25</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">showt</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Smallest members of first 25 Ormiston triplets:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">orm25</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">elapsed_short</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,6d Ormiston triplets before %,d (%s)\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">nc</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1e10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">p2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p1</span>\n <span style=\"color: #000000;\">p1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">primesieve_next_prime</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">s</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sprint</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">))=</span><span style=\"color: #000000;\">s</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">nc</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">showt</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">orm25</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">showt</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%,d\\r\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">showt</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"import textwrap\n\nfrom itertools import pairwise\nfrom typing import Iterator\nfrom typing import List\n\nimport primesieve\n\n\ndef primes() -> Iterator[int]:\n it = primesieve.Iterator()\n while True:\n yield it.next_prime()\n\n\ndef triplewise(iterable):\n for (a, _), (b, c) in pairwise(pairwise(iterable)):\n yield a, b, c\n\n\ndef is_anagram(a: int, b: int, c: int) -> bool:\n return sorted(str(a)) == sorted(str(b)) == sorted(str(c))\n\n\ndef up_to_one_billion() -> int:\n count = 0\n for triple in triplewise(primes()):\n if is_anagram(*triple):\n count += 1\n if triple[2] >= 1_000_000_000:\n break\n return count\n\n\ndef up_to_ten_billion() -> int:\n count = 0\n for triple in triplewise(primes()):\n if is_anagram(*triple):\n count += 1\n if triple[2] >= 10_000_000_000:\n break\n return count\n\n\ndef first_25() -> List[int]:\n rv: List[int] = []\n for triple in triplewise(primes()):\n if is_anagram(*triple):\n rv.append(triple[0])\n if len(rv) >= 25:\n break\n return rv\n\n\nif __name__ == \"__main__\":\n print(\"Smallest members of first 25 Ormiston triples:\")\n print(textwrap.fill(\" \".join(str(i) for i in first_25())), \"\\n\")\n print(up_to_one_billion(), \"Ormiston triples before 1,000,000,000\")\n print(up_to_ten_billion(), \"Ormiston triples before 10,000,000,000\")\n","language":"Python"},{"code":"use Lingua::EN::Numbers;\nuse List::Divvy;\n\nmy @primes = lazy (^∞).hyper.grep( &is-prime ).map: { $_ => .comb.sort.join };\nmy @Ormistons = @primes.kv.map: { $^value.key if $^value.value eq @primes[$^key+1].value eq @primes[$^key+2].value};\n\nsay \"First twenty-five Ormiston triples:\";\nsay @Ormistons[^25].batch(5)».join(', ').join: \"\\n\";\nsay '';\nsay +@Ormistons.&before( *[0] > $_ ) ~ \" Ormiston triples before \" ~ .Int.&cardinal for 1e8, 1e9;\n","language":"Raku"},{"code":"require 'prime'\n\ndef all_anagram?(arr)\n sorted = arr.first.digits.sort\n arr[1..].all?{|a| a.digits.sort == sorted}\nend\n\nres = Prime.each.each_cons(3).lazy.filter_map{|ar| ar.first if all_anagram?(ar)}.first(25)\nres.each_slice(5){|slice| puts slice.join(\", \")}\n\nn = 1E9\nres = Prime.each(n).each_cons(3).count {|ar| all_anagram?(ar)}\nputs \"\\nThere are #{res} Ormiston triples below #{n}\"\n","language":"Ruby"},{"code":"import \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar limit = 1e10\nvar primes = Int.segmentedSieve(limit, 128 * 1024)\nvar orm25 = []\nvar j = limit/10\nvar count = 0\nvar counts = []\nfor (i in 0...primes.count-2) {\n var p1 = primes[i]\n var p2 = primes[i+1]\n var p3 = primes[i+2]\n if ((p2 - p1) % 18 != 0 || (p3 - p2) % 18 != 0) continue\n var key1 = 1\n for (dig in Int.digits(p1)) key1 = key1 * primes[dig]\n var key2 = 1\n for (dig in Int.digits(p2)) key2 = key2 * primes[dig]\n if (key1 != key2) continue\n var key3 = 1\n for (dig in Int.digits(p3)) key3 = key3 * primes[dig]\n if (key2 == key3) {\n if (count < 25) orm25.add(p1)\n if (p1 >= j) {\n counts.add(count)\n j = j * 10\n }\n count = count + 1\n }\n}\ncounts.add(count)\nSystem.print(\"Smallest members of first 25 Ormiston triples:\")\nFmt.tprint(\"$,10d \", orm25, 5)\nSystem.print()\nj = limit/10\nfor (i in 0...counts.count) {\n Fmt.print(\"$,d Ormiston triples before $,d\", counts[i], j)\n j = j * 10\n System.print()\n}\n","language":"Wren"},{"code":"import \"./psieve\" for Primes\nimport \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar limit = 1e10\nvar digitPrimes = Int.primeSieve(30)\nvar it = Primes.iter()\nvar orm25 = []\nvar j = limit/10\nvar count = 0\nvar counts = []\nvar p1 = it.next\nvar p2 = it.next\nvar p3 = it.next\nwhile (true) {\n p1 = p2\n p2 = p3\n p3 = it.next\n if ((p2 - p1) % 18 != 0 || (p3 - p2) % 18 != 0) continue\n var key1 = 1\n for (dig in Int.digits(p1)) key1 = key1 * digitPrimes[dig]\n var key2 = 1\n for (dig in Int.digits(p2)) key2 = key2 * digitPrimes[dig]\n if (key1 != key2) continue\n var key3 = 1\n for (dig in Int.digits(p3)) key3 = key3 * digitPrimes[dig]\n if (key2 == key3) {\n if (count < 25) orm25.add(p1)\n if (p1 >= j) {\n counts.add(count)\n if (j == limit) break\n j = j * 10\n }\n count = count + 1\n }\n}\nSystem.print(\"Smallest members of first 25 Ormiston triples:\")\nFmt.tprint(\"$,10d \", orm25, 5)\nSystem.print()\nj = limit/10\nfor (i in 0...counts.count) {\n Fmt.print(\"$,d Ormiston triples before $,d\", counts[i], j)\n j = j * 10\n System.print()\n}\n","language":"Wren"},{"code":"char Sieve;\nproc MakeSieve(Size); \\Make prime number sieve\nint Size, Prime, I, K;\n[Size:= Size/2; \\ignore even numbers\nSieve:= MAlloc(Size+1); \\(XPL0's heap only provides 64 MB)\nfor I:= 0 to Size do \\set Sieve flags all true\n Sieve(I):= true;\nfor I:= 0 to Size do\n if Sieve(I) then \\found a prime, which is equal to\n [Prime:= I + I + 3; \\ twice the index + 3\n K:= I + Prime; \\first multiple to strike off\n while K <= Size do \\strike off all multiples\n [Sieve(K):= false;\n K:= K + Prime;\n ];\n ];\n];\n\nfunc GetSig(N); \\Return signature of N\n\\A \"signature\" is the count of each digit in N packed into a 32-bit word\nint N, Sig;\n[Sig:= 0;\nrepeat N:= N/10;\n Sig:= Sig + 1<<(rem(0)*3);\nuntil N = 0;\nreturn Sig;\n];\n\ndef Limit = 1_000_000_000;\nint Cnt, N, N0, N1, Sig, Sig0, Sig1;\n[MakeSieve(Limit);\nText(0, \"Smallest members of first 25 Ormiston triples:^m^j\");\nCnt:= 0; N0:= 0; N1:= 0; Sig0:= 0; Sig1:= 0; N:= 3;\nFormat(10, 0);\nloop [if Sieve(N>>1-1) then \\is prime\n [Sig:= GetSig(N);\n if Sig = Sig1 and Sig = Sig0 then\n [Cnt:= Cnt+1;\n if Cnt <= 25 then\n [RlOut(0, float(N0));\n if rem(Cnt/5) = 0 then CrLf(0);\n ];\n ];\n Sig0:= Sig1; Sig1:= Sig;\n N0:= N1; N1:= N;\n ];\n if N >= Limit then\n [IntOut(0, Cnt);\n Text(0, \" Ormiston triples before one billion.^m^j\");\n quit;\n ];\n N:= N+2;\n ];\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Ormiston_triples\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Definition\\nAn '''Ormiston triple''' is three consecutive prime numbers which are anagrams, i.e. contain the same decimal digits but in a different order.\\n\\n;Example\\nThe three consecutive primes '''(11117123, 11117213, 11117321)''' are an Ormiston triple.\\n\\n;Task \\n\\n* Find and show the smallest member of the first '''25''' Ormiston triples.\\n\\n* Find and show the '''count''' of Ormiston triples up to one billion.\\n\\n;Stretch\\n\\n* Find and show the '''count''' of Ormiston triples up to ten billion.\\n\\n;Reference\\n\\n* [[oeis:A075093 |OEIS:A075093 - Smallest member of Ormiston prime triple]]\\n \\n;Related task\\n* [[Ormiston pairs]]\\n<br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <stdbool.h>\\n#include <stdint.h>\\n#include <locale.h>\\n\\nbool *sieve(uint64_t limit) {\\n uint64_t i, p;\\n limit++;\\n // True denotes composite, false denotes prime.\\n bool *c = calloc(limit, sizeof(bool)); // all false by default\\n c[0] = true;\\n c[1] = true;\\n for (i = 4; i < limit; i += 2) c[i] = true;\\n p = 3; // Start from 3.\\n while (true) {\\n uint64_t p2 = p * p;\\n if (p2 >= limit) break;\\n for (i = p2; i < limit; i += 2 * p) c[i] = true;\\n while (true) {\\n p += 2;\\n if (!c[p]) break;\\n }\\n }\\n return c;\\n}\\n\\ntypedef struct {\\n char digs[20];\\n int count;\\n} digits;\\n\\ndigits getDigits(uint64_t n) {\\n if (n == 0) return (digits){ {0}, 1 };\\n digits d;\\n d.count = 0;\\n while (n > 0) {\\n d.digs[d.count++] = n % 10;\\n n = n / 10;\\n }\\n return d; // note digits are in reverse order\\n}\\n\\nint main() {\\n const uint64_t limit = 10000000000;\\n uint64_t i, j, pc = 0, p1, p2, p3, key1, key2, key3;\\n int k, count, count2;\\n digits d;\\n bool *c = sieve(limit);\\n for (i = 0; i < limit; ++i) {\\n if (!c[i]) ++pc;\\n }\\n uint64_t *primes = (uint64_t *)malloc(pc * sizeof(uint64_t));\\n for (i = 0, j = 0; i < limit; ++i) {\\n if (!c[i]) primes[j++] = i;\\n }\\n free(c);\\n uint64_t orm25[25];\\n int counts[2];\\n j = limit/10;\\n for (i = 0; i < pc-2; ++i) {\\n p1 = primes[i];\\n p2 = primes[i+1];\\n p3 = primes[i+2];\\n if ((p2 - p1) % 18 || (p3 - p2) % 18) continue;\\n key1 = 1;\\n d = getDigits(p1);\\n for (k = 0; k < d.count; ++k) key1 *= primes[d.digs[k]];\\n key2 = 1;\\n d = getDigits(p2);\\n for (k = 0; k < d.count; ++k) key2 *= primes[d.digs[k]];\\n if (key1 != key2) continue;\\n key3 = 1;\\n d = getDigits(p3);\\n for (k = 0; k < d.count; ++k) key3 *= primes[d.digs[k]];\\n if (key2 == key3) {\\n if (count < 25) orm25[count] = p1;\\n if (p1 >= j) {\\n counts[count2++] = count;\\n j *= 10;\\n }\\n ++count;\\n }\\n }\\n counts[count2] = count;\\n printf(\\\"Smallest members of first 25 Ormiston triples:\\\\n\\\");\\n setlocale(LC_NUMERIC, \\\"\\\");\\n for (i = 0; i < 25; ++i) {\\n printf(\\\"%'10ld \\\", orm25[i]);\\n if (!((i+1) % 5)) printf(\\\"\\\\n\\\");\\n }\\n printf(\\\"\\\\n\\\");\\n j = limit/10;\\n for (i = 0; i < 2; ++i) {\\n printf(\\\"%'d Ormiston triples before %'ld\\\\n\\\", counts[i], j);\\n j *= 10;\\n printf(\\\"\\\\n\\\");\\n }\\n free(primes);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <array>\\n#include <iostream>\\n\\n#include <primesieve.hpp>\\n\\nclass ormiston_triple_generator {\\npublic:\\n ormiston_triple_generator() {\\n for (int i = 0; i < 2; ++i) {\\n primes_[i] = pi_.next_prime();\\n digits_[i] = get_digits(primes_[i]);\\n }\\n }\\n std::array<uint64_t, 3> next_triple() {\\n for (;;) {\\n uint64_t prime = pi_.next_prime();\\n auto digits = get_digits(prime);\\n bool is_triple = digits == digits_[0] && digits == digits_[1];\\n uint64_t prime0 = primes_[0];\\n primes_[0] = primes_[1];\\n primes_[1] = prime;\\n digits_[0] = digits_[1];\\n digits_[1] = digits;\\n if (is_triple)\\n return {prime0, primes_[0], primes_[1]};\\n }\\n }\\n\\nprivate:\\n static std::array<int, 10> get_digits(uint64_t n) {\\n std::array<int, 10> result = {};\\n for (; n > 0; n /= 10)\\n ++result[n % 10];\\n return result;\\n }\\n primesieve::iterator pi_;\\n std::array<uint64_t, 2> primes_;\\n std::array<std::array<int, 10>, 2> digits_;\\n};\\n\\nint main() {\\n ormiston_triple_generator generator;\\n int count = 0;\\n std::cout << \\\"Smallest members of first 25 Ormiston triples:\\\\n\\\";\\n for (; count < 25; ++count) {\\n auto primes = generator.next_triple();\\n std::cout << primes[0] << ((count + 1) % 5 == 0 ? '\\\\n' : ' ');\\n }\\n std::cout << '\\\\n';\\n for (uint64_t limit = 1000000000; limit <= 10000000000; ++count) {\\n auto primes = generator.next_triple();\\n if (primes[2] > limit) {\\n std::cout << \\\"Number of Ormiston triples < \\\" << limit << \\\": \\\"\\n << count << '\\\\n';\\n limit *= 10;\\n }\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <vector>\\n\\nclass SegmentedPrimeIterator {\\npublic:\\n\\tSegmentedPrimeIterator(const uint64_t& aLimit) {\\n\\t\\tsquare_root = std::sqrt(aLimit);\\n\\t\\tindex = 0;\\n low = 0;\\n high = square_root;\\n small_sieve(square_root);\\n\\t}\\n\\n\\tuint64_t next() {\\n\\t\\tif ( index == primes.size() ) {\\n\\t\\t\\tindex = 0;\\n\\t\\t\\tsegmented_sieve();\\n\\t\\t}\\n\\t\\treturn primes[index++];\\n\\t}\\n\\nprivate:\\n\\tvoid segmented_sieve() {\\n\\t\\tlow += square_root;\\n\\t\\thigh += square_root;\\n\\n\\t\\tstd::vector<bool> marked_prime(square_root, true);\\n\\n\\t\\tfor ( uint64_t i = 0; i < small_primes.size(); ++i ) {\\n\\t\\t\\tuint64_t low_limit = ( low / small_primes[i] ) * small_primes[i];\\n\\t\\t\\tif ( low_limit < low ) {\\n\\t\\t\\t\\tlow_limit += small_primes[i];\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor ( uint64_t j = low_limit; j < high; j += small_primes[i] ) {\\n\\t\\t\\t\\tmarked_prime[j - low] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tprimes.clear();\\n\\t\\tfor ( uint64_t i = low; i < high; ++i ) {\\n\\t\\t\\tif ( marked_prime[i - low] ) {\\n\\t\\t\\t\\tprimes.emplace_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid small_sieve(const uint32_t& square_root) {\\n\\t\\tstd::vector<bool> marked_prime(square_root + 1, true);\\n\\n\\t\\tfor ( uint32_t p = 2; p * p <= square_root; ++p ) {\\n\\t\\t\\tif ( marked_prime[p] ) {\\n\\t\\t\\t\\tfor ( uint32_t i = p * p; i <= square_root; i += p ) {\\n\\t\\t\\t\\t\\tmarked_prime[i] = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor ( uint32_t p = 2; p <= square_root; ++p ) {\\n\\t\\t\\tif ( marked_prime[p] ) {\\n\\t\\t\\t\\tprimes.emplace_back(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsmall_primes.insert(small_primes.end(), primes.begin(), primes.end());\\n\\t}\\n\\n\\tuint32_t index, square_root;\\n\\tuint64_t low, high;\\n\\tstd::vector<uint64_t> primes;\\n\\tstd::vector<uint64_t> small_primes;\\n};\\n\\nstd::vector<uint32_t> digits(uint64_t number) {\\n\\tstd::vector<uint32_t> result;\\n\\twhile ( number > 0 ) {\\n\\t\\tresult.emplace_back(number % 10);\\n\\t\\tnumber /= 10;\\n\\t}\\n\\tstd::sort(result.begin(), result.end());\\n\\treturn result;\\n}\\n\\nbool haveSameDigits(uint64_t first, uint64_t second) {\\n\\treturn digits(first) == digits(second);\\n}\\n\\nint main() {\\n\\tconst uint64_t limit = 10'000'000'000;\\n\\tSegmentedPrimeIterator primes(limit);\\n\\tstd::vector<uint64_t> ormistons;\\n\\tuint64_t lower_limit = limit / 10;\\n\\tuint32_t count = 0;\\n\\tstd::vector<uint32_t> counts;\\n\\tuint64_t p1 = 0, p2 = 0, p3 = 0;\\n\\n\\twhile ( p3 < limit ) {\\n\\t\\tp1 = p2; p2 = p3; p3 = primes.next();\\n\\n\\t\\tif ( ( p2 - p1 ) % 18 != 0 || ( p3 - p2 ) % 18 != 0 ) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif ( ! haveSameDigits(p1, p2) ) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif ( haveSameDigits(p2, p3) ) {\\n\\t\\t\\tif ( count < 25 ) {\\n\\t\\t\\t\\tormistons.emplace_back(p1);\\n\\t\\t\\t}\\n\\t\\t\\tif ( p1 >= lower_limit ) {\\n\\t\\t\\t\\tcounts.emplace_back(count);\\n\\t\\t\\t\\tlower_limit *= 10;\\n\\t\\t\\t}\\n\\t\\t\\tcount += 1;\\n\\t\\t}\\n\\t}\\n\\tcounts.emplace_back(count);\\n\\n\\tstd::cout << \\\"The smallest member of the first 25 Ormiston triples:\\\" << std::endl;\\n\\tfor ( uint64_t i = 0; i < ormistons.size(); ++i ) {\\n\\t\\tstd::cout << std::setw(10) << ormistons[i] << ( i % 5 == 4 ? \\\"\\\\n\\\" : \\\"\\\" );\\n\\t}\\n\\tstd::cout << std::endl;\\n\\n\\tlower_limit = limit / 10;\\n\\tfor ( uint64_t i = 0; i < counts.size(); ++i ) {\\n\\t\\tstd::cout << counts[i] << \\\" Ormiston triples less than \\\" << lower_limit << std::endl;\\n\\t\\tlower_limit *= 10;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"{Bit boolean - because it stores 8 bools per bytye, it will}\\n{handle up to 16 gigabyte in a 32 bit programming environment}\\n\\ntype TBitBoolArray = class(TObject)\\n private\\n FSize: int64;\\n ByteArray: array of Byte;\\n function GetValue(Index: int64): boolean;\\n procedure WriteValue(Index: int64; const Value: boolean);\\n function GetSize: int64;\\n procedure SetSize(const Value: int64);\\n protected\\n public\\n property Value[Index: int64]: boolean read GetValue write WriteValue; default;\\n constructor Create;\\n property Count: int64 read GetSize write SetSize;\\n procedure Clear(Value: boolean);\\n end;\\n\\n\\n\\n{ TBitBoolArray }\\n\\nconst BitArray: array [0..7] of byte = ($01, $02, $04, $08, $10, $20, $40, $80);\\n\\nfunction TBitBoolArray.GetValue(Index: int64): boolean;\\nbegin\\n{Note: (Index and 7) is faster than (Index mod 8)}\\nResult:=(ByteArray[Index shr 3] and BitArray[Index and 7])<>0;\\nend;\\n\\n\\nprocedure TBitBoolArray.WriteValue(Index: int64; const Value: boolean);\\nvar Inx: int64;\\nbegin\\nInx:=Index shr 3;\\n{Note: (Index and 7) is faster than (Index mod 8)}\\nif Value then ByteArray[Inx]:=ByteArray[Inx] or BitArray[Index and 7]\\nelse ByteArray[Inx]:=ByteArray[Inx] and not BitArray[Index and 7]\\nend;\\n\\n\\nconstructor TBitBoolArray.Create;\\nbegin\\nSetLength(ByteArray,0);\\nend;\\n\\n\\nfunction TBitBoolArray.GetSize: int64;\\nbegin\\nResult:=FSize;\\nend;\\n\\n\\nprocedure TBitBoolArray.SetSize(const Value: int64);\\nvar Len: int64;\\nbegin\\nFSize:=Value;\\n{Storing 8 items per byte}\\nLen:=Value div 8;\\n{We need one more to fill partial bits}\\nif (Value mod 8)<>0 then Inc(Len);\\nSetLength(ByteArray,Len);\\nend;\\n\\n\\nprocedure TBitBoolArray.Clear(Value: boolean);\\nvar Fill: byte;\\nbegin\\nif Value then Fill:=$FF else Fill:=0;\\nFillChar(ByteArray[0],Length(ByteArray),Fill);\\nend;\\n\\n\\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++\\n\\n\\n{Sieve object the generates and holds prime values}\\n\\n{Enable this flag if you need primes past 2 billion.\\nThe flag signals the code to use bit-booleans arrays\\nwhich can contain up to 8 x 4 gigabytes = 32 gig booleans.}\\n\\n{$define BITBOOL}\\n\\ntype TPrimeSieve = class(TObject)\\n private\\n {$ifdef BITBOOL}\\n PrimeArray: TBitBoolArray;\\n {$else}\\n PrimeArray: array of boolean;\\n {$endif}\\n FArraySize: int64;\\n function GetPrime(Index: int64): boolean;\\n procedure Clear;\\n protected\\n procedure DoSieve;\\n property ArraySize: int64 read FArraySize;\\n public\\n BitBoolean: boolean;\\n constructor Create;\\n destructor Destroy; override;\\n procedure Intialize(Size: int64);\\n property Prime[Index: int64]: boolean read GetPrime; default;\\n function NextPrime(Start: int64): int64;\\n end;\\n\\n\\nprocedure TPrimeSieve.Clear;\\nbegin\\n{$ifdef BITBOOL}\\nPrimeArray.Clear(True);\\n{$else}\\nFillChar(PrimeArray[0],Length(PrimeArray),True);\\n{$endif}\\nend;\\n\\n\\n\\nconstructor TPrimeSieve.Create;\\nbegin\\n{$ifdef BITBOOL}\\nPrimeArray:=TBitBoolArray.Create;\\nBitBoolean:=True;\\n{$else}\\nBitBoolean:=False;\\n{$endif}\\nend;\\n\\n\\ndestructor TPrimeSieve.Destroy;\\nbegin\\n{$ifdef BITBOOL}\\nPrimeArray.Free;\\n{$endif}\\ninherited;\\nend;\\n\\n\\nprocedure TPrimeSieve.DoSieve;\\n{Load flags with true/false to flag that number is prime}\\n{Note: does not store even values, because except for 2, all primes are even}\\n{Starts storing flags at Index=3, so reading/writing routines compensate}\\n{Uses for-loops for boolean arrays and while-loops for bitbooleans arrays}\\n{$ifdef BITBOOL}\\nvar Offset, I, K: int64;\\n{$else}\\nvar Offset, I, K: cardinal;\\n{$endif}\\nbegin\\nClear;\\n{$ifdef BITBOOL}\\nI:=0;\\nwhile I<ArraySize do\\n{$else}\\nfor I:=0 to ArraySize-1 do\\n{$endif}\\n\\tbegin\\n\\tif PrimeArray[I] then\\n\\t\\tbegin\\n\\t\\tOffset:= I + I + 3;\\n\\t\\tK:= I + Offset;\\n\\t\\twhile K <=(ArraySize-1) do\\n\\t\\t\\tbegin\\n\\t\\t\\tPrimeArray[K]:= False;\\n\\t\\t\\tK:= K + Offset;\\n\\t\\t\\tend;\\n\\t\\tend;\\n\\t{$ifdef BITBOOL} Inc(I); {$endif}\\n\\tend;\\nend;\\n\\n\\n\\nfunction TPrimeSieve.GetPrime(Index: int64): boolean;\\n{Get a prime flag from array - compensates}\\n{ for 0,1,2 and even numbers not being stored}\\nbegin\\nif Index in [0,1,2] then Result:=True\\nelse if (Index and 1)=0 then Result:=false\\nelse Result:=PrimeArray[(Index div 2)-1];\\nend;\\n\\n\\nfunction TPrimeSieve.NextPrime(Start: int64): int64;\\n{Get next prime after Start}\\nbegin\\nResult:=Start+1;\\nwhile Result<=((ArraySize-1) * 2) do\\n\\tbegin\\n\\tif Self.Prime[Result] then break;\\n\\tInc(Result);\\n\\tend;\\nend;\\n\\n\\nprocedure TPrimeSieve.Intialize(Size: int64);\\n{Set array size and do Sieve to load flag array with}\\nbegin\\nFArraySize:=Size div 2;\\n{$ifdef BITBOOL}\\nPrimeArray.Count:=FArraySize;\\n{$else}\\nSetLength(PrimeArray,FArraySize);\\n{$endif}\\nDoSieve;\\nend;\\n\\n{-------------------------------------------------------------------------------}\\n\\n\\n\\ntype TTripleInfo = record\\n Prime1,Prime2,Prime3: int64;\\n Count: int64;\\n end;\\n\\n{Iterator for Ormiston Triple}\\n\\ntype TOrm3Iterator = class(TObject)\\n FInfo: TTripleInfo;\\n PS: TPrimeSieve;\\n private\\n function IsOrmistonTriple(P1, P2, P3: int64): boolean;\\n function EncodeNumber(N: int64): int64;\\n protected\\n public\\n procedure Reset;\\n procedure SetSize(Size: int64);\\n function GetNext(Limit: int64; var Info: TTripleInfo): boolean;\\n constructor Create;\\n destructor Destroy; override;\\n end;\\n\\n\\n\\nprocedure TOrm3Iterator.Reset;\\n{Restart iterator}\\nbegin\\nFInfo.Count:=0;\\nFInfo.Prime1:=1; FInfo.Prime2:=3; FInfo.Prime3:=5;\\nend;\\n\\n\\n\\nprocedure TOrm3Iterator.SetSize(Size: int64);\\nbegin\\nPS.Intialize(Size);\\nReset;\\nend;\\n\\n\\nconstructor TOrm3Iterator.Create;\\nbegin\\nPS:=TPrimeSieve.Create;\\n{Start with trivial prime set}\\nSetSize(100);\\nend;\\n\\n\\ndestructor TOrm3Iterator.Destroy;\\nbegin\\nPS.Free;\\ninherited;\\nend;\\n\\n\\n\\nfunction TOrm3Iterator.EncodeNumber(N: int64): int64;\\n{Encode N by counting digits 0..9 into nibbles}\\n{Get the product of the integers in a number}\\nvar T: integer;\\nconst NibMap: array [0..9] of int64 = (\\n\\t{0} $1, {1} $10, {2} $100, {3} $1000, {4} $10000, {5} $100000,\\n\\t{6} $1000000, {7} $10000000, {8} $100000000, {9} $1000000000);\\nbegin\\nResult:=0;\\nrepeat\\n\\tbegin\\n\\tT:=N mod 10;\\n\\tN:=N div 10;\\n\\tResult:=Result + NibMap[T];\\n\\tend\\nuntil N<1;\\nend;\\n\\n\\nfunction TOrm3Iterator.IsOrmistonTriple(P1,P2,P3: int64): boolean;\\nvar Pd1,Pd2,Pd3: int64;\\nbegin\\nResult:=False;\\n{Optimization - difference in primes should be multiple of 18}\\nif (((P2 - P1) mod 18)<>0) or (((p3 - p2) mod 18)<>0) then exit;\\nPd1:=EncodeNumber(P1);\\nPd2:=EncodeNumber(P2);\\nif Pd1<>Pd2 then exit;\\nPd3:=EncodeNumber(P3);\\nResult:=Pd2=Pd3;\\nend;\\n\\n\\nfunction TOrm3Iterator.GetNext(Limit: int64; var Info: TTripleInfo): boolean;\\n{Iterate to next Ormiston Pair - automatically stop at prime>Limit}\\n{Returns false if it hits limit - true if it found Next Ormiston Pair}\\nbegin\\nResult:=False;\\nwhile true do\\n\\tbegin\\n\\t{Get next set of primes}\\n\\tFInfo.Prime1:=FInfo.Prime2;\\n\\tFInfo.Prime2:=FInfo.Prime3;\\n\\tFInfo.Prime3:=PS.NextPrime(FInfo.Prime3);\\n\\t{Abort if 3rd prime is ove limit}\\n\\tif FInfo.Prime3>=Limit then break;\\n\\t{Test if it is an Ormiston triple}\\n\\tif IsOrmistonTriple(FInfo.Prime1,FInfo.Prime2,FInfo.Prime3) then\\n\\t\\tbegin\\n\\t\\t{Return info on triple}\\n\\t\\tInc(FInfo.Count);\\n\\t\\tInfo:=FInfo;\\n\\t\\tResult:=True;\\n\\t\\tbreak;\\n\\t\\tend;\\n\\tend;\\nend;\\n\\n\\nprocedure ShowOrmistonTriple(Memo: TMemo);\\nvar I: integer;\\nvar S: string;\\nvar OI: TOrm3Iterator;\\nvar Info: TTripleInfo;\\nconst Limit = 10000000000;\\nconst DisMod = Limit div 10000000;\\nconst Bill = Limit div 1000000000;\\nvar NS: string;\\n\\n\\tprocedure DisplayTitle;\\n\\tbegin\\n\\tNS:=IntToStr(Bill)+'-Billion';\\n\\tMemo.Lines.Add('====== Find Ormiston Triples ======');\\n\\tMemo.Lines.Add('First 25 plus number to '+NS);\\n\\tS:='Bit-Boolean Array: ';\\n\\tif OI.PS.BitBoolean then S:=S+'Yes' else S:=S+'No';\\n\\tMemo.Lines.Add(S);\\n\\tend;\\n\\nbegin\\n{Create iterator}\\nOI:=TOrm3Iterator.Create;\\ntry\\nDisplayTitle;\\nMemo.Lines.Add('Sieving Primes');\\nOI.SetSize(Limit);\\nMemo.Lines.Add('Finding first 25 Triples');\\n{Iterate throug 1st 25 tuples}\\nfor I:=1 to 25 do\\n\\tbegin\\n\\tOI.GetNext(High(Int64),Info);\\n\\tMemo.Lines.Add(Format('%3d - (%6D %6D %6D) ',[I,Info.Prime1,Info.Prime2,Info.Prime3]));\\n\\tend;\\nMemo.Lines.Add('Count='+IntToStr(Info.Count));\\nMemo.Lines.Add('Counting triples to '+NS);\\n{Iterate to limit number of triples}\\nwhile OI.GetNext(Limit,Info) do\\nif (Info.Count mod DisMod)=0 then Memo.Lines.Add('Count='+IntToStr(Info.Count));\\nMemo.Lines.Add(NS+'='+IntToStr(Info.Count));\\nfinally OI.Free; end;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"fastfunc isprim num .\\n if num mod 3 = 0\\n return 0\\n .\\n i = 5\\n while i <= sqrt num\\n if num mod i = 0\\n return 0\\n .\\n i += 2\\n if num mod i = 0\\n return 0\\n .\\n i += 4\\n .\\n return 1\\n.\\nfunc nextprim n .\\n repeat\\n n += 2\\n until isprim n = 1\\n .\\n return n\\n.\\nfunc digs n .\\n while n > 0\\n r += pow 10 (n mod 10)\\n n = n div 10\\n .\\n return r\\n.\\nprint \\\"Smallest member of the first 25 Ormiston triples:\\\"\\nb = 2\\na = 3\\nrepeat\\n c = b\\n dc = db\\n b = a\\n db = da\\n a = nextprim a\\n until a > 1000000000\\n da = digs a\\n if da = db and da = dc\\n cnt += 1\\n if cnt <= 25\\n write c & \\\" \\\"\\n .\\n .\\n.\\nprint \\\"Ormiston triples before 1 billion: \\\" & cnt\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// Ormiston triples. Nigel Galloway: February 3rd., 2023\\nlet oTriples n=n|>Seq.pairwise|>Seq.filter(fun((n,i),(g,l))->i=g)|>Seq.map(fun((n,i),(g,l))->(n,g,l))\\nprimes32()|>oPairs|>oTriples|>Seq.take 25|>Seq.iter(fun(n,_,_)->printf \\\"%d \\\" n); printfn \\\"\\\"\\nprintfn $\\\"<100 million: %d{primes32()|>Seq.takeWhile((>)100000000)|>oPairs|>oTriples|>Seq.length}\\\"\\nprintfn $\\\"<1 billion: %d{primes32()|>Seq.takeWhile((>)1000000000)|>oPairs|>oTriples|>Seq.length}\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"program Ormiston;\\n{$IFDEF FPC}{$MODE DELPHI} {$OPTIMIZATION ON,ALL}{$ENDIF}\\n{$IFDEF WINDOWS}{$APPLICATION CONSOLE}{$ENDIF}\\n\\nuses\\n sysutils,strUtils;\\n\\n//********* segmented sieve of erathostenes *********\\n{segmented sieve of Erathostenes using only odd numbers}\\n{using presieved sieve of small primes, to reduce the most time consuming}\\nconst\\n smlPrimes :array [0..10] of Byte = (2,3,5,7,11,13,17,19,23,29,31);\\n maxPreSievePrimeNum = 7;\\n maxPreSievePrime = 17;//smlPrimes[maxPreSievePrimeNum];\\n cSieveSize = 4*16384;//<= High(Word)+1 // Level I Data Cache\\ntype\\n tSievePrim = record\\n svdeltaPrime:word;//diff between actual and new prime\\n svSivOfs:word; //Offset in sieve\\n svSivNum:LongWord;//1 shl (1+16+32) = 5.6e14\\n end;\\n tpSievePrim = ^tSievePrim;\\n\\nvar\\n//sieved with primes 3..maxPreSievePrime.here about 255255 Byte\\n{$ALIGN 32}\\n preSieve :array[0..3*5*7*11*13*17-1] of Byte;//must be > cSieveSize\\n{$ALIGN 32}\\n Sieve :array[0..cSieveSize-1] of Byte;\\n{$ALIGN 32}\\n//prime = FoundPrimesOffset + 2*FoundPrimes[0..FoundPrimesCnt]\\n FoundPrimes : array[0..12252] of Word;\\n{$ALIGN 32}\\n sievePrimes : array[0..1077863] of tSievePrim;\\n FoundPrimesOffset : Uint64;\\n FoundPrimesCnt,\\n FoundPrimesIdx,\\n FoundPrimesTotal,\\n SieveNum,\\n SieveMaxIdx,\\n preSieveOffset,\\n LastInsertedSievePrime :NativeUInt;\\n\\nprocedure CopyPreSieveInSieve; forward;\\nprocedure CollectPrimes; forward;\\nprocedure sieveOneSieve; forward;\\nprocedure Init0Sieve; forward;\\nprocedure SieveOneBlock; forward;\\n\\nprocedure preSieveInit;\\nvar\\n i,pr,j,umf : NativeInt;\\nBegin\\n fillchar(preSieve[0],SizeOf(preSieve),#1);\\n i := 1;\\n pr := 3;// starts with pr = 3\\n umf := 1;\\n repeat\\n IF preSieve[i] =1 then\\n Begin\\n pr := 2*i+1;\\n j := i;\\n repeat\\n preSieve[j] := 0;\\n inc(j,pr);\\n until j> High(preSieve);\\n umf := umf*pr;\\n end;\\n inc(i);\\n until (pr = maxPreSievePrime)OR(umf>High(preSieve)) ;\\n preSieveOffset := 0;\\nend;\\n\\nfunction InsertSievePrimes(PrimPos:NativeInt):NativeInt;\\nvar\\n j :NativeUINt;\\n i,pr : NativeUInt;\\nbegin\\n i := 0;\\n //ignore first primes already sieved with\\n if SieveNum = 0 then\\n i := maxPreSievePrimeNum;\\n pr :=0;\\n j := Uint64(SieveNum)*cSieveSize*2-LastInsertedSievePrime;\\n with sievePrimes[PrimPos] do\\n Begin\\n pr := FoundPrimes[i]*2+1;\\n svdeltaPrime := pr+j;\\n j := pr;\\n end;\\n inc(PrimPos);\\n for i := i+1 to FoundPrimesCnt-1 do\\n Begin\\n IF PrimPos > High(sievePrimes) then\\n BREAK;\\n with sievePrimes[PrimPos] do\\n Begin\\n pr := FoundPrimes[i]*2+1;\\n svdeltaPrime := (pr-j);\\n j := pr;\\n end;\\n inc(PrimPos);\\n end;\\n LastInsertedSievePrime :=Uint64(SieveNum)*cSieveSize*2+pr;\\n result := PrimPos;\\nend;\\n\\nprocedure CalcSievePrimOfs(lmt:NativeUint);\\n//lmt High(sievePrimes)\\nvar\\n i,pr : NativeUInt;\\n sq : Uint64;\\nbegin\\n pr := 0;\\n i := 0;\\n repeat\\n with sievePrimes[i] do\\n Begin\\n pr := pr+svdeltaPrime;\\n IF sqr(pr) < (cSieveSize*2) then\\n Begin\\n svSivNum := 0;\\n svSivOfs := (pr*pr-1) DIV 2;\\n end\\n else\\n Begin\\n SieveMaxIdx := i;\\n pr := pr-svdeltaPrime;\\n BREAK;\\n end;\\n end;\\n inc(i);\\n until i > lmt;\\n\\n for i := i to lmt do\\n begin\\n with sievePrimes[i] do\\n Begin\\n pr := pr+svdeltaPrime;\\n sq := sqr(pr);\\n svSivNum := sq DIV (2*cSieveSize);\\n svSivOfs := ( (sq - Uint64(svSivNum)*(2*cSieveSize))-1)DIV 2;\\n end;\\n end;\\nend;\\n\\nprocedure sievePrimesInit;\\nvar\\n i,j,pr,PrimPos:NativeInt;\\nBegin\\n LastInsertedSievePrime := 0;\\n preSieveOffset := 0;\\n SieveNum :=0;\\n CopyPreSieveInSieve;\\n //normal sieving of first sieve\\n i := 1; // start with 3\\n repeat\\n while Sieve[i] = 0 do\\n inc(i);\\n pr := 2*i+1;\\n inc(i);\\n j := ((pr*pr)-1) DIV 2;\\n if j > High(Sieve) then\\n BREAK;\\n repeat\\n Sieve[j] := 0;\\n inc(j,pr);\\n until j > High(Sieve);\\n until false;\\n\\n CollectPrimes;\\n PrimPos := InsertSievePrimes(0);\\n LastInsertedSievePrime := FoundPrimes[PrimPos]*2+1;\\n\\n IF PrimPos < High(sievePrimes) then\\n Begin\\n Init0Sieve;\\n sieveOneBlock;\\n repeat\\n sieveOneBlock;\\n dec(SieveNum);\\n PrimPos := InsertSievePrimes(PrimPos);\\n inc(SieveNum);\\n until PrimPos > High(sievePrimes);\\n end;\\n Init0Sieve;\\nend;\\n\\nprocedure Init0Sieve;\\nbegin\\n FoundPrimesTotal :=0;\\n preSieveOffset := 0;\\n SieveNum :=0;\\n CalcSievePrimOfs(High(sievePrimes));\\nend;\\n\\nprocedure CopyPreSieveInSieve;\\nvar\\n lmt : NativeInt;\\nBegin\\n lmt := preSieveOffset+cSieveSize;\\n lmt := lmt-(High(preSieve)+1);\\n IF lmt<= 0 then\\n begin\\n Move(preSieve[preSieveOffset],Sieve[0],cSieveSize);\\n if lmt <> 0 then\\n inc(preSieveOffset,cSieveSize)\\n else\\n preSieveOffset := 0;\\n end\\n else\\n begin\\n Move(preSieve[preSieveOffset],Sieve[0],cSieveSize-lmt);\\n Move(preSieve[0],Sieve[cSieveSize-lmt],lmt);\\n preSieveOffset := lmt\\n end;\\nend;\\n\\nprocedure sieveOneSieve;\\nvar\\n sp:tpSievePrim;\\n pSieve :pByte;\\n i,j,pr,sn,dSievNum :NativeUint;\\nBegin\\n pr := 0;\\n sn := sieveNum;\\n sp := @sievePrimes[0];\\n pSieve := @Sieve[0];\\n For i := SieveMaxIdx downto 0 do\\n with sp^ do\\n begin\\n pr := pr+svdeltaPrime;\\n IF svSivNum = sn then\\n Begin\\n j := svSivOfs;\\n repeat\\n pSieve[j] := 0;\\n inc(j,pr);\\n until j > High(Sieve);\\n dSievNum := j DIV cSieveSize;\\n svSivOfs := j-dSievNum*cSieveSize;\\n svSivNum := sn+dSievNum;\\n end;\\n inc(sp);\\n end;\\n i := SieveMaxIdx+1;\\n repeat\\n if i > High(SievePrimes) then\\n BREAK;\\n with sp^ do\\n begin\\n if svSivNum > sn then\\n Begin\\n SieveMaxIdx := I-1;\\n Break;\\n end;\\n pr := pr+svdeltaPrime;\\n j := svSivOfs;\\n repeat\\n Sieve[j] := 0;\\n inc(j,pr);\\n until j > High(Sieve);\\n dSievNum := j DIV cSieveSize;\\n svSivOfs := j-dSievNum*cSieveSize;\\n svSivNum := sn+dSievNum;\\n end;\\n inc(i);\\n inc(sp);\\n until false;\\nend;\\n\\nprocedure CollectPrimes;\\n//extract primes to FoundPrimes\\nvar\\n pSieve : pbyte;\\n pFound : pWord;\\n i,idx : NativeUint;\\nBegin\\n FoundPrimesOffset := SieveNum*2*cSieveSize;\\n FoundPrimesIdx := 0;\\n pFound :=@FoundPrimes[0];\\n i := 0;\\n idx := 0;\\n IF SieveNum = 0 then\\n //include small primes used to pre-sieve\\n Begin\\n repeat\\n pFound[idx]:= (smlPrimes[idx]-1) DIV 2;\\n inc(idx);\\n until smlPrimes[idx]>maxPreSievePrime;\\n i := (smlPrimes[idx] -1) DIV 2;\\n end;\\n //grabbing the primes without if then -> reduces time extremly\\n //primes are born to let branch-prediction fail.\\n pSieve:= @Sieve[Low(Sieve)];\\n repeat\\n //store every value until a prime aka 1 is found\\n pFound[idx]:= i;\\n inc(idx,pSieve[i]);\\n inc(i);\\n until i>High(Sieve);\\n FoundPrimesCnt:= idx;\\n inc(FoundPrimesTotal,Idx);\\nend;\\n\\nprocedure SieveOneBlock;\\nbegin\\n CopyPreSieveInSieve;\\n sieveOneSieve;\\n CollectPrimes;\\n inc(SieveNum);\\nend;\\n\\nfunction Nextprime:Uint64;\\nBegin\\n result := FoundPrimes[FoundPrimesIdx]*2+1+FoundPrimesOffset;\\n if (FoundPrimesIdx=0) AND (sievenum = 1) then\\n inc(result);\\n inc(FoundPrimesIdx);\\n If FoundPrimesIdx>= FoundPrimesCnt then\\n SieveOneBlock;\\nend;\\n\\nfunction PosOfPrime: Uint64;inline;\\nBegin\\n result := FoundPrimesTotal-FoundPrimesCnt+FoundPrimesIdx;\\nend;\\n\\nfunction TotalCount :Uint64;inline;\\nbegin\\n result := FoundPrimesTotal;\\nend;\\n\\nfunction SieveSize :LongInt;inline;\\nBegin\\n result := 2*cSieveSize;\\nend;\\n\\nfunction SieveStart:Uint64;inline;\\nBegin\\n result := (SieveNum-1)*2*cSieveSize;\\nend;\\n\\nprocedure InitPrime;\\nBegin\\n Init0Sieve;\\n SieveOneBlock;\\nend;\\n//********* segmented sieve of erathostenes *********\\n\\nconst\\n Limit= 10*1000*1000*1000;\\ntype\\n tDigits10 = array[0..15] of byte;\\n td10_UsedDgts2 = array[0..3] of Uint32;\\n td10_UsedDgts3 = array[0..1] of Uint64;\\n tpd10_UsedDgts3 = ^td10_UsedDgts3;\\n\\nprocedure OutIn(cnt,p1:NativeInt);\\nBegin\\n write(Numb2USA(IntToStr(p1)):13,' ');\\n if cnt MOD 5 = 0 then\\n writeln;\\nend;\\n\\nfunction OutByPot10(cnt,prLimit:NativeInt):NativeInt;\\nBegin\\n writeln(Numb2USA(IntToStr(cnt)):12,' Ormiston triples before ',Numb2USA(IntToStr(prLimit)):14);\\n result := 10*prLimit;\\nend;\\n\\nfunction Convert2Digits10(p:NativeUint):Uint64;inline;\\nconst\\n smlPrimes : array[0..9] of integer = (2,3,5,7,11,13,17,19,23,29);\\nvar\\n r : NativeUint;\\nbegin\\n result := 1;\\n repeat\\n r := p DIV 10;\\n result := result*smlPrimes[p-10*r];\\n p := r;\\n until r = 0;\\nend;\\n{$align 32}\\nvar\\n IsMod18 : array[0..(1000 DIV 18)*18] of boolean;\\nprocedure OneRun;\\nvar\\n{$align 32}\\n p1 : Uint64;\\n pr1,pr2,pr3,prLimit :nativeUInt;\\n cnt,prCnt : NativeUint;\\nbegin\\n pr1 := 0;\\n pr2 := 0;\\n prCnt := 0;\\n prLimit := 10*1000*1000;\\n repeat\\n inc(prCnt);\\n pr3 := pr2;\\n pr2 := pr1;\\n pr1 := nextprime;\\n until pr1 > prLimit;\\n prLimit *= 10;\\n\\n cnt := 0;\\n repeat\\n inc(prCnt);\\n if IsMod18[pr2-pr3] then\\n begin\\n p1 := Convert2Digits10(pr3);\\n if Convert2Digits10(pr2) = p1 then\\n if IsMod18[pr1-pr2] then\\n begin\\n if Convert2Digits10(pr1) =p1 then\\n begin\\n inc(cnt);\\n IF cnt <= 25 then\\n OutIn(cnt,pr1);\\n end\\n end\\n end;\\n if pr1 >=prLimit then\\n prlimit:= OutByPot10(cnt,prlimit);\\n pr3 := pr2;\\n pr2 := pr1;\\n pr1 := nextprime;\\n until pr2 > limit;\\n writeln(' prime count ',prCnt);\\n writeln(' last primes ',pr3:12,pr2:12,pr1:12);\\nend;\\n\\nvar\\n j :Int32;\\nBegin\\n preSieveInit;\\n sievePrimesInit;\\n InitPrime;\\n\\n j := 0;\\n while j < High(IsMod18)do\\n Begin\\n IsMod18[j] := true;\\n j += 18;\\n end;\\n\\n OneRun;\\nend.\\n\",\n \"language\": \"Free-Pascal-Lazarus\"\n },\n {\n \"code\": \"Function GetSig(Byval N As Uinteger) As Uinteger 'Return signature of N\\n 'A \\\"signature\\\" is the count of each digit in N packed into a 32-bit word\\n Dim As Uinteger Sig = 0\\n Do While N > 0\\n Sig += 1 Shl (N Mod 10)\\n N \\\\= 10\\n Loop\\n Return Sig\\nEnd Function\\n\\nDim As Uinteger limite = 1e9\\nDim Shared As Boolean Sieve(limite)\\n\\nSub MakeSieve(Size As Uinteger) 'Make prime number sieve\\n Dim As Uinteger Prime, i, K\\n Size \\\\= 2 'ignore even numbers\\n For i = 0 To Size 'set Sieve flags all true\\n Sieve(i) = True\\n Next\\n For i = 0 To Size\\n If Sieve(i) Then 'found a prime, which is equal to\\n Prime = i * 2 + 3 ' twice the index + 3\\n K = i + Prime 'first multiple to strike off\\n While K <= Size 'strike off all multiples\\n Sieve(K) = False\\n K += Prime\\n Wend\\n End If\\n Next\\nEnd Sub\\n\\nMakeSieve(limite)\\nPrint \\\"Smallest members of first 25 Ormiston triples:\\\"\\nDim As Uinteger Cnt = 0, N0 = 0, N1 = 0, Sig0 = 0, Sig1 = 0, N = 3, Sig\\nDim As Double t0 = Timer\\nDo\\n If Sieve(N \\\\ 2 - 1) Then ' is prime\\n Sig = GetSig(N)\\n If Sig = Sig0 Andalso Sig = Sig1 Then\\n Cnt += 1\\n If Cnt <= 25 Then\\n Print Using \\\"#,###,###,###\\\"; N0;\\n If Cnt Mod 5 = 0 Then Print\\n End If\\n End If\\n Sig0 = Sig1: Sig1 = Sig\\n N0 = N1: N1 = N\\n End If\\n If N >= limite Then Print Cnt; \\\" Ormiston triples before one billion.\\\" : Exit Do\\n N += 2\\nLoop\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc main() {\\n const limit = 1e10\\n primes := rcu.Primes(limit)\\n var orm25 []int\\n j := int(1e9)\\n count := 0\\n var counts []int\\n for i := 0; i < len(primes)-2; i++ {\\n p1 := primes[i]\\n p2 := primes[i+1]\\n p3 := primes[i+2]\\n if (p2-p1)%18 != 0 || (p3-p2)%18 != 0 {\\n continue\\n }\\n key1 := 1\\n for _, dig := range rcu.Digits(p1, 10) {\\n key1 *= primes[dig]\\n }\\n key2 := 1\\n for _, dig := range rcu.Digits(p2, 10) {\\n key2 *= primes[dig]\\n }\\n if key1 != key2 {\\n continue\\n }\\n key3 := 1\\n for _, dig := range rcu.Digits(p3, 10) {\\n key3 *= primes[dig]\\n }\\n if key2 == key3 {\\n if count < 25 {\\n orm25 = append(orm25, p1)\\n }\\n if p1 >= j {\\n counts = append(counts, count)\\n j *= 10\\n }\\n count++\\n }\\n }\\n counts = append(counts, count)\\n fmt.Println(\\\"Smallest members of first 25 Ormiston triples:\\\")\\n for i := 0; i < 25; i++ {\\n fmt.Printf(\\\"%8v \\\", orm25[i])\\n if (i+1)%5 == 0 {\\n fmt.Println()\\n }\\n }\\n fmt.Println()\\n j = int(1e9)\\n for i := 0; i < len(counts); i++ {\\n fmt.Printf(\\\"%s Ormiston triples before %s\\\\n\\\", rcu.Commatize(counts[i]), rcu.Commatize(j))\\n j *= 10\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Numbers.Primes (primes)\\nimport Data.List (sort)\\n\\n\\n--------------------- ORMISTON TRIPLES -------------------\\n\\normistons :: [(Integer, Integer, Integer)]\\normistons =\\n concat $ zipWith3\\n (\\\\(dx, x) (dy, y) (dz, z)\\n -> [(x, y, z) | dx == dy && dx == dz])\\n primeDigits\\n (tail primeDigits)\\n (drop 2 primeDigits)\\n\\n\\nprimeDigits :: [(Integer, Integer)]\\nprimeDigits = ((,) =<< read . sort . show) <$> primes\\n\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain = do\\n putStrLn \\\"First 25 Ormistons:\\\"\\n mapM_ print $ take 25 ormistons\\n\\n putStrLn \\\"\\\\nCount of Ormistons up to 10^8:\\\"\\n let limit = 10^8\\n print $ length $\\n takeWhile (\\\\(_, _, c) -> c <= limit) ormistons\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" omt=: (#~ isorm) _4 p: (#~ isorm) i.&.(p:inv) 1e9\\n #omt NB. number of ormiston triples less than a billion\\n368\\n 5 5$omt NB. first prime of the first 25 triples.\\n11117123 12980783 14964017 32638213 32964341\\n33539783 35868013 44058013 46103237 48015013\\n50324237 52402783 58005239 60601237 61395239\\n74699789 76012879 78163123 80905879 81966341\\n82324237 82523017 83279783 86050781 92514341\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.Collections;\\nimport java.util.List;\\n\\npublic final class OrmistonTriples {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tfinal long limit = 10_000_000_000L;\\n\\t\\tSegmentedPrimeIterator primes = new SegmentedPrimeIterator(limit);\\n\\t\\tList<Long> ormistons = new ArrayList<Long>();\\n\\t\\tlong lowerLimit = limit / 10;\\n\\t\\tint count = 0;\\n\\t\\tList<Integer> counts = new ArrayList<Integer>();\\n\\t\\tlong p1 = 0, p2 = 0, p3 = 0;\\n\\t\\t\\n\\t\\twhile ( p3 < limit ) {\\n\\t\\t\\tp1 = p2; p2 = p3; p3 = primes.next();\\n\\t\\t\\n\\t\\t if ( ( p2 - p1 ) % 18 != 0 || ( p3 - p2 ) % 18 != 0 ) {\\n\\t\\t \\tcontinue;\\n\\t\\t }\\n\\t\\n\\t\\t if ( ! haveSameDigits(p1, p2) ) {\\n\\t\\t \\tcontinue;\\n\\t\\t }\\n\\t\\n\\t\\t if ( haveSameDigits(p2, p3) ) {\\n\\t\\t if ( count < 25 ) {\\n\\t\\t \\tormistons.add(p1);\\n\\t\\t }\\n\\t\\t if ( p1 >= lowerLimit ) {\\n\\t\\t counts.add(count);\\n\\t\\t lowerLimit *= 10;\\n\\t\\t }\\n\\t\\t count += 1;\\n\\t\\t }\\n\\t\\t}\\t\\t\\n\\t\\tcounts.add(count);\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"The smallest member of the first 25 Ormiston triples:\\\");\\n\\t\\tfor ( int i = 0; i < ormistons.size(); i++ ) {\\n\\t\\t\\tSystem.out.print(String.format(\\\"%10d%s\\\", ormistons.get(i), ( i % 5 == 4 ? \\\"\\\\n\\\" : \\\"\\\" )));\\n\\t\\t}\\n\\t\\tSystem.out.println();\\t\\t\\n\\t\\t\\n\\t\\tlowerLimit = limit / 10;\\n\\t\\tfor ( int i = 0; i < counts.size(); i++ ) {\\n\\t\\t\\tSystem.out.println(counts.get(i) + \\\" Ormiston triples less than \\\" + lowerLimit);\\n\\t\\t lowerLimit *= 10;\\n\\t\\t}\\n\\n\\t}\\t\\n \\t\\n\\tprivate static boolean haveSameDigits(long aOne, long aTwo) {\\n\\t\\treturn digits(aOne).equals(digits(aTwo));\\t\\n\\t}\\n\\t\\n\\tprivate static List<Integer> digits(long aNumber) {\\n\\t\\tList<Integer> result = new ArrayList<Integer>();\\n\\t\\twhile ( aNumber > 0 ) {\\n\\t\\t\\tresult.add((int) ( aNumber % 10 ));\\n\\t\\t\\taNumber /= 10;\\n\\t\\t}\\n\\t\\tCollections.sort(result);\\n\\t\\treturn result;\\n\\t}\\t\\n\\n}\\n\\nfinal class SegmentedPrimeIterator {\\n\\t\\n\\tpublic SegmentedPrimeIterator(long aLimit) {\\n\\t\\tsquareRoot = (int) Math.sqrt(aLimit);\\t\\n high = squareRoot;\\n smallSieve(squareRoot);\\n\\t}\\n\\t\\n\\tpublic long next() {\\n\\t\\tif ( index == primes.size() ) {\\n\\t\\t\\tindex = 0;\\n\\t\\t\\tsegmentedSieve();\\n\\t\\t} \\t\\t\\n\\t\\treturn primes.get(index++); \\t\\t\\n\\t}\\n\\n private void segmentedSieve() {\\n low += squareRoot;\\n high += squareRoot;\\t \\t\\n\\n boolean[] markedPrime = new boolean[squareRoot];\\n Arrays.fill(markedPrime, true);\\n\\n for ( int i = 0; i < smallPrimes.size(); i++ ) {\\n long lowLimit = ( low / smallPrimes.get(i) ) * smallPrimes.get(i);\\n if ( lowLimit < low ) {\\n lowLimit += smallPrimes.get(i);\\n }\\n\\n for ( long j = lowLimit; j < high; j += smallPrimes.get(i) ) {\\n markedPrime[(int) ( j - low )] = false;\\n }\\n }\\n\\n primes.clear();\\n for ( long i = low; i < high; i++ ) {\\n if ( markedPrime[(int) ( i - low )] ) {\\n \\tprimes.add(i);\\n }\\n }\\n }\\n\\n private void smallSieve(int aSquareRoot) {\\n boolean[] markedPrime = new boolean[aSquareRoot + 1];\\n Arrays.fill(markedPrime, true);\\n\\n for ( int p = 2; p * p <= aSquareRoot; p++ ) {\\n if ( markedPrime[p] ) {\\n for ( int i = p * p; i <= aSquareRoot; i += p ) {\\n markedPrime[i] = false;\\n }\\n }\\n }\\n\\n for ( int p = 2; p <= aSquareRoot; p++ ) {\\n if ( markedPrime[p] ) {\\n primes.add((long) p);\\n }\\n }\\n smallPrimes.addAll(primes);\\n }\\n\\n private static int index, squareRoot;\\n private static long low, high;\\n private static List<Long> primes = new ArrayList<Long>();\\n private static List<Long> smallPrimes = new ArrayList<Long>();\\t\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Primes\\n\\nconst dig = zeros(Int, 10)\\nconst primes10B = primes(10_000_000_000)\\nconst sort10B = map(n -> evalpoly(10, sort!(digits!(dig, n))), primes10B)\\n\\nconst ormiston_indices = filter(i -> sort10B[i] == sort10B[i + 1] == sort10B[i + 2],\\n firstindex(sort10B):lastindex(sort10B) - 2)\\n\\nprintln(\\\"First 25 Ormiston triples:\\\")\\nfor i in 1:25\\n println(primes10B[ormiston_indices[i]:ormiston_indices[i]+2])\\nend\\nprintln(\\\"\\\\nOrmiston triples before 1 billion: \\\",\\n count(t -> primes10B[t] < 1_000_000_000, ormiston_indices))\\nprintln(\\\"Ormiston triples before 10 billion: \\\", length(ormiston_indices))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import std/[algorithm, bitops, math, strformat, strutils]\\n\\ntype Sieve = object\\n data: seq[byte]\\n\\nfunc `[]`(sieve: Sieve; idx: Positive): bool =\\n ## Return value of element at index \\\"idx\\\".\\n let idx = idx shr 1\\n let iByte = idx shr 3\\n let iBit = idx and 7\\n result = sieve.data[iByte].testBit(iBit)\\n\\nfunc `[]=`(sieve: var Sieve; idx: Positive; val: bool) =\\n ## Set value of element at index \\\"idx\\\".\\n let idx = idx shr 1\\n let iByte = idx shr 3\\n let iBit = idx and 7\\n if val: sieve.data[iByte].setBit(iBit)\\n else: sieve.data[iByte].clearBit(iBit)\\n\\nfunc initSieve(lim: Positive): Sieve =\\n ## Initialize a sieve from 2 to \\\"lim\\\".\\n result.data = newSeq[byte]((lim + 16) shr 4)\\n result[1] = true\\n for n in countup(3, sqrt(lim.toFloat).int, 2):\\n if not result[n]:\\n for k in countup(n * n, lim, 2 * n):\\n result[k] = true\\n\\nfunc isPrime(sieve: Sieve; n: int): bool =\\n ## Return true if \\\"n\\\" is prime.\\n result = if (n and 1) == 0: n == 2 else: not sieve[n]\\n\\nfunc nextPrime(sieve: Sieve; n: int): int =\\n ## Return next prime greater than \\\"n\\\".\\n result = n\\n while true:\\n inc result\\n if sieve.isPrime(result):\\n return\\n\\nfunc digits(n: Positive): seq[byte] =\\n ## Return the sorted list of digits of \\\"n\\\".\\n var n = n.Natural\\n while n != 0:\\n result.add byte(n mod 10)\\n n = n div 10\\n result.sort()\\n\\nproc main() =\\n\\n const N = 10_000_000_000\\n let sieve = initSieve(N)\\n\\n echo \\\"Smallest member of the first 25 Ormiston triples:\\\"\\n var count = 0\\n var limit = N div 10\\n var p1 = 2\\n\\n while true:\\n if p1 >= limit:\\n echo &\\\"Number of Ormiston pairs below {insertSep($limit)}: {count}\\\"\\n limit *= 10\\n if limit > N: break\\n # Check p1 and p2.\\n let p2 = sieve.nextPrime(p1)\\n if (p2 - p1) mod 18 != 0:\\n p1 = p2\\n continue\\n # Check p2 and p3.\\n let p3 = sieve.nextPrime(p2)\\n if (p3 - p2) mod 18 != 0:\\n p1 = p3 # Skip p2.\\n continue\\n # Check p1.digits and p2.digits.\\n let d1 = p1.digits\\n if p2.digits != d1:\\n p1 = p2\\n continue\\n # Check p1.digits and p3.digits.\\n if p3.digits != d1:\\n p1 = p3 # Skip p2.\\n continue\\n # Ormiston triple found.\\n inc count\\n if count <= 25:\\n stdout.write &\\\"{p1:8}\\\"\\n stdout.write if count mod 5 == 0: '\\\\n' else: ' '\\n if count == 25: echo()\\n # Try next.\\n p1 = p2\\n\\nmain()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse ntheory <primes vecfirstidx>;\\n\\nmy(@O,$pairs);\\nmy @primes = @{ primes(1,1e8) };\\nmy @A = map { join '', sort split '', $_ } @primes;\\nfor (1..$#primes-2) { push @O, $_ if $A[$_] eq $A[$_+1] and $A[$_] eq $A[$_+2] }\\n\\nsay \\\"First 25 Ormiston triples:\\\";\\n$pairs .= sprintf \\\"%8d, \\\", $primes[$_] for @O[0..24];\\n$pairs =~ s/, $//;\\nsay $pairs =~ s/.{50}\\\\K/\\\\n/gr;\\n\\nfor (\\n [1e8, 'one hundred million'],\\n [1e9, 'one billion'],\\n) {\\n my($limit,$text) = @$_;\\n my $i = vecfirstidx { $primes[$_] >= $limit } @O;\\n printf \\\"%3d Ormiston triples before %s\\\\n\\\", $i, $text;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Ormiston_triplets.exw\\n -- ==================================\\n --\\n -- Uses a segmented sieve, which is about half the speed of get_primes_le(), but uses far less memory.\\n -- If permited, get_primes_le(1e10) would generate a result of 455,052,511 primes, more than 32 bit\\n -- can cope with, and use over 6GB of ram, and take about 11mins 44s, that is on this box at least,\\n -- whereas this processes them on-the-fly, and only uses about 6MB of memory (ie 0.1% of 6GB).\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">ormiston_triplets</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">// Generate primes using the segmented sieve of Eratosthenes.\\n // credit: https://gist.github.com/kimwalisch/3dc39786fab8d5b34fee</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">segment_size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">)),</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">triplen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1e9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">low</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">isprime</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">segment_size</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">primes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">multiples</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">orm25</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">low</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">limit</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sieve</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">segment_size</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Processing %,d/%,d (%3.2f%%)\\\\r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">low</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">,(</span><span style=\\\"color: #000000;\\\">low</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// current segment = [low, high]</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">high</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">low</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">segment_size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">limit</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">// generate sieving primes using simple sieve of Eratosthenes</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">high</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">segment_size</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">isprime</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">segment_size</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">isprime</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">i</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// initialize sieving primes for segmented sieve</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">high</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">isprime</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">primes</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #000000;\\\">multiples</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">low</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">// sieve the current segment</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">mi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #008080;\\\">in</span> <span style=\\\"color: #000000;\\\">multiples</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">primes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">mi</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">segment_size</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">sieve</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">k</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">multiples</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">mi</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">j</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #000000;\\\">segment_size</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">high</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sieve</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">low</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000080;font-style:italic;\\\">// n is a prime</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">triplen</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">p2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #000000;\\\">triplen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">triplen</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- triplet found!</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">elapsed_short</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,d Ormiston triplets before %,d (%s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nc</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">orm25</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Smallest members of first 25 Ormiston triplets:\\\\n%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">orm25</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- overlapping (and leave triplen set to 2):</span>\\n <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p2</span>\\n <span style=\\\"color: #000000;\\\">p2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (for disjoint-only just set triplen to 0)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #000000;\\\">triplen</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">low</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">segment_size</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">elapsed_short</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,d Ormiston triplets before %,d (%s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nc</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">ormiston_triplets</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">JS</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">1e8</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">1e9</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">WINDOWS</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">primesieve</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">(),</span> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">primesieve_next_prime</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1e9</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">orm25</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">showt</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Smallest members of first 25 Ormiston triplets:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">orm25</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">elapsed_short</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,6d Ormiston triplets before %,d (%s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1e10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">p2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p1</span>\\n <span style=\\\"color: #000000;\\\">p1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">primesieve_next_prime</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">s</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sprint</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">))=</span><span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">nc</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">showt</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">orm25</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">showt</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%,d\\\\r\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">showt</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import textwrap\\n\\nfrom itertools import pairwise\\nfrom typing import Iterator\\nfrom typing import List\\n\\nimport primesieve\\n\\n\\ndef primes() -> Iterator[int]:\\n it = primesieve.Iterator()\\n while True:\\n yield it.next_prime()\\n\\n\\ndef triplewise(iterable):\\n for (a, _), (b, c) in pairwise(pairwise(iterable)):\\n yield a, b, c\\n\\n\\ndef is_anagram(a: int, b: int, c: int) -> bool:\\n return sorted(str(a)) == sorted(str(b)) == sorted(str(c))\\n\\n\\ndef up_to_one_billion() -> int:\\n count = 0\\n for triple in triplewise(primes()):\\n if is_anagram(*triple):\\n count += 1\\n if triple[2] >= 1_000_000_000:\\n break\\n return count\\n\\n\\ndef up_to_ten_billion() -> int:\\n count = 0\\n for triple in triplewise(primes()):\\n if is_anagram(*triple):\\n count += 1\\n if triple[2] >= 10_000_000_000:\\n break\\n return count\\n\\n\\ndef first_25() -> List[int]:\\n rv: List[int] = []\\n for triple in triplewise(primes()):\\n if is_anagram(*triple):\\n rv.append(triple[0])\\n if len(rv) >= 25:\\n break\\n return rv\\n\\n\\nif __name__ == \\\"__main__\\\":\\n print(\\\"Smallest members of first 25 Ormiston triples:\\\")\\n print(textwrap.fill(\\\" \\\".join(str(i) for i in first_25())), \\\"\\\\n\\\")\\n print(up_to_one_billion(), \\\"Ormiston triples before 1,000,000,000\\\")\\n print(up_to_ten_billion(), \\\"Ormiston triples before 10,000,000,000\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"use Lingua::EN::Numbers;\\nuse List::Divvy;\\n\\nmy @primes = lazy (^∞).hyper.grep( &is-prime ).map: { $_ => .comb.sort.join };\\nmy @Ormistons = @primes.kv.map: { $^value.key if $^value.value eq @primes[$^key+1].value eq @primes[$^key+2].value};\\n\\nsay \\\"First twenty-five Ormiston triples:\\\";\\nsay @Ormistons[^25].batch(5)».join(', ').join: \\\"\\\\n\\\";\\nsay '';\\nsay +@Ormistons.&before( *[0] > $_ ) ~ \\\" Ormiston triples before \\\" ~ .Int.&cardinal for 1e8, 1e9;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"require 'prime'\\n\\ndef all_anagram?(arr)\\n sorted = arr.first.digits.sort\\n arr[1..].all?{|a| a.digits.sort == sorted}\\nend\\n\\nres = Prime.each.each_cons(3).lazy.filter_map{|ar| ar.first if all_anagram?(ar)}.first(25)\\nres.each_slice(5){|slice| puts slice.join(\\\", \\\")}\\n\\nn = 1E9\\nres = Prime.each(n).each_cons(3).count {|ar| all_anagram?(ar)}\\nputs \\\"\\\\nThere are #{res} Ormiston triples below #{n}\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar limit = 1e10\\nvar primes = Int.segmentedSieve(limit, 128 * 1024)\\nvar orm25 = []\\nvar j = limit/10\\nvar count = 0\\nvar counts = []\\nfor (i in 0...primes.count-2) {\\n var p1 = primes[i]\\n var p2 = primes[i+1]\\n var p3 = primes[i+2]\\n if ((p2 - p1) % 18 != 0 || (p3 - p2) % 18 != 0) continue\\n var key1 = 1\\n for (dig in Int.digits(p1)) key1 = key1 * primes[dig]\\n var key2 = 1\\n for (dig in Int.digits(p2)) key2 = key2 * primes[dig]\\n if (key1 != key2) continue\\n var key3 = 1\\n for (dig in Int.digits(p3)) key3 = key3 * primes[dig]\\n if (key2 == key3) {\\n if (count < 25) orm25.add(p1)\\n if (p1 >= j) {\\n counts.add(count)\\n j = j * 10\\n }\\n count = count + 1\\n }\\n}\\ncounts.add(count)\\nSystem.print(\\\"Smallest members of first 25 Ormiston triples:\\\")\\nFmt.tprint(\\\"$,10d \\\", orm25, 5)\\nSystem.print()\\nj = limit/10\\nfor (i in 0...counts.count) {\\n Fmt.print(\\\"$,d Ormiston triples before $,d\\\", counts[i], j)\\n j = j * 10\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./psieve\\\" for Primes\\nimport \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar limit = 1e10\\nvar digitPrimes = Int.primeSieve(30)\\nvar it = Primes.iter()\\nvar orm25 = []\\nvar j = limit/10\\nvar count = 0\\nvar counts = []\\nvar p1 = it.next\\nvar p2 = it.next\\nvar p3 = it.next\\nwhile (true) {\\n p1 = p2\\n p2 = p3\\n p3 = it.next\\n if ((p2 - p1) % 18 != 0 || (p3 - p2) % 18 != 0) continue\\n var key1 = 1\\n for (dig in Int.digits(p1)) key1 = key1 * digitPrimes[dig]\\n var key2 = 1\\n for (dig in Int.digits(p2)) key2 = key2 * digitPrimes[dig]\\n if (key1 != key2) continue\\n var key3 = 1\\n for (dig in Int.digits(p3)) key3 = key3 * digitPrimes[dig]\\n if (key2 == key3) {\\n if (count < 25) orm25.add(p1)\\n if (p1 >= j) {\\n counts.add(count)\\n if (j == limit) break\\n j = j * 10\\n }\\n count = count + 1\\n }\\n}\\nSystem.print(\\\"Smallest members of first 25 Ormiston triples:\\\")\\nFmt.tprint(\\\"$,10d \\\", orm25, 5)\\nSystem.print()\\nj = limit/10\\nfor (i in 0...counts.count) {\\n Fmt.print(\\\"$,d Ormiston triples before $,d\\\", counts[i], j)\\n j = j * 10\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"char Sieve;\\nproc MakeSieve(Size); \\\\Make prime number sieve\\nint Size, Prime, I, K;\\n[Size:= Size/2; \\\\ignore even numbers\\nSieve:= MAlloc(Size+1); \\\\(XPL0's heap only provides 64 MB)\\nfor I:= 0 to Size do \\\\set Sieve flags all true\\n Sieve(I):= true;\\nfor I:= 0 to Size do\\n if Sieve(I) then \\\\found a prime, which is equal to\\n [Prime:= I + I + 3; \\\\ twice the index + 3\\n K:= I + Prime; \\\\first multiple to strike off\\n while K <= Size do \\\\strike off all multiples\\n [Sieve(K):= false;\\n K:= K + Prime;\\n ];\\n ];\\n];\\n\\nfunc GetSig(N); \\\\Return signature of N\\n\\\\A \\\"signature\\\" is the count of each digit in N packed into a 32-bit word\\nint N, Sig;\\n[Sig:= 0;\\nrepeat N:= N/10;\\n Sig:= Sig + 1<<(rem(0)*3);\\nuntil N = 0;\\nreturn Sig;\\n];\\n\\ndef Limit = 1_000_000_000;\\nint Cnt, N, N0, N1, Sig, Sig0, Sig1;\\n[MakeSieve(Limit);\\nText(0, \\\"Smallest members of first 25 Ormiston triples:^m^j\\\");\\nCnt:= 0; N0:= 0; N1:= 0; Sig0:= 0; Sig1:= 0; N:= 3;\\nFormat(10, 0);\\nloop [if Sieve(N>>1-1) then \\\\is prime\\n [Sig:= GetSig(N);\\n if Sig = Sig1 and Sig = Sig0 then\\n [Cnt:= Cnt+1;\\n if Cnt <= 25 then\\n [RlOut(0, float(N0));\\n if rem(Cnt/5) = 0 then CrLf(0);\\n ];\\n ];\\n Sig0:= Sig1; Sig1:= Sig;\\n N0:= N1; N1:= N;\\n ];\\n if N >= Limit then\\n [IntOut(0, Cnt);\\n Text(0, \\\" Ormiston triples before one billion.^m^j\\\");\\n quit;\\n ];\\n N:= N+2;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Ormiston-triples"}}},{"rowIdx":1472,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/P-Adic_numbers,_basic\nnote: mathematics\n","language":"00-META"},{"code":";Conversion and addition of [[wp:P-adic_number|p-adic Numbers]].\n\n\n;Task.\n\nConvert two rationals to p-adic numbers and add them up.\nRational reconstruction is needed to interpret the result.\n\np-Adic numbers were introduced around 1900 by Hensel. p-Adic expansions\n(a series of digits 0 ≤ d < p times p-power weights)\nare finite-tailed and tend to zero in the direction of higher positive\npowers of p (to the left in the notation used here).\nFor example, the number 4 (100.0) has ''smaller'' 2-adic norm than 1/4 (0.01).\n\nIf we convert a natural number, the familiar p-ary expansion is obtained:\n10 decimal is 1010 both binary and 2-adic. To convert a rational number a/b\nwe perform p-adic long division. If p is actually prime, this is always possible\nif first the 'p-part' is removed from b (and the p-adic point shifted accordingly).\nThe inverse of b modulo p is then used in the conversion.\n\n'''Recipe:''' at each step the most significant digit of the partial remainder\n(initially a) is zeroed by subtracting a proper multiple of the divisor b.\nShift out the zero digit (divide by p) and repeat until the remainder is zero\nor the precision limit is reached. Because p-adic division starts from the right,\nthe 'proper multiplier' is simply\nd = partial remainder * 1/b (mod p).\nThe d's are the successive p-adic digits to find.\n\nAddition proceeds as usual, with carry from the right to the leftmost term,\nwhere it has least magnitude and just drops off. We can work with approximate rationals\nand obtain exact results. The routine for rational reconstruction demonstrates this:\nrepeatedly add a p-adic to itself (keeping count to determine the denominator),\nuntil an integer is reached (the numerator then equals the weighted digit sum).\nBut even p-adic arithmetic fails if the precision is too low. The examples mostly\nset the shortest prime-exponent combinations that allow valid reconstruction.\n\n\n;Related task.\n\n[[p-Adic square roots]]\n\n\n;Reference.\n\n[https://www.cut-the-knot.org/blue/p-adicExpansion.shtml] p-Adic expansions\n\n\n__TOC__\n\n\n","language":"00-TASK"},{"code":"#include <cmath>\n#include <cstdint>\n#include <iostream>\n#include <numeric>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nclass Rational {\npublic:\n\tRational(const int32_t& aNumerator, const int32_t& aDenominator) {\n\t\tif ( aDenominator < 0 ) {\n\t\t\tnumerator = -aNumerator;\n\t\t\tdenominator = -aDenominator;\n\t\t} else {\n\t\t\tnumerator = aNumerator;\n\t\t\tdenominator = aDenominator;\n\t\t}\n\n\t\tif ( aNumerator == 0 ) {\n\t\t\tdenominator = 1;\n\t\t}\n\n\t\tconst uint32_t divisor = std::gcd(numerator, denominator);\n\t\tnumerator /= divisor;\n\t\tdenominator /= divisor;\n\t}\n\n\tstd::string to_string() const {\n\t\treturn std::to_string(numerator) + \" / \" + std::to_string(denominator);\n\t}\n\nprivate:\n\tint32_t numerator;\n\tint32_t denominator;\n};\n\nclass P_adic {\npublic:\n\t// Create a P-adic number, with p = 'prime', from the given rational 'numerator' / 'denominator'.\n\tP_adic(const uint32_t& prime, int32_t numerator, int32_t denominator) : prime(prime) {\n\t\tif ( denominator == 0 ) {\n\t\t\tstd::invalid_argument(\"Denominator cannot be zero\");\n\t\t}\n\n\t\torder = 0;\n\n\t\t// Process rational zero\n\t\tif ( numerator == 0 ) {\n\t\t\torder = ORDER_MAX;\n\t\t\treturn;\n\t\t}\n\n\t\t// Remove multiples of 'prime' and adjust the order of the P-adic number accordingly\n\t\twhile ( modulo_prime(numerator) == 0 ) {\n\t\t\tnumerator /= static_cast<int32_t>(prime);\n\t\t\torder += 1;\n\t\t}\n\n\t\twhile ( modulo_prime(denominator) == 0 ) {\n\t\t\tdenominator /= static_cast<int32_t>(prime);\n\t\t\torder -= 1;\n\t\t}\n\n\t\t// Standard calculation of P-adic digits\n\t\tconst uint64_t inverse = modulo_inverse(denominator);\n\t\twhile ( digits.size() < DIGITS_SIZE ) {\n\t\t\tconst uint32_t digit = modulo_prime(numerator * inverse);\n\t\t\tdigits.emplace_back(digit);\n\n\t\t\tnumerator -= digit * denominator;\n\n\t\t\tif ( numerator != 0 ) {\n\t\t\t// The denominator is not a power of a prime\n\t\t\t\tuint32_t count = 0;\n\t\t\t\twhile ( modulo_prime(numerator) == 0 ) {\n\t\t\t\t\tnumerator /= static_cast<int32_t>(prime);\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\n\t\t\t\tfor ( uint32_t i = count; i > 1; --i ) {\n\t\t\t\t\tdigits.emplace_back(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return the sum of this P-adic number with the given P-adic number.\n\tP_adic add(P_adic other) {\n\t\tif ( prime != other.prime ) {\n\t\t\tstd::invalid_argument(\"Cannot add p-adic's with different primes\");\n\t\t}\n\n\t\tstd::vector<uint32_t> this_digits = digits;\n\t\tstd::vector<uint32_t> other_digits = other.digits;\n\t\tstd::vector<uint32_t> result;\n\n\t\t// Adjust the digits so that the P-adic points are aligned\n\t\tfor ( int32_t i = 0; i < -order + other.order; ++i ) {\n\t\t\tother_digits.insert(other_digits.begin(), 0);\n\t\t}\n\n\t\tfor ( int32_t i = 0; i < -other.order + order; ++i ) {\n\t\t\tthis_digits.insert(this_digits.begin(), 0);\n\t\t}\n\n\t\t// Standard digit by digit addition\n\t\tuint32_t carry = 0;\n\t\tfor ( uint32_t i = 0; i < std::min(this_digits.size(), other_digits.size()); ++i ) {\n\t\t\tconst uint32_t sum = this_digits[i] + other_digits[i] + carry;\n\t\t\tconst uint32_t remainder = sum % prime;\n\t\t\tcarry = ( sum >= prime ) ? 1 : 0;\n\t\t\tresult.emplace_back(remainder);\n\t\t}\n\n\t\treturn P_adic(prime, result, all_zero_digits(result) ? ORDER_MAX : std::min(order, other.order));\n\t}\n\n\t// Return the Rational representation of this P-adic number.\n\tRational convert_to_rational() {\n\t\tstd::vector<uint32_t> numbers = digits;\n\n\t\t// Zero\n\t\tif ( all_zero_digits(numbers) ) {\n\t\t\treturn Rational(1, 0);\n\t\t}\n\n\t\t// Positive integer\n\t\tif ( order >= 0 && ends_with(numbers, 0) ) {\n\t\t\tfor ( int32_t i = 0; i < order; ++i ) {\n\t\t\t\tnumbers.emplace(numbers.begin(), 0);\n\t\t\t}\n\n\t\t\treturn Rational(convert_to_decimal(numbers), 1);\n\t\t}\n\n\t\t// Negative integer\n\t\tif ( order >= 0 && ends_with(numbers, prime - 1) ) {\n\t\t\tnegate_digits(numbers);\n\t\t\tfor ( int32_t i = 0; i < order; ++i ) {\n\t\t\t\tnumbers.emplace(numbers.begin(), 0);\n\t\t\t}\n\n\t\t\treturn Rational(-convert_to_decimal(numbers), 1);\n\t\t}\n\n\t\t// Rational\n\t\tconst P_adic copy(prime, digits, order);\n\t\tP_adic sum(prime, digits, order);\n\t\tint32_t denominator = 1;\n\t\tdo {\n\t\t\tsum = sum.add(copy);\n\t\t\tdenominator += 1;\n\t\t} while ( ! ( ends_with(sum.digits, 0) || ends_with(sum.digits, prime - 1) ) );\n\n\t\tconst bool negative = ends_with(sum.digits, 6);\n\t\tif ( negative ) {\n\t\t\tnegate_digits(sum.digits);\n\t\t}\n\n\t\tint32_t numerator = negative ? -convert_to_decimal(sum.digits) : convert_to_decimal(sum.digits);\n\n\t\tif ( order > 0 ) {\n\t\t\tnumerator *= std::pow(prime, order);\n\t\t}\n\n\t\tif ( order < 0 ) {\n\t\t\tdenominator *= std::pow(prime, -order);\n\t\t}\n\n\t\treturn Rational(numerator, denominator);\n\t}\n\n\t// Return a string representation of this p-adic.\n\tstd::string to_string() {\n\t\twhile ( digits.size() > PRECISION ) {\n\t\t\tdigits.pop_back();\n\t\t}\n\t\tpad_with_zeros(digits);\n\n\t\tstd::string result = \"\";\n\t\tfor ( int64_t i = digits.size() - 1; i >= 0; --i ) {\n\t\t\tresult += std::to_string(digits[i]);\n\t\t}\n\n\t\tif ( order >= 0 ) {\n\t\t\tfor ( int32_t i = 0; i < order; ++i ) {\n\t\t\t\tresult += \"0\";\n\t\t\t\tresult.erase(result.begin());\n\t\t\t}\n\n\t\t\tresult += \".0\";\n\t\t} else {\n\t\t\tresult.insert(result.length() + order, \".\");\n\t\t}\n\n\t\treturn \" ...\" + result;\n\t}\n\nprivate:\n\t/**\n\t * Create a P-adic, with p = 'prime', directly from a vector of digits.\n\t *\n\t * With 'order' = 0, the vector [1, 2, 3, 4, 5] creates the p-adic ...54321.0\n\t * 'order' > 0 shifts the vector 'order' places to the left and\n\t * 'order' < 0 shifts the vector 'order' places to the right.\n\t */\n\tP_adic(const uint32_t& prime, const std::vector<uint32_t>& digits, const int32_t& order)\n\t\t: prime(prime), digits(digits), order(order) {\n\t}\n\n\t// Transform the given vector of digits representing a p-adic number\n\t// into a vector which represents the negation of the p-adic number.\n\tvoid negate_digits(std::vector<uint32_t> numbers) {\n\t\tnumbers[0] = ( prime - numbers[0] ) % prime;\n\t\tfor ( uint64_t i = 1; i < numbers.size(); ++i ) {\n\t\t\tnumbers[i] = prime - 1 - numbers[i];\n\t\t}\n\t}\n\n\t// Return the multiplicative inverse of the given number modulo 'prime'.\n\tuint32_t modulo_inverse(const uint32_t& number) const {\n\t\tuint32_t inverse = 1;\n\t\twhile ( ( inverse * number ) % prime != 1 ) {\n\t\t\tinverse += 1;\n\t\t}\n\t\treturn inverse;\n\t}\n\n\t// Return the given number modulo 'prime' in the range 0..'prime' - 1.\n\tint32_t modulo_prime(const int64_t& number) const {\n\t\tconst int32_t div = static_cast<int32_t>(number % prime);\n\t\treturn ( div >= 0 ) ? div : div + prime;\n\t}\n\n\t// The given vector is padded on the right by zeros up to a maximum length of 'PRECISION'.\n\tvoid pad_with_zeros(std::vector<uint32_t> vector) {\n\t\twhile ( vector.size() < PRECISION ) {\n\t\t\tvector.emplace_back(0);\n\t\t}\n\t}\n\n\t// Return the given vector of base 'prime' integers converted to a decimal integer.\n\tuint32_t convert_to_decimal(const std::vector<uint32_t>& numbers) const {\n\t\tuint32_t decimal = 0;\n\t\tuint32_t multiple = 1;\n\t\tfor ( const uint32_t& number : numbers ) {\n\t\t\tdecimal += number * multiple;\n\t\t\tmultiple *= prime;\n\t\t}\n\t\treturn decimal;\n\t}\n\n\t// Return whether the given vector consists of all zeros.\n\tbool all_zero_digits(const std::vector<uint32_t>& numbers) const {\n\t\tfor ( uint32_t number : numbers ) {\n\t\t\tif ( number != 0 ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t// Return whether the given vector ends with multiple instances of the given number.\n\tbool ends_with(const std::vector<uint32_t>& numbers, const uint32_t& number) const {\n\t\tfor ( uint64_t i = numbers.size() - 1; i >= numbers.size() - PRECISION / 2; --i ) {\n\t\t\tif ( numbers[i] != number ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\tuint32_t prime;\n\tstd::vector<uint32_t> digits;\n\tint32_t order;\n\n\tstatic const uint32_t PRECISION = 40;\n\tstatic const uint32_t ORDER_MAX = 1'000;\n\tstatic const uint32_t DIGITS_SIZE = PRECISION + 5;\n};\n\nint main() {\n\tstd::cout << \"3-adic numbers:\" << std::endl;\n\tP_adic padic_one(3, -2, 87);\n\tstd::cout << \"-2 / 87 => \" << padic_one.to_string() << std::endl;\n\tP_adic padic_two(3, 4, 97);\n\tstd::cout << \"4 / 97 => \" << padic_two.to_string() << std::endl;\n\n\tP_adic sum = padic_one.add(padic_two);\n\tstd::cout << \"sum => \" << sum.to_string() << std::endl;\n\tstd::cout << \"Rational = \" << sum.convert_to_rational().to_string() << std::endl;\n\tstd::cout << std::endl;\n\n\tstd::cout << \"7-adic numbers:\" << std::endl;\n\tpadic_one = P_adic(7, 5, 8);\n\tstd::cout << \"5 / 8 => \" << padic_one.to_string() << std::endl;\n\tpadic_two = P_adic(7, 353, 30809);\n\tstd::cout << \"353 / 30809 => \" << padic_two.to_string() << std::endl;\n\n\tsum = padic_one.add(padic_two);\n\tstd::cout << \"sum => \" << sum.to_string() << std::endl;\n\tstd::cout << \"Rational = \" << sum.convert_to_rational().to_string() << std::endl;\n\tstd::cout << std::endl;\n}\n","language":"C++"},{"code":"' ***********************************************\n'subject: convert two rationals to p-adic numbers,\n' add them up and show the result.\n'tested : FreeBasic 1.07.0\n\n\n'you can change this:\n\nconst emx = 64\n'exponent maximum\n\nconst dmx = 100000\n'approximation loop maximum\n\n\n'better not change\n'------------------------------------------------\nconst amx = 1048576\n'argument maximum\n\nconst Pmax = 32749\n'max. prime < 2^15\n\n\ntype ratio\n as longint a, b\nend type\n\ntype padic\ndeclare function r2pa (byref q as ratio, byval sw as integer) as integer\n'convert q = a/b to p-adic number, set sw to print\ndeclare sub printf (byval sw as integer)\n'print expansion, set sw to print rational\ndeclare sub crat ()\n'rational reconstruction\n\ndeclare sub add (byref a as padic, byref b as padic)\n'let self:= a + b\ndeclare sub cmpt (byref a as padic)\n'let self:= complement_a\n\ndeclare function dsum () as long\n'weighted digit sum\n\n as long d(-emx to emx - 1)\n as integer v\nend type\n\n\n'global variables\ndim shared as long p1, p = 7\n'default prime\ndim shared as integer k = 11\n'precision\n\n#define min(a, b) iif((a) > (b), b, a)\n\n\n'------------------------------------------------\n'convert rational a/b to p-adic number\nfunction padic.r2pa (byref q as ratio, byval sw as integer) as integer\ndim as longint a = q.a, b = q.b\ndim as long r, s, b1\ndim i as integer\nr2pa = 0\n\n if b = 0 then return 1\n if b < 0 then b = -b: a = -a\n if abs(a) > amx or b > amx then return -1\n if p < 2 or k < 1 then return 1\n\n 'max. short prime\n p = min(p, Pmax)\n 'max. array length\n k = min(k, emx - 1)\n\n if sw then\n 'echo numerator, denominator,\n print a;\"/\";str(b);\" + \";\n 'prime and precision\n print \"O(\";str(p);\"^\";str(k);\")\"\n end if\n\n 'initialize\n v = 0\n p1 = p - 1\n for i = -emx to emx - 1\n d(i) = 0: next\n\n if a = 0 then return 0\n\n i = 0\n 'find -exponent of p in b\n do until b mod p\n b \\= p: i -= 1\n loop\n\n s = 0\n r = b mod p\n 'modular inverse for small p\n for b1 = 1 to p1\n s += r\n if s > p1 then s -= p\n if s = 1 then exit for\n next b1\n\n if b1 = p then\n print \"r2pa: impossible inverse mod\"\n return -1\n end if\n\n v = emx\n do\n 'find exponent of p in a\n do until a mod p\n a \\= p: i += 1\n loop\n\n 'valuation\n if v = emx then v = i\n\n 'upper bound\n if i >= emx then exit do\n 'check precision\n if (i - v) > k then exit do\n\n 'next digit\n d(i) = a * b1 mod p\n if d(i) < 0 then d(i) += p\n\n 'remainder - digit * divisor\n a -= d(i) * b\n loop while a\nend function\n\n'------------------------------------------------\n'Horner's rule\nfunction padic.dsum () as long\ndim as integer i, t = min(v, 0)\ndim as long r, s = 0\n\n for i = k - 1 + t to t step -1\n r = s: s *= p\n if r andalso s \\ r - p then\n 'overflow\n s = -1: exit for\n end if\n s += d(i)\n next i\n\nreturn s\nend function\n\n#macro pint(cp)\n for j = k - 1 + v to v step -1\n if cp then exit for\n next j\n fl = ((j - v) shl 1) < k\n#endmacro\n\n'rational reconstruction\nsub padic.crat ()\ndim as integer i, j, fl\ndim as padic s = this\ndim as long x, y\n\n 'denominator count\n for i = 1 to dmx\n 'check for integer\n pint(s.d(j))\n if fl then fl = 0: exit for\n\n 'check negative integer\n pint(p1 - s.d(j))\n if fl then exit for\n\n 'repeatedly add self to s\n s.add(s, this)\n next i\n\n if fl then s.cmpt(s)\n\n 'numerator: weighted digit sum\n x = s.dsum: y = i\n\n if x < 0 or y > dmx then\n print \"crat: fail\"\n\n else\n 'negative powers\n for i = v to -1\n y *= p: next\n\n 'negative rational\n if fl then x = -x\n\n print x;\n if y > 1 then print \"/\";str(y);\n print\n end if\nend sub\n\n\n'print expansion\nsub padic.printf (byval sw as integer)\ndim as integer i, t = min(v, 0)\n\n for i = k - 1 + t to t step -1\n print d(i);\n if i = 0 andalso v < 0 then print \".\";\n next i\n print\n\n 'rational approximation\n if sw then crat\nend sub\n\n'------------------------------------------------\n'carry\n#macro cstep(dt)\n if c > p1 then\n dt = c - p: c = 1\n else\n dt = c: c = 0\n end if\n#endmacro\n\n'let self:= a + b\nsub padic.add (byref a as padic, byref b as padic)\ndim i as integer, r as padic\ndim as long c = 0\nwith r\n .v = min(a.v, b.v)\n\n for i = .v to k +.v\n c += a.d(i) + b.d(i)\n cstep(.d(i))\n next i\nend with\nthis = r\nend sub\n\n'let self:= complement_a\nsub padic.cmpt (byref a as padic)\ndim i as integer, r as padic\ndim as long c = 1\nwith r\n .v = a.v\n\n for i = .v to k +.v\n c += p1 - a.d(i)\n cstep(.d(i))\n next i\nend with\nthis = r\nend sub\n\n\n'main\n'------------------------------------------------\ndim as integer sw\ndim as padic a, b, c\ndim q as ratio\n\nwidth 64, 30\ncls\n\n'rational reconstruction\n'depends on the precision -\n'until the dsum-loop overflows.\ndata 2,1, 2,4\ndata 1,1\n\ndata 4,1, 2,4\ndata 3,1\n\ndata 4,1, 2,5\ndata 3,1\n\n' 4/9 + O(5^4)\ndata 4,9, 5,4\ndata 8,9\n\ndata 26,25, 5,4\ndata -109,125\n\ndata 49,2, 7,6\ndata -4851,2\n\ndata -9,5, 3,8\ndata 27,7\n\ndata 5,19, 2,12\ndata -101,384\n\n'two 'decadic' pairs\ndata 2,7, 10,7\ndata -1,7\n\ndata 34,21, 10,9\ndata -39034,791\n\n'familiar digits\ndata 11,4, 2,43\ndata 679001,207\n\ndata -8,9, 23,9\ndata 302113,92\n\ndata -22,7, 3,23\ndata 46071,379\n\ndata -22,7, 32749,3\ndata 46071,379\n\ndata 35,61, 5,20\ndata 9400,109\n\ndata -101,109, 61,7\ndata 583376,6649\n\ndata -25,26, 7,13\ndata 5571,137\n\ndata 1,4, 7,11\ndata 9263,2837\n\ndata 122,407, 7,11\ndata -517,1477\n\n'more subtle\ndata 5,8, 7,11\ndata 353,30809\n\ndata 0,0, 0,0\n\n\nprint\ndo\n read q.a,q.b, p,k\n\n sw = a.r2pa(q, 1)\n if sw = 1 then exit do\n a.printf(0)\n\n read q.a,q.b\n\n sw or= b.r2pa(q, 1)\n if sw = 1 then exit do\n if sw then continue do\n b.printf(0)\n\n c.add(a, b)\n print \"+ =\"\n c.printf(1)\n\n print : ?\nloop\n\nsystem\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// constants\nconst EMX = 64 // exponent maximum (if indexing starts at -EMX)\nconst DMX = 100000 // approximation loop maximum\nconst AMX = 1048576 // argument maximum\nconst PMAX = 32749 // prime maximum\n\n// global variables\nvar p1 = 0\nvar p = 7 // default prime\nvar k = 11 // precision\n\nfunc abs(a int) int {\n if a >= 0 {\n return a\n }\n return -a\n}\n\nfunc min(a, b int) int {\n if a < b {\n return a\n }\n return b\n}\n\ntype Ratio struct {\n a, b int\n}\n\ntype Padic struct {\n v int\n d [2 * EMX]int // add EMX to index to be consistent wih FB\n}\n\n// (re)initialize receiver from Ratio, set 'sw' to print\nfunc (pa *Padic) r2pa(q Ratio, sw int) int {\n a := q.a\n b := q.b\n if b == 0 {\n return 1\n }\n if b < 0 {\n b = -b\n a = -a\n }\n if abs(a) > AMX || b > AMX {\n return -1\n }\n if p < 2 || k < 1 {\n return 1\n }\n p = min(p, PMAX) // maximum short prime\n k = min(k, EMX-1) // maxumum array length\n if sw != 0 {\n fmt.Printf(\"%d/%d + \", a, b) // numerator, denominator\n fmt.Printf(\"0(%d^%d)\\n\", p, k) // prime, precision\n }\n\n // (re)initialize\n pa.v = 0\n p1 = p - 1\n pa.d = [2 * EMX]int{}\n if a == 0 {\n return 0\n }\n i := 0\n\n // find -exponent of p in b\n for b%p == 0 {\n b = b / p\n i--\n }\n s := 0\n r := b % p\n\n // modular inverse for small p\n b1 := 1\n for b1 <= p1 {\n s += r\n if s > p1 {\n s -= p\n }\n if s == 1 {\n break\n }\n b1++\n }\n if b1 == p {\n fmt.Println(\"r2pa: impossible inverse mod\")\n return -1\n }\n pa.v = EMX\n for {\n // find exponent of P in a\n for a%p == 0 {\n a = a / p\n i++\n }\n\n // valuation\n if pa.v == EMX {\n pa.v = i\n }\n\n // upper bound\n if i >= EMX {\n break\n }\n\n // check precision\n if (i - pa.v) > k {\n break\n }\n\n // next digit\n pa.d[i+EMX] = a * b1 % p\n if pa.d[i+EMX] < 0 {\n pa.d[i+EMX] += p\n }\n\n // remainder - digit * divisor\n a -= pa.d[i+EMX] * b\n if a == 0 {\n break\n }\n }\n return 0\n}\n\n// Horner's rule\nfunc (pa *Padic) dsum() int {\n t := min(pa.v, 0)\n s := 0\n for i := k - 1 + t; i >= t; i-- {\n r := s\n s *= p\n if r != 0 && (s/r-p != 0) {\n // overflow\n s = -1\n break\n }\n s += pa.d[i+EMX]\n }\n return s\n}\n\n// add b to receiver\nfunc (pa *Padic) add(b Padic) *Padic {\n c := 0\n r := Padic{}\n r.v = min(pa.v, b.v)\n for i := r.v; i <= k+r.v; i++ {\n c += pa.d[i+EMX] + b.d[i+EMX]\n if c > p1 {\n r.d[i+EMX] = c - p\n c = 1\n } else {\n r.d[i+EMX] = c\n c = 0\n }\n }\n return &r\n}\n\n// complement of receiver\nfunc (pa *Padic) cmpt() *Padic {\n c := 1\n r := Padic{}\n r.v = pa.v\n for i := pa.v; i <= k+pa.v; i++ {\n c += p1 - pa.d[i+EMX]\n if c > p1 {\n r.d[i+EMX] = c - p\n c = 1\n } else {\n r.d[i+EMX] = c\n c = 0\n }\n }\n return &r\n}\n\n// rational reconstruction\nfunc (pa *Padic) crat() {\n fl := false\n s := pa\n j := 0\n i := 1\n\n // denominator count\n for i <= DMX {\n // check for integer\n j = k - 1 + pa.v\n for j >= pa.v {\n if s.d[j+EMX] != 0 {\n break\n }\n j--\n }\n fl = ((j - pa.v) * 2) < k\n if fl {\n fl = false\n break\n }\n\n // check negative integer\n j = k - 1 + pa.v\n for j >= pa.v {\n if p1-s.d[j+EMX] != 0 {\n break\n }\n j--\n }\n fl = ((j - pa.v) * 2) < k\n if fl {\n break\n }\n\n // repeatedly add self to s\n s = s.add(*pa)\n i++\n }\n if fl {\n s = s.cmpt()\n }\n\n // numerator: weighted digit sum\n x := s.dsum()\n y := i\n if x < 0 || y > DMX {\n fmt.Println(x, y)\n fmt.Println(\"crat: fail\")\n } else {\n // negative powers\n i = pa.v\n for i <= -1 {\n y *= p\n i++\n }\n\n // negative rational\n if fl {\n x = -x\n }\n fmt.Print(x)\n if y > 1 {\n fmt.Printf(\"/%d\", y)\n }\n fmt.Println()\n }\n}\n\n// print expansion\nfunc (pa *Padic) printf(sw int) {\n t := min(pa.v, 0)\n for i := k - 1 + t; i >= t; i-- {\n fmt.Print(pa.d[i+EMX])\n if i == 0 && pa.v < 0 {\n fmt.Print(\".\")\n }\n fmt.Print(\" \")\n }\n fmt.Println()\n // rational approximation\n if sw != 0 {\n pa.crat()\n }\n}\n\nfunc main() {\n data := [][]int{\n /* rational reconstruction depends on the precision\n until the dsum-loop overflows */\n {2, 1, 2, 4, 1, 1},\n {4, 1, 2, 4, 3, 1},\n {4, 1, 2, 5, 3, 1},\n {4, 9, 5, 4, 8, 9},\n {26, 25, 5, 4, -109, 125},\n {49, 2, 7, 6, -4851, 2},\n {-9, 5, 3, 8, 27, 7},\n {5, 19, 2, 12, -101, 384},\n /* two decadic pairs */\n {2, 7, 10, 7, -1, 7},\n {34, 21, 10, 9, -39034, 791},\n /* familiar digits */\n {11, 4, 2, 43, 679001, 207},\n {-8, 9, 23, 9, 302113, 92},\n {-22, 7, 3, 23, 46071, 379},\n {-22, 7, 32749, 3, 46071, 379},\n {35, 61, 5, 20, 9400, 109},\n {-101, 109, 61, 7, 583376, 6649},\n {-25, 26, 7, 13, 5571, 137},\n {1, 4, 7, 11, 9263, 2837},\n {122, 407, 7, 11, -517, 1477},\n /* more subtle */\n {5, 8, 7, 11, 353, 30809},\n }\n\n sw := 0\n a := Padic{}\n b := Padic{}\n\n for _, d := range data {\n q := Ratio{d[0], d[1]}\n p = d[2]\n k = d[3]\n sw = a.r2pa(q, 1)\n if sw == 1 {\n break\n }\n a.printf(0)\n q.a = d[4]\n q.b = d[5]\n sw = sw | b.r2pa(q, 1)\n if sw == 1 {\n break\n }\n if sw == 0 {\n b.printf(0)\n c := a.add(b)\n fmt.Println(\"+ =\")\n c.printf(1)\n }\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"{-# LANGUAGE KindSignatures, DataKinds #-}\nmodule Padic where\n\nimport Data.Ratio\nimport Data.List (genericLength)\nimport GHC.TypeLits\n\ndata Padic (n :: Nat) = Null\n | Padic { unit :: [Int], order :: Int }\n\n-- valuation of the base\nmodulo :: (KnownNat p, Integral i) => Padic p -> i\nmodulo = fromIntegral . natVal\n\n-- Constructor for zero value\npZero :: KnownNat p => Padic p\npZero = Padic (repeat 0) 0\n\n-- Smart constructor, adjusts trailing zeros with the order.\nmkPadic :: (KnownNat p, Integral i) => [i] -> Int -> Padic p\nmkPadic u k = go 0 (fromIntegral <$> u)\n where\n go 17 _ = pZero\n go i (0:u) = go (i+1) u\n go i u = Padic u (k-i)\n\n-- Constructor for p-adic unit\nmkUnit :: (KnownNat p, Integral i) => [i] -> Padic p\nmkUnit u = mkPadic u 0\n\n-- Zero test (up to 1/p^17)\nisZero :: KnownNat p => Padic p -> Bool\nisZero (Padic u _) = all (== 0) (take 17 u)\nisZero _ = False\n\n-- p-adic norm\npNorm :: KnownNat p => Padic p -> Ratio Int\npNorm Null = undefined\npNorm p = fromIntegral (modulo p) ^^ (- order p)\n\n-- test for an integerness up to p^-17\nisInteger :: KnownNat p => Padic p -> Bool\nisInteger Null = False\nisInteger (Padic s k) = case splitAt k s of\n ([],i) -> length (takeWhile (==0) $ reverse (take 20 i)) > 3\n _ -> False\n\n-- p-adics are shown with 1/p^17 precision\ninstance KnownNat p => Show (Padic p) where\n show Null = \"Null\"\n show x@(Padic u k) =\n show (modulo x) ++ \"-adic: \" ++\n (case si of {[] -> \"0\"; _ -> si})\n ++ \".\" ++\n (case f of {[] -> \"0\"; _ -> sf})\n where\n (f,i) = case compare k 0 of\n LT -> ([], replicate (-k) 0 ++ u)\n EQ -> ([], u)\n GT -> splitAt k (u ++ repeat 0)\n sf = foldMap showD $ reverse $ take 17 f\n si = foldMap showD $ dropWhile (== 0) $ reverse $ take 17 i\n el s = if length s > 16 then \"…\" else \"\"\n showD n = [(['0'..'9']++['a'..'z']) !! n]\n\ninstance KnownNat p => Eq (Padic p) where\n a == b = isZero (a - b)\n\ninstance KnownNat p => Ord (Padic p) where\n compare = error \"Ordering is undefined fo p-adics.\"\n\ninstance KnownNat p => Num (Padic p) where\n fromInteger 0 = pZero\n fromInteger n = pAdic (fromInteger n)\n\n x@(Padic a ka) + Padic b kb = mkPadic s k\n where\n k = ka `max` kb\n s = addMod (modulo x)\n (replicate (k-ka) 0 ++ a)\n (replicate (k-kb) 0 ++ b)\n _ + _ = Null\n\n x@(Padic a ka) * Padic b kb =\n mkPadic (mulMod (modulo x) a b) (ka + kb)\n _ * _ = Null\n\n negate x@(Padic u k) =\n case map (\\y -> modulo x - 1 - y) u of\n n:ns -> Padic ((n+1):ns) k\n [] -> pZero\n negate _ = Null\n\n abs p = pAdic (pNorm p)\n\n signum = undefined\n\n------------------------------------------------------------\n-- conversion from rationals to p-adics\n\ninstance KnownNat p => Fractional (Padic p) where\n fromRational = pAdic\n\n recip Null = Null\n recip x@(Padic (u:us) k)\n | isZero x = Null\n | gcd p u /= 1 = Null\n | otherwise = mkPadic res (-k)\n where\n p = modulo x\n res = longDivMod p (1:repeat 0) (u:us)\n\npAdic :: (Show i, Integral i, KnownNat p)\n => Ratio i -> Padic p\npAdic 0 = pZero\npAdic x = res\n where\n p = modulo res\n (k, q) = getUnit p x\n (n, d) = (numerator q, denominator q)\n res = maybe Null process $ recipMod p d\n\n process r = mkPadic (series n) k\n where\n series n\n | n == 0 = repeat 0\n | n `mod` p == 0 = 0 : series (n `div` p)\n | otherwise =\n let m = (n * r) `mod` p\n in m : series ((n - m * d) `div` p)\n\n------------------------------------------------------------\n-- conversion from p-adics to rationals\n-- works for relatively small denominators\n\ninstance KnownNat p => Real (Padic p) where\n toRational Null = error \"no rational representation!\"\n toRational x@(Padic s k) = res\n where\n p = modulo x\n res = case break isInteger $ take 10000 $ iterate (x +) x of\n (_,[]) -> - toRational (- x)\n (d, i:_) -> (fromBase p (unit i) * (p^(- order i))) % (genericLength d + 1)\n\n fromBase p = foldr (\\x r -> r*p + x) 0 .\n take 20 . map fromIntegral\n\n--------------------------------------------------------------------------------\n-- helper functions\n\n-- extracts p-adic unit from a rational number\ngetUnit :: Integral i => i -> Ratio i -> (Int, Ratio i)\ngetUnit p x = (genericLength k1 - genericLength k2, c)\n where\n (k1,b:_) = span (\\n -> denominator n `mod` p == 0) $\n iterate (* fromIntegral p) x\n (k2,c:_) = span (\\n -> numerator n `mod` p == 0) $\n iterate (/ fromIntegral p) b\n\n\n-- Reciprocal of a number modulo p (extended Euclidean algorithm).\n-- For non-prime p returns Nothing non-invertible element of the ring.\nrecipMod :: Integral i => i -> i -> Maybe i\nrecipMod p 1 = Just 1\nrecipMod p a | gcd p a == 1 = Just $ go 0 1 p a\n | otherwise = Nothing\n where\n go t _ _ 0 = t `mod` p\n go t nt r nr =\n let q = r `div` nr\n in go nt (t - q*nt) nr (r - q*nr)\n\n-- Addition of two sequences modulo p\naddMod p = go 0\n where\n go 0 [] ys = ys\n go 0 xs [] = xs\n go s [] ys = go 0 [s] ys\n go s xs [] = go 0 xs [s]\n go s (x:xs) (y:ys) =\n let (q, r) = (x + y + s) `divMod` p\n in r : go q xs ys\n\n-- Subtraction of two sequences modulo p\nsubMod p a (b:bs) = addMod p a $ (p-b) : ((p - 1 -) <$> bs)\n\n-- Multiplication of two sequences modulo p\nmulMod p as [b] = mulMod p [b] as\nmulMod p as bs = case as of\n [0] -> repeat 0\n [1] -> bs\n [a] -> go 0 bs\n where\n go s [] = [s]\n go s (b:bs) =\n let (q, r) = (a * b + s) `divMod` p\n in r : go q bs\n as -> go bs\n where\n go [] = []\n go (b:bs) =\n let c:cs = mulMod p [b] as\n in c : addMod p (go bs) cs\n\n-- Division of two sequences modulo p\nlongDivMod p a (b:bs) = case recipMod p b of\n Nothing -> error $\n show b ++ \" is not invertible modulo \" ++ show p\n Just r -> go a\n where\n go [] = []\n go (0:xs) = 0 : go xs\n go (x:xs) =\n let m = (x*r) `mod` p\n _:zs = subMod p (x:xs) (mulMod p [m] (b:bs))\n in m : go zs\n","language":"Haskell"},{"code":"public final class PAdicNumbersBasic {\n\n\tpublic static void main(String[] args) {\n\t\tSystem.out.println(\"3-adic numbers:\");\n\t\tPadic padicOne = new Padic(3, -5, 9);\n\t\tSystem.out.println(\"-5 / 9 => \" + padicOne);\n\t\tPadic padicTwo = new Padic(3, 47, 12);\n\t\tSystem.out.println(\"47 / 12 => \" + padicTwo);\n\t\t\n\t\tPadic sum = padicOne.add(padicTwo);\n\t\tSystem.out.println(\"sum => \" + sum);\t\t\n\t\tSystem.out.println(\"Rational = \" + sum.convertToRational());\n\t\tSystem.out.println();\t\t\n\t\n\t\tSystem.out.println(\"7-adic numbers:\");\n\t\tpadicOne = new Padic(7, 5, 8);\n\t\tSystem.out.println(\"5 / 8 => \" + padicOne);\n\t\tpadicTwo = new Padic(7, 353, 30809);\n\t\tSystem.out.println(\"353 / 30809 => \" + padicTwo);\n\t\t\n\t\tsum = padicOne.add(padicTwo);\n\t\tSystem.out.println(\"sum => \" + sum);\t\t\t\n\t\tSystem.out.println(\"Rational = \" + sum.convertToRational());\n\t}\n}\n\nfinal class Padic {\t\n\t/**\n\t * Create a p-adic, with p = aPrime, from the given rational 'aNumerator' / 'aDenominator'.\n\t */\n\tpublic Padic(int aPrime, int aNumerator, int aDenominator) {\n\t\tif ( aDenominator == 0 ) {\n\t\t\tthrow new IllegalArgumentException(\"Denominator cannot be zero\");\n\t\t}\t\n\t\t\n\t\tprime = aPrime;\t\n\t\tdigits = new ArrayList<Integer>(DIGITS_SIZE);\n\t\torder = 0;\n\t\t\n\t\t// Process rational zero\n\t\tif ( aNumerator == 0 ) {\n\t\t\torder = MAX_ORDER;\t\t\t\t\t\n\t\t\treturn;\n\t\t}\n\n\t\t// Remove multiples of 'prime' and adjust the order of the p-adic number accordingly\n\t\twhile ( Math.floorMod(aNumerator, prime) == 0 ) {\t\t\t\n\t\t\taNumerator /= prime;\n\t\t\torder += 1;\n\t\t}\n\t\t\n\t\twhile ( Math.floorMod(aDenominator, prime) == 0 ) {\t\t\t\n\t\t\taDenominator /= prime;\n\t\t\torder -= 1;\n\t\t}\n\t\t\n\t\t// Standard calculation of p-adic digits\n\t\tfinal long inverse = moduloInverse(aDenominator);\t\t\n\t\twhile ( digits.size() < DIGITS_SIZE ) {\n\t\t\tfinal int digit = Math.floorMod(aNumerator * inverse, prime);\n\t\t\tdigits.addLast(digit);\n\t\t\t\n\t\t\taNumerator -= digit * aDenominator;\n\t\t\t\n\t\t\tif ( aNumerator != 0 ) {\n\t\t\t// The denominator is not a power of a prime\n\t\t\t\tint count = 0;\n\t\t\t\twhile ( Math.floorMod(aNumerator, prime) == 0 ) {\n\t\t\t\t\taNumerator /= prime;\n\t\t\t\t\tcount += 1;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor ( int i = count; i > 1; i-- ) {\n\t\t\t\t\tdigits.addLast(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\t\n\t}\n\t\n\t/**\n * Return the sum of this p-adic number and the given p-adic number.\n */\n public Padic add(Padic aOther) {\n \tif ( prime != aOther.prime ) {\n \t\tthrow new IllegalArgumentException(\"Cannot add p-adic's with different primes\");\n \t}\n \t\n List<Integer> result = new ArrayList<Integer>();\n\n // Adjust the digits so that the p-adic points are aligned\n for ( int i = 0; i < -order + aOther.order; i++ ) {\n \taOther.digits.addFirst(0);\n }\n\n for ( int i = 0; i < -aOther.order + order; i++ ) {\n \tdigits.addFirst(0);\n }\n\n // Standard digit by digit addition\n int carry = 0;\n for ( int i = 0; i < Math.min(digits.size(), aOther.digits.size()); i++ ) { \t\n final int sum = digits.get(i) + aOther.digits.get(i) + carry;\n final int remainder = Math.floorMod(sum, prime);\n carry = ( sum >= prime ) ? 1 : 0;\n result.addLast(remainder);\n }\n\n // Reverse the changes made to the digits\n for ( int i = 0; i < -order + aOther.order; i++ ) {\n \taOther.digits.removeFirst();\n }\n\n for ( int i = 0; i < -aOther.order + order; i++ ) {\n \tdigits.removeFirst();\n }\n\n return new Padic(prime, result, allZeroDigits(result) ? MAX_ORDER : Math.min(order, aOther.order));\n }\n\n /**\n * Return the Rational representation of this p-adic number.\n */\n public Rational convertToRational() {\n \tList<Integer> numbers = new ArrayList<Integer>(digits); \t\n \t\n \t// Zero\n \tif ( allZeroDigits(numbers) ) {\n \t\treturn new Rational(0, 1);\n \t} \t\n \t\n \t// Positive integer\n \tif ( order >= 0 && endsWith(numbers, 0) ) {\n \t\tfor ( int i = 0; i < order; i++ ) {\n\t \t\tnumbers.addFirst(0);\n\t \t}\n \t\t\n\t \treturn new Rational(convertToDecimal(numbers), 1);\n \t} \t\n \t\n \t// Negative integer\n \tif ( order >= 0 && endsWith(numbers, prime - 1) ) { \t\n\t \tnegateList(numbers);\n\t \tfor ( int i = 0; i < order; i++ ) {\n\t \t\tnumbers.addFirst(0);\n\t \t}\n\t \t\n\t \treturn new Rational(-convertToDecimal(numbers), 1);\n \t} \t\n\n \t// Rational\n \tPadic sum = new Padic(prime, digits, order);\n \tPadic self = new Padic(prime, digits, order);\n \tint denominator = 1;\n \tdo {\n \t\tsum = sum.add(self);\n \t\tdenominator += 1;\n \t} while ( ! ( endsWith(sum.digits, 0) || endsWith(sum.digits, prime - 1) ) );\n \t\n \tfinal boolean negative = endsWith(sum.digits, prime - 1);\n \tif ( negative ) {\n \t\tnegateList(sum.digits);\n \t}\n \t\n \tint numerator = negative ? -convertToDecimal(sum.digits) : convertToDecimal(sum.digits);\n \t\n \tif ( order > 0 ) {\n \t\tnumerator *= Math.pow(prime, order);\n \t}\n \t\n \tif ( order < 0 ) {\n \t\tdenominator *= Math.pow(prime, -order);\n \t}\n \t\n \treturn new Rational(numerator, denominator);\n }\n\n /**\n\t * Return a string representation of this p-adic.\n\t */\n\tpublic String toString() {\n\t\twhile ( digits.size() > PRECISION ) {\n\t\t\tdigits.removeLast();\n\t\t}\n\t\tpadWithZeros(digits);\n\t\t\n\t\tStringBuilder builder = new StringBuilder();\n\t\tfor ( int i = digits.size() - 1; i >= 0; i-- ) {\n\t\t\tbuilder.append(digits.get(i));\n\t\t}\n\t\t\n\t\tif ( order >= 0 ) {\n\t\t\tfor ( int i = 0; i < order; i++ ) {\n\t\t\t\tbuilder.append(\"0\");\n\t\t\t\tbuilder.deleteCharAt(0);\n\t\t\t}\n\t\t\t\n\t\t\tbuilder.append(\".0\");\n\t\t} else {\n\t\t\tbuilder.insert(builder.length() + order, \".\");\n\t\t}\t\t\n\t\t\n\t\treturn \" ...\" + builder.toString();\n\t}\t\n\t\t\n\t// PRIVATE //\n\n /**\n\t * Create a p-adic, with p = 'aPrime', directly from a list of digits.\n\t *\n\t * With 'aOrder' = 0, the list [1, 2, 3, 4, 5] creates the p-adic ...54321.0\n\t * 'aOrder' > 0 shifts the list 'aOrder' places to the left and\n\t * 'aOrder' < 0 shifts the list 'aOrder' places to the right.\n\t */\n\tprivate Padic(int aPrime, List<Integer> aDigits, int aOrder) {\n\t\tprime = aPrime;\t\t\n\t\tdigits = new ArrayList<Integer>(aDigits);\n\t\tpadWithZeros(digits);\n\t\torder = aOrder;\n\t}\t\n\t\n\t/**\n\t * Return the multiplicative inverse of the given decimal number modulo 'prime'.\n\t */\n\tprivate int moduloInverse(int aNumber) {\n\t\tint inverse = 1;\n\t\twhile ( Math.floorMod(inverse * aNumber, prime) != 1 ) {\n\t\t\tinverse += 1;\n\t\t}\t\n\t\t\n\t\treturn inverse;\n\t}\n\t\n\t/**\n\t * Transform the given list of digits representing a p-adic number\n\t * into a list which represents the negation of the p-adic number.\n\t */\n\tprivate void negateList(List<Integer> aDigits) {\t\t\n\t\taDigits.set(0, ( prime - aDigits.get(0) ) % prime);\n \tfor ( int i = 1; i < aDigits.size(); i++ ) {\n \t\taDigits.set(i, prime - 1 - aDigits.get(i));\n \t}\n\t}\t\n\t\n\t/**\n\t * Return the given list of base 'prime' integers converted to a decimal integer.\n\t */\n\tprivate int convertToDecimal(List<Integer> aNumbers) {\n\t\tint decimal = 0;\n\t\tint multiple = 1;\n\t\tfor ( int number : aNumbers ) {\n\t\t\tdecimal += number * multiple;\t\t\t\t\n\t\t\tmultiple *= prime;\n\t\t}\n\t\t\n\t\treturn decimal;\n\t}\n\t\n\t/**\n\t * Return whether the given list consists of all zeros.\n\t */\n\tprivate static boolean allZeroDigits(List<Integer> aList) {\n\t\treturn aList.stream().allMatch( i -> i == 0 );\n\t}\n\t\n\t/**\n\t * The given list is padded on the right by zeros up to a maximum length of 'PRECISION'.\n\t */\n\tprivate static void padWithZeros(List<Integer> aList) {\n\t\twhile ( aList.size() < PRECISION ) {\n\t\t\taList.addLast(0);\n\t\t}\n\t}\n\t\n\t/**\n\t * Return whether the given list ends with multiple instances of the given number.\n\t */\n\tprivate static boolean endsWith(List<Integer> aDigits, int aDigit) {\n\t\tfor ( int i = aDigits.size() - 1; i >= aDigits.size() - PRECISION / 2; i-- ) {\n\t\t\tif ( aDigits.get(i) != aDigit ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn true;\n\t}\n\t\n\tprivate static class Rational {\n\t\t\n\t\tpublic Rational(int aNumerator, int aDenominator) {\n\t\t\tif ( aDenominator < 0 ) {\n\t \t\tnumerator = -aNumerator;\n\t \t\tdenominator = -aDenominator;\n\t \t} else {\n\t \t\tnumerator = aNumerator;\n\t \t\tdenominator = aDenominator;\n\t \t}\n\t\t\t\n\t\t\tif ( aNumerator == 0 ) {\n\t \t\tdenominator = 1;\n\t \t}\t\t\t\n\t \t\n\t \tfinal int gcd = gcd(numerator, denominator);\n\t \tnumerator /= gcd;\n\t \tdenominator /= gcd;\t\n\t\t}\n\t\t\n\t\tpublic String toString() {\n\t\t\treturn numerator + \" / \" + denominator;\n\t\t}\n\t\t\n\t\tprivate int gcd(int aOne, int aTwo) {\n\t\t\tif ( aTwo == 0 ) {\n\t \t\treturn Math.abs(aOne);\n\t \t}\n\t \treturn gcd(aTwo, Math.floorMod(aOne, aTwo));\n\t\t}\n\t\t\n\t\tprivate int numerator;\n\t\tprivate int denominator;\n\t\t\n\t}\n\t\n\tprivate List<Integer> digits;\n\tprivate int order;\n\t\n\tprivate final int prime;\t\n\t\n\tprivate static final int MAX_ORDER = 1_000;\n\tprivate static final int PRECISION = 40;\n\tprivate static final int DIGITS_SIZE = PRECISION + 5;\n\n}\n","language":"Java"},{"code":"using Nemo, LinearAlgebra\n\nset_printing_mode(FlintPadicField, :terse)\n\n\"\"\" convert to Rational (rational reconstruction) \"\"\"\nfunction toRational(pa::padic)\n rat = lift(QQ, pa)\n r, den = BigInt(numerator(rat)), Int(denominator(rat))\n p, k = Int(prime(parent(pa))), Int(precision(pa))\n N = BigInt(p^k)\n a1, a2 = [N, 0], [r, 1]\n while dot(a1, a1) > dot(a2, a2)\n q = dot(a1, a2) // dot(a2, a2)\n a1, a2 = a2, a1 - BigInt(round(q)) * a2\n end\n if dot(a1, a1) < N\n return (Rational{Int}(a1[1]) // Rational{Int}(a1[2])) // Int(den)\n else\n return Int(r) // den\n end\nend\n\nfunction dstring(pa::padic)\n u, v, n, p, k = pa.u, pa.v, pa.N, pa.parent.p, pa.parent.prec_max\n d = digits(v > 0 ? u * p^v : u, base=pa.parent.p, pad=k)\n return prod([i == k + v && v != 0 ? \"$x . \" : \"$x \" for (i, x) in enumerate(reverse(d))])\nend\n\nconst DATA = [\n [2, 1, 2, 4, 1, 1],\n [4, 1, 2, 4, 3, 1],\n [4, 1, 2, 5, 3, 1],\n [4, 9, 5, 4, 8, 9],\n [26, 25, 5, 4, -109, 125],\n [49, 2, 7, 6, -4851, 2],\n [-9, 5, 3, 8, 27, 7],\n [5, 19, 2, 12, -101, 384],\n\n # Base 10 10-adic p-adics are not allowed by Nemo library -- p must be a prime\n\n # familiar digits\n [11, 4, 2, 43, 679001, 207],\n [-8, 9, 23, 9, 302113, 92],\n [-22, 7, 3, 23, 46071, 379],\n [-22, 7, 32749, 3, 46071, 379],\n [35, 61, 5, 20, 9400, 109],\n [-101, 109, 61, 7, 583376, 6649],\n [-25, 26, 7, 13, 5571, 137],\n [1, 4, 7, 11, 9263, 2837],\n [122, 407, 7, 11, -517, 1477],\n # more subtle\n [5, 8, 7, 11, 353, 30809],\n]\n\nfor (num1, den1, P, K, num2, den2) in DATA\n Qp = PadicField(P, K)\n a = Qp(QQ(num1 // den1))\n b = Qp(QQ(num2 // den2))\n c = a + b\n r = toRational(c)\n println(a, \"\\n\", dstring(a), \"\\n\", b, \"\\n\", dstring(b), \"\\n+ =\\n\", c, \"\\n\", dstring(c), \" $r\\n\")\nend\n","language":"Julia"},{"code":"import math, strformat\n\nconst\n Emx = 64 # Exponent maximum.\n Dmx = 100000 # Approximation loop maximum.\n Amx = 1048576 # Argument maximum.\n PMax = 32749 # Prime maximum.\n\ntype\n\n Ratio = tuple[a, b: int]\n\n Padic = object\n p: int # Prime.\n k: int # Precision.\n v: int\n d: array[-Emx..(Emx-1), int]\n\n PadicError = object of ValueError\n\n\nproc r2pa(pa: var Padic; q: Ratio; sw: bool) =\n ## Convert \"q\" to p-adic number, set \"sw\" to print.\n\n var (a, b) = q\n\n if b == 0:\n raise newException(PadicError, &\"Wrong rational: {a}/{b}\" )\n if b < 0:\n b = -b\n a = -a\n if abs(a) > Amx or b > Amx:\n raise newException(PadicError, &\"Rational exceeding limits: {a}/{b}\")\n if pa.p < 2:\n raise newException(PadicError, &\"Wrong value for p: {pa.p}\")\n if pa.k < 1:\n raise newException(PadicError, &\"Wrong value for k: {pa.k}\")\n pa.p = min(pa.p, PMax) # Maximum short prime.\n pa.k = min(pa.k, Emx - 1) # Maximum array length.\n\n if sw: echo &\"{a}/{b} + 0({pa.p}^{pa.k})\"\n\n # Initialize.\n pa.v = 0\n pa.d.reset()\n if a == 0: return\n var i = 0\n\n # Find -exponent of \"p\" in \"b\".\n while b mod pa.p == 0:\n b = b div pa.p\n dec i\n\n var s = 0\n var r = b mod pa.p\n\n # Modular inverse for small \"p\".\n var b1 = 1\n while b1 < pa.p:\n inc s, r\n if s >= pa.p: dec s, pa.p\n if s == 1: break\n inc b1\n if b1 == pa.p:\n raise newException(PadicError, \"Impossible to compute inverse modulo\")\n pa.v = Emx\n while true:\n # Find exponent of \"p\" in \"a\".\n while a mod pa.p == 0:\n a = a div pa.p\n inc i\n # Valuation.\n if pa.v == Emx: pa.v = i\n # Upper bound.\n if i >= Emx: break\n # Check precision.\n if i - pa.v > pa.k: break\n # Next digit.\n pa.d[i] = floorMod(a * b1, pa.p)\n # Remainder - digit * divisor.\n dec a, pa.d[i] * b\n if a == 0: break\n\n\nfunc dsum(pa: Padic): int =\n ## Horner's rule.\n let t = min(pa.v, 0)\n for i in countdown(pa.k - 1 + t, t):\n var r = result\n result *= pa.p\n if r != 0 and (result div r - pa.p) != 0:\n return -1 # Overflow.\n inc result, pa.d[i]\n\n\nfunc `+`(pa, pb: Padic): Padic =\n ## Add two p-adic numbers.\n assert pa.p == pb.p and pa.k == pb.k\n result.p = pa.p\n result.k = pa.k\n var c = 0\n result.v = min(pa.v, pb.v)\n for i in result.v..(pa.k + result.v):\n inc c, pa.d[i] + pb.d[i]\n if c >= pa.p:\n result.d[i] = c - pa.p\n c = 1\n else:\n result.d[i] = c\n c = 0\n\n\nfunc cmpt(pa: Padic): Padic =\n ## Return the complement.\n var c = 1\n result.p = pa.p\n result.k = pa.k\n result.v = pa.v\n for i in pa.v..(pa.k + pa.v):\n inc c, pa.p - 1 - pa.d[i]\n if c >= pa.p:\n result.d[i] = c - pa.p\n c = 1\n else:\n result.d[i] = c\n c = 0\n\n\nfunc crat(pa: Padic): string =\n ## Rational reconstruction.\n var s = pa\n\n # Denominator count.\n var i = 1\n var fl = false\n while i <= Dmx:\n # Check for integer.\n var j = pa.k - 1 + pa.v\n while j >= pa.v:\n if s.d[j] != 0: break\n dec j\n fl = (j - pa.v) * 2 < pa.k\n if fl:\n fl = false\n break\n # Check negative integer.\n j = pa.k - 1 + pa.v\n while j >= pa.v:\n if pa.p - 1 - s.d[j] != 0: break\n dec j\n fl = (j - pa.v) * 2 < pa.k\n if fl: break\n # Repeatedly add \"pa\" to \"s\".\n s = s + pa\n inc i\n\n if fl: s = s.cmpt()\n\n # Numerator: weighted digit sum.\n var x = s.dsum()\n var y = i\n if x < 0 or y > Dmx:\n raise newException(PadicError, &\"Error during rational reconstruction: {x}, {y}\")\n # Negative powers.\n for i in pa.v..(-1): y *= pa.p\n # Negative rational.\n if fl: x = -x\n result = $x\n if y > 1: result.add &\"/{y}\"\n\n\nfunc `$`(pa: Padic): string =\n ## String representation.\n let t = min(pa.v, 0)\n for i in countdown(pa.k - 1 + t, t):\n result.add $pa.d[i]\n if i == 0 and pa.v < 0: result.add \".\"\n result.add \" \"\n\n\nproc print(pa: Padic; sw: int) =\n echo pa\n # Rational approximation.\n if sw != 0: echo pa.crat()\n\n\nwhen isMainModule:\n\n # Rational reconstruction depends on the precision\n # until the dsum-loop overflows.\n const Data = [[2, 1, 2, 4, 1, 1],\n [4, 1, 2, 4, 3, 1],\n [4, 1, 2, 5, 3, 1],\n [4, 9, 5, 4, 8, 9],\n [26, 25, 5, 4, -109, 125],\n [49, 2, 7, 6, -4851, 2],\n [-9, 5, 3, 8, 27, 7],\n [5, 19, 2, 12, -101, 384],\n # Two decadic pairs.\n [2, 7, 10, 7, -1, 7],\n [34, 21, 10, 9, -39034, 791],\n # Familiar digits.\n [11, 4, 2, 43, 679001, 207],\n [-8, 9, 23, 9, 302113, 92],\n [-22, 7, 3, 23, 46071, 379],\n [-22, 7, 32749, 3, 46071, 379],\n [35, 61, 5, 20, 9400, 109],\n [-101, 109, 61, 7, 583376, 6649],\n [-25, 26, 7, 13, 5571, 137],\n [1, 4, 7, 11, 9263, 2837],\n [122, 407, 7, 11, -517, 1477],\n # More subtle.\n [5, 8, 7, 11, 353, 30809]]\n\n for d in Data:\n try:\n var a, b = Padic(p: d[2], k: d[3])\n r2pa(a, (d[0], d[1]), true)\n print(a, 0)\n r2pa(b, (d[4], d[5]), true)\n print(b, 0)\n echo \"+ =\"\n print(a + b, 1)\n echo \"\"\n except PadicError:\n echo getCurrentExceptionMsg()\n","language":"Nim"},{"code":"// constants\nconstant EMX = 64 // exponent maximum (if indexing starts at -EMX)\nconstant DMX = 1e5 // approximation loop maximum\nconstant AMX = 1048576 // argument maximum\nconstant PMAX = 32749 // prime maximum\n\n// global variables\ninteger p1 = 0\ninteger p = 7 // default prime\ninteger k = 11 // precision\n\ntype Ratio(sequence r)\n return length(r)=2 and integer(r[1]) and integer(r[2])\nend type\n\nprocedure pad_to(string fmt, sequence data, integer len)\n fmt = sprintf(fmt,data)\n puts(1,fmt&repeat(' ',len-length(fmt)))\nend procedure\n\nclass Padic\n integer v = 0\n sequence d = repeat(0,EMX*2)\n\n // (re)initialize 'this' from Ratio, set 'sw' to print\n function r2pa(Ratio q, integer sw)\n integer {a,b} = q\n if b=0 then return 1 end if\n if b<0 then\n b = -b\n a = -a\n end if\n if abs(a)>AMX or b>AMX then return -1 end if\n if p<2 or k<1 then return 1 end if\n p = min(p, PMAX) // maximum short prime\n k = min(k, EMX-1) // maximum array length\n if sw!=0 then\n -- numerator, denominator, prime, precision\n pad_to(\"%d/%d + O(%d^%d)\",{a,b,p,k},30)\n end if\n\n // (re)initialize\n v = 0\n p1 = p - 1\n sequence ntd = repeat(0,2*EMX) -- (new this.d)\n if a=0 then return 0 end if\n\n // find -exponent of p in b\n integer i = 0\n while remainder(b,p)=0 do\n b /= p\n i -= 1\n end while\n integer s = 0,\n r = remainder(b,p)\n\n // modular inverse for small P\n integer b1 = 1\n while b1<=p1 do\n s += r\n if s>p1 then s -= p end if\n if s=1 then exit end if\n b1 += 1\n end while\n if b1=p then\n printf(1,\"r2pa: impossible inverse mod\")\n return -1\n end if\n v = EMX\n while true do\n // find exponent of P in a\n while remainder(a,p)=0 do\n a /= p\n i += 1\n end while\n\n // valuation\n if v=EMX then v = i end if\n\n // upper bound\n if i>=EMX then exit end if\n\n // check precision\n if i-v>k then exit end if\n\n // next digit\n integer rdx = remainder(a*b1,p)\n if rdx<0 then rdx += p end if\n if rdx<0 or rdx>=p then ?9/0 end if -- sanity chk\n ntd[i+EMX+1] = rdx\n\n // remainder - digit * divisor\n a -= rdx*b\n if a=0 then exit end if\n end while\n this.d = ntd\n return 0\n end function\n\n // Horner's rule\n function dsum()\n integer t = min(v, 0),\n s = 0\n for i=k-1+t to t by -1 do\n integer r = s\n s *= p\n if r!=0 and floor(s/r)-p!=0 then\n // overflow\n s = -1\n exit\n end if\n s += d[i+EMX+1]\n end for\n return s\n end function\n\n // add b to 'this'\n function add(Padic b)\n integer c = 0\n Padic r = new({min(v,b.v)})\n sequence rd = r.d\n for i=r.v to k+r.v do\n integer dx = i+EMX+1\n c += d[dx] + b.d[dx]\n if c>p1 then\n rd[dx] = c - p\n c = 1\n else\n rd[dx] = c\n c = 0\n end if\n end for\n r.d = rd\n return r\n end function\n\n // complement\n function complement()\n integer c = 1\n Padic r = new({v})\n sequence rd = r.d\n for i=v to k+v do\n integer dx = i+EMX+1\n c += p1 - this.d[dx]\n if c>p1 then\n rd[dx] = c - p\n c = 1\n else\n rd[dx] = c\n c = 0\n end if\n end for\n r.d = rd\n return r\n end function\n\n // rational reconstruction\n procedure crat()\n integer sgn = 1\n Padic s = this\n integer j = 0,\n i = 1\n\n // denominator count\n while i<=DMX do\n // check for integer\n j = k-1+v\n while j>=v and s.d[j+EMX+1]=0 do\n j -= 1\n end while\n if ((j-v)*2)<k then exit end if\n\n // check for negative integer\n j = k-1+v\n while j>=v and p1-s.d[j+EMX+1]=0 do\n j -= 1\n end while\n if ((j-v)*2)<k then\n s = s.complement()\n sgn = -1\n exit\n end if\n\n // repeatedly add self to s\n s = s.add(this)\n i += 1\n end while\n\n // numerator: weighted digit sum\n integer x = s.dsum(),\n y = i\n if x<0 or y>DMX then\n printf(1,\"crat: fail\")\n else\n // negative powers\n for i=v to -1 do\n y *= p\n end for\n pad_to(iff(y=1?\"%d\":\"%d/%d\"),{x*sgn,y},26)\n printf(1,\"+ = \")\n end if\n end procedure\n\n // print expansion\n procedure prntf(bool sw)\n integer t = min(v, 0)\n // rational approximation\n if sw!=0 then crat() end if\n for i=k-1+t to t by -1 do\n printf(1,\"%d\",d[i+EMX+1])\n printf(1,iff(i=0 and v<0?\". \":\" \"))\n end for\n printf(1,\"\\n\")\n end procedure\nend class\n\nsequence data = {\n /* rational reconstruction limits are relative to the precision */\n {{2, 1}, 2, 4, {1, 1}},\n {{4, 1}, 2, 4, {3, 1}},\n {{4, 1}, 2, 5, {3, 1}},\n {{4, 9}, 5, 4, {8, 9}},\n-- all tested, but let's keep the output reasonable:\n-- {{-7, 5}, 7, 4, {99, 70}},\n-- {{26, 25}, 5, 4, {-109, 125}},\n-- {{49, 2}, 7, 6, {-4851, 2}},\n-- {{-9, 5}, 3, 8, {27, 7}},\n-- {{5, 19}, 2, 12, {-101, 384}},\n-- /* four decadic pairs */\n-- {{6, 7}, 10, 7, {-5, 7}},\n-- {{2, 7}, 10, 7, {-3, 7}},\n-- {{2, 7}, 10, 7, {-1, 7}},\n-- {{34, 21}, 10, 9, {-39034, 791}},\n-- /* familiar digits */\n-- {{11, 4}, 2, 43, {679001, 207}},\n-- {{11, 4}, 3, 27, {679001, 207}},\n-- {{11, 4}, 11, 13, {679001, 207}},\n-- {{-22, 7}, 2, 37, {46071, 379}},\n-- {{-22, 7}, 3, 23, {46071, 379}},\n-- {{-22, 7}, 7, 13, {46071, 379}},\n-- {{-101, 109}, 2, 40, {583376, 6649}},\n-- {{-101, 109}, 61, 7, {583376, 6649}},\n-- {{-101, 109}, 32749, 3, {583376, 6649}},\n-- {{-25, 26}, 7, 13, {5571, 137}},\n-- {{1, 4}, 7, 11, {9263, 2837}},\n-- {{122, 407}, 7, 11, {-517, 1477}},\n /* more subtle */\n {{5, 8}, 7, 11, {353, 30809}}\n}\n\ninteger sw = 0,qa,qb\nPadic a = new()\nPadic b = new()\n\nfor i=1 to length(data) do\n {Ratio q, p, k, Ratio q2} = data[i]\n sw = a.r2pa(q, 1)\n if sw=1 then exit end if\n a.prntf(0)\n sw = sw or b.r2pa(q2, 1)\n if sw=1 then exit end if\n if sw=0 then\n b.prntf(0)\n Padic c = a.add(b)\n c.prntf(1)\n end if\n printf(1,\"\\n\")\nend for\n","language":"Phix"},{"code":"# 20210225 Raku programming solution\n\n#!/usr/bin/env raku\n\nclass Padic { has ($.p is default(2), %.v is default({})) is rw ;\n\n method r2pa (Rat $x is copy, \\p, \\d) { # Reference: math.stackexchange.com/a/1187037\n self.p = p ;\n $x += p**d if $x < 0 ; # complement\n\n my $lowerest = 0;\n my ($num,$den) = $x.nude;\n while ($den % p) == 0 { $den /= p and $lowerest-- }\n $x = $num / $den;\n\n while +self.v < d {\n my %d = ^p Z=> (( $x «-« ^p ) »/» p )».&{ .denominator % p }; # .kv\n for %d.keys { self.v.{$lowerest++} = $_ and last if %d{$_} != 0 }\n $x = ($x - self.v.{$lowerest-1}) / p ;\n }\n self\n }\n\n method add (Padic \\x, \\d) {\n my $div = 0;\n my $lowerest = (self.v.keys.sort({.Int}).first,\n x.v.keys.sort({.Int}).first ).min ;\n return Padic.new:\n p => self.p,\n v => gather for ^d {\n my $power = $lowerest + $_;\n given ((self.v.{$power}//0)+(x.v.{$power}//0)+$div).polymod(x.p)\n { take ($power, .[0]).Slip and $div = .[1] }\n }\n }\n\n method gist {\n # en.wikipedia.org/wiki/P-adic_number#Notation\n # my %H = (0..9) Z=> ('₀'..'₉'); # (0x2080 .. 0x2089);\n # '⋯ ' ~ self.v ~ ' ' ~ [~] self.p.comb».&{ %H{$_} }\n\n # express as a series\n my %H = ( 0…9 ,'-') Z=> ( '⁰','¹','²','³','⁴'…'⁹','⁻');\n [~] self.v.keys.sort({.Int}).map: {\n ' + ' ~ self.v.{$_} ~ '*' ~ self.p ~ [~] $_.comb».&{ %H{$_}} }\n }\n}\n\nmy @T;\nfor my \\D = (\n#`[[ these are not working\n < 26/25 -109/125 5 4 >,\n < 6/7 -5/7 10 7 >,\n < 2/7 -3/7 10 7 >,\n < 2/7 -1/7 10 7 >,\n < 34/21 -39034/791 10 9 >,\n#]]\n#`[[[[[ Works\n < 11/4 679001/207 2 43>,\n < 11/4 679001/207 3 27 >,\n < 5/19 -101/384 2 12>,\n < -22/7 46071/379 7 13 >,\n < -7/5 99/70 7 4> ,\n < -101/109 583376/6649 61 7>,\n < 122/407 -517/1477 7 11>,\n\n < 2/1 1/1 2 4>,\n < 4/1 3/1 2 4>,\n < 4/1 3/1 2 5>,\n < 4/9 8/9 5 4>,\n < 11/4 679001/207 11 13 >,\n < 1/4 9263/2837 7 11 >,\n < 49/2 -4851/2 7 6 >,\n < -9/5 27/7 3 8>,\n < -22/7 46071/379 2 37 >,\n < -22/7 46071/379 3 23 >,\n\n < -101/109 583376/6649 2 40>,\n < -101/109 583376/6649 32749 3>,\n < -25/26 5571/137 7 13>,\n#]]]]]\n\n < 5/8 353/30809 7 11 >,\n) -> \\D {\n given @T[0] = Padic.new { say D[0]~' = ', .r2pa: D[0],D[2],D[3] }\n given @T[1] = Padic.new { say D[1]~' = ', .r2pa: D[1],D[2],D[3] }\n given @T[0].add: @T[1], D[3] {\n given @T[2] = Padic.new { .r2pa: D[0]+D[1], D[2], D[3] }\n say \"Addition result = \", $_.gist; #\n unless ( $_.v.Str eq @T[2].v.Str ) {\n say 'but ' ~ (D[0]+D[1]).nude.join('/') ~ ' = ' ~ @T[2].gist\n }\n }\n}\n","language":"Raku"},{"code":"import \"./dynamic\" for Struct\n\n// constants\nvar EMX = 64 // exponent maximum (if indexing starts at -EMX)\nvar DMX = 1e5 // approximation loop maximum\nvar AMX = 1048576 // argument maximum\nvar PMAX = 32749 // prime maximum\n\n// global variables\nvar P1 = 0\nvar P = 7 // default prime\nvar K = 11 // precision\n\nvar Ratio = Struct.create(\"Ratio\", [\"a\", \"b\"])\n\nclass Padic {\n // uninitialized\n construct new() {\n _v = 0\n _d = List.filled(2 * EMX, 0) // add EMX to index to be consistent wih FB\n }\n\n // properties\n v { _v }\n v=(o) { _v = o }\n d { _d }\n\n // (re)initialize 'this' from Ratio, set 'sw' to print\n r2pa(q, sw) {\n var a = q.a\n var b = q.b\n if (b == 0) return 1\n if (b < 0) {\n b = -b\n a = -a\n }\n if (a.abs > AMX || b > AMX) return -1\n if (P < 2 || K < 1) return 1\n P = P.min(PMAX) // maximum short prime\n K = K.min(EMX-1) // maximum array length\n if (sw != 0) {\n System.write(\"%(a)/%(b) + \") // numerator, denominator\n System.print(\"0(%(P)^%(K))\") // prime, precision\n }\n\n // (re)initialize\n _v = 0\n P1 = P - 1\n _d = List.filled(2 * EMX, 0)\n if (a == 0) return 0\n var i = 0\n // find -exponent of P in b\n while (b%P == 0) {\n b = (b/P).truncate\n i = i - 1\n }\n var s = 0\n var r = b % P\n\n // modular inverse for small P\n var b1 = 1\n while (b1 <= P1) {\n s = s + r\n if (s > P1) s = s - P\n if (s == 1) break\n b1 = b1 + 1\n }\n if (b1 == P) {\n System.print(\"r2pa: impossible inverse mod\")\n return -1\n }\n _v = EMX\n while (true) {\n // find exponent of P in a\n while (a%P == 0) {\n a = (a/P).truncate\n i = i + 1\n }\n\n // valuation\n if (_v == EMX) _v = i\n\n // upper bound\n if (i >= EMX) break\n\n // check precision\n if ((i - _v) > K) break\n\n // next digit\n _d[i+EMX] = a * b1 % P\n if (_d[i+EMX] < 0) _d[i+EMX] = _d[i+EMX] + P\n\n // remainder - digit * divisor\n a = a - _d[i+EMX]*b\n if (a == 0) break\n }\n return 0\n }\n\n // Horner's rule\n dsum() {\n var t = _v.min(0)\n var s = 0\n for (i in K - 1 + t..t) {\n var r = s\n s = s * P\n if (r != 0 && ((s/r).truncate - P) != 0) {\n // overflow\n s = -1\n break\n }\n s = s + _d[i+EMX]\n }\n return s\n }\n\n // rational reconstruction\n crat() {\n var fl = false\n var s = this\n var j = 0\n var i = 1\n\n // denominator count\n while (i <= DMX) {\n // check for integer\n j = K - 1 + _v\n while (j >= _v) {\n if (s.d[j+EMX] != 0) break\n j = j - 1\n }\n fl = ((j - _v) * 2) < K\n if (fl) {\n fl = false\n break\n }\n\n // check negative integer\n j = K - 1 + _v\n while (j >= _v) {\n if (P1 - s.d[j+EMX] != 0) break\n j = j - 1\n }\n fl = ((j - _v) * 2) < K\n if (fl) break\n\n // repeatedly add self to s\n s = s + this\n i = i + 1\n }\n if (fl) s = s.cmpt\n\n // numerator: weighted digit sum\n var x = s.dsum()\n var y = i\n if (x < 0 || y > DMX) {\n System.print(\"crat: fail\")\n } else {\n // negative powers\n i = _v\n while (i <= -1) {\n y = y * P\n i = i + 1\n }\n\n // negative rational\n if (fl) x = -x\n System.write(x)\n if (y > 1) System.write(\"/%(y)\")\n System.print()\n }\n }\n\n // print expansion\n printf(sw) {\n var t = _v.min(0)\n for (i in K - 1 + t..t) {\n System.write(_d[i + EMX])\n if (i == 0 && _v < 0) System.write(\".\")\n System.write(\" \")\n }\n System.print()\n // rational approximation\n if (sw != 0) crat()\n }\n\n // add b to 'this'\n +(b) {\n var c = 0\n var r = Padic.new()\n r.v = _v.min(b.v)\n for (i in r.v..K + r.v) {\n c = c + _d[i+EMX] + b.d[i+EMX]\n if (c > P1) {\n r.d[i+EMX] = c - P\n c = 1\n } else {\n r.d[i+EMX] = c\n c = 0\n }\n }\n return r\n }\n\n // complement\n cmpt {\n var c = 1\n var r = Padic.new()\n r.v = _v\n for (i in _v..K + _v) {\n c = c + P1 - _d[i+EMX]\n if (c > P1) {\n r.d[i+EMX] = c - P\n c = 1\n } else {\n r.d[i+EMX] = c\n c = 0\n }\n }\n return r\n }\n}\n\nvar data = [\n /* rational reconstruction depends on the precision\n until the dsum-loop overflows */\n [2, 1, 2, 4, 1, 1],\n [4, 1, 2, 4, 3, 1],\n [4, 1, 2, 5, 3, 1],\n [4, 9, 5, 4, 8, 9],\n [26, 25, 5, 4, -109, 125],\n [49, 2, 7, 6, -4851, 2],\n [-9, 5, 3, 8, 27, 7],\n [5, 19, 2, 12, -101, 384],\n /* two decadic pairs */\n [2, 7, 10, 7, -1, 7],\n [34, 21, 10, 9, -39034, 791],\n /* familiar digits */\n [11, 4, 2, 43, 679001, 207],\n [-8, 9, 23, 9, 302113, 92],\n [-22, 7, 3, 23, 46071, 379],\n [-22, 7, 32749, 3, 46071, 379],\n [35, 61, 5, 20, 9400, 109],\n [-101, 109, 61, 7, 583376, 6649],\n [-25, 26, 7, 13, 5571, 137],\n [1, 4, 7, 11, 9263, 2837],\n [122, 407, 7, 11, -517, 1477],\n /* more subtle */\n [5, 8, 7, 11, 353, 30809]\n]\n\nvar sw = 0\nvar a = Padic.new()\nvar b = Padic.new()\n\nfor (d in data) {\n var q = Ratio.new(d[0], d[1])\n P = d[2]\n K = d[3]\n sw = a.r2pa(q, 1)\n if (sw == 1) break\n a.printf(0)\n q.a = d[4]\n q.b = d[5]\n sw = sw | b.r2pa(q, 1)\n if (sw == 1) break\n if (sw == 0) {\n b.printf(0)\n var c = a + b\n System.print(\"+ =\")\n c.printf(1)\n }\n System.print()\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/P-Adic_numbers,_basic\\nnote: mathematics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Conversion and addition of [[wp:P-adic_number|p-adic Numbers]].\\n\\n\\n;Task.\\n\\nConvert two rationals to p-adic numbers and add them up.\\nRational reconstruction is needed to interpret the result.\\n\\np-Adic numbers were introduced around 1900 by Hensel. p-Adic expansions\\n(a series of digits 0 ≤ d < p times p-power weights)\\nare finite-tailed and tend to zero in the direction of higher positive\\npowers of p (to the left in the notation used here).\\nFor example, the number 4 (100.0) has ''smaller'' 2-adic norm than 1/4 (0.01).\\n\\nIf we convert a natural number, the familiar p-ary expansion is obtained:\\n10 decimal is 1010 both binary and 2-adic. To convert a rational number a/b\\nwe perform p-adic long division. If p is actually prime, this is always possible\\nif first the 'p-part' is removed from b (and the p-adic point shifted accordingly).\\nThe inverse of b modulo p is then used in the conversion.\\n\\n'''Recipe:''' at each step the most significant digit of the partial remainder\\n(initially a) is zeroed by subtracting a proper multiple of the divisor b.\\nShift out the zero digit (divide by p) and repeat until the remainder is zero\\nor the precision limit is reached. Because p-adic division starts from the right,\\nthe 'proper multiplier' is simply\\nd = partial remainder * 1/b (mod p).\\nThe d's are the successive p-adic digits to find.\\n\\nAddition proceeds as usual, with carry from the right to the leftmost term,\\nwhere it has least magnitude and just drops off. We can work with approximate rationals\\nand obtain exact results. The routine for rational reconstruction demonstrates this:\\nrepeatedly add a p-adic to itself (keeping count to determine the denominator),\\nuntil an integer is reached (the numerator then equals the weighted digit sum).\\nBut even p-adic arithmetic fails if the precision is too low. The examples mostly\\nset the shortest prime-exponent combinations that allow valid reconstruction.\\n\\n\\n;Related task.\\n\\n[[p-Adic square roots]]\\n\\n\\n;Reference.\\n\\n[https://www.cut-the-knot.org/blue/p-adicExpansion.shtml] p-Adic expansions\\n\\n\\n__TOC__\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <cstdint>\\n#include <iostream>\\n#include <numeric>\\n#include <stdexcept>\\n#include <string>\\n#include <vector>\\n\\nclass Rational {\\npublic:\\n\\tRational(const int32_t& aNumerator, const int32_t& aDenominator) {\\n\\t\\tif ( aDenominator < 0 ) {\\n\\t\\t\\tnumerator = -aNumerator;\\n\\t\\t\\tdenominator = -aDenominator;\\n\\t\\t} else {\\n\\t\\t\\tnumerator = aNumerator;\\n\\t\\t\\tdenominator = aDenominator;\\n\\t\\t}\\n\\n\\t\\tif ( aNumerator == 0 ) {\\n\\t\\t\\tdenominator = 1;\\n\\t\\t}\\n\\n\\t\\tconst uint32_t divisor = std::gcd(numerator, denominator);\\n\\t\\tnumerator /= divisor;\\n\\t\\tdenominator /= divisor;\\n\\t}\\n\\n\\tstd::string to_string() const {\\n\\t\\treturn std::to_string(numerator) + \\\" / \\\" + std::to_string(denominator);\\n\\t}\\n\\nprivate:\\n\\tint32_t numerator;\\n\\tint32_t denominator;\\n};\\n\\nclass P_adic {\\npublic:\\n\\t// Create a P-adic number, with p = 'prime', from the given rational 'numerator' / 'denominator'.\\n\\tP_adic(const uint32_t& prime, int32_t numerator, int32_t denominator) : prime(prime) {\\n\\t\\tif ( denominator == 0 ) {\\n\\t\\t\\tstd::invalid_argument(\\\"Denominator cannot be zero\\\");\\n\\t\\t}\\n\\n\\t\\torder = 0;\\n\\n\\t\\t// Process rational zero\\n\\t\\tif ( numerator == 0 ) {\\n\\t\\t\\torder = ORDER_MAX;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// Remove multiples of 'prime' and adjust the order of the P-adic number accordingly\\n\\t\\twhile ( modulo_prime(numerator) == 0 ) {\\n\\t\\t\\tnumerator /= static_cast<int32_t>(prime);\\n\\t\\t\\torder += 1;\\n\\t\\t}\\n\\n\\t\\twhile ( modulo_prime(denominator) == 0 ) {\\n\\t\\t\\tdenominator /= static_cast<int32_t>(prime);\\n\\t\\t\\torder -= 1;\\n\\t\\t}\\n\\n\\t\\t// Standard calculation of P-adic digits\\n\\t\\tconst uint64_t inverse = modulo_inverse(denominator);\\n\\t\\twhile ( digits.size() < DIGITS_SIZE ) {\\n\\t\\t\\tconst uint32_t digit = modulo_prime(numerator * inverse);\\n\\t\\t\\tdigits.emplace_back(digit);\\n\\n\\t\\t\\tnumerator -= digit * denominator;\\n\\n\\t\\t\\tif ( numerator != 0 ) {\\n\\t\\t\\t// The denominator is not a power of a prime\\n\\t\\t\\t\\tuint32_t count = 0;\\n\\t\\t\\t\\twhile ( modulo_prime(numerator) == 0 ) {\\n\\t\\t\\t\\t\\tnumerator /= static_cast<int32_t>(prime);\\n\\t\\t\\t\\t\\tcount += 1;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor ( uint32_t i = count; i > 1; --i ) {\\n\\t\\t\\t\\t\\tdigits.emplace_back(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Return the sum of this P-adic number with the given P-adic number.\\n\\tP_adic add(P_adic other) {\\n\\t\\tif ( prime != other.prime ) {\\n\\t\\t\\tstd::invalid_argument(\\\"Cannot add p-adic's with different primes\\\");\\n\\t\\t}\\n\\n\\t\\tstd::vector<uint32_t> this_digits = digits;\\n\\t\\tstd::vector<uint32_t> other_digits = other.digits;\\n\\t\\tstd::vector<uint32_t> result;\\n\\n\\t\\t// Adjust the digits so that the P-adic points are aligned\\n\\t\\tfor ( int32_t i = 0; i < -order + other.order; ++i ) {\\n\\t\\t\\tother_digits.insert(other_digits.begin(), 0);\\n\\t\\t}\\n\\n\\t\\tfor ( int32_t i = 0; i < -other.order + order; ++i ) {\\n\\t\\t\\tthis_digits.insert(this_digits.begin(), 0);\\n\\t\\t}\\n\\n\\t\\t// Standard digit by digit addition\\n\\t\\tuint32_t carry = 0;\\n\\t\\tfor ( uint32_t i = 0; i < std::min(this_digits.size(), other_digits.size()); ++i ) {\\n\\t\\t\\tconst uint32_t sum = this_digits[i] + other_digits[i] + carry;\\n\\t\\t\\tconst uint32_t remainder = sum % prime;\\n\\t\\t\\tcarry = ( sum >= prime ) ? 1 : 0;\\n\\t\\t\\tresult.emplace_back(remainder);\\n\\t\\t}\\n\\n\\t\\treturn P_adic(prime, result, all_zero_digits(result) ? ORDER_MAX : std::min(order, other.order));\\n\\t}\\n\\n\\t// Return the Rational representation of this P-adic number.\\n\\tRational convert_to_rational() {\\n\\t\\tstd::vector<uint32_t> numbers = digits;\\n\\n\\t\\t// Zero\\n\\t\\tif ( all_zero_digits(numbers) ) {\\n\\t\\t\\treturn Rational(1, 0);\\n\\t\\t}\\n\\n\\t\\t// Positive integer\\n\\t\\tif ( order >= 0 && ends_with(numbers, 0) ) {\\n\\t\\t\\tfor ( int32_t i = 0; i < order; ++i ) {\\n\\t\\t\\t\\tnumbers.emplace(numbers.begin(), 0);\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn Rational(convert_to_decimal(numbers), 1);\\n\\t\\t}\\n\\n\\t\\t// Negative integer\\n\\t\\tif ( order >= 0 && ends_with(numbers, prime - 1) ) {\\n\\t\\t\\tnegate_digits(numbers);\\n\\t\\t\\tfor ( int32_t i = 0; i < order; ++i ) {\\n\\t\\t\\t\\tnumbers.emplace(numbers.begin(), 0);\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn Rational(-convert_to_decimal(numbers), 1);\\n\\t\\t}\\n\\n\\t\\t// Rational\\n\\t\\tconst P_adic copy(prime, digits, order);\\n\\t\\tP_adic sum(prime, digits, order);\\n\\t\\tint32_t denominator = 1;\\n\\t\\tdo {\\n\\t\\t\\tsum = sum.add(copy);\\n\\t\\t\\tdenominator += 1;\\n\\t\\t} while ( ! ( ends_with(sum.digits, 0) || ends_with(sum.digits, prime - 1) ) );\\n\\n\\t\\tconst bool negative = ends_with(sum.digits, 6);\\n\\t\\tif ( negative ) {\\n\\t\\t\\tnegate_digits(sum.digits);\\n\\t\\t}\\n\\n\\t\\tint32_t numerator = negative ? -convert_to_decimal(sum.digits) : convert_to_decimal(sum.digits);\\n\\n\\t\\tif ( order > 0 ) {\\n\\t\\t\\tnumerator *= std::pow(prime, order);\\n\\t\\t}\\n\\n\\t\\tif ( order < 0 ) {\\n\\t\\t\\tdenominator *= std::pow(prime, -order);\\n\\t\\t}\\n\\n\\t\\treturn Rational(numerator, denominator);\\n\\t}\\n\\n\\t// Return a string representation of this p-adic.\\n\\tstd::string to_string() {\\n\\t\\twhile ( digits.size() > PRECISION ) {\\n\\t\\t\\tdigits.pop_back();\\n\\t\\t}\\n\\t\\tpad_with_zeros(digits);\\n\\n\\t\\tstd::string result = \\\"\\\";\\n\\t\\tfor ( int64_t i = digits.size() - 1; i >= 0; --i ) {\\n\\t\\t\\tresult += std::to_string(digits[i]);\\n\\t\\t}\\n\\n\\t\\tif ( order >= 0 ) {\\n\\t\\t\\tfor ( int32_t i = 0; i < order; ++i ) {\\n\\t\\t\\t\\tresult += \\\"0\\\";\\n\\t\\t\\t\\tresult.erase(result.begin());\\n\\t\\t\\t}\\n\\n\\t\\t\\tresult += \\\".0\\\";\\n\\t\\t} else {\\n\\t\\t\\tresult.insert(result.length() + order, \\\".\\\");\\n\\t\\t}\\n\\n\\t\\treturn \\\" ...\\\" + result;\\n\\t}\\n\\nprivate:\\n\\t/**\\n\\t * Create a P-adic, with p = 'prime', directly from a vector of digits.\\n\\t *\\n\\t * With 'order' = 0, the vector [1, 2, 3, 4, 5] creates the p-adic ...54321.0\\n\\t * 'order' > 0 shifts the vector 'order' places to the left and\\n\\t * 'order' < 0 shifts the vector 'order' places to the right.\\n\\t */\\n\\tP_adic(const uint32_t& prime, const std::vector<uint32_t>& digits, const int32_t& order)\\n\\t\\t: prime(prime), digits(digits), order(order) {\\n\\t}\\n\\n\\t// Transform the given vector of digits representing a p-adic number\\n\\t// into a vector which represents the negation of the p-adic number.\\n\\tvoid negate_digits(std::vector<uint32_t> numbers) {\\n\\t\\tnumbers[0] = ( prime - numbers[0] ) % prime;\\n\\t\\tfor ( uint64_t i = 1; i < numbers.size(); ++i ) {\\n\\t\\t\\tnumbers[i] = prime - 1 - numbers[i];\\n\\t\\t}\\n\\t}\\n\\n\\t// Return the multiplicative inverse of the given number modulo 'prime'.\\n\\tuint32_t modulo_inverse(const uint32_t& number) const {\\n\\t\\tuint32_t inverse = 1;\\n\\t\\twhile ( ( inverse * number ) % prime != 1 ) {\\n\\t\\t\\tinverse += 1;\\n\\t\\t}\\n\\t\\treturn inverse;\\n\\t}\\n\\n\\t// Return the given number modulo 'prime' in the range 0..'prime' - 1.\\n\\tint32_t modulo_prime(const int64_t& number) const {\\n\\t\\tconst int32_t div = static_cast<int32_t>(number % prime);\\n\\t\\treturn ( div >= 0 ) ? div : div + prime;\\n\\t}\\n\\n\\t// The given vector is padded on the right by zeros up to a maximum length of 'PRECISION'.\\n\\tvoid pad_with_zeros(std::vector<uint32_t> vector) {\\n\\t\\twhile ( vector.size() < PRECISION ) {\\n\\t\\t\\tvector.emplace_back(0);\\n\\t\\t}\\n\\t}\\n\\n\\t// Return the given vector of base 'prime' integers converted to a decimal integer.\\n\\tuint32_t convert_to_decimal(const std::vector<uint32_t>& numbers) const {\\n\\t\\tuint32_t decimal = 0;\\n\\t\\tuint32_t multiple = 1;\\n\\t\\tfor ( const uint32_t& number : numbers ) {\\n\\t\\t\\tdecimal += number * multiple;\\n\\t\\t\\tmultiple *= prime;\\n\\t\\t}\\n\\t\\treturn decimal;\\n\\t}\\n\\n\\t// Return whether the given vector consists of all zeros.\\n\\tbool all_zero_digits(const std::vector<uint32_t>& numbers) const {\\n\\t\\tfor ( uint32_t number : numbers ) {\\n\\t\\t\\tif ( number != 0 ) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\n\\t// Return whether the given vector ends with multiple instances of the given number.\\n\\tbool ends_with(const std::vector<uint32_t>& numbers, const uint32_t& number) const {\\n\\t\\tfor ( uint64_t i = numbers.size() - 1; i >= numbers.size() - PRECISION / 2; --i ) {\\n\\t\\t\\tif ( numbers[i] != number ) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\n\\tuint32_t prime;\\n\\tstd::vector<uint32_t> digits;\\n\\tint32_t order;\\n\\n\\tstatic const uint32_t PRECISION = 40;\\n\\tstatic const uint32_t ORDER_MAX = 1'000;\\n\\tstatic const uint32_t DIGITS_SIZE = PRECISION + 5;\\n};\\n\\nint main() {\\n\\tstd::cout << \\\"3-adic numbers:\\\" << std::endl;\\n\\tP_adic padic_one(3, -2, 87);\\n\\tstd::cout << \\\"-2 / 87 => \\\" << padic_one.to_string() << std::endl;\\n\\tP_adic padic_two(3, 4, 97);\\n\\tstd::cout << \\\"4 / 97 => \\\" << padic_two.to_string() << std::endl;\\n\\n\\tP_adic sum = padic_one.add(padic_two);\\n\\tstd::cout << \\\"sum => \\\" << sum.to_string() << std::endl;\\n\\tstd::cout << \\\"Rational = \\\" << sum.convert_to_rational().to_string() << std::endl;\\n\\tstd::cout << std::endl;\\n\\n\\tstd::cout << \\\"7-adic numbers:\\\" << std::endl;\\n\\tpadic_one = P_adic(7, 5, 8);\\n\\tstd::cout << \\\"5 / 8 => \\\" << padic_one.to_string() << std::endl;\\n\\tpadic_two = P_adic(7, 353, 30809);\\n\\tstd::cout << \\\"353 / 30809 => \\\" << padic_two.to_string() << std::endl;\\n\\n\\tsum = padic_one.add(padic_two);\\n\\tstd::cout << \\\"sum => \\\" << sum.to_string() << std::endl;\\n\\tstd::cout << \\\"Rational = \\\" << sum.convert_to_rational().to_string() << std::endl;\\n\\tstd::cout << std::endl;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"' ***********************************************\\n'subject: convert two rationals to p-adic numbers,\\n' add them up and show the result.\\n'tested : FreeBasic 1.07.0\\n\\n\\n'you can change this:\\n\\nconst emx = 64\\n'exponent maximum\\n\\nconst dmx = 100000\\n'approximation loop maximum\\n\\n\\n'better not change\\n'------------------------------------------------\\nconst amx = 1048576\\n'argument maximum\\n\\nconst Pmax = 32749\\n'max. prime < 2^15\\n\\n\\ntype ratio\\n as longint a, b\\nend type\\n\\ntype padic\\ndeclare function r2pa (byref q as ratio, byval sw as integer) as integer\\n'convert q = a/b to p-adic number, set sw to print\\ndeclare sub printf (byval sw as integer)\\n'print expansion, set sw to print rational\\ndeclare sub crat ()\\n'rational reconstruction\\n\\ndeclare sub add (byref a as padic, byref b as padic)\\n'let self:= a + b\\ndeclare sub cmpt (byref a as padic)\\n'let self:= complement_a\\n\\ndeclare function dsum () as long\\n'weighted digit sum\\n\\n as long d(-emx to emx - 1)\\n as integer v\\nend type\\n\\n\\n'global variables\\ndim shared as long p1, p = 7\\n'default prime\\ndim shared as integer k = 11\\n'precision\\n\\n#define min(a, b) iif((a) > (b), b, a)\\n\\n\\n'------------------------------------------------\\n'convert rational a/b to p-adic number\\nfunction padic.r2pa (byref q as ratio, byval sw as integer) as integer\\ndim as longint a = q.a, b = q.b\\ndim as long r, s, b1\\ndim i as integer\\nr2pa = 0\\n\\n if b = 0 then return 1\\n if b < 0 then b = -b: a = -a\\n if abs(a) > amx or b > amx then return -1\\n if p < 2 or k < 1 then return 1\\n\\n 'max. short prime\\n p = min(p, Pmax)\\n 'max. array length\\n k = min(k, emx - 1)\\n\\n if sw then\\n 'echo numerator, denominator,\\n print a;\\\"/\\\";str(b);\\\" + \\\";\\n 'prime and precision\\n print \\\"O(\\\";str(p);\\\"^\\\";str(k);\\\")\\\"\\n end if\\n\\n 'initialize\\n v = 0\\n p1 = p - 1\\n for i = -emx to emx - 1\\n d(i) = 0: next\\n\\n if a = 0 then return 0\\n\\n i = 0\\n 'find -exponent of p in b\\n do until b mod p\\n b \\\\= p: i -= 1\\n loop\\n\\n s = 0\\n r = b mod p\\n 'modular inverse for small p\\n for b1 = 1 to p1\\n s += r\\n if s > p1 then s -= p\\n if s = 1 then exit for\\n next b1\\n\\n if b1 = p then\\n print \\\"r2pa: impossible inverse mod\\\"\\n return -1\\n end if\\n\\n v = emx\\n do\\n 'find exponent of p in a\\n do until a mod p\\n a \\\\= p: i += 1\\n loop\\n\\n 'valuation\\n if v = emx then v = i\\n\\n 'upper bound\\n if i >= emx then exit do\\n 'check precision\\n if (i - v) > k then exit do\\n\\n 'next digit\\n d(i) = a * b1 mod p\\n if d(i) < 0 then d(i) += p\\n\\n 'remainder - digit * divisor\\n a -= d(i) * b\\n loop while a\\nend function\\n\\n'------------------------------------------------\\n'Horner's rule\\nfunction padic.dsum () as long\\ndim as integer i, t = min(v, 0)\\ndim as long r, s = 0\\n\\n for i = k - 1 + t to t step -1\\n r = s: s *= p\\n if r andalso s \\\\ r - p then\\n 'overflow\\n s = -1: exit for\\n end if\\n s += d(i)\\n next i\\n\\nreturn s\\nend function\\n\\n#macro pint(cp)\\n for j = k - 1 + v to v step -1\\n if cp then exit for\\n next j\\n fl = ((j - v) shl 1) < k\\n#endmacro\\n\\n'rational reconstruction\\nsub padic.crat ()\\ndim as integer i, j, fl\\ndim as padic s = this\\ndim as long x, y\\n\\n 'denominator count\\n for i = 1 to dmx\\n 'check for integer\\n pint(s.d(j))\\n if fl then fl = 0: exit for\\n\\n 'check negative integer\\n pint(p1 - s.d(j))\\n if fl then exit for\\n\\n 'repeatedly add self to s\\n s.add(s, this)\\n next i\\n\\n if fl then s.cmpt(s)\\n\\n 'numerator: weighted digit sum\\n x = s.dsum: y = i\\n\\n if x < 0 or y > dmx then\\n print \\\"crat: fail\\\"\\n\\n else\\n 'negative powers\\n for i = v to -1\\n y *= p: next\\n\\n 'negative rational\\n if fl then x = -x\\n\\n print x;\\n if y > 1 then print \\\"/\\\";str(y);\\n print\\n end if\\nend sub\\n\\n\\n'print expansion\\nsub padic.printf (byval sw as integer)\\ndim as integer i, t = min(v, 0)\\n\\n for i = k - 1 + t to t step -1\\n print d(i);\\n if i = 0 andalso v < 0 then print \\\".\\\";\\n next i\\n print\\n\\n 'rational approximation\\n if sw then crat\\nend sub\\n\\n'------------------------------------------------\\n'carry\\n#macro cstep(dt)\\n if c > p1 then\\n dt = c - p: c = 1\\n else\\n dt = c: c = 0\\n end if\\n#endmacro\\n\\n'let self:= a + b\\nsub padic.add (byref a as padic, byref b as padic)\\ndim i as integer, r as padic\\ndim as long c = 0\\nwith r\\n .v = min(a.v, b.v)\\n\\n for i = .v to k +.v\\n c += a.d(i) + b.d(i)\\n cstep(.d(i))\\n next i\\nend with\\nthis = r\\nend sub\\n\\n'let self:= complement_a\\nsub padic.cmpt (byref a as padic)\\ndim i as integer, r as padic\\ndim as long c = 1\\nwith r\\n .v = a.v\\n\\n for i = .v to k +.v\\n c += p1 - a.d(i)\\n cstep(.d(i))\\n next i\\nend with\\nthis = r\\nend sub\\n\\n\\n'main\\n'------------------------------------------------\\ndim as integer sw\\ndim as padic a, b, c\\ndim q as ratio\\n\\nwidth 64, 30\\ncls\\n\\n'rational reconstruction\\n'depends on the precision -\\n'until the dsum-loop overflows.\\ndata 2,1, 2,4\\ndata 1,1\\n\\ndata 4,1, 2,4\\ndata 3,1\\n\\ndata 4,1, 2,5\\ndata 3,1\\n\\n' 4/9 + O(5^4)\\ndata 4,9, 5,4\\ndata 8,9\\n\\ndata 26,25, 5,4\\ndata -109,125\\n\\ndata 49,2, 7,6\\ndata -4851,2\\n\\ndata -9,5, 3,8\\ndata 27,7\\n\\ndata 5,19, 2,12\\ndata -101,384\\n\\n'two 'decadic' pairs\\ndata 2,7, 10,7\\ndata -1,7\\n\\ndata 34,21, 10,9\\ndata -39034,791\\n\\n'familiar digits\\ndata 11,4, 2,43\\ndata 679001,207\\n\\ndata -8,9, 23,9\\ndata 302113,92\\n\\ndata -22,7, 3,23\\ndata 46071,379\\n\\ndata -22,7, 32749,3\\ndata 46071,379\\n\\ndata 35,61, 5,20\\ndata 9400,109\\n\\ndata -101,109, 61,7\\ndata 583376,6649\\n\\ndata -25,26, 7,13\\ndata 5571,137\\n\\ndata 1,4, 7,11\\ndata 9263,2837\\n\\ndata 122,407, 7,11\\ndata -517,1477\\n\\n'more subtle\\ndata 5,8, 7,11\\ndata 353,30809\\n\\ndata 0,0, 0,0\\n\\n\\nprint\\ndo\\n read q.a,q.b, p,k\\n\\n sw = a.r2pa(q, 1)\\n if sw = 1 then exit do\\n a.printf(0)\\n\\n read q.a,q.b\\n\\n sw or= b.r2pa(q, 1)\\n if sw = 1 then exit do\\n if sw then continue do\\n b.printf(0)\\n\\n c.add(a, b)\\n print \\\"+ =\\\"\\n c.printf(1)\\n\\n print : ?\\nloop\\n\\nsystem\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// constants\\nconst EMX = 64 // exponent maximum (if indexing starts at -EMX)\\nconst DMX = 100000 // approximation loop maximum\\nconst AMX = 1048576 // argument maximum\\nconst PMAX = 32749 // prime maximum\\n\\n// global variables\\nvar p1 = 0\\nvar p = 7 // default prime\\nvar k = 11 // precision\\n\\nfunc abs(a int) int {\\n if a >= 0 {\\n return a\\n }\\n return -a\\n}\\n\\nfunc min(a, b int) int {\\n if a < b {\\n return a\\n }\\n return b\\n}\\n\\ntype Ratio struct {\\n a, b int\\n}\\n\\ntype Padic struct {\\n v int\\n d [2 * EMX]int // add EMX to index to be consistent wih FB\\n}\\n\\n// (re)initialize receiver from Ratio, set 'sw' to print\\nfunc (pa *Padic) r2pa(q Ratio, sw int) int {\\n a := q.a\\n b := q.b\\n if b == 0 {\\n return 1\\n }\\n if b < 0 {\\n b = -b\\n a = -a\\n }\\n if abs(a) > AMX || b > AMX {\\n return -1\\n }\\n if p < 2 || k < 1 {\\n return 1\\n }\\n p = min(p, PMAX) // maximum short prime\\n k = min(k, EMX-1) // maxumum array length\\n if sw != 0 {\\n fmt.Printf(\\\"%d/%d + \\\", a, b) // numerator, denominator\\n fmt.Printf(\\\"0(%d^%d)\\\\n\\\", p, k) // prime, precision\\n }\\n\\n // (re)initialize\\n pa.v = 0\\n p1 = p - 1\\n pa.d = [2 * EMX]int{}\\n if a == 0 {\\n return 0\\n }\\n i := 0\\n\\n // find -exponent of p in b\\n for b%p == 0 {\\n b = b / p\\n i--\\n }\\n s := 0\\n r := b % p\\n\\n // modular inverse for small p\\n b1 := 1\\n for b1 <= p1 {\\n s += r\\n if s > p1 {\\n s -= p\\n }\\n if s == 1 {\\n break\\n }\\n b1++\\n }\\n if b1 == p {\\n fmt.Println(\\\"r2pa: impossible inverse mod\\\")\\n return -1\\n }\\n pa.v = EMX\\n for {\\n // find exponent of P in a\\n for a%p == 0 {\\n a = a / p\\n i++\\n }\\n\\n // valuation\\n if pa.v == EMX {\\n pa.v = i\\n }\\n\\n // upper bound\\n if i >= EMX {\\n break\\n }\\n\\n // check precision\\n if (i - pa.v) > k {\\n break\\n }\\n\\n // next digit\\n pa.d[i+EMX] = a * b1 % p\\n if pa.d[i+EMX] < 0 {\\n pa.d[i+EMX] += p\\n }\\n\\n // remainder - digit * divisor\\n a -= pa.d[i+EMX] * b\\n if a == 0 {\\n break\\n }\\n }\\n return 0\\n}\\n\\n// Horner's rule\\nfunc (pa *Padic) dsum() int {\\n t := min(pa.v, 0)\\n s := 0\\n for i := k - 1 + t; i >= t; i-- {\\n r := s\\n s *= p\\n if r != 0 && (s/r-p != 0) {\\n // overflow\\n s = -1\\n break\\n }\\n s += pa.d[i+EMX]\\n }\\n return s\\n}\\n\\n// add b to receiver\\nfunc (pa *Padic) add(b Padic) *Padic {\\n c := 0\\n r := Padic{}\\n r.v = min(pa.v, b.v)\\n for i := r.v; i <= k+r.v; i++ {\\n c += pa.d[i+EMX] + b.d[i+EMX]\\n if c > p1 {\\n r.d[i+EMX] = c - p\\n c = 1\\n } else {\\n r.d[i+EMX] = c\\n c = 0\\n }\\n }\\n return &r\\n}\\n\\n// complement of receiver\\nfunc (pa *Padic) cmpt() *Padic {\\n c := 1\\n r := Padic{}\\n r.v = pa.v\\n for i := pa.v; i <= k+pa.v; i++ {\\n c += p1 - pa.d[i+EMX]\\n if c > p1 {\\n r.d[i+EMX] = c - p\\n c = 1\\n } else {\\n r.d[i+EMX] = c\\n c = 0\\n }\\n }\\n return &r\\n}\\n\\n// rational reconstruction\\nfunc (pa *Padic) crat() {\\n fl := false\\n s := pa\\n j := 0\\n i := 1\\n\\n // denominator count\\n for i <= DMX {\\n // check for integer\\n j = k - 1 + pa.v\\n for j >= pa.v {\\n if s.d[j+EMX] != 0 {\\n break\\n }\\n j--\\n }\\n fl = ((j - pa.v) * 2) < k\\n if fl {\\n fl = false\\n break\\n }\\n\\n // check negative integer\\n j = k - 1 + pa.v\\n for j >= pa.v {\\n if p1-s.d[j+EMX] != 0 {\\n break\\n }\\n j--\\n }\\n fl = ((j - pa.v) * 2) < k\\n if fl {\\n break\\n }\\n\\n // repeatedly add self to s\\n s = s.add(*pa)\\n i++\\n }\\n if fl {\\n s = s.cmpt()\\n }\\n\\n // numerator: weighted digit sum\\n x := s.dsum()\\n y := i\\n if x < 0 || y > DMX {\\n fmt.Println(x, y)\\n fmt.Println(\\\"crat: fail\\\")\\n } else {\\n // negative powers\\n i = pa.v\\n for i <= -1 {\\n y *= p\\n i++\\n }\\n\\n // negative rational\\n if fl {\\n x = -x\\n }\\n fmt.Print(x)\\n if y > 1 {\\n fmt.Printf(\\\"/%d\\\", y)\\n }\\n fmt.Println()\\n }\\n}\\n\\n// print expansion\\nfunc (pa *Padic) printf(sw int) {\\n t := min(pa.v, 0)\\n for i := k - 1 + t; i >= t; i-- {\\n fmt.Print(pa.d[i+EMX])\\n if i == 0 && pa.v < 0 {\\n fmt.Print(\\\".\\\")\\n }\\n fmt.Print(\\\" \\\")\\n }\\n fmt.Println()\\n // rational approximation\\n if sw != 0 {\\n pa.crat()\\n }\\n}\\n\\nfunc main() {\\n data := [][]int{\\n /* rational reconstruction depends on the precision\\n until the dsum-loop overflows */\\n {2, 1, 2, 4, 1, 1},\\n {4, 1, 2, 4, 3, 1},\\n {4, 1, 2, 5, 3, 1},\\n {4, 9, 5, 4, 8, 9},\\n {26, 25, 5, 4, -109, 125},\\n {49, 2, 7, 6, -4851, 2},\\n {-9, 5, 3, 8, 27, 7},\\n {5, 19, 2, 12, -101, 384},\\n /* two decadic pairs */\\n {2, 7, 10, 7, -1, 7},\\n {34, 21, 10, 9, -39034, 791},\\n /* familiar digits */\\n {11, 4, 2, 43, 679001, 207},\\n {-8, 9, 23, 9, 302113, 92},\\n {-22, 7, 3, 23, 46071, 379},\\n {-22, 7, 32749, 3, 46071, 379},\\n {35, 61, 5, 20, 9400, 109},\\n {-101, 109, 61, 7, 583376, 6649},\\n {-25, 26, 7, 13, 5571, 137},\\n {1, 4, 7, 11, 9263, 2837},\\n {122, 407, 7, 11, -517, 1477},\\n /* more subtle */\\n {5, 8, 7, 11, 353, 30809},\\n }\\n\\n sw := 0\\n a := Padic{}\\n b := Padic{}\\n\\n for _, d := range data {\\n q := Ratio{d[0], d[1]}\\n p = d[2]\\n k = d[3]\\n sw = a.r2pa(q, 1)\\n if sw == 1 {\\n break\\n }\\n a.printf(0)\\n q.a = d[4]\\n q.b = d[5]\\n sw = sw | b.r2pa(q, 1)\\n if sw == 1 {\\n break\\n }\\n if sw == 0 {\\n b.printf(0)\\n c := a.add(b)\\n fmt.Println(\\\"+ =\\\")\\n c.printf(1)\\n }\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE KindSignatures, DataKinds #-}\\nmodule Padic where\\n\\nimport Data.Ratio\\nimport Data.List (genericLength)\\nimport GHC.TypeLits\\n\\ndata Padic (n :: Nat) = Null\\n | Padic { unit :: [Int], order :: Int }\\n\\n-- valuation of the base\\nmodulo :: (KnownNat p, Integral i) => Padic p -> i\\nmodulo = fromIntegral . natVal\\n\\n-- Constructor for zero value\\npZero :: KnownNat p => Padic p\\npZero = Padic (repeat 0) 0\\n\\n-- Smart constructor, adjusts trailing zeros with the order.\\nmkPadic :: (KnownNat p, Integral i) => [i] -> Int -> Padic p\\nmkPadic u k = go 0 (fromIntegral <$> u)\\n where\\n go 17 _ = pZero\\n go i (0:u) = go (i+1) u\\n go i u = Padic u (k-i)\\n\\n-- Constructor for p-adic unit\\nmkUnit :: (KnownNat p, Integral i) => [i] -> Padic p\\nmkUnit u = mkPadic u 0\\n\\n-- Zero test (up to 1/p^17)\\nisZero :: KnownNat p => Padic p -> Bool\\nisZero (Padic u _) = all (== 0) (take 17 u)\\nisZero _ = False\\n\\n-- p-adic norm\\npNorm :: KnownNat p => Padic p -> Ratio Int\\npNorm Null = undefined\\npNorm p = fromIntegral (modulo p) ^^ (- order p)\\n\\n-- test for an integerness up to p^-17\\nisInteger :: KnownNat p => Padic p -> Bool\\nisInteger Null = False\\nisInteger (Padic s k) = case splitAt k s of\\n ([],i) -> length (takeWhile (==0) $ reverse (take 20 i)) > 3\\n _ -> False\\n\\n-- p-adics are shown with 1/p^17 precision\\ninstance KnownNat p => Show (Padic p) where\\n show Null = \\\"Null\\\"\\n show x@(Padic u k) =\\n show (modulo x) ++ \\\"-adic: \\\" ++\\n (case si of {[] -> \\\"0\\\"; _ -> si})\\n ++ \\\".\\\" ++\\n (case f of {[] -> \\\"0\\\"; _ -> sf})\\n where\\n (f,i) = case compare k 0 of\\n LT -> ([], replicate (-k) 0 ++ u)\\n EQ -> ([], u)\\n GT -> splitAt k (u ++ repeat 0)\\n sf = foldMap showD $ reverse $ take 17 f\\n si = foldMap showD $ dropWhile (== 0) $ reverse $ take 17 i\\n el s = if length s > 16 then \\\"…\\\" else \\\"\\\"\\n showD n = [(['0'..'9']++['a'..'z']) !! n]\\n\\ninstance KnownNat p => Eq (Padic p) where\\n a == b = isZero (a - b)\\n\\ninstance KnownNat p => Ord (Padic p) where\\n compare = error \\\"Ordering is undefined fo p-adics.\\\"\\n\\ninstance KnownNat p => Num (Padic p) where\\n fromInteger 0 = pZero\\n fromInteger n = pAdic (fromInteger n)\\n\\n x@(Padic a ka) + Padic b kb = mkPadic s k\\n where\\n k = ka `max` kb\\n s = addMod (modulo x)\\n (replicate (k-ka) 0 ++ a)\\n (replicate (k-kb) 0 ++ b)\\n _ + _ = Null\\n\\n x@(Padic a ka) * Padic b kb =\\n mkPadic (mulMod (modulo x) a b) (ka + kb)\\n _ * _ = Null\\n\\n negate x@(Padic u k) =\\n case map (\\\\y -> modulo x - 1 - y) u of\\n n:ns -> Padic ((n+1):ns) k\\n [] -> pZero\\n negate _ = Null\\n\\n abs p = pAdic (pNorm p)\\n\\n signum = undefined\\n\\n------------------------------------------------------------\\n-- conversion from rationals to p-adics\\n\\ninstance KnownNat p => Fractional (Padic p) where\\n fromRational = pAdic\\n\\n recip Null = Null\\n recip x@(Padic (u:us) k)\\n | isZero x = Null\\n | gcd p u /= 1 = Null\\n | otherwise = mkPadic res (-k)\\n where\\n p = modulo x\\n res = longDivMod p (1:repeat 0) (u:us)\\n\\npAdic :: (Show i, Integral i, KnownNat p)\\n => Ratio i -> Padic p\\npAdic 0 = pZero\\npAdic x = res\\n where\\n p = modulo res\\n (k, q) = getUnit p x\\n (n, d) = (numerator q, denominator q)\\n res = maybe Null process $ recipMod p d\\n\\n process r = mkPadic (series n) k\\n where\\n series n\\n | n == 0 = repeat 0\\n | n `mod` p == 0 = 0 : series (n `div` p)\\n | otherwise =\\n let m = (n * r) `mod` p\\n in m : series ((n - m * d) `div` p)\\n\\n------------------------------------------------------------\\n-- conversion from p-adics to rationals\\n-- works for relatively small denominators\\n\\ninstance KnownNat p => Real (Padic p) where\\n toRational Null = error \\\"no rational representation!\\\"\\n toRational x@(Padic s k) = res\\n where\\n p = modulo x\\n res = case break isInteger $ take 10000 $ iterate (x +) x of\\n (_,[]) -> - toRational (- x)\\n (d, i:_) -> (fromBase p (unit i) * (p^(- order i))) % (genericLength d + 1)\\n\\n fromBase p = foldr (\\\\x r -> r*p + x) 0 .\\n take 20 . map fromIntegral\\n\\n--------------------------------------------------------------------------------\\n-- helper functions\\n\\n-- extracts p-adic unit from a rational number\\ngetUnit :: Integral i => i -> Ratio i -> (Int, Ratio i)\\ngetUnit p x = (genericLength k1 - genericLength k2, c)\\n where\\n (k1,b:_) = span (\\\\n -> denominator n `mod` p == 0) $\\n iterate (* fromIntegral p) x\\n (k2,c:_) = span (\\\\n -> numerator n `mod` p == 0) $\\n iterate (/ fromIntegral p) b\\n\\n\\n-- Reciprocal of a number modulo p (extended Euclidean algorithm).\\n-- For non-prime p returns Nothing non-invertible element of the ring.\\nrecipMod :: Integral i => i -> i -> Maybe i\\nrecipMod p 1 = Just 1\\nrecipMod p a | gcd p a == 1 = Just $ go 0 1 p a\\n | otherwise = Nothing\\n where\\n go t _ _ 0 = t `mod` p\\n go t nt r nr =\\n let q = r `div` nr\\n in go nt (t - q*nt) nr (r - q*nr)\\n\\n-- Addition of two sequences modulo p\\naddMod p = go 0\\n where\\n go 0 [] ys = ys\\n go 0 xs [] = xs\\n go s [] ys = go 0 [s] ys\\n go s xs [] = go 0 xs [s]\\n go s (x:xs) (y:ys) =\\n let (q, r) = (x + y + s) `divMod` p\\n in r : go q xs ys\\n\\n-- Subtraction of two sequences modulo p\\nsubMod p a (b:bs) = addMod p a $ (p-b) : ((p - 1 -) <$> bs)\\n\\n-- Multiplication of two sequences modulo p\\nmulMod p as [b] = mulMod p [b] as\\nmulMod p as bs = case as of\\n [0] -> repeat 0\\n [1] -> bs\\n [a] -> go 0 bs\\n where\\n go s [] = [s]\\n go s (b:bs) =\\n let (q, r) = (a * b + s) `divMod` p\\n in r : go q bs\\n as -> go bs\\n where\\n go [] = []\\n go (b:bs) =\\n let c:cs = mulMod p [b] as\\n in c : addMod p (go bs) cs\\n\\n-- Division of two sequences modulo p\\nlongDivMod p a (b:bs) = case recipMod p b of\\n Nothing -> error $\\n show b ++ \\\" is not invertible modulo \\\" ++ show p\\n Just r -> go a\\n where\\n go [] = []\\n go (0:xs) = 0 : go xs\\n go (x:xs) =\\n let m = (x*r) `mod` p\\n _:zs = subMod p (x:xs) (mulMod p [m] (b:bs))\\n in m : go zs\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"public final class PAdicNumbersBasic {\\n\\n\\tpublic static void main(String[] args) {\\n\\t\\tSystem.out.println(\\\"3-adic numbers:\\\");\\n\\t\\tPadic padicOne = new Padic(3, -5, 9);\\n\\t\\tSystem.out.println(\\\"-5 / 9 => \\\" + padicOne);\\n\\t\\tPadic padicTwo = new Padic(3, 47, 12);\\n\\t\\tSystem.out.println(\\\"47 / 12 => \\\" + padicTwo);\\n\\t\\t\\n\\t\\tPadic sum = padicOne.add(padicTwo);\\n\\t\\tSystem.out.println(\\\"sum => \\\" + sum);\\t\\t\\n\\t\\tSystem.out.println(\\\"Rational = \\\" + sum.convertToRational());\\n\\t\\tSystem.out.println();\\t\\t\\n\\t\\n\\t\\tSystem.out.println(\\\"7-adic numbers:\\\");\\n\\t\\tpadicOne = new Padic(7, 5, 8);\\n\\t\\tSystem.out.println(\\\"5 / 8 => \\\" + padicOne);\\n\\t\\tpadicTwo = new Padic(7, 353, 30809);\\n\\t\\tSystem.out.println(\\\"353 / 30809 => \\\" + padicTwo);\\n\\t\\t\\n\\t\\tsum = padicOne.add(padicTwo);\\n\\t\\tSystem.out.println(\\\"sum => \\\" + sum);\\t\\t\\t\\n\\t\\tSystem.out.println(\\\"Rational = \\\" + sum.convertToRational());\\n\\t}\\n}\\n\\nfinal class Padic {\\t\\n\\t/**\\n\\t * Create a p-adic, with p = aPrime, from the given rational 'aNumerator' / 'aDenominator'.\\n\\t */\\n\\tpublic Padic(int aPrime, int aNumerator, int aDenominator) {\\n\\t\\tif ( aDenominator == 0 ) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"Denominator cannot be zero\\\");\\n\\t\\t}\\t\\n\\t\\t\\n\\t\\tprime = aPrime;\\t\\n\\t\\tdigits = new ArrayList<Integer>(DIGITS_SIZE);\\n\\t\\torder = 0;\\n\\t\\t\\n\\t\\t// Process rational zero\\n\\t\\tif ( aNumerator == 0 ) {\\n\\t\\t\\torder = MAX_ORDER;\\t\\t\\t\\t\\t\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// Remove multiples of 'prime' and adjust the order of the p-adic number accordingly\\n\\t\\twhile ( Math.floorMod(aNumerator, prime) == 0 ) {\\t\\t\\t\\n\\t\\t\\taNumerator /= prime;\\n\\t\\t\\torder += 1;\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile ( Math.floorMod(aDenominator, prime) == 0 ) {\\t\\t\\t\\n\\t\\t\\taDenominator /= prime;\\n\\t\\t\\torder -= 1;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Standard calculation of p-adic digits\\n\\t\\tfinal long inverse = moduloInverse(aDenominator);\\t\\t\\n\\t\\twhile ( digits.size() < DIGITS_SIZE ) {\\n\\t\\t\\tfinal int digit = Math.floorMod(aNumerator * inverse, prime);\\n\\t\\t\\tdigits.addLast(digit);\\n\\t\\t\\t\\n\\t\\t\\taNumerator -= digit * aDenominator;\\n\\t\\t\\t\\n\\t\\t\\tif ( aNumerator != 0 ) {\\n\\t\\t\\t// The denominator is not a power of a prime\\n\\t\\t\\t\\tint count = 0;\\n\\t\\t\\t\\twhile ( Math.floorMod(aNumerator, prime) == 0 ) {\\n\\t\\t\\t\\t\\taNumerator /= prime;\\n\\t\\t\\t\\t\\tcount += 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor ( int i = count; i > 1; i-- ) {\\n\\t\\t\\t\\t\\tdigits.addLast(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\t\\t\\n\\t}\\n\\t\\n\\t/**\\n * Return the sum of this p-adic number and the given p-adic number.\\n */\\n public Padic add(Padic aOther) {\\n \\tif ( prime != aOther.prime ) {\\n \\t\\tthrow new IllegalArgumentException(\\\"Cannot add p-adic's with different primes\\\");\\n \\t}\\n \\t\\n List<Integer> result = new ArrayList<Integer>();\\n\\n // Adjust the digits so that the p-adic points are aligned\\n for ( int i = 0; i < -order + aOther.order; i++ ) {\\n \\taOther.digits.addFirst(0);\\n }\\n\\n for ( int i = 0; i < -aOther.order + order; i++ ) {\\n \\tdigits.addFirst(0);\\n }\\n\\n // Standard digit by digit addition\\n int carry = 0;\\n for ( int i = 0; i < Math.min(digits.size(), aOther.digits.size()); i++ ) { \\t\\n final int sum = digits.get(i) + aOther.digits.get(i) + carry;\\n final int remainder = Math.floorMod(sum, prime);\\n carry = ( sum >= prime ) ? 1 : 0;\\n result.addLast(remainder);\\n }\\n\\n // Reverse the changes made to the digits\\n for ( int i = 0; i < -order + aOther.order; i++ ) {\\n \\taOther.digits.removeFirst();\\n }\\n\\n for ( int i = 0; i < -aOther.order + order; i++ ) {\\n \\tdigits.removeFirst();\\n }\\n\\n return new Padic(prime, result, allZeroDigits(result) ? MAX_ORDER : Math.min(order, aOther.order));\\n }\\n\\n /**\\n * Return the Rational representation of this p-adic number.\\n */\\n public Rational convertToRational() {\\n \\tList<Integer> numbers = new ArrayList<Integer>(digits); \\t\\n \\t\\n \\t// Zero\\n \\tif ( allZeroDigits(numbers) ) {\\n \\t\\treturn new Rational(0, 1);\\n \\t} \\t\\n \\t\\n \\t// Positive integer\\n \\tif ( order >= 0 && endsWith(numbers, 0) ) {\\n \\t\\tfor ( int i = 0; i < order; i++ ) {\\n\\t \\t\\tnumbers.addFirst(0);\\n\\t \\t}\\n \\t\\t\\n\\t \\treturn new Rational(convertToDecimal(numbers), 1);\\n \\t} \\t\\n \\t\\n \\t// Negative integer\\n \\tif ( order >= 0 && endsWith(numbers, prime - 1) ) { \\t\\n\\t \\tnegateList(numbers);\\n\\t \\tfor ( int i = 0; i < order; i++ ) {\\n\\t \\t\\tnumbers.addFirst(0);\\n\\t \\t}\\n\\t \\t\\n\\t \\treturn new Rational(-convertToDecimal(numbers), 1);\\n \\t} \\t\\n\\n \\t// Rational\\n \\tPadic sum = new Padic(prime, digits, order);\\n \\tPadic self = new Padic(prime, digits, order);\\n \\tint denominator = 1;\\n \\tdo {\\n \\t\\tsum = sum.add(self);\\n \\t\\tdenominator += 1;\\n \\t} while ( ! ( endsWith(sum.digits, 0) || endsWith(sum.digits, prime - 1) ) );\\n \\t\\n \\tfinal boolean negative = endsWith(sum.digits, prime - 1);\\n \\tif ( negative ) {\\n \\t\\tnegateList(sum.digits);\\n \\t}\\n \\t\\n \\tint numerator = negative ? -convertToDecimal(sum.digits) : convertToDecimal(sum.digits);\\n \\t\\n \\tif ( order > 0 ) {\\n \\t\\tnumerator *= Math.pow(prime, order);\\n \\t}\\n \\t\\n \\tif ( order < 0 ) {\\n \\t\\tdenominator *= Math.pow(prime, -order);\\n \\t}\\n \\t\\n \\treturn new Rational(numerator, denominator);\\n }\\n\\n /**\\n\\t * Return a string representation of this p-adic.\\n\\t */\\n\\tpublic String toString() {\\n\\t\\twhile ( digits.size() > PRECISION ) {\\n\\t\\t\\tdigits.removeLast();\\n\\t\\t}\\n\\t\\tpadWithZeros(digits);\\n\\t\\t\\n\\t\\tStringBuilder builder = new StringBuilder();\\n\\t\\tfor ( int i = digits.size() - 1; i >= 0; i-- ) {\\n\\t\\t\\tbuilder.append(digits.get(i));\\n\\t\\t}\\n\\t\\t\\n\\t\\tif ( order >= 0 ) {\\n\\t\\t\\tfor ( int i = 0; i < order; i++ ) {\\n\\t\\t\\t\\tbuilder.append(\\\"0\\\");\\n\\t\\t\\t\\tbuilder.deleteCharAt(0);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tbuilder.append(\\\".0\\\");\\n\\t\\t} else {\\n\\t\\t\\tbuilder.insert(builder.length() + order, \\\".\\\");\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\treturn \\\" ...\\\" + builder.toString();\\n\\t}\\t\\n\\t\\t\\n\\t// PRIVATE //\\n\\n /**\\n\\t * Create a p-adic, with p = 'aPrime', directly from a list of digits.\\n\\t *\\n\\t * With 'aOrder' = 0, the list [1, 2, 3, 4, 5] creates the p-adic ...54321.0\\n\\t * 'aOrder' > 0 shifts the list 'aOrder' places to the left and\\n\\t * 'aOrder' < 0 shifts the list 'aOrder' places to the right.\\n\\t */\\n\\tprivate Padic(int aPrime, List<Integer> aDigits, int aOrder) {\\n\\t\\tprime = aPrime;\\t\\t\\n\\t\\tdigits = new ArrayList<Integer>(aDigits);\\n\\t\\tpadWithZeros(digits);\\n\\t\\torder = aOrder;\\n\\t}\\t\\n\\t\\n\\t/**\\n\\t * Return the multiplicative inverse of the given decimal number modulo 'prime'.\\n\\t */\\n\\tprivate int moduloInverse(int aNumber) {\\n\\t\\tint inverse = 1;\\n\\t\\twhile ( Math.floorMod(inverse * aNumber, prime) != 1 ) {\\n\\t\\t\\tinverse += 1;\\n\\t\\t}\\t\\n\\t\\t\\n\\t\\treturn inverse;\\n\\t}\\n\\t\\n\\t/**\\n\\t * Transform the given list of digits representing a p-adic number\\n\\t * into a list which represents the negation of the p-adic number.\\n\\t */\\n\\tprivate void negateList(List<Integer> aDigits) {\\t\\t\\n\\t\\taDigits.set(0, ( prime - aDigits.get(0) ) % prime);\\n \\tfor ( int i = 1; i < aDigits.size(); i++ ) {\\n \\t\\taDigits.set(i, prime - 1 - aDigits.get(i));\\n \\t}\\n\\t}\\t\\n\\t\\n\\t/**\\n\\t * Return the given list of base 'prime' integers converted to a decimal integer.\\n\\t */\\n\\tprivate int convertToDecimal(List<Integer> aNumbers) {\\n\\t\\tint decimal = 0;\\n\\t\\tint multiple = 1;\\n\\t\\tfor ( int number : aNumbers ) {\\n\\t\\t\\tdecimal += number * multiple;\\t\\t\\t\\t\\n\\t\\t\\tmultiple *= prime;\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn decimal;\\n\\t}\\n\\t\\n\\t/**\\n\\t * Return whether the given list consists of all zeros.\\n\\t */\\n\\tprivate static boolean allZeroDigits(List<Integer> aList) {\\n\\t\\treturn aList.stream().allMatch( i -> i == 0 );\\n\\t}\\n\\t\\n\\t/**\\n\\t * The given list is padded on the right by zeros up to a maximum length of 'PRECISION'.\\n\\t */\\n\\tprivate static void padWithZeros(List<Integer> aList) {\\n\\t\\twhile ( aList.size() < PRECISION ) {\\n\\t\\t\\taList.addLast(0);\\n\\t\\t}\\n\\t}\\n\\t\\n\\t/**\\n\\t * Return whether the given list ends with multiple instances of the given number.\\n\\t */\\n\\tprivate static boolean endsWith(List<Integer> aDigits, int aDigit) {\\n\\t\\tfor ( int i = aDigits.size() - 1; i >= aDigits.size() - PRECISION / 2; i-- ) {\\n\\t\\t\\tif ( aDigits.get(i) != aDigit ) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn true;\\n\\t}\\n\\t\\n\\tprivate static class Rational {\\n\\t\\t\\n\\t\\tpublic Rational(int aNumerator, int aDenominator) {\\n\\t\\t\\tif ( aDenominator < 0 ) {\\n\\t \\t\\tnumerator = -aNumerator;\\n\\t \\t\\tdenominator = -aDenominator;\\n\\t \\t} else {\\n\\t \\t\\tnumerator = aNumerator;\\n\\t \\t\\tdenominator = aDenominator;\\n\\t \\t}\\n\\t\\t\\t\\n\\t\\t\\tif ( aNumerator == 0 ) {\\n\\t \\t\\tdenominator = 1;\\n\\t \\t}\\t\\t\\t\\n\\t \\t\\n\\t \\tfinal int gcd = gcd(numerator, denominator);\\n\\t \\tnumerator /= gcd;\\n\\t \\tdenominator /= gcd;\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tpublic String toString() {\\n\\t\\t\\treturn numerator + \\\" / \\\" + denominator;\\n\\t\\t}\\n\\t\\t\\n\\t\\tprivate int gcd(int aOne, int aTwo) {\\n\\t\\t\\tif ( aTwo == 0 ) {\\n\\t \\t\\treturn Math.abs(aOne);\\n\\t \\t}\\n\\t \\treturn gcd(aTwo, Math.floorMod(aOne, aTwo));\\n\\t\\t}\\n\\t\\t\\n\\t\\tprivate int numerator;\\n\\t\\tprivate int denominator;\\n\\t\\t\\n\\t}\\n\\t\\n\\tprivate List<Integer> digits;\\n\\tprivate int order;\\n\\t\\n\\tprivate final int prime;\\t\\n\\t\\n\\tprivate static final int MAX_ORDER = 1_000;\\n\\tprivate static final int PRECISION = 40;\\n\\tprivate static final int DIGITS_SIZE = PRECISION + 5;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Nemo, LinearAlgebra\\n\\nset_printing_mode(FlintPadicField, :terse)\\n\\n\\\"\\\"\\\" convert to Rational (rational reconstruction) \\\"\\\"\\\"\\nfunction toRational(pa::padic)\\n rat = lift(QQ, pa)\\n r, den = BigInt(numerator(rat)), Int(denominator(rat))\\n p, k = Int(prime(parent(pa))), Int(precision(pa))\\n N = BigInt(p^k)\\n a1, a2 = [N, 0], [r, 1]\\n while dot(a1, a1) > dot(a2, a2)\\n q = dot(a1, a2) // dot(a2, a2)\\n a1, a2 = a2, a1 - BigInt(round(q)) * a2\\n end\\n if dot(a1, a1) < N\\n return (Rational{Int}(a1[1]) // Rational{Int}(a1[2])) // Int(den)\\n else\\n return Int(r) // den\\n end\\nend\\n\\nfunction dstring(pa::padic)\\n u, v, n, p, k = pa.u, pa.v, pa.N, pa.parent.p, pa.parent.prec_max\\n d = digits(v > 0 ? u * p^v : u, base=pa.parent.p, pad=k)\\n return prod([i == k + v && v != 0 ? \\\"$x . \\\" : \\\"$x \\\" for (i, x) in enumerate(reverse(d))])\\nend\\n\\nconst DATA = [\\n [2, 1, 2, 4, 1, 1],\\n [4, 1, 2, 4, 3, 1],\\n [4, 1, 2, 5, 3, 1],\\n [4, 9, 5, 4, 8, 9],\\n [26, 25, 5, 4, -109, 125],\\n [49, 2, 7, 6, -4851, 2],\\n [-9, 5, 3, 8, 27, 7],\\n [5, 19, 2, 12, -101, 384],\\n\\n # Base 10 10-adic p-adics are not allowed by Nemo library -- p must be a prime\\n\\n # familiar digits\\n [11, 4, 2, 43, 679001, 207],\\n [-8, 9, 23, 9, 302113, 92],\\n [-22, 7, 3, 23, 46071, 379],\\n [-22, 7, 32749, 3, 46071, 379],\\n [35, 61, 5, 20, 9400, 109],\\n [-101, 109, 61, 7, 583376, 6649],\\n [-25, 26, 7, 13, 5571, 137],\\n [1, 4, 7, 11, 9263, 2837],\\n [122, 407, 7, 11, -517, 1477],\\n # more subtle\\n [5, 8, 7, 11, 353, 30809],\\n]\\n\\nfor (num1, den1, P, K, num2, den2) in DATA\\n Qp = PadicField(P, K)\\n a = Qp(QQ(num1 // den1))\\n b = Qp(QQ(num2 // den2))\\n c = a + b\\n r = toRational(c)\\n println(a, \\\"\\\\n\\\", dstring(a), \\\"\\\\n\\\", b, \\\"\\\\n\\\", dstring(b), \\\"\\\\n+ =\\\\n\\\", c, \\\"\\\\n\\\", dstring(c), \\\" $r\\\\n\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import math, strformat\\n\\nconst\\n Emx = 64 # Exponent maximum.\\n Dmx = 100000 # Approximation loop maximum.\\n Amx = 1048576 # Argument maximum.\\n PMax = 32749 # Prime maximum.\\n\\ntype\\n\\n Ratio = tuple[a, b: int]\\n\\n Padic = object\\n p: int # Prime.\\n k: int # Precision.\\n v: int\\n d: array[-Emx..(Emx-1), int]\\n\\n PadicError = object of ValueError\\n\\n\\nproc r2pa(pa: var Padic; q: Ratio; sw: bool) =\\n ## Convert \\\"q\\\" to p-adic number, set \\\"sw\\\" to print.\\n\\n var (a, b) = q\\n\\n if b == 0:\\n raise newException(PadicError, &\\\"Wrong rational: {a}/{b}\\\" )\\n if b < 0:\\n b = -b\\n a = -a\\n if abs(a) > Amx or b > Amx:\\n raise newException(PadicError, &\\\"Rational exceeding limits: {a}/{b}\\\")\\n if pa.p < 2:\\n raise newException(PadicError, &\\\"Wrong value for p: {pa.p}\\\")\\n if pa.k < 1:\\n raise newException(PadicError, &\\\"Wrong value for k: {pa.k}\\\")\\n pa.p = min(pa.p, PMax) # Maximum short prime.\\n pa.k = min(pa.k, Emx - 1) # Maximum array length.\\n\\n if sw: echo &\\\"{a}/{b} + 0({pa.p}^{pa.k})\\\"\\n\\n # Initialize.\\n pa.v = 0\\n pa.d.reset()\\n if a == 0: return\\n var i = 0\\n\\n # Find -exponent of \\\"p\\\" in \\\"b\\\".\\n while b mod pa.p == 0:\\n b = b div pa.p\\n dec i\\n\\n var s = 0\\n var r = b mod pa.p\\n\\n # Modular inverse for small \\\"p\\\".\\n var b1 = 1\\n while b1 < pa.p:\\n inc s, r\\n if s >= pa.p: dec s, pa.p\\n if s == 1: break\\n inc b1\\n if b1 == pa.p:\\n raise newException(PadicError, \\\"Impossible to compute inverse modulo\\\")\\n pa.v = Emx\\n while true:\\n # Find exponent of \\\"p\\\" in \\\"a\\\".\\n while a mod pa.p == 0:\\n a = a div pa.p\\n inc i\\n # Valuation.\\n if pa.v == Emx: pa.v = i\\n # Upper bound.\\n if i >= Emx: break\\n # Check precision.\\n if i - pa.v > pa.k: break\\n # Next digit.\\n pa.d[i] = floorMod(a * b1, pa.p)\\n # Remainder - digit * divisor.\\n dec a, pa.d[i] * b\\n if a == 0: break\\n\\n\\nfunc dsum(pa: Padic): int =\\n ## Horner's rule.\\n let t = min(pa.v, 0)\\n for i in countdown(pa.k - 1 + t, t):\\n var r = result\\n result *= pa.p\\n if r != 0 and (result div r - pa.p) != 0:\\n return -1 # Overflow.\\n inc result, pa.d[i]\\n\\n\\nfunc `+`(pa, pb: Padic): Padic =\\n ## Add two p-adic numbers.\\n assert pa.p == pb.p and pa.k == pb.k\\n result.p = pa.p\\n result.k = pa.k\\n var c = 0\\n result.v = min(pa.v, pb.v)\\n for i in result.v..(pa.k + result.v):\\n inc c, pa.d[i] + pb.d[i]\\n if c >= pa.p:\\n result.d[i] = c - pa.p\\n c = 1\\n else:\\n result.d[i] = c\\n c = 0\\n\\n\\nfunc cmpt(pa: Padic): Padic =\\n ## Return the complement.\\n var c = 1\\n result.p = pa.p\\n result.k = pa.k\\n result.v = pa.v\\n for i in pa.v..(pa.k + pa.v):\\n inc c, pa.p - 1 - pa.d[i]\\n if c >= pa.p:\\n result.d[i] = c - pa.p\\n c = 1\\n else:\\n result.d[i] = c\\n c = 0\\n\\n\\nfunc crat(pa: Padic): string =\\n ## Rational reconstruction.\\n var s = pa\\n\\n # Denominator count.\\n var i = 1\\n var fl = false\\n while i <= Dmx:\\n # Check for integer.\\n var j = pa.k - 1 + pa.v\\n while j >= pa.v:\\n if s.d[j] != 0: break\\n dec j\\n fl = (j - pa.v) * 2 < pa.k\\n if fl:\\n fl = false\\n break\\n # Check negative integer.\\n j = pa.k - 1 + pa.v\\n while j >= pa.v:\\n if pa.p - 1 - s.d[j] != 0: break\\n dec j\\n fl = (j - pa.v) * 2 < pa.k\\n if fl: break\\n # Repeatedly add \\\"pa\\\" to \\\"s\\\".\\n s = s + pa\\n inc i\\n\\n if fl: s = s.cmpt()\\n\\n # Numerator: weighted digit sum.\\n var x = s.dsum()\\n var y = i\\n if x < 0 or y > Dmx:\\n raise newException(PadicError, &\\\"Error during rational reconstruction: {x}, {y}\\\")\\n # Negative powers.\\n for i in pa.v..(-1): y *= pa.p\\n # Negative rational.\\n if fl: x = -x\\n result = $x\\n if y > 1: result.add &\\\"/{y}\\\"\\n\\n\\nfunc `$`(pa: Padic): string =\\n ## String representation.\\n let t = min(pa.v, 0)\\n for i in countdown(pa.k - 1 + t, t):\\n result.add $pa.d[i]\\n if i == 0 and pa.v < 0: result.add \\\".\\\"\\n result.add \\\" \\\"\\n\\n\\nproc print(pa: Padic; sw: int) =\\n echo pa\\n # Rational approximation.\\n if sw != 0: echo pa.crat()\\n\\n\\nwhen isMainModule:\\n\\n # Rational reconstruction depends on the precision\\n # until the dsum-loop overflows.\\n const Data = [[2, 1, 2, 4, 1, 1],\\n [4, 1, 2, 4, 3, 1],\\n [4, 1, 2, 5, 3, 1],\\n [4, 9, 5, 4, 8, 9],\\n [26, 25, 5, 4, -109, 125],\\n [49, 2, 7, 6, -4851, 2],\\n [-9, 5, 3, 8, 27, 7],\\n [5, 19, 2, 12, -101, 384],\\n # Two decadic pairs.\\n [2, 7, 10, 7, -1, 7],\\n [34, 21, 10, 9, -39034, 791],\\n # Familiar digits.\\n [11, 4, 2, 43, 679001, 207],\\n [-8, 9, 23, 9, 302113, 92],\\n [-22, 7, 3, 23, 46071, 379],\\n [-22, 7, 32749, 3, 46071, 379],\\n [35, 61, 5, 20, 9400, 109],\\n [-101, 109, 61, 7, 583376, 6649],\\n [-25, 26, 7, 13, 5571, 137],\\n [1, 4, 7, 11, 9263, 2837],\\n [122, 407, 7, 11, -517, 1477],\\n # More subtle.\\n [5, 8, 7, 11, 353, 30809]]\\n\\n for d in Data:\\n try:\\n var a, b = Padic(p: d[2], k: d[3])\\n r2pa(a, (d[0], d[1]), true)\\n print(a, 0)\\n r2pa(b, (d[4], d[5]), true)\\n print(b, 0)\\n echo \\\"+ =\\\"\\n print(a + b, 1)\\n echo \\\"\\\"\\n except PadicError:\\n echo getCurrentExceptionMsg()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"// constants\\nconstant EMX = 64 // exponent maximum (if indexing starts at -EMX)\\nconstant DMX = 1e5 // approximation loop maximum\\nconstant AMX = 1048576 // argument maximum\\nconstant PMAX = 32749 // prime maximum\\n\\n// global variables\\ninteger p1 = 0\\ninteger p = 7 // default prime\\ninteger k = 11 // precision\\n\\ntype Ratio(sequence r)\\n return length(r)=2 and integer(r[1]) and integer(r[2])\\nend type\\n\\nprocedure pad_to(string fmt, sequence data, integer len)\\n fmt = sprintf(fmt,data)\\n puts(1,fmt&repeat(' ',len-length(fmt)))\\nend procedure\\n\\nclass Padic\\n integer v = 0\\n sequence d = repeat(0,EMX*2)\\n\\n // (re)initialize 'this' from Ratio, set 'sw' to print\\n function r2pa(Ratio q, integer sw)\\n integer {a,b} = q\\n if b=0 then return 1 end if\\n if b<0 then\\n b = -b\\n a = -a\\n end if\\n if abs(a)>AMX or b>AMX then return -1 end if\\n if p<2 or k<1 then return 1 end if\\n p = min(p, PMAX) // maximum short prime\\n k = min(k, EMX-1) // maximum array length\\n if sw!=0 then\\n -- numerator, denominator, prime, precision\\n pad_to(\\\"%d/%d + O(%d^%d)\\\",{a,b,p,k},30)\\n end if\\n\\n // (re)initialize\\n v = 0\\n p1 = p - 1\\n sequence ntd = repeat(0,2*EMX) -- (new this.d)\\n if a=0 then return 0 end if\\n\\n // find -exponent of p in b\\n integer i = 0\\n while remainder(b,p)=0 do\\n b /= p\\n i -= 1\\n end while\\n integer s = 0,\\n r = remainder(b,p)\\n\\n // modular inverse for small P\\n integer b1 = 1\\n while b1<=p1 do\\n s += r\\n if s>p1 then s -= p end if\\n if s=1 then exit end if\\n b1 += 1\\n end while\\n if b1=p then\\n printf(1,\\\"r2pa: impossible inverse mod\\\")\\n return -1\\n end if\\n v = EMX\\n while true do\\n // find exponent of P in a\\n while remainder(a,p)=0 do\\n a /= p\\n i += 1\\n end while\\n\\n // valuation\\n if v=EMX then v = i end if\\n\\n // upper bound\\n if i>=EMX then exit end if\\n\\n // check precision\\n if i-v>k then exit end if\\n\\n // next digit\\n integer rdx = remainder(a*b1,p)\\n if rdx<0 then rdx += p end if\\n if rdx<0 or rdx>=p then ?9/0 end if -- sanity chk\\n ntd[i+EMX+1] = rdx\\n\\n // remainder - digit * divisor\\n a -= rdx*b\\n if a=0 then exit end if\\n end while\\n this.d = ntd\\n return 0\\n end function\\n\\n // Horner's rule\\n function dsum()\\n integer t = min(v, 0),\\n s = 0\\n for i=k-1+t to t by -1 do\\n integer r = s\\n s *= p\\n if r!=0 and floor(s/r)-p!=0 then\\n // overflow\\n s = -1\\n exit\\n end if\\n s += d[i+EMX+1]\\n end for\\n return s\\n end function\\n\\n // add b to 'this'\\n function add(Padic b)\\n integer c = 0\\n Padic r = new({min(v,b.v)})\\n sequence rd = r.d\\n for i=r.v to k+r.v do\\n integer dx = i+EMX+1\\n c += d[dx] + b.d[dx]\\n if c>p1 then\\n rd[dx] = c - p\\n c = 1\\n else\\n rd[dx] = c\\n c = 0\\n end if\\n end for\\n r.d = rd\\n return r\\n end function\\n\\n // complement\\n function complement()\\n integer c = 1\\n Padic r = new({v})\\n sequence rd = r.d\\n for i=v to k+v do\\n integer dx = i+EMX+1\\n c += p1 - this.d[dx]\\n if c>p1 then\\n rd[dx] = c - p\\n c = 1\\n else\\n rd[dx] = c\\n c = 0\\n end if\\n end for\\n r.d = rd\\n return r\\n end function\\n\\n // rational reconstruction\\n procedure crat()\\n integer sgn = 1\\n Padic s = this\\n integer j = 0,\\n i = 1\\n\\n // denominator count\\n while i<=DMX do\\n // check for integer\\n j = k-1+v\\n while j>=v and s.d[j+EMX+1]=0 do\\n j -= 1\\n end while\\n if ((j-v)*2)<k then exit end if\\n\\n // check for negative integer\\n j = k-1+v\\n while j>=v and p1-s.d[j+EMX+1]=0 do\\n j -= 1\\n end while\\n if ((j-v)*2)<k then\\n s = s.complement()\\n sgn = -1\\n exit\\n end if\\n\\n // repeatedly add self to s\\n s = s.add(this)\\n i += 1\\n end while\\n\\n // numerator: weighted digit sum\\n integer x = s.dsum(),\\n y = i\\n if x<0 or y>DMX then\\n printf(1,\\\"crat: fail\\\")\\n else\\n // negative powers\\n for i=v to -1 do\\n y *= p\\n end for\\n pad_to(iff(y=1?\\\"%d\\\":\\\"%d/%d\\\"),{x*sgn,y},26)\\n printf(1,\\\"+ = \\\")\\n end if\\n end procedure\\n\\n // print expansion\\n procedure prntf(bool sw)\\n integer t = min(v, 0)\\n // rational approximation\\n if sw!=0 then crat() end if\\n for i=k-1+t to t by -1 do\\n printf(1,\\\"%d\\\",d[i+EMX+1])\\n printf(1,iff(i=0 and v<0?\\\". \\\":\\\" \\\"))\\n end for\\n printf(1,\\\"\\\\n\\\")\\n end procedure\\nend class\\n\\nsequence data = {\\n /* rational reconstruction limits are relative to the precision */\\n {{2, 1}, 2, 4, {1, 1}},\\n {{4, 1}, 2, 4, {3, 1}},\\n {{4, 1}, 2, 5, {3, 1}},\\n {{4, 9}, 5, 4, {8, 9}},\\n-- all tested, but let's keep the output reasonable:\\n-- {{-7, 5}, 7, 4, {99, 70}},\\n-- {{26, 25}, 5, 4, {-109, 125}},\\n-- {{49, 2}, 7, 6, {-4851, 2}},\\n-- {{-9, 5}, 3, 8, {27, 7}},\\n-- {{5, 19}, 2, 12, {-101, 384}},\\n-- /* four decadic pairs */\\n-- {{6, 7}, 10, 7, {-5, 7}},\\n-- {{2, 7}, 10, 7, {-3, 7}},\\n-- {{2, 7}, 10, 7, {-1, 7}},\\n-- {{34, 21}, 10, 9, {-39034, 791}},\\n-- /* familiar digits */\\n-- {{11, 4}, 2, 43, {679001, 207}},\\n-- {{11, 4}, 3, 27, {679001, 207}},\\n-- {{11, 4}, 11, 13, {679001, 207}},\\n-- {{-22, 7}, 2, 37, {46071, 379}},\\n-- {{-22, 7}, 3, 23, {46071, 379}},\\n-- {{-22, 7}, 7, 13, {46071, 379}},\\n-- {{-101, 109}, 2, 40, {583376, 6649}},\\n-- {{-101, 109}, 61, 7, {583376, 6649}},\\n-- {{-101, 109}, 32749, 3, {583376, 6649}},\\n-- {{-25, 26}, 7, 13, {5571, 137}},\\n-- {{1, 4}, 7, 11, {9263, 2837}},\\n-- {{122, 407}, 7, 11, {-517, 1477}},\\n /* more subtle */\\n {{5, 8}, 7, 11, {353, 30809}}\\n}\\n\\ninteger sw = 0,qa,qb\\nPadic a = new()\\nPadic b = new()\\n\\nfor i=1 to length(data) do\\n {Ratio q, p, k, Ratio q2} = data[i]\\n sw = a.r2pa(q, 1)\\n if sw=1 then exit end if\\n a.prntf(0)\\n sw = sw or b.r2pa(q2, 1)\\n if sw=1 then exit end if\\n if sw=0 then\\n b.prntf(0)\\n Padic c = a.add(b)\\n c.prntf(1)\\n end if\\n printf(1,\\\"\\\\n\\\")\\nend for\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# 20210225 Raku programming solution\\n\\n#!/usr/bin/env raku\\n\\nclass Padic { has ($.p is default(2), %.v is default({})) is rw ;\\n\\n method r2pa (Rat $x is copy, \\\\p, \\\\d) { # Reference: math.stackexchange.com/a/1187037\\n self.p = p ;\\n $x += p**d if $x < 0 ; # complement\\n\\n my $lowerest = 0;\\n my ($num,$den) = $x.nude;\\n while ($den % p) == 0 { $den /= p and $lowerest-- }\\n $x = $num / $den;\\n\\n while +self.v < d {\\n my %d = ^p Z=> (( $x «-« ^p ) »/» p )».&{ .denominator % p }; # .kv\\n for %d.keys { self.v.{$lowerest++} = $_ and last if %d{$_} != 0 }\\n $x = ($x - self.v.{$lowerest-1}) / p ;\\n }\\n self\\n }\\n\\n method add (Padic \\\\x, \\\\d) {\\n my $div = 0;\\n my $lowerest = (self.v.keys.sort({.Int}).first,\\n x.v.keys.sort({.Int}).first ).min ;\\n return Padic.new:\\n p => self.p,\\n v => gather for ^d {\\n my $power = $lowerest + $_;\\n given ((self.v.{$power}//0)+(x.v.{$power}//0)+$div).polymod(x.p)\\n { take ($power, .[0]).Slip and $div = .[1] }\\n }\\n }\\n\\n method gist {\\n # en.wikipedia.org/wiki/P-adic_number#Notation\\n # my %H = (0..9) Z=> ('₀'..'₉'); # (0x2080 .. 0x2089);\\n # '⋯ ' ~ self.v ~ ' ' ~ [~] self.p.comb».&{ %H{$_} }\\n\\n # express as a series\\n my %H = ( 0…9 ,'-') Z=> ( '⁰','¹','²','³','⁴'…'⁹','⁻');\\n [~] self.v.keys.sort({.Int}).map: {\\n ' + ' ~ self.v.{$_} ~ '*' ~ self.p ~ [~] $_.comb».&{ %H{$_}} }\\n }\\n}\\n\\nmy @T;\\nfor my \\\\D = (\\n#`[[ these are not working\\n < 26/25 -109/125 5 4 >,\\n < 6/7 -5/7 10 7 >,\\n < 2/7 -3/7 10 7 >,\\n < 2/7 -1/7 10 7 >,\\n < 34/21 -39034/791 10 9 >,\\n#]]\\n#`[[[[[ Works\\n < 11/4 679001/207 2 43>,\\n < 11/4 679001/207 3 27 >,\\n < 5/19 -101/384 2 12>,\\n < -22/7 46071/379 7 13 >,\\n < -7/5 99/70 7 4> ,\\n < -101/109 583376/6649 61 7>,\\n < 122/407 -517/1477 7 11>,\\n\\n < 2/1 1/1 2 4>,\\n < 4/1 3/1 2 4>,\\n < 4/1 3/1 2 5>,\\n < 4/9 8/9 5 4>,\\n < 11/4 679001/207 11 13 >,\\n < 1/4 9263/2837 7 11 >,\\n < 49/2 -4851/2 7 6 >,\\n < -9/5 27/7 3 8>,\\n < -22/7 46071/379 2 37 >,\\n < -22/7 46071/379 3 23 >,\\n\\n < -101/109 583376/6649 2 40>,\\n < -101/109 583376/6649 32749 3>,\\n < -25/26 5571/137 7 13>,\\n#]]]]]\\n\\n < 5/8 353/30809 7 11 >,\\n) -> \\\\D {\\n given @T[0] = Padic.new { say D[0]~' = ', .r2pa: D[0],D[2],D[3] }\\n given @T[1] = Padic.new { say D[1]~' = ', .r2pa: D[1],D[2],D[3] }\\n given @T[0].add: @T[1], D[3] {\\n given @T[2] = Padic.new { .r2pa: D[0]+D[1], D[2], D[3] }\\n say \\\"Addition result = \\\", $_.gist; #\\n unless ( $_.v.Str eq @T[2].v.Str ) {\\n say 'but ' ~ (D[0]+D[1]).nude.join('/') ~ ' = ' ~ @T[2].gist\\n }\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Struct\\n\\n// constants\\nvar EMX = 64 // exponent maximum (if indexing starts at -EMX)\\nvar DMX = 1e5 // approximation loop maximum\\nvar AMX = 1048576 // argument maximum\\nvar PMAX = 32749 // prime maximum\\n\\n// global variables\\nvar P1 = 0\\nvar P = 7 // default prime\\nvar K = 11 // precision\\n\\nvar Ratio = Struct.create(\\\"Ratio\\\", [\\\"a\\\", \\\"b\\\"])\\n\\nclass Padic {\\n // uninitialized\\n construct new() {\\n _v = 0\\n _d = List.filled(2 * EMX, 0) // add EMX to index to be consistent wih FB\\n }\\n\\n // properties\\n v { _v }\\n v=(o) { _v = o }\\n d { _d }\\n\\n // (re)initialize 'this' from Ratio, set 'sw' to print\\n r2pa(q, sw) {\\n var a = q.a\\n var b = q.b\\n if (b == 0) return 1\\n if (b < 0) {\\n b = -b\\n a = -a\\n }\\n if (a.abs > AMX || b > AMX) return -1\\n if (P < 2 || K < 1) return 1\\n P = P.min(PMAX) // maximum short prime\\n K = K.min(EMX-1) // maximum array length\\n if (sw != 0) {\\n System.write(\\\"%(a)/%(b) + \\\") // numerator, denominator\\n System.print(\\\"0(%(P)^%(K))\\\") // prime, precision\\n }\\n\\n // (re)initialize\\n _v = 0\\n P1 = P - 1\\n _d = List.filled(2 * EMX, 0)\\n if (a == 0) return 0\\n var i = 0\\n // find -exponent of P in b\\n while (b%P == 0) {\\n b = (b/P).truncate\\n i = i - 1\\n }\\n var s = 0\\n var r = b % P\\n\\n // modular inverse for small P\\n var b1 = 1\\n while (b1 <= P1) {\\n s = s + r\\n if (s > P1) s = s - P\\n if (s == 1) break\\n b1 = b1 + 1\\n }\\n if (b1 == P) {\\n System.print(\\\"r2pa: impossible inverse mod\\\")\\n return -1\\n }\\n _v = EMX\\n while (true) {\\n // find exponent of P in a\\n while (a%P == 0) {\\n a = (a/P).truncate\\n i = i + 1\\n }\\n\\n // valuation\\n if (_v == EMX) _v = i\\n\\n // upper bound\\n if (i >= EMX) break\\n\\n // check precision\\n if ((i - _v) > K) break\\n\\n // next digit\\n _d[i+EMX] = a * b1 % P\\n if (_d[i+EMX] < 0) _d[i+EMX] = _d[i+EMX] + P\\n\\n // remainder - digit * divisor\\n a = a - _d[i+EMX]*b\\n if (a == 0) break\\n }\\n return 0\\n }\\n\\n // Horner's rule\\n dsum() {\\n var t = _v.min(0)\\n var s = 0\\n for (i in K - 1 + t..t) {\\n var r = s\\n s = s * P\\n if (r != 0 && ((s/r).truncate - P) != 0) {\\n // overflow\\n s = -1\\n break\\n }\\n s = s + _d[i+EMX]\\n }\\n return s\\n }\\n\\n // rational reconstruction\\n crat() {\\n var fl = false\\n var s = this\\n var j = 0\\n var i = 1\\n\\n // denominator count\\n while (i <= DMX) {\\n // check for integer\\n j = K - 1 + _v\\n while (j >= _v) {\\n if (s.d[j+EMX] != 0) break\\n j = j - 1\\n }\\n fl = ((j - _v) * 2) < K\\n if (fl) {\\n fl = false\\n break\\n }\\n\\n // check negative integer\\n j = K - 1 + _v\\n while (j >= _v) {\\n if (P1 - s.d[j+EMX] != 0) break\\n j = j - 1\\n }\\n fl = ((j - _v) * 2) < K\\n if (fl) break\\n\\n // repeatedly add self to s\\n s = s + this\\n i = i + 1\\n }\\n if (fl) s = s.cmpt\\n\\n // numerator: weighted digit sum\\n var x = s.dsum()\\n var y = i\\n if (x < 0 || y > DMX) {\\n System.print(\\\"crat: fail\\\")\\n } else {\\n // negative powers\\n i = _v\\n while (i <= -1) {\\n y = y * P\\n i = i + 1\\n }\\n\\n // negative rational\\n if (fl) x = -x\\n System.write(x)\\n if (y > 1) System.write(\\\"/%(y)\\\")\\n System.print()\\n }\\n }\\n\\n // print expansion\\n printf(sw) {\\n var t = _v.min(0)\\n for (i in K - 1 + t..t) {\\n System.write(_d[i + EMX])\\n if (i == 0 && _v < 0) System.write(\\\".\\\")\\n System.write(\\\" \\\")\\n }\\n System.print()\\n // rational approximation\\n if (sw != 0) crat()\\n }\\n\\n // add b to 'this'\\n +(b) {\\n var c = 0\\n var r = Padic.new()\\n r.v = _v.min(b.v)\\n for (i in r.v..K + r.v) {\\n c = c + _d[i+EMX] + b.d[i+EMX]\\n if (c > P1) {\\n r.d[i+EMX] = c - P\\n c = 1\\n } else {\\n r.d[i+EMX] = c\\n c = 0\\n }\\n }\\n return r\\n }\\n\\n // complement\\n cmpt {\\n var c = 1\\n var r = Padic.new()\\n r.v = _v\\n for (i in _v..K + _v) {\\n c = c + P1 - _d[i+EMX]\\n if (c > P1) {\\n r.d[i+EMX] = c - P\\n c = 1\\n } else {\\n r.d[i+EMX] = c\\n c = 0\\n }\\n }\\n return r\\n }\\n}\\n\\nvar data = [\\n /* rational reconstruction depends on the precision\\n until the dsum-loop overflows */\\n [2, 1, 2, 4, 1, 1],\\n [4, 1, 2, 4, 3, 1],\\n [4, 1, 2, 5, 3, 1],\\n [4, 9, 5, 4, 8, 9],\\n [26, 25, 5, 4, -109, 125],\\n [49, 2, 7, 6, -4851, 2],\\n [-9, 5, 3, 8, 27, 7],\\n [5, 19, 2, 12, -101, 384],\\n /* two decadic pairs */\\n [2, 7, 10, 7, -1, 7],\\n [34, 21, 10, 9, -39034, 791],\\n /* familiar digits */\\n [11, 4, 2, 43, 679001, 207],\\n [-8, 9, 23, 9, 302113, 92],\\n [-22, 7, 3, 23, 46071, 379],\\n [-22, 7, 32749, 3, 46071, 379],\\n [35, 61, 5, 20, 9400, 109],\\n [-101, 109, 61, 7, 583376, 6649],\\n [-25, 26, 7, 13, 5571, 137],\\n [1, 4, 7, 11, 9263, 2837],\\n [122, 407, 7, 11, -517, 1477],\\n /* more subtle */\\n [5, 8, 7, 11, 353, 30809]\\n]\\n\\nvar sw = 0\\nvar a = Padic.new()\\nvar b = Padic.new()\\n\\nfor (d in data) {\\n var q = Ratio.new(d[0], d[1])\\n P = d[2]\\n K = d[3]\\n sw = a.r2pa(q, 1)\\n if (sw == 1) break\\n a.printf(0)\\n q.a = d[4]\\n q.b = d[5]\\n sw = sw | b.r2pa(q, 1)\\n if (sw == 1) break\\n if (sw == 0) {\\n b.printf(0)\\n var c = a + b\\n System.print(\\\"+ =\\\")\\n c.printf(1)\\n }\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"P-Adic-numbers-basic"}}},{"rowIdx":1473,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/P-Adic_square_roots\nnote: mathematics\n","language":"00-META"},{"code":";Task.\n\nConvert rational a/b to its approximate [[wp:Hensel%27s_lemma#Hensel's_lemma_for_p-adic_numbers|p-adic square root]]. To check the result,\nsquare the root and construct rational m/n to compare with radicand a/b.\n\nFor rational reconstruction Lagrange's [[wp:Lattice_reduction|lattice basis reduction]] algorithm is used.\n\n'''Recipe:''' find root {{math|''x<sub>1</sub>'' modulo p}} and build a sequence of solutions\n{{math|''f''(''x<sub>k</sub>'') ≡ 0 (mod p<sup>k</sup>)}},\n<br/>using the lifting equation\n{{math|''x<sub>k+1</sub>'' = ''x<sub>k</sub>'' + ''d<sub>k</sub>'' * ''p<sup>k</sup>'' }} \nwith {{math|''d<sub>k</sub>'' = –(''f''(''x<sub>k</sub>'') / ''p<sup>k</sup>'') /\n''f'' ′(''x<sub>1</sub>'') (mod p)}}.\n<br/>The multipliers {{math|''d<sub>k</sub>''}} are the successive p-adic digits to find.\n\nIf evaluation of {{math|''f''(''x'') = ''bx<sup>2</sup>'' – ''a''}} overflows,\nthe expansion is cut off and might be too short to retrieve the radicand.\nSetting a higher precision won't help, using a programming language with built-in\nlarge integer support will.\n\n\n;Related task.\n\n[[p-Adic numbers, basic]]\n\n\n;Reference.\n\n[https://www.uvm.edu/~cvincen1/files/teaching/spring2017-math255/quadraticequation.pdf]\nSolving {{math|''x<sup>2</sup>'' ≡ ''a'' (mod n)}}\n\n\n__TOC__\n\n\n","language":"00-TASK"},{"code":"' ***********************************************\n'subject: p-adic square roots, Hensel lifting.\n'tested : FreeBasic 1.07.0\n\n'The root is squared, approximated by a\n'rational, and compared with radicand a/b.\n\n\nconst emx = 48\n'exponent maximum\n\nconst amx = 700000\n'tentative argument maximum\n\n'------------------------------------------------\nconst Mxd = cdbl(2)^53 - 1\n'max. float64 integer\n\nconst Pmax = 32749\n'max. prime < 2^15\n\n\ntype ratio\n as longint a, b\nend type\n\ntype padic\ndeclare function sqrt (byref q as ratio, byval sw as integer) as integer\n'p-adic square root of q = a/b, set sw to print\ndeclare sub printf (byval sw as integer)\n'print expansion, set sw to print rational\ndeclare function crat (byval sw as integer) as ratio\n'rational reconstruction\n\ndeclare sub cmpt (byref a as padic)\n'let self:= complement_a\ndeclare sub sqr (byref a as padic)\n'let self:= a ^ 2\n\n as long d(-emx to emx - 1)\n as integer v\nend type\n\n\n'global variables\ndim shared as long p1, p = 7\n'default prime\ndim shared as integer k = 11\n'precision\n\n#define min(a, b) iif((a) > (b), b, a)\n\n\n'------------------------------------------------\n'p-adic square root of g = a/b\nfunction padic.sqrt (byref g as ratio, byval sw as integer) as integer\ndim as longint a = g.a, b = g.b\ndim as longint q, x, pk, pm\ndim as long f1, r, s, t\ndim i as integer, f as double\nsqrt = 0\n\n if b = 0 then return 1\n if b < 0 then b = -b: a = -a\n if p < 2 or k < 1 then return 1\n\n 'max. short prime\n p = min(p, Pmax)\n\n if sw then\n 'echo numerator, denominator,\n print a;\"/\";str(b);\" + \";\n 'prime and precision\n print \"O(\";str(p);\"^\";str(k);\")\"\n end if\n\n 'initialize\n v = 0\n p1 = p - 1\n for i = -emx to emx - 1\n d(i) = 0: next\n\n if a = 0 then return 0\n\n 'valuation\n do until b mod p\n b \\= p: v -= 1\n loop\n do until a mod p\n a \\= p: v += 1\n loop\n\n if (v and 1) = 1 then\n 'odd valuation\n print \"non-residue mod\"; p\n return -1\n end if\n\n 'max. array length\n k = min(k + v, emx - 1)\n k -= v: v shr= 1\n\n if abs(a) > amx or b > amx then return -1\n\n if p = 2 then\n '1 / b = b (mod 8)\n 'a / b = 1 (mod 8)\n t = a * b\n if (t and 7) - 1 then\n print \"non-residue mod 8\"\n return -1\n end if\n\n else\n 'find root for small p\n for r = 1 to p1\n q = b * r * r - a\n if q mod p = 0 then exit for\n next r\n\n if r = p then\n print \"non-residue mod\"; p\n return -1\n end if\n\n 'f'(r) = 2br\n t = b * r shl 1\n\n s = 0\n t mod= p\n 'modular inverse for small p\n for f1 = 1 to p1\n s += t\n if s > p1 then s -= p\n if s = 1 then exit for\n next f1\n\n if f1 = p then\n print \"impossible inverse mod\"\n return -1\n end if\n end if\n\n 'evaluate f(x)\n #macro evalf(x)\n f = b * x * cdbl(x / pk)\n f -= cdbl(a / pk)\n 'overflow\n if f > Mxd then exit for\n q = clngint(f)\n #endmacro\n\n if p = 2 then\n 'initialize\n x = 1\n d(v) = 1\n d(v + 1) = 0\n\n pk = 4\n for i = v + 2 to k - 1 + v\n pk shl= 1\n '2-power overflow\n if pk < 1 then exit for\n evalf(x)\n 'next digit\n d(i) = iif(q and 1, 1, 0)\n 'lift x\n x += d(i) * (pk shr 1)\n next i\n\n else\n '-1 / f'(x) mod p\n f1 = p - f1\n x = r\n d(v) = x\n\n pk = 1\n for i = v + 1 to k - 1 + v\n pm = pk: pk *= p\n if pk \\ pm - p then exit for\n evalf(x)\n d(i) = q * f1 mod p\n if d(i) < 0 then d(i) += p\n x += d(i) * pk\n next i\n end if\n k = i - v\n\n if sw then print \"lift:\";x;\" mod\";p;\"^\";str(k)\nend function\n\n'------------------------------------------------\n'rational reconstruction\nfunction padic.crat (byval sw as integer) as ratio\ndim as integer i, j, t = min(v, 0)\ndim as longint s, pk, pm\ndim as long q, x, y\ndim as double f, h\ndim r as ratio\n\n 'weighted digit sum\n s = 0: pk = 1\n for i = t to k - 1 + v\n pm = pk: pk *= p\n\n if pk \\ pm - p then\n 'overflow\n pk = pm: exit for\n end if\n\n s += d(i) * pm '(mod pk)\n next i\n\n 'lattice basis reduction\n dim as longint m(1) = {pk, s}\n dim as longint n(1) = {0, 1}\n 'norm(v)^2\n h = cdbl(s) * s + 1\n i = 0: j = 1\n\n 'Lagrange's algorithm\n do\n f = m(i) * (m(j) / h)\n f += n(i) * (n(j) / h)\n\n 'Euclidean step\n q = int(f +.5)\n m(i) -= q * m(j)\n n(i) -= q * n(j)\n\n f = h\n h = cdbl(m(i)) * m(i)\n h += cdbl(n(i)) * n(i)\n 'compare norms\n if h < f then\n 'interchange vectors\n swap i, j\n else\n exit do\n end if\n loop\n\n x = m(j): y = n(j)\n if y < 0 then y = -y: x = -x\n\n 'check determinant\n t = abs(m(i) * y - x * n(i)) = pk\n\n if t = 0 then\n print \"crat: fail\"\n x = 0: y = 1\n\n else\n 'negative powers\n for i = v to -1\n y *= p: next\n\n if sw then\n print x;\n if y > 1 then print \"/\";str(y);\n print\n end if\n end if\n\n r.a = x: r.b = y\nreturn r\nend function\n\n\n'print expansion\nsub padic.printf (byval sw as integer)\ndim as integer i, t = min(v, 0)\n\n for i = k - 1 + t to t step -1\n print d(i);\n if i = 0 andalso v < 0 then print \".\";\n next i\n print\n\n 'rational approximation\n if sw then crat(sw)\nend sub\n\n'------------------------------------------------\n'let self:= complement_a\nsub padic.cmpt (byref a as padic)\ndim i as integer, r as padic\ndim as long c = 1\nwith r\n .v = a.v\n\n for i = .v to k +.v\n c += p1 - a.d(i)\n 'carry\n if c > p1 then\n .d(i) = c - p: c = 1\n else\n .d(i) = c: c = 0\n end if\n next i\nend with\nthis = r\nend sub\n\n'let self:= a ^ 2\nsub padic.sqr (byref a as padic)\ndim as long ptr rp, ap = @a.d(a.v)\ndim as longint q, c = 0\ndim as integer i, j\ndim r as padic\nwith r\n .v = a.v shl 1\n rp = @.d(.v)\n\n for i = 0 to k\n for j = 0 to i\n c += ap[j] * ap[i - j]\n next j\n 'Euclidean step\n q = c \\ p\n rp[i] = c - q * p\n c = q\n next i\nend with\nthis = r\nend sub\n\n\n'main\n'------------------------------------------------\ndim as integer sw\ndim as padic a, c\ndim as ratio q, r\n\nwidth 64, 30\ncls\n\n' -7 + O(2^7)\ndata -7,1, 2,7\ndata 9,1, 2,8\ndata 17,1, 2,9\ndata 497,10496, 2,18\ndata 10496,497, 2,19\n\ndata -577215,664901, 3,23\ndata 15403,26685, 3,18\n\ndata -1,1, 5,8\ndata 86,25, 5,8\ndata 2150,1, 5,8\n\ndata 2,1, 7,8\ndata 11696,621467, 7,11\ndata -27764,11521, 7,11\ndata -27584,12953, 7,11\n\ndata -166420,135131, 11,11\ndata 14142,135623, 5,15\ndata -255,256, 257,3\n\ndata 0,0, 0,0\n\n\nprint\ndo\n read q.a,q.b, p,k\n\n sw = a.sqrt(q, 1)\n if sw = 1 then exit do\n if sw then ? : continue do\n\n print \"sqrt +/-\"\n print \"...\";\n a.printf(0)\n a.cmpt(a)\n print \"...\";\n a.printf(0)\n\n c.sqr(a)\n print \"sqrt^2\"\n print \" \";\n c.printf(0)\n r = c.crat(1)\n\n '{r = q}\n if q.a * r.b - r.a * q.b then\n print \"fail: sqrt^2\"\n end if\n\n print : ?\nloop\n\nend\n","language":"FreeBASIC"},{"code":"{-# LANGUAGE KindSignatures, DataKinds #-}\n\nimport Data.Ratio\nimport Data.List (find)\nimport GHC.TypeLits\nimport Padic\n\npSqrt :: KnownNat p => Rational -> Padic p\npSqrt r = res\n where\n res = maybe Null mkUnit series\n (a, b) = (numerator r, denominator r)\n series = case modulo res of\n\n 2 | eqMod 4 a 3 -> Nothing\n | not (eqMod 8 a 1) -> Nothing\n | otherwise -> Just $ 1 : 0 : go 8 1\n where\n go pk x =\n let q = ((b*x*x - a) `div` pk) `mod` 2\n in q : go (2*pk) (x + q * (pk `div` 2))\n\n p -> do\n y <- find (\\x -> eqMod p (b*x*x) a) [1..p-1]\n df <- recipMod p (2*b*y)\n let go pk x =\n let f = (b*x*x - a) `div` pk\n d = (f * (p - df)) `mod` p\n in x `div` (pk `div` p) : go (p*pk) (x + d*pk)\n Just $ go p y\n\neqMod :: Integral a => a -> a -> a -> Bool\neqMod p a b = a `mod` p == b `mod` p\n","language":"Haskell"},{"code":"using Nemo, LinearAlgebra\n\nset_printing_mode(FlintPadicField, :terse)\n\n\"\"\" convert to Rational (rational reconstruction) \"\"\"\nfunction toRational(pa::padic)\n rat = lift(QQ, pa)\n r, den = BigInt(numerator(rat)), Int(denominator(rat))\n p, k = Int(prime(parent(pa))), Int(precision(pa))\n N = BigInt(p^k)\n a1, a2 = [N, 0], [r, 1]\n while dot(a1, a1) > dot(a2, a2)\n q = dot(a1, a2) // dot(a2, a2)\n a1, a2 = a2, a1 - round(q) * a2\n end\n if dot(a1, a1) < N\n return (Rational{Int}(a1[1]) // Rational{Int}(a1[2])) // Int(den)\n else\n return Int(r) // den\n end\nend\n\nfunction dstring(pa::padic)\n u, v, n, p, k = pa.u, pa.v, pa.N, pa.parent.p, pa.parent.prec_max\n d = digits(v > 0 ? u * p^v : u, base=p, pad=k)\n return prod([i == k + v && v != 0 ? \"$x . \" : \"$x \" for (i, x) in enumerate(reverse(d))])\nend\n\nconst DATA = [\n [-7, 1, 2, 7],\n [9, 1, 2, 8],\n [17, 1, 2, 9],\n [-1, 1, 5, 8],\n [86, 25, 5, 8],\n [2150, 1, 5, 8],\n [2, 1, 7, 8],\n [3029, 4821, 7, 9],\n [379, 449, 7, 8],\n [717, 8, 11, 7],\n [1414, 213, 41, 5],\n [-255, 256, 257, 3]\n]\n\nfor (num1, den1, P, K) in DATA\n Qp = PadicField(P, K)\n a = Qp(QQ(num1 // den1))\n c = sqrt(a)\n r = toRational(c * c)\n println(a, \"\\nsqrt +/-\\n\", dstring(c), \"\\n\", dstring(-c), \"\\nCheck sqrt^2:\\n\", dstring(c * c), \"\\n\", r, \"\\n\")\nend\n","language":"Julia"},{"code":"import strformat\n\nconst\n Emx = 64 # Exponent maximum.\n Amx = 6000 # Argument maximum.\n PMax = 32749 # Prime maximum.\n\ntype\n\n Ratio = tuple[a, b: int]\n\n Padic = object\n p: int # Prime.\n k: int # Precision.\n v: int\n d: array[-Emx..(Emx-1), int]\n\n PadicError = object of ValueError\n\n\nproc sqrt(pa: var Padic; q: Ratio; sw: bool) =\n ## Return the p-adic square root of q = a/b. Set sw to print.\n\n var (a, b) = q\n var i, x: int\n\n if b == 0:\n raise newException(PadicError, &\"Wrong rational: {a}/{b}\" )\n if b < 0:\n b = -b\n a = -a\n if pa.p < 2:\n raise newException(PadicError, &\"Wrong value for p: {pa.p}\")\n if pa.k < 1:\n raise newException(PadicError, &\"Wrong value for k: {pa.k}\")\n pa.p = min(pa.p, PMax) # Maximum short prime.\n\n if sw: echo &\"{a}/{b} + 0({pa.p}^{pa.k})\"\n\n # Initialize.\n pa.v = 0\n pa.d.reset()\n if a == 0: return\n\n # Valuation.\n while b mod pa.p == 0:\n b = b div pa.p\n dec pa.v\n while a mod pa.p == 0:\n a = a div pa.p\n inc pa.v\n if (pa.v and 1) != 0:\n # Odd valuation.\n raise newException(PadicError, &\"Non-residue mod {pa.p}.\")\n\n # Maximum array length.\n pa.k = min(pa.k + pa.v, Emx - 1) - pa.v\n pa.v = pa.v shr 1\n\n if abs(a) > Amx or b > Amx:\n raise newException(PadicError, &\"Rational exceeding limits: {a}/{b}.\")\n\n if pa.p == 2:\n # 1 / b = b (mod 8); a / b = 1 (mod 8).\n if (a * b and 7) - 1 != 0:\n raise newException(PadicError, \"Non-residue mod 8.\")\n\n # Initialize.\n x = 1\n pa.d[pa.v] = 1\n pa.d[pa.v + 1] = 0\n var pk = 4\n i = pa.v + 2\n while i < pa.k + pa.v:\n pk *= 2\n let f = b * x * x - a\n let q = f div pk\n if f != q * pk: break # Overflow.\n # Next digit.\n pa.d[i] = if (q and 1) != 0: 1 else: 0\n # Lift \"x\".\n x += pa.d[i] * (pk shr 1)\n inc i\n\n else:\n # Find root for small \"p\".\n var r = 1\n while r < pa.p:\n if (b * r * r - a) mod pa.p == 0: break\n inc r\n if r == pa.p:\n raise newException(PadicError, &\"Non-residue mod {pa.p}.\")\n let t = (b * r shl 1) mod pa.p\n var s = 0\n\n # Modular inverse for small \"p\".\n var f1 = 1\n while f1 < pa.p:\n inc s, t\n if s >= pa.p: dec s, pa.p\n if s == 1: break\n inc f1\n if f1 == pa.p:\n raise newException(PadicError, \"Impossible to compute inverse modulo\")\n\n f1 = pa.p - f1\n x = r\n pa.d[pa.v] = x\n\n var pk = 1\n i = pa.v + 1\n while i < pa.k + pa.v:\n pk *= pa.p\n let f = b * x * x - a\n let q = f div pk\n if f != q * pk: break # Overflow.\n pa.d[i] = q * f1 mod pa.p\n if pa.d[i] < 0: pa.d[i] += pa.p\n x += pa.d[i] * pk\n inc i\n\n pa.k = i - pa.v\n if sw: echo &\"lift: {x} mod {pa.p}^{pa.k}\"\n\n\nproc crat(pa: Padic; sw: bool): Ratio =\n ## Rational reconstruction.\n\n # Weighted digit sum.\n var\n s = 0\n pk = 1\n for i in min(pa.v, 0)..<(pa.k + pa.v):\n let pm = pk\n pk *= pa.p\n if pk div pm - pa.p != 0:\n # Overflow.\n pk = pm\n break\n s += pa.d[i] * pm\n\n # Lattice basis reduction.\n var\n m = [pk, s]\n n = [0, 1]\n i = 0\n j = 1\n s = s * s + 1\n # Lagrange's algorithm.\n while true:\n # Euclidean step.\n var q = ((m[i] * m[j] + n[i] * n[j]) / s).toInt\n m[i] -= q * m[j]\n n[i] -= q * n[j]\n q = s\n s = m[i] * m[i] + n[i] * n[i]\n # Compare norms.\n if s < q: swap i, j # Interchange vectors.\n else: break\n\n var x = m[j]\n var y = n[j]\n if y < 0:\n y = -y\n x = -x\n\n # Check determinant.\n if abs(m[i] * y - x * n[i]) != pk:\n raise newException(PadicError, \"Rational reconstruction failed.\")\n\n # Negative powers.\n for i in pa.v..(-1): y *= pa.p\n\n if sw: echo x, if y > 1: '/' & $y else: \"\"\n result = (x, y)\n\n\nfunc cmpt(pa: Padic): Padic =\n ## Return the complement.\n result = Padic(p: pa.p, k: pa.k, v: pa.v)\n var c = 1\n for i in pa.v..(pa.k + pa.v):\n inc c, pa.p - 1 - pa.d[i]\n if c >= pa.p:\n result.d[i] = c - pa.p\n c = 1\n else:\n result.d[i] = c\n c = 0\n\n\nfunc sqr(pa: Padic): Padic =\n ## Return the square of a P-adic number.\n result = Padic(p: pa.p, k: pa.k, v: pa.v * 2)\n var c = 0\n for i in 0..pa.k:\n for j in 0..i:\n c += pa.d[pa.v + j] * pa.d[pa.v + i - j]\n # Euclidean step.\n let q = c div pa.p\n result.d[result.v + i] = c - q * pa.p\n c = q\n\n\nfunc `$`(pa: Padic): string =\n ## String representation.\n let t = min(pa.v, 0)\n for i in countdown(pa.k - 1 + t, t):\n result.add $pa.d[i]\n if i == 0 and pa.v < 0: result.add \".\"\n result.add \" \"\n\n\nwhen isMainModule:\n\n const Data = [[-7, 1, 2, 7],\n [9, 1, 2, 8],\n [17, 1, 2, 9],\n [497, 10496, 2, 18],\n [10496, 497, 2, 19],\n [3141, 5926, 3, 15],\n [2718, 281, 3, 13],\n [-1, 1, 5, 8],\n [86, 25, 5, 8],\n [2150, 1, 5, 8],\n [2,1, 7, 8],\n [-2645, 28518, 7, 9],\n [3029, 4821, 7, 9],\n [379, 449, 7, 8],\n [717, 8, 11, 7],\n [1414, 213, 41, 5],\n [-255, 256, 257, 3]]\n\n for d in Data:\n try:\n let q: Ratio = (d[0], d[1])\n var a = Padic(p: d[2], k: d[3])\n a.sqrt(q, true)\n echo \"sqrt +/-\"\n echo \"...\", a\n a = a.cmpt()\n echo \"...\", a\n let c = sqr(a)\n echo \"sqrt^2\"\n echo \" \", c\n let r = c.crat(true)\n if q.a * r.b - r.a * q.b != 0:\n echo \"fail: sqrt^2\"\n echo \"\"\n except PadicError:\n echo getCurrentExceptionMsg()\n","language":"Nim"},{"code":"constant EMX = 48 // exponent maximum (if indexing starts at -EMX)\nconstant DMX = 1e5 // approximation loop maximum\nconstant AMX = 700000 // argument maximum\nconstant PMAX = 32749 // prime maximum\n\n// global variables\ninteger p1 = 0\ninteger p = 7 // default prime\ninteger k = 11 // precision\n\ntype Ratio(sequence r)\n return length(r)=2 and integer(r[1]) and integer(r[2])\nend type\n\nclass Padic\n integer v = 0\n sequence d = repeat(0,EMX*2)\n\n function square_root(Ratio g, integer sw)\n -- p-adic square root of g = a/b\n integer {a,b} = g\n atom f, q, pk, x\n integer f1, r, s, t, i, res = 0\n\n if b = 0 then return 1 end if\n if b < 0 then\n b = -b\n a = -a\n end if\n if p < 2 or k < 1 then return 1 end if\n\n -- max. short prime\n p = min(p, PMAX)\n if sw then\n -- numerator, denominator, prime, precision\n printf(1,\"%d/%d + O(%d^%d)\\n\",{a,b,p,k})\n end if\n\n -- initialize\n v = 0\n p1 = p - 1\n sequence ntd = repeat(0,2*EMX) -- (new this.d)\n if a = 0 then return 0 end if\n\n -- valuation\n while remainder(b,p)=0 do\n b /= p\n v -= 1\n end while\n while remainder(a,p)=0 do\n a /= p\n v += 1\n end while\n\n if remainder(v,2) then\n -- odd valuation\n printf(1,\"(1)non-residue mod %d\\n\",p)\n return -1\n end if\n\n -- max. array length\n k = min(k + v, EMX - 1) - v\n v = floor(v/2)\n\n if abs(a) > AMX or b > AMX then return -1 end if\n\n if p = 2 then\n --1 / b = b (mod 8)\n --a / b = 1 (mod 8)\n t = a * b\n if mod(t,8)-1 then\n printf(1,\"(2)non-residue mod 8\\n\")\n return -1\n end if\n\n else\n -- find root for small p\n for r = 1 to p1 do\n f = b * r * r - a\n if mod(f,p) = 0 then exit end if\n end for\n\n if r = p then\n printf(1,\"(3)non-residue mod %d\\n\", p)\n return -1\n end if\n\n -- f'(r) = 2br\n t = b * r * 2\n\n s = 0\n t = mod(t,p)\n -- modular inverse for small p\n for f1 = 1 to p1 do\n s += t\n if s > p1 then s -= p end if\n if s = 1 then exit end if\n end for\n\n if f1 = p then\n printf(1,\"impossible inverse mod\\n\")\n return -1\n end if\n end if\n\n if p = 2 then\n -- initialize\n x = 1\n ntd[v+EMX+1] = 1\n ntd[v+EMX+2] = 0\n\n pk = 4\n for i = v+2 to k-1+v do\n pk *= 2\n f = b * x * x - a\n q = floor(f/pk)\n -- overflow\n if f != q * pk then exit end if\n -- next digit\n ntd[i+EMX+1] = and_bits(q,1)\n -- lift x\n x += ntd[i+EMX+1] * floor(pk/2)\n end for\n\n else\n -- -1 / f'(x) mod p\n f1 = p - f1\n x = r\n ntd[v+EMX+1] = x\n\n pk = 1\n for i = v+1 to k-1 do\n pk *= p\n f = b * x * x - a\n q = floor(f/pk)\n -- overflow\n if f - q * pk then exit end if\n r = mod(q*f1,p)\n if r < 0 then r += p end if\n ntd[i+EMX+1] = r\n x += r * pk\n end for\n end if\n this.d = ntd\n k = i-v\n\n if sw then\n printf(1,\"lift: %d mod %d^%d\\n\",{x,p,k})\n end if\n return 0\n end function\n\n function square()\n integer c = 0\n Padic r = new()\n r.v = this.v * 2\n sequence td = this.d,\n rd = r.d\n for i=0 to k do\n for j=0 to i do\n c += td[v+j+EMX+1] * td[v+i-j+EMX+1]\n end for\n // Euclidean step\n integer q = floor(c/p)\n rd[r.v+i+EMX+1] = c - q*p\n c = q\n end for\n r.d = rd\n return r\n end function\n\n function complement()\n integer c = 1\n Padic r = new({v})\n sequence rd = r.d\n for i=v to k+v do\n integer dx = i+EMX+1\n c += p1 - this.d[dx]\n if c>p1 then\n rd[dx] = c - p\n c = 1\n else\n rd[dx] = c\n c = 0\n end if\n end for\n r.d = rd\n return r\n end function\n\n function crat(integer sw)\n -- rational reconstruction\n integer i, j, t = min(v, 0)\n Ratio r\n atom f\n integer x, y\n atom p1,pk, q, s\n\n -- weighted digit sum\n s = 0\n pk = 1\n for i = t to k-1+v do\n p1 = pk\n pk *= p\n if floor(pk/p1) - p then\n -- overflow\n pk = p1\n exit\n end if\n s += d[i+EMX+1] * p1 --(mod pk)\n end for\n\n -- lattice basis reduction\n sequence m = {pk, s},\n n = {0, 1}\n i = 1\n j = 2\n s = s * s + 1 -- norm(v)^2\n\n -- Lagrange's algorithm\n while true do\n f = (m[i] * m[j] + n[i] * n[j]) / s\n\n -- Euclidean step\n q = floor(f +.5)\n m[i] -= q * m[j]\n n[i] -= q * n[j]\n\n q = s\n s = m[i] * m[i] + n[i] * n[i]\n -- compare norms\n if s < q then\n -- interchange vectors\n {i,j} = {j,i}\n else\n exit\n end if\n end while\n\n x = m[j]\n y = n[j]\n if y < 0 then\n y = -y\n x = -x\n end if\n\n -- check determinant\n t = abs(m[i] * y - x * n[i]) == pk\n\n if not t then\n printf(1,\"crat: fail\\n\")\n x = 0\n y = 1\n else\n -- negative powers\n for i = v to -1 do\n y *= p\n end for\n\n if sw then\n-- printf(1,iff(y=1?\"%d\":\"%d/%d\"),{x*sgn,y})\n printf(1,iff(y=1?\"%d\\n\":\"%d/%d\\n\"),{x,y})\n end if\n end if\n\n r = {x,y}\n return r\n end function\n\n procedure prntf(bool sw)\n -- print expansion\n integer t = min(v, 0)\n for i=k-1+t to t by -1 do\n printf(1,\"%d\",d[i+EMX+1])\n printf(1,iff(i=0 and v<0?\". \":\" \"))\n end for\n printf(1,\"\\n\")\n // rational approximation\n if sw then crat(sw) end if\n end procedure\nend class\n\nconstant tests = {\n {{-7,1},2,7},\n--/*\n {{9,1},2,8},\n {{17,1},2,9},\n {{497,10496},2,18},\n {{10496,497},2,19},\n\n {{3141,5926},3,17},\n {{2718,281},3,15},\n\n {{-1,1},5,8},\n {{86,25},5,8},\n {{2150,1},5,10},\n\n {{2,1},7,8},\n {{-2645,28518},7,9},\n {{3029,4821},7,9},\n {{379,449},7,8},\n\n {{717,8},11,7},\n {{1414,213},41,5},\n--*/\n {{-255,256},257,3}\n}\n\nPadic a = new(), c\nRatio q, r\n\nfor i=1 to length(tests) do\n {q,p,k} = tests[i]\n\n integer sw = a.square_root(q, 1)\n if sw=1 then exit end if\n if sw=0 then\n printf(1,\"square_root +/-\\n\")\n printf(1,\"... \")\n a.prntf(0)\n a = a.complement()\n printf(1,\"... \")\n a.prntf(0)\n\n c = a.square()\n printf(1,\"square_root^2\\n\")\n printf(1,\" \")\n c.prntf(0)\n r = c.crat(1)\n\n if q[1] * r[2] - r[1] * q[2] then\n printf(1,\"fail: square_root^2\\n\")\n end if\n end if\n printf(1,\"\\n\")\nend for\n","language":"Phix"},{"code":"import \"./dynamic\" for Struct\nimport \"./big\" for BigInt\n\n// constants\nvar EMX = 64 // exponent maximum (if indexing starts at -EMX)\nvar AMX = 6000 // argument maximum\nvar PMAX = 32749 // prime maximum\n\n// global variables\nvar P1 = 0\nvar P = 7 // default prime\nvar K = 11 // precision\n\nvar Ratio = Struct.create(\"Ratio\", [\"a\", \"b\"])\n\nclass Padic {\n // uninitialized\n construct new() {\n _v = 0\n _d = List.filled(2 * EMX, 0) // add EMX to index to be consistent wih FB\n }\n\n // properties\n v { _v }\n v=(o) { _v = o }\n d { _d }\n\n // (re)initialize 'this' to the square root of a Ratio, set 'sw' to print\n sqrt(g, sw) {\n var a = g.a\n var b = g.b\n if (b == 0) return 1\n if (b < 0) {\n b = -b\n a = -a\n }\n if (P < 2 || K < 1) return 1\n P = P.min(PMAX) // maximum short prime\n if (sw != 0) {\n System.write(\"%(a)/%(b) + \") // numerator, denominator\n System.print(\"0(%(P)^%(K))\") // prime, precision\n }\n\n // (re)initialize\n _v = 0\n P1 = P - 1\n _d = List.filled(2 * EMX, 0)\n if (a == 0) return 0\n\n //valuation\n while (b%P== 0) {\n b = (b/P).truncate\n _v = _v - 1\n }\n\n while (a%P == 0) {\n a = (a/P).truncate\n _v = _v + 1\n }\n\n if ((_v & 1) == 1) {\n // odd valuation\n System.print(\"non-residue mod %(P)\")\n return -1\n }\n K = (K + _v).min(EMX - 1) - _v // maximum array length\n _v = (_v/2).truncate\n\n if (a.abs > AMX || b > AMX) return -1\n var bb = BigInt.new(b) // to avoid overflowing 'f(x) = b * x * x – a'\n var r\n var s\n var t\n var f\n var f1\n if (P == 2) {\n t = a * b\n if ((t & 7) - 1 != 0) {\n System.print(\"non-residue mod 8\")\n return -1\n }\n } else {\n // find root for small P\n r = 1\n while (r <= P1) {\n f = bb * r * r - a\n if ((f % P) == 0) break\n r = r + 1\n }\n if (r == P) {\n System.print(\"non-residue mod %(P)\")\n return -1\n }\n t = 2 * b * r\n s = 0\n t = t % P\n\n // modular inverse for small P\n f1 = 1\n while (f1 <= P1) {\n s = s + t\n if (s > P1) s = s - P\n if (s == 1) break\n f1 = f1 + 1\n }\n if (f1 == P) {\n System.print(\"impossible inverse mod\")\n return -1\n }\n }\n var x\n var pk\n var q\n var i\n if (P == 2) {\n // initialize\n x = 1\n _d[_v+EMX] = 1\n _d[_v+1+EMX] = 0\n pk = 4\n i = _v + 2\n while (i <= K - 1 + _v) {\n pk = pk * 2\n f = bb * x * x - a\n q = f / pk\n // overflow\n if (f != q * pk) break\n // next digit\n _d[i+EMX] = ((q & 1) != 0) ? 1 : 0\n // lift x\n x = x + _d[i+EMX]*(pk >> 1)\n i = i + 1\n }\n\n } else {\n f1 = P - f1\n x = r\n _d[_v+EMX] = x\n pk = 1\n i = _v + 1\n while (i <= K - 1 + _v) {\n pk = pk * P\n f = bb * x * x - a\n q = f / pk\n // overflow\n if (f != q * pk) break\n _d[i+EMX] = q.toSmall * f1 % P\n if (_d[i+EMX] < 0) _d[i+EMX] = _d[i+EMX] + P\n x = x + _d[i+EMX]*pk\n i = i + 1\n }\n }\n K = i - _v\n if (sw != 0) System.print(\"lift: %(x) mod %(P)^%(K)\")\n return 0\n }\n\n // rational reconstruction\n crat(sw) {\n var t = _v.min(0)\n // weighted digit sum\n var s = 0\n var pk = 1\n for (i in t..K-1+_v) {\n P1 = pk\n pk = pk * P\n if (((pk/P1).truncate - P) != 0) {\n // overflow\n pk = p1\n break\n }\n s = s + _d[i+EMX]*P1\n }\n\n // lattice basis reduction\n var m = [pk, s]\n var n = [0, 1]\n var i = 0\n var j = 1\n s = s * s + 1\n // Lagrange's algorithm\n while (true) {\n var f = (m[i] * m[j] + n[i] * n[j]) / s\n // Euclidean step\n var q = (f + 0.5).floor\n m[i] = m[i] - q*m[j]\n n[i] = n[i] - q*n[j]\n q = s\n s = m[i] * m[i] + n[i] * n[i]\n // compare norms\n if (s < q) {\n // interchange vectors\n var z = i\n i = j\n j = z\n } else {\n break\n }\n }\n var x = m[j]\n var y = n[j]\n if (y < 0) {\n y = -y\n x = -x\n }\n\n // check determinant\n t = (m[i]*y - x*n[i]).abs == pk\n if (!t) {\n System.print(\"crat: fail\")\n x = 0\n y = 1\n } else {\n // negative powers\n var i = _v\n while (i <= -1) {\n y = y * P\n i = i + 1\n }\n if (sw != 0) {\n System.write(x)\n if (y > 1) System.write(\"/%(y)\")\n System.print()\n }\n }\n\n return Ratio.new(x, y)\n }\n\n // print expansion\n printf(sw) {\n var t = _v.min(0)\n for (i in K - 1 + t..t) {\n System.write(_d[i + EMX])\n if (i == 0 && _v < 0) System.write(\".\")\n System.write(\" \")\n }\n System.print()\n // rational approximation\n if (sw != 0) crat(sw)\n }\n\n // complement\n cmpt {\n var c = 1\n var r = Padic.new()\n r.v = _v\n for (i in r.v..K + r.v) {\n c = c + P1 - _d[i+EMX]\n if (c > P1) {\n r.d[i+EMX] = c - P\n c = 1\n } else {\n r.d[i+EMX] = c\n c = 0\n }\n }\n return r\n }\n\n // square\n sqr {\n var c = 0\n var r = Padic.new()\n r.v = _v * 2\n for (i in 0..K) {\n for (j in 0..i) c = c + _d[_v+j+EMX] * _d[_v+i-j+EMX]\n // Euclidean step\n var q = (c/P).truncate\n r.d[r.v+i+EMX] = c - q*P\n c = q\n }\n return r\n }\n}\n\nvar data = [\n [-7, 1, 2, 7],\n [9, 1, 2, 8],\n [17, 1, 2, 9],\n [497, 10496, 2, 18],\n [10496, 497, 2, 19],\n [3141, 5926, 3, 15],\n [2718, 281, 3, 13],\n [-1, 1, 5, 8],\n [86, 25, 5, 8],\n [2150, 1, 5, 8],\n [2,1, 7, 8],\n [-2645, 28518, 7, 9],\n [3029, 4821, 7, 9],\n [379, 449, 7, 8],\n [717, 8, 11, 7],\n [1414, 213, 41, 5],\n [-255, 256, 257, 3]\n]\n\nvar sw = 0\nvar a = Padic.new()\nvar c = Padic.new()\n\nfor (d in data) {\n var q = Ratio.new(d[0], d[1])\n P = d[2]\n K = d[3]\n sw = a.sqrt(q, 1)\n if (sw == 1) break\n if (sw == 0) {\n System.print(\"sqrt +/-\")\n System.write(\"...\")\n a.printf(0)\n a = a.cmpt\n System.write(\"...\")\n a.printf(0)\n c = a.sqr\n System.print(\"sqrt^2\")\n System.write(\" \")\n c.printf(0)\n var r = c.crat(1)\n if (q.a * r.b - r.a * q.b != 0) {\n System.print(\"fail: sqrt^2\")\n }\n System.print()\n }\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/P-Adic_square_roots\\nnote: mathematics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task.\\n\\nConvert rational a/b to its approximate [[wp:Hensel%27s_lemma#Hensel's_lemma_for_p-adic_numbers|p-adic square root]]. To check the result,\\nsquare the root and construct rational m/n to compare with radicand a/b.\\n\\nFor rational reconstruction Lagrange's [[wp:Lattice_reduction|lattice basis reduction]] algorithm is used.\\n\\n'''Recipe:''' find root {{math|''x<sub>1</sub>'' modulo p}} and build a sequence of solutions\\n{{math|''f''(''x<sub>k</sub>'') ≡ 0 (mod p<sup>k</sup>)}},\\n<br/>using the lifting equation\\n{{math|''x<sub>k+1</sub>'' = ''x<sub>k</sub>'' + ''d<sub>k</sub>'' * ''p<sup>k</sup>'' }} \\nwith {{math|''d<sub>k</sub>'' = –(''f''(''x<sub>k</sub>'') / ''p<sup>k</sup>'') /\\n''f'' ′(''x<sub>1</sub>'') (mod p)}}.\\n<br/>The multipliers {{math|''d<sub>k</sub>''}} are the successive p-adic digits to find.\\n\\nIf evaluation of {{math|''f''(''x'') = ''bx<sup>2</sup>'' – ''a''}} overflows,\\nthe expansion is cut off and might be too short to retrieve the radicand.\\nSetting a higher precision won't help, using a programming language with built-in\\nlarge integer support will.\\n\\n\\n;Related task.\\n\\n[[p-Adic numbers, basic]]\\n\\n\\n;Reference.\\n\\n[https://www.uvm.edu/~cvincen1/files/teaching/spring2017-math255/quadraticequation.pdf]\\nSolving {{math|''x<sup>2</sup>'' ≡ ''a'' (mod n)}}\\n\\n\\n__TOC__\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"' ***********************************************\\n'subject: p-adic square roots, Hensel lifting.\\n'tested : FreeBasic 1.07.0\\n\\n'The root is squared, approximated by a\\n'rational, and compared with radicand a/b.\\n\\n\\nconst emx = 48\\n'exponent maximum\\n\\nconst amx = 700000\\n'tentative argument maximum\\n\\n'------------------------------------------------\\nconst Mxd = cdbl(2)^53 - 1\\n'max. float64 integer\\n\\nconst Pmax = 32749\\n'max. prime < 2^15\\n\\n\\ntype ratio\\n as longint a, b\\nend type\\n\\ntype padic\\ndeclare function sqrt (byref q as ratio, byval sw as integer) as integer\\n'p-adic square root of q = a/b, set sw to print\\ndeclare sub printf (byval sw as integer)\\n'print expansion, set sw to print rational\\ndeclare function crat (byval sw as integer) as ratio\\n'rational reconstruction\\n\\ndeclare sub cmpt (byref a as padic)\\n'let self:= complement_a\\ndeclare sub sqr (byref a as padic)\\n'let self:= a ^ 2\\n\\n as long d(-emx to emx - 1)\\n as integer v\\nend type\\n\\n\\n'global variables\\ndim shared as long p1, p = 7\\n'default prime\\ndim shared as integer k = 11\\n'precision\\n\\n#define min(a, b) iif((a) > (b), b, a)\\n\\n\\n'------------------------------------------------\\n'p-adic square root of g = a/b\\nfunction padic.sqrt (byref g as ratio, byval sw as integer) as integer\\ndim as longint a = g.a, b = g.b\\ndim as longint q, x, pk, pm\\ndim as long f1, r, s, t\\ndim i as integer, f as double\\nsqrt = 0\\n\\n if b = 0 then return 1\\n if b < 0 then b = -b: a = -a\\n if p < 2 or k < 1 then return 1\\n\\n 'max. short prime\\n p = min(p, Pmax)\\n\\n if sw then\\n 'echo numerator, denominator,\\n print a;\\\"/\\\";str(b);\\\" + \\\";\\n 'prime and precision\\n print \\\"O(\\\";str(p);\\\"^\\\";str(k);\\\")\\\"\\n end if\\n\\n 'initialize\\n v = 0\\n p1 = p - 1\\n for i = -emx to emx - 1\\n d(i) = 0: next\\n\\n if a = 0 then return 0\\n\\n 'valuation\\n do until b mod p\\n b \\\\= p: v -= 1\\n loop\\n do until a mod p\\n a \\\\= p: v += 1\\n loop\\n\\n if (v and 1) = 1 then\\n 'odd valuation\\n print \\\"non-residue mod\\\"; p\\n return -1\\n end if\\n\\n 'max. array length\\n k = min(k + v, emx - 1)\\n k -= v: v shr= 1\\n\\n if abs(a) > amx or b > amx then return -1\\n\\n if p = 2 then\\n '1 / b = b (mod 8)\\n 'a / b = 1 (mod 8)\\n t = a * b\\n if (t and 7) - 1 then\\n print \\\"non-residue mod 8\\\"\\n return -1\\n end if\\n\\n else\\n 'find root for small p\\n for r = 1 to p1\\n q = b * r * r - a\\n if q mod p = 0 then exit for\\n next r\\n\\n if r = p then\\n print \\\"non-residue mod\\\"; p\\n return -1\\n end if\\n\\n 'f'(r) = 2br\\n t = b * r shl 1\\n\\n s = 0\\n t mod= p\\n 'modular inverse for small p\\n for f1 = 1 to p1\\n s += t\\n if s > p1 then s -= p\\n if s = 1 then exit for\\n next f1\\n\\n if f1 = p then\\n print \\\"impossible inverse mod\\\"\\n return -1\\n end if\\n end if\\n\\n 'evaluate f(x)\\n #macro evalf(x)\\n f = b * x * cdbl(x / pk)\\n f -= cdbl(a / pk)\\n 'overflow\\n if f > Mxd then exit for\\n q = clngint(f)\\n #endmacro\\n\\n if p = 2 then\\n 'initialize\\n x = 1\\n d(v) = 1\\n d(v + 1) = 0\\n\\n pk = 4\\n for i = v + 2 to k - 1 + v\\n pk shl= 1\\n '2-power overflow\\n if pk < 1 then exit for\\n evalf(x)\\n 'next digit\\n d(i) = iif(q and 1, 1, 0)\\n 'lift x\\n x += d(i) * (pk shr 1)\\n next i\\n\\n else\\n '-1 / f'(x) mod p\\n f1 = p - f1\\n x = r\\n d(v) = x\\n\\n pk = 1\\n for i = v + 1 to k - 1 + v\\n pm = pk: pk *= p\\n if pk \\\\ pm - p then exit for\\n evalf(x)\\n d(i) = q * f1 mod p\\n if d(i) < 0 then d(i) += p\\n x += d(i) * pk\\n next i\\n end if\\n k = i - v\\n\\n if sw then print \\\"lift:\\\";x;\\\" mod\\\";p;\\\"^\\\";str(k)\\nend function\\n\\n'------------------------------------------------\\n'rational reconstruction\\nfunction padic.crat (byval sw as integer) as ratio\\ndim as integer i, j, t = min(v, 0)\\ndim as longint s, pk, pm\\ndim as long q, x, y\\ndim as double f, h\\ndim r as ratio\\n\\n 'weighted digit sum\\n s = 0: pk = 1\\n for i = t to k - 1 + v\\n pm = pk: pk *= p\\n\\n if pk \\\\ pm - p then\\n 'overflow\\n pk = pm: exit for\\n end if\\n\\n s += d(i) * pm '(mod pk)\\n next i\\n\\n 'lattice basis reduction\\n dim as longint m(1) = {pk, s}\\n dim as longint n(1) = {0, 1}\\n 'norm(v)^2\\n h = cdbl(s) * s + 1\\n i = 0: j = 1\\n\\n 'Lagrange's algorithm\\n do\\n f = m(i) * (m(j) / h)\\n f += n(i) * (n(j) / h)\\n\\n 'Euclidean step\\n q = int(f +.5)\\n m(i) -= q * m(j)\\n n(i) -= q * n(j)\\n\\n f = h\\n h = cdbl(m(i)) * m(i)\\n h += cdbl(n(i)) * n(i)\\n 'compare norms\\n if h < f then\\n 'interchange vectors\\n swap i, j\\n else\\n exit do\\n end if\\n loop\\n\\n x = m(j): y = n(j)\\n if y < 0 then y = -y: x = -x\\n\\n 'check determinant\\n t = abs(m(i) * y - x * n(i)) = pk\\n\\n if t = 0 then\\n print \\\"crat: fail\\\"\\n x = 0: y = 1\\n\\n else\\n 'negative powers\\n for i = v to -1\\n y *= p: next\\n\\n if sw then\\n print x;\\n if y > 1 then print \\\"/\\\";str(y);\\n print\\n end if\\n end if\\n\\n r.a = x: r.b = y\\nreturn r\\nend function\\n\\n\\n'print expansion\\nsub padic.printf (byval sw as integer)\\ndim as integer i, t = min(v, 0)\\n\\n for i = k - 1 + t to t step -1\\n print d(i);\\n if i = 0 andalso v < 0 then print \\\".\\\";\\n next i\\n print\\n\\n 'rational approximation\\n if sw then crat(sw)\\nend sub\\n\\n'------------------------------------------------\\n'let self:= complement_a\\nsub padic.cmpt (byref a as padic)\\ndim i as integer, r as padic\\ndim as long c = 1\\nwith r\\n .v = a.v\\n\\n for i = .v to k +.v\\n c += p1 - a.d(i)\\n 'carry\\n if c > p1 then\\n .d(i) = c - p: c = 1\\n else\\n .d(i) = c: c = 0\\n end if\\n next i\\nend with\\nthis = r\\nend sub\\n\\n'let self:= a ^ 2\\nsub padic.sqr (byref a as padic)\\ndim as long ptr rp, ap = @a.d(a.v)\\ndim as longint q, c = 0\\ndim as integer i, j\\ndim r as padic\\nwith r\\n .v = a.v shl 1\\n rp = @.d(.v)\\n\\n for i = 0 to k\\n for j = 0 to i\\n c += ap[j] * ap[i - j]\\n next j\\n 'Euclidean step\\n q = c \\\\ p\\n rp[i] = c - q * p\\n c = q\\n next i\\nend with\\nthis = r\\nend sub\\n\\n\\n'main\\n'------------------------------------------------\\ndim as integer sw\\ndim as padic a, c\\ndim as ratio q, r\\n\\nwidth 64, 30\\ncls\\n\\n' -7 + O(2^7)\\ndata -7,1, 2,7\\ndata 9,1, 2,8\\ndata 17,1, 2,9\\ndata 497,10496, 2,18\\ndata 10496,497, 2,19\\n\\ndata -577215,664901, 3,23\\ndata 15403,26685, 3,18\\n\\ndata -1,1, 5,8\\ndata 86,25, 5,8\\ndata 2150,1, 5,8\\n\\ndata 2,1, 7,8\\ndata 11696,621467, 7,11\\ndata -27764,11521, 7,11\\ndata -27584,12953, 7,11\\n\\ndata -166420,135131, 11,11\\ndata 14142,135623, 5,15\\ndata -255,256, 257,3\\n\\ndata 0,0, 0,0\\n\\n\\nprint\\ndo\\n read q.a,q.b, p,k\\n\\n sw = a.sqrt(q, 1)\\n if sw = 1 then exit do\\n if sw then ? : continue do\\n\\n print \\\"sqrt +/-\\\"\\n print \\\"...\\\";\\n a.printf(0)\\n a.cmpt(a)\\n print \\\"...\\\";\\n a.printf(0)\\n\\n c.sqr(a)\\n print \\\"sqrt^2\\\"\\n print \\\" \\\";\\n c.printf(0)\\n r = c.crat(1)\\n\\n '{r = q}\\n if q.a * r.b - r.a * q.b then\\n print \\\"fail: sqrt^2\\\"\\n end if\\n\\n print : ?\\nloop\\n\\nend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"{-# LANGUAGE KindSignatures, DataKinds #-}\\n\\nimport Data.Ratio\\nimport Data.List (find)\\nimport GHC.TypeLits\\nimport Padic\\n\\npSqrt :: KnownNat p => Rational -> Padic p\\npSqrt r = res\\n where\\n res = maybe Null mkUnit series\\n (a, b) = (numerator r, denominator r)\\n series = case modulo res of\\n\\n 2 | eqMod 4 a 3 -> Nothing\\n | not (eqMod 8 a 1) -> Nothing\\n | otherwise -> Just $ 1 : 0 : go 8 1\\n where\\n go pk x =\\n let q = ((b*x*x - a) `div` pk) `mod` 2\\n in q : go (2*pk) (x + q * (pk `div` 2))\\n\\n p -> do\\n y <- find (\\\\x -> eqMod p (b*x*x) a) [1..p-1]\\n df <- recipMod p (2*b*y)\\n let go pk x =\\n let f = (b*x*x - a) `div` pk\\n d = (f * (p - df)) `mod` p\\n in x `div` (pk `div` p) : go (p*pk) (x + d*pk)\\n Just $ go p y\\n\\neqMod :: Integral a => a -> a -> a -> Bool\\neqMod p a b = a `mod` p == b `mod` p\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"using Nemo, LinearAlgebra\\n\\nset_printing_mode(FlintPadicField, :terse)\\n\\n\\\"\\\"\\\" convert to Rational (rational reconstruction) \\\"\\\"\\\"\\nfunction toRational(pa::padic)\\n rat = lift(QQ, pa)\\n r, den = BigInt(numerator(rat)), Int(denominator(rat))\\n p, k = Int(prime(parent(pa))), Int(precision(pa))\\n N = BigInt(p^k)\\n a1, a2 = [N, 0], [r, 1]\\n while dot(a1, a1) > dot(a2, a2)\\n q = dot(a1, a2) // dot(a2, a2)\\n a1, a2 = a2, a1 - round(q) * a2\\n end\\n if dot(a1, a1) < N\\n return (Rational{Int}(a1[1]) // Rational{Int}(a1[2])) // Int(den)\\n else\\n return Int(r) // den\\n end\\nend\\n\\nfunction dstring(pa::padic)\\n u, v, n, p, k = pa.u, pa.v, pa.N, pa.parent.p, pa.parent.prec_max\\n d = digits(v > 0 ? u * p^v : u, base=p, pad=k)\\n return prod([i == k + v && v != 0 ? \\\"$x . \\\" : \\\"$x \\\" for (i, x) in enumerate(reverse(d))])\\nend\\n\\nconst DATA = [\\n [-7, 1, 2, 7],\\n [9, 1, 2, 8],\\n [17, 1, 2, 9],\\n [-1, 1, 5, 8],\\n [86, 25, 5, 8],\\n [2150, 1, 5, 8],\\n [2, 1, 7, 8],\\n [3029, 4821, 7, 9],\\n [379, 449, 7, 8],\\n [717, 8, 11, 7],\\n [1414, 213, 41, 5],\\n [-255, 256, 257, 3]\\n]\\n\\nfor (num1, den1, P, K) in DATA\\n Qp = PadicField(P, K)\\n a = Qp(QQ(num1 // den1))\\n c = sqrt(a)\\n r = toRational(c * c)\\n println(a, \\\"\\\\nsqrt +/-\\\\n\\\", dstring(c), \\\"\\\\n\\\", dstring(-c), \\\"\\\\nCheck sqrt^2:\\\\n\\\", dstring(c * c), \\\"\\\\n\\\", r, \\\"\\\\n\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import strformat\\n\\nconst\\n Emx = 64 # Exponent maximum.\\n Amx = 6000 # Argument maximum.\\n PMax = 32749 # Prime maximum.\\n\\ntype\\n\\n Ratio = tuple[a, b: int]\\n\\n Padic = object\\n p: int # Prime.\\n k: int # Precision.\\n v: int\\n d: array[-Emx..(Emx-1), int]\\n\\n PadicError = object of ValueError\\n\\n\\nproc sqrt(pa: var Padic; q: Ratio; sw: bool) =\\n ## Return the p-adic square root of q = a/b. Set sw to print.\\n\\n var (a, b) = q\\n var i, x: int\\n\\n if b == 0:\\n raise newException(PadicError, &\\\"Wrong rational: {a}/{b}\\\" )\\n if b < 0:\\n b = -b\\n a = -a\\n if pa.p < 2:\\n raise newException(PadicError, &\\\"Wrong value for p: {pa.p}\\\")\\n if pa.k < 1:\\n raise newException(PadicError, &\\\"Wrong value for k: {pa.k}\\\")\\n pa.p = min(pa.p, PMax) # Maximum short prime.\\n\\n if sw: echo &\\\"{a}/{b} + 0({pa.p}^{pa.k})\\\"\\n\\n # Initialize.\\n pa.v = 0\\n pa.d.reset()\\n if a == 0: return\\n\\n # Valuation.\\n while b mod pa.p == 0:\\n b = b div pa.p\\n dec pa.v\\n while a mod pa.p == 0:\\n a = a div pa.p\\n inc pa.v\\n if (pa.v and 1) != 0:\\n # Odd valuation.\\n raise newException(PadicError, &\\\"Non-residue mod {pa.p}.\\\")\\n\\n # Maximum array length.\\n pa.k = min(pa.k + pa.v, Emx - 1) - pa.v\\n pa.v = pa.v shr 1\\n\\n if abs(a) > Amx or b > Amx:\\n raise newException(PadicError, &\\\"Rational exceeding limits: {a}/{b}.\\\")\\n\\n if pa.p == 2:\\n # 1 / b = b (mod 8); a / b = 1 (mod 8).\\n if (a * b and 7) - 1 != 0:\\n raise newException(PadicError, \\\"Non-residue mod 8.\\\")\\n\\n # Initialize.\\n x = 1\\n pa.d[pa.v] = 1\\n pa.d[pa.v + 1] = 0\\n var pk = 4\\n i = pa.v + 2\\n while i < pa.k + pa.v:\\n pk *= 2\\n let f = b * x * x - a\\n let q = f div pk\\n if f != q * pk: break # Overflow.\\n # Next digit.\\n pa.d[i] = if (q and 1) != 0: 1 else: 0\\n # Lift \\\"x\\\".\\n x += pa.d[i] * (pk shr 1)\\n inc i\\n\\n else:\\n # Find root for small \\\"p\\\".\\n var r = 1\\n while r < pa.p:\\n if (b * r * r - a) mod pa.p == 0: break\\n inc r\\n if r == pa.p:\\n raise newException(PadicError, &\\\"Non-residue mod {pa.p}.\\\")\\n let t = (b * r shl 1) mod pa.p\\n var s = 0\\n\\n # Modular inverse for small \\\"p\\\".\\n var f1 = 1\\n while f1 < pa.p:\\n inc s, t\\n if s >= pa.p: dec s, pa.p\\n if s == 1: break\\n inc f1\\n if f1 == pa.p:\\n raise newException(PadicError, \\\"Impossible to compute inverse modulo\\\")\\n\\n f1 = pa.p - f1\\n x = r\\n pa.d[pa.v] = x\\n\\n var pk = 1\\n i = pa.v + 1\\n while i < pa.k + pa.v:\\n pk *= pa.p\\n let f = b * x * x - a\\n let q = f div pk\\n if f != q * pk: break # Overflow.\\n pa.d[i] = q * f1 mod pa.p\\n if pa.d[i] < 0: pa.d[i] += pa.p\\n x += pa.d[i] * pk\\n inc i\\n\\n pa.k = i - pa.v\\n if sw: echo &\\\"lift: {x} mod {pa.p}^{pa.k}\\\"\\n\\n\\nproc crat(pa: Padic; sw: bool): Ratio =\\n ## Rational reconstruction.\\n\\n # Weighted digit sum.\\n var\\n s = 0\\n pk = 1\\n for i in min(pa.v, 0)..<(pa.k + pa.v):\\n let pm = pk\\n pk *= pa.p\\n if pk div pm - pa.p != 0:\\n # Overflow.\\n pk = pm\\n break\\n s += pa.d[i] * pm\\n\\n # Lattice basis reduction.\\n var\\n m = [pk, s]\\n n = [0, 1]\\n i = 0\\n j = 1\\n s = s * s + 1\\n # Lagrange's algorithm.\\n while true:\\n # Euclidean step.\\n var q = ((m[i] * m[j] + n[i] * n[j]) / s).toInt\\n m[i] -= q * m[j]\\n n[i] -= q * n[j]\\n q = s\\n s = m[i] * m[i] + n[i] * n[i]\\n # Compare norms.\\n if s < q: swap i, j # Interchange vectors.\\n else: break\\n\\n var x = m[j]\\n var y = n[j]\\n if y < 0:\\n y = -y\\n x = -x\\n\\n # Check determinant.\\n if abs(m[i] * y - x * n[i]) != pk:\\n raise newException(PadicError, \\\"Rational reconstruction failed.\\\")\\n\\n # Negative powers.\\n for i in pa.v..(-1): y *= pa.p\\n\\n if sw: echo x, if y > 1: '/' & $y else: \\\"\\\"\\n result = (x, y)\\n\\n\\nfunc cmpt(pa: Padic): Padic =\\n ## Return the complement.\\n result = Padic(p: pa.p, k: pa.k, v: pa.v)\\n var c = 1\\n for i in pa.v..(pa.k + pa.v):\\n inc c, pa.p - 1 - pa.d[i]\\n if c >= pa.p:\\n result.d[i] = c - pa.p\\n c = 1\\n else:\\n result.d[i] = c\\n c = 0\\n\\n\\nfunc sqr(pa: Padic): Padic =\\n ## Return the square of a P-adic number.\\n result = Padic(p: pa.p, k: pa.k, v: pa.v * 2)\\n var c = 0\\n for i in 0..pa.k:\\n for j in 0..i:\\n c += pa.d[pa.v + j] * pa.d[pa.v + i - j]\\n # Euclidean step.\\n let q = c div pa.p\\n result.d[result.v + i] = c - q * pa.p\\n c = q\\n\\n\\nfunc `$`(pa: Padic): string =\\n ## String representation.\\n let t = min(pa.v, 0)\\n for i in countdown(pa.k - 1 + t, t):\\n result.add $pa.d[i]\\n if i == 0 and pa.v < 0: result.add \\\".\\\"\\n result.add \\\" \\\"\\n\\n\\nwhen isMainModule:\\n\\n const Data = [[-7, 1, 2, 7],\\n [9, 1, 2, 8],\\n [17, 1, 2, 9],\\n [497, 10496, 2, 18],\\n [10496, 497, 2, 19],\\n [3141, 5926, 3, 15],\\n [2718, 281, 3, 13],\\n [-1, 1, 5, 8],\\n [86, 25, 5, 8],\\n [2150, 1, 5, 8],\\n [2,1, 7, 8],\\n [-2645, 28518, 7, 9],\\n [3029, 4821, 7, 9],\\n [379, 449, 7, 8],\\n [717, 8, 11, 7],\\n [1414, 213, 41, 5],\\n [-255, 256, 257, 3]]\\n\\n for d in Data:\\n try:\\n let q: Ratio = (d[0], d[1])\\n var a = Padic(p: d[2], k: d[3])\\n a.sqrt(q, true)\\n echo \\\"sqrt +/-\\\"\\n echo \\\"...\\\", a\\n a = a.cmpt()\\n echo \\\"...\\\", a\\n let c = sqr(a)\\n echo \\\"sqrt^2\\\"\\n echo \\\" \\\", c\\n let r = c.crat(true)\\n if q.a * r.b - r.a * q.b != 0:\\n echo \\\"fail: sqrt^2\\\"\\n echo \\\"\\\"\\n except PadicError:\\n echo getCurrentExceptionMsg()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"constant EMX = 48 // exponent maximum (if indexing starts at -EMX)\\nconstant DMX = 1e5 // approximation loop maximum\\nconstant AMX = 700000 // argument maximum\\nconstant PMAX = 32749 // prime maximum\\n\\n// global variables\\ninteger p1 = 0\\ninteger p = 7 // default prime\\ninteger k = 11 // precision\\n\\ntype Ratio(sequence r)\\n return length(r)=2 and integer(r[1]) and integer(r[2])\\nend type\\n\\nclass Padic\\n integer v = 0\\n sequence d = repeat(0,EMX*2)\\n\\n function square_root(Ratio g, integer sw)\\n -- p-adic square root of g = a/b\\n integer {a,b} = g\\n atom f, q, pk, x\\n integer f1, r, s, t, i, res = 0\\n\\n if b = 0 then return 1 end if\\n if b < 0 then\\n b = -b\\n a = -a\\n end if\\n if p < 2 or k < 1 then return 1 end if\\n\\n -- max. short prime\\n p = min(p, PMAX)\\n if sw then\\n -- numerator, denominator, prime, precision\\n printf(1,\\\"%d/%d + O(%d^%d)\\\\n\\\",{a,b,p,k})\\n end if\\n\\n -- initialize\\n v = 0\\n p1 = p - 1\\n sequence ntd = repeat(0,2*EMX) -- (new this.d)\\n if a = 0 then return 0 end if\\n\\n -- valuation\\n while remainder(b,p)=0 do\\n b /= p\\n v -= 1\\n end while\\n while remainder(a,p)=0 do\\n a /= p\\n v += 1\\n end while\\n\\n if remainder(v,2) then\\n -- odd valuation\\n printf(1,\\\"(1)non-residue mod %d\\\\n\\\",p)\\n return -1\\n end if\\n\\n -- max. array length\\n k = min(k + v, EMX - 1) - v\\n v = floor(v/2)\\n\\n if abs(a) > AMX or b > AMX then return -1 end if\\n\\n if p = 2 then\\n --1 / b = b (mod 8)\\n --a / b = 1 (mod 8)\\n t = a * b\\n if mod(t,8)-1 then\\n printf(1,\\\"(2)non-residue mod 8\\\\n\\\")\\n return -1\\n end if\\n\\n else\\n -- find root for small p\\n for r = 1 to p1 do\\n f = b * r * r - a\\n if mod(f,p) = 0 then exit end if\\n end for\\n\\n if r = p then\\n printf(1,\\\"(3)non-residue mod %d\\\\n\\\", p)\\n return -1\\n end if\\n\\n -- f'(r) = 2br\\n t = b * r * 2\\n\\n s = 0\\n t = mod(t,p)\\n -- modular inverse for small p\\n for f1 = 1 to p1 do\\n s += t\\n if s > p1 then s -= p end if\\n if s = 1 then exit end if\\n end for\\n\\n if f1 = p then\\n printf(1,\\\"impossible inverse mod\\\\n\\\")\\n return -1\\n end if\\n end if\\n\\n if p = 2 then\\n -- initialize\\n x = 1\\n ntd[v+EMX+1] = 1\\n ntd[v+EMX+2] = 0\\n\\n pk = 4\\n for i = v+2 to k-1+v do\\n pk *= 2\\n f = b * x * x - a\\n q = floor(f/pk)\\n -- overflow\\n if f != q * pk then exit end if\\n -- next digit\\n ntd[i+EMX+1] = and_bits(q,1)\\n -- lift x\\n x += ntd[i+EMX+1] * floor(pk/2)\\n end for\\n\\n else\\n -- -1 / f'(x) mod p\\n f1 = p - f1\\n x = r\\n ntd[v+EMX+1] = x\\n\\n pk = 1\\n for i = v+1 to k-1 do\\n pk *= p\\n f = b * x * x - a\\n q = floor(f/pk)\\n -- overflow\\n if f - q * pk then exit end if\\n r = mod(q*f1,p)\\n if r < 0 then r += p end if\\n ntd[i+EMX+1] = r\\n x += r * pk\\n end for\\n end if\\n this.d = ntd\\n k = i-v\\n\\n if sw then\\n printf(1,\\\"lift: %d mod %d^%d\\\\n\\\",{x,p,k})\\n end if\\n return 0\\n end function\\n\\n function square()\\n integer c = 0\\n Padic r = new()\\n r.v = this.v * 2\\n sequence td = this.d,\\n rd = r.d\\n for i=0 to k do\\n for j=0 to i do\\n c += td[v+j+EMX+1] * td[v+i-j+EMX+1]\\n end for\\n // Euclidean step\\n integer q = floor(c/p)\\n rd[r.v+i+EMX+1] = c - q*p\\n c = q\\n end for\\n r.d = rd\\n return r\\n end function\\n\\n function complement()\\n integer c = 1\\n Padic r = new({v})\\n sequence rd = r.d\\n for i=v to k+v do\\n integer dx = i+EMX+1\\n c += p1 - this.d[dx]\\n if c>p1 then\\n rd[dx] = c - p\\n c = 1\\n else\\n rd[dx] = c\\n c = 0\\n end if\\n end for\\n r.d = rd\\n return r\\n end function\\n\\n function crat(integer sw)\\n -- rational reconstruction\\n integer i, j, t = min(v, 0)\\n Ratio r\\n atom f\\n integer x, y\\n atom p1,pk, q, s\\n\\n -- weighted digit sum\\n s = 0\\n pk = 1\\n for i = t to k-1+v do\\n p1 = pk\\n pk *= p\\n if floor(pk/p1) - p then\\n -- overflow\\n pk = p1\\n exit\\n end if\\n s += d[i+EMX+1] * p1 --(mod pk)\\n end for\\n\\n -- lattice basis reduction\\n sequence m = {pk, s},\\n n = {0, 1}\\n i = 1\\n j = 2\\n s = s * s + 1 -- norm(v)^2\\n\\n -- Lagrange's algorithm\\n while true do\\n f = (m[i] * m[j] + n[i] * n[j]) / s\\n\\n -- Euclidean step\\n q = floor(f +.5)\\n m[i] -= q * m[j]\\n n[i] -= q * n[j]\\n\\n q = s\\n s = m[i] * m[i] + n[i] * n[i]\\n -- compare norms\\n if s < q then\\n -- interchange vectors\\n {i,j} = {j,i}\\n else\\n exit\\n end if\\n end while\\n\\n x = m[j]\\n y = n[j]\\n if y < 0 then\\n y = -y\\n x = -x\\n end if\\n\\n -- check determinant\\n t = abs(m[i] * y - x * n[i]) == pk\\n\\n if not t then\\n printf(1,\\\"crat: fail\\\\n\\\")\\n x = 0\\n y = 1\\n else\\n -- negative powers\\n for i = v to -1 do\\n y *= p\\n end for\\n\\n if sw then\\n-- printf(1,iff(y=1?\\\"%d\\\":\\\"%d/%d\\\"),{x*sgn,y})\\n printf(1,iff(y=1?\\\"%d\\\\n\\\":\\\"%d/%d\\\\n\\\"),{x,y})\\n end if\\n end if\\n\\n r = {x,y}\\n return r\\n end function\\n\\n procedure prntf(bool sw)\\n -- print expansion\\n integer t = min(v, 0)\\n for i=k-1+t to t by -1 do\\n printf(1,\\\"%d\\\",d[i+EMX+1])\\n printf(1,iff(i=0 and v<0?\\\". \\\":\\\" \\\"))\\n end for\\n printf(1,\\\"\\\\n\\\")\\n // rational approximation\\n if sw then crat(sw) end if\\n end procedure\\nend class\\n\\nconstant tests = {\\n {{-7,1},2,7},\\n--/*\\n {{9,1},2,8},\\n {{17,1},2,9},\\n {{497,10496},2,18},\\n {{10496,497},2,19},\\n\\n {{3141,5926},3,17},\\n {{2718,281},3,15},\\n\\n {{-1,1},5,8},\\n {{86,25},5,8},\\n {{2150,1},5,10},\\n\\n {{2,1},7,8},\\n {{-2645,28518},7,9},\\n {{3029,4821},7,9},\\n {{379,449},7,8},\\n\\n {{717,8},11,7},\\n {{1414,213},41,5},\\n--*/\\n {{-255,256},257,3}\\n}\\n\\nPadic a = new(), c\\nRatio q, r\\n\\nfor i=1 to length(tests) do\\n {q,p,k} = tests[i]\\n\\n integer sw = a.square_root(q, 1)\\n if sw=1 then exit end if\\n if sw=0 then\\n printf(1,\\\"square_root +/-\\\\n\\\")\\n printf(1,\\\"... \\\")\\n a.prntf(0)\\n a = a.complement()\\n printf(1,\\\"... \\\")\\n a.prntf(0)\\n\\n c = a.square()\\n printf(1,\\\"square_root^2\\\\n\\\")\\n printf(1,\\\" \\\")\\n c.prntf(0)\\n r = c.crat(1)\\n\\n if q[1] * r[2] - r[1] * q[2] then\\n printf(1,\\\"fail: square_root^2\\\\n\\\")\\n end if\\n end if\\n printf(1,\\\"\\\\n\\\")\\nend for\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Struct\\nimport \\\"./big\\\" for BigInt\\n\\n// constants\\nvar EMX = 64 // exponent maximum (if indexing starts at -EMX)\\nvar AMX = 6000 // argument maximum\\nvar PMAX = 32749 // prime maximum\\n\\n// global variables\\nvar P1 = 0\\nvar P = 7 // default prime\\nvar K = 11 // precision\\n\\nvar Ratio = Struct.create(\\\"Ratio\\\", [\\\"a\\\", \\\"b\\\"])\\n\\nclass Padic {\\n // uninitialized\\n construct new() {\\n _v = 0\\n _d = List.filled(2 * EMX, 0) // add EMX to index to be consistent wih FB\\n }\\n\\n // properties\\n v { _v }\\n v=(o) { _v = o }\\n d { _d }\\n\\n // (re)initialize 'this' to the square root of a Ratio, set 'sw' to print\\n sqrt(g, sw) {\\n var a = g.a\\n var b = g.b\\n if (b == 0) return 1\\n if (b < 0) {\\n b = -b\\n a = -a\\n }\\n if (P < 2 || K < 1) return 1\\n P = P.min(PMAX) // maximum short prime\\n if (sw != 0) {\\n System.write(\\\"%(a)/%(b) + \\\") // numerator, denominator\\n System.print(\\\"0(%(P)^%(K))\\\") // prime, precision\\n }\\n\\n // (re)initialize\\n _v = 0\\n P1 = P - 1\\n _d = List.filled(2 * EMX, 0)\\n if (a == 0) return 0\\n\\n //valuation\\n while (b%P== 0) {\\n b = (b/P).truncate\\n _v = _v - 1\\n }\\n\\n while (a%P == 0) {\\n a = (a/P).truncate\\n _v = _v + 1\\n }\\n\\n if ((_v & 1) == 1) {\\n // odd valuation\\n System.print(\\\"non-residue mod %(P)\\\")\\n return -1\\n }\\n K = (K + _v).min(EMX - 1) - _v // maximum array length\\n _v = (_v/2).truncate\\n\\n if (a.abs > AMX || b > AMX) return -1\\n var bb = BigInt.new(b) // to avoid overflowing 'f(x) = b * x * x – a'\\n var r\\n var s\\n var t\\n var f\\n var f1\\n if (P == 2) {\\n t = a * b\\n if ((t & 7) - 1 != 0) {\\n System.print(\\\"non-residue mod 8\\\")\\n return -1\\n }\\n } else {\\n // find root for small P\\n r = 1\\n while (r <= P1) {\\n f = bb * r * r - a\\n if ((f % P) == 0) break\\n r = r + 1\\n }\\n if (r == P) {\\n System.print(\\\"non-residue mod %(P)\\\")\\n return -1\\n }\\n t = 2 * b * r\\n s = 0\\n t = t % P\\n\\n // modular inverse for small P\\n f1 = 1\\n while (f1 <= P1) {\\n s = s + t\\n if (s > P1) s = s - P\\n if (s == 1) break\\n f1 = f1 + 1\\n }\\n if (f1 == P) {\\n System.print(\\\"impossible inverse mod\\\")\\n return -1\\n }\\n }\\n var x\\n var pk\\n var q\\n var i\\n if (P == 2) {\\n // initialize\\n x = 1\\n _d[_v+EMX] = 1\\n _d[_v+1+EMX] = 0\\n pk = 4\\n i = _v + 2\\n while (i <= K - 1 + _v) {\\n pk = pk * 2\\n f = bb * x * x - a\\n q = f / pk\\n // overflow\\n if (f != q * pk) break\\n // next digit\\n _d[i+EMX] = ((q & 1) != 0) ? 1 : 0\\n // lift x\\n x = x + _d[i+EMX]*(pk >> 1)\\n i = i + 1\\n }\\n\\n } else {\\n f1 = P - f1\\n x = r\\n _d[_v+EMX] = x\\n pk = 1\\n i = _v + 1\\n while (i <= K - 1 + _v) {\\n pk = pk * P\\n f = bb * x * x - a\\n q = f / pk\\n // overflow\\n if (f != q * pk) break\\n _d[i+EMX] = q.toSmall * f1 % P\\n if (_d[i+EMX] < 0) _d[i+EMX] = _d[i+EMX] + P\\n x = x + _d[i+EMX]*pk\\n i = i + 1\\n }\\n }\\n K = i - _v\\n if (sw != 0) System.print(\\\"lift: %(x) mod %(P)^%(K)\\\")\\n return 0\\n }\\n\\n // rational reconstruction\\n crat(sw) {\\n var t = _v.min(0)\\n // weighted digit sum\\n var s = 0\\n var pk = 1\\n for (i in t..K-1+_v) {\\n P1 = pk\\n pk = pk * P\\n if (((pk/P1).truncate - P) != 0) {\\n // overflow\\n pk = p1\\n break\\n }\\n s = s + _d[i+EMX]*P1\\n }\\n\\n // lattice basis reduction\\n var m = [pk, s]\\n var n = [0, 1]\\n var i = 0\\n var j = 1\\n s = s * s + 1\\n // Lagrange's algorithm\\n while (true) {\\n var f = (m[i] * m[j] + n[i] * n[j]) / s\\n // Euclidean step\\n var q = (f + 0.5).floor\\n m[i] = m[i] - q*m[j]\\n n[i] = n[i] - q*n[j]\\n q = s\\n s = m[i] * m[i] + n[i] * n[i]\\n // compare norms\\n if (s < q) {\\n // interchange vectors\\n var z = i\\n i = j\\n j = z\\n } else {\\n break\\n }\\n }\\n var x = m[j]\\n var y = n[j]\\n if (y < 0) {\\n y = -y\\n x = -x\\n }\\n\\n // check determinant\\n t = (m[i]*y - x*n[i]).abs == pk\\n if (!t) {\\n System.print(\\\"crat: fail\\\")\\n x = 0\\n y = 1\\n } else {\\n // negative powers\\n var i = _v\\n while (i <= -1) {\\n y = y * P\\n i = i + 1\\n }\\n if (sw != 0) {\\n System.write(x)\\n if (y > 1) System.write(\\\"/%(y)\\\")\\n System.print()\\n }\\n }\\n\\n return Ratio.new(x, y)\\n }\\n\\n // print expansion\\n printf(sw) {\\n var t = _v.min(0)\\n for (i in K - 1 + t..t) {\\n System.write(_d[i + EMX])\\n if (i == 0 && _v < 0) System.write(\\\".\\\")\\n System.write(\\\" \\\")\\n }\\n System.print()\\n // rational approximation\\n if (sw != 0) crat(sw)\\n }\\n\\n // complement\\n cmpt {\\n var c = 1\\n var r = Padic.new()\\n r.v = _v\\n for (i in r.v..K + r.v) {\\n c = c + P1 - _d[i+EMX]\\n if (c > P1) {\\n r.d[i+EMX] = c - P\\n c = 1\\n } else {\\n r.d[i+EMX] = c\\n c = 0\\n }\\n }\\n return r\\n }\\n\\n // square\\n sqr {\\n var c = 0\\n var r = Padic.new()\\n r.v = _v * 2\\n for (i in 0..K) {\\n for (j in 0..i) c = c + _d[_v+j+EMX] * _d[_v+i-j+EMX]\\n // Euclidean step\\n var q = (c/P).truncate\\n r.d[r.v+i+EMX] = c - q*P\\n c = q\\n }\\n return r\\n }\\n}\\n\\nvar data = [\\n [-7, 1, 2, 7],\\n [9, 1, 2, 8],\\n [17, 1, 2, 9],\\n [497, 10496, 2, 18],\\n [10496, 497, 2, 19],\\n [3141, 5926, 3, 15],\\n [2718, 281, 3, 13],\\n [-1, 1, 5, 8],\\n [86, 25, 5, 8],\\n [2150, 1, 5, 8],\\n [2,1, 7, 8],\\n [-2645, 28518, 7, 9],\\n [3029, 4821, 7, 9],\\n [379, 449, 7, 8],\\n [717, 8, 11, 7],\\n [1414, 213, 41, 5],\\n [-255, 256, 257, 3]\\n]\\n\\nvar sw = 0\\nvar a = Padic.new()\\nvar c = Padic.new()\\n\\nfor (d in data) {\\n var q = Ratio.new(d[0], d[1])\\n P = d[2]\\n K = d[3]\\n sw = a.sqrt(q, 1)\\n if (sw == 1) break\\n if (sw == 0) {\\n System.print(\\\"sqrt +/-\\\")\\n System.write(\\\"...\\\")\\n a.printf(0)\\n a = a.cmpt\\n System.write(\\\"...\\\")\\n a.printf(0)\\n c = a.sqr\\n System.print(\\\"sqrt^2\\\")\\n System.write(\\\" \\\")\\n c.printf(0)\\n var r = c.crat(1)\\n if (q.a * r.b - r.a * q.b != 0) {\\n System.print(\\\"fail: sqrt^2\\\")\\n }\\n System.print()\\n }\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"P-Adic-square-roots"}}},{"rowIdx":1474,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/P-value_correction\nnote: Probability and statistics\n","language":"00-META"},{"code":"Given a list of [[wp:p-value|p-values]], adjust the p-values for multiple comparisons. This is done in order to control the false positive, or Type 1 error rate. \n\nThis is also known as the \"[[wp:False discovery rate|false discovery rate]]\" (FDR). After adjustment, the p-values will be higher but still inside [0,1]. \n\nThe adjusted p-values are sometimes called \"q-values\".\n\n\n;Task:\nGiven one list of [[Welch's_t-test|p-values]], return the p-values correcting for multiple comparisons\n\n p = {4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03}\n\n\nThere are several methods to do this, see:\n* Yoav Benjamini, Yosef Hochberg \"[http://www.math.tau.ac.il/~ybenja/MyPapers/benjamini_hochberg1995.pdf Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing]\", ''Journal of the Royal Statistical Society. Series B'', Vol. 57, No. 1 (1995), pp. 289-300, JSTOR:[http://www.jstor.org/stable/2346101 2346101]\n* Yoav Benjamini, Daniel Yekutieli, \"[http://www.math.tau.ac.il/~ybenja/MyPapers/benjamini_yekutieli_ANNSTAT2001.pdf The control of the false discovery rate in multiple testing under dependency]\", ''Ann. Statist.'', Vol. 29, No. 4 (2001), pp. 1165-1188, DOI:[https://doi.org/10.1214/aos/1013699998 10.1214/aos/1013699998] JSTOR:[http://www.jstor.org/stable/2674075 2674075]\n* Sture Holm, \"A Simple Sequentially Rejective Multiple Test Procedure\", ''Scandinavian Journal of Statistics'', Vol. 6, No. 2 (1979), pp. 65-70, JSTOR:[https://www.jstor.org/stable/4615733 4615733]\n* Yosef Hochberg, \"A sharper Bonferroni procedure for multiple tests of significance\", ''Biometrika'', Vol. 75, No. 4 (1988), pp 800–802, DOI:[https://doi.org/10.1093/biomet/75.4.800 10.1093/biomet/75.4.800] JSTOR:[https://www.jstor.org/stable/2336325 2336325]\n* Gerhard Hommel, \"A stagewise rejective multiple test procedure based on a modified Bonferroni test\", ''Biometrika'', Vol. 75, No. 2 (1988), pp 383–386, DOI:[https://doi.org/10.1093/biomet/75.2.383 10.1093/biomet/75.2.383] JSTOR:[https://www.jstor.org/stable/2336190 2336190]\n\n\nEach method has its own advantages and disadvantages. \n<br><br>\n\n","language":"00-TASK"},{"code":"#include <stdio.h>//printf\n#include <stdlib.h>//qsort\n#include <math.h>//fabs\n#include <stdbool.h>//bool data type\n#include <strings.h>//strcasecmp\n#include <assert.h>//assert, necessary for random integer selection\n\nunsigned int * seq_len(const unsigned int START, const unsigned int END) {\n//named after R function of same name, but simpler function\n\tunsigned start = (unsigned)START;\n\tunsigned end = (unsigned)END;\n\tif (START == END) {\n\t\tunsigned int *restrict sequence = malloc( (end+1) * sizeof(unsigned int));\n\t\tif (sequence == NULL) {\n\t\t\tprintf(\"malloc failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tfor (unsigned i = 0; i < end; i++) {\n\t\t\tsequence[i] = i+1;\n\t\t}\n\t\treturn sequence;\n\t}\n\tif (START > END) {\n\t\tend = (unsigned)START;\n\t\tstart = (unsigned)END;\n\t}\n\tconst unsigned LENGTH = end - start ;\n\tunsigned int *restrict sequence = malloc( (1+LENGTH) * sizeof(unsigned int));\n\tif (sequence == NULL) {\n\t\tprintf(\"malloc failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\tperror(\"\");\n\t\texit(EXIT_FAILURE);\n\t}\n\tif (START < END) {\n\t\tfor (unsigned index = 0; index <= LENGTH; index++) {\n\t\t\tsequence[index] = start + index;\n\t\t}\n\t} else {\n\t\tfor (unsigned index = 0; index <= LENGTH; index++) {\n\t\t\tsequence[index] = end - index;\n\t\t}\n\t}\n\treturn sequence;\n}\n\n//modified from https://phoxis.org/2012/07/12/get-sorted-index-orderting-of-an-array/\n\ndouble *restrict base_arr = NULL;\n\nstatic int compar_increase (const void *restrict a, const void *restrict b) {\n\tint aa = *((int *restrict ) a), bb = *((int *restrict) b);\n\tif (base_arr[aa] < base_arr[bb]) {\n\t\treturn 1;\n\t} else if (base_arr[aa] == base_arr[bb]) {\n\t\treturn 0;\n\t} else {\n\t\treturn -1;\n\t}\n}\n\nstatic int compar_decrease (const void *restrict a, const void *restrict b) {\n\tint aa = *((int *restrict ) a), bb = *((int *restrict) b);\n\tif (base_arr[aa] < base_arr[bb]) {\n\t\treturn -1;\n\t} else if (base_arr[aa] == base_arr[bb]) {\n\t\treturn 0;\n\t} else {\n\t\treturn 1;\n\t}\n}\n\nunsigned int * order (const double *restrict ARRAY, const unsigned int SIZE, const bool DECREASING) {\n//this has the same name as the same R function\n\tunsigned int *restrict idx = malloc(SIZE * sizeof(unsigned int));\n\tif (idx == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tbase_arr = malloc(sizeof(double) * SIZE);\n\tif (base_arr == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tfor (unsigned int i = 0; i < SIZE; i++) {\n\t\tbase_arr[i] = ARRAY[i];\n\t\tidx[i] = i;\n\t}\n\tif (DECREASING == false) {\n\t\tqsort(idx, SIZE, sizeof(unsigned int), compar_decrease);\n\t} else if (DECREASING == true) {\n\t\tqsort(idx, SIZE, sizeof(unsigned int), compar_increase);\n\t}\n\tfree(base_arr); base_arr = NULL;\n\treturn idx;\n}\n\ndouble * cummin(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\n//this takes the same name of the R function which it copies\n//this requires a free() afterward where it is used\n\tif (NO_OF_ARRAY_ELEMENTS < 1) {\n\t\tputs(\"cummin function requires at least one element.\\n\");\n\t\tprintf(\"Failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\texit(EXIT_FAILURE);\n\t}\n\tdouble *restrict output = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\tif (output == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tdouble cumulative_min = ARRAY[0];\n\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {\n\t\tif (ARRAY[i] < cumulative_min) {\n\t\t\tcumulative_min = ARRAY[i];\n\t\t}\n\t\toutput[i] = cumulative_min;\n\t}\n\treturn output;\n}\n\ndouble * cummax(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\n//this takes the same name of the R function which it copies\n//this requires a free() afterward where it is used\n\tif (NO_OF_ARRAY_ELEMENTS < 1) {\n\t\tputs(\"function requires at least one element.\\n\");\n\t\tprintf(\"Failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\texit(EXIT_FAILURE);\n\t}\n\tdouble *restrict output = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\tif (output == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tdouble cumulative_max = ARRAY[0];\n\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {\n\t\tif (ARRAY[i] > cumulative_max) {\n\t\t\tcumulative_max = ARRAY[i];\n\t\t}\n\t\toutput[i] = cumulative_max;\n\t}\n\treturn output;\n}\n\ndouble * pminx(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS, const double X) {\n//named after the R function pmin\n\tif (NO_OF_ARRAY_ELEMENTS < 1) {\n\t\tputs(\"pmin requires at least one element.\\n\");\n\t\tprintf(\"Failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\texit(EXIT_FAILURE);\n\t}\n\tdouble *restrict pmin_array = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\tif (pmin_array == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\tif (ARRAY[index] < X) {\n\t\t\tpmin_array[index] = ARRAY[index];\n\t\t} else {\n\t\t\tpmin_array[index] = X;\n\t\t}\n\t}\n\treturn pmin_array;\n}\n\nvoid double_say (const double *restrict ARRAY, const size_t NO_OF_ARRAY_ELEMENTS) {\n\tprintf(\"[1] %e\", ARRAY[0]);\n\tfor (unsigned int i = 1; i < NO_OF_ARRAY_ELEMENTS; i++) {\n\t\tprintf(\" %.10f\", ARRAY[i]);\n\t\tif (((i+1) % 5) == 0) {\n\t\t\tprintf(\"\\n[%u]\", i+1);\n\t\t}\n\t}\n\tputs(\"\\n\");\n}\n\n/*void uint_say (const unsigned int *restrict ARRAY, const size_t NO_OF_ARRAY_ELEMENTS) {\n//for debugging\n\tprintf(\"%u\", ARRAY[0]);\n\tfor (size_t i = 1; i < NO_OF_ARRAY_ELEMENTS; i++) {\n\t\tprintf(\",%u\", ARRAY[i]);\n\t}\n\tputs(\"\\n\");\n}*/\n\ndouble * uint2double (const unsigned int *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\n\tdouble *restrict doubleArray = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\tif (doubleArray == NULL) {\n\t\tprintf(\"Failure to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\tperror(\"\");\n\t\texit(EXIT_FAILURE);\n\t}\n\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\tdoubleArray[index] = (double)ARRAY[index];\n\t}\n\treturn doubleArray;\n}\n\ndouble min2 (const double N1, const double N2) {\n\tif (N1 < N2) {\n\t\treturn N1;\n\t} else {\n\t\treturn N2;\n\t}\n}\n\ndouble * p_adjust (const double *restrict PVALUES, const unsigned int NO_OF_ARRAY_ELEMENTS, const char *restrict STRING) {\n//this function is a translation of R's p.adjust \"BH\" method\n// i is always i[index] = NO_OF_ARRAY_ELEMENTS - index - 1\n\tif (NO_OF_ARRAY_ELEMENTS < 1) {\n\t\tputs(\"p_adjust requires at least one element.\\n\");\n\t\tprintf(\"Failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\texit(EXIT_FAILURE);\n\t}\n\tshort int TYPE = -1;\n\tif (STRING == NULL) {\n\t\tTYPE = 0;\n\t} else if (strcasecmp(STRING, \"BH\") == 0) {\n\t\tTYPE = 0;\n\t} else if (strcasecmp(STRING, \"fdr\") == 0) {\n\t\tTYPE = 0;\n\t} else if (strcasecmp(STRING, \"by\") == 0) {\n\t\tTYPE = 1;\n\t} else if (strcasecmp(STRING, \"Bonferroni\") == 0) {\n\t\tTYPE = 2;\n\t} else if (strcasecmp(STRING, \"hochberg\") == 0) {\n\t\tTYPE = 3;\n\t} else if (strcasecmp(STRING, \"holm\") == 0) {\n\t\tTYPE = 4;\n\t} else if (strcasecmp(STRING, \"hommel\") == 0) {\n\t\tTYPE = 5;\n\t} else {\n\t\tprintf(\"%s doesn't match any accepted FDR methods.\\n\", STRING);\n\t\tprintf(\"Failed at %s line %u\\n\", __FILE__, __LINE__);\n\t\texit(EXIT_FAILURE);\n\t}\n//---------------------------------------------------------------------------\n//---------------------------------------------------------------------------\n\tif (TYPE == 2) {//Bonferroni method\n\t\tdouble *restrict bonferroni = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tif (bonferroni == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tconst double BONFERRONI = PVALUES[index] * NO_OF_ARRAY_ELEMENTS;\n\t\t\tif (BONFERRONI >= 1.0) {\n\t\t\t\tbonferroni[index] = 1.0;\n\t\t\t} else if ((0.0 <= BONFERRONI) && (BONFERRONI < 1.0)) {\n\t\t\t\tbonferroni[index] = BONFERRONI;\n\t\t\t} else {\n\t\t\t\tprintf(\"%g is outside of the interval I planned.\\n\", BONFERRONI);\n\t\t\t\tprintf(\"Failure at %s line %u\\n\", __FILE__, __LINE__);\n\t\t\t\texit(EXIT_FAILURE);\n\t\t\t}\n\t\t}\n\t\treturn bonferroni;\n//---------------------------------------------------------------------------\n//---------------------------------------------------------------------------\n\t} else if (TYPE == 4) {//Holm method\n/*these values are computed separately from BH, BY, and Hochberg because they are\ncomputed differently*/\n\t\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, false);\n//sorted in reverse of methods 0-3\n\t\tdouble *restrict o2double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\n\t\tdouble *restrict cummax_input = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tfor (unsigned index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tcummax_input[index] = (NO_OF_ARRAY_ELEMENTS - index ) * (double)PVALUES[o[index]];\n//\t\t\tprintf(\"cummax_input[%zu] = %e\\n\", index, cummax_input[index]);\n\t\t}\n\t\tfree(o); o = NULL;\n\t\tunsigned int *restrict ro = order(o2double, NO_OF_ARRAY_ELEMENTS, false);\n\t\tfree(o2double); o2double = NULL;\n\n\t\tdouble *restrict cummax_output = cummax(cummax_input, NO_OF_ARRAY_ELEMENTS);\n\t\tfree(cummax_input); cummax_input = NULL;\n\n\t\tdouble *restrict pmin = pminx(cummax_output, NO_OF_ARRAY_ELEMENTS, 1);\n\t\tfree(cummax_output); cummax_output = NULL;\n\t\tdouble *restrict qvalues = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tqvalues[index] = pmin[ro[index]];\n\t\t}\n\t\tfree(pmin); pmin = NULL;\n\t\tfree(ro); ro = NULL;\n\t\treturn qvalues;\n//---------------------------------------------------------------------------\n//---------------------------------------------------------------------------\n\t} else if (TYPE == 5) {//Hommel method\n//i <- seq_len(n)\n//o <- order(p)\n\t\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, false);//false is R's default\n//p <- p[o]\n\t\tdouble *restrict p = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tif (p == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tp[index] = PVALUES[o[index]];\n\t\t}\n//ro <- order(o)\n\t\tdouble *restrict o2double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\n\t\tfree(o); o = NULL;\n\t\tunsigned int *restrict ro = order(o2double, NO_OF_ARRAY_ELEMENTS, false);\n\t\tfree(o2double); o2double = NULL;\n//\t\tputs(\"ro\");\n//q <- pa <- rep.int(min(n * p/i), n)\n\t\tdouble *restrict q = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tif (q == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdouble *restrict pa = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\t\tif (pa == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t\tdouble min = (double)NO_OF_ARRAY_ELEMENTS * p[0];\n\t\tfor (unsigned index = 1; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tconst double TEMP = (double)NO_OF_ARRAY_ELEMENTS * p[index] / (double)(1+index);\n\t\t\tif (TEMP < min) {\n\t\t\t\tmin = TEMP;\n\t\t\t}\n\t\t}\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tpa[index] = min;\n\t\t\t q[index] = min;\n\t\t}\n//\t\tputs(\"q & pa\");\n//\t\tdouble_say(q, NO_OF_ARRAY_ELEMENTS);\n/*for (j in (n - 1):2) {\n ij <- seq_len(n - j + 1)\n i2 <- (n - j + 2):n\n q1 <- min(j * p[i2]/(2:j))\n q[ij] <- pmin(j * p[ij], q1)\n q[i2] <- q[n - j + 1]\n pa <- pmax(pa, q)\n }\n*/\n\t\tfor (unsigned j = (NO_OF_ARRAY_ELEMENTS-1); j >= 2; j--) {\n//\t\t\tprintf(\"j = %zu\\n\", j);\n\t\t\tunsigned int *restrict ij = seq_len(0,NO_OF_ARRAY_ELEMENTS - j);\n\t\t\tconst size_t I2_LENGTH = j - 1;\n\t\t\tunsigned int *restrict i2 = malloc(I2_LENGTH * sizeof(unsigned int));\n\t\t\tfor (unsigned i = 0; i < I2_LENGTH; i++) {\n\t\t\t\ti2[i] = NO_OF_ARRAY_ELEMENTS-j+2+i-1;\n//R's indices are 1-based, C's are 0-based, I added the -1\n\t\t\t}\n\n\t\t\tdouble q1 = (double)j * p[i2[0]] / 2.0;\n\t\t\tfor (unsigned int i = 1; i < I2_LENGTH; i++) {//loop through 2:j\n\t\t\t\tconst double TEMP_Q1 = (double)j * p[i2[i]] / (double)(2 + i);\n\t\t\t\tif (TEMP_Q1 < q1) {\n\t\t\t\t\tq1 = TEMP_Q1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (unsigned int i = 0; i < (NO_OF_ARRAY_ELEMENTS - j + 1); i++) {//q[ij] <- pmin(j * p[ij], q1)\n\t\t\t\tq[ij[i]] = min2( (double)j*p[ij[i]], q1);\n\t\t\t}\n\t\t\tfree(ij); ij = NULL;\n\n\t\t\tfor (unsigned int i = 0; i < I2_LENGTH; i++) {//q[i2] <- q[n - j + 1]\n\t\t\t\tq[i2[i]] = q[NO_OF_ARRAY_ELEMENTS - j];//subtract 1 because of starting index difference\n\t\t\t}\n\t\t\tfree(i2); i2 = NULL;\n\n\t\t\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {//pa <- pmax(pa, q)\n\t\t\t\tif (pa[i] < q[i]) {\n\t\t\t\t\tpa[i] = q[i];\n\t\t\t\t}\n\t\t\t}\n//\t\t\tprintf(\"j = %zu, pa = \\n\", j);\n//\t\t\t\tdouble_say(pa, N);\n\t\t}//end j loop\n\t\tfree(p); p = NULL;\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tq[index] = pa[ro[index]];//Hommel q-values\n\t\t}\n//now free memory\n\t\tfree(ro); ro = NULL;\n\t\tfree(pa); pa = NULL;\n\t\treturn q;\n\t}\n//The methods are similarly computed and thus can be combined for clarity\n\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, true);\n\tif (o == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tdouble *restrict o_double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\n\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\tif ((PVALUES[index] < 0) || (PVALUES[index] > 1)) {\n\t\t\tprintf(\"array[%u] = %lf, which is outside the interval [0,1]\\n\", index, PVALUES[index]);\n\t\t\tprintf(\"died at %s line %u\\n\", __FILE__, __LINE__);\n\t\t\texit(EXIT_FAILURE);\n\t\t}\n\t}\n\n\tunsigned int *restrict ro = order(o_double, NO_OF_ARRAY_ELEMENTS, false);\n\tif (ro == NULL) {\n\t\t\tprintf(\"failed to malloc at %s line %u.\\n\", __FILE__, __LINE__);\n\t\t\tperror(\"\");\n\t\t\texit(EXIT_FAILURE);\n\t}\n\tfree(o_double); o_double = NULL;\n\tdouble *restrict cummin_input = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\n\tif (TYPE == 0) {//BH method\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tconst double NI = (double)NO_OF_ARRAY_ELEMENTS / (double)(NO_OF_ARRAY_ELEMENTS - index);// n/i simplified\n\t\t\tcummin_input[index] = NI * PVALUES[o[index]];//PVALUES[o[index]] is p[o]\n\t\t}\n\t} else if (TYPE == 1) {//BY method\n\t\tdouble q = 1.0;\n\t\tfor (unsigned int index = 2; index < (1+NO_OF_ARRAY_ELEMENTS); index++) {\n\t\t\tq += 1.0/(double)index;\n\t\t}\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\t\tconst double NI = (double)NO_OF_ARRAY_ELEMENTS / (double)(NO_OF_ARRAY_ELEMENTS - index);// n/i simplified\n\t\t\tcummin_input[index] = q * NI * PVALUES[o[index]];//PVALUES[o[index]] is p[o]\n\t\t}\n\t} else if (TYPE == 3) {//Hochberg method\n\t\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n// pmin(1, cummin((n - i + 1L) * p[o]))[ro]\n\t\t\tcummin_input[index] = (double)(index + 1) * PVALUES[o[index]];\n\t\t}\n\t}\n\tfree(o); o = NULL;\n\tdouble *restrict cummin_array = NULL;\n\tcummin_array = cummin(cummin_input, NO_OF_ARRAY_ELEMENTS);\n\tfree(cummin_input); cummin_input = NULL;//I don't need this anymore\n\tdouble *restrict pmin = pminx(cummin_array, NO_OF_ARRAY_ELEMENTS, 1);\n\tfree(cummin_array); cummin_array = NULL;\n\tdouble *restrict q_array = malloc(NO_OF_ARRAY_ELEMENTS*sizeof(double));\n\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\n\t\tq_array[index] = pmin[ro[index]];\n\t}\n\n\tfree(ro); ro = NULL;\n\tfree(pmin); pmin = NULL;\n\treturn q_array;\n}\n\n\nint main(void) {\n\tconst double PVALUES[] = {4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03};//just the pvalues\n\tconst double CORRECT_ANSWERS[6][50] = {//each first index is type\n\t{6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02},//Benjamini-Hochberg\n\t{1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02},//Benjamini & Yekutieli\n\t{1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01},//Bonferroni\n{9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01},//Hochberg\n\t{1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01},//Holm\n{ 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01}//Hommel\n\t};\n//the following loop checks each type with R's answers\n\tconst char *restrict TYPES[] = {\"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\"};\n\tfor (unsigned short int type = 0; type <= 5; type++) {\n\t\tdouble *restrict q = p_adjust(PVALUES, sizeof(PVALUES) / sizeof(*PVALUES), TYPES[type]);\n\t\tdouble error = fabs(q[0] - CORRECT_ANSWERS[type][0]);\n//\t\tprintf(\"%e\t-\t%e\t=\t%g\\n\", q[0], CORRECT_ANSWERS[type][0], error);\n\t//\tputs(\"p\tq\");\n\t//\tprintf(\"%g\\t%g\\n\", pvalues[0], q[0]);\n\t\tfor (unsigned int i = 1; i < sizeof(PVALUES) / sizeof(*PVALUES); i++) {\n\t\t\tconst double this_error = fabs(q[i] - CORRECT_ANSWERS[type][i]);\n//\t\t\tprintf(\"%e\t-\t%e\t=\t%g\\n\", q[i], CORRECT_ANSWERS[type][i], error);\n\t\t\terror += this_error;\n\t\t}\n\t\tdouble_say(q, sizeof(PVALUES) / sizeof(*PVALUES));\n\t\tfree(q); q = NULL;\n\t\tprintf(\"\\ntype %u = '%s' has cumulative error of %g\\n\", type, TYPES[type], error);\n\t}\n\t\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\n#define SIZE 50\n#define each_i(start, end) for (i = start; i < end; ++i)\n\ntypedef enum { UP, DOWN } direction;\n\ntypedef struct { int index; double value; } iv1;\n\ntypedef struct { int index; int value; } iv2;\n\n/* test also for 'Unknown' correction type */\nconst char *types[8] = {\n \"Benjamini-Hochberg\", \"Benjamini-Yekutieli\", \"Bonferroni\", \"Hochberg\",\n \"Holm\", \"Hommel\", \"Šidák\", \"Unknown\"\n};\n\nint compare_iv1(const void *a, const void *b) {\n double aa = ((iv1 *)a) -> value;\n double bb = ((iv1 *)b) -> value;\n if (aa > bb) return 1;\n if (aa < bb) return -1;\n return 0;\n}\n\nint compare_iv1_desc(const void *a, const void *b) {\n return -compare_iv1(a, b);\n}\n\nint compare_iv2(const void *a, const void *b) {\n return ((iv2 *)a) -> value - ((iv2 *)b) -> value;\n}\n\nvoid ratchet(double *pa, direction dir) {\n int i;\n double m = pa[0];\n if (dir == UP) {\n each_i(1, SIZE) {\n if (pa[i] > m) pa[i] = m;\n m = pa[i];\n }\n }\n else {\n each_i(1, SIZE) {\n if (pa[i] < m) pa[i] = m;\n m = pa[i];\n }\n }\n each_i(0, SIZE) if (pa[i] > 1.0) pa[i] = 1.0;\n}\n\nvoid schwartzian(const double *p, double *pa, direction dir) {\n int i;\n int order[SIZE];\n int order2[SIZE];\n iv1 iv1s[SIZE];\n iv2 iv2s[SIZE];\n double pa2[SIZE];\n each_i(0, SIZE) { iv1s[i].index = i; iv1s[i].value = p[i]; }\n if (dir == UP)\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1_desc);\n else\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1);\n each_i(0, SIZE) order[i] = iv1s[i].index;\n each_i(0, SIZE) pa[i] *= p[order[i]];\n ratchet(pa, dir);\n each_i(0, SIZE) { iv2s[i].index = i; iv2s[i].value = order[i]; }\n qsort(iv2s, SIZE, sizeof(iv2s[0]), compare_iv2);\n each_i(0, SIZE) order2[i] = iv2s[i].index;\n each_i(0, SIZE) pa2[i] = pa[order2[i]];\n each_i(0, SIZE) pa[i] = pa2[i];\n}\n\nvoid adjust(const double *p, double *pa, const char *type) {\n int i;\n if (!strcmp(type, \"Benjamini-Hochberg\")) {\n each_i(0, SIZE) pa[i] = (double)SIZE / (SIZE - i);\n schwartzian(p, pa, UP);\n }\n else if (!strcmp(type, \"Benjamini-Yekutieli\")) {\n double q = 0.0;\n each_i(1, SIZE + 1) q += 1.0 / i;\n each_i(0, SIZE) pa[i] = q * SIZE / (SIZE - i);\n schwartzian(p, pa, UP);\n }\n else if (!strcmp(type, \"Bonferroni\")) {\n each_i(0, SIZE) pa[i] = (p[i] * SIZE > 1.0) ? 1.0 : p[i] * SIZE;\n }\n else if (!strcmp(type, \"Hochberg\")) {\n each_i(0, SIZE) pa[i] = i + 1.0;\n schwartzian(p, pa, UP);\n }\n else if (!strcmp(type, \"Holm\")) {\n each_i(0, SIZE) pa[i] = SIZE - i;\n schwartzian(p, pa, DOWN);\n }\n else if (!strcmp(type, \"Hommel\")) {\n int i, j;\n int order[SIZE];\n int order2[SIZE];\n iv1 iv1s[SIZE];\n iv2 iv2s[SIZE];\n double s[SIZE];\n double q[SIZE];\n double pa2[SIZE];\n int indices[SIZE];\n each_i(0, SIZE) { iv1s[i].index = i; iv1s[i].value = p[i]; }\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1);\n each_i(0, SIZE) order[i] = iv1s[i].index;\n each_i(0, SIZE) s[i] = p[order[i]];\n double min = s[0] * SIZE;\n each_i(1, SIZE) {\n double temp = s[i] / (i + 1.0);\n if (temp < min) min = temp;\n }\n each_i(0, SIZE) q[i] = min;\n each_i(0, SIZE) pa2[i] = min;\n for (j = SIZE - 1; j >= 2; --j) {\n each_i(0, SIZE) indices[i] = i;\n int upper_start = SIZE - j + 1; /* upper indices start index */\n int upper_size = j - 1; /* size of upper indices */\n int lower_size = SIZE - upper_size; /* size of lower indices */\n double qmin = j * s[indices[upper_start]] / 2.0;\n each_i(1, upper_size) {\n double temp = s[indices[upper_start + i]] * j / (2.0 + i);\n if (temp < qmin) qmin = temp;\n }\n each_i(0, lower_size) {\n double temp = s[indices[i]] * j;\n q[indices[i]] = (temp < qmin) ? temp : qmin;\n }\n each_i(0, upper_size) q[indices[upper_start + i]] = q[SIZE - j];\n each_i(0, SIZE) if (pa2[i] < q[i]) pa2[i] = q[i];\n }\n each_i(0, SIZE) { iv2s[i].index = i; iv2s[i].value = order[i]; }\n qsort(iv2s, SIZE, sizeof(iv2s[0]), compare_iv2);\n each_i(0, SIZE) order2[i] = iv2s[i].index;\n each_i(0, SIZE) pa[i] = pa2[order2[i]];\n }\n else if (!strcmp(type, \"Šidák\")) {\n each_i(0, SIZE) pa[i] = 1.0 - pow(1.0 - p[i], SIZE);\n }\n else {\n printf(\"\\nSorry, do not know how to do '%s' correction.\\n\", type);\n printf(\"Perhaps you want one of these?:\\n\");\n each_i(0, 7) printf(\" %s\\n\", types[i]);\n exit(1);\n }\n}\n\nvoid adjusted(const double *p, const char *type) {\n int i;\n double pa[SIZE] = { 0.0 };\n if (check(p)) {\n adjust(p, pa, type);\n printf(\"\\n%s\", type);\n each_i(0, SIZE) {\n if (!(i % 5)) printf(\"\\n[%2d] \", i);\n printf(\"%1.10f \", pa[i]);\n }\n printf(\"\\n\");\n }\n else {\n printf(\"p-values must be in range 0.0 to 1.0\\n\");\n exit(1);\n }\n}\n\nint check(const double* p) {\n int i;\n each_i(0, SIZE) {\n if (p[i] < 0.0 || p[i] > 1.0) return 0;\n }\n return 1;\n}\n\nint main() {\n int i;\n double p_values[SIZE] = {\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n };\n each_i(0, 8) adjusted(p_values, types[i]);\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <numeric>\n#include <vector>\n\nstd::vector<int> seqLen(int start, int end) {\n std::vector<int> result;\n\n if (start == end) {\n result.resize(end + 1);\n std::iota(result.begin(), result.end(), 1);\n } else if (start < end) {\n result.resize(end - start + 1);\n std::iota(result.begin(), result.end(), start);\n } else {\n result.resize(start - end + 1);\n std::iota(result.rbegin(), result.rend(), end);\n }\n\n return result;\n}\n\nstd::vector<int> order(const std::vector<double>& arr, bool decreasing) {\n std::vector<int> idx(arr.size());\n std::iota(idx.begin(), idx.end(), 0);\n\n std::function<bool(int, int)> cmp;\n if (decreasing) {\n cmp = [&arr](int a, int b) { return arr[b] < arr[a]; };\n } else {\n cmp = [&arr](int a, int b) { return arr[a] < arr[b]; };\n }\n\n std::sort(idx.begin(), idx.end(), cmp);\n return idx;\n}\n\nstd::vector<double> cummin(const std::vector<double>& arr) {\n if (arr.empty()) throw std::runtime_error(\"cummin requries at least one element\");\n std::vector<double> output(arr.size());\n double cumulativeMin = arr[0];\n std::transform(arr.cbegin(), arr.cend(), output.begin(), [&cumulativeMin](double a) {\n if (a < cumulativeMin) cumulativeMin = a;\n return cumulativeMin;\n });\n return output;\n}\n\nstd::vector<double> cummax(const std::vector<double>& arr) {\n if (arr.empty()) throw std::runtime_error(\"cummax requries at least one element\");\n std::vector<double> output(arr.size());\n double cumulativeMax = arr[0];\n std::transform(arr.cbegin(), arr.cend(), output.begin(), [&cumulativeMax](double a) {\n if (cumulativeMax < a) cumulativeMax = a;\n return cumulativeMax;\n });\n return output;\n}\n\nstd::vector<double> pminx(const std::vector<double>& arr, double x) {\n if (arr.empty()) throw std::runtime_error(\"pmin requries at least one element\");\n std::vector<double> result(arr.size());\n std::transform(arr.cbegin(), arr.cend(), result.begin(), [&x](double a) {\n if (a < x) return a;\n return x;\n });\n return result;\n}\n\nvoid doubleSay(const std::vector<double>& arr) {\n printf(\"[ 1] %.10f\", arr[0]);\n for (size_t i = 1; i < arr.size(); ++i) {\n printf(\" %.10f\", arr[i]);\n if ((i + 1) % 5 == 0) printf(\"\\n[%2d]\", i + 1);\n }\n}\n\nstd::vector<double> pAdjust(const std::vector<double>& pvalues, const std::string& str) {\n if (pvalues.empty()) throw std::runtime_error(\"pAdjust requires at least one element\");\n size_t size = pvalues.size();\n\n int type;\n if (\"bh\" == str || \"fdr\" == str) {\n type = 0;\n } else if (\"by\" == str) {\n type = 1;\n } else if (\"bonferroni\" == str) {\n type = 2;\n } else if (\"hochberg\" == str) {\n type = 3;\n } else if (\"holm\" == str) {\n type = 4;\n } else if (\"hommel\" == str) {\n type = 5;\n } else {\n throw std::runtime_error(str + \" doesn't match any accepted FDR types\");\n }\n\n // Bonferroni method\n if (2 == type) {\n std::vector<double> result(size);\n for (size_t i = 0; i < size; ++i) {\n double b = pvalues[i] * size;\n if (b >= 1) {\n result[i] = 1;\n } else if (0 <= b && b < 1) {\n result[i] = b;\n } else {\n throw std::runtime_error(\"a value is outside [0, 1)\");\n }\n }\n return result;\n }\n // Holm method\n else if (4 == type) {\n auto o = order(pvalues, false);\n std::vector<double> o2Double(o.begin(), o.end());\n std::vector<double> cummaxInput(size);\n for (size_t i = 0; i < size; ++i) {\n cummaxInput[i] = (size - i) * pvalues[o[i]];\n }\n auto ro = order(o2Double, false);\n auto cummaxOutput = cummax(cummaxInput);\n auto pmin = pminx(cummaxOutput, 1.0);\n std::vector<double> result(size);\n std::transform(ro.cbegin(), ro.cend(), result.begin(), [&pmin](int a) { return pmin[a]; });\n return result;\n }\n // Hommel\n else if (5 == type) {\n auto indices = seqLen(size, size);\n auto o = order(pvalues, false);\n std::vector<double> p(size);\n std::transform(o.cbegin(), o.cend(), p.begin(), [&pvalues](int a) { return pvalues[a]; });\n std::vector<double> o2Double(o.begin(), o.end());\n auto ro = order(o2Double, false);\n std::vector<double> q(size);\n std::vector<double> pa(size);\n std::vector<double> npi(size);\n for (size_t i = 0; i < size; ++i) {\n npi[i] = p[i] * size / indices[i];\n }\n double min = *std::min_element(npi.begin(), npi.end());\n std::fill(q.begin(), q.end(), min);\n std::fill(pa.begin(), pa.end(), min);\n for (int j = size; j >= 2; --j) {\n auto ij = seqLen(1, size - j + 1);\n std::transform(ij.cbegin(), ij.cend(), ij.begin(), [](int a) { return a - 1; });\n int i2Length = j - 1;\n std::vector<int> i2(i2Length);\n for (int i = 0; i < i2Length; ++i) {\n i2[i] = size - j + 2 + i - 1;\n }\n double q1 = j * p[i2[0]] / 2.0;\n for (int i = 1; i < i2Length; ++i) {\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\n if (temp_q1 < q1) q1 = temp_q1;\n }\n for (size_t i = 0; i < size - j + 1; ++i) {\n q[ij[i]] = std::min(p[ij[i]] * j, q1);\n }\n for (int i = 0; i < i2Length; ++i) {\n q[i2[i]] = q[size - j];\n }\n for (size_t i = 0; i < size; ++i) {\n if (pa[i] < q[i]) {\n pa[i] = q[i];\n }\n }\n }\n std::transform(ro.cbegin(), ro.cend(), q.begin(), [&pa](int a) { return pa[a]; });\n return q;\n }\n\n std::vector<double> ni(size);\n std::vector<int> o = order(pvalues, true);\n std::vector<double> od(o.begin(), o.end());\n for (size_t i = 0; i < size; ++i) {\n if (pvalues[i] < 0 || pvalues[i]>1) {\n throw std::runtime_error(\"a value is outside [0, 1]\");\n }\n ni[i] = (double)size / (size - i);\n }\n auto ro = order(od, false);\n std::vector<double> cumminInput(size);\n if (0 == type) { // BH method\n for (size_t i = 0; i < size; ++i) {\n cumminInput[i] = ni[i] * pvalues[o[i]];\n }\n } else if (1 == type) { // BY method\n double q = 0;\n for (size_t i = 1; i < size + 1; ++i) {\n q += 1.0 / i;\n }\n for (size_t i = 0; i < size; ++i) {\n cumminInput[i] = q * ni[i] * pvalues[o[i]];\n }\n } else if (3 == type) { // Hochberg method\n for (size_t i = 0; i < size; ++i) {\n cumminInput[i] = (i + 1) * pvalues[o[i]];\n }\n }\n auto cumminArray = cummin(cumminInput);\n auto pmin = pminx(cumminArray, 1.0);\n std::vector<double> result(size);\n for (size_t i = 0; i < size; ++i) {\n result[i] = pmin[ro[i]];\n }\n return result;\n}\n\nint main() {\n using namespace std;\n\n vector<double> pvalues{\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n };\n\n vector<vector<double>> correctAnswers{\n // Benjamini-Hochberg\n {\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\n },\n // Benjamini & Yekutieli\n {\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\n },\n // Bonferroni\n {\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\n },\n // Hochberg\n {\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n // Holm\n {\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n // Hommel\n {\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\n }\n };\n\n vector<string> types{ \"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\" };\n for (size_t type = 0; type < types.size(); ++type) {\n auto q = pAdjust(pvalues, types[type]);\n double error = 0.0;\n for (size_t i = 0; i < pvalues.size(); ++i) {\n error += abs(q[i] - correctAnswers[type][i]);\n }\n doubleSay(q);\n printf(\"\\ntype = %d = '%s' has a cumulative error of %g\\n\\n\\n\", type, types[type].c_str(), error);\n }\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace PValueCorrection {\n class Program {\n static List<int> SeqLen(int start, int end) {\n var result = new List<int>();\n if (start == end) {\n for (int i = 0; i < end + 1; ++i) {\n result.Add(i + 1);\n }\n } else if (start < end) {\n for (int i = 0; i < end - start + 1; ++i) {\n result.Add(start + i);\n }\n } else {\n for (int i = 0; i < start - end + 1; ++i) {\n result.Add(start - i);\n }\n }\n return result;\n }\n\n static List<int> Order(List<double> array, bool decreasing) {\n List<int> idx = new List<int>();\n for (int i = 0; i < array.Count; ++i) {\n idx.Add(i);\n }\n\n IComparer<int> cmp;\n if (decreasing) {\n cmp = Comparer<int>.Create((a, b) => array[a] < array[b] ? 1 : array[b] < array[a] ? -1 : 0);\n } else {\n cmp = Comparer<int>.Create((a, b) => array[b] < array[a] ? 1 : array[a] < array[b] ? -1 : 0);\n }\n\n idx.Sort(cmp);\n return idx;\n }\n\n static List<double> Cummin(List<double> array) {\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\"cummin requires at least one element\");\n var output = new List<double>();\n double cumulativeMin = array[0];\n for (int i = 0; i < array.Count; ++i) {\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\n output.Add(cumulativeMin);\n }\n return output;\n }\n\n static List<double> Cummax(List<double> array) {\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\"cummax requires at least one element\");\n var output = new List<double>();\n double cumulativeMax = array[0];\n for (int i = 0; i < array.Count; ++i) {\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\n output.Add(cumulativeMax);\n }\n return output;\n }\n\n static List<double> Pminx(List<double> array, double x) {\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\"pmin requires at least one element\");\n var result = new List<double>();\n for (int i = 0; i < array.Count; ++i) {\n if (array[i] < x) {\n result.Add(array[i]);\n } else {\n result.Add(x);\n }\n }\n return result;\n }\n\n static void Say(List<double> array) {\n Console.Write(\"[ 1] {0:E}\", array[0]);\n for (int i = 1; i < array.Count; ++i) {\n Console.Write(\" {0:E}\", array[i]);\n if ((i + 1) % 5 == 0) Console.Write(\"\\n[{0,2}]\", i + 1);\n }\n Console.WriteLine();\n }\n\n static List<double> PAdjust(List<double> pvalues, string str) {\n var size = pvalues.Count;\n if (size < 1) throw new ArgumentOutOfRangeException(\"pAdjust requires at least one element\");\n\n int type;\n switch (str.ToLower()) {\n case \"bh\":\n case \"fdr\":\n type = 0;\n break;\n case \"by\":\n type = 1;\n break;\n case \"bonferroni\":\n type = 2;\n break;\n case \"hochberg\":\n type = 3;\n break;\n case \"holm\":\n type = 4;\n break;\n case \"hommel\":\n type = 5;\n break;\n default:\n throw new ArgumentException(str + \" doesn't match any accepted FDR types\");\n }\n\n if (2 == type) { // Bonferroni method\n var result2 = new List<double>();\n for (int i = 0; i < size; ++i) {\n double b = pvalues[i] * size;\n if (b >= 1) {\n result2.Add(1);\n } else if (0 <= b && b < 1) {\n result2.Add(b);\n } else {\n throw new Exception(b + \" is outside [0, 1)\");\n }\n }\n return result2;\n } else if (4 == type) { // Holm method\n var o4 = Order(pvalues, false);\n var o4d = o4.ConvertAll(x => (double)x);\n var cummaxInput = new List<double>();\n for (int i = 0; i < size; ++i) {\n cummaxInput.Add((size - i) * pvalues[o4[i]]);\n }\n var ro4 = Order(o4d, false);\n var cummaxOutput = Cummax(cummaxInput);\n var pmin4 = Pminx(cummaxOutput, 1.0);\n var hr = new List<double>();\n for (int i = 0; i < size; ++i) {\n hr.Add(pmin4[ro4[i]]);\n }\n return hr;\n } else if (5 == type) { // Hommel method\n var indices = SeqLen(size, size);\n var o5 = Order(pvalues, false);\n var p = new List<double>();\n for (int i = 0; i < size; ++i) {\n p.Add(pvalues[o5[i]]);\n }\n var o5d = o5.ConvertAll(x => (double)x);\n var ro5 = Order(o5d, false);\n var q = new List<double>();\n var pa = new List<double>();\n var npi = new List<double>();\n for (int i = 0; i < size; ++i) {\n npi.Add(p[i] * size / indices[i]);\n }\n double min = npi.Min();\n q.AddRange(Enumerable.Repeat(min, size));\n pa.AddRange(Enumerable.Repeat(min, size));\n for (int j = size; j >= 2; --j) {\n var ij = SeqLen(1, size - j + 1);\n for (int i = 0; i < size - j + 1; ++i) {\n ij[i]--;\n }\n int i2Length = j - 1;\n var i2 = new List<int>();\n for (int i = 0; i < i2Length; ++i) {\n i2.Add(size - j + 2 + i - 1);\n }\n double q1 = j * p[i2[0]] / 2.0;\n for (int i = 1; i < i2Length; ++i) {\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\n if (temp_q1 < q1) q1 = temp_q1;\n }\n for (int i = 0; i < size - j + 1; ++i) {\n q[ij[i]] = Math.Min(p[ij[i]] * j, q1);\n }\n for (int i = 0; i < i2Length; ++i) {\n q[i2[i]] = q[size - j];\n }\n for (int i = 0; i < size; ++i) {\n if (pa[i] < q[i]) {\n pa[i] = q[i];\n }\n }\n }\n for (int i = 0; i < size; ++i) {\n q[i] = pa[ro5[i]];\n }\n return q;\n }\n\n var ni = new List<double>();\n var o = Order(pvalues, true);\n var od = o.ConvertAll(x => (double)x);\n for (int i = 0; i < size; ++i) {\n if (pvalues[i] < 0 || pvalues[i] > 1) {\n throw new Exception(\"array[\" + i + \"] = \" + pvalues[i] + \" is outside [0, 1]\");\n }\n ni.Add((double)size / (size - i));\n }\n var ro = Order(od, false);\n var cumminInput = new List<double>();\n if (0 == type) { // BH method\n for (int i = 0; i < size; ++i) {\n cumminInput.Add(ni[i] * pvalues[o[i]]);\n }\n } else if (1 == type) { // BY method\n double q = 0;\n for (int i = 1; i < size + 1; ++i) {\n q += 1.0 / i;\n }\n for (int i = 0; i < size; ++i) {\n cumminInput.Add(q * ni[i] * pvalues[o[i]]);\n }\n } else if (3 == type) { // Hochberg method\n for (int i = 0; i < size; ++i) {\n cumminInput.Add((i + 1) * pvalues[o[i]]);\n }\n }\n var cumminArray = Cummin(cumminInput);\n var pmin = Pminx(cumminArray, 1.0);\n var result = new List<double>();\n for (int i = 0; i < size; ++i) {\n result.Add(pmin[ro[i]]);\n }\n return result;\n }\n\n static void Main(string[] args) {\n var pvalues = new List<double> {\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n };\n var correctAnswers = new List<List<double>> {\n new List<double> { // Benjamini-Hochberg\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\n },\n new List<double> { // Benjamini & Yekutieli\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\n },\n new List<double> { // Bonferroni\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\n },\n new List<double> { // Hochberg\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n new List<double> { // Holm\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n new List<double> { // Hommel\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\n }\n };\n\n string[] types = { \"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\" };\n for (int type = 0; type < types.Length; ++type) {\n var q = PAdjust(pvalues, types[type]);\n double error = 0.0;\n for (int i = 0; i < pvalues.Count; ++i) {\n error += Math.Abs(q[i] - correctAnswers[type][i]);\n }\n Say(q);\n Console.WriteLine(\"type {0} = '{1}' has a cumulative error of {2:E}\", type, types[type], error);\n Console.WriteLine();\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.algorithm;\nimport std.conv;\nimport std.math;\nimport std.stdio;\nimport std.string;\n\nint[] seqLen(int start, int end) {\n int[] result;\n if (start == end) {\n result.length = end+1;\n for (int i; i<result.length; i++) {\n result[i] = i+1;\n }\n } else if (start < end) {\n result.length = end - start + 1;\n for (int i; i<result.length; i++) {\n result[i] = start+i;\n }\n } else {\n result.length = start - end + 1;\n for (int i; i<result.length; i++) {\n result[i] = start-i;\n }\n }\n return result;\n}\n\nint[] order(double[] array, bool decreasing) {\n int size = array.length;\n int[] idx;\n idx.length = size;\n double[] baseArr;\n baseArr.length = size;\n for (int i; i<size; i++) {\n baseArr[i] = array[i];\n idx[i] = i;\n }\n if (!decreasing) {\n alias comp = (a,b) => baseArr[a] < baseArr[b];\n idx.sort!comp;\n } else {\n alias comp = (a,b) => baseArr[b] < baseArr[a];\n idx.sort!comp;\n }\n return idx;\n}\n\ndouble[] cummin(double[] array) {\n int size = array.length;\n if (size < 1) throw new Exception(\"cummin requires at least one element\");\n double[] output;\n output.length = size;\n auto cumulativeMin = array[0];\n foreach (i; 0..size) {\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\n output[i] = cumulativeMin;\n }\n return output;\n}\n\ndouble[] cummax(double[] array) {\n auto size = array.length;\n if (size < 1) throw new Exception(\"cummax requires at least one element\");\n double[] output;\n output.length = size;\n auto cumulativeMax = array[0];\n foreach (i; 0..size) {\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\n output[i] = cumulativeMax;\n }\n return output;\n}\n\ndouble[] pminx(double[] array, double x) {\n auto size = array.length;\n if (size < 1) throw new Exception(\"pmin requires at least one element\");\n double[] result;\n result.length = size;\n foreach (i; 0..size) {\n if (array[i] < x) {\n result[i] = array[i];\n } else {\n result[i] = x;\n }\n }\n return result;\n}\n\nvoid doubleSay(double[] array) {\n writef(\"[ 1] %e\", array[0]);\n foreach (i; 1..array.length) {\n writef(\" %.10f\", array[i]);\n if ((i+1) % 5 == 0) writef(\"\\n[%2d]\", i+1);\n }\n writeln;\n}\n\nauto toArray(T,U)(U[] array) {\n T[] result;\n result.length = array.length;\n foreach(i; 0..array.length) {\n result[i] = to!T(array[i]);\n }\n return result;\n}\n\ndouble[] pAdjust(double[] pvalues, string str) {\n auto size = pvalues.length;\n if (size < 1) throw new Exception(\"pAdjust requires at least one element\");\n int type = str.toLower.predSwitch!\"a==b\"(\n \"bh\", 0,\n \"fdr\", 0,\n \"by\", 1,\n \"bonferroni\", 2,\n \"hochberg\", 3,\n \"holm\", 4,\n \"hommel\", 5,\n { throw new Exception(text(\"'\",str,\"' doesn't match any accepted FDR types\")); }()\n );\n if (type == 2) { // Bonferroni method\n double[] result;\n result.length = size;\n foreach (i; 0..size) {\n auto b = pvalues[i] * size;\n if (b >= 1) {\n result[i] = 1;\n } else if (0 <= b && b < 1) {\n result[i] = b;\n } else {\n throw new Exception(text(b,\" is outside [0, 1)\"));\n }\n }\n return result;\n } else if (type == 4) { // Holm method\n auto o = order(pvalues, false);\n auto o2Double = toArray!(double,int)(o);\n double[] cummaxInput;\n cummaxInput.length = size;\n foreach (i; 0..size) {\n cummaxInput[i] = (size-i) * pvalues[o[i]];\n }\n auto ro = order(o2Double, false);\n auto cummaxOutput = cummax(cummaxInput);\n auto pmin = pminx(cummaxOutput, 1.0);\n double[] result;\n result.length = size;\n foreach (i; 0..size) {\n result[i] = pmin[ro[i]];\n }\n return result;\n } else if (type == 5) {\n auto indices = seqLen(size, size);\n auto o = order(pvalues, false);\n double[] p;\n p.length = size;\n foreach (i; 0..size) {\n p[i] = pvalues[o[i]];\n }\n auto o2Double = toArray!double(o);\n auto ro = order(o2Double, false);\n double[] q;\n q.length = size;\n double[] pa;\n pa.length = size;\n double[] npi;\n npi.length = size;\n foreach (i; 0..size) {\n npi[i] = p[i] * size / indices[i];\n }\n auto min_ = reduce!min(npi);\n q[] = min_;\n pa[] = min_;\n foreach_reverse (j; 2..size) {\n auto ij = seqLen(1, size - j + 1);\n foreach (i; 0..size-j+1) {\n ij[i]--;\n }\n auto i2Length = j-1;\n int[] i2;\n i2.length = i2Length;\n foreach(i; 0..i2Length) {\n i2[i] = size-j+2+i-1;\n }\n auto pi2Length = i2Length;\n double q1 = j*p[i2[0]] / 2.0;\n foreach (i; 1..pi2Length) {\n auto temp_q1 = p[i2[i]] * j / (2.0 + i);\n if (temp_q1 < q1) q1 = temp_q1;\n }\n foreach (i; 0..size-j+1) {\n q[ij[i]] = min(p[ij[i]] * j, q1);\n }\n foreach(i; 0..i2Length) {\n q[i2[i]] = q[size-j];\n }\n foreach(i; 0..size) if (pa[i] < q[i]) pa[i] = q[i];\n }\n foreach (index; 0..size) {\n q[index] = pa[ro[index]];\n }\n return q;\n }\n\n double[] ni;\n ni.length = size;\n auto o = order(pvalues, true);\n auto oDouble = toArray!double(o);\n foreach (index; 0..size) {\n if (pvalues[index] < 0 || pvalues[index] > 1) {\n throw new Exception(text(\"array[\", index, \"] = \", pvalues[index], \" is outside [0, 1]\"));\n }\n ni[index] = cast(double) size / (size - index);\n }\n auto ro = order(oDouble, false);\n double[] cumminInput;\n cumminInput.length = size;\n if (type == 0) { // BH method\n foreach (index; 0..size) {\n cumminInput[index] = ni[index] * pvalues[o[index]];\n }\n } else if (type == 1) { // BY method\n double q = 0;\n foreach (index; 1..size+1) q += 1.0 / index;\n foreach (index; 0..size) {\n cumminInput[index] = q * ni[index] * pvalues[o[index]];\n }\n } else if (type == 3) { // Hochberg method\n foreach (index; 0..size) {\n cumminInput[index] = (index + 1) * pvalues[o[index]];\n }\n }\n auto cumminArray =cummin(cumminInput);\n auto pmin = pminx(cumminArray, 1.0);\n double[] result;\n result.length = size;\n foreach (i; 0..size) {\n result[i] = pmin[ro[i]];\n }\n return result;\n}\n\nvoid main() {\n double[] pvalues = [\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n ];\n\n double[][] correctAnswers = [\n [ // Benjamini-Hochberg\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\n ],\n [ // Benjamini & Yekutieli\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\n ],\n [ // Bonferroni\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\n ],\n [ // Hochberg\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n ],\n [ // Holm\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n ],\n [ // Hommel\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\n ]\n ];\n auto types = [\"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\"];\n foreach (type; 0..types.length) {\n auto q = pAdjust(pvalues, types[type]);\n double error = 0.0;\n foreach (i; 0..pvalues.length) {\n error += abs(q[i] - correctAnswers[type][i]);\n }\n doubleSay(q);\n writefln(\"\\ntype %d = '%s' has a cumulative error of %g\", type, types[type], error);\n }\n}\n","language":"D"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n \"math\"\n \"os\"\n \"sort\"\n \"strconv\"\n \"strings\"\n)\n\ntype pvalues = []float64\n\ntype iv1 struct {\n index int\n value float64\n}\ntype iv2 struct{ index, value int }\n\ntype direction int\n\nconst (\n up direction = iota\n down\n)\n\n// Test also for 'Unknown' correction type.\nvar ctypes = []string{\n \"Benjamini-Hochberg\", \"Benjamini-Yekutieli\", \"Bonferroni\", \"Hochberg\",\n \"Holm\", \"Hommel\", \"Šidák\", \"Unknown\",\n}\n\nfunc minimum(p pvalues) float64 {\n m := p[0]\n for i := 1; i < len(p); i++ {\n if p[i] < m {\n m = p[i]\n }\n }\n return m\n}\n\nfunc maximum(p pvalues) float64 {\n m := p[0]\n for i := 1; i < len(p); i++ {\n if p[i] > m {\n m = p[i]\n }\n }\n return m\n}\n\nfunc adjusted(p pvalues, ctype string) (string, error) {\n err := check(p)\n if err != nil {\n return \"\", err\n }\n temp := pformat(adjust(p, ctype), 5)\n return fmt.Sprintf(\"\\n%s\\n%s\", ctype, temp), nil\n}\n\nfunc pformat(p pvalues, cols int) string {\n var lines []string\n for i := 0; i < len(p); i += cols {\n fchunk := p[i : i+cols]\n schunk := make([]string, cols)\n for j := 0; j < cols; j++ {\n schunk[j] = strconv.FormatFloat(fchunk[j], 'f', 10, 64)\n }\n lines = append(lines, fmt.Sprintf(\"[%2d] %s\", i, strings.Join(schunk, \" \")))\n }\n return strings.Join(lines, \"\\n\")\n}\n\nfunc check(p []float64) error {\n cond := len(p) > 0 && minimum(p) >= 0 && maximum(p) <= 1\n if !cond {\n return fmt.Errorf(\"p-values must be in range 0.0 to 1.0\")\n }\n return nil\n}\n\nfunc ratchet(p pvalues, dir direction) {\n size := len(p)\n m := p[0]\n if dir == up {\n for i := 1; i < size; i++ {\n if p[i] > m {\n p[i] = m\n }\n m = p[i]\n }\n } else {\n for i := 1; i < size; i++ {\n if p[i] < m {\n p[i] = m\n }\n m = p[i]\n }\n }\n for i := 0; i < size; i++ {\n if p[i] > 1.0 {\n p[i] = 1.0\n }\n }\n}\n\nfunc schwartzian(p pvalues, mult pvalues, dir direction) pvalues {\n size := len(p)\n order := make([]int, size)\n iv1s := make([]iv1, size)\n for i := 0; i < size; i++ {\n iv1s[i] = iv1{i, p[i]}\n }\n if dir == up {\n sort.Slice(iv1s, func(i, j int) bool {\n return iv1s[i].value > iv1s[j].value\n })\n } else {\n sort.Slice(iv1s, func(i, j int) bool {\n return iv1s[i].value < iv1s[j].value\n })\n }\n for i := 0; i < size; i++ {\n order[i] = iv1s[i].index\n }\n pa := make(pvalues, size)\n for i := 0; i < size; i++ {\n pa[i] = mult[i] * p[order[i]]\n }\n ratchet(pa, dir)\n order2 := make([]int, size)\n iv2s := make([]iv2, size)\n for i := 0; i < size; i++ {\n iv2s[i] = iv2{i, order[i]}\n }\n sort.Slice(iv2s, func(i, j int) bool {\n return iv2s[i].value < iv2s[j].value\n })\n for i := 0; i < size; i++ {\n order2[i] = iv2s[i].index\n }\n pa2 := make(pvalues, size)\n for i := 0; i < size; i++ {\n pa2[i] = pa[order2[i]]\n }\n return pa2\n}\n\nfunc adjust(p pvalues, ctype string) pvalues {\n size := len(p)\n if size == 0 {\n return p\n }\n fsize := float64(size)\n switch ctype {\n case \"Benjamini-Hochberg\":\n mult := make(pvalues, size)\n for i := 0; i < size; i++ {\n mult[i] = fsize / float64(size-i)\n }\n return schwartzian(p, mult, up)\n case \"Benjamini-Yekutieli\":\n q := 0.0\n for i := 1; i <= size; i++ {\n q += 1.0 / float64(i)\n }\n mult := make(pvalues, size)\n for i := 0; i < size; i++ {\n mult[i] = q * fsize / (fsize - float64(i))\n }\n return schwartzian(p, mult, up)\n case \"Bonferroni\":\n p2 := make(pvalues, size)\n for i := 0; i < size; i++ {\n p2[i] = math.Min(p[i]*fsize, 1.0)\n }\n return p2\n case \"Hochberg\":\n mult := make(pvalues, size)\n for i := 0; i < size; i++ {\n mult[i] = float64(i) + 1\n }\n return schwartzian(p, mult, up)\n case \"Holm\":\n mult := make(pvalues, size)\n for i := 0; i < size; i++ {\n mult[i] = fsize - float64(i)\n }\n return schwartzian(p, mult, down)\n case \"Hommel\":\n order := make([]int, size)\n iv1s := make([]iv1, size)\n for i := 0; i < size; i++ {\n iv1s[i] = iv1{i, p[i]}\n }\n sort.Slice(iv1s, func(i, j int) bool {\n return iv1s[i].value < iv1s[j].value\n })\n for i := 0; i < size; i++ {\n order[i] = iv1s[i].index\n }\n s := make(pvalues, size)\n for i := 0; i < size; i++ {\n s[i] = p[order[i]]\n }\n m := make(pvalues, size)\n for i := 0; i < size; i++ {\n m[i] = s[i] * fsize / (float64(i) + 1)\n }\n min := minimum(m)\n q := make(pvalues, size)\n for i := 0; i < size; i++ {\n q[i] = min\n }\n pa := make(pvalues, size)\n for i := 0; i < size; i++ {\n pa[i] = min\n }\n for j := size - 1; j >= 2; j-- {\n lower := make([]int, size-j+1) // lower indices\n for i := 0; i < len(lower); i++ {\n lower[i] = i\n }\n upper := make([]int, j-1) // upper indices\n for i := 0; i < len(upper); i++ {\n upper[i] = size - j + 1 + i\n }\n qmin := float64(j) * s[upper[0]] / 2.0\n for i := 1; i < len(upper); i++ {\n temp := s[upper[i]] * float64(j) / (2.0 + float64(i))\n if temp < qmin {\n qmin = temp\n }\n }\n for i := 0; i < len(lower); i++ {\n q[lower[i]] = math.Min(s[lower[i]]*float64(j), qmin)\n }\n for i := 0; i < len(upper); i++ {\n q[upper[i]] = q[size-j]\n }\n for i := 0; i < size; i++ {\n if pa[i] < q[i] {\n pa[i] = q[i]\n }\n }\n }\n order2 := make([]int, size)\n iv2s := make([]iv2, size)\n for i := 0; i < size; i++ {\n iv2s[i] = iv2{i, order[i]}\n }\n sort.Slice(iv2s, func(i, j int) bool {\n return iv2s[i].value < iv2s[j].value\n })\n for i := 0; i < size; i++ {\n order2[i] = iv2s[i].index\n }\n pa2 := make(pvalues, size)\n for i := 0; i < size; i++ {\n pa2[i] = pa[order2[i]]\n }\n return pa2\n case \"Šidák\":\n p2 := make(pvalues, size)\n for i := 0; i < size; i++ {\n p2[i] = 1.0 - math.Pow(1.0-float64(p[i]), fsize)\n }\n return p2\n default:\n fmt.Printf(\"\\nSorry, do not know how to do '%s' correction.\\n\", ctype)\n fmt.Println(\"Perhaps you want one of these?:\")\n temp := make([]string, len(ctypes)-1)\n for i := 0; i < len(temp); i++ {\n temp[i] = fmt.Sprintf(\" %s\", ctypes[i])\n }\n fmt.Println(strings.Join(temp, \"\\n\"))\n os.Exit(1)\n }\n return p\n}\n\nfunc main() {\n p := pvalues{\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03,\n }\n for _, ctype := range ctypes {\n s, err := adjusted(p, ctype)\n if err != nil {\n log.Fatal(err)\n }\n fmt.Println(s)\n }\n}\n","language":"Go"},{"code":"import java.util.Arrays;\nimport java.util.Comparator;\n\npublic class PValueCorrection {\n private static int[] seqLen(int start, int end) {\n int[] result;\n if (start == end) {\n result = new int[end + 1];\n for (int i = 0; i < result.length; ++i) {\n result[i] = i + 1;\n }\n } else if (start < end) {\n result = new int[end - start + 1];\n for (int i = 0; i < result.length; ++i) {\n result[i] = start + i;\n }\n } else {\n result = new int[start - end + 1];\n for (int i = 0; i < result.length; ++i) {\n result[i] = start - i;\n }\n }\n return result;\n }\n\n private static int[] order(double[] array, boolean decreasing) {\n int size = array.length;\n int[] idx = new int[size];\n double[] baseArr = new double[size];\n for (int i = 0; i < size; ++i) {\n baseArr[i] = array[i];\n idx[i] = i;\n }\n\n Comparator<Integer> cmp;\n if (!decreasing) {\n cmp = Comparator.comparingDouble(a -> baseArr[a]);\n } else {\n cmp = (a, b) -> Double.compare(baseArr[b], baseArr[a]);\n }\n\n return Arrays.stream(idx)\n .boxed()\n .sorted(cmp)\n .mapToInt(a -> a)\n .toArray();\n }\n\n private static double[] cummin(double[] array) {\n if (array.length < 1) throw new IllegalArgumentException(\"cummin requires at least one element\");\n double[] output = new double[array.length];\n double cumulativeMin = array[0];\n for (int i = 0; i < array.length; ++i) {\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\n output[i] = cumulativeMin;\n }\n return output;\n }\n\n private static double[] cummax(double[] array) {\n if (array.length < 1) throw new IllegalArgumentException(\"cummax requires at least one element\");\n double[] output = new double[array.length];\n double cumulativeMax = array[0];\n for (int i = 0; i < array.length; ++i) {\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\n output[i] = cumulativeMax;\n }\n return output;\n }\n\n private static double[] pminx(double[] array, double x) {\n if (array.length < 1) throw new IllegalArgumentException(\"pmin requires at least one element\");\n double[] result = new double[array.length];\n for (int i = 0; i < array.length; ++i) {\n if (array[i] < x) {\n result[i] = array[i];\n } else {\n result[i] = x;\n }\n }\n return result;\n }\n\n private static void doubleSay(double[] array) {\n System.out.printf(\"[ 1] %e\", array[0]);\n for (int i = 1; i < array.length; ++i) {\n System.out.printf(\" %.10f\", array[i]);\n if ((i + 1) % 5 == 0) System.out.printf(\"\\n[%2d]\", i + 1);\n }\n System.out.println();\n }\n\n private static double[] intToDouble(int[] array) {\n double[] result = new double[array.length];\n for (int i = 0; i < array.length; i++) {\n result[i] = array[i];\n }\n return result;\n }\n\n private static double doubleArrayMin(double[] array) {\n if (array.length < 1) throw new IllegalArgumentException(\"pAdjust requires at least one element\");\n return Arrays.stream(array).min().orElse(Double.NaN);\n }\n\n private static double[] pAdjust(double[] pvalues, String str) {\n int size = pvalues.length;\n if (size < 1) throw new IllegalArgumentException(\"pAdjust requires at least one element\");\n int type;\n switch (str.toLowerCase()) {\n case \"bh\":\n case \"fdr\":\n type = 0;\n break;\n case \"by\":\n type = 1;\n break;\n case \"bonferroni\":\n type = 2;\n break;\n case \"hochberg\":\n type = 3;\n break;\n case \"holm\":\n type = 4;\n break;\n case \"hommel\":\n type = 5;\n break;\n default:\n throw new IllegalArgumentException(str + \" doesn't match any accepted FDR types\");\n }\n\n if (type == 2) { // Bonferroni method\n double[] result = new double[size];\n for (int i = 0; i < size; ++i) {\n double b = pvalues[i] * size;\n if (b >= 1) {\n result[i] = 1;\n } else if (0 <= b && b < 1) {\n result[i] = b;\n } else {\n throw new RuntimeException(\"\" + b + \" is outside [0, 1)\");\n }\n }\n return result;\n } else if (type == 4) { // Holm method\n int[] o = order(pvalues, false);\n double[] o2Double = intToDouble(o);\n double[] cummaxInput = new double[size];\n for (int i = 0; i < size; ++i) {\n cummaxInput[i] = (size - i) * pvalues[o[i]];\n }\n int[] ro = order(o2Double, false);\n double[] cummaxOutput = cummax(cummaxInput);\n double[] pmin = pminx(cummaxOutput, 1.0);\n double[] result = new double[size];\n for (int i = 0; i < size; ++i) {\n result[i] = pmin[ro[i]];\n }\n return result;\n } else if (type == 5) {\n int[] indices = seqLen(size, size);\n int[] o = order(pvalues, false);\n double[] p = new double[size];\n for (int i = 0; i < size; ++i) {\n p[i] = pvalues[o[i]];\n }\n double[] o2Double = intToDouble(o);\n int[] ro = order(o2Double, false);\n double[] q = new double[size];\n double[] pa = new double[size];\n double[] npi = new double[size];\n for (int i = 0; i < size; ++i) {\n npi[i] = p[i] * size / indices[i];\n }\n double min = doubleArrayMin(npi);\n Arrays.fill(q, min);\n Arrays.fill(pa, min);\n for (int j = size; j >= 2; --j) {\n int[] ij = seqLen(1, size - j + 1);\n for (int i = 0; i < size - j + 1; ++i) {\n ij[i]--;\n }\n int i2Length = j - 1;\n int[] i2 = new int[i2Length];\n for (int i = 0; i < i2Length; ++i) {\n i2[i] = size - j + 2 + i - 1;\n }\n double q1 = j * p[i2[0]] / 2.0;\n for (int i = 1; i < i2Length; ++i) {\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\n if (temp_q1 < q1) q1 = temp_q1;\n }\n for (int i = 0; i < size - j + 1; ++i) {\n q[ij[i]] = Math.min(p[ij[i]] * j, q1);\n }\n for (int i = 0; i < i2Length; ++i) {\n q[i2[i]] = q[size - j];\n }\n for (int i = 0; i < size; ++i) {\n if (pa[i] < q[i]) {\n pa[i] = q[i];\n }\n }\n }\n for (int i = 0; i < size; ++i) {\n q[i] = pa[ro[i]];\n }\n return q;\n }\n\n double[] ni = new double[size];\n int[] o = order(pvalues, true);\n double[] oDouble = intToDouble(o);\n for (int i = 0; i < size; ++i) {\n if (pvalues[i] < 0 || pvalues[i] > 1) {\n throw new RuntimeException(\"array[\" + i + \"] = \" + pvalues[i] + \" is outside [0, 1]\");\n }\n ni[i] = (double) size / (size - i);\n }\n int[] ro = order(oDouble, false);\n double[] cumminInput = new double[size];\n if (type == 0) { // BH method\n for (int i = 0; i < size; ++i) {\n cumminInput[i] = ni[i] * pvalues[o[i]];\n }\n } else if (type == 1) { // BY method\n double q = 0;\n for (int i = 1; i < size + 1; ++i) {\n q += 1.0 / i;\n }\n for (int i = 0; i < size; ++i) {\n cumminInput[i] = q * ni[i] * pvalues[o[i]];\n }\n } else if (type == 3) { // Hochberg method\n for (int i = 0; i < size; ++i) {\n cumminInput[i] = (i + 1) * pvalues[o[i]];\n }\n }\n double[] cumminArray = cummin(cumminInput);\n double[] pmin = pminx(cumminArray, 1.0);\n double[] result = new double[size];\n for (int i = 0; i < size; ++i) {\n result[i] = pmin[ro[i]];\n }\n return result;\n }\n\n public static void main(String[] args) {\n double[] pvalues = new double[]{\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n };\n\n double[][] correctAnswers = new double[][]{\n new double[]{ // Benjamini-Hochberg\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\n },\n new double[]{ // Benjamini & Yekutieli\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\n },\n new double[]{ // Bonferroni\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\n },\n new double[]{ // Hochberg\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n new double[]{ // Holm\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n },\n new double[]{ // Hommel\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\n }\n };\n\n String[] types = new String[]{\"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\"};\n for (int type = 0; type < types.length; ++type) {\n double[] q = pAdjust(pvalues, types[type]);\n double error = 0.0;\n for (int i = 0; i < pvalues.length; ++i) {\n error += Math.abs(q[i] - correctAnswers[type][i]);\n }\n doubleSay(q);\n System.out.printf(\"\\ntype %d = '%s' has a cumulative error of %g\\n\", type, types[type], error);\n }\n }\n}\n","language":"Java"},{"code":"using MultipleTesting, IterTools, Printf\n\np = [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\n\nfunction printpvalues(v)\n for chunk in partition(v, 10)\n println(join((@sprintf(\"%4.7f\", p) for p in chunk), \", \"))\n end\nend\n\nprintln(\"Original p-values:\")\nprintpvalues(p)\nfor corr in (Bonferroni(), BenjaminiHochberg(), BenjaminiYekutieli(), Holm(), Hochberg(), Hommel())\n println(\"\\n\", corr)\n printpvalues(adjust(p, corr))\nend\n","language":"Julia"},{"code":"// version 1.1.51\n\nimport java.util.Arrays\n\ntypealias IAE = IllegalArgumentException\n\nfun seqLen(start: Int, end: Int) =\n when {\n start == end -> IntArray(end + 1) { it + 1 }\n start < end -> IntArray(end - start + 1) { start + it }\n else -> IntArray(start - end + 1) { start - it }\n }\n\nvar baseArr: DoubleArray? = null\n\nfun compareIncrease(a: Int, b: Int): Int = baseArr!![b].compareTo(baseArr!![a])\n\nfun compareDecrease(a: Int, b: Int): Int = baseArr!![a].compareTo(baseArr!![b])\n\nfun order(array: DoubleArray, decreasing: Boolean): IntArray {\n val size = array.size\n var idx = IntArray(size) { it }\n baseArr = array.copyOf()\n if (!decreasing) {\n idx = Arrays.stream(idx)\n .boxed()\n .sorted { a, b -> compareDecrease(a, b) }\n .mapToInt { it }\n .toArray()\n }\n else {\n idx = Arrays.stream(idx)\n .boxed()\n .sorted { a, b -> compareIncrease(a, b) }\n .mapToInt { it }\n .toArray()\n }\n baseArr = null\n return idx\n}\n\nfun cummin(array: DoubleArray): DoubleArray {\n val size = array.size\n if (size < 1) throw IAE(\"cummin requires at least one element\")\n val output = DoubleArray(size)\n var cumulativeMin = array[0]\n for (i in 0 until size) {\n if (array[i] < cumulativeMin) cumulativeMin = array[i]\n output[i] = cumulativeMin\n }\n return output\n}\n\nfun cummax(array: DoubleArray): DoubleArray {\n val size = array.size\n if (size < 1) throw IAE(\"cummax requires at least one element\")\n val output = DoubleArray(size)\n var cumulativeMax = array[0]\n for (i in 0 until size) {\n if (array[i] > cumulativeMax) cumulativeMax = array[i]\n output[i] = cumulativeMax\n }\n return output\n}\n\nfun pminx(array: DoubleArray, x: Double): DoubleArray {\n val size = array.size\n if (size < 1) throw IAE(\"pmin requires at least one element\")\n return DoubleArray(size) { if (array[it] < x) array[it] else x }\n}\n\nfun doubleSay(array: DoubleArray) {\n print(\"[ 1] %e\".format(array[0]))\n for (i in 1 until array.size) {\n print(\" %.10f\".format(array[i]))\n if ((i + 1) % 5 == 0) print(\"\\n[%2d]\".format(i + 1))\n }\n println()\n}\n\nfun intToDouble(array: IntArray) = DoubleArray(array.size) { array[it].toDouble() }\n\nfun doubleArrayMin(array: DoubleArray) =\n if (array.size < 1) throw IAE(\"pAdjust requires at least one element\")\n else array.min()!!\n\nfun pAdjust(pvalues: DoubleArray, str: String): DoubleArray {\n val size = pvalues.size\n if (size < 1) throw IAE(\"pAdjust requires at least one element\")\n val type = when(str.toLowerCase()) {\n \"bh\", \"fdr\" -> 0\n \"by\" -> 1\n \"bonferroni\" -> 2\n \"hochberg\" -> 3\n \"holm\" -> 4\n \"hommel\" -> 5\n else -> throw IAE(\"'$str' doesn't match any accepted FDR types\")\n }\n if (type == 2) { // Bonferroni method\n return DoubleArray(size) {\n val b = pvalues[it] * size\n when {\n b >= 1 -> 1.0\n 0 <= b && b < 1 -> b\n else -> throw RuntimeException(\"$b is outside [0, 1)\")\n }\n }\n }\n else if (type == 4) { // Holm method\n val o = order(pvalues, false)\n val o2Double = intToDouble(o)\n val cummaxInput = DoubleArray(size) { (size - it) * pvalues[o[it]] }\n val ro = order(o2Double, false)\n val cummaxOutput = cummax(cummaxInput)\n val pmin = pminx(cummaxOutput, 1.0)\n return DoubleArray(size) { pmin[ro[it]] }\n }\n else if (type == 5) { // Hommel method\n val indices = seqLen(size, size)\n val o = order(pvalues, false)\n val p = DoubleArray(size) { pvalues[o[it]] }\n val o2Double = intToDouble(o)\n val ro = order(o2Double, false)\n val q = DoubleArray(size)\n val pa = DoubleArray(size)\n val npi = DoubleArray(size) { p[it] * size / indices[it] }\n val min = doubleArrayMin(npi)\n q.fill(min)\n pa.fill(min)\n for (j in size - 1 downTo 2) {\n val ij = seqLen(1, size - j + 1)\n for (i in 0 until size - j + 1) ij[i]--\n val i2Length = j - 1\n val i2 = IntArray(i2Length) { size - j + 2 + it - 1 }\n val pi2Length = i2Length\n var q1 = j * p[i2[0]] / 2.0\n for (i in 1 until pi2Length) {\n val temp_q1 = p[i2[i]] * j / (2.0 + i)\n if(temp_q1 < q1) q1 = temp_q1\n }\n for (i in 0 until size - j + 1) {\n q[ij[i]] = minOf(p[ij[i]] * j, q1)\n }\n for (i in 0 until i2Length) q[i2[i]] = q[size - j]\n for (i in 0 until size) if (pa[i] < q[i]) pa[i] = q[i]\n }\n for (index in 0 until size) q[index] = pa[ro[index]]\n return q\n }\n val ni = DoubleArray(size)\n val o = order(pvalues, true)\n val oDouble = intToDouble(o)\n for (index in 0 until size) {\n if (pvalues[index] !in 0.0 .. 1.0) {\n throw RuntimeException(\"array[$index] = ${pvalues[index]} is outside [0, 1]\")\n }\n ni[index] = size.toDouble() / (size - index)\n }\n val ro = order(oDouble, false)\n val cumminInput = DoubleArray(size)\n if (type == 0) { // BH method\n for (index in 0 until size) {\n cumminInput[index] = ni[index] * pvalues[o[index]]\n }\n }\n else if (type == 1) { // BY method\n var q = 0.0\n for (index in 1 until size + 1) q += 1.0 / index\n for (index in 0 until size) {\n cumminInput[index] = q * ni[index] * pvalues[o[index]]\n }\n }\n else if (type == 3) { // Hochberg method\n for (index in 0 until size) {\n cumminInput[index] = (index + 1) * pvalues[o[index]]\n }\n }\n val cumminArray = cummin(cumminInput)\n val pmin = pminx(cumminArray, 1.0)\n return DoubleArray(size) { pmin[ro[it]] }\n}\n\nfun main(args: Array<String>) {\n val pvalues = doubleArrayOf(\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n )\n\n val correctAnswers = listOf(\n doubleArrayOf( // Benjamini-Hochberg\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\n ),\n doubleArrayOf( // Benjamini & Yekutieli\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\n ),\n doubleArrayOf( // Bonferroni\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\n ),\n doubleArrayOf( // Hochberg\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n ),\n doubleArrayOf( // Holm\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\n ),\n doubleArrayOf( // Hommel\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\n )\n )\n val types = listOf(\"bh\", \"by\", \"bonferroni\", \"hochberg\", \"holm\", \"hommel\")\n val f = \"\\ntype %d = '%s' has cumulative error of %g\"\n for (type in 0 until types.size) {\n val q = pAdjust(pvalues, types[type])\n var error = 0.0\n for (i in 0 until pvalues.size) {\n error += Math.abs(q[i] - correctAnswers[type][i])\n }\n doubleSay(q)\n println(f.format(type, types[type], error))\n }\n}\n","language":"Kotlin"},{"code":"// version 1.2.21\n\ntypealias DList = List<Double>\n\nenum class Direction { UP, DOWN }\n\n// test also for 'Unknown' correction type\nval types = listOf(\n \"Benjamini-Hochberg\", \"Benjamini-Yekutieli\", \"Bonferroni\", \"Hochberg\",\n \"Holm\", \"Hommel\", \"Šidák\", \"Unknown\"\n)\n\nfun adjusted(p: DList, type: String) = \"\\n$type\\n${pFormat(adjust(check(p), type))}\"\n\nfun pFormat(p: DList, cols: Int = 5): String {\n var i = -cols\n val fmt = \"%1.10f\"\n return p.chunked(cols).map { chunk ->\n i += cols\n \"[%2d] %s\".format(i, chunk.map { fmt.format(it) }.joinToString(\" \"))\n }.joinToString(\"\\n\")\n}\n\nfun check(p: DList): DList {\n require(p.size > 0 && p.min()!! >= 0.0 && p.max()!! <= 1.0) {\n \"p-values must be in range 0.0 to 1.0\"\n }\n return p\n}\n\nfun ratchet(p: DList, dir: Direction): DList {\n val pp = p.toMutableList()\n var m = pp[0]\n if (dir == Direction.UP) {\n for (i in 1 until pp.size) {\n if (pp[i] > m) pp[i] = m\n m = pp[i]\n }\n }\n else {\n for (i in 1 until pp.size) {\n if (pp[i] < m) pp[i] = m\n m = pp[i]\n }\n }\n return pp.map { if (it < 1.0) it else 1.0 }\n}\n\nfun schwartzian(p: DList, mult: DList, dir: Direction): DList {\n val size = p.size\n val order = if (dir == Direction.UP)\n p.withIndex().sortedByDescending { it.value }.map { it.index }\n else\n p.withIndex().sortedBy { it.value }.map { it.index }\n var pa = List(size) { mult[it] * p[order[it]] }\n pa = ratchet(pa, dir)\n val order2 = order.withIndex().sortedBy{ it.value }.map { it.index }\n return List(size) { pa[order2[it]] }\n}\n\nfun adjust(p: DList, type: String): DList {\n val size = p.size\n require(size > 0)\n when (type) {\n \"Benjamini-Hochberg\" -> {\n val mult = List(size) { size.toDouble() / (size - it) }\n return schwartzian(p, mult, Direction.UP)\n }\n\n \"Benjamini-Yekutieli\" -> {\n val q = (1..size).sumByDouble { 1.0 / it }\n val mult = List(size) { q * size / (size - it) }\n return schwartzian(p, mult, Direction.UP)\n }\n\n \"Bonferroni\" -> {\n return p.map { minOf(it * size, 1.0) }\n }\n\n \"Hochberg\" -> {\n val mult = List(size) { (it + 1).toDouble() }\n return schwartzian(p, mult, Direction.UP)\n }\n\n \"Holm\" -> {\n val mult = List(size) { (size - it).toDouble() }\n return schwartzian(p, mult, Direction.DOWN)\n }\n\n \"Hommel\" -> {\n val order = p.withIndex().sortedBy { it.value }.map { it.index }\n val s = List(size) { p[order[it]] }\n val min = List(size){ s[it] * size / ( it + 1) }.min()!!\n val q = MutableList(size) { min }\n val pa = MutableList(size) { min }\n for (j in size - 1 downTo 2) {\n val lower = IntArray(size - j + 1) { it } // lower indices\n val upper = IntArray(j - 1) { size - j + 1 + it } // upper indices\n var qmin = j * s[upper[0]] / 2.0\n for (i in 1 until upper.size) {\n val temp = s[upper[i]] * j / (2.0 + i)\n if (temp < qmin) qmin = temp\n }\n for (i in 0 until lower.size) {\n q[lower[i]] = minOf(s[lower[i]] * j, qmin)\n }\n for (i in 0 until upper.size) q[upper[i]] = q[size - j]\n for (i in 0 until size) if (pa[i] < q[i]) pa[i] = q[i]\n }\n val order2 = order.withIndex().sortedBy{ it.value }.map { it.index }\n return List(size) { pa[order2[it]] }\n }\n\n \"Šidák\" -> {\n val m = size.toDouble()\n return p.map { 1.0 - Math.pow(1.0 - it, m) }\n }\n\n else -> {\n println(\n \"\\nSorry, do not know how to do '$type' correction.\\n\" +\n \"Perhaps you want one of these?:\\n\" +\n types.dropLast(1).map { \" $it\" }.joinToString(\"\\n\")\n )\n System.exit(1)\n }\n }\n return p\n}\n\nfun main(args: Array<String>) {\n val pValues = listOf(\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n )\n\n types.forEach { println(adjusted(pValues, it)) }\n}\n","language":"Kotlin"},{"code":"import algorithm, math, sequtils, strformat, strutils, sugar\n\ntype\n\n CorrectionType {.pure.} = enum\n BenjaminiHochberg = \"Benjamini-Hochberg\"\n BenjaminiYekutieli = \"Benjamini-Yekutieli\"\n Bonferroni = \"Bonferroni\"\n Hochberg = \"Hochberg\"\n Holm = \"Holm\"\n Hommel = \"Hommel\"\n Šidák = \"Šidák\"\n\n Direction {.pure.} = enum Up, Down\n\n PValues = seq[float]\n\n\ntemplate newPValues(length: Natural): PValues =\n ## Create a PValues object of given length.\n newSeq[float](length)\n\n\nfunc ratchet(p: var PValues; dir: Direction) =\n var m = p[0]\n case dir\n of Up:\n for i in 1..p.high:\n if p[i] > m: p[i] = m\n m = p[i]\n of Down:\n for i in 1..p.high:\n if p[i] < m: p[i] = m\n m = p[i]\n for i in 0..p.high:\n if p[i] > 1: p[i] = 1\n\n\nfunc schwartzian(p, mult: PValues; dir: Direction): PValues =\n\n let length = p.len\n let sortOrder = if dir == Up: Descending else: Ascending\n let order1 = toSeq(p.pairs).sorted((x, y) => cmp(x.val, y.val), sortOrder).mapIt(it.key)\n\n var pa = newPValues(length)\n for i in 0..pa.high:\n pa[i] = mult[i] * p[order1[i]]\n\n ratchet(pa, dir)\n\n let order2 = toSeq(order1.pairs).sortedByIt(it.val).mapIt(it.key)\n for idx in order2:\n result.add pa[idx]\n\n\nproc adjust(p: PValues; ctype: CorrectionType): PValues =\n let length = p.len\n assert length > 0\n let flength = length.toFloat\n\n case ctype\n\n of BenjaminiHochberg:\n var mult = newPValues(length)\n for i in 0..mult.high:\n mult[i] = flength / (flength - i.toFloat)\n return schwartzian(p, mult, Up)\n\n of BenjaminiYekutieli:\n var q = 0.0\n for i in 1..length: q += 1 / i\n var mult = newPValues(length)\n for i in 0..mult.high:\n mult[i] = (q * flength) / (flength - i.toFloat)\n return schwartzian(p, mult, Up)\n\n of Bonferroni:\n result = newPValues(length)\n for i in 0..result.high:\n result[i] = min(p[i] * flength, 1)\n return\n\n of Hochberg:\n var mult = newPValues(length)\n for i in 0..mult.high:\n mult[i] = i.toFloat + 1\n return schwartzian(p, mult, Up)\n\n of Holm:\n var mult = newPValues(length)\n for i in 0..mult.high:\n mult[i] = flength - i.toFloat\n return schwartzian(p, mult, Down)\n\n of Hommel:\n let order1 = toSeq(p.pairs).sortedByIt(it.val).mapIt(it.key)\n let s = order1.mapIt(p[it])\n var m = Inf\n for i in 0..s.high:\n m = min(m, s[i] * flength / (i + 1).toFloat)\n var q, pa = repeat(m, length)\n\n for j in countdown(length - 1, 2):\n let lower = toSeq(0..length - j)\n let upper = toSeq((length - j + 1)..<length)\n var qmin = j.toFloat * s[upper[0]] / 2\n for i in 1..upper.high:\n let val = s[upper[i]] * j.toFloat / (i + 2).toFloat\n if val < qmin: qmin = val\n for idx in lower: q[idx] = min(s[idx] * j.toFloat, qmin)\n for idx in upper: q[idx] = q[^j]\n for i, val in q:\n if pa[i] < val: pa[i] = val\n\n let order2 = toSeq(order1.pairs).sortedByIt(it.val).mapIt(it.key)\n return order2.mapIt(pa[it])\n\n of Šidák:\n result = newPValues(length)\n for i in 0..result.high:\n result[i] = 1 - (1 - p[i])^length\n return\n\n\nfunc pformat(p: PValues; cols = 5): string =\n var lines: seq[string]\n for i in countup(0, p.high, cols):\n let fchunk = p[i..<(i + cols)]\n var schunk = newSeq[string](fchunk.len)\n for j in 0..<cols:\n schunk[j] = fchunk[j].formatFloat(ffDecimal, 10)\n lines.add &\"[{i:2}] {schunk.join(\\\" \\\")}\"\n result = lines.join(\"\\n\")\n\n\nfunc adjusted(p: PValues; ctype: CorrectionType): string =\n doAssert p.len > 0 and min(p) >= 0 and max(p) <= 1, \"p-values must be in range 0.0 to 1.0.\"\n result = &\"\\n{ctype}\\n{pformat(p.adjust(ctype))}\"\n\nwhen isMainModule:\n\n const PVals = @[\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\n\n for ctype in CorrectionType:\n echo adjusted(PVals, ctype)\n","language":"Nim"},{"code":"#!/usr/bin/env perl\n\nuse strict;\nuse warnings FATAL => 'all';\nuse autodie ':all';\nuse List::Util 'min';\nuse feature 'say';\n\nsub pmin {\n\tmy $array = shift;\n\tmy $x = 1;\n\tmy @pmin_array;\n\tmy $n = scalar @$array;\n\tfor (my $index = 0; $index < $n; $index++) {\n\t\t$pmin_array[$index] = min(@$array[$index], $x);\n\t}\n\t@pmin_array\n}\n\nsub cummin {\n\tmy $array_ref = shift;\n\tmy @cummin;\n\tmy $cumulative_min = @$array_ref[0];\n\tforeach my $p (@$array_ref) {\n\t\tif ($p < $cumulative_min) {\n\t\t\t$cumulative_min = $p;\n\t\t}\n\t\tpush @cummin, $cumulative_min;\n\t}\n\t@cummin\n}\n\nsub cummax {\n\tmy $array_ref = shift;\n\tmy @cummax;\n\tmy $cumulative_max = @$array_ref[0];\n\tforeach my $p (@$array_ref) {\n\t\tif ($p > $cumulative_max) {\n\t\t\t$cumulative_max = $p;\n\t\t}\n\t\tpush @cummax, $cumulative_max;\n\t}\n\t@cummax\n}\n\nsub order {#made to match R's \"order\"\n\tmy $array_ref = shift;\n\tmy $decreasing = 'false';\n\tif (defined $_[0]) {\n\t\tmy $option = shift;\n\t\tif ($option =~ m/true/i) {\n\t\t\t$decreasing = 'true';\n\t\t} elsif ($option =~ m/false/i) {\n\t\t\t#do nothing, it's already set to false\n\t\t} else {\n\t\t\tprint \"2nd option should only be case-insensitive 'true' or 'false'\";\n\t\t\tdie;\n\t\t}\n\t}\n\tmy @array;\n\tmy $max_index = scalar @$array_ref-1;\n\tif ($decreasing eq 'false') {\n\t\t@array = sort { @$array_ref[$a] <=> @$array_ref[$b] } 0..$max_index;\n\t} elsif ($decreasing eq 'true') {\n\t\t@array = sort { @$array_ref[$b] <=> @$array_ref[$a] } 0..$max_index;\n\t}\n\t@array\n}\n\n\nsub p_adjust {\n\tmy $pvalues_ref = shift;\n\tmy $method;\n\tif (defined $_[0]) {\n\t\t$method = shift\n\t} else {\n\t\t$method = 'Holm'\n\t}\n\tmy %methods = (\n\t\t\t\t\t\t'bh' => 1,\n\t\t\t\t\t\t'fdr' => 1,\n\t\t\t\t\t\t'by' => 1,\n\t\t\t\t\t\t'holm' => 1,\n\t\t\t\t\t\t'hommel' => 1,\n\t\t\t\t\t\t'bonferroni' => 1,\n\t\t\t\t\t\t'hochberg' => 1\n\t\t\t\t\t\t);\n\tmy $method_found = 'no';\n\tforeach my $key (keys %methods) {\n\t\tif ((uc $method) eq (uc $key)) {\n\t\t\t$method = $key;\n\t\t\t$method_found = 'yes';\n\t\t\tlast\n\t\t}\n\t}\n\tif ($method_found eq 'no') {\n\t\tif ($method =~ m/benjamini-?\\s*hochberg/i) {\n\t\t\t$method = 'bh';\n\t\t\t$method_found = 'yes';\n\t\t} elsif ($method =~ m/benjamini-?\\s*yekutieli/i) {\n\t\t\t$method = 'by';\n\t\t\t$method_found = 'yes';\n\t\t}\n\t}\n\tif ($method_found eq 'no') {\n\t\tprint \"No method could be determined from $method.\\n\";\n\t\tdie\n\t}\n\tmy $lp = scalar @$pvalues_ref;\n\tmy $n = $lp;\n\tmy @qvalues;\n\tif ($method eq 'hochberg') {\n\t\tmy @o = order($pvalues_ref, 'TRUE');\n\t\tmy @cummin_input;\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\t$cummin_input[$index] = ($index+1)* @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\n\t\t}\n\t\tmy @cummin = cummin(\\@cummin_input);\n\t\tmy @pmin = pmin(\\@cummin);\n\t\tmy @ro = order(\\@o);\n\t\t@qvalues = @pmin[@ro];\n\t} elsif ($method eq 'bh') {\n\t\tmy @o = order($pvalues_ref, 'TRUE');\n\t\tmy @cummin_input;\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\t$cummin_input[$index] = ($n/($n-$index))* @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\n\t\t}\n\t\tmy @ro = order(\\@o);\n\t\tmy @cummin = cummin(\\@cummin_input);\n\t\tmy @pmin = pmin(\\@cummin);\n\t\t@qvalues = @pmin[@ro];\n\t} elsif ($method eq 'by') {\n\t\tmy $q = 0.0;\n\t\tmy @o = order($pvalues_ref, 'TRUE');\n\t\tmy @ro = order(\\@o);\n\t\tfor (my $index = 1; $index < ($n+1); $index++) {\n\t\t\t$q += 1.0 / $index;\n\t\t}\n\t\tmy @cummin_input;\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\t$cummin_input[$index] = $q * ($n/($n-$index)) * @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\n\t\t}\n#\t\tsay join (',', @cummin_input);\n#\t\tsay '@cummin_input # of elements = ' . scalar @cummin_input;\n\t\tmy @cummin = cummin(\\@cummin_input);\n\t\tundef @cummin_input;\n\t\tmy @pmin = pmin(\\@cummin);\n\t\t@qvalues = @pmin[@ro];\n\t} elsif ($method eq 'bonferroni') {\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\tmy $q = @$pvalues_ref[$index]*$n;\n\t\t\tif ((0 <= $q) && ($q < 1)) {\n\t\t\t\t$qvalues[$index] = $q;\n\t\t\t} elsif ($q >= 1) {\n\t\t\t\t$qvalues[$index] = 1.0;\n\t\t\t} else {\n\t\t\t\tsay 'Failed to get Bonferroni adjusted p.';\n\t\t\t\tdie;\n\t\t\t}\n\t\t}\n\t} elsif ($method eq 'holm') {\n\t\tmy @o = order($pvalues_ref);\n\t\tmy @cummax_input;\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\t$cummax_input[$index] = ($n - $index) * @$pvalues_ref[$o[$index]];\n\t\t}\n\t\tmy @ro = order(\\@o);\n\t\tundef @o;\n\t\tmy @cummax = cummax(\\@cummax_input);\n\t\tundef @cummax_input;\n\t\tmy @pmin = pmin(\\@cummax);\n\t\tundef @cummax;\n\t\t@qvalues = @pmin[@ro];\n\t} elsif ($method eq 'hommel') {\n\t\tmy @o = order($pvalues_ref);\n\t\tmy @p = @$pvalues_ref[@o];\n\t\tmy @ro = order(\\@o);\n\t\tundef @o;\n\t\tmy (@q, @pa);\n\t\tmy $min = $n*$p[0];\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\tmy $temp = $n*$p[$index] / ($index + 1);\n\t\t\t$min = min($min, $temp);\n\t\t}\n\t\tfor (my $index = 0; $index < $n; $index++) {\n\t\t\t$pa[$index] = $min;#q <- pa <- rep.int(min(n * p/i), n)\n\t\t\t $q[$index] = $min;#q <- pa <- rep.int(min(n * p/i), n)\n\t\t}\n\t\tfor (my $j = ($n-1); $j >= 2; $j--) {\n\t\t\tmy @ij = 0..($n - $j);#ij <- seq_len(n - j + 1)\n\t\t\tmy $I2_LENGTH = $j - 1;\n\t\t\tmy @i2;\n\t\t\tfor (my $i = 0; $i < $I2_LENGTH; $i++) {\n\t\t\t\t$i2[$i] = $n-$j+2+$i-1;\n#R's indices are 1-based, C's are 0-based, I added the -1\n\t\t\t}\n\n\t\t\tmy $q1 = $j * $p[$i2[0]] / 2.0;\n\t\t\tfor (my $i = 1; $i < $I2_LENGTH; $i++) {#loop through 2:j\n\t\t\t\tmy $TEMP_Q1 = $j * $p[$i2[$i]] / (2 + $i);\n\t\t\t\t$q1 = min($TEMP_Q1, $q1);\n\t\t\t}\n\t\t\tfor (my $i = 0; $i < ($n - $j + 1); $i++) {#q[ij] <- pmin(j * p[ij], q1)\n\t\t\t\t$q[$ij[$i]] = min( $j*$p[$ij[$i]], $q1);\n\t\t\t}\n\n\t\t\tfor (my $i = 0; $i < $I2_LENGTH; $i++) {#q[i2] <- q[n - j + 1]\n\t\t\t\t$q[$i2[$i]] = $q[$n - $j];\n\t\t\t}\n\n\t\t\tfor (my $i = 0; $i < $n; $i++) {#pa <- pmax(pa, q)\n\t\t\t\tif ($pa[$i] < $q[$i]) {\n\t\t\t\t\t$pa[$i] = $q[$i];\n\t\t\t\t}\n\t\t\t}\n#\t\t\tprintf(\"j = %zu, pa = \\n\", j);\n#\t\t\t\tdouble_say(pa, N);\n\t\t}#end j loop\n\t\t@qvalues = @pa[@ro];\n\t} else {\n\t\tprint \"$method doesn't fit my types.\\n\";\n\t\tdie\n\t}\n\t@qvalues\n}\nmy @pvalues = (4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03);\n\nmy %correct_answers = (\n\t'Benjamini-Hochberg' => [6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02],\n\t'Benjamini-Yekutieli' => [1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02],\n\t'Bonferroni' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01],\n\n\t'Hochberg' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01],\n\t'Holm' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01],\n\n\t'Hommel' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01]);\n\n\nforeach my $method ('Hochberg','Benjamini-Hochberg','Benjamini-Yekutieli', 'Bonferroni', 'Holm', 'Hommel') {\n\tprint \"$method\\n\";\n\tmy @qvalues = p_adjust(\\@pvalues, $method);\n\tmy $error = 0.0;\n\tforeach my $q (0..$#qvalues) {\n\t\t$error += abs($qvalues[$q] - $correct_answers{$method}[$q]);\n\t}\n\tprintf(\"type $method has cumulative error of %g.\\n\", $error);\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">UP</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DOWN</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">ratchet</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">direction</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">direction</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">UP</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]></span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]<</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">sq_min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">schwartzian</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">direction</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">custom_sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">direction</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">UP</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pa</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ratchet</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">extract</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">)),</span> <span style=\"color: #000000;\">direction</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">extract</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pa</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">invert</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">adjust</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">method</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">size</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">mult</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #000000;\">method</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Benjamini-Hochberg\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #000000;\">mult</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_div</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sq_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">schwartzian</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">UP</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Benjamini-Yekutieli\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_div</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">mult</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_div</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sq_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">schwartzian</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">UP</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Bonferroni\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">sq_min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Hochberg\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">schwartzian</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">UP</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Holm\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #000000;\">mult</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">schwartzian</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">DOWN</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Hommel\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ivdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">size</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000000;\">ivdx</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">ivdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ivdx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">vslice</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ivdx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_div</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">mult</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">qh</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">pa</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">order</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">vslice</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ivdx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">lwr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">upr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">qmin</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">upr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]/</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">upr</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">qmin</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">upr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]]*</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">/(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">qmin</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lwr</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lwr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">lwr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]]*</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">qmin</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">upr</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">upr</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">pa</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pa</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qh</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">extract</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pa</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">order</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">invert</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"Sidak\"</span><span style=\"color: #0000FF;\">:</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #0000FF;\">-</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">size</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">p</span>\n\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #000080;font-style:italic;\">-- (unknown method)</span>\n\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">p</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">types</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">correct_answers</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">({</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Benjamini-Hochberg\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">6.126681e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.521710e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.987205e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.891595e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.217789e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.301450e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.870370e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.301450e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.049731e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.826753e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">6.482629e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.253722e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.280973e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.769926e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.705703e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.241867e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.049731e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.856107e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.887526e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.136717e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">4.991891e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.769926e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.217789e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.301450e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.304958e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.832475e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.899547e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.521710e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.476843e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.683638e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.562902e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.516084e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.250189e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.636589e-03</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.562902e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.946883e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.166064e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.899547e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.688991e-03</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">4.502862e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.252228e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.881555e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.142613e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.846527e-03</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.562902e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.846527e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.101708e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.252032e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.205958e-02</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Benjamini-Yekutieli\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.940844e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.510676e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.114323e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.754486e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.644618e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">7.575031e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.153102e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.581959e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.812089e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.636176e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.153102e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.325863e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.774239e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.754486e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.209832e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.025930e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.634031e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.546073e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.413926e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.180552e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.153102e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.180552e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.956812e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.262838e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.925057e-02</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Bonferroni\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.019185e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.020365e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.516674e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.625735e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.909271e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.537741e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.125636e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.782670e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.803480e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.882294e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.005725e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.252228e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.713920e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.395577e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.088915e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.846527e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.305125e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.867745e-01</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Hochberg\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.632662e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.575885e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.383967e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.938014e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.600230e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.501973e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.383967e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.052971e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.426136e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.626366e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.656419e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">8.825610e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.252228e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.930759e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.394022e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.692284e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.023581e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.974152e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.172920e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.992520e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.179486e-01</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Holm\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.632662e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.000000e+00</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.575885e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.395341e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.938014e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.600230e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.501973e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.395341e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.052971e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.426136e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.626366e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.656419e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">8.825610e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.252228e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.930759e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.394022e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.692284e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.023581e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.974152e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.172920e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.992520e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.179486e-01</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Hommel\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.987624e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.595180e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.351895e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.766522e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.414256e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.304340e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.530937e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.887709e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.385602e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.322457e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.722920e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.426136e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.218158e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.581127e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">8.825610e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.252228e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.743649e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.016908e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.516461e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">9.582456e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.877222e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.172920e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.122276e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.950067e-01</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"Sidak\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9946598274</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9914285749</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999515274</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999999688</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999999995</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999998801</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999999855</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9231179729</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.9999999956</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9999317605</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.9983109511</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.5068253940</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.0000000000</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.9703301333</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.1832692440</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0150545753</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.4320729669</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.6993672225</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0286818157</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.0152621104</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.3391808707</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0656206307</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.4959194266</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0186503726</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.0009001752</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0000125222</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.8142104886</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.3772612062</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0430222116</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">0.0108312558</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0473319661</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.0032997780</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.7705015898</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0.2499384839</span><span style=\"color: #0000FF;\">}}})</span>\n <span style=\"color: #000080;font-style:italic;\">-- {\"Unknown\",{1<nowiki>}}</nowiki>})</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">pValues</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4.533744e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.296024e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.936026e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.079658e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.801962e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">8.752257e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.922222e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.115421e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.355806e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.324867e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">4.926798e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.802978e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.485442e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.883130e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.729308e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">8.502518e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4.268138e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.442008e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.030266e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.001555e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">3.194810e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.892933e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.991834e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.745691e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.037516e-01</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.198578e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.966083e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.403837e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">7.328671e-01</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.793476e-02</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">4.040730e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.033349e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.125147e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.375072e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.818542e-04</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">3.075482e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.251272e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.356534e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1.360696e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.764588e-04</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">1.801145e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.504456e-07</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3.310253e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.427839e-03</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">8.791153e-04</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">2.177831e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">9.693054e-04</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">6.610250e-05</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2.900813e-02</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">5.735490e-03</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pValues</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pValues</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pValues</span><span style=\"color: #0000FF;\">)></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"p-values must be in range 0.0 to 1.0\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">types</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ti</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">types</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">adjust</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pValues</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">={}</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nSorry, do not know how to do %s correction.\\n\"</span><span style=\"color: #0000FF;\">&</span>\n <span style=\"color: #008000;\">\"Perhaps you want one of these?:\\n %s\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">types</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #008000;\">\"\\n \"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000080;font-style:italic;\">-- printf(1,\"%s\\n\",{ti})\n -- res = correct_answers[i] -- (for easier comparison only)\n -- pp(res,{pp_FltFmt,\"%13.10f\",pp_IntFmt,\"%13.10f\",pp_Maxlen,75,pp_Pause,0})</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">error</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">correct_answers</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s has cumulative error of %g\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">ti</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">error</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"from __future__ import division\nimport sys\n\ndef pminf(array):\n x = 1\n pmin_list = []\n N = len(array)\n for index in range(N):\n if array[index] < x:\n pmin_list.insert(index, array[index])\n else:\n pmin_list.insert(index, x)\n return pmin_list\n#end function\n\ndef cumminf(array):\n cummin = []\n cumulative_min = array[0]\n for p in array:\n if p < cumulative_min:\n cumulative_min = p\n cummin.append(cumulative_min)\n return cummin\n#end\n\ndef cummaxf(array):\n cummax = []\n cumulative_max = array[0]\n for e in array:\n if e > cumulative_max:\n cumulative_max = e\n cummax.append(cumulative_max)\n return cummax\n#end\n\ndef order(*args):\n if len(args) > 1:\n if args[1].lower() == 'false':# if ($string1 eq $string2) {\n return sorted(range(len(args[0])), key = lambda k: args[0][k])\n elif list(args[1].lower()) == list('true'):\n return sorted(range(len(args[0])), key = lambda k: args[0][k], reverse = True)\n else:\n print \"%s isn't a recognized parameter\" % args[1]\n sys.exit()\n elif len(args) == 1:\n return sorted(range(len(args[0])), key = lambda k: args[0][k])\n#end\n\ndef p_adjust(*args):\n method = \"bh\"\n pvalues = args[0]\n if len(args) > 1:\n methods = {\"bh\", \"fdr\", \"by\", \"holm\", \"hommel\", \"bonferroni\", \"hochberg\"}\n metharg = arg[1].lower()\n if metharg in methods:\n method = metharg\n lp = len(pvalues)\n n = lp\n qvalues = []\n\n if method == 'hochberg':#already all lower case\n o = order(pvalues, 'TRUE')\n cummin_input = []\n for index in range(n):\n cummin_input.insert(index, (index+1)*pvalues[o[index]])\n cummin = cumminf(cummin_input)\n pmin = pminf(cummin)\n ro = order(o)\n qvalues = [pmin[i] for i in ro]\n elif method == 'bh':\n o = order(pvalues, 'TRUE')\n cummin_input = []\n for index in range(n):\n cummin_input.insert(index, (n/(n-index))* pvalues[o[index]])\n ro = order(o)\n cummin = cumminf(cummin_input)\n pmin = pminf(cummin)\n qvalues = [pmin[i] for i in ro]\n elif method == 'by':\n q = 0.0\n o = order(pvalues, 'TRUE')\n ro = order(o)\n for index in range(1, n+1):\n q += 1.0 / index;\n cummin_input = []\n for index in range(n):\n cummin_input.insert(index, q * (n/(n-index)) * pvalues[o[index]])\n cummin = cumminf(cummin_input)\n pmin = pminf(cummin)\n qvalues = [pmin[i] for i in ro]\n elif method == 'bonferroni':\n for index in range(n):\n q = pvalues[index] * n\n if (0 <= q) and (q < 1):\n qvalues.insert(index, q)\n elif q >= 1:\n qvalues.insert(index, 1)\n else:\n print '%g won\\'t give a Bonferroni adjusted p' % q\n sys.exit()\n elif method == 'holm':\n o = order(pvalues)\n cummax_input = []\n for index in range(n):\n cummax_input.insert(index, (n - index) * pvalues[o[index]])\n ro = order(o)\n cummax = cummaxf(cummax_input)\n pmin = pminf(cummax)\n qvalues = [pmin[i] for i in ro]\n elif method == 'hommel':\n i = range(1,n+1)\n o = order(pvalues)\n p = [pvalues[index] for index in o]\n ro = order(o)\n pa = []\n q = []\n smin = n*p[0]\n for index in range(n):\n temp = n*p[index] / (index + 1)\n if temp < smin:\n smin = temp\n for index in range(n):\n pa.insert(index, smin)\n q.insert(index, smin)\n for j in range(n-1,1,-1):\n ij = range(1,n-j+2)\n for x in range(len(ij)):\n ij[x] -= 1\n I2_LENGTH = j - 1\n i2 = []\n for index in range(I2_LENGTH+1):\n i2.insert(index, n - j + 2 + index - 1)\n q1 = j * p[i2[0]] / 2.0\n for index in range(1,I2_LENGTH):\n TEMP_Q1 = j * p[i2[index]] / (2.0 + index)\n if TEMP_Q1 < q1:\n q1 = TEMP_Q1\n for index in range(n - j + 1):\n q[ij[index]] = min(j * p[ij[index]], q1)\n for index in range(I2_LENGTH):\n q[i2[index]] = q[n-j]\n for index in range(n):\n if pa[index] < q[index]:\n pa[index] = q[index]\n qvalues = [pa[index] for index in ro]\n else:\n print \"method %s isn't defined.\" % method\n sys.exit()\n return qvalues\n\npvalues = [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\n\ncorrect_answers = {}\n\ncorrect_answers['bh'] = [6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02]\n\ncorrect_answers['by'] = [1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02]\n\ncorrect_answers['bonferroni'] = [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01]\n\ncorrect_answers['hochberg'] = [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01]\n\ncorrect_answers['holm'] = [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01]\n\ncorrect_answers['hommel'] = [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01]\n\nfor key in correct_answers.keys():\n error = 0.0\n q = p_adjust(pvalues, key)\n for i in range(len(q)):\n error += abs(q[i] - correct_answers[key][i])\n print '%s error = %g' % (key.upper(), error)\n","language":"Python"},{"code":"p <- c(4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03)\n\np.adjust(p, method = 'BH')\nprint(\"Benjamini-Hochberg\")\nwriteLines(\"\\n\")\n\np.adjust(p, method = 'BY')\nprint(\"Benjamini & Yekutieli\")\nwriteLines(\"\\n\")\n\np.adjust(p, method = 'bonferroni')\nprint(\"Bonferroni\")\nwriteLines(\"\\n\")\n\np.adjust(p, method = 'hochberg')\nprint(\"Hochberg\")\nwriteLines(\"\\n\");\n\np.adjust(p, method = 'hommel')\nwriteLines(\"Hommel\\n\")\n","language":"R"},{"code":"########################### Helper subs ###########################\n\nsub adjusted (@p, $type) { \"\\n$type\\n\" ~ format adjust( check(@p), $type ) }\n\nsub format ( @p, $cols = 5 ) {\n my $i = -$cols;\n my $fmt = \"%1.10f\";\n join \"\\n\", @p.rotor($cols, :partial).map:\n { sprintf \"[%2d] { join ' ', $fmt xx $_ }\", $i+=$cols, $_ };\n}\n\nsub check ( @p ) { die 'p-values must be in range 0.0 to 1.0' if @p.min < 0 or 1 < @p.max; @p }\n\nmulti ratchet ( 'up', @p ) { my $m; @p[$_] min= $m, $m = @p[$_] for ^@p; @p }\n\nmulti ratchet ( 'dn', @p ) { my $m; @p[$_] max= $m, $m = @p[$_] for ^@p .reverse; @p }\n\nsub schwartzian ( @p, &transform, :$ratchet ) {\n my @pa = @p.map( {[$_, $++]} ).sort( -*.[0] ).map: { [transform(.[0]), .[1]] };\n @pa[*;0] = ratchet($ratchet, @pa»[0]);\n @pa.sort( *.[1] )»[0]\n}\n\n############# The various p-value correction routines #############\n\nmulti adjust( @p, 'Benjamini-Hochberg' ) {\n @p.&schwartzian: * * @p / (@p - $++) min 1, :ratchet('up')\n}\n\nmulti adjust( @p, 'Benjamini-Yekutieli' ) {\n my \\r = ^@p .map( { 1 / ++$ } ).sum;\n @p.&schwartzian: * * r * @p / (@p - $++) min 1, :ratchet('up')\n}\n\nmulti adjust( @p, 'Hochberg' ) {\n my \\m = @p.max;\n @p.&schwartzian: * * ++$ min m, :ratchet('up')\n}\n\nmulti adjust( @p, 'Holm' ) {\n @p.&schwartzian: * * ++$ min 1, :ratchet('dn')\n}\n\nmulti adjust( @p, 'Šidák' ) {\n @p.&schwartzian: 1 - (1 - *) ** ++$, :ratchet('dn')\n}\n\nmulti adjust( @p, 'Bonferroni' ) {\n @p.map: * * @p min 1\n}\n\n# Hommel correction can't be easily reduced to a one pass transform\nmulti adjust( @p, 'Hommel' ) {\n my @s = @p.map( {[$_, $++]} ).sort: *.[0] ; # sorted\n my \\z = +@p; # array si(z)e\n my @pa = @s»[0].map( * * z / ++$ ).min xx z; # p adjusted\n my @q; # scratch array\n for (1 ..^ z).reverse -> $i {\n my @L = 0 .. z - $i; # lower indices\n my @U = z - $i ^..^ z; # upper indices\n my $q = @s[@U]»[0].map( { $_ * $i / (2 + $++) } ).min;\n @q[@L] = @s[@L]»[0].map: { min $_ * $i, $q, @s[*-1][0] };\n @pa = ^z .map: { max @pa[$_], @q[$_] }\n }\n @pa[@s[*;1].map( {[$_, $++]} ).sort( *.[0] )»[1]]\n}\n\nmulti adjust ( @p, $unknown ) {\n note \"\\nSorry, do not know how to do $unknown correction.\\n\" ~\n \"Perhaps you want one of these?:\\n\" ~\n <Benjamini-Hochberg Benjamini-Yekutieli Bonferroni Hochberg\n Holm Hommel Šidák>.join(\"\\n\");\n exit\n}\n\n########################### The task ###########################\n\nmy @p-values =\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n;\n\nfor < Benjamini-Hochberg Benjamini-Yekutieli Bonferroni Hochberg Holm Hommel Šidák >\n{\n say adjusted @p-values, $_\n}\n","language":"Raku"},{"code":"def pmin(array)\n x = 1\n pmin_array = []\n array.each_index do |i|\n pmin_array[i] = [array[i], x].min\n abort if pmin_array[i] > 1\n end\n pmin_array\nend\n\ndef cummin(array)\n cumulative_min = array[0]\n arr_cummin = []\n array.each do |p|\n cumulative_min = [p, cumulative_min].min\n arr_cummin.push(cumulative_min)\n end\n arr_cummin\nend\n\ndef cummax(array)\n cumulative_max = array[0]\n arr_cummax = []\n array.each do |p|\n cumulative_max = [p, cumulative_max].max\n arr_cummax.push(cumulative_max)\n end\n arr_cummax\nend\n\n# decreasing variable is optional\ndef order(array, decreasing = false)\n if decreasing == false\n array.sort.map { |n| array.index(n) }\n else\n array.sort.map { |n| array.index(n) }.reverse\n end\nend\n\ndef p_adjust(arr_pvalues, method = 'Holm')\n lp = arr_pvalues.size\n n = lp\n if method.casecmp('hochberg').zero?\n arr_o = order(arr_pvalues, true)\n arr_cummin_input = []\n (0..n).each do |index|\n arr_cummin_input[index] = (index + 1) * arr_pvalues[arr_o[index].to_i]\n end\n arr_cummin = cummin(arr_cummin_input)\n arr_pmin = pmin(arr_cummin)\n arr_ro = order(arr_o)\n return arr_pmin.values_at(*arr_ro)\n elsif method.casecmp('bh').zero? || method.casecmp('benjamini-hochberg').zero?\n arr_o = order(arr_pvalues, true)\n arr_cummin_input = []\n (0..(n - 1)).each do |i|\n arr_cummin_input[i] = (n / (n - i).to_f) * arr_pvalues[arr_o[i]]\n end\n arr_ro = order(arr_o)\n arr_cummin = cummin(arr_cummin_input)\n arr_pmin = pmin(arr_cummin)\n return arr_pmin.values_at(*arr_ro)\n elsif method.casecmp('by').zero? || method.casecmp('benjamini-yekutieli').zero?\n q = 0.0\n arr_o = order(arr_pvalues, true)\n arr_ro = order(arr_o)\n (1..n).each do |index|\n q += 1.0 / index\n end\n arr_cummin_input = []\n (0..(n - 1)).each do |i|\n arr_cummin_input[i] = q * (n / (n - i).to_f) * arr_pvalues[arr_o[i]]\n end\n arr_cummin = cummin(arr_cummin_input)\n arr_pmin = pmin(arr_cummin)\n return arr_pmin.values_at(*arr_ro)\n elsif method.casecmp('bonferroni').zero?\n arr_qvalues = []\n (0..(n - 1)).each do |i|\n q = arr_pvalues[i] * n\n if (q >= 0) && (q < 1)\n arr_qvalues[i] = q\n elsif q >= 1\n arr_qvalues[i] = 1.0\n else\n puts \"Falied to get Bonferroni adjusted p for #{arr_pvalues[i]}\"\n end\n end\n return arr_qvalues\n elsif method.casecmp('holm').zero?\n o = order(arr_pvalues)\n cummax_input = []\n (0..(n - 1)).each do |index|\n cummax_input[index] = (n - index) * arr_pvalues[o[index]]\n end\n ro = order(o)\n arr_cummax = cummax(cummax_input)\n arr_pmin = pmin(arr_cummax)\n return arr_pmin.values_at(*ro)\n elsif method.casecmp('hommel').zero?\n o = order(arr_pvalues)\n arr_p = arr_pvalues.values_at(*o)\n ro = order(o)\n q = []\n pa = []\n min = n * arr_p[0]\n (0..(n - 1)).each do |index|\n temp = n * arr_p[index] / (index + 1)\n min = [min, temp].min\n end\n (0..(n - 1)).each do |index|\n pa[index] = min\n q[index] = min\n end\n j = n - 1\n while j >= 2\n ij = Array 0..(n - j)\n i2_length = j - 1\n i2 = []\n (0..(i2_length - 1)).each do |i|\n i2[i] = n - j + 2 + i - 1 # R's indices are 1-based, C's are 0-based\n end\n q1 = j * arr_p[i2[0]] / 2.0\n (1..(i2_length - 1)).each do |i|\n temp_q1 = j * arr_p[i2[i]] / (2 + i)\n q1 = [temp_q1, q1].min\n end\n (0..(n - j)).each do |i|\n tmp = j * arr_p[ij[i]]\n q[ij[i]] = [tmp, q1].min\n end\n (0..(i2_length - 1)).each do |i|\n q[i2[i]] = q[n - j]\n end\n (0..(n - 1)).each do |i|\n pa[i] = q[i] if pa[i] < q[i]\n end\n j -= 1\n end\n return pa.values_at(*ro)\n else\n puts \"#{method} isn't accepted.\"\n abort\n end\nend\n\npvalues =\n [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02,\n 1.801962e-01, 8.752257e-01, 2.922222e-01, 9.115421e-01,\n 4.355806e-01, 5.324867e-01, 4.926798e-01, 5.802978e-01,\n 3.485442e-01, 7.883130e-01, 2.729308e-01, 8.502518e-01,\n 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01,\n 9.037516e-01, 1.198578e-01, 3.966083e-01, 1.403837e-02,\n 7.328671e-01, 6.793476e-02, 4.040730e-03, 3.033349e-04,\n 1.125147e-02, 2.375072e-02, 5.818542e-04, 3.075482e-04,\n 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03,\n 8.791153e-04, 2.177831e-04, 9.693054e-04, 6.610250e-05,\n 2.900813e-02, 5.735490e-03]\n\ncorrect_answers = {\n 'Benjamini-Hochberg' => [6.126681e-01, 8.521710e-01, 1.987205e-01,\n 1.891595e-01, 3.217789e-01, 9.301450e-01,\n 4.870370e-01, 9.301450e-01, 6.049731e-01,\n 6.826753e-01, 6.482629e-01, 7.253722e-01,\n 5.280973e-01, 8.769926e-01, 4.705703e-01,\n 9.241867e-01, 6.049731e-01, 7.856107e-01,\n 4.887526e-01, 1.136717e-01, 4.991891e-01,\n 8.769926e-01, 9.991834e-01, 3.217789e-01,\n 9.301450e-01, 2.304958e-01, 5.832475e-01,\n 3.899547e-02, 8.521710e-01, 1.476843e-01,\n 1.683638e-02, 2.562902e-03, 3.516084e-02,\n 6.250189e-02, 3.636589e-03, 2.562902e-03,\n 2.946883e-02, 6.166064e-03, 3.899547e-02,\n 2.688991e-03, 4.502862e-04, 1.252228e-05,\n 7.881555e-02, 3.142613e-02, 4.846527e-03,\n 2.562902e-03, 4.846527e-03, 1.101708e-03,\n 7.252032e-02, 2.205958e-02],\n 'Benjamini-Yekutieli' => [1.000000e+00, 1.000000e+00, 8.940844e-01,\n 8.510676e-01, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 5.114323e-01, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.754486e-01, 1.000000e+00, 6.644618e-01,\n 7.575031e-02, 1.153102e-02, 1.581959e-01,\n 2.812089e-01, 1.636176e-02, 1.153102e-02,\n 1.325863e-01, 2.774239e-02, 1.754486e-01,\n 1.209832e-02, 2.025930e-03, 5.634031e-05,\n 3.546073e-01, 1.413926e-01, 2.180552e-02,\n 1.153102e-02, 2.180552e-02, 4.956812e-03,\n 3.262838e-01, 9.925057e-02],\n 'Bonferroni' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 7.019185e-01,\n 1.000000e+00, 1.000000e+00, 2.020365e-01, 1.516674e-02,\n 5.625735e-01, 1.000000e+00, 2.909271e-02, 1.537741e-02,\n 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01,\n 4.395577e-02, 1.088915e-02, 4.846527e-02, 3.305125e-03,\n 1.000000e+00, 2.867745e-01],\n\n 'Hochberg' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 4.632662e-01,\n 9.991834e-01, 9.991834e-01, 1.575885e-01, 1.383967e-02,\n 3.938014e-01, 7.600230e-01, 2.501973e-02, 1.383967e-02,\n 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01,\n 3.692284e-02, 1.023581e-02, 3.974152e-02, 3.172920e-03,\n 8.992520e-01, 2.179486e-01],\n 'Holm' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 4.632662e-01,\n 1.000000e+00, 1.000000e+00, 1.575885e-01, 1.395341e-02,\n 3.938014e-01, 7.600230e-01, 2.501973e-02, 1.395341e-02,\n 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01,\n 3.692284e-02, 1.023581e-02, 3.974152e-02, 3.172920e-03,\n 8.992520e-01, 2.179486e-01],\n\n 'Hommel' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 4.351895e-01,\n 9.991834e-01, 9.766522e-01, 1.414256e-01, 1.304340e-02,\n 3.530937e-01, 6.887709e-01, 2.385602e-02, 1.322457e-02,\n 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01,\n 3.516461e-02, 9.582456e-03, 3.877222e-02, 3.172920e-03,\n 8.122276e-01, 1.950067e-01]\n}\n\n# correct_answers.each do |method, answers|\nmethods = ['Benjamini-Yekutieli', 'Benjamini-Hochberg', 'Hochberg',\n 'Bonferroni', 'Holm', 'Hommel']\nmethods.each do |method|\n puts method\n error = 0.0\n arr_q = p_adjust(pvalues, method)\n arr_q.each_index do |p|\n error += (correct_answers[method][p] - arr_q[p])\n end\n puts \"total error for #{method} = #{error}\"\nend\n","language":"Ruby"},{"code":"use std::iter;\n\n#[rustfmt::skip]\nconst PVALUES:[f64;50] = [\n4.533_744e-01, 7.296_024e-01, 9.936_026e-02, 9.079_658e-02, 1.801_962e-01,\n8.752_257e-01, 2.922_222e-01, 9.115_421e-01, 4.355_806e-01, 5.324_867e-01,\n4.926_798e-01, 5.802_978e-01, 3.485_442e-01, 7.883_130e-01, 2.729_308e-01,\n8.502_518e-01, 4.268_138e-01, 6.442_008e-01, 3.030_266e-01, 5.001_555e-02,\n3.194_810e-01, 7.892_933e-01, 9.991_834e-01, 1.745_691e-01, 9.037_516e-01,\n1.198_578e-01, 3.966_083e-01, 1.403_837e-02, 7.328_671e-01, 6.793_476e-02,\n4.040_730e-03, 3.033_349e-04, 1.125_147e-02, 2.375_072e-02, 5.818_542e-04,\n3.075_482e-04, 8.251_272e-03, 1.356_534e-03, 1.360_696e-02, 3.764_588e-04,\n1.801_145e-05, 2.504_456e-07, 3.310_253e-02, 9.427_839e-03, 8.791_153e-04,\n2.177_831e-04, 9.693_054e-04, 6.610_250e-05, 2.900_813e-02, 5.735_490e-03\n];\n\n#[derive(Debug)]\nenum CorrectionType {\n BenjaminiHochberg,\n BenjaminiYekutieli,\n Bonferroni,\n Hochberg,\n Holm,\n Hommel,\n Sidak,\n}\n\nenum SortDirection {\n Increasing,\n Decreasing,\n}\n\n/// orders **input** vector by value and multiplies with **multiplier** vector\n/// Finally returns the multiplied values in the original order of **input**\nfn ordered_multiply(input: &[f64], multiplier: &[f64], direction: &SortDirection) -> Vec<f64> {\n let order_by_value = match direction {\n SortDirection::Increasing => {\n |a: &(f64, usize), b: &(f64, usize)| b.0.partial_cmp(&a.0).unwrap()\n }\n SortDirection::Decreasing => {\n |a: &(f64, usize), b: &(f64, usize)| a.0.partial_cmp(&b.0).unwrap()\n }\n };\n\n let cmp_minmax = match direction {\n SortDirection::Increasing => |a: f64, b: f64| a.gt(&b),\n SortDirection::Decreasing => |a: f64, b: f64| a.lt(&b),\n };\n\n // add original order index\n let mut input_indexed = input\n .iter()\n .enumerate()\n .map(|(idx, &p_value)| (p_value, idx))\n .collect::<Vec<_>>();\n\n // order by value desc/asc\n input_indexed.sort_unstable_by(order_by_value);\n\n // do the multiplication in place, clamp it at 1.0,\n // keep the original index in place\n for i in 0..input_indexed.len() {\n input_indexed[i] = (\n f64::min(1.0, input_indexed[i].0 * multiplier[i]),\n input_indexed[i].1,\n );\n }\n\n // make vector strictly monotonous increasing/decreasing in place\n for i in 1..input_indexed.len() {\n if cmp_minmax(input_indexed[i].0, input_indexed[i - 1].0) {\n input_indexed[i] = (input_indexed[i - 1].0, input_indexed[i].1);\n }\n }\n\n // re-sort back to original order\n input_indexed.sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.1.cmp(&b.1));\n\n // remove ordering index\n let (resorted, _): (Vec<_>, Vec<_>) = input_indexed.iter().cloned().unzip();\n resorted\n}\n\n#[allow(clippy::cast_precision_loss)]\nfn hommel(input: &[f64]) -> Vec<f64> {\n // using algorith described:\n // http://stat.wharton.upenn.edu/~steele/Courses/956/ResourceDetails/MultipleComparision/Writght92.pdf\n\n // add original order index\n let mut input_indexed = input\n .iter()\n .enumerate()\n .map(|(idx, &p_value)| (p_value, idx))\n .collect::<Vec<_>>();\n\n // order by value asc\n input_indexed\n .sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.0.partial_cmp(&b.0).unwrap());\n\n let (p_values, order): (Vec<_>, Vec<_>) = input_indexed.iter().cloned().unzip();\n\n let n = input.len();\n\n // initial minimal n*p/i values\n // get the smalles of these values\n let min_result = (0..n)\n .map(|i| ((p_values[i] * n as f64) / (i + 1) as f64))\n .fold(1. / 0. /* -inf */, f64::min);\n\n // // initialize result vector with minimal values\n let mut result = iter::repeat(min_result).take(n).collect::<Vec<_>>();\n\n for m in (2..n).rev() {\n let cmin: f64;\n let m_as_float = m as f64;\n let mut a = p_values.clone();\n // println!(\"\\nn: {}\", m);\n {\n // split p-values into two group\n let (_, second) = p_values.split_at(n - m + 1);\n\n // calculate minumum of m*p/i for this second group\n cmin = second\n .iter()\n .zip(2..=m)\n .map(|(p, i)| (m_as_float * p) / i as f64)\n .fold(1. / 0. /* inf */, f64::min);\n }\n\n // replace p values if p<cmin in the second group\n ((n - m + 1)..n).for_each(|i| a[i] = a[i].max(cmin));\n\n // replace p values if min(cmin, m*p) > p\n (0..=(n - m)).for_each(|i| a[i] = a[i].max(f64::min(cmin, m_as_float * p_values[i])));\n\n // store in the result vector if any adjusted p is higher than the current one\n (0..n).for_each(|i| result[i] = result[i].max(a[i]));\n }\n\n // re-sort into the original order\n let mut result = result\n .into_iter()\n .zip(order.into_iter())\n .map(|(p, idx)| (p, idx))\n .collect::<Vec<_>>();\n result.sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.1.cmp(&b.1));\n let (result, _): (Vec<_>, Vec<_>) = result.iter().cloned().unzip();\n result\n}\n#[allow(clippy::cast_precision_loss)]\nfn p_value_correction(p_values: &[f64], ctype: &CorrectionType) -> Vec<f64> {\n let p_vec = p_values.to_vec();\n if p_values.is_empty() {\n return p_vec;\n }\n\n let fsize = p_values.len() as f64;\n\n match ctype {\n CorrectionType::BenjaminiHochberg => {\n let multiplier = (0..p_values.len())\n .map(|index| fsize / (fsize - index as f64))\n .collect::<Vec<_>>();\n\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\n }\n CorrectionType::BenjaminiYekutieli => {\n let q: f64 = (1..=p_values.len()).map(|index| 1. / index as f64).sum();\n let multiplier = (0..p_values.len())\n .map(|index| q * fsize / (fsize - index as f64))\n .collect::<Vec<_>>();\n\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\n }\n CorrectionType::Bonferroni => p_vec\n .iter()\n .map(|p| f64::min(p * fsize, 1.0))\n .collect::<Vec<_>>(),\n CorrectionType::Hochberg => {\n let multiplier = (0..p_values.len())\n .map(|index| 1. + index as f64)\n .collect::<Vec<_>>();\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\n }\n CorrectionType::Holm => {\n let multiplier = (0..p_values.len())\n .map(|index| fsize - index as f64)\n .collect::<Vec<_>>();\n\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Decreasing)\n }\n CorrectionType::Sidak => p_vec\n .iter()\n .map(|x| 1. - (1. - x).powf(fsize))\n .collect::<Vec<_>>(),\n CorrectionType::Hommel => hommel(&p_vec),\n }\n}\n\n// prints array into a nice table, max 5 floats/row\nfn array_to_string(a: &[f64]) -> String {\n a.chunks(5)\n .enumerate()\n .map(|(index, e)| {\n format!(\n \"[{:>2}]: {}\",\n index * 5,\n e.iter()\n .map(|x| format!(\"{:>1.10}\", x))\n .collect::<Vec<_>>()\n .join(\", \")\n )\n })\n .collect::<Vec<_>>()\n .join(\"\\n\")\n}\nfn main() {\n let ctypes = [\n CorrectionType::BenjaminiHochberg,\n CorrectionType::BenjaminiYekutieli,\n CorrectionType::Bonferroni,\n CorrectionType::Hochberg,\n CorrectionType::Holm,\n CorrectionType::Sidak,\n CorrectionType::Hommel,\n ];\n\n for ctype in &ctypes {\n println!(\"\\n{:?}:\", ctype);\n println!(\"{}\", array_to_string(&p_value_correction(&PVALUES, ctype)));\n }\n}\n","language":"Rust"},{"code":"data pvalues;\ninput raw_p @@;\ncards;\n4.533744e-01 7.296024e-01 9.936026e-02 9.079658e-02 1.801962e-01\n8.752257e-01 2.922222e-01 9.115421e-01 4.355806e-01 5.324867e-01\n4.926798e-01 5.802978e-01 3.485442e-01 7.883130e-01 2.729308e-01\n8.502518e-01 4.268138e-01 6.442008e-01 3.030266e-01 5.001555e-02\n3.194810e-01 7.892933e-01 9.991834e-01 1.745691e-01 9.037516e-01\n1.198578e-01 3.966083e-01 1.403837e-02 7.328671e-01 6.793476e-02\n4.040730e-03 3.033349e-04 1.125147e-02 2.375072e-02 5.818542e-04\n3.075482e-04 8.251272e-03 1.356534e-03 1.360696e-02 3.764588e-04\n1.801145e-05 2.504456e-07 3.310253e-02 9.427839e-03 8.791153e-04\n2.177831e-04 9.693054e-04 6.610250e-05 2.900813e-02 5.735490e-03\n;\nrun;\n\nproc multtest pdata=pvalues bon sid hom hoc holm;\nrun;\n","language":"SAS"},{"code":"ssc install qqvalue\n","language":"Stata"},{"code":"clear\n\n#delimit ;\ninput p;\n4.533744e-01;7.296024e-01;9.936026e-02;9.079658e-02;1.801962e-01;\n8.752257e-01;2.922222e-01;9.115421e-01;4.355806e-01;5.324867e-01;\n4.926798e-01;5.802978e-01;3.485442e-01;7.883130e-01;2.729308e-01;\n8.502518e-01;4.268138e-01;6.442008e-01;3.030266e-01;5.001555e-02;\n3.194810e-01;7.892933e-01;9.991834e-01;1.745691e-01;9.037516e-01;\n1.198578e-01;3.966083e-01;1.403837e-02;7.328671e-01;6.793476e-02;\n4.040730e-03;3.033349e-04;1.125147e-02;2.375072e-02;5.818542e-04;\n3.075482e-04;8.251272e-03;1.356534e-03;1.360696e-02;3.764588e-04;\n1.801145e-05;2.504456e-07;3.310253e-02;9.427839e-03;8.791153e-04;\n2.177831e-04;9.693054e-04;6.610250e-05;2.900813e-02;5.735490e-03;\nend;\n#delimit cr\n\nloc meth bonferroni sidak holm holland hochberg simes yekutieli\nforeach m in `meth' {\n\tqqvalue p, method(`m') qvalue(`m')\n}\n\nlist\n","language":"Stata"},{"code":"import \"./dynamic\" for Enum\nimport \"./fmt\" for Fmt\nimport \"./seq\" for Lst\nimport \"./math\" for Nums\nimport \"./sort\" for Sort\n\nvar Direction = Enum.create(\"Direction\", [\"UP\", \"DOWN\"])\n\n// test also for 'Unknown' correction type\nvar types = [\n \"Benjamini-Hochberg\", \"Benjamini-Yekutieli\", \"Bonferroni\", \"Hochberg\",\n \"Holm\", \"Hommel\", \"Šidák\", \"Unknown\"\n]\n\nvar pFormat = Fn.new { |p, cols|\n var i = -cols\n var fmt = \"$1.10f\"\n return Lst.chunks(p, cols).map { |chunk|\n i = i + cols\n return Fmt.swrite(\"[$2d $s\", i, chunk.map { |v| Fmt.swrite(fmt, v) }.join(\" \"))\n }.join(\"\\n\")\n}\n\nvar check = Fn.new { |p|\n if (p.count == 0 || Nums.min(p) < 0 || Nums.max(p) > 1) {\n Fiber.abort(\"p-values must be in range 0 to 1\")\n }\n return p\n}\n\nvar ratchet = Fn.new { |p, dir|\n var pp = p.toList\n var m = pp[0]\n if (dir == Direction.UP) {\n for (i in 1...pp.count) {\n if (pp[i] > m) pp[i] = m\n m = pp[i]\n }\n } else {\n for (i in 1...pp.count) {\n if (pp[i] < m) pp[i] = m\n m = pp[i]\n }\n }\n return pp.map { |v| (v < 1) ? v : 1 }.toList\n}\n\nvar schwartzian = Fn.new { |p, mult, dir|\n var size = p.count\n var pwi = List.filled(size, null)\n for (i in 0...size) pwi[i] = [i, p[i]]\n var cmp = (dir == Direction.UP) ? Fn.new { |a, b| (b[1] - a[1]).sign } :\n Fn.new { |a, b| (a[1] - b[1]).sign }\n var order = Sort.merge(pwi, cmp).map { |e| e[0] }.toList\n var pa = List.filled(size, 0)\n for (i in 0...size) pa[i] = mult[i] * p[order[i]]\n pa = ratchet.call(pa, dir)\n var owi = List.filled(order.count, null)\n for (i in 0...order.count) owi[i] = [i, order[i]]\n cmp = Fn.new { |a, b| (a[1] - b[1]).sign }\n var order2 = Sort.merge(owi, cmp).map { |e| e[0] }.toList\n var res = List.filled(size, 0)\n for (i in 0...size) res[i] = pa[order2[i]]\n return res\n}\n\nvar adjust = Fn.new { |p, type|\n var size = p.count\n if (size == 0) Fiber.abort(\"List cannot be empty.\")\n if (type == \"Benjamini-Hochberg\") {\n var mult = List.filled(size, 0)\n for (i in 0...size) mult[i] = size / (size - i)\n return schwartzian.call(p, mult, Direction.UP)\n\n } else if (type == \"Benjamini-Yekutieli\") {\n var q = (1..size).reduce { |acc, i| acc + 1/i }\n var mult = List.filled(size, 0)\n for (i in 0...size) mult[i] = q * size / (size - i)\n return schwartzian.call(p, mult, Direction.UP)\n\n } else if (type == \"Bonferroni\") {\n return p.map { |v| (v * size).min(1) }.toList\n\n } else if (type == \"Hochberg\") {\n var mult = List.filled(size, 0)\n for (i in 0...size) mult[i] = i + 1\n return schwartzian.call(p, mult, Direction.UP)\n\n } else if (type == \"Holm\") {\n var mult = List.filled(size, 0)\n for (i in 0...size) mult[i] = size - i\n return schwartzian.call(p, mult, Direction.DOWN)\n\n } else if (type == \"Hommel\") {\n var pwi = List.filled(size, null)\n for (i in 0...size) pwi[i] = [i, p[i]]\n var cmp = Fn.new { |a, b| (a[1] - b[1]).sign }\n var order = Sort.merge(pwi, cmp).map { |e| e[0] }.toList\n var s = List.filled(size, 0)\n for (i in 0...size) s[i] = p[order[i]]\n var m = List.filled(size, 0)\n for (i in 0...size) m[i] = s[i] * size / (i + 1)\n var min = Nums.min(m)\n var q = List.filled(size, min)\n var pa = List.filled(size, min)\n for (j in size-1..2) {\n var lower = List.filled(size - j + 1, 0) // lower indices\n for (i in 0...lower.count) lower[i] = i\n var upper = List.filled(j - 1, 0) // upper indices\n for (i in 0...upper.count) upper[i] = size - j + 1 + i\n var qmin = j * s[upper[0]] / 2\n for (i in 1...upper.count) {\n var temp = s[upper[i]] * j / (2 + i)\n if (temp < qmin) qmin = temp\n }\n for (i in 0...lower.count) {\n q[lower[i]] = qmin.min(s[lower[i]] * j)\n }\n for (i in 0...upper.count) q[upper[i]] = q[size - j]\n for (i in 0...size) if (pa[i] < q[i]) pa[i] = q[i]\n }\n var owi = List.filled(order.count, null)\n for (i in 0...order.count) owi[i] = [i, order[i]]\n var order2 = Sort.merge(owi, cmp).map { |e| e[0] }.toList\n var res = List.filled(size, 0)\n for (i in 0...size) res[i] = pa[order2[i]]\n return res\n\n } else if (type == \"Šidák\") {\n return p.map { |v| 1 - (1 - v).pow(size) }.toList\n\n } else {\n System.print(\"\\nSorry, do not know how to do '%(type)' correction.\\n\" +\n \"Perhaps you want one of these?:\\n\" +\n types[0...-1].map { |t| \" %(t)\" }.join(\"\\n\")\n )\n Fiber.suspend()\n }\n}\n\nvar adjusted = Fn.new { |p, type| \"\\n%(type)\\n%(pFormat.call(adjust.call(check.call(p), type), 5))\" }\n\nvar pValues = [\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\n]\ntypes.each { |type| System.print(adjusted.call(pValues, type)) }\n","language":"Wren"},{"code":"fcn bh(pvalues){\t// Benjamini-Hochberg\n psz,pszf := pvalues.len(), psz.toFloat();\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\n in\t := psz.pump(List,'wrap(n){ n_i[n]*pvalues[o[n]] });\n pmin := cummin(in).apply((1.0).min); # (min(1,c[0]),min(1,c[1]),...)\n ro.apply(pmin.get);\t\t# (pmin[ro[0]],pmin[ro[1]],...)\n}\n\nfcn by(pvalues){\t// Benjamini & Yekutieli\n psz,pszf := pvalues.len(), psz.toFloat();\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\n q\t := [1..psz].reduce(fcn(q,n){ q+=1.0/n },0.0);\n in\t := psz.pump(List,'wrap(n){ q * n_i[n] * pvalues[o[n]] });\n cummin(in).apply((1.0).min) : ro.apply(_.get);\n}\n\nfcn hochberg(pvalues){\n psz,pszf := pvalues.len(), psz.toFloat();\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\n in\t := psz.pump(List,'wrap(n){ pvalues[o[n]]*(n + 1) });\n cummin(in).apply((1.0).min) : ro.apply(_.get);\n}\n\nfcn cummin(pvalues){ // R's cumulative minima --> list of mins\n out,m := List.createLong(pvalues.len()), pvalues[0];\n foreach pv in (pvalues){ out.append(m=m.min(pv)) }\n out\n}\nfcn order(list,downUp){ // True==increasing, --> List(int) sorted indices\n f:=(downUp) and fcn(a,b){ a[1]>b[1] } or fcn(a,b){ a[1]<b[1] };\n [0..].zip(list).pump(List()).sort(f).pump(List,T(\"get\",0))\n}\n\nfcn bonferroni(pvalues){ // -->List\n sz,r := pvalues.len(),List();\n foreach pv in (pvalues){\n b:=pv*sz;\n if(b>=1.0) r.append(1.0);\n else if(0.0<=b<1.0) r.append(b);\n else throw(Exception.ValueError(\n\t \"%g is outside of the interval I planned.\".fmt(b)));\n }\n r\n}\n\nfcn hommel(pvalues){\n psz,indices := pvalues.len(), [1..psz].walk();\t// 1,2,3,4...\n o,ro := order(pvalues,False),order(o,False); # sort pvalues, sort indices\n p := o.apply('wrap(n){ pvalues[n] }).copy(); // pvalues[*o]\n npi := [1..].zip(p).apply('wrap([(n,p)]){ p*psz/n });\n min\t := (0.0).min(npi);\t // min value in npi\n pa,q\t := List.createLong(psz,min), pa.copy(); #(min,min,,,)\n foreach j in ([psz - 1..2,-1]){\n ij:=[0..psz - j].walk();\n i2:=(j - 1).pump(List,'+(psz - j + 1));\n q1:=(0.0).min((j-1).pump(List,'wrap(n){ p[i2[n]]*j/(2 + n) }));\n foreach i in (psz - j + 1){ q[ij[i]] = q1.min(p[ij[i]]*j) }\n foreach i in (j - 1){ q[i2[i]] = q[psz - j] }\n foreach i in (psz){ pa[i] = pa[i].max(q[i]) }\n }\n psz.pump(List,'wrap(n){ pa[ro[n]] }); // Hommel q-values\n}\n","language":"Zkl"},{"code":"pvalues:=T(\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03);\n\nbh(pvalues)\t : format(_,\"\\nBenjamini-Hochberg\");\nby(pvalues)\t : format(_,\"\\nBenjamini & Yekutieli\");\nbonferroni(pvalues) : format(_,\"\\nBonferroni\");\nhochberg(pvalues) : format(_,\"\\nHochberg\");\nhommel(pvalues)\t : format(_,\"\\nHommel\");\n\nfcn format(list,title){\n print(title,\":\");\n foreach n in ([1..list.len(),5]){\n print(\"\\n[%2d]:\".fmt(n));\n foreach x in (list[n-1,5]){ print(\" %.6e\".fmt(x)) }\n }\n println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/P-value_correction\\nnote: Probability and statistics\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Given a list of [[wp:p-value|p-values]], adjust the p-values for multiple comparisons. This is done in order to control the false positive, or Type 1 error rate. \\n\\nThis is also known as the \\\"[[wp:False discovery rate|false discovery rate]]\\\" (FDR). After adjustment, the p-values will be higher but still inside [0,1]. \\n\\nThe adjusted p-values are sometimes called \\\"q-values\\\".\\n\\n\\n;Task:\\nGiven one list of [[Welch's_t-test|p-values]], return the p-values correcting for multiple comparisons\\n\\n p = {4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03}\\n\\n\\nThere are several methods to do this, see:\\n* Yoav Benjamini, Yosef Hochberg \\\"[http://www.math.tau.ac.il/~ybenja/MyPapers/benjamini_hochberg1995.pdf Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple Testing]\\\", ''Journal of the Royal Statistical Society. Series B'', Vol. 57, No. 1 (1995), pp. 289-300, JSTOR:[http://www.jstor.org/stable/2346101 2346101]\\n* Yoav Benjamini, Daniel Yekutieli, \\\"[http://www.math.tau.ac.il/~ybenja/MyPapers/benjamini_yekutieli_ANNSTAT2001.pdf The control of the false discovery rate in multiple testing under dependency]\\\", ''Ann. Statist.'', Vol. 29, No. 4 (2001), pp. 1165-1188, DOI:[https://doi.org/10.1214/aos/1013699998 10.1214/aos/1013699998] JSTOR:[http://www.jstor.org/stable/2674075 2674075]\\n* Sture Holm, \\\"A Simple Sequentially Rejective Multiple Test Procedure\\\", ''Scandinavian Journal of Statistics'', Vol. 6, No. 2 (1979), pp. 65-70, JSTOR:[https://www.jstor.org/stable/4615733 4615733]\\n* Yosef Hochberg, \\\"A sharper Bonferroni procedure for multiple tests of significance\\\", ''Biometrika'', Vol. 75, No. 4 (1988), pp 800–802, DOI:[https://doi.org/10.1093/biomet/75.4.800 10.1093/biomet/75.4.800] JSTOR:[https://www.jstor.org/stable/2336325 2336325]\\n* Gerhard Hommel, \\\"A stagewise rejective multiple test procedure based on a modified Bonferroni test\\\", ''Biometrika'', Vol. 75, No. 2 (1988), pp 383–386, DOI:[https://doi.org/10.1093/biomet/75.2.383 10.1093/biomet/75.2.383] JSTOR:[https://www.jstor.org/stable/2336190 2336190]\\n\\n\\nEach method has its own advantages and disadvantages. \\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <stdio.h>//printf\\n#include <stdlib.h>//qsort\\n#include <math.h>//fabs\\n#include <stdbool.h>//bool data type\\n#include <strings.h>//strcasecmp\\n#include <assert.h>//assert, necessary for random integer selection\\n\\nunsigned int * seq_len(const unsigned int START, const unsigned int END) {\\n//named after R function of same name, but simpler function\\n\\tunsigned start = (unsigned)START;\\n\\tunsigned end = (unsigned)END;\\n\\tif (START == END) {\\n\\t\\tunsigned int *restrict sequence = malloc( (end+1) * sizeof(unsigned int));\\n\\t\\tif (sequence == NULL) {\\n\\t\\t\\tprintf(\\\"malloc failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t\\tfor (unsigned i = 0; i < end; i++) {\\n\\t\\t\\tsequence[i] = i+1;\\n\\t\\t}\\n\\t\\treturn sequence;\\n\\t}\\n\\tif (START > END) {\\n\\t\\tend = (unsigned)START;\\n\\t\\tstart = (unsigned)END;\\n\\t}\\n\\tconst unsigned LENGTH = end - start ;\\n\\tunsigned int *restrict sequence = malloc( (1+LENGTH) * sizeof(unsigned int));\\n\\tif (sequence == NULL) {\\n\\t\\tprintf(\\\"malloc failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\tperror(\\\"\\\");\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tif (START < END) {\\n\\t\\tfor (unsigned index = 0; index <= LENGTH; index++) {\\n\\t\\t\\tsequence[index] = start + index;\\n\\t\\t}\\n\\t} else {\\n\\t\\tfor (unsigned index = 0; index <= LENGTH; index++) {\\n\\t\\t\\tsequence[index] = end - index;\\n\\t\\t}\\n\\t}\\n\\treturn sequence;\\n}\\n\\n//modified from https://phoxis.org/2012/07/12/get-sorted-index-orderting-of-an-array/\\n\\ndouble *restrict base_arr = NULL;\\n\\nstatic int compar_increase (const void *restrict a, const void *restrict b) {\\n\\tint aa = *((int *restrict ) a), bb = *((int *restrict) b);\\n\\tif (base_arr[aa] < base_arr[bb]) {\\n\\t\\treturn 1;\\n\\t} else if (base_arr[aa] == base_arr[bb]) {\\n\\t\\treturn 0;\\n\\t} else {\\n\\t\\treturn -1;\\n\\t}\\n}\\n\\nstatic int compar_decrease (const void *restrict a, const void *restrict b) {\\n\\tint aa = *((int *restrict ) a), bb = *((int *restrict) b);\\n\\tif (base_arr[aa] < base_arr[bb]) {\\n\\t\\treturn -1;\\n\\t} else if (base_arr[aa] == base_arr[bb]) {\\n\\t\\treturn 0;\\n\\t} else {\\n\\t\\treturn 1;\\n\\t}\\n}\\n\\nunsigned int * order (const double *restrict ARRAY, const unsigned int SIZE, const bool DECREASING) {\\n//this has the same name as the same R function\\n\\tunsigned int *restrict idx = malloc(SIZE * sizeof(unsigned int));\\n\\tif (idx == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tbase_arr = malloc(sizeof(double) * SIZE);\\n\\tif (base_arr == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tfor (unsigned int i = 0; i < SIZE; i++) {\\n\\t\\tbase_arr[i] = ARRAY[i];\\n\\t\\tidx[i] = i;\\n\\t}\\n\\tif (DECREASING == false) {\\n\\t\\tqsort(idx, SIZE, sizeof(unsigned int), compar_decrease);\\n\\t} else if (DECREASING == true) {\\n\\t\\tqsort(idx, SIZE, sizeof(unsigned int), compar_increase);\\n\\t}\\n\\tfree(base_arr); base_arr = NULL;\\n\\treturn idx;\\n}\\n\\ndouble * cummin(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\\n//this takes the same name of the R function which it copies\\n//this requires a free() afterward where it is used\\n\\tif (NO_OF_ARRAY_ELEMENTS < 1) {\\n\\t\\tputs(\\\"cummin function requires at least one element.\\\\n\\\");\\n\\t\\tprintf(\\\"Failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble *restrict output = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\tif (output == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble cumulative_min = ARRAY[0];\\n\\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {\\n\\t\\tif (ARRAY[i] < cumulative_min) {\\n\\t\\t\\tcumulative_min = ARRAY[i];\\n\\t\\t}\\n\\t\\toutput[i] = cumulative_min;\\n\\t}\\n\\treturn output;\\n}\\n\\ndouble * cummax(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\\n//this takes the same name of the R function which it copies\\n//this requires a free() afterward where it is used\\n\\tif (NO_OF_ARRAY_ELEMENTS < 1) {\\n\\t\\tputs(\\\"function requires at least one element.\\\\n\\\");\\n\\t\\tprintf(\\\"Failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble *restrict output = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\tif (output == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble cumulative_max = ARRAY[0];\\n\\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {\\n\\t\\tif (ARRAY[i] > cumulative_max) {\\n\\t\\t\\tcumulative_max = ARRAY[i];\\n\\t\\t}\\n\\t\\toutput[i] = cumulative_max;\\n\\t}\\n\\treturn output;\\n}\\n\\ndouble * pminx(const double *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS, const double X) {\\n//named after the R function pmin\\n\\tif (NO_OF_ARRAY_ELEMENTS < 1) {\\n\\t\\tputs(\\\"pmin requires at least one element.\\\\n\\\");\\n\\t\\tprintf(\\\"Failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble *restrict pmin_array = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\tif (pmin_array == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\tif (ARRAY[index] < X) {\\n\\t\\t\\tpmin_array[index] = ARRAY[index];\\n\\t\\t} else {\\n\\t\\t\\tpmin_array[index] = X;\\n\\t\\t}\\n\\t}\\n\\treturn pmin_array;\\n}\\n\\nvoid double_say (const double *restrict ARRAY, const size_t NO_OF_ARRAY_ELEMENTS) {\\n\\tprintf(\\\"[1] %e\\\", ARRAY[0]);\\n\\tfor (unsigned int i = 1; i < NO_OF_ARRAY_ELEMENTS; i++) {\\n\\t\\tprintf(\\\" %.10f\\\", ARRAY[i]);\\n\\t\\tif (((i+1) % 5) == 0) {\\n\\t\\t\\tprintf(\\\"\\\\n[%u]\\\", i+1);\\n\\t\\t}\\n\\t}\\n\\tputs(\\\"\\\\n\\\");\\n}\\n\\n/*void uint_say (const unsigned int *restrict ARRAY, const size_t NO_OF_ARRAY_ELEMENTS) {\\n//for debugging\\n\\tprintf(\\\"%u\\\", ARRAY[0]);\\n\\tfor (size_t i = 1; i < NO_OF_ARRAY_ELEMENTS; i++) {\\n\\t\\tprintf(\\\",%u\\\", ARRAY[i]);\\n\\t}\\n\\tputs(\\\"\\\\n\\\");\\n}*/\\n\\ndouble * uint2double (const unsigned int *restrict ARRAY, const unsigned int NO_OF_ARRAY_ELEMENTS) {\\n\\tdouble *restrict doubleArray = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\tif (doubleArray == NULL) {\\n\\t\\tprintf(\\\"Failure to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\tperror(\\\"\\\");\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\tdoubleArray[index] = (double)ARRAY[index];\\n\\t}\\n\\treturn doubleArray;\\n}\\n\\ndouble min2 (const double N1, const double N2) {\\n\\tif (N1 < N2) {\\n\\t\\treturn N1;\\n\\t} else {\\n\\t\\treturn N2;\\n\\t}\\n}\\n\\ndouble * p_adjust (const double *restrict PVALUES, const unsigned int NO_OF_ARRAY_ELEMENTS, const char *restrict STRING) {\\n//this function is a translation of R's p.adjust \\\"BH\\\" method\\n// i is always i[index] = NO_OF_ARRAY_ELEMENTS - index - 1\\n\\tif (NO_OF_ARRAY_ELEMENTS < 1) {\\n\\t\\tputs(\\\"p_adjust requires at least one element.\\\\n\\\");\\n\\t\\tprintf(\\\"Failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tshort int TYPE = -1;\\n\\tif (STRING == NULL) {\\n\\t\\tTYPE = 0;\\n\\t} else if (strcasecmp(STRING, \\\"BH\\\") == 0) {\\n\\t\\tTYPE = 0;\\n\\t} else if (strcasecmp(STRING, \\\"fdr\\\") == 0) {\\n\\t\\tTYPE = 0;\\n\\t} else if (strcasecmp(STRING, \\\"by\\\") == 0) {\\n\\t\\tTYPE = 1;\\n\\t} else if (strcasecmp(STRING, \\\"Bonferroni\\\") == 0) {\\n\\t\\tTYPE = 2;\\n\\t} else if (strcasecmp(STRING, \\\"hochberg\\\") == 0) {\\n\\t\\tTYPE = 3;\\n\\t} else if (strcasecmp(STRING, \\\"holm\\\") == 0) {\\n\\t\\tTYPE = 4;\\n\\t} else if (strcasecmp(STRING, \\\"hommel\\\") == 0) {\\n\\t\\tTYPE = 5;\\n\\t} else {\\n\\t\\tprintf(\\\"%s doesn't match any accepted FDR methods.\\\\n\\\", STRING);\\n\\t\\tprintf(\\\"Failed at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\texit(EXIT_FAILURE);\\n\\t}\\n//---------------------------------------------------------------------------\\n//---------------------------------------------------------------------------\\n\\tif (TYPE == 2) {//Bonferroni method\\n\\t\\tdouble *restrict bonferroni = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tif (bonferroni == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tconst double BONFERRONI = PVALUES[index] * NO_OF_ARRAY_ELEMENTS;\\n\\t\\t\\tif (BONFERRONI >= 1.0) {\\n\\t\\t\\t\\tbonferroni[index] = 1.0;\\n\\t\\t\\t} else if ((0.0 <= BONFERRONI) && (BONFERRONI < 1.0)) {\\n\\t\\t\\t\\tbonferroni[index] = BONFERRONI;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprintf(\\\"%g is outside of the interval I planned.\\\\n\\\", BONFERRONI);\\n\\t\\t\\t\\tprintf(\\\"Failure at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn bonferroni;\\n//---------------------------------------------------------------------------\\n//---------------------------------------------------------------------------\\n\\t} else if (TYPE == 4) {//Holm method\\n/*these values are computed separately from BH, BY, and Hochberg because they are\\ncomputed differently*/\\n\\t\\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, false);\\n//sorted in reverse of methods 0-3\\n\\t\\tdouble *restrict o2double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\\n\\t\\tdouble *restrict cummax_input = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tfor (unsigned index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tcummax_input[index] = (NO_OF_ARRAY_ELEMENTS - index ) * (double)PVALUES[o[index]];\\n//\\t\\t\\tprintf(\\\"cummax_input[%zu] = %e\\\\n\\\", index, cummax_input[index]);\\n\\t\\t}\\n\\t\\tfree(o); o = NULL;\\n\\t\\tunsigned int *restrict ro = order(o2double, NO_OF_ARRAY_ELEMENTS, false);\\n\\t\\tfree(o2double); o2double = NULL;\\n\\n\\t\\tdouble *restrict cummax_output = cummax(cummax_input, NO_OF_ARRAY_ELEMENTS);\\n\\t\\tfree(cummax_input); cummax_input = NULL;\\n\\n\\t\\tdouble *restrict pmin = pminx(cummax_output, NO_OF_ARRAY_ELEMENTS, 1);\\n\\t\\tfree(cummax_output); cummax_output = NULL;\\n\\t\\tdouble *restrict qvalues = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tqvalues[index] = pmin[ro[index]];\\n\\t\\t}\\n\\t\\tfree(pmin); pmin = NULL;\\n\\t\\tfree(ro); ro = NULL;\\n\\t\\treturn qvalues;\\n//---------------------------------------------------------------------------\\n//---------------------------------------------------------------------------\\n\\t} else if (TYPE == 5) {//Hommel method\\n//i <- seq_len(n)\\n//o <- order(p)\\n\\t\\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, false);//false is R's default\\n//p <- p[o]\\n\\t\\tdouble *restrict p = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tif (p == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tp[index] = PVALUES[o[index]];\\n\\t\\t}\\n//ro <- order(o)\\n\\t\\tdouble *restrict o2double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\\n\\t\\tfree(o); o = NULL;\\n\\t\\tunsigned int *restrict ro = order(o2double, NO_OF_ARRAY_ELEMENTS, false);\\n\\t\\tfree(o2double); o2double = NULL;\\n//\\t\\tputs(\\\"ro\\\");\\n//q <- pa <- rep.int(min(n * p/i), n)\\n\\t\\tdouble *restrict q = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tif (q == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t\\tdouble *restrict pa = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\t\\tif (pa == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t\\tdouble min = (double)NO_OF_ARRAY_ELEMENTS * p[0];\\n\\t\\tfor (unsigned index = 1; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tconst double TEMP = (double)NO_OF_ARRAY_ELEMENTS * p[index] / (double)(1+index);\\n\\t\\t\\tif (TEMP < min) {\\n\\t\\t\\t\\tmin = TEMP;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tpa[index] = min;\\n\\t\\t\\t q[index] = min;\\n\\t\\t}\\n//\\t\\tputs(\\\"q & pa\\\");\\n//\\t\\tdouble_say(q, NO_OF_ARRAY_ELEMENTS);\\n/*for (j in (n - 1):2) {\\n ij <- seq_len(n - j + 1)\\n i2 <- (n - j + 2):n\\n q1 <- min(j * p[i2]/(2:j))\\n q[ij] <- pmin(j * p[ij], q1)\\n q[i2] <- q[n - j + 1]\\n pa <- pmax(pa, q)\\n }\\n*/\\n\\t\\tfor (unsigned j = (NO_OF_ARRAY_ELEMENTS-1); j >= 2; j--) {\\n//\\t\\t\\tprintf(\\\"j = %zu\\\\n\\\", j);\\n\\t\\t\\tunsigned int *restrict ij = seq_len(0,NO_OF_ARRAY_ELEMENTS - j);\\n\\t\\t\\tconst size_t I2_LENGTH = j - 1;\\n\\t\\t\\tunsigned int *restrict i2 = malloc(I2_LENGTH * sizeof(unsigned int));\\n\\t\\t\\tfor (unsigned i = 0; i < I2_LENGTH; i++) {\\n\\t\\t\\t\\ti2[i] = NO_OF_ARRAY_ELEMENTS-j+2+i-1;\\n//R's indices are 1-based, C's are 0-based, I added the -1\\n\\t\\t\\t}\\n\\n\\t\\t\\tdouble q1 = (double)j * p[i2[0]] / 2.0;\\n\\t\\t\\tfor (unsigned int i = 1; i < I2_LENGTH; i++) {//loop through 2:j\\n\\t\\t\\t\\tconst double TEMP_Q1 = (double)j * p[i2[i]] / (double)(2 + i);\\n\\t\\t\\t\\tif (TEMP_Q1 < q1) {\\n\\t\\t\\t\\t\\tq1 = TEMP_Q1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (unsigned int i = 0; i < (NO_OF_ARRAY_ELEMENTS - j + 1); i++) {//q[ij] <- pmin(j * p[ij], q1)\\n\\t\\t\\t\\tq[ij[i]] = min2( (double)j*p[ij[i]], q1);\\n\\t\\t\\t}\\n\\t\\t\\tfree(ij); ij = NULL;\\n\\n\\t\\t\\tfor (unsigned int i = 0; i < I2_LENGTH; i++) {//q[i2] <- q[n - j + 1]\\n\\t\\t\\t\\tq[i2[i]] = q[NO_OF_ARRAY_ELEMENTS - j];//subtract 1 because of starting index difference\\n\\t\\t\\t}\\n\\t\\t\\tfree(i2); i2 = NULL;\\n\\n\\t\\t\\tfor (unsigned int i = 0; i < NO_OF_ARRAY_ELEMENTS; i++) {//pa <- pmax(pa, q)\\n\\t\\t\\t\\tif (pa[i] < q[i]) {\\n\\t\\t\\t\\t\\tpa[i] = q[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n//\\t\\t\\tprintf(\\\"j = %zu, pa = \\\\n\\\", j);\\n//\\t\\t\\t\\tdouble_say(pa, N);\\n\\t\\t}//end j loop\\n\\t\\tfree(p); p = NULL;\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tq[index] = pa[ro[index]];//Hommel q-values\\n\\t\\t}\\n//now free memory\\n\\t\\tfree(ro); ro = NULL;\\n\\t\\tfree(pa); pa = NULL;\\n\\t\\treturn q;\\n\\t}\\n//The methods are similarly computed and thus can be combined for clarity\\n\\tunsigned int *restrict o = order(PVALUES, NO_OF_ARRAY_ELEMENTS, true);\\n\\tif (o == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tdouble *restrict o_double = uint2double(o, NO_OF_ARRAY_ELEMENTS);\\n\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\tif ((PVALUES[index] < 0) || (PVALUES[index] > 1)) {\\n\\t\\t\\tprintf(\\\"array[%u] = %lf, which is outside the interval [0,1]\\\\n\\\", index, PVALUES[index]);\\n\\t\\t\\tprintf(\\\"died at %s line %u\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t\\t}\\n\\t}\\n\\n\\tunsigned int *restrict ro = order(o_double, NO_OF_ARRAY_ELEMENTS, false);\\n\\tif (ro == NULL) {\\n\\t\\t\\tprintf(\\\"failed to malloc at %s line %u.\\\\n\\\", __FILE__, __LINE__);\\n\\t\\t\\tperror(\\\"\\\");\\n\\t\\t\\texit(EXIT_FAILURE);\\n\\t}\\n\\tfree(o_double); o_double = NULL;\\n\\tdouble *restrict cummin_input = malloc(sizeof(double) * NO_OF_ARRAY_ELEMENTS);\\n\\tif (TYPE == 0) {//BH method\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tconst double NI = (double)NO_OF_ARRAY_ELEMENTS / (double)(NO_OF_ARRAY_ELEMENTS - index);// n/i simplified\\n\\t\\t\\tcummin_input[index] = NI * PVALUES[o[index]];//PVALUES[o[index]] is p[o]\\n\\t\\t}\\n\\t} else if (TYPE == 1) {//BY method\\n\\t\\tdouble q = 1.0;\\n\\t\\tfor (unsigned int index = 2; index < (1+NO_OF_ARRAY_ELEMENTS); index++) {\\n\\t\\t\\tq += 1.0/(double)index;\\n\\t\\t}\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\t\\tconst double NI = (double)NO_OF_ARRAY_ELEMENTS / (double)(NO_OF_ARRAY_ELEMENTS - index);// n/i simplified\\n\\t\\t\\tcummin_input[index] = q * NI * PVALUES[o[index]];//PVALUES[o[index]] is p[o]\\n\\t\\t}\\n\\t} else if (TYPE == 3) {//Hochberg method\\n\\t\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n// pmin(1, cummin((n - i + 1L) * p[o]))[ro]\\n\\t\\t\\tcummin_input[index] = (double)(index + 1) * PVALUES[o[index]];\\n\\t\\t}\\n\\t}\\n\\tfree(o); o = NULL;\\n\\tdouble *restrict cummin_array = NULL;\\n\\tcummin_array = cummin(cummin_input, NO_OF_ARRAY_ELEMENTS);\\n\\tfree(cummin_input); cummin_input = NULL;//I don't need this anymore\\n\\tdouble *restrict pmin = pminx(cummin_array, NO_OF_ARRAY_ELEMENTS, 1);\\n\\tfree(cummin_array); cummin_array = NULL;\\n\\tdouble *restrict q_array = malloc(NO_OF_ARRAY_ELEMENTS*sizeof(double));\\n\\tfor (unsigned int index = 0; index < NO_OF_ARRAY_ELEMENTS; index++) {\\n\\t\\tq_array[index] = pmin[ro[index]];\\n\\t}\\n\\n\\tfree(ro); ro = NULL;\\n\\tfree(pmin); pmin = NULL;\\n\\treturn q_array;\\n}\\n\\n\\nint main(void) {\\n\\tconst double PVALUES[] = {4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03};//just the pvalues\\n\\tconst double CORRECT_ANSWERS[6][50] = {//each first index is type\\n\\t{6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02},//Benjamini-Hochberg\\n\\t{1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02},//Benjamini & Yekutieli\\n\\t{1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01},//Bonferroni\\n{9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01},//Hochberg\\n\\t{1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01},//Holm\\n{ 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01}//Hommel\\n\\t};\\n//the following loop checks each type with R's answers\\n\\tconst char *restrict TYPES[] = {\\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\"};\\n\\tfor (unsigned short int type = 0; type <= 5; type++) {\\n\\t\\tdouble *restrict q = p_adjust(PVALUES, sizeof(PVALUES) / sizeof(*PVALUES), TYPES[type]);\\n\\t\\tdouble error = fabs(q[0] - CORRECT_ANSWERS[type][0]);\\n//\\t\\tprintf(\\\"%e\\t-\\t%e\\t=\\t%g\\\\n\\\", q[0], CORRECT_ANSWERS[type][0], error);\\n\\t//\\tputs(\\\"p\\tq\\\");\\n\\t//\\tprintf(\\\"%g\\\\t%g\\\\n\\\", pvalues[0], q[0]);\\n\\t\\tfor (unsigned int i = 1; i < sizeof(PVALUES) / sizeof(*PVALUES); i++) {\\n\\t\\t\\tconst double this_error = fabs(q[i] - CORRECT_ANSWERS[type][i]);\\n//\\t\\t\\tprintf(\\\"%e\\t-\\t%e\\t=\\t%g\\\\n\\\", q[i], CORRECT_ANSWERS[type][i], error);\\n\\t\\t\\terror += this_error;\\n\\t\\t}\\n\\t\\tdouble_say(q, sizeof(PVALUES) / sizeof(*PVALUES));\\n\\t\\tfree(q); q = NULL;\\n\\t\\tprintf(\\\"\\\\ntype %u = '%s' has cumulative error of %g\\\\n\\\", type, TYPES[type], error);\\n\\t}\\n\\t\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n\\n#define SIZE 50\\n#define each_i(start, end) for (i = start; i < end; ++i)\\n\\ntypedef enum { UP, DOWN } direction;\\n\\ntypedef struct { int index; double value; } iv1;\\n\\ntypedef struct { int index; int value; } iv2;\\n\\n/* test also for 'Unknown' correction type */\\nconst char *types[8] = {\\n \\\"Benjamini-Hochberg\\\", \\\"Benjamini-Yekutieli\\\", \\\"Bonferroni\\\", \\\"Hochberg\\\",\\n \\\"Holm\\\", \\\"Hommel\\\", \\\"Šidák\\\", \\\"Unknown\\\"\\n};\\n\\nint compare_iv1(const void *a, const void *b) {\\n double aa = ((iv1 *)a) -> value;\\n double bb = ((iv1 *)b) -> value;\\n if (aa > bb) return 1;\\n if (aa < bb) return -1;\\n return 0;\\n}\\n\\nint compare_iv1_desc(const void *a, const void *b) {\\n return -compare_iv1(a, b);\\n}\\n\\nint compare_iv2(const void *a, const void *b) {\\n return ((iv2 *)a) -> value - ((iv2 *)b) -> value;\\n}\\n\\nvoid ratchet(double *pa, direction dir) {\\n int i;\\n double m = pa[0];\\n if (dir == UP) {\\n each_i(1, SIZE) {\\n if (pa[i] > m) pa[i] = m;\\n m = pa[i];\\n }\\n }\\n else {\\n each_i(1, SIZE) {\\n if (pa[i] < m) pa[i] = m;\\n m = pa[i];\\n }\\n }\\n each_i(0, SIZE) if (pa[i] > 1.0) pa[i] = 1.0;\\n}\\n\\nvoid schwartzian(const double *p, double *pa, direction dir) {\\n int i;\\n int order[SIZE];\\n int order2[SIZE];\\n iv1 iv1s[SIZE];\\n iv2 iv2s[SIZE];\\n double pa2[SIZE];\\n each_i(0, SIZE) { iv1s[i].index = i; iv1s[i].value = p[i]; }\\n if (dir == UP)\\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1_desc);\\n else\\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1);\\n each_i(0, SIZE) order[i] = iv1s[i].index;\\n each_i(0, SIZE) pa[i] *= p[order[i]];\\n ratchet(pa, dir);\\n each_i(0, SIZE) { iv2s[i].index = i; iv2s[i].value = order[i]; }\\n qsort(iv2s, SIZE, sizeof(iv2s[0]), compare_iv2);\\n each_i(0, SIZE) order2[i] = iv2s[i].index;\\n each_i(0, SIZE) pa2[i] = pa[order2[i]];\\n each_i(0, SIZE) pa[i] = pa2[i];\\n}\\n\\nvoid adjust(const double *p, double *pa, const char *type) {\\n int i;\\n if (!strcmp(type, \\\"Benjamini-Hochberg\\\")) {\\n each_i(0, SIZE) pa[i] = (double)SIZE / (SIZE - i);\\n schwartzian(p, pa, UP);\\n }\\n else if (!strcmp(type, \\\"Benjamini-Yekutieli\\\")) {\\n double q = 0.0;\\n each_i(1, SIZE + 1) q += 1.0 / i;\\n each_i(0, SIZE) pa[i] = q * SIZE / (SIZE - i);\\n schwartzian(p, pa, UP);\\n }\\n else if (!strcmp(type, \\\"Bonferroni\\\")) {\\n each_i(0, SIZE) pa[i] = (p[i] * SIZE > 1.0) ? 1.0 : p[i] * SIZE;\\n }\\n else if (!strcmp(type, \\\"Hochberg\\\")) {\\n each_i(0, SIZE) pa[i] = i + 1.0;\\n schwartzian(p, pa, UP);\\n }\\n else if (!strcmp(type, \\\"Holm\\\")) {\\n each_i(0, SIZE) pa[i] = SIZE - i;\\n schwartzian(p, pa, DOWN);\\n }\\n else if (!strcmp(type, \\\"Hommel\\\")) {\\n int i, j;\\n int order[SIZE];\\n int order2[SIZE];\\n iv1 iv1s[SIZE];\\n iv2 iv2s[SIZE];\\n double s[SIZE];\\n double q[SIZE];\\n double pa2[SIZE];\\n int indices[SIZE];\\n each_i(0, SIZE) { iv1s[i].index = i; iv1s[i].value = p[i]; }\\n qsort(iv1s, SIZE, sizeof(iv1s[0]), compare_iv1);\\n each_i(0, SIZE) order[i] = iv1s[i].index;\\n each_i(0, SIZE) s[i] = p[order[i]];\\n double min = s[0] * SIZE;\\n each_i(1, SIZE) {\\n double temp = s[i] / (i + 1.0);\\n if (temp < min) min = temp;\\n }\\n each_i(0, SIZE) q[i] = min;\\n each_i(0, SIZE) pa2[i] = min;\\n for (j = SIZE - 1; j >= 2; --j) {\\n each_i(0, SIZE) indices[i] = i;\\n int upper_start = SIZE - j + 1; /* upper indices start index */\\n int upper_size = j - 1; /* size of upper indices */\\n int lower_size = SIZE - upper_size; /* size of lower indices */\\n double qmin = j * s[indices[upper_start]] / 2.0;\\n each_i(1, upper_size) {\\n double temp = s[indices[upper_start + i]] * j / (2.0 + i);\\n if (temp < qmin) qmin = temp;\\n }\\n each_i(0, lower_size) {\\n double temp = s[indices[i]] * j;\\n q[indices[i]] = (temp < qmin) ? temp : qmin;\\n }\\n each_i(0, upper_size) q[indices[upper_start + i]] = q[SIZE - j];\\n each_i(0, SIZE) if (pa2[i] < q[i]) pa2[i] = q[i];\\n }\\n each_i(0, SIZE) { iv2s[i].index = i; iv2s[i].value = order[i]; }\\n qsort(iv2s, SIZE, sizeof(iv2s[0]), compare_iv2);\\n each_i(0, SIZE) order2[i] = iv2s[i].index;\\n each_i(0, SIZE) pa[i] = pa2[order2[i]];\\n }\\n else if (!strcmp(type, \\\"Šidák\\\")) {\\n each_i(0, SIZE) pa[i] = 1.0 - pow(1.0 - p[i], SIZE);\\n }\\n else {\\n printf(\\\"\\\\nSorry, do not know how to do '%s' correction.\\\\n\\\", type);\\n printf(\\\"Perhaps you want one of these?:\\\\n\\\");\\n each_i(0, 7) printf(\\\" %s\\\\n\\\", types[i]);\\n exit(1);\\n }\\n}\\n\\nvoid adjusted(const double *p, const char *type) {\\n int i;\\n double pa[SIZE] = { 0.0 };\\n if (check(p)) {\\n adjust(p, pa, type);\\n printf(\\\"\\\\n%s\\\", type);\\n each_i(0, SIZE) {\\n if (!(i % 5)) printf(\\\"\\\\n[%2d] \\\", i);\\n printf(\\\"%1.10f \\\", pa[i]);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n else {\\n printf(\\\"p-values must be in range 0.0 to 1.0\\\\n\\\");\\n exit(1);\\n }\\n}\\n\\nint check(const double* p) {\\n int i;\\n each_i(0, SIZE) {\\n if (p[i] < 0.0 || p[i] > 1.0) return 0;\\n }\\n return 1;\\n}\\n\\nint main() {\\n int i;\\n double p_values[SIZE] = {\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n };\\n each_i(0, 8) adjusted(p_values, types[i]);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <functional>\\n#include <iostream>\\n#include <numeric>\\n#include <vector>\\n\\nstd::vector<int> seqLen(int start, int end) {\\n std::vector<int> result;\\n\\n if (start == end) {\\n result.resize(end + 1);\\n std::iota(result.begin(), result.end(), 1);\\n } else if (start < end) {\\n result.resize(end - start + 1);\\n std::iota(result.begin(), result.end(), start);\\n } else {\\n result.resize(start - end + 1);\\n std::iota(result.rbegin(), result.rend(), end);\\n }\\n\\n return result;\\n}\\n\\nstd::vector<int> order(const std::vector<double>& arr, bool decreasing) {\\n std::vector<int> idx(arr.size());\\n std::iota(idx.begin(), idx.end(), 0);\\n\\n std::function<bool(int, int)> cmp;\\n if (decreasing) {\\n cmp = [&arr](int a, int b) { return arr[b] < arr[a]; };\\n } else {\\n cmp = [&arr](int a, int b) { return arr[a] < arr[b]; };\\n }\\n\\n std::sort(idx.begin(), idx.end(), cmp);\\n return idx;\\n}\\n\\nstd::vector<double> cummin(const std::vector<double>& arr) {\\n if (arr.empty()) throw std::runtime_error(\\\"cummin requries at least one element\\\");\\n std::vector<double> output(arr.size());\\n double cumulativeMin = arr[0];\\n std::transform(arr.cbegin(), arr.cend(), output.begin(), [&cumulativeMin](double a) {\\n if (a < cumulativeMin) cumulativeMin = a;\\n return cumulativeMin;\\n });\\n return output;\\n}\\n\\nstd::vector<double> cummax(const std::vector<double>& arr) {\\n if (arr.empty()) throw std::runtime_error(\\\"cummax requries at least one element\\\");\\n std::vector<double> output(arr.size());\\n double cumulativeMax = arr[0];\\n std::transform(arr.cbegin(), arr.cend(), output.begin(), [&cumulativeMax](double a) {\\n if (cumulativeMax < a) cumulativeMax = a;\\n return cumulativeMax;\\n });\\n return output;\\n}\\n\\nstd::vector<double> pminx(const std::vector<double>& arr, double x) {\\n if (arr.empty()) throw std::runtime_error(\\\"pmin requries at least one element\\\");\\n std::vector<double> result(arr.size());\\n std::transform(arr.cbegin(), arr.cend(), result.begin(), [&x](double a) {\\n if (a < x) return a;\\n return x;\\n });\\n return result;\\n}\\n\\nvoid doubleSay(const std::vector<double>& arr) {\\n printf(\\\"[ 1] %.10f\\\", arr[0]);\\n for (size_t i = 1; i < arr.size(); ++i) {\\n printf(\\\" %.10f\\\", arr[i]);\\n if ((i + 1) % 5 == 0) printf(\\\"\\\\n[%2d]\\\", i + 1);\\n }\\n}\\n\\nstd::vector<double> pAdjust(const std::vector<double>& pvalues, const std::string& str) {\\n if (pvalues.empty()) throw std::runtime_error(\\\"pAdjust requires at least one element\\\");\\n size_t size = pvalues.size();\\n\\n int type;\\n if (\\\"bh\\\" == str || \\\"fdr\\\" == str) {\\n type = 0;\\n } else if (\\\"by\\\" == str) {\\n type = 1;\\n } else if (\\\"bonferroni\\\" == str) {\\n type = 2;\\n } else if (\\\"hochberg\\\" == str) {\\n type = 3;\\n } else if (\\\"holm\\\" == str) {\\n type = 4;\\n } else if (\\\"hommel\\\" == str) {\\n type = 5;\\n } else {\\n throw std::runtime_error(str + \\\" doesn't match any accepted FDR types\\\");\\n }\\n\\n // Bonferroni method\\n if (2 == type) {\\n std::vector<double> result(size);\\n for (size_t i = 0; i < size; ++i) {\\n double b = pvalues[i] * size;\\n if (b >= 1) {\\n result[i] = 1;\\n } else if (0 <= b && b < 1) {\\n result[i] = b;\\n } else {\\n throw std::runtime_error(\\\"a value is outside [0, 1)\\\");\\n }\\n }\\n return result;\\n }\\n // Holm method\\n else if (4 == type) {\\n auto o = order(pvalues, false);\\n std::vector<double> o2Double(o.begin(), o.end());\\n std::vector<double> cummaxInput(size);\\n for (size_t i = 0; i < size; ++i) {\\n cummaxInput[i] = (size - i) * pvalues[o[i]];\\n }\\n auto ro = order(o2Double, false);\\n auto cummaxOutput = cummax(cummaxInput);\\n auto pmin = pminx(cummaxOutput, 1.0);\\n std::vector<double> result(size);\\n std::transform(ro.cbegin(), ro.cend(), result.begin(), [&pmin](int a) { return pmin[a]; });\\n return result;\\n }\\n // Hommel\\n else if (5 == type) {\\n auto indices = seqLen(size, size);\\n auto o = order(pvalues, false);\\n std::vector<double> p(size);\\n std::transform(o.cbegin(), o.cend(), p.begin(), [&pvalues](int a) { return pvalues[a]; });\\n std::vector<double> o2Double(o.begin(), o.end());\\n auto ro = order(o2Double, false);\\n std::vector<double> q(size);\\n std::vector<double> pa(size);\\n std::vector<double> npi(size);\\n for (size_t i = 0; i < size; ++i) {\\n npi[i] = p[i] * size / indices[i];\\n }\\n double min = *std::min_element(npi.begin(), npi.end());\\n std::fill(q.begin(), q.end(), min);\\n std::fill(pa.begin(), pa.end(), min);\\n for (int j = size; j >= 2; --j) {\\n auto ij = seqLen(1, size - j + 1);\\n std::transform(ij.cbegin(), ij.cend(), ij.begin(), [](int a) { return a - 1; });\\n int i2Length = j - 1;\\n std::vector<int> i2(i2Length);\\n for (int i = 0; i < i2Length; ++i) {\\n i2[i] = size - j + 2 + i - 1;\\n }\\n double q1 = j * p[i2[0]] / 2.0;\\n for (int i = 1; i < i2Length; ++i) {\\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\\n if (temp_q1 < q1) q1 = temp_q1;\\n }\\n for (size_t i = 0; i < size - j + 1; ++i) {\\n q[ij[i]] = std::min(p[ij[i]] * j, q1);\\n }\\n for (int i = 0; i < i2Length; ++i) {\\n q[i2[i]] = q[size - j];\\n }\\n for (size_t i = 0; i < size; ++i) {\\n if (pa[i] < q[i]) {\\n pa[i] = q[i];\\n }\\n }\\n }\\n std::transform(ro.cbegin(), ro.cend(), q.begin(), [&pa](int a) { return pa[a]; });\\n return q;\\n }\\n\\n std::vector<double> ni(size);\\n std::vector<int> o = order(pvalues, true);\\n std::vector<double> od(o.begin(), o.end());\\n for (size_t i = 0; i < size; ++i) {\\n if (pvalues[i] < 0 || pvalues[i]>1) {\\n throw std::runtime_error(\\\"a value is outside [0, 1]\\\");\\n }\\n ni[i] = (double)size / (size - i);\\n }\\n auto ro = order(od, false);\\n std::vector<double> cumminInput(size);\\n if (0 == type) { // BH method\\n for (size_t i = 0; i < size; ++i) {\\n cumminInput[i] = ni[i] * pvalues[o[i]];\\n }\\n } else if (1 == type) { // BY method\\n double q = 0;\\n for (size_t i = 1; i < size + 1; ++i) {\\n q += 1.0 / i;\\n }\\n for (size_t i = 0; i < size; ++i) {\\n cumminInput[i] = q * ni[i] * pvalues[o[i]];\\n }\\n } else if (3 == type) { // Hochberg method\\n for (size_t i = 0; i < size; ++i) {\\n cumminInput[i] = (i + 1) * pvalues[o[i]];\\n }\\n }\\n auto cumminArray = cummin(cumminInput);\\n auto pmin = pminx(cumminArray, 1.0);\\n std::vector<double> result(size);\\n for (size_t i = 0; i < size; ++i) {\\n result[i] = pmin[ro[i]];\\n }\\n return result;\\n}\\n\\nint main() {\\n using namespace std;\\n\\n vector<double> pvalues{\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n };\\n\\n vector<vector<double>> correctAnswers{\\n // Benjamini-Hochberg\\n {\\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\\n },\\n // Benjamini & Yekutieli\\n {\\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\\n },\\n // Bonferroni\\n {\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\\n },\\n // Hochberg\\n {\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n // Holm\\n {\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n // Hommel\\n {\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\\n }\\n };\\n\\n vector<string> types{ \\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\" };\\n for (size_t type = 0; type < types.size(); ++type) {\\n auto q = pAdjust(pvalues, types[type]);\\n double error = 0.0;\\n for (size_t i = 0; i < pvalues.size(); ++i) {\\n error += abs(q[i] - correctAnswers[type][i]);\\n }\\n doubleSay(q);\\n printf(\\\"\\\\ntype = %d = '%s' has a cumulative error of %g\\\\n\\\\n\\\\n\\\", type, types[type].c_str(), error);\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nnamespace PValueCorrection {\\n class Program {\\n static List<int> SeqLen(int start, int end) {\\n var result = new List<int>();\\n if (start == end) {\\n for (int i = 0; i < end + 1; ++i) {\\n result.Add(i + 1);\\n }\\n } else if (start < end) {\\n for (int i = 0; i < end - start + 1; ++i) {\\n result.Add(start + i);\\n }\\n } else {\\n for (int i = 0; i < start - end + 1; ++i) {\\n result.Add(start - i);\\n }\\n }\\n return result;\\n }\\n\\n static List<int> Order(List<double> array, bool decreasing) {\\n List<int> idx = new List<int>();\\n for (int i = 0; i < array.Count; ++i) {\\n idx.Add(i);\\n }\\n\\n IComparer<int> cmp;\\n if (decreasing) {\\n cmp = Comparer<int>.Create((a, b) => array[a] < array[b] ? 1 : array[b] < array[a] ? -1 : 0);\\n } else {\\n cmp = Comparer<int>.Create((a, b) => array[b] < array[a] ? 1 : array[a] < array[b] ? -1 : 0);\\n }\\n\\n idx.Sort(cmp);\\n return idx;\\n }\\n\\n static List<double> Cummin(List<double> array) {\\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\\\"cummin requires at least one element\\\");\\n var output = new List<double>();\\n double cumulativeMin = array[0];\\n for (int i = 0; i < array.Count; ++i) {\\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\\n output.Add(cumulativeMin);\\n }\\n return output;\\n }\\n\\n static List<double> Cummax(List<double> array) {\\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\\\"cummax requires at least one element\\\");\\n var output = new List<double>();\\n double cumulativeMax = array[0];\\n for (int i = 0; i < array.Count; ++i) {\\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\\n output.Add(cumulativeMax);\\n }\\n return output;\\n }\\n\\n static List<double> Pminx(List<double> array, double x) {\\n if (array.Count < 1) throw new ArgumentOutOfRangeException(\\\"pmin requires at least one element\\\");\\n var result = new List<double>();\\n for (int i = 0; i < array.Count; ++i) {\\n if (array[i] < x) {\\n result.Add(array[i]);\\n } else {\\n result.Add(x);\\n }\\n }\\n return result;\\n }\\n\\n static void Say(List<double> array) {\\n Console.Write(\\\"[ 1] {0:E}\\\", array[0]);\\n for (int i = 1; i < array.Count; ++i) {\\n Console.Write(\\\" {0:E}\\\", array[i]);\\n if ((i + 1) % 5 == 0) Console.Write(\\\"\\\\n[{0,2}]\\\", i + 1);\\n }\\n Console.WriteLine();\\n }\\n\\n static List<double> PAdjust(List<double> pvalues, string str) {\\n var size = pvalues.Count;\\n if (size < 1) throw new ArgumentOutOfRangeException(\\\"pAdjust requires at least one element\\\");\\n\\n int type;\\n switch (str.ToLower()) {\\n case \\\"bh\\\":\\n case \\\"fdr\\\":\\n type = 0;\\n break;\\n case \\\"by\\\":\\n type = 1;\\n break;\\n case \\\"bonferroni\\\":\\n type = 2;\\n break;\\n case \\\"hochberg\\\":\\n type = 3;\\n break;\\n case \\\"holm\\\":\\n type = 4;\\n break;\\n case \\\"hommel\\\":\\n type = 5;\\n break;\\n default:\\n throw new ArgumentException(str + \\\" doesn't match any accepted FDR types\\\");\\n }\\n\\n if (2 == type) { // Bonferroni method\\n var result2 = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n double b = pvalues[i] * size;\\n if (b >= 1) {\\n result2.Add(1);\\n } else if (0 <= b && b < 1) {\\n result2.Add(b);\\n } else {\\n throw new Exception(b + \\\" is outside [0, 1)\\\");\\n }\\n }\\n return result2;\\n } else if (4 == type) { // Holm method\\n var o4 = Order(pvalues, false);\\n var o4d = o4.ConvertAll(x => (double)x);\\n var cummaxInput = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n cummaxInput.Add((size - i) * pvalues[o4[i]]);\\n }\\n var ro4 = Order(o4d, false);\\n var cummaxOutput = Cummax(cummaxInput);\\n var pmin4 = Pminx(cummaxOutput, 1.0);\\n var hr = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n hr.Add(pmin4[ro4[i]]);\\n }\\n return hr;\\n } else if (5 == type) { // Hommel method\\n var indices = SeqLen(size, size);\\n var o5 = Order(pvalues, false);\\n var p = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n p.Add(pvalues[o5[i]]);\\n }\\n var o5d = o5.ConvertAll(x => (double)x);\\n var ro5 = Order(o5d, false);\\n var q = new List<double>();\\n var pa = new List<double>();\\n var npi = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n npi.Add(p[i] * size / indices[i]);\\n }\\n double min = npi.Min();\\n q.AddRange(Enumerable.Repeat(min, size));\\n pa.AddRange(Enumerable.Repeat(min, size));\\n for (int j = size; j >= 2; --j) {\\n var ij = SeqLen(1, size - j + 1);\\n for (int i = 0; i < size - j + 1; ++i) {\\n ij[i]--;\\n }\\n int i2Length = j - 1;\\n var i2 = new List<int>();\\n for (int i = 0; i < i2Length; ++i) {\\n i2.Add(size - j + 2 + i - 1);\\n }\\n double q1 = j * p[i2[0]] / 2.0;\\n for (int i = 1; i < i2Length; ++i) {\\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\\n if (temp_q1 < q1) q1 = temp_q1;\\n }\\n for (int i = 0; i < size - j + 1; ++i) {\\n q[ij[i]] = Math.Min(p[ij[i]] * j, q1);\\n }\\n for (int i = 0; i < i2Length; ++i) {\\n q[i2[i]] = q[size - j];\\n }\\n for (int i = 0; i < size; ++i) {\\n if (pa[i] < q[i]) {\\n pa[i] = q[i];\\n }\\n }\\n }\\n for (int i = 0; i < size; ++i) {\\n q[i] = pa[ro5[i]];\\n }\\n return q;\\n }\\n\\n var ni = new List<double>();\\n var o = Order(pvalues, true);\\n var od = o.ConvertAll(x => (double)x);\\n for (int i = 0; i < size; ++i) {\\n if (pvalues[i] < 0 || pvalues[i] > 1) {\\n throw new Exception(\\\"array[\\\" + i + \\\"] = \\\" + pvalues[i] + \\\" is outside [0, 1]\\\");\\n }\\n ni.Add((double)size / (size - i));\\n }\\n var ro = Order(od, false);\\n var cumminInput = new List<double>();\\n if (0 == type) { // BH method\\n for (int i = 0; i < size; ++i) {\\n cumminInput.Add(ni[i] * pvalues[o[i]]);\\n }\\n } else if (1 == type) { // BY method\\n double q = 0;\\n for (int i = 1; i < size + 1; ++i) {\\n q += 1.0 / i;\\n }\\n for (int i = 0; i < size; ++i) {\\n cumminInput.Add(q * ni[i] * pvalues[o[i]]);\\n }\\n } else if (3 == type) { // Hochberg method\\n for (int i = 0; i < size; ++i) {\\n cumminInput.Add((i + 1) * pvalues[o[i]]);\\n }\\n }\\n var cumminArray = Cummin(cumminInput);\\n var pmin = Pminx(cumminArray, 1.0);\\n var result = new List<double>();\\n for (int i = 0; i < size; ++i) {\\n result.Add(pmin[ro[i]]);\\n }\\n return result;\\n }\\n\\n static void Main(string[] args) {\\n var pvalues = new List<double> {\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n };\\n var correctAnswers = new List<List<double>> {\\n new List<double> { // Benjamini-Hochberg\\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\\n },\\n new List<double> { // Benjamini & Yekutieli\\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\\n },\\n new List<double> { // Bonferroni\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\\n },\\n new List<double> { // Hochberg\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n new List<double> { // Holm\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n new List<double> { // Hommel\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\\n }\\n };\\n\\n string[] types = { \\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\" };\\n for (int type = 0; type < types.Length; ++type) {\\n var q = PAdjust(pvalues, types[type]);\\n double error = 0.0;\\n for (int i = 0; i < pvalues.Count; ++i) {\\n error += Math.Abs(q[i] - correctAnswers[type][i]);\\n }\\n Say(q);\\n Console.WriteLine(\\\"type {0} = '{1}' has a cumulative error of {2:E}\\\", type, types[type], error);\\n Console.WriteLine();\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.algorithm;\\nimport std.conv;\\nimport std.math;\\nimport std.stdio;\\nimport std.string;\\n\\nint[] seqLen(int start, int end) {\\n int[] result;\\n if (start == end) {\\n result.length = end+1;\\n for (int i; i<result.length; i++) {\\n result[i] = i+1;\\n }\\n } else if (start < end) {\\n result.length = end - start + 1;\\n for (int i; i<result.length; i++) {\\n result[i] = start+i;\\n }\\n } else {\\n result.length = start - end + 1;\\n for (int i; i<result.length; i++) {\\n result[i] = start-i;\\n }\\n }\\n return result;\\n}\\n\\nint[] order(double[] array, bool decreasing) {\\n int size = array.length;\\n int[] idx;\\n idx.length = size;\\n double[] baseArr;\\n baseArr.length = size;\\n for (int i; i<size; i++) {\\n baseArr[i] = array[i];\\n idx[i] = i;\\n }\\n if (!decreasing) {\\n alias comp = (a,b) => baseArr[a] < baseArr[b];\\n idx.sort!comp;\\n } else {\\n alias comp = (a,b) => baseArr[b] < baseArr[a];\\n idx.sort!comp;\\n }\\n return idx;\\n}\\n\\ndouble[] cummin(double[] array) {\\n int size = array.length;\\n if (size < 1) throw new Exception(\\\"cummin requires at least one element\\\");\\n double[] output;\\n output.length = size;\\n auto cumulativeMin = array[0];\\n foreach (i; 0..size) {\\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\\n output[i] = cumulativeMin;\\n }\\n return output;\\n}\\n\\ndouble[] cummax(double[] array) {\\n auto size = array.length;\\n if (size < 1) throw new Exception(\\\"cummax requires at least one element\\\");\\n double[] output;\\n output.length = size;\\n auto cumulativeMax = array[0];\\n foreach (i; 0..size) {\\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\\n output[i] = cumulativeMax;\\n }\\n return output;\\n}\\n\\ndouble[] pminx(double[] array, double x) {\\n auto size = array.length;\\n if (size < 1) throw new Exception(\\\"pmin requires at least one element\\\");\\n double[] result;\\n result.length = size;\\n foreach (i; 0..size) {\\n if (array[i] < x) {\\n result[i] = array[i];\\n } else {\\n result[i] = x;\\n }\\n }\\n return result;\\n}\\n\\nvoid doubleSay(double[] array) {\\n writef(\\\"[ 1] %e\\\", array[0]);\\n foreach (i; 1..array.length) {\\n writef(\\\" %.10f\\\", array[i]);\\n if ((i+1) % 5 == 0) writef(\\\"\\\\n[%2d]\\\", i+1);\\n }\\n writeln;\\n}\\n\\nauto toArray(T,U)(U[] array) {\\n T[] result;\\n result.length = array.length;\\n foreach(i; 0..array.length) {\\n result[i] = to!T(array[i]);\\n }\\n return result;\\n}\\n\\ndouble[] pAdjust(double[] pvalues, string str) {\\n auto size = pvalues.length;\\n if (size < 1) throw new Exception(\\\"pAdjust requires at least one element\\\");\\n int type = str.toLower.predSwitch!\\\"a==b\\\"(\\n \\\"bh\\\", 0,\\n \\\"fdr\\\", 0,\\n \\\"by\\\", 1,\\n \\\"bonferroni\\\", 2,\\n \\\"hochberg\\\", 3,\\n \\\"holm\\\", 4,\\n \\\"hommel\\\", 5,\\n { throw new Exception(text(\\\"'\\\",str,\\\"' doesn't match any accepted FDR types\\\")); }()\\n );\\n if (type == 2) { // Bonferroni method\\n double[] result;\\n result.length = size;\\n foreach (i; 0..size) {\\n auto b = pvalues[i] * size;\\n if (b >= 1) {\\n result[i] = 1;\\n } else if (0 <= b && b < 1) {\\n result[i] = b;\\n } else {\\n throw new Exception(text(b,\\\" is outside [0, 1)\\\"));\\n }\\n }\\n return result;\\n } else if (type == 4) { // Holm method\\n auto o = order(pvalues, false);\\n auto o2Double = toArray!(double,int)(o);\\n double[] cummaxInput;\\n cummaxInput.length = size;\\n foreach (i; 0..size) {\\n cummaxInput[i] = (size-i) * pvalues[o[i]];\\n }\\n auto ro = order(o2Double, false);\\n auto cummaxOutput = cummax(cummaxInput);\\n auto pmin = pminx(cummaxOutput, 1.0);\\n double[] result;\\n result.length = size;\\n foreach (i; 0..size) {\\n result[i] = pmin[ro[i]];\\n }\\n return result;\\n } else if (type == 5) {\\n auto indices = seqLen(size, size);\\n auto o = order(pvalues, false);\\n double[] p;\\n p.length = size;\\n foreach (i; 0..size) {\\n p[i] = pvalues[o[i]];\\n }\\n auto o2Double = toArray!double(o);\\n auto ro = order(o2Double, false);\\n double[] q;\\n q.length = size;\\n double[] pa;\\n pa.length = size;\\n double[] npi;\\n npi.length = size;\\n foreach (i; 0..size) {\\n npi[i] = p[i] * size / indices[i];\\n }\\n auto min_ = reduce!min(npi);\\n q[] = min_;\\n pa[] = min_;\\n foreach_reverse (j; 2..size) {\\n auto ij = seqLen(1, size - j + 1);\\n foreach (i; 0..size-j+1) {\\n ij[i]--;\\n }\\n auto i2Length = j-1;\\n int[] i2;\\n i2.length = i2Length;\\n foreach(i; 0..i2Length) {\\n i2[i] = size-j+2+i-1;\\n }\\n auto pi2Length = i2Length;\\n double q1 = j*p[i2[0]] / 2.0;\\n foreach (i; 1..pi2Length) {\\n auto temp_q1 = p[i2[i]] * j / (2.0 + i);\\n if (temp_q1 < q1) q1 = temp_q1;\\n }\\n foreach (i; 0..size-j+1) {\\n q[ij[i]] = min(p[ij[i]] * j, q1);\\n }\\n foreach(i; 0..i2Length) {\\n q[i2[i]] = q[size-j];\\n }\\n foreach(i; 0..size) if (pa[i] < q[i]) pa[i] = q[i];\\n }\\n foreach (index; 0..size) {\\n q[index] = pa[ro[index]];\\n }\\n return q;\\n }\\n\\n double[] ni;\\n ni.length = size;\\n auto o = order(pvalues, true);\\n auto oDouble = toArray!double(o);\\n foreach (index; 0..size) {\\n if (pvalues[index] < 0 || pvalues[index] > 1) {\\n throw new Exception(text(\\\"array[\\\", index, \\\"] = \\\", pvalues[index], \\\" is outside [0, 1]\\\"));\\n }\\n ni[index] = cast(double) size / (size - index);\\n }\\n auto ro = order(oDouble, false);\\n double[] cumminInput;\\n cumminInput.length = size;\\n if (type == 0) { // BH method\\n foreach (index; 0..size) {\\n cumminInput[index] = ni[index] * pvalues[o[index]];\\n }\\n } else if (type == 1) { // BY method\\n double q = 0;\\n foreach (index; 1..size+1) q += 1.0 / index;\\n foreach (index; 0..size) {\\n cumminInput[index] = q * ni[index] * pvalues[o[index]];\\n }\\n } else if (type == 3) { // Hochberg method\\n foreach (index; 0..size) {\\n cumminInput[index] = (index + 1) * pvalues[o[index]];\\n }\\n }\\n auto cumminArray =cummin(cumminInput);\\n auto pmin = pminx(cumminArray, 1.0);\\n double[] result;\\n result.length = size;\\n foreach (i; 0..size) {\\n result[i] = pmin[ro[i]];\\n }\\n return result;\\n}\\n\\nvoid main() {\\n double[] pvalues = [\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n ];\\n\\n double[][] correctAnswers = [\\n [ // Benjamini-Hochberg\\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\\n ],\\n [ // Benjamini & Yekutieli\\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\\n ],\\n [ // Bonferroni\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\\n ],\\n [ // Hochberg\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n ],\\n [ // Holm\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n ],\\n [ // Hommel\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\\n ]\\n ];\\n auto types = [\\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\"];\\n foreach (type; 0..types.length) {\\n auto q = pAdjust(pvalues, types[type]);\\n double error = 0.0;\\n foreach (i; 0..pvalues.length) {\\n error += abs(q[i] - correctAnswers[type][i]);\\n }\\n doubleSay(q);\\n writefln(\\\"\\\\ntype %d = '%s' has a cumulative error of %g\\\", type, types[type], error);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"math\\\"\\n \\\"os\\\"\\n \\\"sort\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\ntype pvalues = []float64\\n\\ntype iv1 struct {\\n index int\\n value float64\\n}\\ntype iv2 struct{ index, value int }\\n\\ntype direction int\\n\\nconst (\\n up direction = iota\\n down\\n)\\n\\n// Test also for 'Unknown' correction type.\\nvar ctypes = []string{\\n \\\"Benjamini-Hochberg\\\", \\\"Benjamini-Yekutieli\\\", \\\"Bonferroni\\\", \\\"Hochberg\\\",\\n \\\"Holm\\\", \\\"Hommel\\\", \\\"Šidák\\\", \\\"Unknown\\\",\\n}\\n\\nfunc minimum(p pvalues) float64 {\\n m := p[0]\\n for i := 1; i < len(p); i++ {\\n if p[i] < m {\\n m = p[i]\\n }\\n }\\n return m\\n}\\n\\nfunc maximum(p pvalues) float64 {\\n m := p[0]\\n for i := 1; i < len(p); i++ {\\n if p[i] > m {\\n m = p[i]\\n }\\n }\\n return m\\n}\\n\\nfunc adjusted(p pvalues, ctype string) (string, error) {\\n err := check(p)\\n if err != nil {\\n return \\\"\\\", err\\n }\\n temp := pformat(adjust(p, ctype), 5)\\n return fmt.Sprintf(\\\"\\\\n%s\\\\n%s\\\", ctype, temp), nil\\n}\\n\\nfunc pformat(p pvalues, cols int) string {\\n var lines []string\\n for i := 0; i < len(p); i += cols {\\n fchunk := p[i : i+cols]\\n schunk := make([]string, cols)\\n for j := 0; j < cols; j++ {\\n schunk[j] = strconv.FormatFloat(fchunk[j], 'f', 10, 64)\\n }\\n lines = append(lines, fmt.Sprintf(\\\"[%2d] %s\\\", i, strings.Join(schunk, \\\" \\\")))\\n }\\n return strings.Join(lines, \\\"\\\\n\\\")\\n}\\n\\nfunc check(p []float64) error {\\n cond := len(p) > 0 && minimum(p) >= 0 && maximum(p) <= 1\\n if !cond {\\n return fmt.Errorf(\\\"p-values must be in range 0.0 to 1.0\\\")\\n }\\n return nil\\n}\\n\\nfunc ratchet(p pvalues, dir direction) {\\n size := len(p)\\n m := p[0]\\n if dir == up {\\n for i := 1; i < size; i++ {\\n if p[i] > m {\\n p[i] = m\\n }\\n m = p[i]\\n }\\n } else {\\n for i := 1; i < size; i++ {\\n if p[i] < m {\\n p[i] = m\\n }\\n m = p[i]\\n }\\n }\\n for i := 0; i < size; i++ {\\n if p[i] > 1.0 {\\n p[i] = 1.0\\n }\\n }\\n}\\n\\nfunc schwartzian(p pvalues, mult pvalues, dir direction) pvalues {\\n size := len(p)\\n order := make([]int, size)\\n iv1s := make([]iv1, size)\\n for i := 0; i < size; i++ {\\n iv1s[i] = iv1{i, p[i]}\\n }\\n if dir == up {\\n sort.Slice(iv1s, func(i, j int) bool {\\n return iv1s[i].value > iv1s[j].value\\n })\\n } else {\\n sort.Slice(iv1s, func(i, j int) bool {\\n return iv1s[i].value < iv1s[j].value\\n })\\n }\\n for i := 0; i < size; i++ {\\n order[i] = iv1s[i].index\\n }\\n pa := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n pa[i] = mult[i] * p[order[i]]\\n }\\n ratchet(pa, dir)\\n order2 := make([]int, size)\\n iv2s := make([]iv2, size)\\n for i := 0; i < size; i++ {\\n iv2s[i] = iv2{i, order[i]}\\n }\\n sort.Slice(iv2s, func(i, j int) bool {\\n return iv2s[i].value < iv2s[j].value\\n })\\n for i := 0; i < size; i++ {\\n order2[i] = iv2s[i].index\\n }\\n pa2 := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n pa2[i] = pa[order2[i]]\\n }\\n return pa2\\n}\\n\\nfunc adjust(p pvalues, ctype string) pvalues {\\n size := len(p)\\n if size == 0 {\\n return p\\n }\\n fsize := float64(size)\\n switch ctype {\\n case \\\"Benjamini-Hochberg\\\":\\n mult := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n mult[i] = fsize / float64(size-i)\\n }\\n return schwartzian(p, mult, up)\\n case \\\"Benjamini-Yekutieli\\\":\\n q := 0.0\\n for i := 1; i <= size; i++ {\\n q += 1.0 / float64(i)\\n }\\n mult := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n mult[i] = q * fsize / (fsize - float64(i))\\n }\\n return schwartzian(p, mult, up)\\n case \\\"Bonferroni\\\":\\n p2 := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n p2[i] = math.Min(p[i]*fsize, 1.0)\\n }\\n return p2\\n case \\\"Hochberg\\\":\\n mult := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n mult[i] = float64(i) + 1\\n }\\n return schwartzian(p, mult, up)\\n case \\\"Holm\\\":\\n mult := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n mult[i] = fsize - float64(i)\\n }\\n return schwartzian(p, mult, down)\\n case \\\"Hommel\\\":\\n order := make([]int, size)\\n iv1s := make([]iv1, size)\\n for i := 0; i < size; i++ {\\n iv1s[i] = iv1{i, p[i]}\\n }\\n sort.Slice(iv1s, func(i, j int) bool {\\n return iv1s[i].value < iv1s[j].value\\n })\\n for i := 0; i < size; i++ {\\n order[i] = iv1s[i].index\\n }\\n s := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n s[i] = p[order[i]]\\n }\\n m := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n m[i] = s[i] * fsize / (float64(i) + 1)\\n }\\n min := minimum(m)\\n q := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n q[i] = min\\n }\\n pa := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n pa[i] = min\\n }\\n for j := size - 1; j >= 2; j-- {\\n lower := make([]int, size-j+1) // lower indices\\n for i := 0; i < len(lower); i++ {\\n lower[i] = i\\n }\\n upper := make([]int, j-1) // upper indices\\n for i := 0; i < len(upper); i++ {\\n upper[i] = size - j + 1 + i\\n }\\n qmin := float64(j) * s[upper[0]] / 2.0\\n for i := 1; i < len(upper); i++ {\\n temp := s[upper[i]] * float64(j) / (2.0 + float64(i))\\n if temp < qmin {\\n qmin = temp\\n }\\n }\\n for i := 0; i < len(lower); i++ {\\n q[lower[i]] = math.Min(s[lower[i]]*float64(j), qmin)\\n }\\n for i := 0; i < len(upper); i++ {\\n q[upper[i]] = q[size-j]\\n }\\n for i := 0; i < size; i++ {\\n if pa[i] < q[i] {\\n pa[i] = q[i]\\n }\\n }\\n }\\n order2 := make([]int, size)\\n iv2s := make([]iv2, size)\\n for i := 0; i < size; i++ {\\n iv2s[i] = iv2{i, order[i]}\\n }\\n sort.Slice(iv2s, func(i, j int) bool {\\n return iv2s[i].value < iv2s[j].value\\n })\\n for i := 0; i < size; i++ {\\n order2[i] = iv2s[i].index\\n }\\n pa2 := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n pa2[i] = pa[order2[i]]\\n }\\n return pa2\\n case \\\"Šidák\\\":\\n p2 := make(pvalues, size)\\n for i := 0; i < size; i++ {\\n p2[i] = 1.0 - math.Pow(1.0-float64(p[i]), fsize)\\n }\\n return p2\\n default:\\n fmt.Printf(\\\"\\\\nSorry, do not know how to do '%s' correction.\\\\n\\\", ctype)\\n fmt.Println(\\\"Perhaps you want one of these?:\\\")\\n temp := make([]string, len(ctypes)-1)\\n for i := 0; i < len(temp); i++ {\\n temp[i] = fmt.Sprintf(\\\" %s\\\", ctypes[i])\\n }\\n fmt.Println(strings.Join(temp, \\\"\\\\n\\\"))\\n os.Exit(1)\\n }\\n return p\\n}\\n\\nfunc main() {\\n p := pvalues{\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03,\\n }\\n for _, ctype := range ctypes {\\n s, err := adjusted(p, ctype)\\n if err != nil {\\n log.Fatal(err)\\n }\\n fmt.Println(s)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.Comparator;\\n\\npublic class PValueCorrection {\\n private static int[] seqLen(int start, int end) {\\n int[] result;\\n if (start == end) {\\n result = new int[end + 1];\\n for (int i = 0; i < result.length; ++i) {\\n result[i] = i + 1;\\n }\\n } else if (start < end) {\\n result = new int[end - start + 1];\\n for (int i = 0; i < result.length; ++i) {\\n result[i] = start + i;\\n }\\n } else {\\n result = new int[start - end + 1];\\n for (int i = 0; i < result.length; ++i) {\\n result[i] = start - i;\\n }\\n }\\n return result;\\n }\\n\\n private static int[] order(double[] array, boolean decreasing) {\\n int size = array.length;\\n int[] idx = new int[size];\\n double[] baseArr = new double[size];\\n for (int i = 0; i < size; ++i) {\\n baseArr[i] = array[i];\\n idx[i] = i;\\n }\\n\\n Comparator<Integer> cmp;\\n if (!decreasing) {\\n cmp = Comparator.comparingDouble(a -> baseArr[a]);\\n } else {\\n cmp = (a, b) -> Double.compare(baseArr[b], baseArr[a]);\\n }\\n\\n return Arrays.stream(idx)\\n .boxed()\\n .sorted(cmp)\\n .mapToInt(a -> a)\\n .toArray();\\n }\\n\\n private static double[] cummin(double[] array) {\\n if (array.length < 1) throw new IllegalArgumentException(\\\"cummin requires at least one element\\\");\\n double[] output = new double[array.length];\\n double cumulativeMin = array[0];\\n for (int i = 0; i < array.length; ++i) {\\n if (array[i] < cumulativeMin) cumulativeMin = array[i];\\n output[i] = cumulativeMin;\\n }\\n return output;\\n }\\n\\n private static double[] cummax(double[] array) {\\n if (array.length < 1) throw new IllegalArgumentException(\\\"cummax requires at least one element\\\");\\n double[] output = new double[array.length];\\n double cumulativeMax = array[0];\\n for (int i = 0; i < array.length; ++i) {\\n if (array[i] > cumulativeMax) cumulativeMax = array[i];\\n output[i] = cumulativeMax;\\n }\\n return output;\\n }\\n\\n private static double[] pminx(double[] array, double x) {\\n if (array.length < 1) throw new IllegalArgumentException(\\\"pmin requires at least one element\\\");\\n double[] result = new double[array.length];\\n for (int i = 0; i < array.length; ++i) {\\n if (array[i] < x) {\\n result[i] = array[i];\\n } else {\\n result[i] = x;\\n }\\n }\\n return result;\\n }\\n\\n private static void doubleSay(double[] array) {\\n System.out.printf(\\\"[ 1] %e\\\", array[0]);\\n for (int i = 1; i < array.length; ++i) {\\n System.out.printf(\\\" %.10f\\\", array[i]);\\n if ((i + 1) % 5 == 0) System.out.printf(\\\"\\\\n[%2d]\\\", i + 1);\\n }\\n System.out.println();\\n }\\n\\n private static double[] intToDouble(int[] array) {\\n double[] result = new double[array.length];\\n for (int i = 0; i < array.length; i++) {\\n result[i] = array[i];\\n }\\n return result;\\n }\\n\\n private static double doubleArrayMin(double[] array) {\\n if (array.length < 1) throw new IllegalArgumentException(\\\"pAdjust requires at least one element\\\");\\n return Arrays.stream(array).min().orElse(Double.NaN);\\n }\\n\\n private static double[] pAdjust(double[] pvalues, String str) {\\n int size = pvalues.length;\\n if (size < 1) throw new IllegalArgumentException(\\\"pAdjust requires at least one element\\\");\\n int type;\\n switch (str.toLowerCase()) {\\n case \\\"bh\\\":\\n case \\\"fdr\\\":\\n type = 0;\\n break;\\n case \\\"by\\\":\\n type = 1;\\n break;\\n case \\\"bonferroni\\\":\\n type = 2;\\n break;\\n case \\\"hochberg\\\":\\n type = 3;\\n break;\\n case \\\"holm\\\":\\n type = 4;\\n break;\\n case \\\"hommel\\\":\\n type = 5;\\n break;\\n default:\\n throw new IllegalArgumentException(str + \\\" doesn't match any accepted FDR types\\\");\\n }\\n\\n if (type == 2) { // Bonferroni method\\n double[] result = new double[size];\\n for (int i = 0; i < size; ++i) {\\n double b = pvalues[i] * size;\\n if (b >= 1) {\\n result[i] = 1;\\n } else if (0 <= b && b < 1) {\\n result[i] = b;\\n } else {\\n throw new RuntimeException(\\\"\\\" + b + \\\" is outside [0, 1)\\\");\\n }\\n }\\n return result;\\n } else if (type == 4) { // Holm method\\n int[] o = order(pvalues, false);\\n double[] o2Double = intToDouble(o);\\n double[] cummaxInput = new double[size];\\n for (int i = 0; i < size; ++i) {\\n cummaxInput[i] = (size - i) * pvalues[o[i]];\\n }\\n int[] ro = order(o2Double, false);\\n double[] cummaxOutput = cummax(cummaxInput);\\n double[] pmin = pminx(cummaxOutput, 1.0);\\n double[] result = new double[size];\\n for (int i = 0; i < size; ++i) {\\n result[i] = pmin[ro[i]];\\n }\\n return result;\\n } else if (type == 5) {\\n int[] indices = seqLen(size, size);\\n int[] o = order(pvalues, false);\\n double[] p = new double[size];\\n for (int i = 0; i < size; ++i) {\\n p[i] = pvalues[o[i]];\\n }\\n double[] o2Double = intToDouble(o);\\n int[] ro = order(o2Double, false);\\n double[] q = new double[size];\\n double[] pa = new double[size];\\n double[] npi = new double[size];\\n for (int i = 0; i < size; ++i) {\\n npi[i] = p[i] * size / indices[i];\\n }\\n double min = doubleArrayMin(npi);\\n Arrays.fill(q, min);\\n Arrays.fill(pa, min);\\n for (int j = size; j >= 2; --j) {\\n int[] ij = seqLen(1, size - j + 1);\\n for (int i = 0; i < size - j + 1; ++i) {\\n ij[i]--;\\n }\\n int i2Length = j - 1;\\n int[] i2 = new int[i2Length];\\n for (int i = 0; i < i2Length; ++i) {\\n i2[i] = size - j + 2 + i - 1;\\n }\\n double q1 = j * p[i2[0]] / 2.0;\\n for (int i = 1; i < i2Length; ++i) {\\n double temp_q1 = p[i2[i]] * j / (2.0 + i);\\n if (temp_q1 < q1) q1 = temp_q1;\\n }\\n for (int i = 0; i < size - j + 1; ++i) {\\n q[ij[i]] = Math.min(p[ij[i]] * j, q1);\\n }\\n for (int i = 0; i < i2Length; ++i) {\\n q[i2[i]] = q[size - j];\\n }\\n for (int i = 0; i < size; ++i) {\\n if (pa[i] < q[i]) {\\n pa[i] = q[i];\\n }\\n }\\n }\\n for (int i = 0; i < size; ++i) {\\n q[i] = pa[ro[i]];\\n }\\n return q;\\n }\\n\\n double[] ni = new double[size];\\n int[] o = order(pvalues, true);\\n double[] oDouble = intToDouble(o);\\n for (int i = 0; i < size; ++i) {\\n if (pvalues[i] < 0 || pvalues[i] > 1) {\\n throw new RuntimeException(\\\"array[\\\" + i + \\\"] = \\\" + pvalues[i] + \\\" is outside [0, 1]\\\");\\n }\\n ni[i] = (double) size / (size - i);\\n }\\n int[] ro = order(oDouble, false);\\n double[] cumminInput = new double[size];\\n if (type == 0) { // BH method\\n for (int i = 0; i < size; ++i) {\\n cumminInput[i] = ni[i] * pvalues[o[i]];\\n }\\n } else if (type == 1) { // BY method\\n double q = 0;\\n for (int i = 1; i < size + 1; ++i) {\\n q += 1.0 / i;\\n }\\n for (int i = 0; i < size; ++i) {\\n cumminInput[i] = q * ni[i] * pvalues[o[i]];\\n }\\n } else if (type == 3) { // Hochberg method\\n for (int i = 0; i < size; ++i) {\\n cumminInput[i] = (i + 1) * pvalues[o[i]];\\n }\\n }\\n double[] cumminArray = cummin(cumminInput);\\n double[] pmin = pminx(cumminArray, 1.0);\\n double[] result = new double[size];\\n for (int i = 0; i < size; ++i) {\\n result[i] = pmin[ro[i]];\\n }\\n return result;\\n }\\n\\n public static void main(String[] args) {\\n double[] pvalues = new double[]{\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n };\\n\\n double[][] correctAnswers = new double[][]{\\n new double[]{ // Benjamini-Hochberg\\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\\n },\\n new double[]{ // Benjamini & Yekutieli\\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\\n },\\n new double[]{ // Bonferroni\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\\n },\\n new double[]{ // Hochberg\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n new double[]{ // Holm\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n },\\n new double[]{ // Hommel\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\\n }\\n };\\n\\n String[] types = new String[]{\\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\"};\\n for (int type = 0; type < types.length; ++type) {\\n double[] q = pAdjust(pvalues, types[type]);\\n double error = 0.0;\\n for (int i = 0; i < pvalues.length; ++i) {\\n error += Math.abs(q[i] - correctAnswers[type][i]);\\n }\\n doubleSay(q);\\n System.out.printf(\\\"\\\\ntype %d = '%s' has a cumulative error of %g\\\\n\\\", type, types[type], error);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using MultipleTesting, IterTools, Printf\\n\\np = [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\\n\\nfunction printpvalues(v)\\n for chunk in partition(v, 10)\\n println(join((@sprintf(\\\"%4.7f\\\", p) for p in chunk), \\\", \\\"))\\n end\\nend\\n\\nprintln(\\\"Original p-values:\\\")\\nprintpvalues(p)\\nfor corr in (Bonferroni(), BenjaminiHochberg(), BenjaminiYekutieli(), Holm(), Hochberg(), Hommel())\\n println(\\\"\\\\n\\\", corr)\\n printpvalues(adjust(p, corr))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nimport java.util.Arrays\\n\\ntypealias IAE = IllegalArgumentException\\n\\nfun seqLen(start: Int, end: Int) =\\n when {\\n start == end -> IntArray(end + 1) { it + 1 }\\n start < end -> IntArray(end - start + 1) { start + it }\\n else -> IntArray(start - end + 1) { start - it }\\n }\\n\\nvar baseArr: DoubleArray? = null\\n\\nfun compareIncrease(a: Int, b: Int): Int = baseArr!![b].compareTo(baseArr!![a])\\n\\nfun compareDecrease(a: Int, b: Int): Int = baseArr!![a].compareTo(baseArr!![b])\\n\\nfun order(array: DoubleArray, decreasing: Boolean): IntArray {\\n val size = array.size\\n var idx = IntArray(size) { it }\\n baseArr = array.copyOf()\\n if (!decreasing) {\\n idx = Arrays.stream(idx)\\n .boxed()\\n .sorted { a, b -> compareDecrease(a, b) }\\n .mapToInt { it }\\n .toArray()\\n }\\n else {\\n idx = Arrays.stream(idx)\\n .boxed()\\n .sorted { a, b -> compareIncrease(a, b) }\\n .mapToInt { it }\\n .toArray()\\n }\\n baseArr = null\\n return idx\\n}\\n\\nfun cummin(array: DoubleArray): DoubleArray {\\n val size = array.size\\n if (size < 1) throw IAE(\\\"cummin requires at least one element\\\")\\n val output = DoubleArray(size)\\n var cumulativeMin = array[0]\\n for (i in 0 until size) {\\n if (array[i] < cumulativeMin) cumulativeMin = array[i]\\n output[i] = cumulativeMin\\n }\\n return output\\n}\\n\\nfun cummax(array: DoubleArray): DoubleArray {\\n val size = array.size\\n if (size < 1) throw IAE(\\\"cummax requires at least one element\\\")\\n val output = DoubleArray(size)\\n var cumulativeMax = array[0]\\n for (i in 0 until size) {\\n if (array[i] > cumulativeMax) cumulativeMax = array[i]\\n output[i] = cumulativeMax\\n }\\n return output\\n}\\n\\nfun pminx(array: DoubleArray, x: Double): DoubleArray {\\n val size = array.size\\n if (size < 1) throw IAE(\\\"pmin requires at least one element\\\")\\n return DoubleArray(size) { if (array[it] < x) array[it] else x }\\n}\\n\\nfun doubleSay(array: DoubleArray) {\\n print(\\\"[ 1] %e\\\".format(array[0]))\\n for (i in 1 until array.size) {\\n print(\\\" %.10f\\\".format(array[i]))\\n if ((i + 1) % 5 == 0) print(\\\"\\\\n[%2d]\\\".format(i + 1))\\n }\\n println()\\n}\\n\\nfun intToDouble(array: IntArray) = DoubleArray(array.size) { array[it].toDouble() }\\n\\nfun doubleArrayMin(array: DoubleArray) =\\n if (array.size < 1) throw IAE(\\\"pAdjust requires at least one element\\\")\\n else array.min()!!\\n\\nfun pAdjust(pvalues: DoubleArray, str: String): DoubleArray {\\n val size = pvalues.size\\n if (size < 1) throw IAE(\\\"pAdjust requires at least one element\\\")\\n val type = when(str.toLowerCase()) {\\n \\\"bh\\\", \\\"fdr\\\" -> 0\\n \\\"by\\\" -> 1\\n \\\"bonferroni\\\" -> 2\\n \\\"hochberg\\\" -> 3\\n \\\"holm\\\" -> 4\\n \\\"hommel\\\" -> 5\\n else -> throw IAE(\\\"'$str' doesn't match any accepted FDR types\\\")\\n }\\n if (type == 2) { // Bonferroni method\\n return DoubleArray(size) {\\n val b = pvalues[it] * size\\n when {\\n b >= 1 -> 1.0\\n 0 <= b && b < 1 -> b\\n else -> throw RuntimeException(\\\"$b is outside [0, 1)\\\")\\n }\\n }\\n }\\n else if (type == 4) { // Holm method\\n val o = order(pvalues, false)\\n val o2Double = intToDouble(o)\\n val cummaxInput = DoubleArray(size) { (size - it) * pvalues[o[it]] }\\n val ro = order(o2Double, false)\\n val cummaxOutput = cummax(cummaxInput)\\n val pmin = pminx(cummaxOutput, 1.0)\\n return DoubleArray(size) { pmin[ro[it]] }\\n }\\n else if (type == 5) { // Hommel method\\n val indices = seqLen(size, size)\\n val o = order(pvalues, false)\\n val p = DoubleArray(size) { pvalues[o[it]] }\\n val o2Double = intToDouble(o)\\n val ro = order(o2Double, false)\\n val q = DoubleArray(size)\\n val pa = DoubleArray(size)\\n val npi = DoubleArray(size) { p[it] * size / indices[it] }\\n val min = doubleArrayMin(npi)\\n q.fill(min)\\n pa.fill(min)\\n for (j in size - 1 downTo 2) {\\n val ij = seqLen(1, size - j + 1)\\n for (i in 0 until size - j + 1) ij[i]--\\n val i2Length = j - 1\\n val i2 = IntArray(i2Length) { size - j + 2 + it - 1 }\\n val pi2Length = i2Length\\n var q1 = j * p[i2[0]] / 2.0\\n for (i in 1 until pi2Length) {\\n val temp_q1 = p[i2[i]] * j / (2.0 + i)\\n if(temp_q1 < q1) q1 = temp_q1\\n }\\n for (i in 0 until size - j + 1) {\\n q[ij[i]] = minOf(p[ij[i]] * j, q1)\\n }\\n for (i in 0 until i2Length) q[i2[i]] = q[size - j]\\n for (i in 0 until size) if (pa[i] < q[i]) pa[i] = q[i]\\n }\\n for (index in 0 until size) q[index] = pa[ro[index]]\\n return q\\n }\\n val ni = DoubleArray(size)\\n val o = order(pvalues, true)\\n val oDouble = intToDouble(o)\\n for (index in 0 until size) {\\n if (pvalues[index] !in 0.0 .. 1.0) {\\n throw RuntimeException(\\\"array[$index] = ${pvalues[index]} is outside [0, 1]\\\")\\n }\\n ni[index] = size.toDouble() / (size - index)\\n }\\n val ro = order(oDouble, false)\\n val cumminInput = DoubleArray(size)\\n if (type == 0) { // BH method\\n for (index in 0 until size) {\\n cumminInput[index] = ni[index] * pvalues[o[index]]\\n }\\n }\\n else if (type == 1) { // BY method\\n var q = 0.0\\n for (index in 1 until size + 1) q += 1.0 / index\\n for (index in 0 until size) {\\n cumminInput[index] = q * ni[index] * pvalues[o[index]]\\n }\\n }\\n else if (type == 3) { // Hochberg method\\n for (index in 0 until size) {\\n cumminInput[index] = (index + 1) * pvalues[o[index]]\\n }\\n }\\n val cumminArray = cummin(cumminInput)\\n val pmin = pminx(cumminArray, 1.0)\\n return DoubleArray(size) { pmin[ro[it]] }\\n}\\n\\nfun main(args: Array<String>) {\\n val pvalues = doubleArrayOf(\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n )\\n\\n val correctAnswers = listOf(\\n doubleArrayOf( // Benjamini-Hochberg\\n 6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n 9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n 6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n 4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n 2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n 2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n 4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02\\n ),\\n doubleArrayOf( // Benjamini & Yekutieli\\n 1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n 1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n 2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02\\n ),\\n doubleArrayOf( // Bonferroni\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n 2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n 1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n 1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01\\n ),\\n doubleArrayOf( // Hochberg\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n 1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n ),\\n doubleArrayOf( // Holm\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n 1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n 1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n 1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01\\n ),\\n doubleArrayOf( // Hommel\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n 1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n 1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n 9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01\\n )\\n )\\n val types = listOf(\\\"bh\\\", \\\"by\\\", \\\"bonferroni\\\", \\\"hochberg\\\", \\\"holm\\\", \\\"hommel\\\")\\n val f = \\\"\\\\ntype %d = '%s' has cumulative error of %g\\\"\\n for (type in 0 until types.size) {\\n val q = pAdjust(pvalues, types[type])\\n var error = 0.0\\n for (i in 0 until pvalues.size) {\\n error += Math.abs(q[i] - correctAnswers[type][i])\\n }\\n doubleSay(q)\\n println(f.format(type, types[type], error))\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"// version 1.2.21\\n\\ntypealias DList = List<Double>\\n\\nenum class Direction { UP, DOWN }\\n\\n// test also for 'Unknown' correction type\\nval types = listOf(\\n \\\"Benjamini-Hochberg\\\", \\\"Benjamini-Yekutieli\\\", \\\"Bonferroni\\\", \\\"Hochberg\\\",\\n \\\"Holm\\\", \\\"Hommel\\\", \\\"Šidák\\\", \\\"Unknown\\\"\\n)\\n\\nfun adjusted(p: DList, type: String) = \\\"\\\\n$type\\\\n${pFormat(adjust(check(p), type))}\\\"\\n\\nfun pFormat(p: DList, cols: Int = 5): String {\\n var i = -cols\\n val fmt = \\\"%1.10f\\\"\\n return p.chunked(cols).map { chunk ->\\n i += cols\\n \\\"[%2d] %s\\\".format(i, chunk.map { fmt.format(it) }.joinToString(\\\" \\\"))\\n }.joinToString(\\\"\\\\n\\\")\\n}\\n\\nfun check(p: DList): DList {\\n require(p.size > 0 && p.min()!! >= 0.0 && p.max()!! <= 1.0) {\\n \\\"p-values must be in range 0.0 to 1.0\\\"\\n }\\n return p\\n}\\n\\nfun ratchet(p: DList, dir: Direction): DList {\\n val pp = p.toMutableList()\\n var m = pp[0]\\n if (dir == Direction.UP) {\\n for (i in 1 until pp.size) {\\n if (pp[i] > m) pp[i] = m\\n m = pp[i]\\n }\\n }\\n else {\\n for (i in 1 until pp.size) {\\n if (pp[i] < m) pp[i] = m\\n m = pp[i]\\n }\\n }\\n return pp.map { if (it < 1.0) it else 1.0 }\\n}\\n\\nfun schwartzian(p: DList, mult: DList, dir: Direction): DList {\\n val size = p.size\\n val order = if (dir == Direction.UP)\\n p.withIndex().sortedByDescending { it.value }.map { it.index }\\n else\\n p.withIndex().sortedBy { it.value }.map { it.index }\\n var pa = List(size) { mult[it] * p[order[it]] }\\n pa = ratchet(pa, dir)\\n val order2 = order.withIndex().sortedBy{ it.value }.map { it.index }\\n return List(size) { pa[order2[it]] }\\n}\\n\\nfun adjust(p: DList, type: String): DList {\\n val size = p.size\\n require(size > 0)\\n when (type) {\\n \\\"Benjamini-Hochberg\\\" -> {\\n val mult = List(size) { size.toDouble() / (size - it) }\\n return schwartzian(p, mult, Direction.UP)\\n }\\n\\n \\\"Benjamini-Yekutieli\\\" -> {\\n val q = (1..size).sumByDouble { 1.0 / it }\\n val mult = List(size) { q * size / (size - it) }\\n return schwartzian(p, mult, Direction.UP)\\n }\\n\\n \\\"Bonferroni\\\" -> {\\n return p.map { minOf(it * size, 1.0) }\\n }\\n\\n \\\"Hochberg\\\" -> {\\n val mult = List(size) { (it + 1).toDouble() }\\n return schwartzian(p, mult, Direction.UP)\\n }\\n\\n \\\"Holm\\\" -> {\\n val mult = List(size) { (size - it).toDouble() }\\n return schwartzian(p, mult, Direction.DOWN)\\n }\\n\\n \\\"Hommel\\\" -> {\\n val order = p.withIndex().sortedBy { it.value }.map { it.index }\\n val s = List(size) { p[order[it]] }\\n val min = List(size){ s[it] * size / ( it + 1) }.min()!!\\n val q = MutableList(size) { min }\\n val pa = MutableList(size) { min }\\n for (j in size - 1 downTo 2) {\\n val lower = IntArray(size - j + 1) { it } // lower indices\\n val upper = IntArray(j - 1) { size - j + 1 + it } // upper indices\\n var qmin = j * s[upper[0]] / 2.0\\n for (i in 1 until upper.size) {\\n val temp = s[upper[i]] * j / (2.0 + i)\\n if (temp < qmin) qmin = temp\\n }\\n for (i in 0 until lower.size) {\\n q[lower[i]] = minOf(s[lower[i]] * j, qmin)\\n }\\n for (i in 0 until upper.size) q[upper[i]] = q[size - j]\\n for (i in 0 until size) if (pa[i] < q[i]) pa[i] = q[i]\\n }\\n val order2 = order.withIndex().sortedBy{ it.value }.map { it.index }\\n return List(size) { pa[order2[it]] }\\n }\\n\\n \\\"Šidák\\\" -> {\\n val m = size.toDouble()\\n return p.map { 1.0 - Math.pow(1.0 - it, m) }\\n }\\n\\n else -> {\\n println(\\n \\\"\\\\nSorry, do not know how to do '$type' correction.\\\\n\\\" +\\n \\\"Perhaps you want one of these?:\\\\n\\\" +\\n types.dropLast(1).map { \\\" $it\\\" }.joinToString(\\\"\\\\n\\\")\\n )\\n System.exit(1)\\n }\\n }\\n return p\\n}\\n\\nfun main(args: Array<String>) {\\n val pValues = listOf(\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n )\\n\\n types.forEach { println(adjusted(pValues, it)) }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import algorithm, math, sequtils, strformat, strutils, sugar\\n\\ntype\\n\\n CorrectionType {.pure.} = enum\\n BenjaminiHochberg = \\\"Benjamini-Hochberg\\\"\\n BenjaminiYekutieli = \\\"Benjamini-Yekutieli\\\"\\n Bonferroni = \\\"Bonferroni\\\"\\n Hochberg = \\\"Hochberg\\\"\\n Holm = \\\"Holm\\\"\\n Hommel = \\\"Hommel\\\"\\n Šidák = \\\"Šidák\\\"\\n\\n Direction {.pure.} = enum Up, Down\\n\\n PValues = seq[float]\\n\\n\\ntemplate newPValues(length: Natural): PValues =\\n ## Create a PValues object of given length.\\n newSeq[float](length)\\n\\n\\nfunc ratchet(p: var PValues; dir: Direction) =\\n var m = p[0]\\n case dir\\n of Up:\\n for i in 1..p.high:\\n if p[i] > m: p[i] = m\\n m = p[i]\\n of Down:\\n for i in 1..p.high:\\n if p[i] < m: p[i] = m\\n m = p[i]\\n for i in 0..p.high:\\n if p[i] > 1: p[i] = 1\\n\\n\\nfunc schwartzian(p, mult: PValues; dir: Direction): PValues =\\n\\n let length = p.len\\n let sortOrder = if dir == Up: Descending else: Ascending\\n let order1 = toSeq(p.pairs).sorted((x, y) => cmp(x.val, y.val), sortOrder).mapIt(it.key)\\n\\n var pa = newPValues(length)\\n for i in 0..pa.high:\\n pa[i] = mult[i] * p[order1[i]]\\n\\n ratchet(pa, dir)\\n\\n let order2 = toSeq(order1.pairs).sortedByIt(it.val).mapIt(it.key)\\n for idx in order2:\\n result.add pa[idx]\\n\\n\\nproc adjust(p: PValues; ctype: CorrectionType): PValues =\\n let length = p.len\\n assert length > 0\\n let flength = length.toFloat\\n\\n case ctype\\n\\n of BenjaminiHochberg:\\n var mult = newPValues(length)\\n for i in 0..mult.high:\\n mult[i] = flength / (flength - i.toFloat)\\n return schwartzian(p, mult, Up)\\n\\n of BenjaminiYekutieli:\\n var q = 0.0\\n for i in 1..length: q += 1 / i\\n var mult = newPValues(length)\\n for i in 0..mult.high:\\n mult[i] = (q * flength) / (flength - i.toFloat)\\n return schwartzian(p, mult, Up)\\n\\n of Bonferroni:\\n result = newPValues(length)\\n for i in 0..result.high:\\n result[i] = min(p[i] * flength, 1)\\n return\\n\\n of Hochberg:\\n var mult = newPValues(length)\\n for i in 0..mult.high:\\n mult[i] = i.toFloat + 1\\n return schwartzian(p, mult, Up)\\n\\n of Holm:\\n var mult = newPValues(length)\\n for i in 0..mult.high:\\n mult[i] = flength - i.toFloat\\n return schwartzian(p, mult, Down)\\n\\n of Hommel:\\n let order1 = toSeq(p.pairs).sortedByIt(it.val).mapIt(it.key)\\n let s = order1.mapIt(p[it])\\n var m = Inf\\n for i in 0..s.high:\\n m = min(m, s[i] * flength / (i + 1).toFloat)\\n var q, pa = repeat(m, length)\\n\\n for j in countdown(length - 1, 2):\\n let lower = toSeq(0..length - j)\\n let upper = toSeq((length - j + 1)..<length)\\n var qmin = j.toFloat * s[upper[0]] / 2\\n for i in 1..upper.high:\\n let val = s[upper[i]] * j.toFloat / (i + 2).toFloat\\n if val < qmin: qmin = val\\n for idx in lower: q[idx] = min(s[idx] * j.toFloat, qmin)\\n for idx in upper: q[idx] = q[^j]\\n for i, val in q:\\n if pa[i] < val: pa[i] = val\\n\\n let order2 = toSeq(order1.pairs).sortedByIt(it.val).mapIt(it.key)\\n return order2.mapIt(pa[it])\\n\\n of Šidák:\\n result = newPValues(length)\\n for i in 0..result.high:\\n result[i] = 1 - (1 - p[i])^length\\n return\\n\\n\\nfunc pformat(p: PValues; cols = 5): string =\\n var lines: seq[string]\\n for i in countup(0, p.high, cols):\\n let fchunk = p[i..<(i + cols)]\\n var schunk = newSeq[string](fchunk.len)\\n for j in 0..<cols:\\n schunk[j] = fchunk[j].formatFloat(ffDecimal, 10)\\n lines.add &\\\"[{i:2}] {schunk.join(\\\\\\\" \\\\\\\")}\\\"\\n result = lines.join(\\\"\\\\n\\\")\\n\\n\\nfunc adjusted(p: PValues; ctype: CorrectionType): string =\\n doAssert p.len > 0 and min(p) >= 0 and max(p) <= 1, \\\"p-values must be in range 0.0 to 1.0.\\\"\\n result = &\\\"\\\\n{ctype}\\\\n{pformat(p.adjust(ctype))}\\\"\\n\\nwhen isMainModule:\\n\\n const PVals = @[\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\\n\\n for ctype in CorrectionType:\\n echo adjusted(PVals, ctype)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/env perl\\n\\nuse strict;\\nuse warnings FATAL => 'all';\\nuse autodie ':all';\\nuse List::Util 'min';\\nuse feature 'say';\\n\\nsub pmin {\\n\\tmy $array = shift;\\n\\tmy $x = 1;\\n\\tmy @pmin_array;\\n\\tmy $n = scalar @$array;\\n\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t$pmin_array[$index] = min(@$array[$index], $x);\\n\\t}\\n\\t@pmin_array\\n}\\n\\nsub cummin {\\n\\tmy $array_ref = shift;\\n\\tmy @cummin;\\n\\tmy $cumulative_min = @$array_ref[0];\\n\\tforeach my $p (@$array_ref) {\\n\\t\\tif ($p < $cumulative_min) {\\n\\t\\t\\t$cumulative_min = $p;\\n\\t\\t}\\n\\t\\tpush @cummin, $cumulative_min;\\n\\t}\\n\\t@cummin\\n}\\n\\nsub cummax {\\n\\tmy $array_ref = shift;\\n\\tmy @cummax;\\n\\tmy $cumulative_max = @$array_ref[0];\\n\\tforeach my $p (@$array_ref) {\\n\\t\\tif ($p > $cumulative_max) {\\n\\t\\t\\t$cumulative_max = $p;\\n\\t\\t}\\n\\t\\tpush @cummax, $cumulative_max;\\n\\t}\\n\\t@cummax\\n}\\n\\nsub order {#made to match R's \\\"order\\\"\\n\\tmy $array_ref = shift;\\n\\tmy $decreasing = 'false';\\n\\tif (defined $_[0]) {\\n\\t\\tmy $option = shift;\\n\\t\\tif ($option =~ m/true/i) {\\n\\t\\t\\t$decreasing = 'true';\\n\\t\\t} elsif ($option =~ m/false/i) {\\n\\t\\t\\t#do nothing, it's already set to false\\n\\t\\t} else {\\n\\t\\t\\tprint \\\"2nd option should only be case-insensitive 'true' or 'false'\\\";\\n\\t\\t\\tdie;\\n\\t\\t}\\n\\t}\\n\\tmy @array;\\n\\tmy $max_index = scalar @$array_ref-1;\\n\\tif ($decreasing eq 'false') {\\n\\t\\t@array = sort { @$array_ref[$a] <=> @$array_ref[$b] } 0..$max_index;\\n\\t} elsif ($decreasing eq 'true') {\\n\\t\\t@array = sort { @$array_ref[$b] <=> @$array_ref[$a] } 0..$max_index;\\n\\t}\\n\\t@array\\n}\\n\\n\\nsub p_adjust {\\n\\tmy $pvalues_ref = shift;\\n\\tmy $method;\\n\\tif (defined $_[0]) {\\n\\t\\t$method = shift\\n\\t} else {\\n\\t\\t$method = 'Holm'\\n\\t}\\n\\tmy %methods = (\\n\\t\\t\\t\\t\\t\\t'bh' => 1,\\n\\t\\t\\t\\t\\t\\t'fdr' => 1,\\n\\t\\t\\t\\t\\t\\t'by' => 1,\\n\\t\\t\\t\\t\\t\\t'holm' => 1,\\n\\t\\t\\t\\t\\t\\t'hommel' => 1,\\n\\t\\t\\t\\t\\t\\t'bonferroni' => 1,\\n\\t\\t\\t\\t\\t\\t'hochberg' => 1\\n\\t\\t\\t\\t\\t\\t);\\n\\tmy $method_found = 'no';\\n\\tforeach my $key (keys %methods) {\\n\\t\\tif ((uc $method) eq (uc $key)) {\\n\\t\\t\\t$method = $key;\\n\\t\\t\\t$method_found = 'yes';\\n\\t\\t\\tlast\\n\\t\\t}\\n\\t}\\n\\tif ($method_found eq 'no') {\\n\\t\\tif ($method =~ m/benjamini-?\\\\s*hochberg/i) {\\n\\t\\t\\t$method = 'bh';\\n\\t\\t\\t$method_found = 'yes';\\n\\t\\t} elsif ($method =~ m/benjamini-?\\\\s*yekutieli/i) {\\n\\t\\t\\t$method = 'by';\\n\\t\\t\\t$method_found = 'yes';\\n\\t\\t}\\n\\t}\\n\\tif ($method_found eq 'no') {\\n\\t\\tprint \\\"No method could be determined from $method.\\\\n\\\";\\n\\t\\tdie\\n\\t}\\n\\tmy $lp = scalar @$pvalues_ref;\\n\\tmy $n = $lp;\\n\\tmy @qvalues;\\n\\tif ($method eq 'hochberg') {\\n\\t\\tmy @o = order($pvalues_ref, 'TRUE');\\n\\t\\tmy @cummin_input;\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\t$cummin_input[$index] = ($index+1)* @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\\n\\t\\t}\\n\\t\\tmy @cummin = cummin(\\\\@cummin_input);\\n\\t\\tmy @pmin = pmin(\\\\@cummin);\\n\\t\\tmy @ro = order(\\\\@o);\\n\\t\\t@qvalues = @pmin[@ro];\\n\\t} elsif ($method eq 'bh') {\\n\\t\\tmy @o = order($pvalues_ref, 'TRUE');\\n\\t\\tmy @cummin_input;\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\t$cummin_input[$index] = ($n/($n-$index))* @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\\n\\t\\t}\\n\\t\\tmy @ro = order(\\\\@o);\\n\\t\\tmy @cummin = cummin(\\\\@cummin_input);\\n\\t\\tmy @pmin = pmin(\\\\@cummin);\\n\\t\\t@qvalues = @pmin[@ro];\\n\\t} elsif ($method eq 'by') {\\n\\t\\tmy $q = 0.0;\\n\\t\\tmy @o = order($pvalues_ref, 'TRUE');\\n\\t\\tmy @ro = order(\\\\@o);\\n\\t\\tfor (my $index = 1; $index < ($n+1); $index++) {\\n\\t\\t\\t$q += 1.0 / $index;\\n\\t\\t}\\n\\t\\tmy @cummin_input;\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\t$cummin_input[$index] = $q * ($n/($n-$index)) * @$pvalues_ref[$o[$index]];#PVALUES[$o[$index]] is p[o]\\n\\t\\t}\\n#\\t\\tsay join (',', @cummin_input);\\n#\\t\\tsay '@cummin_input # of elements = ' . scalar @cummin_input;\\n\\t\\tmy @cummin = cummin(\\\\@cummin_input);\\n\\t\\tundef @cummin_input;\\n\\t\\tmy @pmin = pmin(\\\\@cummin);\\n\\t\\t@qvalues = @pmin[@ro];\\n\\t} elsif ($method eq 'bonferroni') {\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\tmy $q = @$pvalues_ref[$index]*$n;\\n\\t\\t\\tif ((0 <= $q) && ($q < 1)) {\\n\\t\\t\\t\\t$qvalues[$index] = $q;\\n\\t\\t\\t} elsif ($q >= 1) {\\n\\t\\t\\t\\t$qvalues[$index] = 1.0;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsay 'Failed to get Bonferroni adjusted p.';\\n\\t\\t\\t\\tdie;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} elsif ($method eq 'holm') {\\n\\t\\tmy @o = order($pvalues_ref);\\n\\t\\tmy @cummax_input;\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\t$cummax_input[$index] = ($n - $index) * @$pvalues_ref[$o[$index]];\\n\\t\\t}\\n\\t\\tmy @ro = order(\\\\@o);\\n\\t\\tundef @o;\\n\\t\\tmy @cummax = cummax(\\\\@cummax_input);\\n\\t\\tundef @cummax_input;\\n\\t\\tmy @pmin = pmin(\\\\@cummax);\\n\\t\\tundef @cummax;\\n\\t\\t@qvalues = @pmin[@ro];\\n\\t} elsif ($method eq 'hommel') {\\n\\t\\tmy @o = order($pvalues_ref);\\n\\t\\tmy @p = @$pvalues_ref[@o];\\n\\t\\tmy @ro = order(\\\\@o);\\n\\t\\tundef @o;\\n\\t\\tmy (@q, @pa);\\n\\t\\tmy $min = $n*$p[0];\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\tmy $temp = $n*$p[$index] / ($index + 1);\\n\\t\\t\\t$min = min($min, $temp);\\n\\t\\t}\\n\\t\\tfor (my $index = 0; $index < $n; $index++) {\\n\\t\\t\\t$pa[$index] = $min;#q <- pa <- rep.int(min(n * p/i), n)\\n\\t\\t\\t $q[$index] = $min;#q <- pa <- rep.int(min(n * p/i), n)\\n\\t\\t}\\n\\t\\tfor (my $j = ($n-1); $j >= 2; $j--) {\\n\\t\\t\\tmy @ij = 0..($n - $j);#ij <- seq_len(n - j + 1)\\n\\t\\t\\tmy $I2_LENGTH = $j - 1;\\n\\t\\t\\tmy @i2;\\n\\t\\t\\tfor (my $i = 0; $i < $I2_LENGTH; $i++) {\\n\\t\\t\\t\\t$i2[$i] = $n-$j+2+$i-1;\\n#R's indices are 1-based, C's are 0-based, I added the -1\\n\\t\\t\\t}\\n\\n\\t\\t\\tmy $q1 = $j * $p[$i2[0]] / 2.0;\\n\\t\\t\\tfor (my $i = 1; $i < $I2_LENGTH; $i++) {#loop through 2:j\\n\\t\\t\\t\\tmy $TEMP_Q1 = $j * $p[$i2[$i]] / (2 + $i);\\n\\t\\t\\t\\t$q1 = min($TEMP_Q1, $q1);\\n\\t\\t\\t}\\n\\t\\t\\tfor (my $i = 0; $i < ($n - $j + 1); $i++) {#q[ij] <- pmin(j * p[ij], q1)\\n\\t\\t\\t\\t$q[$ij[$i]] = min( $j*$p[$ij[$i]], $q1);\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (my $i = 0; $i < $I2_LENGTH; $i++) {#q[i2] <- q[n - j + 1]\\n\\t\\t\\t\\t$q[$i2[$i]] = $q[$n - $j];\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (my $i = 0; $i < $n; $i++) {#pa <- pmax(pa, q)\\n\\t\\t\\t\\tif ($pa[$i] < $q[$i]) {\\n\\t\\t\\t\\t\\t$pa[$i] = $q[$i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n#\\t\\t\\tprintf(\\\"j = %zu, pa = \\\\n\\\", j);\\n#\\t\\t\\t\\tdouble_say(pa, N);\\n\\t\\t}#end j loop\\n\\t\\t@qvalues = @pa[@ro];\\n\\t} else {\\n\\t\\tprint \\\"$method doesn't fit my types.\\\\n\\\";\\n\\t\\tdie\\n\\t}\\n\\t@qvalues\\n}\\nmy @pvalues = (4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03);\\n\\nmy %correct_answers = (\\n\\t'Benjamini-Hochberg' => [6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02],\\n\\t'Benjamini-Yekutieli' => [1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02],\\n\\t'Bonferroni' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01],\\n\\n\\t'Hochberg' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01],\\n\\t'Holm' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01],\\n\\n\\t'Hommel' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01]);\\n\\n\\nforeach my $method ('Hochberg','Benjamini-Hochberg','Benjamini-Yekutieli', 'Bonferroni', 'Holm', 'Hommel') {\\n\\tprint \\\"$method\\\\n\\\";\\n\\tmy @qvalues = p_adjust(\\\\@pvalues, $method);\\n\\tmy $error = 0.0;\\n\\tforeach my $q (0..$#qvalues) {\\n\\t\\t$error += abs($qvalues[$q] - $correct_answers{$method}[$q]);\\n\\t}\\n\\tprintf(\\\"type $method has cumulative error of %g.\\\\n\\\", $error);\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">UP</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DOWN</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">ratchet</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">direction</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">direction</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">UP</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]></span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]<</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sq_min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">schwartzian</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">direction</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">custom_sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">direction</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">UP</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pa</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ratchet</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">extract</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">)),</span> <span style=\\\"color: #000000;\\\">direction</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">extract</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pa</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">invert</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">adjust</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">method</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">mult</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #000000;\\\">method</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Benjamini-Hochberg\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #000000;\\\">mult</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_div</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sq_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">schwartzian</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">UP</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Benjamini-Yekutieli\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_div</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">mult</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_div</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sq_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">schwartzian</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">UP</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Bonferroni\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">sq_min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Hochberg\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">schwartzian</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">UP</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Holm\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #000000;\\\">mult</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">schwartzian</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">DOWN</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Hommel\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ivdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">size</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000000;\\\">ivdx</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">ivdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ivdx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">vslice</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ivdx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_div</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">mult</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">qh</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">pa</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">order</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">vslice</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ivdx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">lwr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">upr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">qmin</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">upr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]/</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">upr</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">qmin</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">upr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]]*</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">/(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">qmin</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lwr</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lwr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">lwr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]]*</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">qmin</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">upr</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">upr</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">pa</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pa</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qh</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">extract</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pa</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">order</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">invert</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"Sidak\\\"</span><span style=\\\"color: #0000FF;\\\">:</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #0000FF;\\\">-</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">size</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">p</span>\\n\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (unknown method)</span>\\n\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">p</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">types</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">correct_answers</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">({</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Benjamini-Hochberg\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">6.126681e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.521710e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.987205e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.891595e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.217789e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.301450e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.870370e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.301450e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.049731e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.826753e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">6.482629e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.253722e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.280973e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.769926e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.705703e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.241867e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.049731e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.856107e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.887526e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.136717e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">4.991891e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.769926e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.217789e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.301450e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.304958e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.832475e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.899547e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.521710e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.476843e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.683638e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.562902e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.516084e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.250189e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.636589e-03</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.562902e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.946883e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.166064e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.899547e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.688991e-03</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">4.502862e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.252228e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.881555e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.142613e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.846527e-03</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.562902e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.846527e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.101708e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.252032e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.205958e-02</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Benjamini-Yekutieli\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.940844e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.510676e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.114323e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.754486e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.644618e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">7.575031e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.153102e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.581959e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.812089e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.636176e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.153102e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.325863e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.774239e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.754486e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.209832e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.025930e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.634031e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.546073e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.413926e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.180552e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.153102e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.180552e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.956812e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.262838e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.925057e-02</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Bonferroni\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.019185e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.020365e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.516674e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.625735e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.909271e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.537741e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.125636e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.782670e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.803480e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.882294e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.005725e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.252228e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.713920e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.395577e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.088915e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.846527e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.305125e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.867745e-01</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Hochberg\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.632662e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.575885e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.383967e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.938014e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.600230e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.501973e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.383967e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.052971e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.426136e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.626366e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.656419e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">8.825610e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.252228e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.930759e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.394022e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.692284e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.023581e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.974152e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.172920e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.992520e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.179486e-01</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Holm\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.632662e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.000000e+00</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.575885e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.395341e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.938014e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.600230e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.501973e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.395341e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.052971e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.426136e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.626366e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.656419e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">8.825610e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.252228e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.930759e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.394022e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.692284e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.023581e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.974152e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.172920e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.992520e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.179486e-01</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Hommel\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.987624e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.595180e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.351895e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.766522e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.414256e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.304340e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.530937e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.887709e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.385602e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.322457e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.722920e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.426136e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.218158e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.581127e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">8.825610e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.252228e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.743649e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.016908e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.516461e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">9.582456e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.877222e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.172920e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.122276e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.950067e-01</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"Sidak\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9946598274</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9914285749</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999515274</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999999688</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999999995</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999998801</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999999855</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9231179729</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.9999999956</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9999317605</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.9983109511</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.5068253940</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.0000000000</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.9703301333</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.1832692440</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0150545753</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.4320729669</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.6993672225</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0286818157</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.0152621104</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.3391808707</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0656206307</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.4959194266</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0186503726</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.0009001752</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0000125222</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.8142104886</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.3772612062</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0430222116</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">0.0108312558</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0473319661</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.0032997780</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.7705015898</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0.2499384839</span><span style=\\\"color: #0000FF;\\\">}}})</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- {\\\"Unknown\\\",{1<nowiki>}}</nowiki>})</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">pValues</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4.533744e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.296024e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.936026e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.079658e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.801962e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">8.752257e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.922222e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.115421e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.355806e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.324867e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">4.926798e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.802978e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.485442e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.883130e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.729308e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">8.502518e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4.268138e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.442008e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.030266e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.001555e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">3.194810e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.892933e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.991834e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.745691e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.037516e-01</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.198578e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.966083e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.403837e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">7.328671e-01</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.793476e-02</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">4.040730e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.033349e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.125147e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.375072e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.818542e-04</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">3.075482e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.251272e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.356534e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1.360696e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.764588e-04</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">1.801145e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.504456e-07</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3.310253e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.427839e-03</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">8.791153e-04</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">2.177831e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">9.693054e-04</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">6.610250e-05</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2.900813e-02</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">5.735490e-03</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pValues</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pValues</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pValues</span><span style=\\\"color: #0000FF;\\\">)></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"p-values must be in range 0.0 to 1.0\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">types</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ti</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">types</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">adjust</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pValues</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">={}</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nSorry, do not know how to do %s correction.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">&</span>\\n <span style=\\\"color: #008000;\\\">\\\"Perhaps you want one of these?:\\\\n %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">types</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #008000;\\\">\\\"\\\\n \\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- printf(1,\\\"%s\\\\n\\\",{ti})\\n -- res = correct_answers[i] -- (for easier comparison only)\\n -- pp(res,{pp_FltFmt,\\\"%13.10f\\\",pp_IntFmt,\\\"%13.10f\\\",pp_Maxlen,75,pp_Pause,0})</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">error</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">correct_answers</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s has cumulative error of %g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">ti</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">error</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from __future__ import division\\nimport sys\\n\\ndef pminf(array):\\n x = 1\\n pmin_list = []\\n N = len(array)\\n for index in range(N):\\n if array[index] < x:\\n pmin_list.insert(index, array[index])\\n else:\\n pmin_list.insert(index, x)\\n return pmin_list\\n#end function\\n\\ndef cumminf(array):\\n cummin = []\\n cumulative_min = array[0]\\n for p in array:\\n if p < cumulative_min:\\n cumulative_min = p\\n cummin.append(cumulative_min)\\n return cummin\\n#end\\n\\ndef cummaxf(array):\\n cummax = []\\n cumulative_max = array[0]\\n for e in array:\\n if e > cumulative_max:\\n cumulative_max = e\\n cummax.append(cumulative_max)\\n return cummax\\n#end\\n\\ndef order(*args):\\n if len(args) > 1:\\n if args[1].lower() == 'false':# if ($string1 eq $string2) {\\n return sorted(range(len(args[0])), key = lambda k: args[0][k])\\n elif list(args[1].lower()) == list('true'):\\n return sorted(range(len(args[0])), key = lambda k: args[0][k], reverse = True)\\n else:\\n print \\\"%s isn't a recognized parameter\\\" % args[1]\\n sys.exit()\\n elif len(args) == 1:\\n return sorted(range(len(args[0])), key = lambda k: args[0][k])\\n#end\\n\\ndef p_adjust(*args):\\n method = \\\"bh\\\"\\n pvalues = args[0]\\n if len(args) > 1:\\n methods = {\\\"bh\\\", \\\"fdr\\\", \\\"by\\\", \\\"holm\\\", \\\"hommel\\\", \\\"bonferroni\\\", \\\"hochberg\\\"}\\n metharg = arg[1].lower()\\n if metharg in methods:\\n method = metharg\\n lp = len(pvalues)\\n n = lp\\n qvalues = []\\n\\n if method == 'hochberg':#already all lower case\\n o = order(pvalues, 'TRUE')\\n cummin_input = []\\n for index in range(n):\\n cummin_input.insert(index, (index+1)*pvalues[o[index]])\\n cummin = cumminf(cummin_input)\\n pmin = pminf(cummin)\\n ro = order(o)\\n qvalues = [pmin[i] for i in ro]\\n elif method == 'bh':\\n o = order(pvalues, 'TRUE')\\n cummin_input = []\\n for index in range(n):\\n cummin_input.insert(index, (n/(n-index))* pvalues[o[index]])\\n ro = order(o)\\n cummin = cumminf(cummin_input)\\n pmin = pminf(cummin)\\n qvalues = [pmin[i] for i in ro]\\n elif method == 'by':\\n q = 0.0\\n o = order(pvalues, 'TRUE')\\n ro = order(o)\\n for index in range(1, n+1):\\n q += 1.0 / index;\\n cummin_input = []\\n for index in range(n):\\n cummin_input.insert(index, q * (n/(n-index)) * pvalues[o[index]])\\n cummin = cumminf(cummin_input)\\n pmin = pminf(cummin)\\n qvalues = [pmin[i] for i in ro]\\n elif method == 'bonferroni':\\n for index in range(n):\\n q = pvalues[index] * n\\n if (0 <= q) and (q < 1):\\n qvalues.insert(index, q)\\n elif q >= 1:\\n qvalues.insert(index, 1)\\n else:\\n print '%g won\\\\'t give a Bonferroni adjusted p' % q\\n sys.exit()\\n elif method == 'holm':\\n o = order(pvalues)\\n cummax_input = []\\n for index in range(n):\\n cummax_input.insert(index, (n - index) * pvalues[o[index]])\\n ro = order(o)\\n cummax = cummaxf(cummax_input)\\n pmin = pminf(cummax)\\n qvalues = [pmin[i] for i in ro]\\n elif method == 'hommel':\\n i = range(1,n+1)\\n o = order(pvalues)\\n p = [pvalues[index] for index in o]\\n ro = order(o)\\n pa = []\\n q = []\\n smin = n*p[0]\\n for index in range(n):\\n temp = n*p[index] / (index + 1)\\n if temp < smin:\\n smin = temp\\n for index in range(n):\\n pa.insert(index, smin)\\n q.insert(index, smin)\\n for j in range(n-1,1,-1):\\n ij = range(1,n-j+2)\\n for x in range(len(ij)):\\n ij[x] -= 1\\n I2_LENGTH = j - 1\\n i2 = []\\n for index in range(I2_LENGTH+1):\\n i2.insert(index, n - j + 2 + index - 1)\\n q1 = j * p[i2[0]] / 2.0\\n for index in range(1,I2_LENGTH):\\n TEMP_Q1 = j * p[i2[index]] / (2.0 + index)\\n if TEMP_Q1 < q1:\\n q1 = TEMP_Q1\\n for index in range(n - j + 1):\\n q[ij[index]] = min(j * p[ij[index]], q1)\\n for index in range(I2_LENGTH):\\n q[i2[index]] = q[n-j]\\n for index in range(n):\\n if pa[index] < q[index]:\\n pa[index] = q[index]\\n qvalues = [pa[index] for index in ro]\\n else:\\n print \\\"method %s isn't defined.\\\" % method\\n sys.exit()\\n return qvalues\\n\\npvalues = [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03]\\n\\ncorrect_answers = {}\\n\\ncorrect_answers['bh'] = [6.126681e-01, 8.521710e-01, 1.987205e-01, 1.891595e-01, 3.217789e-01,\\n9.301450e-01, 4.870370e-01, 9.301450e-01, 6.049731e-01, 6.826753e-01,\\n6.482629e-01, 7.253722e-01, 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n9.241867e-01, 6.049731e-01, 7.856107e-01, 4.887526e-01, 1.136717e-01,\\n4.991891e-01, 8.769926e-01, 9.991834e-01, 3.217789e-01, 9.301450e-01,\\n2.304958e-01, 5.832475e-01, 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n1.683638e-02, 2.562902e-03, 3.516084e-02, 6.250189e-02, 3.636589e-03,\\n2.562902e-03, 2.946883e-02, 6.166064e-03, 3.899547e-02, 2.688991e-03,\\n4.502862e-04, 1.252228e-05, 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n2.562902e-03, 4.846527e-03, 1.101708e-03, 7.252032e-02, 2.205958e-02]\\n\\ncorrect_answers['by'] = [1.000000e+00, 1.000000e+00, 8.940844e-01, 8.510676e-01, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 5.114323e-01,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n7.575031e-02, 1.153102e-02, 1.581959e-01, 2.812089e-01, 1.636176e-02,\\n1.153102e-02, 1.325863e-01, 2.774239e-02, 1.754486e-01, 1.209832e-02,\\n2.025930e-03, 5.634031e-05, 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n1.153102e-02, 2.180552e-02, 4.956812e-03, 3.262838e-01, 9.925057e-02]\\n\\ncorrect_answers['bonferroni'] = [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 7.019185e-01, 1.000000e+00, 1.000000e+00,\\n2.020365e-01, 1.516674e-02, 5.625735e-01, 1.000000e+00, 2.909271e-02,\\n1.537741e-02, 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01, 4.395577e-02,\\n1.088915e-02, 4.846527e-02, 3.305125e-03, 1.000000e+00, 2.867745e-01]\\n\\ncorrect_answers['hochberg'] = [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.632662e-01, 9.991834e-01, 9.991834e-01,\\n1.575885e-01, 1.383967e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.383967e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01]\\n\\ncorrect_answers['holm'] = [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n1.000000e+00, 1.000000e+00, 4.632662e-01, 1.000000e+00, 1.000000e+00,\\n1.575885e-01, 1.395341e-02, 3.938014e-01, 7.600230e-01, 2.501973e-02,\\n1.395341e-02, 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01, 3.692284e-02,\\n1.023581e-02, 3.974152e-02, 3.172920e-03, 8.992520e-01, 2.179486e-01]\\n\\ncorrect_answers['hommel'] = [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n9.991834e-01, 9.991834e-01, 4.351895e-01, 9.991834e-01, 9.766522e-01,\\n1.414256e-01, 1.304340e-02, 3.530937e-01, 6.887709e-01, 2.385602e-02,\\n1.322457e-02, 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01, 3.516461e-02,\\n9.582456e-03, 3.877222e-02, 3.172920e-03, 8.122276e-01, 1.950067e-01]\\n\\nfor key in correct_answers.keys():\\n error = 0.0\\n q = p_adjust(pvalues, key)\\n for i in range(len(q)):\\n error += abs(q[i] - correct_answers[key][i])\\n print '%s error = %g' % (key.upper(), error)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"p <- c(4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03)\\n\\np.adjust(p, method = 'BH')\\nprint(\\\"Benjamini-Hochberg\\\")\\nwriteLines(\\\"\\\\n\\\")\\n\\np.adjust(p, method = 'BY')\\nprint(\\\"Benjamini & Yekutieli\\\")\\nwriteLines(\\\"\\\\n\\\")\\n\\np.adjust(p, method = 'bonferroni')\\nprint(\\\"Bonferroni\\\")\\nwriteLines(\\\"\\\\n\\\")\\n\\np.adjust(p, method = 'hochberg')\\nprint(\\\"Hochberg\\\")\\nwriteLines(\\\"\\\\n\\\");\\n\\np.adjust(p, method = 'hommel')\\nwriteLines(\\\"Hommel\\\\n\\\")\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"########################### Helper subs ###########################\\n\\nsub adjusted (@p, $type) { \\\"\\\\n$type\\\\n\\\" ~ format adjust( check(@p), $type ) }\\n\\nsub format ( @p, $cols = 5 ) {\\n my $i = -$cols;\\n my $fmt = \\\"%1.10f\\\";\\n join \\\"\\\\n\\\", @p.rotor($cols, :partial).map:\\n { sprintf \\\"[%2d] { join ' ', $fmt xx $_ }\\\", $i+=$cols, $_ };\\n}\\n\\nsub check ( @p ) { die 'p-values must be in range 0.0 to 1.0' if @p.min < 0 or 1 < @p.max; @p }\\n\\nmulti ratchet ( 'up', @p ) { my $m; @p[$_] min= $m, $m = @p[$_] for ^@p; @p }\\n\\nmulti ratchet ( 'dn', @p ) { my $m; @p[$_] max= $m, $m = @p[$_] for ^@p .reverse; @p }\\n\\nsub schwartzian ( @p, &transform, :$ratchet ) {\\n my @pa = @p.map( {[$_, $++]} ).sort( -*.[0] ).map: { [transform(.[0]), .[1]] };\\n @pa[*;0] = ratchet($ratchet, @pa»[0]);\\n @pa.sort( *.[1] )»[0]\\n}\\n\\n############# The various p-value correction routines #############\\n\\nmulti adjust( @p, 'Benjamini-Hochberg' ) {\\n @p.&schwartzian: * * @p / (@p - $++) min 1, :ratchet('up')\\n}\\n\\nmulti adjust( @p, 'Benjamini-Yekutieli' ) {\\n my \\\\r = ^@p .map( { 1 / ++$ } ).sum;\\n @p.&schwartzian: * * r * @p / (@p - $++) min 1, :ratchet('up')\\n}\\n\\nmulti adjust( @p, 'Hochberg' ) {\\n my \\\\m = @p.max;\\n @p.&schwartzian: * * ++$ min m, :ratchet('up')\\n}\\n\\nmulti adjust( @p, 'Holm' ) {\\n @p.&schwartzian: * * ++$ min 1, :ratchet('dn')\\n}\\n\\nmulti adjust( @p, 'Šidák' ) {\\n @p.&schwartzian: 1 - (1 - *) ** ++$, :ratchet('dn')\\n}\\n\\nmulti adjust( @p, 'Bonferroni' ) {\\n @p.map: * * @p min 1\\n}\\n\\n# Hommel correction can't be easily reduced to a one pass transform\\nmulti adjust( @p, 'Hommel' ) {\\n my @s = @p.map( {[$_, $++]} ).sort: *.[0] ; # sorted\\n my \\\\z = +@p; # array si(z)e\\n my @pa = @s»[0].map( * * z / ++$ ).min xx z; # p adjusted\\n my @q; # scratch array\\n for (1 ..^ z).reverse -> $i {\\n my @L = 0 .. z - $i; # lower indices\\n my @U = z - $i ^..^ z; # upper indices\\n my $q = @s[@U]»[0].map( { $_ * $i / (2 + $++) } ).min;\\n @q[@L] = @s[@L]»[0].map: { min $_ * $i, $q, @s[*-1][0] };\\n @pa = ^z .map: { max @pa[$_], @q[$_] }\\n }\\n @pa[@s[*;1].map( {[$_, $++]} ).sort( *.[0] )»[1]]\\n}\\n\\nmulti adjust ( @p, $unknown ) {\\n note \\\"\\\\nSorry, do not know how to do $unknown correction.\\\\n\\\" ~\\n \\\"Perhaps you want one of these?:\\\\n\\\" ~\\n <Benjamini-Hochberg Benjamini-Yekutieli Bonferroni Hochberg\\n Holm Hommel Šidák>.join(\\\"\\\\n\\\");\\n exit\\n}\\n\\n########################### The task ###########################\\n\\nmy @p-values =\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n;\\n\\nfor < Benjamini-Hochberg Benjamini-Yekutieli Bonferroni Hochberg Holm Hommel Šidák >\\n{\\n say adjusted @p-values, $_\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"def pmin(array)\\n x = 1\\n pmin_array = []\\n array.each_index do |i|\\n pmin_array[i] = [array[i], x].min\\n abort if pmin_array[i] > 1\\n end\\n pmin_array\\nend\\n\\ndef cummin(array)\\n cumulative_min = array[0]\\n arr_cummin = []\\n array.each do |p|\\n cumulative_min = [p, cumulative_min].min\\n arr_cummin.push(cumulative_min)\\n end\\n arr_cummin\\nend\\n\\ndef cummax(array)\\n cumulative_max = array[0]\\n arr_cummax = []\\n array.each do |p|\\n cumulative_max = [p, cumulative_max].max\\n arr_cummax.push(cumulative_max)\\n end\\n arr_cummax\\nend\\n\\n# decreasing variable is optional\\ndef order(array, decreasing = false)\\n if decreasing == false\\n array.sort.map { |n| array.index(n) }\\n else\\n array.sort.map { |n| array.index(n) }.reverse\\n end\\nend\\n\\ndef p_adjust(arr_pvalues, method = 'Holm')\\n lp = arr_pvalues.size\\n n = lp\\n if method.casecmp('hochberg').zero?\\n arr_o = order(arr_pvalues, true)\\n arr_cummin_input = []\\n (0..n).each do |index|\\n arr_cummin_input[index] = (index + 1) * arr_pvalues[arr_o[index].to_i]\\n end\\n arr_cummin = cummin(arr_cummin_input)\\n arr_pmin = pmin(arr_cummin)\\n arr_ro = order(arr_o)\\n return arr_pmin.values_at(*arr_ro)\\n elsif method.casecmp('bh').zero? || method.casecmp('benjamini-hochberg').zero?\\n arr_o = order(arr_pvalues, true)\\n arr_cummin_input = []\\n (0..(n - 1)).each do |i|\\n arr_cummin_input[i] = (n / (n - i).to_f) * arr_pvalues[arr_o[i]]\\n end\\n arr_ro = order(arr_o)\\n arr_cummin = cummin(arr_cummin_input)\\n arr_pmin = pmin(arr_cummin)\\n return arr_pmin.values_at(*arr_ro)\\n elsif method.casecmp('by').zero? || method.casecmp('benjamini-yekutieli').zero?\\n q = 0.0\\n arr_o = order(arr_pvalues, true)\\n arr_ro = order(arr_o)\\n (1..n).each do |index|\\n q += 1.0 / index\\n end\\n arr_cummin_input = []\\n (0..(n - 1)).each do |i|\\n arr_cummin_input[i] = q * (n / (n - i).to_f) * arr_pvalues[arr_o[i]]\\n end\\n arr_cummin = cummin(arr_cummin_input)\\n arr_pmin = pmin(arr_cummin)\\n return arr_pmin.values_at(*arr_ro)\\n elsif method.casecmp('bonferroni').zero?\\n arr_qvalues = []\\n (0..(n - 1)).each do |i|\\n q = arr_pvalues[i] * n\\n if (q >= 0) && (q < 1)\\n arr_qvalues[i] = q\\n elsif q >= 1\\n arr_qvalues[i] = 1.0\\n else\\n puts \\\"Falied to get Bonferroni adjusted p for #{arr_pvalues[i]}\\\"\\n end\\n end\\n return arr_qvalues\\n elsif method.casecmp('holm').zero?\\n o = order(arr_pvalues)\\n cummax_input = []\\n (0..(n - 1)).each do |index|\\n cummax_input[index] = (n - index) * arr_pvalues[o[index]]\\n end\\n ro = order(o)\\n arr_cummax = cummax(cummax_input)\\n arr_pmin = pmin(arr_cummax)\\n return arr_pmin.values_at(*ro)\\n elsif method.casecmp('hommel').zero?\\n o = order(arr_pvalues)\\n arr_p = arr_pvalues.values_at(*o)\\n ro = order(o)\\n q = []\\n pa = []\\n min = n * arr_p[0]\\n (0..(n - 1)).each do |index|\\n temp = n * arr_p[index] / (index + 1)\\n min = [min, temp].min\\n end\\n (0..(n - 1)).each do |index|\\n pa[index] = min\\n q[index] = min\\n end\\n j = n - 1\\n while j >= 2\\n ij = Array 0..(n - j)\\n i2_length = j - 1\\n i2 = []\\n (0..(i2_length - 1)).each do |i|\\n i2[i] = n - j + 2 + i - 1 # R's indices are 1-based, C's are 0-based\\n end\\n q1 = j * arr_p[i2[0]] / 2.0\\n (1..(i2_length - 1)).each do |i|\\n temp_q1 = j * arr_p[i2[i]] / (2 + i)\\n q1 = [temp_q1, q1].min\\n end\\n (0..(n - j)).each do |i|\\n tmp = j * arr_p[ij[i]]\\n q[ij[i]] = [tmp, q1].min\\n end\\n (0..(i2_length - 1)).each do |i|\\n q[i2[i]] = q[n - j]\\n end\\n (0..(n - 1)).each do |i|\\n pa[i] = q[i] if pa[i] < q[i]\\n end\\n j -= 1\\n end\\n return pa.values_at(*ro)\\n else\\n puts \\\"#{method} isn't accepted.\\\"\\n abort\\n end\\nend\\n\\npvalues =\\n [4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02,\\n 1.801962e-01, 8.752257e-01, 2.922222e-01, 9.115421e-01,\\n 4.355806e-01, 5.324867e-01, 4.926798e-01, 5.802978e-01,\\n 3.485442e-01, 7.883130e-01, 2.729308e-01, 8.502518e-01,\\n 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01,\\n 9.037516e-01, 1.198578e-01, 3.966083e-01, 1.403837e-02,\\n 7.328671e-01, 6.793476e-02, 4.040730e-03, 3.033349e-04,\\n 1.125147e-02, 2.375072e-02, 5.818542e-04, 3.075482e-04,\\n 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03,\\n 8.791153e-04, 2.177831e-04, 9.693054e-04, 6.610250e-05,\\n 2.900813e-02, 5.735490e-03]\\n\\ncorrect_answers = {\\n 'Benjamini-Hochberg' => [6.126681e-01, 8.521710e-01, 1.987205e-01,\\n 1.891595e-01, 3.217789e-01, 9.301450e-01,\\n 4.870370e-01, 9.301450e-01, 6.049731e-01,\\n 6.826753e-01, 6.482629e-01, 7.253722e-01,\\n 5.280973e-01, 8.769926e-01, 4.705703e-01,\\n 9.241867e-01, 6.049731e-01, 7.856107e-01,\\n 4.887526e-01, 1.136717e-01, 4.991891e-01,\\n 8.769926e-01, 9.991834e-01, 3.217789e-01,\\n 9.301450e-01, 2.304958e-01, 5.832475e-01,\\n 3.899547e-02, 8.521710e-01, 1.476843e-01,\\n 1.683638e-02, 2.562902e-03, 3.516084e-02,\\n 6.250189e-02, 3.636589e-03, 2.562902e-03,\\n 2.946883e-02, 6.166064e-03, 3.899547e-02,\\n 2.688991e-03, 4.502862e-04, 1.252228e-05,\\n 7.881555e-02, 3.142613e-02, 4.846527e-03,\\n 2.562902e-03, 4.846527e-03, 1.101708e-03,\\n 7.252032e-02, 2.205958e-02],\\n 'Benjamini-Yekutieli' => [1.000000e+00, 1.000000e+00, 8.940844e-01,\\n 8.510676e-01, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 5.114323e-01, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.754486e-01, 1.000000e+00, 6.644618e-01,\\n 7.575031e-02, 1.153102e-02, 1.581959e-01,\\n 2.812089e-01, 1.636176e-02, 1.153102e-02,\\n 1.325863e-01, 2.774239e-02, 1.754486e-01,\\n 1.209832e-02, 2.025930e-03, 5.634031e-05,\\n 3.546073e-01, 1.413926e-01, 2.180552e-02,\\n 1.153102e-02, 2.180552e-02, 4.956812e-03,\\n 3.262838e-01, 9.925057e-02],\\n 'Bonferroni' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 7.019185e-01,\\n 1.000000e+00, 1.000000e+00, 2.020365e-01, 1.516674e-02,\\n 5.625735e-01, 1.000000e+00, 2.909271e-02, 1.537741e-02,\\n 4.125636e-01, 6.782670e-02, 6.803480e-01, 1.882294e-02,\\n 9.005725e-04, 1.252228e-05, 1.000000e+00, 4.713920e-01,\\n 4.395577e-02, 1.088915e-02, 4.846527e-02, 3.305125e-03,\\n 1.000000e+00, 2.867745e-01],\\n\\n 'Hochberg' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 4.632662e-01,\\n 9.991834e-01, 9.991834e-01, 1.575885e-01, 1.383967e-02,\\n 3.938014e-01, 7.600230e-01, 2.501973e-02, 1.383967e-02,\\n 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01,\\n 3.692284e-02, 1.023581e-02, 3.974152e-02, 3.172920e-03,\\n 8.992520e-01, 2.179486e-01],\\n 'Holm' => [1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 1.000000e+00,\\n 1.000000e+00, 1.000000e+00, 1.000000e+00, 4.632662e-01,\\n 1.000000e+00, 1.000000e+00, 1.575885e-01, 1.395341e-02,\\n 3.938014e-01, 7.600230e-01, 2.501973e-02, 1.395341e-02,\\n 3.052971e-01, 5.426136e-02, 4.626366e-01, 1.656419e-02,\\n 8.825610e-04, 1.252228e-05, 9.930759e-01, 3.394022e-01,\\n 3.692284e-02, 1.023581e-02, 3.974152e-02, 3.172920e-03,\\n 8.992520e-01, 2.179486e-01],\\n\\n 'Hommel' => [9.991834e-01, 9.991834e-01, 9.991834e-01, 9.987624e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.595180e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 9.991834e-01,\\n 9.991834e-01, 9.991834e-01, 9.991834e-01, 4.351895e-01,\\n 9.991834e-01, 9.766522e-01, 1.414256e-01, 1.304340e-02,\\n 3.530937e-01, 6.887709e-01, 2.385602e-02, 1.322457e-02,\\n 2.722920e-01, 5.426136e-02, 4.218158e-01, 1.581127e-02,\\n 8.825610e-04, 1.252228e-05, 8.743649e-01, 3.016908e-01,\\n 3.516461e-02, 9.582456e-03, 3.877222e-02, 3.172920e-03,\\n 8.122276e-01, 1.950067e-01]\\n}\\n\\n# correct_answers.each do |method, answers|\\nmethods = ['Benjamini-Yekutieli', 'Benjamini-Hochberg', 'Hochberg',\\n 'Bonferroni', 'Holm', 'Hommel']\\nmethods.each do |method|\\n puts method\\n error = 0.0\\n arr_q = p_adjust(pvalues, method)\\n arr_q.each_index do |p|\\n error += (correct_answers[method][p] - arr_q[p])\\n end\\n puts \\\"total error for #{method} = #{error}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"use std::iter;\\n\\n#[rustfmt::skip]\\nconst PVALUES:[f64;50] = [\\n4.533_744e-01, 7.296_024e-01, 9.936_026e-02, 9.079_658e-02, 1.801_962e-01,\\n8.752_257e-01, 2.922_222e-01, 9.115_421e-01, 4.355_806e-01, 5.324_867e-01,\\n4.926_798e-01, 5.802_978e-01, 3.485_442e-01, 7.883_130e-01, 2.729_308e-01,\\n8.502_518e-01, 4.268_138e-01, 6.442_008e-01, 3.030_266e-01, 5.001_555e-02,\\n3.194_810e-01, 7.892_933e-01, 9.991_834e-01, 1.745_691e-01, 9.037_516e-01,\\n1.198_578e-01, 3.966_083e-01, 1.403_837e-02, 7.328_671e-01, 6.793_476e-02,\\n4.040_730e-03, 3.033_349e-04, 1.125_147e-02, 2.375_072e-02, 5.818_542e-04,\\n3.075_482e-04, 8.251_272e-03, 1.356_534e-03, 1.360_696e-02, 3.764_588e-04,\\n1.801_145e-05, 2.504_456e-07, 3.310_253e-02, 9.427_839e-03, 8.791_153e-04,\\n2.177_831e-04, 9.693_054e-04, 6.610_250e-05, 2.900_813e-02, 5.735_490e-03\\n];\\n\\n#[derive(Debug)]\\nenum CorrectionType {\\n BenjaminiHochberg,\\n BenjaminiYekutieli,\\n Bonferroni,\\n Hochberg,\\n Holm,\\n Hommel,\\n Sidak,\\n}\\n\\nenum SortDirection {\\n Increasing,\\n Decreasing,\\n}\\n\\n/// orders **input** vector by value and multiplies with **multiplier** vector\\n/// Finally returns the multiplied values in the original order of **input**\\nfn ordered_multiply(input: &[f64], multiplier: &[f64], direction: &SortDirection) -> Vec<f64> {\\n let order_by_value = match direction {\\n SortDirection::Increasing => {\\n |a: &(f64, usize), b: &(f64, usize)| b.0.partial_cmp(&a.0).unwrap()\\n }\\n SortDirection::Decreasing => {\\n |a: &(f64, usize), b: &(f64, usize)| a.0.partial_cmp(&b.0).unwrap()\\n }\\n };\\n\\n let cmp_minmax = match direction {\\n SortDirection::Increasing => |a: f64, b: f64| a.gt(&b),\\n SortDirection::Decreasing => |a: f64, b: f64| a.lt(&b),\\n };\\n\\n // add original order index\\n let mut input_indexed = input\\n .iter()\\n .enumerate()\\n .map(|(idx, &p_value)| (p_value, idx))\\n .collect::<Vec<_>>();\\n\\n // order by value desc/asc\\n input_indexed.sort_unstable_by(order_by_value);\\n\\n // do the multiplication in place, clamp it at 1.0,\\n // keep the original index in place\\n for i in 0..input_indexed.len() {\\n input_indexed[i] = (\\n f64::min(1.0, input_indexed[i].0 * multiplier[i]),\\n input_indexed[i].1,\\n );\\n }\\n\\n // make vector strictly monotonous increasing/decreasing in place\\n for i in 1..input_indexed.len() {\\n if cmp_minmax(input_indexed[i].0, input_indexed[i - 1].0) {\\n input_indexed[i] = (input_indexed[i - 1].0, input_indexed[i].1);\\n }\\n }\\n\\n // re-sort back to original order\\n input_indexed.sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.1.cmp(&b.1));\\n\\n // remove ordering index\\n let (resorted, _): (Vec<_>, Vec<_>) = input_indexed.iter().cloned().unzip();\\n resorted\\n}\\n\\n#[allow(clippy::cast_precision_loss)]\\nfn hommel(input: &[f64]) -> Vec<f64> {\\n // using algorith described:\\n // http://stat.wharton.upenn.edu/~steele/Courses/956/ResourceDetails/MultipleComparision/Writght92.pdf\\n\\n // add original order index\\n let mut input_indexed = input\\n .iter()\\n .enumerate()\\n .map(|(idx, &p_value)| (p_value, idx))\\n .collect::<Vec<_>>();\\n\\n // order by value asc\\n input_indexed\\n .sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.0.partial_cmp(&b.0).unwrap());\\n\\n let (p_values, order): (Vec<_>, Vec<_>) = input_indexed.iter().cloned().unzip();\\n\\n let n = input.len();\\n\\n // initial minimal n*p/i values\\n // get the smalles of these values\\n let min_result = (0..n)\\n .map(|i| ((p_values[i] * n as f64) / (i + 1) as f64))\\n .fold(1. / 0. /* -inf */, f64::min);\\n\\n // // initialize result vector with minimal values\\n let mut result = iter::repeat(min_result).take(n).collect::<Vec<_>>();\\n\\n for m in (2..n).rev() {\\n let cmin: f64;\\n let m_as_float = m as f64;\\n let mut a = p_values.clone();\\n // println!(\\\"\\\\nn: {}\\\", m);\\n {\\n // split p-values into two group\\n let (_, second) = p_values.split_at(n - m + 1);\\n\\n // calculate minumum of m*p/i for this second group\\n cmin = second\\n .iter()\\n .zip(2..=m)\\n .map(|(p, i)| (m_as_float * p) / i as f64)\\n .fold(1. / 0. /* inf */, f64::min);\\n }\\n\\n // replace p values if p<cmin in the second group\\n ((n - m + 1)..n).for_each(|i| a[i] = a[i].max(cmin));\\n\\n // replace p values if min(cmin, m*p) > p\\n (0..=(n - m)).for_each(|i| a[i] = a[i].max(f64::min(cmin, m_as_float * p_values[i])));\\n\\n // store in the result vector if any adjusted p is higher than the current one\\n (0..n).for_each(|i| result[i] = result[i].max(a[i]));\\n }\\n\\n // re-sort into the original order\\n let mut result = result\\n .into_iter()\\n .zip(order.into_iter())\\n .map(|(p, idx)| (p, idx))\\n .collect::<Vec<_>>();\\n result.sort_unstable_by(|a: &(f64, usize), b: &(f64, usize)| a.1.cmp(&b.1));\\n let (result, _): (Vec<_>, Vec<_>) = result.iter().cloned().unzip();\\n result\\n}\\n#[allow(clippy::cast_precision_loss)]\\nfn p_value_correction(p_values: &[f64], ctype: &CorrectionType) -> Vec<f64> {\\n let p_vec = p_values.to_vec();\\n if p_values.is_empty() {\\n return p_vec;\\n }\\n\\n let fsize = p_values.len() as f64;\\n\\n match ctype {\\n CorrectionType::BenjaminiHochberg => {\\n let multiplier = (0..p_values.len())\\n .map(|index| fsize / (fsize - index as f64))\\n .collect::<Vec<_>>();\\n\\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\\n }\\n CorrectionType::BenjaminiYekutieli => {\\n let q: f64 = (1..=p_values.len()).map(|index| 1. / index as f64).sum();\\n let multiplier = (0..p_values.len())\\n .map(|index| q * fsize / (fsize - index as f64))\\n .collect::<Vec<_>>();\\n\\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\\n }\\n CorrectionType::Bonferroni => p_vec\\n .iter()\\n .map(|p| f64::min(p * fsize, 1.0))\\n .collect::<Vec<_>>(),\\n CorrectionType::Hochberg => {\\n let multiplier = (0..p_values.len())\\n .map(|index| 1. + index as f64)\\n .collect::<Vec<_>>();\\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Increasing)\\n }\\n CorrectionType::Holm => {\\n let multiplier = (0..p_values.len())\\n .map(|index| fsize - index as f64)\\n .collect::<Vec<_>>();\\n\\n ordered_multiply(&p_vec, &multiplier, &SortDirection::Decreasing)\\n }\\n CorrectionType::Sidak => p_vec\\n .iter()\\n .map(|x| 1. - (1. - x).powf(fsize))\\n .collect::<Vec<_>>(),\\n CorrectionType::Hommel => hommel(&p_vec),\\n }\\n}\\n\\n// prints array into a nice table, max 5 floats/row\\nfn array_to_string(a: &[f64]) -> String {\\n a.chunks(5)\\n .enumerate()\\n .map(|(index, e)| {\\n format!(\\n \\\"[{:>2}]: {}\\\",\\n index * 5,\\n e.iter()\\n .map(|x| format!(\\\"{:>1.10}\\\", x))\\n .collect::<Vec<_>>()\\n .join(\\\", \\\")\\n )\\n })\\n .collect::<Vec<_>>()\\n .join(\\\"\\\\n\\\")\\n}\\nfn main() {\\n let ctypes = [\\n CorrectionType::BenjaminiHochberg,\\n CorrectionType::BenjaminiYekutieli,\\n CorrectionType::Bonferroni,\\n CorrectionType::Hochberg,\\n CorrectionType::Holm,\\n CorrectionType::Sidak,\\n CorrectionType::Hommel,\\n ];\\n\\n for ctype in &ctypes {\\n println!(\\\"\\\\n{:?}:\\\", ctype);\\n println!(\\\"{}\\\", array_to_string(&p_value_correction(&PVALUES, ctype)));\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"data pvalues;\\ninput raw_p @@;\\ncards;\\n4.533744e-01 7.296024e-01 9.936026e-02 9.079658e-02 1.801962e-01\\n8.752257e-01 2.922222e-01 9.115421e-01 4.355806e-01 5.324867e-01\\n4.926798e-01 5.802978e-01 3.485442e-01 7.883130e-01 2.729308e-01\\n8.502518e-01 4.268138e-01 6.442008e-01 3.030266e-01 5.001555e-02\\n3.194810e-01 7.892933e-01 9.991834e-01 1.745691e-01 9.037516e-01\\n1.198578e-01 3.966083e-01 1.403837e-02 7.328671e-01 6.793476e-02\\n4.040730e-03 3.033349e-04 1.125147e-02 2.375072e-02 5.818542e-04\\n3.075482e-04 8.251272e-03 1.356534e-03 1.360696e-02 3.764588e-04\\n1.801145e-05 2.504456e-07 3.310253e-02 9.427839e-03 8.791153e-04\\n2.177831e-04 9.693054e-04 6.610250e-05 2.900813e-02 5.735490e-03\\n;\\nrun;\\n\\nproc multtest pdata=pvalues bon sid hom hoc holm;\\nrun;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"ssc install qqvalue\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"clear\\n\\n#delimit ;\\ninput p;\\n4.533744e-01;7.296024e-01;9.936026e-02;9.079658e-02;1.801962e-01;\\n8.752257e-01;2.922222e-01;9.115421e-01;4.355806e-01;5.324867e-01;\\n4.926798e-01;5.802978e-01;3.485442e-01;7.883130e-01;2.729308e-01;\\n8.502518e-01;4.268138e-01;6.442008e-01;3.030266e-01;5.001555e-02;\\n3.194810e-01;7.892933e-01;9.991834e-01;1.745691e-01;9.037516e-01;\\n1.198578e-01;3.966083e-01;1.403837e-02;7.328671e-01;6.793476e-02;\\n4.040730e-03;3.033349e-04;1.125147e-02;2.375072e-02;5.818542e-04;\\n3.075482e-04;8.251272e-03;1.356534e-03;1.360696e-02;3.764588e-04;\\n1.801145e-05;2.504456e-07;3.310253e-02;9.427839e-03;8.791153e-04;\\n2.177831e-04;9.693054e-04;6.610250e-05;2.900813e-02;5.735490e-03;\\nend;\\n#delimit cr\\n\\nloc meth bonferroni sidak holm holland hochberg simes yekutieli\\nforeach m in `meth' {\\n\\tqqvalue p, method(`m') qvalue(`m')\\n}\\n\\nlist\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Enum\\nimport \\\"./fmt\\\" for Fmt\\nimport \\\"./seq\\\" for Lst\\nimport \\\"./math\\\" for Nums\\nimport \\\"./sort\\\" for Sort\\n\\nvar Direction = Enum.create(\\\"Direction\\\", [\\\"UP\\\", \\\"DOWN\\\"])\\n\\n// test also for 'Unknown' correction type\\nvar types = [\\n \\\"Benjamini-Hochberg\\\", \\\"Benjamini-Yekutieli\\\", \\\"Bonferroni\\\", \\\"Hochberg\\\",\\n \\\"Holm\\\", \\\"Hommel\\\", \\\"Šidák\\\", \\\"Unknown\\\"\\n]\\n\\nvar pFormat = Fn.new { |p, cols|\\n var i = -cols\\n var fmt = \\\"$1.10f\\\"\\n return Lst.chunks(p, cols).map { |chunk|\\n i = i + cols\\n return Fmt.swrite(\\\"[$2d $s\\\", i, chunk.map { |v| Fmt.swrite(fmt, v) }.join(\\\" \\\"))\\n }.join(\\\"\\\\n\\\")\\n}\\n\\nvar check = Fn.new { |p|\\n if (p.count == 0 || Nums.min(p) < 0 || Nums.max(p) > 1) {\\n Fiber.abort(\\\"p-values must be in range 0 to 1\\\")\\n }\\n return p\\n}\\n\\nvar ratchet = Fn.new { |p, dir|\\n var pp = p.toList\\n var m = pp[0]\\n if (dir == Direction.UP) {\\n for (i in 1...pp.count) {\\n if (pp[i] > m) pp[i] = m\\n m = pp[i]\\n }\\n } else {\\n for (i in 1...pp.count) {\\n if (pp[i] < m) pp[i] = m\\n m = pp[i]\\n }\\n }\\n return pp.map { |v| (v < 1) ? v : 1 }.toList\\n}\\n\\nvar schwartzian = Fn.new { |p, mult, dir|\\n var size = p.count\\n var pwi = List.filled(size, null)\\n for (i in 0...size) pwi[i] = [i, p[i]]\\n var cmp = (dir == Direction.UP) ? Fn.new { |a, b| (b[1] - a[1]).sign } :\\n Fn.new { |a, b| (a[1] - b[1]).sign }\\n var order = Sort.merge(pwi, cmp).map { |e| e[0] }.toList\\n var pa = List.filled(size, 0)\\n for (i in 0...size) pa[i] = mult[i] * p[order[i]]\\n pa = ratchet.call(pa, dir)\\n var owi = List.filled(order.count, null)\\n for (i in 0...order.count) owi[i] = [i, order[i]]\\n cmp = Fn.new { |a, b| (a[1] - b[1]).sign }\\n var order2 = Sort.merge(owi, cmp).map { |e| e[0] }.toList\\n var res = List.filled(size, 0)\\n for (i in 0...size) res[i] = pa[order2[i]]\\n return res\\n}\\n\\nvar adjust = Fn.new { |p, type|\\n var size = p.count\\n if (size == 0) Fiber.abort(\\\"List cannot be empty.\\\")\\n if (type == \\\"Benjamini-Hochberg\\\") {\\n var mult = List.filled(size, 0)\\n for (i in 0...size) mult[i] = size / (size - i)\\n return schwartzian.call(p, mult, Direction.UP)\\n\\n } else if (type == \\\"Benjamini-Yekutieli\\\") {\\n var q = (1..size).reduce { |acc, i| acc + 1/i }\\n var mult = List.filled(size, 0)\\n for (i in 0...size) mult[i] = q * size / (size - i)\\n return schwartzian.call(p, mult, Direction.UP)\\n\\n } else if (type == \\\"Bonferroni\\\") {\\n return p.map { |v| (v * size).min(1) }.toList\\n\\n } else if (type == \\\"Hochberg\\\") {\\n var mult = List.filled(size, 0)\\n for (i in 0...size) mult[i] = i + 1\\n return schwartzian.call(p, mult, Direction.UP)\\n\\n } else if (type == \\\"Holm\\\") {\\n var mult = List.filled(size, 0)\\n for (i in 0...size) mult[i] = size - i\\n return schwartzian.call(p, mult, Direction.DOWN)\\n\\n } else if (type == \\\"Hommel\\\") {\\n var pwi = List.filled(size, null)\\n for (i in 0...size) pwi[i] = [i, p[i]]\\n var cmp = Fn.new { |a, b| (a[1] - b[1]).sign }\\n var order = Sort.merge(pwi, cmp).map { |e| e[0] }.toList\\n var s = List.filled(size, 0)\\n for (i in 0...size) s[i] = p[order[i]]\\n var m = List.filled(size, 0)\\n for (i in 0...size) m[i] = s[i] * size / (i + 1)\\n var min = Nums.min(m)\\n var q = List.filled(size, min)\\n var pa = List.filled(size, min)\\n for (j in size-1..2) {\\n var lower = List.filled(size - j + 1, 0) // lower indices\\n for (i in 0...lower.count) lower[i] = i\\n var upper = List.filled(j - 1, 0) // upper indices\\n for (i in 0...upper.count) upper[i] = size - j + 1 + i\\n var qmin = j * s[upper[0]] / 2\\n for (i in 1...upper.count) {\\n var temp = s[upper[i]] * j / (2 + i)\\n if (temp < qmin) qmin = temp\\n }\\n for (i in 0...lower.count) {\\n q[lower[i]] = qmin.min(s[lower[i]] * j)\\n }\\n for (i in 0...upper.count) q[upper[i]] = q[size - j]\\n for (i in 0...size) if (pa[i] < q[i]) pa[i] = q[i]\\n }\\n var owi = List.filled(order.count, null)\\n for (i in 0...order.count) owi[i] = [i, order[i]]\\n var order2 = Sort.merge(owi, cmp).map { |e| e[0] }.toList\\n var res = List.filled(size, 0)\\n for (i in 0...size) res[i] = pa[order2[i]]\\n return res\\n\\n } else if (type == \\\"Šidák\\\") {\\n return p.map { |v| 1 - (1 - v).pow(size) }.toList\\n\\n } else {\\n System.print(\\\"\\\\nSorry, do not know how to do '%(type)' correction.\\\\n\\\" +\\n \\\"Perhaps you want one of these?:\\\\n\\\" +\\n types[0...-1].map { |t| \\\" %(t)\\\" }.join(\\\"\\\\n\\\")\\n )\\n Fiber.suspend()\\n }\\n}\\n\\nvar adjusted = Fn.new { |p, type| \\\"\\\\n%(type)\\\\n%(pFormat.call(adjust.call(check.call(p), type), 5))\\\" }\\n\\nvar pValues = [\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03\\n]\\ntypes.each { |type| System.print(adjusted.call(pValues, type)) }\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn bh(pvalues){\\t// Benjamini-Hochberg\\n psz,pszf := pvalues.len(), psz.toFloat();\\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\\n in\\t := psz.pump(List,'wrap(n){ n_i[n]*pvalues[o[n]] });\\n pmin := cummin(in).apply((1.0).min); # (min(1,c[0]),min(1,c[1]),...)\\n ro.apply(pmin.get);\\t\\t# (pmin[ro[0]],pmin[ro[1]],...)\\n}\\n\\nfcn by(pvalues){\\t// Benjamini & Yekutieli\\n psz,pszf := pvalues.len(), psz.toFloat();\\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\\n q\\t := [1..psz].reduce(fcn(q,n){ q+=1.0/n },0.0);\\n in\\t := psz.pump(List,'wrap(n){ q * n_i[n] * pvalues[o[n]] });\\n cummin(in).apply((1.0).min) : ro.apply(_.get);\\n}\\n\\nfcn hochberg(pvalues){\\n psz,pszf := pvalues.len(), psz.toFloat();\\n o,ro := order(pvalues,True),order(o,False); # sort pvalues, sort indices\\n n_i := psz.pump(List,'wrap(n){ pszf/(psz - n) }); # N/(N-0),N/(N-1),..\\n in\\t := psz.pump(List,'wrap(n){ pvalues[o[n]]*(n + 1) });\\n cummin(in).apply((1.0).min) : ro.apply(_.get);\\n}\\n\\nfcn cummin(pvalues){ // R's cumulative minima --> list of mins\\n out,m := List.createLong(pvalues.len()), pvalues[0];\\n foreach pv in (pvalues){ out.append(m=m.min(pv)) }\\n out\\n}\\nfcn order(list,downUp){ // True==increasing, --> List(int) sorted indices\\n f:=(downUp) and fcn(a,b){ a[1]>b[1] } or fcn(a,b){ a[1]<b[1] };\\n [0..].zip(list).pump(List()).sort(f).pump(List,T(\\\"get\\\",0))\\n}\\n\\nfcn bonferroni(pvalues){ // -->List\\n sz,r := pvalues.len(),List();\\n foreach pv in (pvalues){\\n b:=pv*sz;\\n if(b>=1.0) r.append(1.0);\\n else if(0.0<=b<1.0) r.append(b);\\n else throw(Exception.ValueError(\\n\\t \\\"%g is outside of the interval I planned.\\\".fmt(b)));\\n }\\n r\\n}\\n\\nfcn hommel(pvalues){\\n psz,indices := pvalues.len(), [1..psz].walk();\\t// 1,2,3,4...\\n o,ro := order(pvalues,False),order(o,False); # sort pvalues, sort indices\\n p := o.apply('wrap(n){ pvalues[n] }).copy(); // pvalues[*o]\\n npi := [1..].zip(p).apply('wrap([(n,p)]){ p*psz/n });\\n min\\t := (0.0).min(npi);\\t // min value in npi\\n pa,q\\t := List.createLong(psz,min), pa.copy(); #(min,min,,,)\\n foreach j in ([psz - 1..2,-1]){\\n ij:=[0..psz - j].walk();\\n i2:=(j - 1).pump(List,'+(psz - j + 1));\\n q1:=(0.0).min((j-1).pump(List,'wrap(n){ p[i2[n]]*j/(2 + n) }));\\n foreach i in (psz - j + 1){ q[ij[i]] = q1.min(p[ij[i]]*j) }\\n foreach i in (j - 1){ q[i2[i]] = q[psz - j] }\\n foreach i in (psz){ pa[i] = pa[i].max(q[i]) }\\n }\\n psz.pump(List,'wrap(n){ pa[ro[n]] }); // Hommel q-values\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"pvalues:=T(\\n 4.533744e-01, 7.296024e-01, 9.936026e-02, 9.079658e-02, 1.801962e-01,\\n 8.752257e-01, 2.922222e-01, 9.115421e-01, 4.355806e-01, 5.324867e-01,\\n 4.926798e-01, 5.802978e-01, 3.485442e-01, 7.883130e-01, 2.729308e-01,\\n 8.502518e-01, 4.268138e-01, 6.442008e-01, 3.030266e-01, 5.001555e-02,\\n 3.194810e-01, 7.892933e-01, 9.991834e-01, 1.745691e-01, 9.037516e-01,\\n 1.198578e-01, 3.966083e-01, 1.403837e-02, 7.328671e-01, 6.793476e-02,\\n 4.040730e-03, 3.033349e-04, 1.125147e-02, 2.375072e-02, 5.818542e-04,\\n 3.075482e-04, 8.251272e-03, 1.356534e-03, 1.360696e-02, 3.764588e-04,\\n 1.801145e-05, 2.504456e-07, 3.310253e-02, 9.427839e-03, 8.791153e-04,\\n 2.177831e-04, 9.693054e-04, 6.610250e-05, 2.900813e-02, 5.735490e-03);\\n\\nbh(pvalues)\\t : format(_,\\\"\\\\nBenjamini-Hochberg\\\");\\nby(pvalues)\\t : format(_,\\\"\\\\nBenjamini & Yekutieli\\\");\\nbonferroni(pvalues) : format(_,\\\"\\\\nBonferroni\\\");\\nhochberg(pvalues) : format(_,\\\"\\\\nHochberg\\\");\\nhommel(pvalues)\\t : format(_,\\\"\\\\nHommel\\\");\\n\\nfcn format(list,title){\\n print(title,\\\":\\\");\\n foreach n in ([1..list.len(),5]){\\n print(\\\"\\\\n[%2d]:\\\".fmt(n));\\n foreach x in (list[n-1,5]){ print(\\\" %.6e\\\".fmt(x)) }\\n }\\n println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"P-value-correction"}}},{"rowIdx":1475,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Padovan_sequence\n","language":"00-META"},{"code":"The [[wp:Padovan sequence|Padovan sequence]] is similar to the [[wp:Fibonacci sequence|Fibonacci sequence]] in several ways.\nSome are given in the table below, and the referenced video shows some of the geometric\nsimilarities.\n\n::{| class=\"wikitable\"\n! Comment !! Padovan !! Fibonacci\n|-\n| || || \n|-\n| Named after. || Richard Padovan || Leonardo of Pisa: Fibonacci\n|-\n| || || \n|-\n| Recurrence initial values. || P(0)=P(1)=P(2)=1 || F(0)=0, F(1)=1\n|-\n| Recurrence relation. || P(n)=P(n-2)+P(n-3) || F(n)=F(n-1)+F(n-2)\n|-\n| || || \n|-\n| First 10 terms. || 1,1,1,2,2,3,4,5,7,9 || 0,1,1,2,3,5,8,13,21,34\n|-\n| || || \n|-\n| Ratio of successive terms... || Plastic ratio, p || Golden ratio, g\n|-\n| || 1.324717957244746025960908854… || 1.6180339887498948482...\n|-\n| Exact formula of ratios p and q. || ((9+69**.5)/18)**(1/3) + ((9-69**.5)/18)**(1/3) || (1+5**0.5)/2\n|-\n| Ratio is real root of polynomial. || p: x**3-x-1 || g: x**2-x-1\n|-\n| || || \n|-\n| Spirally tiling the plane using. || Equilateral triangles || Squares\n|-\n| || || \n|-\n| Constants for ... || s= 1.0453567932525329623 || a=5**0.5\n|-\n| ... Computing by truncation. || P(n)=floor(p**(n-1) / s + .5) || F(n)=floor(g**n / a + .5)\n|-\n| || || \n|-\n| L-System Variables. || A,B,C || A,B\n|-\n| L-System Start/Axiom. || A || A\n|-\n| L-System Rules. || A->B,B->C,C->AB || A->B,B->AB\n|}\n\n;Task:\n* Write a function/method/subroutine to compute successive members of the Padovan series using the recurrence relation.\n* Write a function/method/subroutine to compute successive members of the Padovan series using the floor function.\n* Show the first twenty terms of the sequence.\n* Confirm that the recurrence and floor based functions give the same results for 64 terms,\n* Write a function/method/... using the [[wp:L-system|L-system]] to generate successive strings.\n* Show the first 10 strings produced from the L-system\n* Confirm that the length of the first 32 strings produced is the Padovan sequence.\n\nShow output here, on this page.\n\n;Ref:\n* [https://www.youtube.com/watch?v=PsGUEj4w9Cc The Plastic Ratio] - Numberphile video.\n\n\n","language":"00-TASK"},{"code":"V pp = 1.324717957244746025960908854\nV ss = 1.0453567932525329623\nV Rules = [‘A’ = ‘B’, ‘B’ = ‘C’, ‘C’ = ‘AB’]\n\nF padovan1(n)\n V r = [1] * min(n, 3)\n V (a, b, c) = (1, 1, 1)\n V count = 3\n L count < n\n (a, b, c) = (b, c, a + b)\n r [+]= c\n count++\n R r\n\nF padovan2(n)\n V r = [1] * (n > 1)\n V p = 1.0\n V count = 1\n L count < n\n r [+]= Int(round(p / :ss))\n p *= :pp\n count++\n R r\n\nF padovan3(n)\n [String] r\n V s = ‘A’\n V count = 0\n L count < n\n r [+]= s\n V next = ‘’\n L(ch) s\n next ‘’= Rules[ch]\n s = next\n count++\n R r\n\nprint(‘First 20 terms of the Padovan sequence:’)\nprint(padovan1(20).join(‘ ’))\n\nV list1 = padovan1(64)\nV list2 = padovan2(64)\nprint(‘The first 64 iterative and calculated values ’(I list1 == list2 {‘are the same.’} E ‘differ.’))\n\nprint()\nprint(‘First 10 L-system strings:’)\nprint(padovan3(10).join(‘ ’))\nprint()\nprint(‘Lengths of the 32 first L-system strings:’)\nV list3 = padovan3(32).map(x -> x.len)\nprint(list3.join(‘ ’))\nprint(‘These lengths are’(I list3 == list1[0.<32] {‘ ’} E ‘ not ’)‘the 32 first terms of the Padovan sequence.’)\n","language":"11l"},{"code":"BEGIN # show members of the Padovan Sequence calculated in various ways #\n # returns the first n elements of the Padovan sequence by the #\n # recurance relation: P(n)=P(n-2)+P(n-3)\t #\n OP PADOVANI = ( INT n )[]INT:\n BEGIN\n [ 0 : n - 1 ]INT p; p[ 0 ] := p[ 1 ] := p[ 2 ] := 1;\n FOR i FROM 3 TO UPB p DO\n p[ i ] := p[ i - 2 ] + p[ i - 3 ]\n OD;\n p\n END; # PADOVANI #\n # returns the first n elements of the Padovan sequence by #\n # computing by truncation P(n)=floor(p^(n-1) / s + .5) #\n # where s = 1.0453567932525329623 #\n # and p = the \"plastic ratio\" #\n OP PADOVANC = ( INT n )[]INT:\n BEGIN\n LONG REAL s = 1.0453567932525329623;\n LONG REAL p = 1.324717957244746025960908854;\n LONG REAL pf := 1 / p;\n [ 0 : n - 1 ]INT result;\n FOR i FROM LWB result TO UPB result DO\n result[ i ] := SHORTEN ENTIER ( pf / s + 0.5 );\n pf *:= p\n OD;\n result\n END; # PADOVANC #\n # returns the first n L System strings of the Padovan sequence #\n OP PADOVANL = ( INT n )[]STRING:\n BEGIN\n [ 0 : n - 1 ]STRING l; l[ 0 ] := \"A\"; l[ 1 ] := \"B\"; l[ 2 ] := \"C\";\n FOR i FROM 3 TO UPB l DO\n l[ i ] := l[ i - 3 ] + l[ i - 2 ]\n OD;\n l\n END; # PADOVANC #\n # returns TRUE if a and b have the same values, FALSE otherwise #\n OP = = ( []INT a, b )BOOL:\n IF LWB a /= LWB b OR UPB a /= UPB b\n THEN # rows are not the same size # FALSE\n ELSE\n BOOL result := TRUE;\n FOR i FROM LWB a TO UPB a WHILE result := a[ i ] = b[ i ] DO SKIP OD;\n result\n FI; # = #\n # returns the number of elements in a #\n OP LENGTH = ( []INT a )INT: ( UPB a - LWB a ) + 1;\n # returns the number of characters in s #\n OP LENGTH = ( STRING s )INT: ( UPB s - LWB s ) + 1;\n # returns a string representation of n #\n OP TOSTRING = ( INT n )STRING: whole( n, 0 );\n # generate 64 elements of the sequence and 32 L System values #\n []INT iterative = PADOVANI 64;\n []INT calculated = PADOVANC 64;\n []STRING l system = PADOVANL 32;\n [ LWB l system : UPB l system ]INT l length;\n FOR i FROM LWB l length TO UPB l length DO l length[ i ] := LENGTH l system[ i ] OD;\n # first 20 terms #\n print( ( \"First 20 terms of the Padovan Sequence\", newline ) );\n FOR i FROM LWB iterative TO 19 DO\n print( ( \" \", TOSTRING iterative[ i ] ) )\n OD;\n print( ( newline ) );\n print( ( \"The first \"\n , TOSTRING LENGTH iterative\n , \" iterative and calculated values \"\n , IF iterative = calculated THEN \"are the same\" ELSE \"differ\" FI\n , newline\n )\n );\n # print the first 10 values of the L System strings #\n print( ( newline, \"First 10 L System strings\", newline ) );\n FOR i FROM LWB l system TO 9 DO\n print( ( \" \", l system[ i ] ) )\n OD;\n print( ( newline ) );\n print( ( \"The first \"\n , TOSTRING LENGTH l length\n , \" iterative values and L System lengths \"\n , IF l length = iterative[ LWB l length : UPB l length @ LWB l length ] THEN \"are the same\" ELSE \"differ\" FI\n , newline\n )\n )\nEND\n","language":"ALGOL-68"},{"code":"--------------------- PADOVAN NUMBERS --------------------\n\n-- padovans :: [Int]\non padovans()\n script f\n on |λ|(abc)\n set {a, b, c} to abc\n\n {a, {b, c, a + b}}\n end |λ|\n end script\n\n unfoldr(f, {1, 1, 1})\nend padovans\n\n\n-- padovanFloor :: [Int]\non padovanFloor()\n script f\n property p : 1.324717957245\n property s : 1.045356793253\n on |λ|(n)\n {floor(0.5 + ((p ^ (n - 1)) / s)), 1 + n}\n end |λ|\n end script\n\n unfoldr(f, 0)\nend padovanFloor\n\n\n-- padovanLSystem :: [String]\non padovanLSystem()\n script rule\n on |λ|(c)\n if \"A\" = c then\n \"B\"\n else if \"B\" = c then\n \"C\"\n else\n \"AB\"\n end if\n end |λ|\n end script\n\n script f\n on |λ|(s)\n {s, concatMap(rule, characters of s) as string}\n end |λ|\n end script\n\n unfoldr(f, \"A\")\nend padovanLSystem\n\n\n--------------------------- TEST -------------------------\non run\n unlines({\"First 20 padovans:\", ¬\n showList(take(20, padovans())), ¬\n \"\", ¬\n \"The recurrence and floor-based functions\", ¬\n \"match over the first 64 terms:\\n\", ¬\n prefixesMatch(padovans(), padovanFloor(), 64), ¬\n \"\", ¬\n \"First 10 L-System strings:\", ¬\n showList(take(10, padovanLSystem())), ¬\n \"\", ¬\n \"The lengths of the first 32 L-System\", ¬\n \"strings match the Padovan sequence:\\n\", ¬\n prefixesMatch(padovans(), fmap(|length|, padovanLSystem()), 32)})\nend run\n\n\n-- prefixesMatch :: [a] -> [a] -> Bool\non prefixesMatch(xs, ys, n)\n take(n, xs) = take(n, ys)\nend prefixesMatch\n\n\n------------------------- GENERIC ------------------------\n\n-- concatMap :: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n set lng to length of xs\n set acc to {}\n tell mReturn(f)\n repeat with i from 1 to lng\n set acc to acc & (|λ|(item i of xs, i, xs))\n end repeat\n end tell\n return acc\nend concatMap\n\n\n-- floor :: Num -> Int\non floor(x)\n if class of x is record then\n set nr to properFracRatio(x)\n else\n set nr to properFraction(x)\n end if\n set n to item 1 of nr\n if 0 > item 2 of nr then\n n - 1\n else\n n\n end if\nend floor\n\n\n-- fmap <$> :: (a -> b) -> Gen [a] -> Gen [b]\non fmap(f, gen)\n script\n property g : mReturn(f)\n on |λ|()\n set v to gen's |λ|()\n if v is missing value then\n v\n else\n g's |λ|(v)\n end if\n end |λ|\n end script\nend fmap\n\n\n-- intercalate :: String -> [String] -> String\non intercalate(delim, xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, delim}\n set s to xs as text\n set my text item delimiters to dlm\n s\nend intercalate\n\n\n-- length :: [a] -> Int\non |length|(xs)\n set c to class of xs\n if list is c or string is c then\n length of xs\n else\n (2 ^ 29 - 1) -- (maxInt - simple proxy for non-finite)\n end if\nend |length|\n\n\n-- map :: (a -> b) -> [a] -> [b]\non map(f, xs)\n -- The list obtained by applying f\n -- to each element of 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 |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- min :: 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\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\non mReturn(f)\n -- 2nd class handler function lifted into 1st class script wrapper.\n if script is class of f then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- properFraction :: Real -> (Int, Real)\non properFraction(n)\n set i to (n div 1)\n {i, n - i}\nend properFraction\n\n\n-- showList :: [a] -> String\non showList(xs)\n \"[\" & intercalate(\",\", map(my str, xs)) & \"]\"\nend showList\n\n\n-- str :: a -> String\non str(x)\n x as string\nend str\n\n\n-- take :: Int -> [a] -> [a]\n-- take :: Int -> String -> String\non take(n, xs)\n set c to class of xs\n if list is c then\n if 0 < n then\n items 1 thru min(n, length of xs) of xs\n else\n {}\n end if\n else if string is c then\n if 0 < n then\n text 1 thru min(n, length of xs) of xs\n else\n \"\"\n end if\n else if script is c then\n set ys to {}\n repeat with i from 1 to n\n set v to |λ|() of xs\n if missing value is v then\n return ys\n else\n set end of ys to v\n end if\n end repeat\n return ys\n else\n missing value\n end if\nend take\n\n\n-- unfoldr :: (b -> Maybe (a, b)) -> b -> [a]\non unfoldr(f, v)\n -- A lazy (generator) list unfolded from a seed value\n -- by repeated application of f to a value until no\n -- residue remains. Dual to fold/reduce.\n -- f returns either nothing (missing value),\n -- or just (value, residue).\n script\n property valueResidue : {v, v}\n property g : mReturn(f)\n on |λ|()\n set valueResidue to g's |λ|(item 2 of (valueResidue))\n if missing value ≠ valueResidue then\n item 1 of (valueResidue)\n else\n missing value\n end if\n end |λ|\n end script\nend unfoldr\n\n\n-- unlines :: [String] -> String\non unlines(xs)\n -- A single string formed by the intercalation\n -- of a list of strings with the newline character.\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, linefeed}\n set s to xs as text\n set my text item delimiters to dlm\n s\nend unlines\n","language":"AppleScript"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\n/* Generate (and memoize) the Padovan sequence using\n * the recurrence relationship */\nint pRec(int n) {\n static int *memo = NULL;\n static size_t curSize = 0;\n\n /* grow memoization array when necessary and fill with zeroes */\n if (curSize <= (size_t) n) {\n size_t lastSize = curSize;\n while (curSize <= (size_t) n) curSize += 1024 * sizeof(int);\n memo = realloc(memo, curSize * sizeof(int));\n memset(memo + lastSize, 0, (curSize - lastSize) * sizeof(int));\n }\n\n /* if we don't have the value for N yet, calculate it */\n if (memo[n] == 0) {\n if (n<=2) memo[n] = 1;\n else memo[n] = pRec(n-2) + pRec(n-3);\n }\n\n return memo[n];\n}\n\n/* Calculate the Nth value of the Padovan sequence\n * using the floor function */\nint pFloor(int n) {\n long double p = 1.324717957244746025960908854;\n long double s = 1.0453567932525329623;\n return powl(p, n-1)/s + 0.5;\n}\n\n/* Given the previous value for the L-system, generate the\n * next value */\nvoid nextLSystem(const char *prev, char *buf) {\n while (*prev) {\n switch (*prev++) {\n case 'A': *buf++ = 'B'; break;\n case 'B': *buf++ = 'C'; break;\n case 'C': *buf++ = 'A'; *buf++ = 'B'; break;\n }\n }\n *buf = '\\0';\n}\n\nint main() {\n // 8192 is enough up to P_33.\n #define BUFSZ 8192\n char buf1[BUFSZ], buf2[BUFSZ];\n int i;\n\n /* Print P_0..P_19 */\n printf(\"P_0 .. P_19: \");\n for (i=0; i<20; i++) printf(\"%d \", pRec(i));\n printf(\"\\n\");\n\n /* Check that functions match up to P_63 */\n printf(\"The floor- and recurrence-based functions \");\n for (i=0; i<64; i++) {\n if (pRec(i) != pFloor(i)) {\n printf(\"do not match at %d: %d != %d.\\n\",\n i, pRec(i), pFloor(i));\n break;\n }\n }\n if (i == 64) {\n printf(\"match from P_0 to P_63.\\n\");\n }\n\n /* Show first 10 L-system strings */\n printf(\"\\nThe first 10 L-system strings are:\\n\");\n for (strcpy(buf1, \"A\"), i=0; i<10; i++) {\n printf(\"%s\\n\", buf1);\n strcpy(buf2, buf1);\n nextLSystem(buf2, buf1);\n }\n\n /* Check lengths of strings against pFloor up to P_31 */\n printf(\"\\nThe floor- and L-system-based functions \");\n for (strcpy(buf1, \"A\"), i=0; i<32; i++) {\n if ((int)strlen(buf1) != pFloor(i)) {\n printf(\"do not match at %d: %d != %d\\n\",\n i, (int)strlen(buf1), pFloor(i));\n break;\n }\n strcpy(buf2, buf1);\n nextLSystem(buf2, buf1);\n }\n if (i == 32) {\n printf(\"match from P_0 to P_31.\\n\");\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <map>\n#include <cmath>\n\n// Generate the Padovan sequence using the recurrence\n// relationship.\nint pRec(int n) {\n static std::map<int,int> memo;\n auto it = memo.find(n);\n if (it != memo.end()) return it->second;\n\n if (n <= 2) memo[n] = 1;\n else memo[n] = pRec(n-2) + pRec(n-3);\n return memo[n];\n}\n\n// Calculate the N'th Padovan sequence using the\n// floor function.\nint pFloor(int n) {\n long const double p = 1.324717957244746025960908854;\n long const double s = 1.0453567932525329623;\n return std::pow(p, n-1)/s + 0.5;\n}\n\n// Return the N'th L-system string\nstd::string& lSystem(int n) {\n static std::map<int,std::string> memo;\n auto it = memo.find(n);\n if (it != memo.end()) return it->second;\n\n if (n == 0) memo[n] = \"A\";\n else {\n memo[n] = \"\";\n for (char ch : memo[n-1]) {\n switch(ch) {\n case 'A': memo[n].push_back('B'); break;\n case 'B': memo[n].push_back('C'); break;\n case 'C': memo[n].append(\"AB\"); break;\n }\n }\n }\n return memo[n];\n}\n\n// Compare two functions up to p_N\nusing pFn = int(*)(int);\nvoid compare(pFn f1, pFn f2, const char* descr, int stop) {\n std::cout << \"The \" << descr << \" functions \";\n int i;\n for (i=0; i<stop; i++) {\n int n1 = f1(i);\n int n2 = f2(i);\n if (n1 != n2) {\n std::cout << \"do not match at \" << i\n << \": \" << n1 << \" != \" << n2 << \".\\n\";\n break;\n }\n }\n if (i == stop) {\n std::cout << \"match from P_0 to P_\" << stop << \".\\n\";\n }\n}\n\nint main() {\n /* Print P_0 to P_19 */\n std::cout << \"P_0 .. P_19: \";\n for (int i=0; i<20; i++) std::cout << pRec(i) << \" \";\n std::cout << \"\\n\";\n\n /* Check that floor and recurrence match up to P_64 */\n compare(pFloor, pRec, \"floor- and recurrence-based\", 64);\n\n /* Show first 10 L-system strings */\n std::cout << \"\\nThe first 10 L-system strings are:\\n\";\n for (int i=0; i<10; i++) std::cout << lSystem(i) << \"\\n\";\n std::cout << \"\\n\";\n\n /* Check lengths of strings against pFloor up to P_31 */\n compare(pFloor, [](int n){return (int)lSystem(n).length();},\n \"floor- and L-system-based\", 32);\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic static class Padovan\n{\n private static readonly List<int> recurrences = new List<int>();\n private static readonly List<int> floors = new List<int>();\n private const double PP = 1.324717957244746025960908854;\n private const double SS = 1.0453567932525329623;\n\n public static void Main(string[] args)\n {\n for (int i = 0; i < 64; i++)\n {\n recurrences.Add(PadovanRecurrence(i));\n floors.Add(PadovanFloor(i));\n }\n\n Console.WriteLine(\"The first 20 terms of the Padovan sequence:\");\n recurrences.GetRange(0, 20).ForEach(term => Console.Write(term + \" \"));\n Console.WriteLine(Environment.NewLine);\n\n Console.WriteLine(\"Recurrence and floor functions agree for first 64 terms? \" + recurrences.SequenceEqual(floors));\n Console.WriteLine(Environment.NewLine);\n\n List<string> words = CreateLSystem();\n\n Console.WriteLine(\"The first 10 terms of the L-system:\");\n words.GetRange(0, 10).ForEach(term => Console.Write(term + \" \"));\n Console.WriteLine(Environment.NewLine);\n\n Console.Write(\"Length of first 32 terms produced from the L-system match Padovan sequence? \");\n List<int> wordLengths = words.Select(s => s.Length).ToList();\n Console.WriteLine(wordLengths.SequenceEqual(recurrences.GetRange(0, 32)));\n }\n\n private static int PadovanRecurrence(int n)\n {\n if (n <= 2)\n return 1;\n return recurrences[n - 2] + recurrences[n - 3];\n }\n\n private static int PadovanFloor(int n)\n {\n return (int)Math.Floor(Math.Pow(PP, n - 1) / SS + 0.5);\n }\n\n private static List<string> CreateLSystem()\n {\n List<string> words = new List<string>();\n string text = \"A\";\n\n while (words.Count < 32)\n {\n words.Add(text);\n char[] textChars = text.ToCharArray();\n text = \"\";\n foreach (char ch in textChars)\n {\n text += ch switch\n {\n 'A' => \"B\",\n 'B' => \"C\",\n 'C' => \"AB\",\n _ => throw new InvalidOperationException(\"Unexpected character found: \" + ch),\n };\n }\n }\n\n return words;\n }\n}\n","language":"C-sharp"},{"code":"(def padovan (map first (iterate (fn [[a b c]] [b c (+ a b)]) [1 1 1])))\n\n(def pad-floor\n (let [p 1.324717957244746025960908854\n s 1.0453567932525329623]\n (map (fn [n] (int (Math/floor (+ (/ (Math/pow p (dec n)) s) 0.5)))) (range))))\n\n(def pad-l\n (iterate (fn f [[c & s]]\n (case c\n \\A (str \"B\" (f s))\n \\B (str \"C\" (f s))\n \\C (str \"AB\" (f s))\n (str \"\")))\n \"A\"))\n\n(defn comp-seq [n seqa seqb]\n (= (take n seqa) (take n seqb)))\n\n(defn comp-all [n]\n (= (map count (vec (take n pad-l)))\n (take n padovan)\n (take n pad-floor)))\n\n(defn padovan-print [& args]\n ((print \"The first 20 items with recursion relation are: \")\n (println (take 20 padovan))\n (println)\n (println (str\n \"The recurrence and floor based algorithms \"\n (if (comp-seq 64 padovan pad-floor) \"match\" \"not match\")\n \" to n=64\"))\n (println)\n (println \"The first 10 L-system strings are:\")\n (println (take 10 pad-l))\n (println)\n (println (str\n \"The L-system, recurrence and floor based algorithms \"\n (if (comp-all 32) \"match\" \"not match\")\n \" to n=32\"))))\n","language":"Clojure"},{"code":"program Padovan_sequence;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n Velthuis.BigDecimals,\n Boost.Generics.Collection;\n\ntype\n TpFn = TFunc<Integer, Integer>;\n\nvar\n RecMemo: TDictionary<Integer, Integer>;\n lSystemMemo: TDictionary<Integer, string>;\n\nfunction pRec(n: Integer): Integer;\nbegin\n if RecMemo.HasKey(n) then\n exit(RecMemo[n]);\n\n if (n <= 2) then\n RecMemo[n] := 1\n else\n RecMemo[n] := pRec(n - 2) + pRec(n - 3);\n Result := RecMemo[n];\nend;\n\nfunction pFloor(n: Integer): Integer;\nvar\n p, s, a: BigDecimal;\nbegin\n p := '1.324717957244746025960908854';\n s := '1.0453567932525329623';\n a := p.IntPower(n - 1, 64);\n Result := Round(BigDecimal.Divide(a, s));\nend;\n\nfunction lSystem(n: Integer): string;\nbegin\n if n = 0 then\n lSystemMemo[n] := 'A'\n else\n begin\n lSystemMemo[n] := '';\n for var ch in lSystemMemo[n - 1] do\n begin\n case ch of\n 'A':\n lSystemMemo[n] := lSystemMemo[n] + 'B';\n 'B':\n lSystemMemo[n] := lSystemMemo[n] + 'C';\n 'C':\n lSystemMemo[n] := lSystemMemo[n] + 'AB';\n end;\n end;\n end;\n Result := lSystemMemo[n];\nend;\n\nprocedure Compare(f1, f2: TpFn; descr: string; stop: Integer);\nbegin\n write('The ', descr, ' functions ');\n var i := 0;\n while i < stop do\n begin\n var n1 := f1(i);\n var n2 := f2(i);\n if n1 <> n2 then\n begin\n write('do not match at ', i);\n writeln(': ', n1, ' != ', n2, '.');\n break;\n end;\n inc(i);\n end;\n if i = stop then\n writeln('match from P_0 to P_', stop, '.');\nend;\n\nbegin\n RecMemo := TDictionary<Integer, Integer>.Create([], []);\n lSystemMemo := TDictionary<Integer, string>.Create([], []);\n\n write('P_0 .. P_19: ');\n for var i := 0 to 19 do\n write(pRec(i), ' ');\n writeln;\n\n Compare(pFloor, pRec, 'floor- and recurrence-based', 64);\n writeln(#10'The first 10 L-system strings are:');\n\n for var i := 0 to 9 do\n writeln(lSystem(i));\n writeln;\n\n Compare(pFloor,\n function(n: Integer): Integer\n begin\n Result := length(lSystem(n));\n end, 'floor- and L-system-based', 32);\n readln;\nend.\n","language":"Delphi"},{"code":"p[] = [ 1 1 1 ]\npadorn = 1\nfunc padorec .\n if padorn <= 3\n h = p[padorn]\n else\n h = p[1] + p[2]\n .\n p[1] = p[2]\n p[2] = p[3]\n p[3] = h\n padorn += 1\n return h\n.\npfn = 1\nP = 1.32471795724474602596\nS = 1.0453567932525329623\n#\nfunc padofloor .\n p = floor ((pow P (pfn - 2)) / S + 0.5)\n pfn += 1\n return p\n.\nstr$ = \"A\"\nfunc$ padolsys .\n r$ = str$\n for c$ in strchars str$\n if c$ = \"A\"\n nxt$ &= \"B\"\n elif c$ = \"B\"\n nxt$ &= \"C\"\n else\n nxt$ &= \"AB\"\n .\n .\n str$ = nxt$\n return r$\n.\n#\nprint \"First 20 terms of the Padovan sequence:\"\nfor i to 64\n par[] &= padorec\n.\nfor i to 20\n write par[i] & \" \"\n.\nprint \"\"\nfor i to 64\n paf[] &= padofloor\n.\nif par[] = paf[]\n print \"\\nRecurrence and floor functions agree for first 64 terms\"\n.\nfor i to 32\n pal$[] &= padolsys\n.\nprint \"\\nFirst 10 strings produced from the L-system:\"\nfor i to 10\n write pal$[i] & \" \"\n.\nprint \"\"\nfor i to 32\n if len pal$[i] <> par[i]\n break 1\n .\n.\nif i > 32\n print \"\\nLength of first 32 strings produced from the L-system = Padovan sequence\"\n.\n","language":"EasyLang"},{"code":"# Padovan sequence as a Stream\ndefmodule Padovan do\n def stream do\n Stream.resource(\n fn -> {1, 1, 1} end,\n fn {a, b, c} ->\n next_value = a + b\n {[a], {b, c, next_value}}\n end,\n fn _ -> :ok end\n )\n end\nend\n\n# Padovan floor function\ndefmodule PadovanFloorFunction do\n @p 1.324717957244746025960908854\n @s 1.0453567932525329623\n\n def padovan_f(n), do: trunc((:math.pow(@p, n - 1) / @s) + 0.5)\nend\n\n# Calculate and print the first 20 elements of the Padovan sequence and the floor function\npadovan_sequence = Padovan.stream() |> Enum.take(20)\npadovan_floor_function = Enum.map(0..19, &PadovanFloorFunction.padovan_f(&1))\n\nIO.puts(\"Recurrence Padovan: #{inspect(padovan_sequence)}\")\nIO.puts(\"Floor function: #{inspect(padovan_floor_function)}\")\n\n# Check if the sequences are equal up to n\nn = 63\nbool = Enum.map(0..(n-1), &PadovanFloorFunction.padovan_f(&1)) == Padovan.stream() |> Enum.take(n)\nIO.puts(\"Recurrence and floor function are equal up to #{n}: #{bool}.\")\n\n# L-system generator as a Stream\ndefmodule LSystem do\n def stream(axiom \\\\ \"A\", rules \\\\ %{\"A\" => \"B\", \"B\" => \"C\", \"C\" => \"AB\"}) do\n Stream.iterate(axiom, fn string ->\n string\n |> String.graphemes()\n |> Enum.map(&Map.get(rules, &1, \"\"))\n |> Enum.join()\n end)\n end\nend\n\n# Calculate and print the first 10 elements of the L-system\nl_system_sequence = LSystem.stream() |> Enum.take(10)\nIO.puts(\"First 10 elements of L-system: #{l_system_sequence |> Enum.join(\", \")}\")\n\n# Check if the sizes of the L-system strings match the Padovan sequence\nn = 32\nl_system_sizes = LSystem.stream() |> Enum.take(n) |> Enum.map(&String.length/1)\nbool = l_system_sizes == Padovan.stream() |> Enum.take(n)\nIO.puts(\"Sizes of first #{n} L_system strings equal to recurrence Padovan? #{bool}.\")\n","language":"Elixir"},{"code":"USING: L-system accessors io kernel make math math.functions\nmemoize prettyprint qw sequences ;\n\nCONSTANT: p 1.324717957244746025960908854\nCONSTANT: s 1.0453567932525329623\n\n: pfloor ( m -- n ) 1 - p swap ^ s /f .5 + >integer ;\n\nMEMO: precur ( m -- n )\n dup 3 < [ drop 1 ]\n [ [ 2 - precur ] [ 3 - precur ] bi + ] if ;\n\n: plsys, ( L-system -- )\n [ iterate-L-system-string ] [ string>> , ] bi ;\n\n: plsys ( n -- seq )\n <L-system>\n \"A\" >>axiom\n { qw{ A B } qw{ B C } qw{ C AB } } >>rules\n swap 1 - '[ \"A\" , _ [ dup plsys, ] times ] { } make nip ;\n\n\"First 20 terms of the Padovan sequence:\" print\n20 [ pfloor pprint bl ] each-integer nl nl\n\n64 [ [ pfloor ] [ precur ] bi assert= ] each-integer\n\"Recurrence and floor based algorithms match to n=63.\" print nl\n\n\"First 10 L-system strings:\" print\n10 plsys . nl\n\n32 <iota> [ pfloor ] map 32 plsys [ length ] map assert=\n\"The L-system, recurrence and floor based algorithms match to n=31.\" print\n","language":"Factor"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"math/big\"\n \"strings\"\n)\n\nfunc padovanRecur(n int) []int {\n p := make([]int, n)\n p[0], p[1], p[2] = 1, 1, 1\n for i := 3; i < n; i++ {\n p[i] = p[i-2] + p[i-3]\n }\n return p\n}\n\nfunc padovanFloor(n int) []int {\n var p, s, t, u = new(big.Rat), new(big.Rat), new(big.Rat), new(big.Rat)\n p, _ = p.SetString(\"1.324717957244746025960908854\")\n s, _ = s.SetString(\"1.0453567932525329623\")\n f := make([]int, n)\n pow := new(big.Rat).SetInt64(1)\n u = u.SetFrac64(1, 2)\n t.Quo(pow, p)\n t.Quo(t, s)\n t.Add(t, u)\n v, _ := t.Float64()\n f[0] = int(math.Floor(v))\n for i := 1; i < n; i++ {\n t.Quo(pow, s)\n t.Add(t, u)\n v, _ = t.Float64()\n f[i] = int(math.Floor(v))\n pow.Mul(pow, p)\n }\n return f\n}\n\ntype LSystem struct {\n rules map[string]string\n init, current string\n}\n\nfunc step(lsys *LSystem) string {\n var sb strings.Builder\n if lsys.current == \"\" {\n lsys.current = lsys.init\n } else {\n for _, c := range lsys.current {\n sb.WriteString(lsys.rules[string(c)])\n }\n lsys.current = sb.String()\n }\n return lsys.current\n}\n\nfunc padovanLSys(n int) []string {\n rules := map[string]string{\"A\": \"B\", \"B\": \"C\", \"C\": \"AB\"}\n lsys := &LSystem{rules, \"A\", \"\"}\n p := make([]string, n)\n for i := 0; i < n; i++ {\n p[i] = step(lsys)\n }\n return p\n}\n\n// assumes lists are same length\nfunc areSame(l1, l2 []int) bool {\n for i := 0; i < len(l1); i++ {\n if l1[i] != l2[i] {\n return false\n }\n }\n return true\n}\n\nfunc main() {\n fmt.Println(\"First 20 members of the Padovan sequence:\")\n fmt.Println(padovanRecur(20))\n recur := padovanRecur(64)\n floor := padovanFloor(64)\n same := areSame(recur, floor)\n s := \"give\"\n if !same {\n s = \"do not give\"\n }\n fmt.Println(\"\\nThe recurrence and floor based functions\", s, \"the same results for 64 terms.\")\n\n p := padovanLSys(32)\n lsyst := make([]int, 32)\n for i := 0; i < 32; i++ {\n lsyst[i] = len(p[i])\n }\n fmt.Println(\"\\nFirst 10 members of the Padovan L-System:\")\n fmt.Println(p[:10])\n fmt.Println(\"\\nand their lengths:\")\n fmt.Println(lsyst[:10])\n\n same = areSame(recur[:32], lsyst)\n s = \"give\"\n if !same {\n s = \"do not give\"\n }\n fmt.Println(\"\\nThe recurrence and L-system based functions\", s, \"the same results for 32 terms.\")\n","language":"Go"},{"code":"-- list of Padovan numbers using recurrence\npRec = map (\\(a,_,_) -> a) $ iterate (\\(a,b,c) -> (b,c,a+b)) (1,1,1)\n\n-- list of Padovan numbers using self-referential lazy lists\npSelfRef = 1 : 1 : 1 : zipWith (+) pSelfRef (tail pSelfRef)\n\n-- list of Padovan numbers generated from floor function\npFloor = map f [0..]\n where f n = floor $ p**fromInteger (pred n) / s + 0.5\n p = 1.324717957244746025960908854\n s = 1.0453567932525329623\n\n-- list of L-system strings\nlSystem = iterate f \"A\"\n where f [] = []\n f ('A':s) = 'B':f s\n f ('B':s) = 'C':f s\n f ('C':s) = 'A':'B':f s\n\n-- check if first N elements match\ncheckN n as bs = take n as == take n bs\n\nmain = do\n putStr \"P_0 .. P_19: \"\n putStrLn $ unwords $ map show $ take 20 pRec\n\n putStr \"The floor- and recurrence-based functions \"\n putStr $ if checkN 64 pRec pFloor then \"match\" else \"do not match\"\n putStr \" from P_0 to P_63.\\n\"\n\n putStr \"The self-referential- and recurrence-based functions \"\n putStr $ if checkN 64 pRec pSelfRef then \"match\" else \"do not match\"\n putStr \" from P_0 to P_63.\\n\\n\"\n\n putStr \"The first 10 L-system strings are:\\n\"\n putStrLn $ unwords $ take 10 lSystem\n\n putStr \"\\nThe floor- and L-system-based functions \"\n putStr $ if checkN 32 pFloor (map length lSystem)\n then \"match\" else \"do not match\"\n putStr \" from P_0 to P_31.\\n\"\n","language":"Haskell"},{"code":"import Data.List (unfoldr)\n\n--------------------- PADOVAN NUMBERS --------------------\n\npadovans :: [Integer]\npadovans = unfoldr f (1, 1, 1)\n where\n f (a, b, c) = Just (a, (b, c, a + b))\n\n\npadovanFloor :: [Integer]\npadovanFloor = unfoldr f 0\n where\n f = Just . (((,) . g) <*> succ)\n\n g = floor . (0.5 +) . (/ s) . (p **) . fromInteger . pred\n p = 1.324717957244746025960908854\n s = 1.0453567932525329623\n\n\npadovanLSystem :: [String]\npadovanLSystem = unfoldr f \"A\"\n where\n f = Just . ((,) <*> concatMap rule)\n\n rule 'A' = \"B\"\n rule 'B' = \"C\"\n rule 'C' = \"AB\"\n\n\n-------------------------- TESTS -------------------------\n\nmain :: IO ()\nmain =\n mapM_\n putStrLn\n [ \"First 20 padovans:\\n\",\n show $ take 20 padovans,\n [],\n \"The recurrence and floor based functions\",\n \"match over 64 terms:\\n\",\n show $ prefixesMatch padovans padovanFloor 64,\n [],\n \"First 10 L-System strings:\\n\",\n show $ take 10 padovanLSystem,\n [],\n \"The length of the first 32 strings produced\",\n \"is the Padovan sequence:\\n\",\n show $\n prefixesMatch\n padovans\n (fromIntegral . length <$> padovanLSystem)\n 32\n ]\n\nprefixesMatch :: Eq a => [a] -> [a] -> Int -> Bool\nprefixesMatch xs ys n = and (zipWith (==) (take n xs) ys)\n","language":"Haskell"},{"code":"padovanSeq=: (],+/@(_2 _3{]))^:([-3:)&1 1 1\n\nNB. or, equivalently:\npadovanSeq=: (, [: +/ _2 {. }:)@]^:([ - 2:)&1 1\n\nrealRoot=. {:@(#~ ]=|)@;@p.\npadovanNth=: 0.5 <.@+ (realRoot _23 23 _2 1) %~ (realRoot _1 _1 0 1)^<:\n\npadovanL=: rplc&('A';'B'; 'B';'C'; 'C';'AB')@]^:[&'A'\nseqLen=. #@(-.&' ')\"1\n","language":"J"},{"code":" padovanSeq 20\n1 1 1 2 2 3 4 5 7 9 12 16 21 28 37 49 65 86 114 151\n (padovanSeq 64) -: padovanNth(i.64)\n1\n padovanL i.10\nA\nB\nC\nAB\nBC\nCAB\nABBC\nBCCAB\nCABABBC\nABBCBCCAB\n (padovanSeq 32) -: seqLen padovanL i.32\n1\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.List;\n\npublic final class Padovan {\n\n\tpublic static void main(String[] aArgs) {\n\t\tfor ( int i = 0; i < 64; i++ ) {\n\t\t\trecurrences.add(padovanRecurrence(i));\n\t\t\tfloors.add(padovanFloor(i));\n\t\t}\t\t\n\t\t\n\t\tSystem.out.println(\"The first 20 terms of the Padovan sequence:\");\n\t\trecurrences.subList(0, 20).forEach( term -> System.out.print(term + \" \") );\t\t\n\t\tSystem.out.println(System.lineSeparator());\n\t\t\n\t\tSystem.out.print(\"Recurrence and floor functions agree for first 64 terms? \" + recurrences.equals(floors));\n\t\tSystem.out.println(System.lineSeparator());\n\t\t\n\t\tList<String> words = createLSystem();\t\t\n\t\t\n\t\tSystem.out.println(\"The first 10 terms of the L-system:\");\n\t\twords.subList(0, 10).forEach( term -> System.out.print(term + \" \") );\t\t\n\t\tSystem.out.println(System.lineSeparator());\n\t\t\n\t\tSystem.out.print(\"Length of first 32 terms produced from the L-system match Padovan sequence? \");\t\t\n\t\tList<Integer> wordLengths = words.stream().map( s -> s.length() ).toList();\n\t\tSystem.out.println(wordLengths.equals(recurrences.subList(0, 32)));\n\t}\n\t\n\tprivate static int padovanRecurrence(int aN) {\n\t\treturn ( aN <= 2 ) ? 1 : recurrences.get(aN - 2) + recurrences.get(aN - 3);\t\t\n\t}\n\t\n\tprivate static int padovanFloor(int aN) {\n\t\treturn (int) Math.floor(Math.pow(PP, aN - 1) / SS + 0.5);\n\t}\n\t\n\tprivate static List<String> createLSystem() {\n\t\tList<String> words = new ArrayList<String>();\t\t\n\t\tStringBuilder stringBuilder = new StringBuilder();\n\t\tString text = \"A\";\n\t\t\n\t\tdo {\n\t\t\twords.add(text);\n\t\t\tstringBuilder.setLength(0);\n\t\t\tfor ( char ch : text.toCharArray() ) {\n\t\t\t\tString entry = switch ( ch ) {\n\t\t\t\t\tcase 'A' -> \"B\";\n\t\t\t\t\tcase 'B' -> \"C\";\n\t\t\t\t\tcase 'C' -> \"AB\";\n\t\t\t\t\tdefault -> throw new AssertionError(\"Unexpected character found: \" + ch);\n\t\t\t\t};\n\t\t\t\t\n\t\t\t\tstringBuilder.append(entry);\n\t\t\t}\n\t\t\t\n\t\t\ttext = stringBuilder.toString();\n\t\t} while ( words.size() < 32 );\n\t\t\n\t\treturn words;\n\t}\n\t\n\tprivate static List<Integer> recurrences = new ArrayList<Integer>();\n\tprivate static List<Integer> floors = new ArrayList<Integer>();\n\t\n\tprivate static final double PP = 1.324717957244746025960908854;\n\tprivate static final double SS = 1.0453567932525329623;\n\n}\n","language":"Java"},{"code":"(() => {\n \"use strict\";\n\n // ----------------- PADOVAN NUMBERS -----------------\n\n // padovans :: [Int]\n const padovans = () => {\n // Non-finite series of Padovan numbers,\n // defined in terms of recurrence relations.\n const f = ([a, b, c]) => [\n a,\n [b, c, a + b]\n ];\n\n return unfoldr(f)([1, 1, 1]);\n };\n\n\n // padovanFloor :: [Int]\n const padovanFloor = () => {\n // The Padovan series, defined in terms\n // of a floor function.\n const\n // NB JavaScript loses some of this\n // precision at run-time.\n p = 1.324717957244746025960908854,\n s = 1.0453567932525329623;\n\n const f = n => [\n Math.floor(((p ** (n - 1)) / s) + 0.5),\n 1 + n\n ];\n\n return unfoldr(f)(0);\n };\n\n\n // padovanLSystem : [Int]\n const padovanLSystem = () => {\n // An L-system generating terms whose lengths\n // are the values of the Padovan integer series.\n const rule = c =>\n \"A\" === c ? (\n \"B\"\n ) : \"B\" === c ? (\n \"C\"\n ) : \"AB\";\n\n const f = s => [\n s,\n chars(s).flatMap(rule)\n .join(\"\")\n ];\n\n return unfoldr(f)(\"A\");\n };\n\n\n // ---------------------- TEST -----------------------\n // main :: IO ()\n const main = () => {\n // prefixesMatch :: [a] -> [a] -> Bool\n const prefixesMatch = xs =>\n ys => n => and(\n zipWith(a => b => a === b)(\n take(n)(xs)\n )(\n take(n)(ys)\n )\n );\n\n return [\n \"First 20 padovans:\",\n take(20)(padovans()),\n\n \"\\nThe recurrence and floor-based functions\",\n \"match over the first 64 terms:\\n\",\n prefixesMatch(\n padovans()\n )(\n padovanFloor()\n )(64),\n\n \"\\nFirst 10 L-System strings:\",\n take(10)(padovanLSystem()),\n\n \"\\nThe lengths of the first 32 L-System\",\n \"strings match the Padovan sequence:\\n\",\n prefixesMatch(\n padovans()\n )(\n fmap(length)(padovanLSystem())\n )(32)\n ]\n .map(str)\n .join(\"\\n\");\n };\n\n // --------------------- GENERIC ---------------------\n\n // and :: [Bool] -> Bool\n const and = xs =>\n // True unless any value in xs is false.\n [...xs].every(Boolean);\n\n\n // chars :: String -> [Char]\n const chars = s =>\n s.split(\"\");\n\n\n // fmap <$> :: (a -> b) -> Gen [a] -> Gen [b]\n const fmap = f =>\n function* (gen) {\n let v = take(1)(gen);\n\n while (0 < v.length) {\n yield f(v[0]);\n v = take(1)(gen);\n }\n };\n\n\n // length :: [a] -> Int\n const length = xs =>\n // Returns Infinity over objects without finite\n // length. This enables zip and zipWith to choose\n // the shorter argument when one is non-finite,\n // like cycle, repeat etc\n \"GeneratorFunction\" !== xs.constructor\n .constructor.name ? (\n xs.length\n ) : Infinity;\n\n\n // take :: Int -> [a] -> [a]\n // take :: Int -> String -> String\n const take = n =>\n // The first n elements of a list,\n // string of characters, or stream.\n xs => \"GeneratorFunction\" !== xs\n .constructor.constructor.name ? (\n xs.slice(0, n)\n ) : [].concat(...Array.from({\n length: n\n }, () => {\n const x = xs.next();\n\n return x.done ? [] : [x.value];\n }));\n\n\n // str :: a -> String\n const str = x =>\n \"string\" !== typeof x ? (\n JSON.stringify(x)\n ) : x;\n\n\n // unfoldr :: (b -> Maybe (a, b)) -> b -> Gen [a]\n const unfoldr = f =>\n // A lazy (generator) list unfolded from a seed value\n // by repeated application of f to a value until no\n // residue remains. Dual to fold/reduce.\n // f returns either Null or just (value, residue).\n // For a strict output list,\n // wrap with `list` or Array.from\n x => (\n function* () {\n let valueResidue = f(x);\n\n while (null !== valueResidue) {\n yield valueResidue[0];\n valueResidue = f(valueResidue[1]);\n }\n }()\n );\n\n\n // zipWithList :: (a -> b -> c) -> [a] -> [b] -> [c]\n const zipWith = f =>\n // A list constructed by zipping with a\n // custom function, rather than with the\n // default tuple constructor.\n xs => ys => ((xs_, ys_) => {\n const lng = Math.min(length(xs_), length(ys_));\n\n return take(lng)(xs_).map(\n (x, i) => f(x)(ys_[i])\n );\n })([...xs], [...ys]);\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"# Output: first $n Padovans\ndef padovanRecur($n):\n [range(0;$n) | 1] as $p\n | if $n < 3 then $p\n else reduce range(3;$n) as $i ($p; .[$i] = .[$i-2] + .[$i-3])\n end;\n\n# Output: first $n Padovans\ndef padovanFloor($n):\n { p: 1.324717957244746025960908854,\n s: 1.0453567932525329623,\n pow: 1 }\n | reduce range (1;$n) as $i ( .f = [ ((.pow/.p/.s) + 0.5)|floor];\n .f[$i] = (((.pow/.s) + 0.5)|floor)\n | .pow *= .p)\n | .f ;\n\n# Output: a stream of the L-System Padovan strings\ndef padovanStrings:\n {A: \"B\", B: \"C\", C: \"AB\", \"\": \"A\"} as $rules\n | $rules[\"\"]\n | while(true;\n ascii_downcase\n | gsub(\"a\"; $rules[\"A\"]) | gsub(\"b\"; $rules[\"B\"]) | gsub(\"c\"; $rules[\"C\"]) ) ;\n\n# Output: a stream of the Padovan numbers using the L-System strings\ndef padovanNumbers:\n padovanStrings | length;\n\ndef task:\n def s1($n):\n if padovanFloor($n) == padovanRecur($n) then \"give\" else \"do not give\" end;\n\n def s2($n):\n if [limit($n; padovanNumbers)] == padovanRecur($n) then \"give\" else \"do not give\" end;\n\n \"The first 20 members of the Padovan sequence:\", padovanRecur(20),\n \"\",\n \"The recurrence and floor-based functions \\(s1(64)) the same results for 64 terms.\",\n \"\",\n ([limit(10; padovanStrings)]\n | \"First 10 members of the Padovan L-System:\", .,\n \"and their lengths:\",\n map(length)),\n \"\",\n \"The recurrence and L-system based functions \\(s2(32)) the same results for 32 terms.\"\n;\n\ntask\n","language":"Jq"},{"code":"\"\"\" Recursive Padovan \"\"\"\nrPadovan(n) = (n < 4) ? one(n) : rPadovan(n - 3) + rPadovan(n - 2)\n\n\"\"\" Floor function calculation Padovan \"\"\"\nfunction fPadovan(n)::Int\n p, s = big\"1.324717957244746025960908854\", big\"1.0453567932525329623\"\n return Int(floor(p^(n-2) / s + .5))\nend\n\n\"\"\" LSystem Padovan \"\"\"\nfunction list_LsysPadovan(N)\n rules = Dict(\"A\" => \"B\", \"B\" => \"C\", \"C\" => \"AB\")\n seq, lens = [\"A\"], [1]\n for i in 1:N\n str = prod([rules[string(c)] for c in seq[end]])\n push!(seq, str)\n push!(lens, length(str))\n end\n return seq, lens\nend\n\nconst lr, lf = [rPadovan(i) for i in 1:64], [fPadovan(i) for i in 1:64]\nconst sL, lL = list_LsysPadovan(32)\nprintln(\"N Recursive Floor LSystem String\\n=============================================\")\nforeach(i -> println(rpad(i, 4), rpad(lr[i], 12), rpad(lf[i], 12),\n rpad(i < 33 ? lL[i] : \"\", 12), (i < 11 ? sL[i] : \"\")), 1:64)\n","language":"Julia"},{"code":"import kotlin.math.floor\nimport kotlin.math.pow\n\nobject CodeKt{\n\n private val recurrences = mutableListOf<Int>()\n private val floors = mutableListOf<Int>()\n private const val PP = 1.324717957244746025960908854\n private const val SS = 1.0453567932525329623\n\n @JvmStatic\n fun main(args: Array<String>) {\n for (i in 0 until 64) {\n recurrences.add(padovanRecurrence(i))\n floors.add(padovanFloor(i))\n }\n\n println(\"The first 20 terms of the Padovan sequence:\")\n recurrences.subList(0, 20).forEach { term -> print(\"$term \") }\n println(\"\\n\")\n\n println(\"Recurrence and floor functions agree for first 64 terms? ${recurrences == floors}\\n\")\n\n val words = createLSystem()\n\n println(\"The first 10 terms of the L-system:\")\n words.subList(0, 10).forEach { term -> print(\"$term \") }\n println(\"\\n\")\n\n print(\"Length of first 32 terms produced from the L-system match Padovan sequence? \")\n val wordLengths = words.map { it.length }\n println(wordLengths == recurrences.subList(0, 32))\n }\n\n private fun padovanRecurrence(n: Int): Int =\n if (n <= 2) 1 else recurrences[n - 2] + recurrences[n - 3]\n\n private fun padovanFloor(n: Int): Int =\n floor(PP.pow(n - 1) / SS + 0.5).toInt()\n\n private fun createLSystem(): List<String> {\n val words = mutableListOf<String>()\n var text = \"A\"\n\n while (words.size < 32) {\n words.add(text)\n text = text.map { ch ->\n when (ch) {\n 'A' -> \"B\"\n 'B' -> \"C\"\n 'C' -> \"AB\"\n else -> throw AssertionError(\"Unexpected character found: $ch\")\n }\n }.joinToString(\"\")\n }\n\n return words\n }\n}\n","language":"Kotlin"},{"code":"-- Define the constants\nlocal p = 1.32471795724474602596\nlocal s = 1.0453567932525329623\n\n\n-- Generator for the Padovan sequence using coroutines\nfunction pad_recur_gen(n)\n local co = coroutine.create(function ()\n local p = {1, 1, 1, 2}\n for i = 1, n do\n local next_val = p[2] + p[3]\n coroutine.yield(p[1])\n table.remove(p, 1)\n table.insert(p, next_val)\n end\n end)\n return function () -- iterator\n local status, value = coroutine.resume(co)\n return value\n end\nend\n\n-- Padovan floor function\nfunction pad_floor(index)\n if index < 3 then\n return math.floor(1/2 + p)\n else\n return math.floor(1/2 + p^(index - 2) / s)\n end\nend\n\nlocal l, m, n = 10, 20, 32\n\nlocal pr = {}\nlocal pad_recur = pad_recur_gen(n)\nfor i = 1, n do\n pr[i] = pad_recur()\nend\nfor i = 1, m do\n io.write(pr[i] .. ' ')\nend\nio.write('\\n')\n\nlocal pf = {}\nfor i = 1, n do\n pf[i] = pad_floor(i)\nend\nfor i = 1, m do\n io.write(pf[i] .. ' ')\nend\nio.write('\\n')\n\nlocal L = {'A'}\nlocal rules = { A = 'B', B = 'C', C = 'AB' }\nfor i = 1, n do\n local next_str = ''\n for char in L[#L]:gmatch('.') do\n next_str = next_str .. rules[char]\n end\n table.insert(L, next_str)\nend\nfor i = 1, l do\n io.write(L[i] .. ' ')\nend\nio.write('\\n')\n\nfor i = 1, n do\n assert(pr[i] == pf[i] and pr[i] == #L[i],\n \"Uh oh, n=\" .. i .. \": \" .. pr[i] .. \" vs \" .. pf[i] .. \" vs \" .. #L[i])\nend\n\nprint('100% agreement among all 3 methods.')\n","language":"Lua"},{"code":"ClearAll[Padovan1,a,p,s]\np=N[Surd[((9+Sqrt[69])/18),3]+Surd[((9-Sqrt[69])/18),3],200];\ns=1.0453567932525329623;\nPadovan1[nmax_Integer]:=RecurrenceTable[{a[n+1]==a[n-1]+a[n-2],a[0]==1,a[1]==1,a[2]==1},a,{n,0,nmax-1}]\nPadovan2[nmax_Integer]:=With[{},Floor[p^Range[-1,nmax-2]/s+1/2]]\nPadovan1[20]\nPadovan2[20]\nPadovan1[64]===Padovan2[64]\nSubstitutionSystem[{\"A\"->\"B\",\"B\"->\"C\",\"C\"->\"AB\"},\"A\",10]//Column\n(StringLength/@SubstitutionSystem[{\"A\"->\"B\",\"B\"->\"C\",\"C\"->\"AB\"},\"A\",31])==Padovan2[32]\n","language":"Mathematica"},{"code":"clear all;close all;clc;\n% Calculate the sequences\npadovan_sequence_20 = Padovan1(20)\npadovan_approx_20 = Padovan2(20)\n\n% Check if the sequences are equal for n = 64\nare_sequences_equal = isequal(Padovan1(64), Padovan2(64))\n\n\n% Generate the substitution system sequence\nsequence_32 = createLSystem();\nwords = sequence_32(1:10)\n\n% Check if the length of the substitution system sequence equals the Padovan sequence\nare_lengths_equal = all( cellfun(@(ele) length(ele), sequence_32) ...\n == Padovan2(32) )\n\nfunction words = createLSystem()\n words = {'A'}; % Initialize cell array with one element \"A\"\n text = 'A'; % Current text is \"A\"\n\n while length(words) < 32\n newText = ''; % Initialize new text as empty\n for i = 1:length(text)\n switch text(i)\n case 'A'\n newText = [newText 'B']; % Append 'B' to new text\n case 'B'\n newText = [newText 'C']; % Append 'C' to new text\n case 'C'\n newText = [newText 'AB']; % Append 'AB' to new text\n end\n end\n text = newText; % Update text with the new text\n words{end+1} = text; % Append new text to words list\n end\nend\n\nfunction padovan_sequence = Padovan1(nmax)\n padovan_sequence = zeros(1, nmax);\n padovan_sequence(1:3) = [1, 1, 1];\n for n = 4:nmax\n padovan_sequence(n) = padovan_sequence(n-2) + padovan_sequence(n-3);\n end\nend\n\nfunction padovan_approx = Padovan2(nmax)\n p = 1.324717957244746025960908854;\n s = 1.0453567932525329623;\n padovan_approx = floor(p.^(-1:nmax-2) / s + 0.5);\nend\n","language":"MATLAB"},{"code":"import sequtils, strutils, tables\n\nconst\n P = 1.324717957244746025960908854\n S = 1.0453567932525329623\n\n Rules = {'A': \"B\", 'B': \"C\", 'C': \"AB\"}.toTable\n\n\niterator padovan1(n: Natural): int {.closure.} =\n ## Yield the first \"n\" Padovan values using recurrence relation.\n for _ in 1..min(n, 3): yield 1\n var a, b, c = 1\n var count = 3\n while count < n:\n (a, b, c) = (b, c, a + b)\n yield c\n inc count\n\n\niterator padovan2(n: Natural): int {.closure.} =\n ## Yield the first \"n\" Padovan values using formula.\n if n > 1: yield 1\n var p = 1.0\n var count = 1\n while count < n:\n yield (p / S).toInt\n p *= P\n inc count\n\n\niterator padovan3(n: Natural): string {.closure.} =\n ## Yield the strings produced by the L-system.\n var s = \"A\"\n var count = 0\n while count < n:\n yield s\n var next: string\n for ch in s:\n next.add Rules[ch]\n s = move(next)\n inc count\n\n\necho \"First 20 terms of the Padovan sequence:\"\necho toSeq(padovan1(20)).join(\" \")\n\nlet list1 = toSeq(padovan1(64))\nlet list2 = toSeq(padovan2(64))\necho \"The first 64 iterative and calculated values \",\n if list1 == list2: \"are the same.\" else: \"differ.\"\n\necho \"\"\necho \"First 10 L-system strings:\"\necho toSeq(padovan3(10)).join(\" \")\necho \"\"\necho \"Lengths of the 32 first L-system strings:\"\nlet list3 = toSeq(padovan3(32)).mapIt(it.len)\necho list3.join(\" \")\necho \"These lengths are\",\n if list3 == list1[0..31]: \" \" else: \" not \",\n \"the 32 first terms of the Padovan sequence.\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature <state say>;\nuse List::Lazy 'lazy_list';\n\nmy $p = 1.32471795724474602596;\nmy $s = 1.0453567932525329623;\nmy %rules = (A => 'B', B => 'C', C => 'AB');\n\nmy $pad_recur = lazy_list { state @p = (1, 1, 1, 2); push @p, $p[1]+$p[2]; shift @p };\n\nsub pad_floor { int 1/2 + $p**($_<3 ? 1 : $_-2) / $s }\n\nmy($l, $m, $n) = (10, 20, 32);\n\nmy(@pr, @pf);\npush @pr, $pad_recur->next() for 1 .. $n; say join ' ', @pr[0 .. $m-1];\npush @pf, pad_floor($_) for 1 .. $n; say join ' ', @pf[0 .. $m-1];\n\nmy @L = 'A';\npush @L, join '', @rules{split '', $L[-1]} for 1 .. $n;\nsay join ' ', @L[0 .. $l-1];\n\n$pr[$_] == $pf[$_] and $pr[$_] == length $L[$_] or die \"Uh oh, n=$_: $pr[$_] vs $pf[$_] vs \" . length $L[$_] for 0 .. $n-1;\nsay '100% agreement among all 3 methods.';\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">padovan</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">padovanr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">padovan</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">padovan</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">padovan</span><span style=\"color: #0000FF;\">[$-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">padovan</span><span style=\"color: #0000FF;\">[$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">padovan</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1.324717957244746025960908854</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1.0453567932525329623</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">padovana</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">0.5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"B\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"C\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"AB\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">padovanl</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">prev</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #000000;\">64</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"A\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l10</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">64</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">padovanr</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">padovana</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">pn</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">pn</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">crash</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"oops\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">l10</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">pl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">padovanl</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The first 20 terms of the Padovan sequence: %v\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">padovan</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"The first 10 L-system strings: %v\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">l10</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"recursive, algorithmic, and l-system agree to n=64\\n\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"from math import floor\nfrom collections import deque\nfrom typing import Dict, Generator\n\n\ndef padovan_r() -> Generator[int, None, None]:\n last = deque([1, 1, 1], 4)\n while True:\n last.append(last[-2] + last[-3])\n yield last.popleft()\n\n_p, _s = 1.324717957244746025960908854, 1.0453567932525329623\n\ndef padovan_f(n: int) -> int:\n return floor(_p**(n-1) / _s + .5)\n\ndef padovan_l(start: str='A',\n rules: Dict[str, str]=dict(A='B', B='C', C='AB')\n ) -> Generator[str, None, None]:\n axiom = start\n while True:\n yield axiom\n axiom = ''.join(rules[ch] for ch in axiom)\n\n\nif __name__ == \"__main__\":\n from itertools import islice\n\n print(\"The first twenty terms of the sequence.\")\n print(str([padovan_f(n) for n in range(20)])[1:-1])\n\n r_generator = padovan_r()\n if all(next(r_generator) == padovan_f(n) for n in range(64)):\n print(\"\\nThe recurrence and floor based algorithms match to n=63 .\")\n else:\n print(\"\\nThe recurrence and floor based algorithms DIFFER!\")\n\n print(\"\\nThe first 10 L-system string-lengths and strings\")\n l_generator = padovan_l(start='A', rules=dict(A='B', B='C', C='AB'))\n print('\\n'.join(f\" {len(string):3} {repr(string)}\"\n for string in islice(l_generator, 10)))\n\n r_generator = padovan_r()\n l_generator = padovan_l(start='A', rules=dict(A='B', B='C', C='AB'))\n if all(len(next(l_generator)) == padovan_f(n) == next(r_generator)\n for n in range(32)):\n print(\"\\nThe L-system, recurrence and floor based algorithms match to n=31 .\")\n else:\n print(\"\\nThe L-system, recurrence and floor based algorithms DIFFER!\")\n","language":"Phix"},{"code":"'''Padovan series'''\n\nfrom itertools import chain, islice\nfrom math import floor\nfrom operator import eq\n\n\n# padovans :: [Int]\ndef padovans():\n '''Non-finite series of Padovan numbers,\n defined in terms of recurrence relations.\n '''\n def recurrence(abc):\n a, b, c = abc\n return a, (b, c, a + b)\n\n return unfoldr(recurrence)(\n (1, 1, 1)\n )\n\n\n# padovanFloor :: [Int]\ndef padovanFloor():\n '''The Padovan series, defined in terms\n of a floor function.\n '''\n p = 1.324717957244746025960908854\n s = 1.0453567932525329623\n\n def f(n):\n return floor(p ** (n - 1) / s + 0.5), 1 + n\n\n return unfoldr(f)(0)\n\n\n# padovanLSystem : [Int]\ndef padovanLSystem():\n '''An L-system generating terms whose lengths\n are the values of the Padovan integer series.\n '''\n def rule(c):\n return 'B' if 'A' == c else (\n 'C' if 'B' == c else 'AB'\n )\n\n def f(s):\n return s, ''.join(list(concatMap(rule)(s)))\n\n return unfoldr(f)('A')\n\n\n# ------------------------- TEST -------------------------\n\n# prefixesMatch :: [a] -> [a] -> Bool\ndef prefixesMatch(xs, ys, n):\n '''True if the first n items of each\n series are the same.\n '''\n return all(map(eq, take(n)(xs), ys))\n\n\n# main :: IO ()\ndef main():\n '''Test three Padovan functions for\n equivalence and expected results.\n '''\n print('\\n'.join([\n \"First 20 padovans:\\n\",\n repr(take(20)(padovans())),\n\n \"\\nThe recurrence and floor-based functions\" + (\n \" match over 64 terms:\\n\"\n ),\n repr(prefixesMatch(\n padovans(),\n padovanFloor(),\n 64\n )),\n\n \"\\nFirst 10 L-System strings:\\n\",\n repr(take(10)(padovanLSystem())),\n\n \"\\nThe lengths of the first 32 L-System strings\",\n \"match the Padovan sequence:\\n\",\n repr(prefixesMatch(\n padovans(),\n (len(x) for x in padovanLSystem()),\n 32\n ))\n ]))\n\n\n# ----------------------- GENERIC ------------------------\n\n# concatMap :: (a -> [b]) -> [a] -> [b]\ndef concatMap(f):\n '''A concatenated map'''\n def go(xs):\n return chain.from_iterable(map(f, xs))\n return go\n\n\n# unfoldr :: (b -> Maybe (a, b)) -> b -> [a]\ndef unfoldr(f):\n '''A lazy (generator) list unfolded from a seed value\n by repeated application of f until no residue remains.\n Dual to fold/reduce.\n f returns either None, or just (value, residue).\n For a strict output list, wrap the result with list()\n '''\n def go(x):\n valueResidue = f(x)\n while None is not valueResidue:\n yield valueResidue[0]\n valueResidue = f(valueResidue[1])\n return go\n\n\n# take :: Int -> [a] -> [a]\n# take :: Int -> String -> String\ndef take(n):\n '''The prefix of xs of length n,\n or xs itself if n > length xs.\n '''\n def go(xs):\n return (\n xs[0:n]\n if isinstance(xs, (list, tuple))\n else list(islice(xs, n))\n )\n return go\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Phix"},{"code":"( --------------------- Recurrence -------------------- )\n\n [ dup 0 = iff\n [ drop ' [ ] ] done\n dup 1 = iff\n [ drop ' [ 1 ] ] done\n dip [ [] 0 1 1 ]\n 2 - times\n [ dip [ 2dup + ] swap\n 3 pack dip join\n unpack ]\n 3 times join behead drop ] is padovan1 ( n --> [ )\n\n say \"With recurrence: \" 20 padovan1 echo cr cr\n\n\n( ------------------- Floor Function ------------------ )\n\n $ \"bigrat.qky\" loadfile\n\n [ [ $ \"1.324717957244746025960908854\"\n $->v drop join ] constant\n do ] is p ( --> n/d )\n\n [ [ $ \"1.0453567932525329623\"\n $->v drop join ] constant\n do ] is s ( --> n/d )\n\n [ 1 -\n p rot v** s v/ 1 2 v+ / ] is padovan2 ( n --> n )\n\n say \"With floor function: \"\n []\n 20 times [ i^ padovan2 join ]\n echo cr cr\n\n\n( ---------------------- L-System --------------------- )\n\n [ $ \"\" swap witheach\n [ nested quackery join ] ] is expand ( $ --> $ )\n\n [ $ \"B\" ] is A ( $ --> $ )\n\n [ $ \"C\" ] is B ( $ --> $ )\n\n [ $ \"AB\" ] is C ( $ --> $ )\n\n $ \"A\"\n\n say \"First 10 L System strings: \"\n 9 times\n [ dup echo$ sp\n expand ]\n echo$ cr cr\n\n [] $ \"A\"\n 31 times\n [ dup size\n swap dip join\n expand ]\n size join\n\n 32 padovan1 = iff\n [ say \"The first 32 recurrence terms and L System lengths are the same.\" ]\n else [ say \"Oh no! It's all gone pear-shaped!\" ]\n","language":"Quackery"},{"code":"# Function to calculate Padovan sequence iteratively\npadovan_sequence <- function(n) {\n recurrences <- numeric(n)\n recurrences[1:3] <- c(1, 1, 1)\n if (n > 3) {\n for (i in 4:n) {\n recurrences[i] <- recurrences[i-2] + recurrences[i-3]\n }\n }\n recurrences\n}\n\n# Function to calculate Padovan floor\npadovan_floor <- function(aN) {\n PP <- 1.324717957244746025960908854\n SS <- 1.0453567932525329623\n floor((PP^(aN - 1)) / SS + 0.5)\n}\n\n# Function to create L-system\ncreate_l_system<- function() {\n words <- c(\"A\")\n text <- \"A\"\n\n while (length(words) < 32) {\n text <- strsplit(text, \"\")[[1]] # Split the string into a list of characters\n text <- sapply(text, function(char) {\n if (char == \"A\") {\n return(\"B\")\n } else if (char == \"B\") {\n return(\"C\")\n } else if (char == \"C\") {\n return(\"AB\")\n }\n })\n text <- paste(text, collapse = \"\") # Collapse the list back into a single string\n words <- c(words, text) # Append the new word to the list\n }\n\n words\n}\n\n\n# Main script\nnum_terms <- 64\npadovan_seq <- padovan_sequence(num_terms)\nfloors <- sapply(0:(num_terms-1), padovan_floor)\n\ncat(\"The first 20 terms of the Padovan sequence:\\n\")\ncat(padovan_seq[1:20], sep=\" \", end=\"\\n\")\ncat(\"\\n\")\n\ncat(\"Recurrence and floor functions agree for first 64 terms?\", all(padovan_seq == floors), \"\\n\\n\")\n\nwords <- create_l_system()\n\ncat(\"The first 10 terms of the L-system:\\n\")\ncat(words[1:10], sep=\" \", end=\"\\n\")\ncat(\"\\n\")\n\ncat(\"Length of first 32 terms produced from the L-system match Padovan sequence? \")\nword_lengths <- sapply(words, nchar)\ncat(all(word_lengths[1:32] == padovan_seq[1:32]))\n","language":"R"},{"code":"constant p = 1.32471795724474602596;\nconstant s = 1.0453567932525329623;\nconstant %rules = A => 'B', B => 'C', C => 'AB';\n\nmy @pad-recur = 1, 1, 1, -> $c, $b, $ { $b + $c } … *;\n\nmy @pad-floor = { floor 1/2 + p ** ($++ - 1) / s } … *;\n\nmy @pad-L-sys = 'A', { %rules{$^axiom.comb}.join } … *;\nmy @pad-L-len = @pad-L-sys.map: *.chars;\n\nsay @pad-recur.head(20);\nsay @pad-L-sys.head(10);\n\nsay \"Recurrence == Floor to N=64\" if (@pad-recur Z== @pad-floor).head(64).all;\nsay \"Recurrence == L-len to N=32\" if (@pad-recur Z== @pad-L-len).head(32).all;\n","language":"Raku"},{"code":"/*REXX pgm computes the Padovan seq. (using 2 methods), and also computes the L─strings.*/\nnumeric digits 40 /*better precision for Plastic ratio. */\nparse arg n nF Ln cL . /*obtain optional arguments from the CL*/\nif n=='' | n==\",\" then n= 20 /*Not specified? Then use the default.*/\nif nF=='' | nF==\",\" then nF= 64 /* \" \" \" \" \" \" */\nif Ln=='' | Ln==\",\" then Ln= 10 /* \" \" \" \" \" \" */\nif cL=='' | cL==\",\" then cL= 32 /* \" \" \" \" \" \" */\nPR= 1.324717957244746025960908854 /*the plastic ratio (constant). */\n s= 1.0453567932525329623 /*tge \"s\" constant. */\n @.= .; @.0= 1; @.1= 1; @.2= 1 /*initialize 3 terms of the Padovan seq*/\n !.= .; !.0= 1; !.1= 1; !.2= 1 /* \" \" \" \" \" \" \" */\ncall req1; call req2; call req3; call req4 /*invoke the four task's requirements. */\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nfloor: procedure; parse arg x; t= trunc(x); return t - (x<0) * (x\\=t)\npF: procedure expose !. PR s; parse arg x; !.x= floor(PR**(x-1)/s + .5); return !.x\nth: parse arg th; return th||word('th st nd rd',1+(th//10)*(th//100%10\\==1)*(th//10<4))\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nL_sys: procedure: arg x; q=; a.A= 'B'; a.B= 'C'; a.C= 'AB'; if x=='' then return 'A'\n do k=1 for length(x); _= substr(x, k, 1); q= q || a._\n end /*k*/; return q\n/*──────────────────────────────────────────────────────────────────────────────────────*/\np: procedure expose @.; parse arg x; if @.x\\==. then return @.x /*@.X defined?*/\n xm2= x - 2; xm3= x - 3; @.x= @.xm2 + @.xm3; return @.x\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nreq1: say 'The first ' n \" terms of the Pandovan sequence:\";\n $= @.0; do j=1 for n-1; $= $ p(j)\n end /*j*/\n say $; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nreq2: ok= 1; what= ' terms match for recurrence and floor─based functions.'\n do j=0 for nF; if p(j)==pF(j) then iterate\n say 'the ' th(j) \" terms don't match:\" p(j) pF(j); ok= 0\n end /*j*/\n say\n if ok then say 'all ' nF what; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nreq3: y=; $= 'A'\n do j=1 for Ln-1; y= L_sys(y); $= $ L_sys(y)\n end /*j*/\n say\n say 'L_sys:' $; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nreq4: y=; what=' terms match for Padovan terms and lengths of L_sys terms.'\n ok= 1; do j=1 for cL; y= L_sys(y); L= length(y)\n if L==p(j-1) then iterate\n say 'the ' th(j) \" Padovan term doesn't match the length of the\",\n 'L_sys term:' p(j-1) L; ok= 0\n end /*j*/\n say\n if ok then say 'all ' cL what; return\n","language":"REXX"},{"code":"padovan = Enumerator.new do |y|\n ar = [1, 1, 1]\n loop do\n ar << ar.first(2).sum\n y << ar.shift\n end\nend\n\nP, S = 1.324717957244746025960908854, 1.0453567932525329623\ndef padovan_f(n) = (P**(n-1) / S + 0.5).floor\n\nputs \"Recurrence Padovan: #{padovan.take(20)}\"\nputs \"Floor function: #{(0...20).map{|n| padovan_f(n)}}\"\n\nn = 63\nbool = (0...n).map{|n| padovan_f(n)} == padovan.take(n)\nputs \"Recurrence and floor function are equal upto #{n}: #{bool}.\"\nputs\n\ndef l_system(axiom = \"A\", rules = {\"A\" => \"B\", \"B\" => \"C\", \"C\" => \"AB\"} )\n return enum_for(__method__, axiom, rules) unless block_given?\n loop do\n yield axiom\n axiom = axiom.chars.map{|c| rules[c] }.join\n end\nend\n\nputs \"First 10 elements of L-system: #{l_system.take(10).join(\", \")} \"\nn = 32\nbool = l_system.take(n).map(&:size) == padovan.take(n)\nputs \"Sizes of first #{n} l_system strings equal to recurrence padovan? #{bool}.\"\n","language":"Ruby"},{"code":"fn padovan_recur() -> impl std::iter::Iterator<Item = usize> {\n let mut p = vec![1, 1, 1];\n let mut n = 0;\n std::iter::from_fn(move || {\n let pn = if n < 3 { p[n] } else { p[0] + p[1] };\n p[0] = p[1];\n p[1] = p[2];\n p[2] = pn;\n n += 1;\n Some(pn)\n })\n}\n\nfn padovan_floor() -> impl std::iter::Iterator<Item = usize> {\n const P: f64 = 1.324717957244746025960908854;\n const S: f64 = 1.0453567932525329623;\n (0..).map(|x| (P.powf((x - 1) as f64) / S + 0.5).floor() as usize)\n}\n\nfn padovan_lsystem() -> impl std::iter::Iterator<Item = String> {\n let mut str = String::from(\"A\");\n std::iter::from_fn(move || {\n let result = str.clone();\n let mut next = String::new();\n for ch in str.chars() {\n match ch {\n 'A' => next.push('B'),\n 'B' => next.push('C'),\n _ => next.push_str(\"AB\"),\n }\n }\n str = next;\n Some(result)\n })\n}\n\nfn main() {\n println!(\"First 20 terms of the Padovan sequence:\");\n for p in padovan_recur().take(20) {\n print!(\"{} \", p);\n }\n println!();\n\n println!(\n \"\\nRecurrence and floor functions agree for first 64 terms? {}\",\n padovan_recur().take(64).eq(padovan_floor().take(64))\n );\n\n println!(\"\\nFirst 10 strings produced from the L-system:\");\n for p in padovan_lsystem().take(10) {\n print!(\"{} \", p);\n }\n println!();\n\n println!(\n \"\\nLength of first 32 strings produced from the L-system = Padovan sequence? {}\",\n padovan_lsystem()\n .map(|x| x.len())\n .take(32)\n .eq(padovan_recur().take(32))\n );\n}\n","language":"Rust"},{"code":"object Padovan extends App {\n\n val recurrences = new collection.mutable.ListBuffer[Int]()\n val floors = new collection.mutable.ListBuffer[Int]()\n val PP = 1.324717957244746025960908854\n val SS = 1.0453567932525329623\n\n for (i <- 0 until 64) {\n recurrences += padovanRecurrence(i)\n floors += padovanFloor(i)\n }\n\n println(\"The first 20 terms of the Padovan sequence:\")\n recurrences.slice(0, 20).foreach(term => print(s\"${term} \"))\n println(\"\\n\")\n\n println(s\"Recurrence and floor functions agree for first 64 terms? ${recurrences == floors}\")\n println(\"\")\n\n val words = createLSystem()\n\n println(\"The first 10 terms of the L-system:\")\n words.slice(0, 10).foreach(term => print(term + \" \"))\n println(\"\\n\")\n\n print(\"Length of first 32 terms produced from the L-system match Padovan sequence? \")\n val wordLengths = words.map(_.length)\n print(wordLengths.slice(0, 32) == recurrences.slice(0, 32))\n\n def padovanRecurrence(n: Int): Int = {\n if (n <= 2) 1 else recurrences(n - 2) + recurrences(n - 3)\n }\n\n def padovanFloor(aN: Int): Int = {\n scala.math.floor(scala.math.pow(PP, aN - 1) / SS + 0.5).toInt\n }\n\n def createLSystem(): List[String] = {\n var words = List(\"A\")\n var text = \"A\"\n\n while (words.length < 32) {\n text = text.flatMap {\n case 'A' => \"B\"\n case 'B' => \"C\"\n case 'C' => \"AB\"\n }\n words = words :+ text\n }\n\n words\n }\n\n}\n","language":"Scala"},{"code":"import Foundation\n\nclass PadovanRecurrence: Sequence, IteratorProtocol {\n private var p = [1, 1, 1]\n private var n = 0\n\n func next() -> Int? {\n let pn = n < 3 ? p[n] : p[0] + p[1]\n p[0] = p[1]\n p[1] = p[2]\n p[2] = pn\n n += 1\n return pn\n }\n}\n\nclass PadovanFloor: Sequence, IteratorProtocol {\n private let P = 1.324717957244746025960908854\n private let S = 1.0453567932525329623\n private var n = 0\n\n func next() -> Int? {\n let p = Int(floor(pow(P, Double(n - 1)) / S + 0.5))\n n += 1\n return p\n }\n}\n\nclass PadovanLSystem: Sequence, IteratorProtocol {\n private var str = \"A\"\n\n func next() -> String? {\n let result = str\n var next = \"\"\n for ch in str {\n switch (ch) {\n case \"A\": next.append(\"B\")\n case \"B\": next.append(\"C\")\n default: next.append(\"AB\")\n }\n }\n str = next\n return result\n }\n}\n\nprint(\"First 20 terms of the Padovan sequence:\")\nfor p in PadovanRecurrence().prefix(20) {\n print(\"\\(p)\", terminator: \" \")\n}\nprint()\n\nvar b = PadovanRecurrence().prefix(64)\n .elementsEqual(PadovanFloor().prefix(64))\nprint(\"\\nRecurrence and floor functions agree for first 64 terms? \\(b)\")\n\nprint(\"\\nFirst 10 strings produced from the L-system:\");\nfor p in PadovanLSystem().prefix(10) {\n print(p, terminator: \" \")\n}\nprint()\n\nb = PadovanLSystem().prefix(32).map{$0.count}\n .elementsEqual(PadovanRecurrence().prefix(32))\nprint(\"\\nLength of first 32 strings produced from the L-system = Padovan sequence? \\(b)\")\n","language":"Swift"},{"code":"package require Tcl 8.6\n\n# Create a coroutine for generating Padovan sequence using lazy evaluation\nproc pad_recur {{n 1}} {\n set p1 1\n set p2 1\n set p3 1\n set p4 1\n for {set i 1} {$i <= $n} {incr i} {\n set next [expr {$p2 + $p3}]\n yield $p1\n set p1 $p2\n set p2 $p3\n set p3 $p4\n set p4 $next\n }\n}\n\nproc pad_floor {n} {\n set p 1.32471795724474602596\n set s 1.0453567932525329623\n if {$n < 3} {\n return 1 ;# The first three elements should be 1, so return 1 for n < 3\n } else {\n return [expr {int(0.5 + pow($p, double($n)-2) / $s)}]\n }\n}\n\n# Main variables\nset l 10\nset m 20\nset n 32\n\n# Generating Padovan sequence using recursive coroutine\nset pr [list]\nset pad_recur_coro [coroutine pad_recur_co pad_recur $n]\nfor {set i 1} {$i <= $n} {incr i} {\n lappend pr [pad_recur_co]\n}\nputs [join [lrange $pr 0 [expr {$m - 1}]] \" \"]\n\n# Generating Padovan sequence using floor function\nset pf [list]\nfor {set i 1} {$i <= $n} {incr i} {\n lappend pf [pad_floor $i]\n}\nputs [join [lrange $pf 0 [expr {$m - 1}]] \" \"]\n\n# Generating L-system sequence\nset L [list \"A\"]\nset rules [dict create A B B C C AB]\nfor {set i 1} {$i <= $n} {incr i} {\n set last [lindex $L end]\n set expansion \"\"\n foreach char [split $last \"\"] {\n append expansion [dict get $rules $char]\n }\n lappend L $expansion\n}\nputs [join [lrange $L 0 [expr {$l - 1}]] \" \"]\n\n# Comparison of all three methods, adjusting for zero-indexing\nfor {set i 0} {$i < $m} {incr i} {\n set pr_val [lindex $pr $i]\n set pf_val [lindex $pf $i]\n set L_len [string length [lindex $L $i]]\n if { $pr_val != $pf_val || $pr_val != $L_len } {\n error \"Uh oh, n=$i: $pr_val vs $pf_val vs $L_len\"\n }\n}\n\nputs \"100% agreement among all 3 methods.\"\n","language":"Tcl"},{"code":"import \"./big\" for BigRat\nimport \"./dynamic\" for Struct\n\nvar padovanRecur = Fn.new { |n|\n var p = List.filled(n, 1)\n if (n < 3) return p\n for (i in 3...n) p[i] = p[i-2] + p[i-3]\n return p\n}\n\nvar padovanFloor = Fn.new { |n|\n var p = BigRat.fromDecimal(\"1.324717957244746025960908854\")\n var s = BigRat.fromDecimal(\"1.0453567932525329623\")\n var f = List.filled(n, 0)\n var pow = BigRat.one\n f[0] = (pow/p/s + 0.5).floor.toInt\n for (i in 1...n) {\n f[i] = (pow/s + 0.5).floor.toInt\n pow = pow * p\n }\n return f\n}\n\nvar LSystem = Struct.create(\"LSystem\", [\"rules\", \"init\", \"current\"])\n\nvar step = Fn.new { |lsys|\n var s = \"\"\n if (lsys.current == \"\") {\n lsys.current = lsys.init\n } else {\n for (c in lsys.current) s = s + lsys.rules[c]\n lsys.current = s\n }\n return lsys.current\n}\n\nvar padovanLSys = Fn.new { |n|\n var rules = {\"A\": \"B\", \"B\": \"C\", \"C\": \"AB\"}\n var lsys = LSystem.new(rules, \"A\", \"\")\n var p = List.filled(n, null)\n for (i in 0...n) p[i] = step.call(lsys)\n return p\n}\n\nSystem.print(\"First 20 members of the Padovan sequence:\")\nSystem.print(padovanRecur.call(20))\n\nvar recur = padovanRecur.call(64)\nvar floor = padovanFloor.call(64)\nvar areSame = (0...64).all { |i| recur[i] == floor[i] }\nvar s = areSame ? \"give\" : \"do not give\"\nSystem.print(\"\\nThe recurrence and floor based functions %(s) the same results for 64 terms.\")\n\nvar p = padovanLSys.call(32)\nvar lsyst = p.map { |e| e.count }.toList\nSystem.print(\"\\nFirst 10 members of the Padovan L-System:\")\nSystem.print(p.take(10).toList)\nSystem.print(\"\\nand their lengths:\")\nSystem.print(lsyst.take(10).toList)\n\nrecur = recur.take(32).toList\nareSame = (0...32).all { |i| recur[i] == lsyst[i] }\ns = areSame ? \"give\" : \"do not give\"\nSystem.print(\"\\nThe recurrence and L-system based functions %(s) the same results for 32 terms.\")\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Padovan_sequence\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The [[wp:Padovan sequence|Padovan sequence]] is similar to the [[wp:Fibonacci sequence|Fibonacci sequence]] in several ways.\\nSome are given in the table below, and the referenced video shows some of the geometric\\nsimilarities.\\n\\n::{| class=\\\"wikitable\\\"\\n! Comment !! Padovan !! Fibonacci\\n|-\\n| || || \\n|-\\n| Named after. || Richard Padovan || Leonardo of Pisa: Fibonacci\\n|-\\n| || || \\n|-\\n| Recurrence initial values. || P(0)=P(1)=P(2)=1 || F(0)=0, F(1)=1\\n|-\\n| Recurrence relation. || P(n)=P(n-2)+P(n-3) || F(n)=F(n-1)+F(n-2)\\n|-\\n| || || \\n|-\\n| First 10 terms. || 1,1,1,2,2,3,4,5,7,9 || 0,1,1,2,3,5,8,13,21,34\\n|-\\n| || || \\n|-\\n| Ratio of successive terms... || Plastic ratio, p || Golden ratio, g\\n|-\\n| || 1.324717957244746025960908854… || 1.6180339887498948482...\\n|-\\n| Exact formula of ratios p and q. || ((9+69**.5)/18)**(1/3) + ((9-69**.5)/18)**(1/3) || (1+5**0.5)/2\\n|-\\n| Ratio is real root of polynomial. || p: x**3-x-1 || g: x**2-x-1\\n|-\\n| || || \\n|-\\n| Spirally tiling the plane using. || Equilateral triangles || Squares\\n|-\\n| || || \\n|-\\n| Constants for ... || s= 1.0453567932525329623 || a=5**0.5\\n|-\\n| ... Computing by truncation. || P(n)=floor(p**(n-1) / s + .5) || F(n)=floor(g**n / a + .5)\\n|-\\n| || || \\n|-\\n| L-System Variables. || A,B,C || A,B\\n|-\\n| L-System Start/Axiom. || A || A\\n|-\\n| L-System Rules. || A->B,B->C,C->AB || A->B,B->AB\\n|}\\n\\n;Task:\\n* Write a function/method/subroutine to compute successive members of the Padovan series using the recurrence relation.\\n* Write a function/method/subroutine to compute successive members of the Padovan series using the floor function.\\n* Show the first twenty terms of the sequence.\\n* Confirm that the recurrence and floor based functions give the same results for 64 terms,\\n* Write a function/method/... using the [[wp:L-system|L-system]] to generate successive strings.\\n* Show the first 10 strings produced from the L-system\\n* Confirm that the length of the first 32 strings produced is the Padovan sequence.\\n\\nShow output here, on this page.\\n\\n;Ref:\\n* [https://www.youtube.com/watch?v=PsGUEj4w9Cc The Plastic Ratio] - Numberphile video.\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V pp = 1.324717957244746025960908854\\nV ss = 1.0453567932525329623\\nV Rules = [‘A’ = ‘B’, ‘B’ = ‘C’, ‘C’ = ‘AB’]\\n\\nF padovan1(n)\\n V r = [1] * min(n, 3)\\n V (a, b, c) = (1, 1, 1)\\n V count = 3\\n L count < n\\n (a, b, c) = (b, c, a + b)\\n r [+]= c\\n count++\\n R r\\n\\nF padovan2(n)\\n V r = [1] * (n > 1)\\n V p = 1.0\\n V count = 1\\n L count < n\\n r [+]= Int(round(p / :ss))\\n p *= :pp\\n count++\\n R r\\n\\nF padovan3(n)\\n [String] r\\n V s = ‘A’\\n V count = 0\\n L count < n\\n r [+]= s\\n V next = ‘’\\n L(ch) s\\n next ‘’= Rules[ch]\\n s = next\\n count++\\n R r\\n\\nprint(‘First 20 terms of the Padovan sequence:’)\\nprint(padovan1(20).join(‘ ’))\\n\\nV list1 = padovan1(64)\\nV list2 = padovan2(64)\\nprint(‘The first 64 iterative and calculated values ’(I list1 == list2 {‘are the same.’} E ‘differ.’))\\n\\nprint()\\nprint(‘First 10 L-system strings:’)\\nprint(padovan3(10).join(‘ ’))\\nprint()\\nprint(‘Lengths of the 32 first L-system strings:’)\\nV list3 = padovan3(32).map(x -> x.len)\\nprint(list3.join(‘ ’))\\nprint(‘These lengths are’(I list3 == list1[0.<32] {‘ ’} E ‘ not ’)‘the 32 first terms of the Padovan sequence.’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # show members of the Padovan Sequence calculated in various ways #\\n # returns the first n elements of the Padovan sequence by the #\\n # recurance relation: P(n)=P(n-2)+P(n-3)\\t #\\n OP PADOVANI = ( INT n )[]INT:\\n BEGIN\\n [ 0 : n - 1 ]INT p; p[ 0 ] := p[ 1 ] := p[ 2 ] := 1;\\n FOR i FROM 3 TO UPB p DO\\n p[ i ] := p[ i - 2 ] + p[ i - 3 ]\\n OD;\\n p\\n END; # PADOVANI #\\n # returns the first n elements of the Padovan sequence by #\\n # computing by truncation P(n)=floor(p^(n-1) / s + .5) #\\n # where s = 1.0453567932525329623 #\\n # and p = the \\\"plastic ratio\\\" #\\n OP PADOVANC = ( INT n )[]INT:\\n BEGIN\\n LONG REAL s = 1.0453567932525329623;\\n LONG REAL p = 1.324717957244746025960908854;\\n LONG REAL pf := 1 / p;\\n [ 0 : n - 1 ]INT result;\\n FOR i FROM LWB result TO UPB result DO\\n result[ i ] := SHORTEN ENTIER ( pf / s + 0.5 );\\n pf *:= p\\n OD;\\n result\\n END; # PADOVANC #\\n # returns the first n L System strings of the Padovan sequence #\\n OP PADOVANL = ( INT n )[]STRING:\\n BEGIN\\n [ 0 : n - 1 ]STRING l; l[ 0 ] := \\\"A\\\"; l[ 1 ] := \\\"B\\\"; l[ 2 ] := \\\"C\\\";\\n FOR i FROM 3 TO UPB l DO\\n l[ i ] := l[ i - 3 ] + l[ i - 2 ]\\n OD;\\n l\\n END; # PADOVANC #\\n # returns TRUE if a and b have the same values, FALSE otherwise #\\n OP = = ( []INT a, b )BOOL:\\n IF LWB a /= LWB b OR UPB a /= UPB b\\n THEN # rows are not the same size # FALSE\\n ELSE\\n BOOL result := TRUE;\\n FOR i FROM LWB a TO UPB a WHILE result := a[ i ] = b[ i ] DO SKIP OD;\\n result\\n FI; # = #\\n # returns the number of elements in a #\\n OP LENGTH = ( []INT a )INT: ( UPB a - LWB a ) + 1;\\n # returns the number of characters in s #\\n OP LENGTH = ( STRING s )INT: ( UPB s - LWB s ) + 1;\\n # returns a string representation of n #\\n OP TOSTRING = ( INT n )STRING: whole( n, 0 );\\n # generate 64 elements of the sequence and 32 L System values #\\n []INT iterative = PADOVANI 64;\\n []INT calculated = PADOVANC 64;\\n []STRING l system = PADOVANL 32;\\n [ LWB l system : UPB l system ]INT l length;\\n FOR i FROM LWB l length TO UPB l length DO l length[ i ] := LENGTH l system[ i ] OD;\\n # first 20 terms #\\n print( ( \\\"First 20 terms of the Padovan Sequence\\\", newline ) );\\n FOR i FROM LWB iterative TO 19 DO\\n print( ( \\\" \\\", TOSTRING iterative[ i ] ) )\\n OD;\\n print( ( newline ) );\\n print( ( \\\"The first \\\"\\n , TOSTRING LENGTH iterative\\n , \\\" iterative and calculated values \\\"\\n , IF iterative = calculated THEN \\\"are the same\\\" ELSE \\\"differ\\\" FI\\n , newline\\n )\\n );\\n # print the first 10 values of the L System strings #\\n print( ( newline, \\\"First 10 L System strings\\\", newline ) );\\n FOR i FROM LWB l system TO 9 DO\\n print( ( \\\" \\\", l system[ i ] ) )\\n OD;\\n print( ( newline ) );\\n print( ( \\\"The first \\\"\\n , TOSTRING LENGTH l length\\n , \\\" iterative values and L System lengths \\\"\\n , IF l length = iterative[ LWB l length : UPB l length @ LWB l length ] THEN \\\"are the same\\\" ELSE \\\"differ\\\" FI\\n , newline\\n )\\n )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"--------------------- PADOVAN NUMBERS --------------------\\n\\n-- padovans :: [Int]\\non padovans()\\n script f\\n on |λ|(abc)\\n set {a, b, c} to abc\\n\\n {a, {b, c, a + b}}\\n end |λ|\\n end script\\n\\n unfoldr(f, {1, 1, 1})\\nend padovans\\n\\n\\n-- padovanFloor :: [Int]\\non padovanFloor()\\n script f\\n property p : 1.324717957245\\n property s : 1.045356793253\\n on |λ|(n)\\n {floor(0.5 + ((p ^ (n - 1)) / s)), 1 + n}\\n end |λ|\\n end script\\n\\n unfoldr(f, 0)\\nend padovanFloor\\n\\n\\n-- padovanLSystem :: [String]\\non padovanLSystem()\\n script rule\\n on |λ|(c)\\n if \\\"A\\\" = c then\\n \\\"B\\\"\\n else if \\\"B\\\" = c then\\n \\\"C\\\"\\n else\\n \\\"AB\\\"\\n end if\\n end |λ|\\n end script\\n\\n script f\\n on |λ|(s)\\n {s, concatMap(rule, characters of s) as string}\\n end |λ|\\n end script\\n\\n unfoldr(f, \\\"A\\\")\\nend padovanLSystem\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n unlines({\\\"First 20 padovans:\\\", ¬\\n showList(take(20, padovans())), ¬\\n \\\"\\\", ¬\\n \\\"The recurrence and floor-based functions\\\", ¬\\n \\\"match over the first 64 terms:\\\\n\\\", ¬\\n prefixesMatch(padovans(), padovanFloor(), 64), ¬\\n \\\"\\\", ¬\\n \\\"First 10 L-System strings:\\\", ¬\\n showList(take(10, padovanLSystem())), ¬\\n \\\"\\\", ¬\\n \\\"The lengths of the first 32 L-System\\\", ¬\\n \\\"strings match the Padovan sequence:\\\\n\\\", ¬\\n prefixesMatch(padovans(), fmap(|length|, padovanLSystem()), 32)})\\nend run\\n\\n\\n-- prefixesMatch :: [a] -> [a] -> Bool\\non prefixesMatch(xs, ys, n)\\n take(n, xs) = take(n, ys)\\nend prefixesMatch\\n\\n\\n------------------------- GENERIC ------------------------\\n\\n-- concatMap :: (a -> [b]) -> [a] -> [b]\\non concatMap(f, xs)\\n set lng to length of xs\\n set acc to {}\\n tell mReturn(f)\\n repeat with i from 1 to lng\\n set acc to acc & (|λ|(item i of xs, i, xs))\\n end repeat\\n end tell\\n return acc\\nend concatMap\\n\\n\\n-- floor :: Num -> Int\\non floor(x)\\n if class of x is record then\\n set nr to properFracRatio(x)\\n else\\n set nr to properFraction(x)\\n end if\\n set n to item 1 of nr\\n if 0 > item 2 of nr then\\n n - 1\\n else\\n n\\n end if\\nend floor\\n\\n\\n-- fmap <$> :: (a -> b) -> Gen [a] -> Gen [b]\\non fmap(f, gen)\\n script\\n property g : mReturn(f)\\n on |λ|()\\n set v to gen's |λ|()\\n if v is missing value then\\n v\\n else\\n g's |λ|(v)\\n end if\\n end |λ|\\n end script\\nend fmap\\n\\n\\n-- intercalate :: String -> [String] -> String\\non intercalate(delim, xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, delim}\\n set s to xs as text\\n set my text item delimiters to dlm\\n s\\nend intercalate\\n\\n\\n-- length :: [a] -> Int\\non |length|(xs)\\n set c to class of xs\\n if list is c or string is c then\\n length of xs\\n else\\n (2 ^ 29 - 1) -- (maxInt - simple proxy for non-finite)\\n end if\\nend |length|\\n\\n\\n-- map :: (a -> b) -> [a] -> [b]\\non map(f, xs)\\n -- The list obtained by applying f\\n -- to each element of 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 |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- min :: 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\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\non mReturn(f)\\n -- 2nd class handler function lifted into 1st class script wrapper.\\n if script is class of f then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- properFraction :: Real -> (Int, Real)\\non properFraction(n)\\n set i to (n div 1)\\n {i, n - i}\\nend properFraction\\n\\n\\n-- showList :: [a] -> String\\non showList(xs)\\n \\\"[\\\" & intercalate(\\\",\\\", map(my str, xs)) & \\\"]\\\"\\nend showList\\n\\n\\n-- str :: a -> String\\non str(x)\\n x as string\\nend str\\n\\n\\n-- take :: Int -> [a] -> [a]\\n-- take :: Int -> String -> String\\non take(n, xs)\\n set c to class of xs\\n if list is c then\\n if 0 < n then\\n items 1 thru min(n, length of xs) of xs\\n else\\n {}\\n end if\\n else if string is c then\\n if 0 < n then\\n text 1 thru min(n, length of xs) of xs\\n else\\n \\\"\\\"\\n end if\\n else if script is c then\\n set ys to {}\\n repeat with i from 1 to n\\n set v to |λ|() of xs\\n if missing value is v then\\n return ys\\n else\\n set end of ys to v\\n end if\\n end repeat\\n return ys\\n else\\n missing value\\n end if\\nend take\\n\\n\\n-- unfoldr :: (b -> Maybe (a, b)) -> b -> [a]\\non unfoldr(f, v)\\n -- A lazy (generator) list unfolded from a seed value\\n -- by repeated application of f to a value until no\\n -- residue remains. Dual to fold/reduce.\\n -- f returns either nothing (missing value),\\n -- or just (value, residue).\\n script\\n property valueResidue : {v, v}\\n property g : mReturn(f)\\n on |λ|()\\n set valueResidue to g's |λ|(item 2 of (valueResidue))\\n if missing value ≠ valueResidue then\\n item 1 of (valueResidue)\\n else\\n missing value\\n end if\\n end |λ|\\n end script\\nend unfoldr\\n\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n -- A single string formed by the intercalation\\n -- of a list of strings with the newline character.\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, linefeed}\\n set s to xs as text\\n set my text item delimiters to dlm\\n s\\nend unlines\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <math.h>\\n#include <string.h>\\n\\n/* Generate (and memoize) the Padovan sequence using\\n * the recurrence relationship */\\nint pRec(int n) {\\n static int *memo = NULL;\\n static size_t curSize = 0;\\n\\n /* grow memoization array when necessary and fill with zeroes */\\n if (curSize <= (size_t) n) {\\n size_t lastSize = curSize;\\n while (curSize <= (size_t) n) curSize += 1024 * sizeof(int);\\n memo = realloc(memo, curSize * sizeof(int));\\n memset(memo + lastSize, 0, (curSize - lastSize) * sizeof(int));\\n }\\n\\n /* if we don't have the value for N yet, calculate it */\\n if (memo[n] == 0) {\\n if (n<=2) memo[n] = 1;\\n else memo[n] = pRec(n-2) + pRec(n-3);\\n }\\n\\n return memo[n];\\n}\\n\\n/* Calculate the Nth value of the Padovan sequence\\n * using the floor function */\\nint pFloor(int n) {\\n long double p = 1.324717957244746025960908854;\\n long double s = 1.0453567932525329623;\\n return powl(p, n-1)/s + 0.5;\\n}\\n\\n/* Given the previous value for the L-system, generate the\\n * next value */\\nvoid nextLSystem(const char *prev, char *buf) {\\n while (*prev) {\\n switch (*prev++) {\\n case 'A': *buf++ = 'B'; break;\\n case 'B': *buf++ = 'C'; break;\\n case 'C': *buf++ = 'A'; *buf++ = 'B'; break;\\n }\\n }\\n *buf = '\\\\0';\\n}\\n\\nint main() {\\n // 8192 is enough up to P_33.\\n #define BUFSZ 8192\\n char buf1[BUFSZ], buf2[BUFSZ];\\n int i;\\n\\n /* Print P_0..P_19 */\\n printf(\\\"P_0 .. P_19: \\\");\\n for (i=0; i<20; i++) printf(\\\"%d \\\", pRec(i));\\n printf(\\\"\\\\n\\\");\\n\\n /* Check that functions match up to P_63 */\\n printf(\\\"The floor- and recurrence-based functions \\\");\\n for (i=0; i<64; i++) {\\n if (pRec(i) != pFloor(i)) {\\n printf(\\\"do not match at %d: %d != %d.\\\\n\\\",\\n i, pRec(i), pFloor(i));\\n break;\\n }\\n }\\n if (i == 64) {\\n printf(\\\"match from P_0 to P_63.\\\\n\\\");\\n }\\n\\n /* Show first 10 L-system strings */\\n printf(\\\"\\\\nThe first 10 L-system strings are:\\\\n\\\");\\n for (strcpy(buf1, \\\"A\\\"), i=0; i<10; i++) {\\n printf(\\\"%s\\\\n\\\", buf1);\\n strcpy(buf2, buf1);\\n nextLSystem(buf2, buf1);\\n }\\n\\n /* Check lengths of strings against pFloor up to P_31 */\\n printf(\\\"\\\\nThe floor- and L-system-based functions \\\");\\n for (strcpy(buf1, \\\"A\\\"), i=0; i<32; i++) {\\n if ((int)strlen(buf1) != pFloor(i)) {\\n printf(\\\"do not match at %d: %d != %d\\\\n\\\",\\n i, (int)strlen(buf1), pFloor(i));\\n break;\\n }\\n strcpy(buf2, buf1);\\n nextLSystem(buf2, buf1);\\n }\\n if (i == 32) {\\n printf(\\\"match from P_0 to P_31.\\\\n\\\");\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <map>\\n#include <cmath>\\n\\n// Generate the Padovan sequence using the recurrence\\n// relationship.\\nint pRec(int n) {\\n static std::map<int,int> memo;\\n auto it = memo.find(n);\\n if (it != memo.end()) return it->second;\\n\\n if (n <= 2) memo[n] = 1;\\n else memo[n] = pRec(n-2) + pRec(n-3);\\n return memo[n];\\n}\\n\\n// Calculate the N'th Padovan sequence using the\\n// floor function.\\nint pFloor(int n) {\\n long const double p = 1.324717957244746025960908854;\\n long const double s = 1.0453567932525329623;\\n return std::pow(p, n-1)/s + 0.5;\\n}\\n\\n// Return the N'th L-system string\\nstd::string& lSystem(int n) {\\n static std::map<int,std::string> memo;\\n auto it = memo.find(n);\\n if (it != memo.end()) return it->second;\\n\\n if (n == 0) memo[n] = \\\"A\\\";\\n else {\\n memo[n] = \\\"\\\";\\n for (char ch : memo[n-1]) {\\n switch(ch) {\\n case 'A': memo[n].push_back('B'); break;\\n case 'B': memo[n].push_back('C'); break;\\n case 'C': memo[n].append(\\\"AB\\\"); break;\\n }\\n }\\n }\\n return memo[n];\\n}\\n\\n// Compare two functions up to p_N\\nusing pFn = int(*)(int);\\nvoid compare(pFn f1, pFn f2, const char* descr, int stop) {\\n std::cout << \\\"The \\\" << descr << \\\" functions \\\";\\n int i;\\n for (i=0; i<stop; i++) {\\n int n1 = f1(i);\\n int n2 = f2(i);\\n if (n1 != n2) {\\n std::cout << \\\"do not match at \\\" << i\\n << \\\": \\\" << n1 << \\\" != \\\" << n2 << \\\".\\\\n\\\";\\n break;\\n }\\n }\\n if (i == stop) {\\n std::cout << \\\"match from P_0 to P_\\\" << stop << \\\".\\\\n\\\";\\n }\\n}\\n\\nint main() {\\n /* Print P_0 to P_19 */\\n std::cout << \\\"P_0 .. P_19: \\\";\\n for (int i=0; i<20; i++) std::cout << pRec(i) << \\\" \\\";\\n std::cout << \\\"\\\\n\\\";\\n\\n /* Check that floor and recurrence match up to P_64 */\\n compare(pFloor, pRec, \\\"floor- and recurrence-based\\\", 64);\\n\\n /* Show first 10 L-system strings */\\n std::cout << \\\"\\\\nThe first 10 L-system strings are:\\\\n\\\";\\n for (int i=0; i<10; i++) std::cout << lSystem(i) << \\\"\\\\n\\\";\\n std::cout << \\\"\\\\n\\\";\\n\\n /* Check lengths of strings against pFloor up to P_31 */\\n compare(pFloor, [](int n){return (int)lSystem(n).length();},\\n \\\"floor- and L-system-based\\\", 32);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\npublic static class Padovan\\n{\\n private static readonly List<int> recurrences = new List<int>();\\n private static readonly List<int> floors = new List<int>();\\n private const double PP = 1.324717957244746025960908854;\\n private const double SS = 1.0453567932525329623;\\n\\n public static void Main(string[] args)\\n {\\n for (int i = 0; i < 64; i++)\\n {\\n recurrences.Add(PadovanRecurrence(i));\\n floors.Add(PadovanFloor(i));\\n }\\n\\n Console.WriteLine(\\\"The first 20 terms of the Padovan sequence:\\\");\\n recurrences.GetRange(0, 20).ForEach(term => Console.Write(term + \\\" \\\"));\\n Console.WriteLine(Environment.NewLine);\\n\\n Console.WriteLine(\\\"Recurrence and floor functions agree for first 64 terms? \\\" + recurrences.SequenceEqual(floors));\\n Console.WriteLine(Environment.NewLine);\\n\\n List<string> words = CreateLSystem();\\n\\n Console.WriteLine(\\\"The first 10 terms of the L-system:\\\");\\n words.GetRange(0, 10).ForEach(term => Console.Write(term + \\\" \\\"));\\n Console.WriteLine(Environment.NewLine);\\n\\n Console.Write(\\\"Length of first 32 terms produced from the L-system match Padovan sequence? \\\");\\n List<int> wordLengths = words.Select(s => s.Length).ToList();\\n Console.WriteLine(wordLengths.SequenceEqual(recurrences.GetRange(0, 32)));\\n }\\n\\n private static int PadovanRecurrence(int n)\\n {\\n if (n <= 2)\\n return 1;\\n return recurrences[n - 2] + recurrences[n - 3];\\n }\\n\\n private static int PadovanFloor(int n)\\n {\\n return (int)Math.Floor(Math.Pow(PP, n - 1) / SS + 0.5);\\n }\\n\\n private static List<string> CreateLSystem()\\n {\\n List<string> words = new List<string>();\\n string text = \\\"A\\\";\\n\\n while (words.Count < 32)\\n {\\n words.Add(text);\\n char[] textChars = text.ToCharArray();\\n text = \\\"\\\";\\n foreach (char ch in textChars)\\n {\\n text += ch switch\\n {\\n 'A' => \\\"B\\\",\\n 'B' => \\\"C\\\",\\n 'C' => \\\"AB\\\",\\n _ => throw new InvalidOperationException(\\\"Unexpected character found: \\\" + ch),\\n };\\n }\\n }\\n\\n return words;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(def padovan (map first (iterate (fn [[a b c]] [b c (+ a b)]) [1 1 1])))\\n\\n(def pad-floor\\n (let [p 1.324717957244746025960908854\\n s 1.0453567932525329623]\\n (map (fn [n] (int (Math/floor (+ (/ (Math/pow p (dec n)) s) 0.5)))) (range))))\\n\\n(def pad-l\\n (iterate (fn f [[c & s]]\\n (case c\\n \\\\A (str \\\"B\\\" (f s))\\n \\\\B (str \\\"C\\\" (f s))\\n \\\\C (str \\\"AB\\\" (f s))\\n (str \\\"\\\")))\\n \\\"A\\\"))\\n\\n(defn comp-seq [n seqa seqb]\\n (= (take n seqa) (take n seqb)))\\n\\n(defn comp-all [n]\\n (= (map count (vec (take n pad-l)))\\n (take n padovan)\\n (take n pad-floor)))\\n\\n(defn padovan-print [& args]\\n ((print \\\"The first 20 items with recursion relation are: \\\")\\n (println (take 20 padovan))\\n (println)\\n (println (str\\n \\\"The recurrence and floor based algorithms \\\"\\n (if (comp-seq 64 padovan pad-floor) \\\"match\\\" \\\"not match\\\")\\n \\\" to n=64\\\"))\\n (println)\\n (println \\\"The first 10 L-system strings are:\\\")\\n (println (take 10 pad-l))\\n (println)\\n (println (str\\n \\\"The L-system, recurrence and floor based algorithms \\\"\\n (if (comp-all 32) \\\"match\\\" \\\"not match\\\")\\n \\\" to n=32\\\"))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"program Padovan_sequence;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n Velthuis.BigDecimals,\\n Boost.Generics.Collection;\\n\\ntype\\n TpFn = TFunc<Integer, Integer>;\\n\\nvar\\n RecMemo: TDictionary<Integer, Integer>;\\n lSystemMemo: TDictionary<Integer, string>;\\n\\nfunction pRec(n: Integer): Integer;\\nbegin\\n if RecMemo.HasKey(n) then\\n exit(RecMemo[n]);\\n\\n if (n <= 2) then\\n RecMemo[n] := 1\\n else\\n RecMemo[n] := pRec(n - 2) + pRec(n - 3);\\n Result := RecMemo[n];\\nend;\\n\\nfunction pFloor(n: Integer): Integer;\\nvar\\n p, s, a: BigDecimal;\\nbegin\\n p := '1.324717957244746025960908854';\\n s := '1.0453567932525329623';\\n a := p.IntPower(n - 1, 64);\\n Result := Round(BigDecimal.Divide(a, s));\\nend;\\n\\nfunction lSystem(n: Integer): string;\\nbegin\\n if n = 0 then\\n lSystemMemo[n] := 'A'\\n else\\n begin\\n lSystemMemo[n] := '';\\n for var ch in lSystemMemo[n - 1] do\\n begin\\n case ch of\\n 'A':\\n lSystemMemo[n] := lSystemMemo[n] + 'B';\\n 'B':\\n lSystemMemo[n] := lSystemMemo[n] + 'C';\\n 'C':\\n lSystemMemo[n] := lSystemMemo[n] + 'AB';\\n end;\\n end;\\n end;\\n Result := lSystemMemo[n];\\nend;\\n\\nprocedure Compare(f1, f2: TpFn; descr: string; stop: Integer);\\nbegin\\n write('The ', descr, ' functions ');\\n var i := 0;\\n while i < stop do\\n begin\\n var n1 := f1(i);\\n var n2 := f2(i);\\n if n1 <> n2 then\\n begin\\n write('do not match at ', i);\\n writeln(': ', n1, ' != ', n2, '.');\\n break;\\n end;\\n inc(i);\\n end;\\n if i = stop then\\n writeln('match from P_0 to P_', stop, '.');\\nend;\\n\\nbegin\\n RecMemo := TDictionary<Integer, Integer>.Create([], []);\\n lSystemMemo := TDictionary<Integer, string>.Create([], []);\\n\\n write('P_0 .. P_19: ');\\n for var i := 0 to 19 do\\n write(pRec(i), ' ');\\n writeln;\\n\\n Compare(pFloor, pRec, 'floor- and recurrence-based', 64);\\n writeln(#10'The first 10 L-system strings are:');\\n\\n for var i := 0 to 9 do\\n writeln(lSystem(i));\\n writeln;\\n\\n Compare(pFloor,\\n function(n: Integer): Integer\\n begin\\n Result := length(lSystem(n));\\n end, 'floor- and L-system-based', 32);\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"p[] = [ 1 1 1 ]\\npadorn = 1\\nfunc padorec .\\n if padorn <= 3\\n h = p[padorn]\\n else\\n h = p[1] + p[2]\\n .\\n p[1] = p[2]\\n p[2] = p[3]\\n p[3] = h\\n padorn += 1\\n return h\\n.\\npfn = 1\\nP = 1.32471795724474602596\\nS = 1.0453567932525329623\\n#\\nfunc padofloor .\\n p = floor ((pow P (pfn - 2)) / S + 0.5)\\n pfn += 1\\n return p\\n.\\nstr$ = \\\"A\\\"\\nfunc$ padolsys .\\n r$ = str$\\n for c$ in strchars str$\\n if c$ = \\\"A\\\"\\n nxt$ &= \\\"B\\\"\\n elif c$ = \\\"B\\\"\\n nxt$ &= \\\"C\\\"\\n else\\n nxt$ &= \\\"AB\\\"\\n .\\n .\\n str$ = nxt$\\n return r$\\n.\\n#\\nprint \\\"First 20 terms of the Padovan sequence:\\\"\\nfor i to 64\\n par[] &= padorec\\n.\\nfor i to 20\\n write par[i] & \\\" \\\"\\n.\\nprint \\\"\\\"\\nfor i to 64\\n paf[] &= padofloor\\n.\\nif par[] = paf[]\\n print \\\"\\\\nRecurrence and floor functions agree for first 64 terms\\\"\\n.\\nfor i to 32\\n pal$[] &= padolsys\\n.\\nprint \\\"\\\\nFirst 10 strings produced from the L-system:\\\"\\nfor i to 10\\n write pal$[i] & \\\" \\\"\\n.\\nprint \\\"\\\"\\nfor i to 32\\n if len pal$[i] <> par[i]\\n break 1\\n .\\n.\\nif i > 32\\n print \\\"\\\\nLength of first 32 strings produced from the L-system = Padovan sequence\\\"\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"# Padovan sequence as a Stream\\ndefmodule Padovan do\\n def stream do\\n Stream.resource(\\n fn -> {1, 1, 1} end,\\n fn {a, b, c} ->\\n next_value = a + b\\n {[a], {b, c, next_value}}\\n end,\\n fn _ -> :ok end\\n )\\n end\\nend\\n\\n# Padovan floor function\\ndefmodule PadovanFloorFunction do\\n @p 1.324717957244746025960908854\\n @s 1.0453567932525329623\\n\\n def padovan_f(n), do: trunc((:math.pow(@p, n - 1) / @s) + 0.5)\\nend\\n\\n# Calculate and print the first 20 elements of the Padovan sequence and the floor function\\npadovan_sequence = Padovan.stream() |> Enum.take(20)\\npadovan_floor_function = Enum.map(0..19, &PadovanFloorFunction.padovan_f(&1))\\n\\nIO.puts(\\\"Recurrence Padovan: #{inspect(padovan_sequence)}\\\")\\nIO.puts(\\\"Floor function: #{inspect(padovan_floor_function)}\\\")\\n\\n# Check if the sequences are equal up to n\\nn = 63\\nbool = Enum.map(0..(n-1), &PadovanFloorFunction.padovan_f(&1)) == Padovan.stream() |> Enum.take(n)\\nIO.puts(\\\"Recurrence and floor function are equal up to #{n}: #{bool}.\\\")\\n\\n# L-system generator as a Stream\\ndefmodule LSystem do\\n def stream(axiom \\\\\\\\ \\\"A\\\", rules \\\\\\\\ %{\\\"A\\\" => \\\"B\\\", \\\"B\\\" => \\\"C\\\", \\\"C\\\" => \\\"AB\\\"}) do\\n Stream.iterate(axiom, fn string ->\\n string\\n |> String.graphemes()\\n |> Enum.map(&Map.get(rules, &1, \\\"\\\"))\\n |> Enum.join()\\n end)\\n end\\nend\\n\\n# Calculate and print the first 10 elements of the L-system\\nl_system_sequence = LSystem.stream() |> Enum.take(10)\\nIO.puts(\\\"First 10 elements of L-system: #{l_system_sequence |> Enum.join(\\\", \\\")}\\\")\\n\\n# Check if the sizes of the L-system strings match the Padovan sequence\\nn = 32\\nl_system_sizes = LSystem.stream() |> Enum.take(n) |> Enum.map(&String.length/1)\\nbool = l_system_sizes == Padovan.stream() |> Enum.take(n)\\nIO.puts(\\\"Sizes of first #{n} L_system strings equal to recurrence Padovan? #{bool}.\\\")\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: L-system accessors io kernel make math math.functions\\nmemoize prettyprint qw sequences ;\\n\\nCONSTANT: p 1.324717957244746025960908854\\nCONSTANT: s 1.0453567932525329623\\n\\n: pfloor ( m -- n ) 1 - p swap ^ s /f .5 + >integer ;\\n\\nMEMO: precur ( m -- n )\\n dup 3 < [ drop 1 ]\\n [ [ 2 - precur ] [ 3 - precur ] bi + ] if ;\\n\\n: plsys, ( L-system -- )\\n [ iterate-L-system-string ] [ string>> , ] bi ;\\n\\n: plsys ( n -- seq )\\n <L-system>\\n \\\"A\\\" >>axiom\\n { qw{ A B } qw{ B C } qw{ C AB } } >>rules\\n swap 1 - '[ \\\"A\\\" , _ [ dup plsys, ] times ] { } make nip ;\\n\\n\\\"First 20 terms of the Padovan sequence:\\\" print\\n20 [ pfloor pprint bl ] each-integer nl nl\\n\\n64 [ [ pfloor ] [ precur ] bi assert= ] each-integer\\n\\\"Recurrence and floor based algorithms match to n=63.\\\" print nl\\n\\n\\\"First 10 L-system strings:\\\" print\\n10 plsys . nl\\n\\n32 <iota> [ pfloor ] map 32 plsys [ length ] map assert=\\n\\\"The L-system, recurrence and floor based algorithms match to n=31.\\\" print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"math/big\\\"\\n \\\"strings\\\"\\n)\\n\\nfunc padovanRecur(n int) []int {\\n p := make([]int, n)\\n p[0], p[1], p[2] = 1, 1, 1\\n for i := 3; i < n; i++ {\\n p[i] = p[i-2] + p[i-3]\\n }\\n return p\\n}\\n\\nfunc padovanFloor(n int) []int {\\n var p, s, t, u = new(big.Rat), new(big.Rat), new(big.Rat), new(big.Rat)\\n p, _ = p.SetString(\\\"1.324717957244746025960908854\\\")\\n s, _ = s.SetString(\\\"1.0453567932525329623\\\")\\n f := make([]int, n)\\n pow := new(big.Rat).SetInt64(1)\\n u = u.SetFrac64(1, 2)\\n t.Quo(pow, p)\\n t.Quo(t, s)\\n t.Add(t, u)\\n v, _ := t.Float64()\\n f[0] = int(math.Floor(v))\\n for i := 1; i < n; i++ {\\n t.Quo(pow, s)\\n t.Add(t, u)\\n v, _ = t.Float64()\\n f[i] = int(math.Floor(v))\\n pow.Mul(pow, p)\\n }\\n return f\\n}\\n\\ntype LSystem struct {\\n rules map[string]string\\n init, current string\\n}\\n\\nfunc step(lsys *LSystem) string {\\n var sb strings.Builder\\n if lsys.current == \\\"\\\" {\\n lsys.current = lsys.init\\n } else {\\n for _, c := range lsys.current {\\n sb.WriteString(lsys.rules[string(c)])\\n }\\n lsys.current = sb.String()\\n }\\n return lsys.current\\n}\\n\\nfunc padovanLSys(n int) []string {\\n rules := map[string]string{\\\"A\\\": \\\"B\\\", \\\"B\\\": \\\"C\\\", \\\"C\\\": \\\"AB\\\"}\\n lsys := &LSystem{rules, \\\"A\\\", \\\"\\\"}\\n p := make([]string, n)\\n for i := 0; i < n; i++ {\\n p[i] = step(lsys)\\n }\\n return p\\n}\\n\\n// assumes lists are same length\\nfunc areSame(l1, l2 []int) bool {\\n for i := 0; i < len(l1); i++ {\\n if l1[i] != l2[i] {\\n return false\\n }\\n }\\n return true\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"First 20 members of the Padovan sequence:\\\")\\n fmt.Println(padovanRecur(20))\\n recur := padovanRecur(64)\\n floor := padovanFloor(64)\\n same := areSame(recur, floor)\\n s := \\\"give\\\"\\n if !same {\\n s = \\\"do not give\\\"\\n }\\n fmt.Println(\\\"\\\\nThe recurrence and floor based functions\\\", s, \\\"the same results for 64 terms.\\\")\\n\\n p := padovanLSys(32)\\n lsyst := make([]int, 32)\\n for i := 0; i < 32; i++ {\\n lsyst[i] = len(p[i])\\n }\\n fmt.Println(\\\"\\\\nFirst 10 members of the Padovan L-System:\\\")\\n fmt.Println(p[:10])\\n fmt.Println(\\\"\\\\nand their lengths:\\\")\\n fmt.Println(lsyst[:10])\\n\\n same = areSame(recur[:32], lsyst)\\n s = \\\"give\\\"\\n if !same {\\n s = \\\"do not give\\\"\\n }\\n fmt.Println(\\\"\\\\nThe recurrence and L-system based functions\\\", s, \\\"the same results for 32 terms.\\\")\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"-- list of Padovan numbers using recurrence\\npRec = map (\\\\(a,_,_) -> a) $ iterate (\\\\(a,b,c) -> (b,c,a+b)) (1,1,1)\\n\\n-- list of Padovan numbers using self-referential lazy lists\\npSelfRef = 1 : 1 : 1 : zipWith (+) pSelfRef (tail pSelfRef)\\n\\n-- list of Padovan numbers generated from floor function\\npFloor = map f [0..]\\n where f n = floor $ p**fromInteger (pred n) / s + 0.5\\n p = 1.324717957244746025960908854\\n s = 1.0453567932525329623\\n\\n-- list of L-system strings\\nlSystem = iterate f \\\"A\\\"\\n where f [] = []\\n f ('A':s) = 'B':f s\\n f ('B':s) = 'C':f s\\n f ('C':s) = 'A':'B':f s\\n\\n-- check if first N elements match\\ncheckN n as bs = take n as == take n bs\\n\\nmain = do\\n putStr \\\"P_0 .. P_19: \\\"\\n putStrLn $ unwords $ map show $ take 20 pRec\\n\\n putStr \\\"The floor- and recurrence-based functions \\\"\\n putStr $ if checkN 64 pRec pFloor then \\\"match\\\" else \\\"do not match\\\"\\n putStr \\\" from P_0 to P_63.\\\\n\\\"\\n\\n putStr \\\"The self-referential- and recurrence-based functions \\\"\\n putStr $ if checkN 64 pRec pSelfRef then \\\"match\\\" else \\\"do not match\\\"\\n putStr \\\" from P_0 to P_63.\\\\n\\\\n\\\"\\n\\n putStr \\\"The first 10 L-system strings are:\\\\n\\\"\\n putStrLn $ unwords $ take 10 lSystem\\n\\n putStr \\\"\\\\nThe floor- and L-system-based functions \\\"\\n putStr $ if checkN 32 pFloor (map length lSystem)\\n then \\\"match\\\" else \\\"do not match\\\"\\n putStr \\\" from P_0 to P_31.\\\\n\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.List (unfoldr)\\n\\n--------------------- PADOVAN NUMBERS --------------------\\n\\npadovans :: [Integer]\\npadovans = unfoldr f (1, 1, 1)\\n where\\n f (a, b, c) = Just (a, (b, c, a + b))\\n\\n\\npadovanFloor :: [Integer]\\npadovanFloor = unfoldr f 0\\n where\\n f = Just . (((,) . g) <*> succ)\\n\\n g = floor . (0.5 +) . (/ s) . (p **) . fromInteger . pred\\n p = 1.324717957244746025960908854\\n s = 1.0453567932525329623\\n\\n\\npadovanLSystem :: [String]\\npadovanLSystem = unfoldr f \\\"A\\\"\\n where\\n f = Just . ((,) <*> concatMap rule)\\n\\n rule 'A' = \\\"B\\\"\\n rule 'B' = \\\"C\\\"\\n rule 'C' = \\\"AB\\\"\\n\\n\\n-------------------------- TESTS -------------------------\\n\\nmain :: IO ()\\nmain =\\n mapM_\\n putStrLn\\n [ \\\"First 20 padovans:\\\\n\\\",\\n show $ take 20 padovans,\\n [],\\n \\\"The recurrence and floor based functions\\\",\\n \\\"match over 64 terms:\\\\n\\\",\\n show $ prefixesMatch padovans padovanFloor 64,\\n [],\\n \\\"First 10 L-System strings:\\\\n\\\",\\n show $ take 10 padovanLSystem,\\n [],\\n \\\"The length of the first 32 strings produced\\\",\\n \\\"is the Padovan sequence:\\\\n\\\",\\n show $\\n prefixesMatch\\n padovans\\n (fromIntegral . length <$> padovanLSystem)\\n 32\\n ]\\n\\nprefixesMatch :: Eq a => [a] -> [a] -> Int -> Bool\\nprefixesMatch xs ys n = and (zipWith (==) (take n xs) ys)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"padovanSeq=: (],+/@(_2 _3{]))^:([-3:)&1 1 1\\n\\nNB. or, equivalently:\\npadovanSeq=: (, [: +/ _2 {. }:)@]^:([ - 2:)&1 1\\n\\nrealRoot=. {:@(#~ ]=|)@;@p.\\npadovanNth=: 0.5 <.@+ (realRoot _23 23 _2 1) %~ (realRoot _1 _1 0 1)^<:\\n\\npadovanL=: rplc&('A';'B'; 'B';'C'; 'C';'AB')@]^:[&'A'\\nseqLen=. #@(-.&' ')\\\"1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" padovanSeq 20\\n1 1 1 2 2 3 4 5 7 9 12 16 21 28 37 49 65 86 114 151\\n (padovanSeq 64) -: padovanNth(i.64)\\n1\\n padovanL i.10\\nA\\nB\\nC\\nAB\\nBC\\nCAB\\nABBC\\nBCCAB\\nCABABBC\\nABBCBCCAB\\n (padovanSeq 32) -: seqLen padovanL i.32\\n1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.List;\\n\\npublic final class Padovan {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tfor ( int i = 0; i < 64; i++ ) {\\n\\t\\t\\trecurrences.add(padovanRecurrence(i));\\n\\t\\t\\tfloors.add(padovanFloor(i));\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"The first 20 terms of the Padovan sequence:\\\");\\n\\t\\trecurrences.subList(0, 20).forEach( term -> System.out.print(term + \\\" \\\") );\\t\\t\\n\\t\\tSystem.out.println(System.lineSeparator());\\n\\t\\t\\n\\t\\tSystem.out.print(\\\"Recurrence and floor functions agree for first 64 terms? \\\" + recurrences.equals(floors));\\n\\t\\tSystem.out.println(System.lineSeparator());\\n\\t\\t\\n\\t\\tList<String> words = createLSystem();\\t\\t\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"The first 10 terms of the L-system:\\\");\\n\\t\\twords.subList(0, 10).forEach( term -> System.out.print(term + \\\" \\\") );\\t\\t\\n\\t\\tSystem.out.println(System.lineSeparator());\\n\\t\\t\\n\\t\\tSystem.out.print(\\\"Length of first 32 terms produced from the L-system match Padovan sequence? \\\");\\t\\t\\n\\t\\tList<Integer> wordLengths = words.stream().map( s -> s.length() ).toList();\\n\\t\\tSystem.out.println(wordLengths.equals(recurrences.subList(0, 32)));\\n\\t}\\n\\t\\n\\tprivate static int padovanRecurrence(int aN) {\\n\\t\\treturn ( aN <= 2 ) ? 1 : recurrences.get(aN - 2) + recurrences.get(aN - 3);\\t\\t\\n\\t}\\n\\t\\n\\tprivate static int padovanFloor(int aN) {\\n\\t\\treturn (int) Math.floor(Math.pow(PP, aN - 1) / SS + 0.5);\\n\\t}\\n\\t\\n\\tprivate static List<String> createLSystem() {\\n\\t\\tList<String> words = new ArrayList<String>();\\t\\t\\n\\t\\tStringBuilder stringBuilder = new StringBuilder();\\n\\t\\tString text = \\\"A\\\";\\n\\t\\t\\n\\t\\tdo {\\n\\t\\t\\twords.add(text);\\n\\t\\t\\tstringBuilder.setLength(0);\\n\\t\\t\\tfor ( char ch : text.toCharArray() ) {\\n\\t\\t\\t\\tString entry = switch ( ch ) {\\n\\t\\t\\t\\t\\tcase 'A' -> \\\"B\\\";\\n\\t\\t\\t\\t\\tcase 'B' -> \\\"C\\\";\\n\\t\\t\\t\\t\\tcase 'C' -> \\\"AB\\\";\\n\\t\\t\\t\\t\\tdefault -> throw new AssertionError(\\\"Unexpected character found: \\\" + ch);\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tstringBuilder.append(entry);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\ttext = stringBuilder.toString();\\n\\t\\t} while ( words.size() < 32 );\\n\\t\\t\\n\\t\\treturn words;\\n\\t}\\n\\t\\n\\tprivate static List<Integer> recurrences = new ArrayList<Integer>();\\n\\tprivate static List<Integer> floors = new ArrayList<Integer>();\\n\\t\\n\\tprivate static final double PP = 1.324717957244746025960908854;\\n\\tprivate static final double SS = 1.0453567932525329623;\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ----------------- PADOVAN NUMBERS -----------------\\n\\n // padovans :: [Int]\\n const padovans = () => {\\n // Non-finite series of Padovan numbers,\\n // defined in terms of recurrence relations.\\n const f = ([a, b, c]) => [\\n a,\\n [b, c, a + b]\\n ];\\n\\n return unfoldr(f)([1, 1, 1]);\\n };\\n\\n\\n // padovanFloor :: [Int]\\n const padovanFloor = () => {\\n // The Padovan series, defined in terms\\n // of a floor function.\\n const\\n // NB JavaScript loses some of this\\n // precision at run-time.\\n p = 1.324717957244746025960908854,\\n s = 1.0453567932525329623;\\n\\n const f = n => [\\n Math.floor(((p ** (n - 1)) / s) + 0.5),\\n 1 + n\\n ];\\n\\n return unfoldr(f)(0);\\n };\\n\\n\\n // padovanLSystem : [Int]\\n const padovanLSystem = () => {\\n // An L-system generating terms whose lengths\\n // are the values of the Padovan integer series.\\n const rule = c =>\\n \\\"A\\\" === c ? (\\n \\\"B\\\"\\n ) : \\\"B\\\" === c ? (\\n \\\"C\\\"\\n ) : \\\"AB\\\";\\n\\n const f = s => [\\n s,\\n chars(s).flatMap(rule)\\n .join(\\\"\\\")\\n ];\\n\\n return unfoldr(f)(\\\"A\\\");\\n };\\n\\n\\n // ---------------------- TEST -----------------------\\n // main :: IO ()\\n const main = () => {\\n // prefixesMatch :: [a] -> [a] -> Bool\\n const prefixesMatch = xs =>\\n ys => n => and(\\n zipWith(a => b => a === b)(\\n take(n)(xs)\\n )(\\n take(n)(ys)\\n )\\n );\\n\\n return [\\n \\\"First 20 padovans:\\\",\\n take(20)(padovans()),\\n\\n \\\"\\\\nThe recurrence and floor-based functions\\\",\\n \\\"match over the first 64 terms:\\\\n\\\",\\n prefixesMatch(\\n padovans()\\n )(\\n padovanFloor()\\n )(64),\\n\\n \\\"\\\\nFirst 10 L-System strings:\\\",\\n take(10)(padovanLSystem()),\\n\\n \\\"\\\\nThe lengths of the first 32 L-System\\\",\\n \\\"strings match the Padovan sequence:\\\\n\\\",\\n prefixesMatch(\\n padovans()\\n )(\\n fmap(length)(padovanLSystem())\\n )(32)\\n ]\\n .map(str)\\n .join(\\\"\\\\n\\\");\\n };\\n\\n // --------------------- GENERIC ---------------------\\n\\n // and :: [Bool] -> Bool\\n const and = xs =>\\n // True unless any value in xs is false.\\n [...xs].every(Boolean);\\n\\n\\n // chars :: String -> [Char]\\n const chars = s =>\\n s.split(\\\"\\\");\\n\\n\\n // fmap <$> :: (a -> b) -> Gen [a] -> Gen [b]\\n const fmap = f =>\\n function* (gen) {\\n let v = take(1)(gen);\\n\\n while (0 < v.length) {\\n yield f(v[0]);\\n v = take(1)(gen);\\n }\\n };\\n\\n\\n // length :: [a] -> Int\\n const length = xs =>\\n // Returns Infinity over objects without finite\\n // length. This enables zip and zipWith to choose\\n // the shorter argument when one is non-finite,\\n // like cycle, repeat etc\\n \\\"GeneratorFunction\\\" !== xs.constructor\\n .constructor.name ? (\\n xs.length\\n ) : Infinity;\\n\\n\\n // take :: Int -> [a] -> [a]\\n // take :: Int -> String -> String\\n const take = n =>\\n // The first n elements of a list,\\n // string of characters, or stream.\\n xs => \\\"GeneratorFunction\\\" !== xs\\n .constructor.constructor.name ? (\\n xs.slice(0, n)\\n ) : [].concat(...Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n\\n return x.done ? [] : [x.value];\\n }));\\n\\n\\n // str :: a -> String\\n const str = x =>\\n \\\"string\\\" !== typeof x ? (\\n JSON.stringify(x)\\n ) : x;\\n\\n\\n // unfoldr :: (b -> Maybe (a, b)) -> b -> Gen [a]\\n const unfoldr = f =>\\n // A lazy (generator) list unfolded from a seed value\\n // by repeated application of f to a value until no\\n // residue remains. Dual to fold/reduce.\\n // f returns either Null or just (value, residue).\\n // For a strict output list,\\n // wrap with `list` or Array.from\\n x => (\\n function* () {\\n let valueResidue = f(x);\\n\\n while (null !== valueResidue) {\\n yield valueResidue[0];\\n valueResidue = f(valueResidue[1]);\\n }\\n }()\\n );\\n\\n\\n // zipWithList :: (a -> b -> c) -> [a] -> [b] -> [c]\\n const zipWith = f =>\\n // A list constructed by zipping with a\\n // custom function, rather than with the\\n // default tuple constructor.\\n xs => ys => ((xs_, ys_) => {\\n const lng = Math.min(length(xs_), length(ys_));\\n\\n return take(lng)(xs_).map(\\n (x, i) => f(x)(ys_[i])\\n );\\n })([...xs], [...ys]);\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Output: first $n Padovans\\ndef padovanRecur($n):\\n [range(0;$n) | 1] as $p\\n | if $n < 3 then $p\\n else reduce range(3;$n) as $i ($p; .[$i] = .[$i-2] + .[$i-3])\\n end;\\n\\n# Output: first $n Padovans\\ndef padovanFloor($n):\\n { p: 1.324717957244746025960908854,\\n s: 1.0453567932525329623,\\n pow: 1 }\\n | reduce range (1;$n) as $i ( .f = [ ((.pow/.p/.s) + 0.5)|floor];\\n .f[$i] = (((.pow/.s) + 0.5)|floor)\\n | .pow *= .p)\\n | .f ;\\n\\n# Output: a stream of the L-System Padovan strings\\ndef padovanStrings:\\n {A: \\\"B\\\", B: \\\"C\\\", C: \\\"AB\\\", \\\"\\\": \\\"A\\\"} as $rules\\n | $rules[\\\"\\\"]\\n | while(true;\\n ascii_downcase\\n | gsub(\\\"a\\\"; $rules[\\\"A\\\"]) | gsub(\\\"b\\\"; $rules[\\\"B\\\"]) | gsub(\\\"c\\\"; $rules[\\\"C\\\"]) ) ;\\n\\n# Output: a stream of the Padovan numbers using the L-System strings\\ndef padovanNumbers:\\n padovanStrings | length;\\n\\ndef task:\\n def s1($n):\\n if padovanFloor($n) == padovanRecur($n) then \\\"give\\\" else \\\"do not give\\\" end;\\n\\n def s2($n):\\n if [limit($n; padovanNumbers)] == padovanRecur($n) then \\\"give\\\" else \\\"do not give\\\" end;\\n\\n \\\"The first 20 members of the Padovan sequence:\\\", padovanRecur(20),\\n \\\"\\\",\\n \\\"The recurrence and floor-based functions \\\\(s1(64)) the same results for 64 terms.\\\",\\n \\\"\\\",\\n ([limit(10; padovanStrings)]\\n | \\\"First 10 members of the Padovan L-System:\\\", .,\\n \\\"and their lengths:\\\",\\n map(length)),\\n \\\"\\\",\\n \\\"The recurrence and L-system based functions \\\\(s2(32)) the same results for 32 terms.\\\"\\n;\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"\\\"\\\"\\\" Recursive Padovan \\\"\\\"\\\"\\nrPadovan(n) = (n < 4) ? one(n) : rPadovan(n - 3) + rPadovan(n - 2)\\n\\n\\\"\\\"\\\" Floor function calculation Padovan \\\"\\\"\\\"\\nfunction fPadovan(n)::Int\\n p, s = big\\\"1.324717957244746025960908854\\\", big\\\"1.0453567932525329623\\\"\\n return Int(floor(p^(n-2) / s + .5))\\nend\\n\\n\\\"\\\"\\\" LSystem Padovan \\\"\\\"\\\"\\nfunction list_LsysPadovan(N)\\n rules = Dict(\\\"A\\\" => \\\"B\\\", \\\"B\\\" => \\\"C\\\", \\\"C\\\" => \\\"AB\\\")\\n seq, lens = [\\\"A\\\"], [1]\\n for i in 1:N\\n str = prod([rules[string(c)] for c in seq[end]])\\n push!(seq, str)\\n push!(lens, length(str))\\n end\\n return seq, lens\\nend\\n\\nconst lr, lf = [rPadovan(i) for i in 1:64], [fPadovan(i) for i in 1:64]\\nconst sL, lL = list_LsysPadovan(32)\\nprintln(\\\"N Recursive Floor LSystem String\\\\n=============================================\\\")\\nforeach(i -> println(rpad(i, 4), rpad(lr[i], 12), rpad(lf[i], 12),\\n rpad(i < 33 ? lL[i] : \\\"\\\", 12), (i < 11 ? sL[i] : \\\"\\\")), 1:64)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.math.floor\\nimport kotlin.math.pow\\n\\nobject CodeKt{\\n\\n private val recurrences = mutableListOf<Int>()\\n private val floors = mutableListOf<Int>()\\n private const val PP = 1.324717957244746025960908854\\n private const val SS = 1.0453567932525329623\\n\\n @JvmStatic\\n fun main(args: Array<String>) {\\n for (i in 0 until 64) {\\n recurrences.add(padovanRecurrence(i))\\n floors.add(padovanFloor(i))\\n }\\n\\n println(\\\"The first 20 terms of the Padovan sequence:\\\")\\n recurrences.subList(0, 20).forEach { term -> print(\\\"$term \\\") }\\n println(\\\"\\\\n\\\")\\n\\n println(\\\"Recurrence and floor functions agree for first 64 terms? ${recurrences == floors}\\\\n\\\")\\n\\n val words = createLSystem()\\n\\n println(\\\"The first 10 terms of the L-system:\\\")\\n words.subList(0, 10).forEach { term -> print(\\\"$term \\\") }\\n println(\\\"\\\\n\\\")\\n\\n print(\\\"Length of first 32 terms produced from the L-system match Padovan sequence? \\\")\\n val wordLengths = words.map { it.length }\\n println(wordLengths == recurrences.subList(0, 32))\\n }\\n\\n private fun padovanRecurrence(n: Int): Int =\\n if (n <= 2) 1 else recurrences[n - 2] + recurrences[n - 3]\\n\\n private fun padovanFloor(n: Int): Int =\\n floor(PP.pow(n - 1) / SS + 0.5).toInt()\\n\\n private fun createLSystem(): List<String> {\\n val words = mutableListOf<String>()\\n var text = \\\"A\\\"\\n\\n while (words.size < 32) {\\n words.add(text)\\n text = text.map { ch ->\\n when (ch) {\\n 'A' -> \\\"B\\\"\\n 'B' -> \\\"C\\\"\\n 'C' -> \\\"AB\\\"\\n else -> throw AssertionError(\\\"Unexpected character found: $ch\\\")\\n }\\n }.joinToString(\\\"\\\")\\n }\\n\\n return words\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"-- Define the constants\\nlocal p = 1.32471795724474602596\\nlocal s = 1.0453567932525329623\\n\\n\\n-- Generator for the Padovan sequence using coroutines\\nfunction pad_recur_gen(n)\\n local co = coroutine.create(function ()\\n local p = {1, 1, 1, 2}\\n for i = 1, n do\\n local next_val = p[2] + p[3]\\n coroutine.yield(p[1])\\n table.remove(p, 1)\\n table.insert(p, next_val)\\n end\\n end)\\n return function () -- iterator\\n local status, value = coroutine.resume(co)\\n return value\\n end\\nend\\n\\n-- Padovan floor function\\nfunction pad_floor(index)\\n if index < 3 then\\n return math.floor(1/2 + p)\\n else\\n return math.floor(1/2 + p^(index - 2) / s)\\n end\\nend\\n\\nlocal l, m, n = 10, 20, 32\\n\\nlocal pr = {}\\nlocal pad_recur = pad_recur_gen(n)\\nfor i = 1, n do\\n pr[i] = pad_recur()\\nend\\nfor i = 1, m do\\n io.write(pr[i] .. ' ')\\nend\\nio.write('\\\\n')\\n\\nlocal pf = {}\\nfor i = 1, n do\\n pf[i] = pad_floor(i)\\nend\\nfor i = 1, m do\\n io.write(pf[i] .. ' ')\\nend\\nio.write('\\\\n')\\n\\nlocal L = {'A'}\\nlocal rules = { A = 'B', B = 'C', C = 'AB' }\\nfor i = 1, n do\\n local next_str = ''\\n for char in L[#L]:gmatch('.') do\\n next_str = next_str .. rules[char]\\n end\\n table.insert(L, next_str)\\nend\\nfor i = 1, l do\\n io.write(L[i] .. ' ')\\nend\\nio.write('\\\\n')\\n\\nfor i = 1, n do\\n assert(pr[i] == pf[i] and pr[i] == #L[i],\\n \\\"Uh oh, n=\\\" .. i .. \\\": \\\" .. pr[i] .. \\\" vs \\\" .. pf[i] .. \\\" vs \\\" .. #L[i])\\nend\\n\\nprint('100% agreement among all 3 methods.')\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"ClearAll[Padovan1,a,p,s]\\np=N[Surd[((9+Sqrt[69])/18),3]+Surd[((9-Sqrt[69])/18),3],200];\\ns=1.0453567932525329623;\\nPadovan1[nmax_Integer]:=RecurrenceTable[{a[n+1]==a[n-1]+a[n-2],a[0]==1,a[1]==1,a[2]==1},a,{n,0,nmax-1}]\\nPadovan2[nmax_Integer]:=With[{},Floor[p^Range[-1,nmax-2]/s+1/2]]\\nPadovan1[20]\\nPadovan2[20]\\nPadovan1[64]===Padovan2[64]\\nSubstitutionSystem[{\\\"A\\\"->\\\"B\\\",\\\"B\\\"->\\\"C\\\",\\\"C\\\"->\\\"AB\\\"},\\\"A\\\",10]//Column\\n(StringLength/@SubstitutionSystem[{\\\"A\\\"->\\\"B\\\",\\\"B\\\"->\\\"C\\\",\\\"C\\\"->\\\"AB\\\"},\\\"A\\\",31])==Padovan2[32]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"clear all;close all;clc;\\n% Calculate the sequences\\npadovan_sequence_20 = Padovan1(20)\\npadovan_approx_20 = Padovan2(20)\\n\\n% Check if the sequences are equal for n = 64\\nare_sequences_equal = isequal(Padovan1(64), Padovan2(64))\\n\\n\\n% Generate the substitution system sequence\\nsequence_32 = createLSystem();\\nwords = sequence_32(1:10)\\n\\n% Check if the length of the substitution system sequence equals the Padovan sequence\\nare_lengths_equal = all( cellfun(@(ele) length(ele), sequence_32) ...\\n == Padovan2(32) )\\n\\nfunction words = createLSystem()\\n words = {'A'}; % Initialize cell array with one element \\\"A\\\"\\n text = 'A'; % Current text is \\\"A\\\"\\n\\n while length(words) < 32\\n newText = ''; % Initialize new text as empty\\n for i = 1:length(text)\\n switch text(i)\\n case 'A'\\n newText = [newText 'B']; % Append 'B' to new text\\n case 'B'\\n newText = [newText 'C']; % Append 'C' to new text\\n case 'C'\\n newText = [newText 'AB']; % Append 'AB' to new text\\n end\\n end\\n text = newText; % Update text with the new text\\n words{end+1} = text; % Append new text to words list\\n end\\nend\\n\\nfunction padovan_sequence = Padovan1(nmax)\\n padovan_sequence = zeros(1, nmax);\\n padovan_sequence(1:3) = [1, 1, 1];\\n for n = 4:nmax\\n padovan_sequence(n) = padovan_sequence(n-2) + padovan_sequence(n-3);\\n end\\nend\\n\\nfunction padovan_approx = Padovan2(nmax)\\n p = 1.324717957244746025960908854;\\n s = 1.0453567932525329623;\\n padovan_approx = floor(p.^(-1:nmax-2) / s + 0.5);\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"import sequtils, strutils, tables\\n\\nconst\\n P = 1.324717957244746025960908854\\n S = 1.0453567932525329623\\n\\n Rules = {'A': \\\"B\\\", 'B': \\\"C\\\", 'C': \\\"AB\\\"}.toTable\\n\\n\\niterator padovan1(n: Natural): int {.closure.} =\\n ## Yield the first \\\"n\\\" Padovan values using recurrence relation.\\n for _ in 1..min(n, 3): yield 1\\n var a, b, c = 1\\n var count = 3\\n while count < n:\\n (a, b, c) = (b, c, a + b)\\n yield c\\n inc count\\n\\n\\niterator padovan2(n: Natural): int {.closure.} =\\n ## Yield the first \\\"n\\\" Padovan values using formula.\\n if n > 1: yield 1\\n var p = 1.0\\n var count = 1\\n while count < n:\\n yield (p / S).toInt\\n p *= P\\n inc count\\n\\n\\niterator padovan3(n: Natural): string {.closure.} =\\n ## Yield the strings produced by the L-system.\\n var s = \\\"A\\\"\\n var count = 0\\n while count < n:\\n yield s\\n var next: string\\n for ch in s:\\n next.add Rules[ch]\\n s = move(next)\\n inc count\\n\\n\\necho \\\"First 20 terms of the Padovan sequence:\\\"\\necho toSeq(padovan1(20)).join(\\\" \\\")\\n\\nlet list1 = toSeq(padovan1(64))\\nlet list2 = toSeq(padovan2(64))\\necho \\\"The first 64 iterative and calculated values \\\",\\n if list1 == list2: \\\"are the same.\\\" else: \\\"differ.\\\"\\n\\necho \\\"\\\"\\necho \\\"First 10 L-system strings:\\\"\\necho toSeq(padovan3(10)).join(\\\" \\\")\\necho \\\"\\\"\\necho \\\"Lengths of the 32 first L-system strings:\\\"\\nlet list3 = toSeq(padovan3(32)).mapIt(it.len)\\necho list3.join(\\\" \\\")\\necho \\\"These lengths are\\\",\\n if list3 == list1[0..31]: \\\" \\\" else: \\\" not \\\",\\n \\\"the 32 first terms of the Padovan sequence.\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature <state say>;\\nuse List::Lazy 'lazy_list';\\n\\nmy $p = 1.32471795724474602596;\\nmy $s = 1.0453567932525329623;\\nmy %rules = (A => 'B', B => 'C', C => 'AB');\\n\\nmy $pad_recur = lazy_list { state @p = (1, 1, 1, 2); push @p, $p[1]+$p[2]; shift @p };\\n\\nsub pad_floor { int 1/2 + $p**($_<3 ? 1 : $_-2) / $s }\\n\\nmy($l, $m, $n) = (10, 20, 32);\\n\\nmy(@pr, @pf);\\npush @pr, $pad_recur->next() for 1 .. $n; say join ' ', @pr[0 .. $m-1];\\npush @pf, pad_floor($_) for 1 .. $n; say join ' ', @pf[0 .. $m-1];\\n\\nmy @L = 'A';\\npush @L, join '', @rules{split '', $L[-1]} for 1 .. $n;\\nsay join ' ', @L[0 .. $l-1];\\n\\n$pr[$_] == $pf[$_] and $pr[$_] == length $L[$_] or die \\\"Uh oh, n=$_: $pr[$_] vs $pf[$_] vs \\\" . length $L[$_] for 0 .. $n-1;\\nsay '100% agreement among all 3 methods.';\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">padovan</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">padovanr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">padovan</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">padovan</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">padovan</span><span style=\\\"color: #0000FF;\\\">[$-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">padovan</span><span style=\\\"color: #0000FF;\\\">[$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">padovan</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.324717957244746025960908854</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.0453567932525329623</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">padovana</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">0.5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"B\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"C\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"AB\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">padovanl</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">prev</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #000000;\\\">64</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"A\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l10</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">64</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">padovanr</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">padovana</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">crash</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"oops\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">l10</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">padovanl</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The first 20 terms of the Padovan sequence: %v\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">padovan</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"The first 10 L-system strings: %v\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">l10</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"recursive, algorithmic, and l-system agree to n=64\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from math import floor\\nfrom collections import deque\\nfrom typing import Dict, Generator\\n\\n\\ndef padovan_r() -> Generator[int, None, None]:\\n last = deque([1, 1, 1], 4)\\n while True:\\n last.append(last[-2] + last[-3])\\n yield last.popleft()\\n\\n_p, _s = 1.324717957244746025960908854, 1.0453567932525329623\\n\\ndef padovan_f(n: int) -> int:\\n return floor(_p**(n-1) / _s + .5)\\n\\ndef padovan_l(start: str='A',\\n rules: Dict[str, str]=dict(A='B', B='C', C='AB')\\n ) -> Generator[str, None, None]:\\n axiom = start\\n while True:\\n yield axiom\\n axiom = ''.join(rules[ch] for ch in axiom)\\n\\n\\nif __name__ == \\\"__main__\\\":\\n from itertools import islice\\n\\n print(\\\"The first twenty terms of the sequence.\\\")\\n print(str([padovan_f(n) for n in range(20)])[1:-1])\\n\\n r_generator = padovan_r()\\n if all(next(r_generator) == padovan_f(n) for n in range(64)):\\n print(\\\"\\\\nThe recurrence and floor based algorithms match to n=63 .\\\")\\n else:\\n print(\\\"\\\\nThe recurrence and floor based algorithms DIFFER!\\\")\\n\\n print(\\\"\\\\nThe first 10 L-system string-lengths and strings\\\")\\n l_generator = padovan_l(start='A', rules=dict(A='B', B='C', C='AB'))\\n print('\\\\n'.join(f\\\" {len(string):3} {repr(string)}\\\"\\n for string in islice(l_generator, 10)))\\n\\n r_generator = padovan_r()\\n l_generator = padovan_l(start='A', rules=dict(A='B', B='C', C='AB'))\\n if all(len(next(l_generator)) == padovan_f(n) == next(r_generator)\\n for n in range(32)):\\n print(\\\"\\\\nThe L-system, recurrence and floor based algorithms match to n=31 .\\\")\\n else:\\n print(\\\"\\\\nThe L-system, recurrence and floor based algorithms DIFFER!\\\")\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"'''Padovan series'''\\n\\nfrom itertools import chain, islice\\nfrom math import floor\\nfrom operator import eq\\n\\n\\n# padovans :: [Int]\\ndef padovans():\\n '''Non-finite series of Padovan numbers,\\n defined in terms of recurrence relations.\\n '''\\n def recurrence(abc):\\n a, b, c = abc\\n return a, (b, c, a + b)\\n\\n return unfoldr(recurrence)(\\n (1, 1, 1)\\n )\\n\\n\\n# padovanFloor :: [Int]\\ndef padovanFloor():\\n '''The Padovan series, defined in terms\\n of a floor function.\\n '''\\n p = 1.324717957244746025960908854\\n s = 1.0453567932525329623\\n\\n def f(n):\\n return floor(p ** (n - 1) / s + 0.5), 1 + n\\n\\n return unfoldr(f)(0)\\n\\n\\n# padovanLSystem : [Int]\\ndef padovanLSystem():\\n '''An L-system generating terms whose lengths\\n are the values of the Padovan integer series.\\n '''\\n def rule(c):\\n return 'B' if 'A' == c else (\\n 'C' if 'B' == c else 'AB'\\n )\\n\\n def f(s):\\n return s, ''.join(list(concatMap(rule)(s)))\\n\\n return unfoldr(f)('A')\\n\\n\\n# ------------------------- TEST -------------------------\\n\\n# prefixesMatch :: [a] -> [a] -> Bool\\ndef prefixesMatch(xs, ys, n):\\n '''True if the first n items of each\\n series are the same.\\n '''\\n return all(map(eq, take(n)(xs), ys))\\n\\n\\n# main :: IO ()\\ndef main():\\n '''Test three Padovan functions for\\n equivalence and expected results.\\n '''\\n print('\\\\n'.join([\\n \\\"First 20 padovans:\\\\n\\\",\\n repr(take(20)(padovans())),\\n\\n \\\"\\\\nThe recurrence and floor-based functions\\\" + (\\n \\\" match over 64 terms:\\\\n\\\"\\n ),\\n repr(prefixesMatch(\\n padovans(),\\n padovanFloor(),\\n 64\\n )),\\n\\n \\\"\\\\nFirst 10 L-System strings:\\\\n\\\",\\n repr(take(10)(padovanLSystem())),\\n\\n \\\"\\\\nThe lengths of the first 32 L-System strings\\\",\\n \\\"match the Padovan sequence:\\\\n\\\",\\n repr(prefixesMatch(\\n padovans(),\\n (len(x) for x in padovanLSystem()),\\n 32\\n ))\\n ]))\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# concatMap :: (a -> [b]) -> [a] -> [b]\\ndef concatMap(f):\\n '''A concatenated map'''\\n def go(xs):\\n return chain.from_iterable(map(f, xs))\\n return go\\n\\n\\n# unfoldr :: (b -> Maybe (a, b)) -> b -> [a]\\ndef unfoldr(f):\\n '''A lazy (generator) list unfolded from a seed value\\n by repeated application of f until no residue remains.\\n Dual to fold/reduce.\\n f returns either None, or just (value, residue).\\n For a strict output list, wrap the result with list()\\n '''\\n def go(x):\\n valueResidue = f(x)\\n while None is not valueResidue:\\n yield valueResidue[0]\\n valueResidue = f(valueResidue[1])\\n return go\\n\\n\\n# take :: Int -> [a] -> [a]\\n# take :: Int -> String -> String\\ndef take(n):\\n '''The prefix of xs of length n,\\n or xs itself if n > length xs.\\n '''\\n def go(xs):\\n return (\\n xs[0:n]\\n if isinstance(xs, (list, tuple))\\n else list(islice(xs, n))\\n )\\n return go\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"( --------------------- Recurrence -------------------- )\\n\\n [ dup 0 = iff\\n [ drop ' [ ] ] done\\n dup 1 = iff\\n [ drop ' [ 1 ] ] done\\n dip [ [] 0 1 1 ]\\n 2 - times\\n [ dip [ 2dup + ] swap\\n 3 pack dip join\\n unpack ]\\n 3 times join behead drop ] is padovan1 ( n --> [ )\\n\\n say \\\"With recurrence: \\\" 20 padovan1 echo cr cr\\n\\n\\n( ------------------- Floor Function ------------------ )\\n\\n $ \\\"bigrat.qky\\\" loadfile\\n\\n [ [ $ \\\"1.324717957244746025960908854\\\"\\n $->v drop join ] constant\\n do ] is p ( --> n/d )\\n\\n [ [ $ \\\"1.0453567932525329623\\\"\\n $->v drop join ] constant\\n do ] is s ( --> n/d )\\n\\n [ 1 -\\n p rot v** s v/ 1 2 v+ / ] is padovan2 ( n --> n )\\n\\n say \\\"With floor function: \\\"\\n []\\n 20 times [ i^ padovan2 join ]\\n echo cr cr\\n\\n\\n( ---------------------- L-System --------------------- )\\n\\n [ $ \\\"\\\" swap witheach\\n [ nested quackery join ] ] is expand ( $ --> $ )\\n\\n [ $ \\\"B\\\" ] is A ( $ --> $ )\\n\\n [ $ \\\"C\\\" ] is B ( $ --> $ )\\n\\n [ $ \\\"AB\\\" ] is C ( $ --> $ )\\n\\n $ \\\"A\\\"\\n\\n say \\\"First 10 L System strings: \\\"\\n 9 times\\n [ dup echo$ sp\\n expand ]\\n echo$ cr cr\\n\\n [] $ \\\"A\\\"\\n 31 times\\n [ dup size\\n swap dip join\\n expand ]\\n size join\\n\\n 32 padovan1 = iff\\n [ say \\\"The first 32 recurrence terms and L System lengths are the same.\\\" ]\\n else [ say \\\"Oh no! It's all gone pear-shaped!\\\" ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"# Function to calculate Padovan sequence iteratively\\npadovan_sequence <- function(n) {\\n recurrences <- numeric(n)\\n recurrences[1:3] <- c(1, 1, 1)\\n if (n > 3) {\\n for (i in 4:n) {\\n recurrences[i] <- recurrences[i-2] + recurrences[i-3]\\n }\\n }\\n recurrences\\n}\\n\\n# Function to calculate Padovan floor\\npadovan_floor <- function(aN) {\\n PP <- 1.324717957244746025960908854\\n SS <- 1.0453567932525329623\\n floor((PP^(aN - 1)) / SS + 0.5)\\n}\\n\\n# Function to create L-system\\ncreate_l_system<- function() {\\n words <- c(\\\"A\\\")\\n text <- \\\"A\\\"\\n\\n while (length(words) < 32) {\\n text <- strsplit(text, \\\"\\\")[[1]] # Split the string into a list of characters\\n text <- sapply(text, function(char) {\\n if (char == \\\"A\\\") {\\n return(\\\"B\\\")\\n } else if (char == \\\"B\\\") {\\n return(\\\"C\\\")\\n } else if (char == \\\"C\\\") {\\n return(\\\"AB\\\")\\n }\\n })\\n text <- paste(text, collapse = \\\"\\\") # Collapse the list back into a single string\\n words <- c(words, text) # Append the new word to the list\\n }\\n\\n words\\n}\\n\\n\\n# Main script\\nnum_terms <- 64\\npadovan_seq <- padovan_sequence(num_terms)\\nfloors <- sapply(0:(num_terms-1), padovan_floor)\\n\\ncat(\\\"The first 20 terms of the Padovan sequence:\\\\n\\\")\\ncat(padovan_seq[1:20], sep=\\\" \\\", end=\\\"\\\\n\\\")\\ncat(\\\"\\\\n\\\")\\n\\ncat(\\\"Recurrence and floor functions agree for first 64 terms?\\\", all(padovan_seq == floors), \\\"\\\\n\\\\n\\\")\\n\\nwords <- create_l_system()\\n\\ncat(\\\"The first 10 terms of the L-system:\\\\n\\\")\\ncat(words[1:10], sep=\\\" \\\", end=\\\"\\\\n\\\")\\ncat(\\\"\\\\n\\\")\\n\\ncat(\\\"Length of first 32 terms produced from the L-system match Padovan sequence? \\\")\\nword_lengths <- sapply(words, nchar)\\ncat(all(word_lengths[1:32] == padovan_seq[1:32]))\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"constant p = 1.32471795724474602596;\\nconstant s = 1.0453567932525329623;\\nconstant %rules = A => 'B', B => 'C', C => 'AB';\\n\\nmy @pad-recur = 1, 1, 1, -> $c, $b, $ { $b + $c } … *;\\n\\nmy @pad-floor = { floor 1/2 + p ** ($++ - 1) / s } … *;\\n\\nmy @pad-L-sys = 'A', { %rules{$^axiom.comb}.join } … *;\\nmy @pad-L-len = @pad-L-sys.map: *.chars;\\n\\nsay @pad-recur.head(20);\\nsay @pad-L-sys.head(10);\\n\\nsay \\\"Recurrence == Floor to N=64\\\" if (@pad-recur Z== @pad-floor).head(64).all;\\nsay \\\"Recurrence == L-len to N=32\\\" if (@pad-recur Z== @pad-L-len).head(32).all;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm computes the Padovan seq. (using 2 methods), and also computes the L─strings.*/\\nnumeric digits 40 /*better precision for Plastic ratio. */\\nparse arg n nF Ln cL . /*obtain optional arguments from the CL*/\\nif n=='' | n==\\\",\\\" then n= 20 /*Not specified? Then use the default.*/\\nif nF=='' | nF==\\\",\\\" then nF= 64 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif Ln=='' | Ln==\\\",\\\" then Ln= 10 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif cL=='' | cL==\\\",\\\" then cL= 32 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nPR= 1.324717957244746025960908854 /*the plastic ratio (constant). */\\n s= 1.0453567932525329623 /*tge \\\"s\\\" constant. */\\n @.= .; @.0= 1; @.1= 1; @.2= 1 /*initialize 3 terms of the Padovan seq*/\\n !.= .; !.0= 1; !.1= 1; !.2= 1 /* \\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall req1; call req2; call req3; call req4 /*invoke the four task's requirements. */\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nfloor: procedure; parse arg x; t= trunc(x); return t - (x<0) * (x\\\\=t)\\npF: procedure expose !. PR s; parse arg x; !.x= floor(PR**(x-1)/s + .5); return !.x\\nth: parse arg th; return th||word('th st nd rd',1+(th//10)*(th//100%10\\\\==1)*(th//10<4))\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nL_sys: procedure: arg x; q=; a.A= 'B'; a.B= 'C'; a.C= 'AB'; if x=='' then return 'A'\\n do k=1 for length(x); _= substr(x, k, 1); q= q || a._\\n end /*k*/; return q\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\np: procedure expose @.; parse arg x; if @.x\\\\==. then return @.x /*@.X defined?*/\\n xm2= x - 2; xm3= x - 3; @.x= @.xm2 + @.xm3; return @.x\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nreq1: say 'The first ' n \\\" terms of the Pandovan sequence:\\\";\\n $= @.0; do j=1 for n-1; $= $ p(j)\\n end /*j*/\\n say $; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nreq2: ok= 1; what= ' terms match for recurrence and floor─based functions.'\\n do j=0 for nF; if p(j)==pF(j) then iterate\\n say 'the ' th(j) \\\" terms don't match:\\\" p(j) pF(j); ok= 0\\n end /*j*/\\n say\\n if ok then say 'all ' nF what; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nreq3: y=; $= 'A'\\n do j=1 for Ln-1; y= L_sys(y); $= $ L_sys(y)\\n end /*j*/\\n say\\n say 'L_sys:' $; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nreq4: y=; what=' terms match for Padovan terms and lengths of L_sys terms.'\\n ok= 1; do j=1 for cL; y= L_sys(y); L= length(y)\\n if L==p(j-1) then iterate\\n say 'the ' th(j) \\\" Padovan term doesn't match the length of the\\\",\\n 'L_sys term:' p(j-1) L; ok= 0\\n end /*j*/\\n say\\n if ok then say 'all ' cL what; return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"padovan = Enumerator.new do |y|\\n ar = [1, 1, 1]\\n loop do\\n ar << ar.first(2).sum\\n y << ar.shift\\n end\\nend\\n\\nP, S = 1.324717957244746025960908854, 1.0453567932525329623\\ndef padovan_f(n) = (P**(n-1) / S + 0.5).floor\\n\\nputs \\\"Recurrence Padovan: #{padovan.take(20)}\\\"\\nputs \\\"Floor function: #{(0...20).map{|n| padovan_f(n)}}\\\"\\n\\nn = 63\\nbool = (0...n).map{|n| padovan_f(n)} == padovan.take(n)\\nputs \\\"Recurrence and floor function are equal upto #{n}: #{bool}.\\\"\\nputs\\n\\ndef l_system(axiom = \\\"A\\\", rules = {\\\"A\\\" => \\\"B\\\", \\\"B\\\" => \\\"C\\\", \\\"C\\\" => \\\"AB\\\"} )\\n return enum_for(__method__, axiom, rules) unless block_given?\\n loop do\\n yield axiom\\n axiom = axiom.chars.map{|c| rules[c] }.join\\n end\\nend\\n\\nputs \\\"First 10 elements of L-system: #{l_system.take(10).join(\\\", \\\")} \\\"\\nn = 32\\nbool = l_system.take(n).map(&:size) == padovan.take(n)\\nputs \\\"Sizes of first #{n} l_system strings equal to recurrence padovan? #{bool}.\\\"\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn padovan_recur() -> impl std::iter::Iterator<Item = usize> {\\n let mut p = vec![1, 1, 1];\\n let mut n = 0;\\n std::iter::from_fn(move || {\\n let pn = if n < 3 { p[n] } else { p[0] + p[1] };\\n p[0] = p[1];\\n p[1] = p[2];\\n p[2] = pn;\\n n += 1;\\n Some(pn)\\n })\\n}\\n\\nfn padovan_floor() -> impl std::iter::Iterator<Item = usize> {\\n const P: f64 = 1.324717957244746025960908854;\\n const S: f64 = 1.0453567932525329623;\\n (0..).map(|x| (P.powf((x - 1) as f64) / S + 0.5).floor() as usize)\\n}\\n\\nfn padovan_lsystem() -> impl std::iter::Iterator<Item = String> {\\n let mut str = String::from(\\\"A\\\");\\n std::iter::from_fn(move || {\\n let result = str.clone();\\n let mut next = String::new();\\n for ch in str.chars() {\\n match ch {\\n 'A' => next.push('B'),\\n 'B' => next.push('C'),\\n _ => next.push_str(\\\"AB\\\"),\\n }\\n }\\n str = next;\\n Some(result)\\n })\\n}\\n\\nfn main() {\\n println!(\\\"First 20 terms of the Padovan sequence:\\\");\\n for p in padovan_recur().take(20) {\\n print!(\\\"{} \\\", p);\\n }\\n println!();\\n\\n println!(\\n \\\"\\\\nRecurrence and floor functions agree for first 64 terms? {}\\\",\\n padovan_recur().take(64).eq(padovan_floor().take(64))\\n );\\n\\n println!(\\\"\\\\nFirst 10 strings produced from the L-system:\\\");\\n for p in padovan_lsystem().take(10) {\\n print!(\\\"{} \\\", p);\\n }\\n println!();\\n\\n println!(\\n \\\"\\\\nLength of first 32 strings produced from the L-system = Padovan sequence? {}\\\",\\n padovan_lsystem()\\n .map(|x| x.len())\\n .take(32)\\n .eq(padovan_recur().take(32))\\n );\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Padovan extends App {\\n\\n val recurrences = new collection.mutable.ListBuffer[Int]()\\n val floors = new collection.mutable.ListBuffer[Int]()\\n val PP = 1.324717957244746025960908854\\n val SS = 1.0453567932525329623\\n\\n for (i <- 0 until 64) {\\n recurrences += padovanRecurrence(i)\\n floors += padovanFloor(i)\\n }\\n\\n println(\\\"The first 20 terms of the Padovan sequence:\\\")\\n recurrences.slice(0, 20).foreach(term => print(s\\\"${term} \\\"))\\n println(\\\"\\\\n\\\")\\n\\n println(s\\\"Recurrence and floor functions agree for first 64 terms? ${recurrences == floors}\\\")\\n println(\\\"\\\")\\n\\n val words = createLSystem()\\n\\n println(\\\"The first 10 terms of the L-system:\\\")\\n words.slice(0, 10).foreach(term => print(term + \\\" \\\"))\\n println(\\\"\\\\n\\\")\\n\\n print(\\\"Length of first 32 terms produced from the L-system match Padovan sequence? \\\")\\n val wordLengths = words.map(_.length)\\n print(wordLengths.slice(0, 32) == recurrences.slice(0, 32))\\n\\n def padovanRecurrence(n: Int): Int = {\\n if (n <= 2) 1 else recurrences(n - 2) + recurrences(n - 3)\\n }\\n\\n def padovanFloor(aN: Int): Int = {\\n scala.math.floor(scala.math.pow(PP, aN - 1) / SS + 0.5).toInt\\n }\\n\\n def createLSystem(): List[String] = {\\n var words = List(\\\"A\\\")\\n var text = \\\"A\\\"\\n\\n while (words.length < 32) {\\n text = text.flatMap {\\n case 'A' => \\\"B\\\"\\n case 'B' => \\\"C\\\"\\n case 'C' => \\\"AB\\\"\\n }\\n words = words :+ text\\n }\\n\\n words\\n }\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import Foundation\\n\\nclass PadovanRecurrence: Sequence, IteratorProtocol {\\n private var p = [1, 1, 1]\\n private var n = 0\\n\\n func next() -> Int? {\\n let pn = n < 3 ? p[n] : p[0] + p[1]\\n p[0] = p[1]\\n p[1] = p[2]\\n p[2] = pn\\n n += 1\\n return pn\\n }\\n}\\n\\nclass PadovanFloor: Sequence, IteratorProtocol {\\n private let P = 1.324717957244746025960908854\\n private let S = 1.0453567932525329623\\n private var n = 0\\n\\n func next() -> Int? {\\n let p = Int(floor(pow(P, Double(n - 1)) / S + 0.5))\\n n += 1\\n return p\\n }\\n}\\n\\nclass PadovanLSystem: Sequence, IteratorProtocol {\\n private var str = \\\"A\\\"\\n\\n func next() -> String? {\\n let result = str\\n var next = \\\"\\\"\\n for ch in str {\\n switch (ch) {\\n case \\\"A\\\": next.append(\\\"B\\\")\\n case \\\"B\\\": next.append(\\\"C\\\")\\n default: next.append(\\\"AB\\\")\\n }\\n }\\n str = next\\n return result\\n }\\n}\\n\\nprint(\\\"First 20 terms of the Padovan sequence:\\\")\\nfor p in PadovanRecurrence().prefix(20) {\\n print(\\\"\\\\(p)\\\", terminator: \\\" \\\")\\n}\\nprint()\\n\\nvar b = PadovanRecurrence().prefix(64)\\n .elementsEqual(PadovanFloor().prefix(64))\\nprint(\\\"\\\\nRecurrence and floor functions agree for first 64 terms? \\\\(b)\\\")\\n\\nprint(\\\"\\\\nFirst 10 strings produced from the L-system:\\\");\\nfor p in PadovanLSystem().prefix(10) {\\n print(p, terminator: \\\" \\\")\\n}\\nprint()\\n\\nb = PadovanLSystem().prefix(32).map{$0.count}\\n .elementsEqual(PadovanRecurrence().prefix(32))\\nprint(\\\"\\\\nLength of first 32 strings produced from the L-system = Padovan sequence? \\\\(b)\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\n# Create a coroutine for generating Padovan sequence using lazy evaluation\\nproc pad_recur {{n 1}} {\\n set p1 1\\n set p2 1\\n set p3 1\\n set p4 1\\n for {set i 1} {$i <= $n} {incr i} {\\n set next [expr {$p2 + $p3}]\\n yield $p1\\n set p1 $p2\\n set p2 $p3\\n set p3 $p4\\n set p4 $next\\n }\\n}\\n\\nproc pad_floor {n} {\\n set p 1.32471795724474602596\\n set s 1.0453567932525329623\\n if {$n < 3} {\\n return 1 ;# The first three elements should be 1, so return 1 for n < 3\\n } else {\\n return [expr {int(0.5 + pow($p, double($n)-2) / $s)}]\\n }\\n}\\n\\n# Main variables\\nset l 10\\nset m 20\\nset n 32\\n\\n# Generating Padovan sequence using recursive coroutine\\nset pr [list]\\nset pad_recur_coro [coroutine pad_recur_co pad_recur $n]\\nfor {set i 1} {$i <= $n} {incr i} {\\n lappend pr [pad_recur_co]\\n}\\nputs [join [lrange $pr 0 [expr {$m - 1}]] \\\" \\\"]\\n\\n# Generating Padovan sequence using floor function\\nset pf [list]\\nfor {set i 1} {$i <= $n} {incr i} {\\n lappend pf [pad_floor $i]\\n}\\nputs [join [lrange $pf 0 [expr {$m - 1}]] \\\" \\\"]\\n\\n# Generating L-system sequence\\nset L [list \\\"A\\\"]\\nset rules [dict create A B B C C AB]\\nfor {set i 1} {$i <= $n} {incr i} {\\n set last [lindex $L end]\\n set expansion \\\"\\\"\\n foreach char [split $last \\\"\\\"] {\\n append expansion [dict get $rules $char]\\n }\\n lappend L $expansion\\n}\\nputs [join [lrange $L 0 [expr {$l - 1}]] \\\" \\\"]\\n\\n# Comparison of all three methods, adjusting for zero-indexing\\nfor {set i 0} {$i < $m} {incr i} {\\n set pr_val [lindex $pr $i]\\n set pf_val [lindex $pf $i]\\n set L_len [string length [lindex $L $i]]\\n if { $pr_val != $pf_val || $pr_val != $L_len } {\\n error \\\"Uh oh, n=$i: $pr_val vs $pf_val vs $L_len\\\"\\n }\\n}\\n\\nputs \\\"100% agreement among all 3 methods.\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigRat\\nimport \\\"./dynamic\\\" for Struct\\n\\nvar padovanRecur = Fn.new { |n|\\n var p = List.filled(n, 1)\\n if (n < 3) return p\\n for (i in 3...n) p[i] = p[i-2] + p[i-3]\\n return p\\n}\\n\\nvar padovanFloor = Fn.new { |n|\\n var p = BigRat.fromDecimal(\\\"1.324717957244746025960908854\\\")\\n var s = BigRat.fromDecimal(\\\"1.0453567932525329623\\\")\\n var f = List.filled(n, 0)\\n var pow = BigRat.one\\n f[0] = (pow/p/s + 0.5).floor.toInt\\n for (i in 1...n) {\\n f[i] = (pow/s + 0.5).floor.toInt\\n pow = pow * p\\n }\\n return f\\n}\\n\\nvar LSystem = Struct.create(\\\"LSystem\\\", [\\\"rules\\\", \\\"init\\\", \\\"current\\\"])\\n\\nvar step = Fn.new { |lsys|\\n var s = \\\"\\\"\\n if (lsys.current == \\\"\\\") {\\n lsys.current = lsys.init\\n } else {\\n for (c in lsys.current) s = s + lsys.rules[c]\\n lsys.current = s\\n }\\n return lsys.current\\n}\\n\\nvar padovanLSys = Fn.new { |n|\\n var rules = {\\\"A\\\": \\\"B\\\", \\\"B\\\": \\\"C\\\", \\\"C\\\": \\\"AB\\\"}\\n var lsys = LSystem.new(rules, \\\"A\\\", \\\"\\\")\\n var p = List.filled(n, null)\\n for (i in 0...n) p[i] = step.call(lsys)\\n return p\\n}\\n\\nSystem.print(\\\"First 20 members of the Padovan sequence:\\\")\\nSystem.print(padovanRecur.call(20))\\n\\nvar recur = padovanRecur.call(64)\\nvar floor = padovanFloor.call(64)\\nvar areSame = (0...64).all { |i| recur[i] == floor[i] }\\nvar s = areSame ? \\\"give\\\" : \\\"do not give\\\"\\nSystem.print(\\\"\\\\nThe recurrence and floor based functions %(s) the same results for 64 terms.\\\")\\n\\nvar p = padovanLSys.call(32)\\nvar lsyst = p.map { |e| e.count }.toList\\nSystem.print(\\\"\\\\nFirst 10 members of the Padovan L-System:\\\")\\nSystem.print(p.take(10).toList)\\nSystem.print(\\\"\\\\nand their lengths:\\\")\\nSystem.print(lsyst.take(10).toList)\\n\\nrecur = recur.take(32).toList\\nareSame = (0...32).all { |i| recur[i] == lsyst[i] }\\ns = areSame ? \\\"give\\\" : \\\"do not give\\\"\\nSystem.print(\\\"\\\\nThe recurrence and L-system based functions %(s) the same results for 32 terms.\\\")\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Padovan-sequence"}}},{"rowIdx":1476,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Palindrome_dates\n","language":"00-META"},{"code":"Today ('''2020-02-02''', at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the '''yyyy-mm-dd''' format but, unusually, also for countries which use the '''dd-mm-yyyy''' format.\n\n\n;Task\nWrite a program which calculates and shows the next 15 palindromic dates for those countries which express their dates in the '''yyyy-mm-dd''' format.\n<br><br>\n\n","language":"00-TASK"},{"code":"V date = Time(2020, 2, 3)\nprint(‘First 15 palindrome dates after 2020-02-02 are:’)\nV count = 0\nL count < 15\n V date_formatted = date.format(‘YYYYMMDD’)\n I date_formatted == reversed(date_formatted)\n print(‘date = ’date.format(‘YYYY-MM-DD’))\n count++\n date += TimeDelta(days' 1)\n","language":"11l"},{"code":"TYPE Date=[\n INT year\n BYTE month\n BYTE day]\n\nBYTE FUNC IsLeapYear(INT y)\n IF y MOD 100=0 THEN\n IF y MOD 400=0 THEN\n RETURN (1)\n ELSE\n RETURN (0)\n FI\n FI\n\n IF y MOD 4=0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nBYTE FUNC GetMaxDay(INT y BYTE m)\n BYTE ARRAY MaxDay=[31 28 31 30 31 30 31 31 30 31 30 31]\n\n IF m=2 AND IsLeapYear(y)=1 THEN\n RETURN (29)\n FI\nRETURN (MaxDay(m-1))\n\nPROC NextDay(Date POINTER d)\n BYTE maxD\n\n d.day==+1\n maxD=GetMaxDay(d.year,d.month)\n IF d.day>maxD THEN\n d.day=1\n d.month==+1\n IF d.month>12 THEN\n d.month=1\n d.year==+1\n FI\n FI\nRETURN\n\nBYTE FUNC IsPalindrome(Date POINTER d)\n INT y\n\n y=d.year\n IF y/1000#d.day MOD 10 THEN\n RETURN (0)\n FI\n y==MOD 1000\n IF y/100#d.day/10 THEN\n RETURN (0)\n FI\n y==MOD 100\n IF y/10#d.month MOD 10 THEN\n RETURN (0)\n FI\n y==MOD 10\n IF y#d.month/10 THEN\n RETURN (0)\n FI\nRETURN (1)\n\nPROC PrintB2(BYTE x)\n IF x<10 THEN\n Put('0)\n FI\n PrintB(x)\nRETURN\n\nPROC PrintDateShort(Date POINTER d)\n PrintI(d.year) Put('-)\n PrintB2(d.month) Put('-)\n PrintB2(d.day)\nRETURN\n\nPROC Main()\n BYTE count\n Date d\n\n count=0\n d.year=2020 d.month=2 d.day=3\n WHILE count<15\n DO\n IF IsPalindrome(d) THEN\n PrintDateShort(d) PutE()\n count==+1\n FI\n NextDay(d)\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO;\nwith Ada.Calendar.Formatting;\nwith Ada.Calendar.Arithmetic;\n\nprocedure Palindrome_Dates is\n Desired_Count : constant := 15;\n Start_Date : constant String := \"2020-01-01 00:00:00\";\n\n use Ada.Calendar;\n\n function Is_Palindrome_Date (Date : Time) return Boolean is\n Image : String renames Formatting.Image (Date);\n begin\n return\n Image (1) = Image (10) and\n Image (2) = Image (9) and\n Image (3) = Image (7) and\n Image (4) = Image (6);\n end Is_Palindrome_Date;\n\n Date : Ada.Calendar.Time := Formatting.Value (Start_Date);\n Count : Natural := 0;\n\n use type Ada.Calendar.Arithmetic.Day_Count;\nbegin\n loop\n if Is_Palindrome_Date (Date) then\n Ada.Text_IO.Put_Line (Formatting.Image (Date) (1 .. 10));\n Count := Count + 1;\n end if;\n exit when Count = Desired_Count;\n Date := Date + 1;\n end loop;\nend Palindrome_Dates;\n","language":"Ada"},{"code":"BEGIN # print future palindromic dates #\n # a palindromic date must be of the form demn-nm-ed #\n # returns a string representation of n with at least 2 digits #\n PROC two digits = ( INT n )STRING:\n BEGIN\n STRING result := whole( ABS n, 0 );\n IF ( UPB result - LWB result ) + 1 < 2 THEN \"0\" +=: result FI;\n IF n < 0 THEN \"-\" +=: result FI;\n result\n END # two digits # ;\n # possible years for a palindromic date #\n []INT mn = ( 1, 10, 11, 20, 21, 30, 40, 50, 60, 70, 80, 90 );\n # months corresponding to the year for for a palindromic date #\n []INT nm = ( 10, 1, 11, 2, 12, 3, 4, 5, 6, 7, 8, 9 );\n # possible centuaries for a palindromic date #\n []INT de = ( 10, 11, 12, 13, 20, 21, 22, 30, 31, 32, 40, 41, 42, 50\n , 51, 52, 60, 61, 62, 70, 71, 72, 80, 81, 82, 90, 91, 92\n );\n # days corresponding to the centuary for a palindromic date #\n []INT ed = ( 1, 11, 21, 31, 2, 12, 22, 3, 13, 23, 4, 14, 24, 5\n , 15, 25, 6, 16, 26, 7, 17, 27, 8, 18, 28, 9, 19, 29\n );\n # max days per month ( february handled specifically in code ) #\n []INT max dd = ( 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 );\n # current date in local time (Algol 68G extension) #\n []INT date = local time;\n INT yy now = local time[ 1 ] MOD 100;\n INT cc now = local time[ 1 ] OVER 100;\n INT dates to print := 15; # maximum number of dates to print #\n FOR c pos FROM LWB de TO UPB de WHILE dates to print > 0 DO\n INT cc = de[ c pos ];\n INT dd = ed[ c pos ];\n FOR y pos FROM LWB nm TO UPB nm WHILE dates to print > 0 DO\n INT mm = nm[ y pos ];\n INT yy = mn[ y pos ];\n IF cc > cc now OR ( cc = cc now AND yy > yy now ) THEN\n # have a possible future date #\n IF dd <= max dd[ mm ]\n OR ( mm = 2 AND dd = 29 AND yy MOD 4 = 0 )\n THEN\n # have a valid future date #\n # no need to test yy = 0 as dd = 0 is impossible #\n dates to print -:= 1;\n print( ( two digits( cc )\n , two digits( yy )\n , \"-\"\n , two digits( mm )\n , \"-\"\n , two digits( dd )\n , newline\n )\n )\n FI\n FI\n OD\n OD\nEND\n","language":"ALGOL-68"},{"code":"on palindromeDates(startYear, targetNumber)\n script o\n property output : {}\n end script\n\n set counter to 0\n set y to startYear\n repeat until ((counter = targetNumber) or (y > 9999))\n -- Derive a month number from the last two digits of the current year number. It's valid if it's in the range 1 to 12.\n set m to y mod 10 * 10 + y mod 100 div 10\n if ((m > 0) and (m < 13)) then\n -- Derive a day number from the first two digits of the year number.\n set d to y div 100 mod 10 * 10 + y div 1000\n -- It's valid if it's between 1 and 28. Otherwise, if it's between 29 and 31, check that it fits the month and year.\n -- In fact though, it'll only ever be 2 or 12 in the period containing the 15 palindromic dates after 2020.\n if ((d > 0) and ¬\n ((d < 29) ¬\n or ((d < 31) and ((m is not 2) or ((d is 29) and (y mod 4 is 0) and ((y mod 100 > 0) or (y mod 400 is 0))))) ¬\n or ((d is 31) and (m is not in {2, 4, 9, 6, 11})))) then\n -- If the figures represent a valid date, add a yyyy-mm-dd format text to the end of the output list.\n tell ((100000000 + y * 10000 + m * 100 + d) as text) to ¬\n set end of o's output to text 2 thru 5 & (\"-\" & text 6 thru 7) & (\"-\" & text 8 thru 9)\n set counter to counter + 1\n end if\n end if\n set y to y + 1\n end repeat\n\n return o's output\nend palindromeDates\n\npalindromeDates(2021, 15)\n","language":"AppleScript"},{"code":"use AppleScript version \"2.4\"\nuse framework \"Foundation\"\nuse scripting additions\n\n\n-- palinYearsInRange :: Int -> Int -> [String]\non palinYearsInRange(fromYear, toYear)\n\n concatMap(palinDay(iso8601Formatter()), ¬\n enumFromTo(fromYear, toYear))\n\nend palinYearsInRange\n\n\n-- palinDay :: DateFormatter -> Int -> [String]\non palinDay(formatter)\n script\n property fmtr : formatter\n on |λ|(y)\n -- Either an empty list or a list containing a valid\n -- palindromic date for a year in the range [1000 .. 9999]\n if 10000 > y and 999 < y then\n set s to y as string\n set {m, m1, d, d1} to reverse of characters of s\n set mbDate to s & \"-\" & m & m1 & \"-\" & d & d1\n\n if missing value is not ¬\n (fmtr's dateFromString:(mbDate & ¬\n \"T00:00:00+00:00\")) then\n {mbDate}\n else\n {}\n end if\n else\n {}\n end if\n end |λ|\n end script\nend palinDay\n\n\n--------------------------- TEST ---------------------------\non run\n set xs to palinYearsInRange(2021, 9999)\n\n unlines({¬\n \"Count of palindromic dates [2021..9999]: \" & ¬\n ((length of xs) as string), ¬\n \"\", ¬\n \"First 15:\", unlines(items 1 thru 15 of xs), \"\", ¬\n \"Last 15:\", unlines(items -15 thru -1 of xs)})\nend run\n\n\n-------------------- GENERIC FUNCTIONS ---------------------\n\n-- concatMap :: (a -> [b]) -> [a] -> [b]\non concatMap(f, xs)\n set lng to length of xs\n set acc to {}\n tell mReturn(f)\n repeat with i from 1 to lng\n set acc to acc & (|λ|(item i of xs, i, xs))\n end repeat\n end tell\n return acc\nend concatMap\n\n\n-- enumFromTo :: Int -> Int -> [Int]\non enumFromTo(m, n)\n if m ≤ n then\n set lst to {}\n repeat with i from m to n\n set end of lst to i\n end repeat\n lst\n else\n {}\n end if\nend enumFromTo\n\n\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\non mReturn(f)\n -- 2nd class handler function lifted into 1st class script wrapper.\n if script is class of f then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- iso8601Formatter :: () -> NSISO8601DateFormatter\non iso8601Formatter()\n tell current application\n set formatter to its NSISO8601DateFormatter's alloc's init()\n set formatOptions of formatter to ¬\n (its NSISO8601DateFormatWithInternetDateTime as integer)\n return formatter\n end tell\nend iso8601Formatter\n\n\n-- unlines :: [String] -> String\non unlines(xs)\n -- A single string formed by the intercalation\n -- of a list of strings with the newline character.\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, linefeed}\n set str to xs as text\n set my text item delimiters to dlm\n str\nend unlines\n","language":"AppleScript"},{"code":"date := 20200202\ncounter := 0\n\nwhile (counter < 15) {\n date += 1, days\n date := SubStr(date, 1, 8)\n if (date = reverse(date))\n {\n FormatTime, fdate, % date, yyyy-MM-dd\n output .= fdate \"`n\"\n counter++\n }\n}\n\nMsgBox, 262144, , % output\nreturn\n\nreverse(n){\n for i, v in StrSplit(n)\n output := v output\n return output\n}\n","language":"AutoHotkey"},{"code":"# syntax: GAWK -f PALINDROME_DATES.AWK\nBEGIN {\n show = 15\n year_b = 2020\n year_e = 9999\n split(\"31,28,31,30,31,30,31,31,30,31,30,31\",daynum_array,\",\") # days per month in non leap year\n for (y=year_b; y<=year_e; y++) {\n daynum_array[2] = (y % 400 == 0 || (y % 4 == 0 && y % 100)) ? 29 : 28\n for (m=1; m<=12; m++) {\n for (d=1; d<=daynum_array[m]; d++) {\n ymd = sprintf(\"%04d%02d%02d\",y,m,d)\n if (substr(ymd,1,1) == substr(ymd,8,1)) { # speed up\n if (ymd == reverse(ymd)) {\n arr[++n] = ymd\n }\n }\n }\n }\n }\n printf(\"%04d0101-%04d1231=%d years, %d palindromes, showing first and last %d\\n\",year_b,year_e,year_e-year_b+1,n,show)\n printf(\"YYYYMMDD YYYYMMDD\\n\")\n for (i=1; i<=show; i++) {\n printf(\"%s %s\\n\",arr[i],arr[n-show+i])\n }\n exit(0)\n}\nfunction reverse(str, i,rts) {\n for (i=length(str); i>=1; i--) {\n rts = rts substr(str,i,1)\n }\n return(rts)\n}\n","language":"AWK"},{"code":"dateTest = \"\"\nmes = 0 : dia = 0 : anno = 0 : Pal = 0\ntotal = 0\nprint \"Siguientes 15 fechas palindrómicas al 2020-02-02:\"\nfor anno = 2021 to 9999\n\tdateTest = ltrim(string(anno))\n\tfor mes = 1 to 12\n\t\tif mes < 10 then dateTest = dateTest + \"0\"\n\t\tdateTest = dateTest + ltrim(string(mes))\n\t\tfor dia = 1 to 31\n\t\t\tif mes = 2 and dia > 28 then exit for\n\t\t\tif (mes = 4 or mes = 6 or mes = 9 or mes = 11) and dia > 30 then exit for\n\t\t\tif dia < 10 then dateTest = dateTest + \"0\"\n\t\t\tdateTest = dateTest + ltrim(string(dia))\n\t\t\tfor Pal = 1 to 4\n\t\t\t\tif mid(dateTest, Pal, 1) <> mid(dateTest, 9 - Pal, 1) then exit for\n\t\t\tnext Pal\n\t\t\tif Pal = 5 then\n\t\t\t\ttotal += 1\n\t\t\t\tif total <= 15 then print left(dateTest,4);\"-\";mid(dateTest,5,2);\"-\";right(dateTest,2)\n\t\t\tend if\n\t\t\tif total > 15 then exit for : exit for : exit for\n\t\t\tdateTest = left(dateTest, 6)\n\t\tnext dia\n\t\tdateTest = left(dateTest, 4)\n\tnext mes\n\tdateTest = \"\"\nnext anno\nend\n","language":"BASIC256"},{"code":" INSTALL @lib$ + \"DATELIB\"\n DIM B% 8\n TestDate%=FN_today\n REPEAT\n $B%=FN_date$(TestDate%, \"yyyyMMdd\")\n FOR I%=0 TO 3\n IF ?(B% + I%) <> ?(B% + 7 - I%) EXIT FOR\n NEXT\n IF I%=4 PRINT FN_date$(TestDate%, \"yyyy-MM-dd\")\n TestDate%+=1\n UNTIL VPOS=15\n END\n","language":"BBC-BASIC"},{"code":"#include <stdbool.h>\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n\nbool is_palindrome(const char* str) {\n size_t n = strlen(str);\n for (size_t i = 0; i + 1 < n; ++i, --n) {\n if (str[i] != str[n - 1])\n return false;\n }\n return true;\n}\n\nint main() {\n time_t timestamp = time(0);\n const int seconds_per_day = 24*60*60;\n int count = 15;\n char str[32];\n printf(\"Next %d palindrome dates:\\n\", count);\n for (; count > 0; timestamp += seconds_per_day) {\n struct tm* ptr = gmtime(×tamp);\n strftime(str, sizeof(str), \"%Y%m%d\", ptr);\n if (is_palindrome(str)) {\n strftime(str, sizeof(str), \"%F\", ptr);\n printf(\"%s\\n\", str);\n --count;\n }\n }\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n#include <boost/date_time/gregorian/gregorian.hpp>\n\nbool is_palindrome(const std::string& str) {\n for (size_t i = 0, j = str.size(); i + 1 < j; ++i, --j) {\n if (str[i] != str[j - 1])\n return false;\n }\n return true;\n}\n\nint main() {\n using boost::gregorian::date;\n using boost::gregorian::day_clock;\n using boost::gregorian::date_duration;\n\n date today(day_clock::local_day());\n date_duration day(1);\n int count = 15;\n std::cout << \"Next \" << count << \" palindrome dates:\\n\";\n for (; count > 0; today += day) {\n if (is_palindrome(to_iso_string(today))) {\n std::cout << to_iso_extended_string(today) << '\\n';\n --count;\n }\n }\n return 0;\n}\n","language":"C++"},{"code":"#include <algorithm>\n#include <chrono>\n#include <iostream>\n#include <sstream>\n\nbool is_palindrome(const std::chrono::sys_days& date) {\n\tstd::ostringstream stream;\n\tstream << date;\n\tstd::string date_string = stream.str();\n\n\tdate_string.erase(std::remove(date_string.begin(), date_string.end(), '-'), date_string.end());\n\tstd::string original = date_string;\n\tstd::reverse(date_string.begin(), date_string.end());\n\n\treturn date_string == original;\n}\n\nint main() {\n\tstd::chrono::year_month_day date{std::chrono::year{2020}, std::chrono::month{02}, std::chrono::day{02}};\n\tstd::chrono::sys_days current_date = std::chrono::sys_days(date);\n\n\tstd::cout << \"The first 15 palindrome dates after 2020-02-02 are:\" << std::endl;\n\tint32_t count = 0;\n\twhile ( count < 15 ) {\n\t\tcurrent_date += std::chrono::days{1};\n\t\tif ( is_palindrome(current_date) ) {\n\t\t\tstd::cout << current_date << std::endl;\n\t\t\tcount++;\n\t\t}\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\nusing System.Collections.Generic;\n\npublic class Program\n{\n static void Main()\n {\n foreach (var date in PalindromicDates(2021).Take(15)) WriteLine(date.ToString(\"yyyy-MM-dd\"));\n }\n\n public static IEnumerable<DateTime> PalindromicDates(int startYear) {\n for (int y = startYear; ; y++) {\n int m = Reverse(y % 100);\n int d = Reverse(y / 100);\n if (IsValidDate(y, m, d, out var date)) yield return date;\n }\n\n int Reverse(int x) => x % 10 * 10 + x / 10;\n bool IsValidDate(int y, int m, int d, out DateTime date) => DateTime.TryParse($\"{y}-{m}-{d}\", out date);\n }\n}\n","language":"C-sharp"},{"code":"(defn valid-date? [[y m d]]\n (and (<= 1 m 12)\n (<= 1 d 31)))\n\n(defn date-str [[y m d]]\n (format \"%4d-%02d-%02d\" y m d))\n\n(defn yr->date [y]\n (let [[_ m d] (re-find #\"(..)(..)\" (apply str (reverse (str y))))]\n [y (Long. m) (Long. d)]))\n\n(defn palindrome-dates [start-yr n]\n (->> (iterate inc start-yr)\n (map yr->date)\n (filter valid-date?)\n (map date-str)\n (take n)))\n","language":"Clojure"},{"code":"procedure ShowPalindromeDate(Memo: TMemo);\nvar DT: TDateTime;\nvar S,S2: string;\nvar I,Cnt: integer;\nbegin\nCnt:=0;\nDT:=EncodeDate(2020,02,02);\nfor I:=0 to High(integer) do\n\tbegin\n\tS:=FormatDateTime('yyyymmdd',DT);\n\tS2:=ReverseString(S);\n\tif S=S2 then\n\t\tbegin\n\t\tInc(Cnt);\n\t\tMemo.Lines.Add(IntToStr(Cnt)+' '+FormatDateTime('yyyy-mm-dd',DT));\n\t\tif Cnt>15 then break;\n\t\tend;\n\tDT:=DT+1;\n\tend;\nend;\n","language":"Delphi"},{"code":"t = 1580641200\nprint \"First 15 palindrome dates after 2020-02-02 are:\"\nrepeat\n t += 86400\n a$ = timestr t\n a$[] = strchars substr a$ 1 4 & substr a$ 6 2 & substr a$ 9 2\n for i = 1 to 4\n if a$[i] <> a$[9 - i]\n break 1\n .\n .\n if i = 5\n cnt += 1\n print substr a$ 1 10\n .\n until cnt = 15\n.\n","language":"EasyLang"},{"code":"// palindrome_dates.fsx\nopen System\n\nlet is_palindrome_date =\n let date_string (date: DateTime) = date.ToString \"yyyyMMdd\"\n let is_palindrome s =\n let rev_string = Seq.rev >> Seq.map string >> String.concat \"\"\n s = rev_string s\n date_string >> is_palindrome\n\nlet palindrome_dates =\n let rec loop date =\n seq {\n if is_palindrome_date date\n then\n yield date\n yield! loop (date.AddDays 1.0)\n else\n yield! loop (date.AddDays 1.0)\n }\n loop DateTime.Now\n\nlet print_date =\n let iso_string (date: DateTime) = date.ToString \"yyyy-MM-dd\"\n iso_string >> printfn \"%s\"\n\npalindrome_dates\n|> Seq.take 15\n|> Seq.iter print_date\n","language":"F-Sharp"},{"code":"USING: calendar calendar.format io kernel lists lists.lazy\nsequences sets ;\n\n: palindrome-dates ( -- list )\n 2020 2 2 <date> [ 1 days time+ ] lfrom-by\n [ timestamp>ymd ] lmap-lazy\n [ \"-\" without dup reverse = ] lfilter ;\n\n15 palindrome-dates ltake [ print ] leach\n","language":"Factor"},{"code":"USING: calendar calendar.format continuations io kernel lists\nlists.lazy math math.functions math.parser math.ranges sequences ;\n\n: create-palindrome ( n odd? -- m )\n dupd [ 10 /i ] when swap [ over 0 > ]\n [ 10 * [ 10 /mod ] [ + ] bi* ] while nip ;\n\n: palindromes ( -- list )\n 3 lfrom [\n 10 swap ^ dup 10 * [a,b)\n [ [ t create-palindrome ] map ]\n [ [ f create-palindrome ] map ] bi\n [ sequence>list ] bi@ lappend\n ] lmap-lazy lconcat [ 20200202 >= ] lfilter ;\n\n: palindrome-dates ( -- list )\n palindromes [\n number>string 4 cut* 2 cut [ string>number ] tri@\n [ <date> ] [ 4drop f ] recover\n ] lmap-lazy [ f = not ] lfilter ;\n\n\"10,000th palindrome date after 2020-02-02: \" write\n10,000 palindrome-dates lnth timestamp>ymd print\n","language":"Factor"},{"code":"Dim As String dateTest = \"\"\nDim As Integer Pal =0, total = 0\nPrint \"Siguientes 15 fechas palindr¢micas al 2020-02-02:\"\nFor anno As Integer = 2021 To 9999\n dateTest = Ltrim(Str(anno))\n For mes As Integer = 1 To 12\n If mes < 10 Then dateTest = dateTest + \"0\"\n dateTest += Ltrim(Str(mes))\n For dia As Integer = 1 To 31\n If mes = 2 And dia > 28 Then Exit For\n If (mes = 4 Or mes = 6 Or mes = 9 Or mes = 11) And dia > 30 Then Exit For\n If dia < 10 Then dateTest += \"0\"\n dateTest = dateTest + Ltrim(Str(dia))\n For Pal = 1 To 4\n If Mid(dateTest, Pal, 1) <> Mid(dateTest, 9 - Pal, 1) Then Exit For\n Next Pal\n If Pal = 5 Then\n total += 1\n If total <= 15 Then Print Left(dateTest,4);\"-\";Mid(dateTest,5,2);\"-\";Right(dateTest,2)\n End If\n if total > 15 then Exit For : Exit For : Exit For\n dateTest = Left(dateTest, 6)\n Next dia\n dateTest = Left(dateTest, 4)\n Next mes\n dateTest = \"\"\nNext anno\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"time\"\n)\n\nfunc reverse(s string) string {\n chars := []rune(s)\n for i, j := 0, len(chars)-1; i < j; i, j = i+1, j-1 {\n chars[i], chars[j] = chars[j], chars[i]\n }\n return string(chars)\n}\n\nfunc main() {\n const (\n layout = \"20060102\"\n layout2 = \"2006-01-02\"\n )\n fmt.Println(\"The next 15 palindromic dates in yyyymmdd format after 20200202 are:\")\n date := time.Date(2020, 2, 2, 0, 0, 0, 0, time.UTC)\n count := 0\n for count < 15 {\n date = date.AddDate(0, 0, 1)\n s := date.Format(layout)\n r := reverse(s)\n if r == s {\n fmt.Println(date.Format(layout2))\n count++\n }\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"sort\"\n \"time\"\n)\n\nfunc reverse(s string) string {\n chars := []rune(s)\n for i, j := 0, len(chars)-1; i < j; i, j = i+1, j-1 {\n chars[i], chars[j] = chars[j], chars[i]\n }\n return string(chars)\n}\n\nfunc findIndex(sl []string, s string) int {\n return sort.Search(len(sl), func(i int) bool {\n return sl[i] > s\n })\n}\n\nfunc main() {\n const (\n layout = \"20060102\"\n layout2 = \"2006-01-02\"\n )\n palins := []string{}\n for i := 0; i < 10000; i++ {\n y := fmt.Sprintf(\"%04d\", i)\n r := reverse(y)\n if r[:2] > \"12\" || r[2:] > \"31\" {\n continue\n }\n d := fmt.Sprintf(\"%s%s\", y, r)\n t, err := time.Parse(layout, d)\n if err == nil {\n palins = append(palins, t.Format(layout2))\n }\n }\n le := len(palins)\n i1 := findIndex(palins, \"1001-01-01\")\n i2 := findIndex(palins, \"2020-02-02\")\n fmt.Printf(\"There are %d palindromic dates after 0000-01-01 of which:\\n\", le)\n fmt.Printf(\" %d are after 1000-01-01\\n\", le-i1)\n fmt.Printf(\" %d are after 2020-02-02\\n\", le-i2)\n fmt.Println(\"\\nThe first 15 after 2020-02-02 are:\")\n for i := 0; i < 15; i++ {\n if i != 0 && i%5 == 0 {\n fmt.Println()\n }\n fmt.Printf(\"%s \", palins[i+i2])\n }\n fmt.Println(\"\\n\\nThe last 15 before 9999-12-31 are:\")\n for i := 15; i >= 1; i-- {\n if i != 15 && i%5 == 0 {\n fmt.Println()\n }\n fmt.Printf(\"%s \", palins[le-i])\n }\n fmt.Println()\n}\n","language":"Go"},{"code":"import Data.List (unfoldr)\nimport Data.List.Split (chunksOf)\nimport Data.Maybe (mapMaybe)\nimport Data.Time.Calendar (Day, fromGregorianValid)\nimport Data.Tuple (swap)\n\n-------------------- PALINDROMIC DATES -------------------\n\npalinDates :: [Day]\npalinDates = mapMaybe palinDay [2021 .. 9999]\n\npalinDay :: Integer -> Maybe Day\npalinDay y = fromGregorianValid y m d\n where\n [m, d] = unDigits <$> chunksOf 2\n (reversedDecimalDigits (fromInteger y))\n\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n let n = length palinDates\n in putStrLn (\"Count of palindromic dates [2021..9999]: \"\n <> show n) >>\n putStrLn \"\\nFirst 15:\" >>\n mapM_ print (take 15 palinDates) >>\n putStrLn \"\\nLast 15:\" >>\n mapM_ print (take 15 (drop (n - 15) palinDates))\n\n\n------------------------- GENERIC ------------------------\n\nreversedDecimalDigits :: Int -> [Int]\nreversedDecimalDigits = unfoldr go\n where\n go n\n | 0 < n = Just $ swap (quotRem n 10)\n | otherwise = Nothing\n\nunDigits :: [Int] -> Int\nunDigits = foldl ((+) . (10 *)) 0\n","language":"Haskell"},{"code":"task=: {{\n r=. ''\n days=. todayno 2020 02 02\n while. 15 > #r do.\n days=. ({:days)+1+i.1e4\n r=. r, days#~(-:|.)\"1\":,.1 todate days\n end.\n 15 10{.isotimestamp todate r\n}}\n","language":"J"},{"code":" task''\n2021-12-02\n2030-03-02\n2040-04-02\n2050-05-02\n2060-06-02\n2070-07-02\n2080-08-02\n2090-09-02\n2101-10-12\n2110-01-12\n2111-11-12\n2120-02-12\n2121-12-12\n2130-03-12\n2140-04-12\n","language":"J"},{"code":"import java.time.LocalDate;\nimport java.time.format.DateTimeFormatter;\n\npublic class PalindromeDates {\n\n public static void main(String[] args) {\n LocalDate date = LocalDate.of(2020, 2, 3);\n DateTimeFormatter formatter = DateTimeFormatter.ofPattern(\"yyyyMMdd\");\n DateTimeFormatter formatterDash = DateTimeFormatter.ofPattern(\"yyyy-MM-dd\");\n System.out.printf(\"First 15 palindrome dates after 2020-02-02 are:%n\");\n for ( int count = 0 ; count < 15 ; date = date.plusDays(1) ) {\n String dateFormatted = date.format(formatter);\n if ( dateFormatted.compareTo(new StringBuilder(dateFormatted).reverse().toString()) == 0 ) {\n count++;\n System.out.printf(\"date = %s%n\", date.format(formatterDash));\n }\n }\n }\n\n}\n","language":"Java"},{"code":"/**\n * Adds zeros for 1 digit days/months\n * @param date: string\n */\nconst addMissingZeros = date => (/^\\d$/.test(date) ? `0${date}` : date);\n\n/**\n * Formats a Date to a string. If readable is false,\n * string is only numbers (used for comparison), else\n * is a human readable date.\n * @param date: Date\n * @param readable: boolean\n */\nconst formatter = (date, readable) => {\n const year = date.getFullYear();\n const month = addMissingZeros(date.getMonth() + 1);\n const day = addMissingZeros(date.getDate());\n\n return readable ? `${year}-${month}-${day}` : `${year}${month}${day}`;\n};\n\n/**\n * Returns n (palindromesToShow) palindrome dates\n * since start (or 2020-02-02)\n * @param start: Date\n * @param palindromesToShow: number\n */\nfunction getPalindromeDates(start, palindromesToShow = 15) {\n let date = start || new Date(2020, 3, 2);\n\n for (\n let i = 0;\n i < palindromesToShow;\n date = new Date(date.setDate(date.getDate() + 1))\n ) {\n const formattedDate = formatter(date);\n if (formattedDate === formattedDate.split(\"\").reverse().join(\"\")) {\n i++;\n console.log(formatter(date, true));\n }\n }\n}\n\ngetPalindromeDates();\n","language":"JavaScript"},{"code":"(() => {\n 'use strict';\n\n // ----------------- PALINDROME DATES ------------------\n\n // palindromeDate :: Int -> [String]\n const palindromeDate = year => {\n // Either an empty list, if no palindromic date\n // can be derived from this year, or a list\n // containing a palindromic IS0 8601 date.\n const\n s = year.toString(),\n r = reverse(s),\n iso = [\n s,\n r.slice(0, 2),\n r.slice(2, 4)\n ].join('-');\n return isNaN(new Date(iso)) ? (\n []\n ) : [iso];\n };\n\n // ----------------------- TEST ------------------------\n const main = () => {\n const\n xs = enumFromTo(2021)(9999).flatMap(\n palindromeDate\n );\n return [\n `Count of palindromic dates [2021..9999]: ${\n xs.length\n }`,\n '',\n `First 15: ${'\\n' + xs.slice(0, 15).join('\\n')}`,\n '',\n `Last 15: ${'\\n' + xs.slice(-15).join('\\n')}`\n ].join('\\n');\n };\n\n // ----------------- GENERIC FUNCTIONS -----------------\n\n // enumFromTo :: Int -> Int -> [Int]\n const enumFromTo = m =>\n n => Array.from({\n length: 1 + n - m\n }, (_, i) => m + i);\n\n // reverse :: [a] -> [a]\n const reverse = xs =>\n 'string' !== typeof xs ? (\n xs.slice(0).reverse()\n ) : xs.split('').reverse().join('');\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"# input and output: [year, month, day] using month=1 for Jan\n# add the number of days to the input date\ndef addDays($days):\n . as [$y,$m,$d]\n | [$y,$m-1,$d + $days,0,0,0,0,0] | mktime | gmtime[0:3] | .[1]+=1;\n\n# input: [year, month, day], an array of integers\n# output: [yyyy, mm, dd] , an array of strings,\ndef yyyymmdd:\n def l($len): tostring | ($len - length) as $l | (\"0\" * $l)[:$l] + .;\n [(.[0]|l(4)), (.[1]|l(2)), (.[2]|l(2))] ;\n\n# input: [year, month, day] using month=1 for Jan\ndef isPalDate:\n yyyymmdd | add | explode | . == reverse;\n\ndef task:\n \"The next 15 palindromic dates in yyyy-mm-dd format after 2020-02-02 are:\",\n ( [2020, 2, 2]\n | addDays(1)\n | limit(15; recurse(addDays(1)) | select(isPalDate) )\n | yyyymmdd\n | join(\"-\") );\n\ntask\n","language":"Jq"},{"code":"using Dates\n\nfunction datepalindromes(nextcount=20)\n println(\"Date palindromes:\")\n count, d = 0, Date(1000, 1, 1)\n for year in 2021:9200\n try\n dig = digits(year)\n month = 10 * dig[1] + dig[2]\n day = 10 * dig[3] + dig[4]\n d = Date(year, month, day)\n catch\n continue\n end\n println(d)\n count += 1\n if count >= nextcount\n break\n end\n end\nend\n\ndatepalindromes()\n","language":"Julia"},{"code":"local year = 2020\nfor i=1, 15 do\n\tlocal dateS\n\trepeat\n\t\tyear = year+1\n\t\tlocal yearS = tostring(year)\n\t\tlocal monthS, dayS = yearS:reverse():match\"^(%d%d)(%d%d)$\"\n\t\tlocal monthN, dayN = tonumber(monthS), tonumber(dayS)\n\t\tdateS = yearS..\"-\"..monthS..\"-\"..dayS\n\tuntil\n\t\tmonthN>0 and monthN<=12 -- real month\n\t\tand dayN<32 -- possible day\n\t\tand os.date( -- real date check\n\t-- be aware that this check is unnecessary because it only affects the 13th century\n\t\t\t\"%Y-%m-%d\"\n\t\t\t,os.time{\n\t\t\t\tyear = year\n\t\t\t\t,month = monthN\n\t\t\t\t,day = dayN\n\t\t\t}\n\t\t) == dateS\n\tprint(dateS)\nend\n","language":"Lua"},{"code":"today = DateList[Today];\nres = {};\ni = 0;\nWhile[Length[res] < 15,\n date = DatePlus[today, i];\n ds = DateString[date, {\"Year\", \"Month\", \"Day\"}];\n If[PalindromeQ[ds],\n AppendTo[res, date]\n ];\n i++;\n ]\nColumn[DateString[#, {\"Year\", \"-\", \"Month\", \"-\", \"Day\"}] & /@ res]\n","language":"Mathematica"},{"code":"import strformat, times\n\nfunc digits(n: int): seq[int] =\n var n = n\n while n != 0:\n result.add n mod 10\n n = n div 10\n\necho \"First 15 palindrome dates after 2020-02-02:\"\nvar count = 0\nvar year = 2021\nwhile count != 15:\n let d = year.digits\n let monthNum = 10 * d[0] + d[1]\n let dayNum = 10 * d[2] + d[3]\n if monthNum in 1..12:\n if dayNum <= getDaysInMonth(Month(monthNum), year):\n # Date is valid.\n echo &\"{year}-{monthNum:02}-{dayNum:02}\"\n inc count\n inc year\n","language":"Nim"},{"code":"use Time::Piece;\nmy $d = Time::Piece->strptime(\"2020-02-02\", \"%Y-%m-%d\");\n\nfor (my $k = 1 ; $k <= 15 ; $d += Time::Piece::ONE_DAY) {\n my $s = $d->strftime(\"%Y%m%d\");\n if ($s eq reverse($s) and ++$k) {\n print $d->strftime(\"%Y-%m-%d\\n\");\n }\n}\n","language":"Perl"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse ntheory qw/forsetproduct/;\n\nmy $start = '2020-02-02' =~ s/-//gr;\nmy($y) = substr($start,0,4);\n\nmy(@dates,$cnt);\nforsetproduct { push @dates, \"@_\" } [$y..$y+999],['01'..'12'],['01'..'31'];\nfor (@dates) {\n (my $date = $_) =~ s/ //g;\n next unless $date > $start and $date eq reverse $date;\n say s/ /-/gr;\n last if 15 == ++$cnt;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">builtins</span><span style=\"color: #0000FF;\">\\</span><span style=\"color: #004080;\">timedate</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2021</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">9999</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%4d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]&</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">td</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">parse_date_string</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"YYYY-MM-DD\"</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">timedate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">td</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Count of palindromic dates [2021..9999]: %d\\n\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"first 15:\\n%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"last 15:\\n%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">15</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"NewList pdates.s()\n\nProcedure.b IsLeap(y.i)\n ProcedureReturn Bool( y % 4 = 0 ) & Bool( y % 100 <> 0 ) | Bool( y % 400 = 0 )\nEndProcedure\n\nIf OpenConsole(\"\")=0 : End 1 : EndIf\n\nFor j=2021 To 9999\n For m=1 To 12\n tm2=28+1*IsLeap(j)\n For t=1 To 31\n If m=2 And t>tm2 : Break : EndIf\n If (m=4 Or m=6 Or m=9 Or m=11) And t>30 : Break : EndIf\n s$=Str(j)+RSet(Str(m),2,\"0\")+RSet(Str(t),2,\"0\")\n If ReverseString(s$)=s$\n AddElement(pdates()) : pdates()=Mid(s$,1,4)+\"-\"+Mid(s$,5,2)+\"-\"+Mid(s$,7,2)\n EndIf\n Next t\n Next m\nNext j\n\nPrintN(\"Count of palindromic dates [2021..9999]: \"+Str(ListSize(pdates())))\nFirstElement(pdates())\nt$=\"First 15:\"\nFor x=1 To 2\n PrintN(~\"\\n\"+t$)\n For y=1 To 15 : PrintN(pdates()) : NextElement(pdates()) : Next\n t$=\"Last 15:\" : SelectElement(pdates(),ListSize(pdates())-15)\nNext\nInput() : End\n","language":"PureBasic"},{"code":"'''Palindrome dates'''\n\nfrom datetime import datetime\nfrom itertools import chain\n\n\n# palinDay :: Int -> [ISO Date]\ndef palinDay(y):\n '''A possibly empty list containing the palindromic\n date for the given year, if such a date exists.\n '''\n s = str(y)\n r = s[::-1]\n iso = '-'.join([s, r[0:2], r[2:]])\n try:\n datetime.strptime(iso, '%Y-%m-%d')\n return [iso]\n except ValueError:\n return []\n\n\n# --------------------------TEST---------------------------\n# main :: IO ()\ndef main():\n '''Count and samples of palindromic dates [2021..9999]\n '''\n palinDates = list(chain.from_iterable(\n map(palinDay, range(2021, 10000))\n ))\n for x in [\n 'Count of palindromic dates [2021..9999]:',\n len(palinDates),\n '\\nFirst 15:',\n '\\n'.join(palinDates[0:15]),\n '\\nLast 15:',\n '\\n'.join(palinDates[-15:])\n ]:\n print(x)\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"'''Palindrome dates'''\n\nfrom functools import reduce\nfrom itertools import chain\nfrom datetime import date\n\n\n# palinDay :: Integer -> [ISO Date]\ndef palinDay(y):\n '''A possibly empty list containing the palindromic\n date for the given year, if such a date exists.\n '''\n [m, d] = [undigits(pair) for pair in chunksOf(2)(\n reversedDecimalDigits(y)\n )]\n return [] if (\n 1 > m or m > 12 or 31 < d\n ) else validISODate((y, m, d))\n\n\n# --------------------------TEST---------------------------\n# main :: IO ()\ndef main():\n '''Count and samples of palindromic dates [2021..9999]\n '''\n palinDates = list(chain.from_iterable(\n map(palinDay, range(2021, 10000))\n ))\n for x in [\n 'Count of palindromic dates [2021..9999]:',\n len(palinDates),\n '\\nFirst 15:',\n '\\n'.join(palinDates[0:15]),\n '\\nLast 15:',\n '\\n'.join(palinDates[-15:])\n ]:\n print(x)\n\n\n# -------------------------GENERIC-------------------------\n\n# Just :: 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 :: 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# chunksOf :: Int -> [a] -> [[a]]\ndef chunksOf(n):\n '''A series of lists of length n, subdividing the\n contents of xs. Where the length of xs is not evenly\n divible, the final list will be shorter than n.\n '''\n return lambda xs: reduce(\n lambda a, i: a + [xs[i:n + i]],\n range(0, len(xs), n), []\n ) if 0 < n else []\n\n\n# reversedDecimalDigits :: Int -> [Int]\ndef reversedDecimalDigits(n):\n '''A list of the decimal digits of n,\n in reversed sequence.\n '''\n return unfoldr(\n lambda x: Nothing() if (\n 0 == x\n ) else Just(divmod(x, 10))\n )(n)\n\n\n# unDigits :: [Int] -> Int\ndef undigits(xs):\n '''An integer derived from a list of decimal digits\n '''\n return reduce(lambda a, x: a * 10 + x, xs, 0)\n\n\n# unfoldr(lambda x: Just((x, x - 1)) if 0 != x else Nothing())(10)\n# -> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\n# unfoldr :: (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 go\n\n\n# validISODate :: (Int, Int, Int) -> [Date]\ndef validISODate(ymd):\n '''A possibly empty list containing the\n ISO8601 string for a date, if that date exists.\n '''\n try:\n return [date(*ymd).isoformat()]\n except ValueError:\n return []\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"'Task\n' Write a program which calculates and shows the next 15 palindromic dates\n' for those countries which express their dates in the yyyy-mm-dd format\n' and for those countries which express their dates int dd-mm-yyyy format\n' the user will choose what format to use for calculating\nDim dateTest As String, Mounth As Integer, Day As Integer, Year As Integer, Pal As Integer, choice As Integer\ndateTest = \"\"\nMounth = 0\nDay = 0\nYear = 0\nPal = 0\nchoice = 0\nPrint \" choose date format:\"\nPrint \" press 1 for using YYYY-MM-DD format\"\nPrint \" press 2 for using DD-MM-YYYY format\"\n\nWhile choice < 1 Or choice > 2\n choice = Val(InKey$)\nWend\nPrint \" Well, you have choosen format number \"; choice\nSleep 2\nFor Year = 2020 To 2420\n dateTest = LTrim$(Str$(Year))\n For Mounth = 1 To 12\n If Mounth < 10 Then k$ = \"0\" Else k$ = \"\"\n\n If choice = 1 Then\n dateTest = dateTest + k$ + LTrim$(Str$(Mounth))\n Else\n dateTest = k$ + LTrim$(Str$(Mounth)) + dateTest\n End If\n\n\n For Day = 1 To 31\n If Mounth = 2 And Day > 28 Then Exit For\n If (Mounth = 4 Or Mounth = 6 Or Mounth = 9 Or Mounth = 11) And Day > 30 Then Exit For\n If Day < 10 Then k$ = \"0\" Else k$ = \"\"\n If choice = 1 Then\n dateTest = dateTest + k$ + LTrim$(Str$(Day))\n Else\n dateTest = k$ + LTrim$(Str$(Day)) + dateTest\n End If\n 'Print dateTest: Sleep\n For Pal = 1 To 4\n If Mid$(dateTest, Pal, 1) <> Mid$(dateTest, 9 - Pal, 1) Then Exit For\n Next\n If Pal = 5 Then Print dateTest\n If choice = 1 Then\n dateTest = Left$(dateTest, 6)\n Else\n dateTest = Right$(dateTest, 6)\n End If\n Next\n If choice = 1 Then\n dateTest = Left$(dateTest, 4)\n Else\n dateTest = Right$(dateTest, 4)\n End If\n Next\n dateTest = \"\"\nNext\n","language":"QB64"},{"code":"dateTest$ = \"\"\ntotal = 0\n\nPRINT \"Siguientes 15 fechas palindr¢micas al 2020-02-02:\"\nFOR anno = 2021 TO 9999\n dateTest$ = LTRIM$(STR$(anno))\n FOR mes = 1 TO 12\n IF mes < 10 THEN dateTest$ = dateTest$ + \"0\"\n dateTest$ = dateTest$ + LTRIM$(STR$(mes))\n FOR dia = 1 TO 31\n IF mes = 2 AND dia > 28 THEN EXIT FOR\n IF (mes = 4 OR mes = 6 OR mes = 9 OR mes = 11) AND dia > 30 THEN EXIT FOR\n IF dia < 10 THEN dateTest$ = dateTest$ + \"0\"\n dateTest$ = dateTest$ + LTRIM$(STR$(dia))\n FOR Pal = 1 TO 4\n IF MID$(dateTest$, Pal, 1) <> MID$(dateTest$, 9 - Pal, 1) THEN EXIT FOR\n NEXT Pal\n IF Pal = 5 THEN\n total = total + 1\n IF total <= 15 THEN PRINT LEFT$(dateTest$, 4); \"-\"; MID$(dateTest$, 5, 2); \"-\"; RIGHT$(dateTest$, 2)\n END IF\n IF total > 15 THEN\n EXIT FOR: EXIT FOR: EXIT FOR\n END IF\n dateTest$ = LEFT$(dateTest$, 6)\n NEXT dia\n dateTest$ = LEFT$(dateTest$, 4)\n NEXT mes\n dateTest$ = \"\"\nNEXT anno\nEND\n","language":"QBasic"},{"code":" [ dup 400 mod 0 = iff\n [ drop true ] done\n dup 100 mod 0 = iff\n [ drop false ] done\n 4 mod 0 = ] is leap ( y --> b )\n\n [ 1 -\n [ table\n 31 [ dup leap 28 + ]\n 31 30 31 30 31 31 30\n 31 30 31 ]\n do nip ] is monthdays ( y m --> n )\n\n [ 1+ dip [ 2dup monthdays ]\n tuck < while\n drop 1+ 1\n over 13 = if\n [ 2drop 1+ 1 1 ] ] is nextday ( y m d --> y m d )\n\n\n [ dip 2dup dup dip unrot ] is 3dup ( a b c --> a b c a b c )\n\n [ swap 100 * +\n swap 10000 * +\n number$ ] is date$ ( y m d --> $ )\n\n [ dup reverse = ] is palindrome ( $ --> b )\n\n [ char - swap 4 stuff\n char - swap 7 stuff ] is +dashes ( $ --> $ )\n\n [] temp put\n 2020 02 02\n [ nextday\n 3dup date$\n dup palindrome iff\n [ temp take\n swap nested join\n temp put ]\n else drop\n temp share\n size 15 = until ]\n drop 2drop\n temp take witheach\n [ +dashes echo$ cr ]\n","language":"Quackery"},{"code":"my $start = '1000-01-01';\n\nmy @palindate = {\n state $year = $start.substr(0,4);\n ++$year;\n my $m = $year.substr(2, 2).flip;\n my $d = $year.substr(0, 2).flip;\n next if not try Date.new(\"$year-$m-$d\");\n \"$year-$m-$d\"\n} … *;\n\nmy $date-today = Date.today; # 2020-02-02\n\nmy $k = @palindate.first: { Date.new($_) > $date-today }, :k;\n\nsay join \"\\n\", @palindate[$k - 1 .. $k + 14];\n\nsay \"\\nTotal number of four digit year palindrome dates:\\n\" ~\nmy $four = @palindate.first( { .substr(5,1) eq '-' }, :k );\nsay \"between {@palindate[0]} and {@palindate[$four - 1]}.\";\n\nmy $five = @palindate.first: { .substr(6,1) eq '-' }, :k;\n\nsay \"\\nTotal number of five digit year palindrome dates:\\n\" ~\n+@palindate[$four .. $five]\n","language":"Raku"},{"code":"/*REXX program finds & displays the next N palindromic dates starting after 2020─02─02*/\n/* ───── */\nparse arg n from . /*obtain optional argumets from the CL*/\nif n=='' | n==\",\" then n= 15 /*Not specified? Then use the default.*/\nif from=='' | from==\",\" then from= '2020-02-02' /* \" \" \" \" \" \" */\n#= 0 /*the count of palindromic dates so far*/\n do j=date('Base', from, \"ISO\")+1 until #==n /*find palindromic dates 'til N found*/\n aDate= date('ISO', j, \"Base\") /*convert a \"base\" date to ISO format. */\n $= space( translate(aDate, , '-'), 0) /*elide the dashes (-) in this date. */\n if $\\==reverse($) then iterate /*Not palindromic? Then skip this date*/\n say 'a palindromic date: ' aDate /*display a palindromic date ──► term. */\n #= # + 1 /*bump the counter of palindromic dates*/\n end /*j*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"load \"stdlib.ring\"\n\ndt\t\t= 0\nnum\t\t= 0\nlimit\t = 15\n\n? \"First 15 palindromic dates:\" + nl\n\nwhile num < limit\n\n\tdt++\n\tdateStr = adddays(date(),dt)\n\tnewDate = substr(dateStr,7,4) + substr(dateStr,4,2) + substr(dateStr,1,2)\n\tnewDate2 = substr(dateStr,7,4) + \"-\" + substr(dateStr,4,2) + \"-\" + substr(dateStr,1,2)\n\tif ispalindrome(newDate)\n num++\n\t\t? newDate2 \t\n\tok\n\tif num > limit\n\t\texit\n\tok\n\nend\n","language":"Ring"},{"code":"require 'date'\n\npalindate = Enumerator.new do |yielder|\n (\"2020\"..).each do |y|\n m, d = y.reverse.scan(/../) # let the Y10K kids handle 5 digit years\n strings = [y, m, d]\n yielder << strings.join(\"-\") if Date.valid_date?( *strings.map( &:to_i ) )\n end\nend\n\nputs palindate.take(15)\n","language":"Ruby"},{"code":"// [dependencies]\n// chrono = \"0.4\"\n\nfn is_palindrome(s: &str) -> bool {\n s.chars().rev().eq(s.chars())\n}\n\nfn main() {\n let mut date = chrono::Utc::today();\n let mut count = 0;\n while count < 15 {\n if is_palindrome(&date.format(\"%Y%m%d\").to_string()) {\n println!(\"{}\", date.format(\"%F\"));\n count += 1;\n }\n date = date.succ();\n }\n}\n","language":"Rust"},{"code":"var palindates = gather {\n for y in (2020 .. 9999) {\n var (m, d) = Str(y).flip.last(4).split(2)...\n with ([y,m,d].join('-')) {|t|\n take(t) if Date.valid(t, \"%Y-%m-%d\")\n }\n }\n}\n\nsay \"Count of palindromic dates [2020..9999]: #{palindates.len}\"\n\nfor a,b in ([\n [\"First 15:\", palindates.head(15)],\n [\"Last 15:\", palindates.tail(15)]\n]) {\n say (\"\\n#{a}\\n\", b.slices(5).map { .join(\" \") }.join(\"\\n\"))\n}\n","language":"Sidef"},{"code":"import Foundation\n\nfunc isPalindrome(_ string: String) -> Bool {\n let chars = string.lazy\n return chars.elementsEqual(chars.reversed())\n}\n\nlet format = DateFormatter()\nformat.dateFormat = \"yyyyMMdd\"\n\nlet outputFormat = DateFormatter()\noutputFormat.dateFormat = \"yyyy-MM-dd\"\n\nvar count = 0\nlet limit = 15\nlet calendar = Calendar.current\nvar date = Date()\n\nwhile count < limit {\n if isPalindrome(format.string(from: date)) {\n print(outputFormat.string(from: date))\n count += 1\n }\n date = calendar.date(byAdding: .day, value: 1, to: date)!\n}\n","language":"Swift"},{"code":"is_palyndrom_date() { date -d \"$1\" 1>/dev/null 2>&1 && echo \"$1\" ; }\n\nfor _H in {2..9}; do\n for _I in {0..9}; do\n for _J in {0..99}; do\n is_palyndrom_date ${_H}${_I}`printf \"%02d%s\" ${_J}`-`printf \"%02d%s\" ${_J} | rev`-`printf \"%02d%s\" ${_H}${_I} | rev`\n done\n done\ndone\n","language":"UNIX-Shell"},{"code":"Sub MainPalindromeDates()\nConst FirstDate As String = \"2020-02-02\"\nConst NumberOfDates As Integer = 15\nDim D As String, temp As String, Cpt As Integer\n temp = Format(DateAdd(\"d\", 1, CDate(FirstDate)), \"yyyy-mm-dd\")\n Do\n D = Replace(temp, \"-\", \"\")\n If IsDatePalindrome(D) Then\n Debug.Print Left(D, 4) & \"-\" & Mid(D, 5, 2) & \"-\" & Right(D, 2)\n Cpt = Cpt + 1\n End If\n temp = Format(DateAdd(\"d\", 1, CDate(temp)), \"yyyy-mm-dd\")\n Loop While Cpt < NumberOfDates\nEnd Sub\nFunction IsDatePalindrome(strDate As String) As Boolean\n IsDatePalindrome = StrReverse(Left(strDate, 4)) = Right(strDate, 4)\nEnd Function\n","language":"VBA"},{"code":"import \"./fmt\" for Fmt\nimport \"./date\" for Date\n\nvar isPalDate = Fn.new { |date|\n date = date.format(Date.rawDate)\n return date == date[-1..0]\n}\n\nDate.default = Date.isoDate\nSystem.print(\"The next 15 palindromic dates in yyyy-mm-dd format after 2020-02-02 are:\")\nvar date = Date.new(2020, 2, 2)\nvar count = 0\nwhile (count < 15) {\n date = date.addDays(1)\n if (isPalDate.call(date)) {\n System.print(date)\n count = count + 1\n }\n}\n","language":"Wren"},{"code":"func Rev(N);\nint N;\n[N:= N/10;\nreturn rem(0)*10 + N;\n];\n\nproc NumOut(N);\nint N;\n[if N < 10 then ChOut(0, ^0);\nIntOut(0, N);\n];\n\nint C, Y, M, D, Q, R;\n[C:= 0;\nfor Y:= 2021 to -1>>1 do\n for M:= 1 to 12 do\n for D:= 1 to 28 do\n [Q:= Y/100;\n R:= rem(0);\n if Q = Rev(D) and R = Rev(M) then\n [IntOut(0, Y); ChOut(0, ^-);\n NumOut(M); ChOut(0, ^-);\n NumOut(D); CrLf(0);\n C:= C+1;\n if C >= 15 then return;\n ];\n ];\n]\n","language":"XPL0"},{"code":"dateTest$ = \"\"\ntotal = 0\nprint \"Siguientes 15 fechas palindr¢micas al 2020-02-02:\"\nfor anno = 2021 to 9999\n dateTest$ = ltrim$(str$(anno))\n for mes = 1 to 12\n if mes < 10 then dateTest$ = dateTest$ + \"0\" : fi\n dateTest$ = dateTest$ + ltrim$(str$(mes))\n for dia = 1 to 31\n if mes = 2 and dia > 28 then break : fi\n if (mes = 4 or mes = 6 or mes = 9 or mes = 11) and dia > 30 then break : fi\n if dia < 10 then dateTest$ = dateTest$ + \"0\" : fi\n dateTest$ = dateTest$ + ltrim$(str$(dia))\n for Pal = 1 to 4\n if mid$(dateTest$, Pal, 1) <> mid$(dateTest$, 9 - Pal, 1) then break : fi\n next Pal\n if Pal = 5 then\n total = total + 1\n if total <= 15 then print left$(dateTest$,4),\"-\",mid$(dateTest$,5,2),\"-\",right$(dateTest$,2) : fi\n end if\n if total > 15 then break : break : break : fi\n dateTest$ = left$(dateTest$, 6)\n next dia\n dateTest$ = left$(dateTest$, 4)\n next mes\n dateTest$ = \"\"\nnext anno\nend\n","language":"Yabasic"},{"code":"TD,date,n := Time.Date, T(2020,02,02), 15;\nwhile(n){\n ds:=TD.toYMDString(date.xplode()) - \"-\";\n if(ds==ds.reverse()){ n-=1; println(TD.toYMDString(date.xplode())); }\n date=TD.addYMD(date,0,0,1);\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Palindrome_dates\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Today ('''2020-02-02''', at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates in the '''yyyy-mm-dd''' format but, unusually, also for countries which use the '''dd-mm-yyyy''' format.\\n\\n\\n;Task\\nWrite a program which calculates and shows the next 15 palindromic dates for those countries which express their dates in the '''yyyy-mm-dd''' format.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V date = Time(2020, 2, 3)\\nprint(‘First 15 palindrome dates after 2020-02-02 are:’)\\nV count = 0\\nL count < 15\\n V date_formatted = date.format(‘YYYYMMDD’)\\n I date_formatted == reversed(date_formatted)\\n print(‘date = ’date.format(‘YYYY-MM-DD’))\\n count++\\n date += TimeDelta(days' 1)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"TYPE Date=[\\n INT year\\n BYTE month\\n BYTE day]\\n\\nBYTE FUNC IsLeapYear(INT y)\\n IF y MOD 100=0 THEN\\n IF y MOD 400=0 THEN\\n RETURN (1)\\n ELSE\\n RETURN (0)\\n FI\\n FI\\n\\n IF y MOD 4=0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nBYTE FUNC GetMaxDay(INT y BYTE m)\\n BYTE ARRAY MaxDay=[31 28 31 30 31 30 31 31 30 31 30 31]\\n\\n IF m=2 AND IsLeapYear(y)=1 THEN\\n RETURN (29)\\n FI\\nRETURN (MaxDay(m-1))\\n\\nPROC NextDay(Date POINTER d)\\n BYTE maxD\\n\\n d.day==+1\\n maxD=GetMaxDay(d.year,d.month)\\n IF d.day>maxD THEN\\n d.day=1\\n d.month==+1\\n IF d.month>12 THEN\\n d.month=1\\n d.year==+1\\n FI\\n FI\\nRETURN\\n\\nBYTE FUNC IsPalindrome(Date POINTER d)\\n INT y\\n\\n y=d.year\\n IF y/1000#d.day MOD 10 THEN\\n RETURN (0)\\n FI\\n y==MOD 1000\\n IF y/100#d.day/10 THEN\\n RETURN (0)\\n FI\\n y==MOD 100\\n IF y/10#d.month MOD 10 THEN\\n RETURN (0)\\n FI\\n y==MOD 10\\n IF y#d.month/10 THEN\\n RETURN (0)\\n FI\\nRETURN (1)\\n\\nPROC PrintB2(BYTE x)\\n IF x<10 THEN\\n Put('0)\\n FI\\n PrintB(x)\\nRETURN\\n\\nPROC PrintDateShort(Date POINTER d)\\n PrintI(d.year) Put('-)\\n PrintB2(d.month) Put('-)\\n PrintB2(d.day)\\nRETURN\\n\\nPROC Main()\\n BYTE count\\n Date d\\n\\n count=0\\n d.year=2020 d.month=2 d.day=3\\n WHILE count<15\\n DO\\n IF IsPalindrome(d) THEN\\n PrintDateShort(d) PutE()\\n count==+1\\n FI\\n NextDay(d)\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Ada.Calendar.Formatting;\\nwith Ada.Calendar.Arithmetic;\\n\\nprocedure Palindrome_Dates is\\n Desired_Count : constant := 15;\\n Start_Date : constant String := \\\"2020-01-01 00:00:00\\\";\\n\\n use Ada.Calendar;\\n\\n function Is_Palindrome_Date (Date : Time) return Boolean is\\n Image : String renames Formatting.Image (Date);\\n begin\\n return\\n Image (1) = Image (10) and\\n Image (2) = Image (9) and\\n Image (3) = Image (7) and\\n Image (4) = Image (6);\\n end Is_Palindrome_Date;\\n\\n Date : Ada.Calendar.Time := Formatting.Value (Start_Date);\\n Count : Natural := 0;\\n\\n use type Ada.Calendar.Arithmetic.Day_Count;\\nbegin\\n loop\\n if Is_Palindrome_Date (Date) then\\n Ada.Text_IO.Put_Line (Formatting.Image (Date) (1 .. 10));\\n Count := Count + 1;\\n end if;\\n exit when Count = Desired_Count;\\n Date := Date + 1;\\n end loop;\\nend Palindrome_Dates;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN # print future palindromic dates #\\n # a palindromic date must be of the form demn-nm-ed #\\n # returns a string representation of n with at least 2 digits #\\n PROC two digits = ( INT n )STRING:\\n BEGIN\\n STRING result := whole( ABS n, 0 );\\n IF ( UPB result - LWB result ) + 1 < 2 THEN \\\"0\\\" +=: result FI;\\n IF n < 0 THEN \\\"-\\\" +=: result FI;\\n result\\n END # two digits # ;\\n # possible years for a palindromic date #\\n []INT mn = ( 1, 10, 11, 20, 21, 30, 40, 50, 60, 70, 80, 90 );\\n # months corresponding to the year for for a palindromic date #\\n []INT nm = ( 10, 1, 11, 2, 12, 3, 4, 5, 6, 7, 8, 9 );\\n # possible centuaries for a palindromic date #\\n []INT de = ( 10, 11, 12, 13, 20, 21, 22, 30, 31, 32, 40, 41, 42, 50\\n , 51, 52, 60, 61, 62, 70, 71, 72, 80, 81, 82, 90, 91, 92\\n );\\n # days corresponding to the centuary for a palindromic date #\\n []INT ed = ( 1, 11, 21, 31, 2, 12, 22, 3, 13, 23, 4, 14, 24, 5\\n , 15, 25, 6, 16, 26, 7, 17, 27, 8, 18, 28, 9, 19, 29\\n );\\n # max days per month ( february handled specifically in code ) #\\n []INT max dd = ( 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 );\\n # current date in local time (Algol 68G extension) #\\n []INT date = local time;\\n INT yy now = local time[ 1 ] MOD 100;\\n INT cc now = local time[ 1 ] OVER 100;\\n INT dates to print := 15; # maximum number of dates to print #\\n FOR c pos FROM LWB de TO UPB de WHILE dates to print > 0 DO\\n INT cc = de[ c pos ];\\n INT dd = ed[ c pos ];\\n FOR y pos FROM LWB nm TO UPB nm WHILE dates to print > 0 DO\\n INT mm = nm[ y pos ];\\n INT yy = mn[ y pos ];\\n IF cc > cc now OR ( cc = cc now AND yy > yy now ) THEN\\n # have a possible future date #\\n IF dd <= max dd[ mm ]\\n OR ( mm = 2 AND dd = 29 AND yy MOD 4 = 0 )\\n THEN\\n # have a valid future date #\\n # no need to test yy = 0 as dd = 0 is impossible #\\n dates to print -:= 1;\\n print( ( two digits( cc )\\n , two digits( yy )\\n , \\\"-\\\"\\n , two digits( mm )\\n , \\\"-\\\"\\n , two digits( dd )\\n , newline\\n )\\n )\\n FI\\n FI\\n OD\\n OD\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"on palindromeDates(startYear, targetNumber)\\n script o\\n property output : {}\\n end script\\n\\n set counter to 0\\n set y to startYear\\n repeat until ((counter = targetNumber) or (y > 9999))\\n -- Derive a month number from the last two digits of the current year number. It's valid if it's in the range 1 to 12.\\n set m to y mod 10 * 10 + y mod 100 div 10\\n if ((m > 0) and (m < 13)) then\\n -- Derive a day number from the first two digits of the year number.\\n set d to y div 100 mod 10 * 10 + y div 1000\\n -- It's valid if it's between 1 and 28. Otherwise, if it's between 29 and 31, check that it fits the month and year.\\n -- In fact though, it'll only ever be 2 or 12 in the period containing the 15 palindromic dates after 2020.\\n if ((d > 0) and ¬\\n ((d < 29) ¬\\n or ((d < 31) and ((m is not 2) or ((d is 29) and (y mod 4 is 0) and ((y mod 100 > 0) or (y mod 400 is 0))))) ¬\\n or ((d is 31) and (m is not in {2, 4, 9, 6, 11})))) then\\n -- If the figures represent a valid date, add a yyyy-mm-dd format text to the end of the output list.\\n tell ((100000000 + y * 10000 + m * 100 + d) as text) to ¬\\n set end of o's output to text 2 thru 5 & (\\\"-\\\" & text 6 thru 7) & (\\\"-\\\" & text 8 thru 9)\\n set counter to counter + 1\\n end if\\n end if\\n set y to y + 1\\n end repeat\\n\\n return o's output\\nend palindromeDates\\n\\npalindromeDates(2021, 15)\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"use AppleScript version \\\"2.4\\\"\\nuse framework \\\"Foundation\\\"\\nuse scripting additions\\n\\n\\n-- palinYearsInRange :: Int -> Int -> [String]\\non palinYearsInRange(fromYear, toYear)\\n\\n concatMap(palinDay(iso8601Formatter()), ¬\\n enumFromTo(fromYear, toYear))\\n\\nend palinYearsInRange\\n\\n\\n-- palinDay :: DateFormatter -> Int -> [String]\\non palinDay(formatter)\\n script\\n property fmtr : formatter\\n on |λ|(y)\\n -- Either an empty list or a list containing a valid\\n -- palindromic date for a year in the range [1000 .. 9999]\\n if 10000 > y and 999 < y then\\n set s to y as string\\n set {m, m1, d, d1} to reverse of characters of s\\n set mbDate to s & \\\"-\\\" & m & m1 & \\\"-\\\" & d & d1\\n\\n if missing value is not ¬\\n (fmtr's dateFromString:(mbDate & ¬\\n \\\"T00:00:00+00:00\\\")) then\\n {mbDate}\\n else\\n {}\\n end if\\n else\\n {}\\n end if\\n end |λ|\\n end script\\nend palinDay\\n\\n\\n--------------------------- TEST ---------------------------\\non run\\n set xs to palinYearsInRange(2021, 9999)\\n\\n unlines({¬\\n \\\"Count of palindromic dates [2021..9999]: \\\" & ¬\\n ((length of xs) as string), ¬\\n \\\"\\\", ¬\\n \\\"First 15:\\\", unlines(items 1 thru 15 of xs), \\\"\\\", ¬\\n \\\"Last 15:\\\", unlines(items -15 thru -1 of xs)})\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS ---------------------\\n\\n-- concatMap :: (a -> [b]) -> [a] -> [b]\\non concatMap(f, xs)\\n set lng to length of xs\\n set acc to {}\\n tell mReturn(f)\\n repeat with i from 1 to lng\\n set acc to acc & (|λ|(item i of xs, i, xs))\\n end repeat\\n end tell\\n return acc\\nend concatMap\\n\\n\\n-- enumFromTo :: Int -> Int -> [Int]\\non enumFromTo(m, n)\\n if m ≤ n then\\n set lst to {}\\n repeat with i from m to n\\n set end of lst to i\\n end repeat\\n lst\\n else\\n {}\\n end if\\nend enumFromTo\\n\\n\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\non mReturn(f)\\n -- 2nd class handler function lifted into 1st class script wrapper.\\n if script is class of f then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- iso8601Formatter :: () -> NSISO8601DateFormatter\\non iso8601Formatter()\\n tell current application\\n set formatter to its NSISO8601DateFormatter's alloc's init()\\n set formatOptions of formatter to ¬\\n (its NSISO8601DateFormatWithInternetDateTime as integer)\\n return formatter\\n end tell\\nend iso8601Formatter\\n\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n -- A single string formed by the intercalation\\n -- of a list of strings with the newline character.\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, linefeed}\\n set str to xs as text\\n set my text item delimiters to dlm\\n str\\nend unlines\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"date := 20200202\\ncounter := 0\\n\\nwhile (counter < 15) {\\n date += 1, days\\n date := SubStr(date, 1, 8)\\n if (date = reverse(date))\\n {\\n FormatTime, fdate, % date, yyyy-MM-dd\\n output .= fdate \\\"`n\\\"\\n counter++\\n }\\n}\\n\\nMsgBox, 262144, , % output\\nreturn\\n\\nreverse(n){\\n for i, v in StrSplit(n)\\n output := v output\\n return output\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"# syntax: GAWK -f PALINDROME_DATES.AWK\\nBEGIN {\\n show = 15\\n year_b = 2020\\n year_e = 9999\\n split(\\\"31,28,31,30,31,30,31,31,30,31,30,31\\\",daynum_array,\\\",\\\") # days per month in non leap year\\n for (y=year_b; y<=year_e; y++) {\\n daynum_array[2] = (y % 400 == 0 || (y % 4 == 0 && y % 100)) ? 29 : 28\\n for (m=1; m<=12; m++) {\\n for (d=1; d<=daynum_array[m]; d++) {\\n ymd = sprintf(\\\"%04d%02d%02d\\\",y,m,d)\\n if (substr(ymd,1,1) == substr(ymd,8,1)) { # speed up\\n if (ymd == reverse(ymd)) {\\n arr[++n] = ymd\\n }\\n }\\n }\\n }\\n }\\n printf(\\\"%04d0101-%04d1231=%d years, %d palindromes, showing first and last %d\\\\n\\\",year_b,year_e,year_e-year_b+1,n,show)\\n printf(\\\"YYYYMMDD YYYYMMDD\\\\n\\\")\\n for (i=1; i<=show; i++) {\\n printf(\\\"%s %s\\\\n\\\",arr[i],arr[n-show+i])\\n }\\n exit(0)\\n}\\nfunction reverse(str, i,rts) {\\n for (i=length(str); i>=1; i--) {\\n rts = rts substr(str,i,1)\\n }\\n return(rts)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"dateTest = \\\"\\\"\\nmes = 0 : dia = 0 : anno = 0 : Pal = 0\\ntotal = 0\\nprint \\\"Siguientes 15 fechas palindrómicas al 2020-02-02:\\\"\\nfor anno = 2021 to 9999\\n\\tdateTest = ltrim(string(anno))\\n\\tfor mes = 1 to 12\\n\\t\\tif mes < 10 then dateTest = dateTest + \\\"0\\\"\\n\\t\\tdateTest = dateTest + ltrim(string(mes))\\n\\t\\tfor dia = 1 to 31\\n\\t\\t\\tif mes = 2 and dia > 28 then exit for\\n\\t\\t\\tif (mes = 4 or mes = 6 or mes = 9 or mes = 11) and dia > 30 then exit for\\n\\t\\t\\tif dia < 10 then dateTest = dateTest + \\\"0\\\"\\n\\t\\t\\tdateTest = dateTest + ltrim(string(dia))\\n\\t\\t\\tfor Pal = 1 to 4\\n\\t\\t\\t\\tif mid(dateTest, Pal, 1) <> mid(dateTest, 9 - Pal, 1) then exit for\\n\\t\\t\\tnext Pal\\n\\t\\t\\tif Pal = 5 then\\n\\t\\t\\t\\ttotal += 1\\n\\t\\t\\t\\tif total <= 15 then print left(dateTest,4);\\\"-\\\";mid(dateTest,5,2);\\\"-\\\";right(dateTest,2)\\n\\t\\t\\tend if\\n\\t\\t\\tif total > 15 then exit for : exit for : exit for\\n\\t\\t\\tdateTest = left(dateTest, 6)\\n\\t\\tnext dia\\n\\t\\tdateTest = left(dateTest, 4)\\n\\tnext mes\\n\\tdateTest = \\\"\\\"\\nnext anno\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \" INSTALL @lib$ + \\\"DATELIB\\\"\\n DIM B% 8\\n TestDate%=FN_today\\n REPEAT\\n $B%=FN_date$(TestDate%, \\\"yyyyMMdd\\\")\\n FOR I%=0 TO 3\\n IF ?(B% + I%) <> ?(B% + 7 - I%) EXIT FOR\\n NEXT\\n IF I%=4 PRINT FN_date$(TestDate%, \\\"yyyy-MM-dd\\\")\\n TestDate%+=1\\n UNTIL VPOS=15\\n END\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdbool.h>\\n#include <stdio.h>\\n#include <string.h>\\n#include <time.h>\\n\\nbool is_palindrome(const char* str) {\\n size_t n = strlen(str);\\n for (size_t i = 0; i + 1 < n; ++i, --n) {\\n if (str[i] != str[n - 1])\\n return false;\\n }\\n return true;\\n}\\n\\nint main() {\\n time_t timestamp = time(0);\\n const int seconds_per_day = 24*60*60;\\n int count = 15;\\n char str[32];\\n printf(\\\"Next %d palindrome dates:\\\\n\\\", count);\\n for (; count > 0; timestamp += seconds_per_day) {\\n struct tm* ptr = gmtime(×tamp);\\n strftime(str, sizeof(str), \\\"%Y%m%d\\\", ptr);\\n if (is_palindrome(str)) {\\n strftime(str, sizeof(str), \\\"%F\\\", ptr);\\n printf(\\\"%s\\\\n\\\", str);\\n --count;\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <boost/date_time/gregorian/gregorian.hpp>\\n\\nbool is_palindrome(const std::string& str) {\\n for (size_t i = 0, j = str.size(); i + 1 < j; ++i, --j) {\\n if (str[i] != str[j - 1])\\n return false;\\n }\\n return true;\\n}\\n\\nint main() {\\n using boost::gregorian::date;\\n using boost::gregorian::day_clock;\\n using boost::gregorian::date_duration;\\n\\n date today(day_clock::local_day());\\n date_duration day(1);\\n int count = 15;\\n std::cout << \\\"Next \\\" << count << \\\" palindrome dates:\\\\n\\\";\\n for (; count > 0; today += day) {\\n if (is_palindrome(to_iso_string(today))) {\\n std::cout << to_iso_extended_string(today) << '\\\\n';\\n --count;\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <chrono>\\n#include <iostream>\\n#include <sstream>\\n\\nbool is_palindrome(const std::chrono::sys_days& date) {\\n\\tstd::ostringstream stream;\\n\\tstream << date;\\n\\tstd::string date_string = stream.str();\\n\\n\\tdate_string.erase(std::remove(date_string.begin(), date_string.end(), '-'), date_string.end());\\n\\tstd::string original = date_string;\\n\\tstd::reverse(date_string.begin(), date_string.end());\\n\\n\\treturn date_string == original;\\n}\\n\\nint main() {\\n\\tstd::chrono::year_month_day date{std::chrono::year{2020}, std::chrono::month{02}, std::chrono::day{02}};\\n\\tstd::chrono::sys_days current_date = std::chrono::sys_days(date);\\n\\n\\tstd::cout << \\\"The first 15 palindrome dates after 2020-02-02 are:\\\" << std::endl;\\n\\tint32_t count = 0;\\n\\twhile ( count < 15 ) {\\n\\t\\tcurrent_date += std::chrono::days{1};\\n\\t\\tif ( is_palindrome(current_date) ) {\\n\\t\\t\\tstd::cout << current_date << std::endl;\\n\\t\\t\\tcount++;\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Collections.Generic;\\n\\npublic class Program\\n{\\n static void Main()\\n {\\n foreach (var date in PalindromicDates(2021).Take(15)) WriteLine(date.ToString(\\\"yyyy-MM-dd\\\"));\\n }\\n\\n public static IEnumerable<DateTime> PalindromicDates(int startYear) {\\n for (int y = startYear; ; y++) {\\n int m = Reverse(y % 100);\\n int d = Reverse(y / 100);\\n if (IsValidDate(y, m, d, out var date)) yield return date;\\n }\\n\\n int Reverse(int x) => x % 10 * 10 + x / 10;\\n bool IsValidDate(int y, int m, int d, out DateTime date) => DateTime.TryParse($\\\"{y}-{m}-{d}\\\", out date);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn valid-date? [[y m d]]\\n (and (<= 1 m 12)\\n (<= 1 d 31)))\\n\\n(defn date-str [[y m d]]\\n (format \\\"%4d-%02d-%02d\\\" y m d))\\n\\n(defn yr->date [y]\\n (let [[_ m d] (re-find #\\\"(..)(..)\\\" (apply str (reverse (str y))))]\\n [y (Long. m) (Long. d)]))\\n\\n(defn palindrome-dates [start-yr n]\\n (->> (iterate inc start-yr)\\n (map yr->date)\\n (filter valid-date?)\\n (map date-str)\\n (take n)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"procedure ShowPalindromeDate(Memo: TMemo);\\nvar DT: TDateTime;\\nvar S,S2: string;\\nvar I,Cnt: integer;\\nbegin\\nCnt:=0;\\nDT:=EncodeDate(2020,02,02);\\nfor I:=0 to High(integer) do\\n\\tbegin\\n\\tS:=FormatDateTime('yyyymmdd',DT);\\n\\tS2:=ReverseString(S);\\n\\tif S=S2 then\\n\\t\\tbegin\\n\\t\\tInc(Cnt);\\n\\t\\tMemo.Lines.Add(IntToStr(Cnt)+' '+FormatDateTime('yyyy-mm-dd',DT));\\n\\t\\tif Cnt>15 then break;\\n\\t\\tend;\\n\\tDT:=DT+1;\\n\\tend;\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"t = 1580641200\\nprint \\\"First 15 palindrome dates after 2020-02-02 are:\\\"\\nrepeat\\n t += 86400\\n a$ = timestr t\\n a$[] = strchars substr a$ 1 4 & substr a$ 6 2 & substr a$ 9 2\\n for i = 1 to 4\\n if a$[i] <> a$[9 - i]\\n break 1\\n .\\n .\\n if i = 5\\n cnt += 1\\n print substr a$ 1 10\\n .\\n until cnt = 15\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"// palindrome_dates.fsx\\nopen System\\n\\nlet is_palindrome_date =\\n let date_string (date: DateTime) = date.ToString \\\"yyyyMMdd\\\"\\n let is_palindrome s =\\n let rev_string = Seq.rev >> Seq.map string >> String.concat \\\"\\\"\\n s = rev_string s\\n date_string >> is_palindrome\\n\\nlet palindrome_dates =\\n let rec loop date =\\n seq {\\n if is_palindrome_date date\\n then\\n yield date\\n yield! loop (date.AddDays 1.0)\\n else\\n yield! loop (date.AddDays 1.0)\\n }\\n loop DateTime.Now\\n\\nlet print_date =\\n let iso_string (date: DateTime) = date.ToString \\\"yyyy-MM-dd\\\"\\n iso_string >> printfn \\\"%s\\\"\\n\\npalindrome_dates\\n|> Seq.take 15\\n|> Seq.iter print_date\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: calendar calendar.format io kernel lists lists.lazy\\nsequences sets ;\\n\\n: palindrome-dates ( -- list )\\n 2020 2 2 <date> [ 1 days time+ ] lfrom-by\\n [ timestamp>ymd ] lmap-lazy\\n [ \\\"-\\\" without dup reverse = ] lfilter ;\\n\\n15 palindrome-dates ltake [ print ] leach\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: calendar calendar.format continuations io kernel lists\\nlists.lazy math math.functions math.parser math.ranges sequences ;\\n\\n: create-palindrome ( n odd? -- m )\\n dupd [ 10 /i ] when swap [ over 0 > ]\\n [ 10 * [ 10 /mod ] [ + ] bi* ] while nip ;\\n\\n: palindromes ( -- list )\\n 3 lfrom [\\n 10 swap ^ dup 10 * [a,b)\\n [ [ t create-palindrome ] map ]\\n [ [ f create-palindrome ] map ] bi\\n [ sequence>list ] bi@ lappend\\n ] lmap-lazy lconcat [ 20200202 >= ] lfilter ;\\n\\n: palindrome-dates ( -- list )\\n palindromes [\\n number>string 4 cut* 2 cut [ string>number ] tri@\\n [ <date> ] [ 4drop f ] recover\\n ] lmap-lazy [ f = not ] lfilter ;\\n\\n\\\"10,000th palindrome date after 2020-02-02: \\\" write\\n10,000 palindrome-dates lnth timestamp>ymd print\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim As String dateTest = \\\"\\\"\\nDim As Integer Pal =0, total = 0\\nPrint \\\"Siguientes 15 fechas palindr¢micas al 2020-02-02:\\\"\\nFor anno As Integer = 2021 To 9999\\n dateTest = Ltrim(Str(anno))\\n For mes As Integer = 1 To 12\\n If mes < 10 Then dateTest = dateTest + \\\"0\\\"\\n dateTest += Ltrim(Str(mes))\\n For dia As Integer = 1 To 31\\n If mes = 2 And dia > 28 Then Exit For\\n If (mes = 4 Or mes = 6 Or mes = 9 Or mes = 11) And dia > 30 Then Exit For\\n If dia < 10 Then dateTest += \\\"0\\\"\\n dateTest = dateTest + Ltrim(Str(dia))\\n For Pal = 1 To 4\\n If Mid(dateTest, Pal, 1) <> Mid(dateTest, 9 - Pal, 1) Then Exit For\\n Next Pal\\n If Pal = 5 Then\\n total += 1\\n If total <= 15 Then Print Left(dateTest,4);\\\"-\\\";Mid(dateTest,5,2);\\\"-\\\";Right(dateTest,2)\\n End If\\n if total > 15 then Exit For : Exit For : Exit For\\n dateTest = Left(dateTest, 6)\\n Next dia\\n dateTest = Left(dateTest, 4)\\n Next mes\\n dateTest = \\\"\\\"\\nNext anno\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"time\\\"\\n)\\n\\nfunc reverse(s string) string {\\n chars := []rune(s)\\n for i, j := 0, len(chars)-1; i < j; i, j = i+1, j-1 {\\n chars[i], chars[j] = chars[j], chars[i]\\n }\\n return string(chars)\\n}\\n\\nfunc main() {\\n const (\\n layout = \\\"20060102\\\"\\n layout2 = \\\"2006-01-02\\\"\\n )\\n fmt.Println(\\\"The next 15 palindromic dates in yyyymmdd format after 20200202 are:\\\")\\n date := time.Date(2020, 2, 2, 0, 0, 0, 0, time.UTC)\\n count := 0\\n for count < 15 {\\n date = date.AddDate(0, 0, 1)\\n s := date.Format(layout)\\n r := reverse(s)\\n if r == s {\\n fmt.Println(date.Format(layout2))\\n count++\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"sort\\\"\\n \\\"time\\\"\\n)\\n\\nfunc reverse(s string) string {\\n chars := []rune(s)\\n for i, j := 0, len(chars)-1; i < j; i, j = i+1, j-1 {\\n chars[i], chars[j] = chars[j], chars[i]\\n }\\n return string(chars)\\n}\\n\\nfunc findIndex(sl []string, s string) int {\\n return sort.Search(len(sl), func(i int) bool {\\n return sl[i] > s\\n })\\n}\\n\\nfunc main() {\\n const (\\n layout = \\\"20060102\\\"\\n layout2 = \\\"2006-01-02\\\"\\n )\\n palins := []string{}\\n for i := 0; i < 10000; i++ {\\n y := fmt.Sprintf(\\\"%04d\\\", i)\\n r := reverse(y)\\n if r[:2] > \\\"12\\\" || r[2:] > \\\"31\\\" {\\n continue\\n }\\n d := fmt.Sprintf(\\\"%s%s\\\", y, r)\\n t, err := time.Parse(layout, d)\\n if err == nil {\\n palins = append(palins, t.Format(layout2))\\n }\\n }\\n le := len(palins)\\n i1 := findIndex(palins, \\\"1001-01-01\\\")\\n i2 := findIndex(palins, \\\"2020-02-02\\\")\\n fmt.Printf(\\\"There are %d palindromic dates after 0000-01-01 of which:\\\\n\\\", le)\\n fmt.Printf(\\\" %d are after 1000-01-01\\\\n\\\", le-i1)\\n fmt.Printf(\\\" %d are after 2020-02-02\\\\n\\\", le-i2)\\n fmt.Println(\\\"\\\\nThe first 15 after 2020-02-02 are:\\\")\\n for i := 0; i < 15; i++ {\\n if i != 0 && i%5 == 0 {\\n fmt.Println()\\n }\\n fmt.Printf(\\\"%s \\\", palins[i+i2])\\n }\\n fmt.Println(\\\"\\\\n\\\\nThe last 15 before 9999-12-31 are:\\\")\\n for i := 15; i >= 1; i-- {\\n if i != 15 && i%5 == 0 {\\n fmt.Println()\\n }\\n fmt.Printf(\\\"%s \\\", palins[le-i])\\n }\\n fmt.Println()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (unfoldr)\\nimport Data.List.Split (chunksOf)\\nimport Data.Maybe (mapMaybe)\\nimport Data.Time.Calendar (Day, fromGregorianValid)\\nimport Data.Tuple (swap)\\n\\n-------------------- PALINDROMIC DATES -------------------\\n\\npalinDates :: [Day]\\npalinDates = mapMaybe palinDay [2021 .. 9999]\\n\\npalinDay :: Integer -> Maybe Day\\npalinDay y = fromGregorianValid y m d\\n where\\n [m, d] = unDigits <$> chunksOf 2\\n (reversedDecimalDigits (fromInteger y))\\n\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n let n = length palinDates\\n in putStrLn (\\\"Count of palindromic dates [2021..9999]: \\\"\\n <> show n) >>\\n putStrLn \\\"\\\\nFirst 15:\\\" >>\\n mapM_ print (take 15 palinDates) >>\\n putStrLn \\\"\\\\nLast 15:\\\" >>\\n mapM_ print (take 15 (drop (n - 15) palinDates))\\n\\n\\n------------------------- GENERIC ------------------------\\n\\nreversedDecimalDigits :: Int -> [Int]\\nreversedDecimalDigits = unfoldr go\\n where\\n go n\\n | 0 < n = Just $ swap (quotRem n 10)\\n | otherwise = Nothing\\n\\nunDigits :: [Int] -> Int\\nunDigits = foldl ((+) . (10 *)) 0\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"task=: {{\\n r=. ''\\n days=. todayno 2020 02 02\\n while. 15 > #r do.\\n days=. ({:days)+1+i.1e4\\n r=. r, days#~(-:|.)\\\"1\\\":,.1 todate days\\n end.\\n 15 10{.isotimestamp todate r\\n}}\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" task''\\n2021-12-02\\n2030-03-02\\n2040-04-02\\n2050-05-02\\n2060-06-02\\n2070-07-02\\n2080-08-02\\n2090-09-02\\n2101-10-12\\n2110-01-12\\n2111-11-12\\n2120-02-12\\n2121-12-12\\n2130-03-12\\n2140-04-12\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.time.LocalDate;\\nimport java.time.format.DateTimeFormatter;\\n\\npublic class PalindromeDates {\\n\\n public static void main(String[] args) {\\n LocalDate date = LocalDate.of(2020, 2, 3);\\n DateTimeFormatter formatter = DateTimeFormatter.ofPattern(\\\"yyyyMMdd\\\");\\n DateTimeFormatter formatterDash = DateTimeFormatter.ofPattern(\\\"yyyy-MM-dd\\\");\\n System.out.printf(\\\"First 15 palindrome dates after 2020-02-02 are:%n\\\");\\n for ( int count = 0 ; count < 15 ; date = date.plusDays(1) ) {\\n String dateFormatted = date.format(formatter);\\n if ( dateFormatted.compareTo(new StringBuilder(dateFormatted).reverse().toString()) == 0 ) {\\n count++;\\n System.out.printf(\\\"date = %s%n\\\", date.format(formatterDash));\\n }\\n }\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"/**\\n * Adds zeros for 1 digit days/months\\n * @param date: string\\n */\\nconst addMissingZeros = date => (/^\\\\d$/.test(date) ? `0${date}` : date);\\n\\n/**\\n * Formats a Date to a string. If readable is false,\\n * string is only numbers (used for comparison), else\\n * is a human readable date.\\n * @param date: Date\\n * @param readable: boolean\\n */\\nconst formatter = (date, readable) => {\\n const year = date.getFullYear();\\n const month = addMissingZeros(date.getMonth() + 1);\\n const day = addMissingZeros(date.getDate());\\n\\n return readable ? `${year}-${month}-${day}` : `${year}${month}${day}`;\\n};\\n\\n/**\\n * Returns n (palindromesToShow) palindrome dates\\n * since start (or 2020-02-02)\\n * @param start: Date\\n * @param palindromesToShow: number\\n */\\nfunction getPalindromeDates(start, palindromesToShow = 15) {\\n let date = start || new Date(2020, 3, 2);\\n\\n for (\\n let i = 0;\\n i < palindromesToShow;\\n date = new Date(date.setDate(date.getDate() + 1))\\n ) {\\n const formattedDate = formatter(date);\\n if (formattedDate === formattedDate.split(\\\"\\\").reverse().join(\\\"\\\")) {\\n i++;\\n console.log(formatter(date, true));\\n }\\n }\\n}\\n\\ngetPalindromeDates();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n 'use strict';\\n\\n // ----------------- PALINDROME DATES ------------------\\n\\n // palindromeDate :: Int -> [String]\\n const palindromeDate = year => {\\n // Either an empty list, if no palindromic date\\n // can be derived from this year, or a list\\n // containing a palindromic IS0 8601 date.\\n const\\n s = year.toString(),\\n r = reverse(s),\\n iso = [\\n s,\\n r.slice(0, 2),\\n r.slice(2, 4)\\n ].join('-');\\n return isNaN(new Date(iso)) ? (\\n []\\n ) : [iso];\\n };\\n\\n // ----------------------- TEST ------------------------\\n const main = () => {\\n const\\n xs = enumFromTo(2021)(9999).flatMap(\\n palindromeDate\\n );\\n return [\\n `Count of palindromic dates [2021..9999]: ${\\n xs.length\\n }`,\\n '',\\n `First 15: ${'\\\\n' + xs.slice(0, 15).join('\\\\n')}`,\\n '',\\n `Last 15: ${'\\\\n' + xs.slice(-15).join('\\\\n')}`\\n ].join('\\\\n');\\n };\\n\\n // ----------------- GENERIC FUNCTIONS -----------------\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n const enumFromTo = m =>\\n n => Array.from({\\n length: 1 + n - m\\n }, (_, i) => m + i);\\n\\n // reverse :: [a] -> [a]\\n const reverse = xs =>\\n 'string' !== typeof xs ? (\\n xs.slice(0).reverse()\\n ) : xs.split('').reverse().join('');\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# input and output: [year, month, day] using month=1 for Jan\\n# add the number of days to the input date\\ndef addDays($days):\\n . as [$y,$m,$d]\\n | [$y,$m-1,$d + $days,0,0,0,0,0] | mktime | gmtime[0:3] | .[1]+=1;\\n\\n# input: [year, month, day], an array of integers\\n# output: [yyyy, mm, dd] , an array of strings,\\ndef yyyymmdd:\\n def l($len): tostring | ($len - length) as $l | (\\\"0\\\" * $l)[:$l] + .;\\n [(.[0]|l(4)), (.[1]|l(2)), (.[2]|l(2))] ;\\n\\n# input: [year, month, day] using month=1 for Jan\\ndef isPalDate:\\n yyyymmdd | add | explode | . == reverse;\\n\\ndef task:\\n \\\"The next 15 palindromic dates in yyyy-mm-dd format after 2020-02-02 are:\\\",\\n ( [2020, 2, 2]\\n | addDays(1)\\n | limit(15; recurse(addDays(1)) | select(isPalDate) )\\n | yyyymmdd\\n | join(\\\"-\\\") );\\n\\ntask\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Dates\\n\\nfunction datepalindromes(nextcount=20)\\n println(\\\"Date palindromes:\\\")\\n count, d = 0, Date(1000, 1, 1)\\n for year in 2021:9200\\n try\\n dig = digits(year)\\n month = 10 * dig[1] + dig[2]\\n day = 10 * dig[3] + dig[4]\\n d = Date(year, month, day)\\n catch\\n continue\\n end\\n println(d)\\n count += 1\\n if count >= nextcount\\n break\\n end\\n end\\nend\\n\\ndatepalindromes()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"local year = 2020\\nfor i=1, 15 do\\n\\tlocal dateS\\n\\trepeat\\n\\t\\tyear = year+1\\n\\t\\tlocal yearS = tostring(year)\\n\\t\\tlocal monthS, dayS = yearS:reverse():match\\\"^(%d%d)(%d%d)$\\\"\\n\\t\\tlocal monthN, dayN = tonumber(monthS), tonumber(dayS)\\n\\t\\tdateS = yearS..\\\"-\\\"..monthS..\\\"-\\\"..dayS\\n\\tuntil\\n\\t\\tmonthN>0 and monthN<=12 -- real month\\n\\t\\tand dayN<32 -- possible day\\n\\t\\tand os.date( -- real date check\\n\\t-- be aware that this check is unnecessary because it only affects the 13th century\\n\\t\\t\\t\\\"%Y-%m-%d\\\"\\n\\t\\t\\t,os.time{\\n\\t\\t\\t\\tyear = year\\n\\t\\t\\t\\t,month = monthN\\n\\t\\t\\t\\t,day = dayN\\n\\t\\t\\t}\\n\\t\\t) == dateS\\n\\tprint(dateS)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"today = DateList[Today];\\nres = {};\\ni = 0;\\nWhile[Length[res] < 15,\\n date = DatePlus[today, i];\\n ds = DateString[date, {\\\"Year\\\", \\\"Month\\\", \\\"Day\\\"}];\\n If[PalindromeQ[ds],\\n AppendTo[res, date]\\n ];\\n i++;\\n ]\\nColumn[DateString[#, {\\\"Year\\\", \\\"-\\\", \\\"Month\\\", \\\"-\\\", \\\"Day\\\"}] & /@ res]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat, times\\n\\nfunc digits(n: int): seq[int] =\\n var n = n\\n while n != 0:\\n result.add n mod 10\\n n = n div 10\\n\\necho \\\"First 15 palindrome dates after 2020-02-02:\\\"\\nvar count = 0\\nvar year = 2021\\nwhile count != 15:\\n let d = year.digits\\n let monthNum = 10 * d[0] + d[1]\\n let dayNum = 10 * d[2] + d[3]\\n if monthNum in 1..12:\\n if dayNum <= getDaysInMonth(Month(monthNum), year):\\n # Date is valid.\\n echo &\\\"{year}-{monthNum:02}-{dayNum:02}\\\"\\n inc count\\n inc year\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use Time::Piece;\\nmy $d = Time::Piece->strptime(\\\"2020-02-02\\\", \\\"%Y-%m-%d\\\");\\n\\nfor (my $k = 1 ; $k <= 15 ; $d += Time::Piece::ONE_DAY) {\\n my $s = $d->strftime(\\\"%Y%m%d\\\");\\n if ($s eq reverse($s) and ++$k) {\\n print $d->strftime(\\\"%Y-%m-%d\\\\n\\\");\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse ntheory qw/forsetproduct/;\\n\\nmy $start = '2020-02-02' =~ s/-//gr;\\nmy($y) = substr($start,0,4);\\n\\nmy(@dates,$cnt);\\nforsetproduct { push @dates, \\\"@_\\\" } [$y..$y+999],['01'..'12'],['01'..'31'];\\nfor (@dates) {\\n (my $date = $_) =~ s/ //g;\\n next unless $date > $start and $date eq reverse $date;\\n say s/ /-/gr;\\n last if 15 == ++$cnt;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">builtins</span><span style=\\\"color: #0000FF;\\\">\\\\</span><span style=\\\"color: #004080;\\\">timedate</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2021</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">9999</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%4d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]&</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">td</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">parse_date_string</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"YYYY-MM-DD\\\"</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">timedate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">td</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Count of palindromic dates [2021..9999]: %d\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"first 15:\\\\n%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"last 15:\\\\n%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">15</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"NewList pdates.s()\\n\\nProcedure.b IsLeap(y.i)\\n ProcedureReturn Bool( y % 4 = 0 ) & Bool( y % 100 <> 0 ) | Bool( y % 400 = 0 )\\nEndProcedure\\n\\nIf OpenConsole(\\\"\\\")=0 : End 1 : EndIf\\n\\nFor j=2021 To 9999\\n For m=1 To 12\\n tm2=28+1*IsLeap(j)\\n For t=1 To 31\\n If m=2 And t>tm2 : Break : EndIf\\n If (m=4 Or m=6 Or m=9 Or m=11) And t>30 : Break : EndIf\\n s$=Str(j)+RSet(Str(m),2,\\\"0\\\")+RSet(Str(t),2,\\\"0\\\")\\n If ReverseString(s$)=s$\\n AddElement(pdates()) : pdates()=Mid(s$,1,4)+\\\"-\\\"+Mid(s$,5,2)+\\\"-\\\"+Mid(s$,7,2)\\n EndIf\\n Next t\\n Next m\\nNext j\\n\\nPrintN(\\\"Count of palindromic dates [2021..9999]: \\\"+Str(ListSize(pdates())))\\nFirstElement(pdates())\\nt$=\\\"First 15:\\\"\\nFor x=1 To 2\\n PrintN(~\\\"\\\\n\\\"+t$)\\n For y=1 To 15 : PrintN(pdates()) : NextElement(pdates()) : Next\\n t$=\\\"Last 15:\\\" : SelectElement(pdates(),ListSize(pdates())-15)\\nNext\\nInput() : End\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"'''Palindrome dates'''\\n\\nfrom datetime import datetime\\nfrom itertools import chain\\n\\n\\n# palinDay :: Int -> [ISO Date]\\ndef palinDay(y):\\n '''A possibly empty list containing the palindromic\\n date for the given year, if such a date exists.\\n '''\\n s = str(y)\\n r = s[::-1]\\n iso = '-'.join([s, r[0:2], r[2:]])\\n try:\\n datetime.strptime(iso, '%Y-%m-%d')\\n return [iso]\\n except ValueError:\\n return []\\n\\n\\n# --------------------------TEST---------------------------\\n# main :: IO ()\\ndef main():\\n '''Count and samples of palindromic dates [2021..9999]\\n '''\\n palinDates = list(chain.from_iterable(\\n map(palinDay, range(2021, 10000))\\n ))\\n for x in [\\n 'Count of palindromic dates [2021..9999]:',\\n len(palinDates),\\n '\\\\nFirst 15:',\\n '\\\\n'.join(palinDates[0:15]),\\n '\\\\nLast 15:',\\n '\\\\n'.join(palinDates[-15:])\\n ]:\\n print(x)\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Palindrome dates'''\\n\\nfrom functools import reduce\\nfrom itertools import chain\\nfrom datetime import date\\n\\n\\n# palinDay :: Integer -> [ISO Date]\\ndef palinDay(y):\\n '''A possibly empty list containing the palindromic\\n date for the given year, if such a date exists.\\n '''\\n [m, d] = [undigits(pair) for pair in chunksOf(2)(\\n reversedDecimalDigits(y)\\n )]\\n return [] if (\\n 1 > m or m > 12 or 31 < d\\n ) else validISODate((y, m, d))\\n\\n\\n# --------------------------TEST---------------------------\\n# main :: IO ()\\ndef main():\\n '''Count and samples of palindromic dates [2021..9999]\\n '''\\n palinDates = list(chain.from_iterable(\\n map(palinDay, range(2021, 10000))\\n ))\\n for x in [\\n 'Count of palindromic dates [2021..9999]:',\\n len(palinDates),\\n '\\\\nFirst 15:',\\n '\\\\n'.join(palinDates[0:15]),\\n '\\\\nLast 15:',\\n '\\\\n'.join(palinDates[-15:])\\n ]:\\n print(x)\\n\\n\\n# -------------------------GENERIC-------------------------\\n\\n# Just :: 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 :: 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# chunksOf :: Int -> [a] -> [[a]]\\ndef chunksOf(n):\\n '''A series of lists of length n, subdividing the\\n contents of xs. Where the length of xs is not evenly\\n divible, the final list will be shorter than n.\\n '''\\n return lambda xs: reduce(\\n lambda a, i: a + [xs[i:n + i]],\\n range(0, len(xs), n), []\\n ) if 0 < n else []\\n\\n\\n# reversedDecimalDigits :: Int -> [Int]\\ndef reversedDecimalDigits(n):\\n '''A list of the decimal digits of n,\\n in reversed sequence.\\n '''\\n return unfoldr(\\n lambda x: Nothing() if (\\n 0 == x\\n ) else Just(divmod(x, 10))\\n )(n)\\n\\n\\n# unDigits :: [Int] -> Int\\ndef undigits(xs):\\n '''An integer derived from a list of decimal digits\\n '''\\n return reduce(lambda a, x: a * 10 + x, xs, 0)\\n\\n\\n# unfoldr(lambda x: Just((x, x - 1)) if 0 != x else Nothing())(10)\\n# -> [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]\\n# unfoldr :: (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 go\\n\\n\\n# validISODate :: (Int, Int, Int) -> [Date]\\ndef validISODate(ymd):\\n '''A possibly empty list containing the\\n ISO8601 string for a date, if that date exists.\\n '''\\n try:\\n return [date(*ymd).isoformat()]\\n except ValueError:\\n return []\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'Task\\n' Write a program which calculates and shows the next 15 palindromic dates\\n' for those countries which express their dates in the yyyy-mm-dd format\\n' and for those countries which express their dates int dd-mm-yyyy format\\n' the user will choose what format to use for calculating\\nDim dateTest As String, Mounth As Integer, Day As Integer, Year As Integer, Pal As Integer, choice As Integer\\ndateTest = \\\"\\\"\\nMounth = 0\\nDay = 0\\nYear = 0\\nPal = 0\\nchoice = 0\\nPrint \\\" choose date format:\\\"\\nPrint \\\" press 1 for using YYYY-MM-DD format\\\"\\nPrint \\\" press 2 for using DD-MM-YYYY format\\\"\\n\\nWhile choice < 1 Or choice > 2\\n choice = Val(InKey$)\\nWend\\nPrint \\\" Well, you have choosen format number \\\"; choice\\nSleep 2\\nFor Year = 2020 To 2420\\n dateTest = LTrim$(Str$(Year))\\n For Mounth = 1 To 12\\n If Mounth < 10 Then k$ = \\\"0\\\" Else k$ = \\\"\\\"\\n\\n If choice = 1 Then\\n dateTest = dateTest + k$ + LTrim$(Str$(Mounth))\\n Else\\n dateTest = k$ + LTrim$(Str$(Mounth)) + dateTest\\n End If\\n\\n\\n For Day = 1 To 31\\n If Mounth = 2 And Day > 28 Then Exit For\\n If (Mounth = 4 Or Mounth = 6 Or Mounth = 9 Or Mounth = 11) And Day > 30 Then Exit For\\n If Day < 10 Then k$ = \\\"0\\\" Else k$ = \\\"\\\"\\n If choice = 1 Then\\n dateTest = dateTest + k$ + LTrim$(Str$(Day))\\n Else\\n dateTest = k$ + LTrim$(Str$(Day)) + dateTest\\n End If\\n 'Print dateTest: Sleep\\n For Pal = 1 To 4\\n If Mid$(dateTest, Pal, 1) <> Mid$(dateTest, 9 - Pal, 1) Then Exit For\\n Next\\n If Pal = 5 Then Print dateTest\\n If choice = 1 Then\\n dateTest = Left$(dateTest, 6)\\n Else\\n dateTest = Right$(dateTest, 6)\\n End If\\n Next\\n If choice = 1 Then\\n dateTest = Left$(dateTest, 4)\\n Else\\n dateTest = Right$(dateTest, 4)\\n End If\\n Next\\n dateTest = \\\"\\\"\\nNext\\n\",\n \"language\": \"QB64\"\n },\n {\n \"code\": \"dateTest$ = \\\"\\\"\\ntotal = 0\\n\\nPRINT \\\"Siguientes 15 fechas palindr¢micas al 2020-02-02:\\\"\\nFOR anno = 2021 TO 9999\\n dateTest$ = LTRIM$(STR$(anno))\\n FOR mes = 1 TO 12\\n IF mes < 10 THEN dateTest$ = dateTest$ + \\\"0\\\"\\n dateTest$ = dateTest$ + LTRIM$(STR$(mes))\\n FOR dia = 1 TO 31\\n IF mes = 2 AND dia > 28 THEN EXIT FOR\\n IF (mes = 4 OR mes = 6 OR mes = 9 OR mes = 11) AND dia > 30 THEN EXIT FOR\\n IF dia < 10 THEN dateTest$ = dateTest$ + \\\"0\\\"\\n dateTest$ = dateTest$ + LTRIM$(STR$(dia))\\n FOR Pal = 1 TO 4\\n IF MID$(dateTest$, Pal, 1) <> MID$(dateTest$, 9 - Pal, 1) THEN EXIT FOR\\n NEXT Pal\\n IF Pal = 5 THEN\\n total = total + 1\\n IF total <= 15 THEN PRINT LEFT$(dateTest$, 4); \\\"-\\\"; MID$(dateTest$, 5, 2); \\\"-\\\"; RIGHT$(dateTest$, 2)\\n END IF\\n IF total > 15 THEN\\n EXIT FOR: EXIT FOR: EXIT FOR\\n END IF\\n dateTest$ = LEFT$(dateTest$, 6)\\n NEXT dia\\n dateTest$ = LEFT$(dateTest$, 4)\\n NEXT mes\\n dateTest$ = \\\"\\\"\\nNEXT anno\\nEND\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ dup 400 mod 0 = iff\\n [ drop true ] done\\n dup 100 mod 0 = iff\\n [ drop false ] done\\n 4 mod 0 = ] is leap ( y --> b )\\n\\n [ 1 -\\n [ table\\n 31 [ dup leap 28 + ]\\n 31 30 31 30 31 31 30\\n 31 30 31 ]\\n do nip ] is monthdays ( y m --> n )\\n\\n [ 1+ dip [ 2dup monthdays ]\\n tuck < while\\n drop 1+ 1\\n over 13 = if\\n [ 2drop 1+ 1 1 ] ] is nextday ( y m d --> y m d )\\n\\n\\n [ dip 2dup dup dip unrot ] is 3dup ( a b c --> a b c a b c )\\n\\n [ swap 100 * +\\n swap 10000 * +\\n number$ ] is date$ ( y m d --> $ )\\n\\n [ dup reverse = ] is palindrome ( $ --> b )\\n\\n [ char - swap 4 stuff\\n char - swap 7 stuff ] is +dashes ( $ --> $ )\\n\\n [] temp put\\n 2020 02 02\\n [ nextday\\n 3dup date$\\n dup palindrome iff\\n [ temp take\\n swap nested join\\n temp put ]\\n else drop\\n temp share\\n size 15 = until ]\\n drop 2drop\\n temp take witheach\\n [ +dashes echo$ cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my $start = '1000-01-01';\\n\\nmy @palindate = {\\n state $year = $start.substr(0,4);\\n ++$year;\\n my $m = $year.substr(2, 2).flip;\\n my $d = $year.substr(0, 2).flip;\\n next if not try Date.new(\\\"$year-$m-$d\\\");\\n \\\"$year-$m-$d\\\"\\n} … *;\\n\\nmy $date-today = Date.today; # 2020-02-02\\n\\nmy $k = @palindate.first: { Date.new($_) > $date-today }, :k;\\n\\nsay join \\\"\\\\n\\\", @palindate[$k - 1 .. $k + 14];\\n\\nsay \\\"\\\\nTotal number of four digit year palindrome dates:\\\\n\\\" ~\\nmy $four = @palindate.first( { .substr(5,1) eq '-' }, :k );\\nsay \\\"between {@palindate[0]} and {@palindate[$four - 1]}.\\\";\\n\\nmy $five = @palindate.first: { .substr(6,1) eq '-' }, :k;\\n\\nsay \\\"\\\\nTotal number of five digit year palindrome dates:\\\\n\\\" ~\\n+@palindate[$four .. $five]\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program finds & displays the next N palindromic dates starting after 2020─02─02*/\\n/* ───── */\\nparse arg n from . /*obtain optional argumets from the CL*/\\nif n=='' | n==\\\",\\\" then n= 15 /*Not specified? Then use the default.*/\\nif from=='' | from==\\\",\\\" then from= '2020-02-02' /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n#= 0 /*the count of palindromic dates so far*/\\n do j=date('Base', from, \\\"ISO\\\")+1 until #==n /*find palindromic dates 'til N found*/\\n aDate= date('ISO', j, \\\"Base\\\") /*convert a \\\"base\\\" date to ISO format. */\\n $= space( translate(aDate, , '-'), 0) /*elide the dashes (-) in this date. */\\n if $\\\\==reverse($) then iterate /*Not palindromic? Then skip this date*/\\n say 'a palindromic date: ' aDate /*display a palindromic date ──► term. */\\n #= # + 1 /*bump the counter of palindromic dates*/\\n end /*j*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"load \\\"stdlib.ring\\\"\\n\\ndt\\t\\t= 0\\nnum\\t\\t= 0\\nlimit\\t = 15\\n\\n? \\\"First 15 palindromic dates:\\\" + nl\\n\\nwhile num < limit\\n\\n\\tdt++\\n\\tdateStr = adddays(date(),dt)\\n\\tnewDate = substr(dateStr,7,4) + substr(dateStr,4,2) + substr(dateStr,1,2)\\n\\tnewDate2 = substr(dateStr,7,4) + \\\"-\\\" + substr(dateStr,4,2) + \\\"-\\\" + substr(dateStr,1,2)\\n\\tif ispalindrome(newDate)\\n num++\\n\\t\\t? newDate2 \\t\\n\\tok\\n\\tif num > limit\\n\\t\\texit\\n\\tok\\n\\nend\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require 'date'\\n\\npalindate = Enumerator.new do |yielder|\\n (\\\"2020\\\"..).each do |y|\\n m, d = y.reverse.scan(/../) # let the Y10K kids handle 5 digit years\\n strings = [y, m, d]\\n yielder << strings.join(\\\"-\\\") if Date.valid_date?( *strings.map( &:to_i ) )\\n end\\nend\\n\\nputs palindate.take(15)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// [dependencies]\\n// chrono = \\\"0.4\\\"\\n\\nfn is_palindrome(s: &str) -> bool {\\n s.chars().rev().eq(s.chars())\\n}\\n\\nfn main() {\\n let mut date = chrono::Utc::today();\\n let mut count = 0;\\n while count < 15 {\\n if is_palindrome(&date.format(\\\"%Y%m%d\\\").to_string()) {\\n println!(\\\"{}\\\", date.format(\\\"%F\\\"));\\n count += 1;\\n }\\n date = date.succ();\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"var palindates = gather {\\n for y in (2020 .. 9999) {\\n var (m, d) = Str(y).flip.last(4).split(2)...\\n with ([y,m,d].join('-')) {|t|\\n take(t) if Date.valid(t, \\\"%Y-%m-%d\\\")\\n }\\n }\\n}\\n\\nsay \\\"Count of palindromic dates [2020..9999]: #{palindates.len}\\\"\\n\\nfor a,b in ([\\n [\\\"First 15:\\\", palindates.head(15)],\\n [\\\"Last 15:\\\", palindates.tail(15)]\\n]) {\\n say (\\\"\\\\n#{a}\\\\n\\\", b.slices(5).map { .join(\\\" \\\") }.join(\\\"\\\\n\\\"))\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nfunc isPalindrome(_ string: String) -> Bool {\\n let chars = string.lazy\\n return chars.elementsEqual(chars.reversed())\\n}\\n\\nlet format = DateFormatter()\\nformat.dateFormat = \\\"yyyyMMdd\\\"\\n\\nlet outputFormat = DateFormatter()\\noutputFormat.dateFormat = \\\"yyyy-MM-dd\\\"\\n\\nvar count = 0\\nlet limit = 15\\nlet calendar = Calendar.current\\nvar date = Date()\\n\\nwhile count < limit {\\n if isPalindrome(format.string(from: date)) {\\n print(outputFormat.string(from: date))\\n count += 1\\n }\\n date = calendar.date(byAdding: .day, value: 1, to: date)!\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"is_palyndrom_date() { date -d \\\"$1\\\" 1>/dev/null 2>&1 && echo \\\"$1\\\" ; }\\n\\nfor _H in {2..9}; do\\n for _I in {0..9}; do\\n for _J in {0..99}; do\\n is_palyndrom_date ${_H}${_I}`printf \\\"%02d%s\\\" ${_J}`-`printf \\\"%02d%s\\\" ${_J} | rev`-`printf \\\"%02d%s\\\" ${_H}${_I} | rev`\\n done\\n done\\ndone\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Sub MainPalindromeDates()\\nConst FirstDate As String = \\\"2020-02-02\\\"\\nConst NumberOfDates As Integer = 15\\nDim D As String, temp As String, Cpt As Integer\\n temp = Format(DateAdd(\\\"d\\\", 1, CDate(FirstDate)), \\\"yyyy-mm-dd\\\")\\n Do\\n D = Replace(temp, \\\"-\\\", \\\"\\\")\\n If IsDatePalindrome(D) Then\\n Debug.Print Left(D, 4) & \\\"-\\\" & Mid(D, 5, 2) & \\\"-\\\" & Right(D, 2)\\n Cpt = Cpt + 1\\n End If\\n temp = Format(DateAdd(\\\"d\\\", 1, CDate(temp)), \\\"yyyy-mm-dd\\\")\\n Loop While Cpt < NumberOfDates\\nEnd Sub\\nFunction IsDatePalindrome(strDate As String) As Boolean\\n IsDatePalindrome = StrReverse(Left(strDate, 4)) = Right(strDate, 4)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./date\\\" for Date\\n\\nvar isPalDate = Fn.new { |date|\\n date = date.format(Date.rawDate)\\n return date == date[-1..0]\\n}\\n\\nDate.default = Date.isoDate\\nSystem.print(\\\"The next 15 palindromic dates in yyyy-mm-dd format after 2020-02-02 are:\\\")\\nvar date = Date.new(2020, 2, 2)\\nvar count = 0\\nwhile (count < 15) {\\n date = date.addDays(1)\\n if (isPalDate.call(date)) {\\n System.print(date)\\n count = count + 1\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func Rev(N);\\nint N;\\n[N:= N/10;\\nreturn rem(0)*10 + N;\\n];\\n\\nproc NumOut(N);\\nint N;\\n[if N < 10 then ChOut(0, ^0);\\nIntOut(0, N);\\n];\\n\\nint C, Y, M, D, Q, R;\\n[C:= 0;\\nfor Y:= 2021 to -1>>1 do\\n for M:= 1 to 12 do\\n for D:= 1 to 28 do\\n [Q:= Y/100;\\n R:= rem(0);\\n if Q = Rev(D) and R = Rev(M) then\\n [IntOut(0, Y); ChOut(0, ^-);\\n NumOut(M); ChOut(0, ^-);\\n NumOut(D); CrLf(0);\\n C:= C+1;\\n if C >= 15 then return;\\n ];\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"dateTest$ = \\\"\\\"\\ntotal = 0\\nprint \\\"Siguientes 15 fechas palindr¢micas al 2020-02-02:\\\"\\nfor anno = 2021 to 9999\\n dateTest$ = ltrim$(str$(anno))\\n for mes = 1 to 12\\n if mes < 10 then dateTest$ = dateTest$ + \\\"0\\\" : fi\\n dateTest$ = dateTest$ + ltrim$(str$(mes))\\n for dia = 1 to 31\\n if mes = 2 and dia > 28 then break : fi\\n if (mes = 4 or mes = 6 or mes = 9 or mes = 11) and dia > 30 then break : fi\\n if dia < 10 then dateTest$ = dateTest$ + \\\"0\\\" : fi\\n dateTest$ = dateTest$ + ltrim$(str$(dia))\\n for Pal = 1 to 4\\n if mid$(dateTest$, Pal, 1) <> mid$(dateTest$, 9 - Pal, 1) then break : fi\\n next Pal\\n if Pal = 5 then\\n total = total + 1\\n if total <= 15 then print left$(dateTest$,4),\\\"-\\\",mid$(dateTest$,5,2),\\\"-\\\",right$(dateTest$,2) : fi\\n end if\\n if total > 15 then break : break : break : fi\\n dateTest$ = left$(dateTest$, 6)\\n next dia\\n dateTest$ = left$(dateTest$, 4)\\n next mes\\n dateTest$ = \\\"\\\"\\nnext anno\\nend\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"TD,date,n := Time.Date, T(2020,02,02), 15;\\nwhile(n){\\n ds:=TD.toYMDString(date.xplode()) - \\\"-\\\";\\n if(ds==ds.reverse()){ n-=1; println(TD.toYMDString(date.xplode())); }\\n date=TD.addYMD(date,0,0,1);\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Palindrome-dates"}}},{"rowIdx":1477,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Recursion\n- String manipulation\n- Classic CS problems and programs\n- Palindromes\nfrom: http://rosettacode.org/wiki/Palindrome_detection\nnote: Text processing\n","language":"00-META"},{"code":"A [[wp:Palindrome|palindrome]] is a phrase which reads the same backward and forward.\n\n{{task heading}}\n\nWrite a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) \nis a palindrome.\n\n'''''For extra credit:'''''\n* Support Unicode characters.\n* Write a second function (possibly as a wrapper to the first) which detects ''inexact'' palindromes, i.e. phrases that are palindromes if white-space and punctuation is ignored and case-insensitive comparison is used.\n\n{{task heading|Hints}}\n* It might be useful for this task to know how to [[Reversing a string|reverse a string]].\n* This task's entries might also form the subjects of the task [[Test a function]].\n\n{{task heading|Related tasks}}\n{{Related tasks/Word plays}}\n\n\n{{Template:Strings}}\n<br><br>\n\n","language":"00-TASK"},{"code":"F is_palindrome(s)\n R s == reversed(s)\n","language":"11l"},{"code":"* Reverse b string 25/06/2018\nPALINDRO CSECT\n USING PALINDRO,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n STM R14,R12,12(R13) prolog\n ST R13,4(R15) \"\n ST R15,8(R13) \"\n LR R13,R15 \"\n LA R8,BB @b[1]\n LA R9,AA+L'AA-1 @a[n-1]\n LA R6,1 i=1\nLOOPI C R6,=A(L'AA) do i=1 to length(a)\n BH ELOOPI leave i\n MVC 0(1,R8),0(R9) substr(b,i,1)=substr(a,n-i+1,1)\n LA R8,1(R8) @b=@b+1\n BCTR R9,0 @a=@a-1\n LA R6,1(R6) i=i+1\n B LOOPI end do\nELOOPI XPRNT AA,L'AA print a\n CLC BB,AA if b=a\n BNE SKIP\n XPRNT MSG,L'MSG then print msg\nSKIP L R13,4(0,R13) epilog\n LM R14,R12,12(R13) \"\n XR R15,R15 \"\n BR R14 exit\nAA DC CL32'INGIRUMIMUSNOCTEETCONSUMIMURIGNI' a\nBB DS CL(L'AA) b\nMSG DC CL23'IT IS A TRUE PALINDROME'\n YREGS\n END PALINDRO\n","language":"360-Assembly"},{"code":"\torg\t100h\n\tjmp\tdemo\n\t;;;\tIs the $-terminated string at DE a palindrome?\n\t;;;\tReturns: zero flag set if palindrome\npalin:\tmov\th,d\t; Find end of string\n\tmov\tl,e\n\tmvi\ta,'$'\n\tcmp\tm\t; The empty string is a palindrome\n\trz\npend:\tinx\th\t; Scan until terminator found\n\tcmp\tm\n\tjnz\tpend\n\tdcx\th\t; Move to last byte of text\nptest:\tldax\td\t; Load char at left pointer\n\tcmp \tm\t; Compare to char at right pointer\n\trnz\t\t; If not equal, not a palindrome\n\tinx\td\t; Move pointers\n\tdcx\th\n\tmov\ta,d\t; Check if left pointer is before right pointer\n\tcmp \th\t; High byte\n\tjc\tptest\n\tmov\ta,e\t; Low byte\n\tcmp\tl\n\tjc\tptest\n\txra\ta\t; Made it to the end - set zero flag\n\tret\t\t; Return\n\t;;;\tTest the routine on a few examples\ndemo:\tlxi\th,words\t; Word list pointer\nloop:\tmov\te,m\t; Load word pointer\n\tinx\th\n\tmov\td,m\n\tinx\th\n\tmov\ta,e\t; Stop when zero reached\n\tora\td\n\trz\n\tpush\th\t; Keep word list pointer\n\tcall\tpstr\t; Print word\n\tcall\tpalin\t; Check if palindrome\n\tlxi\td,no\n\tjnz \tprint\t; Print \"no\" if not a palindrome\n\tlxi\td,yes\t; Print \"yes\" otherwise\nprint:\tcall\tpstr\n\tpop\th\n\tjmp \tloop\n\t;;;\tPrint strint using CP/M keeping DEHL registers\npstr:\tpush\td\n\tpush\th\n\tmvi\tc,9\n\tcall\t5\n\tpop\th\n\tpop\td\n\tret\nyes:\tdb\t': yes',13,10,'$'\nno:\tdb\t': no',13,10,'$'\t\nwords:\tdw\tw1,w2,w3,w4,0\nw1:\tdb\t'rotor$'\nw2:\tdb\t'racecar$'\nw3:\tdb\t'level$'\nw4:\tdb\t'rosetta$'\n","language":"8080-Assembly"},{"code":"\tcpu\t8086\n\torg\t100h\nsection\t.text\n\tjmp\tdemo\n\t;;;\tCheck if the $-terminated string in [DS:SI] is a palindrome.\n\t;;;\tReturns with zero flag set if so.\n\t;;;\tDestroyed: AL, CX, SI, DI, ES.\npalin:\tpush\tes\t\t; Set ES=DS.\n\tpop\tds\n\tmov\tal,'$'\t\t; Find end of string\n\tmov\tcx,-1\n\tmov\tdi,si\n\trepne\tscasb\n\tdec\tdi\t\t; Move back to last actual character\n.loop:\tcmp\tsi,di\n\tja\t.ok\t\t; If SI > DI, it is a palindrome\n\tlodsb\n\tdec\tdi\t\t; Compare left character to right character\n\tcmp\tal,[di]\n\tjne\t.no\t\t; If not equal, not a palindrome\n\tjmp \t.loop\t\t; Otherwise, try next pair of characters\n.ok:\tcmp\tal,al\t\t; Set zero flag\n.no: \tret \t\t\t; Return\n\t;;;\tTry the routine on a couple of strings\ndemo:\tmov\tsi,words\n.loop:\tlodsw\t\t\t; Grab word pointer\n\ttest\tax,ax\t\t; Zero?\n\tjz\t.done\t\t; Then we are done\n\tmov\tdx,ax\t\t; Otherwise, print word\n\tmov\tah,9\t\t\n\tint\t21h\n\txchg\tbp,si\t\t; Keep array pointer in BP\n\txchg\tsi,dx\t\t; Put word pointer in SI\n\tcall\tpalin\t\t; Check if it is a palindrome\n\tmov\tdx,yes\t\t; Print 'yes'...\n\tjz\t.print\t\t; ...if it is a palindrome\n\tmov\tdx,no\t\t; Otherwise, print 'no'\n.print:\tint \t21h\n\txchg\tsi,bp\t\t; Restore array pointer\n\tjmp\t.loop\t\t; Get next word.\n.done:\tret\nyes:\tdb\t': yes',13,10,'$'\t; Yes and no\nno:\tdb\t': no',13,10,'$'\nwords:\tdw\t.w1,.w2,.w3,.w4,.w5,0\n.w1:\tdb\t'rotor$'\t; Words to check\n.w2:\tdb\t'racecar$'\n.w3:\tdb\t'level$'\n.w4:\tdb\t'redder$'\n.w5:\tdb\t'rosetta$'\n","language":"8086-Assembly"},{"code":"(defun reverse-split-at-r (xs i ys)\n (if (zp i)\n (mv xs ys)\n (reverse-split-at-r (rest xs) (1- i)\n (cons (first xs) ys))))\n\n(defun reverse-split-at (xs i)\n (reverse-split-at-r xs i nil))\n\n(defun is-palindrome (str)\n (let* ((lngth (length str))\n (idx (floor lngth 2)))\n (mv-let (xs ys)\n (reverse-split-at (coerce str 'list) idx)\n (if (= (mod lngth 2) 1)\n (equal (rest xs) ys)\n (equal xs ys)))))\n","language":"ACL2"},{"code":"(defun palindrome-type (text)\n (cond ((exact-palindrom-p text) 'exact)\n ((inexact-palindrome-p text) 'inexact)\n (t 'not-a-palindrome)))\n\n(defun exact-palindrom-p (text)\n (eq text (implode (reverse (explode text)))))\n\n(defun inexact-palindrome-p (text)\n (exact-palindrom-p (implode (normalise (explode text)))))\n\n(defun reverse (list (result . ()))\n (map '(lambda (e) (setq result (cons e result)))\n list)\n result)\n\n(defun normalise (chars)\n (cond ((null chars)\n nil)\n ((not (alphanumeric-p (car chars)))\n (normalise (cdr chars)))\n ((upper-case-p (car chars))\n (cons (to-lower-case (car chars))\n (normalise (cdr chars))))\n (t\n (cons (car chars) (normalise (cdr chars))))))\n\n(defun between-p (lowest-value n highest-value)\n (not (or (lessp n lowest-value)\n (greaterp n highest-value))))\n\n(defun alphanumeric-p (ch)\n (or (lower-case-p ch) (upper-case-p ch) (digit-p ch)))\n\n(defun digit-p (ch)\n (between-p (add1 (ordinal '/))\n (ordinal ch)\n (sub1 (ordinal ':))))\n\n(defun upper-case-p (ch)\n (between-p (ordinal 'A) (ordinal ch) (ordinal 'Z)))\n\n(defun lower-case-p (ch)\n (between-p (ordinal 'a) (ordinal ch) (ordinal 'z)))\n\n(defun to-lower-case (ch)\n (character (plus (ordinal ch)\n (difference (ordinal 'a) (ordinal 'A)))))\n\n(defun examples ()\n (map '(lambda (text)\n (printc '!\" text '!\"\n '! is! (palindrome-type text)))\n '(a\n abba Abba\n abcba\n baba\n Able! was! I! ere! I! saw! Elba!!\n In! girum! imus! nocte,! et! consumimur! igni)))\n","language":"Acornsoft-Lisp"},{"code":"BYTE FUNC Palindrome(CHAR ARRAY s)\n BYTE l,r\n\n l=1 r=s(0)\n WHILE l<r\n DO\n IF s(l)#s(r) THEN RETURN (0) FI\n l==+1 r==-1\n OD\nRETURN (1)\n\nBYTE FUNC IsIgnored(BYTE c)\n IF (c>=' AND c<='/) OR\n (c>=': AND c<='@) OR\n (c>='[ AND c<='_) THEN\n RETURN (1)\n FI\nRETURN (0)\n\nBYTE FUNC ToUpper(BYTE c)\n IF c>='a AND c<='z THEN\n RETURN (c-'a+'A)\n FI\nRETURN (c)\n\nBYTE FUNC InexactPalindrome(CHAR ARRAY s)\n BYTE l,r,lc,rc\n\n l=1 r=s(0)\n WHILE l<r\n DO\n WHILE IsIgnored(s(l))\n DO\n l==+1\n IF l>=r THEN RETURN (1) FI\n OD\n WHILE IsIgnored(s(r))\n DO\n r==-1\n IF l>=r THEN RETURN (1) FI\n OD\n\n lc=ToUpper(s(l))\n rc=ToUpper(s(r))\n\n IF lc#rc THEN RETURN (0) FI\n l==+1 r==-1\n OD\nRETURN (1)\n\nPROC Test(CHAR ARRAY s)\n IF Palindrome(s) THEN\n PrintF(\"'%S' is a palindrome%E%E\",s)\n ELSEIF InexactPalindrome(s) THEN\n PrintF(\"'%S' is an inexact palindrome%E%E\",s)\n ELSE\n PrintF(\"'%S' is not a palindrome%E%E\",s)\n FI\nRETURN\n\nPROC Main()\n Test(\"rotavator\")\n Test(\"13231+464+989=989+464+13231\")\n Test(\"Was it a car or a cat I saw?\")\n Test(\"Did Hannah see bees? Hannah did.\")\n Test(\"This sentence is not a palindrome.\")\n Test(\"123 456 789 897 654 321\")\nRETURN\n","language":"Action-"},{"code":"function isPalindrome(str:String):Boolean\n{\n\tfor(var first:uint = 0, second:uint = str.length - 1; first < second; first++, second--)\n\t\tif(str.charAt(first) != str.charAt(second)) return false;\n\treturn true;\n}\n","language":"ActionScript"},{"code":"function Palindrome (Text : String) return Boolean is\nbegin\n for Offset in 0..Text'Length / 2 - 1 loop\n if Text (Text'First + Offset) /= Text (Text'Last - Offset) then\n return False;\n end if;\n end loop;\n return True;\nend Palindrome;\n","language":"Ada"},{"code":"function Palindrome (Text : String) return Boolean is\n(for all i in Text'Range => Text(i)= Text(Text'Last-i+Text'First));\n","language":"Ada"},{"code":"# Iterative #\nPROC palindrome = (STRING s)BOOL:(\n FOR i TO UPB s OVER 2 DO\n IF s[i] /= s[UPB s-i+1] THEN GO TO return false FI\n OD;Power\n else: TRUE EXIT\n return false: FALSE\n);\n\n# Recursive #\nPROC palindrome r = (STRING s)BOOL:\n IF LWB s >= UPB s THEN TRUE\n ELIF s[LWB s] /= s[UPB s] THEN FALSE\n ELSE palindrome r(s[LWB s+1:UPB s-1])\n FI\n;\n\n# Test #\nmain:\n(\n STRING t = \"ingirumimusnocteetconsumimurigni\";\n FORMAT template = $\"sequence \"\"\"g\"\"\" \"b(\"is\",\"isnt\")\" a palindrome\"l$;\n\n printf((template, t, palindrome(t)));\n printf((template, t, palindrome r(t)))\n)\n","language":"ALGOL-68"},{"code":" {⍵≡⌽⍵} 'abc'\n0\n {⍵≡⌽⍵} '⍋racecar⍋'\n1\n","language":"APL"},{"code":" (⊢≡⌽) 'abc'\n0\n (⊢≡⌽) 'nun'\n1\n","language":"APL"},{"code":"inexact←{Aa←(⎕A,⎕a) ⋄ (⊢≡⌽)(⎕a,⎕a)[Aa⍳⍵/⍨⍵∊Aa]}\n inexact 'abc,-cbA2z'\n0\n inexact 'abc,-cbA2'\n1\n","language":"APL"},{"code":"use framework \"Foundation\"\n\n------ CASE-INSENSITIVE PALINDROME, IGNORING SPACES ? ----\n\n-- isPalindrome :: String -> Bool\non isPalindrome(s)\n s = intercalate(\"\", reverse of characters of s)\nend isPalindrome\n\n-- toSpaceFreeLower :: String -> String\non spaceFreeToLower(s)\n script notSpace\n on |λ|(s)\n s is not space\n end |λ|\n end script\n\n intercalate(\"\", filter(notSpace, characters of toLower(s)))\nend spaceFreeToLower\n\n\n--------------------------- TEST -------------------------\non run\n\n isPalindrome(spaceFreeToLower(\"In girum imus nocte et consumimur igni\"))\n\n --> true\n\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- filter :: (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 |λ|(v, i, xs) then set end of lst to v\n end repeat\n return lst\n end tell\nend filter\n\n\n-- intercalate :: 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\n-- Lift 2nd class handler function into 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- toLower :: String -> String\non toLower(str)\n set ca to current application\n ((ca's NSString's stringWithString:(str))'s ¬\n lowercaseStringWithLocale:(ca's NSLocale's currentLocale())) as text\nend toLower\n","language":"AppleScript"},{"code":"on isPalindrome(txt)\n set txt to join(txt, \"\") -- In case the input's a list (array).\n return (txt = join(reverse of txt's characters, \"\"))\nend isPalindrome\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 isPalindrome(\"Radar\")\n","language":"AppleScript"},{"code":"true\n","language":"AppleScript"},{"code":"considering case\n return isPalindrome(\"Radar\")\nend considering\n","language":"AppleScript"},{"code":"false\n","language":"AppleScript"},{"code":"ignoring case, white space, hyphens and punctuation\n return isPalindrome(\"Was it a 😀car, or a c😀at-I-saw?\")\nend ignoring\n","language":"AppleScript"},{"code":"true\n","language":"AppleScript"},{"code":"100 DATA\"MY DOG HAS FLEAS\"\n110 DATA\"MADAM, I'M ADAM.\"\n120 DATA\"1 ON 1\"\n130 DATA\"IN GIRUM IMUS NOCTE ET CONSUMIMUR IGNI\"\n140 DATA\"A man, a plan, a canal: Panama!\"\n150 DATA\"KAYAK\"\n160 DATA\"REDDER\"\n170 DATA\"H\"\n180 DATA\"\"\n\n200 FOR L1 = 1 TO 9\n210 READ W$ : GOSUB 300\" IS PALINDROME?\n220 PRINT CHR$(34); W$; CHR$(34); \" IS \";\n230 IF NOT PALINDROME THEN PRINT \"NOT \";\n240 PRINT \"A PALINDROME\"\n250 NEXT\n260 END\n\n300 REMIS PALINDROME?\n310 PA = 1\n320 L = LEN(W$)\n330 IF L = 0 THEN RETURN\n340 FOR L0 = 1 TO L / 2 + .5\n350 PA = MID$(W$, L0, 1) = MID$(W$, L - L0 + 1, 1)\n360 IF PALINDROME THEN NEXT L0\n370 RETURN\n","language":"Applesoft-BASIC"},{"code":"@ Check whether the ASCII string in [r0] is a palindrome\n@ Returns with zero flag set if palindrome.\npalin:\tmov\tr1,r0\t\t@ Find end of string\n1:\tldrb\tr2,[r1],#1\t@ Grab character and increment pointer\n\ttst\tr2,r2\t\t@ Zero yet?\n\tbne\t1b\t\t@ If not try next byte\n\tsub\tr1,r1,#2\t@ Move R1 to last actual character.\n2:\tcmp\tr0,r1\t\t@ When R0 >= R1,\n\tcmpgt\tr2,r2\t\t@ make sure zero is set,\n\tbxeq\tlr\t\t@ and stop (the string is a palindrome).\n\tldrb\tr2,[r1],#-1\t@ Grab [R1] (end) and decrement.\n\tldrb\tr3,[r0],#1\t@ Grab [R0] (begin) and increment\n\tcmp\tr2,r3\t\t@ Are they equal?\n\tbxne\tlr\t\t@ If not, it's not a palindrome.\n\tb\t2b\t\t@ Otherwise, try next pair.\n\t\n@ Try the function on a couple of strings\n.global _start\n_start:\tldr\tr8,=words\t@ Word pointer\n1:\tldr\tr9,[r8],#4\t@ Grab word and move pointer\n\ttst\tr9,r9\t\t@ Null?\n\tmoveq\tr7,#1\t\t@ Then we're done; syscall 1 = exit\n\tswieq\t#0\n\tmov\tr1,r9\t\t@ Print the word\n\tbl\tprint\t\t\n\tmov\tr0,r9\t\t@ Test if the word is a palindrome\n\tbl\tpalin\n\tldreq\tr1,=yes\t\t@ \"Yes\" if it is a palindrome\n\tldrne\tr1,=no\t\t@ \"No\" if it's not a palindrome\n\tbl\tprint\n\tb\t1b\t\t@ Next word\n\n@ Print zero-terminated string [r1] using Linux syscall\nprint:\tpush\t{r7,lr}\t\t@ Keep R7 and link register\n\tmov\tr2,r1\t\t@ Find end of string\n1:\tldrb\tr0,[r2],#1\t@ Grab character and increment pointer\n\ttst\tr0,r0\t\t@ Zero yet?\n\tbne\t1b\t\t@ If not, keep going\n\tsub\tr2,r2,r1\t@ Calculate length of string (bytes to write)\n\tmov\tr0,#1\t\t@ Stdout = 1\n\tmov\tr7,#4\t\t@ Syscall 4 = write\n\tswi\t#0\t\t@ Make the syscall\n\tpop\t{r7,lr}\t\t@ Restore R7 and link register\n\tbx\tlr\n\t\n@ Strings\nyes:\t.asciz\t\": yes\\n\"\t@ Output yes or no\nno:\t.asciz\t\": no\\n\"\nw1:\t.asciz\t\"rotor\"\t\t@ Words to test\nw2:\t.asciz\t\"racecar\"\nw3:\t.asciz\t\"level\"\nw4:\t.asciz\t\"redder\"\nw5:\t.asciz\t\"rosetta\"\nwords:\t.word\tw1,w2,w3,w4,w5,0\n","language":"ARM-Assembly"},{"code":"palindrome?: $[seq] -> seq = reverse seq\n\nloop [\"abba\" \"boom\" \"radar\" \"civic\" \"great\"] 'wrd [\n\tprint [wrd \": palindrome?\" palindrome? wrd]\n]\n","language":"Arturo"},{"code":"IsPalindrome(Str){\n\tLoop, Parse, Str\n\t\tReversedStr := A_LoopField . ReversedStr\n\treturn, (ReversedStr == Str)?\"Exact\":(RegExReplace(ReversedStr,\"\\W\")=RegExReplace(Str,\"\\W\"))?\"Inexact\":\"False\"\n}\n","language":"AutoHotkey"},{"code":";== AutoIt Version: 3.3.8.1\n\nGlobal $aString[7] = [ _\n\"In girum imus nocte, et consumimur igni\", _ ; inexact palindrome\n\"Madam, I'm Adam.\", _ ; inexact palindrome\n\"salàlas\", _ ; exact palindrome\n\"radar\", _ ; exact palindrome\n\"Lagerregal\", _ ; exact palindrome\n\"Ein Neger mit Gazelle zagt im Regen nie.\", _ ; inexact palindrome\n\"something wrong\"] ; no palindrome\nGlobal $sSpace42 = \" \"\n\nFor $i = 0 To 6\n\tIf _IsPalindrome($aString[$i]) Then\n\t\tConsoleWrite('\"' & $aString[$i] & '\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is an exact palindrome.' & @LF)\n\tElse\n\t\tIf _IsPalindrome( StringRegExpReplace($aString[$i], '\\W', '') ) Then\n\t\t\tConsoleWrite('\"' & $aString[$i] & '\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is an inexact palindrome.' & @LF)\n\t\tElse\n\t\t\tConsoleWrite('\"' & $aString[$i] & '\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is not a palindrome.' & @LF)\n\t\tEndIf\n\tEndIf\nNext\n\nFunc _IsPalindrome($_string)\n\tLocal $iLen = StringLen($_string)\n\tFor $i = 1 To Int($iLen/2)\n\t\tIf StringMid($_string, $i, 1) <> StringMid($_string, $iLen-($i-1), 1) Then Return False\n\tNext\n\tReturn True\nEndFunc\n","language":"AutoIt"},{"code":"\"In girum imus nocte, et consumimur igni\" is an inexact palindrome.\n\"Madam, I'm Adam.\" is an inexact palindrome.\n\"salàlas\" is an exact palindrome.\n\"radar\" is an exact palindrome.\n\"Lagerregal\" is an exact palindrome.\n\"Ein Neger mit Gazelle zagt im Regen nie.\" is an inexact palindrome.\n\"something wrong\" is not a palindrome.\n","language":"AutoIt"},{"code":"function is_palindro(s)\n{\n if ( s == reverse(s) ) return 1\n return 0\n}\n","language":"AWK"},{"code":"function is_palindro_r(s)\n{\n if ( length(s) < 2 ) return 1\n if ( substr(s, 1, 1) != substr(s, length(s), 1) ) return 0\n return is_palindro_r(substr(s, 2, length(s)-2))\n}\n","language":"AWK"},{"code":"BEGIN {\n pal = \"ingirumimusnocteetconsumimurigni\"\n print is_palindro(pal)\n print is_palindro_r(pal)\n}\n","language":"AWK"},{"code":"OPTION COMPARE TRUE\n\nINPUT \"Enter your line... \", word$\n\nIF word$ = REVERSE$(word$) THEN\n PRINT \"This is an exact palindrome!\"\nELIF EXTRACT$(word$, \"[[:punct:]]|[[:blank:]]\", TRUE) = REVERSE$(EXTRACT$(word$, \"[[:punct:]]|[[:blank:]]\", TRUE)) THEN\n PRINT \"This is an inexact palindrome!\"\nELSE\n PRINT \"Not a palindrome.\"\nENDIF\n","language":"BaCon"},{"code":"' OPTION _EXPLICIT ' For QB64. In VB-DOS remove the underscore.\n\nDIM txt$\n\n' Palindrome\nCLS\nPRINT \"This is a palindrome detector program.\"\nPRINT\nINPUT \"Please, type a word or phrase: \", txt$\n\nIF IsPalindrome(txt$) THEN\n PRINT \"Is a palindrome.\"\nELSE\n PRINT \"Is Not a palindrome.\"\nEND IF\n\nEND\n\n\nFUNCTION IsPalindrome (AText$)\n ' Var\n DIM CleanTXT$, RvrsTXT$\n\n CleanTXT$ = CleanText$(AText$)\n RvrsTXT$ = RvrsText$(CleanTXT$)\n\n IsPalindrome = (CleanTXT$ = RvrsTXT$)\n\nEND FUNCTION\n\nFUNCTION CleanText$ (WhichText$)\n ' Var\n DIM i%, j%, c$, NewText$, CpyTxt$, AddIt%, SubsTXT$\n CONST False = 0, True = NOT False\n\n SubsTXT$ = \"AIOUE\"\n CpyTxt$ = UCASE$(WhichText$)\n j% = LEN(CpyTxt$)\n\n FOR i% = 1 TO j%\n c$ = MID$(CpyTxt$, i%, 1)\n\n ' See if it is a letter. Includes Spanish letters.\n SELECT CASE c$\n CASE \"A\" TO \"Z\"\n AddIt% = True\n CASE \" \", \"¡\", \"¢\", \"£\"\n c$ = MID$(SubsTXT$, ASC(c$) - 159, 1)\n AddIt% = True\n CASE \"‚\"\n c$ = \"E\"\n AddIt% = True\n CASE \"¤\"\n c$ = \"¥\"\n AddIt% = True\n CASE ELSE\n AddIt% = False\n END SELECT\n\n IF AddIt% THEN\n NewText$ = NewText$ + c$\n END IF\n NEXT i%\n\n CleanText$ = NewText$\n\nEND FUNCTION\n\nFUNCTION RvrsText$ (WhichText$)\n ' Var\n DIM i%, c$, NewText$, j%\n\n j% = LEN(WhichText$)\n FOR i% = 1 TO j%\n NewText$ = MID$(WhichText$, i%, 1) + NewText$\n NEXT i%\n\n RvrsText$ = NewText$\n\nEND FUNCTION\n","language":"BASIC"},{"code":"@echo off\nsetlocal enabledelayedexpansion\nset /p string=Your string :\nset count=0\n:loop\n\tif \"!%string%:~%count%,1!\" neq \"\" (\n\t\tset reverse=!%string%:~%count%,1!!reverse!\n\t\tset /a count+=1\n\t\tgoto loop\n\t)\nset palindrome=isn't\nif \"%string%\"==\"%reverse%\" set palindrome=is\necho %string% %palindrome% a palindrome.\npause\nexit\n","language":"Batch-File"},{"code":"@echo off\nset /p testString=Your string (all same case please) :\ncall :isPalindrome result %testString: =%\nif %result%==1 echo %testString% is a palindrome\nif %result%==0 echo %testString% isn't a palindrome\npause\ngoto :eof\n\n:isPalindrome\n\tset %1=0\n\tset string=%2\n\tif \"%string:~2,1%\"==\"\" (\n\t\tset %1=1\n\t\tgoto :eof\n\t)\n\tif \"%string:~0,1%\"==\"%string:~-1%\" (\n\t\tcall :isPalindrome %1 %string:~1,-1%\n\t)\n\tgoto :eof\n","language":"Batch-File"},{"code":" test$ = \"A man, a plan, a canal: Panama!\"\n PRINT \"\"\"\" test$ \"\"\"\" ;\n IF FNpalindrome(FNletters(test$)) THEN\n PRINT \" is a palindrome\"\n ELSE\n PRINT \" is not a palindrome\"\n ENDIF\n END\n\n DEF FNpalindrome(A$) = (A$ = FNreverse(A$))\n\n DEF FNreverse(A$)\n LOCAL B$, P%\n FOR P% = LEN(A$) TO 1 STEP -1\n B$ += MID$(A$,P%,1)\n NEXT\n = B$\n\n DEF FNletters(A$)\n LOCAL B$, C%, P%\n FOR P% = 1 TO LEN(A$)\n C% = ASC(MID$(A$,P%))\n IF C% > 64 AND C% < 91 OR C% > 96 AND C% < 123 THEN\n B$ += CHR$(C% AND &5F)\n ENDIF\n NEXT\n = B$\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet palindrome(s) = valof\n$( let l = s%0\n for i = 1 to l/2\n unless s%i = s%(l+1-i)\n resultis false\n resultis true\n$)\n\nlet inexact(s) = valof\n$( let temp = vec 1+256/BYTESPERWORD\n temp%0 := 0\n for i = 1 to s%0 do\n $( let ch = s%i | 32\n if '0'<=ch & ch<='9' | 'a'<=ch & ch<='z' then\n $( temp%0 := temp%0 + 1\n temp%(temp%0) := ch\n $)\n $)\n resultis palindrome(temp)\n$)\n\nlet check(s) =\n palindrome(s) -> \"exact palindrome\",\n inexact(s) -> \"inexact palindrome\",\n \"not a palindrome\"\n\nlet start() be\n$( let tests = vec 8\n tests!0 := \"rotor\"\n tests!1 := \"racecar\"\n tests!2 := \"RACEcar\"\n tests!3 := \"level\"\n tests!4 := \"redder\"\n tests!5 := \"rosetta\"\n tests!6 := \"A man, a plan, a canal: Panama\"\n tests!7 := \"Egad, a base tone denotes a bad age\"\n tests!8 := \"This is not a palindrome\"\n\n for i = 0 to 8 do\n writef(\"'%S': %S*N\", tests!i, check(tests!i))\n$)\n","language":"BCPL"},{"code":"v_$0:8p>:#v_:18p08g1-08p >:08g`!v\n~->p5p ^ 0v1p80-1g80vj!-g5g80g5_0'ev\n:a^80+1:g8<>8g1+:18pv>0\"eslaF\">:#,_@\n[[relet]]-2010------>003-x -^\"Tru\"<\n","language":"Befunge"},{"code":"v> \"emordnilap a toN\",,,,,,,,,,,,,,,,@,,,,,,,,,,,,,,,\"Is a palindrome\" <\n2^ < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < <\n4 ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v\n8 ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v\n*^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v\n+ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\n \"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\n>\"dennis sinned\" v\n \" 2\n \"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\" 0\n> ^- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 9\n _^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ p\n v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^\n v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^\n ^< < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < <\n >09g8p09g1+09pv\n |: < <\n^<\n","language":"Befunge"},{"code":"Pal ← ≡⊸⌽\nPal1 ← ⊢≡⌽\nPal2 ← {𝕩≡⌽𝕩}\n","language":"BQN"},{"code":"( ( palindrome\n = a\n . @(!arg:(%?a&utf$!a) ?arg !a)\n & palindrome$!arg\n | utf$!arg\n )\n& ( desep\n = x\n . @(!arg:?x (\" \"|\"-\"|\",\") ?arg)\n & !x desep$!arg\n | !arg\n )\n& \"In girum imus nocte et consumimur igni\"\n \"Я иду с мечем, судия\"\n \"The quick brown fox\"\n \"tregða, gón, reiði - er nóg að gert\"\n \"人人為我,我為人人\"\n \"가련하시다 사장집 아들딸들아 집장사 다시 하련가\"\n : ?candidates\n& whl\n ' ( !candidates:%?candidate ?candidates\n & out\n $ ( !candidate\n is\n ( palindrome$(low$(str$(desep$!candidate)))\n & indeed\n | not\n )\n a\n palindrome\n )\n )\n&\n);\n","language":"Bracmat"},{"code":":import std/String .\n\nmain [<~>0 =? 0]\n\n:test (main \"tacocat\") ([[1]])\n:test (main \"bruijn\") ([[0]])\n","language":"Bruijn"},{"code":"zz{ri}f[^^<-==\n","language":"Burlesque"},{"code":"#include <string.h>\n\nint palindrome(const char *s)\n{\n int i,l;\n l = strlen(s);\n for(i=0; i<l/2; i++)\n {\n if ( s[i] != s[l-i-1] ) return 0;\n }\n return 1;\n}\n","language":"C"},{"code":"int palindrome(const char *s)\n{\n const char *t; /* t is a pointer that traverses backwards from the end */\n for (t = s; *t != '\\0'; t++) ; t--; /* set t to point to last character */\n while (s < t)\n {\n if ( *s++ != *t-- ) return 0;\n }\n return 1;\n}\n","language":"C"},{"code":"int palindrome_r(const char *s, int b, int e)\n{\n if ( (e - 1) <= b ) return 1;\n if ( s[b] != s[e-1] ) return 0;\n return palindrome_r(s, b+1, e-1);\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <string.h>\n/* testing */\nint main()\n{\n const char *t = \"ingirumimusnocteetconsumimurigni\";\n const char *template = \"sequence \\\"%s\\\" is%s palindrome\\n\";\n int l = strlen(t);\n\n printf(template,\n t, palindrome(t) ? \"\" : \"n't\");\n printf(template,\n t, palindrome_r(t, 0, l) ? \"\" : \"n't\");\n return 0;\n}\n","language":"C"},{"code":"#include <string>\n#include <algorithm>\n\nbool is_palindrome(std::string const& s)\n{\n return std::equal(s.begin(), s.end(), s.rbegin());\n}\n","language":"C++"},{"code":"#include <string>\n#include <algorithm>\n\nbool is_palindrome(std::string const& s)\n{\n return std::equal(s.begin(), s.begin()+s.length()/2, s.rbegin());\n}\n","language":"C++"},{"code":"using System;\n\nclass Program\n{\n static string Reverse(string value)\n {\n char[] chars = value.ToCharArray();\n Array.Reverse(chars);\n return new string(chars);\n }\n\n static bool IsPalindrome(string value)\n {\n return value == Reverse(value);\n }\n\n static void Main(string[] args)\n {\n Console.WriteLine(IsPalindrome(\"ingirumimusnocteetconsumimurigni\"));\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Linq;\n\nclass Program\n{\n\tstatic bool IsPalindrome(string text)\n\t{\n\t\treturn text == new String(text.Reverse().ToArray());\n\t}\n\n\tstatic void Main(string[] args)\n\t{\n\t\tConsole.WriteLine(IsPalindrome(\"ingirumimusnocteetconsumimurigni\"));\n\t}\n}\n","language":"C-sharp"},{"code":"using System;\n\nstatic class Program\n{\n //As an extension method (must be declared in a static class)\n static bool IsPalindrome(this string sentence)\n {\n for (int l = 0, r = sentence.Length - 1; l < r; l++, r--)\n if (sentence[l] != sentence[r]) return false;\n return true;\n }\n\n static void Main(string[] args)\n {\n Console.WriteLine(\"ingirumimusnocteetconsumimurigni\".IsPalindrome());\n }\n}\n","language":"C-sharp"},{"code":"(defn palindrome? [s]\n (= s (clojure.string/reverse s)))\n","language":"Clojure"},{"code":"(defn palindrome? [^String s]\n (loop [front 0 back (dec (.length s))]\n (or (>= front back)\n (and (= (.charAt s front) (.charAt s back))\n (recur (inc front) (dec back)))))\n","language":"Clojure"},{"code":"% Reverse a string\nstr_reverse = proc (s: string) returns (string)\n chs: array[char] := array[char]$predict(0, string$size(s))\n for c: char in string$chars(s) do\n array[char]$addl(chs, c)\n end\n return (string$ac2s(chs))\nend str_reverse\n\n% 'Normalize' a string (remove everything but letters and make uppercase)\nnormalize = proc (s: string) returns (string)\n chs: array[char] := array[char]$predict(0, string$size(s))\n for c: char in string$chars(s) do\n if c>='a' cand c<='z' then\n c := char$i2c(char$c2i(c) - 32)\n end\n if c>='A' cand c<='Z' then\n array[char]$addh(chs, c)\n end\n end\n return (string$ac2s(chs))\nend normalize\n\n% Check if a string is an exact palindrome\npalindrome = proc (s: string) returns (bool)\n return (s = str_reverse(s))\nend palindrome\n\n% Check if a string is an inexact palindrome\ninexact_palindrome = proc (s: string) returns (bool)\n return (palindrome(normalize(s)))\nend inexact_palindrome\n\n% Test cases\nstart_up = proc ()\n po: stream := stream$primary_output()\n tests: array[string] := array[string]$[\n \"rotor\", \"racecar\", \"RACEcar\", \"level\", \"rosetta\",\n \"A man, a plan, a canal: Panama\",\n \"Egad, a base tone denotes a bad age\",\n \"This is not a palindrome\"\n ]\n\n for test: string in array[string]$elements(tests) do\n stream$puts(po, \"\\\"\" || test || \"\\\": \")\n if palindrome(test) then\n stream$putl(po, \"exact palindrome\")\n elseif inexact_palindrome(test) then\n stream$putl(po, \"inexact palindrome\")\n else\n stream$putl(po, \"not a palindrome\")\n end\n end\nend start_up\n","language":"CLU"},{"code":" identification division.\n function-id. palindromic-test.\n\n data division.\n linkage section.\n 01 test-text pic x any length.\n 01 result pic x.\n 88 palindromic value high-value\n when set to false low-value.\n\n procedure division using test-text returning result.\n\n set palindromic to false\n if test-text equal function reverse(test-text) then\n set palindromic to true\n end-if\n\n goback.\n end function palindromic-test.\n","language":"COBOL"},{"code":" String::isPalindrome = ->\n for i in [0...@length / 2] when @[i] isnt @[@length - (i + 1)]\n return no\n yes\n\n String::stripped = -> @toLowerCase().replace /\\W/gi, ''\n\n console.log \"'#{ str }' : #{ str.stripped().isPalindrome() }\" for str in [\n 'In girum imus nocte et consumimur igni'\n 'A man, a plan, a canal: Panama!'\n 'There is no spoon.'\n ]\n","language":"CoffeeScript"},{"code":"(defun palindrome-p (s)\n (string= s (reverse s)))\n","language":"Common-Lisp"},{"code":";; Project : Palindrome detection\n\n(defun palindrome(x)\n (if (string= x (reverse x))\n (format t \"~d\" \": palindrome\" (format t x))\n (format t \"~d\" \": not palindrome\" (format t x))))\n(terpri)\n(setq x \"radar\")\n(palindrome x)\n(terpri)\n(setq x \"books\")\n(palindrome x)\n(terpri)\n","language":"Common-Lisp"},{"code":"MODULE BbtPalindrome;\nIMPORT StdLog;\n\nPROCEDURE ReverseStr(str: ARRAY OF CHAR): POINTER TO ARRAY OF CHAR;\nVAR\n\ttop,middle,i: INTEGER;\n\tc: CHAR;\n\trStr: POINTER TO ARRAY OF CHAR;\nBEGIN\n\tNEW(rStr,LEN(str$) + 1);\n\ttop := LEN(str$) - 1; middle := (top - 1) DIV 2;\n\tFOR i := 0 TO middle DO\n\t\trStr[i] := str[top - i];\n\t\trStr[top - i] := str[i];\n\tEND;\n\tIF ODD(LEN(str$)) THEN rStr[middle + 1] := str[middle + 1] END;\n\tRETURN rStr;\nEND ReverseStr;\n\nPROCEDURE IsPalindrome(str: ARRAY OF CHAR): BOOLEAN;\nBEGIN\n\tRETURN str = ReverseStr(str)$;\nEND IsPalindrome;\n\nPROCEDURE Do*;\nVAR\n\tx: CHAR;\nBEGIN\n\tStdLog.String(\"'salalas' is palindrome?:> \");\n\tStdLog.Bool(IsPalindrome(\"salalas\"));StdLog.Ln;\n\tStdLog.String(\"'madamimadam' is palindrome?:> \");\n\tStdLog.Bool(IsPalindrome(\"madamimadam\"));StdLog.Ln;\n\tStdLog.String(\"'abcbda' is palindrome?:> \");\n\tStdLog.Bool(IsPalindrome(\"abcbda\"));StdLog.Ln;\nEND Do;\nEND BbtPalindrome.\n","language":"Component-Pascal"},{"code":"include \"cowgol.coh\";\n\n# Check if a string is a palindrome\nsub palindrome(word: [uint8]): (r: uint8) is\n r := 1;\n\n # empty string is a palindrome\n if [word] == 0 then\n return;\n end if;\n\n # find the end of the word\n var end_ := word;\n while [@next end_] != 0 loop\n end_ := @next end_;\n end loop;\n\n # check if bytes match in both directions\n while word < end_ loop\n if [word] != [end_] then\n r := 0;\n return;\n end if;\n word := @next word;\n end_ := @prev end_;\n end loop;\nend sub;\n\n# Check if a string is an inexact palindrome\nsub inexact(word: [uint8]): (r: uint8) is\n var buf: uint8[256];\n var ptr := &buf[0];\n # filter non-letters and non-numbers\n while [word] != 0 loop\n var c := [word];\n if (c >= 'a' and c <= 'z') or (c >= '0' and c <= '9') then\n # copy lowercase letters and numbers over verbatim\n [ptr] := c;\n ptr := @next ptr;\n elseif c >= 'A' and c <= 'Z' then\n # make uppercase letters lowercase\n [ptr] := c | 32;\n ptr := @next ptr;\n end if;\n word := @next word;\n end loop;\n [ptr] := 0;\n r := palindrome(&buf[0]);\nend sub;\n\nvar tests: [uint8][] := {\n \"civic\", \"level\", \"racecar\",\n \"A man, a plan, a canal: Panama\",\n \"Egad, a base tone denotes a bad age\",\n \"There is no spoon.\"\n};\n\nvar i: @indexof tests := 0;\nwhile i < @sizeof tests loop\n print(tests[i]);\n print(\": \");\n if palindrome(tests[i]) == 1 then\n print(\"exact palindrome\\n\");\n elseif inexact(tests[i]) == 1 then\n print(\"inexact palindrome\\n\");\n else\n print(\"not a palindrome\\n\");\n end if;\n i := i + 1;\nend loop;\n","language":"Cowgol"},{"code":"def palindrome(s)\n s == s.reverse\nend\n","language":"Crystal"},{"code":"def palindrome_imperative(s) : Bool\n mid = s.size // 2\n last = s.size - 1\n (0...mid).each do |i|\n if s[i] != s[last - i]\n return false\n end\n end\n\n true\nend\n","language":"Crystal"},{"code":"def palindrome_2(s)\n mid = s.size // 2\n mid.times { |j| return false if s[j] != s[-1 - j] }\n true\nend\n","language":"Crystal"},{"code":"require \"benchmark\"\nBenchmark.ips do |x|\n x.report(\"declarative\") { palindrome(\"hannah\") }\n x.report(\"imperative1\") { palindrome_imperative(\"hannah\")}\n x.report(\"imperative2\") { palindrome_2(\"hannah\")}\nend\n","language":"Crystal"},{"code":"import std.traits, std.algorithm;\n\nbool isPalindrome1(C)(in C[] s) pure /*nothrow*/\nif (isSomeChar!C) {\n auto s2 = s.dup;\n s2.reverse(); // works on Unicode too, not nothrow.\n return s == s2;\n}\n\nvoid main() {\n alias pali = isPalindrome1;\n assert(pali(\"\"));\n assert(pali(\"z\"));\n assert(pali(\"aha\"));\n assert(pali(\"sees\"));\n assert(!pali(\"oofoe\"));\n assert(pali(\"deified\"));\n assert(!pali(\"Deified\"));\n assert(pali(\"amanaplanacanalpanama\"));\n assert(pali(\"ingirumimusnocteetconsumimurigni\"));\n assert(pali(\"salà las\"));\n}\n","language":"D"},{"code":"import std.traits;\n\nbool isPalindrome2(C)(in C[] s) pure if (isSomeChar!C) {\n dchar[] dstr;\n foreach (dchar c; s) // not nothrow\n dstr ~= c;\n\n for (int i; i < dstr.length / 2; i++)\n if (dstr[i] != dstr[$ - i - 1])\n return false;\n return true;\n}\n\nvoid main() {\n alias isPalindrome2 pali;\n assert(pali(\"\"));\n assert(pali(\"z\"));\n assert(pali(\"aha\"));\n assert(pali(\"sees\"));\n assert(!pali(\"oofoe\"));\n assert(pali(\"deified\"));\n assert(!pali(\"Deified\"));\n assert(pali(\"amanaplanacanalpanama\"));\n assert(pali(\"ingirumimusnocteetconsumimurigni\"));\n assert(pali(\"salà las\"));\n}\n","language":"D"},{"code":"import std.stdio, core.exception, std.traits;\n\n// assume alloca() to be pure for this program\nextern(C) pure nothrow void* alloca(in size_t size);\n\nbool isPalindrome3(C)(in C[] s) pure if (isSomeChar!C) {\n auto p = cast(dchar*)alloca(s.length * 4);\n if (p == null)\n // no fallback heap allocation used\n throw new OutOfMemoryError();\n dchar[] dstr = p[0 .. s.length];\n\n // use std.utf.stride for an even lower level version\n int i = 0;\n foreach (dchar c; s) { // not nothrow\n dstr[i] = c;\n i++;\n }\n dstr = dstr[0 .. i];\n\n foreach (j; 0 .. dstr.length / 2)\n if (dstr[j] != dstr[$ - j - 1])\n return false;\n return true;\n}\n\nvoid main() {\n alias isPalindrome3 pali;\n assert(pali(\"\"));\n assert(pali(\"z\"));\n assert(pali(\"aha\"));\n assert(pali(\"sees\"));\n assert(!pali(\"oofoe\"));\n assert(pali(\"deified\"));\n assert(!pali(\"Deified\"));\n assert(pali(\"amanaplanacanalpanama\"));\n assert(pali(\"ingirumimusnocteetconsumimurigni\"));\n assert(pali(\"salà las\"));\n}\n","language":"D"},{"code":"bool isPalindrome4(in string str) pure nothrow {\n if (str.length == 0) return true;\n immutable(char)* s = str.ptr;\n immutable(char)* t = &(str[$ - 1]);\n while (s < t)\n if (*s++ != *t--) // ugly\n return false;\n return true;\n}\n\nvoid main() {\n alias isPalindrome4 pali;\n assert(pali(\"\"));\n assert(pali(\"z\"));\n assert(pali(\"aha\"));\n assert(pali(\"sees\"));\n assert(!pali(\"oofoe\"));\n assert(pali(\"deified\"));\n assert(!pali(\"Deified\"));\n assert(pali(\"amanaplanacanalpanama\"));\n assert(pali(\"ingirumimusnocteetconsumimurigni\"));\n //assert(pali(\"salà las\"));\n}\n","language":"D"},{"code":"bool isPalindrome(String s){\n for(int i = 0; i < s.length/2;i++){\n if(s[i] != s[(s.length-1) -i])\n return false;\n }\n return true;\n}\n","language":"Dart"},{"code":"uses\n SysUtils, StrUtils;\n\nfunction IsPalindrome(const aSrcString: string): Boolean;\nbegin\n Result := SameText(aSrcString, ReverseString(aSrcString));\nend;\n","language":"Delphi"},{"code":"func isPalindrom(str) {\n str == str.Reverse()\n}\n\nprint(isPalindrom(\"ingirumimusnocteetconsumimurigni\"))\n","language":"Dyalect"},{"code":"def isPalindrome(string :String) {\n def upper := string.toUpperCase()\n def last := upper.size() - 1\n for i => c ? (upper[last - i] != c) in upper(0, upper.size() // 2) {\n return false\n }\n return true\n}\n","language":"E"},{"code":"func$ reverse s$ .\n a$[] = strchars s$\n for i = 1 to len a$[] div 2\n swap a$[i] a$[len a$[] - i + 1]\n .\n return strjoin a$[]\n.\nfunc palin s$ .\n if s$ = reverse s$\n return 1\n .\n return 0\n.\nfor s$ in [ \"rotor\" \"rosetta\" \"step on no pets\" \"été\" \"🦊😀🦊\" ]\n if palin s$ = 1\n print s$ & \" is a palindrome\"\n else\n print s$ & \" is not a palindrome\"\n .\n.\n","language":"EasyLang"},{"code":";; returns #t or #f\n(define (palindrome? string)\n(equal? (string->list string) (reverse (string->list string))))\n\n;; to strip spaces, use the following\n;;(define (palindrome? string)\n;;(let ((string (string-replace string \"/\\ /\" \"\" \"g\")))\n;;(equal? (string->list string) (reverse (string->list string)))))\n","language":"EchoLisp"},{"code":"\tis_palindrome (a_string: STRING): BOOLEAN\n\t\t\t-- Is `a_string' a palindrome?\n\t\trequire\n\t\t\tstring_attached: a_string /= Void\n\t\tlocal\n\t\t\tl_index, l_count: INTEGER\n\t\tdo\n\t\t\tfrom\n\t\t\t\tResult := True\n\t\t\t\tl_index := 1\n\t\t\t\tl_count := a_string.count\n\t\t\tuntil\n\t\t\t\tl_index >= l_count - l_index + 1 or not Result\n\t\t\tloop\n\t\t\t\tResult := (Result and a_string [l_index] = a_string [l_count - l_index + 1])\n\t\t\t\tl_index := l_index + 1\n\t\t\tend\n\t\tend\n","language":"Eiffel"},{"code":"open list string\n\nisPalindrome xs = xs == reverse xs\nisPalindrome <| toList \"ingirumimusnocteetconsumimurigni\"\n","language":"Ela"},{"code":"reverse = foldl (flip (::)) (nil xs)\n\nfoldl f z (x::xs) = foldl f (f z x) xs\nfoldl _ z [] = z\n","language":"Ela"},{"code":"defmodule PalindromeDetection do\n def is_palindrome(str), do: str == String.reverse(str)\nend\n","language":"Elixir"},{"code":"import String exposing (reverse, length)\nimport Html exposing (Html, Attribute, text, div, input)\nimport Html.Attributes exposing (placeholder, value, style)\nimport Html.Events exposing (on, targetValue)\nimport Html.App exposing (beginnerProgram)\n\n-- The following function (copied from Haskell) satisfies the\n-- rosettacode task description.\nis_palindrome x = x == reverse x\n\n-- The remainder of the code demonstrates the use of the function\n-- in a complete Elm program.\nmain = beginnerProgram { model = \"\" , view = view , update = update }\n\nupdate newStr oldStr = newStr\n\nview : String -> Html String\nview candidate =\n div []\n ([ input\n [ placeholder \"Enter a string to check.\"\n , value candidate\n , on \"input\" targetValue\n , myStyle\n ]\n []\n ] ++\n [ let testResult =\n is_palindrome candidate\n\n statement =\n if testResult then \"PALINDROME!\" else \"not a palindrome\"\n\n in div [ myStyle] [text statement]\n ])\n\nmyStyle : Attribute msg\nmyStyle =\n style\n [ (\"width\", \"100%\")\n , (\"height\", \"20px\")\n , (\"padding\", \"5px 0 0 5px\")\n , (\"font-size\", \"1em\")\n , (\"text-align\", \"left\")\n ]\n","language":"Elm"},{"code":"(defun palindrome (s)\n (string= s (reverse s)))\n","language":"Emacs-Lisp"},{"code":"-module( palindrome ).\n\n-export( [is_palindrome/1, task/0] ).\n\nis_palindrome( String ) -> String =:= lists:reverse(String).\n\ntask() ->\n\tdisplay( \"abcba\" ),\n\tdisplay( \"abcdef\" ),\n\tLatin = \"In girum imus nocte et consumimur igni\",\n\tNo_spaces_same_case = lists:append( string:tokens(string:to_lower(Latin), \" \") ),\n\tdisplay( Latin, No_spaces_same_case ).\n\n\n\ndisplay( String ) -> io:fwrite( \"Is ~p a palindrom? ~p~n\", [String, is_palindrome(String)] ).\n\ndisplay( String1, String2 ) -> io:fwrite( \"Is ~p a palindrom? ~p~n\", [String1, is_palindrome(String2)] ).\n","language":"Erlang"},{"code":"function isPalindrome(sequence s)\n for i = 1 to length(s)/2 do\n if s[i] != s[$-i+1] then\n return 0\n end if\n end for\n return 1\nend function\n","language":"Euphoria"},{"code":"include std/sequence.e -- reverse\ninclude std/console.e -- display\ninclude std/text.e -- upper\ninclude std/utils.e -- iif\n\nIsPalindrome(\"abcba\")\nIsPalindrome(\"abcdef\")\nIsPalindrome(\"In girum imus nocte et consumimur igni\")\n\nprocedure IsPalindrome(object s)\n display(\"Is '[]' a palindrome? \",{s},0)\n s = remove_all(' ',upper(s))\n display(iif(equal(s,reverse(s)),\"true\",\"false\"))\nend procedure\n","language":"Euphoria"},{"code":"ISPALINDROME\n=LAMBDA(s,\n LET(\n lcs, FILTERP(\n LAMBDA(c, \" \" <> c)\n )(\n CHARS(LOWER(s))\n ),\n CONCAT(lcs) = CONCAT(REVERSE(lcs))\n )\n)\n","language":"Excel"},{"code":"CHARS\n=LAMBDA(s,\n MID(s, ROW(INDIRECT(\"1:\" & LEN(s))), 1)\n)\n\n\nFILTERP\n=LAMBDA(p,\n LAMBDA(xs,\n FILTER(xs, p(xs))\n )\n)\n\n\nREVERSE\n=LAMBDA(xs,\n LET(\n n, ROWS(xs),\n SORTBY(\n xs,\n SEQUENCE(n, 1, n, -1)\n )\n )\n)\n","language":"Excel"},{"code":"let isPalindrome (s: string) =\n let arr = s.ToCharArray()\n arr = Array.rev arr\n","language":"F-Sharp"},{"code":"isPalindrome \"abcba\"\nval it : bool = true\nisPalindrome (\"In girum imus nocte et consumimur igni\".Replace(\" \", \"\").ToLower());;\nval it : bool = true\nisPalindrome \"abcdef\"\nval it : bool = false\n","language":"F-Sharp"},{"code":"USING: kernel sequences ;\n: palindrome? ( str -- ? ) dup reverse = ;\n","language":"Factor"},{"code":"/* created by Aykayayciti Earl Lamont Montgomery\nApril 9th, 2018 */\n\nfunction is_palindrome(a)\n\ta = strUpper(a).replace(\" \", \"\")\n\tb = a[-1:0]\n\treturn b == a\nend\n\na = \"mom\"\n> is_palindrome(a)\n","language":"Falcon"},{"code":"/* created by Aykayayciti Earl Lamont Montgomery\nApril 9th, 2018 */\n\nb = \"mom\"\n> strUpper(b).replace(\" \", \"\") == strUpper(b[-1:0]) ? \"Is a palindrome\" : \"Is not a palindrome\"\n","language":"Falcon"},{"code":"class Palindrome\n{\n // Function to test if given string is a palindrome\n public static Bool isPalindrome (Str str)\n {\n str == str.reverse\n }\n\n // Give it a test run\n public static Void main ()\n {\n echo (isPalindrome(\"\"))\n echo (isPalindrome(\"a\"))\n echo (isPalindrome(\"aa\"))\n echo (isPalindrome(\"aba\"))\n echo (isPalindrome(\"abb\"))\n echo (isPalindrome(\"salàlas\"))\n echo (isPalindrome(\"In girum imus nocte et consumimur igni\".lower.replace(\" \",\"\")))\n }\n}\n","language":"Fantom"},{"code":"#APPTYPE CONSOLE\n\nFUNCTION stripNonAlpha(BYVAL s AS STRING) AS STRING\n\tDIM sTemp AS STRING = \"\"\n\tDIM c AS STRING\n\tFOR DIM i = 1 TO LEN(s)\n\t\tc = MID(s, i, 1)\n\t\tIF INSTR(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\", c, 0, 1) THEN\n\t\t\tsTemp = stemp & c\n\t\tEND IF\n\tNEXT\n\tRETURN sTemp\nEND FUNCTION\n\nFUNCTION IsPalindrome(BYVAL s AS STRING) AS INTEGER\n\tFOR DIM i = 1 TO STRLEN(s) \\ 2 ' only check half of the string, as scanning from both ends\n\t\tIF s{i} <> s{STRLEN - (i - 1)} THEN RETURN FALSE 'comparison is not case sensitive\n\tNEXT\n\t\n\tRETURN TRUE\nEND FUNCTION\n\nPRINT IsPalindrome(stripNonAlpha(\"A Toyota\"))\nPRINT IsPalindrome(stripNonAlpha(\"Madam, I'm Adam\"))\nPRINT IsPalindrome(stripNonAlpha(\"the rain in Spain falls mainly on the rooftops\"))\n\nPAUSE\n","language":"FBSL"},{"code":": first over c@ ;\n: last >r 2dup + 1- c@ r> swap ;\n: palindrome? ( c-addr u -- f )\n begin\n dup 1 <= if 2drop true exit then\n first last <> if 2drop false exit then\n 1 /string 1-\n again ;\n","language":"Forth"},{"code":"variable temp-addr\n\n: valid-char? ( addr1 u -- f ) ( check for valid character )\n + dup C@ 48 58 within\n over C@ 65 91 within or\n swap C@ 97 123 within or ;\n\n: >upper ( c1 -- c2 )\n dup 97 123 within if 32 - then ;\n\n: strip-input ( addr1 u -- addr2 u ) ( Strip characters, then copy stripped string to temp-addr )\n pad temp-addr !\n temp-addr @ rot rot 0 do dup I 2dup valid-char? if\n + C@ >upper temp-addr @ C! 1 temp-addr +!\n else 2drop\n then loop drop temp-addr @ pad - ;\n\n: get-phrase ( -- addr1 u )\n .\" Type a phrase: \" here 1024 accept here swap -trailing cr ;\n\n: position-phrase ( addr1 u -- addr1 u addr2 u addr1 addr2 u )\n temp-addr @ over 2over 2over drop swap ;\n\n: reverse-copy ( addr1 addr2 u -- addr1 addr2 )\n 0 do over I' 1- I - + over I + 1 cmove loop 2drop ;\n\n: palindrome? ( -- )\n get-phrase strip-input position-phrase reverse-copy compare 0= if\n .\" << Valid >> Palindrome.\"\n else .\" << Not >> a Palindrome.\"\n then cr ;\n","language":"Forth"},{"code":"program palindro\n\n implicit none\n\n character(len=*), parameter :: p = \"ingirumimusnocteetconsumimurigni\"\n\n print *, is_palindro_r(p)\n print *, is_palindro_r(\"anothertest\")\n print *, is_palindro2(p)\n print *, is_palindro2(\"test\")\n print *, is_palindro(p)\n print *, is_palindro(\"last test\")\n\ncontains\n","language":"Fortran"},{"code":"! non-recursive\nfunction is_palindro(t)\n logical :: is_palindro\n character(len=*), intent(in) :: t\n\n integer :: i, l\n\n l = len(t)\n is_palindro = .false.\n do i=1, l/2\n if ( t(i:i) /= t(l-i+1:l-i+1) ) return\n end do\n is_palindro = .true.\nend function is_palindro\n\n! non-recursive 2\nfunction is_palindro2(t) result(isp)\n logical :: isp\n character(len=*), intent(in) :: t\n\n character(len=len(t)) :: s\n integer :: i\n\n forall(i=1:len(t)) s(len(t)-i+1:len(t)-i+1) = t(i:i)\n isp = ( s == t )\nend function is_palindro2\n","language":"Fortran"},{"code":" recursive function is_palindro_r (t) result (isp)\n\n implicit none\n character (*), intent (in) :: t\n logical :: isp\n\n isp = len (t) == 0 .or. t (: 1) == t (len (t) :) .and. is_palindro_r (t (2 : len (t) - 1))\n\n end function is_palindro_r\n","language":"Fortran"},{"code":"end program palindro\n","language":"Fortran"},{"code":"' version 20-06-2015\n' compile with: fbc -s console \"filename\".bas\n\n#Ifndef TRUE ' define true and false for older freebasic versions\n #Define FALSE 0\n #Define TRUE Not FALSE\n#EndIf\n\nFunction reverse(norm As String) As Integer\n\n Dim As String rev\n Dim As Integer i, l = Len(norm) -1\n\n rev = norm\n For i = 0 To l\n rev[l-i] = norm[i]\n Next\n\n If norm = rev Then\n Return TRUE\n Else\n Return FALSE\n End If\n\nEnd Function\n\nFunction cleanup(in As String, action As String = \"\") As String\n ' action = \"\" do nothing, [l|L] = convert to lowercase,\n ' [s|S] = strip spaces, [p|P] = strip punctuation.\n If action = \"\" Then Return in\n\n Dim As Integer i, p_, s_\n Dim As String ch\n\n action = LCase(action)\n For i = 1 To Len(action)\n ch = Mid(action, i, 1)\n If ch = \"l\" Then in = LCase(in)\n If ch = \"p\" Then\n p_ = 1\n ElseIf ch = \"s\" Then\n s_ = 1\n End If\n Next\n\n If p_ = 0 And s_ = 0 Then Return in\n\n Dim As String unwanted, clean\n\n If s_ = 1 Then unwanted = \" \"\n If p_ = 1 Then unwanted = unwanted + \"`~!@#$%^&*()-=_+[]{}\\|;:',.<>/?\"\n\n For i = 1 To Len(in)\n ch = Mid(in, i, 1)\n If InStr(unwanted, ch) = 0 Then clean = clean + ch\n Next\n\n Return clean\n\nEnd Function\n\n' ------=< MAIN >=------\n\nDim As String test = \"In girum imus nocte et consumimur igni\"\n'IIf ( cond, true, false ), true and false must be of the same type (num, string, UDT)\nPrint\nPrint \" reverse(test) = \"; IIf(reverse(test) = FALSE, \"FALSE\", \"TRUE\")\nPrint \" reverse(cleanup(test,\"\"l\"\")) = \"; IIf(reverse(cleanup(test,\"l\")) = FALSE, \"FALSE\", \"TRUE\")\nPrint \" reverse(cleanup(test,\"\"ls\"\")) = \"; IIf(reverse(cleanup(test,\"ls\")) = FALSE, \"FALSE\", \"TRUE\")\nPrint \"reverse(cleanup(test,\"\"PLS\"\")) = \"; IIf(reverse(cleanup(test,\"PLS\")) = FALSE, \"FALSE\", \"TRUE\")\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print : Print \"Hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"isPalindrome[x] := x == reverse[x]\n","language":"Frink"},{"code":"isPalindrome[\"x\\u{1f638}x\"]\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nlocal fn IsCleanStringPalindrome( testStr as CFStringRef ) as BOOL\n NSUInteger i\n BOOL result = NO\n\n NSUInteger strLen = len(testStr)\n for i = 0 to strLen / 2\n if ( fn StringCharacterAtIndex( testStr, i ) != fn StringCharacterAtIndex( testStr, strLen -i -1 ) )\n result = NO\n exit fn\n end if\n next\n result = YES\nend fn = result\n\nlocal fn IsDirtyStringPalindrome( dirtyStr as CFStringRef )\n BOOL result = NO\n CFStringRef tempStr\n\n CFStringRef lowerCaseStr = fn StringLowercaseString( dirtyStr )\n CFStringRef removeStr = @\"!\\\"#$%&'()*+,-./:;<=>?@[]^_ {|}~\"\n NSUInteger i, count = len(removeStr)\n\n tempStr = lowerCaseStr\n for i = 0 to count -1\n CFStringRef chrStr = fn StringWithFormat( @\"%c\", fn StringCharacterAtIndex( removeStr, i ) )\n tempStr = fn StringByReplacingOccurrencesOfString( tempStr, chrStr, @\"\" )\n next\n result = fn IsCleanStringPalindrome( tempStr )\nend fn = result\n\n\nlocal fn PalindromeTest( testStr as CFStringRef )\n BOOL result = NO\n\n result = fn IsCleanStringPalindrome( testStr )\n if ( result == YES )\n NSLog( @\"%17s : %@\", fn StringUTF8String( @\"Clean palindrome\" ), testStr ) : exit fn\n else\n result = fn IsDirtyStringPalindrome( testStr )\n if ( result == YES )\n NSLog( @\"%17s : %@\", fn StringUTF8String( @\"Dirty palindrome\" ), testStr ) : exit fn\n else\n NSLog( @\"%17s : %@\", fn StringUTF8String( @\"Not a palindrome\" ), testStr )\n end if\n end if\nend fn\n\nfn PalindromeTest( @\"racecar\" )\nfn PalindromeTest( @\"level\" )\nfn PalindromeTest( @\"rosetta\" )\nfn PalindromeTest( @\"rotavator\" )\nfn PalindromeTest( @\"13231+464+989=989+464+13231\" )\nfn PalindromeTest( @\"Was it a car or a cat I saw?\" )\nfn PalindromeTest( @\"Did Hannah see bees? Hannah did.\" )\nfn PalindromeTest( @\"This sentence is not a palindrome.\" )\nfn PalindromeTest( @\"123 456 789 897 654 321\" )\nfn PalindromeTest( @\"123 456 789 987 654 321\" )\nfn PalindromeTest( @\"Radar\" )\nfn PalindromeTest( @\"abba\" )\nfn PalindromeTest( @\"boom \" )\nfn PalindromeTest( @\"radar\" )\nfn PalindromeTest( @\"civic\" )\nfn PalindromeTest( @\"great\" )\nfn PalindromeTest( @\"Madam, I'm Adam.\" )\nfn PalindromeTest( @\"salàla\" )\nfn PalindromeTest( @\"A man, a plan, a canal: Panama\" )\nfn PalindromeTest( @\"a man a plan a canal panama\" )\nfn PalindromeTest( @\"Egad, a base tone denotes a bad age\" )\nfn PalindromeTest( @\"In girum imus nocte et consumimur igni\" )\nfn PalindromeTest( @\"sees\" )\nfn PalindromeTest( @\"solo\" )\nfn PalindromeTest( @\"solos\" )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"ZapGremlins := function(s)\n local upper, lower, c, i, n, t;\n upper := \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n lower := \"abcdefghijklmnopqrstuvwxyz\";\n t := [ ];\n i := 1;\n for c in s do\n n := Position(upper, c);\n if n <> fail then\n t[i] := lower[n];\n i := i + 1;\n else\n n := Position(lower, c);\n if n <> fail then\n t[i] := c;\n i := i + 1;\n fi;\n fi;\n od;\n return t;\nend;\n\nIsPalindrome := function(s)\n local t;\n t := ZapGremlins(s);\n return t = Reversed(t);\nend;\n","language":"GAP"},{"code":"//Setting a var from an argument passed to the script\nvar str;\nstr = argument0\n//Takes out all spaces/anything that is not a letter or a number and turns uppercase letters to lowercase\nstr = string_lettersdigits(string_lower(string_replace(str,' ','')));\nvar inv;\ninv = '';\n//for loop that reverses the sequence\nvar i;\nfor (i = 0; i < string_length(str); i += 1;)\n {\n inv += string_copy(str,string_length(str)-i,1);\n }\n//returns true if the sequence is a palindrome else returns false\nreturn (str == inv);\n","language":"GML"},{"code":"//Remove everything except for letters and digits and convert the string to lowercase. source is what will be compared to str.\nvar str = string_lower(string_lettersdigits(string_replace(argument0,\" \",\"\"))), source = \"\";\n\n//Loop through and store each character of str in source.\nfor (var i = string_length(str); i > 0; i--) {\n source += string_char_at(str,i);\n}\n\n//Return if it is a palindrome.\nreturn source == str;\n","language":"GML"},{"code":"package pal\n\nfunc IsPal(s string) bool {\n mid := len(s) / 2\n last := len(s) - 1\n for i := 0; i < mid; i++ {\n if s[i] != s[last-i] {\n return false\n }\n }\n return true\n}\n","language":"Go"},{"code":"func isPalindrome(s string) bool {\n\trunes := []rune(s)\n\tnumRunes := len(runes) - 1\n\tfor i := 0; i < len(runes)/2; i++ {\n\t\tif runes[i] != runes[numRunes-i] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n","language":"Go"},{"code":"func isPalindrome(s string) bool {\n\trunes := []rune(s)\n\tfor len(runes) > 1 {\n\t\tif runes[0] != runes[len(runes)-1] {\n\t\t\treturn false\n\t\t}\n\t\trunes = runes[1 : len(runes)-1]\n\t}\n\treturn true\n}\n","language":"Go"},{"code":"{.,1>{(\\)@={pal}0if}1if\\;}:pal;\n","language":"Golfscript"},{"code":"\"ABBA\" pal\n\"a\" pal\n\"13231+464+989=989+464+13231\" pal\n\"123 456 789 897 654 321\" pal\n","language":"Golfscript"},{"code":"def isPalindrome = { String s ->\n s == s?.reverse()\n}\n","language":"Groovy"},{"code":"println isPalindrome(\"\")\nprintln isPalindrome(\"a\")\nprintln isPalindrome(\"abcdefgfedcba\")\nprintln isPalindrome(\"abcdeffedcba\")\nprintln isPalindrome(\"abcedfgfedcb\")\n","language":"Groovy"},{"code":"def isPalindrome = { String s ->\n def n = s.size()\n n < 2 || s[0..<n/2] == s[-1..(-n/2)]\n}\n","language":"Groovy"},{"code":"def isPalindrome\nisPalindrome = { String s ->\n def n = s.size()\n n < 2 || (s[0] == s[n-1] && isPalindrome(s[1..<(n-1)]))\n}\n","language":"Groovy"},{"code":"is_palindrome x = x == reverse x\n","language":"Haskell"},{"code":"import Data.Bifunctor (second)\nimport Data.Char (toLower)\n\n------------------- PALINDROME DETECTION -----------------\n\nisPalindrome :: Eq a => [a] -> Bool\nisPalindrome = (==) <*> reverse\n\n-- Or, comparing just the leftward characters with\n-- with a reflection of just the rightward characters.\n\nisPal :: String -> Bool\nisPal s =\n let (q, r) = quotRem (length s) 2\n in uncurry (==) $\n second (reverse . drop r) $ splitAt q s\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n mapM_ putStrLn $\n (showResult <$> [isPalindrome, isPal])\n <*> fmap\n prepared\n [ \"\",\n \"a\",\n \"ab\",\n \"aba\",\n \"abba\",\n \"In girum imus nocte et consumimur igni\"\n ]\n\nprepared :: String -> String\nprepared cs = [toLower c | c <- cs, ' ' /= c]\n\nshowResult f s = (show s) <> \" -> \" <> show (f s)\n","language":"Haskell"},{"code":"is_palindrome_r x | length x <= 1 = True\n | head x == last x = is_palindrome_r . tail. init $ x\n | otherwise = False\n","language":"Haskell"},{"code":" result = Palindrome( \"In girum imus nocte et consumimur igni\" ) ! returns 1\nEND\n\nFUNCTION Palindrome(string)\n CHARACTER string, CopyOfString\n\n L = LEN(string)\n ALLOCATE(CopyOfString, L)\n CopyOfString = string\n EDIT(Text=CopyOfString, UpperCase=L)\n L = L - EDIT(Text=CopyOfString, End, Left=' ', Delete, DO=L) ! EDIT returns number of deleted spaces\n\n DO i = 1, L/2\n Palindrome = CopyOfString(i) == CopyOfString(L - i + 1)\n IF( Palindrome == 0 ) RETURN\n ENDDO\nEND\n","language":"HicEst"},{"code":"procedure main(arglist)\nevery writes(s := !arglist) do write( if palindrome(s) then \" is \" else \" is not\", \" a palindrome.\")\nend\n","language":"Icon"},{"code":"procedure palindrome(s) #: return s if s is a palindrome\nreturn s == reverse(s)\nend\n","language":"Icon"},{"code":"procedure palindrome(x) #: return x if s is x palindrome\nlocal i\nevery if x[i := 1 to (*x+ 1)/2] ~== x[-i] then fail\nreturn x\nend\n","language":"Icon"},{"code":"(var palindrome? (= (reverse %)))\n\n(palindrome? \"deified\") ;returns true\n","language":"Insitux"},{"code":"(var palindrome? (comp (filter letter?) lower-case (= (reverse %))))\n\n(palindrome? \"In girum imus nocte et consumimur igni.\") ;returns true\n","language":"Insitux"},{"code":"Text isPalindrome? = method(self chars == self chars reverse)\n","language":"Ioke"},{"code":"100 PROGRAM \"Palindr.bas\"\n110 LINE INPUT PROMPT \"Text: \":TX$\n120 PRINT \"\"\"\";TX$;\"\"\" is \";\n130 IF PALIND(TX$) THEN\n140 PRINT \"a palindrome.\"\n150 ELSE\n160 PRINT \"not a palindrome.\"\n170 END IF\n180 DEF TRIM$(TX$)\n190 LET T$=\"\"\n200 FOR I=1 TO LEN(TX$)\n210 IF TX$(I)>=\"A\" AND TX$(I)<=\"Z\" THEN LET T$=T$&TX$(I)\n220 NEXT\n230 LET TRIM$=T$\n240 END DEF\n250 DEF PALIND(TX$)\n260 LET PALIND=-1:LET TX$=TRIM$(UCASE$(TX$))\n270 FOR I=1 TO LEN(TX$)/2\n280 IF TX$(I)<>TX$(LEN(TX$)-I+1) THEN LET PALIND=0:EXIT FOR\n290 NEXT\n300 END DEF\n","language":"IS-BASIC"},{"code":"isPalin0=: -: |.\n","language":"J"},{"code":" isPalin0 'ABBA'\n1\n isPalin0 -.&' ' tolower 'In girum imus nocte et consumimur igni'\n1\n","language":"J"},{"code":"isPalin1=: 0:`($:@(}.@}:))@.({.={:)`1:@.(1>:#)\n\nisPalin2=: monad define\n if. 1>:#y do. 1 return. end.\n if. ({.={:)y do. isPalin2 }.}:y else. 0 end.\n)\n","language":"J"},{"code":" foo=: foo,|.foo=:2000$a.\n ts=:6!:2,7!:2 NB. time and space required to execute sentence\n ts 'isPalin0 foo'\n2.73778e_5 5184\n ts 'isPalin1 foo'\n0.0306667 6.0368e6\n ts 'isPalin2 foo'\n0.104391 1.37965e7\n 'isPalin1 foo' %&ts 'isPalin0 foo'\n1599.09 1164.23\n 'isPalin2 foo' %&ts 'isPalin0 foo'\n3967.53 2627.04\n","language":"J"},{"code":"fn is_palindrome(anon string: String) throws -> bool {\n mut points: [u32] = []\n for point in string.code_points() {\n points.push(point)\n }\n\n mut i: usize = 0\n while i < points.size() / 2 {\n if points[i] != points[points.size() - 1 - i] {\n return false\n }\n i++\n }\n return true\n}\n\nfn main() {\n println(\"{}\", is_palindrome(\"amanaplanacanalpanama\"))\n println(\"{}\", is_palindrome(\"madamimadam\"))\n println(\"{}\", is_palindrome(\"madamimddam\"))\n println(\"{}\", is_palindrome(\"私は私\"))\n}\n","language":"Jakt"},{"code":"public static boolean pali(String testMe){\n\tStringBuilder sb = new StringBuilder(testMe);\n\treturn testMe.equals(sb.reverse().toString());\n}\n","language":"Java"},{"code":"public static boolean isPalindrome(String input) {\n\tfor (int i = 0, j = input.length() - 1; i < j; i++, j--) {\n\t\tchar startChar = input.charAt(i);\n\t\tchar endChar = input.charAt(j);\n\n\t\t// Handle surrogate pairs in UTF-16\n\t\tif (Character.isLowSurrogate(endChar)) {\n\t\t\tif (startChar != input.charAt(--j)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (input.charAt(++i) != endChar) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t} else if (startChar != endChar) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n","language":"Java"},{"code":"public static boolean rPali(String testMe){\n\tif(testMe.length()<=1){\n\t\treturn true;\n\t}\n\tif(!(testMe.charAt(0)+\"\").equals(testMe.charAt(testMe.length()-1)+\"\")){\n\t\treturn false;\n\t}\n\treturn rPali(testMe.substring(1, testMe.length()-1));\n}\n","language":"Java"},{"code":"public static boolean rPali(String testMe){\n\tint strLen = testMe.length();\n\treturn rPaliHelp(testMe, strLen-1, strLen/2, 0);\n}\n\npublic static boolean rPaliHelp(String testMe, int strLen, int testLen, int index){\n\tif(index > testLen){\n\t\treturn true;\n\t}\n\tif(testMe.charAt(index) != testMe.charAt(strLen-index)){\n\t\treturn false;\n\t}\n\treturn rPaliHelp(testMe, strLen, testLen, index + 1);\n}\n","language":"Java"},{"code":"public static boolean pali(String testMe){\n\treturn testMe.matches(\"|(?:(.)(?<=(?=^.*?(\\\\1\\\\2?)$).*))+(?<=(?=^\\\\2$).*)\");\n}\n","language":"Java"},{"code":"function isPalindrome(str) {\n return str === str.split(\"\").reverse().join(\"\");\n}\n\nconsole.log(isPalindrome(\"ingirumimusnocteetconsumimurigni\"));\n","language":"JavaScript"},{"code":"var isPal = str => str === str.split(\"\").reverse().join(\"\");\n","language":"JavaScript"},{"code":"(() => {\n\n // isPalindrome :: String -> Bool\n const isPalindrome = s => {\n const cs = filter(c => ' ' !== c, s.toLocaleLowerCase());\n return cs.join('') === reverse(cs).join('');\n };\n\n\n // TEST -----------------------------------------------\n const main = () =>\n isPalindrome(\n 'In girum imus nocte et consumimur igni'\n )\n\n // GENERIC FUNCTIONS ----------------------------------\n\n // filter :: (a -> Bool) -> [a] -> [a]\n const filter = (f, xs) => (\n 'string' !== typeof xs ? (\n xs\n ) : xs.split('')\n ).filter(f);\n\n // reverse :: [a] -> [a]\n const reverse = xs =>\n 'string' !== typeof xs ? (\n xs.slice(0).reverse()\n ) : xs.split('').reverse().join('');\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"def palindrome: explode | reverse == .;\n","language":"Jq"},{"code":"def isPalindrome:\n length as $n\n | explode as $in\n | first(range(0; $n/2)\n | select($in[.] != $in[$n - 1 - .]) )\n // false\n | not;\n","language":"Jq"},{"code":"/* Palindrome detection, in Jsish */\nfunction isPalindrome(str:string, exact:boolean=true) {\n if (!exact) {\n str = str.toLowerCase();\n str = str.replace(/[ \\t,;:!?.]/g, '');\n }\n return str === str.match(/./g).reverse().join('');\n}\n\n;isPalindrome('BUB');\n;isPalindrome('CUB');\n;isPalindrome('Bub');\n;isPalindrome('Bub', false);\n;isPalindrome('In girum imus nocte et consumimur igni', false);\n;isPalindrome('A man, a plan, a canal; Panama!', false);\n;isPalindrome('Never odd or even', false);\n\n/*\n=!EXPECTSTART!=\nisPalindrome('BUB') ==> true\nisPalindrome('CUB') ==> false\nisPalindrome('Bub') ==> false\nisPalindrome('Bub', false) ==> true\nisPalindrome('In girum imus nocte et consumimur igni', false) ==> true\nisPalindrome('A man, a plan, a canal; Panama!', false) ==> true\nisPalindrome('Never odd or even', false) ==> true\n=!EXPECTEND!=\n*/\n","language":"Jsish"},{"code":"palindrome(s) = s == reverse(s)\n","language":"Julia"},{"code":"function palindrome(s)\n len = length(s)\n for i = 1:(len/2)\n if(s[len-i+1]!=s[i])\n return false\n end\n end\n return true\nend\n","language":"Julia"},{"code":"function palindrome(s)\n len = length(s)\n if(len==0 || len==1)\n return true\n end\n if(s[1] == s[len])\n return palindrome(SubString(s,2,len-1))\n end\n return false\nend\n","language":"Julia"},{"code":"is_palindrome:{x~|x}\n","language":"K"},{"code":"// version 1.1.2\n\n/* These functions deal automatically with Unicode as all strings are UTF-16 encoded in Kotlin */\n\nfun isExactPalindrome(s: String) = (s == s.reversed())\n\nfun isInexactPalindrome(s: String): Boolean {\n var t = \"\"\n for (c in s) if (c.isLetterOrDigit()) t += c\n t = t.toLowerCase()\n return t == t.reversed()\n}\n\nfun main(args: Array<String>) {\n val candidates = arrayOf(\"rotor\", \"rosetta\", \"step on no pets\", \"été\")\n for (candidate in candidates) {\n println(\"'$candidate' is ${if (isExactPalindrome(candidate)) \"an\" else \"not an\"} exact palindrome\")\n }\n println()\n val candidates2 = arrayOf(\n \"In girum imus nocte et consumimur igni\",\n \"Rise to vote, sir\",\n \"A man, a plan, a canal - Panama!\",\n \"Ce repère, Perec\" // note: 'è' considered a distinct character from 'e'\n )\n for (candidate in candidates2) {\n println(\"'$candidate' is ${if (isInexactPalindrome(candidate)) \"an\" else \"not an\"} inexact palindrome\")\n }\n}\n","language":"Kotlin"},{"code":"val .ispal = fn(.s) len(.s) > 0 and .s == reverse .s\n\nval .tests = h{\n \"\": false,\n \"z\": true,\n \"aha\": true,\n \"αηα\": true,\n \"αννα\": true,\n \"αννασ\": false,\n \"sees\": true,\n \"seas\": false,\n \"deified\": true,\n \"solo\": false,\n \"solos\": true,\n \"amanaplanacanalpanama\": true,\n \"a man a plan a canal panama\": false, # true if we remove spaces\n \"ingirumimusnocteetconsumimurigni\": true,\n}\n\nfor .word in sort(keys .tests) {\n val .foundpal = .ispal(.word)\n writeln .word, \": \", .foundpal, if(.foundpal == .tests[.word]: \"\"; \" (FAILED TEST)\")\n}\n","language":"Langur"},{"code":"define ispalindrome(text::string) => {\n\n\tlocal(_text = string(#text)) // need to make copy to get rid of reference issues\n\n\t#_text -> replace(regexp(`(?:$|\\W)+`), -ignorecase)\n\n\tlocal(reversed = string(#_text))\n\t#reversed -> reverse\n\n\treturn #_text == #reversed\n}\n\nispalindrome('Tätatät') // works with high ascii\nispalindrome('Hello World')\n\nispalindrome('A man, a plan, a canoe, pasta, heros, rajahs, a coloratura, maps, snipe, percale, macaroni, a gag, a banana bag, a tan, a tag, a banana bag again (or a camel), a crepe, pins, Spam, a rut, a Rolo, cash, a jar, sore hats, a peon, a canal – Panama!')\n","language":"Lasso"},{"code":"print isPalindrome(\"In girum imus nocte et consumimur igni\")\nprint isPalindrome(removePunctuation$(\"In girum imus nocte et consumimur igni\", \"S\"))\nprint isPalindrome(removePunctuation$(\"In girum imus nocte et consumimur igni\", \"SC\"))\n\nfunction isPalindrome(string$)\n isPalindrome = 1\n for i = 1 to int(len(string$)/2)\n if mid$(string$, i, 1) <> mid$(string$, len(string$)-i+1, 1) then isPalindrome = 0 : exit function\n next i\nend function\n\nfunction removePunctuation$(string$, remove$)\n 'P = remove puctuation. S = remove spaces C = remove case\n If instr(upper$(remove$), \"C\") then string$ = lower$(string$)\n If instr(upper$(remove$), \"P\") then removeCharacters$ = \",.!'()-&*?<>:;~[]{}\"\n If instr(upper$(remove$), \"S\") then removeCharacters$ = removeCharacters$;\" \"\n\n for i = 1 to len(string$)\n if instr(removeCharacters$, mid$(string$, i, 1)) then string$ = left$(string$, i-1);right$(string$, len(string$)-i) : i = i - 1\n next i\n removePunctuation$ = string$\nend function\n","language":"Liberty-BASIC"},{"code":"function palindrome txt exact\n if exact is empty or exact is not false then\n set caseSensitive to true --default is false\n else\n replace space with empty in txt\n put lower(txt) into txt\n end if\n return txt is reverse(txt)\nend palindrome\n\nfunction reverse str\n repeat with i = the length of str down to 1\n put byte i of str after revstr\n end repeat\n return revstr\nend reverse\n","language":"LiveCode"},{"code":"to palindrome? :w\n output equal? :w reverse :w\nend\n","language":"Logo"},{"code":"function ispalindrome(s) return s == string.reverse(s) end\n","language":"Lua"},{"code":"define(`palindrorev',`ifelse(`$1',invert(`$1'),`yes',`no')')dnl\npalindrorev(`ingirumimusnocteetconsumimurigni')\npalindrorev(`this is not palindrome')\n","language":"M4"},{"code":"define(`striptwo',`substr(`$1',1,eval(len(`$1')-2))')dnl\ndefine(`cmplast',`ifelse(`striptwo(`$1')',,`yes',dnl\nsubstr(`$1',0,1),substr(`$1',eval(len(`$1')-1),1),`yes',`no')')dnl\ndefine(`palindro',`dnl\nifelse(eval(len(`$1')<1),1,`yes',cmplast(`$1'),`yes',`palindro(striptwo(`$1'))',`no')')dnl\npalindro(`ingirumimusnocteetconsumimurigni')\npalindro(`this is not palindrome')\n","language":"M4"},{"code":" .TITLE PALIN\n .MCALL .GTLIN,.PRINT,.EXIT\nPALIN:: .GTLIN #INBUF ; READ INPUT\n MOV #INBUF,R0\n TSTB (R0) ; END OF INPUT?\n BEQ 3$\n JSR PC,EPALIN ; CHECK (EXACT) PALINDROME\n BNE 1$\n .PRINT #4$\n BR PALIN\n1$: MOV #INBUF,R0 ; CHECK INEXACT PALINDROME\n JSR PC,IPALIN\n BNE 2$\n .PRINT #5$\n BR PALIN\n2$: .PRINT #6$ ; NOT A PALINDROME AT ALL\n BR PALIN\n3$: .EXIT\n4$: .ASCIZ /EXACT PALINDROME/\n5$: .ASCIZ /INEXACT PALINDROME/\n6$: .ASCIZ /NOT A PALINDROME/\n .EVEN\n\n ; IS STRING AT R0 AN EXACT PALINDROME?\n ; ZERO FLAG SET IF TRUE\nEPALIN: MOV R0,R1\n1$: TSTB (R1)+ ; FIND END OF STRING\n BNE 1$\n DEC R1\n2$: CMPB (R0)+,-(R1) ; SCAN BACKWARDS AND FORWARDS\n BNE 4$ ; NOT PALINDROME?\n CMP R0,R1 ; DONE YET?\n BLT 2$\n3$: CLR R1\n4$: RTS PC\n\n ; IS STRING AT R0 AN INEXACT PALINDROME?\nIPALIN: MOV #3$,R1 ; COPY TO BUFFER\n BR 2$\n1$: BICB #40,R2 ; MAKE UPPERCASE IF LETTER\n CMPB R2,#101 ; < A = DISREGARD\n BLT 2$\n CMPB R2,#132 ; > Z = DISREGARD\n BGT 2$\n MOVB R2,(R1)+ ; STORE IN BUFFER\n2$: MOVB (R0)+,R2 ; GET CHARACTER\n BNE 1$ ; END?\n CLRB (R1) ; ZERO TERMINATE BUFFER\n MOV #3$,R0 ; NOW SEE IF RESULT IS EXACT PALINDROME\n BR EPALIN\n3$: .BLKB 200 ; BUFFER\n\nINBUF: .BLKB 200\n .END PALIN\n","language":"MACRO-11"},{"code":"with(StringTools):\n\nIsPalindrome(\"ingirumimusnocteetconsumimurigni\");\n\nIsPalindrome(\"In girum imus nocte et consumimur igni\");\n\nIsPalindrome(LowerCase(DeleteSpace(\"In girum imus nocte et consumimur igni\")));\n","language":"Maple"},{"code":"PalindromeQ\n","language":"Mathematica"},{"code":"function trueFalse = isPalindrome(string)\n\n trueFalse = all(string == fliplr(string)); %See if flipping the string produces the original string\n\n if not(trueFalse) %If not a palindrome\n string = lower(string); %Lower case everything\n trueFalse = all(string == fliplr(string)); %Test again\n end\n\n if not(trueFalse) %If still not a palindrome\n string(isspace(string)) = []; %Strip all space characters out\n trueFalse = all(string == fliplr(string)); %Test one last time\n end\n\nend\n","language":"MATLAB"},{"code":">> isPalindrome('In girum imus nocte et consumimur igni')\n\nans =\n\n 1\n","language":"MATLAB"},{"code":"palindromep(s) := block([t], t: sremove(\" \", sdowncase(s)), sequal(t, sreverse(t)))$\n\npalindromep(\"Sator arepo tenet opera rotas\"); /* true */\n","language":"Maxima"},{"code":"fn isPalindrome s =\n(\n local reversed = \"\"\n for i in s.count to 1 by -1 do reversed += s[i]\n return reversed == s\n)\n","language":"MAXScript"},{"code":"fn isPalindrome_r s =\n(\n if s.count <= 1 then\n (\n true\n )\n else\n (\n if s[1] != s[s.count] then\n (\n return false\n )\n isPalindrome_r (substring s 2 (s.count-2))\n )\n)\n","language":"MAXScript"},{"code":"local p = \"ingirumimusnocteetconsumimurigni\"\nformat (\"'%' is a palindrome? %\\n\") p (isPalindrome p)\nformat (\"'%' is a palindrome? %\\n\") p (isPalindrome_r p)\n","language":"MAXScript"},{"code":"(dup reverse ==) :palindrome?\n(dup \"\" split reverse \"\" join ==) :str-palindrome?\n\n\"apple\" str-palindrome? puts\n\"racecar\" str-palindrome? puts\n(a b c) palindrome? puts\n(a b b a) palindrome? puts\n","language":"Min"},{"code":"isPalindrome = function(s)\n // convert to lowercase, and strip non-letters\n stripped = \"\"\n for c in s.lower\n \tif c >= \"a\" and c <= \"z\" then stripped = stripped + c\n end for\n\n // check palindromity\n mid = floor(stripped.len/2)\n for i in range(0, mid)\n \tif stripped[i] != stripped[-i - 1] then return false\n end for\n return true\nend function\n\ntestStr = \"Madam, I'm Adam\"\nanswer = [testStr, \"is\"]\nif not isPalindrome(testStr) then answer.push \"NOT\"\nanswer.push \"a palindrome\"\nprint answer.join\n","language":"MiniScript"},{"code":"def reverse(s:string)\n StringBuilder.new(s).reverse.toString()\nend\n\ndef palindrome?(s:string)\n s.equals(reverse(s))\nend\n\nputs palindrome?(\"anna\") # ==> true\nputs palindrome?(\"Erik\") # ==> false\nputs palindrome?(\"palindroom-moordnilap\") # ==> true\nputs nil # ==> null\n","language":"Mirah"},{"code":"fun to_locase s = implode ` map (c_downcase) ` explode s\n\nfun only_alpha s = implode ` filter (fn x = c_alphabetic x) ` explode s\n\nfun is_palin\n\t( h1 :: t1, h2 :: t2, n = 0 ) \t\t = true\n|\t( h1 :: t1, h2 :: t2, n ) where ( h1 eql h2 ) = is_palin( t1, t2, n - 1)\n|\t( h1 :: t1, h2 :: t2, n ) = false\n| (str s) =\n\t\tlet\n\t\t\tval es = explode ` to_locase ` only_alpha s;\n\t\t\tval res = rev es;\n\t\t\tval k = (len es) div 2\n\t\tin\n\t\t\tis_palin (es, res, k)\n\t\tend\n\nfun test_is_palin s =\n\t(print \"\\\"\"; print s; print \"\\\" is a palindrome: \"; print ` is_palin s; println \"\")\n\nfun test (f, arg, res, ok, notok) = if (f arg eql res) then (\"'\" @ arg @ \"' \" @ ok) else (\"'\" @ arg @ \"' \" @ notok)\n\n;\n\nprintln ` test (is_palin, \"In girum imus nocte, et consumimur igni\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"Madam, I'm Adam.\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"salàlas\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"radar\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"Lagerregal\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"Ein Neger mit Gazelle zagt im Regen nie.\", true, \"is a palindrome\", \"is NOT a palindrome\");\nprintln ` test (is_palin, \"something wrong\", true, \"is a palindrome\", \"is NOT a palindrome\");\n","language":"MLite"},{"code":"argc IS $0\nargv IS $1\n\n LOC Data_Segment\nDataSeg GREG @\n\n LOC @+1000\nItsPalStr IS @-Data_Segment\n BYTE \"It's palindrome\",10,0\n LOC @+(8-@)&7\nNoPalStr IS @-Data_Segment\n BYTE \"It is not palindrome\",10,0\n\n LOC #100\n GREG @\n% input: $255 points to where the string to be checked is\n% returns $255 0 if not palindrome, not zero otherwise\n% trashs: $0,$1,$2,$3\n% return address $4\nDetectPalindrome LOC @\n ADDU $1,$255,0 % $1 = $255\n2H LDB $0,$1,0 % get byte at $1\n BZ $0,1F % if zero, end (length)\n INCL $1,1 % $1++\n JMP 2B % loop\n1H SUBU $1,$1,1 % ptr last char of string\n ADDU $0,DataSeg,0 % $0 to data seg.\n3H CMP $3,$1,$255 % is $0 == $255?\n BZ $3,4F % then jump\n LDB $3,$1,0 % otherwise get the byte\n STB $3,$0,0 % and copy it\n INCL $0,1 % $0++\n SUB $1,$1,1 % $1--\n JMP 3B\n4H LDB $3,$1,0\n STB $3,$0,0 % copy the last byte\n% now let us compare reversed string and straight string\n XOR $0,$0,$0 % index\n ADDU $1,DataSeg,0\n6H LDB $2,$1,$0 % pick char from rev str\n LDB $3,$255,$0 % pick char from straight str\n BZ $3,PaliOk % finished as palindrome\n CMP $2,$2,$3 % == ?\n BNZ $2,5F % if not, exit\n INCL $0,1 % $0++\n JMP 6B\n5H XOR $255,$255,$255\n GO $4,$4,0 % return false\nPaliOk NEG $255,0,1\n GO $4,$4,0 % return true\n\n% The Main for testing the function\n% run from the command line\n% $ mmix ./palindrome.mmo ingirumimusnocteetconsumimurigni\nMain CMP argc,argc,2 % argc > 2?\n BN argc,3F % no -> not enough arg\n ADDU $1,$1,8 % argv+1\n LDOU $255,$1,0 % argv[1]\n GO $4,DetectPalindrome\n BZ $255,2F % if not palindrome, jmp\n SETL $0,ItsPalStr % pal string\n ADDU $255,DataSeg,$0\n JMP 1F\n2H SETL $0,NoPalStr % no pal string\n ADDU $255,DataSeg,$0\n1H TRAP 0,Fputs,StdOut % print\n3H XOR $255,$255,$255\n TRAP 0,Halt,0 % exit(0)\n","language":"MMIX"},{"code":"MODULE Palindrome;\nFROM FormatString IMPORT FormatString;\nFROM Terminal IMPORT WriteString,ReadChar;\n\nPROCEDURE IsPalindrome(str : ARRAY OF CHAR) : BOOLEAN;\nVAR i,m : INTEGER;\nVAR buf : ARRAY[0..63] OF CHAR;\nBEGIN\n i := 0;\n m := HIGH(str) - 1;\n WHILE i<m DO\n IF str[i] # str[m-i] THEN\n RETURN FALSE\n END;\n INC(i)\n END;\n RETURN TRUE\nEND IsPalindrome;\n\nPROCEDURE Print(str : ARRAY OF CHAR);\nVAR buf : ARRAY[0..63] OF CHAR;\nBEGIN\n FormatString(\"%s: %b\\n\", buf, str, IsPalindrome(str));\n WriteString(buf)\nEND Print;\n\nBEGIN\n Print(\"\");\n Print(\"z\");\n Print(\"aha\");\n Print(\"sees\");\n Print(\"oofoe\");\n Print(\"deified\");\n Print(\"Deified\");\n Print(\"amanaplanacanalpanama\");\n Print(\"ingirumimusnocteetconsumimurigni\");\n\n ReadChar\nEND Palindrome.\n","language":"Modula-2"},{"code":"MODULE Palindrome;\n\nIMPORT Text;\n\nPROCEDURE isPalindrome(string: TEXT): BOOLEAN =\n VAR len := Text.Length(string);\n BEGIN\n FOR i := 0 TO len DIV 2 - 1 DO\n IF Text.GetChar(string, i) # Text.GetChar(string, (len - i - 1)) THEN\n RETURN FALSE;\n END;\n END;\n RETURN TRUE;\n END isPalindrome;\nEND Palindrome.\n","language":"Modula-3"},{"code":"def is_palindrome(s)\n temp = \"\"\n for char in s\n if \"abcdefghikjklmnopqrstuvwxyz\" .contains. lower(char)\n temp += lower(char)\n end\n end\n\n return list(temp) = list(temp).reverse()\nend\n","language":"Nanoquery"},{"code":"using System;\nusing System.Console;\nusing Nemerle.Utility.NString; //contains methods Explode() and Implode() which convert string -> list[char] and back\n\nmodule Palindrome\n{\n IsPalindrome( text : string) : bool\n {\n Implode(Explode(text).Reverse()) == text;\n }\n\n Main() : void\n {\n WriteLine(\"radar is a palindrome: {0}\", IsPalindrome(\"radar\"));\n }\n}\n","language":"Nemerle"},{"code":"Clean( text : string ) : string\n{\n def sepchars = Explode(\",.;:-?!()' \");\n Concat( \"\", Split(text, sepchars)).ToLower()\n}\n","language":"Nemerle"},{"code":"y='In girum imus nocte et consumimur igni'\n\n-- translation: We walk around in the night and\n-- we are burnt by the fire (of love)\nsay\nsay 'string = 'y\nsay\n\npal=isPal(y)\n\nif pal==0 then say \"The string isn't palindromic.\"\n else say 'The string is palindromic.'\n\nmethod isPal(x) static\n x=x.upper().space(0) /* removes all blanks (spaces) */\n /* and translate to uppercase. */\n return x==x.reverse() /* returns 1 if exactly equal */\n","language":"NetRexx"},{"code":"(define (palindrome? s)\n (setq r s)\n (reverse r) ; Reverse is destructive.\n (= s r))\n\n;; Make ‘reverse’ non-destructive and avoid a global variable\n(define (palindrome? s)\n (= s (reverse (copy s))))\n","language":"NewLISP"},{"code":"import unicode\n\n\nfunc isPalindrome(rseq: seq[Rune]): bool =\n ## Return true if a sequence of runes is a palindrome.\n for i in 1..(rseq.len shr 1):\n if rseq[i - 1] != rseq[^i]:\n return false\n result = true\n\n\nfunc isPalindrome(str: string; exact = true): bool {.inline.} =\n ## Return true if a UTF-8 string is a palindrome.\n ## If \"exact\" is false, ignore white spaces and ignore case.\n\n if exact:\n result = str.toRunes.isPalindrome()\n else:\n var rseq: seq[Rune]\n for rune in str.runes:\n if not rune.isWhiteSpace:\n rseq.add rune.toLower\n result = rseq.isPalindrome()\n\n\nwhen isMainModule:\n\n proc check(s: string) =\n var exact, inexact: bool\n exact = s.isPalindrome()\n if not exact:\n inexact = s.isPalindrome(exact = false)\n let txt = if exact: \" is an exact palindrome.\"\n elif inexact: \" is an inexact palindrome.\"\n else: \" is not a palindrome.\"\n echo '\"', s, '\"', txt\n\ncheck \"rotor\"\ncheck \"été\"\ncheck \"αννα\"\ncheck \"salà las\"\ncheck \"In girum imus nocte et consumimur igni\"\ncheck \"Esope reste ici et se repose\"\ncheck \"This is a palindrom\"\n","language":"Nim"},{"code":"bundle Default {\n class Test {\n function : Main(args : String[]) ~ Nil {\n IsPalindrome(\"aasa\")->PrintLine();\n IsPalindrome(\"acbca\")->PrintLine();\n IsPalindrome(\"xx\")->PrintLine();\n }\n\n function : native : IsPalindrome(s : String) ~ Bool {\n l := s->Size();\n for(i := 0; i < l / 2; i += 1;) {\n if(s->Get(i) <> s->Get(l - i - 1)) {\n return false;\n };\n };\n\n return true;\n }\n }\n}\n","language":"Objeck"},{"code":"let is_palindrome s =\n let l = String.length s in\n let rec comp n =\n n = 0 || (s.[l-n] = s.[n-1] && comp (n-1)) in\n comp (l / 2)\n","language":"OCaml"},{"code":"let rem_space str =\n let len = String.length str in\n let res = Bytes.create len in\n let rec aux i j =\n if i >= len\n then (Bytes.sub_string res 0 j)\n else match str.[i] with\n | ' ' | '\\n' | '\\t' | '\\r' ->\n aux (i+1) (j)\n | _ ->\n Bytes.set res j str.[i];\n aux (i+1) (j+1)\n in\n aux 0 0\n","language":"OCaml"},{"code":"function v = palindro_r(s)\n if ( length(s) == 1 )\n v = true;\n return;\n elseif ( length(s) == 2 )\n v = s(1) == s(2);\n return;\n endif\n if ( s(1) == s(length(s)) )\n v = palindro_r(s(2:length(s)-1));\n else\n v = false;\n endif\nendfunction\n","language":"Octave"},{"code":"function v = palindro(s)\n v = all( (s == s(length(s):-1:1)) == 1);\nendfunction\n","language":"Octave"},{"code":"palindro_r(\"ingirumimusnocteetconsumimurigni\")\npalindro(\"satorarepotenetoperarotas\")\n","language":"Octave"},{"code":"String method: isPalindrome self reverse self == ;\n","language":"Oforth"},{"code":"; simple case - only lowercase letters\n(define (palindrome? str)\n (let ((l (string->runes str)))\n (equal? l (reverse l))))\n\n(print (palindrome? \"ingirumimusnocteetconsumimurigni\"))\n; ==> #true\n(print (palindrome? \"thisisnotapalindrome\"))\n; ==> #false\n\n\n; complex case - with ignoring letter case and punctuation\n(define (alpha? x)\n (<= #\\a x #\\z))\n(define (lowercase x)\n (if (<= #\\A x #\\Z)\n (- x (- #\\A #\\a))\n x))\n\n(define (palindrome? str)\n (let ((l (filter alpha? (map lowercase (string->runes str)))))\n (equal? l (reverse l))))\n\n(print (palindrome? \"A man, a plan, a cat, a ham, a yak, a yam, a hat, a canal-Panama!\"))\n; ==> #true\n(print (palindrome? \"This is not a palindrome\"))\n; ==> #false\n","language":"Ol"},{"code":"fun {IsPalindrome S}\n {Reverse S} == S\nend\n","language":"Oz"},{"code":"ispal(s)={\n s=Vec(s);\n for(i=1,#v\\2,\n if(v[i]!=v[#v-i+1],return(0))\n );\n 1\n};\n","language":"PARI-GP"},{"code":"ispal(s)={\n my(d=digits(n));\n for(i=1,#d\\2,\n if(d[i]!=d[n+1=i],return(0))\n );\n 1\n};\n","language":"PARI-GP"},{"code":"program Palindro;\n\n{ RECURSIVE }\nfunction is_palindro_r(s : String) : Boolean;\nbegin\n if length(s) <= 1 then\n is_palindro_r := true\n else begin\n if s[1] = s[length(s)] then\n\t is_palindro_r := is_palindro_r(copy(s, 2, length(s)-2))\n else\n\t is_palindro_r := false\n end\nend; { is_palindro_r }\n\n{ NON RECURSIVE; see [[Reversing a string]] for \"reverse\" }\nfunction is_palindro(s : String) : Boolean;\nbegin\n if s = reverse(s) then\n is_palindro := true\n else\n is_palindro := false\nend;\n","language":"Pascal"},{"code":"procedure test_r(s : String; r : Boolean);\nbegin\n write('\"', s, '\" is ');\n if ( not r ) then\n write('not ');\n writeln('palindrome')\nend;\n\nvar\n s1, s2 : String;\n\nbegin\n s1 := 'ingirumimusnocteetconsumimurigni';\n s2 := 'in girum imus nocte';\n test_r(s1, is_palindro_r(s1));\n test_r(s2, is_palindro_r(s2));\n test_r(s1, is_palindro(s1));\n test_r(s2, is_palindro(s2))\nend.\n","language":"Pascal"},{"code":"program PalindromeDetection;\nvar\n input, output: string;\n s: char; i: integer;\nbegin\n writeln('write down your input:');\n readln(input);\n output:='';\n for i:=1 to length(input) do\n begin\n s:=input[i];\n output:=s+output;\n end;\n writeln('');\n if(input=output)then\n writeln('input was palindrome')\n else\n writeln('input was not palindrome');\nend.\n","language":"Pascal"},{"code":"# Palindrome.pm\npackage Palindrome;\n\nuse strict;\nuse warnings;\n\nuse Exporter 'import';\nour @EXPORT = qw(palindrome palindrome_c palindrome_r palindrome_e);\n\nsub palindrome\n{\n my $s = (@_ ? shift : $_);\n return $s eq reverse $s;\n}\n\nsub palindrome_c\n{\n my $s = (@_ ? shift : $_);\n for my $i (0 .. length($s) >> 1)\n {\n return 0 unless substr($s, $i, 1) eq substr($s, -1 - $i, 1);\n }\n return 1;\n}\n\nsub palindrome_r\n{\n my $s = (@_ ? shift : $_);\n if (length $s <= 1) { return 1; }\n elsif (substr($s, 0, 1) ne substr($s, -1, 1)) { return 0; }\n else { return palindrome_r(substr($s, 1, -1)); }\n}\n\nsub palindrome_e\n{\n (@_ ? shift : $_) =~ /^(.?|(.)(?1)\\2)$/ + 0\n}\n","language":"Perl"},{"code":"# pbench.pl\nuse strict;\nuse warnings;\n\nuse Benchmark qw(cmpthese);\nuse Palindrome;\n\nprintf(\"%d, %d, %d, %d: %s\\n\",\n palindrome, palindrome_c, palindrome_r, palindrome_e, $_)\nfor\n qw/a aa ab abba aBbA abca abba1 1abba\n ingirumimusnocteetconsumimurigni/,\n 'ab cc ba',\t'ab ccb a';\n\nprintf \"\\n\";\n\nmy $latin = \"ingirumimusnocteetconsumimurigni\";\ncmpthese(100_000, {\n palindrome => sub { palindrome $latin },\n palindrome_c => sub { palindrome_c $latin },\n palindrome_r => sub { palindrome_r $latin },\n palindrome_e => sub { palindrome_e $latin },\n});\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">is_palindrome</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">is_palindrome</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"rotator\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- prints 1</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">is_palindrome</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"tractor\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- prints 0</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">punctuation</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" `~!@#$%^&*()-=_+[]{}\\\\|;:',.<>/?\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">nulls</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">punctuation</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">utf8_to_utf32</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">lower</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">punctuation</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nulls</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- these all print 1 (true)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Madam, I'm Adam.\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"A man, a plan, a canal: Panama!\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"In girum imus nocte et consumimur igni\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"人人為我,我為人人\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Я иду с мечем, судия\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"아들딸들아\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"가련하시다 사장집 아들딸들아 집장사 다시 하련가\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">extra_credit</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"tregða, gón, reiði - er nóg að gert\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\ndef palindrome? dup reverse == enddef\n\n( \"abba\" \"boom\" \"radar\" \"civic\" \"great\" )\nlen for get\n\tdup print \" : palindrome? \" print palindrome?\n\tif \"true\" else \"false\" endif ?\nendfor\n\ndef letter? dup 'z' <= swap 'a' >= and enddef\n\n\"\" >ps\n\"In girum imus nocte, et consumimur igni\" dup ? lower\nlen for get\n\tdup letter?\n\tif\n\t\tps> swap chain >ps\n\telse\n\t\tdrop\n\tendif\nendfor\n\nps> palindrome? if \"This is an inexact palindrome!\" else \"Not a palindrome.\" endif ?\n","language":"Phixmonti"},{"code":"<?php\nfunction is_palindrome($string) {\n return $string == strrev($string);\n}\n?>\n","language":"PHP"},{"code":"<?php\nfunction is_palindrome($string) {\n return preg_match('/^(?:(.)(?=.*(\\1(?(2)\\2|))$))*.?\\2?$/', $string);\n}\n?>\n","language":"PHP"},{"code":"go =>\n Tests = [\"In girum imus nocte et consumimur igni\",\n \"this is a non palindrome string\",\n \"anna ABcdcBA anna\",\n \"anna ABcdcBA annax\",\n \"A man, a plan, a canoe, pasta, heros, rajahs\" ++\n \"a coloratura, maps, snipe, percale, macaroni, \" ++\n \"a gag, a banana bag, a tan, a tag, \" ++\n \"a banana bag again (or a camel), a crepe, pins, \" ++\n \"Spam, a rut, a Rolo, cash, a jar, sore hats, \" ++\n \"a peon, a canal - Panama!\",\n 10,\n 111111,\n 12221,\n 9384212,\n 10.01\n ],\n\n foreach(Test in Tests)\n if is_palindrome(Test) then\n println([Test, \"exact palindrome\"])\n elseif is_palindrome_inexact(Test) then\n println([Test, \"inexact palindrome\"])\n else\n println([Test, \"no\"])\n end\n end,\n nl.\n\n% Detect palindromes for strings (and numbers).\nis_palindrome(N), number(N) => is_palindrome(N.to_string()).\nis_palindrome(S) => S == S.reverse().\n\n% Detect inexact palindromes.\nis_palindrome_inexact(N), number(N) => is_palindrome_inexact(N.to_string()).\nis_palindrome_inexact(S) =>\n is_palindrome(strip(S)).\n\n\n% convert to lowercase and\n% skips punctuation and white space.\nstrip(S) = [C : C in S.to_lowercase(),\n not C.membchk(\"!?,.;-_ \\t\\n()[]{}\")].\n","language":"Picat"},{"code":"(de palindrome? (S)\n (= (setq S (chop S)) (reverse S)) )\n","language":"PicoLisp"},{"code":"int main(){\n if(pal(\"rotator\")){\n write(\"palindrome!\\n\");\n }\n if(!pal(\"asdf\")){\n write(\"asdf isn't a palindrome.\\n\");\n }\n}\n\nint pal(string input){\n if( reverse(input) == input ){\n return 1;\n } else {\n return 0;\n }\n}\n","language":"Pike"},{"code":"is_palindrome = (text = reverse(text));\n","language":"PL-I"},{"code":"is_palindrome: procedure (text) returns (bit(1));\n declare text character (*) varying;\n\n text = remove_blanks(text);\n text = lowercase(text);\n return (text = reverse(text));\n\nremove_blanks: procedure (text);\n declare text character (*) varying;\n declare (i, j) fixed binary (31);\n j = 0;\n do i = 1 to length(text);\n if substr(text, i, 1) = ' ' then\n do; j = j + 1; substr(text, j, 1) = substr(text, i, 1); end;\n end;\n return (substr(text, 1, j));\nend remove_blanks;\nend is_palindrome;\n","language":"PL-I"},{"code":"100H:\n\n/* CHECK EXACT PALINDROME ASSUMING $-TERMINATED STRING */\nPALINDROME: PROCEDURE(PTR) BYTE;\n DECLARE (PTR, FRONT, BACK) ADDRESS, STR BASED PTR BYTE;\n\n /* FIND END */\n FRONT, BACK = 0;\n DO WHILE STR(BACK) <> '$';\n BACK = BACK + 1;\n END;\n BACK = BACK - 1;\n\n /* CHECK MATCH */\n DO WHILE (FRONT < BACK) AND (STR(FRONT) = STR(BACK));\n FRONT = FRONT + 1;\n BACK = BACK - 1;\n END;\n\n RETURN FRONT >= BACK;\nEND PALINDROME;\n\n/* CHECK INEXACT PALINDROME: FILTER OUT NON-LETTERS AND NUMBERS */\nINEXACT$PALINDROME: PROCEDURE(PTR) BYTE;\n /* 256 BYTES OUGHT TO BE ENOUGH FOR EVERYONE */\n DECLARE (PTR, OPTR) ADDRESS;\n DECLARE FILTER (256) BYTE;\n DECLARE (IN BASED PTR, OUT BASED OPTR) BYTE;\n OPTR = .FILTER;\n\n DO WHILE IN <> '$';\n OUT = IN OR 32;\n /* LOWERCASE CHARACTERS ARE NOT IN THE PL/M CHARSET,\n BUT WE CAN JUST WRITE THE ASCII VALUES AS NUMBERS */\n IF (OUT >= '0' AND OUT <= '9')\n OR (OUT >= 97 AND OUT <= 122) THEN\n OPTR = OPTR + 1;\n PTR = PTR + 1;\n END;\n OUT = '$';\n\n RETURN PALINDROME(.FILTER);\nEND INEXACT$PALINDROME;\n\n/* CP/M BDOS CALLS */\nBDOS: PROCEDURE(FUNC, ARG);\n DECLARE FUNC BYTE, ARG ADDRESS;\n GO TO 5;\nEND BDOS;\n\nPRINT: PROCEDURE(STRING);\n DECLARE STRING ADDRESS;\n CALL BDOS(9, STRING);\nEND PRINT;\n\n/* TEST SOME STRINGS */\nDECLARE STRINGS (8) ADDRESS;\nSTRINGS(0) = .'ROTOR$';\nSTRINGS(1) = .'RACECAR$';\nSTRINGS(2) = .'LEVEL$';\nSTRINGS(3) = .'REDDER$';\nSTRINGS(4) = .'RACECAR$';\nSTRINGS(5) = .'A MAN, A PLAN, A CANAL: PANAMA$';\nSTRINGS(6) = .'EGAD, A BASE TONE DENOTES A BAD AGE.$';\nSTRINGS(7) = .'ROSETTA$';\n\nDECLARE N BYTE;\nDO N = 0 TO LAST(STRINGS);\n CALL PRINT(STRINGS(N));\n CALL PRINT(.': $');\n IF PALINDROME(STRINGS(N)) THEN\n CALL PRINT(.'EXACT$');\n ELSE IF INEXACT$PALINDROME(STRINGS(N)) THEN\n CALL PRINT(.'INEXACT$');\n ELSE\n CALL PRINT(.'NOT A PALINDROME$');\n CALL PRINT(.(13,10,'$'));\nEND;\n\nCALL BDOS(0,0);\nEOF\n","language":"PL-M"},{"code":"To decide if a string is palindromic:\nSlap a substring on the string.\nLoop.\nIf the substring's first is greater than the substring's last, say yes.\nIf the substring's first's target is not the substring's last's target, say no.\nAdd 1 to the substring's first.\nSubtract 1 from the substring's last.\nRepeat.\n","language":"Plain-English"},{"code":"isPalindrome(chars) =\n chars == reverse(chars)\n","language":"Pointless"},{"code":"output =\n \"A man, a plan, a canal -- Panama\"\n |> toList\n |> filter(inFunc(alNums))\n |> map(toLower)\n |> isPalindrome\n |> println\n","language":"Pointless"},{"code":"# The readable recursive version\npalindrome_i = (s, b, e):\n if (e <= b): true.\n elsif (s ord(b) != s ord(e)): false.\n else: palindrome_i(s, b+1, e-1).\n.\n\npalindrome = (s):\n palindrome_i(s, 0, s length - 1).\n\npalindrome(argv(1))\n","language":"Potion"},{"code":"FUNCTION isPalindrome (what AS STRING) AS LONG\n DIM whatcopy AS STRING, chk AS STRING, tmp AS STRING * 1, L0 AS LONG\n\n FOR L0 = 1 TO LEN(what)\n tmp = UCASE$(MID$(what, L0, 1))\n SELECT CASE tmp\n CASE \"A\" TO \"Z\"\n whatcopy = whatcopy & tmp\n chk = tmp & chk\n CASE \"0\" TO \"9\"\n MSGBOX \"Numbers are cheating! (\"\"\" & what & \"\"\")\"\n FUNCTION = 0\n EXIT FUNCTION\n END SELECT\n NEXT\n\n FUNCTION = ISTRUE((whatcopy) = chk)\nEND FUNCTION\n\n\nFUNCTION PBMAIN () AS LONG\n DATA \"My dog has fleas\", \"Madam, I'm Adam.\", \"1 on 1\", \"In girum imus nocte et consumimur igni\"\n DIM L1 AS LONG, w AS STRING\n FOR L1 = 1 TO DATACOUNT\n w = READ$(L1)\n IF ISTRUE(isPalindrome(w)) THEN\n MSGBOX $DQ & w & \"\"\" is a palindrome\"\n ELSE\n MSGBOX $DQ & w & \"\"\" is not a palindrome\"\n END IF\n NEXT\nEND FUNCTION\n","language":"PowerBASIC"},{"code":"Function Test-Palindrome( [String] $Text ){\n $CharArray = $Text.ToCharArray()\n [Array]::Reverse($CharArray)\n $Text -eq [string]::join('', $CharArray)\n}\n","language":"PowerShell"},{"code":"function Test-Palindrome\n{\n <#\n .SYNOPSIS\n Tests if a string is a palindrome.\n .DESCRIPTION\n Tests if a string is a true palindrome or, optionally, an inexact palindrome.\n .EXAMPLE\n Test-Palindrome -Text \"racecar\"\n .EXAMPLE\n Test-Palindrome -Text '\"Deliver desserts,\" demanded Nemesis, \"emended, named, stressed, reviled.\"' -Inexact\n #>\n [CmdletBinding()]\n [OutputType([bool])]\n Param\n (\n # The string to test for palindrominity.\n [Parameter(Mandatory=$true)]\n [string]\n $Text,\n\n # When specified, detects an inexact palindrome.\n [switch]\n $Inexact\n )\n\n if ($Inexact)\n {\n # Strip all punctuation and spaces\n $Text = [Regex]::Replace(\"$Text($7&\",\"[^1-9a-zA-Z]\",\"\")\n }\n\n $Text -match \"^(?'char'[a-z])+[a-z]?(?:\\k'char'(?'-char'))+(?(char)(?!))$\"\n}\n","language":"PowerShell"},{"code":"Test-Palindrome -Text 'radar'\n","language":"PowerShell"},{"code":"Test-Palindrome -Text \"In girum imus nocte et consumimur igni.\"\n","language":"PowerShell"},{"code":"Test-Palindrome -Text \"In girum imus nocte et consumimur igni.\" -Inexact\n","language":"PowerShell"},{"code":"Function Test-Palindrome {\n[CmdletBinding()]\nParam(\n [Parameter(ValueFromPipeline)]\n [string[]]$Text\n)\n\nprocess {\n :stringLoop foreach ($T in $Text)\n {\n # Normalize Unicode combining characters,\n # so character á compares the same as (a+combining accent)\n $T = $T.Normalize([Text.NormalizationForm]::FormC)\n\n # Remove anything from outside the Unicode category\n # \"Letter from any language\"\n $T = $T -replace '\\P{L}', ''\n\n # Walk from each end of the string inwards,\n # comparing a char at a time.\n # Avoids string copy / reverse overheads.\n $Left, $Right = 0, [math]::Max(0, ($T.Length - 1))\n while ($Left -lt $Right)\n {\n if ($T[$Left] -ne $T[$Right])\n {\n # return early if string is not a palindrome\n [PSCustomObject]@{\n Text = $T\n IsPalindrome = $False\n }\n continue stringLoop\n }\n else\n {\n $Left++\n $Right--\n }\n }\n\n # made it to here, then string is a palindrome\n [PSCustomObject]@{\n Text = $T\n IsPalindrome = $True\n }\n\n }\n}\n}\n'ánu-ná', 'nowt' | Test-Palindrome\n","language":"PowerShell"},{"code":"void setup(){\n\tprintln(isPalindrome(InsertPalindromeHere));\n}\n\nboolean isPalindrome(string check){\n\tchar[] letters = new char[check.length];\n\tstring invert = \" \";\n\tstring modCheck = \" \" + check;\n\tfor(int i = 0; i < letters.length; i++){\n\t\tletters[i] = check.charAt(i);\n\t}\n\tfor(int i = letters.length-1; i >= 0; i--){\n\t\tinvert = invert + letters[i];\n\t}\n\t\n\tif(invert == modCheck){\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n","language":"Processing"},{"code":"void setup(){\n println(\"PalindromeDetection\");\n\n String[] tests = {\n \"abcba\",\n \"aa\",\n \"a\",\n \"\",\n \" \",\n \"ab\",\n \"abcdba\",\n \"A man, a plan, a canal: Panama!\",\n \"Dammit, I’m Mad!\",\n \"Never odd or even\",\n \"ingirumimusnocteetconsumimurigni\"\n };\n\n for (int i = 0; i < tests.length; i++){\n println((i + 1) + \". '\" + tests[i] + \"' isExactPalindrome: \" + isExactPalindrome(tests[i]) + \" isInexactPalindrome: \" + isInexactPalindrome(tests[i]));\n }\n}\n\n/*\n* Check for exact palindrome using StringBuilder and String since String in Java does not provide any reverse functionality because Strings are immutable.\n*/\nboolean isExactPalindrome(String s){\n\tStringBuilder sb = new StringBuilder(s);\n\treturn s.equals(sb.reverse().toString());\n}\n\n/*\n* Check for inexact palindrome using the check for exact palindromeabove.\n*/\nboolean isInexactPalindrome(String s){\n // removes all whitespaces and non-visible characters,\n // remove anything besides alphabet characters\n // ignore case\n return isExactPalindrome(s.replaceAll(\"\\\\s+\",\"\").replaceAll(\"[^A-Za-z]+\", \"\").toLowerCase());\n}\n","language":"Processing"},{"code":"palindrome(Word) :- name(Word,List), reverse(List,List).\n","language":"Prolog"},{"code":"pali(Str) :- sub_string(Str, 0, 1, _, X), string_concat(Str2, X, Str), string_concat(X, Mid, Str2), pali(Mid).\npali(Str) :- string_length(Str, Len), Len < 2.\n","language":"Prolog"},{"code":"pali(Str) :- sub_atom(Str, 0, 1, _, X), atom_concat(Str2, X, Str), atom_concat(X, Mid, Str2), pali(Mid).\npali(Str) :- atom_length(Str, Len), Len < 2.\n","language":"Prolog"},{"code":"Procedure IsPalindrome(StringToTest.s)\n If StringToTest=ReverseString(StringToTest)\n ProcedureReturn 1\n Else\n ProcedureReturn 0\n EndIf\nEndProcedure\n","language":"PureBasic"},{"code":"def is_palindrome(s):\n return s == s[::-1]\n","language":"Python"},{"code":"def is_palindrome(s):\n low = 0\n high = len(s) - 1\n while low < high:\n if not s[low].isalpha():\n low += 1\n elif not s[high].isalpha():\n high -= 1\n else:\n if s[low].lower() != s[high].lower():\n return False\n else:\n low += 1\n high -= 1\n return True\n","language":"Python"},{"code":"def is_palindrome_r(s):\n if len(s) <= 1:\n return True\n elif s[0] != s[-1]:\n return False\n else:\n return is_palindrome_r(s[1:-1])\n","language":"Python"},{"code":"def is_palindrome_r2(s):\n return not s or s[0] == s[-1] and is_palindrome_r2(s[1:-1])\n","language":"Python"},{"code":"def test(f, good, bad):\n assert all(f(x) for x in good)\n assert not any(f(x) for x in bad)\n print '%s passed all %d tests' % (f.__name__, len(good)+len(bad))\n\npals = ('', 'a', 'aa', 'aba', 'abba')\nnotpals = ('aA', 'abA', 'abxBa', 'abxxBa')\nfor ispal in is_palindrome, is_palindrome_r, is_palindrome_r2:\n test(ispal, pals, notpals)\n","language":"Python"},{"code":"def p_loop():\n import re, string\n re1=\"\" # Beginning of Regex\n re2=\"\" # End of Regex\n pal=raw_input(\"Please Enter a word or phrase: \")\n pd = pal.replace(' ','')\n for c in string.punctuation:\n pd = pd.replace(c,\"\")\n if pal == \"\" :\n return -1\n c=len(pd) # Count of chars.\n loops = (c+1)/2\n for x in range(loops):\n re1 = re1 + \"(\\w)\"\n if (c%2 == 1 and x == 0):\n continue\n p = loops - x\n re2 = re2 + \"\\\\\" + str(p)\n regex= re1+re2+\"$\" # regex is like \"(\\w)(\\w)(\\w)\\2\\1$\"\n #print(regex) # To test regex before re.search\n m = re.search(r'^'+regex,pd,re.IGNORECASE)\n if (m):\n print(\"\\n \"+'\"'+pal+'\"')\n print(\" is a Palindrome\\n\")\n return 1\n else:\n print(\"Nope!\")\n return 0\n","language":"Python"},{"code":"'''Palindrome detection'''\n\n\n# isPalindrome :: String -> Bool\ndef isPalindrome(s):\n '''True if the string is unchanged under reversal.\n (The left half is a reflection of the right half)\n '''\n d, m = divmod(len(s), 2)\n return s[0:d] == s[d + m:][::-1]\n\n\n# ------------------------- TEST -------------------------\n# main :: IO ()\ndef main():\n '''Test'''\n\n print('\\n'.join(\n f'{repr(s)} -> {isPalindrome(cleaned(s))}' for s in [\n \"\",\n \"a\",\n \"ab\",\n \"aba\",\n \"abba\",\n \"In girum imus nocte et consumimur igni\"\n ]\n ))\n\n\n# cleaned :: String -> String\ndef cleaned(s):\n '''A lower-case copy of s, with spaces pruned.'''\n return [c.lower() for c in s if ' ' != c]\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"def palindromic(str):\n for i in range(len(str)//2):\n if str[i] != str[~i]:\n return(False)\n return(True)\n","language":"Python"},{"code":" [ dup reverse = ] is palindromic ( [ --> b )\n\n [ [] swap witheach\n [ upper dup\n dup lower = iff\n drop else join ]\n palindromic ] is inexactpalindrome ( $ --> b )\n","language":"Quackery"},{"code":" [ true swap\n dup size 2 / times\n [ dup i peek\n over i ~ peek != if\n [ dip not conclude ] ]\n drop ] is palindromic ( [ --> b )\n","language":"Quackery"},{"code":"palindro <- function(p) {\n if ( nchar(p) == 1 ) {\n return(TRUE)\n } else if ( nchar(p) == 2 ) {\n return(substr(p,1,1) == substr(p,2,2))\n } else {\n if ( substr(p,1,1) == substr(p, nchar(p), nchar(p)) ) {\n return(palindro(substr(p, 2, nchar(p)-1)))\n } else {\n return(FALSE)\n }\n }\n}\n","language":"R"},{"code":"palindroi <- function(p) {\n for(i in 1:floor(nchar(p)/2) ) {\n r <- nchar(p) - i + 1\n if ( substr(p, i, i) != substr(p, r, r) ) return(FALSE)\n }\n TRUE\n}\n","language":"R"},{"code":"revstring <- function(stringtorev) {\n return(\n paste(\n strsplit(stringtorev,\"\")[[1]][nchar(stringtorev):1]\n ,collapse=\"\")\n )\n}\npalindroc <- function(p) {return(revstring(p)==p)}\n","language":"R"},{"code":"is.Palindrome <- function(string)\n{\n characters <- unlist(strsplit(string, \"\"))\n all(characters == rev(characters))\n}\n","language":"R"},{"code":"(define (palindromb str)\n (let* ([lst (string->list (string-downcase str))]\n [slst (remove* '(#\\space) lst)])\n (string=? (list->string (reverse slst)) (list->string slst))))\n\n;;example output\n\n> (palindromb \"able was i ere i saw elba\")\n#t\n> (palindromb \"waht the hey\")\n#f\n> (palindromb \"In girum imus nocte et consumimur igni\")\n#t\n>\n","language":"Racket"},{"code":"subset Palindrom of Str where {\n .flip eq $_ given .comb(/\\w+/).join.lc\n}\n\nmy @tests = q:to/END/.lines;\n A man, a plan, a canal: Panama.\n My dog has fleas\n Madam, I'm Adam.\n 1 on 1\n In girum imus nocte et consumimur igni\n END\n\nfor @tests { say $_ ~~ Palindrom, \"\\t\", $_ }\n","language":"Raku"},{"code":"import String;\n\npublic bool palindrome(str text) = toLowerCase(text) == reverse(text);\n","language":"Rascal"},{"code":"import String;\n\npublic bool palindrome(str text){\n\ttext = replaceAll(toLowerCase(text), \" \", \"\");\n\treturn text == reverse(text);\n}\n","language":"Rascal"},{"code":"rascal>palindrome(\"In girum imus nocte et consumimur igni\")\nbool: true\n","language":"Rascal"},{"code":"REBOL [\n Title: \"Palindrome Recognizer\"\n URL: http://rosettacode.org/wiki/Palindrome\n]\n\n; In order to compete with all the one-liners, the operation is\n; compressed: parens force left hand side to evaluate first, where I\n; copy the phrase, then uppercase it and assign it to 'p'. Now the\n; right hand side is evaluated: p is copied, then reversed in place;\n; the comparison is made and implicitely returned.\n\npalindrome?: func [\n\tphrase [string!] \"Potentially palindromatic prose.\"\n\t/local p\n][(p: uppercase copy phrase) = reverse copy p]\n\n; Teeny Tiny Test Suite\n\nassert: func [code][print [either do code [\" ok\"][\"FAIL\"] mold code]]\n\nprint \"Simple palindromes, with an exception for variety:\"\nrepeat phrase [\"z\" \"aha\" \"sees\" \"oofoe\" \"Deified\"][\n\tassert compose [palindrome? (phrase)]]\n\nprint [crlf \"According to the problem statement, these should fail:\"]\nassert [palindrome? \"A man, a plan, a canal, Panama.\"] ; Punctuation not ignored.\nassert [palindrome? \"In girum imus nocte et consumimur igni\"] ; Spaces not removed.\n\n; I know we're doing palindromes, not alliteration, but who could resist...?\n","language":"REBOL"},{"code":":palindrome? (s-f) dup s:hash [ s:reverse s:hash ] dip eq? ;\n\n'ingirumimusnocteetconsumimurigni palindrome? n:put\n","language":"Retro"},{"code":"/*REXX pgm checks if phrase is palindromic; ignores the case of the letters. */\nparse arg y /*get (optional) phrase from the C.L. */\nif y='' then y='In girum imus nocte et consumimur igni' /*[↓] translation.*/\n /*We walk around in the night and we are burnt by the fire (of love).*/\nsay 'string = ' y\nif isTpal(y) then say 'The string is a true palindrome.'\n else if isPal(y) then say 'The string is an inexact palindrome.'\n else say \"The string isn't palindromic.\"\nexit /*stick a fork in it, we're all done. */\n/*────────────────────────────────────────────────────────────────────────────*/\nisTpal: return reverse(arg(1))==arg(1)\nisPal: return isTpal(translate(space(x,0)))\n","language":"REXX"},{"code":"/* REXX */\n\n/*Check whether a string is a palindrome */\nparse pull string\nselect\n\twhen palindrome(string) then say string 'is an exact palindrome.'\n\twhen palindrome(compress(upper(string))) then say string 'is an inexact palindrome.'\n\totherwise say string 'is not palindromic.'\n\tend\nexit 0\n\npalindrome: procedure\nparse arg string\nreturn string==reverse(string)\n","language":"REXX"},{"code":"func isPalindromeReverse(string: String): Boolean {\n return string == string.reverse();\n}\n","language":"Rhovas"},{"code":"func isPalindromeChars(chars: List<String>): Boolean {\n match (chars) {\n []: return true;\n [elem]: return true;\n [first, middle*, last]: return first == last && isPalindromeChars(middle);\n }\n}\n","language":"Rhovas"},{"code":"func isPalindrome(string: String): Boolean {\n return isPalindromeReverse(string) && isPalindromeChars(string.chars);\n}\n\nassert isPalindrome(\"\");\nassert isPalindrome(\"f\");\nassert isPalindrome(\"noon\");\nassert isPalindrome(\"kayak\");\nassert isPalindrome(\"step on no pets\");\nassert !isPalindrome(\"palindrome\");\nassert !isPalindrome(\"A man, a plan, a canal - Panama!\"); //inexact\n\nassert isPalindrome(\"§★♖★§\"); //single utf16 code points\nassert isPalindromeReverse(\"🗲\"); //string reverse handles surrogates\nassert !isPalindromeChars(\"🗲\".chars); //.chars splits surrogates into two chars\n","language":"Rhovas"},{"code":"aString = \"radar\"\nbString = \"\"\nfor i=len(aString) to 1 step -1\n bString = bString + aString[i]\nnext\nsee aString\nif aString = bString see \" is a palindrome.\" + nl\nelse see \" is not a palindrome\" + nl ok\n","language":"Ring"},{"code":"def palindrome?(s)\n s == s.reverse\nend\n","language":"Ruby"},{"code":"def r_palindrome?(s)\n if s.length <= 1\n true\n elsif s[0] != s[-1]\n false\n else\n r_palindrome?(s[1..-2])\n end\nend\n","language":"Ruby"},{"code":"str = \"A man, a plan, a caret, [...2110 chars deleted...] a canal--Panama.\".downcase.delete('^a-z')\nputs palindrome?(str) # => true\nputs r_palindrome?(str) # => true\n\nrequire 'benchmark'\nBenchmark.bm do |b|\n b.report('iterative') {10000.times {palindrome?(str)}}\n b.report('recursive') {10000.times {r_palindrome?(str)}}\nend\n","language":"Ruby"},{"code":"data \"My dog has fleas\", \"Madam, I'm Adam.\", \"1 on 1\", \"In girum imus nocte et consumimur igni\"\n\nfor i = 1 to 4\n read w$\n print w$;\" is \";isPalindrome$(w$);\" Palindrome\"\nnext\n\nFUNCTION isPalindrome$(str$)\nfor i = 1 to len(str$)\n a$ = upper$(mid$(str$,i,1))\n if (a$ >= \"A\" and a$ <= \"Z\") or (a$ >= \"0\" and a$ <= \"9\") then b$ = b$ + a$: c$ = a$ + c$\nnext i\nif b$ <> c$ then isPalindrome$ = \"not\"\n","language":"Run-BASIC"},{"code":"fn is_palindrome(string: &str) -> bool {\n let half_len = string.len() / 2;\n string\n .chars()\n .take(half_len)\n .eq(string.chars().rev().take(half_len))\n}\n\nmacro_rules! test {\n ( $( $x:tt ),* ) => { $( println!(\"'{}': {}\", $x, is_palindrome($x)); )* };\n}\n\nfn main() {\n test!(\n \"\",\n \"a\",\n \"ada\",\n \"adad\",\n \"ingirumimusnocteetconsumimurigni\",\n \"人人為我,我為人人\",\n \"Я иду с мечем, судия\",\n \"아들딸들아\",\n \"The quick brown fox\"\n );\n}\n","language":"Rust"},{"code":"extern crate unicode_segmentation;\nuse unicode_segmentation::UnicodeSegmentation;\nfn is_palindrome(string: &str) -> bool {\n string.graphemes(true).eq(string.graphemes(true).rev())\n}\n","language":"Rust"},{"code":"The macro \"palindro\" has two parameters: string and ignorewhitespace.\n string is the expression to be checked.\n ignorewhitespace, (Y/N), determines whether or not to ignore blanks and punctuation.\nThis macro was written in SAS 9.2. If you use a version before SAS 9.1.3,\nthe compress function options will not work.\n","language":"SAS"},{"code":"%MACRO palindro(string, ignorewhitespace);\n DATA _NULL_;\n %IF %UPCASE(&ignorewhitespace)=Y %THEN %DO;\n/* The arguments of COMPRESS (sp) ignore blanks and puncutation */\n/* We take the string and record it in reverse order using the REVERSE function. */\n %LET rev=%SYSFUNC(REVERSE(%SYSFUNC(COMPRESS(&string,,sp))));\n %LET string=%SYSFUNC(COMPRESS(&string.,,sp));\n %END;\n\n %ELSE %DO;\n %LET rev=%SYSFUNC(REVERSE(&string));\n %END;\n /*%PUT rev=&rev.;*/\n /*%PUT string=&string.;*/\n\n/* Here we determine if the string and its reverse are the same. */\n %IF %UPCASE(&string)=%UPCASE(&rev.) %THEN %DO;\n %PUT TRUE;\n %END;\n %ELSE %DO;\n %PUT FALSE;\n %END;\n RUN;\n%MEND;\n","language":"SAS"},{"code":"%palindro(\"a man, a plan, a canal: panama\",y);\n\nTRUE\n\nNOTE: DATA statement used (Total process time):\n real time 0.00 seconds\n cpu time 0.00 seconds\n\n%palindro(\"a man, a plan, a canal: panama\",n);\n\nFALSE\n\nNOTE: DATA statement used (Total process time):\n real time 0.00 seconds\n cpu time 0.00 seconds\n","language":"SAS"},{"code":" def isPalindrome(s: String): Boolean = (s.size >= 2) && s == s.reverse\n","language":"Scala"},{"code":" def isPalindromeSentence(s: String): Boolean =\n (s.size >= 2) && {\n val p = s.replaceAll(\"[^\\\\p{L}]\", \"\").toLowerCase\n p == p.reverse\n }\n","language":"Scala"},{"code":"import scala.annotation.tailrec\n\n def isPalindromeRec(s: String) = {\n @tailrec\n def inner(s: String): Boolean =\n (s.length <= 1) || (s.head == s.last) && inner(s.tail.init)\n\n (s.size >= 2) && inner(s)\n }\n","language":"Scala"},{"code":" // Testing\n assert(!isPalindrome(\"\"))\n assert(!isPalindrome(\"z\"))\n assert(isPalindrome(\"amanaplanacanalpanama\"))\n assert(!isPalindrome(\"Test 1,2,3\"))\n assert(isPalindrome(\"1 2 1\"))\n assert(!isPalindrome(\"A man a plan a canal Panama.\"))\n\n assert(!isPalindromeSentence(\"\"))\n assert(!isPalindromeSentence(\"z\"))\n assert(isPalindromeSentence(\"amanaplanacanalpanama\"))\n assert(!isPalindromeSentence(\"Test 1,2,3\"))\n assert(isPalindromeSentence(\"1 2 1\"))\n assert(isPalindromeSentence(\"A man a plan a canal Panama.\"))\n\n assert(!isPalindromeRec(\"\"))\n assert(!isPalindromeRec(\"z\"))\n assert(isPalindromeRec(\"amanaplanacanalpanama\"))\n assert(!isPalindromeRec(\"Test 1,2,3\"))\n assert(isPalindromeRec(\"1 2 1\"))\n assert(!isPalindromeRec(\"A man a plan a canal Panama.\"))\n\n println(\"Successfully completed without errors.\")\n","language":"Scala"},{"code":"(define (palindrome? s)\n (let ((chars (string->list s)))\n (equal? chars (reverse chars))))\n","language":"Scheme"},{"code":"(define (palindrome? s)\n (let loop ((i 0)\n (j (- (string-length s) 1)))\n (or (>= i j)\n (and (char=? (string-ref s i) (string-ref s j))\n (loop (+ i 1) (- j 1))))))\n\n;; Or:\n(define (palindrome? s)\n (let loop ((s (string->list s))\n (r (reverse (string->list s))))\n (or (null? s)\n (and (char=? (car s) (car r))\n (loop (cdr s) (cdr r))))))\n\n> (palindrome? \"ingirumimusnocteetconsumimurigni\")\n#t\n> (palindrome? \"This is not a palindrome\")\n#f\n>\n","language":"Scheme"},{"code":"h\n:l\ns/^\\(.\\)\\(.*\\)\\1$/\\2/\ntl\n/../d\nx\n","language":"Sed"},{"code":"const func boolean: palindrome (in string: stri) is func\n result\n var boolean: isPalindrome is TRUE;\n local\n var integer: index is 0;\n var integer: length is 0;\n begin\n length := length(stri);\n for index range 1 to length div 2 do\n if stri[index] <> stri[length - index + 1] then\n isPalindrome := FALSE;\n end if;\n end for;\n end func;\n","language":"Seed7"},{"code":"palindrome(replace(\"in girum imus nocte et consumimur igni\", \" \", \"\"))\n","language":"Seed7"},{"code":"import <Utilities/Sequence.sl>;\n\nisPalindrome(string(1)) := equalList(string, reverse(string));\n","language":"SequenceL"},{"code":"isPalindrome(string(1)) :=\n\tlet\n\t\tcompares[i] := string[i] = string[size(string) - (i - 1)] foreach i within 1 ... (size(string) / 2);\n\tin\n\t\tall(compares);\n","language":"SequenceL"},{"code":"say \"noon\".is_palindrome # true\n","language":"Sidef"},{"code":"func palindrome(s) {\n s == s.reverse\n}\n","language":"Sidef"},{"code":"func palindrome(s) {\n if (s.len <= 1) {\n true\n }\n elsif (s.first != s.last) {\n false\n }\n else {\n __FUNC__(s.first(-1).last(-1))\n }\n}\n","language":"Sidef"},{"code":"BEGIN\n\n BOOLEAN PROCEDURE ISPALINDROME(T); TEXT T;\n BEGIN\n BOOLEAN RESULT;\n INTEGER I, J;\n I := 1;\n J := T.LENGTH;\n RESULT := TRUE;\n WHILE RESULT AND I < J DO\n BEGIN\n CHARACTER L, R;\n T.SETPOS(I); L := T.GETCHAR; I := I + 1;\n T.SETPOS(J); R := T.GETCHAR; J := J - 1;\n RESULT := L = R;\n END;\n ISPALINDROME := RESULT;\n END ISPALINDROME;\n\n TEXT T;\n FOR T :- \"\", \"A\", \"AA\", \"ABA\", \"SALALAS\", \"MADAMIMADAM\",\n \"AB\", \"AAB\", \"ABCBDA\"\n DO\n BEGIN\n OUTTEXT(IF ISPALINDROME(T) THEN \"IS \" ELSE \"ISN'T\");\n OUTTEXT(\" PALINDROME: \");\n OUTCHAR('\"');\n OUTTEXT(T);\n OUTCHAR('\"');\n OUTIMAGE;\n END;\n\nEND.\n","language":"Simula"},{"code":" 10 INPUT S$\n 20 FOR I=1 TO LEN S$/2\n 30 IF S$(I)<>S$(LEN S$-I+1) THEN GOTO 60\n 40 NEXT I\n 50 GOTO 70\n 60 PRINT \"NOT A \";\n 70 PRINT \"PALINDROME\"\n","language":"Sinclair-ZX81-BASIC"},{"code":" 15 GOSUB 90\n 80 STOP\n 90 LET T$=\"\"\n100 FOR I=1 TO LEN S$\n110 IF S$(I)>=\"A\" AND S$(I)<=\"Z\" THEN LET T$=T$+S$(I)\n120 NEXT I\n130 LET S$=T$\n140 RETURN\n","language":"Sinclair-ZX81-BASIC"},{"code":"s@(String traits) isPalindrome\n[\n (s lexicographicallyCompare: s reversed) isZero\n].\n","language":"Slate"},{"code":"s@(Sequence traits) isPalindrome\n[\n s isEmpty\n ifTrue: [True]\n ifFalse: [(s first = s last) /\\ [(s sliceFrom: 1 to: s indexLast - 1) isPalindrome]]\n].\n","language":"Slate"},{"code":"define: #p -> 'ingirumimusnocteetconsumimurigni'.\ninform: 'sequence ' ; p ; ' is ' ; (p isPalindrome ifTrue: [''] ifFalse: ['not ']) ; 'a palindrome.'.\n","language":"Slate"},{"code":"isPalindrome := [:aString |\n\tstr := (aString select: [:chr| chr isAlphaNumeric]) collect: [:chr | chr asLowercase].\n\tstr = str reversed.\n\t].\n","language":"Smalltalk"},{"code":"String extend [\n palindro [ \"Non-recursive\"\n ^ self = (self reverse)\n ]\n palindroR [ \"Recursive\"\n (self size) <= 1 ifTrue: [ ^true ]\n ifFalse: [ |o i f| o := self asOrderedCollection.\n i := o removeFirst.\n f := o removeLast.\n i = f ifTrue: [ ^ (o asString) palindroR ]\n ifFalse: [ ^false ]\n ]\n ]\n].\n","language":"Smalltalk"},{"code":"('hello' palindro) printNl.\n('hello' palindroR) printNl.\n('ingirumimusnocteetconsumimurigni' palindro) printNl.\n('ingirumimusnocteetconsumimurigni' palindroR) printNl.\n","language":"Smalltalk"},{"code":"SequenceableCollection>>isPalindrome\n\t^self reverse = self\n","language":"Smalltalk"},{"code":" define('pal(str)') :(pal_end)\npal str notany(&ucase &lcase) = :s(pal)\n str = replace(str,&ucase,&lcase)\n leq(str,reverse(str)) :s(return)f(freturn)\npal_end\n\n define('palchk(str)tf') :(palchk_end)\npalchk output = str;\n tf = 'False'; tf = pal(str) 'True'\n output = 'Palindrome: ' tf :(return)\npalchk_end\n\n* # Test and display\n palchk('Able was I ere I saw Elba')\n palchk('In girum imus nocte et consumimur igni')\n palchk('The quick brown fox jumped over the lazy dogs')\nend\n","language":"SNOBOL4"},{"code":"#!/usr/local/bin/spar\npragma annotate( summary, \"palindrome\" );\npragma annotate( description, \"Write at least one function/method (or whatever it is\" );\npragma annotate( description, \"called in your preferred language) to check if a\" );\npragma annotate( description, \"sequence of characters (or bytes) is a palindrome or\" );\npragma annotate( description, \"not. The function must return a boolean value (or\" );\npragma annotate( description, \"something that can be used as boolean value, like an\" );\npragma annotate( description, \"integer).\" );\npragma annotate( see_also, \"http://rosettacode.org/wiki/Palindrome_detection\" );\npragma annotate( author, \"Ken O. Burtch\" );\npragma license( unrestricted );\n\npragma restriction( no_external_commands );\n\nprocedure palindrome is\n\n function is_palindrome( text : string ) return boolean is\n begin\n for offset in 0..strings.length( text ) / 2 -1 loop\n if strings.element( text, offset+1) /= strings.element( text, positive( strings.length( text ) - offset ) ) then\n return false;\n end if;\n end loop;\n return true;\n end is_palindrome;\n\n sentence : string;\n result : boolean;\nbegin\n sentence := \"this is a test\";\n result := is_palindrome( sentence );\n put( sentence ) @ ( \" : \" ) @ ( result );\n new_line;\n\n sentence := \"ablewasiereisawelba\";\n result := is_palindrome( sentence );\n put( sentence ) @ ( \" : \" ) @ ( result );\n new_line;\nend palindrome;\n","language":"SparForte"},{"code":"SET @txt = REPLACE('In girum imus nocte et consumimur igni', ' ', '');\nSELECT REVERSE(@txt) = @txt;\n","language":"SQL"},{"code":"fun palindrome s =\n let val cs = explode s in\n cs = rev cs\n end\n","language":"Standard-ML"},{"code":"import Foundation\n\n// Allow for easy character checking\nextension String {\n subscript (i: Int) -> String {\n return String(Array(self)[i])\n }\n}\n\nfunc isPalindrome(str:String) -> Bool {\n if (count(str) == 0 || count(str) == 1) {\n return true\n }\n let removeRange = Range<String.Index>(start: advance(str.startIndex, 1), end: advance(str.endIndex, -1))\n if (str[0] == str[count(str) - 1]) {\n return isPalindrome(str.substringWithRange(removeRange))\n }\n return false\n}\n","language":"Swift"},{"code":"func isPal(str: String) -> Bool {\n let c = str.characters\n return lazy(c).reverse()\n .startsWith(c[c.startIndex...advance(c.startIndex, c.count / 2)])\n}\n","language":"Swift"},{"code":"templates palindrome\n [$...] -> #\n when <=$(last..first:-1)> do '$...;' !\nend palindrome\n\n[['rotor', 'racecar', 'level', 'rosetta']... -> palindrome ] -> !OUT::write\n","language":"Tailspin"},{"code":"package require Tcl 8.5\nproc palindrome {s} {\n return [expr {$s eq [string reverse $s]}]\n}\n","language":"Tcl"},{"code":"proc palindrome_r {s} {\n if {[string length $s] <= 1} {\n return true\n } elseif {[string index $s 0] ne [string index $s end]} {\n return false\n } else {\n return [palindrome_r [string range $s 1 end-1]]\n }\n}\n","language":"Tcl"},{"code":"set p ingirumimusnocteetconsumimurigni\nputs \"'$p' is palindrome? [palindrome $p]\"\nputs \"'$p' is palindrome? [palindrome_r $p]\"\n","language":"Tcl"},{"code":"$$ MODE TUSCRIPT\npal =\"ingirumimusnocteetconsumimurigni\"\npal_r=TURN(pal)\nSELECT pal\nCASE $pal_r\nPRINT \"true\"\nDEFAULT\nPRINT/ERROR \"untrue\"\nENDSELECT\n","language":"TUSCRIPT"},{"code":"const detectNonLetterRegexp=/[^A-ZÀ-ÞЀ-Я]/g;\n\nfunction stripDiacritics(phrase:string){\n return phrase.normalize('NFD').replace(/[\\u0300-\\u036f]/g, \"\")\n}\n\nfunction isPalindrome(phrase:string){\n const TheLetters = stripDiacritics(phrase.toLocaleUpperCase().replace(detectNonLetterRegexp, ''));\n const middlePosition = TheLetters.length/2;\n const leftHalf = TheLetters.substr(0, middlePosition);\n const rightReverseHalf = TheLetters.substr(-middlePosition).split('').reverse().join('');\n return leftHalf == rightReverseHalf;\n}\n\nconsole.log(isPalindrome('Sueño que esto no es un palíndromo'))\nconsole.log(isPalindrome('Dábale arroz a la zorra el abad!'))\nconsole.log(isPalindrome('Я иду с мечем судия'))\n","language":"TypeScript"},{"code":"≍⇌.\"tacocat\"\n","language":"Uiua"},{"code":"if [[ \"${text}\" == \"$(rev <<< \"${text}\")\" ]]; then\n echo \"Palindrome\"\nelse\n echo \"Not a palindrome\"\nfi\n","language":"UNIX-Shell"},{"code":"#import std\n\npalindrome = ~&cixE\\letters+ * -:~& ~=`A-~rlp letters\n","language":"Ursala"},{"code":"#cast %bL\n\nexamples = palindrome* <'abccba','foo ba rra bo of','notone'>\n","language":"Ursala"},{"code":"fn is_pal_1(ss string) bool {\n s := ss.runes()\n for i in 0..s.len/2 {\n if s[i] != s[s.len-1-i]{\n return false\n }\n }\n return true\n}\n\nfn is_pal_2(word string) bool {\n\tif word == word.runes().reverse().string() {return true}\n\treturn false\n}\n\nfn main() {\n\twords := [\"rotor\", \"rosetta\", \"step on no pets\", \"été\", \"wren\", \"🦊😀🦊\"]\n\tprintln('Check from is_pal_1:')\n for word in words {\n println('$word => ${is_pal_1(word)}')\n }\n\tprintln('\\nCheck from is_pal_2:')\n for word in words {\n println('$word => ${is_pal_2(word)}')\n }\n}\n","language":"V-(Vlang)"},{"code":"bool is_palindrome (string str) {\n var tmp = str.casefold ().replace (\" \", \"\");\n return tmp == tmp.reverse ();\n}\n\nint main (string[] args) {\n print (is_palindrome (args[1]).to_string () + \"\\n\");\n return 0;\n}\n","language":"Vala"},{"code":"Public Function isPalindrome(aString as string) as Boolean\ndim tempstring as string\n tempstring = Lcase(Replace(aString, \" \", \"\"))\n isPalindrome = (tempstring = Reverse(tempstring))\nEnd Function\n","language":"VBA"},{"code":"function Squish( s1 )\n\tdim sRes\n\tsRes = vbNullString\n\tdim i, c\n\tfor i = 1 to len( s1 )\n\t\tc = lcase( mid( s1, i, 1 ))\n\t\tif instr( \"abcdefghijklmnopqrstuvwxyz0123456789\", c ) then\n\t\t\tsRes = sRes & c\n\t\tend if\n\tnext\n\tSquish = sRes\nend function\n\t\t\nfunction isPalindrome( s1 )\n\tdim squished\n\tsquished = Squish( s1 )\n\tisPalindrome = ( squished = StrReverse( squished ) )\nend function\n","language":"VBScript"},{"code":"wscript.echo isPalindrome( \"My dog has fleas\")\nwscript.echo isPalindrome( \"Madam, I'm Adam.\")\nwscript.echo isPalindrome( \"1 on 1\")\nwscript.echo isPalindrome( \"In girum imus nocte et consumimur igni\")\n","language":"VBScript"},{"code":":PALINDROME:\nEOL #2 = Cur_Col-2\nBOL\nfor (#1 = 0; #1 <= #2/2; #1++) {\n if (CC(#1) != CC(#2-#1)) { Return(0) }\n}\nReturn(1)\n","language":"Vedit-macro-language"},{"code":"Call(\"PALINDROME\")\nif (Return_Value) {\n Statline_Message(\"Yes\")\n} else {\n Statline_Message(\"No\")\n}\nReturn\n","language":"Vedit-macro-language"},{"code":"Module Module1\n\n Function IsPalindrome(p As String) As Boolean\n Dim temp = p.ToLower().Replace(\" \", \"\")\n Return StrReverse(temp) = temp\n End Function\n\n Sub Main()\n Console.WriteLine(IsPalindrome(\"In girum imus nocte et consumimur igni\"))\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"@let {\n ; Using a hook\n pal1 @(= @rev)\n ; Function with argument\n pal2 &s = s @rev s\n ; for inexact palindromes\n pal3 ^(@(= @rev) .toLowerCase. &\\@replace[&\"\\s+\"g \"\"])\n [[\n !pal1 \"abcba\"\n !pal2 \"abcbac\"\n !pal3 \"In girum imus nocte et consumimur igni\"\n ]]\n}\n","language":"Wortel"},{"code":"var isPal = Fn.new { |word| word == ((word.count > 0) ? word[-1..0] : \"\") }\n\nSystem.print(\"Are the following palindromes?\")\nfor (word in [\"rotor\", \"rosetta\", \"step on no pets\", \"été\", \"wren\", \"🦊😀🦊\"]) {\n System.print(\" %(word) => %(isPal.call(word))\")\n}\n","language":"Wren"},{"code":"; x86_84 Linux nasm\nsection .text\n\nisPalindrome:\n mov rsi, rax\n mov rdi, rax\n\n get_end:\n cmp byte [rsi], 0\n je get_result\n inc rsi\n jmp get_end\n\n get_result:\n mov rax, 0\n dec rsi\n\n compare:\n mov cl, byte [rdi]\n cmp byte [rsi], cl\n jne not_palindrome\n cmp rsi, rdi\n je palindrome\n inc rdi\n cmp rdi, rsi\n je palindrome\n dec rsi\n jmp compare\n\n not_palindrome:\n mov rax, 0\n ret\n palindrome:\n mov rax, 1\n ret\n","language":"X86-Assembly"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nstring 0; \\use zero-terminated strings\n\nfunc StrLen(Str); \\Return number of characters in an ASCIIZ string\nchar Str;\nint I;\nfor I:= 0 to -1>>1-1 do\n if Str(I) = 0 then return I;\n\nfunc Palindrome(S); \\Return 'true' if S is a palindrome\nchar S;\nint L, I;\n[L:= StrLen(S);\nfor I:= 0 to L/2-1 do\n if S(I) # S(L-1-I) then return false;\nreturn true;\n]; \\Palindrome\n\nint Word, I;\n[Word:=\n [\"otto\", \"mary\", \"ablewasiereisawelba\", \"ingirumimusnocteetconsumimurigni\"];\nfor I:= 0 to 4-1 do\n [Text(0, if Palindrome(Word(I)) then \"yes\" else \"no\");\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"func is_palindrome(str) {\n s = strchar(str)(:-1);\n return allof(s == s(::-1));\n}\n\nfunc prep_palindrome(str) {\n s = strchar(strlower(str));\n w = where(s >= 'a' & s <= 'z');\n return strchar(s(w));\n}\n","language":"Yorick"},{"code":"\t;\n\t; Check if input string is a palindrome using Z80 assembly language\n\t;\n\t; Runs under CP/M 3.1 on YAZE-AG-2.51.2 Z80 emulator\n\t; Assembled with zsm4 on same emulator/OS, uses macro capabilities of said assembler\n\t; Created with vim under Windows\n\t;\n\t; 2023-04-17 Xorph\n\t;\n\n\t;\n\t; Useful definitions\n\t;\n\n\tbdos\tequ 05h\t\t; Call to CP/M BDOS function\n\tstrdel\tequ 6eh\t\t; Set string delimiter\n\treadstr\tequ 0ah\t\t; Read string from console\n\twrtstr\tequ 09h\t\t; Write string to console\n\n\tnul\tequ 00h\t\t; ASCII control characters\n\tesc\tequ 1bh\n\tcr\tequ 0dh\n\tlf\tequ 0ah\n\n\tbuflen\tequ 30h\t\t; Length of input buffer\n\n\t;\n\t; Macros for BDOS calls\n\t;\n\nsetdel \tmacro\tchar\t\t; Set string delimiter to char\n\tld\tc,strdel\n\tld\te,char\n\tcall\tbdos\n\tendm\n\nprint \tmacro\tmsg\t\t; Output string to console\n\tld\tc,wrtstr\n\tld\tde,msg\n\tcall\tbdos\n\tendm\n\nnewline\tmacro\t\t\t; Print newline\n\tld\tc,wrtstr\n\tld\tde,crlf\n\tcall\tbdos\n\tendm\n\nreadln \tmacro\tbuf\t\t; Read a line from input\n\tld\tc,readstr\n\tld\tde,buf\n\tcall\tbdos\n\tendm\n\n\t;\n\t; Other macros\n\t;\n\ntoupper\tmacro\n\tlocal\tnotlow\n\tcp\t'a'\n\tjr\tc,notlow\n\tcp\t'z'+1\n\tjr\tnc,notlow\n\tadd\ta,'A'-'a'\nnotlow:\n\tendm\n\n\t;\n\t; =====================\n\t; Start of main program\n\t; =====================\n\t;\n\n\tcseg\n\n\tsetdel\tnul\t\t; Set string delimiter to 00h\n\n\tld\tb,buflen\t; Clear input buffer\n\tld\thl,bufcont\nclrloop:\n\tld\t(hl),0\n\tinc\thl\n\tdjnz\tclrloop\n\n\treadln\tinputbuf\t; Read a line from input\n\tnewline\t\t\t; Newline is discarded during input, so write one...\n\n\tld\tb,buflen\t; Convert all to uppercase\n\tld\thl,bufcont\nuprloop:\n\tld\ta,(hl)\n\ttoupper\n\tld\t(hl),a\n\tinc\thl\n\tdjnz\tuprloop\n\n\tld\ta,(inputbuf+1)\t; Eliminate all spaces\n\tld\tb,a\t\n\tld\tc,0\t\t; Counter for non-spaces\n\tld\tix,bufcont\t; String (buffer) address in ix\n\tld\tiy,compress\t; Compressed string (without blanks) goes to iy\nspcloop:\n\tld\ta,(ix)\n\tcp\t' '\n\tjr\tz,isblank\n\tinc\tc\t\t; If not blank, move to (iy) and increment counter\n\tld\t(iy),a\n\tinc\tiy\nisblank:\n\tinc\tix\n\tdjnz\tspcloop\n\n\tld\ta,c\t\t; Move back to original buffer\n\tld\t(inputbuf+1),a\t; New length of text without spaces for further processing\n\tld\tb,0\t\t; bc now set correctly to new length\n\tld\tde,bufcont\t; Set up and use block move\n\tld\thl,compress\n\tldir\n\tex\tde,hl\t\t; Add nul terminator - target is in de, but memory load only via hl\n\tld\t(hl),nul\n\n\tprint\tbufcont\t\t; Print actual text before start of check\n\tnewline\n\n\tld\ta,(inputbuf+1)\t; Get number of characters entered into bc, if 0 quit\n\tld\tb,0\t\t; bc can be used for adding the text length to iy\n\tcp\tb\t\t; b is 0 for setting bc correctly and so can also be used for comparison\n\tjr\tz,isnopali\n\tld\tc,a\t\t; bc is now loaded correctly\n\n\tld\tix,bufcont\t; ix points to start of string\n\tld\tiy,bufcont\t; iy points to end of string: Let it point to start...\n\tadd\tiy,bc\t\t; ...and add the string's length - 1\n\tdec\tiy\n\n\tld\tb,c\t\t; Use b as counter for comparison (djnz)\n\tsrl\tb\t\t; Only need to check half the chars - if odd, the middle char need not be checked\n\nchkloop:\n\tld\ta,(ix)\t\t; Actual comparison: Get (ix) into a and compare with (iy)\n\tcp\t(iy)\t\t; Upon mismatch, quit immediately\n\tjr\tnz,isnopali\n\tinc\tix\n\tdec\tiy\n\tdjnz\tchkloop\n\n\t; All comparisons ok, print success - fall through to ispali\n\nispali:\n\tld\tde,messagey\n\tjr\twriteres\n\nisnopali:\n\tld\tde,messagen\n\t; Fall through to writeres\n\nwriteres:\n\tld\tc,wrtstr\t; Echo the text on screen\n\tcall\tbdos\n\tnewline\n\n\tret\t\t\t; Return to CP/M\n\n\t;\n\t; ===================\n\t; End of main program\n\t; ===================\n\t;\n\n\t;\n\t; ================\n\t; Data definitions\n\t; ================\n\t;\n\n\tdseg\n\ninputbuf:\t\t\t; Input buffer\n\tdefb\tbuflen\t\t; Maximum possible length\n\tdefb\t00h\t\t; Returned length of actual input\nbufcont:\n\tdefs\tbuflen\t\t; Actual input area\ncompress:\n\tdefs\tbuflen\t\t; For eliminating spaces\n\nmessagey:\n\tdefz\t'Yes'\t\t; Is a Palindrome\n\nmessagen:\n\tdefz\t'No'\t\t; Is not a Palindrome\n\ncrlf:\tdefb\tcr,lf,nul\t; Generic newline\n","language":"Z80-Assembly"},{"code":"fcn pali(text){\n if (text.len()<2) return(False);\n text==text.reverse();\n}\nfcn pali2(text){ pali((text - \" \\t\\n.,\").toLower()) } // or whatever punctuation is\n","language":"Zkl"},{"code":"program: palindrome\n case: 1\n input: abcdcba\n output: true\n\n case: 2\n input: dog\n output: false\n\n case: 3\n input: x\n output: true\n\n case: 4\n input: abc\n output: false\n","language":"Zoea"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Recursion\\n- String manipulation\\n- Classic CS problems and programs\\n- Palindromes\\nfrom: http://rosettacode.org/wiki/Palindrome_detection\\nnote: Text processing\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A [[wp:Palindrome|palindrome]] is a phrase which reads the same backward and forward.\\n\\n{{task heading}}\\n\\nWrite a function or program that checks whether a given sequence of characters (or, if you prefer, bytes) \\nis a palindrome.\\n\\n'''''For extra credit:'''''\\n* Support Unicode characters.\\n* Write a second function (possibly as a wrapper to the first) which detects ''inexact'' palindromes, i.e. phrases that are palindromes if white-space and punctuation is ignored and case-insensitive comparison is used.\\n\\n{{task heading|Hints}}\\n* It might be useful for this task to know how to [[Reversing a string|reverse a string]].\\n* This task's entries might also form the subjects of the task [[Test a function]].\\n\\n{{task heading|Related tasks}}\\n{{Related tasks/Word plays}}\\n\\n\\n{{Template:Strings}}\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F is_palindrome(s)\\n R s == reversed(s)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Reverse b string 25/06/2018\\nPALINDRO CSECT\\n USING PALINDRO,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n STM R14,R12,12(R13) prolog\\n ST R13,4(R15) \\\"\\n ST R15,8(R13) \\\"\\n LR R13,R15 \\\"\\n LA R8,BB @b[1]\\n LA R9,AA+L'AA-1 @a[n-1]\\n LA R6,1 i=1\\nLOOPI C R6,=A(L'AA) do i=1 to length(a)\\n BH ELOOPI leave i\\n MVC 0(1,R8),0(R9) substr(b,i,1)=substr(a,n-i+1,1)\\n LA R8,1(R8) @b=@b+1\\n BCTR R9,0 @a=@a-1\\n LA R6,1(R6) i=i+1\\n B LOOPI end do\\nELOOPI XPRNT AA,L'AA print a\\n CLC BB,AA if b=a\\n BNE SKIP\\n XPRNT MSG,L'MSG then print msg\\nSKIP L R13,4(0,R13) epilog\\n LM R14,R12,12(R13) \\\"\\n XR R15,R15 \\\"\\n BR R14 exit\\nAA DC CL32'INGIRUMIMUSNOCTEETCONSUMIMURIGNI' a\\nBB DS CL(L'AA) b\\nMSG DC CL23'IT IS A TRUE PALINDROME'\\n YREGS\\n END PALINDRO\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\torg\\t100h\\n\\tjmp\\tdemo\\n\\t;;;\\tIs the $-terminated string at DE a palindrome?\\n\\t;;;\\tReturns: zero flag set if palindrome\\npalin:\\tmov\\th,d\\t; Find end of string\\n\\tmov\\tl,e\\n\\tmvi\\ta,'$'\\n\\tcmp\\tm\\t; The empty string is a palindrome\\n\\trz\\npend:\\tinx\\th\\t; Scan until terminator found\\n\\tcmp\\tm\\n\\tjnz\\tpend\\n\\tdcx\\th\\t; Move to last byte of text\\nptest:\\tldax\\td\\t; Load char at left pointer\\n\\tcmp \\tm\\t; Compare to char at right pointer\\n\\trnz\\t\\t; If not equal, not a palindrome\\n\\tinx\\td\\t; Move pointers\\n\\tdcx\\th\\n\\tmov\\ta,d\\t; Check if left pointer is before right pointer\\n\\tcmp \\th\\t; High byte\\n\\tjc\\tptest\\n\\tmov\\ta,e\\t; Low byte\\n\\tcmp\\tl\\n\\tjc\\tptest\\n\\txra\\ta\\t; Made it to the end - set zero flag\\n\\tret\\t\\t; Return\\n\\t;;;\\tTest the routine on a few examples\\ndemo:\\tlxi\\th,words\\t; Word list pointer\\nloop:\\tmov\\te,m\\t; Load word pointer\\n\\tinx\\th\\n\\tmov\\td,m\\n\\tinx\\th\\n\\tmov\\ta,e\\t; Stop when zero reached\\n\\tora\\td\\n\\trz\\n\\tpush\\th\\t; Keep word list pointer\\n\\tcall\\tpstr\\t; Print word\\n\\tcall\\tpalin\\t; Check if palindrome\\n\\tlxi\\td,no\\n\\tjnz \\tprint\\t; Print \\\"no\\\" if not a palindrome\\n\\tlxi\\td,yes\\t; Print \\\"yes\\\" otherwise\\nprint:\\tcall\\tpstr\\n\\tpop\\th\\n\\tjmp \\tloop\\n\\t;;;\\tPrint strint using CP/M keeping DEHL registers\\npstr:\\tpush\\td\\n\\tpush\\th\\n\\tmvi\\tc,9\\n\\tcall\\t5\\n\\tpop\\th\\n\\tpop\\td\\n\\tret\\nyes:\\tdb\\t': yes',13,10,'$'\\nno:\\tdb\\t': no',13,10,'$'\\t\\nwords:\\tdw\\tw1,w2,w3,w4,0\\nw1:\\tdb\\t'rotor$'\\nw2:\\tdb\\t'racecar$'\\nw3:\\tdb\\t'level$'\\nw4:\\tdb\\t'rosetta$'\\n\",\n \"language\": \"8080-Assembly\"\n },\n {\n \"code\": \"\\tcpu\\t8086\\n\\torg\\t100h\\nsection\\t.text\\n\\tjmp\\tdemo\\n\\t;;;\\tCheck if the $-terminated string in [DS:SI] is a palindrome.\\n\\t;;;\\tReturns with zero flag set if so.\\n\\t;;;\\tDestroyed: AL, CX, SI, DI, ES.\\npalin:\\tpush\\tes\\t\\t; Set ES=DS.\\n\\tpop\\tds\\n\\tmov\\tal,'$'\\t\\t; Find end of string\\n\\tmov\\tcx,-1\\n\\tmov\\tdi,si\\n\\trepne\\tscasb\\n\\tdec\\tdi\\t\\t; Move back to last actual character\\n.loop:\\tcmp\\tsi,di\\n\\tja\\t.ok\\t\\t; If SI > DI, it is a palindrome\\n\\tlodsb\\n\\tdec\\tdi\\t\\t; Compare left character to right character\\n\\tcmp\\tal,[di]\\n\\tjne\\t.no\\t\\t; If not equal, not a palindrome\\n\\tjmp \\t.loop\\t\\t; Otherwise, try next pair of characters\\n.ok:\\tcmp\\tal,al\\t\\t; Set zero flag\\n.no: \\tret \\t\\t\\t; Return\\n\\t;;;\\tTry the routine on a couple of strings\\ndemo:\\tmov\\tsi,words\\n.loop:\\tlodsw\\t\\t\\t; Grab word pointer\\n\\ttest\\tax,ax\\t\\t; Zero?\\n\\tjz\\t.done\\t\\t; Then we are done\\n\\tmov\\tdx,ax\\t\\t; Otherwise, print word\\n\\tmov\\tah,9\\t\\t\\n\\tint\\t21h\\n\\txchg\\tbp,si\\t\\t; Keep array pointer in BP\\n\\txchg\\tsi,dx\\t\\t; Put word pointer in SI\\n\\tcall\\tpalin\\t\\t; Check if it is a palindrome\\n\\tmov\\tdx,yes\\t\\t; Print 'yes'...\\n\\tjz\\t.print\\t\\t; ...if it is a palindrome\\n\\tmov\\tdx,no\\t\\t; Otherwise, print 'no'\\n.print:\\tint \\t21h\\n\\txchg\\tsi,bp\\t\\t; Restore array pointer\\n\\tjmp\\t.loop\\t\\t; Get next word.\\n.done:\\tret\\nyes:\\tdb\\t': yes',13,10,'$'\\t; Yes and no\\nno:\\tdb\\t': no',13,10,'$'\\nwords:\\tdw\\t.w1,.w2,.w3,.w4,.w5,0\\n.w1:\\tdb\\t'rotor$'\\t; Words to check\\n.w2:\\tdb\\t'racecar$'\\n.w3:\\tdb\\t'level$'\\n.w4:\\tdb\\t'redder$'\\n.w5:\\tdb\\t'rosetta$'\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"(defun reverse-split-at-r (xs i ys)\\n (if (zp i)\\n (mv xs ys)\\n (reverse-split-at-r (rest xs) (1- i)\\n (cons (first xs) ys))))\\n\\n(defun reverse-split-at (xs i)\\n (reverse-split-at-r xs i nil))\\n\\n(defun is-palindrome (str)\\n (let* ((lngth (length str))\\n (idx (floor lngth 2)))\\n (mv-let (xs ys)\\n (reverse-split-at (coerce str 'list) idx)\\n (if (= (mod lngth 2) 1)\\n (equal (rest xs) ys)\\n (equal xs ys)))))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"(defun palindrome-type (text)\\n (cond ((exact-palindrom-p text) 'exact)\\n ((inexact-palindrome-p text) 'inexact)\\n (t 'not-a-palindrome)))\\n\\n(defun exact-palindrom-p (text)\\n (eq text (implode (reverse (explode text)))))\\n\\n(defun inexact-palindrome-p (text)\\n (exact-palindrom-p (implode (normalise (explode text)))))\\n\\n(defun reverse (list (result . ()))\\n (map '(lambda (e) (setq result (cons e result)))\\n list)\\n result)\\n\\n(defun normalise (chars)\\n (cond ((null chars)\\n nil)\\n ((not (alphanumeric-p (car chars)))\\n (normalise (cdr chars)))\\n ((upper-case-p (car chars))\\n (cons (to-lower-case (car chars))\\n (normalise (cdr chars))))\\n (t\\n (cons (car chars) (normalise (cdr chars))))))\\n\\n(defun between-p (lowest-value n highest-value)\\n (not (or (lessp n lowest-value)\\n (greaterp n highest-value))))\\n\\n(defun alphanumeric-p (ch)\\n (or (lower-case-p ch) (upper-case-p ch) (digit-p ch)))\\n\\n(defun digit-p (ch)\\n (between-p (add1 (ordinal '/))\\n (ordinal ch)\\n (sub1 (ordinal ':))))\\n\\n(defun upper-case-p (ch)\\n (between-p (ordinal 'A) (ordinal ch) (ordinal 'Z)))\\n\\n(defun lower-case-p (ch)\\n (between-p (ordinal 'a) (ordinal ch) (ordinal 'z)))\\n\\n(defun to-lower-case (ch)\\n (character (plus (ordinal ch)\\n (difference (ordinal 'a) (ordinal 'A)))))\\n\\n(defun examples ()\\n (map '(lambda (text)\\n (printc '!\\\" text '!\\\"\\n '! is! (palindrome-type text)))\\n '(a\\n abba Abba\\n abcba\\n baba\\n Able! was! I! ere! I! saw! Elba!!\\n In! girum! imus! nocte,! et! consumimur! igni)))\\n\",\n \"language\": \"Acornsoft-Lisp\"\n },\n {\n \"code\": \"BYTE FUNC Palindrome(CHAR ARRAY s)\\n BYTE l,r\\n\\n l=1 r=s(0)\\n WHILE l<r\\n DO\\n IF s(l)#s(r) THEN RETURN (0) FI\\n l==+1 r==-1\\n OD\\nRETURN (1)\\n\\nBYTE FUNC IsIgnored(BYTE c)\\n IF (c>=' AND c<='/) OR\\n (c>=': AND c<='@) OR\\n (c>='[ AND c<='_) THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nBYTE FUNC ToUpper(BYTE c)\\n IF c>='a AND c<='z THEN\\n RETURN (c-'a+'A)\\n FI\\nRETURN (c)\\n\\nBYTE FUNC InexactPalindrome(CHAR ARRAY s)\\n BYTE l,r,lc,rc\\n\\n l=1 r=s(0)\\n WHILE l<r\\n DO\\n WHILE IsIgnored(s(l))\\n DO\\n l==+1\\n IF l>=r THEN RETURN (1) FI\\n OD\\n WHILE IsIgnored(s(r))\\n DO\\n r==-1\\n IF l>=r THEN RETURN (1) FI\\n OD\\n\\n lc=ToUpper(s(l))\\n rc=ToUpper(s(r))\\n\\n IF lc#rc THEN RETURN (0) FI\\n l==+1 r==-1\\n OD\\nRETURN (1)\\n\\nPROC Test(CHAR ARRAY s)\\n IF Palindrome(s) THEN\\n PrintF(\\\"'%S' is a palindrome%E%E\\\",s)\\n ELSEIF InexactPalindrome(s) THEN\\n PrintF(\\\"'%S' is an inexact palindrome%E%E\\\",s)\\n ELSE\\n PrintF(\\\"'%S' is not a palindrome%E%E\\\",s)\\n FI\\nRETURN\\n\\nPROC Main()\\n Test(\\\"rotavator\\\")\\n Test(\\\"13231+464+989=989+464+13231\\\")\\n Test(\\\"Was it a car or a cat I saw?\\\")\\n Test(\\\"Did Hannah see bees? Hannah did.\\\")\\n Test(\\\"This sentence is not a palindrome.\\\")\\n Test(\\\"123 456 789 897 654 321\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function isPalindrome(str:String):Boolean\\n{\\n\\tfor(var first:uint = 0, second:uint = str.length - 1; first < second; first++, second--)\\n\\t\\tif(str.charAt(first) != str.charAt(second)) return false;\\n\\treturn true;\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"function Palindrome (Text : String) return Boolean is\\nbegin\\n for Offset in 0..Text'Length / 2 - 1 loop\\n if Text (Text'First + Offset) /= Text (Text'Last - Offset) then\\n return False;\\n end if;\\n end loop;\\n return True;\\nend Palindrome;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"function Palindrome (Text : String) return Boolean is\\n(for all i in Text'Range => Text(i)= Text(Text'Last-i+Text'First));\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# Iterative #\\nPROC palindrome = (STRING s)BOOL:(\\n FOR i TO UPB s OVER 2 DO\\n IF s[i] /= s[UPB s-i+1] THEN GO TO return false FI\\n OD;Power\\n else: TRUE EXIT\\n return false: FALSE\\n);\\n\\n# Recursive #\\nPROC palindrome r = (STRING s)BOOL:\\n IF LWB s >= UPB s THEN TRUE\\n ELIF s[LWB s] /= s[UPB s] THEN FALSE\\n ELSE palindrome r(s[LWB s+1:UPB s-1])\\n FI\\n;\\n\\n# Test #\\nmain:\\n(\\n STRING t = \\\"ingirumimusnocteetconsumimurigni\\\";\\n FORMAT template = $\\\"sequence \\\"\\\"\\\"g\\\"\\\"\\\" \\\"b(\\\"is\\\",\\\"isnt\\\")\\\" a palindrome\\\"l$;\\n\\n printf((template, t, palindrome(t)));\\n printf((template, t, palindrome r(t)))\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" {⍵≡⌽⍵} 'abc'\\n0\\n {⍵≡⌽⍵} '⍋racecar⍋'\\n1\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \" (⊢≡⌽) 'abc'\\n0\\n (⊢≡⌽) 'nun'\\n1\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"inexact←{Aa←(⎕A,⎕a) ⋄ (⊢≡⌽)(⎕a,⎕a)[Aa⍳⍵/⍨⍵∊Aa]}\\n inexact 'abc,-cbA2z'\\n0\\n inexact 'abc,-cbA2'\\n1\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use framework \\\"Foundation\\\"\\n\\n------ CASE-INSENSITIVE PALINDROME, IGNORING SPACES ? ----\\n\\n-- isPalindrome :: String -> Bool\\non isPalindrome(s)\\n s = intercalate(\\\"\\\", reverse of characters of s)\\nend isPalindrome\\n\\n-- toSpaceFreeLower :: String -> String\\non spaceFreeToLower(s)\\n script notSpace\\n on |λ|(s)\\n s is not space\\n end |λ|\\n end script\\n\\n intercalate(\\\"\\\", filter(notSpace, characters of toLower(s)))\\nend spaceFreeToLower\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n\\n isPalindrome(spaceFreeToLower(\\\"In girum imus nocte et consumimur igni\\\"))\\n\\n --> true\\n\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- filter :: (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 |λ|(v, i, xs) then set end of lst to v\\n end repeat\\n return lst\\n end tell\\nend filter\\n\\n\\n-- intercalate :: 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\\n-- Lift 2nd class handler function into 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- toLower :: String -> String\\non toLower(str)\\n set ca to current application\\n ((ca's NSString's stringWithString:(str))'s ¬\\n lowercaseStringWithLocale:(ca's NSLocale's currentLocale())) as text\\nend toLower\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on isPalindrome(txt)\\n set txt to join(txt, \\\"\\\") -- In case the input's a list (array).\\n return (txt = join(reverse of txt's characters, \\\"\\\"))\\nend isPalindrome\\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 isPalindrome(\\\"Radar\\\")\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"true\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"considering case\\n return isPalindrome(\\\"Radar\\\")\\nend considering\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"false\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"ignoring case, white space, hyphens and punctuation\\n return isPalindrome(\\\"Was it a 😀car, or a c😀at-I-saw?\\\")\\nend ignoring\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"true\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"100 DATA\\\"MY DOG HAS FLEAS\\\"\\n110 DATA\\\"MADAM, I'M ADAM.\\\"\\n120 DATA\\\"1 ON 1\\\"\\n130 DATA\\\"IN GIRUM IMUS NOCTE ET CONSUMIMUR IGNI\\\"\\n140 DATA\\\"A man, a plan, a canal: Panama!\\\"\\n150 DATA\\\"KAYAK\\\"\\n160 DATA\\\"REDDER\\\"\\n170 DATA\\\"H\\\"\\n180 DATA\\\"\\\"\\n\\n200 FOR L1 = 1 TO 9\\n210 READ W$ : GOSUB 300\\\" IS PALINDROME?\\n220 PRINT CHR$(34); W$; CHR$(34); \\\" IS \\\";\\n230 IF NOT PALINDROME THEN PRINT \\\"NOT \\\";\\n240 PRINT \\\"A PALINDROME\\\"\\n250 NEXT\\n260 END\\n\\n300 REMIS PALINDROME?\\n310 PA = 1\\n320 L = LEN(W$)\\n330 IF L = 0 THEN RETURN\\n340 FOR L0 = 1 TO L / 2 + .5\\n350 PA = MID$(W$, L0, 1) = MID$(W$, L - L0 + 1, 1)\\n360 IF PALINDROME THEN NEXT L0\\n370 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"@ Check whether the ASCII string in [r0] is a palindrome\\n@ Returns with zero flag set if palindrome.\\npalin:\\tmov\\tr1,r0\\t\\t@ Find end of string\\n1:\\tldrb\\tr2,[r1],#1\\t@ Grab character and increment pointer\\n\\ttst\\tr2,r2\\t\\t@ Zero yet?\\n\\tbne\\t1b\\t\\t@ If not try next byte\\n\\tsub\\tr1,r1,#2\\t@ Move R1 to last actual character.\\n2:\\tcmp\\tr0,r1\\t\\t@ When R0 >= R1,\\n\\tcmpgt\\tr2,r2\\t\\t@ make sure zero is set,\\n\\tbxeq\\tlr\\t\\t@ and stop (the string is a palindrome).\\n\\tldrb\\tr2,[r1],#-1\\t@ Grab [R1] (end) and decrement.\\n\\tldrb\\tr3,[r0],#1\\t@ Grab [R0] (begin) and increment\\n\\tcmp\\tr2,r3\\t\\t@ Are they equal?\\n\\tbxne\\tlr\\t\\t@ If not, it's not a palindrome.\\n\\tb\\t2b\\t\\t@ Otherwise, try next pair.\\n\\t\\n@ Try the function on a couple of strings\\n.global _start\\n_start:\\tldr\\tr8,=words\\t@ Word pointer\\n1:\\tldr\\tr9,[r8],#4\\t@ Grab word and move pointer\\n\\ttst\\tr9,r9\\t\\t@ Null?\\n\\tmoveq\\tr7,#1\\t\\t@ Then we're done; syscall 1 = exit\\n\\tswieq\\t#0\\n\\tmov\\tr1,r9\\t\\t@ Print the word\\n\\tbl\\tprint\\t\\t\\n\\tmov\\tr0,r9\\t\\t@ Test if the word is a palindrome\\n\\tbl\\tpalin\\n\\tldreq\\tr1,=yes\\t\\t@ \\\"Yes\\\" if it is a palindrome\\n\\tldrne\\tr1,=no\\t\\t@ \\\"No\\\" if it's not a palindrome\\n\\tbl\\tprint\\n\\tb\\t1b\\t\\t@ Next word\\n\\n@ Print zero-terminated string [r1] using Linux syscall\\nprint:\\tpush\\t{r7,lr}\\t\\t@ Keep R7 and link register\\n\\tmov\\tr2,r1\\t\\t@ Find end of string\\n1:\\tldrb\\tr0,[r2],#1\\t@ Grab character and increment pointer\\n\\ttst\\tr0,r0\\t\\t@ Zero yet?\\n\\tbne\\t1b\\t\\t@ If not, keep going\\n\\tsub\\tr2,r2,r1\\t@ Calculate length of string (bytes to write)\\n\\tmov\\tr0,#1\\t\\t@ Stdout = 1\\n\\tmov\\tr7,#4\\t\\t@ Syscall 4 = write\\n\\tswi\\t#0\\t\\t@ Make the syscall\\n\\tpop\\t{r7,lr}\\t\\t@ Restore R7 and link register\\n\\tbx\\tlr\\n\\t\\n@ Strings\\nyes:\\t.asciz\\t\\\": yes\\\\n\\\"\\t@ Output yes or no\\nno:\\t.asciz\\t\\\": no\\\\n\\\"\\nw1:\\t.asciz\\t\\\"rotor\\\"\\t\\t@ Words to test\\nw2:\\t.asciz\\t\\\"racecar\\\"\\nw3:\\t.asciz\\t\\\"level\\\"\\nw4:\\t.asciz\\t\\\"redder\\\"\\nw5:\\t.asciz\\t\\\"rosetta\\\"\\nwords:\\t.word\\tw1,w2,w3,w4,w5,0\\n\",\n \"language\": \"ARM-Assembly\"\n },\n {\n \"code\": \"palindrome?: $[seq] -> seq = reverse seq\\n\\nloop [\\\"abba\\\" \\\"boom\\\" \\\"radar\\\" \\\"civic\\\" \\\"great\\\"] 'wrd [\\n\\tprint [wrd \\\": palindrome?\\\" palindrome? wrd]\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"IsPalindrome(Str){\\n\\tLoop, Parse, Str\\n\\t\\tReversedStr := A_LoopField . ReversedStr\\n\\treturn, (ReversedStr == Str)?\\\"Exact\\\":(RegExReplace(ReversedStr,\\\"\\\\W\\\")=RegExReplace(Str,\\\"\\\\W\\\"))?\\\"Inexact\\\":\\\"False\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \";== AutoIt Version: 3.3.8.1\\n\\nGlobal $aString[7] = [ _\\n\\\"In girum imus nocte, et consumimur igni\\\", _ ; inexact palindrome\\n\\\"Madam, I'm Adam.\\\", _ ; inexact palindrome\\n\\\"salàlas\\\", _ ; exact palindrome\\n\\\"radar\\\", _ ; exact palindrome\\n\\\"Lagerregal\\\", _ ; exact palindrome\\n\\\"Ein Neger mit Gazelle zagt im Regen nie.\\\", _ ; inexact palindrome\\n\\\"something wrong\\\"] ; no palindrome\\nGlobal $sSpace42 = \\\" \\\"\\n\\nFor $i = 0 To 6\\n\\tIf _IsPalindrome($aString[$i]) Then\\n\\t\\tConsoleWrite('\\\"' & $aString[$i] & '\\\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is an exact palindrome.' & @LF)\\n\\tElse\\n\\t\\tIf _IsPalindrome( StringRegExpReplace($aString[$i], '\\\\W', '') ) Then\\n\\t\\t\\tConsoleWrite('\\\"' & $aString[$i] & '\\\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is an inexact palindrome.' & @LF)\\n\\t\\tElse\\n\\t\\t\\tConsoleWrite('\\\"' & $aString[$i] & '\\\"' & StringLeft($sSpace42, 42-StringLen($aString[$i])) & 'is not a palindrome.' & @LF)\\n\\t\\tEndIf\\n\\tEndIf\\nNext\\n\\nFunc _IsPalindrome($_string)\\n\\tLocal $iLen = StringLen($_string)\\n\\tFor $i = 1 To Int($iLen/2)\\n\\t\\tIf StringMid($_string, $i, 1) <> StringMid($_string, $iLen-($i-1), 1) Then Return False\\n\\tNext\\n\\tReturn True\\nEndFunc\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"\\\"In girum imus nocte, et consumimur igni\\\" is an inexact palindrome.\\n\\\"Madam, I'm Adam.\\\" is an inexact palindrome.\\n\\\"salàlas\\\" is an exact palindrome.\\n\\\"radar\\\" is an exact palindrome.\\n\\\"Lagerregal\\\" is an exact palindrome.\\n\\\"Ein Neger mit Gazelle zagt im Regen nie.\\\" is an inexact palindrome.\\n\\\"something wrong\\\" is not a palindrome.\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"function is_palindro(s)\\n{\\n if ( s == reverse(s) ) return 1\\n return 0\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"function is_palindro_r(s)\\n{\\n if ( length(s) < 2 ) return 1\\n if ( substr(s, 1, 1) != substr(s, length(s), 1) ) return 0\\n return is_palindro_r(substr(s, 2, length(s)-2))\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"BEGIN {\\n pal = \\\"ingirumimusnocteetconsumimurigni\\\"\\n print is_palindro(pal)\\n print is_palindro_r(pal)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"OPTION COMPARE TRUE\\n\\nINPUT \\\"Enter your line... \\\", word$\\n\\nIF word$ = REVERSE$(word$) THEN\\n PRINT \\\"This is an exact palindrome!\\\"\\nELIF EXTRACT$(word$, \\\"[[:punct:]]|[[:blank:]]\\\", TRUE) = REVERSE$(EXTRACT$(word$, \\\"[[:punct:]]|[[:blank:]]\\\", TRUE)) THEN\\n PRINT \\\"This is an inexact palindrome!\\\"\\nELSE\\n PRINT \\\"Not a palindrome.\\\"\\nENDIF\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"' OPTION _EXPLICIT ' For QB64. In VB-DOS remove the underscore.\\n\\nDIM txt$\\n\\n' Palindrome\\nCLS\\nPRINT \\\"This is a palindrome detector program.\\\"\\nPRINT\\nINPUT \\\"Please, type a word or phrase: \\\", txt$\\n\\nIF IsPalindrome(txt$) THEN\\n PRINT \\\"Is a palindrome.\\\"\\nELSE\\n PRINT \\\"Is Not a palindrome.\\\"\\nEND IF\\n\\nEND\\n\\n\\nFUNCTION IsPalindrome (AText$)\\n ' Var\\n DIM CleanTXT$, RvrsTXT$\\n\\n CleanTXT$ = CleanText$(AText$)\\n RvrsTXT$ = RvrsText$(CleanTXT$)\\n\\n IsPalindrome = (CleanTXT$ = RvrsTXT$)\\n\\nEND FUNCTION\\n\\nFUNCTION CleanText$ (WhichText$)\\n ' Var\\n DIM i%, j%, c$, NewText$, CpyTxt$, AddIt%, SubsTXT$\\n CONST False = 0, True = NOT False\\n\\n SubsTXT$ = \\\"AIOUE\\\"\\n CpyTxt$ = UCASE$(WhichText$)\\n j% = LEN(CpyTxt$)\\n\\n FOR i% = 1 TO j%\\n c$ = MID$(CpyTxt$, i%, 1)\\n\\n ' See if it is a letter. Includes Spanish letters.\\n SELECT CASE c$\\n CASE \\\"A\\\" TO \\\"Z\\\"\\n AddIt% = True\\n CASE \\\" \\\", \\\"¡\\\", \\\"¢\\\", \\\"£\\\"\\n c$ = MID$(SubsTXT$, ASC(c$) - 159, 1)\\n AddIt% = True\\n CASE \\\"‚\\\"\\n c$ = \\\"E\\\"\\n AddIt% = True\\n CASE \\\"¤\\\"\\n c$ = \\\"¥\\\"\\n AddIt% = True\\n CASE ELSE\\n AddIt% = False\\n END SELECT\\n\\n IF AddIt% THEN\\n NewText$ = NewText$ + c$\\n END IF\\n NEXT i%\\n\\n CleanText$ = NewText$\\n\\nEND FUNCTION\\n\\nFUNCTION RvrsText$ (WhichText$)\\n ' Var\\n DIM i%, c$, NewText$, j%\\n\\n j% = LEN(WhichText$)\\n FOR i% = 1 TO j%\\n NewText$ = MID$(WhichText$, i%, 1) + NewText$\\n NEXT i%\\n\\n RvrsText$ = NewText$\\n\\nEND FUNCTION\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\nset /p string=Your string :\\nset count=0\\n:loop\\n\\tif \\\"!%string%:~%count%,1!\\\" neq \\\"\\\" (\\n\\t\\tset reverse=!%string%:~%count%,1!!reverse!\\n\\t\\tset /a count+=1\\n\\t\\tgoto loop\\n\\t)\\nset palindrome=isn't\\nif \\\"%string%\\\"==\\\"%reverse%\\\" set palindrome=is\\necho %string% %palindrome% a palindrome.\\npause\\nexit\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"@echo off\\nset /p testString=Your string (all same case please) :\\ncall :isPalindrome result %testString: =%\\nif %result%==1 echo %testString% is a palindrome\\nif %result%==0 echo %testString% isn't a palindrome\\npause\\ngoto :eof\\n\\n:isPalindrome\\n\\tset %1=0\\n\\tset string=%2\\n\\tif \\\"%string:~2,1%\\\"==\\\"\\\" (\\n\\t\\tset %1=1\\n\\t\\tgoto :eof\\n\\t)\\n\\tif \\\"%string:~0,1%\\\"==\\\"%string:~-1%\\\" (\\n\\t\\tcall :isPalindrome %1 %string:~1,-1%\\n\\t)\\n\\tgoto :eof\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" test$ = \\\"A man, a plan, a canal: Panama!\\\"\\n PRINT \\\"\\\"\\\"\\\" test$ \\\"\\\"\\\"\\\" ;\\n IF FNpalindrome(FNletters(test$)) THEN\\n PRINT \\\" is a palindrome\\\"\\n ELSE\\n PRINT \\\" is not a palindrome\\\"\\n ENDIF\\n END\\n\\n DEF FNpalindrome(A$) = (A$ = FNreverse(A$))\\n\\n DEF FNreverse(A$)\\n LOCAL B$, P%\\n FOR P% = LEN(A$) TO 1 STEP -1\\n B$ += MID$(A$,P%,1)\\n NEXT\\n = B$\\n\\n DEF FNletters(A$)\\n LOCAL B$, C%, P%\\n FOR P% = 1 TO LEN(A$)\\n C% = ASC(MID$(A$,P%))\\n IF C% > 64 AND C% < 91 OR C% > 96 AND C% < 123 THEN\\n B$ += CHR$(C% AND &5F)\\n ENDIF\\n NEXT\\n = B$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet palindrome(s) = valof\\n$( let l = s%0\\n for i = 1 to l/2\\n unless s%i = s%(l+1-i)\\n resultis false\\n resultis true\\n$)\\n\\nlet inexact(s) = valof\\n$( let temp = vec 1+256/BYTESPERWORD\\n temp%0 := 0\\n for i = 1 to s%0 do\\n $( let ch = s%i | 32\\n if '0'<=ch & ch<='9' | 'a'<=ch & ch<='z' then\\n $( temp%0 := temp%0 + 1\\n temp%(temp%0) := ch\\n $)\\n $)\\n resultis palindrome(temp)\\n$)\\n\\nlet check(s) =\\n palindrome(s) -> \\\"exact palindrome\\\",\\n inexact(s) -> \\\"inexact palindrome\\\",\\n \\\"not a palindrome\\\"\\n\\nlet start() be\\n$( let tests = vec 8\\n tests!0 := \\\"rotor\\\"\\n tests!1 := \\\"racecar\\\"\\n tests!2 := \\\"RACEcar\\\"\\n tests!3 := \\\"level\\\"\\n tests!4 := \\\"redder\\\"\\n tests!5 := \\\"rosetta\\\"\\n tests!6 := \\\"A man, a plan, a canal: Panama\\\"\\n tests!7 := \\\"Egad, a base tone denotes a bad age\\\"\\n tests!8 := \\\"This is not a palindrome\\\"\\n\\n for i = 0 to 8 do\\n writef(\\\"'%S': %S*N\\\", tests!i, check(tests!i))\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"v_$0:8p>:#v_:18p08g1-08p >:08g`!v\\n~->p5p ^ 0v1p80-1g80vj!-g5g80g5_0'ev\\n:a^80+1:g8<>8g1+:18pv>0\\\"eslaF\\\">:#,_@\\n[[relet]]-2010------>003-x -^\\\"Tru\\\"<\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"v> \\\"emordnilap a toN\\\",,,,,,,,,,,,,,,,@,,,,,,,,,,,,,,,\\\"Is a palindrome\\\" <\\n2^ < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < <\\n4 ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v\\n8 ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v # ^_v\\n*^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v ^_v\\n+ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\\n \\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\n>\\\"dennis sinned\\\" v\\n \\\" 2\\n \\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\"\\\" 0\\n> ^- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 9\\n _^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ p\\n v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^ # v_^\\n v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^ v_^\\n ^< < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < < <\\n >09g8p09g1+09pv\\n |: < <\\n^<\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Pal ← ≡⊸⌽\\nPal1 ← ⊢≡⌽\\nPal2 ← {𝕩≡⌽𝕩}\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( ( palindrome\\n = a\\n . @(!arg:(%?a&utf$!a) ?arg !a)\\n & palindrome$!arg\\n | utf$!arg\\n )\\n& ( desep\\n = x\\n . @(!arg:?x (\\\" \\\"|\\\"-\\\"|\\\",\\\") ?arg)\\n & !x desep$!arg\\n | !arg\\n )\\n& \\\"In girum imus nocte et consumimur igni\\\"\\n \\\"Я иду с мечем, судия\\\"\\n \\\"The quick brown fox\\\"\\n \\\"tregða, gón, reiði - er nóg að gert\\\"\\n \\\"人人為我,我為人人\\\"\\n \\\"가련하시다 사장집 아들딸들아 집장사 다시 하련가\\\"\\n : ?candidates\\n& whl\\n ' ( !candidates:%?candidate ?candidates\\n & out\\n $ ( !candidate\\n is\\n ( palindrome$(low$(str$(desep$!candidate)))\\n & indeed\\n | not\\n )\\n a\\n palindrome\\n )\\n )\\n&\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \":import std/String .\\n\\nmain [<~>0 =? 0]\\n\\n:test (main \\\"tacocat\\\") ([[1]])\\n:test (main \\\"bruijn\\\") ([[0]])\\n\",\n \"language\": \"Bruijn\"\n },\n {\n \"code\": \"zz{ri}f[^^<-==\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <string.h>\\n\\nint palindrome(const char *s)\\n{\\n int i,l;\\n l = strlen(s);\\n for(i=0; i<l/2; i++)\\n {\\n if ( s[i] != s[l-i-1] ) return 0;\\n }\\n return 1;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"int palindrome(const char *s)\\n{\\n const char *t; /* t is a pointer that traverses backwards from the end */\\n for (t = s; *t != '\\\\0'; t++) ; t--; /* set t to point to last character */\\n while (s < t)\\n {\\n if ( *s++ != *t-- ) return 0;\\n }\\n return 1;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"int palindrome_r(const char *s, int b, int e)\\n{\\n if ( (e - 1) <= b ) return 1;\\n if ( s[b] != s[e-1] ) return 0;\\n return palindrome_r(s, b+1, e-1);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <string.h>\\n/* testing */\\nint main()\\n{\\n const char *t = \\\"ingirumimusnocteetconsumimurigni\\\";\\n const char *template = \\\"sequence \\\\\\\"%s\\\\\\\" is%s palindrome\\\\n\\\";\\n int l = strlen(t);\\n\\n printf(template,\\n t, palindrome(t) ? \\\"\\\" : \\\"n't\\\");\\n printf(template,\\n t, palindrome_r(t, 0, l) ? \\\"\\\" : \\\"n't\\\");\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <string>\\n#include <algorithm>\\n\\nbool is_palindrome(std::string const& s)\\n{\\n return std::equal(s.begin(), s.end(), s.rbegin());\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <string>\\n#include <algorithm>\\n\\nbool is_palindrome(std::string const& s)\\n{\\n return std::equal(s.begin(), s.begin()+s.length()/2, s.rbegin());\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass Program\\n{\\n static string Reverse(string value)\\n {\\n char[] chars = value.ToCharArray();\\n Array.Reverse(chars);\\n return new string(chars);\\n }\\n\\n static bool IsPalindrome(string value)\\n {\\n return value == Reverse(value);\\n }\\n\\n static void Main(string[] args)\\n {\\n Console.WriteLine(IsPalindrome(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nclass Program\\n{\\n\\tstatic bool IsPalindrome(string text)\\n\\t{\\n\\t\\treturn text == new String(text.Reverse().ToArray());\\n\\t}\\n\\n\\tstatic void Main(string[] args)\\n\\t{\\n\\t\\tConsole.WriteLine(IsPalindrome(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\n\\nstatic class Program\\n{\\n //As an extension method (must be declared in a static class)\\n static bool IsPalindrome(this string sentence)\\n {\\n for (int l = 0, r = sentence.Length - 1; l < r; l++, r--)\\n if (sentence[l] != sentence[r]) return false;\\n return true;\\n }\\n\\n static void Main(string[] args)\\n {\\n Console.WriteLine(\\\"ingirumimusnocteetconsumimurigni\\\".IsPalindrome());\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn palindrome? [s]\\n (= s (clojure.string/reverse s)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn palindrome? [^String s]\\n (loop [front 0 back (dec (.length s))]\\n (or (>= front back)\\n (and (= (.charAt s front) (.charAt s back))\\n (recur (inc front) (dec back)))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"% Reverse a string\\nstr_reverse = proc (s: string) returns (string)\\n chs: array[char] := array[char]$predict(0, string$size(s))\\n for c: char in string$chars(s) do\\n array[char]$addl(chs, c)\\n end\\n return (string$ac2s(chs))\\nend str_reverse\\n\\n% 'Normalize' a string (remove everything but letters and make uppercase)\\nnormalize = proc (s: string) returns (string)\\n chs: array[char] := array[char]$predict(0, string$size(s))\\n for c: char in string$chars(s) do\\n if c>='a' cand c<='z' then\\n c := char$i2c(char$c2i(c) - 32)\\n end\\n if c>='A' cand c<='Z' then\\n array[char]$addh(chs, c)\\n end\\n end\\n return (string$ac2s(chs))\\nend normalize\\n\\n% Check if a string is an exact palindrome\\npalindrome = proc (s: string) returns (bool)\\n return (s = str_reverse(s))\\nend palindrome\\n\\n% Check if a string is an inexact palindrome\\ninexact_palindrome = proc (s: string) returns (bool)\\n return (palindrome(normalize(s)))\\nend inexact_palindrome\\n\\n% Test cases\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n tests: array[string] := array[string]$[\\n \\\"rotor\\\", \\\"racecar\\\", \\\"RACEcar\\\", \\\"level\\\", \\\"rosetta\\\",\\n \\\"A man, a plan, a canal: Panama\\\",\\n \\\"Egad, a base tone denotes a bad age\\\",\\n \\\"This is not a palindrome\\\"\\n ]\\n\\n for test: string in array[string]$elements(tests) do\\n stream$puts(po, \\\"\\\\\\\"\\\" || test || \\\"\\\\\\\": \\\")\\n if palindrome(test) then\\n stream$putl(po, \\\"exact palindrome\\\")\\n elseif inexact_palindrome(test) then\\n stream$putl(po, \\\"inexact palindrome\\\")\\n else\\n stream$putl(po, \\\"not a palindrome\\\")\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" identification division.\\n function-id. palindromic-test.\\n\\n data division.\\n linkage section.\\n 01 test-text pic x any length.\\n 01 result pic x.\\n 88 palindromic value high-value\\n when set to false low-value.\\n\\n procedure division using test-text returning result.\\n\\n set palindromic to false\\n if test-text equal function reverse(test-text) then\\n set palindromic to true\\n end-if\\n\\n goback.\\n end function palindromic-test.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \" String::isPalindrome = ->\\n for i in [0...@length / 2] when @[i] isnt @[@length - (i + 1)]\\n return no\\n yes\\n\\n String::stripped = -> @toLowerCase().replace /\\\\W/gi, ''\\n\\n console.log \\\"'#{ str }' : #{ str.stripped().isPalindrome() }\\\" for str in [\\n 'In girum imus nocte et consumimur igni'\\n 'A man, a plan, a canal: Panama!'\\n 'There is no spoon.'\\n ]\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"(defun palindrome-p (s)\\n (string= s (reverse s)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \";; Project : Palindrome detection\\n\\n(defun palindrome(x)\\n (if (string= x (reverse x))\\n (format t \\\"~d\\\" \\\": palindrome\\\" (format t x))\\n (format t \\\"~d\\\" \\\": not palindrome\\\" (format t x))))\\n(terpri)\\n(setq x \\\"radar\\\")\\n(palindrome x)\\n(terpri)\\n(setq x \\\"books\\\")\\n(palindrome x)\\n(terpri)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"MODULE BbtPalindrome;\\nIMPORT StdLog;\\n\\nPROCEDURE ReverseStr(str: ARRAY OF CHAR): POINTER TO ARRAY OF CHAR;\\nVAR\\n\\ttop,middle,i: INTEGER;\\n\\tc: CHAR;\\n\\trStr: POINTER TO ARRAY OF CHAR;\\nBEGIN\\n\\tNEW(rStr,LEN(str$) + 1);\\n\\ttop := LEN(str$) - 1; middle := (top - 1) DIV 2;\\n\\tFOR i := 0 TO middle DO\\n\\t\\trStr[i] := str[top - i];\\n\\t\\trStr[top - i] := str[i];\\n\\tEND;\\n\\tIF ODD(LEN(str$)) THEN rStr[middle + 1] := str[middle + 1] END;\\n\\tRETURN rStr;\\nEND ReverseStr;\\n\\nPROCEDURE IsPalindrome(str: ARRAY OF CHAR): BOOLEAN;\\nBEGIN\\n\\tRETURN str = ReverseStr(str)$;\\nEND IsPalindrome;\\n\\nPROCEDURE Do*;\\nVAR\\n\\tx: CHAR;\\nBEGIN\\n\\tStdLog.String(\\\"'salalas' is palindrome?:> \\\");\\n\\tStdLog.Bool(IsPalindrome(\\\"salalas\\\"));StdLog.Ln;\\n\\tStdLog.String(\\\"'madamimadam' is palindrome?:> \\\");\\n\\tStdLog.Bool(IsPalindrome(\\\"madamimadam\\\"));StdLog.Ln;\\n\\tStdLog.String(\\\"'abcbda' is palindrome?:> \\\");\\n\\tStdLog.Bool(IsPalindrome(\\\"abcbda\\\"));StdLog.Ln;\\nEND Do;\\nEND BbtPalindrome.\\n\",\n \"language\": \"Component-Pascal\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\n# Check if a string is a palindrome\\nsub palindrome(word: [uint8]): (r: uint8) is\\n r := 1;\\n\\n # empty string is a palindrome\\n if [word] == 0 then\\n return;\\n end if;\\n\\n # find the end of the word\\n var end_ := word;\\n while [@next end_] != 0 loop\\n end_ := @next end_;\\n end loop;\\n\\n # check if bytes match in both directions\\n while word < end_ loop\\n if [word] != [end_] then\\n r := 0;\\n return;\\n end if;\\n word := @next word;\\n end_ := @prev end_;\\n end loop;\\nend sub;\\n\\n# Check if a string is an inexact palindrome\\nsub inexact(word: [uint8]): (r: uint8) is\\n var buf: uint8[256];\\n var ptr := &buf[0];\\n # filter non-letters and non-numbers\\n while [word] != 0 loop\\n var c := [word];\\n if (c >= 'a' and c <= 'z') or (c >= '0' and c <= '9') then\\n # copy lowercase letters and numbers over verbatim\\n [ptr] := c;\\n ptr := @next ptr;\\n elseif c >= 'A' and c <= 'Z' then\\n # make uppercase letters lowercase\\n [ptr] := c | 32;\\n ptr := @next ptr;\\n end if;\\n word := @next word;\\n end loop;\\n [ptr] := 0;\\n r := palindrome(&buf[0]);\\nend sub;\\n\\nvar tests: [uint8][] := {\\n \\\"civic\\\", \\\"level\\\", \\\"racecar\\\",\\n \\\"A man, a plan, a canal: Panama\\\",\\n \\\"Egad, a base tone denotes a bad age\\\",\\n \\\"There is no spoon.\\\"\\n};\\n\\nvar i: @indexof tests := 0;\\nwhile i < @sizeof tests loop\\n print(tests[i]);\\n print(\\\": \\\");\\n if palindrome(tests[i]) == 1 then\\n print(\\\"exact palindrome\\\\n\\\");\\n elseif inexact(tests[i]) == 1 then\\n print(\\\"inexact palindrome\\\\n\\\");\\n else\\n print(\\\"not a palindrome\\\\n\\\");\\n end if;\\n i := i + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"def palindrome(s)\\n s == s.reverse\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"def palindrome_imperative(s) : Bool\\n mid = s.size // 2\\n last = s.size - 1\\n (0...mid).each do |i|\\n if s[i] != s[last - i]\\n return false\\n end\\n end\\n\\n true\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"def palindrome_2(s)\\n mid = s.size // 2\\n mid.times { |j| return false if s[j] != s[-1 - j] }\\n true\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"require \\\"benchmark\\\"\\nBenchmark.ips do |x|\\n x.report(\\\"declarative\\\") { palindrome(\\\"hannah\\\") }\\n x.report(\\\"imperative1\\\") { palindrome_imperative(\\\"hannah\\\")}\\n x.report(\\\"imperative2\\\") { palindrome_2(\\\"hannah\\\")}\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"import std.traits, std.algorithm;\\n\\nbool isPalindrome1(C)(in C[] s) pure /*nothrow*/\\nif (isSomeChar!C) {\\n auto s2 = s.dup;\\n s2.reverse(); // works on Unicode too, not nothrow.\\n return s == s2;\\n}\\n\\nvoid main() {\\n alias pali = isPalindrome1;\\n assert(pali(\\\"\\\"));\\n assert(pali(\\\"z\\\"));\\n assert(pali(\\\"aha\\\"));\\n assert(pali(\\\"sees\\\"));\\n assert(!pali(\\\"oofoe\\\"));\\n assert(pali(\\\"deified\\\"));\\n assert(!pali(\\\"Deified\\\"));\\n assert(pali(\\\"amanaplanacanalpanama\\\"));\\n assert(pali(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n assert(pali(\\\"salà las\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.traits;\\n\\nbool isPalindrome2(C)(in C[] s) pure if (isSomeChar!C) {\\n dchar[] dstr;\\n foreach (dchar c; s) // not nothrow\\n dstr ~= c;\\n\\n for (int i; i < dstr.length / 2; i++)\\n if (dstr[i] != dstr[$ - i - 1])\\n return false;\\n return true;\\n}\\n\\nvoid main() {\\n alias isPalindrome2 pali;\\n assert(pali(\\\"\\\"));\\n assert(pali(\\\"z\\\"));\\n assert(pali(\\\"aha\\\"));\\n assert(pali(\\\"sees\\\"));\\n assert(!pali(\\\"oofoe\\\"));\\n assert(pali(\\\"deified\\\"));\\n assert(!pali(\\\"Deified\\\"));\\n assert(pali(\\\"amanaplanacanalpanama\\\"));\\n assert(pali(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n assert(pali(\\\"salà las\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, core.exception, std.traits;\\n\\n// assume alloca() to be pure for this program\\nextern(C) pure nothrow void* alloca(in size_t size);\\n\\nbool isPalindrome3(C)(in C[] s) pure if (isSomeChar!C) {\\n auto p = cast(dchar*)alloca(s.length * 4);\\n if (p == null)\\n // no fallback heap allocation used\\n throw new OutOfMemoryError();\\n dchar[] dstr = p[0 .. s.length];\\n\\n // use std.utf.stride for an even lower level version\\n int i = 0;\\n foreach (dchar c; s) { // not nothrow\\n dstr[i] = c;\\n i++;\\n }\\n dstr = dstr[0 .. i];\\n\\n foreach (j; 0 .. dstr.length / 2)\\n if (dstr[j] != dstr[$ - j - 1])\\n return false;\\n return true;\\n}\\n\\nvoid main() {\\n alias isPalindrome3 pali;\\n assert(pali(\\\"\\\"));\\n assert(pali(\\\"z\\\"));\\n assert(pali(\\\"aha\\\"));\\n assert(pali(\\\"sees\\\"));\\n assert(!pali(\\\"oofoe\\\"));\\n assert(pali(\\\"deified\\\"));\\n assert(!pali(\\\"Deified\\\"));\\n assert(pali(\\\"amanaplanacanalpanama\\\"));\\n assert(pali(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n assert(pali(\\\"salà las\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"bool isPalindrome4(in string str) pure nothrow {\\n if (str.length == 0) return true;\\n immutable(char)* s = str.ptr;\\n immutable(char)* t = &(str[$ - 1]);\\n while (s < t)\\n if (*s++ != *t--) // ugly\\n return false;\\n return true;\\n}\\n\\nvoid main() {\\n alias isPalindrome4 pali;\\n assert(pali(\\\"\\\"));\\n assert(pali(\\\"z\\\"));\\n assert(pali(\\\"aha\\\"));\\n assert(pali(\\\"sees\\\"));\\n assert(!pali(\\\"oofoe\\\"));\\n assert(pali(\\\"deified\\\"));\\n assert(!pali(\\\"Deified\\\"));\\n assert(pali(\\\"amanaplanacanalpanama\\\"));\\n assert(pali(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n //assert(pali(\\\"salà las\\\"));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"bool isPalindrome(String s){\\n for(int i = 0; i < s.length/2;i++){\\n if(s[i] != s[(s.length-1) -i])\\n return false;\\n }\\n return true;\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"uses\\n SysUtils, StrUtils;\\n\\nfunction IsPalindrome(const aSrcString: string): Boolean;\\nbegin\\n Result := SameText(aSrcString, ReverseString(aSrcString));\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"func isPalindrom(str) {\\n str == str.Reverse()\\n}\\n\\nprint(isPalindrom(\\\"ingirumimusnocteetconsumimurigni\\\"))\\n\",\n \"language\": \"Dyalect\"\n },\n {\n \"code\": \"def isPalindrome(string :String) {\\n def upper := string.toUpperCase()\\n def last := upper.size() - 1\\n for i => c ? (upper[last - i] != c) in upper(0, upper.size() // 2) {\\n return false\\n }\\n return true\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func$ reverse s$ .\\n a$[] = strchars s$\\n for i = 1 to len a$[] div 2\\n swap a$[i] a$[len a$[] - i + 1]\\n .\\n return strjoin a$[]\\n.\\nfunc palin s$ .\\n if s$ = reverse s$\\n return 1\\n .\\n return 0\\n.\\nfor s$ in [ \\\"rotor\\\" \\\"rosetta\\\" \\\"step on no pets\\\" \\\"été\\\" \\\"🦊😀🦊\\\" ]\\n if palin s$ = 1\\n print s$ & \\\" is a palindrome\\\"\\n else\\n print s$ & \\\" is not a palindrome\\\"\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \";; returns #t or #f\\n(define (palindrome? string)\\n(equal? (string->list string) (reverse (string->list string))))\\n\\n;; to strip spaces, use the following\\n;;(define (palindrome? string)\\n;;(let ((string (string-replace string \\\"/\\\\ /\\\" \\\"\\\" \\\"g\\\")))\\n;;(equal? (string->list string) (reverse (string->list string)))))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"\\tis_palindrome (a_string: STRING): BOOLEAN\\n\\t\\t\\t-- Is `a_string' a palindrome?\\n\\t\\trequire\\n\\t\\t\\tstring_attached: a_string /= Void\\n\\t\\tlocal\\n\\t\\t\\tl_index, l_count: INTEGER\\n\\t\\tdo\\n\\t\\t\\tfrom\\n\\t\\t\\t\\tResult := True\\n\\t\\t\\t\\tl_index := 1\\n\\t\\t\\t\\tl_count := a_string.count\\n\\t\\t\\tuntil\\n\\t\\t\\t\\tl_index >= l_count - l_index + 1 or not Result\\n\\t\\t\\tloop\\n\\t\\t\\t\\tResult := (Result and a_string [l_index] = a_string [l_count - l_index + 1])\\n\\t\\t\\t\\tl_index := l_index + 1\\n\\t\\t\\tend\\n\\t\\tend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"open list string\\n\\nisPalindrome xs = xs == reverse xs\\nisPalindrome <| toList \\\"ingirumimusnocteetconsumimurigni\\\"\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"reverse = foldl (flip (::)) (nil xs)\\n\\nfoldl f z (x::xs) = foldl f (f z x) xs\\nfoldl _ z [] = z\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"defmodule PalindromeDetection do\\n def is_palindrome(str), do: str == String.reverse(str)\\nend\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"import String exposing (reverse, length)\\nimport Html exposing (Html, Attribute, text, div, input)\\nimport Html.Attributes exposing (placeholder, value, style)\\nimport Html.Events exposing (on, targetValue)\\nimport Html.App exposing (beginnerProgram)\\n\\n-- The following function (copied from Haskell) satisfies the\\n-- rosettacode task description.\\nis_palindrome x = x == reverse x\\n\\n-- The remainder of the code demonstrates the use of the function\\n-- in a complete Elm program.\\nmain = beginnerProgram { model = \\\"\\\" , view = view , update = update }\\n\\nupdate newStr oldStr = newStr\\n\\nview : String -> Html String\\nview candidate =\\n div []\\n ([ input\\n [ placeholder \\\"Enter a string to check.\\\"\\n , value candidate\\n , on \\\"input\\\" targetValue\\n , myStyle\\n ]\\n []\\n ] ++\\n [ let testResult =\\n is_palindrome candidate\\n\\n statement =\\n if testResult then \\\"PALINDROME!\\\" else \\\"not a palindrome\\\"\\n\\n in div [ myStyle] [text statement]\\n ])\\n\\nmyStyle : Attribute msg\\nmyStyle =\\n style\\n [ (\\\"width\\\", \\\"100%\\\")\\n , (\\\"height\\\", \\\"20px\\\")\\n , (\\\"padding\\\", \\\"5px 0 0 5px\\\")\\n , (\\\"font-size\\\", \\\"1em\\\")\\n , (\\\"text-align\\\", \\\"left\\\")\\n ]\\n\",\n \"language\": \"Elm\"\n },\n {\n \"code\": \"(defun palindrome (s)\\n (string= s (reverse s)))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-module( palindrome ).\\n\\n-export( [is_palindrome/1, task/0] ).\\n\\nis_palindrome( String ) -> String =:= lists:reverse(String).\\n\\ntask() ->\\n\\tdisplay( \\\"abcba\\\" ),\\n\\tdisplay( \\\"abcdef\\\" ),\\n\\tLatin = \\\"In girum imus nocte et consumimur igni\\\",\\n\\tNo_spaces_same_case = lists:append( string:tokens(string:to_lower(Latin), \\\" \\\") ),\\n\\tdisplay( Latin, No_spaces_same_case ).\\n\\n\\n\\ndisplay( String ) -> io:fwrite( \\\"Is ~p a palindrom? ~p~n\\\", [String, is_palindrome(String)] ).\\n\\ndisplay( String1, String2 ) -> io:fwrite( \\\"Is ~p a palindrom? ~p~n\\\", [String1, is_palindrome(String2)] ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"function isPalindrome(sequence s)\\n for i = 1 to length(s)/2 do\\n if s[i] != s[$-i+1] then\\n return 0\\n end if\\n end for\\n return 1\\nend function\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"include std/sequence.e -- reverse\\ninclude std/console.e -- display\\ninclude std/text.e -- upper\\ninclude std/utils.e -- iif\\n\\nIsPalindrome(\\\"abcba\\\")\\nIsPalindrome(\\\"abcdef\\\")\\nIsPalindrome(\\\"In girum imus nocte et consumimur igni\\\")\\n\\nprocedure IsPalindrome(object s)\\n display(\\\"Is '[]' a palindrome? \\\",{s},0)\\n s = remove_all(' ',upper(s))\\n display(iif(equal(s,reverse(s)),\\\"true\\\",\\\"false\\\"))\\nend procedure\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"ISPALINDROME\\n=LAMBDA(s,\\n LET(\\n lcs, FILTERP(\\n LAMBDA(c, \\\" \\\" <> c)\\n )(\\n CHARS(LOWER(s))\\n ),\\n CONCAT(lcs) = CONCAT(REVERSE(lcs))\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"CHARS\\n=LAMBDA(s,\\n MID(s, ROW(INDIRECT(\\\"1:\\\" & LEN(s))), 1)\\n)\\n\\n\\nFILTERP\\n=LAMBDA(p,\\n LAMBDA(xs,\\n FILTER(xs, p(xs))\\n )\\n)\\n\\n\\nREVERSE\\n=LAMBDA(xs,\\n LET(\\n n, ROWS(xs),\\n SORTBY(\\n xs,\\n SEQUENCE(n, 1, n, -1)\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let isPalindrome (s: string) =\\n let arr = s.ToCharArray()\\n arr = Array.rev arr\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"isPalindrome \\\"abcba\\\"\\nval it : bool = true\\nisPalindrome (\\\"In girum imus nocte et consumimur igni\\\".Replace(\\\" \\\", \\\"\\\").ToLower());;\\nval it : bool = true\\nisPalindrome \\\"abcdef\\\"\\nval it : bool = false\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: kernel sequences ;\\n: palindrome? ( str -- ? ) dup reverse = ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"/* created by Aykayayciti Earl Lamont Montgomery\\nApril 9th, 2018 */\\n\\nfunction is_palindrome(a)\\n\\ta = strUpper(a).replace(\\\" \\\", \\\"\\\")\\n\\tb = a[-1:0]\\n\\treturn b == a\\nend\\n\\na = \\\"mom\\\"\\n> is_palindrome(a)\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \"/* created by Aykayayciti Earl Lamont Montgomery\\nApril 9th, 2018 */\\n\\nb = \\\"mom\\\"\\n> strUpper(b).replace(\\\" \\\", \\\"\\\") == strUpper(b[-1:0]) ? \\\"Is a palindrome\\\" : \\\"Is not a palindrome\\\"\\n\",\n \"language\": \"Falcon\"\n },\n {\n \"code\": \"class Palindrome\\n{\\n // Function to test if given string is a palindrome\\n public static Bool isPalindrome (Str str)\\n {\\n str == str.reverse\\n }\\n\\n // Give it a test run\\n public static Void main ()\\n {\\n echo (isPalindrome(\\\"\\\"))\\n echo (isPalindrome(\\\"a\\\"))\\n echo (isPalindrome(\\\"aa\\\"))\\n echo (isPalindrome(\\\"aba\\\"))\\n echo (isPalindrome(\\\"abb\\\"))\\n echo (isPalindrome(\\\"salàlas\\\"))\\n echo (isPalindrome(\\\"In girum imus nocte et consumimur igni\\\".lower.replace(\\\" \\\",\\\"\\\")))\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"#APPTYPE CONSOLE\\n\\nFUNCTION stripNonAlpha(BYVAL s AS STRING) AS STRING\\n\\tDIM sTemp AS STRING = \\\"\\\"\\n\\tDIM c AS STRING\\n\\tFOR DIM i = 1 TO LEN(s)\\n\\t\\tc = MID(s, i, 1)\\n\\t\\tIF INSTR(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", c, 0, 1) THEN\\n\\t\\t\\tsTemp = stemp & c\\n\\t\\tEND IF\\n\\tNEXT\\n\\tRETURN sTemp\\nEND FUNCTION\\n\\nFUNCTION IsPalindrome(BYVAL s AS STRING) AS INTEGER\\n\\tFOR DIM i = 1 TO STRLEN(s) \\\\ 2 ' only check half of the string, as scanning from both ends\\n\\t\\tIF s{i} <> s{STRLEN - (i - 1)} THEN RETURN FALSE 'comparison is not case sensitive\\n\\tNEXT\\n\\t\\n\\tRETURN TRUE\\nEND FUNCTION\\n\\nPRINT IsPalindrome(stripNonAlpha(\\\"A Toyota\\\"))\\nPRINT IsPalindrome(stripNonAlpha(\\\"Madam, I'm Adam\\\"))\\nPRINT IsPalindrome(stripNonAlpha(\\\"the rain in Spain falls mainly on the rooftops\\\"))\\n\\nPAUSE\\n\",\n \"language\": \"FBSL\"\n },\n {\n \"code\": \": first over c@ ;\\n: last >r 2dup + 1- c@ r> swap ;\\n: palindrome? ( c-addr u -- f )\\n begin\\n dup 1 <= if 2drop true exit then\\n first last <> if 2drop false exit then\\n 1 /string 1-\\n again ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"variable temp-addr\\n\\n: valid-char? ( addr1 u -- f ) ( check for valid character )\\n + dup C@ 48 58 within\\n over C@ 65 91 within or\\n swap C@ 97 123 within or ;\\n\\n: >upper ( c1 -- c2 )\\n dup 97 123 within if 32 - then ;\\n\\n: strip-input ( addr1 u -- addr2 u ) ( Strip characters, then copy stripped string to temp-addr )\\n pad temp-addr !\\n temp-addr @ rot rot 0 do dup I 2dup valid-char? if\\n + C@ >upper temp-addr @ C! 1 temp-addr +!\\n else 2drop\\n then loop drop temp-addr @ pad - ;\\n\\n: get-phrase ( -- addr1 u )\\n .\\\" Type a phrase: \\\" here 1024 accept here swap -trailing cr ;\\n\\n: position-phrase ( addr1 u -- addr1 u addr2 u addr1 addr2 u )\\n temp-addr @ over 2over 2over drop swap ;\\n\\n: reverse-copy ( addr1 addr2 u -- addr1 addr2 )\\n 0 do over I' 1- I - + over I + 1 cmove loop 2drop ;\\n\\n: palindrome? ( -- )\\n get-phrase strip-input position-phrase reverse-copy compare 0= if\\n .\\\" << Valid >> Palindrome.\\\"\\n else .\\\" << Not >> a Palindrome.\\\"\\n then cr ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"program palindro\\n\\n implicit none\\n\\n character(len=*), parameter :: p = \\\"ingirumimusnocteetconsumimurigni\\\"\\n\\n print *, is_palindro_r(p)\\n print *, is_palindro_r(\\\"anothertest\\\")\\n print *, is_palindro2(p)\\n print *, is_palindro2(\\\"test\\\")\\n print *, is_palindro(p)\\n print *, is_palindro(\\\"last test\\\")\\n\\ncontains\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"! non-recursive\\nfunction is_palindro(t)\\n logical :: is_palindro\\n character(len=*), intent(in) :: t\\n\\n integer :: i, l\\n\\n l = len(t)\\n is_palindro = .false.\\n do i=1, l/2\\n if ( t(i:i) /= t(l-i+1:l-i+1) ) return\\n end do\\n is_palindro = .true.\\nend function is_palindro\\n\\n! non-recursive 2\\nfunction is_palindro2(t) result(isp)\\n logical :: isp\\n character(len=*), intent(in) :: t\\n\\n character(len=len(t)) :: s\\n integer :: i\\n\\n forall(i=1:len(t)) s(len(t)-i+1:len(t)-i+1) = t(i:i)\\n isp = ( s == t )\\nend function is_palindro2\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" recursive function is_palindro_r (t) result (isp)\\n\\n implicit none\\n character (*), intent (in) :: t\\n logical :: isp\\n\\n isp = len (t) == 0 .or. t (: 1) == t (len (t) :) .and. is_palindro_r (t (2 : len (t) - 1))\\n\\n end function is_palindro_r\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"end program palindro\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' version 20-06-2015\\n' compile with: fbc -s console \\\"filename\\\".bas\\n\\n#Ifndef TRUE ' define true and false for older freebasic versions\\n #Define FALSE 0\\n #Define TRUE Not FALSE\\n#EndIf\\n\\nFunction reverse(norm As String) As Integer\\n\\n Dim As String rev\\n Dim As Integer i, l = Len(norm) -1\\n\\n rev = norm\\n For i = 0 To l\\n rev[l-i] = norm[i]\\n Next\\n\\n If norm = rev Then\\n Return TRUE\\n Else\\n Return FALSE\\n End If\\n\\nEnd Function\\n\\nFunction cleanup(in As String, action As String = \\\"\\\") As String\\n ' action = \\\"\\\" do nothing, [l|L] = convert to lowercase,\\n ' [s|S] = strip spaces, [p|P] = strip punctuation.\\n If action = \\\"\\\" Then Return in\\n\\n Dim As Integer i, p_, s_\\n Dim As String ch\\n\\n action = LCase(action)\\n For i = 1 To Len(action)\\n ch = Mid(action, i, 1)\\n If ch = \\\"l\\\" Then in = LCase(in)\\n If ch = \\\"p\\\" Then\\n p_ = 1\\n ElseIf ch = \\\"s\\\" Then\\n s_ = 1\\n End If\\n Next\\n\\n If p_ = 0 And s_ = 0 Then Return in\\n\\n Dim As String unwanted, clean\\n\\n If s_ = 1 Then unwanted = \\\" \\\"\\n If p_ = 1 Then unwanted = unwanted + \\\"`~!@#$%^&*()-=_+[]{}\\\\|;:',.<>/?\\\"\\n\\n For i = 1 To Len(in)\\n ch = Mid(in, i, 1)\\n If InStr(unwanted, ch) = 0 Then clean = clean + ch\\n Next\\n\\n Return clean\\n\\nEnd Function\\n\\n' ------=< MAIN >=------\\n\\nDim As String test = \\\"In girum imus nocte et consumimur igni\\\"\\n'IIf ( cond, true, false ), true and false must be of the same type (num, string, UDT)\\nPrint\\nPrint \\\" reverse(test) = \\\"; IIf(reverse(test) = FALSE, \\\"FALSE\\\", \\\"TRUE\\\")\\nPrint \\\" reverse(cleanup(test,\\\"\\\"l\\\"\\\")) = \\\"; IIf(reverse(cleanup(test,\\\"l\\\")) = FALSE, \\\"FALSE\\\", \\\"TRUE\\\")\\nPrint \\\" reverse(cleanup(test,\\\"\\\"ls\\\"\\\")) = \\\"; IIf(reverse(cleanup(test,\\\"ls\\\")) = FALSE, \\\"FALSE\\\", \\\"TRUE\\\")\\nPrint \\\"reverse(cleanup(test,\\\"\\\"PLS\\\"\\\")) = \\\"; IIf(reverse(cleanup(test,\\\"PLS\\\")) = FALSE, \\\"FALSE\\\", \\\"TRUE\\\")\\n\\n' empty keyboard buffer\\nWhile InKey <> \\\"\\\" : Wend\\nPrint : Print : Print \\\"Hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"isPalindrome[x] := x == reverse[x]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"isPalindrome[\\\"x\\\\u{1f638}x\\\"]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nlocal fn IsCleanStringPalindrome( testStr as CFStringRef ) as BOOL\\n NSUInteger i\\n BOOL result = NO\\n\\n NSUInteger strLen = len(testStr)\\n for i = 0 to strLen / 2\\n if ( fn StringCharacterAtIndex( testStr, i ) != fn StringCharacterAtIndex( testStr, strLen -i -1 ) )\\n result = NO\\n exit fn\\n end if\\n next\\n result = YES\\nend fn = result\\n\\nlocal fn IsDirtyStringPalindrome( dirtyStr as CFStringRef )\\n BOOL result = NO\\n CFStringRef tempStr\\n\\n CFStringRef lowerCaseStr = fn StringLowercaseString( dirtyStr )\\n CFStringRef removeStr = @\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_ {|}~\\\"\\n NSUInteger i, count = len(removeStr)\\n\\n tempStr = lowerCaseStr\\n for i = 0 to count -1\\n CFStringRef chrStr = fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtIndex( removeStr, i ) )\\n tempStr = fn StringByReplacingOccurrencesOfString( tempStr, chrStr, @\\\"\\\" )\\n next\\n result = fn IsCleanStringPalindrome( tempStr )\\nend fn = result\\n\\n\\nlocal fn PalindromeTest( testStr as CFStringRef )\\n BOOL result = NO\\n\\n result = fn IsCleanStringPalindrome( testStr )\\n if ( result == YES )\\n NSLog( @\\\"%17s : %@\\\", fn StringUTF8String( @\\\"Clean palindrome\\\" ), testStr ) : exit fn\\n else\\n result = fn IsDirtyStringPalindrome( testStr )\\n if ( result == YES )\\n NSLog( @\\\"%17s : %@\\\", fn StringUTF8String( @\\\"Dirty palindrome\\\" ), testStr ) : exit fn\\n else\\n NSLog( @\\\"%17s : %@\\\", fn StringUTF8String( @\\\"Not a palindrome\\\" ), testStr )\\n end if\\n end if\\nend fn\\n\\nfn PalindromeTest( @\\\"racecar\\\" )\\nfn PalindromeTest( @\\\"level\\\" )\\nfn PalindromeTest( @\\\"rosetta\\\" )\\nfn PalindromeTest( @\\\"rotavator\\\" )\\nfn PalindromeTest( @\\\"13231+464+989=989+464+13231\\\" )\\nfn PalindromeTest( @\\\"Was it a car or a cat I saw?\\\" )\\nfn PalindromeTest( @\\\"Did Hannah see bees? Hannah did.\\\" )\\nfn PalindromeTest( @\\\"This sentence is not a palindrome.\\\" )\\nfn PalindromeTest( @\\\"123 456 789 897 654 321\\\" )\\nfn PalindromeTest( @\\\"123 456 789 987 654 321\\\" )\\nfn PalindromeTest( @\\\"Radar\\\" )\\nfn PalindromeTest( @\\\"abba\\\" )\\nfn PalindromeTest( @\\\"boom \\\" )\\nfn PalindromeTest( @\\\"radar\\\" )\\nfn PalindromeTest( @\\\"civic\\\" )\\nfn PalindromeTest( @\\\"great\\\" )\\nfn PalindromeTest( @\\\"Madam, I'm Adam.\\\" )\\nfn PalindromeTest( @\\\"salàla\\\" )\\nfn PalindromeTest( @\\\"A man, a plan, a canal: Panama\\\" )\\nfn PalindromeTest( @\\\"a man a plan a canal panama\\\" )\\nfn PalindromeTest( @\\\"Egad, a base tone denotes a bad age\\\" )\\nfn PalindromeTest( @\\\"In girum imus nocte et consumimur igni\\\" )\\nfn PalindromeTest( @\\\"sees\\\" )\\nfn PalindromeTest( @\\\"solo\\\" )\\nfn PalindromeTest( @\\\"solos\\\" )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"ZapGremlins := function(s)\\n local upper, lower, c, i, n, t;\\n upper := \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n lower := \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n t := [ ];\\n i := 1;\\n for c in s do\\n n := Position(upper, c);\\n if n <> fail then\\n t[i] := lower[n];\\n i := i + 1;\\n else\\n n := Position(lower, c);\\n if n <> fail then\\n t[i] := c;\\n i := i + 1;\\n fi;\\n fi;\\n od;\\n return t;\\nend;\\n\\nIsPalindrome := function(s)\\n local t;\\n t := ZapGremlins(s);\\n return t = Reversed(t);\\nend;\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"//Setting a var from an argument passed to the script\\nvar str;\\nstr = argument0\\n//Takes out all spaces/anything that is not a letter or a number and turns uppercase letters to lowercase\\nstr = string_lettersdigits(string_lower(string_replace(str,' ','')));\\nvar inv;\\ninv = '';\\n//for loop that reverses the sequence\\nvar i;\\nfor (i = 0; i < string_length(str); i += 1;)\\n {\\n inv += string_copy(str,string_length(str)-i,1);\\n }\\n//returns true if the sequence is a palindrome else returns false\\nreturn (str == inv);\\n\",\n \"language\": \"GML\"\n },\n {\n \"code\": \"//Remove everything except for letters and digits and convert the string to lowercase. source is what will be compared to str.\\nvar str = string_lower(string_lettersdigits(string_replace(argument0,\\\" \\\",\\\"\\\"))), source = \\\"\\\";\\n\\n//Loop through and store each character of str in source.\\nfor (var i = string_length(str); i > 0; i--) {\\n source += string_char_at(str,i);\\n}\\n\\n//Return if it is a palindrome.\\nreturn source == str;\\n\",\n \"language\": \"GML\"\n },\n {\n \"code\": \"package pal\\n\\nfunc IsPal(s string) bool {\\n mid := len(s) / 2\\n last := len(s) - 1\\n for i := 0; i < mid; i++ {\\n if s[i] != s[last-i] {\\n return false\\n }\\n }\\n return true\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"func isPalindrome(s string) bool {\\n\\trunes := []rune(s)\\n\\tnumRunes := len(runes) - 1\\n\\tfor i := 0; i < len(runes)/2; i++ {\\n\\t\\tif runes[i] != runes[numRunes-i] {\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t}\\n\\treturn true\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"func isPalindrome(s string) bool {\\n\\trunes := []rune(s)\\n\\tfor len(runes) > 1 {\\n\\t\\tif runes[0] != runes[len(runes)-1] {\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t\\trunes = runes[1 : len(runes)-1]\\n\\t}\\n\\treturn true\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{.,1>{(\\\\)@={pal}0if}1if\\\\;}:pal;\\n\",\n \"language\": \"Golfscript\"\n },\n {\n \"code\": \"\\\"ABBA\\\" pal\\n\\\"a\\\" pal\\n\\\"13231+464+989=989+464+13231\\\" pal\\n\\\"123 456 789 897 654 321\\\" pal\\n\",\n \"language\": \"Golfscript\"\n },\n {\n \"code\": \"def isPalindrome = { String s ->\\n s == s?.reverse()\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println isPalindrome(\\\"\\\")\\nprintln isPalindrome(\\\"a\\\")\\nprintln isPalindrome(\\\"abcdefgfedcba\\\")\\nprintln isPalindrome(\\\"abcdeffedcba\\\")\\nprintln isPalindrome(\\\"abcedfgfedcb\\\")\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def isPalindrome = { String s ->\\n def n = s.size()\\n n < 2 || s[0..<n/2] == s[-1..(-n/2)]\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def isPalindrome\\nisPalindrome = { String s ->\\n def n = s.size()\\n n < 2 || (s[0] == s[n-1] && isPalindrome(s[1..<(n-1)]))\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"is_palindrome x = x == reverse x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Bifunctor (second)\\nimport Data.Char (toLower)\\n\\n------------------- PALINDROME DETECTION -----------------\\n\\nisPalindrome :: Eq a => [a] -> Bool\\nisPalindrome = (==) <*> reverse\\n\\n-- Or, comparing just the leftward characters with\\n-- with a reflection of just the rightward characters.\\n\\nisPal :: String -> Bool\\nisPal s =\\n let (q, r) = quotRem (length s) 2\\n in uncurry (==) $\\n second (reverse . drop r) $ splitAt q s\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n mapM_ putStrLn $\\n (showResult <$> [isPalindrome, isPal])\\n <*> fmap\\n prepared\\n [ \\\"\\\",\\n \\\"a\\\",\\n \\\"ab\\\",\\n \\\"aba\\\",\\n \\\"abba\\\",\\n \\\"In girum imus nocte et consumimur igni\\\"\\n ]\\n\\nprepared :: String -> String\\nprepared cs = [toLower c | c <- cs, ' ' /= c]\\n\\nshowResult f s = (show s) <> \\\" -> \\\" <> show (f s)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"is_palindrome_r x | length x <= 1 = True\\n | head x == last x = is_palindrome_r . tail. init $ x\\n | otherwise = False\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" result = Palindrome( \\\"In girum imus nocte et consumimur igni\\\" ) ! returns 1\\nEND\\n\\nFUNCTION Palindrome(string)\\n CHARACTER string, CopyOfString\\n\\n L = LEN(string)\\n ALLOCATE(CopyOfString, L)\\n CopyOfString = string\\n EDIT(Text=CopyOfString, UpperCase=L)\\n L = L - EDIT(Text=CopyOfString, End, Left=' ', Delete, DO=L) ! EDIT returns number of deleted spaces\\n\\n DO i = 1, L/2\\n Palindrome = CopyOfString(i) == CopyOfString(L - i + 1)\\n IF( Palindrome == 0 ) RETURN\\n ENDDO\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure main(arglist)\\nevery writes(s := !arglist) do write( if palindrome(s) then \\\" is \\\" else \\\" is not\\\", \\\" a palindrome.\\\")\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure palindrome(s) #: return s if s is a palindrome\\nreturn s == reverse(s)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure palindrome(x) #: return x if s is x palindrome\\nlocal i\\nevery if x[i := 1 to (*x+ 1)/2] ~== x[-i] then fail\\nreturn x\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(var palindrome? (= (reverse %)))\\n\\n(palindrome? \\\"deified\\\") ;returns true\\n\",\n \"language\": \"Insitux\"\n },\n {\n \"code\": \"(var palindrome? (comp (filter letter?) lower-case (= (reverse %))))\\n\\n(palindrome? \\\"In girum imus nocte et consumimur igni.\\\") ;returns true\\n\",\n \"language\": \"Insitux\"\n },\n {\n \"code\": \"Text isPalindrome? = method(self chars == self chars reverse)\\n\",\n \"language\": \"Ioke\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Palindr.bas\\\"\\n110 LINE INPUT PROMPT \\\"Text: \\\":TX$\\n120 PRINT \\\"\\\"\\\"\\\";TX$;\\\"\\\"\\\" is \\\";\\n130 IF PALIND(TX$) THEN\\n140 PRINT \\\"a palindrome.\\\"\\n150 ELSE\\n160 PRINT \\\"not a palindrome.\\\"\\n170 END IF\\n180 DEF TRIM$(TX$)\\n190 LET T$=\\\"\\\"\\n200 FOR I=1 TO LEN(TX$)\\n210 IF TX$(I)>=\\\"A\\\" AND TX$(I)<=\\\"Z\\\" THEN LET T$=T$&TX$(I)\\n220 NEXT\\n230 LET TRIM$=T$\\n240 END DEF\\n250 DEF PALIND(TX$)\\n260 LET PALIND=-1:LET TX$=TRIM$(UCASE$(TX$))\\n270 FOR I=1 TO LEN(TX$)/2\\n280 IF TX$(I)<>TX$(LEN(TX$)-I+1) THEN LET PALIND=0:EXIT FOR\\n290 NEXT\\n300 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"isPalin0=: -: |.\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" isPalin0 'ABBA'\\n1\\n isPalin0 -.&' ' tolower 'In girum imus nocte et consumimur igni'\\n1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"isPalin1=: 0:`($:@(}.@}:))@.({.={:)`1:@.(1>:#)\\n\\nisPalin2=: monad define\\n if. 1>:#y do. 1 return. end.\\n if. ({.={:)y do. isPalin2 }.}:y else. 0 end.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" foo=: foo,|.foo=:2000$a.\\n ts=:6!:2,7!:2 NB. time and space required to execute sentence\\n ts 'isPalin0 foo'\\n2.73778e_5 5184\\n ts 'isPalin1 foo'\\n0.0306667 6.0368e6\\n ts 'isPalin2 foo'\\n0.104391 1.37965e7\\n 'isPalin1 foo' %&ts 'isPalin0 foo'\\n1599.09 1164.23\\n 'isPalin2 foo' %&ts 'isPalin0 foo'\\n3967.53 2627.04\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"fn is_palindrome(anon string: String) throws -> bool {\\n mut points: [u32] = []\\n for point in string.code_points() {\\n points.push(point)\\n }\\n\\n mut i: usize = 0\\n while i < points.size() / 2 {\\n if points[i] != points[points.size() - 1 - i] {\\n return false\\n }\\n i++\\n }\\n return true\\n}\\n\\nfn main() {\\n println(\\\"{}\\\", is_palindrome(\\\"amanaplanacanalpanama\\\"))\\n println(\\\"{}\\\", is_palindrome(\\\"madamimadam\\\"))\\n println(\\\"{}\\\", is_palindrome(\\\"madamimddam\\\"))\\n println(\\\"{}\\\", is_palindrome(\\\"私は私\\\"))\\n}\\n\",\n \"language\": \"Jakt\"\n },\n {\n \"code\": \"public static boolean pali(String testMe){\\n\\tStringBuilder sb = new StringBuilder(testMe);\\n\\treturn testMe.equals(sb.reverse().toString());\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static boolean isPalindrome(String input) {\\n\\tfor (int i = 0, j = input.length() - 1; i < j; i++, j--) {\\n\\t\\tchar startChar = input.charAt(i);\\n\\t\\tchar endChar = input.charAt(j);\\n\\n\\t\\t// Handle surrogate pairs in UTF-16\\n\\t\\tif (Character.isLowSurrogate(endChar)) {\\n\\t\\t\\tif (startChar != input.charAt(--j)) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\tif (input.charAt(++i) != endChar) {\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t} else if (startChar != endChar) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static boolean rPali(String testMe){\\n\\tif(testMe.length()<=1){\\n\\t\\treturn true;\\n\\t}\\n\\tif(!(testMe.charAt(0)+\\\"\\\").equals(testMe.charAt(testMe.length()-1)+\\\"\\\")){\\n\\t\\treturn false;\\n\\t}\\n\\treturn rPali(testMe.substring(1, testMe.length()-1));\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static boolean rPali(String testMe){\\n\\tint strLen = testMe.length();\\n\\treturn rPaliHelp(testMe, strLen-1, strLen/2, 0);\\n}\\n\\npublic static boolean rPaliHelp(String testMe, int strLen, int testLen, int index){\\n\\tif(index > testLen){\\n\\t\\treturn true;\\n\\t}\\n\\tif(testMe.charAt(index) != testMe.charAt(strLen-index)){\\n\\t\\treturn false;\\n\\t}\\n\\treturn rPaliHelp(testMe, strLen, testLen, index + 1);\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public static boolean pali(String testMe){\\n\\treturn testMe.matches(\\\"|(?:(.)(?<=(?=^.*?(\\\\\\\\1\\\\\\\\2?)$).*))+(?<=(?=^\\\\\\\\2$).*)\\\");\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function isPalindrome(str) {\\n return str === str.split(\\\"\\\").reverse().join(\\\"\\\");\\n}\\n\\nconsole.log(isPalindrome(\\\"ingirumimusnocteetconsumimurigni\\\"));\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var isPal = str => str === str.split(\\\"\\\").reverse().join(\\\"\\\");\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n\\n // isPalindrome :: String -> Bool\\n const isPalindrome = s => {\\n const cs = filter(c => ' ' !== c, s.toLocaleLowerCase());\\n return cs.join('') === reverse(cs).join('');\\n };\\n\\n\\n // TEST -----------------------------------------------\\n const main = () =>\\n isPalindrome(\\n 'In girum imus nocte et consumimur igni'\\n )\\n\\n // GENERIC FUNCTIONS ----------------------------------\\n\\n // filter :: (a -> Bool) -> [a] -> [a]\\n const filter = (f, xs) => (\\n 'string' !== typeof xs ? (\\n xs\\n ) : xs.split('')\\n ).filter(f);\\n\\n // reverse :: [a] -> [a]\\n const reverse = xs =>\\n 'string' !== typeof xs ? (\\n xs.slice(0).reverse()\\n ) : xs.split('').reverse().join('');\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def palindrome: explode | reverse == .;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def isPalindrome:\\n length as $n\\n | explode as $in\\n | first(range(0; $n/2)\\n | select($in[.] != $in[$n - 1 - .]) )\\n // false\\n | not;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"/* Palindrome detection, in Jsish */\\nfunction isPalindrome(str:string, exact:boolean=true) {\\n if (!exact) {\\n str = str.toLowerCase();\\n str = str.replace(/[ \\\\t,;:!?.]/g, '');\\n }\\n return str === str.match(/./g).reverse().join('');\\n}\\n\\n;isPalindrome('BUB');\\n;isPalindrome('CUB');\\n;isPalindrome('Bub');\\n;isPalindrome('Bub', false);\\n;isPalindrome('In girum imus nocte et consumimur igni', false);\\n;isPalindrome('A man, a plan, a canal; Panama!', false);\\n;isPalindrome('Never odd or even', false);\\n\\n/*\\n=!EXPECTSTART!=\\nisPalindrome('BUB') ==> true\\nisPalindrome('CUB') ==> false\\nisPalindrome('Bub') ==> false\\nisPalindrome('Bub', false) ==> true\\nisPalindrome('In girum imus nocte et consumimur igni', false) ==> true\\nisPalindrome('A man, a plan, a canal; Panama!', false) ==> true\\nisPalindrome('Never odd or even', false) ==> true\\n=!EXPECTEND!=\\n*/\\n\",\n \"language\": \"Jsish\"\n },\n {\n \"code\": \"palindrome(s) = s == reverse(s)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function palindrome(s)\\n len = length(s)\\n for i = 1:(len/2)\\n if(s[len-i+1]!=s[i])\\n return false\\n end\\n end\\n return true\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function palindrome(s)\\n len = length(s)\\n if(len==0 || len==1)\\n return true\\n end\\n if(s[1] == s[len])\\n return palindrome(SubString(s,2,len-1))\\n end\\n return false\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"is_palindrome:{x~|x}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\n/* These functions deal automatically with Unicode as all strings are UTF-16 encoded in Kotlin */\\n\\nfun isExactPalindrome(s: String) = (s == s.reversed())\\n\\nfun isInexactPalindrome(s: String): Boolean {\\n var t = \\\"\\\"\\n for (c in s) if (c.isLetterOrDigit()) t += c\\n t = t.toLowerCase()\\n return t == t.reversed()\\n}\\n\\nfun main(args: Array<String>) {\\n val candidates = arrayOf(\\\"rotor\\\", \\\"rosetta\\\", \\\"step on no pets\\\", \\\"été\\\")\\n for (candidate in candidates) {\\n println(\\\"'$candidate' is ${if (isExactPalindrome(candidate)) \\\"an\\\" else \\\"not an\\\"} exact palindrome\\\")\\n }\\n println()\\n val candidates2 = arrayOf(\\n \\\"In girum imus nocte et consumimur igni\\\",\\n \\\"Rise to vote, sir\\\",\\n \\\"A man, a plan, a canal - Panama!\\\",\\n \\\"Ce repère, Perec\\\" // note: 'è' considered a distinct character from 'e'\\n )\\n for (candidate in candidates2) {\\n println(\\\"'$candidate' is ${if (isInexactPalindrome(candidate)) \\\"an\\\" else \\\"not an\\\"} inexact palindrome\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"val .ispal = fn(.s) len(.s) > 0 and .s == reverse .s\\n\\nval .tests = h{\\n \\\"\\\": false,\\n \\\"z\\\": true,\\n \\\"aha\\\": true,\\n \\\"αηα\\\": true,\\n \\\"αννα\\\": true,\\n \\\"αννασ\\\": false,\\n \\\"sees\\\": true,\\n \\\"seas\\\": false,\\n \\\"deified\\\": true,\\n \\\"solo\\\": false,\\n \\\"solos\\\": true,\\n \\\"amanaplanacanalpanama\\\": true,\\n \\\"a man a plan a canal panama\\\": false, # true if we remove spaces\\n \\\"ingirumimusnocteetconsumimurigni\\\": true,\\n}\\n\\nfor .word in sort(keys .tests) {\\n val .foundpal = .ispal(.word)\\n writeln .word, \\\": \\\", .foundpal, if(.foundpal == .tests[.word]: \\\"\\\"; \\\" (FAILED TEST)\\\")\\n}\\n\",\n \"language\": \"Langur\"\n },\n {\n \"code\": \"define ispalindrome(text::string) => {\\n\\n\\tlocal(_text = string(#text)) // need to make copy to get rid of reference issues\\n\\n\\t#_text -> replace(regexp(`(?:$|\\\\W)+`), -ignorecase)\\n\\n\\tlocal(reversed = string(#_text))\\n\\t#reversed -> reverse\\n\\n\\treturn #_text == #reversed\\n}\\n\\nispalindrome('Tätatät') // works with high ascii\\nispalindrome('Hello World')\\n\\nispalindrome('A man, a plan, a canoe, pasta, heros, rajahs, a coloratura, maps, snipe, percale, macaroni, a gag, a banana bag, a tan, a tag, a banana bag again (or a camel), a crepe, pins, Spam, a rut, a Rolo, cash, a jar, sore hats, a peon, a canal – Panama!')\\n\",\n \"language\": \"Lasso\"\n },\n {\n \"code\": \"print isPalindrome(\\\"In girum imus nocte et consumimur igni\\\")\\nprint isPalindrome(removePunctuation$(\\\"In girum imus nocte et consumimur igni\\\", \\\"S\\\"))\\nprint isPalindrome(removePunctuation$(\\\"In girum imus nocte et consumimur igni\\\", \\\"SC\\\"))\\n\\nfunction isPalindrome(string$)\\n isPalindrome = 1\\n for i = 1 to int(len(string$)/2)\\n if mid$(string$, i, 1) <> mid$(string$, len(string$)-i+1, 1) then isPalindrome = 0 : exit function\\n next i\\nend function\\n\\nfunction removePunctuation$(string$, remove$)\\n 'P = remove puctuation. S = remove spaces C = remove case\\n If instr(upper$(remove$), \\\"C\\\") then string$ = lower$(string$)\\n If instr(upper$(remove$), \\\"P\\\") then removeCharacters$ = \\\",.!'()-&*?<>:;~[]{}\\\"\\n If instr(upper$(remove$), \\\"S\\\") then removeCharacters$ = removeCharacters$;\\\" \\\"\\n\\n for i = 1 to len(string$)\\n if instr(removeCharacters$, mid$(string$, i, 1)) then string$ = left$(string$, i-1);right$(string$, len(string$)-i) : i = i - 1\\n next i\\n removePunctuation$ = string$\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"function palindrome txt exact\\n if exact is empty or exact is not false then\\n set caseSensitive to true --default is false\\n else\\n replace space with empty in txt\\n put lower(txt) into txt\\n end if\\n return txt is reverse(txt)\\nend palindrome\\n\\nfunction reverse str\\n repeat with i = the length of str down to 1\\n put byte i of str after revstr\\n end repeat\\n return revstr\\nend reverse\\n\",\n \"language\": \"LiveCode\"\n },\n {\n \"code\": \"to palindrome? :w\\n output equal? :w reverse :w\\nend\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"function ispalindrome(s) return s == string.reverse(s) end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"define(`palindrorev',`ifelse(`$1',invert(`$1'),`yes',`no')')dnl\\npalindrorev(`ingirumimusnocteetconsumimurigni')\\npalindrorev(`this is not palindrome')\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \"define(`striptwo',`substr(`$1',1,eval(len(`$1')-2))')dnl\\ndefine(`cmplast',`ifelse(`striptwo(`$1')',,`yes',dnl\\nsubstr(`$1',0,1),substr(`$1',eval(len(`$1')-1),1),`yes',`no')')dnl\\ndefine(`palindro',`dnl\\nifelse(eval(len(`$1')<1),1,`yes',cmplast(`$1'),`yes',`palindro(striptwo(`$1'))',`no')')dnl\\npalindro(`ingirumimusnocteetconsumimurigni')\\npalindro(`this is not palindrome')\\n\",\n \"language\": \"M4\"\n },\n {\n \"code\": \" .TITLE PALIN\\n .MCALL .GTLIN,.PRINT,.EXIT\\nPALIN:: .GTLIN #INBUF ; READ INPUT\\n MOV #INBUF,R0\\n TSTB (R0) ; END OF INPUT?\\n BEQ 3$\\n JSR PC,EPALIN ; CHECK (EXACT) PALINDROME\\n BNE 1$\\n .PRINT #4$\\n BR PALIN\\n1$: MOV #INBUF,R0 ; CHECK INEXACT PALINDROME\\n JSR PC,IPALIN\\n BNE 2$\\n .PRINT #5$\\n BR PALIN\\n2$: .PRINT #6$ ; NOT A PALINDROME AT ALL\\n BR PALIN\\n3$: .EXIT\\n4$: .ASCIZ /EXACT PALINDROME/\\n5$: .ASCIZ /INEXACT PALINDROME/\\n6$: .ASCIZ /NOT A PALINDROME/\\n .EVEN\\n\\n ; IS STRING AT R0 AN EXACT PALINDROME?\\n ; ZERO FLAG SET IF TRUE\\nEPALIN: MOV R0,R1\\n1$: TSTB (R1)+ ; FIND END OF STRING\\n BNE 1$\\n DEC R1\\n2$: CMPB (R0)+,-(R1) ; SCAN BACKWARDS AND FORWARDS\\n BNE 4$ ; NOT PALINDROME?\\n CMP R0,R1 ; DONE YET?\\n BLT 2$\\n3$: CLR R1\\n4$: RTS PC\\n\\n ; IS STRING AT R0 AN INEXACT PALINDROME?\\nIPALIN: MOV #3$,R1 ; COPY TO BUFFER\\n BR 2$\\n1$: BICB #40,R2 ; MAKE UPPERCASE IF LETTER\\n CMPB R2,#101 ; < A = DISREGARD\\n BLT 2$\\n CMPB R2,#132 ; > Z = DISREGARD\\n BGT 2$\\n MOVB R2,(R1)+ ; STORE IN BUFFER\\n2$: MOVB (R0)+,R2 ; GET CHARACTER\\n BNE 1$ ; END?\\n CLRB (R1) ; ZERO TERMINATE BUFFER\\n MOV #3$,R0 ; NOW SEE IF RESULT IS EXACT PALINDROME\\n BR EPALIN\\n3$: .BLKB 200 ; BUFFER\\n\\nINBUF: .BLKB 200\\n .END PALIN\\n\",\n \"language\": \"MACRO-11\"\n },\n {\n \"code\": \"with(StringTools):\\n\\nIsPalindrome(\\\"ingirumimusnocteetconsumimurigni\\\");\\n\\nIsPalindrome(\\\"In girum imus nocte et consumimur igni\\\");\\n\\nIsPalindrome(LowerCase(DeleteSpace(\\\"In girum imus nocte et consumimur igni\\\")));\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"PalindromeQ\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function trueFalse = isPalindrome(string)\\n\\n trueFalse = all(string == fliplr(string)); %See if flipping the string produces the original string\\n\\n if not(trueFalse) %If not a palindrome\\n string = lower(string); %Lower case everything\\n trueFalse = all(string == fliplr(string)); %Test again\\n end\\n\\n if not(trueFalse) %If still not a palindrome\\n string(isspace(string)) = []; %Strip all space characters out\\n trueFalse = all(string == fliplr(string)); %Test one last time\\n end\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \">> isPalindrome('In girum imus nocte et consumimur igni')\\n\\nans =\\n\\n 1\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"palindromep(s) := block([t], t: sremove(\\\" \\\", sdowncase(s)), sequal(t, sreverse(t)))$\\n\\npalindromep(\\\"Sator arepo tenet opera rotas\\\"); /* true */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"fn isPalindrome s =\\n(\\n local reversed = \\\"\\\"\\n for i in s.count to 1 by -1 do reversed += s[i]\\n return reversed == s\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"fn isPalindrome_r s =\\n(\\n if s.count <= 1 then\\n (\\n true\\n )\\n else\\n (\\n if s[1] != s[s.count] then\\n (\\n return false\\n )\\n isPalindrome_r (substring s 2 (s.count-2))\\n )\\n)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"local p = \\\"ingirumimusnocteetconsumimurigni\\\"\\nformat (\\\"'%' is a palindrome? %\\\\n\\\") p (isPalindrome p)\\nformat (\\\"'%' is a palindrome? %\\\\n\\\") p (isPalindrome_r p)\\n\",\n \"language\": \"MAXScript\"\n },\n {\n \"code\": \"(dup reverse ==) :palindrome?\\n(dup \\\"\\\" split reverse \\\"\\\" join ==) :str-palindrome?\\n\\n\\\"apple\\\" str-palindrome? puts\\n\\\"racecar\\\" str-palindrome? puts\\n(a b c) palindrome? puts\\n(a b b a) palindrome? puts\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"isPalindrome = function(s)\\n // convert to lowercase, and strip non-letters\\n stripped = \\\"\\\"\\n for c in s.lower\\n \\tif c >= \\\"a\\\" and c <= \\\"z\\\" then stripped = stripped + c\\n end for\\n\\n // check palindromity\\n mid = floor(stripped.len/2)\\n for i in range(0, mid)\\n \\tif stripped[i] != stripped[-i - 1] then return false\\n end for\\n return true\\nend function\\n\\ntestStr = \\\"Madam, I'm Adam\\\"\\nanswer = [testStr, \\\"is\\\"]\\nif not isPalindrome(testStr) then answer.push \\\"NOT\\\"\\nanswer.push \\\"a palindrome\\\"\\nprint answer.join\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"def reverse(s:string)\\n StringBuilder.new(s).reverse.toString()\\nend\\n\\ndef palindrome?(s:string)\\n s.equals(reverse(s))\\nend\\n\\nputs palindrome?(\\\"anna\\\") # ==> true\\nputs palindrome?(\\\"Erik\\\") # ==> false\\nputs palindrome?(\\\"palindroom-moordnilap\\\") # ==> true\\nputs nil # ==> null\\n\",\n \"language\": \"Mirah\"\n },\n {\n \"code\": \"fun to_locase s = implode ` map (c_downcase) ` explode s\\n\\nfun only_alpha s = implode ` filter (fn x = c_alphabetic x) ` explode s\\n\\nfun is_palin\\n\\t( h1 :: t1, h2 :: t2, n = 0 ) \\t\\t = true\\n|\\t( h1 :: t1, h2 :: t2, n ) where ( h1 eql h2 ) = is_palin( t1, t2, n - 1)\\n|\\t( h1 :: t1, h2 :: t2, n ) = false\\n| (str s) =\\n\\t\\tlet\\n\\t\\t\\tval es = explode ` to_locase ` only_alpha s;\\n\\t\\t\\tval res = rev es;\\n\\t\\t\\tval k = (len es) div 2\\n\\t\\tin\\n\\t\\t\\tis_palin (es, res, k)\\n\\t\\tend\\n\\nfun test_is_palin s =\\n\\t(print \\\"\\\\\\\"\\\"; print s; print \\\"\\\\\\\" is a palindrome: \\\"; print ` is_palin s; println \\\"\\\")\\n\\nfun test (f, arg, res, ok, notok) = if (f arg eql res) then (\\\"'\\\" @ arg @ \\\"' \\\" @ ok) else (\\\"'\\\" @ arg @ \\\"' \\\" @ notok)\\n\\n;\\n\\nprintln ` test (is_palin, \\\"In girum imus nocte, et consumimur igni\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"Madam, I'm Adam.\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"salàlas\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"radar\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"Lagerregal\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"Ein Neger mit Gazelle zagt im Regen nie.\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\nprintln ` test (is_palin, \\\"something wrong\\\", true, \\\"is a palindrome\\\", \\\"is NOT a palindrome\\\");\\n\",\n \"language\": \"MLite\"\n },\n {\n \"code\": \"argc IS $0\\nargv IS $1\\n\\n LOC Data_Segment\\nDataSeg GREG @\\n\\n LOC @+1000\\nItsPalStr IS @-Data_Segment\\n BYTE \\\"It's palindrome\\\",10,0\\n LOC @+(8-@)&7\\nNoPalStr IS @-Data_Segment\\n BYTE \\\"It is not palindrome\\\",10,0\\n\\n LOC #100\\n GREG @\\n% input: $255 points to where the string to be checked is\\n% returns $255 0 if not palindrome, not zero otherwise\\n% trashs: $0,$1,$2,$3\\n% return address $4\\nDetectPalindrome LOC @\\n ADDU $1,$255,0 % $1 = $255\\n2H LDB $0,$1,0 % get byte at $1\\n BZ $0,1F % if zero, end (length)\\n INCL $1,1 % $1++\\n JMP 2B % loop\\n1H SUBU $1,$1,1 % ptr last char of string\\n ADDU $0,DataSeg,0 % $0 to data seg.\\n3H CMP $3,$1,$255 % is $0 == $255?\\n BZ $3,4F % then jump\\n LDB $3,$1,0 % otherwise get the byte\\n STB $3,$0,0 % and copy it\\n INCL $0,1 % $0++\\n SUB $1,$1,1 % $1--\\n JMP 3B\\n4H LDB $3,$1,0\\n STB $3,$0,0 % copy the last byte\\n% now let us compare reversed string and straight string\\n XOR $0,$0,$0 % index\\n ADDU $1,DataSeg,0\\n6H LDB $2,$1,$0 % pick char from rev str\\n LDB $3,$255,$0 % pick char from straight str\\n BZ $3,PaliOk % finished as palindrome\\n CMP $2,$2,$3 % == ?\\n BNZ $2,5F % if not, exit\\n INCL $0,1 % $0++\\n JMP 6B\\n5H XOR $255,$255,$255\\n GO $4,$4,0 % return false\\nPaliOk NEG $255,0,1\\n GO $4,$4,0 % return true\\n\\n% The Main for testing the function\\n% run from the command line\\n% $ mmix ./palindrome.mmo ingirumimusnocteetconsumimurigni\\nMain CMP argc,argc,2 % argc > 2?\\n BN argc,3F % no -> not enough arg\\n ADDU $1,$1,8 % argv+1\\n LDOU $255,$1,0 % argv[1]\\n GO $4,DetectPalindrome\\n BZ $255,2F % if not palindrome, jmp\\n SETL $0,ItsPalStr % pal string\\n ADDU $255,DataSeg,$0\\n JMP 1F\\n2H SETL $0,NoPalStr % no pal string\\n ADDU $255,DataSeg,$0\\n1H TRAP 0,Fputs,StdOut % print\\n3H XOR $255,$255,$255\\n TRAP 0,Halt,0 % exit(0)\\n\",\n \"language\": \"MMIX\"\n },\n {\n \"code\": \"MODULE Palindrome;\\nFROM FormatString IMPORT FormatString;\\nFROM Terminal IMPORT WriteString,ReadChar;\\n\\nPROCEDURE IsPalindrome(str : ARRAY OF CHAR) : BOOLEAN;\\nVAR i,m : INTEGER;\\nVAR buf : ARRAY[0..63] OF CHAR;\\nBEGIN\\n i := 0;\\n m := HIGH(str) - 1;\\n WHILE i<m DO\\n IF str[i] # str[m-i] THEN\\n RETURN FALSE\\n END;\\n INC(i)\\n END;\\n RETURN TRUE\\nEND IsPalindrome;\\n\\nPROCEDURE Print(str : ARRAY OF CHAR);\\nVAR buf : ARRAY[0..63] OF CHAR;\\nBEGIN\\n FormatString(\\\"%s: %b\\\\n\\\", buf, str, IsPalindrome(str));\\n WriteString(buf)\\nEND Print;\\n\\nBEGIN\\n Print(\\\"\\\");\\n Print(\\\"z\\\");\\n Print(\\\"aha\\\");\\n Print(\\\"sees\\\");\\n Print(\\\"oofoe\\\");\\n Print(\\\"deified\\\");\\n Print(\\\"Deified\\\");\\n Print(\\\"amanaplanacanalpanama\\\");\\n Print(\\\"ingirumimusnocteetconsumimurigni\\\");\\n\\n ReadChar\\nEND Palindrome.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"MODULE Palindrome;\\n\\nIMPORT Text;\\n\\nPROCEDURE isPalindrome(string: TEXT): BOOLEAN =\\n VAR len := Text.Length(string);\\n BEGIN\\n FOR i := 0 TO len DIV 2 - 1 DO\\n IF Text.GetChar(string, i) # Text.GetChar(string, (len - i - 1)) THEN\\n RETURN FALSE;\\n END;\\n END;\\n RETURN TRUE;\\n END isPalindrome;\\nEND Palindrome.\\n\",\n \"language\": \"Modula-3\"\n },\n {\n \"code\": \"def is_palindrome(s)\\n temp = \\\"\\\"\\n for char in s\\n if \\\"abcdefghikjklmnopqrstuvwxyz\\\" .contains. lower(char)\\n temp += lower(char)\\n end\\n end\\n\\n return list(temp) = list(temp).reverse()\\nend\\n\",\n \"language\": \"Nanoquery\"\n },\n {\n \"code\": \"using System;\\nusing System.Console;\\nusing Nemerle.Utility.NString; //contains methods Explode() and Implode() which convert string -> list[char] and back\\n\\nmodule Palindrome\\n{\\n IsPalindrome( text : string) : bool\\n {\\n Implode(Explode(text).Reverse()) == text;\\n }\\n\\n Main() : void\\n {\\n WriteLine(\\\"radar is a palindrome: {0}\\\", IsPalindrome(\\\"radar\\\"));\\n }\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"Clean( text : string ) : string\\n{\\n def sepchars = Explode(\\\",.;:-?!()' \\\");\\n Concat( \\\"\\\", Split(text, sepchars)).ToLower()\\n}\\n\",\n \"language\": \"Nemerle\"\n },\n {\n \"code\": \"y='In girum imus nocte et consumimur igni'\\n\\n-- translation: We walk around in the night and\\n-- we are burnt by the fire (of love)\\nsay\\nsay 'string = 'y\\nsay\\n\\npal=isPal(y)\\n\\nif pal==0 then say \\\"The string isn't palindromic.\\\"\\n else say 'The string is palindromic.'\\n\\nmethod isPal(x) static\\n x=x.upper().space(0) /* removes all blanks (spaces) */\\n /* and translate to uppercase. */\\n return x==x.reverse() /* returns 1 if exactly equal */\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(define (palindrome? s)\\n (setq r s)\\n (reverse r) ; Reverse is destructive.\\n (= s r))\\n\\n;; Make ‘reverse’ non-destructive and avoid a global variable\\n(define (palindrome? s)\\n (= s (reverse (copy s))))\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import unicode\\n\\n\\nfunc isPalindrome(rseq: seq[Rune]): bool =\\n ## Return true if a sequence of runes is a palindrome.\\n for i in 1..(rseq.len shr 1):\\n if rseq[i - 1] != rseq[^i]:\\n return false\\n result = true\\n\\n\\nfunc isPalindrome(str: string; exact = true): bool {.inline.} =\\n ## Return true if a UTF-8 string is a palindrome.\\n ## If \\\"exact\\\" is false, ignore white spaces and ignore case.\\n\\n if exact:\\n result = str.toRunes.isPalindrome()\\n else:\\n var rseq: seq[Rune]\\n for rune in str.runes:\\n if not rune.isWhiteSpace:\\n rseq.add rune.toLower\\n result = rseq.isPalindrome()\\n\\n\\nwhen isMainModule:\\n\\n proc check(s: string) =\\n var exact, inexact: bool\\n exact = s.isPalindrome()\\n if not exact:\\n inexact = s.isPalindrome(exact = false)\\n let txt = if exact: \\\" is an exact palindrome.\\\"\\n elif inexact: \\\" is an inexact palindrome.\\\"\\n else: \\\" is not a palindrome.\\\"\\n echo '\\\"', s, '\\\"', txt\\n\\ncheck \\\"rotor\\\"\\ncheck \\\"été\\\"\\ncheck \\\"αννα\\\"\\ncheck \\\"salà las\\\"\\ncheck \\\"In girum imus nocte et consumimur igni\\\"\\ncheck \\\"Esope reste ici et se repose\\\"\\ncheck \\\"This is a palindrom\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Test {\\n function : Main(args : String[]) ~ Nil {\\n IsPalindrome(\\\"aasa\\\")->PrintLine();\\n IsPalindrome(\\\"acbca\\\")->PrintLine();\\n IsPalindrome(\\\"xx\\\")->PrintLine();\\n }\\n\\n function : native : IsPalindrome(s : String) ~ Bool {\\n l := s->Size();\\n for(i := 0; i < l / 2; i += 1;) {\\n if(s->Get(i) <> s->Get(l - i - 1)) {\\n return false;\\n };\\n };\\n\\n return true;\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let is_palindrome s =\\n let l = String.length s in\\n let rec comp n =\\n n = 0 || (s.[l-n] = s.[n-1] && comp (n-1)) in\\n comp (l / 2)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let rem_space str =\\n let len = String.length str in\\n let res = Bytes.create len in\\n let rec aux i j =\\n if i >= len\\n then (Bytes.sub_string res 0 j)\\n else match str.[i] with\\n | ' ' | '\\\\n' | '\\\\t' | '\\\\r' ->\\n aux (i+1) (j)\\n | _ ->\\n Bytes.set res j str.[i];\\n aux (i+1) (j+1)\\n in\\n aux 0 0\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"function v = palindro_r(s)\\n if ( length(s) == 1 )\\n v = true;\\n return;\\n elseif ( length(s) == 2 )\\n v = s(1) == s(2);\\n return;\\n endif\\n if ( s(1) == s(length(s)) )\\n v = palindro_r(s(2:length(s)-1));\\n else\\n v = false;\\n endif\\nendfunction\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"function v = palindro(s)\\n v = all( (s == s(length(s):-1:1)) == 1);\\nendfunction\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"palindro_r(\\\"ingirumimusnocteetconsumimurigni\\\")\\npalindro(\\\"satorarepotenetoperarotas\\\")\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \"String method: isPalindrome self reverse self == ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"; simple case - only lowercase letters\\n(define (palindrome? str)\\n (let ((l (string->runes str)))\\n (equal? l (reverse l))))\\n\\n(print (palindrome? \\\"ingirumimusnocteetconsumimurigni\\\"))\\n; ==> #true\\n(print (palindrome? \\\"thisisnotapalindrome\\\"))\\n; ==> #false\\n\\n\\n; complex case - with ignoring letter case and punctuation\\n(define (alpha? x)\\n (<= #\\\\a x #\\\\z))\\n(define (lowercase x)\\n (if (<= #\\\\A x #\\\\Z)\\n (- x (- #\\\\A #\\\\a))\\n x))\\n\\n(define (palindrome? str)\\n (let ((l (filter alpha? (map lowercase (string->runes str)))))\\n (equal? l (reverse l))))\\n\\n(print (palindrome? \\\"A man, a plan, a cat, a ham, a yak, a yam, a hat, a canal-Panama!\\\"))\\n; ==> #true\\n(print (palindrome? \\\"This is not a palindrome\\\"))\\n; ==> #false\\n\",\n \"language\": \"Ol\"\n },\n {\n \"code\": \"fun {IsPalindrome S}\\n {Reverse S} == S\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"ispal(s)={\\n s=Vec(s);\\n for(i=1,#v\\\\2,\\n if(v[i]!=v[#v-i+1],return(0))\\n );\\n 1\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"ispal(s)={\\n my(d=digits(n));\\n for(i=1,#d\\\\2,\\n if(d[i]!=d[n+1=i],return(0))\\n );\\n 1\\n};\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program Palindro;\\n\\n{ RECURSIVE }\\nfunction is_palindro_r(s : String) : Boolean;\\nbegin\\n if length(s) <= 1 then\\n is_palindro_r := true\\n else begin\\n if s[1] = s[length(s)] then\\n\\t is_palindro_r := is_palindro_r(copy(s, 2, length(s)-2))\\n else\\n\\t is_palindro_r := false\\n end\\nend; { is_palindro_r }\\n\\n{ NON RECURSIVE; see [[Reversing a string]] for \\\"reverse\\\" }\\nfunction is_palindro(s : String) : Boolean;\\nbegin\\n if s = reverse(s) then\\n is_palindro := true\\n else\\n is_palindro := false\\nend;\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"procedure test_r(s : String; r : Boolean);\\nbegin\\n write('\\\"', s, '\\\" is ');\\n if ( not r ) then\\n write('not ');\\n writeln('palindrome')\\nend;\\n\\nvar\\n s1, s2 : String;\\n\\nbegin\\n s1 := 'ingirumimusnocteetconsumimurigni';\\n s2 := 'in girum imus nocte';\\n test_r(s1, is_palindro_r(s1));\\n test_r(s2, is_palindro_r(s2));\\n test_r(s1, is_palindro(s1));\\n test_r(s2, is_palindro(s2))\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program PalindromeDetection;\\nvar\\n input, output: string;\\n s: char; i: integer;\\nbegin\\n writeln('write down your input:');\\n readln(input);\\n output:='';\\n for i:=1 to length(input) do\\n begin\\n s:=input[i];\\n output:=s+output;\\n end;\\n writeln('');\\n if(input=output)then\\n writeln('input was palindrome')\\n else\\n writeln('input was not palindrome');\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"# Palindrome.pm\\npackage Palindrome;\\n\\nuse strict;\\nuse warnings;\\n\\nuse Exporter 'import';\\nour @EXPORT = qw(palindrome palindrome_c palindrome_r palindrome_e);\\n\\nsub palindrome\\n{\\n my $s = (@_ ? shift : $_);\\n return $s eq reverse $s;\\n}\\n\\nsub palindrome_c\\n{\\n my $s = (@_ ? shift : $_);\\n for my $i (0 .. length($s) >> 1)\\n {\\n return 0 unless substr($s, $i, 1) eq substr($s, -1 - $i, 1);\\n }\\n return 1;\\n}\\n\\nsub palindrome_r\\n{\\n my $s = (@_ ? shift : $_);\\n if (length $s <= 1) { return 1; }\\n elsif (substr($s, 0, 1) ne substr($s, -1, 1)) { return 0; }\\n else { return palindrome_r(substr($s, 1, -1)); }\\n}\\n\\nsub palindrome_e\\n{\\n (@_ ? shift : $_) =~ /^(.?|(.)(?1)\\\\2)$/ + 0\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"# pbench.pl\\nuse strict;\\nuse warnings;\\n\\nuse Benchmark qw(cmpthese);\\nuse Palindrome;\\n\\nprintf(\\\"%d, %d, %d, %d: %s\\\\n\\\",\\n palindrome, palindrome_c, palindrome_r, palindrome_e, $_)\\nfor\\n qw/a aa ab abba aBbA abca abba1 1abba\\n ingirumimusnocteetconsumimurigni/,\\n 'ab cc ba',\\t'ab ccb a';\\n\\nprintf \\\"\\\\n\\\";\\n\\nmy $latin = \\\"ingirumimusnocteetconsumimurigni\\\";\\ncmpthese(100_000, {\\n palindrome => sub { palindrome $latin },\\n palindrome_c => sub { palindrome_c $latin },\\n palindrome_r => sub { palindrome_r $latin },\\n palindrome_e => sub { palindrome_e $latin },\\n});\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">is_palindrome</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">is_palindrome</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"rotator\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints 1</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">is_palindrome</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"tractor\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- prints 0</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">punctuation</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" `~!@#$%^&*()-=_+[]{}\\\\\\\\|;:',.<>/?\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">nulls</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">punctuation</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">utf8_to_utf32</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">lower</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">punctuation</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nulls</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- these all print 1 (true)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Madam, I'm Adam.\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"A man, a plan, a canal: Panama!\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"In girum imus nocte et consumimur igni\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"人人為我,我為人人\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Я иду с мечем, судия\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"아들딸들아\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"가련하시다 사장집 아들딸들아 집장사 다시 하련가\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">extra_credit</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"tregða, gón, reiði - er nóg að gert\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef palindrome? dup reverse == enddef\\n\\n( \\\"abba\\\" \\\"boom\\\" \\\"radar\\\" \\\"civic\\\" \\\"great\\\" )\\nlen for get\\n\\tdup print \\\" : palindrome? \\\" print palindrome?\\n\\tif \\\"true\\\" else \\\"false\\\" endif ?\\nendfor\\n\\ndef letter? dup 'z' <= swap 'a' >= and enddef\\n\\n\\\"\\\" >ps\\n\\\"In girum imus nocte, et consumimur igni\\\" dup ? lower\\nlen for get\\n\\tdup letter?\\n\\tif\\n\\t\\tps> swap chain >ps\\n\\telse\\n\\t\\tdrop\\n\\tendif\\nendfor\\n\\nps> palindrome? if \\\"This is an inexact palindrome!\\\" else \\\"Not a palindrome.\\\" endif ?\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"<?php\\nfunction is_palindrome($string) {\\n return $string == strrev($string);\\n}\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"<?php\\nfunction is_palindrome($string) {\\n return preg_match('/^(?:(.)(?=.*(\\\\1(?(2)\\\\2|))$))*.?\\\\2?$/', $string);\\n}\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n Tests = [\\\"In girum imus nocte et consumimur igni\\\",\\n \\\"this is a non palindrome string\\\",\\n \\\"anna ABcdcBA anna\\\",\\n \\\"anna ABcdcBA annax\\\",\\n \\\"A man, a plan, a canoe, pasta, heros, rajahs\\\" ++\\n \\\"a coloratura, maps, snipe, percale, macaroni, \\\" ++\\n \\\"a gag, a banana bag, a tan, a tag, \\\" ++\\n \\\"a banana bag again (or a camel), a crepe, pins, \\\" ++\\n \\\"Spam, a rut, a Rolo, cash, a jar, sore hats, \\\" ++\\n \\\"a peon, a canal - Panama!\\\",\\n 10,\\n 111111,\\n 12221,\\n 9384212,\\n 10.01\\n ],\\n\\n foreach(Test in Tests)\\n if is_palindrome(Test) then\\n println([Test, \\\"exact palindrome\\\"])\\n elseif is_palindrome_inexact(Test) then\\n println([Test, \\\"inexact palindrome\\\"])\\n else\\n println([Test, \\\"no\\\"])\\n end\\n end,\\n nl.\\n\\n% Detect palindromes for strings (and numbers).\\nis_palindrome(N), number(N) => is_palindrome(N.to_string()).\\nis_palindrome(S) => S == S.reverse().\\n\\n% Detect inexact palindromes.\\nis_palindrome_inexact(N), number(N) => is_palindrome_inexact(N.to_string()).\\nis_palindrome_inexact(S) =>\\n is_palindrome(strip(S)).\\n\\n\\n% convert to lowercase and\\n% skips punctuation and white space.\\nstrip(S) = [C : C in S.to_lowercase(),\\n not C.membchk(\\\"!?,.;-_ \\\\t\\\\n()[]{}\\\")].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de palindrome? (S)\\n (= (setq S (chop S)) (reverse S)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"int main(){\\n if(pal(\\\"rotator\\\")){\\n write(\\\"palindrome!\\\\n\\\");\\n }\\n if(!pal(\\\"asdf\\\")){\\n write(\\\"asdf isn't a palindrome.\\\\n\\\");\\n }\\n}\\n\\nint pal(string input){\\n if( reverse(input) == input ){\\n return 1;\\n } else {\\n return 0;\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"is_palindrome = (text = reverse(text));\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"is_palindrome: procedure (text) returns (bit(1));\\n declare text character (*) varying;\\n\\n text = remove_blanks(text);\\n text = lowercase(text);\\n return (text = reverse(text));\\n\\nremove_blanks: procedure (text);\\n declare text character (*) varying;\\n declare (i, j) fixed binary (31);\\n j = 0;\\n do i = 1 to length(text);\\n if substr(text, i, 1) = ' ' then\\n do; j = j + 1; substr(text, j, 1) = substr(text, i, 1); end;\\n end;\\n return (substr(text, 1, j));\\nend remove_blanks;\\nend is_palindrome;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"100H:\\n\\n/* CHECK EXACT PALINDROME ASSUMING $-TERMINATED STRING */\\nPALINDROME: PROCEDURE(PTR) BYTE;\\n DECLARE (PTR, FRONT, BACK) ADDRESS, STR BASED PTR BYTE;\\n\\n /* FIND END */\\n FRONT, BACK = 0;\\n DO WHILE STR(BACK) <> '$';\\n BACK = BACK + 1;\\n END;\\n BACK = BACK - 1;\\n\\n /* CHECK MATCH */\\n DO WHILE (FRONT < BACK) AND (STR(FRONT) = STR(BACK));\\n FRONT = FRONT + 1;\\n BACK = BACK - 1;\\n END;\\n\\n RETURN FRONT >= BACK;\\nEND PALINDROME;\\n\\n/* CHECK INEXACT PALINDROME: FILTER OUT NON-LETTERS AND NUMBERS */\\nINEXACT$PALINDROME: PROCEDURE(PTR) BYTE;\\n /* 256 BYTES OUGHT TO BE ENOUGH FOR EVERYONE */\\n DECLARE (PTR, OPTR) ADDRESS;\\n DECLARE FILTER (256) BYTE;\\n DECLARE (IN BASED PTR, OUT BASED OPTR) BYTE;\\n OPTR = .FILTER;\\n\\n DO WHILE IN <> '$';\\n OUT = IN OR 32;\\n /* LOWERCASE CHARACTERS ARE NOT IN THE PL/M CHARSET,\\n BUT WE CAN JUST WRITE THE ASCII VALUES AS NUMBERS */\\n IF (OUT >= '0' AND OUT <= '9')\\n OR (OUT >= 97 AND OUT <= 122) THEN\\n OPTR = OPTR + 1;\\n PTR = PTR + 1;\\n END;\\n OUT = '$';\\n\\n RETURN PALINDROME(.FILTER);\\nEND INEXACT$PALINDROME;\\n\\n/* CP/M BDOS CALLS */\\nBDOS: PROCEDURE(FUNC, ARG);\\n DECLARE FUNC BYTE, ARG ADDRESS;\\n GO TO 5;\\nEND BDOS;\\n\\nPRINT: PROCEDURE(STRING);\\n DECLARE STRING ADDRESS;\\n CALL BDOS(9, STRING);\\nEND PRINT;\\n\\n/* TEST SOME STRINGS */\\nDECLARE STRINGS (8) ADDRESS;\\nSTRINGS(0) = .'ROTOR$';\\nSTRINGS(1) = .'RACECAR$';\\nSTRINGS(2) = .'LEVEL$';\\nSTRINGS(3) = .'REDDER$';\\nSTRINGS(4) = .'RACECAR$';\\nSTRINGS(5) = .'A MAN, A PLAN, A CANAL: PANAMA$';\\nSTRINGS(6) = .'EGAD, A BASE TONE DENOTES A BAD AGE.$';\\nSTRINGS(7) = .'ROSETTA$';\\n\\nDECLARE N BYTE;\\nDO N = 0 TO LAST(STRINGS);\\n CALL PRINT(STRINGS(N));\\n CALL PRINT(.': $');\\n IF PALINDROME(STRINGS(N)) THEN\\n CALL PRINT(.'EXACT$');\\n ELSE IF INEXACT$PALINDROME(STRINGS(N)) THEN\\n CALL PRINT(.'INEXACT$');\\n ELSE\\n CALL PRINT(.'NOT A PALINDROME$');\\n CALL PRINT(.(13,10,'$'));\\nEND;\\n\\nCALL BDOS(0,0);\\nEOF\\n\",\n \"language\": \"PL-M\"\n },\n {\n \"code\": \"To decide if a string is palindromic:\\nSlap a substring on the string.\\nLoop.\\nIf the substring's first is greater than the substring's last, say yes.\\nIf the substring's first's target is not the substring's last's target, say no.\\nAdd 1 to the substring's first.\\nSubtract 1 from the substring's last.\\nRepeat.\\n\",\n \"language\": \"Plain-English\"\n },\n {\n \"code\": \"isPalindrome(chars) =\\n chars == reverse(chars)\\n\",\n \"language\": \"Pointless\"\n },\n {\n \"code\": \"output =\\n \\\"A man, a plan, a canal -- Panama\\\"\\n |> toList\\n |> filter(inFunc(alNums))\\n |> map(toLower)\\n |> isPalindrome\\n |> println\\n\",\n \"language\": \"Pointless\"\n },\n {\n \"code\": \"# The readable recursive version\\npalindrome_i = (s, b, e):\\n if (e <= b): true.\\n elsif (s ord(b) != s ord(e)): false.\\n else: palindrome_i(s, b+1, e-1).\\n.\\n\\npalindrome = (s):\\n palindrome_i(s, 0, s length - 1).\\n\\npalindrome(argv(1))\\n\",\n \"language\": \"Potion\"\n },\n {\n \"code\": \"FUNCTION isPalindrome (what AS STRING) AS LONG\\n DIM whatcopy AS STRING, chk AS STRING, tmp AS STRING * 1, L0 AS LONG\\n\\n FOR L0 = 1 TO LEN(what)\\n tmp = UCASE$(MID$(what, L0, 1))\\n SELECT CASE tmp\\n CASE \\\"A\\\" TO \\\"Z\\\"\\n whatcopy = whatcopy & tmp\\n chk = tmp & chk\\n CASE \\\"0\\\" TO \\\"9\\\"\\n MSGBOX \\\"Numbers are cheating! (\\\"\\\"\\\" & what & \\\"\\\"\\\")\\\"\\n FUNCTION = 0\\n EXIT FUNCTION\\n END SELECT\\n NEXT\\n\\n FUNCTION = ISTRUE((whatcopy) = chk)\\nEND FUNCTION\\n\\n\\nFUNCTION PBMAIN () AS LONG\\n DATA \\\"My dog has fleas\\\", \\\"Madam, I'm Adam.\\\", \\\"1 on 1\\\", \\\"In girum imus nocte et consumimur igni\\\"\\n DIM L1 AS LONG, w AS STRING\\n FOR L1 = 1 TO DATACOUNT\\n w = READ$(L1)\\n IF ISTRUE(isPalindrome(w)) THEN\\n MSGBOX $DQ & w & \\\"\\\"\\\" is a palindrome\\\"\\n ELSE\\n MSGBOX $DQ & w & \\\"\\\"\\\" is not a palindrome\\\"\\n END IF\\n NEXT\\nEND FUNCTION\\n\",\n \"language\": \"PowerBASIC\"\n },\n {\n \"code\": \"Function Test-Palindrome( [String] $Text ){\\n $CharArray = $Text.ToCharArray()\\n [Array]::Reverse($CharArray)\\n $Text -eq [string]::join('', $CharArray)\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"function Test-Palindrome\\n{\\n <#\\n .SYNOPSIS\\n Tests if a string is a palindrome.\\n .DESCRIPTION\\n Tests if a string is a true palindrome or, optionally, an inexact palindrome.\\n .EXAMPLE\\n Test-Palindrome -Text \\\"racecar\\\"\\n .EXAMPLE\\n Test-Palindrome -Text '\\\"Deliver desserts,\\\" demanded Nemesis, \\\"emended, named, stressed, reviled.\\\"' -Inexact\\n #>\\n [CmdletBinding()]\\n [OutputType([bool])]\\n Param\\n (\\n # The string to test for palindrominity.\\n [Parameter(Mandatory=$true)]\\n [string]\\n $Text,\\n\\n # When specified, detects an inexact palindrome.\\n [switch]\\n $Inexact\\n )\\n\\n if ($Inexact)\\n {\\n # Strip all punctuation and spaces\\n $Text = [Regex]::Replace(\\\"$Text($7&\\\",\\\"[^1-9a-zA-Z]\\\",\\\"\\\")\\n }\\n\\n $Text -match \\\"^(?'char'[a-z])+[a-z]?(?:\\\\k'char'(?'-char'))+(?(char)(?!))$\\\"\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Test-Palindrome -Text 'radar'\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Test-Palindrome -Text \\\"In girum imus nocte et consumimur igni.\\\"\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Test-Palindrome -Text \\\"In girum imus nocte et consumimur igni.\\\" -Inexact\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Function Test-Palindrome {\\n[CmdletBinding()]\\nParam(\\n [Parameter(ValueFromPipeline)]\\n [string[]]$Text\\n)\\n\\nprocess {\\n :stringLoop foreach ($T in $Text)\\n {\\n # Normalize Unicode combining characters,\\n # so character á compares the same as (a+combining accent)\\n $T = $T.Normalize([Text.NormalizationForm]::FormC)\\n\\n # Remove anything from outside the Unicode category\\n # \\\"Letter from any language\\\"\\n $T = $T -replace '\\\\P{L}', ''\\n\\n # Walk from each end of the string inwards,\\n # comparing a char at a time.\\n # Avoids string copy / reverse overheads.\\n $Left, $Right = 0, [math]::Max(0, ($T.Length - 1))\\n while ($Left -lt $Right)\\n {\\n if ($T[$Left] -ne $T[$Right])\\n {\\n # return early if string is not a palindrome\\n [PSCustomObject]@{\\n Text = $T\\n IsPalindrome = $False\\n }\\n continue stringLoop\\n }\\n else\\n {\\n $Left++\\n $Right--\\n }\\n }\\n\\n # made it to here, then string is a palindrome\\n [PSCustomObject]@{\\n Text = $T\\n IsPalindrome = $True\\n }\\n\\n }\\n}\\n}\\n'ánu-ná', 'nowt' | Test-Palindrome\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"void setup(){\\n\\tprintln(isPalindrome(InsertPalindromeHere));\\n}\\n\\nboolean isPalindrome(string check){\\n\\tchar[] letters = new char[check.length];\\n\\tstring invert = \\\" \\\";\\n\\tstring modCheck = \\\" \\\" + check;\\n\\tfor(int i = 0; i < letters.length; i++){\\n\\t\\tletters[i] = check.charAt(i);\\n\\t}\\n\\tfor(int i = letters.length-1; i >= 0; i--){\\n\\t\\tinvert = invert + letters[i];\\n\\t}\\n\\t\\n\\tif(invert == modCheck){\\n\\t\\treturn true;\\n\\t} else {\\n\\t\\treturn false;\\n\\t}\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"void setup(){\\n println(\\\"PalindromeDetection\\\");\\n\\n String[] tests = {\\n \\\"abcba\\\",\\n \\\"aa\\\",\\n \\\"a\\\",\\n \\\"\\\",\\n \\\" \\\",\\n \\\"ab\\\",\\n \\\"abcdba\\\",\\n \\\"A man, a plan, a canal: Panama!\\\",\\n \\\"Dammit, I’m Mad!\\\",\\n \\\"Never odd or even\\\",\\n \\\"ingirumimusnocteetconsumimurigni\\\"\\n };\\n\\n for (int i = 0; i < tests.length; i++){\\n println((i + 1) + \\\". '\\\" + tests[i] + \\\"' isExactPalindrome: \\\" + isExactPalindrome(tests[i]) + \\\" isInexactPalindrome: \\\" + isInexactPalindrome(tests[i]));\\n }\\n}\\n\\n/*\\n* Check for exact palindrome using StringBuilder and String since String in Java does not provide any reverse functionality because Strings are immutable.\\n*/\\nboolean isExactPalindrome(String s){\\n\\tStringBuilder sb = new StringBuilder(s);\\n\\treturn s.equals(sb.reverse().toString());\\n}\\n\\n/*\\n* Check for inexact palindrome using the check for exact palindromeabove.\\n*/\\nboolean isInexactPalindrome(String s){\\n // removes all whitespaces and non-visible characters,\\n // remove anything besides alphabet characters\\n // ignore case\\n return isExactPalindrome(s.replaceAll(\\\"\\\\\\\\s+\\\",\\\"\\\").replaceAll(\\\"[^A-Za-z]+\\\", \\\"\\\").toLowerCase());\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"palindrome(Word) :- name(Word,List), reverse(List,List).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"pali(Str) :- sub_string(Str, 0, 1, _, X), string_concat(Str2, X, Str), string_concat(X, Mid, Str2), pali(Mid).\\npali(Str) :- string_length(Str, Len), Len < 2.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"pali(Str) :- sub_atom(Str, 0, 1, _, X), atom_concat(Str2, X, Str), atom_concat(X, Mid, Str2), pali(Mid).\\npali(Str) :- atom_length(Str, Len), Len < 2.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure IsPalindrome(StringToTest.s)\\n If StringToTest=ReverseString(StringToTest)\\n ProcedureReturn 1\\n Else\\n ProcedureReturn 0\\n EndIf\\nEndProcedure\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def is_palindrome(s):\\n return s == s[::-1]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def is_palindrome(s):\\n low = 0\\n high = len(s) - 1\\n while low < high:\\n if not s[low].isalpha():\\n low += 1\\n elif not s[high].isalpha():\\n high -= 1\\n else:\\n if s[low].lower() != s[high].lower():\\n return False\\n else:\\n low += 1\\n high -= 1\\n return True\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def is_palindrome_r(s):\\n if len(s) <= 1:\\n return True\\n elif s[0] != s[-1]:\\n return False\\n else:\\n return is_palindrome_r(s[1:-1])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def is_palindrome_r2(s):\\n return not s or s[0] == s[-1] and is_palindrome_r2(s[1:-1])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def test(f, good, bad):\\n assert all(f(x) for x in good)\\n assert not any(f(x) for x in bad)\\n print '%s passed all %d tests' % (f.__name__, len(good)+len(bad))\\n\\npals = ('', 'a', 'aa', 'aba', 'abba')\\nnotpals = ('aA', 'abA', 'abxBa', 'abxxBa')\\nfor ispal in is_palindrome, is_palindrome_r, is_palindrome_r2:\\n test(ispal, pals, notpals)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def p_loop():\\n import re, string\\n re1=\\\"\\\" # Beginning of Regex\\n re2=\\\"\\\" # End of Regex\\n pal=raw_input(\\\"Please Enter a word or phrase: \\\")\\n pd = pal.replace(' ','')\\n for c in string.punctuation:\\n pd = pd.replace(c,\\\"\\\")\\n if pal == \\\"\\\" :\\n return -1\\n c=len(pd) # Count of chars.\\n loops = (c+1)/2\\n for x in range(loops):\\n re1 = re1 + \\\"(\\\\w)\\\"\\n if (c%2 == 1 and x == 0):\\n continue\\n p = loops - x\\n re2 = re2 + \\\"\\\\\\\\\\\" + str(p)\\n regex= re1+re2+\\\"$\\\" # regex is like \\\"(\\\\w)(\\\\w)(\\\\w)\\\\2\\\\1$\\\"\\n #print(regex) # To test regex before re.search\\n m = re.search(r'^'+regex,pd,re.IGNORECASE)\\n if (m):\\n print(\\\"\\\\n \\\"+'\\\"'+pal+'\\\"')\\n print(\\\" is a Palindrome\\\\n\\\")\\n return 1\\n else:\\n print(\\\"Nope!\\\")\\n return 0\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Palindrome detection'''\\n\\n\\n# isPalindrome :: String -> Bool\\ndef isPalindrome(s):\\n '''True if the string is unchanged under reversal.\\n (The left half is a reflection of the right half)\\n '''\\n d, m = divmod(len(s), 2)\\n return s[0:d] == s[d + m:][::-1]\\n\\n\\n# ------------------------- TEST -------------------------\\n# main :: IO ()\\ndef main():\\n '''Test'''\\n\\n print('\\\\n'.join(\\n f'{repr(s)} -> {isPalindrome(cleaned(s))}' for s in [\\n \\\"\\\",\\n \\\"a\\\",\\n \\\"ab\\\",\\n \\\"aba\\\",\\n \\\"abba\\\",\\n \\\"In girum imus nocte et consumimur igni\\\"\\n ]\\n ))\\n\\n\\n# cleaned :: String -> String\\ndef cleaned(s):\\n '''A lower-case copy of s, with spaces pruned.'''\\n return [c.lower() for c in s if ' ' != c]\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def palindromic(str):\\n for i in range(len(str)//2):\\n if str[i] != str[~i]:\\n return(False)\\n return(True)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ dup reverse = ] is palindromic ( [ --> b )\\n\\n [ [] swap witheach\\n [ upper dup\\n dup lower = iff\\n drop else join ]\\n palindromic ] is inexactpalindrome ( $ --> b )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \" [ true swap\\n dup size 2 / times\\n [ dup i peek\\n over i ~ peek != if\\n [ dip not conclude ] ]\\n drop ] is palindromic ( [ --> b )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"palindro <- function(p) {\\n if ( nchar(p) == 1 ) {\\n return(TRUE)\\n } else if ( nchar(p) == 2 ) {\\n return(substr(p,1,1) == substr(p,2,2))\\n } else {\\n if ( substr(p,1,1) == substr(p, nchar(p), nchar(p)) ) {\\n return(palindro(substr(p, 2, nchar(p)-1)))\\n } else {\\n return(FALSE)\\n }\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"palindroi <- function(p) {\\n for(i in 1:floor(nchar(p)/2) ) {\\n r <- nchar(p) - i + 1\\n if ( substr(p, i, i) != substr(p, r, r) ) return(FALSE)\\n }\\n TRUE\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"revstring <- function(stringtorev) {\\n return(\\n paste(\\n strsplit(stringtorev,\\\"\\\")[[1]][nchar(stringtorev):1]\\n ,collapse=\\\"\\\")\\n )\\n}\\npalindroc <- function(p) {return(revstring(p)==p)}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"is.Palindrome <- function(string)\\n{\\n characters <- unlist(strsplit(string, \\\"\\\"))\\n all(characters == rev(characters))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"(define (palindromb str)\\n (let* ([lst (string->list (string-downcase str))]\\n [slst (remove* '(#\\\\space) lst)])\\n (string=? (list->string (reverse slst)) (list->string slst))))\\n\\n;;example output\\n\\n> (palindromb \\\"able was i ere i saw elba\\\")\\n#t\\n> (palindromb \\\"waht the hey\\\")\\n#f\\n> (palindromb \\\"In girum imus nocte et consumimur igni\\\")\\n#t\\n>\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"subset Palindrom of Str where {\\n .flip eq $_ given .comb(/\\\\w+/).join.lc\\n}\\n\\nmy @tests = q:to/END/.lines;\\n A man, a plan, a canal: Panama.\\n My dog has fleas\\n Madam, I'm Adam.\\n 1 on 1\\n In girum imus nocte et consumimur igni\\n END\\n\\nfor @tests { say $_ ~~ Palindrom, \\\"\\\\t\\\", $_ }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import String;\\n\\npublic bool palindrome(str text) = toLowerCase(text) == reverse(text);\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"import String;\\n\\npublic bool palindrome(str text){\\n\\ttext = replaceAll(toLowerCase(text), \\\" \\\", \\\"\\\");\\n\\treturn text == reverse(text);\\n}\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"rascal>palindrome(\\\"In girum imus nocte et consumimur igni\\\")\\nbool: true\\n\",\n \"language\": \"Rascal\"\n },\n {\n \"code\": \"REBOL [\\n Title: \\\"Palindrome Recognizer\\\"\\n URL: http://rosettacode.org/wiki/Palindrome\\n]\\n\\n; In order to compete with all the one-liners, the operation is\\n; compressed: parens force left hand side to evaluate first, where I\\n; copy the phrase, then uppercase it and assign it to 'p'. Now the\\n; right hand side is evaluated: p is copied, then reversed in place;\\n; the comparison is made and implicitely returned.\\n\\npalindrome?: func [\\n\\tphrase [string!] \\\"Potentially palindromatic prose.\\\"\\n\\t/local p\\n][(p: uppercase copy phrase) = reverse copy p]\\n\\n; Teeny Tiny Test Suite\\n\\nassert: func [code][print [either do code [\\\" ok\\\"][\\\"FAIL\\\"] mold code]]\\n\\nprint \\\"Simple palindromes, with an exception for variety:\\\"\\nrepeat phrase [\\\"z\\\" \\\"aha\\\" \\\"sees\\\" \\\"oofoe\\\" \\\"Deified\\\"][\\n\\tassert compose [palindrome? (phrase)]]\\n\\nprint [crlf \\\"According to the problem statement, these should fail:\\\"]\\nassert [palindrome? \\\"A man, a plan, a canal, Panama.\\\"] ; Punctuation not ignored.\\nassert [palindrome? \\\"In girum imus nocte et consumimur igni\\\"] ; Spaces not removed.\\n\\n; I know we're doing palindromes, not alliteration, but who could resist...?\\n\",\n \"language\": \"REBOL\"\n },\n {\n \"code\": \":palindrome? (s-f) dup s:hash [ s:reverse s:hash ] dip eq? ;\\n\\n'ingirumimusnocteetconsumimurigni palindrome? n:put\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX pgm checks if phrase is palindromic; ignores the case of the letters. */\\nparse arg y /*get (optional) phrase from the C.L. */\\nif y='' then y='In girum imus nocte et consumimur igni' /*[↓] translation.*/\\n /*We walk around in the night and we are burnt by the fire (of love).*/\\nsay 'string = ' y\\nif isTpal(y) then say 'The string is a true palindrome.'\\n else if isPal(y) then say 'The string is an inexact palindrome.'\\n else say \\\"The string isn't palindromic.\\\"\\nexit /*stick a fork in it, we're all done. */\\n/*────────────────────────────────────────────────────────────────────────────*/\\nisTpal: return reverse(arg(1))==arg(1)\\nisPal: return isTpal(translate(space(x,0)))\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX */\\n\\n/*Check whether a string is a palindrome */\\nparse pull string\\nselect\\n\\twhen palindrome(string) then say string 'is an exact palindrome.'\\n\\twhen palindrome(compress(upper(string))) then say string 'is an inexact palindrome.'\\n\\totherwise say string 'is not palindromic.'\\n\\tend\\nexit 0\\n\\npalindrome: procedure\\nparse arg string\\nreturn string==reverse(string)\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"func isPalindromeReverse(string: String): Boolean {\\n return string == string.reverse();\\n}\\n\",\n \"language\": \"Rhovas\"\n },\n {\n \"code\": \"func isPalindromeChars(chars: List<String>): Boolean {\\n match (chars) {\\n []: return true;\\n [elem]: return true;\\n [first, middle*, last]: return first == last && isPalindromeChars(middle);\\n }\\n}\\n\",\n \"language\": \"Rhovas\"\n },\n {\n \"code\": \"func isPalindrome(string: String): Boolean {\\n return isPalindromeReverse(string) && isPalindromeChars(string.chars);\\n}\\n\\nassert isPalindrome(\\\"\\\");\\nassert isPalindrome(\\\"f\\\");\\nassert isPalindrome(\\\"noon\\\");\\nassert isPalindrome(\\\"kayak\\\");\\nassert isPalindrome(\\\"step on no pets\\\");\\nassert !isPalindrome(\\\"palindrome\\\");\\nassert !isPalindrome(\\\"A man, a plan, a canal - Panama!\\\"); //inexact\\n\\nassert isPalindrome(\\\"§★♖★§\\\"); //single utf16 code points\\nassert isPalindromeReverse(\\\"🗲\\\"); //string reverse handles surrogates\\nassert !isPalindromeChars(\\\"🗲\\\".chars); //.chars splits surrogates into two chars\\n\",\n \"language\": \"Rhovas\"\n },\n {\n \"code\": \"aString = \\\"radar\\\"\\nbString = \\\"\\\"\\nfor i=len(aString) to 1 step -1\\n bString = bString + aString[i]\\nnext\\nsee aString\\nif aString = bString see \\\" is a palindrome.\\\" + nl\\nelse see \\\" is not a palindrome\\\" + nl ok\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def palindrome?(s)\\n s == s.reverse\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def r_palindrome?(s)\\n if s.length <= 1\\n true\\n elsif s[0] != s[-1]\\n false\\n else\\n r_palindrome?(s[1..-2])\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"str = \\\"A man, a plan, a caret, [...2110 chars deleted...] a canal--Panama.\\\".downcase.delete('^a-z')\\nputs palindrome?(str) # => true\\nputs r_palindrome?(str) # => true\\n\\nrequire 'benchmark'\\nBenchmark.bm do |b|\\n b.report('iterative') {10000.times {palindrome?(str)}}\\n b.report('recursive') {10000.times {r_palindrome?(str)}}\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"data \\\"My dog has fleas\\\", \\\"Madam, I'm Adam.\\\", \\\"1 on 1\\\", \\\"In girum imus nocte et consumimur igni\\\"\\n\\nfor i = 1 to 4\\n read w$\\n print w$;\\\" is \\\";isPalindrome$(w$);\\\" Palindrome\\\"\\nnext\\n\\nFUNCTION isPalindrome$(str$)\\nfor i = 1 to len(str$)\\n a$ = upper$(mid$(str$,i,1))\\n if (a$ >= \\\"A\\\" and a$ <= \\\"Z\\\") or (a$ >= \\\"0\\\" and a$ <= \\\"9\\\") then b$ = b$ + a$: c$ = a$ + c$\\nnext i\\nif b$ <> c$ then isPalindrome$ = \\\"not\\\"\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn is_palindrome(string: &str) -> bool {\\n let half_len = string.len() / 2;\\n string\\n .chars()\\n .take(half_len)\\n .eq(string.chars().rev().take(half_len))\\n}\\n\\nmacro_rules! test {\\n ( $( $x:tt ),* ) => { $( println!(\\\"'{}': {}\\\", $x, is_palindrome($x)); )* };\\n}\\n\\nfn main() {\\n test!(\\n \\\"\\\",\\n \\\"a\\\",\\n \\\"ada\\\",\\n \\\"adad\\\",\\n \\\"ingirumimusnocteetconsumimurigni\\\",\\n \\\"人人為我,我為人人\\\",\\n \\\"Я иду с мечем, судия\\\",\\n \\\"아들딸들아\\\",\\n \\\"The quick brown fox\\\"\\n );\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"extern crate unicode_segmentation;\\nuse unicode_segmentation::UnicodeSegmentation;\\nfn is_palindrome(string: &str) -> bool {\\n string.graphemes(true).eq(string.graphemes(true).rev())\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"The macro \\\"palindro\\\" has two parameters: string and ignorewhitespace.\\n string is the expression to be checked.\\n ignorewhitespace, (Y/N), determines whether or not to ignore blanks and punctuation.\\nThis macro was written in SAS 9.2. If you use a version before SAS 9.1.3,\\nthe compress function options will not work.\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"%MACRO palindro(string, ignorewhitespace);\\n DATA _NULL_;\\n %IF %UPCASE(&ignorewhitespace)=Y %THEN %DO;\\n/* The arguments of COMPRESS (sp) ignore blanks and puncutation */\\n/* We take the string and record it in reverse order using the REVERSE function. */\\n %LET rev=%SYSFUNC(REVERSE(%SYSFUNC(COMPRESS(&string,,sp))));\\n %LET string=%SYSFUNC(COMPRESS(&string.,,sp));\\n %END;\\n\\n %ELSE %DO;\\n %LET rev=%SYSFUNC(REVERSE(&string));\\n %END;\\n /*%PUT rev=&rev.;*/\\n /*%PUT string=&string.;*/\\n\\n/* Here we determine if the string and its reverse are the same. */\\n %IF %UPCASE(&string)=%UPCASE(&rev.) %THEN %DO;\\n %PUT TRUE;\\n %END;\\n %ELSE %DO;\\n %PUT FALSE;\\n %END;\\n RUN;\\n%MEND;\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \"%palindro(\\\"a man, a plan, a canal: panama\\\",y);\\n\\nTRUE\\n\\nNOTE: DATA statement used (Total process time):\\n real time 0.00 seconds\\n cpu time 0.00 seconds\\n\\n%palindro(\\\"a man, a plan, a canal: panama\\\",n);\\n\\nFALSE\\n\\nNOTE: DATA statement used (Total process time):\\n real time 0.00 seconds\\n cpu time 0.00 seconds\\n\",\n \"language\": \"SAS\"\n },\n {\n \"code\": \" def isPalindrome(s: String): Boolean = (s.size >= 2) && s == s.reverse\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \" def isPalindromeSentence(s: String): Boolean =\\n (s.size >= 2) && {\\n val p = s.replaceAll(\\\"[^\\\\\\\\p{L}]\\\", \\\"\\\").toLowerCase\\n p == p.reverse\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import scala.annotation.tailrec\\n\\n def isPalindromeRec(s: String) = {\\n @tailrec\\n def inner(s: String): Boolean =\\n (s.length <= 1) || (s.head == s.last) && inner(s.tail.init)\\n\\n (s.size >= 2) && inner(s)\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \" // Testing\\n assert(!isPalindrome(\\\"\\\"))\\n assert(!isPalindrome(\\\"z\\\"))\\n assert(isPalindrome(\\\"amanaplanacanalpanama\\\"))\\n assert(!isPalindrome(\\\"Test 1,2,3\\\"))\\n assert(isPalindrome(\\\"1 2 1\\\"))\\n assert(!isPalindrome(\\\"A man a plan a canal Panama.\\\"))\\n\\n assert(!isPalindromeSentence(\\\"\\\"))\\n assert(!isPalindromeSentence(\\\"z\\\"))\\n assert(isPalindromeSentence(\\\"amanaplanacanalpanama\\\"))\\n assert(!isPalindromeSentence(\\\"Test 1,2,3\\\"))\\n assert(isPalindromeSentence(\\\"1 2 1\\\"))\\n assert(isPalindromeSentence(\\\"A man a plan a canal Panama.\\\"))\\n\\n assert(!isPalindromeRec(\\\"\\\"))\\n assert(!isPalindromeRec(\\\"z\\\"))\\n assert(isPalindromeRec(\\\"amanaplanacanalpanama\\\"))\\n assert(!isPalindromeRec(\\\"Test 1,2,3\\\"))\\n assert(isPalindromeRec(\\\"1 2 1\\\"))\\n assert(!isPalindromeRec(\\\"A man a plan a canal Panama.\\\"))\\n\\n println(\\\"Successfully completed without errors.\\\")\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (palindrome? s)\\n (let ((chars (string->list s)))\\n (equal? chars (reverse chars))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"(define (palindrome? s)\\n (let loop ((i 0)\\n (j (- (string-length s) 1)))\\n (or (>= i j)\\n (and (char=? (string-ref s i) (string-ref s j))\\n (loop (+ i 1) (- j 1))))))\\n\\n;; Or:\\n(define (palindrome? s)\\n (let loop ((s (string->list s))\\n (r (reverse (string->list s))))\\n (or (null? s)\\n (and (char=? (car s) (car r))\\n (loop (cdr s) (cdr r))))))\\n\\n> (palindrome? \\\"ingirumimusnocteetconsumimurigni\\\")\\n#t\\n> (palindrome? \\\"This is not a palindrome\\\")\\n#f\\n>\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"h\\n:l\\ns/^\\\\(.\\\\)\\\\(.*\\\\)\\\\1$/\\\\2/\\ntl\\n/../d\\nx\\n\",\n \"language\": \"Sed\"\n },\n {\n \"code\": \"const func boolean: palindrome (in string: stri) is func\\n result\\n var boolean: isPalindrome is TRUE;\\n local\\n var integer: index is 0;\\n var integer: length is 0;\\n begin\\n length := length(stri);\\n for index range 1 to length div 2 do\\n if stri[index] <> stri[length - index + 1] then\\n isPalindrome := FALSE;\\n end if;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"palindrome(replace(\\\"in girum imus nocte et consumimur igni\\\", \\\" \\\", \\\"\\\"))\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"import <Utilities/Sequence.sl>;\\n\\nisPalindrome(string(1)) := equalList(string, reverse(string));\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"isPalindrome(string(1)) :=\\n\\tlet\\n\\t\\tcompares[i] := string[i] = string[size(string) - (i - 1)] foreach i within 1 ... (size(string) / 2);\\n\\tin\\n\\t\\tall(compares);\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"say \\\"noon\\\".is_palindrome # true\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func palindrome(s) {\\n s == s.reverse\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func palindrome(s) {\\n if (s.len <= 1) {\\n true\\n }\\n elsif (s.first != s.last) {\\n false\\n }\\n else {\\n __FUNC__(s.first(-1).last(-1))\\n }\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"BEGIN\\n\\n BOOLEAN PROCEDURE ISPALINDROME(T); TEXT T;\\n BEGIN\\n BOOLEAN RESULT;\\n INTEGER I, J;\\n I := 1;\\n J := T.LENGTH;\\n RESULT := TRUE;\\n WHILE RESULT AND I < J DO\\n BEGIN\\n CHARACTER L, R;\\n T.SETPOS(I); L := T.GETCHAR; I := I + 1;\\n T.SETPOS(J); R := T.GETCHAR; J := J - 1;\\n RESULT := L = R;\\n END;\\n ISPALINDROME := RESULT;\\n END ISPALINDROME;\\n\\n TEXT T;\\n FOR T :- \\\"\\\", \\\"A\\\", \\\"AA\\\", \\\"ABA\\\", \\\"SALALAS\\\", \\\"MADAMIMADAM\\\",\\n \\\"AB\\\", \\\"AAB\\\", \\\"ABCBDA\\\"\\n DO\\n BEGIN\\n OUTTEXT(IF ISPALINDROME(T) THEN \\\"IS \\\" ELSE \\\"ISN'T\\\");\\n OUTTEXT(\\\" PALINDROME: \\\");\\n OUTCHAR('\\\"');\\n OUTTEXT(T);\\n OUTCHAR('\\\"');\\n OUTIMAGE;\\n END;\\n\\nEND.\\n\",\n \"language\": \"Simula\"\n },\n {\n \"code\": \" 10 INPUT S$\\n 20 FOR I=1 TO LEN S$/2\\n 30 IF S$(I)<>S$(LEN S$-I+1) THEN GOTO 60\\n 40 NEXT I\\n 50 GOTO 70\\n 60 PRINT \\\"NOT A \\\";\\n 70 PRINT \\\"PALINDROME\\\"\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \" 15 GOSUB 90\\n 80 STOP\\n 90 LET T$=\\\"\\\"\\n100 FOR I=1 TO LEN S$\\n110 IF S$(I)>=\\\"A\\\" AND S$(I)<=\\\"Z\\\" THEN LET T$=T$+S$(I)\\n120 NEXT I\\n130 LET S$=T$\\n140 RETURN\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"s@(String traits) isPalindrome\\n[\\n (s lexicographicallyCompare: s reversed) isZero\\n].\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"s@(Sequence traits) isPalindrome\\n[\\n s isEmpty\\n ifTrue: [True]\\n ifFalse: [(s first = s last) /\\\\ [(s sliceFrom: 1 to: s indexLast - 1) isPalindrome]]\\n].\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"define: #p -> 'ingirumimusnocteetconsumimurigni'.\\ninform: 'sequence ' ; p ; ' is ' ; (p isPalindrome ifTrue: [''] ifFalse: ['not ']) ; 'a palindrome.'.\\n\",\n \"language\": \"Slate\"\n },\n {\n \"code\": \"isPalindrome := [:aString |\\n\\tstr := (aString select: [:chr| chr isAlphaNumeric]) collect: [:chr | chr asLowercase].\\n\\tstr = str reversed.\\n\\t].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"String extend [\\n palindro [ \\\"Non-recursive\\\"\\n ^ self = (self reverse)\\n ]\\n palindroR [ \\\"Recursive\\\"\\n (self size) <= 1 ifTrue: [ ^true ]\\n ifFalse: [ |o i f| o := self asOrderedCollection.\\n i := o removeFirst.\\n f := o removeLast.\\n i = f ifTrue: [ ^ (o asString) palindroR ]\\n ifFalse: [ ^false ]\\n ]\\n ]\\n].\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"('hello' palindro) printNl.\\n('hello' palindroR) printNl.\\n('ingirumimusnocteetconsumimurigni' palindro) printNl.\\n('ingirumimusnocteetconsumimurigni' palindroR) printNl.\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"SequenceableCollection>>isPalindrome\\n\\t^self reverse = self\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" define('pal(str)') :(pal_end)\\npal str notany(&ucase &lcase) = :s(pal)\\n str = replace(str,&ucase,&lcase)\\n leq(str,reverse(str)) :s(return)f(freturn)\\npal_end\\n\\n define('palchk(str)tf') :(palchk_end)\\npalchk output = str;\\n tf = 'False'; tf = pal(str) 'True'\\n output = 'Palindrome: ' tf :(return)\\npalchk_end\\n\\n* # Test and display\\n palchk('Able was I ere I saw Elba')\\n palchk('In girum imus nocte et consumimur igni')\\n palchk('The quick brown fox jumped over the lazy dogs')\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"#!/usr/local/bin/spar\\npragma annotate( summary, \\\"palindrome\\\" );\\npragma annotate( description, \\\"Write at least one function/method (or whatever it is\\\" );\\npragma annotate( description, \\\"called in your preferred language) to check if a\\\" );\\npragma annotate( description, \\\"sequence of characters (or bytes) is a palindrome or\\\" );\\npragma annotate( description, \\\"not. The function must return a boolean value (or\\\" );\\npragma annotate( description, \\\"something that can be used as boolean value, like an\\\" );\\npragma annotate( description, \\\"integer).\\\" );\\npragma annotate( see_also, \\\"http://rosettacode.org/wiki/Palindrome_detection\\\" );\\npragma annotate( author, \\\"Ken O. Burtch\\\" );\\npragma license( unrestricted );\\n\\npragma restriction( no_external_commands );\\n\\nprocedure palindrome is\\n\\n function is_palindrome( text : string ) return boolean is\\n begin\\n for offset in 0..strings.length( text ) / 2 -1 loop\\n if strings.element( text, offset+1) /= strings.element( text, positive( strings.length( text ) - offset ) ) then\\n return false;\\n end if;\\n end loop;\\n return true;\\n end is_palindrome;\\n\\n sentence : string;\\n result : boolean;\\nbegin\\n sentence := \\\"this is a test\\\";\\n result := is_palindrome( sentence );\\n put( sentence ) @ ( \\\" : \\\" ) @ ( result );\\n new_line;\\n\\n sentence := \\\"ablewasiereisawelba\\\";\\n result := is_palindrome( sentence );\\n put( sentence ) @ ( \\\" : \\\" ) @ ( result );\\n new_line;\\nend palindrome;\\n\",\n \"language\": \"SparForte\"\n },\n {\n \"code\": \"SET @txt = REPLACE('In girum imus nocte et consumimur igni', ' ', '');\\nSELECT REVERSE(@txt) = @txt;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"fun palindrome s =\\n let val cs = explode s in\\n cs = rev cs\\n end\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"import Foundation\\n\\n// Allow for easy character checking\\nextension String {\\n subscript (i: Int) -> String {\\n return String(Array(self)[i])\\n }\\n}\\n\\nfunc isPalindrome(str:String) -> Bool {\\n if (count(str) == 0 || count(str) == 1) {\\n return true\\n }\\n let removeRange = Range<String.Index>(start: advance(str.startIndex, 1), end: advance(str.endIndex, -1))\\n if (str[0] == str[count(str) - 1]) {\\n return isPalindrome(str.substringWithRange(removeRange))\\n }\\n return false\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func isPal(str: String) -> Bool {\\n let c = str.characters\\n return lazy(c).reverse()\\n .startsWith(c[c.startIndex...advance(c.startIndex, c.count / 2)])\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"templates palindrome\\n [$...] -> #\\n when <=$(last..first:-1)> do '$...;' !\\nend palindrome\\n\\n[['rotor', 'racecar', 'level', 'rosetta']... -> palindrome ] -> !OUT::write\\n\",\n \"language\": \"Tailspin\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nproc palindrome {s} {\\n return [expr {$s eq [string reverse $s]}]\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc palindrome_r {s} {\\n if {[string length $s] <= 1} {\\n return true\\n } elseif {[string index $s 0] ne [string index $s end]} {\\n return false\\n } else {\\n return [palindrome_r [string range $s 1 end-1]]\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set p ingirumimusnocteetconsumimurigni\\nputs \\\"'$p' is palindrome? [palindrome $p]\\\"\\nputs \\\"'$p' is palindrome? [palindrome_r $p]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT\\npal =\\\"ingirumimusnocteetconsumimurigni\\\"\\npal_r=TURN(pal)\\nSELECT pal\\nCASE $pal_r\\nPRINT \\\"true\\\"\\nDEFAULT\\nPRINT/ERROR \\\"untrue\\\"\\nENDSELECT\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"const detectNonLetterRegexp=/[^A-ZÀ-ÞЀ-Я]/g;\\n\\nfunction stripDiacritics(phrase:string){\\n return phrase.normalize('NFD').replace(/[\\\\u0300-\\\\u036f]/g, \\\"\\\")\\n}\\n\\nfunction isPalindrome(phrase:string){\\n const TheLetters = stripDiacritics(phrase.toLocaleUpperCase().replace(detectNonLetterRegexp, ''));\\n const middlePosition = TheLetters.length/2;\\n const leftHalf = TheLetters.substr(0, middlePosition);\\n const rightReverseHalf = TheLetters.substr(-middlePosition).split('').reverse().join('');\\n return leftHalf == rightReverseHalf;\\n}\\n\\nconsole.log(isPalindrome('Sueño que esto no es un palíndromo'))\\nconsole.log(isPalindrome('Dábale arroz a la zorra el abad!'))\\nconsole.log(isPalindrome('Я иду с мечем судия'))\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"≍⇌.\\\"tacocat\\\"\\n\",\n \"language\": \"Uiua\"\n },\n {\n \"code\": \"if [[ \\\"${text}\\\" == \\\"$(rev <<< \\\"${text}\\\")\\\" ]]; then\\n echo \\\"Palindrome\\\"\\nelse\\n echo \\\"Not a palindrome\\\"\\nfi\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n\\npalindrome = ~&cixE\\\\letters+ * -:~& ~=`A-~rlp letters\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %bL\\n\\nexamples = palindrome* <'abccba','foo ba rra bo of','notone'>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"fn is_pal_1(ss string) bool {\\n s := ss.runes()\\n for i in 0..s.len/2 {\\n if s[i] != s[s.len-1-i]{\\n return false\\n }\\n }\\n return true\\n}\\n\\nfn is_pal_2(word string) bool {\\n\\tif word == word.runes().reverse().string() {return true}\\n\\treturn false\\n}\\n\\nfn main() {\\n\\twords := [\\\"rotor\\\", \\\"rosetta\\\", \\\"step on no pets\\\", \\\"été\\\", \\\"wren\\\", \\\"🦊😀🦊\\\"]\\n\\tprintln('Check from is_pal_1:')\\n for word in words {\\n println('$word => ${is_pal_1(word)}')\\n }\\n\\tprintln('\\\\nCheck from is_pal_2:')\\n for word in words {\\n println('$word => ${is_pal_2(word)}')\\n }\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"bool is_palindrome (string str) {\\n var tmp = str.casefold ().replace (\\\" \\\", \\\"\\\");\\n return tmp == tmp.reverse ();\\n}\\n\\nint main (string[] args) {\\n print (is_palindrome (args[1]).to_string () + \\\"\\\\n\\\");\\n return 0;\\n}\\n\",\n \"language\": \"Vala\"\n },\n {\n \"code\": \"Public Function isPalindrome(aString as string) as Boolean\\ndim tempstring as string\\n tempstring = Lcase(Replace(aString, \\\" \\\", \\\"\\\"))\\n isPalindrome = (tempstring = Reverse(tempstring))\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"function Squish( s1 )\\n\\tdim sRes\\n\\tsRes = vbNullString\\n\\tdim i, c\\n\\tfor i = 1 to len( s1 )\\n\\t\\tc = lcase( mid( s1, i, 1 ))\\n\\t\\tif instr( \\\"abcdefghijklmnopqrstuvwxyz0123456789\\\", c ) then\\n\\t\\t\\tsRes = sRes & c\\n\\t\\tend if\\n\\tnext\\n\\tSquish = sRes\\nend function\\n\\t\\t\\nfunction isPalindrome( s1 )\\n\\tdim squished\\n\\tsquished = Squish( s1 )\\n\\tisPalindrome = ( squished = StrReverse( squished ) )\\nend function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"wscript.echo isPalindrome( \\\"My dog has fleas\\\")\\nwscript.echo isPalindrome( \\\"Madam, I'm Adam.\\\")\\nwscript.echo isPalindrome( \\\"1 on 1\\\")\\nwscript.echo isPalindrome( \\\"In girum imus nocte et consumimur igni\\\")\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \":PALINDROME:\\nEOL #2 = Cur_Col-2\\nBOL\\nfor (#1 = 0; #1 <= #2/2; #1++) {\\n if (CC(#1) != CC(#2-#1)) { Return(0) }\\n}\\nReturn(1)\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Call(\\\"PALINDROME\\\")\\nif (Return_Value) {\\n Statline_Message(\\\"Yes\\\")\\n} else {\\n Statline_Message(\\\"No\\\")\\n}\\nReturn\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Module Module1\\n\\n Function IsPalindrome(p As String) As Boolean\\n Dim temp = p.ToLower().Replace(\\\" \\\", \\\"\\\")\\n Return StrReverse(temp) = temp\\n End Function\\n\\n Sub Main()\\n Console.WriteLine(IsPalindrome(\\\"In girum imus nocte et consumimur igni\\\"))\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"@let {\\n ; Using a hook\\n pal1 @(= @rev)\\n ; Function with argument\\n pal2 &s = s @rev s\\n ; for inexact palindromes\\n pal3 ^(@(= @rev) .toLowerCase. &\\\\@replace[&\\\"\\\\s+\\\"g \\\"\\\"])\\n [[\\n !pal1 \\\"abcba\\\"\\n !pal2 \\\"abcbac\\\"\\n !pal3 \\\"In girum imus nocte et consumimur igni\\\"\\n ]]\\n}\\n\",\n \"language\": \"Wortel\"\n },\n {\n \"code\": \"var isPal = Fn.new { |word| word == ((word.count > 0) ? word[-1..0] : \\\"\\\") }\\n\\nSystem.print(\\\"Are the following palindromes?\\\")\\nfor (word in [\\\"rotor\\\", \\\"rosetta\\\", \\\"step on no pets\\\", \\\"été\\\", \\\"wren\\\", \\\"🦊😀🦊\\\"]) {\\n System.print(\\\" %(word) => %(isPal.call(word))\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"; x86_84 Linux nasm\\nsection .text\\n\\nisPalindrome:\\n mov rsi, rax\\n mov rdi, rax\\n\\n get_end:\\n cmp byte [rsi], 0\\n je get_result\\n inc rsi\\n jmp get_end\\n\\n get_result:\\n mov rax, 0\\n dec rsi\\n\\n compare:\\n mov cl, byte [rdi]\\n cmp byte [rsi], cl\\n jne not_palindrome\\n cmp rsi, rdi\\n je palindrome\\n inc rdi\\n cmp rdi, rsi\\n je palindrome\\n dec rsi\\n jmp compare\\n\\n not_palindrome:\\n mov rax, 0\\n ret\\n palindrome:\\n mov rax, 1\\n ret\\n\",\n \"language\": \"X86-Assembly\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nstring 0; \\\\use zero-terminated strings\\n\\nfunc StrLen(Str); \\\\Return number of characters in an ASCIIZ string\\nchar Str;\\nint I;\\nfor I:= 0 to -1>>1-1 do\\n if Str(I) = 0 then return I;\\n\\nfunc Palindrome(S); \\\\Return 'true' if S is a palindrome\\nchar S;\\nint L, I;\\n[L:= StrLen(S);\\nfor I:= 0 to L/2-1 do\\n if S(I) # S(L-1-I) then return false;\\nreturn true;\\n]; \\\\Palindrome\\n\\nint Word, I;\\n[Word:=\\n [\\\"otto\\\", \\\"mary\\\", \\\"ablewasiereisawelba\\\", \\\"ingirumimusnocteetconsumimurigni\\\"];\\nfor I:= 0 to 4-1 do\\n [Text(0, if Palindrome(Word(I)) then \\\"yes\\\" else \\\"no\\\");\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"func is_palindrome(str) {\\n s = strchar(str)(:-1);\\n return allof(s == s(::-1));\\n}\\n\\nfunc prep_palindrome(str) {\\n s = strchar(strlower(str));\\n w = where(s >= 'a' & s <= 'z');\\n return strchar(s(w));\\n}\\n\",\n \"language\": \"Yorick\"\n },\n {\n \"code\": \"\\t;\\n\\t; Check if input string is a palindrome using Z80 assembly language\\n\\t;\\n\\t; Runs under CP/M 3.1 on YAZE-AG-2.51.2 Z80 emulator\\n\\t; Assembled with zsm4 on same emulator/OS, uses macro capabilities of said assembler\\n\\t; Created with vim under Windows\\n\\t;\\n\\t; 2023-04-17 Xorph\\n\\t;\\n\\n\\t;\\n\\t; Useful definitions\\n\\t;\\n\\n\\tbdos\\tequ 05h\\t\\t; Call to CP/M BDOS function\\n\\tstrdel\\tequ 6eh\\t\\t; Set string delimiter\\n\\treadstr\\tequ 0ah\\t\\t; Read string from console\\n\\twrtstr\\tequ 09h\\t\\t; Write string to console\\n\\n\\tnul\\tequ 00h\\t\\t; ASCII control characters\\n\\tesc\\tequ 1bh\\n\\tcr\\tequ 0dh\\n\\tlf\\tequ 0ah\\n\\n\\tbuflen\\tequ 30h\\t\\t; Length of input buffer\\n\\n\\t;\\n\\t; Macros for BDOS calls\\n\\t;\\n\\nsetdel \\tmacro\\tchar\\t\\t; Set string delimiter to char\\n\\tld\\tc,strdel\\n\\tld\\te,char\\n\\tcall\\tbdos\\n\\tendm\\n\\nprint \\tmacro\\tmsg\\t\\t; Output string to console\\n\\tld\\tc,wrtstr\\n\\tld\\tde,msg\\n\\tcall\\tbdos\\n\\tendm\\n\\nnewline\\tmacro\\t\\t\\t; Print newline\\n\\tld\\tc,wrtstr\\n\\tld\\tde,crlf\\n\\tcall\\tbdos\\n\\tendm\\n\\nreadln \\tmacro\\tbuf\\t\\t; Read a line from input\\n\\tld\\tc,readstr\\n\\tld\\tde,buf\\n\\tcall\\tbdos\\n\\tendm\\n\\n\\t;\\n\\t; Other macros\\n\\t;\\n\\ntoupper\\tmacro\\n\\tlocal\\tnotlow\\n\\tcp\\t'a'\\n\\tjr\\tc,notlow\\n\\tcp\\t'z'+1\\n\\tjr\\tnc,notlow\\n\\tadd\\ta,'A'-'a'\\nnotlow:\\n\\tendm\\n\\n\\t;\\n\\t; =====================\\n\\t; Start of main program\\n\\t; =====================\\n\\t;\\n\\n\\tcseg\\n\\n\\tsetdel\\tnul\\t\\t; Set string delimiter to 00h\\n\\n\\tld\\tb,buflen\\t; Clear input buffer\\n\\tld\\thl,bufcont\\nclrloop:\\n\\tld\\t(hl),0\\n\\tinc\\thl\\n\\tdjnz\\tclrloop\\n\\n\\treadln\\tinputbuf\\t; Read a line from input\\n\\tnewline\\t\\t\\t; Newline is discarded during input, so write one...\\n\\n\\tld\\tb,buflen\\t; Convert all to uppercase\\n\\tld\\thl,bufcont\\nuprloop:\\n\\tld\\ta,(hl)\\n\\ttoupper\\n\\tld\\t(hl),a\\n\\tinc\\thl\\n\\tdjnz\\tuprloop\\n\\n\\tld\\ta,(inputbuf+1)\\t; Eliminate all spaces\\n\\tld\\tb,a\\t\\n\\tld\\tc,0\\t\\t; Counter for non-spaces\\n\\tld\\tix,bufcont\\t; String (buffer) address in ix\\n\\tld\\tiy,compress\\t; Compressed string (without blanks) goes to iy\\nspcloop:\\n\\tld\\ta,(ix)\\n\\tcp\\t' '\\n\\tjr\\tz,isblank\\n\\tinc\\tc\\t\\t; If not blank, move to (iy) and increment counter\\n\\tld\\t(iy),a\\n\\tinc\\tiy\\nisblank:\\n\\tinc\\tix\\n\\tdjnz\\tspcloop\\n\\n\\tld\\ta,c\\t\\t; Move back to original buffer\\n\\tld\\t(inputbuf+1),a\\t; New length of text without spaces for further processing\\n\\tld\\tb,0\\t\\t; bc now set correctly to new length\\n\\tld\\tde,bufcont\\t; Set up and use block move\\n\\tld\\thl,compress\\n\\tldir\\n\\tex\\tde,hl\\t\\t; Add nul terminator - target is in de, but memory load only via hl\\n\\tld\\t(hl),nul\\n\\n\\tprint\\tbufcont\\t\\t; Print actual text before start of check\\n\\tnewline\\n\\n\\tld\\ta,(inputbuf+1)\\t; Get number of characters entered into bc, if 0 quit\\n\\tld\\tb,0\\t\\t; bc can be used for adding the text length to iy\\n\\tcp\\tb\\t\\t; b is 0 for setting bc correctly and so can also be used for comparison\\n\\tjr\\tz,isnopali\\n\\tld\\tc,a\\t\\t; bc is now loaded correctly\\n\\n\\tld\\tix,bufcont\\t; ix points to start of string\\n\\tld\\tiy,bufcont\\t; iy points to end of string: Let it point to start...\\n\\tadd\\tiy,bc\\t\\t; ...and add the string's length - 1\\n\\tdec\\tiy\\n\\n\\tld\\tb,c\\t\\t; Use b as counter for comparison (djnz)\\n\\tsrl\\tb\\t\\t; Only need to check half the chars - if odd, the middle char need not be checked\\n\\nchkloop:\\n\\tld\\ta,(ix)\\t\\t; Actual comparison: Get (ix) into a and compare with (iy)\\n\\tcp\\t(iy)\\t\\t; Upon mismatch, quit immediately\\n\\tjr\\tnz,isnopali\\n\\tinc\\tix\\n\\tdec\\tiy\\n\\tdjnz\\tchkloop\\n\\n\\t; All comparisons ok, print success - fall through to ispali\\n\\nispali:\\n\\tld\\tde,messagey\\n\\tjr\\twriteres\\n\\nisnopali:\\n\\tld\\tde,messagen\\n\\t; Fall through to writeres\\n\\nwriteres:\\n\\tld\\tc,wrtstr\\t; Echo the text on screen\\n\\tcall\\tbdos\\n\\tnewline\\n\\n\\tret\\t\\t\\t; Return to CP/M\\n\\n\\t;\\n\\t; ===================\\n\\t; End of main program\\n\\t; ===================\\n\\t;\\n\\n\\t;\\n\\t; ================\\n\\t; Data definitions\\n\\t; ================\\n\\t;\\n\\n\\tdseg\\n\\ninputbuf:\\t\\t\\t; Input buffer\\n\\tdefb\\tbuflen\\t\\t; Maximum possible length\\n\\tdefb\\t00h\\t\\t; Returned length of actual input\\nbufcont:\\n\\tdefs\\tbuflen\\t\\t; Actual input area\\ncompress:\\n\\tdefs\\tbuflen\\t\\t; For eliminating spaces\\n\\nmessagey:\\n\\tdefz\\t'Yes'\\t\\t; Is a Palindrome\\n\\nmessagen:\\n\\tdefz\\t'No'\\t\\t; Is not a Palindrome\\n\\ncrlf:\\tdefb\\tcr,lf,nul\\t; Generic newline\\n\",\n \"language\": \"Z80-Assembly\"\n },\n {\n \"code\": \"fcn pali(text){\\n if (text.len()<2) return(False);\\n text==text.reverse();\\n}\\nfcn pali2(text){ pali((text - \\\" \\\\t\\\\n.,\\\").toLower()) } // or whatever punctuation is\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"program: palindrome\\n case: 1\\n input: abcdcba\\n output: true\\n\\n case: 2\\n input: dog\\n output: false\\n\\n case: 3\\n input: x\\n output: true\\n\\n case: 4\\n input: abc\\n output: false\\n\",\n \"language\": \"Zoea\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Palindrome-detection"}}},{"rowIdx":1478,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pancake_numbers\n","language":"00-META"},{"code":"Adrian Monk has problems and an assistant, Sharona Fleming. Sharona can deal with most of Adrian's problems except his lack of punctuality paying her remuneration. 2 pay checks down and she prepares him pancakes for breakfast. Knowing that he will be unable to eat them unless they are stacked in ascending order of size she leaves him only a skillet which he can insert at any point in the pile and flip all the above pancakes, repeating until the pile is sorted. Sharona has left the pile of n pancakes such that the maximum number of flips is required. Adrian is determined to do this in as few flips as possible. This sequence n->p(n) is known as the Pancake numbers.\n\nThe task is to determine p(n) for n = 1 to 9, and for each show an example requiring p(n) flips.\n\n[[Sorting_algorithms/Pancake_sort]] actually performs the sort some giving the number of flips used. How do these compare with p(n)?\n\nFew people know p(20), generously I shall award an extra credit for anyone doing more than p(16).\n\n\n;References\n# [https://www.bbvaopenmind.com/en/science/mathematics/bill-gates-and-the-pancake-problem Bill Gates and the pancake problem]\n# [https://oeis.org/A058986 A058986]\n<br><br>\n\n","language":"00-TASK"},{"code":"100 HOME\n110 FOR I = 0 TO 3\n120 FOR J = 1 TO 5\n130 LET N = (I * 5) + J\n140 LET C = C + 1\n150 GOSUB 200\n160 PRINT \"p(\"; N; \") = \"; P; \" \"\n170 NEXT J\n180 NEXT I\n190 END\n200 REM pancake(n)\n210 LET G = 2 : LET S = 2 : LET A = -1\n220 IF S < N THEN LET A = A + 1 : LET G = (G * 2) - 1 : LET S = S + G\n230 IF S >= N THEN LET P = N + A : RETURN\n240 GOTO 220\n","language":"Applesoft-BASIC"},{"code":"# syntax: GAWK -f PANCAKE_NUMBERS.AWK\n# converted from C\nBEGIN {\n for (i=0; i<4; i++) {\n for (j=1; j<6; j++) {\n n = i * 5 + j\n printf(\"p(%2d) = %2d \",n,main(n))\n }\n printf(\"\\n\")\n }\n exit(0)\n}\nfunction main(n, adj,gap,sum) {\n gap = 2\n sum = 2\n adj = -1\n while (sum < n) {\n adj++\n gap = gap * 2 - 1\n sum += gap\n }\n return(n + adj)\n}\n","language":"AWK"},{"code":"c = 0\n\nfor i = 0 to 3\n\tfor j = 1 to 5\n\t\tn = (i * 5) + j\n\t\tc += 1\n\t\tprint \"p(\"; rjust(string(n),2); \") = \"; pancake(n); \" \";\n\t\tif c mod 5 = 0 then print\n\tnext j\nnext i\nend\n\nfunction pancake(n)\n\tgap = 2\n\tsum = 2\n\tadj = -1\n\twhile sum < n\n\t\tadj += 1\n\t\tgap = (gap * 2) - 1\n\t\tsum += gap\n\tend while\n\treturn rjust(string(n + adj), 2)\nend function\n","language":"BASIC256"},{"code":"#include <stdio.h>\n\nint pancake(int n) {\n int gap = 2, sum = 2, adj = -1;\n while (sum < n) {\n adj++;\n gap = gap * 2 - 1;\n sum += gap;\n }\n return n + adj;\n}\n\nint main() {\n int i, j;\n for (i = 0; i < 4; i++) {\n for (j = 1; j < 6; j++) {\n int n = i * 5 + j;\n printf(\"p(%2d) = %2d \", n, pancake(n));\n }\n printf(\"\\n\");\n }\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <numeric>\n#include <iomanip>\n\nstd::vector<int32_t> flip_stack(std::vector<int32_t>& stack, const int32_t index) {\n\treverse(stack.begin(), stack.begin() + index);\n\treturn stack;\n}\n\nstd::pair<std::vector<int32_t>, int32_t> pancake(const int32_t number) {\n\tstd::vector<int32_t> initial_stack(number);\n\tstd::iota(initial_stack.begin(), initial_stack.end(), 1);\n\tstd::map<std::vector<int32_t>, int32_t> stack_flips = { std::make_pair(initial_stack, 1) };\n\tstd::queue<std::vector<int32_t>> queue;\n\tqueue.push(initial_stack);\n\n\twhile ( ! queue.empty() ) {\n\t\tstd::vector<int32_t> stack = queue.front();\n\t\tqueue.pop();\n\n\t\tconst int32_t flips = stack_flips[stack] + 1;\n\t\tfor ( int i = 2; i <= number; ++i ) {\n\t\t\tstd::vector<int32_t> flipped = flip_stack(stack, i);\n\t\t\tif ( stack_flips.find(flipped) == stack_flips.end() ) {\n\t\t\t\tstack_flips[flipped] = flips;\n\t\t\t\tqueue.push(flipped);\n\t\t\t}\n\t\t}\n }\n\n\tauto ptr = std::max_element(\n\t\tstack_flips.begin(), stack_flips.end(),\n\t\t[] ( const auto & pair1, const auto & pair2 ) {\n\t \treturn pair1.second < pair2.second;\n\t\t}\n\t);\n\n\treturn std::make_pair(ptr->first, ptr->second);\n}\n\nint main() {\n\tfor ( int32_t n = 1; n <= 9; ++n ) {\n\t\tstd::pair<std::vector<int32_t>, int32_t> result = pancake(n);\n\t\tstd::cout << \"pancake(\" << n << \") = \" << std::setw(2) << result.second << \". Example [\";\n\t\tfor ( uint64_t i = 0; i < result.first.size() - 1; ++i ) {\n\t\t\tstd::cout << result.first[i] << \", \";\n\t\t}\n\t\tstd::cout << result.first.back() << \"]\" << std::endl;\n\t}\n}\n","language":"C++"},{"code":"using System;\n\npublic class Pancake\n{\n private static int pancake(int n)\n {\n int gap = 2;\n int sum = 2;\n int adj = -1;\n while (sum < n)\n {\n adj++;\n gap = 2 * gap - 1;\n sum += gap;\n }\n return n + adj;\n }\n\n public static void Main(string[] args)\n {\n for (int i = 0; i < 4; i++)\n {\n for (int j = 1; j < 6; j++)\n {\n int n = 5 * i + j;\n Console.Write($\"p({n,2}) = {pancake(n),2} \");\n }\n Console.WriteLine();\n }\n }\n}\n","language":"C-sharp"},{"code":"100 c = 0\n110 for i = 0 to 3\n120 for j = 1 to 5\n130 n = (i*5)+j\n140 c = c+1\n150 print \"p(\";format$(n,\"##\");\") = \";format$(pancake(n),\"##\");\" \";\n160 if c mod 5 = 0 then print\n170 next j\n180 next i\n190 end\n200 function pancake(n)\n210 gap = 2\n220 sum = 2\n230 adj = -1\n240 while sum < n\n250 adj = adj+1\n260 gap = (gap*2)-1\n270 sum = sum+gap\n280 wend\n290 pancake = n+adj\n300 end function\n","language":"Chipmunk-Basic"},{"code":"include \"cowgol.coh\";\n\nsub pancake(n: uint8): (r: uint8) is\n var gap: uint8 := 2;\n var sum: uint8 := 2;\n var adj: int8 := -1;\n\n while sum < n loop\n adj := adj + 1;\n gap := gap * 2 - 1;\n sum := sum + gap;\n end loop;\n\n r := n + adj as uint8;\nend sub;\n\n# print 2-digit number\nsub print2(n: uint8) is\n if n<10 then\n print_char(' ');\n else\n print_char(n/10 + '0');\n end if;\n print_char(n%10 + '0');\nend sub;\n\n# print item\nsub print_item(n: uint8) is\n print(\"p(\");\n print2(n);\n print(\") = \");\n print2(pancake(n));\n print(\" \");\nend sub;\n\nvar i: uint8 := 0;\nwhile i < 4 loop\n var j: uint8 := 1;\n while j < 6 loop\n print_item(i*5 + j);\n j := j + 1;\n end loop;\n print_nl();\n i := i + 1;\nend loop;\n","language":"Cowgol"},{"code":"import std.stdio;\nimport std.algorithm;\nimport std.random;\nimport std.range;\n\nint pancake(int n) {\n int gap = 2, sum = 2, adj = -1;\n\t\n while (sum < n) {\n adj++;\n gap = 2 * gap - 1;\n sum += gap;\n }\n\t\n return n + adj;\n}\n\nRange pancakeSort(Range)(Range r) {\n\tforeach_reverse (immutable i; 2 .. r.length + 1) {\n\t\timmutable maxIndex = i - r[0 .. i].minPos!q{a > b}.length;\n\t\t\n\t\tif (maxIndex + 1 != i) {\n\t\t\tif (maxIndex != 0) {\n\t\t\t\tr[0 .. maxIndex + 1].reverse();\n\t\t\t}\n\t\t\t\n\t\t\tr[0 .. i].reverse();\n\t\t}\n\t}\n\t\n\treturn r;\n}\n\nvoid main() {\n\twriteln(\"\\nThe maximum number of flips to sort a given number of elements is:\\n\");\n\t\n\tforeach (i; 1..11)\n\t{\n\t\tauto data = iota(1, i+1).array;\n\t\t\n\t\tif (i != 1) {\n\t\t\t// Protection against the edge case data.lenght == 1 not handled by randomShuffle\n\t\t\t// where also data is invariant with regard to pancakeSort\n\t\t\tdo\n\t\t\t\tdata.randomShuffle;\n\t\t\twhile (data.isSorted);\n\t\t}\n\t\t\n\t\tauto sortedData = data.dup;\n\t\tsortedData.pancakeSort;\n\t\t\n\t\twritefln(\"pancake(%2d) = %2d e.g %s -> %s\", i, pancake(i), data, sortedData);\n\t}\n}\n","language":"D"},{"code":"// Pancake numbers. Nigel Galloway: October 28th., 2020\nlet pKake z=let n=[for n in 1..z-1->Array.ofList([n.. -1..0]@[n+1..z-1])]\n let e=let rec fG n g=match g with 0->n |_->fG (n*g) (g-1) in fG 1 z\n let rec fN i g l=match (Set.count g)-e with 0->(i,List.last l)\n |_->let l=l|>List.collect(fun g->[for n in n->List.permute(fun g->n.[g]) g])|>Set.ofList\n fN (i+1) (Set.union g l) (Set.difference l g|>Set.toList)\n fN 0 (set[[1..z]]) [[1..z]]\n\n[1..9]|>List.iter(fun n->let i,g=pKake n in printfn \"Maximum number of flips to sort %d elements is %d. e.g %A->%A\" n i g [1..n])\n","language":"F-Sharp"},{"code":"Dim As Integer num_pancakes = 20\nDim As Integer i, j, c = 0, n\n\nFunction pancake(n As Integer) As Integer\n Dim As Integer gap = 2, sum = 2, adj = -1\n While sum < n\n adj += 1\n gap = (gap * 2) - 1\n sum += gap\n Wend\n Return n + adj\nEnd Function\n\nFor i = 0 To 3\n For j = 1 To 5\n n = (i * 5) + j\n c += 1\n Print Using \"p(##) = ## \"; n; pancake(n);\n If c Mod 5 = 0 Then Print\n Next j\nNext i\n\nSleep\n","language":"FreeBASIC"},{"code":"Public Sub Main()\n\n Dim i As Integer, j As Integer, c As Integer = 0, n As Integer\n\n For i = 0 To 3\n For j = 1 To 5\n n = (i * 5) + j\n c += 1\n Print \"p(\"; Format$(n, \"##\"); \") = \"; Format$(pancake(n), \"##\"); \" \";\n If c Mod 5 = 0 Then Print\n Next\n Next\n\nEnd\n\nFunction pancake(n As Integer) As Integer\n\n Dim gap As Integer = 2, sum As Integer = 2, adj As Integer = -1\n\n While sum < n\n adj += 1\n gap = (gap * 2) - 1\n sum += gap\n Wend\n Return n + adj\n\nEnd Function\n","language":"Gambas"},{"code":"package main\n\nimport \"fmt\"\n\nfunc pancake(n int) int {\n gap, sum, adj := 2, 2, -1\n for sum < n {\n adj++\n gap = gap*2 - 1\n sum += gap\n }\n return n + adj\n}\n\nfunc main() {\n for i := 0; i < 4; i++ {\n for j := 1; j < 6; j++ {\n n := i*5 + j\n fmt.Printf(\"p(%2d) = %2d \", n, pancake(n))\n }\n fmt.Println()\n }\n}\n","language":"Go"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strconv\"\n \"strings\"\n \"time\"\n)\n\ntype assoc map[string]int\n\n// Converts a string of the form \"[1 2]\" into a slice of ints: {1, 2}\nfunc asSlice(s string) []int {\n split := strings.Split(s[1:len(s)-1], \" \")\n le := len(split)\n res := make([]int, le)\n for i := 0; i < le; i++ {\n res[i], _ = strconv.Atoi(split[i])\n }\n return res\n}\n\n// Merges two assocs into one. If the same key is present in both assocs\n// its value will be the one in the second assoc.\nfunc merge(m1, m2 assoc) assoc {\n m3 := make(assoc)\n for k, v := range m1 {\n m3[k] = v\n }\n for k, v := range m2 {\n m3[k] = v\n }\n return m3\n}\n\n// Finds the maximum value in 'dict' and returns the first key\n// it finds (iteration order is undefined) with that value.\nfunc findMax(dict assoc) string {\n max := -1\n maxKey := \"\"\n for k, v := range dict {\n if v > max {\n max = v\n maxKey = k\n }\n }\n return maxKey\n}\n\n// Creates a new slice of ints by reversing an existing one.\nfunc reverse(s []int) []int {\n le := len(s)\n rev := make([]int, le)\n for i := 0; i < le; i++ {\n rev[i] = s[le-1-i]\n }\n return rev\n}\n\nfunc pancake(n int) (string, int) {\n numStacks := 1\n gs := make([]int, n)\n for i := 0; i < n; i++ {\n gs[i] = i + 1\n }\n goalStack := fmt.Sprintf(\"%v\", gs)\n stacks := assoc{goalStack: 0}\n newStacks := assoc{goalStack: 0}\n for i := 1; i <= 1000; i++ {\n nextStacks := assoc{}\n for key := range newStacks {\n arr := asSlice(key)\n for pos := 2; pos <= n; pos++ {\n t := append(reverse(arr[0:pos]), arr[pos:len(arr)]...)\n newStack := fmt.Sprintf(\"%v\", t)\n if _, ok := stacks[newStack]; !ok {\n nextStacks[newStack] = i\n }\n }\n }\n newStacks = nextStacks\n stacks = merge(stacks, newStacks)\n perms := len(stacks)\n if perms == numStacks {\n return findMax(stacks), i - 1\n }\n numStacks = perms\n }\n return \"\", 0\n}\n\nfunc main() {\n start := time.Now()\n fmt.Println(\"The maximum number of flips to sort a given number of elements is:\")\n for i := 1; i <= 10; i++ {\n example, steps := pancake(i)\n fmt.Printf(\"pancake(%2d) = %-2d example: %s\\n\", i, steps, example)\n }\n fmt.Printf(\"\\nTook %s\\n\", time.Since(start))\n}\n","language":"Go"},{"code":"100 CLS\n110 FOR I = 0 TO 3\n120 FOR J = 1 TO 5\n130 N = (I*5)+J\n140 C = C+1\n150 GOSUB 200\n160 PRINT USING \"p(##) = ## \";N;PANCAKE\n170 NEXT J\n180 NEXT I\n190 END\n200 REM pancake(n)\n210 GAP = 2\n220 SUM = 2\n230 ADJ = -1\n240 IF SUM < N THEN ADJ = ADJ+1 : GAP = (GAP*2)-1 : SUM = SUM+GAP\n250 IF SUM >= N THEN PANCAKE = N+ADJ : RETURN\n260 GOTO 240\n","language":"GW-BASIC"},{"code":"public class Pancake {\n private static int pancake(int n) {\n int gap = 2;\n int sum = 2;\n int adj = -1;\n while (sum < n) {\n adj++;\n gap = 2 * gap - 1;\n sum += gap;\n }\n return n + adj;\n }\n\n public static void main(String[] args) {\n for (int i = 0; i < 4; i++) {\n for (int j = 1; j < 6; j++) {\n int n = 5 * i + j;\n System.out.printf(\"p(%2d) = %2d \", n, pancake(n));\n }\n System.out.println();\n }\n }\n}\n","language":"Java"},{"code":"import static java.util.Comparator.comparing;\nimport static java.util.stream.Collectors.toList;\n\nimport java.util.ArrayDeque;\nimport java.util.ArrayList;\nimport java.util.Collections;\nimport java.util.HashMap;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Queue;\nimport java.util.stream.IntStream;\n\n\npublic class Pancake {\n\n private static List<Integer> flipStack(List<Integer> stack, int spatula) {\n List<Integer> copy = new ArrayList<>(stack);\n Collections.reverse(copy.subList(0, spatula));\n return copy;\n }\n\n private static Map.Entry<List<Integer>, Integer> pancake(int n) {\n List<Integer> initialStack = IntStream.rangeClosed(1, n).boxed().collect(toList());\n Map<List<Integer>, Integer> stackFlips = new HashMap<>();\n stackFlips.put(initialStack, 1);\n Queue<List<Integer>> queue = new ArrayDeque<>();\n queue.add(initialStack);\n while (!queue.isEmpty()) {\n List<Integer> stack = queue.remove();\n int flips = stackFlips.get(stack) + 1;\n for (int i = 2; i <= n; ++i) {\n List<Integer> flipped = flipStack(stack, i);\n if (stackFlips.putIfAbsent(flipped, flips) == null) {\n queue.add(flipped);\n }\n }\n }\n return stackFlips.entrySet().stream().max(comparing(e -> e.getValue())).get();\n }\n\n public static void main(String[] args) {\n for (int i = 1; i <= 10; ++i) {\n Map.Entry<List<Integer>, Integer> result = pancake(i);\n System.out.printf(\"pancake(%s) = %s. Example: %s\\n\", i, result.getValue(), result.getKey());\n }\n }\n}\n","language":"Java"},{"code":"function pancake(len)\n gap, gapsum, adj = 2, 2, -1\n while gapsum < len\n adj += 1\n gap = gap * 2 - 1\n gapsum += gap\n end\n return len + adj\nend\n\nfor i in 1:25\n print(\"pancake(\", lpad(i, 2), \") = \", rpad(pancake(i), 5))\n i % 5 == 0 && println()\nend\n","language":"Julia"},{"code":"function pancake(len)\n goalstack = collect(1:len)\n stacks, numstacks = Dict(goalstack => 0), 1\n newstacks = deepcopy(stacks)\n for i in 1:1000\n nextstacks = Dict()\n for (arr, steps) in newstacks, pos in 2:len\n newstack = vcat(reverse(arr[1:pos]), arr[pos+1:end])\n haskey(stacks, newstack) || (nextstacks[newstack] = i)\n end\n newstacks = nextstacks\n stacks = merge(stacks, newstacks)\n perms = length(stacks)\n perms == numstacks && return findmax(stacks)\n numstacks = perms\n end\nend\n\nfor i in 1:10\n steps, example = pancake(i)\n println(\"pancake(\", lpad(i, 2), \") = \", rpad(steps, 5), \" example: \", example)\nend\n","language":"Julia"},{"code":"fun pancake(n: Int): Int {\n var gap = 2\n var sum = 2\n var adj = -1\n while (sum < n) {\n adj++\n gap = gap * 2 - 1\n sum += gap\n }\n return n + adj\n}\n\nfun main() {\n (1 .. 20).map {\"p(%2d) = %2d\".format(it, pancake(it))}\n val lines = results.chunked(5).map { it.joinToString(\" \") }\n lines.forEach { println(it) }\n}\n","language":"Kotlin"},{"code":"data class PancakeResult(val example: List<Int>, val depth: Int)\n\nfun pancake(n: Int): PancakeResult {\n fun List<Int>.copyFlip(spatula: Int) = toMutableList().apply { subList(0, spatula).reverse() }\n val initialStack = List(n) { it + 1 }\n val stackFlips = mutableMapOf(initialStack to 1)\n val queue = ArrayDeque(listOf(initialStack))\n while (queue.isNotEmpty()) {\n val stack = queue.removeFirst()\n val flips = stackFlips[stack]!! + 1\n for (spatula in 2 .. n) {\n val flipped = stack.copyFlip(spatula)\n if (stackFlips.putIfAbsent(flipped, flips) == null) {\n queue.addLast(flipped)\n }\n }\n }\n return stackFlips.maxByOrNull { it.value }!!.run { PancakeResult(key, value) }\n}\n\nfun main() {\n for (i in 1 .. 10) {\n with (pancake(i)) { println(\"pancake($i) = $depth. Example: $example\") }\n }\n}\n","language":"Kotlin"},{"code":" NORMAL MODE IS INTEGER\n VECTOR VALUES ROW = $5(2HP[,I2,4H] = ,I2,S2)*$\n\n INTERNAL FUNCTION(N)\n ENTRY TO P.\n GAP = 2\n ADJ = -1\n THROUGH LOOP, FOR SUM=2, GAP, SUM.GE.N\n ADJ = ADJ + 1\nLOOP GAP = GAP * 2 - 1\n FUNCTION RETURN N + ADJ\n END OF FUNCTION\n\n THROUGH OUTP, FOR R=1, 5, R.G.20\nOUTP PRINT FORMAT ROW, R,P.(R), R+1,P.(R+1), R+2,P.(R+2),\n 0 R+3,P.(R+3), R+4,P.(R+4), R+5,P.(R+5)\n\n END OF PROGRAM\n","language":"MAD"},{"code":"","language":"MSX-Basic"},{"code":"import strformat, strutils\n\nfunc pancake(n: int): int =\n var\n gap, sumGaps = 2\n pg = 1\n adj = -1\n while sumGaps < n:\n inc adj\n inc pg, gap\n swap pg, gap\n inc sumGaps, gap\n result = n + adj\n\nvar line = \"\"\nfor n in 1..20:\n line.addSep(\" \")\n line.add &\"p({n:>2}) = {pancake(n):>2}\"\n if n mod 5 == 0: (echo line; line.setLen(0))\n","language":"Nim"},{"code":"import sequtils, strformat, strutils, tables\n\ntype\n StepTable = TableRef[seq[int], int]\n Result = tuple[steps: int; example: seq[int]]\n\nfunc findMax(t: StepTable): Result =\n result.steps = -1\n for example, steps in t.pairs:\n if steps > result.steps:\n result = (steps, example)\n\nfunc partialReversed(arr: openArray[int]; pos: int): seq[int] =\n result.setlen(arr.len)\n for i in 0..<pos:\n result[i] = arr[pos - 1 - i]\n for i in pos..arr.high:\n result[i] = arr[i]\n\nfunc pancake(n: int): Result =\n var goalStack = toSeq(1..n)\n var stacks, newStacks: StepTable = newTable({goalStack: 0})\n var numStacks = 1\n for i in 1..1000:\n var nextStacks = new(StepTable)\n for arr, steps in newStacks.pairs:\n for pos in 2..n:\n let newStack = partialReversed(arr, pos)\n if newStack notin stacks:\n nextStacks[newStack] = i\n newStacks = nextStacks\n for key, value in newStacks:\n stacks[key] = value\n let perms = stacks.len\n if perms == numStacks:\n return stacks.findMax()\n numStacks = perms\n\nfor n in 1..10:\n let (steps, example) = pancake(n)\n echo &\"p({n:>2}) = {steps:>2} example: \", example.join(\", \")\n","language":"Nim"},{"code":"/*REXX program calculates/displays 20 pancake numbers (from 1 to 20,inclusive). */\nol=''\nDo pcn=1 To 20\n ol=ol 'p('format(pcn,2)') ='format(pancake(pcn),3)' '\n If pcn//5=0 Then Do\n Say strip(ol)\n ol=''\n End\n End\nExit\n/*------------------------------------------------------------------------------*/\npancake: Procedure\n Parse Arg n /* obtain N */\n gap= 2 /* initialize the GAP. */\n sum= 2 /* initialize the SUM. */\n Do adj=0 While sum <n /* perform while SUM is less than N. */\n gap= gap*2 - 1 /* calculate the GAP. */\n sum= sum + gap /* add the GAP to the SUM. */\n End /*adj*/\n Return n +adj -1 /* return an adjusted adjustment sum. */\n","language":"OoRexx"},{"code":"/* REXX Driver for pancake.test */\ndo n=2 To 10\n Call pancake n\n End\nExit\npancake: Procedure\n/**********************************************************************\n* REXX pancake.rex\n* The task is to determine p(n) for n = 1 to 9,\n* and for each show an example requiring p(n) flips.\n* inspired by java and output like Phix\n* Note: Using q~delete(1) to get the next candidate for flipping\n* has dramatic performance consequences for large stacks.\n* Therefore, I leave the queue alone and use a pointer (qp)\n* 20230604 Walter Pachl\n**********************************************************************/\nCall time 'R'\nparse arg n -- Number of pancakes\ninit=left('123456789abc',n) -- ordered pancakes\nCall o 'heureka' n\nq=.queue~new -- implements the queue\nqp=1\nex=0\nq~append(init)\nstackFlips.=-1 -- initialize map\nstackFlips.init=0 -- stackFlips.v: number of flips\n -- from init to v\ncnt.=0\ncnt.1=1\nmax=0\nDo while qp<=q~items -- as long we can flip\n s=q[qp]\n qp+=1 -- get next element\n flips=stackFlips.s+1 -- flips for the successors\n cnt.flips=cnt.flips+1 -- count them\n If flips>max Then ex=0 -- a new maximum\n max=max(max,flips)\n Do i=2 To n -- process n-1 successors\n t=flip(s,i) -- one of them\n If stackFlips.t=-1 Then Do -- not set so far\n stackFlips.t=flips -- flips from init to t\n q~append(t) -- append it to the queue\n If ex<3 Then Do -- show the forst 3 examples\n call o flips t\n If ex>=0 Then Do -- record the data to be shown\n example='' -- as an example (see o2)\n Do While t<>''\n Parse Var t c +1 t\n Select\n When c='a' Then c=10\n When c='b' Then c=11\n When c='c' Then c=12\n Otherwise Nop\n End\n example=example||c||','\n End\n exf=flips\n example=strip(example,'T',',')\n End\n ex=ex+1\n End\n End\n End\n End\nCall o 'max cnt.max:' max cnt.max\nte=time('E') -- elaüsed time\nte=strip(format(te,8,1))\nCall o te 'seconds'\nCall o ''\nCall o2 'p('n') = 'exf', example: {'example'} (of' cnt.max', 'te's)'\nReturn\n\nflip: Procedure\nParse Arg s,k -- cf. flipStack in java\nReturn substr(s,k,1)reverse(left(s,k-1))||substr(s,k+1)\n\no: -- investigation and debug output\nReturn\nSay arg(1)\nReturn lineout('heureka.txt',arg(1))\n\no2: -- result to be shown in rosettacode\nSay arg(1)\nCall lineout 'heureka.out',arg(1)\nCall lineout 'heureka.out'\nReturn\n","language":"OoRexx"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nsub pancake {\n my($n) = @_;\n my ($gap, $sum, $adj) = (2, 2, -1);\n while ($sum < $n) { $sum += $gap = $gap * 2 - 1 and $adj++ }\n $n + $adj;\n}\n\nmy $out;\n$out .= sprintf \"p(%2d) = %2d \", $_, pancake $_ for 1..20;\nsay $out =~ s/.{1,55}\\K /\\n/gr;\n\n# Maximum number of flips plus examples using exhaustive search\nsub pancake2 {\n my ($n) = @_;\n my $numStacks = 1;\n my @goalStack = 1 .. $n;\n my %newStacks = my %stacks = (join(' ',@goalStack), 0);\n for my $k (1..1000) {\n my %nextStacks;\n for my $pos (2..$n) {\n for my $key (keys %newStacks) {\n my @arr = split ' ', $key;\n my $cakes = join ' ', (reverse @arr[0..$pos-1]), @arr[$pos..$#arr];\n $nextStacks{$cakes} = $k unless $stacks{$cakes};\n }\n }\n %stacks = (%stacks, (%newStacks = %nextStacks));\n my $perms = scalar %stacks;\n my %inverted = reverse %stacks;\n return $k-1, $inverted{(sort keys %inverted)[-1]} if $perms == $numStacks;\n $numStacks = $perms;\n }\n}\n\nsay \"\\nThe maximum number of flips to sort a given number of elements is:\";\nfor my $n (1..9) {\n my ($a,$b) = pancake2($n);\n say \"pancake($n) = $a example: $b\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">gap</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sum_gaps</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">adj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">sum_gaps</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">adj</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">gap</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">sum_gaps</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">gap</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">adj</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">)}),</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">,{{</span><span style=\"color: #008000;\">\"p(%2d) = %2d\"</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">gap</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sum_gaps</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">adj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">sum_gaps</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">adj</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">gap</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">pg</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #000000;\">sum_gaps</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">gap</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">adj</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">t</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">)}),</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">,{{</span><span style=\"color: #008000;\">\"p(%2d) = %2d\"</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">))</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">visitor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000080;font-style:italic;\">/*unused*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- for pos=0 to length(stack)-2 do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">newstack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">reverse</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">])&</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #000080;font-style:italic;\">-- sequence newstack = stack[1..pos]&reverse(stack[pos+1..$])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">getd_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">newstack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])=</span><span style=\"color: #004600;\">NULL</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">newstack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[$])</span> <span style=\"color: #000080;font-style:italic;\">-- (next round)</span>\n <span style=\"color: #7060A8;\">setd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">newstack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #000080;font-style:italic;\">-- (the master)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">goalstack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">stacks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">goalstack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}})}</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">stacks</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">new_dict</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000080;font-style:italic;\">-- add any flips of stacks[$-1]\n -- not already in stacks[1]\n -- to stacks[$]</span>\n <span style=\"color: #7060A8;\">traverse_dict</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">visitor</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">dict_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[$])=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">eg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">getd_partial_key</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sz</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">dict_size</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">[$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #7060A8;\">papply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">destroy_dict</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stacks</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">eg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sz</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">8</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000080;font-style:italic;\">-- (for <2s)</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">eg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sz</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pancake</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"p(%d) = %d, example: %v (of %,d, %s)\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">eg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sz</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">elapsed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"Procedure pancake(n)\n gap.i = 2\n sum.i = 2\n adj.i = -1\n While sum < n\n adj + 1\n gap = (gap * 2) - 1\n sum + gap\n Wend\n ProcedureReturn n + adj\nEndProcedure\n\nOpenConsole()\nDefine.i i, j, c, n\n\nFor i = 0 To 3\n For j = 1 To 5\n n = (i * 5) + j\n c + 1\n Print(\"p(\" + RSet(Str(n),2) + \") = \" + RSet(Str(pancake(n)),2) + \" \")\n If Mod(c, 5 )= 0: PrintN(\"\"): EndIf\n Next j\nNext i\n\nInput()\nCloseConsole()\n","language":"PureBasic"},{"code":"\"\"\"Pancake numbers. Requires Python>=3.7.\"\"\"\nimport time\n\nfrom collections import deque\nfrom operator import itemgetter\nfrom typing import Tuple\n\nPancakes = Tuple[int, ...]\n\n\ndef flip(pancakes: Pancakes, position: int) -> Pancakes:\n \"\"\"Flip the stack of pancakes at the given position.\"\"\"\n return tuple([*reversed(pancakes[:position]), *pancakes[position:]])\n\n\ndef pancake(n: int) -> Tuple[Pancakes, int]:\n \"\"\"Return the nth pancake number.\"\"\"\n init_stack = tuple(range(1, n + 1))\n stack_flips = {init_stack: 0}\n queue = deque([init_stack])\n\n while queue:\n stack = queue.popleft()\n flips = stack_flips[stack] + 1\n\n for i in range(2, n + 1):\n flipped = flip(stack, i)\n if flipped not in stack_flips:\n stack_flips[flipped] = flips\n queue.append(flipped)\n\n return max(stack_flips.items(), key=itemgetter(1))\n\n\nif __name__ == \"__main__\":\n start = time.time()\n\n for n in range(1, 10):\n pancakes, p = pancake(n)\n print(f\"pancake({n}) = {p:>2}. Example: {list(pancakes)}\")\n\n print(f\"\\nTook {time.time() - start:.3} seconds.\")\n","language":"Python"},{"code":"DECLARE FUNCTION pancake! (n)\n\nFOR i = 0 TO 3\n FOR j = 1 TO 5\n n = (i * 5) + j\n c = c + 1\n PRINT USING \"p(##) = ## \"; n; pancake(n);\n IF c MOD 5 = 0 THEN PRINT\n NEXT j\nNEXT i\n\nFUNCTION pancake (n)\n gap = 2\n sum = 2\n adj = -1\n WHILE sum < n\n adj = adj + 1\n gap = (gap * 2) - 1\n sum = sum + gap\n WEND\n pancake = n + adj\nEND FUNCTION\n","language":"QBasic"},{"code":"# 20201110 Raku programming solution\n\nsub pancake(\\n) {\n my ($gap,$sum,$adj) = 2, 2, -1;\n while ($sum < n) { $sum += $gap = $gap * 2 - 1 and $adj++ }\n return n + $adj;\n}\n\nfor (1..20).rotor(5) { say [~] @_».&{ sprintf \"p(%2d) = %2d \",$_,pancake $_ } }\n","language":"Raku"},{"code":"sub pancake(\\n) {\n my @goalStack = (my \\numStacks = $ = 1)..n ;\n my %newStacks = my %stacks = @goalStack.Str, 0 ;\n for 1..1000 -> \\k {\n my %nextStacks = ();\n for %newStacks.keys».split(' ') X 2..n -> (@arr, \\pos) {\n given flat @arr[0..^pos].reverse, @arr[pos..*-1] {\n %nextStacks{$_.Str} = k unless %stacks{$_.Str}:exists\n }\n }\n %stacks ,= (%newStacks = %nextStacks);\n my $perms = %stacks.elems;\n my %inverted = %stacks.antipairs; # this causes loss on examples\n my \\max_key = %inverted.keys.max; # but not critical for our purpose\n $perms == numStacks ?? return %inverted{max_key}, k-1 !! numStacks=$perms\n }\n return '', 0\n}\n\nsay \"The maximum number of flips to sort a given number of elements is:\";\nfor 1..9 -> $j { given pancake($j) { say \"pancake($j) = $_[1] example: $_[0]\" }}\n","language":"Raku"},{"code":"/*REXX program calculates/displays 20 pancake numbers (from 1 to 20,inclusive). */\n/* Gerard Schildberger's code reformatted and refurbished */\npad=copies(' ',10) /*indentation. */\nSay pad center('pancakes',10 ) center('pancake flips',15) /*show the hdr.*/\nSay pad center('' ,10,\"-\") center('',15,\"-\") /* \" \" sep.*/\nDo pcn=1 To 20\n Say pad center(pcn,10) center(pancake(pcn),15) /*index,flips. */\n End\nExit /*stick a fork in it, we're all done. */\n/*------------------------------------------------------------------------------*/\npancake: Procedure\n Parse Arg n /* obtain N */\n gap= 2 /* initialize the GAP. */\n sum= 2 /* initialize the SUM. */\n Do adj=0 While sum <n /* perform while SUM is less than N. */\n gap= gap*2 - 1 /* calculate the GAP. */\n sum= sum + gap /* add the GAP to the SUM. */\n End /*adj*/\n Return n +adj -1 /* return an adjusted adjustment sum. */\n","language":"REXX"},{"code":"/* REXX Driver for pancake.test */\ndo n=2 To 10\n Call pancake n\n End\npancake: Procedure\n/**********************************************************************\n* REXX pancake.rex\n* The task is to determine p(n) for n = 1 to 9,\n* and for each show an example requiring p(n) flips.\n* inspired by java and output like Phix\n* 20230531 Walter Pachl\n**********************************************************************/\nCall time 'R'\nparse arg n -- Number of pancakes\ninit=left('123456789abc',n) -- ordered pancakes\nCall o 'heureka' n\nq.=0 -- implements the queue\nqp=1\nex=0\ncall qadd init\nstackFlips.=-1 -- initialize map\nstackFlips.init=0 -- stackFlips.v: number of flips\n -- from init to v\ncnt.=0\ncnt.1=1\nmax=0\nDo while qp<=q.0 -- as long we can flip\n s=qget() -- get head of queue\n flips=stackFlips.s+1 -- flips for the successors\n cnt.flips=cnt.flips+1 -- count them\n If flips>max Then ex=0 -- a new maximum\n max=max(max,flips)\n Do i=2 To n -- process n-1 successors\n t=flip(s,i) -- one of them\n If stackFlips.t=-1 Then Do -- not set so far\n stackFlips.t=flips -- flips from init to t\n Call qadd t -- append it to the queue\n If ex<3 Then Do -- show the first 3 examples\n call o flips t\n If ex>=0 Then Do -- record the data to be shown\n example='' -- as an example (see o2)\n Do While t<>''\n Parse Var t c +1 t\n Select\n When c='a' Then c=10\n When c='b' Then c=11\n When c='c' Then c=12\n Otherwise Nop\n End\n example=example||c||','\n End\n exf=flips\n example=strip(example,'T',',')\n End\n ex=ex+1\n End\n End\n End\n End\nCall o 'max cnt.max:' max cnt.max\nte=time('E') -- elapsed time\nte=strip(format(te,8,1))\nCall o te 'seconds'\nCall o ''\nCall o2 'p('n') = 'exf', example: {'example'} (of' cnt.max', 'te's)'\nReturn\n\nflip: Procedure\nParse Arg s,k -- cf. flipStack in java\nReturn substr(s,k,1)reverse(left(s,k-1))||substr(s,k+1)\n\nqadd: -- add an element to the queue\nParse Arg e\nz=q.0+1\nq.z=e\nq.0=z\nReturn\n\nqget: -- get top element from the queue\ne=q.qp -- and remove it from the queue\nqp=qp+1\nReturn e\n\no: -- investigation and debug output\nReturn\nSay arg(1)\nReturn lineout('heureka.txt',arg(1))\n\no2: -- result to be shown in rosettacode\nSay arg(1)\nCall lineout 'heureka.out',arg(1)\nCall lineout 'heureka.out'\nReturn\n","language":"REXX"},{"code":"for n = 1 to 9\n see \"p(\" + n + \") = \" + pancake(n) + nl\nnext\nreturn 0\n\nfunc pancake(n)\n gap = 2\n sum = 2\n adj = -1;\n while (sum < n)\n adj = adj + 1\n gap = gap * 2 - 1\n sum = sum + gap\n end\n return n + adj\n","language":"Ring"},{"code":"def pancake(n)\n gap = 2\n sum = 2\n adj = -1\n while sum < n\n adj = adj + 1\n gap = gap * 2 - 1\n sum = sum + gap\n end\n return n + adj\nend\n\nfor i in 0 .. 3\n for j in 1 .. 5\n n = i * 5 + j\n print \"p(%2d) = %2d \" % [n, pancake(n)]\n end\n print \"\\n\"\nend\n","language":"Ruby"},{"code":"fn pancake(n: i32) -> i32 {\n let mut gap = 2;\n let mut sum = 2;\n let mut adj = -1;\n\n while sum < n {\n adj += 1;\n gap = gap * 2 - 1;\n sum += gap;\n }\n\n n + adj\n}\n\nfn main() {\n for i in 0..4 {\n for j in 1..6 {\n let n = i * 5 + j;\n print!(\"p({:2}) = {:2} \", n, pancake(n));\n }\n println!();\n }\n}\n","language":"Rust"},{"code":"object Pancake {\n def pancake(n: Int): Int = {\n var gap = 2\n var sum = 2\n var adj = -1\n\n while (sum < n) {\n adj += 1\n gap = 2 * gap - 1\n sum += gap\n }\n\n n + adj\n }\n\n def main(args: Array[String]): Unit = {\n for (i <- 0 until 4) {\n for (j <- 1 until 6) {\n val n = 5 * i + j\n print(f\"p($n%2d) = ${pancake(n)}%2d \")\n }\n println()\n }\n }\n}\n","language":"Scala"},{"code":"FUNCTION pancake(n)\n LET gap = 2\n LET sum = 2\n LET adj = -1\n DO while sum < n\n LET adj = adj+1\n LET gap = (gap*2)-1\n LET sum = sum+gap\n LOOP\n LET pancake = n+adj\nEND FUNCTION\n\nFOR i = 0 to 3\n FOR j = 1 to 5\n LET n = (i*5)+j\n LET c = c+1\n PRINT using \"p(##) = ## \": n, pancake(n);\n IF remainder(round(c),5) = 0 then PRINT\n NEXT j\nNEXT i\nEND\n","language":"True-BASIC"},{"code":"import \"./fmt\" for Fmt\n\nvar pancake = Fn.new { |n|\n var gap = 2\n var sum = 2\n var adj = -1\n while (sum < n) {\n adj = adj + 1\n gap = gap*2 - 1\n sum = sum + gap\n }\n return n + adj\n}\n\nfor (i in 0..3) {\n for (j in 1..5) {\n var n = i*5 + j\n Fmt.write(\"p($2d) = $2d \", n, pancake.call(n))\n }\n System.print()\n}\n","language":"Wren"},{"code":"import \"./fmt\" for Fmt\n\n// Converts a string of the form \"[1, 2]\" into a list: [1, 2]\nvar asList = Fn.new { |s|\n var split = s[1..-2].split(\", \")\n return split.map { |n| Num.fromString(n) }.toList\n}\n\n// Merges two maps into one. If the same key is present in both maps\n// its value will be the one in the second map.\nvar mergeMaps = Fn.new { |m1, m2|\n var m3 = {}\n for (key in m1.keys) m3[key] = m1[key]\n for (key in m2.keys) m3[key] = m2[key]\n return m3\n}\n\n// Finds the maximum value in 'dict' and returns the first key\n// it finds (iteration order is undefined) with that value.\nvar findMax = Fn.new { |dict|\n var max = -1\n var maxKey = null\n for (me in dict) {\n if (me.value > max) {\n max = me.value\n maxKey = me.key\n }\n }\n return maxKey\n}\n\nvar pancake = Fn.new { |len|\n var numStacks = 1\n var goalStack = (1..len).toList.toString\n var stacks = {goalStack: 0}\n var newStacks = {goalStack: 0}\n for (i in 1..1000) {\n var nextStacks = {}\n for (key in newStacks.keys) {\n var arr = asList.call(key)\n var pos = 2\n while (pos <= len) {\n var newStack = (arr[pos-1..0] + arr[pos..-1]).toString\n if (!stacks.containsKey(newStack)) nextStacks[newStack] = i\n pos = pos + 1\n }\n }\n newStacks = nextStacks\n stacks = mergeMaps.call(stacks, newStacks)\n var perms = stacks.count\n if (perms == numStacks) return [findMax.call(stacks), i - 1]\n numStacks = perms\n }\n}\n\nvar start = System.clock\nSystem.print(\"The maximum number of flips to sort a given number of elements is:\")\nfor (i in 1..9) {\n var res = pancake.call(i)\n var example = res[0]\n var steps = res[1]\n Fmt.print(\"pancake($d) = $-2d example: $n\", i, steps, example)\n}\nSystem.print(\"\\nTook %(System.clock - start) seconds.\")\n","language":"Wren"},{"code":"for i = 0 to 3\n for j = 1 to 5\n n = (i * 5) + j\n c = c + 1\n print \"p(\", n using \"##\", \") = \";\n\t\tprint pancake(n) using \"##\", \" \";\n if mod(c, 5) = 0 print\n next j\nnext i\nend\n\nsub pancake(n)\n gap = 2\n sum = 2\n adj = -1\n while sum < n\n adj = adj + 1\n gap = (gap * 2) - 1\n sum = sum + gap\n wend\n return n + adj\nend sub\n","language":"Yabasic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pancake_numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Adrian Monk has problems and an assistant, Sharona Fleming. Sharona can deal with most of Adrian's problems except his lack of punctuality paying her remuneration. 2 pay checks down and she prepares him pancakes for breakfast. Knowing that he will be unable to eat them unless they are stacked in ascending order of size she leaves him only a skillet which he can insert at any point in the pile and flip all the above pancakes, repeating until the pile is sorted. Sharona has left the pile of n pancakes such that the maximum number of flips is required. Adrian is determined to do this in as few flips as possible. This sequence n->p(n) is known as the Pancake numbers.\\n\\nThe task is to determine p(n) for n = 1 to 9, and for each show an example requiring p(n) flips.\\n\\n[[Sorting_algorithms/Pancake_sort]] actually performs the sort some giving the number of flips used. How do these compare with p(n)?\\n\\nFew people know p(20), generously I shall award an extra credit for anyone doing more than p(16).\\n\\n\\n;References\\n# [https://www.bbvaopenmind.com/en/science/mathematics/bill-gates-and-the-pancake-problem Bill Gates and the pancake problem]\\n# [https://oeis.org/A058986 A058986]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"100 HOME\\n110 FOR I = 0 TO 3\\n120 FOR J = 1 TO 5\\n130 LET N = (I * 5) + J\\n140 LET C = C + 1\\n150 GOSUB 200\\n160 PRINT \\\"p(\\\"; N; \\\") = \\\"; P; \\\" \\\"\\n170 NEXT J\\n180 NEXT I\\n190 END\\n200 REM pancake(n)\\n210 LET G = 2 : LET S = 2 : LET A = -1\\n220 IF S < N THEN LET A = A + 1 : LET G = (G * 2) - 1 : LET S = S + G\\n230 IF S >= N THEN LET P = N + A : RETURN\\n240 GOTO 220\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"# syntax: GAWK -f PANCAKE_NUMBERS.AWK\\n# converted from C\\nBEGIN {\\n for (i=0; i<4; i++) {\\n for (j=1; j<6; j++) {\\n n = i * 5 + j\\n printf(\\\"p(%2d) = %2d \\\",n,main(n))\\n }\\n printf(\\\"\\\\n\\\")\\n }\\n exit(0)\\n}\\nfunction main(n, adj,gap,sum) {\\n gap = 2\\n sum = 2\\n adj = -1\\n while (sum < n) {\\n adj++\\n gap = gap * 2 - 1\\n sum += gap\\n }\\n return(n + adj)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"c = 0\\n\\nfor i = 0 to 3\\n\\tfor j = 1 to 5\\n\\t\\tn = (i * 5) + j\\n\\t\\tc += 1\\n\\t\\tprint \\\"p(\\\"; rjust(string(n),2); \\\") = \\\"; pancake(n); \\\" \\\";\\n\\t\\tif c mod 5 = 0 then print\\n\\tnext j\\nnext i\\nend\\n\\nfunction pancake(n)\\n\\tgap = 2\\n\\tsum = 2\\n\\tadj = -1\\n\\twhile sum < n\\n\\t\\tadj += 1\\n\\t\\tgap = (gap * 2) - 1\\n\\t\\tsum += gap\\n\\tend while\\n\\treturn rjust(string(n + adj), 2)\\nend function\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint pancake(int n) {\\n int gap = 2, sum = 2, adj = -1;\\n while (sum < n) {\\n adj++;\\n gap = gap * 2 - 1;\\n sum += gap;\\n }\\n return n + adj;\\n}\\n\\nint main() {\\n int i, j;\\n for (i = 0; i < 4; i++) {\\n for (j = 1; j < 6; j++) {\\n int n = i * 5 + j;\\n printf(\\\"p(%2d) = %2d \\\", n, pancake(n));\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <numeric>\\n#include <iomanip>\\n\\nstd::vector<int32_t> flip_stack(std::vector<int32_t>& stack, const int32_t index) {\\n\\treverse(stack.begin(), stack.begin() + index);\\n\\treturn stack;\\n}\\n\\nstd::pair<std::vector<int32_t>, int32_t> pancake(const int32_t number) {\\n\\tstd::vector<int32_t> initial_stack(number);\\n\\tstd::iota(initial_stack.begin(), initial_stack.end(), 1);\\n\\tstd::map<std::vector<int32_t>, int32_t> stack_flips = { std::make_pair(initial_stack, 1) };\\n\\tstd::queue<std::vector<int32_t>> queue;\\n\\tqueue.push(initial_stack);\\n\\n\\twhile ( ! queue.empty() ) {\\n\\t\\tstd::vector<int32_t> stack = queue.front();\\n\\t\\tqueue.pop();\\n\\n\\t\\tconst int32_t flips = stack_flips[stack] + 1;\\n\\t\\tfor ( int i = 2; i <= number; ++i ) {\\n\\t\\t\\tstd::vector<int32_t> flipped = flip_stack(stack, i);\\n\\t\\t\\tif ( stack_flips.find(flipped) == stack_flips.end() ) {\\n\\t\\t\\t\\tstack_flips[flipped] = flips;\\n\\t\\t\\t\\tqueue.push(flipped);\\n\\t\\t\\t}\\n\\t\\t}\\n }\\n\\n\\tauto ptr = std::max_element(\\n\\t\\tstack_flips.begin(), stack_flips.end(),\\n\\t\\t[] ( const auto & pair1, const auto & pair2 ) {\\n\\t \\treturn pair1.second < pair2.second;\\n\\t\\t}\\n\\t);\\n\\n\\treturn std::make_pair(ptr->first, ptr->second);\\n}\\n\\nint main() {\\n\\tfor ( int32_t n = 1; n <= 9; ++n ) {\\n\\t\\tstd::pair<std::vector<int32_t>, int32_t> result = pancake(n);\\n\\t\\tstd::cout << \\\"pancake(\\\" << n << \\\") = \\\" << std::setw(2) << result.second << \\\". Example [\\\";\\n\\t\\tfor ( uint64_t i = 0; i < result.first.size() - 1; ++i ) {\\n\\t\\t\\tstd::cout << result.first[i] << \\\", \\\";\\n\\t\\t}\\n\\t\\tstd::cout << result.first.back() << \\\"]\\\" << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\npublic class Pancake\\n{\\n private static int pancake(int n)\\n {\\n int gap = 2;\\n int sum = 2;\\n int adj = -1;\\n while (sum < n)\\n {\\n adj++;\\n gap = 2 * gap - 1;\\n sum += gap;\\n }\\n return n + adj;\\n }\\n\\n public static void Main(string[] args)\\n {\\n for (int i = 0; i < 4; i++)\\n {\\n for (int j = 1; j < 6; j++)\\n {\\n int n = 5 * i + j;\\n Console.Write($\\\"p({n,2}) = {pancake(n),2} \\\");\\n }\\n Console.WriteLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"100 c = 0\\n110 for i = 0 to 3\\n120 for j = 1 to 5\\n130 n = (i*5)+j\\n140 c = c+1\\n150 print \\\"p(\\\";format$(n,\\\"##\\\");\\\") = \\\";format$(pancake(n),\\\"##\\\");\\\" \\\";\\n160 if c mod 5 = 0 then print\\n170 next j\\n180 next i\\n190 end\\n200 function pancake(n)\\n210 gap = 2\\n220 sum = 2\\n230 adj = -1\\n240 while sum < n\\n250 adj = adj+1\\n260 gap = (gap*2)-1\\n270 sum = sum+gap\\n280 wend\\n290 pancake = n+adj\\n300 end function\\n\",\n \"language\": \"Chipmunk-Basic\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub pancake(n: uint8): (r: uint8) is\\n var gap: uint8 := 2;\\n var sum: uint8 := 2;\\n var adj: int8 := -1;\\n\\n while sum < n loop\\n adj := adj + 1;\\n gap := gap * 2 - 1;\\n sum := sum + gap;\\n end loop;\\n\\n r := n + adj as uint8;\\nend sub;\\n\\n# print 2-digit number\\nsub print2(n: uint8) is\\n if n<10 then\\n print_char(' ');\\n else\\n print_char(n/10 + '0');\\n end if;\\n print_char(n%10 + '0');\\nend sub;\\n\\n# print item\\nsub print_item(n: uint8) is\\n print(\\\"p(\\\");\\n print2(n);\\n print(\\\") = \\\");\\n print2(pancake(n));\\n print(\\\" \\\");\\nend sub;\\n\\nvar i: uint8 := 0;\\nwhile i < 4 loop\\n var j: uint8 := 1;\\n while j < 6 loop\\n print_item(i*5 + j);\\n j := j + 1;\\n end loop;\\n print_nl();\\n i := i + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.stdio;\\nimport std.algorithm;\\nimport std.random;\\nimport std.range;\\n\\nint pancake(int n) {\\n int gap = 2, sum = 2, adj = -1;\\n\\t\\n while (sum < n) {\\n adj++;\\n gap = 2 * gap - 1;\\n sum += gap;\\n }\\n\\t\\n return n + adj;\\n}\\n\\nRange pancakeSort(Range)(Range r) {\\n\\tforeach_reverse (immutable i; 2 .. r.length + 1) {\\n\\t\\timmutable maxIndex = i - r[0 .. i].minPos!q{a > b}.length;\\n\\t\\t\\n\\t\\tif (maxIndex + 1 != i) {\\n\\t\\t\\tif (maxIndex != 0) {\\n\\t\\t\\t\\tr[0 .. maxIndex + 1].reverse();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tr[0 .. i].reverse();\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn r;\\n}\\n\\nvoid main() {\\n\\twriteln(\\\"\\\\nThe maximum number of flips to sort a given number of elements is:\\\\n\\\");\\n\\t\\n\\tforeach (i; 1..11)\\n\\t{\\n\\t\\tauto data = iota(1, i+1).array;\\n\\t\\t\\n\\t\\tif (i != 1) {\\n\\t\\t\\t// Protection against the edge case data.lenght == 1 not handled by randomShuffle\\n\\t\\t\\t// where also data is invariant with regard to pancakeSort\\n\\t\\t\\tdo\\n\\t\\t\\t\\tdata.randomShuffle;\\n\\t\\t\\twhile (data.isSorted);\\n\\t\\t}\\n\\t\\t\\n\\t\\tauto sortedData = data.dup;\\n\\t\\tsortedData.pancakeSort;\\n\\t\\t\\n\\t\\twritefln(\\\"pancake(%2d) = %2d e.g %s -> %s\\\", i, pancake(i), data, sortedData);\\n\\t}\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"// Pancake numbers. Nigel Galloway: October 28th., 2020\\nlet pKake z=let n=[for n in 1..z-1->Array.ofList([n.. -1..0]@[n+1..z-1])]\\n let e=let rec fG n g=match g with 0->n |_->fG (n*g) (g-1) in fG 1 z\\n let rec fN i g l=match (Set.count g)-e with 0->(i,List.last l)\\n |_->let l=l|>List.collect(fun g->[for n in n->List.permute(fun g->n.[g]) g])|>Set.ofList\\n fN (i+1) (Set.union g l) (Set.difference l g|>Set.toList)\\n fN 0 (set[[1..z]]) [[1..z]]\\n\\n[1..9]|>List.iter(fun n->let i,g=pKake n in printfn \\\"Maximum number of flips to sort %d elements is %d. e.g %A->%A\\\" n i g [1..n])\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"Dim As Integer num_pancakes = 20\\nDim As Integer i, j, c = 0, n\\n\\nFunction pancake(n As Integer) As Integer\\n Dim As Integer gap = 2, sum = 2, adj = -1\\n While sum < n\\n adj += 1\\n gap = (gap * 2) - 1\\n sum += gap\\n Wend\\n Return n + adj\\nEnd Function\\n\\nFor i = 0 To 3\\n For j = 1 To 5\\n n = (i * 5) + j\\n c += 1\\n Print Using \\\"p(##) = ## \\\"; n; pancake(n);\\n If c Mod 5 = 0 Then Print\\n Next j\\nNext i\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"Public Sub Main()\\n\\n Dim i As Integer, j As Integer, c As Integer = 0, n As Integer\\n\\n For i = 0 To 3\\n For j = 1 To 5\\n n = (i * 5) + j\\n c += 1\\n Print \\\"p(\\\"; Format$(n, \\\"##\\\"); \\\") = \\\"; Format$(pancake(n), \\\"##\\\"); \\\" \\\";\\n If c Mod 5 = 0 Then Print\\n Next\\n Next\\n\\nEnd\\n\\nFunction pancake(n As Integer) As Integer\\n\\n Dim gap As Integer = 2, sum As Integer = 2, adj As Integer = -1\\n\\n While sum < n\\n adj += 1\\n gap = (gap * 2) - 1\\n sum += gap\\n Wend\\n Return n + adj\\n\\nEnd Function\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc pancake(n int) int {\\n gap, sum, adj := 2, 2, -1\\n for sum < n {\\n adj++\\n gap = gap*2 - 1\\n sum += gap\\n }\\n return n + adj\\n}\\n\\nfunc main() {\\n for i := 0; i < 4; i++ {\\n for j := 1; j < 6; j++ {\\n n := i*5 + j\\n fmt.Printf(\\\"p(%2d) = %2d \\\", n, pancake(n))\\n }\\n fmt.Println()\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n \\\"time\\\"\\n)\\n\\ntype assoc map[string]int\\n\\n// Converts a string of the form \\\"[1 2]\\\" into a slice of ints: {1, 2}\\nfunc asSlice(s string) []int {\\n split := strings.Split(s[1:len(s)-1], \\\" \\\")\\n le := len(split)\\n res := make([]int, le)\\n for i := 0; i < le; i++ {\\n res[i], _ = strconv.Atoi(split[i])\\n }\\n return res\\n}\\n\\n// Merges two assocs into one. If the same key is present in both assocs\\n// its value will be the one in the second assoc.\\nfunc merge(m1, m2 assoc) assoc {\\n m3 := make(assoc)\\n for k, v := range m1 {\\n m3[k] = v\\n }\\n for k, v := range m2 {\\n m3[k] = v\\n }\\n return m3\\n}\\n\\n// Finds the maximum value in 'dict' and returns the first key\\n// it finds (iteration order is undefined) with that value.\\nfunc findMax(dict assoc) string {\\n max := -1\\n maxKey := \\\"\\\"\\n for k, v := range dict {\\n if v > max {\\n max = v\\n maxKey = k\\n }\\n }\\n return maxKey\\n}\\n\\n// Creates a new slice of ints by reversing an existing one.\\nfunc reverse(s []int) []int {\\n le := len(s)\\n rev := make([]int, le)\\n for i := 0; i < le; i++ {\\n rev[i] = s[le-1-i]\\n }\\n return rev\\n}\\n\\nfunc pancake(n int) (string, int) {\\n numStacks := 1\\n gs := make([]int, n)\\n for i := 0; i < n; i++ {\\n gs[i] = i + 1\\n }\\n goalStack := fmt.Sprintf(\\\"%v\\\", gs)\\n stacks := assoc{goalStack: 0}\\n newStacks := assoc{goalStack: 0}\\n for i := 1; i <= 1000; i++ {\\n nextStacks := assoc{}\\n for key := range newStacks {\\n arr := asSlice(key)\\n for pos := 2; pos <= n; pos++ {\\n t := append(reverse(arr[0:pos]), arr[pos:len(arr)]...)\\n newStack := fmt.Sprintf(\\\"%v\\\", t)\\n if _, ok := stacks[newStack]; !ok {\\n nextStacks[newStack] = i\\n }\\n }\\n }\\n newStacks = nextStacks\\n stacks = merge(stacks, newStacks)\\n perms := len(stacks)\\n if perms == numStacks {\\n return findMax(stacks), i - 1\\n }\\n numStacks = perms\\n }\\n return \\\"\\\", 0\\n}\\n\\nfunc main() {\\n start := time.Now()\\n fmt.Println(\\\"The maximum number of flips to sort a given number of elements is:\\\")\\n for i := 1; i <= 10; i++ {\\n example, steps := pancake(i)\\n fmt.Printf(\\\"pancake(%2d) = %-2d example: %s\\\\n\\\", i, steps, example)\\n }\\n fmt.Printf(\\\"\\\\nTook %s\\\\n\\\", time.Since(start))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"100 CLS\\n110 FOR I = 0 TO 3\\n120 FOR J = 1 TO 5\\n130 N = (I*5)+J\\n140 C = C+1\\n150 GOSUB 200\\n160 PRINT USING \\\"p(##) = ## \\\";N;PANCAKE\\n170 NEXT J\\n180 NEXT I\\n190 END\\n200 REM pancake(n)\\n210 GAP = 2\\n220 SUM = 2\\n230 ADJ = -1\\n240 IF SUM < N THEN ADJ = ADJ+1 : GAP = (GAP*2)-1 : SUM = SUM+GAP\\n250 IF SUM >= N THEN PANCAKE = N+ADJ : RETURN\\n260 GOTO 240\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"public class Pancake {\\n private static int pancake(int n) {\\n int gap = 2;\\n int sum = 2;\\n int adj = -1;\\n while (sum < n) {\\n adj++;\\n gap = 2 * gap - 1;\\n sum += gap;\\n }\\n return n + adj;\\n }\\n\\n public static void main(String[] args) {\\n for (int i = 0; i < 4; i++) {\\n for (int j = 1; j < 6; j++) {\\n int n = 5 * i + j;\\n System.out.printf(\\\"p(%2d) = %2d \\\", n, pancake(n));\\n }\\n System.out.println();\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"import static java.util.Comparator.comparing;\\nimport static java.util.stream.Collectors.toList;\\n\\nimport java.util.ArrayDeque;\\nimport java.util.ArrayList;\\nimport java.util.Collections;\\nimport java.util.HashMap;\\nimport java.util.List;\\nimport java.util.Map;\\nimport java.util.Queue;\\nimport java.util.stream.IntStream;\\n\\n\\npublic class Pancake {\\n\\n private static List<Integer> flipStack(List<Integer> stack, int spatula) {\\n List<Integer> copy = new ArrayList<>(stack);\\n Collections.reverse(copy.subList(0, spatula));\\n return copy;\\n }\\n\\n private static Map.Entry<List<Integer>, Integer> pancake(int n) {\\n List<Integer> initialStack = IntStream.rangeClosed(1, n).boxed().collect(toList());\\n Map<List<Integer>, Integer> stackFlips = new HashMap<>();\\n stackFlips.put(initialStack, 1);\\n Queue<List<Integer>> queue = new ArrayDeque<>();\\n queue.add(initialStack);\\n while (!queue.isEmpty()) {\\n List<Integer> stack = queue.remove();\\n int flips = stackFlips.get(stack) + 1;\\n for (int i = 2; i <= n; ++i) {\\n List<Integer> flipped = flipStack(stack, i);\\n if (stackFlips.putIfAbsent(flipped, flips) == null) {\\n queue.add(flipped);\\n }\\n }\\n }\\n return stackFlips.entrySet().stream().max(comparing(e -> e.getValue())).get();\\n }\\n\\n public static void main(String[] args) {\\n for (int i = 1; i <= 10; ++i) {\\n Map.Entry<List<Integer>, Integer> result = pancake(i);\\n System.out.printf(\\\"pancake(%s) = %s. Example: %s\\\\n\\\", i, result.getValue(), result.getKey());\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function pancake(len)\\n gap, gapsum, adj = 2, 2, -1\\n while gapsum < len\\n adj += 1\\n gap = gap * 2 - 1\\n gapsum += gap\\n end\\n return len + adj\\nend\\n\\nfor i in 1:25\\n print(\\\"pancake(\\\", lpad(i, 2), \\\") = \\\", rpad(pancake(i), 5))\\n i % 5 == 0 && println()\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function pancake(len)\\n goalstack = collect(1:len)\\n stacks, numstacks = Dict(goalstack => 0), 1\\n newstacks = deepcopy(stacks)\\n for i in 1:1000\\n nextstacks = Dict()\\n for (arr, steps) in newstacks, pos in 2:len\\n newstack = vcat(reverse(arr[1:pos]), arr[pos+1:end])\\n haskey(stacks, newstack) || (nextstacks[newstack] = i)\\n end\\n newstacks = nextstacks\\n stacks = merge(stacks, newstacks)\\n perms = length(stacks)\\n perms == numstacks && return findmax(stacks)\\n numstacks = perms\\n end\\nend\\n\\nfor i in 1:10\\n steps, example = pancake(i)\\n println(\\\"pancake(\\\", lpad(i, 2), \\\") = \\\", rpad(steps, 5), \\\" example: \\\", example)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"fun pancake(n: Int): Int {\\n var gap = 2\\n var sum = 2\\n var adj = -1\\n while (sum < n) {\\n adj++\\n gap = gap * 2 - 1\\n sum += gap\\n }\\n return n + adj\\n}\\n\\nfun main() {\\n (1 .. 20).map {\\\"p(%2d) = %2d\\\".format(it, pancake(it))}\\n val lines = results.chunked(5).map { it.joinToString(\\\" \\\") }\\n lines.forEach { println(it) }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"data class PancakeResult(val example: List<Int>, val depth: Int)\\n\\nfun pancake(n: Int): PancakeResult {\\n fun List<Int>.copyFlip(spatula: Int) = toMutableList().apply { subList(0, spatula).reverse() }\\n val initialStack = List(n) { it + 1 }\\n val stackFlips = mutableMapOf(initialStack to 1)\\n val queue = ArrayDeque(listOf(initialStack))\\n while (queue.isNotEmpty()) {\\n val stack = queue.removeFirst()\\n val flips = stackFlips[stack]!! + 1\\n for (spatula in 2 .. n) {\\n val flipped = stack.copyFlip(spatula)\\n if (stackFlips.putIfAbsent(flipped, flips) == null) {\\n queue.addLast(flipped)\\n }\\n }\\n }\\n return stackFlips.maxByOrNull { it.value }!!.run { PancakeResult(key, value) }\\n}\\n\\nfun main() {\\n for (i in 1 .. 10) {\\n with (pancake(i)) { println(\\\"pancake($i) = $depth. Example: $example\\\") }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \" NORMAL MODE IS INTEGER\\n VECTOR VALUES ROW = $5(2HP[,I2,4H] = ,I2,S2)*$\\n\\n INTERNAL FUNCTION(N)\\n ENTRY TO P.\\n GAP = 2\\n ADJ = -1\\n THROUGH LOOP, FOR SUM=2, GAP, SUM.GE.N\\n ADJ = ADJ + 1\\nLOOP GAP = GAP * 2 - 1\\n FUNCTION RETURN N + ADJ\\n END OF FUNCTION\\n\\n THROUGH OUTP, FOR R=1, 5, R.G.20\\nOUTP PRINT FORMAT ROW, R,P.(R), R+1,P.(R+1), R+2,P.(R+2),\\n 0 R+3,P.(R+3), R+4,P.(R+4), R+5,P.(R+5)\\n\\n END OF PROGRAM\\n\",\n \"language\": \"MAD\"\n },\n {\n \"code\": \"\",\n \"language\": \"MSX-Basic\"\n },\n {\n \"code\": \"import strformat, strutils\\n\\nfunc pancake(n: int): int =\\n var\\n gap, sumGaps = 2\\n pg = 1\\n adj = -1\\n while sumGaps < n:\\n inc adj\\n inc pg, gap\\n swap pg, gap\\n inc sumGaps, gap\\n result = n + adj\\n\\nvar line = \\\"\\\"\\nfor n in 1..20:\\n line.addSep(\\\" \\\")\\n line.add &\\\"p({n:>2}) = {pancake(n):>2}\\\"\\n if n mod 5 == 0: (echo line; line.setLen(0))\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import sequtils, strformat, strutils, tables\\n\\ntype\\n StepTable = TableRef[seq[int], int]\\n Result = tuple[steps: int; example: seq[int]]\\n\\nfunc findMax(t: StepTable): Result =\\n result.steps = -1\\n for example, steps in t.pairs:\\n if steps > result.steps:\\n result = (steps, example)\\n\\nfunc partialReversed(arr: openArray[int]; pos: int): seq[int] =\\n result.setlen(arr.len)\\n for i in 0..<pos:\\n result[i] = arr[pos - 1 - i]\\n for i in pos..arr.high:\\n result[i] = arr[i]\\n\\nfunc pancake(n: int): Result =\\n var goalStack = toSeq(1..n)\\n var stacks, newStacks: StepTable = newTable({goalStack: 0})\\n var numStacks = 1\\n for i in 1..1000:\\n var nextStacks = new(StepTable)\\n for arr, steps in newStacks.pairs:\\n for pos in 2..n:\\n let newStack = partialReversed(arr, pos)\\n if newStack notin stacks:\\n nextStacks[newStack] = i\\n newStacks = nextStacks\\n for key, value in newStacks:\\n stacks[key] = value\\n let perms = stacks.len\\n if perms == numStacks:\\n return stacks.findMax()\\n numStacks = perms\\n\\nfor n in 1..10:\\n let (steps, example) = pancake(n)\\n echo &\\\"p({n:>2}) = {steps:>2} example: \\\", example.join(\\\", \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"/*REXX program calculates/displays 20 pancake numbers (from 1 to 20,inclusive). */\\nol=''\\nDo pcn=1 To 20\\n ol=ol 'p('format(pcn,2)') ='format(pancake(pcn),3)' '\\n If pcn//5=0 Then Do\\n Say strip(ol)\\n ol=''\\n End\\n End\\nExit\\n/*------------------------------------------------------------------------------*/\\npancake: Procedure\\n Parse Arg n /* obtain N */\\n gap= 2 /* initialize the GAP. */\\n sum= 2 /* initialize the SUM. */\\n Do adj=0 While sum <n /* perform while SUM is less than N. */\\n gap= gap*2 - 1 /* calculate the GAP. */\\n sum= sum + gap /* add the GAP to the SUM. */\\n End /*adj*/\\n Return n +adj -1 /* return an adjusted adjustment sum. */\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"/* REXX Driver for pancake.test */\\ndo n=2 To 10\\n Call pancake n\\n End\\nExit\\npancake: Procedure\\n/**********************************************************************\\n* REXX pancake.rex\\n* The task is to determine p(n) for n = 1 to 9,\\n* and for each show an example requiring p(n) flips.\\n* inspired by java and output like Phix\\n* Note: Using q~delete(1) to get the next candidate for flipping\\n* has dramatic performance consequences for large stacks.\\n* Therefore, I leave the queue alone and use a pointer (qp)\\n* 20230604 Walter Pachl\\n**********************************************************************/\\nCall time 'R'\\nparse arg n -- Number of pancakes\\ninit=left('123456789abc',n) -- ordered pancakes\\nCall o 'heureka' n\\nq=.queue~new -- implements the queue\\nqp=1\\nex=0\\nq~append(init)\\nstackFlips.=-1 -- initialize map\\nstackFlips.init=0 -- stackFlips.v: number of flips\\n -- from init to v\\ncnt.=0\\ncnt.1=1\\nmax=0\\nDo while qp<=q~items -- as long we can flip\\n s=q[qp]\\n qp+=1 -- get next element\\n flips=stackFlips.s+1 -- flips for the successors\\n cnt.flips=cnt.flips+1 -- count them\\n If flips>max Then ex=0 -- a new maximum\\n max=max(max,flips)\\n Do i=2 To n -- process n-1 successors\\n t=flip(s,i) -- one of them\\n If stackFlips.t=-1 Then Do -- not set so far\\n stackFlips.t=flips -- flips from init to t\\n q~append(t) -- append it to the queue\\n If ex<3 Then Do -- show the forst 3 examples\\n call o flips t\\n If ex>=0 Then Do -- record the data to be shown\\n example='' -- as an example (see o2)\\n Do While t<>''\\n Parse Var t c +1 t\\n Select\\n When c='a' Then c=10\\n When c='b' Then c=11\\n When c='c' Then c=12\\n Otherwise Nop\\n End\\n example=example||c||','\\n End\\n exf=flips\\n example=strip(example,'T',',')\\n End\\n ex=ex+1\\n End\\n End\\n End\\n End\\nCall o 'max cnt.max:' max cnt.max\\nte=time('E') -- elaüsed time\\nte=strip(format(te,8,1))\\nCall o te 'seconds'\\nCall o ''\\nCall o2 'p('n') = 'exf', example: {'example'} (of' cnt.max', 'te's)'\\nReturn\\n\\nflip: Procedure\\nParse Arg s,k -- cf. flipStack in java\\nReturn substr(s,k,1)reverse(left(s,k-1))||substr(s,k+1)\\n\\no: -- investigation and debug output\\nReturn\\nSay arg(1)\\nReturn lineout('heureka.txt',arg(1))\\n\\no2: -- result to be shown in rosettacode\\nSay arg(1)\\nCall lineout 'heureka.out',arg(1)\\nCall lineout 'heureka.out'\\nReturn\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nsub pancake {\\n my($n) = @_;\\n my ($gap, $sum, $adj) = (2, 2, -1);\\n while ($sum < $n) { $sum += $gap = $gap * 2 - 1 and $adj++ }\\n $n + $adj;\\n}\\n\\nmy $out;\\n$out .= sprintf \\\"p(%2d) = %2d \\\", $_, pancake $_ for 1..20;\\nsay $out =~ s/.{1,55}\\\\K /\\\\n/gr;\\n\\n# Maximum number of flips plus examples using exhaustive search\\nsub pancake2 {\\n my ($n) = @_;\\n my $numStacks = 1;\\n my @goalStack = 1 .. $n;\\n my %newStacks = my %stacks = (join(' ',@goalStack), 0);\\n for my $k (1..1000) {\\n my %nextStacks;\\n for my $pos (2..$n) {\\n for my $key (keys %newStacks) {\\n my @arr = split ' ', $key;\\n my $cakes = join ' ', (reverse @arr[0..$pos-1]), @arr[$pos..$#arr];\\n $nextStacks{$cakes} = $k unless $stacks{$cakes};\\n }\\n }\\n %stacks = (%stacks, (%newStacks = %nextStacks));\\n my $perms = scalar %stacks;\\n my %inverted = reverse %stacks;\\n return $k-1, $inverted{(sort keys %inverted)[-1]} if $perms == $numStacks;\\n $numStacks = $perms;\\n }\\n}\\n\\nsay \\\"\\\\nThe maximum number of flips to sort a given number of elements is:\\\";\\nfor my $n (1..9) {\\n my ($a,$b) = pancake2($n);\\n say \\\"pancake($n) = $a example: $b\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">gap</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sum_gaps</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">adj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">sum_gaps</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">adj</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">gap</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">sum_gaps</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">gap</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">adj</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">)}),</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">,{{</span><span style=\\\"color: #008000;\\\">\\\"p(%2d) = %2d\\\"</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">gap</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sum_gaps</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">adj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">sum_gaps</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">adj</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">gap</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">pg</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #000000;\\\">sum_gaps</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">gap</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">adj</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">t</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">)}),</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">,{{</span><span style=\\\"color: #008000;\\\">\\\"p(%2d) = %2d\\\"</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">visitor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*unused*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- for pos=0 to length(stack)-2 do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">newstack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">reverse</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">])&</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- sequence newstack = stack[1..pos]&reverse(stack[pos+1..$])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">getd_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">newstack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])=</span><span style=\\\"color: #004600;\\\">NULL</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">newstack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[$])</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (next round)</span>\\n <span style=\\\"color: #7060A8;\\\">setd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">newstack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (the master)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">goalstack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">stacks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">goalstack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}})}</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">stacks</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">new_dict</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- add any flips of stacks[$-1]\\n -- not already in stacks[1]\\n -- to stacks[$]</span>\\n <span style=\\\"color: #7060A8;\\\">traverse_dict</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">visitor</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">dict_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[$])=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">eg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">getd_partial_key</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sz</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">dict_size</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">[$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #7060A8;\\\">papply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">destroy_dict</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stacks</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">eg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sz</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">8</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (for <2s)</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">eg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sz</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pancake</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"p(%d) = %d, example: %v (of %,d, %s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">eg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sz</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">elapsed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"Procedure pancake(n)\\n gap.i = 2\\n sum.i = 2\\n adj.i = -1\\n While sum < n\\n adj + 1\\n gap = (gap * 2) - 1\\n sum + gap\\n Wend\\n ProcedureReturn n + adj\\nEndProcedure\\n\\nOpenConsole()\\nDefine.i i, j, c, n\\n\\nFor i = 0 To 3\\n For j = 1 To 5\\n n = (i * 5) + j\\n c + 1\\n Print(\\\"p(\\\" + RSet(Str(n),2) + \\\") = \\\" + RSet(Str(pancake(n)),2) + \\\" \\\")\\n If Mod(c, 5 )= 0: PrintN(\\\"\\\"): EndIf\\n Next j\\nNext i\\n\\nInput()\\nCloseConsole()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"\\\"\\\"\\\"Pancake numbers. Requires Python>=3.7.\\\"\\\"\\\"\\nimport time\\n\\nfrom collections import deque\\nfrom operator import itemgetter\\nfrom typing import Tuple\\n\\nPancakes = Tuple[int, ...]\\n\\n\\ndef flip(pancakes: Pancakes, position: int) -> Pancakes:\\n \\\"\\\"\\\"Flip the stack of pancakes at the given position.\\\"\\\"\\\"\\n return tuple([*reversed(pancakes[:position]), *pancakes[position:]])\\n\\n\\ndef pancake(n: int) -> Tuple[Pancakes, int]:\\n \\\"\\\"\\\"Return the nth pancake number.\\\"\\\"\\\"\\n init_stack = tuple(range(1, n + 1))\\n stack_flips = {init_stack: 0}\\n queue = deque([init_stack])\\n\\n while queue:\\n stack = queue.popleft()\\n flips = stack_flips[stack] + 1\\n\\n for i in range(2, n + 1):\\n flipped = flip(stack, i)\\n if flipped not in stack_flips:\\n stack_flips[flipped] = flips\\n queue.append(flipped)\\n\\n return max(stack_flips.items(), key=itemgetter(1))\\n\\n\\nif __name__ == \\\"__main__\\\":\\n start = time.time()\\n\\n for n in range(1, 10):\\n pancakes, p = pancake(n)\\n print(f\\\"pancake({n}) = {p:>2}. Example: {list(pancakes)}\\\")\\n\\n print(f\\\"\\\\nTook {time.time() - start:.3} seconds.\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DECLARE FUNCTION pancake! (n)\\n\\nFOR i = 0 TO 3\\n FOR j = 1 TO 5\\n n = (i * 5) + j\\n c = c + 1\\n PRINT USING \\\"p(##) = ## \\\"; n; pancake(n);\\n IF c MOD 5 = 0 THEN PRINT\\n NEXT j\\nNEXT i\\n\\nFUNCTION pancake (n)\\n gap = 2\\n sum = 2\\n adj = -1\\n WHILE sum < n\\n adj = adj + 1\\n gap = (gap * 2) - 1\\n sum = sum + gap\\n WEND\\n pancake = n + adj\\nEND FUNCTION\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \"# 20201110 Raku programming solution\\n\\nsub pancake(\\\\n) {\\n my ($gap,$sum,$adj) = 2, 2, -1;\\n while ($sum < n) { $sum += $gap = $gap * 2 - 1 and $adj++ }\\n return n + $adj;\\n}\\n\\nfor (1..20).rotor(5) { say [~] @_».&{ sprintf \\\"p(%2d) = %2d \\\",$_,pancake $_ } }\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub pancake(\\\\n) {\\n my @goalStack = (my \\\\numStacks = $ = 1)..n ;\\n my %newStacks = my %stacks = @goalStack.Str, 0 ;\\n for 1..1000 -> \\\\k {\\n my %nextStacks = ();\\n for %newStacks.keys».split(' ') X 2..n -> (@arr, \\\\pos) {\\n given flat @arr[0..^pos].reverse, @arr[pos..*-1] {\\n %nextStacks{$_.Str} = k unless %stacks{$_.Str}:exists\\n }\\n }\\n %stacks ,= (%newStacks = %nextStacks);\\n my $perms = %stacks.elems;\\n my %inverted = %stacks.antipairs; # this causes loss on examples\\n my \\\\max_key = %inverted.keys.max; # but not critical for our purpose\\n $perms == numStacks ?? return %inverted{max_key}, k-1 !! numStacks=$perms\\n }\\n return '', 0\\n}\\n\\nsay \\\"The maximum number of flips to sort a given number of elements is:\\\";\\nfor 1..9 -> $j { given pancake($j) { say \\\"pancake($j) = $_[1] example: $_[0]\\\" }}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program calculates/displays 20 pancake numbers (from 1 to 20,inclusive). */\\n/* Gerard Schildberger's code reformatted and refurbished */\\npad=copies(' ',10) /*indentation. */\\nSay pad center('pancakes',10 ) center('pancake flips',15) /*show the hdr.*/\\nSay pad center('' ,10,\\\"-\\\") center('',15,\\\"-\\\") /* \\\" \\\" sep.*/\\nDo pcn=1 To 20\\n Say pad center(pcn,10) center(pancake(pcn),15) /*index,flips. */\\n End\\nExit /*stick a fork in it, we're all done. */\\n/*------------------------------------------------------------------------------*/\\npancake: Procedure\\n Parse Arg n /* obtain N */\\n gap= 2 /* initialize the GAP. */\\n sum= 2 /* initialize the SUM. */\\n Do adj=0 While sum <n /* perform while SUM is less than N. */\\n gap= gap*2 - 1 /* calculate the GAP. */\\n sum= sum + gap /* add the GAP to the SUM. */\\n End /*adj*/\\n Return n +adj -1 /* return an adjusted adjustment sum. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/* REXX Driver for pancake.test */\\ndo n=2 To 10\\n Call pancake n\\n End\\npancake: Procedure\\n/**********************************************************************\\n* REXX pancake.rex\\n* The task is to determine p(n) for n = 1 to 9,\\n* and for each show an example requiring p(n) flips.\\n* inspired by java and output like Phix\\n* 20230531 Walter Pachl\\n**********************************************************************/\\nCall time 'R'\\nparse arg n -- Number of pancakes\\ninit=left('123456789abc',n) -- ordered pancakes\\nCall o 'heureka' n\\nq.=0 -- implements the queue\\nqp=1\\nex=0\\ncall qadd init\\nstackFlips.=-1 -- initialize map\\nstackFlips.init=0 -- stackFlips.v: number of flips\\n -- from init to v\\ncnt.=0\\ncnt.1=1\\nmax=0\\nDo while qp<=q.0 -- as long we can flip\\n s=qget() -- get head of queue\\n flips=stackFlips.s+1 -- flips for the successors\\n cnt.flips=cnt.flips+1 -- count them\\n If flips>max Then ex=0 -- a new maximum\\n max=max(max,flips)\\n Do i=2 To n -- process n-1 successors\\n t=flip(s,i) -- one of them\\n If stackFlips.t=-1 Then Do -- not set so far\\n stackFlips.t=flips -- flips from init to t\\n Call qadd t -- append it to the queue\\n If ex<3 Then Do -- show the first 3 examples\\n call o flips t\\n If ex>=0 Then Do -- record the data to be shown\\n example='' -- as an example (see o2)\\n Do While t<>''\\n Parse Var t c +1 t\\n Select\\n When c='a' Then c=10\\n When c='b' Then c=11\\n When c='c' Then c=12\\n Otherwise Nop\\n End\\n example=example||c||','\\n End\\n exf=flips\\n example=strip(example,'T',',')\\n End\\n ex=ex+1\\n End\\n End\\n End\\n End\\nCall o 'max cnt.max:' max cnt.max\\nte=time('E') -- elapsed time\\nte=strip(format(te,8,1))\\nCall o te 'seconds'\\nCall o ''\\nCall o2 'p('n') = 'exf', example: {'example'} (of' cnt.max', 'te's)'\\nReturn\\n\\nflip: Procedure\\nParse Arg s,k -- cf. flipStack in java\\nReturn substr(s,k,1)reverse(left(s,k-1))||substr(s,k+1)\\n\\nqadd: -- add an element to the queue\\nParse Arg e\\nz=q.0+1\\nq.z=e\\nq.0=z\\nReturn\\n\\nqget: -- get top element from the queue\\ne=q.qp -- and remove it from the queue\\nqp=qp+1\\nReturn e\\n\\no: -- investigation and debug output\\nReturn\\nSay arg(1)\\nReturn lineout('heureka.txt',arg(1))\\n\\no2: -- result to be shown in rosettacode\\nSay arg(1)\\nCall lineout 'heureka.out',arg(1)\\nCall lineout 'heureka.out'\\nReturn\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"for n = 1 to 9\\n see \\\"p(\\\" + n + \\\") = \\\" + pancake(n) + nl\\nnext\\nreturn 0\\n\\nfunc pancake(n)\\n gap = 2\\n sum = 2\\n adj = -1;\\n while (sum < n)\\n adj = adj + 1\\n gap = gap * 2 - 1\\n sum = sum + gap\\n end\\n return n + adj\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def pancake(n)\\n gap = 2\\n sum = 2\\n adj = -1\\n while sum < n\\n adj = adj + 1\\n gap = gap * 2 - 1\\n sum = sum + gap\\n end\\n return n + adj\\nend\\n\\nfor i in 0 .. 3\\n for j in 1 .. 5\\n n = i * 5 + j\\n print \\\"p(%2d) = %2d \\\" % [n, pancake(n)]\\n end\\n print \\\"\\\\n\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"fn pancake(n: i32) -> i32 {\\n let mut gap = 2;\\n let mut sum = 2;\\n let mut adj = -1;\\n\\n while sum < n {\\n adj += 1;\\n gap = gap * 2 - 1;\\n sum += gap;\\n }\\n\\n n + adj\\n}\\n\\nfn main() {\\n for i in 0..4 {\\n for j in 1..6 {\\n let n = i * 5 + j;\\n print!(\\\"p({:2}) = {:2} \\\", n, pancake(n));\\n }\\n println!();\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object Pancake {\\n def pancake(n: Int): Int = {\\n var gap = 2\\n var sum = 2\\n var adj = -1\\n\\n while (sum < n) {\\n adj += 1\\n gap = 2 * gap - 1\\n sum += gap\\n }\\n\\n n + adj\\n }\\n\\n def main(args: Array[String]): Unit = {\\n for (i <- 0 until 4) {\\n for (j <- 1 until 6) {\\n val n = 5 * i + j\\n print(f\\\"p($n%2d) = ${pancake(n)}%2d \\\")\\n }\\n println()\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"FUNCTION pancake(n)\\n LET gap = 2\\n LET sum = 2\\n LET adj = -1\\n DO while sum < n\\n LET adj = adj+1\\n LET gap = (gap*2)-1\\n LET sum = sum+gap\\n LOOP\\n LET pancake = n+adj\\nEND FUNCTION\\n\\nFOR i = 0 to 3\\n FOR j = 1 to 5\\n LET n = (i*5)+j\\n LET c = c+1\\n PRINT using \\\"p(##) = ## \\\": n, pancake(n);\\n IF remainder(round(c),5) = 0 then PRINT\\n NEXT j\\nNEXT i\\nEND\\n\",\n \"language\": \"True-BASIC\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar pancake = Fn.new { |n|\\n var gap = 2\\n var sum = 2\\n var adj = -1\\n while (sum < n) {\\n adj = adj + 1\\n gap = gap*2 - 1\\n sum = sum + gap\\n }\\n return n + adj\\n}\\n\\nfor (i in 0..3) {\\n for (j in 1..5) {\\n var n = i*5 + j\\n Fmt.write(\\\"p($2d) = $2d \\\", n, pancake.call(n))\\n }\\n System.print()\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\n// Converts a string of the form \\\"[1, 2]\\\" into a list: [1, 2]\\nvar asList = Fn.new { |s|\\n var split = s[1..-2].split(\\\", \\\")\\n return split.map { |n| Num.fromString(n) }.toList\\n}\\n\\n// Merges two maps into one. If the same key is present in both maps\\n// its value will be the one in the second map.\\nvar mergeMaps = Fn.new { |m1, m2|\\n var m3 = {}\\n for (key in m1.keys) m3[key] = m1[key]\\n for (key in m2.keys) m3[key] = m2[key]\\n return m3\\n}\\n\\n// Finds the maximum value in 'dict' and returns the first key\\n// it finds (iteration order is undefined) with that value.\\nvar findMax = Fn.new { |dict|\\n var max = -1\\n var maxKey = null\\n for (me in dict) {\\n if (me.value > max) {\\n max = me.value\\n maxKey = me.key\\n }\\n }\\n return maxKey\\n}\\n\\nvar pancake = Fn.new { |len|\\n var numStacks = 1\\n var goalStack = (1..len).toList.toString\\n var stacks = {goalStack: 0}\\n var newStacks = {goalStack: 0}\\n for (i in 1..1000) {\\n var nextStacks = {}\\n for (key in newStacks.keys) {\\n var arr = asList.call(key)\\n var pos = 2\\n while (pos <= len) {\\n var newStack = (arr[pos-1..0] + arr[pos..-1]).toString\\n if (!stacks.containsKey(newStack)) nextStacks[newStack] = i\\n pos = pos + 1\\n }\\n }\\n newStacks = nextStacks\\n stacks = mergeMaps.call(stacks, newStacks)\\n var perms = stacks.count\\n if (perms == numStacks) return [findMax.call(stacks), i - 1]\\n numStacks = perms\\n }\\n}\\n\\nvar start = System.clock\\nSystem.print(\\\"The maximum number of flips to sort a given number of elements is:\\\")\\nfor (i in 1..9) {\\n var res = pancake.call(i)\\n var example = res[0]\\n var steps = res[1]\\n Fmt.print(\\\"pancake($d) = $-2d example: $n\\\", i, steps, example)\\n}\\nSystem.print(\\\"\\\\nTook %(System.clock - start) seconds.\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"for i = 0 to 3\\n for j = 1 to 5\\n n = (i * 5) + j\\n c = c + 1\\n print \\\"p(\\\", n using \\\"##\\\", \\\") = \\\";\\n\\t\\tprint pancake(n) using \\\"##\\\", \\\" \\\";\\n if mod(c, 5) = 0 print\\n next j\\nnext i\\nend\\n\\nsub pancake(n)\\n gap = 2\\n sum = 2\\n adj = -1\\n while sum < n\\n adj = adj + 1\\n gap = (gap * 2) - 1\\n sum = sum + gap\\n wend\\n return n + adj\\nend sub\\n\",\n \"language\": \"Yabasic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pancake-numbers"}}},{"rowIdx":1479,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/Pangram_checker\n","language":"00-META"},{"code":"A pangram is a sentence that contains all the letters of the English alphabet at least once.\n\nFor example: ''The quick brown fox jumps over the lazy dog''.\n\n\n;Task:\nWrite a function or method to check a sentence to see if it is a [[wp:Pangram|pangram]] (or not) and show its use.\n\n\n;Related tasks:\n:* [https://rosettacode.org/wiki/Determine_if_a_string_has_all_the_same_characters determine if a string has all the same characters]\n:* [https://rosettacode.org/wiki/Determine_if_a_string_has_all_unique_characters determine if a string has all unique characters]\n<br><br>\n\n","language":"00-TASK"},{"code":"F is_pangram(sentence)\n R Set(sentence.lowercase().filter(ch -> ch C ‘a’..‘z’)).len == 26\n\nL(sentence) [‘The quick brown fox jumps over the lazy dog.’,\n ‘The quick brown fox jumped over the lazy dog.’]\n print(‘'#.' is #.a pangram’.format(sentence, ‘not ’ * !is_pangram(sentence)))\n","language":"11l"},{"code":"* Pangram RC 11/08/2015\nPANGRAM CSECT\n USING PANGRAM,R12\n LR R12,R15\nBEGIN LA R9,SENTENCE\n LA R6,4\nLOOPI LA R10,ALPHABET loop on sentences\n LA R7,26\nLOOPJ LA R5,0 loop on letters\n LR R11,R9\n LA R8,60\nLOOPK MVC BUFFER+1(1),0(R10) loop in sentence\n CLC 0(1,R10),0(R11) if alphabet[j=sentence[i]\n BNE NEXTK\n LA R5,1 found\nNEXTK LA R11,1(R11) next character\n BCT R8,LOOPK\n LTR R5,R5 if found\n BNZ NEXTJ\n MVI BUFFER,C'?' not found\n B PRINT\nNEXTJ LA R10,1(R10) next letter\n BCT R7,LOOPJ\n MVC BUFFER(2),=CL2'OK'\nPRINT MVC BUFFER+3(60),0(R9)\n XPRNT BUFFER,80\nNEXTI LA R9,60(R9) next sentence\n BCT R6,LOOPI\nRETURN XR R15,R15\n BR R14\nALPHABET DC CL26'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nSENTENCE DC CL60'THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.'\n DC CL60'THE FIVE BOXING WIZARDS DUMP QUICKLY.'\n DC CL60'HEAVY BOXES PERFORM WALTZES AND JIGS.'\n DC CL60'PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS.'\nBUFFER DC CL80' '\n YREGS\n END PANGRAM\n","language":"360-Assembly"},{"code":"(defun contains-each (needles haystack)\n (if (endp needles)\n t\n (and (member (first needles) haystack)\n (contains-each (rest needles) haystack))))\n\n(defun pangramp (str)\n (contains-each (coerce \"abcdefghijklmnopqrstuvwxyz\" 'list)\n (coerce (string-downcase str) 'list)))\n","language":"ACL2"},{"code":"INCLUDE \"D2:CHARTEST.ACT\" ;from the Action! Tool Kit\n\nDEFINE CHAR_COUNT=\"26\"\n\nBYTE FUNC IsPangram(CHAR ARRAY t)\n BYTE ARRAY tab(CHAR_COUNT)\n BYTE i,c\n\n FOR i=0 TO CHAR_COUNT-1\n DO tab(i)=0 OD\n\n FOR i=1 TO t(0)\n DO\n c=ToLower(t(i))\n IF c>='a AND c<='z THEN\n tab(c-'a)=1\n FI\n OD\n\n FOR i=0 TO CHAR_COUNT-1\n DO\n IF tab(i)=0 THEN\n RETURN (0)\n FI\n OD\nRETURN (1)\n\nPROC Test(CHAR ARRAY t)\n BYTE res\n\n res=IsPangram(t)\n PrintF(\"\"\"%S\"\" is \",t)\n IF res=0 THEN\n Print(\"not \")\n FI\n PrintE(\"a pangram.\")\n PutE()\nRETURN\n\nPROC Main()\n Put(125) PutE() ;clear screen\n Test(\"The quick brown fox jumps over the lazy dog.\")\n Test(\"QwErTyUiOpAsDfGhJkLzXcVbNm\")\n Test(\"Not a pangram\")\n Test(\"\")\nRETURN\n","language":"Action-"},{"code":"function pangram(k:string):Boolean {\n var lowerK:String = k.toLowerCase();\n var has:Object = {}\n\n for (var i:Number=0; i<=k.length-1; i++) {\n has[lowerK.charAt(i)] = true;\n }\n\n var result:Boolean = true;\n\n for (var ch:String='a'; ch <= 'z'; ch=String.fromCharCode(ch.charCodeAt(0)+1)) {\n result = result && has[ch]\n }\n\n return result || false;\n}\n","language":"ActionScript"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Strings.Maps; use Ada.Strings.Maps;\nwith Ada.Characters.Handling; use Ada.Characters.Handling;\nprocedure pangram is\n\n function ispangram(txt: String) return Boolean is\n (Is_Subset(To_Set(Span => ('a','z')), To_Set(To_Lower(txt))));\n\nbegin\n put_line(Boolean'Image(ispangram(\"This is a test\")));\n put_line(Boolean'Image(ispangram(\"The quick brown fox jumps over the lazy dog\")));\n put_line(Boolean'Image(ispangram(\"NOPQRSTUVWXYZ abcdefghijklm\")));\n put_line(Boolean'Image(ispangram(\"abcdefghijklopqrstuvwxyz\"))); --Missing m, n\nend pangram;\n","language":"Ada"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\nwith Ada.Characters.Handling; use Ada.Characters.Handling;\nprocedure pangram is\n\n function ispangram(txt : in String) return Boolean is\n (for all Letter in Character range 'a'..'z' =>\n (for some Char of txt => To_Lower(Char) = Letter));\n\nbegin\n put_line(Boolean'Image(ispangram(\"This is a test\")));\n put_line(Boolean'Image(ispangram(\"The quick brown fox jumps over the lazy dog\")));\n put_line(Boolean'Image(ispangram(\"NOPQRSTUVWXYZ abcdefghijklm\")));\n put_line(Boolean'Image(ispangram(\"abcdefghijklopqrstuvwxyz\"))); --Missing m, n\nend pangram;\n","language":"Ada"},{"code":"# init pangram: #\nINT la = ABS \"a\", lz = ABS \"z\";\nINT ua = ABS \"A\", uz = ABS \"Z\";\nIF lz-la+1 > bits width THEN\n put(stand error, \"Exception: insufficient bits in word for task\");\n stop\nFI;\n\nPROC is a pangram = (STRING test)BOOL: (\n BITS a2z := BIN(ABS(2r1 SHL (lz-la))-1); # assume: ASCII & Binary #\n FOR i TO UPB test WHILE\n INT c = ABS test[i];\n IF la <= c AND c <= lz THEN\n a2z := a2z AND NOT(2r1 SHL (c-la))\n ELIF ua <= c AND c <= uz THEN\n a2z := a2z AND NOT(2r1 SHL (c-ua))\n FI;\n# WHILE # a2z /= 2r0 DO\n SKIP\n OD;\n a2z = 2r0\n);\n\nmain:(\n []STRING test list = (\n \"Big fjiords vex quick waltz nymph\",\n \"The quick brown fox jumps over a lazy dog\",\n \"A quick brown fox jumps over a lazy dog\"\n );\n FOR key TO UPB test list DO\n STRING test = test list[key];\n IF is a pangram(test) THEN\n print((\"\"\"\",test,\"\"\" is a pangram!\", new line))\n FI\n OD\n)\n","language":"ALGOL-68"},{"code":" a←'abcdefghijklmnopqrstuvwxyz' ⍝ or ⎕ucs 96 + ⍳26 in GNU/Dyalog\n A←'ABCDEFGHIJKLMNOPQRSTUVWXYZ' ⍝ or ⎕ucs 64 + ⍳26, or just ⎕a in Dyalog\n\n Pangram ← {∧/ ∨⌿ 2 26⍴(a,A) ∊ ⍵}\n Pangram 'This should fail'\n0\n Pangram 'The quick brown fox jumps over the lazy dog'\n1\n","language":"APL"},{"code":"use framework \"Foundation\" -- ( for case conversion function )\n\n--------------------- PANGRAM CHECKER --------------------\n\n-- isPangram :: String -> Bool\non isPangram(s)\n script charUnUsed\n property lowerCaseString : my toLower(s)\n on |λ|(c)\n lowerCaseString does not contain c\n end |λ|\n end script\n\n 0 = length of filter(charUnUsed, ¬\n \"abcdefghijklmnopqrstuvwxyz\")\nend isPangram\n\n\n--------------------------- TEST -------------------------\non run\n map(isPangram, {¬\n \"is this a pangram\", ¬\n \"The quick brown fox jumps over the lazy dog\"})\n\n --> {false, true}\nend run\n\n\n-------------------- GENERIC FUNCTIONS -------------------\n\n-- filter :: (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 |λ|(v, i, xs) then set end of lst to v\n end repeat\n return lst\n end tell\nend filter\n\n\n-- map :: (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 |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- Lift 2nd class handler function into\n-- 1st class script wrapper\n-- mReturn :: Handler -> Script\non mReturn(f)\n if class of f is script then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n-- toLower :: String -> String\non toLower(str)\n set ca to current application\n ((ca's NSString's stringWithString:(str))'s ¬\n lowercaseStringWithLocale:(ca's NSLocale's currentLocale())) as text\nend toLower\n","language":"AppleScript"},{"code":"{false, true}\n","language":"AppleScript"},{"code":"on isPangram(txt)\n set alphabet to \"abcedfghijklmnopqrstuvwxyz\"\n ignoring case -- The default, but ensure it here.\n repeat with letter in alphabet\n if (txt does not contain letter) then return false\n end repeat\n end ignoring\n\n return true\nend isPangram\n\nlocal result1, result2\nset result1 to isPangram(\"The Quick Brown Fox Jumps Over The Lazy Dog\")\nset result2 to isPangram(\"This is not a pangram\")\nreturn {result1, result2}\n","language":"AppleScript"},{"code":"{true, false}\n","language":"AppleScript"},{"code":" 100 P$ = \"11111111111111111111111111\"\n 110 FOR Q = 1 TO 3\n 120 READ S$\n 130 GOSUB 200\"IS PANGRAM?\n 140 PRINT MID$ (\"NO YES \",P * 4 + 1,4)S$\n 150 NEXT Q\n 160 END\n 170 DATA\"THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.\"\n 180 DATA\"THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.\"\n 190 DATA\"THE FIVE BOXING WIZARDS JUMP QUICKLY.\"\n 200 P = 0:L = LEN (S$): IF NOT L THEN RETURN\n 210 F$ = \"00000000000000000000000000\"\n 220 FOR I = 1 TO L\n 230 C = ASC ( MID$ (S$,I,1)):C = C - 32 * (C > 95): IF C > 64 AND C < 91 THEN J = C - 64:F$ = MID$ (F$,1,J - 1) + \"1\" + MID$ (F$,J + 1):P = F$ = P$: IF P THEN RETURN\n 240 NEXT I\n 250 RETURN\n","language":"Applesoft-BASIC"},{"code":"chars: map 97..122 => [to :string to :char &]\npangram?: function [sentence][\n every? chars 'ch ->\n in? ch sentence\n]\n\nprint pangram? \"this is a sentence\"\nprint pangram? \"The quick brown fox jumps over the lazy dog.\"\n","language":"Arturo"},{"code":"(* ****** ****** *)\n//\n#include\n\"share/atspre_staload.hats\"\n#include\n\"share/HATS/atspre_staload_libats_ML.hats\"\n//\n(* ****** ****** *)\n//\nfun\nletter_check\n(\ncs: string, c0: char\n) : bool = cs.exists()(lam(c) => c0 = c)\n//\n(* ****** ****** *)\n\nfun\nPangram_check\n (text: string): bool = let\n//\nval\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\nval\n((*void*)) = assertloc(length(alphabet) = 26)\n//\nin\n alphabet.forall()(lam(c) => letter_check(text, c) || letter_check(text, toupper(c)))\nend // end of [Pangram_check]\n\n(* ****** ****** *)\n\nimplement\nmain0 () =\n{\n//\nval\ntext0 = \"The quick brown fox jumps over the lazy dog.\"\n//\nval-true = Pangram_check(text0)\nval-false = Pangram_check(\"This is not a pangram sentence.\")\n//\n} (* end of [main0] *)\n\n(* ****** ****** *)\n","language":"ATS"},{"code":"fn is_pangram{n:nat}(s: string(n)): bool = loop(s, i2sz(0)) where {\n val letters: arrayref(bool, 26) = arrayref_make_elt<bool>(i2sz(26), false)\n fn check(): bool = loop(0) where {\n fun loop{i:int | i >= 0 && i <= 26}(i: int(i)) =\n if i < 26 then\n if letters[i] then loop(i+1) else\n false\n else true\n }\n fun add{c:int}(c: char(c)): void =\n if (c >= 'A') * (c <= 'Z') then letters[char2int1(c) - char2int1('A')] := true else\n if (c >= 'a') * (c <= 'z') then letters[char2int1(c) - char2int1('a')] := true\n fun loop{i:nat | i <= n}.<n-i>.(s: string(n), i: size_t(i)): bool =\n if string_is_atend(s, i) then check() else\n begin\n add(s[i]);\n loop(s, succ(i))\n end\n}\n","language":"ATS"},{"code":"Gui, -MinimizeBox\nGui, Add, Edit, w300 r5 vText\nGui, Add, Button, x105 w100 Default, Check Pangram\nGui, Show,, Pangram Checker\nReturn\n\nGuiClose:\n ExitApp\nReturn\n\nButtonCheckPangram:\n Gui, Submit, NoHide\n Loop, 26\n If Not InStr(Text, Char := Chr(64 + A_Index)) {\n MsgBox,, Pangram, Character %Char% is missing!\n Return\n }\n MsgBox,, Pangram, OK`, this is a Pangram!\nReturn\n","language":"AutoHotkey"},{"code":"Pangram(\"The quick brown fox jumps over the lazy dog\")\nFunc Pangram($s_String)\nFor $i = 1 To 26\n\tIF Not StringInStr($s_String, Chr(64 + $i)) Then\n\t\tReturn MsgBox(0,\"No Pangram\", \"Character \" & Chr(64 + $i) &\" is missing\")\n\tEndIf\nNext\nReturn MsgBox(0,\"Pangram\", \"Sentence is a Pangram\")\nEndFunc\n","language":"AutoIt"},{"code":"#!/usr/bin/awk -f\nBEGIN {\n allChars=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n print isPangram(\"The quick brown fox jumps over the lazy dog.\");\n print isPangram(\"The quick brown fo.\");\n}\n\nfunction isPangram(string) {\n delete X;\n for (k=1; k<length(string); k++) {\n X[toupper(substr(string,k,1))]++; # histogram\n }\n for (k=1; k<=length(allChars); k++) {\n if (!X[substr(allChars,k,1)]) return 0;\n }\n return 1;\n}\n","language":"AWK"},{"code":"# usage: awk -f pangram.awk -v p=\"The five boxing wizards dump quickly.\" input.txt\n#\n# Pangram-checker, using associative arrays and split\nBEGIN {\n alfa=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"; ac=split(alfa,A,\"\")\n print \"# Checking for all\",ac,\"chars in '\" alfa \"' :\"\n\n print testPangram(\"The quick brown fox jumps over the lazy dog.\");\n print testPangram(p);\n}\n\n{ print testPangram($0) }\n\nfunction testPangram(str, c,i,S,H,hit,miss) {\n print str \t\t\t\t\t\t##\n split( toupper(str), S, \"\")\n for (c in S) {\n H[ S[c] ]++\n #print c, S[c], H[ S[c] ]\t\t\t\t##\n }\n for (i=1; i<=ac; i++) {\n c = A[i]\n #printf(\"%2d %c : %4d\\n\", i, c, H[c] ) \t\t##\n if (H[c]) { hit=hit c } else { miss=miss c }\n }\n print \"# hit:\",hit, \"# miss:\",miss, \".\"\t\t##\n if (miss) return 0\n return 1\n}\n","language":"AWK"},{"code":"DEF FN Pangram(x) = IIF(AMOUNT(UNIQ$(EXPLODE$(EXTRACT$(LCASE$(x), \"[^[:alpha:]]\", TRUE), 1))) = 26, TRUE, FALSE)\n\nPRINT Pangram(\"The quick brown fox jumps over the lazy dog.\")\nPRINT Pangram(\"Jackdaws love my big sphinx of quartz.\")\nPRINT Pangram(\"My dog has fleas.\")\nPRINT Pangram(\"What's a jackdaw?\")\nPRINT Pangram(\"The five boxing wizards jump quickly\")\n","language":"BaCon"},{"code":"function isPangram$(texto$)\n longitud = Length(texto$)\n if longitud < 26 then return \"is not a pangram\"\n t$ = lower(texto$)\n print \"'\"; texto$; \"' \";\n for i = 97 to 122\n if instr(t$, chr(i)) = 0 then return \"is not a pangram\"\n next i\n return \"is a pangram\"\nend function\n\nprint isPangram$(\"The quick brown fox jumps over the lazy dog.\") # --> true\nprint isPangram$(\"The quick brown fox jumped over the lazy dog.\") # --> false\nprint isPangram$(\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\") # --> true\n","language":"BASIC256"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\n\t%===The Main Thing===%\ncall :pangram \"The quick brown fox jumps over the lazy dog.\"\ncall :pangram \"The quick brown fox jumped over the lazy dog.\"\necho.\npause\nexit /b 0\n\n\t%===The Function===%\n:pangram\nset letters=abcdefgihjklmnopqrstuvwxyz\nset cnt=0\nset inp=%~1\nset str=!inp: =!\n\n:loop\nset chr=!str:~%cnt%,1!\nif \"!letters!\"==\"\" (\n\techo %1 is a pangram^^!\n\tgoto :EOF\n)\nif \"!chr!\"==\"\" (\n\techo %1 is not a pangram.\n\tgoto :EOF\n)\nset letters=!letters:%chr%=!\nset /a cnt+=1\ngoto loop\n","language":"Batch-File"},{"code":" FOR test% = 1 TO 2\n READ test$\n PRINT \"\"\"\" test$ \"\"\" \" ;\n IF FNpangram(test$) THEN\n PRINT \"is a pangram\"\n ELSE\n PRINT \"is not a pangram\"\n ENDIF\n NEXT test%\n END\n\n DATA \"The quick brown fox jumped over the lazy dog\"\n DATA \"The five boxing wizards jump quickly\"\n\n DEF FNpangram(A$)\n LOCAL C%\n A$ = FNlower(A$)\n FOR C% = ASC(\"a\") TO ASC(\"z\")\n IF INSTR(A$, CHR$(C%)) = 0 THEN = FALSE\n NEXT\n = TRUE\n\n DEF FNlower(A$)\n LOCAL A%, C%\n FOR A% = 1 TO LEN(A$)\n C% = ASCMID$(A$,A%)\n IF C% >= 65 IF C% <= 90 MID$(A$,A%,1) = CHR$(C%+32)\n NEXT\n = A$\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\n// Test if s is a pangram. The ASCII character set is assumed.\nlet pangram(s) = valof\n$( let letters = vec 25\n for i=0 to 25 do letters!i := false\n for i=1 to s%0 do\n $( let c = (s%i | 32) - 'a'\n if c >= 0 & c < 26 then\n letters!c := true\n $)\n for i=0 to 25 unless letters!i resultis false\n resultis true\n$)\n\n// Display s and whether or not it is a pangram.\nlet check(s) be\n$( writes(s)\n writes(\" -> \")\n test pangram(s)\n then writes(\"yes*N\")\n else writes(\"no*N\")\n$)\n\nlet start() be\n$( check(\"The quick brown fox jumps over the lazy dog.\")\n check(\"The five boxing wizards dump quickly.\")\n$)\n","language":"BCPL"},{"code":">~>:65*`!#v_:\"`\"`48*v>g+04p1\\4p\n^#*`\\*93\\`0<::-\"@\"-*<^40!%2g4:_\n\"pangram.\"<v*84<_v#-\":\"g40\\\" a\"\n>>:#,_55+,@>\"ton\">48*>\"si tahT\"\n","language":"Befunge"},{"code":"(isPangram=\n k\n. low$!arg:?arg\n & a:?k\n & whl\n ' ( @(!arg:? !k ?)\n & chr$(1+asc$!k):?k:~>z\n )\n & !k:>z\n &\n);\n","language":"Bracmat"},{"code":"pangram? = { sentence |\n letters = [:a :b :c :d :e :f :g :h :i :j :k :l :m\n :n :o :p :q :r :s :t :u :v :w :x :y :z]\n\n sentence.downcase!\n\n letters.reject! { l |\n sentence.include? l\n }\n\n letters.empty?\n}\n\np pangram? 'The quick brown fox jumps over the lazy dog.' #Prints true\np pangram? 'Probably not a pangram.' #Prints false\n","language":"Brat"},{"code":"pangram? = { sentence |\n sentence.downcase.dice.unique.select(:alpha?).length == 26\n}\n","language":"Brat"},{"code":"#include <stdio.h>\n\nint is_pangram(const char *s)\n{\n\tconst char *alpha = \"\"\n\t\t\"abcdefghjiklmnopqrstuvwxyz\"\n\t\t\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\n\tchar ch, wasused[26] = {0};\n\tint total = 0;\n\n\twhile ((ch = *s++) != '\\0') {\n\t\tconst char *p;\n\t\tint idx;\n\n\t\tif ((p = strchr(alpha, ch)) == NULL)\n\t\t\tcontinue;\n\n\t\tidx = (p - alpha) % 26;\n\n\t\ttotal += !wasused[idx];\n\t\twasused[idx] = 1;\n\t\tif (total == 26)\n\t\t\treturn 1;\n\t}\n\treturn 0;\n}\n\nint main(void)\n{\n\tint i;\n\tconst char *tests[] = {\n\t\t\"The quick brown fox jumps over the lazy dog.\",\n\t\t\"The qu1ck brown fox jumps over the lazy d0g.\"\n\t};\n\n\tfor (i = 0; i < 2; i++)\n\t\tprintf(\"\\\"%s\\\" is %sa pangram\\n\",\n\t\t\ttests[i], is_pangram(tests[i])?\"\":\"not \");\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n\nint pangram(const char *s)\n{\n\tint c, mask = (1 << 26) - 1;\n\twhile ((c = (*s++)) != '\\0') /* 0x20 converts lowercase to upper */\n\t\tif ((c &= ~0x20) <= 'Z' && c >= 'A')\n\t\t\tmask &= ~(1 << (c - 'A'));\n\n\treturn !mask;\n}\n\nint main()\n{\n\tint i;\n\tconst char *s[] = {\t\"The quick brown fox jumps over lazy dogs.\",\n\t\t\t\t\"The five boxing wizards dump quickly.\", };\n\n\tfor (i = 0; i < 2; i++)\n\t\tprintf(\"%s: %s\\n\", pangram(s[i]) ? \"yes\" : \"no \", s[i]);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <cctype>\n#include <string>\n#include <iostream>\n\nconst std::string alphabet(\"abcdefghijklmnopqrstuvwxyz\");\n\nbool is_pangram(std::string s)\n{\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\n std::sort(s.begin(), s.end());\n return std::includes(s.begin(), s.end(), alphabet.begin(), alphabet.end());\n}\n\nint main()\n{\n const auto examples = {\"The quick brown fox jumps over the lazy dog\",\n \"The quick white cat jumps over the lazy dog\"};\n\n std::cout.setf(std::ios::boolalpha);\n for (auto& text : examples) {\n std::cout << \"Is \\\"\" << text << \"\\\" a pangram? - \" << is_pangram(text) << std::endl;\n }\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\n\nstatic class Program\n{\n static bool IsPangram(this string text, string alphabet = \"abcdefghijklmnopqrstuvwxyz\")\n {\n return alphabet.All(text.ToLower().Contains);\n }\n\n static void Main(string[] arguments)\n {\n Console.WriteLine(arguments.Any() && arguments.First().IsPangram());\n }\n}\n","language":"C-sharp"},{"code":"using System;\n\nnamespace PangrammChecker\n{\n public class PangrammChecker\n {\n public static bool IsPangram(string str)\n {\n bool[] isUsed = new bool[26];\n int ai = (int)'a';\n int total = 0;\n for (CharEnumerator en = str.ToLower().GetEnumerator(); en.MoveNext(); )\n {\n int d = (int)en.Current - ai;\n if (d >= 0 && d < 26)\n if (!isUsed[d])\n {\n isUsed[d] = true;\n total++;\n }\n }\n return (total == 26);\n }\n }\n\n class Program\n {\n static void Main(string[] args)\n {\n string str1 = \"The quick brown fox jumps over the lazy dog.\";\n string str2 = \"The qu1ck brown fox jumps over the lazy d0g.\";\n Console.WriteLine(\"{0} is {1}a pangram\", str1,\n PangrammChecker.IsPangram(str1)?\"\":\"not \");\n Console.WriteLine(\"{0} is {1}a pangram\", str2,\n PangrammChecker.IsPangram(str2)?\"\":\"not \");\n Console.WriteLine(\"Press Return to exit\");\n Console.ReadLine();\n }\n }\n}\n","language":"C-sharp"},{"code":"shared void run() {\n\n\tfunction pangram(String sentence) =>\n \t\tlet(alphabet = set('a'..'z'),\n\t\t\tletters = set(sentence.lowercased.filter(alphabet.contains)))\n \t\tletters == alphabet;\n\n \tvalue sentences = [\n \t\t\"The quick brown fox jumps over the lazy dog\",\n \t\t\"\"\"Watch \"Jeopardy!\", Alex Trebek's fun TV quiz game.\"\"\",\n \t\t\"Pack my box with five dozen liquor jugs.\",\n \t\t\"blah blah blah\"\n \t];\n \tfor(sentence in sentences) {\n \t\tprint(\"\\\"``sentence``\\\" is a pangram? ``pangram(sentence)``\");\n \t}\n}\n","language":"Ceylon"},{"code":"(defn pangram? [s]\n (let [letters (into #{} \"abcdefghijklmnopqrstuvwxyz\")]\n (= (->> s .toLowerCase (filter letters) (into #{})) letters)))\n","language":"Clojure"},{"code":"pangram = proc (s: string) returns (bool)\n letters: array[bool] := array[bool]$fill(0,26,false)\n for c: char in string$chars(s) do\n if c>='a' & c<='z' then\n c := char$i2c(char$c2i(c) - 32)\n end\n if c>='A' & c<='Z' then\n letters[char$c2i(c) - 65] := true\n end\n end\n for seen: bool in array[bool]$elements(letters) do\n if ~seen then return(false) end\n end\n return(true)\nend pangram\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n examples: array[string] := array[string]$[\n \"The quick brown fox jumps over the lazy dog.\",\n \"The five boxing wizards dump quickly.\",\n \"abcdefghijklmnopqrstuvwxyz\"\n ]\n\n for example: string in array[string]$elements(examples) do\n stream$puts(po, \"\\\"\" || example || \"\\\" is\")\n if ~pangram(example) then\n stream$puts(po, \" not\")\n end\n stream$putl(po, \" a pangram.\")\n end\nend start_up\n","language":"CLU"},{"code":" identification division.\n program-id. pan-test.\n data division.\n working-storage section.\n 1 text-string pic x(80).\n 1 len binary pic 9(4).\n 1 trailing-spaces binary pic 9(4).\n 1 pangram-flag pic x value \"n\".\n 88 is-not-pangram value \"n\".\n 88 is-pangram value \"y\".\n procedure division.\n begin.\n display \"Enter text string:\"\n accept text-string\n set is-not-pangram to true\n initialize trailing-spaces len\n inspect function reverse (text-string)\n tallying trailing-spaces for leading space\n len for characters after space\n call \"pangram\" using pangram-flag len text-string\n cancel \"pangram\"\n if is-pangram\n display \"is a pangram\"\n else\n display \"is not a pangram\"\n end-if\n stop run\n .\n end program pan-test.\n\n identification division.\n program-id. pangram.\n data division.\n 1 lc-alphabet pic x(26) value \"abcdefghijklmnopqrstuvwxyz\".\n linkage section.\n 1 pangram-flag pic x.\n 88 is-not-pangram value \"n\".\n 88 is-pangram value \"y\".\n 1 len binary pic 9(4).\n 1 text-string pic x(80).\n procedure division using pangram-flag len text-string.\n begin.\n inspect lc-alphabet converting\n function lower-case (text-string (1:len))\n to space\n if lc-alphabet = space\n set is-pangram to true\n end-if\n exit program\n .\n end program pangram.\n","language":"COBOL"},{"code":"is_pangram = (s) ->\n # This is optimized for longish strings--as soon as all 26 letters\n # are encountered, we will be done. Our worst case scenario is a really\n # long non-pangram, or a really long pangram with at least one letter\n # only appearing toward the end of the string.\n a_code = 'a'.charCodeAt(0)\n required_letters = {}\n for i in [a_code...a_code+26]\n required_letters[String.fromCharCode(i)] = true\n\n cnt = 0\n for c in s\n c = c.toLowerCase()\n if required_letters[c]\n cnt += 1\n return true if cnt == 26\n delete required_letters[c]\n false\n\ndo ->\n tests = [\n [\"is this a pangram\", false]\n [\"The quick brown fox jumps over the lazy dog\", true]\n ]\n\n for test in tests\n [s, exp_value] = test\n throw Error(\"fail\") if is_pangram(s) != exp_value\n # try long strings\n long_str = ''\n for i in [1..500000]\n long_str += s\n throw Error(\"fail\") if is_pangram(long_str) != exp_value\n console.log \"Passed tests: #{s}\"\n","language":"CoffeeScript"},{"code":"0010 FUNC pangram#(s$) CLOSED\n0020 FOR i#:=ORD(\"A\") TO ORD(\"Z\") DO\n0030 IF NOT (CHR$(i#) IN s$ OR CHR$(i#+32) IN s$) THEN RETURN FALSE\n0040 ENDFOR i#\n0050 RETURN TRUE\n0060 ENDFUNC\n0070 //\n0080 WHILE NOT EOD DO\n0090 READ s$\n0100 PRINT \"'\",s$,\"' is \",\n0110 IF NOT pangram#(s$) THEN PRINT \"not \",\n0120 PRINT \"a pangram\"\n0130 ENDWHILE\n0140 END\n0150 DATA \"The quick brown fox jumps over the lazy dog.\"\n0160 DATA \"The five boxing wizards dump quickly.\"\n","language":"Comal"},{"code":"10 rem detect model for title display\n20 mx=peek(213): if mx=21 or mx=39 or mx=79 then 50:rem pet, vic, c64\n30 mx=peek(238): if mx=39 or mx=79 then 50: rem c128\n40 mx=39:color 4,1:rem assume plus/4 or c-16\n50 if mx=21 then poke 36879,30:rem fix color on vic-20\n60 print chr$(147);chr$(14);chr$(18);\"**\";:for i=2 to (mx-15)/2:print \" \";:next\n70 print \"Pangram Checker\";\n80 for i=(mx-15)/2+16 to mx-2: print \" \";: next: print \"**\"\n100 read s$\n110 if len(s$)=0 then end\n120 gosub 1000:print\n130 print \"'\"s$\"' is\";\n140 if p=0 then print \" not\";\n150 print \" a pangram.\"\n160 goto 100\n500 data \"The quick brown fox jumps over the lazy dog.\"\n510 data \"The quick brown fox jumped over the lazy dog.\"\n520 data \"The five boxing wizards jump quickly.\"\n530 data\n900 rem pangram checker\n1000 if f=0 then f=1:dim seen(25),a(2):a(0)=65:a(1)=97:a(2)=193:goto 1020\n1010 for i=0 to 25:seen(i)=0:next\n1020 for i=1 to len(s$)\n1030 : c=asc(mid$(s$,i))\n1040 : for a = 0 to 2\n1050 : if c>=a(a) and c<=a(a)+25 then seen(c-a(a))=seen(c-a(a))+1\n1060 : next a\n1070 next i\n1080 p=-1\n1090 for i=0 to 25\n1100 : if seen(i)=0 then p=0:i=25\n1110 next i\n1120 return\n","language":"Commodore-BASIC"},{"code":"(defun pangramp (s)\n (null (set-difference\n (loop for c from (char-code #\\A) upto (char-code #\\Z) collect (code-char c))\n (coerce (string-upcase s) 'list))))\n","language":"Common-Lisp"},{"code":"MODULE BbtPangramChecker;\nIMPORT StdLog,DevCommanders,TextMappers;\n\nPROCEDURE Check(str: ARRAY OF CHAR): BOOLEAN;\nCONST\n\tletters = 26;\nVAR\n\ti,j: INTEGER;\n\tstatus: ARRAY letters OF BOOLEAN;\n\tresp : BOOLEAN;\nBEGIN\n\tFOR i := 0 TO LEN(status) -1 DO status[i] := FALSE END;\n\n\tFOR i := 0 TO LEN(str) - 1 DO\n\t\tj := ORD(CAP(str[i])) - ORD('A');\n\t\tIF (0 <= j) & (25 >= j) & ~status[j] THEN status[j] := TRUE END\n\tEND;\n\n\tresp := TRUE;\n\tFOR i := 0 TO LEN(status) - 1 DO;\n\t\tresp := resp & status[i]\n\tEND;\n\tRETURN resp;\nEND Check;\n\nPROCEDURE Do*;\nVAR\n\tparams: DevCommanders.Par;\n\ts: TextMappers.Scanner;\nBEGIN\n\tparams := DevCommanders.par;\n\ts.ConnectTo(params.text);\n\ts.SetPos(params.beg);\n\ts.Scan;\n\tWHILE (~s.rider.eot) DO\n\t\tIF (s.type = TextMappers.char) & (s.char = '~') THEN\n\t\t\tRETURN\n\t\tELSIF (s.type # TextMappers.string) THEN\n\t\t\tStdLog.String(\"Invalid parameter\");StdLog.Ln\n\t\tELSE\n\t\t\tStdLog.Char(\"'\");StdLog.String(s.string + \"' is pangram?:> \");\n\t\t\tStdLog.Bool(Check(s.string));StdLog.Ln\n\t\tEND;\n\t\ts.Scan\n\tEND\nEND Do;\n\nEND BbtPangramChecker.\n","language":"Component-Pascal"},{"code":"include \"cowgol.coh\";\n\nsub pangram(str: [uint8]): (r: uint8) is\n var letters: uint8[26];\n MemZero(&letters[0], 26);\n\n loop\n var chr := [str];\n if chr == 0 then break; end if;\n str := @next str;\n chr := (chr | 32) - 'a';\n if chr >= 26 then continue; end if;\n letters[chr] := letters[chr] | 1;\n end loop;\n\n r := 1;\n chr := 0;\n while chr < 26 loop\n r := r & letters[chr];\n if r == 0 then break; end if;\n chr := chr + 1;\n end loop;\nend sub;\n\nvar yesno: [uint8][] := {\": no\\n\", \": yes\\n\"};\nvar test: [uint8][] := {\n \"The quick brown fox jumps over the lazy dog.\",\n \"The five boxing wizards dump quickly.\"\n};\n\nvar i: @indexof test := 0;\nwhile i < @sizeof test loop\n print(test[i]);\n print(yesno[pangram(test[i])]);\n i := i + 1;\nend loop;\n","language":"Cowgol"},{"code":"def pangram?(sentence)\n ('a'..'z').all? {|c| sentence.downcase.includes?(c) }\nend\n\np pangram?(\"not a pangram\")\np pangram?(\"The quick brown fox jumps over the lazy dog.\")\n","language":"Crystal"},{"code":"bool isPangram(in string text) pure nothrow @safe @nogc {\n uint bitset;\n\n foreach (immutable c; text) {\n if (c >= 'a' && c <= 'z')\n bitset |= (1u << (c - 'a'));\n else if (c >= 'A' && c <= 'Z')\n bitset |= (1u << (c - 'A'));\n }\n\n return bitset == 0b11_11111111_11111111_11111111;\n}\n\nvoid main() {\n assert(\"the quick brown fox jumps over the lazy dog\".isPangram);\n assert(!\"ABCDEFGHIJKLMNOPQSTUVWXYZ\".isPangram);\n assert(!\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\".isPangram);\n assert(\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\".isPangram);\n}\n","language":"D"},{"code":"import std.string, std.traits, std.uni;\n\n// Do not compile with -g (debug info).\nenum Alphabet : dstring {\n DE = \"abcdefghijklmnopqrstuvwxyzßäöü\",\n EN = \"abcdefghijklmnopqrstuvwxyz\",\n SV = \"abcdefghijklmnopqrstuvwxyzåäö\"\n}\n\nbool isPangram(S)(in S s, dstring alpha = Alphabet.EN)\npure /*nothrow*/ if (isSomeString!S) {\n foreach (dchar c; alpha)\n if (indexOf(s, c) == -1 && indexOf(s, std.uni.toUpper(c)) == -1)\n return false;\n return true;\n}\n\nvoid main() {\n assert(isPangram(\"the quick brown fox jumps over the lazy dog\".dup, Alphabet.EN));\n assert(isPangram(\"Falsches Üben von Xylophonmusik quält jeden größeren Zwerg\"d, Alphabet.DE));\n assert(isPangram(\"Yxskaftbud, ge vår wczonmö iqhjälp\"w, Alphabet.SV));\n}\n","language":"D"},{"code":"program PangramChecker;\n\n{$APPTYPE CONSOLE}\n\nuses StrUtils;\n\nfunction IsPangram(const aString: string): Boolean;\nvar\n c: char;\nbegin\n for c := 'a' to 'z' do\n if not ContainsText(aString, c) then\n Exit(False);\n\n Result := True;\nend;\n\nbegin\n Writeln(IsPangram('The quick brown fox jumps over the lazy dog')); // true\n Writeln(IsPangram('Not a panagram')); // false\nend.\n","language":"Delphi"},{"code":"proc nonrec pangram(*char s) bool:\n ulong letters;\n char c;\n byte b;\n byte A = pretend('a', byte);\n byte Z = pretend('z', byte);\n\n letters := 0L0;\n while\n c := s*;\n s := s + 1;\n c /= '\\e'\n do\n b := pretend(c, byte) | 32;\n if b >= A and b <= Z then\n letters := letters | 0L1 << (b-A)\n fi\n od;\n letters = 0x3FFFFFF\ncorp\n\nproc nonrec test(*char s) void:\n writeln(\"\\\"\", s, \"\\\": \",\n if pangram(s) then \"yes\" else \"no\" fi)\ncorp\n\nproc nonrec main() void:\n test(\"The quick brown fox jumps over the lazy dog.\");\n test(\"The five boxing wizards jump quickly.\");\n test(\"Not a pangram\")\ncorp\n","language":"Draco"},{"code":"def isPangram(sentence :String) {\n return (\"abcdefghijklmnopqrstuvwxyz\".asSet() &! sentence.toLowerCase().asSet()).size() == 0\n}\n","language":"E"},{"code":"func pangr s$ .\n len d[] 26\n for c$ in strchars s$\n c = strcode c$\n if c >= 97 and c <= 122\n c -= 32\n .\n if c >= 65 and c <= 91\n d[c - 64] = 1\n .\n .\n for h in d[]\n s += h\n .\n return s\n.\nrepeat\n s$ = input\n until s$ = \"\"\n print s$\n if pangr s$ = 26\n print \" --> pangram\"\n .\n print \"\"\n.\ninput_data\nThis is a test.\nThe quick brown fox jumps over the lazy dog.\nThe quick brown fox jumped over the lazy dog.\nQwErTyUiOpAsDfGhJkLzXcVbNm\n","language":"EasyLang"},{"code":" [Pangram checker for Rosetta Code.\n EDSAC program, Initial Orders 2.]\n\n [Outline: Make a table, one entry per 5-bit character code.\n Initialize entry for each letter to 1.\n When a letter is read, convert its entry to 0.]\n\n [Subroutine to read string from the input and\n store it with character codes in low 5 bits.\n String is terminated by blank row of tape, which is stored.\n Input: 0F holds address of string in address field (bits 1..11).\n 21 locations; workspace: 4F]\n T 56 K\n GKA3FT17@AFA18@T7@I4FA4FUFS19@G12@S20@G16@T4FA7@A2FE4@T4FEFUFP8FPD\n\n [*************** Rosetta Code task ***************\n Subroutine to test whether string is a pangram.\n Input: 0F = address of string, characters in low 5 bits,\n terminated by blank row of tape.\n Output: 1F = (number of missing letters) - 1.\n 87 memory locations; workspace 4F.]\n T 88 K\n G K\n A 3 F [make and plant link for return]\n T 48 @\n [Fill letter table with 1's.\n The code is a bit neater if we work backwards.]\n A 54 @ [index of last entry]\n [3] A 51 @ [make T order for table entry]\n T 6 @ [plant in code]\n A 53 @ [acc := 1]\n [6] T F [table entry := 1]\n A 6 @ [dec address in table]\n S 2 F\n S 51 @ [finished table?]\n E 3 @ [loop back if not]\n [Set non-letters to 0, except blank row := -1]\n T 4 F [clear acc]\n T 66 @ [figures shift]\n T 70 @ [letters shift]\n T 73 @ [carriage return]\n T 75 @ [space]\n T 79 @ [line feed]\n S 53 @ [acc := -1]\n T 71 @ [blank row of tape]\n [Loop to read characters from string.\n Terminated by blank row of tape.\n Assume acc = 0 here.]\n A F [load address of string]\n A 49 @ [make order to read first char]\n [21] T 22 @ [plant in code]\n [22] A F [char to acc]\n L D [shift to address field]\n A 50 @ [make A order for this char in table]\n U 28 @ [plant in code]\n A 52 @ [convert to T order]\n T 31 @ [plant in code]\n [28] A F [load table entry]\n G 35 @ [jump out if it's -1, i.e. blank row]\n T 4 F [clear acc]\n [31] T F [table entry := 0 to flag that letter is present]\n A 22 @ [inc address in input string]\n A 2 F\n G 21 @ [back to read next char]\n [Get total of table entries, again working backwards.\n The number of missing letters is (total + 1).]\n [35] T 4 F [clear acc]\n T 1 F [initialize total := 0]\n A 54 @ [index of last entry]\n [38] A 50 @ [make A order for table entry]\n T 41 @ [plant in code]\n A 1 F [load total so far]\n [41] A F [add table entry]\n T 1 F [update total]\n A 41 @ [load A order]\n S 2 F [dec address]\n S 50 @ [finished table?]\n E 38 @ [loop back if not]\n T 4 F [clear acc before exit]\n [48] E F\n [Constants]\n [49] A F [to make A order referring to input]\n [50] A 55 @ [to make A order referring to table]\n [51] T 55 @ [to make T order referring to table]\n [52] O F [add to A order to convert to T order]\n [53] P D [constant 1]\n [54] P 31 F [to change address by 31]\n [Table]\n [55] PFPFPFPFPFPFPFPFPFPFPF\n [66] PFPFPFPF [11 = figures shift]\n [70] PF [15 = letters shift]\n [71] PFPF [16 = blank row of tape]\n [73] PFPF [18 = carriage return]\n [75] PFPFPFPF [20 = space]\n [79] PFPFPFPFPFPFPFPF [24 = line feed]\n\n [Main routine to demonstrate pangram-checking subroutine]\n T 200 K\n G K\n [Constants]\n [0] P 25 @ [address for input string]\n [1] N F [letter N]\n [2] Y F [letter Y]\n [3] K 2048 F [letter shift]\n [4] @ F [carriage return]\n [5] & F [line feed]\n [6] K 4096 F [null char]\n [Enter with acc = 0]\n [7] O 3 @ [set letters shift]\n [8] A @ [load address of input]\n T F [pass to input subroutine in 0F]\n [10] A 10 @ [call input subroutine, doesn't change 0F]\n G 56 F\n [12] A 12 @ [call pangram subroutine]\n G 88 F\n [We could print the number of missing letters,\n but we'll just print 'Y' or 'N'.]\n A 1 F [load (number missing) - 1]\n E 18 @ [jump if not pangram]\n O 2 @ [print 'Y']\n G 19 @ [exit]\n [18] O 1 @ [print 'N']\n [19] O 4 @ [print CR, LF]\n O 5 @\n O 6 @ [print null to flush printer buffer]\n Z F [stop]\n T F [on Reset, clear acc]\n E 8 @ [and test another string]\n [25] [input string goes here]\n E 7 Z [define entry point]\n P F [acc = 0 on entry]\nTHE!QUICK!BROWN!FOX!JUMPS!OVER!THE!LAZY!DOG.\n","language":"EDSAC-order-code"},{"code":"defmodule Pangram do\n def checker(str) do\n unused = Enum.to_list(?a..?z) -- to_char_list(String.downcase(str))\n Enum.empty?(unused)\n end\nend\n\ntext = \"The quick brown fox jumps over the lazy dog.\"\nIO.puts \"#{Pangram.checker(text)}\\t#{text}\"\ntext = (Enum.to_list(?A..?Z) -- 'Test') |> to_string\nIO.puts \"#{Pangram.checker(text)}\\t#{text}\"\n","language":"Elixir"},{"code":"-module(pangram).\n-export([is_pangram/1]).\n\nis_pangram(String) ->\n ordsets:is_subset(lists:seq($a, $z), ordsets:from_list(string:to_lower(String))).\n","language":"Erlang"},{"code":"ISPANGRAM\n=LAMBDA(s,\n LET(\n abc, CHARS(LOWER(\"abcdefghijklmnopqrstuvwxyz\")),\n AND(\n LAMBDA(c,\n ISNUMBER(SEARCH(c, s, 1))\n )(\n abc\n )\n )\n )\n)\n","language":"Excel"},{"code":"CHARS\n=LAMBDA(s,\n MID(s, ROW(INDIRECT(\"1:\" & LEN(s))), 1)\n)\n","language":"Excel"},{"code":"let isPangram (str: string) = (set['a'..'z'] - set(str.ToLower())).IsEmpty\n","language":"F-Sharp"},{"code":": pangram? ( str -- ? )\n [ \"abcdefghijklmnopqrstuvwxyz\" ] dip >lower diff length 0 = ;\n\n\"How razorback-jumping frogs can level six piqued gymnasts!\" pangram? .\n","language":"Factor"},{"code":": pangram? ( addr len -- ? )\n 0 -rot bounds do\n i c@ 32 or [char] a -\n dup 0 26 within if\n 1 swap lshift or\n else drop then\n loop\n 1 26 lshift 1- = ;\n\ns\" The five boxing wizards jump quickly.\" pangram? . \\ -1\n","language":"Forth"},{"code":"module pangram\n\n implicit none\n private\n public :: is_pangram\n character (*), parameter :: lower_case = 'abcdefghijklmnopqrstuvwxyz'\n character (*), parameter :: upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\ncontains\n\n function to_lower_case (input) result (output)\n\n implicit none\n character (*), intent (in) :: input\n character (len (input)) :: output\n integer :: i\n integer :: j\n\n output = input\n do i = 1, len (output)\n j = index (upper_case, output (i : i))\n if (j /= 0) then\n output (i : i) = lower_case (j : j)\n end if\n end do\n\n end function to_lower_case\n\n function is_pangram (input) result (output)\n\n implicit none\n character (*), intent (in) :: input\n character (len (input)) :: lower_case_input\n logical :: output\n integer :: i\n\n lower_case_input = to_lower_case (input)\n output = .true.\n do i = 1, len (lower_case)\n if (index (lower_case_input, lower_case (i : i)) == 0) then\n output = .false.\n exit\n end if\n end do\n\n end function is_pangram\n\nend module pangram\n","language":"Fortran"},{"code":"program test\n\n use pangram, only: is_pangram\n\n implicit none\n character (256) :: string\n\n string = 'This is a sentence.'\n write (*, '(a)') trim (string)\n write (*, '(l1)') is_pangram (string)\n string = 'The five boxing wizards jumped quickly.'\n write (*, '(a)') trim (string)\n write (*, '(l1)') is_pangram (string)\n\nend program test\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nFunction isPangram(s As Const String) As Boolean\n Dim As Integer length = Len(s)\n If length < 26 Then Return False\n Dim p As String = LCase(s)\n For i As Integer = 97 To 122\n If Instr(p, Chr(i)) = 0 Then Return False\n Next\n Return True\nEnd Function\n\nDim s(1 To 3) As String = _\n{ _\n \"The quick brown fox jumps over the lazy dog\", _\n \"abbdefghijklmnopqrstuVwxYz\", _ '' no c!\n \"How vexingly quick daft zebras jump!\" _\n}\n\nFor i As Integer = 1 To 3:\n Print \"'\"; s(i); \"' is \"; IIf(isPangram(s(i)), \"a\", \"not a\"); \" pangram\"\n Print\nNext\n\nPrint\nPrint \"Press nay key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"s = \"The quick brown fox jumps over the lazy dog.\"\nprintln[\"\\\"$s\\\" is\" + (isPangram[s] ? \"\" : \" not\") + \" a pangram.\"]\n\nisPangram[s] :=\n{\n charSet = toSet[charList[lc[s]]]\n for c = \"a\" to \"z\"\n if ! charSet.contains[c]\n return false\n\n return true\n}\n","language":"Frink"},{"code":"include \"NSLog.incl\"\n\nlocal fn IsPangram( pangramString as CFStringRef ) as BOOL\n NSUInteger i, count\n BOOL result\n\n CFStringRef lcPanStr = fn StringLowerCaseString( pangramString )\n CFMutableSetRef mutSet = fn MutableSetWithCapacity( 0 )\n\n count = len(lcPanStr)\n for i = 0 to count - 1\n if ( fn CharacterSetCharacterIsMember( fn CharacterSetLowercaseLetterSet, fn StringCharacterAtIndex( lcPanStr, i ) ) )\n MutableSetAddObject( mutSet, fn StringWithFormat( @\"%c\", fn StringCharacterAtIndex( lcPanStr, i ) ) )\n end if\n next\n if fn SetCount( mutSet ) >= 26 then result = YES else result = NO\nend fn = result\n\n\nCFStringRef testStr, trueStr, falseStr\nCFArrayRef array\n\ntrueStr = @\"Is a pangram\"\nfalseStr = @\"Not a pangram\"\n\narray = @[¬\n@\"My dog has fleas.\",¬\n@\"The quick brown fox jumps over the lazy do.\",¬\n@\"The quick brown fox jumped over the lazy dog.\",¬\n@\"The quick brown fox jumps over the lazy dog.\",¬\n@\"Jackdaws love my big sphinx of quartz.\",¬\n@\"What's a jackdaw?\",¬\n@\"Watch \\\"Jeopardy!\\\", Alex Trebek's fun TV quiz game.\",¬\n@\"Pack my box with five dozen liquor jugs.\",¬\n@\"This definitely is not a pangram.\",¬\n@\"This is a random long sentence just for testing purposes.\"]\n\nfor testStr in array\n if ( fn IsPangram( testStr ) )\n NSLog( @\"%13s : %@\", fn StringUTF8String( trueStr ), testStr ) else NSLog( @\"%s : %@\", fn StringUTF8String( falseStr ), testStr )\n end if\nnext\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport \"fmt\"\n\nfunc main() {\n for _, s := range []string{\n \"The quick brown fox jumps over the lazy dog.\",\n `Watch \"Jeopardy!\", Alex Trebek's fun TV quiz game.`,\n \"Not a pangram.\",\n } {\n if pangram(s) {\n fmt.Println(\"Yes:\", s)\n } else {\n fmt.Println(\"No: \", s)\n }\n }\n}\n\nfunc pangram(s string) bool {\n\tvar missing uint32 = (1 << 26) - 1\n\tfor _, c := range s {\n\t\tvar index uint32\n\t\tif 'a' <= c && c <= 'z' {\n\t\t\tindex = uint32(c - 'a')\n\t\t} else if 'A' <= c && c <= 'Z' {\n\t\t\tindex = uint32(c - 'A')\n\t\t} else {\n\t\t\tcontinue\n\t\t}\n\n\t\tmissing &^= 1 << index\n\t\tif missing == 0 {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n","language":"Go"},{"code":"import Data.Char (toLower)\nimport Data.List ((\\\\))\n\npangram :: String -> Bool\npangram = null . (['a' .. 'z'] \\\\) . map toLower\n\nmain = print $ pangram \"How razorback-jumping frogs can level six piqued gymnasts!\"\n","language":"Haskell"},{"code":"PangramBrokenAt(\"This is a Pangram.\") ! => 2 (b is missing)\nPangramBrokenAt(\"The quick Brown Fox jumps over the Lazy Dog\") ! => 0 (OK)\n\nFUNCTION PangramBrokenAt(string)\n CHARACTER string, Alfabet=\"abcdefghijklmnopqrstuvwxyz\"\n PangramBrokenAt = INDEX(Alfabet, string, 64)\n ! option 64: verify = 1st letter of string not in Alfabet\nEND\n","language":"HicEst"},{"code":"procedure panagram(s) #: return s if s is a panagram and fail otherwise\nif (map(s) ** &lcase) === &lcase then return s\nend\n","language":"Icon"},{"code":"procedure main(arglist)\n\nif *arglist > 0 then\n every ( s := \"\" ) ||:= !arglist || \" \"\nelse\n s := \"The quick brown fox jumps over the lazy dog.\"\n\nwrites(image(s), \" -- is\")\nwrites(if not panagram(s) then \"n't\")\nwrite(\" a panagram.\")\nend\n","language":"Icon"},{"code":"(function pangram? sentence\n (let prepped (-> sentence lower-case to-vec))\n (all? prepped (map char-code (range 97 123))))\n\n(pangram? \"The five boxing wizards jump quickly.\")\n","language":"Icon"},{"code":"Sequence isPangram := method(\n letters := \" \" repeated(26)\n ia := \"a\" at(0)\n foreach(ichar,\n if(ichar isLetter,\n letters atPut((ichar asLowercase) - ia, ichar)\n )\n )\n letters contains(\" \" at(0)) not // true only if no \" \" in letters\n)\n\n\"The quick brown fox jumps over the lazy dog.\" isPangram println // --> true\n\"The quick brown fox jumped over the lazy dog.\" isPangram println // --> false\n\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\" isPangram println // --> true\n","language":"Io"},{"code":"Text isPangram? = method(\n letters = \"abcdefghijklmnopqrstuvwxyz\" chars\n text = self lower chars\n letters map(x, text include?(x)) reduce(&&)\n)\n","language":"Ioke"},{"code":"iik> \"The quick brown fox jumps over the lazy dog\" isPangram?\n\"The quick brown fox jumps over the lazy dog\" isPangram?\n+> true\n\niik> \"The quick brown fox jumps over the\" isPangram?\n\"The quick brown fox jumps over the\" isPangram?\n+> false\n","language":"Ioke"},{"code":"require 'strings'\nisPangram=: (a. {~ 97+i.26) */@e. tolower\n","language":"J"},{"code":" isPangram 'The quick brown fox jumps over the lazy dog.'\n1\n isPangram 'The quick brown fox falls over the lazy dog.'\n0\n","language":"J"},{"code":"public class Pangram {\n public static boolean isPangram(String test){\n for (char a = 'A'; a <= 'Z'; a++)\n if ((test.indexOf(a) < 0) && (test.indexOf((char)(a + 32)) < 0))\n return false;\n return true;\n }\n\n public static void main(String[] args){\n System.out.println(isPangram(\"the quick brown fox jumps over the lazy dog\"));//true\n System.out.println(isPangram(\"the quick brown fox jumped over the lazy dog\"));//false, no s\n System.out.println(isPangram(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"));//true\n System.out.println(isPangram(\"ABCDEFGHIJKLMNOPQSTUVWXYZ\"));//false, no r\n System.out.println(isPangram(\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\"));//false, no m\n System.out.println(isPangram(\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\"));//true\n System.out.println(isPangram(\"\"));//false\n }\n}\n","language":"Java"},{"code":"function isPangram(s) {\n var letters = \"zqxjkvbpygfwmucldrhsnioate\"\n // sorted by frequency ascending (http://en.wikipedia.org/wiki/Letter_frequency)\n s = s.toLowerCase().replace(/[^a-z]/g,'')\n for (var i = 0; i < 26; i++)\n if (s.indexOf(letters[i]) < 0) return false\n return true\n}\n\nconsole.log(isPangram(\"is this a pangram\")) // false\nconsole.log(isPangram(\"The quick brown fox jumps over the lazy dog\")) // true\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // ----------------- PANGRAM CHECKER -----------------\n\n // isPangram :: String -> Bool\n const isPangram = s =>\n 0 === \"abcdefghijklmnopqrstuvwxyz\"\n .split(\"\")\n .filter(c => -1 === s.toLowerCase().indexOf(c))\n .length;\n\n // ---------------------- TEST -----------------------\n return [\n \"is this a pangram\",\n \"The quick brown fox jumps over the lazy dog\"\n ].map(isPangram);\n})();\n","language":"JavaScript"},{"code":"def is_pangram:\n explode\n | map( if 65 <= . and . <= 90 then . + 32 # uppercase\n elif 97 <= . and . <= 122 then . # lowercase\n else empty\n end )\n | unique\n | length == 26;\n\n# Example:\n\"The quick brown fox jumps over the lazy dog\" | is_pangram\n","language":"Jq"},{"code":"function makepangramchecker(alphabet)\n alphabet = Set(uppercase.(alphabet))\n function ispangram(s)\n lengthcheck = length(s) ≥ length(alphabet)\n return lengthcheck && all(c in uppercase(s) for c in alphabet)\n end\n return ispangram\nend\n\nconst tests = [\"Pack my box with five dozen liquor jugs.\",\n \"The quick brown fox jumps over a lazy dog.\",\n \"The quick brown fox jumps\\u2323over the lazy dog.\",\n \"The five boxing wizards jump quickly.\",\n \"This sentence contains A-Z but not the whole alphabet.\"]\n\nis_english_pangram = makepangramchecker('a':'z')\n\nfor s in tests\n println(\"The sentence \\\"\", s, \"\\\" is \", is_english_pangram(s) ? \"\" : \"not \", \"a pangram.\")\nend\n","language":"Julia"},{"code":"lcase : _ci 97+!26\nucase : _ci 65+!26\ntolower : {@[x;p;:;lcase@n@p:&26>n:ucase?/:x]}\npanagram: {&/lcase _lin tolower x}\n","language":"K"},{"code":" panagram \"The quick brown fox jumps over the lazy dog\"\n1\n panagram \"Panagram test\"\n0\n","language":"K"},{"code":"isPangram:0=#(`c$\"a\"+!26)^_:\n\nisPangram\"This is a test\"\n0\nisPangram\"The quick brown fox jumps over the lazy dog.\"\n1\n","language":"K"},{"code":"// version 1.0.6\n\nfun isPangram(s: String): Boolean {\n if (s.length < 26) return false\n val t = s.toLowerCase()\n for (c in 'a' .. 'z')\n if (c !in t) return false\n return true\n}\n\nfun main(args: Array<String>) {\n val candidates = arrayOf(\n \"The quick brown fox jumps over the lazy dog\",\n \"New job: fix Mr. Gluck's hazy TV, PDQ!\",\n \"A very bad quack might jinx zippy fowls\",\n \"A very mad quack might jinx zippy fowls\" // no 'b' now!\n )\n for (candidate in candidates)\n println(\"'$candidate' is ${if (isPangram(candidate)) \"a\" else \"not a\"} pangram\")\n}\n","language":"Kotlin"},{"code":"#!/bin/ksh\n\n# Pangram checker\n\n#\t# Variables:\n#\nalphabet='abcdefghijklmnopqrstuvwxyz'\n\ntypeset -a strs\nstrs+=( 'Mr. Jock, TV quiz PhD., bags few lynx.' )\nstrs+=( 'A very mad quack might jinx zippy fowls.' )\n\n#\t# Functions:\n#\n\n#\t# Function _ispangram(str) - return 0 if str is a pangram\n#\nfunction _ispangram {\n\ttypeset _str ; typeset -l _str=\"$1\"\n\ttypeset _buff ; _buff=\"${alphabet}\"\n\ttypeset _i ; typeset -si _i\n\n\tfor ((_i=0; _i<${#_str} && ${#_buff}>0; _i++)); do\n\t\t_buff=${_buff/${_str:${_i}:1}/}\n\tdone\n\treturn ${#_buff}\n}\n\n ######\n# main #\n ######\n\ntypeset -si i\nfor ((i=0; i<${#strs[*]}; i++)); do\n\t_ispangram \"${strs[i]}\"\n\tif (( ! $? )); then\n\t\tprint \"${strs[i]} <<< IS A PANGRAM.\"\n\telse\n\t\tprint \"${strs[i]} <<< Is not a pangram.\"\n\tfi\ndone\n","language":"Ksh"},{"code":"'Returns 0 if the string is NOT a pangram or >0 if it IS a pangram\nstring$ = \"The quick brown fox jumps over the lazy dog.\"\n\nPrint isPangram(string$)\n\nFunction isPangram(string$)\n string$ = Lower$(string$)\n For i = Asc(\"a\") To Asc(\"z\")\n isPangram = Instr(string$, chr$(i))\n If isPangram = 0 Then Exit Function\n Next i\nEnd Function\n","language":"Liberty-BASIC"},{"code":"to remove.all :s :set\n if empty? :s [output :set]\n if word? :s [output remove.all butfirst :s remove first :s :set]\n output remove.all butfirst :s remove.all first :s :set\nend\nto pangram? :s\n output empty? remove.all :s \"abcdefghijklmnopqrstuvwxyz\nend\n\nshow pangram? [The five boxing wizards jump quickly.] ; true\n","language":"Logo"},{"code":"require\"lpeg\"\nS, C = lpeg.S, lpeg.C\nfunction ispangram(s)\n return #(C(S(s)^0):match\"abcdefghijklmnopqrstuvwxyz\") == 26\nend\n\nprint(ispangram\"waltz, bad nymph, for quick jigs vex\")\nprint(ispangram\"bobby\")\nprint(ispangram\"long sentence\")\n","language":"Lua"},{"code":"#Used built-in StringTools package\nis_pangram := proc(str)\n\tlocal present := StringTools:-LowerCase~(select(StringTools:-HasAlpha, StringTools:-Explode(str)));\n\tlocal alphabets := {\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"};\n\tpresent := convert(present, set);\n\treturn evalb(present = alphabets);\nend proc;\n","language":"Maple"},{"code":"is_pangram(\"The quick brown fox jumps over the lazy dog.\");\nis_pangram(\"The 2 QUIck brown foxes jumped over the lazy DOG!!\");\nis_pangram(\"\"The quick brown fox jumps over the lay dog.\");\n","language":"Maple"},{"code":"pangramQ[msg_]:=Complement[CharacterRange[\"a\", \"z\"], Characters[ToLowerCase[msg]]]=== {}\n","language":"Mathematica"},{"code":"pangramQ[msg_] :=\n Function[If[# === {}, Print[\"The string is a pangram!\"],\n Print[\"The string is not a pangram. It's missing the letters \" <>\n ToString[#]]]][\n Complement[CharacterRange[\"a\", \"z\"], Characters[ToLowerCase[msg]]]]\n","language":"Mathematica"},{"code":"function trueFalse = isPangram(string)\n\n %This works by histogramming the ascii character codes for lower case\n %letters contained in the string (which is first converted to all\n %lower case letters). Then it finds the index of the first letter that\n %is not contained in the string (this is faster than using the find\n %without the second parameter). If the find returns an empty array then\n %the original string is a pangram, if not then it isn't.\n\n trueFalse = isempty(find( histc(lower(string),(97:122))==0,1 ));\n\nend\n","language":"MATLAB"},{"code":"isPangram('The quick brown fox jumps over the lazy dog.')\n\nans =\n\n 1\n","language":"MATLAB"},{"code":"function trueFalse = isPangram(string)\n % X is a histogram of letters\n X = sparse(abs(lower(string)),1,1,128,1);\n trueFalse = full(all(X('a':'z') > 0));\nend\n","language":"MATLAB"},{"code":"\"abcdefghijklmnopqrstuvwxyz\" \"\" split =alphabet\n('alphabet dip lowercase (swap match) prepend all?) :pangram?\n\n\"The quick brown fox jumps over the lazy dog.\" pangram? puts\n","language":"Min"},{"code":"sentences = [\"The quick brown fox jumps over the lazy dog.\",\n \"Peter Piper picked a peck of pickled peppers.\",\n \"Waltz job vexed quick frog nymphs.\"]\n\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\npangram = function (toCheck)\n sentence = toCheck.lower\n fail = false\n for c in alphabet\n if sentence.indexOf(c) == null then return false\n end for\n return true\nend function\n\nfor sentence in sentences\n if pangram(sentence) then\n print \"\"\"\" + sentence + \"\"\" is a Pangram\"\n else\n print \"\"\"\" + sentence + \"\"\" is not a Pangram\"\n end if\nend for\n","language":"MiniScript"},{"code":"fun to_locase s = implode ` map (c_downcase) ` explode s\n\nfun is_pangram\n\t(h :: t, T) =\n\t\tlet\n\t\t\tval flen = len (filter (fn c = c eql h) T)\n\t\tin\n\t\t\tif (flen = 0) then\n\t\t\t\tfalse\n\t\t\telse\n\t\t\t\tis_pangram (t, T)\n\t\tend\n|\t([], T) = true\n| \tS = is_pangram (explode \"abcdefghijklmnopqrstuvwxyz\", explode ` to_locase S)\n\nfun is_pangram_i\n\t(h :: t, T) =\n\t\tlet\n\t\t\tval flen = len (filter (fn c = c eql h) T)\n\t\tin\n\t\t\tif (flen = 0) then\n\t\t\t\tfalse\n\t\t\telse\n\t\t\t\tis_pangram (t, T)\n\t\tend\n|\t([], T) = true\n| \t(A,S) = is_pangram (explode A, explode ` to_locase S)\n\nfun test (f, arg, res, ok, notok) = if (f arg eql res) then (\"'\" @ arg @ \"' \" @ ok) else (\"'\" @ arg @ \"' \" @ notok)\nfun test2 (f, arg, res, ok, notok) = if (f arg eql res) then (\"'\" @ ref (arg,1) @ \"' \" @ ok) else (\"'\" @ ref (arg,1) @ \"' \" @ notok)\n\n;\nprintln ` test (is_pangram, \"The quick brown fox jumps over the lazy dog\", true, \"is a pangram\", \"is not a pangram\");\nprintln ` test (is_pangram, \"abcdefghijklopqrstuvwxyz\", true, \"is a pangram\", \"is not a pangram\");\nval SValphabet = \"abcdefghijklmnopqrstuvwxyzåäö\";\nval SVsentence = \"Yxskaftbud, ge vår wczonmö iq hjälp\";\nprintln ` test2 (is_pangram_i, (SValphabet, SVsentence), true, \"is a Swedish pangram\", \"is not a Swedish pangram\");\n","language":"MLite"},{"code":"MODULE Pangrams;\nFROM InOut IMPORT WriteString, WriteLn;\nFROM Strings IMPORT Length;\n\n(* Check if a string is a pangram *)\nPROCEDURE pangram(s: ARRAY OF CHAR): BOOLEAN;\n VAR letters: ARRAY [0..25] OF BOOLEAN;\n i: CARDINAL;\nBEGIN\n FOR i := 0 TO 25 DO letters[i] := FALSE; END;\n FOR i := 0 TO Length(s)-1 DO\n IF (s[i] >= 'A') AND (s[i] <= 'Z') THEN\n letters[ORD(s[i]) - ORD('A')] := TRUE;\n ELSIF (s[i] >= 'a') AND (s[i] <= 'z') THEN\n letters[ORD(s[i]) - ORD('a')] := TRUE;\n END;\n END;\n FOR i := 0 TO 25 DO\n IF NOT letters[i] THEN\n RETURN FALSE;\n END;\n END;\n RETURN TRUE;\nEND pangram;\n\nPROCEDURE example(s: ARRAY OF CHAR);\nBEGIN\n WriteString(\"'\");\n WriteString(s);\n WriteString(\"' is \");\n IF NOT pangram(s) THEN\n WriteString(\"not \");\n END;\n WriteString(\"a pangram.\");\n WriteLn();\nEND example;\n\nBEGIN\n example(\"The quick brown fox jumps over the lazy dog\");\n example(\"The five boxing wizards dump quickly\");\n example(\"abcdefghijklmnopqrstuvwxyz\");\nEND Pangrams.\n","language":"Modula-2"},{"code":"/* NetRexx */\noptions replace format comments java crossref savelog symbols nobinary\n\nA2Z = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n\npangrams = create_samples\n\nloop p_ = 1 to pangrams[0]\n pangram = pangrams[p_]\n q_ = A2Z.verify(pangram.upper) -- <= it basically all happens in this function call!\n say pangram.left(64)'\\-'\n if q_ == 0 then -\n say ' [OK, a pangram]'\n else -\n say ' [Not a pangram. Missing:' A2Z.substr(q_, 1)']'\n end p_\n\nmethod create_samples public static returns Rexx\n\n pangrams = ''\n\n x_ = 0\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over a lazy dog.' -- best/shortest pangram\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over the lazy dog.' -- not as short but at least it's still a pangram\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumped over the lazy dog.' -- common misquote; not a pangram\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick onyx goblin jumps over the lazy dwarf.'\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'Bored? Craving a pub quiz fix? Why, just come to the Royal Oak!' -- (Used to advertise a pub quiz in Bowness-on-Windermere)\n\n return pangrams\n","language":"NetRexx"},{"code":"(context 'PGR) ;; Switch to context (say namespace) PGR\n(define (is-pangram? str)\n (setf chars (explode (upper-case str))) ;; Uppercase + convert string into a list of chars\n (setf is-pangram-status true) ;; Default return value of function\n (for (c (char \"A\") (char \"Z\") 1 (nil? is-pangram-status)) ;; For loop with break condition\n (if (not (find (char c) chars)) ;; If char not found in list, \"is-pangram-status\" becomes \"nil\"\n (setf is-pangram-status nil)\n )\n )\n is-pangram-status ;; Return current value of symbol \"is-pangram-status\"\n)\n(context 'MAIN) ;; Back to MAIN context\n\n;; - - - - - - - - - -\n\n(println (PGR:is-pangram? \"abcdefghijklmnopqrstuvwxyz\")) ;; Print true\n(println (PGR:is-pangram? \"abcdef\")) ;; Print nil\n(exit)\n","language":"NewLISP"},{"code":"import rdstdin\n\nproc isPangram(sentence: string, alphabet = {'a'..'z'}): bool =\n var sentset: set[char] = {}\n for c in sentence: sentset.incl c\n alphabet <= sentset\n\necho isPangram(readLineFromStdin \"Sentence: \")\n","language":"Nim"},{"code":"bundle Default {\n class Pangram {\n function : native : IsPangram(test : String) ~ Bool {\n for(a := 'A'; a <= 'Z'; a += 1;) {\n if(test->Find(a) < 0 & test->Find(a->ToLower()) < 0) {\n return false;\n };\n };\n\n return true;\n }\n\n function : Main(args : String[]) ~ Nil {\n IsPangram(\"the quick brown fox jumps over the lazy dog\")->PrintLine(); # true\n IsPangram(\"the quick brown fox jumped over the lazy dog\")->PrintLine(); # false, no s\n IsPangram(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")->PrintLine(); # true\n IsPangram(\"ABCDEFGHIJKLMNOPQSTUVWXYZ\")->PrintLine(); # false, no r\n IsPangram(\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\")->PrintLine(); # false, no m\n IsPangram(\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\")->PrintLine(); # true\n IsPangram(\"\")->PrintLine(); # false\n }\n }\n}\n","language":"Objeck"},{"code":"let pangram str =\n let ar = Array.make 26 false in\n String.iter (function\n | 'a'..'z' as c -> ar.(Char.code c - Char.code 'a') <- true\n | _ -> ()\n ) (String.lowercase str);\n Array.fold_left ( && ) true ar\n","language":"OCaml"},{"code":"let check str =\n Printf.printf \" %b -- %s\\n\" (pangram str) str\n\nlet () =\n check \"this is a sentence\";\n check \"The quick brown fox jumps over the lazy dog.\";\n;;\n","language":"OCaml"},{"code":"declare\n fun {IsPangram Xs}\n {List.sub\n {List.number &a &z 1}\n {Sort {Map Xs Char.toLower} Value.'<'}}\n end\nin\n {Show {IsPangram \"The quick brown fox jumps over the lazy dog.\"}}\n","language":"Oz"},{"code":"pangram(s)={\n s=vecsort(Vec(s),,8);\n for(i=97,122,\n if(!setsearch(s,Strchr(i)) && !setsearch(s,Strchr(i-32)),\n return(0)\n )\n );\n 1\n};\n\npangram(\"The quick brown fox jumps over the lazy dog.\")\npangram(\"The quick brown fox jumps over the lazy doe.\")\n","language":"PARI-GP"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nsub pangram1 {\n my($str,@set) = @_;\n use List::MoreUtils 'all';\n all { $str =~ /$_/i } @set;\n}\n\nsub pangram2 {\n my($str,@set) = @_;\n '' eq (join '',@set) =~ s/[$str]//gir;\n}\n\nmy @alpha = 'a' .. 'z';\n\nfor (\n 'Cozy Lummox Gives Smart Squid Who Asks For Job Pen.',\n 'Crabby Lummox Gives Smart Squid Who Asks For Job Pen.'\n) {\n say pangram1($_,@alpha) ? 'Yes' : 'No';\n say pangram2($_,@alpha) ? 'Yes' : 'No';\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pangram</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">az</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">26</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">lower</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #008000;\">'a'</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #008000;\">'z'</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">az</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">26</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">az</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">az</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">96</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">checks</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"The quick brown fox jumped over the lazy dog\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"The quick brown fox jumps over the lazy dog\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\".!$\\\"AbCdEfghijklmnoprqstuvwxyz\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"THE FIVE BOXING WIZARDS DUMP QUICKLY.\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"THE FIVE BOXING WIZARDS JUMP QUICKLY.\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"HEAVY BOXES PERFORM WALTZES AND JIGS.\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS.\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"Big fjiords vex quick waltz nymph\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"The quick onyx goblin jumps over the lazy dwarf.\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">\"no\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">checks</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ci</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">checks</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pangram</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ci</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%-50s - %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">ci</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"yes\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">\"no \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"include ..\\Utilitys.pmt\n\ndef pangram?\n\tlower \"abcdefghijklmnopqrstuvwxyz\" swap remove len not nip\nenddef\n\n\"The quick brown fox jumps over the lazy dog.\" pangram?\n\"This is a test\" pangram?\n\"NOPQRSTUVWXYZ abcdefghijklm\" pangram?\n\"abcdefghijklopqrstuvwxyz\" pangram?\n\npstack\n","language":"Phixmonti"},{"code":"function isPangram($text) {\n foreach (str_split($text) as $c) {\n if ($c >= 'a' && $c <= 'z')\n $bitset |= (1 << (ord($c) - ord('a')));\n else if ($c >= 'A' && $c <= 'Z')\n $bitset |= (1 << (ord($c) - ord('A')));\n }\n return $bitset == 0x3ffffff;\n}\n\n$test = array(\n \"the quick brown fox jumps over the lazy dog\",\n \"the quick brown fox jumped over the lazy dog\",\n \"ABCDEFGHIJKLMNOPQSTUVWXYZ\",\n \"ABCDEFGHIJKL.NOPQRSTUVWXYZ\",\n \"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\"\n);\n\nforeach ($test as $str)\n echo \"$str : \", isPangram($str) ? 'T' : 'F', '</br>';\n","language":"PHP"},{"code":"function is_pangram( $sentence ) {\n\n // define \"alphabet\"\n $alpha = range( 'a', 'z' );\n\n // split lowercased string into array\n $a_sentence = str_split( strtolower( $sentence ) );\n\n // check that there are no letters present in alpha not in sentence\n return empty( array_diff( $alpha, $a_sentence ) );\n\n}\n\n$tests = array(\n \"The quick brown fox jumps over the lazy dog.\",\n \"The brown fox jumps over the lazy dog.\",\n \"ABCDEFGHIJKL.NOPQRSTUVWXYZ\",\n \"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\",\n \"How vexingly quick daft zebras jump\",\n \"Is hotdog?\",\n \"How razorback-jumping frogs can level six piqued gymnasts!\"\n);\n\nforeach ( $tests as $txt ) {\n echo '\"', $txt, '\"', PHP_EOL;\n echo is_pangram( $txt ) ? \"Yes\" : \"No\", PHP_EOL, PHP_EOL;\n}\n","language":"PHP"},{"code":"go =>\n S1 = \"The quick brown fox jumps over the lazy dog\",\n S2 = \"The slow brown fox jumps over the lazy dog\",\n println([S1, is_pangram(S1)]),\n println([S2, is_pangram(S2)]),\n nl,\n println(\"With missing chars:\"),\n println([S1, is_pangram2(S1)]),\n println([S2, is_pangram2(S2)]),\n nl.\n\n% Check if S is a pangram and get the missing chars\nis_pangram(S) = P =>\n Lower = S.to_lowercase,\n Alpha = [chr(I+96) : I in 1..26],\n foreach(A in Alpha) membchk(A,Lower) end -> P = true ; P = false.\n\n% Check if S is a pangram and get the missing chars (if any)\nis_pangram2(S) = [pangram=cond(Missing==[],true,false),missing=Missing] =>\n Lower = S.to_lowercase,\n Missing = [A : A in [chr(I+96) : I in 1..26], not membchk(A,Lower)].\n","language":"Picat"},{"code":"(de isPangram (Str)\n (not\n (diff\n '`(chop \"abcdefghijklmnopqrstuvwxyz\")\n (chop (lowc Str)) ) ) )\n","language":"PicoLisp"},{"code":"test_pangram: procedure options (main);\n\nis_pangram: procedure() returns (bit(1) aligned);\n\n declare text character (200) varying;\n declare c character (1);\n\n get edit (text) (L);\n put skip list (text);\n\n text = lowercase(text);\n\n do c = 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',\n 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',\n 'v', 'w', 'x', 'y', 'z';\n if index(text, c) = 0 then return ('0'b);\n end;\n return ('1'b);\nend is_pangram;\n\n put skip list ('Please type a sentence');\n\n if is_pangram() then\n put skip list ('The sentence is a pangram.');\n else\n put skip list ('The sentence is not a pangram.');\n\nend test_pangram;\n","language":"PL-I"},{"code":"function Test-Pangram ( [string]$Text, [string]$Alphabet = 'abcdefghijklmnopqrstuvwxyz' )\n {\n $Text = $Text.ToLower()\n $Alphabet = $Alphabet.ToLower()\n\n $IsPangram = @( $Alphabet.ToCharArray() | Where-Object { $Text.Contains( $_ ) } ).Count -eq $Alphabet.Length\n\n return $IsPangram\n }\n\nTest-Pangram 'The quick brown fox jumped over the lazy dog.'\nTest-Pangram 'The quick brown fox jumps over the lazy dog.'\nTest-Pangram 'Съешь же ещё этих мягких французских булок, да выпей чаю' 'абвгдежзийклмнопрстуфхцчшщъыьэюяё'\n","language":"PowerShell"},{"code":"Function Test-Pangram ( [string]$Text, [string]$Alphabet = 'abcdefghijklmnopqrstuvwxyz' )\n{\n $alSet = [Collections.Generic.HashSet[char]]::new($Alphabet.ToLower())\n $textSet = [Collections.Generic.HashSet[char]]::new($Text.ToLower())\n\n $alSet.ExceptWith($textSet) # remove text chars from the alphabet\n\n return $alSet.Count -eq 0 # any alphabet letters still remaining?\n}\n","language":"PowerShell"},{"code":"pangram(L) :-\n\tnumlist(0'a, 0'z, Alphabet),\n\tforall(member(C, Alphabet), member(C, L)).\n\npangram_example :-\n\tL1 = \"the quick brown fox jumps over the lazy dog\",\n\t( pangram(L1) -> R1= ok; R1 = ko),\n\tformat('~s --> ~w ~n', [L1,R1]),\n\n\tL2 = \"the quick brown fox jumped over the lazy dog\",\n\t( pangram(L2) -> R2 = ok; R2 = ko),\n\tformat('~s --> ~w ~n', [L2, R2]).\n","language":"Prolog"},{"code":"Procedure IsPangram_fast(String$)\n String$ = LCase(string$)\n char_a=Asc(\"a\")\n ; sets bits in a variable if a letter is found, reads string only once\n For a = 1 To Len(string$)\n char$ = Mid(String$, a, 1)\n pos = Asc(char$) - char_a\n check.l | 1 << pos\n Next\n If check & $3FFFFFF = $3FFFFFF\n ProcedureReturn 1\n EndIf\n ProcedureReturn 0\nEndProcedure\n\nProcedure IsPangram_simple(String$)\n String$ = LCase(string$)\n found = 1\n For a = Asc(\"a\") To Asc(\"z\")\n ; searches for every letter in whole string\n If FindString(String$, Chr(a), 0) = 0\n found = 0\n EndIf\n Next\n ProcedureReturn found\nEndProcedure\n\nDebug IsPangram_fast(\"The quick brown fox jumps over lazy dogs.\")\nDebug IsPangram_simple(\"The quick brown fox jumps over lazy dogs.\")\nDebug IsPangram_fast(\"No pangram\")\nDebug IsPangram_simple(\"No pangram\")\n","language":"PureBasic"},{"code":"import string, sys\nif sys.version_info[0] < 3:\n input = raw_input\n\ndef ispangram(sentence, alphabet=string.ascii_lowercase):\n alphaset = set(alphabet)\n return alphaset <= set(sentence.lower())\n\nprint ( ispangram(input('Sentence: ')) )\n","language":"Python"},{"code":"DECLARE FUNCTION IsPangram! (sentence AS STRING)\n\nDIM x AS STRING\n\nx = \"My dog has fleas.\"\nGOSUB doIt\nx = \"The lazy dog jumps over the quick brown fox.\"\nGOSUB doIt\nx = \"Jackdaws love my big sphinx of quartz.\"\nGOSUB doIt\nx = \"What's a jackdaw?\"\nGOSUB doIt\n\nEND\n\ndoIt:\n PRINT IsPangram!(x), x\n RETURN\n\nFUNCTION IsPangram! (sentence AS STRING)\n 'returns -1 (true) if sentence is a pangram, 0 (false) otherwise\n DIM l AS INTEGER, s AS STRING, t AS INTEGER\n DIM letters(25) AS INTEGER\n\n FOR l = 1 TO LEN(sentence)\n s = UCASE$(MID$(sentence, l, 1))\n SELECT CASE s\n CASE \"A\" TO \"Z\"\n t = ASC(s) - 65\n letters(t) = 1\n END SELECT\n NEXT\n\n FOR l = 0 TO 25\n IF letters(l) < 1 THEN\n IsPangram! = 0\n EXIT FUNCTION\n END IF\n NEXT\n\n IsPangram! = -1\nEND FUNCTION\n","language":"QBasic"},{"code":" [ dup char A char [ within\n swap char a char { within\n or ] is letter ( c --> b )\n\n [ 0 26 of swap witheach\n [ dup letter iff\n [ 1 unrot lower\n char a - poke ]\n else drop ]\n 0 swap find 26 = ] is pangram ( $ --> b )\n\n $ \"This is a sentence.\" pangram echo cr ( 0 )\n $ \"The five boxing wizards jumped quickly.\" pangram echo cr ( 1 )\n","language":"Quackery"},{"code":"checkPangram <- function(sentence){\n my.letters <- tolower(unlist(strsplit(sentence, \"\")))\n is.pangram <- all(letters %in% my.letters)\n\n if (is.pangram){\n cat(\"\\\"\", sentence, \"\\\" is a pangram! \\n\", sep=\"\")\n } else {\n cat(\"\\\"\", sentence, \"\\\" is not a pangram! \\n\", sep=\"\")\n }\n}\n","language":"R"},{"code":"#lang racket\n(define (pangram? str)\n (define chars (regexp-replace* #rx\"[^a-z]+\" (string-downcase str) \"\"))\n (= 26 (length (remove-duplicates (string->list chars)))))\n(pangram? \"The quick Brown Fox jumps over the Lazy Dog\")\n","language":"Racket"},{"code":"constant Eng = set 'a' .. 'z';\nconstant Cyr = (set 'а' .. 'ё') (-) (set 'ъ', 'ѐ');\nconstant Hex = set 'a' .. 'f';\n\nsub pangram($str, Set $alpha = Eng) {\n $alpha ⊆ $str.lc.comb\n}\n\nsay pangram(\"The quick brown fox jumps over the lazy dog.\");\nsay pangram(\"My dog has fleas.\");\nsay pangram(\"My dog has fleas.\", Hex);\nsay pangram(\"My dog backs fleas.\", Hex);\nsay pangram \"Съешь же ещё этих мягких французских булок, да выпей чаю\", Cyr;\n","language":"Raku"},{"code":"'abcdefghijklmnopqrstuvwxyz 'FULL s:const\n'__________________________ 'TEST s:const\n:s:pangram? (s-f)\n '__________________________ &TEST #26 copy\n s:to-lower [ c:letter? ] s:filter\n [ dup $a - &TEST + store ] s:for-each\n &TEST &FULL s:eq? ;\n","language":"Retro"},{"code":"/*REXX program verifies if an entered/supplied string (sentence) is a pangram. */\n@abc= 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' /*a list of all (Latin) capital letters*/\n\n do forever; say /*keep promoting 'til null (or blanks).*/\n say '──────── Please enter a pangramic sentence (or a blank to quit):'; say\n pull y /*this also uppercases the Y variable.*/\n if y='' then leave /*if nothing entered, then we're done.*/\n absent= space( translate( @abc, , y), 0) /*obtain a list of any absent letters. */\n if absent=='' then say \"──────── Sentence is a pangram.\"\n else say \"──────── Sentence isn't a pangram, missing: \" absent\n say\n end /*forever*/\n\nsay '──────── PANGRAM program ended. ────────' /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"pangram = 0\ns = \"The quick brown fox jumps over the lazy dog.\"\nsee \"\" + pangram(s) + \" \" + s + nl\n\ns = \"My dog has fleas.\"\nsee \"\" + pangram(s) + \" \" + s + nl\n\nfunc pangram str\n str = lower(str)\n for i = ascii(\"a\") to ascii(\"z\")\n bool = substr(str, char(i)) > 0\n pangram = pangram + bool\n next\n pan = (pangram = 26)\n return pan\n","language":"Ring"},{"code":"def pangram?(sentence)\n s = sentence.downcase\n ('a'..'z').all? {|char| s.include? (char) }\nend\n\np pangram?('this is a sentence') # ==> false\np pangram?('The quick brown fox jumps over the lazy dog.') # ==> true\n","language":"Ruby"},{"code":"s$ = \"The quick brown fox jumps over the lazy dog.\"\nPrint pangram(s$);\" \";s$\n\ns$ = \"My dog has fleas.\"\nPrint pangram(s$);\" \";s$\n\nfunction pangram(str$)\n str$ = lower$(str$)\n for i = asc(\"a\") to asc(\"z\")\n pangram = pangram + (instr(str$, chr$(i)) <> 0)\n next i\npangram = (pangram = 26)\nend function\n","language":"Run-BASIC"},{"code":"#![feature(test)]\n\nextern crate test;\n\nuse std::collections::HashSet;\n\npub fn is_pangram_via_bitmask(s: &str) -> bool {\n\n // Create a mask of set bits and convert to false as we find characters.\n let mut mask = (1 << 26) - 1;\n\n for chr in s.chars() {\n let val = chr as u32 & !0x20; /* 0x20 converts lowercase to upper */\n if val <= 'Z' as u32 && val >= 'A' as u32 {\n mask = mask & !(1 << (val - 'A' as u32));\n }\n }\n\n mask == 0\n}\n\npub fn is_pangram_via_hashset(s: &str) -> bool {\n\n // Insert lowercase letters into a HashSet, then check if we have at least 26.\n let letters = s.chars()\n .flat_map(|chr| chr.to_lowercase())\n .filter(|&chr| chr >= 'a' && chr <= 'z')\n .fold(HashSet::new(), |mut letters, chr| {\n letters.insert(chr);\n letters\n });\n\n letters.len() == 26\n}\n\npub fn is_pangram_via_sort(s: &str) -> bool {\n\n // Copy chars into a vector, convert to lowercase, sort, and remove duplicates.\n let mut chars: Vec<char> = s.chars()\n .flat_map(|chr| chr.to_lowercase())\n .filter(|&chr| chr >= 'a' && chr <= 'z')\n .collect();\n\n chars.sort();\n chars.dedup();\n\n chars.len() == 26\n}\n\nfn main() {\n\n let examples = [\"The quick brown fox jumps over the lazy dog\",\n \"The quick white cat jumps over the lazy dog\"];\n\n for &text in examples.iter() {\n let is_pangram_sort = is_pangram_via_sort(text);\n println!(\"Is \\\"{}\\\" a pangram via sort? - {}\", text, is_pangram_sort);\n\n let is_pangram_bitmask = is_pangram_via_bitmask(text);\n println!(\"Is \\\"{}\\\" a pangram via bitmask? - {}\",\n text,\n is_pangram_bitmask);\n\n let is_pangram_hashset = is_pangram_via_hashset(text);\n println!(\"Is \\\"{}\\\" a pangram via bitmask? - {}\",\n text,\n is_pangram_hashset);\n }\n}\n","language":"Rust"},{"code":"def is_pangram(sentence: String) = sentence.toLowerCase.filter(c => c >= 'a' && c <= 'z').toSet.size == 26\n","language":"Scala"},{"code":"scala> is_pangram(\"This is a sentence\")\nres0: Boolean = false\n\nscala> is_pangram(\"The quick brown fox jumps over the lazy dog\")\nres1: Boolean = true\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func boolean: isPangram (in string: stri) is func\n result\n var boolean: isPangram is FALSE;\n local\n var char: ch is ' ';\n var set of char: usedChars is (set of char).value;\n begin\n for ch range lower(stri) do\n if ch in {'a' .. 'z'} then\n incl(usedChars, ch);\n end if;\n end for;\n isPangram := usedChars = {'a' .. 'z'};\n end func;\n\nconst proc: main is func\n begin\n writeln(isPangram(\"This is a test\"));\n writeln(isPangram(\"The quick brown fox jumps over the lazy dog\"));\n writeln(isPangram(\"NOPQRSTUVWXYZ abcdefghijklm\"));\n writeln(isPangram(\"abcdefghijklopqrstuvwxyz\")); # Missing m, n\n end func;\n","language":"Seed7"},{"code":"define Eng = 'a'..'z';\ndefine Hex = 'a'..'f';\ndefine Cyr = %w(а б в г д е ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я ё);\n\nfunc pangram(str, alpha=Eng) {\n var lstr = str.lc;\n alpha.all {|c| lstr.contains(c) };\n}\n\nsay pangram(\"The quick brown fox jumps over the lazy dog.\");\nsay pangram(\"My dog has fleas.\");\nsay pangram(\"My dog has fleas.\", Hex);\nsay pangram(\"My dog backs fleas.\", Hex);\nsay pangram(\"Съешь же ещё этих мягких французских булок, да выпей чаю\", Cyr);\n","language":"Sidef"},{"code":" 10 LET A$=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n 20 LET L=26\n 30 INPUT P$\n 40 IF LEN P$<26 THEN GOTO 170\n 50 FAST\n 60 LET C=1\n 70 IF P$(C)<\"A\" OR P$(C)>\"Z\" THEN GOTO 120\n 80 IF A$(CODE P$(C)-37)=\" \" THEN GOTO 120\n 90 LET A$(CODE P$(C)-37)=\" \"\n100 LET L=L-1\n110 IF L=0 THEN GOTO 150\n120 IF C=LEN P$ THEN GOTO 170\n130 LET C=C+1\n140 GOTO 70\n150 PRINT \"PANGRAM\"\n160 GOTO 180\n170 PRINT \"NOT A PANGRAM\"\n180 SLOW\n","language":"Sinclair-ZX81-BASIC"},{"code":"!String methodsFor: 'testing'!\nisPangram\n\t^((self collect: [:c | c asUppercase]) select: [:c | c >= $A and: [c <= $Z]]) asSet size = 26\n","language":"Smalltalk"},{"code":"'The quick brown fox jumps over the lazy dog.' isPangram\n","language":"Smalltalk"},{"code":" define('pangram(str)alfa,c') :(pangram_end)\npangram str = replace(str,&ucase,&lcase)\n alfa = &lcase\npgr_1 alfa len(1) . c = :f(return)\n str c :s(pgr_1)f(freturn)\npangram_end\n\n define('panchk(str)tf') :(panchk_end)\npanchk output = str\n tf = 'False'; tf = pangram(str) 'True'\n output = 'Pangram: ' tf :(return)\npanchk_end\n\n* # Test and display\n panchk(\"The quick brown fox jumped over the lazy dogs.\")\n panchk(\"My girl wove six dozen plaid jackets before she quit.\")\n panchk(\"This 41-character string: it's a pangram!\")\nend\n","language":"SNOBOL4"},{"code":"import Foundation\n\nlet str = \"the quick brown fox jumps over the lazy dog\"\n\nfunc isPangram(str:String) -> Bool {\n let stringArray = Array(str.lowercaseString)\n for char in \"abcdefghijklmnopqrstuvwxyz\" {\n if (find(stringArray, char) == nil) {\n return false\n }\n }\n return true\n}\n\nisPangram(str) // True\nisPangram(\"Test string\") // False\n","language":"Swift"},{"code":"func isPangram(str: String) -> Bool {\n let (char, alph) = (Set(str.characters), \"abcdefghijklmnopqrstuvwxyz\".characters)\n return !alph.contains {!char.contains($0)}\n}\n","language":"Swift"},{"code":"proc pangram? {sentence} {\n set letters [regexp -all -inline {[a-z]} [string tolower $sentence]]\n expr {\n [llength [lsort -unique $letters]] == 26\n }\n}\nputs [pangram? \"This is a sentence\"]; # ==> false\nputs [pangram? \"The quick brown fox jumps over the lazy dog.\"]; # ==> true\n","language":"Tcl"},{"code":":Prompt Str1\n:For(L,1,26\n:If not(inString(Str1,sub(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",L,1))\n:L=28\n:End\n:If L<28\n:Disp \"IS A PANGRAM\"\n","language":"TI-83-BASIC"},{"code":"$$ MODE TUSCRIPT,{}\nalfabet=\"abcdefghijklmnopqrstuvwxyz\"\nsentences = *\nDATA The quick brown fox jumps over the lazy dog\nDATA the quick brown fox falls over the lazy dog\nLOOP s=sentences\n getchars =STRINGS (s,\" {&a} \")\n sortchars =ALPHA_SORT (getchars)\n reducechars =REDUCE (sortchars)\n chars_in_s =EXCHANGE (reducechars,\" ' \")\n IF (chars_in_s==alfabet) PRINT \" pangram: \",s\n IF (chars_in_s!=alfabet) PRINT \"no pangram: \",s\nENDLOOP\n","language":"TUSCRIPT"},{"code":"@/.*[Aa].*&.*[Bb].*&.*[Cc].*&.*[Dd].*& \\\n .*[Ee].*&.*[Ff].*&.*[Gg].*&.*[Hh].*& \\\n .*[Ii].*&.*[Jj].*&.*[Kk].*&.*[Ll].*& \\\n .*[Mm].*&.*[Nn].*&.*[Oo].*&.*[Pp].*& \\\n .*[Qq].*&.*[Rr].*&.*[Ss].*&.*[Tt].*& \\\n .*[Uu].*&.*[Vv].*&.*[Ww].*&.*[Xx].*& \\\n .*[Yy].*&.*[Zz].*/\n","language":"TXR"},{"code":"function is_pangram {\n typeset alphabet=abcdefghijklmnopqrstuvwxyz\n typeset -l string=$*\n while [[ -n $string && -n $alphabet ]]; do\n typeset ch=${string%%${string#?}}\n string=${string#?}\n alphabet=${alphabet/$ch}\n done\n [[ -z $alphabet ]]\n}\n","language":"UNIX-Shell"},{"code":"#import std\n\nis_pangram = ^jZ^(!@l,*+ @rlp -:~&) ~=`A-~ letters\n","language":"Ursala"},{"code":"#cast %bL\n\ntest =\n\nis_pangram* <\n 'The quick brown fox jumps over the lazy dog',\n 'this is not a pangram'>\n","language":"Ursala"},{"code":"Function pangram2(s As String) As Boolean\n Const sKey As String = \"abcdefghijklmnopqrstuvwxyz\"\n Dim sLow As String\n Dim i As Integer\n\n sLow = LCase(s)\n For i = 1 To 26\n If InStr(sLow, Mid(sKey, i, 1)) = 0 Then\n pangram2 = False\n Exit Function\n End If\n Next\n pangram2 = True\nEnd Function\n","language":"VBA"},{"code":"function pangram( s )\n\tdim i\n\tdim sKey\n\tdim sChar\n\tdim nOffset\n\tsKey = \"abcdefghijklmnopqrstuvwxyz\"\n\tfor i = 1 to len( s )\n\t\tsChar = lcase(mid(s,i,1))\n\t\tif sChar <> \" \" then\n\t\t\tif instr(sKey, sChar) then\n\t\t\t\tnOffset = asc( sChar ) - asc(\"a\") + 1\n\t\t\t\tif nOffset > 1 then\n\t\t\t\t\tsKey = left(sKey, nOffset - 1) & \" \" & mid( sKey, nOffset + 1)\n\t\t\t\telse\n\t\t\t\t\tsKey = \" \" & mid( sKey, nOffset + 1)\n\t\t\t\tend if\n\t\t\tend if\n\t\tend if\n\tnext\n\tpangram = ( ltrim(sKey) = vbnullstring )\nend function\n\nfunction eef( bCond, exp1, exp2 )\n\tif bCond then\n\t\teef = exp1\n\telse\n\t\teef = exp2\n\tend if\nend function\n","language":"VBScript"},{"code":"wscript.echo eef(pangram(\"a quick brown fox jumps over the lazy dog\"), \"is a pangram\", \"is not a pangram\")\nwscript.echo eef(pangram(\"\"), \"is a pangram\", \"is not a pangram\")\"\n","language":"VBScript"},{"code":"10 I=1\n20 :I)=0\n30 I=I+1\n40 #=26>I*20\n50 ?=\"Enter sentence: \";\n60 C=$\n70 #=C=13*120\n80 C=C<97*32+C-96\n90 #=C>27*60\n100 :C)=1\n110 #=60\n120 ?=\"\"\n130 I=1\n140 N=0\n150 N=N+:I)\n160 I=I+1\n170 #=26>I*150\n180 #=N=26*200\n190 ?=\"not \";\n200 ?=\"a pangram\"\n","language":"VTL-2"},{"code":"import \"./str\" for Str\n\nvar isPangram = Fn.new { |s|\n s = Str.lower(s)\n var used = List.filled(26, false)\n for (cp in s.codePoints) {\n if (cp >= 97 && cp <= 122) used[cp-97] = true\n }\n for (u in used) if (!u) return false\n return true\n}\n\nvar candidates = [\n \"The quick brown fox jumps over the lazy dog.\",\n \"New job: fix Mr. Gluck's hazy TV, PDQ!\",\n \"Peter Piper picked a peck of pickled peppers.\",\n \"Sphinx of black quartz, judge my vow.\",\n \"Foxy diva Jennifer Lopez wasn’t baking my quiche.\",\n \"Grumpy wizards make a toxic stew for the jovial queen.\"\n]\n\nSystem.print(\"Are the following pangrams?\")\nfor (candidate in candidates) {\n System.print(\" %(candidate) -> %(isPangram.call(candidate))\")\n}\n","language":"Wren"},{"code":"include c:\\cxpl\\codes; \\intrinsic 'code' declarations\nstring 0; \\use zero-terminated strings\n\nfunc StrLen(Str); \\Return number of characters in an ASCIIZ string\nchar Str;\nint I;\nfor I:= 0 to -1>>1-1 do\n if Str(I) = 0 then return I;\n\nfunc Pangram(S);\nchar S;\nint A, I, C;\n[A:= 0;\nfor I:= 0 to StrLen(S)-1 do\n [C:= S(I);\n if C>=^A & C<=^Z then C:= C or $20;\n if C>=^a & C<=^z then [C:= C - ^a; A:= A or 1<<C];\n ];\nreturn A = $3FFFFFF;\n]; \\Pangram\n\nint Sentence, I;\n[Sentence:=\n [\"The quick brown fox jumps over the lazy dog.\",\n \"Pack my box with five dozen liquor jugs.\",\n \"Now is the time for all good men to come to the aid of their country.\"];\nfor I:= 0 to 3-1 do\n [Text(0, if Pangram(Sentence(I)) then \"yes\" else \"no\");\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"sub isPangram$(t$, l1$)\n\tlocal lt, ll, r$, i, cc, ic\n\n\tif numparams = 1 then\n\t\tl1$ = \"abcdefghijklmnopqrstuvwxyz\"\n\tend if\n\n\tt$ = lower$(t$)\n\tll = len(l1$)\n\tfor i = 1 to ll\n\t\tr$ = r$ + \" \"\n\tnext\n\tlt = len(t$)\n\tcc = asc(\"a\")\n\n\tfor i = 1 to lt\n\t\tic = asc(mid$(t$, i, 1)) - cc + 1\n\t\tif ic > 0 and ic <= ll then\n\t\t\tmid$(r$, ic, 1) = chr$(ic + cc - 1)\n\t\tend if\n\tnext i\n\n\tif l1$ = r$ then return \"true\" else return \"false\" end if\n\nend sub\n\nprint isPangram$(\"The quick brown fox jumps over the lazy dog.\") // --> true\nprint isPangram$(\"The quick brown fox jumped over the lazy dog.\") // --> false\nprint isPangram$(\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\nSTUVWXYZ\") // --> true\n","language":"Yabasic"},{"code":"var letters=[\"a\"..\"z\"].pump(String); //-->\"abcdefghijklmnopqrstuvwxyz\"\nfcn isPangram(text){(not (letters-text.toLower()))}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- String manipulation\\nfrom: http://rosettacode.org/wiki/Pangram_checker\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A pangram is a sentence that contains all the letters of the English alphabet at least once.\\n\\nFor example: ''The quick brown fox jumps over the lazy dog''.\\n\\n\\n;Task:\\nWrite a function or method to check a sentence to see if it is a [[wp:Pangram|pangram]] (or not) and show its use.\\n\\n\\n;Related tasks:\\n:* [https://rosettacode.org/wiki/Determine_if_a_string_has_all_the_same_characters determine if a string has all the same characters]\\n:* [https://rosettacode.org/wiki/Determine_if_a_string_has_all_unique_characters determine if a string has all unique characters]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F is_pangram(sentence)\\n R Set(sentence.lowercase().filter(ch -> ch C ‘a’..‘z’)).len == 26\\n\\nL(sentence) [‘The quick brown fox jumps over the lazy dog.’,\\n ‘The quick brown fox jumped over the lazy dog.’]\\n print(‘'#.' is #.a pangram’.format(sentence, ‘not ’ * !is_pangram(sentence)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Pangram RC 11/08/2015\\nPANGRAM CSECT\\n USING PANGRAM,R12\\n LR R12,R15\\nBEGIN LA R9,SENTENCE\\n LA R6,4\\nLOOPI LA R10,ALPHABET loop on sentences\\n LA R7,26\\nLOOPJ LA R5,0 loop on letters\\n LR R11,R9\\n LA R8,60\\nLOOPK MVC BUFFER+1(1),0(R10) loop in sentence\\n CLC 0(1,R10),0(R11) if alphabet[j=sentence[i]\\n BNE NEXTK\\n LA R5,1 found\\nNEXTK LA R11,1(R11) next character\\n BCT R8,LOOPK\\n LTR R5,R5 if found\\n BNZ NEXTJ\\n MVI BUFFER,C'?' not found\\n B PRINT\\nNEXTJ LA R10,1(R10) next letter\\n BCT R7,LOOPJ\\n MVC BUFFER(2),=CL2'OK'\\nPRINT MVC BUFFER+3(60),0(R9)\\n XPRNT BUFFER,80\\nNEXTI LA R9,60(R9) next sentence\\n BCT R6,LOOPI\\nRETURN XR R15,R15\\n BR R14\\nALPHABET DC CL26'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\nSENTENCE DC CL60'THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.'\\n DC CL60'THE FIVE BOXING WIZARDS DUMP QUICKLY.'\\n DC CL60'HEAVY BOXES PERFORM WALTZES AND JIGS.'\\n DC CL60'PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS.'\\nBUFFER DC CL80' '\\n YREGS\\n END PANGRAM\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"(defun contains-each (needles haystack)\\n (if (endp needles)\\n t\\n (and (member (first needles) haystack)\\n (contains-each (rest needles) haystack))))\\n\\n(defun pangramp (str)\\n (contains-each (coerce \\\"abcdefghijklmnopqrstuvwxyz\\\" 'list)\\n (coerce (string-downcase str) 'list)))\\n\",\n \"language\": \"ACL2\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:CHARTEST.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE CHAR_COUNT=\\\"26\\\"\\n\\nBYTE FUNC IsPangram(CHAR ARRAY t)\\n BYTE ARRAY tab(CHAR_COUNT)\\n BYTE i,c\\n\\n FOR i=0 TO CHAR_COUNT-1\\n DO tab(i)=0 OD\\n\\n FOR i=1 TO t(0)\\n DO\\n c=ToLower(t(i))\\n IF c>='a AND c<='z THEN\\n tab(c-'a)=1\\n FI\\n OD\\n\\n FOR i=0 TO CHAR_COUNT-1\\n DO\\n IF tab(i)=0 THEN\\n RETURN (0)\\n FI\\n OD\\nRETURN (1)\\n\\nPROC Test(CHAR ARRAY t)\\n BYTE res\\n\\n res=IsPangram(t)\\n PrintF(\\\"\\\"\\\"%S\\\"\\\" is \\\",t)\\n IF res=0 THEN\\n Print(\\\"not \\\")\\n FI\\n PrintE(\\\"a pangram.\\\")\\n PutE()\\nRETURN\\n\\nPROC Main()\\n Put(125) PutE() ;clear screen\\n Test(\\\"The quick brown fox jumps over the lazy dog.\\\")\\n Test(\\\"QwErTyUiOpAsDfGhJkLzXcVbNm\\\")\\n Test(\\\"Not a pangram\\\")\\n Test(\\\"\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"function pangram(k:string):Boolean {\\n var lowerK:String = k.toLowerCase();\\n var has:Object = {}\\n\\n for (var i:Number=0; i<=k.length-1; i++) {\\n has[lowerK.charAt(i)] = true;\\n }\\n\\n var result:Boolean = true;\\n\\n for (var ch:String='a'; ch <= 'z'; ch=String.fromCharCode(ch.charCodeAt(0)+1)) {\\n result = result && has[ch]\\n }\\n\\n return result || false;\\n}\\n\",\n \"language\": \"ActionScript\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Strings.Maps; use Ada.Strings.Maps;\\nwith Ada.Characters.Handling; use Ada.Characters.Handling;\\nprocedure pangram is\\n\\n function ispangram(txt: String) return Boolean is\\n (Is_Subset(To_Set(Span => ('a','z')), To_Set(To_Lower(txt))));\\n\\nbegin\\n put_line(Boolean'Image(ispangram(\\\"This is a test\\\")));\\n put_line(Boolean'Image(ispangram(\\\"The quick brown fox jumps over the lazy dog\\\")));\\n put_line(Boolean'Image(ispangram(\\\"NOPQRSTUVWXYZ abcdefghijklm\\\")));\\n put_line(Boolean'Image(ispangram(\\\"abcdefghijklopqrstuvwxyz\\\"))); --Missing m, n\\nend pangram;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\nwith Ada.Characters.Handling; use Ada.Characters.Handling;\\nprocedure pangram is\\n\\n function ispangram(txt : in String) return Boolean is\\n (for all Letter in Character range 'a'..'z' =>\\n (for some Char of txt => To_Lower(Char) = Letter));\\n\\nbegin\\n put_line(Boolean'Image(ispangram(\\\"This is a test\\\")));\\n put_line(Boolean'Image(ispangram(\\\"The quick brown fox jumps over the lazy dog\\\")));\\n put_line(Boolean'Image(ispangram(\\\"NOPQRSTUVWXYZ abcdefghijklm\\\")));\\n put_line(Boolean'Image(ispangram(\\\"abcdefghijklopqrstuvwxyz\\\"))); --Missing m, n\\nend pangram;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# init pangram: #\\nINT la = ABS \\\"a\\\", lz = ABS \\\"z\\\";\\nINT ua = ABS \\\"A\\\", uz = ABS \\\"Z\\\";\\nIF lz-la+1 > bits width THEN\\n put(stand error, \\\"Exception: insufficient bits in word for task\\\");\\n stop\\nFI;\\n\\nPROC is a pangram = (STRING test)BOOL: (\\n BITS a2z := BIN(ABS(2r1 SHL (lz-la))-1); # assume: ASCII & Binary #\\n FOR i TO UPB test WHILE\\n INT c = ABS test[i];\\n IF la <= c AND c <= lz THEN\\n a2z := a2z AND NOT(2r1 SHL (c-la))\\n ELIF ua <= c AND c <= uz THEN\\n a2z := a2z AND NOT(2r1 SHL (c-ua))\\n FI;\\n# WHILE # a2z /= 2r0 DO\\n SKIP\\n OD;\\n a2z = 2r0\\n);\\n\\nmain:(\\n []STRING test list = (\\n \\\"Big fjiords vex quick waltz nymph\\\",\\n \\\"The quick brown fox jumps over a lazy dog\\\",\\n \\\"A quick brown fox jumps over a lazy dog\\\"\\n );\\n FOR key TO UPB test list DO\\n STRING test = test list[key];\\n IF is a pangram(test) THEN\\n print((\\\"\\\"\\\"\\\",test,\\\"\\\"\\\" is a pangram!\\\", new line))\\n FI\\n OD\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \" a←'abcdefghijklmnopqrstuvwxyz' ⍝ or ⎕ucs 96 + ⍳26 in GNU/Dyalog\\n A←'ABCDEFGHIJKLMNOPQRSTUVWXYZ' ⍝ or ⎕ucs 64 + ⍳26, or just ⎕a in Dyalog\\n\\n Pangram ← {∧/ ∨⌿ 2 26⍴(a,A) ∊ ⍵}\\n Pangram 'This should fail'\\n0\\n Pangram 'The quick brown fox jumps over the lazy dog'\\n1\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"use framework \\\"Foundation\\\" -- ( for case conversion function )\\n\\n--------------------- PANGRAM CHECKER --------------------\\n\\n-- isPangram :: String -> Bool\\non isPangram(s)\\n script charUnUsed\\n property lowerCaseString : my toLower(s)\\n on |λ|(c)\\n lowerCaseString does not contain c\\n end |λ|\\n end script\\n\\n 0 = length of filter(charUnUsed, ¬\\n \\\"abcdefghijklmnopqrstuvwxyz\\\")\\nend isPangram\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n map(isPangram, {¬\\n \\\"is this a pangram\\\", ¬\\n \\\"The quick brown fox jumps over the lazy dog\\\"})\\n\\n --> {false, true}\\nend run\\n\\n\\n-------------------- GENERIC FUNCTIONS -------------------\\n\\n-- filter :: (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 |λ|(v, i, xs) then set end of lst to v\\n end repeat\\n return lst\\n end tell\\nend filter\\n\\n\\n-- map :: (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 |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- Lift 2nd class handler function into\\n-- 1st class script wrapper\\n-- mReturn :: Handler -> Script\\non mReturn(f)\\n if class of f is script then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n-- toLower :: String -> String\\non toLower(str)\\n set ca to current application\\n ((ca's NSString's stringWithString:(str))'s ¬\\n lowercaseStringWithLocale:(ca's NSLocale's currentLocale())) as text\\nend toLower\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{false, true}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"on isPangram(txt)\\n set alphabet to \\\"abcedfghijklmnopqrstuvwxyz\\\"\\n ignoring case -- The default, but ensure it here.\\n repeat with letter in alphabet\\n if (txt does not contain letter) then return false\\n end repeat\\n end ignoring\\n\\n return true\\nend isPangram\\n\\nlocal result1, result2\\nset result1 to isPangram(\\\"The Quick Brown Fox Jumps Over The Lazy Dog\\\")\\nset result2 to isPangram(\\\"This is not a pangram\\\")\\nreturn {result1, result2}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"{true, false}\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \" 100 P$ = \\\"11111111111111111111111111\\\"\\n 110 FOR Q = 1 TO 3\\n 120 READ S$\\n 130 GOSUB 200\\\"IS PANGRAM?\\n 140 PRINT MID$ (\\\"NO YES \\\",P * 4 + 1,4)S$\\n 150 NEXT Q\\n 160 END\\n 170 DATA\\\"THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.\\\"\\n 180 DATA\\\"THE QUICK BROWN FOX JUMPED OVER THE LAZY DOG.\\\"\\n 190 DATA\\\"THE FIVE BOXING WIZARDS JUMP QUICKLY.\\\"\\n 200 P = 0:L = LEN (S$): IF NOT L THEN RETURN\\n 210 F$ = \\\"00000000000000000000000000\\\"\\n 220 FOR I = 1 TO L\\n 230 C = ASC ( MID$ (S$,I,1)):C = C - 32 * (C > 95): IF C > 64 AND C < 91 THEN J = C - 64:F$ = MID$ (F$,1,J - 1) + \\\"1\\\" + MID$ (F$,J + 1):P = F$ = P$: IF P THEN RETURN\\n 240 NEXT I\\n 250 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"chars: map 97..122 => [to :string to :char &]\\npangram?: function [sentence][\\n every? chars 'ch ->\\n in? ch sentence\\n]\\n\\nprint pangram? \\\"this is a sentence\\\"\\nprint pangram? \\\"The quick brown fox jumps over the lazy dog.\\\"\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"(* ****** ****** *)\\n//\\n#include\\n\\\"share/atspre_staload.hats\\\"\\n#include\\n\\\"share/HATS/atspre_staload_libats_ML.hats\\\"\\n//\\n(* ****** ****** *)\\n//\\nfun\\nletter_check\\n(\\ncs: string, c0: char\\n) : bool = cs.exists()(lam(c) => c0 = c)\\n//\\n(* ****** ****** *)\\n\\nfun\\nPangram_check\\n (text: string): bool = let\\n//\\nval\\nalphabet = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nval\\n((*void*)) = assertloc(length(alphabet) = 26)\\n//\\nin\\n alphabet.forall()(lam(c) => letter_check(text, c) || letter_check(text, toupper(c)))\\nend // end of [Pangram_check]\\n\\n(* ****** ****** *)\\n\\nimplement\\nmain0 () =\\n{\\n//\\nval\\ntext0 = \\\"The quick brown fox jumps over the lazy dog.\\\"\\n//\\nval-true = Pangram_check(text0)\\nval-false = Pangram_check(\\\"This is not a pangram sentence.\\\")\\n//\\n} (* end of [main0] *)\\n\\n(* ****** ****** *)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"fn is_pangram{n:nat}(s: string(n)): bool = loop(s, i2sz(0)) where {\\n val letters: arrayref(bool, 26) = arrayref_make_elt<bool>(i2sz(26), false)\\n fn check(): bool = loop(0) where {\\n fun loop{i:int | i >= 0 && i <= 26}(i: int(i)) =\\n if i < 26 then\\n if letters[i] then loop(i+1) else\\n false\\n else true\\n }\\n fun add{c:int}(c: char(c)): void =\\n if (c >= 'A') * (c <= 'Z') then letters[char2int1(c) - char2int1('A')] := true else\\n if (c >= 'a') * (c <= 'z') then letters[char2int1(c) - char2int1('a')] := true\\n fun loop{i:nat | i <= n}.<n-i>.(s: string(n), i: size_t(i)): bool =\\n if string_is_atend(s, i) then check() else\\n begin\\n add(s[i]);\\n loop(s, succ(i))\\n end\\n}\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"Gui, -MinimizeBox\\nGui, Add, Edit, w300 r5 vText\\nGui, Add, Button, x105 w100 Default, Check Pangram\\nGui, Show,, Pangram Checker\\nReturn\\n\\nGuiClose:\\n ExitApp\\nReturn\\n\\nButtonCheckPangram:\\n Gui, Submit, NoHide\\n Loop, 26\\n If Not InStr(Text, Char := Chr(64 + A_Index)) {\\n MsgBox,, Pangram, Character %Char% is missing!\\n Return\\n }\\n MsgBox,, Pangram, OK`, this is a Pangram!\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Pangram(\\\"The quick brown fox jumps over the lazy dog\\\")\\nFunc Pangram($s_String)\\nFor $i = 1 To 26\\n\\tIF Not StringInStr($s_String, Chr(64 + $i)) Then\\n\\t\\tReturn MsgBox(0,\\\"No Pangram\\\", \\\"Character \\\" & Chr(64 + $i) &\\\" is missing\\\")\\n\\tEndIf\\nNext\\nReturn MsgBox(0,\\\"Pangram\\\", \\\"Sentence is a Pangram\\\")\\nEndFunc\\n\",\n \"language\": \"AutoIt\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\nBEGIN {\\n allChars=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n print isPangram(\\\"The quick brown fox jumps over the lazy dog.\\\");\\n print isPangram(\\\"The quick brown fo.\\\");\\n}\\n\\nfunction isPangram(string) {\\n delete X;\\n for (k=1; k<length(string); k++) {\\n X[toupper(substr(string,k,1))]++; # histogram\\n }\\n for (k=1; k<=length(allChars); k++) {\\n if (!X[substr(allChars,k,1)]) return 0;\\n }\\n return 1;\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"# usage: awk -f pangram.awk -v p=\\\"The five boxing wizards dump quickly.\\\" input.txt\\n#\\n# Pangram-checker, using associative arrays and split\\nBEGIN {\\n alfa=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"; ac=split(alfa,A,\\\"\\\")\\n print \\\"# Checking for all\\\",ac,\\\"chars in '\\\" alfa \\\"' :\\\"\\n\\n print testPangram(\\\"The quick brown fox jumps over the lazy dog.\\\");\\n print testPangram(p);\\n}\\n\\n{ print testPangram($0) }\\n\\nfunction testPangram(str, c,i,S,H,hit,miss) {\\n print str \\t\\t\\t\\t\\t\\t##\\n split( toupper(str), S, \\\"\\\")\\n for (c in S) {\\n H[ S[c] ]++\\n #print c, S[c], H[ S[c] ]\\t\\t\\t\\t##\\n }\\n for (i=1; i<=ac; i++) {\\n c = A[i]\\n #printf(\\\"%2d %c : %4d\\\\n\\\", i, c, H[c] ) \\t\\t##\\n if (H[c]) { hit=hit c } else { miss=miss c }\\n }\\n print \\\"# hit:\\\",hit, \\\"# miss:\\\",miss, \\\".\\\"\\t\\t##\\n if (miss) return 0\\n return 1\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"DEF FN Pangram(x) = IIF(AMOUNT(UNIQ$(EXPLODE$(EXTRACT$(LCASE$(x), \\\"[^[:alpha:]]\\\", TRUE), 1))) = 26, TRUE, FALSE)\\n\\nPRINT Pangram(\\\"The quick brown fox jumps over the lazy dog.\\\")\\nPRINT Pangram(\\\"Jackdaws love my big sphinx of quartz.\\\")\\nPRINT Pangram(\\\"My dog has fleas.\\\")\\nPRINT Pangram(\\\"What's a jackdaw?\\\")\\nPRINT Pangram(\\\"The five boxing wizards jump quickly\\\")\\n\",\n \"language\": \"BaCon\"\n },\n {\n \"code\": \"function isPangram$(texto$)\\n longitud = Length(texto$)\\n if longitud < 26 then return \\\"is not a pangram\\\"\\n t$ = lower(texto$)\\n print \\\"'\\\"; texto$; \\\"' \\\";\\n for i = 97 to 122\\n if instr(t$, chr(i)) = 0 then return \\\"is not a pangram\\\"\\n next i\\n return \\\"is a pangram\\\"\\nend function\\n\\nprint isPangram$(\\\"The quick brown fox jumps over the lazy dog.\\\") # --> true\\nprint isPangram$(\\\"The quick brown fox jumped over the lazy dog.\\\") # --> false\\nprint isPangram$(\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\") # --> true\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\n\\t%===The Main Thing===%\\ncall :pangram \\\"The quick brown fox jumps over the lazy dog.\\\"\\ncall :pangram \\\"The quick brown fox jumped over the lazy dog.\\\"\\necho.\\npause\\nexit /b 0\\n\\n\\t%===The Function===%\\n:pangram\\nset letters=abcdefgihjklmnopqrstuvwxyz\\nset cnt=0\\nset inp=%~1\\nset str=!inp: =!\\n\\n:loop\\nset chr=!str:~%cnt%,1!\\nif \\\"!letters!\\\"==\\\"\\\" (\\n\\techo %1 is a pangram^^!\\n\\tgoto :EOF\\n)\\nif \\\"!chr!\\\"==\\\"\\\" (\\n\\techo %1 is not a pangram.\\n\\tgoto :EOF\\n)\\nset letters=!letters:%chr%=!\\nset /a cnt+=1\\ngoto loop\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" FOR test% = 1 TO 2\\n READ test$\\n PRINT \\\"\\\"\\\"\\\" test$ \\\"\\\"\\\" \\\" ;\\n IF FNpangram(test$) THEN\\n PRINT \\\"is a pangram\\\"\\n ELSE\\n PRINT \\\"is not a pangram\\\"\\n ENDIF\\n NEXT test%\\n END\\n\\n DATA \\\"The quick brown fox jumped over the lazy dog\\\"\\n DATA \\\"The five boxing wizards jump quickly\\\"\\n\\n DEF FNpangram(A$)\\n LOCAL C%\\n A$ = FNlower(A$)\\n FOR C% = ASC(\\\"a\\\") TO ASC(\\\"z\\\")\\n IF INSTR(A$, CHR$(C%)) = 0 THEN = FALSE\\n NEXT\\n = TRUE\\n\\n DEF FNlower(A$)\\n LOCAL A%, C%\\n FOR A% = 1 TO LEN(A$)\\n C% = ASCMID$(A$,A%)\\n IF C% >= 65 IF C% <= 90 MID$(A$,A%,1) = CHR$(C%+32)\\n NEXT\\n = A$\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\n// Test if s is a pangram. The ASCII character set is assumed.\\nlet pangram(s) = valof\\n$( let letters = vec 25\\n for i=0 to 25 do letters!i := false\\n for i=1 to s%0 do\\n $( let c = (s%i | 32) - 'a'\\n if c >= 0 & c < 26 then\\n letters!c := true\\n $)\\n for i=0 to 25 unless letters!i resultis false\\n resultis true\\n$)\\n\\n// Display s and whether or not it is a pangram.\\nlet check(s) be\\n$( writes(s)\\n writes(\\\" -> \\\")\\n test pangram(s)\\n then writes(\\\"yes*N\\\")\\n else writes(\\\"no*N\\\")\\n$)\\n\\nlet start() be\\n$( check(\\\"The quick brown fox jumps over the lazy dog.\\\")\\n check(\\\"The five boxing wizards dump quickly.\\\")\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \">~>:65*`!#v_:\\\"`\\\"`48*v>g+04p1\\\\4p\\n^#*`\\\\*93\\\\`0<::-\\\"@\\\"-*<^40!%2g4:_\\n\\\"pangram.\\\"<v*84<_v#-\\\":\\\"g40\\\\\\\" a\\\"\\n>>:#,_55+,@>\\\"ton\\\">48*>\\\"si tahT\\\"\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"(isPangram=\\n k\\n. low$!arg:?arg\\n & a:?k\\n & whl\\n ' ( @(!arg:? !k ?)\\n & chr$(1+asc$!k):?k:~>z\\n )\\n & !k:>z\\n &\\n);\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"pangram? = { sentence |\\n letters = [:a :b :c :d :e :f :g :h :i :j :k :l :m\\n :n :o :p :q :r :s :t :u :v :w :x :y :z]\\n\\n sentence.downcase!\\n\\n letters.reject! { l |\\n sentence.include? l\\n }\\n\\n letters.empty?\\n}\\n\\np pangram? 'The quick brown fox jumps over the lazy dog.' #Prints true\\np pangram? 'Probably not a pangram.' #Prints false\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"pangram? = { sentence |\\n sentence.downcase.dice.unique.select(:alpha?).length == 26\\n}\\n\",\n \"language\": \"Brat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint is_pangram(const char *s)\\n{\\n\\tconst char *alpha = \\\"\\\"\\n\\t\\t\\\"abcdefghjiklmnopqrstuvwxyz\\\"\\n\\t\\t\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n\\n\\tchar ch, wasused[26] = {0};\\n\\tint total = 0;\\n\\n\\twhile ((ch = *s++) != '\\\\0') {\\n\\t\\tconst char *p;\\n\\t\\tint idx;\\n\\n\\t\\tif ((p = strchr(alpha, ch)) == NULL)\\n\\t\\t\\tcontinue;\\n\\n\\t\\tidx = (p - alpha) % 26;\\n\\n\\t\\ttotal += !wasused[idx];\\n\\t\\twasused[idx] = 1;\\n\\t\\tif (total == 26)\\n\\t\\t\\treturn 1;\\n\\t}\\n\\treturn 0;\\n}\\n\\nint main(void)\\n{\\n\\tint i;\\n\\tconst char *tests[] = {\\n\\t\\t\\\"The quick brown fox jumps over the lazy dog.\\\",\\n\\t\\t\\\"The qu1ck brown fox jumps over the lazy d0g.\\\"\\n\\t};\\n\\n\\tfor (i = 0; i < 2; i++)\\n\\t\\tprintf(\\\"\\\\\\\"%s\\\\\\\" is %sa pangram\\\\n\\\",\\n\\t\\t\\ttests[i], is_pangram(tests[i])?\\\"\\\":\\\"not \\\");\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nint pangram(const char *s)\\n{\\n\\tint c, mask = (1 << 26) - 1;\\n\\twhile ((c = (*s++)) != '\\\\0') /* 0x20 converts lowercase to upper */\\n\\t\\tif ((c &= ~0x20) <= 'Z' && c >= 'A')\\n\\t\\t\\tmask &= ~(1 << (c - 'A'));\\n\\n\\treturn !mask;\\n}\\n\\nint main()\\n{\\n\\tint i;\\n\\tconst char *s[] = {\\t\\\"The quick brown fox jumps over lazy dogs.\\\",\\n\\t\\t\\t\\t\\\"The five boxing wizards dump quickly.\\\", };\\n\\n\\tfor (i = 0; i < 2; i++)\\n\\t\\tprintf(\\\"%s: %s\\\\n\\\", pangram(s[i]) ? \\\"yes\\\" : \\\"no \\\", s[i]);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cctype>\\n#include <string>\\n#include <iostream>\\n\\nconst std::string alphabet(\\\"abcdefghijklmnopqrstuvwxyz\\\");\\n\\nbool is_pangram(std::string s)\\n{\\n std::transform(s.begin(), s.end(), s.begin(), ::tolower);\\n std::sort(s.begin(), s.end());\\n return std::includes(s.begin(), s.end(), alphabet.begin(), alphabet.end());\\n}\\n\\nint main()\\n{\\n const auto examples = {\\\"The quick brown fox jumps over the lazy dog\\\",\\n \\\"The quick white cat jumps over the lazy dog\\\"};\\n\\n std::cout.setf(std::ios::boolalpha);\\n for (auto& text : examples) {\\n std::cout << \\\"Is \\\\\\\"\\\" << text << \\\"\\\\\\\" a pangram? - \\\" << is_pangram(text) << std::endl;\\n }\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nstatic class Program\\n{\\n static bool IsPangram(this string text, string alphabet = \\\"abcdefghijklmnopqrstuvwxyz\\\")\\n {\\n return alphabet.All(text.ToLower().Contains);\\n }\\n\\n static void Main(string[] arguments)\\n {\\n Console.WriteLine(arguments.Any() && arguments.First().IsPangram());\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace PangrammChecker\\n{\\n public class PangrammChecker\\n {\\n public static bool IsPangram(string str)\\n {\\n bool[] isUsed = new bool[26];\\n int ai = (int)'a';\\n int total = 0;\\n for (CharEnumerator en = str.ToLower().GetEnumerator(); en.MoveNext(); )\\n {\\n int d = (int)en.Current - ai;\\n if (d >= 0 && d < 26)\\n if (!isUsed[d])\\n {\\n isUsed[d] = true;\\n total++;\\n }\\n }\\n return (total == 26);\\n }\\n }\\n\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n string str1 = \\\"The quick brown fox jumps over the lazy dog.\\\";\\n string str2 = \\\"The qu1ck brown fox jumps over the lazy d0g.\\\";\\n Console.WriteLine(\\\"{0} is {1}a pangram\\\", str1,\\n PangrammChecker.IsPangram(str1)?\\\"\\\":\\\"not \\\");\\n Console.WriteLine(\\\"{0} is {1}a pangram\\\", str2,\\n PangrammChecker.IsPangram(str2)?\\\"\\\":\\\"not \\\");\\n Console.WriteLine(\\\"Press Return to exit\\\");\\n Console.ReadLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"shared void run() {\\n\\n\\tfunction pangram(String sentence) =>\\n \\t\\tlet(alphabet = set('a'..'z'),\\n\\t\\t\\tletters = set(sentence.lowercased.filter(alphabet.contains)))\\n \\t\\tletters == alphabet;\\n\\n \\tvalue sentences = [\\n \\t\\t\\\"The quick brown fox jumps over the lazy dog\\\",\\n \\t\\t\\\"\\\"\\\"Watch \\\"Jeopardy!\\\", Alex Trebek's fun TV quiz game.\\\"\\\"\\\",\\n \\t\\t\\\"Pack my box with five dozen liquor jugs.\\\",\\n \\t\\t\\\"blah blah blah\\\"\\n \\t];\\n \\tfor(sentence in sentences) {\\n \\t\\tprint(\\\"\\\\\\\"``sentence``\\\\\\\" is a pangram? ``pangram(sentence)``\\\");\\n \\t}\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(defn pangram? [s]\\n (let [letters (into #{} \\\"abcdefghijklmnopqrstuvwxyz\\\")]\\n (= (->> s .toLowerCase (filter letters) (into #{})) letters)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"pangram = proc (s: string) returns (bool)\\n letters: array[bool] := array[bool]$fill(0,26,false)\\n for c: char in string$chars(s) do\\n if c>='a' & c<='z' then\\n c := char$i2c(char$c2i(c) - 32)\\n end\\n if c>='A' & c<='Z' then\\n letters[char$c2i(c) - 65] := true\\n end\\n end\\n for seen: bool in array[bool]$elements(letters) do\\n if ~seen then return(false) end\\n end\\n return(true)\\nend pangram\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n examples: array[string] := array[string]$[\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"The five boxing wizards dump quickly.\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n ]\\n\\n for example: string in array[string]$elements(examples) do\\n stream$puts(po, \\\"\\\\\\\"\\\" || example || \\\"\\\\\\\" is\\\")\\n if ~pangram(example) then\\n stream$puts(po, \\\" not\\\")\\n end\\n stream$putl(po, \\\" a pangram.\\\")\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" identification division.\\n program-id. pan-test.\\n data division.\\n working-storage section.\\n 1 text-string pic x(80).\\n 1 len binary pic 9(4).\\n 1 trailing-spaces binary pic 9(4).\\n 1 pangram-flag pic x value \\\"n\\\".\\n 88 is-not-pangram value \\\"n\\\".\\n 88 is-pangram value \\\"y\\\".\\n procedure division.\\n begin.\\n display \\\"Enter text string:\\\"\\n accept text-string\\n set is-not-pangram to true\\n initialize trailing-spaces len\\n inspect function reverse (text-string)\\n tallying trailing-spaces for leading space\\n len for characters after space\\n call \\\"pangram\\\" using pangram-flag len text-string\\n cancel \\\"pangram\\\"\\n if is-pangram\\n display \\\"is a pangram\\\"\\n else\\n display \\\"is not a pangram\\\"\\n end-if\\n stop run\\n .\\n end program pan-test.\\n\\n identification division.\\n program-id. pangram.\\n data division.\\n 1 lc-alphabet pic x(26) value \\\"abcdefghijklmnopqrstuvwxyz\\\".\\n linkage section.\\n 1 pangram-flag pic x.\\n 88 is-not-pangram value \\\"n\\\".\\n 88 is-pangram value \\\"y\\\".\\n 1 len binary pic 9(4).\\n 1 text-string pic x(80).\\n procedure division using pangram-flag len text-string.\\n begin.\\n inspect lc-alphabet converting\\n function lower-case (text-string (1:len))\\n to space\\n if lc-alphabet = space\\n set is-pangram to true\\n end-if\\n exit program\\n .\\n end program pangram.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"is_pangram = (s) ->\\n # This is optimized for longish strings--as soon as all 26 letters\\n # are encountered, we will be done. Our worst case scenario is a really\\n # long non-pangram, or a really long pangram with at least one letter\\n # only appearing toward the end of the string.\\n a_code = 'a'.charCodeAt(0)\\n required_letters = {}\\n for i in [a_code...a_code+26]\\n required_letters[String.fromCharCode(i)] = true\\n\\n cnt = 0\\n for c in s\\n c = c.toLowerCase()\\n if required_letters[c]\\n cnt += 1\\n return true if cnt == 26\\n delete required_letters[c]\\n false\\n\\ndo ->\\n tests = [\\n [\\\"is this a pangram\\\", false]\\n [\\\"The quick brown fox jumps over the lazy dog\\\", true]\\n ]\\n\\n for test in tests\\n [s, exp_value] = test\\n throw Error(\\\"fail\\\") if is_pangram(s) != exp_value\\n # try long strings\\n long_str = ''\\n for i in [1..500000]\\n long_str += s\\n throw Error(\\\"fail\\\") if is_pangram(long_str) != exp_value\\n console.log \\\"Passed tests: #{s}\\\"\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"0010 FUNC pangram#(s$) CLOSED\\n0020 FOR i#:=ORD(\\\"A\\\") TO ORD(\\\"Z\\\") DO\\n0030 IF NOT (CHR$(i#) IN s$ OR CHR$(i#+32) IN s$) THEN RETURN FALSE\\n0040 ENDFOR i#\\n0050 RETURN TRUE\\n0060 ENDFUNC\\n0070 //\\n0080 WHILE NOT EOD DO\\n0090 READ s$\\n0100 PRINT \\\"'\\\",s$,\\\"' is \\\",\\n0110 IF NOT pangram#(s$) THEN PRINT \\\"not \\\",\\n0120 PRINT \\\"a pangram\\\"\\n0130 ENDWHILE\\n0140 END\\n0150 DATA \\\"The quick brown fox jumps over the lazy dog.\\\"\\n0160 DATA \\\"The five boxing wizards dump quickly.\\\"\\n\",\n \"language\": \"Comal\"\n },\n {\n \"code\": \"10 rem detect model for title display\\n20 mx=peek(213): if mx=21 or mx=39 or mx=79 then 50:rem pet, vic, c64\\n30 mx=peek(238): if mx=39 or mx=79 then 50: rem c128\\n40 mx=39:color 4,1:rem assume plus/4 or c-16\\n50 if mx=21 then poke 36879,30:rem fix color on vic-20\\n60 print chr$(147);chr$(14);chr$(18);\\\"**\\\";:for i=2 to (mx-15)/2:print \\\" \\\";:next\\n70 print \\\"Pangram Checker\\\";\\n80 for i=(mx-15)/2+16 to mx-2: print \\\" \\\";: next: print \\\"**\\\"\\n100 read s$\\n110 if len(s$)=0 then end\\n120 gosub 1000:print\\n130 print \\\"'\\\"s$\\\"' is\\\";\\n140 if p=0 then print \\\" not\\\";\\n150 print \\\" a pangram.\\\"\\n160 goto 100\\n500 data \\\"The quick brown fox jumps over the lazy dog.\\\"\\n510 data \\\"The quick brown fox jumped over the lazy dog.\\\"\\n520 data \\\"The five boxing wizards jump quickly.\\\"\\n530 data\\n900 rem pangram checker\\n1000 if f=0 then f=1:dim seen(25),a(2):a(0)=65:a(1)=97:a(2)=193:goto 1020\\n1010 for i=0 to 25:seen(i)=0:next\\n1020 for i=1 to len(s$)\\n1030 : c=asc(mid$(s$,i))\\n1040 : for a = 0 to 2\\n1050 : if c>=a(a) and c<=a(a)+25 then seen(c-a(a))=seen(c-a(a))+1\\n1060 : next a\\n1070 next i\\n1080 p=-1\\n1090 for i=0 to 25\\n1100 : if seen(i)=0 then p=0:i=25\\n1110 next i\\n1120 return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun pangramp (s)\\n (null (set-difference\\n (loop for c from (char-code #\\\\A) upto (char-code #\\\\Z) collect (code-char c))\\n (coerce (string-upcase s) 'list))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"MODULE BbtPangramChecker;\\nIMPORT StdLog,DevCommanders,TextMappers;\\n\\nPROCEDURE Check(str: ARRAY OF CHAR): BOOLEAN;\\nCONST\\n\\tletters = 26;\\nVAR\\n\\ti,j: INTEGER;\\n\\tstatus: ARRAY letters OF BOOLEAN;\\n\\tresp : BOOLEAN;\\nBEGIN\\n\\tFOR i := 0 TO LEN(status) -1 DO status[i] := FALSE END;\\n\\n\\tFOR i := 0 TO LEN(str) - 1 DO\\n\\t\\tj := ORD(CAP(str[i])) - ORD('A');\\n\\t\\tIF (0 <= j) & (25 >= j) & ~status[j] THEN status[j] := TRUE END\\n\\tEND;\\n\\n\\tresp := TRUE;\\n\\tFOR i := 0 TO LEN(status) - 1 DO;\\n\\t\\tresp := resp & status[i]\\n\\tEND;\\n\\tRETURN resp;\\nEND Check;\\n\\nPROCEDURE Do*;\\nVAR\\n\\tparams: DevCommanders.Par;\\n\\ts: TextMappers.Scanner;\\nBEGIN\\n\\tparams := DevCommanders.par;\\n\\ts.ConnectTo(params.text);\\n\\ts.SetPos(params.beg);\\n\\ts.Scan;\\n\\tWHILE (~s.rider.eot) DO\\n\\t\\tIF (s.type = TextMappers.char) & (s.char = '~') THEN\\n\\t\\t\\tRETURN\\n\\t\\tELSIF (s.type # TextMappers.string) THEN\\n\\t\\t\\tStdLog.String(\\\"Invalid parameter\\\");StdLog.Ln\\n\\t\\tELSE\\n\\t\\t\\tStdLog.Char(\\\"'\\\");StdLog.String(s.string + \\\"' is pangram?:> \\\");\\n\\t\\t\\tStdLog.Bool(Check(s.string));StdLog.Ln\\n\\t\\tEND;\\n\\t\\ts.Scan\\n\\tEND\\nEND Do;\\n\\nEND BbtPangramChecker.\\n\",\n \"language\": \"Component-Pascal\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nsub pangram(str: [uint8]): (r: uint8) is\\n var letters: uint8[26];\\n MemZero(&letters[0], 26);\\n\\n loop\\n var chr := [str];\\n if chr == 0 then break; end if;\\n str := @next str;\\n chr := (chr | 32) - 'a';\\n if chr >= 26 then continue; end if;\\n letters[chr] := letters[chr] | 1;\\n end loop;\\n\\n r := 1;\\n chr := 0;\\n while chr < 26 loop\\n r := r & letters[chr];\\n if r == 0 then break; end if;\\n chr := chr + 1;\\n end loop;\\nend sub;\\n\\nvar yesno: [uint8][] := {\\\": no\\\\n\\\", \\\": yes\\\\n\\\"};\\nvar test: [uint8][] := {\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"The five boxing wizards dump quickly.\\\"\\n};\\n\\nvar i: @indexof test := 0;\\nwhile i < @sizeof test loop\\n print(test[i]);\\n print(yesno[pangram(test[i])]);\\n i := i + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"def pangram?(sentence)\\n ('a'..'z').all? {|c| sentence.downcase.includes?(c) }\\nend\\n\\np pangram?(\\\"not a pangram\\\")\\np pangram?(\\\"The quick brown fox jumps over the lazy dog.\\\")\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"bool isPangram(in string text) pure nothrow @safe @nogc {\\n uint bitset;\\n\\n foreach (immutable c; text) {\\n if (c >= 'a' && c <= 'z')\\n bitset |= (1u << (c - 'a'));\\n else if (c >= 'A' && c <= 'Z')\\n bitset |= (1u << (c - 'A'));\\n }\\n\\n return bitset == 0b11_11111111_11111111_11111111;\\n}\\n\\nvoid main() {\\n assert(\\\"the quick brown fox jumps over the lazy dog\\\".isPangram);\\n assert(!\\\"ABCDEFGHIJKLMNOPQSTUVWXYZ\\\".isPangram);\\n assert(!\\\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\\\".isPangram);\\n assert(\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\".isPangram);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.string, std.traits, std.uni;\\n\\n// Do not compile with -g (debug info).\\nenum Alphabet : dstring {\\n DE = \\\"abcdefghijklmnopqrstuvwxyzßäöü\\\",\\n EN = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n SV = \\\"abcdefghijklmnopqrstuvwxyzåäö\\\"\\n}\\n\\nbool isPangram(S)(in S s, dstring alpha = Alphabet.EN)\\npure /*nothrow*/ if (isSomeString!S) {\\n foreach (dchar c; alpha)\\n if (indexOf(s, c) == -1 && indexOf(s, std.uni.toUpper(c)) == -1)\\n return false;\\n return true;\\n}\\n\\nvoid main() {\\n assert(isPangram(\\\"the quick brown fox jumps over the lazy dog\\\".dup, Alphabet.EN));\\n assert(isPangram(\\\"Falsches Üben von Xylophonmusik quält jeden größeren Zwerg\\\"d, Alphabet.DE));\\n assert(isPangram(\\\"Yxskaftbud, ge vår wczonmö iqhjälp\\\"w, Alphabet.SV));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program PangramChecker;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses StrUtils;\\n\\nfunction IsPangram(const aString: string): Boolean;\\nvar\\n c: char;\\nbegin\\n for c := 'a' to 'z' do\\n if not ContainsText(aString, c) then\\n Exit(False);\\n\\n Result := True;\\nend;\\n\\nbegin\\n Writeln(IsPangram('The quick brown fox jumps over the lazy dog')); // true\\n Writeln(IsPangram('Not a panagram')); // false\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"proc nonrec pangram(*char s) bool:\\n ulong letters;\\n char c;\\n byte b;\\n byte A = pretend('a', byte);\\n byte Z = pretend('z', byte);\\n\\n letters := 0L0;\\n while\\n c := s*;\\n s := s + 1;\\n c /= '\\\\e'\\n do\\n b := pretend(c, byte) | 32;\\n if b >= A and b <= Z then\\n letters := letters | 0L1 << (b-A)\\n fi\\n od;\\n letters = 0x3FFFFFF\\ncorp\\n\\nproc nonrec test(*char s) void:\\n writeln(\\\"\\\\\\\"\\\", s, \\\"\\\\\\\": \\\",\\n if pangram(s) then \\\"yes\\\" else \\\"no\\\" fi)\\ncorp\\n\\nproc nonrec main() void:\\n test(\\\"The quick brown fox jumps over the lazy dog.\\\");\\n test(\\\"The five boxing wizards jump quickly.\\\");\\n test(\\\"Not a pangram\\\")\\ncorp\\n\",\n \"language\": \"Draco\"\n },\n {\n \"code\": \"def isPangram(sentence :String) {\\n return (\\\"abcdefghijklmnopqrstuvwxyz\\\".asSet() &! sentence.toLowerCase().asSet()).size() == 0\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"func pangr s$ .\\n len d[] 26\\n for c$ in strchars s$\\n c = strcode c$\\n if c >= 97 and c <= 122\\n c -= 32\\n .\\n if c >= 65 and c <= 91\\n d[c - 64] = 1\\n .\\n .\\n for h in d[]\\n s += h\\n .\\n return s\\n.\\nrepeat\\n s$ = input\\n until s$ = \\\"\\\"\\n print s$\\n if pangr s$ = 26\\n print \\\" --> pangram\\\"\\n .\\n print \\\"\\\"\\n.\\ninput_data\\nThis is a test.\\nThe quick brown fox jumps over the lazy dog.\\nThe quick brown fox jumped over the lazy dog.\\nQwErTyUiOpAsDfGhJkLzXcVbNm\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \" [Pangram checker for Rosetta Code.\\n EDSAC program, Initial Orders 2.]\\n\\n [Outline: Make a table, one entry per 5-bit character code.\\n Initialize entry for each letter to 1.\\n When a letter is read, convert its entry to 0.]\\n\\n [Subroutine to read string from the input and\\n store it with character codes in low 5 bits.\\n String is terminated by blank row of tape, which is stored.\\n Input: 0F holds address of string in address field (bits 1..11).\\n 21 locations; workspace: 4F]\\n T 56 K\\n GKA3FT17@AFA18@T7@I4FA4FUFS19@G12@S20@G16@T4FA7@A2FE4@T4FEFUFP8FPD\\n\\n [*************** Rosetta Code task ***************\\n Subroutine to test whether string is a pangram.\\n Input: 0F = address of string, characters in low 5 bits,\\n terminated by blank row of tape.\\n Output: 1F = (number of missing letters) - 1.\\n 87 memory locations; workspace 4F.]\\n T 88 K\\n G K\\n A 3 F [make and plant link for return]\\n T 48 @\\n [Fill letter table with 1's.\\n The code is a bit neater if we work backwards.]\\n A 54 @ [index of last entry]\\n [3] A 51 @ [make T order for table entry]\\n T 6 @ [plant in code]\\n A 53 @ [acc := 1]\\n [6] T F [table entry := 1]\\n A 6 @ [dec address in table]\\n S 2 F\\n S 51 @ [finished table?]\\n E 3 @ [loop back if not]\\n [Set non-letters to 0, except blank row := -1]\\n T 4 F [clear acc]\\n T 66 @ [figures shift]\\n T 70 @ [letters shift]\\n T 73 @ [carriage return]\\n T 75 @ [space]\\n T 79 @ [line feed]\\n S 53 @ [acc := -1]\\n T 71 @ [blank row of tape]\\n [Loop to read characters from string.\\n Terminated by blank row of tape.\\n Assume acc = 0 here.]\\n A F [load address of string]\\n A 49 @ [make order to read first char]\\n [21] T 22 @ [plant in code]\\n [22] A F [char to acc]\\n L D [shift to address field]\\n A 50 @ [make A order for this char in table]\\n U 28 @ [plant in code]\\n A 52 @ [convert to T order]\\n T 31 @ [plant in code]\\n [28] A F [load table entry]\\n G 35 @ [jump out if it's -1, i.e. blank row]\\n T 4 F [clear acc]\\n [31] T F [table entry := 0 to flag that letter is present]\\n A 22 @ [inc address in input string]\\n A 2 F\\n G 21 @ [back to read next char]\\n [Get total of table entries, again working backwards.\\n The number of missing letters is (total + 1).]\\n [35] T 4 F [clear acc]\\n T 1 F [initialize total := 0]\\n A 54 @ [index of last entry]\\n [38] A 50 @ [make A order for table entry]\\n T 41 @ [plant in code]\\n A 1 F [load total so far]\\n [41] A F [add table entry]\\n T 1 F [update total]\\n A 41 @ [load A order]\\n S 2 F [dec address]\\n S 50 @ [finished table?]\\n E 38 @ [loop back if not]\\n T 4 F [clear acc before exit]\\n [48] E F\\n [Constants]\\n [49] A F [to make A order referring to input]\\n [50] A 55 @ [to make A order referring to table]\\n [51] T 55 @ [to make T order referring to table]\\n [52] O F [add to A order to convert to T order]\\n [53] P D [constant 1]\\n [54] P 31 F [to change address by 31]\\n [Table]\\n [55] PFPFPFPFPFPFPFPFPFPFPF\\n [66] PFPFPFPF [11 = figures shift]\\n [70] PF [15 = letters shift]\\n [71] PFPF [16 = blank row of tape]\\n [73] PFPF [18 = carriage return]\\n [75] PFPFPFPF [20 = space]\\n [79] PFPFPFPFPFPFPFPF [24 = line feed]\\n\\n [Main routine to demonstrate pangram-checking subroutine]\\n T 200 K\\n G K\\n [Constants]\\n [0] P 25 @ [address for input string]\\n [1] N F [letter N]\\n [2] Y F [letter Y]\\n [3] K 2048 F [letter shift]\\n [4] @ F [carriage return]\\n [5] & F [line feed]\\n [6] K 4096 F [null char]\\n [Enter with acc = 0]\\n [7] O 3 @ [set letters shift]\\n [8] A @ [load address of input]\\n T F [pass to input subroutine in 0F]\\n [10] A 10 @ [call input subroutine, doesn't change 0F]\\n G 56 F\\n [12] A 12 @ [call pangram subroutine]\\n G 88 F\\n [We could print the number of missing letters,\\n but we'll just print 'Y' or 'N'.]\\n A 1 F [load (number missing) - 1]\\n E 18 @ [jump if not pangram]\\n O 2 @ [print 'Y']\\n G 19 @ [exit]\\n [18] O 1 @ [print 'N']\\n [19] O 4 @ [print CR, LF]\\n O 5 @\\n O 6 @ [print null to flush printer buffer]\\n Z F [stop]\\n T F [on Reset, clear acc]\\n E 8 @ [and test another string]\\n [25] [input string goes here]\\n E 7 Z [define entry point]\\n P F [acc = 0 on entry]\\nTHE!QUICK!BROWN!FOX!JUMPS!OVER!THE!LAZY!DOG.\\n\",\n \"language\": \"EDSAC-order-code\"\n },\n {\n \"code\": \"defmodule Pangram do\\n def checker(str) do\\n unused = Enum.to_list(?a..?z) -- to_char_list(String.downcase(str))\\n Enum.empty?(unused)\\n end\\nend\\n\\ntext = \\\"The quick brown fox jumps over the lazy dog.\\\"\\nIO.puts \\\"#{Pangram.checker(text)}\\\\t#{text}\\\"\\ntext = (Enum.to_list(?A..?Z) -- 'Test') |> to_string\\nIO.puts \\\"#{Pangram.checker(text)}\\\\t#{text}\\\"\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-module(pangram).\\n-export([is_pangram/1]).\\n\\nis_pangram(String) ->\\n ordsets:is_subset(lists:seq($a, $z), ordsets:from_list(string:to_lower(String))).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"ISPANGRAM\\n=LAMBDA(s,\\n LET(\\n abc, CHARS(LOWER(\\\"abcdefghijklmnopqrstuvwxyz\\\")),\\n AND(\\n LAMBDA(c,\\n ISNUMBER(SEARCH(c, s, 1))\\n )(\\n abc\\n )\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"CHARS\\n=LAMBDA(s,\\n MID(s, ROW(INDIRECT(\\\"1:\\\" & LEN(s))), 1)\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let isPangram (str: string) = (set['a'..'z'] - set(str.ToLower())).IsEmpty\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \": pangram? ( str -- ? )\\n [ \\\"abcdefghijklmnopqrstuvwxyz\\\" ] dip >lower diff length 0 = ;\\n\\n\\\"How razorback-jumping frogs can level six piqued gymnasts!\\\" pangram? .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": pangram? ( addr len -- ? )\\n 0 -rot bounds do\\n i c@ 32 or [char] a -\\n dup 0 26 within if\\n 1 swap lshift or\\n else drop then\\n loop\\n 1 26 lshift 1- = ;\\n\\ns\\\" The five boxing wizards jump quickly.\\\" pangram? . \\\\ -1\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"module pangram\\n\\n implicit none\\n private\\n public :: is_pangram\\n character (*), parameter :: lower_case = 'abcdefghijklmnopqrstuvwxyz'\\n character (*), parameter :: upper_case = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n\\ncontains\\n\\n function to_lower_case (input) result (output)\\n\\n implicit none\\n character (*), intent (in) :: input\\n character (len (input)) :: output\\n integer :: i\\n integer :: j\\n\\n output = input\\n do i = 1, len (output)\\n j = index (upper_case, output (i : i))\\n if (j /= 0) then\\n output (i : i) = lower_case (j : j)\\n end if\\n end do\\n\\n end function to_lower_case\\n\\n function is_pangram (input) result (output)\\n\\n implicit none\\n character (*), intent (in) :: input\\n character (len (input)) :: lower_case_input\\n logical :: output\\n integer :: i\\n\\n lower_case_input = to_lower_case (input)\\n output = .true.\\n do i = 1, len (lower_case)\\n if (index (lower_case_input, lower_case (i : i)) == 0) then\\n output = .false.\\n exit\\n end if\\n end do\\n\\n end function is_pangram\\n\\nend module pangram\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"program test\\n\\n use pangram, only: is_pangram\\n\\n implicit none\\n character (256) :: string\\n\\n string = 'This is a sentence.'\\n write (*, '(a)') trim (string)\\n write (*, '(l1)') is_pangram (string)\\n string = 'The five boxing wizards jumped quickly.'\\n write (*, '(a)') trim (string)\\n write (*, '(l1)') is_pangram (string)\\n\\nend program test\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nFunction isPangram(s As Const String) As Boolean\\n Dim As Integer length = Len(s)\\n If length < 26 Then Return False\\n Dim p As String = LCase(s)\\n For i As Integer = 97 To 122\\n If Instr(p, Chr(i)) = 0 Then Return False\\n Next\\n Return True\\nEnd Function\\n\\nDim s(1 To 3) As String = _\\n{ _\\n \\\"The quick brown fox jumps over the lazy dog\\\", _\\n \\\"abbdefghijklmnopqrstuVwxYz\\\", _ '' no c!\\n \\\"How vexingly quick daft zebras jump!\\\" _\\n}\\n\\nFor i As Integer = 1 To 3:\\n Print \\\"'\\\"; s(i); \\\"' is \\\"; IIf(isPangram(s(i)), \\\"a\\\", \\\"not a\\\"); \\\" pangram\\\"\\n Print\\nNext\\n\\nPrint\\nPrint \\\"Press nay key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"s = \\\"The quick brown fox jumps over the lazy dog.\\\"\\nprintln[\\\"\\\\\\\"$s\\\\\\\" is\\\" + (isPangram[s] ? \\\"\\\" : \\\" not\\\") + \\\" a pangram.\\\"]\\n\\nisPangram[s] :=\\n{\\n charSet = toSet[charList[lc[s]]]\\n for c = \\\"a\\\" to \\\"z\\\"\\n if ! charSet.contains[c]\\n return false\\n\\n return true\\n}\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"include \\\"NSLog.incl\\\"\\n\\nlocal fn IsPangram( pangramString as CFStringRef ) as BOOL\\n NSUInteger i, count\\n BOOL result\\n\\n CFStringRef lcPanStr = fn StringLowerCaseString( pangramString )\\n CFMutableSetRef mutSet = fn MutableSetWithCapacity( 0 )\\n\\n count = len(lcPanStr)\\n for i = 0 to count - 1\\n if ( fn CharacterSetCharacterIsMember( fn CharacterSetLowercaseLetterSet, fn StringCharacterAtIndex( lcPanStr, i ) ) )\\n MutableSetAddObject( mutSet, fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtIndex( lcPanStr, i ) ) )\\n end if\\n next\\n if fn SetCount( mutSet ) >= 26 then result = YES else result = NO\\nend fn = result\\n\\n\\nCFStringRef testStr, trueStr, falseStr\\nCFArrayRef array\\n\\ntrueStr = @\\\"Is a pangram\\\"\\nfalseStr = @\\\"Not a pangram\\\"\\n\\narray = @[¬\\n@\\\"My dog has fleas.\\\",¬\\n@\\\"The quick brown fox jumps over the lazy do.\\\",¬\\n@\\\"The quick brown fox jumped over the lazy dog.\\\",¬\\n@\\\"The quick brown fox jumps over the lazy dog.\\\",¬\\n@\\\"Jackdaws love my big sphinx of quartz.\\\",¬\\n@\\\"What's a jackdaw?\\\",¬\\n@\\\"Watch \\\\\\\"Jeopardy!\\\\\\\", Alex Trebek's fun TV quiz game.\\\",¬\\n@\\\"Pack my box with five dozen liquor jugs.\\\",¬\\n@\\\"This definitely is not a pangram.\\\",¬\\n@\\\"This is a random long sentence just for testing purposes.\\\"]\\n\\nfor testStr in array\\n if ( fn IsPangram( testStr ) )\\n NSLog( @\\\"%13s : %@\\\", fn StringUTF8String( trueStr ), testStr ) else NSLog( @\\\"%s : %@\\\", fn StringUTF8String( falseStr ), testStr )\\n end if\\nnext\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc main() {\\n for _, s := range []string{\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n `Watch \\\"Jeopardy!\\\", Alex Trebek's fun TV quiz game.`,\\n \\\"Not a pangram.\\\",\\n } {\\n if pangram(s) {\\n fmt.Println(\\\"Yes:\\\", s)\\n } else {\\n fmt.Println(\\\"No: \\\", s)\\n }\\n }\\n}\\n\\nfunc pangram(s string) bool {\\n\\tvar missing uint32 = (1 << 26) - 1\\n\\tfor _, c := range s {\\n\\t\\tvar index uint32\\n\\t\\tif 'a' <= c && c <= 'z' {\\n\\t\\t\\tindex = uint32(c - 'a')\\n\\t\\t} else if 'A' <= c && c <= 'Z' {\\n\\t\\t\\tindex = uint32(c - 'A')\\n\\t\\t} else {\\n\\t\\t\\tcontinue\\n\\t\\t}\\n\\n\\t\\tmissing &^= 1 << index\\n\\t\\tif missing == 0 {\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t}\\n\\treturn false\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Char (toLower)\\nimport Data.List ((\\\\\\\\))\\n\\npangram :: String -> Bool\\npangram = null . (['a' .. 'z'] \\\\\\\\) . map toLower\\n\\nmain = print $ pangram \\\"How razorback-jumping frogs can level six piqued gymnasts!\\\"\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"PangramBrokenAt(\\\"This is a Pangram.\\\") ! => 2 (b is missing)\\nPangramBrokenAt(\\\"The quick Brown Fox jumps over the Lazy Dog\\\") ! => 0 (OK)\\n\\nFUNCTION PangramBrokenAt(string)\\n CHARACTER string, Alfabet=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n PangramBrokenAt = INDEX(Alfabet, string, 64)\\n ! option 64: verify = 1st letter of string not in Alfabet\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"procedure panagram(s) #: return s if s is a panagram and fail otherwise\\nif (map(s) ** &lcase) === &lcase then return s\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"procedure main(arglist)\\n\\nif *arglist > 0 then\\n every ( s := \\\"\\\" ) ||:= !arglist || \\\" \\\"\\nelse\\n s := \\\"The quick brown fox jumps over the lazy dog.\\\"\\n\\nwrites(image(s), \\\" -- is\\\")\\nwrites(if not panagram(s) then \\\"n't\\\")\\nwrite(\\\" a panagram.\\\")\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"(function pangram? sentence\\n (let prepped (-> sentence lower-case to-vec))\\n (all? prepped (map char-code (range 97 123))))\\n\\n(pangram? \\\"The five boxing wizards jump quickly.\\\")\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Sequence isPangram := method(\\n letters := \\\" \\\" repeated(26)\\n ia := \\\"a\\\" at(0)\\n foreach(ichar,\\n if(ichar isLetter,\\n letters atPut((ichar asLowercase) - ia, ichar)\\n )\\n )\\n letters contains(\\\" \\\" at(0)) not // true only if no \\\" \\\" in letters\\n)\\n\\n\\\"The quick brown fox jumps over the lazy dog.\\\" isPangram println // --> true\\n\\\"The quick brown fox jumped over the lazy dog.\\\" isPangram println // --> false\\n\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\" isPangram println // --> true\\n\",\n \"language\": \"Io\"\n },\n {\n \"code\": \"Text isPangram? = method(\\n letters = \\\"abcdefghijklmnopqrstuvwxyz\\\" chars\\n text = self lower chars\\n letters map(x, text include?(x)) reduce(&&)\\n)\\n\",\n \"language\": \"Ioke\"\n },\n {\n \"code\": \"iik> \\\"The quick brown fox jumps over the lazy dog\\\" isPangram?\\n\\\"The quick brown fox jumps over the lazy dog\\\" isPangram?\\n+> true\\n\\niik> \\\"The quick brown fox jumps over the\\\" isPangram?\\n\\\"The quick brown fox jumps over the\\\" isPangram?\\n+> false\\n\",\n \"language\": \"Ioke\"\n },\n {\n \"code\": \"require 'strings'\\nisPangram=: (a. {~ 97+i.26) */@e. tolower\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" isPangram 'The quick brown fox jumps over the lazy dog.'\\n1\\n isPangram 'The quick brown fox falls over the lazy dog.'\\n0\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"public class Pangram {\\n public static boolean isPangram(String test){\\n for (char a = 'A'; a <= 'Z'; a++)\\n if ((test.indexOf(a) < 0) && (test.indexOf((char)(a + 32)) < 0))\\n return false;\\n return true;\\n }\\n\\n public static void main(String[] args){\\n System.out.println(isPangram(\\\"the quick brown fox jumps over the lazy dog\\\"));//true\\n System.out.println(isPangram(\\\"the quick brown fox jumped over the lazy dog\\\"));//false, no s\\n System.out.println(isPangram(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"));//true\\n System.out.println(isPangram(\\\"ABCDEFGHIJKLMNOPQSTUVWXYZ\\\"));//false, no r\\n System.out.println(isPangram(\\\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\\\"));//false, no m\\n System.out.println(isPangram(\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\"));//true\\n System.out.println(isPangram(\\\"\\\"));//false\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function isPangram(s) {\\n var letters = \\\"zqxjkvbpygfwmucldrhsnioate\\\"\\n // sorted by frequency ascending (http://en.wikipedia.org/wiki/Letter_frequency)\\n s = s.toLowerCase().replace(/[^a-z]/g,'')\\n for (var i = 0; i < 26; i++)\\n if (s.indexOf(letters[i]) < 0) return false\\n return true\\n}\\n\\nconsole.log(isPangram(\\\"is this a pangram\\\")) // false\\nconsole.log(isPangram(\\\"The quick brown fox jumps over the lazy dog\\\")) // true\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ----------------- PANGRAM CHECKER -----------------\\n\\n // isPangram :: String -> Bool\\n const isPangram = s =>\\n 0 === \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n .split(\\\"\\\")\\n .filter(c => -1 === s.toLowerCase().indexOf(c))\\n .length;\\n\\n // ---------------------- TEST -----------------------\\n return [\\n \\\"is this a pangram\\\",\\n \\\"The quick brown fox jumps over the lazy dog\\\"\\n ].map(isPangram);\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def is_pangram:\\n explode\\n | map( if 65 <= . and . <= 90 then . + 32 # uppercase\\n elif 97 <= . and . <= 122 then . # lowercase\\n else empty\\n end )\\n | unique\\n | length == 26;\\n\\n# Example:\\n\\\"The quick brown fox jumps over the lazy dog\\\" | is_pangram\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function makepangramchecker(alphabet)\\n alphabet = Set(uppercase.(alphabet))\\n function ispangram(s)\\n lengthcheck = length(s) ≥ length(alphabet)\\n return lengthcheck && all(c in uppercase(s) for c in alphabet)\\n end\\n return ispangram\\nend\\n\\nconst tests = [\\\"Pack my box with five dozen liquor jugs.\\\",\\n \\\"The quick brown fox jumps over a lazy dog.\\\",\\n \\\"The quick brown fox jumps\\\\u2323over the lazy dog.\\\",\\n \\\"The five boxing wizards jump quickly.\\\",\\n \\\"This sentence contains A-Z but not the whole alphabet.\\\"]\\n\\nis_english_pangram = makepangramchecker('a':'z')\\n\\nfor s in tests\\n println(\\\"The sentence \\\\\\\"\\\", s, \\\"\\\\\\\" is \\\", is_english_pangram(s) ? \\\"\\\" : \\\"not \\\", \\\"a pangram.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"lcase : _ci 97+!26\\nucase : _ci 65+!26\\ntolower : {@[x;p;:;lcase@n@p:&26>n:ucase?/:x]}\\npanagram: {&/lcase _lin tolower x}\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \" panagram \\\"The quick brown fox jumps over the lazy dog\\\"\\n1\\n panagram \\\"Panagram test\\\"\\n0\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"isPangram:0=#(`c$\\\"a\\\"+!26)^_:\\n\\nisPangram\\\"This is a test\\\"\\n0\\nisPangram\\\"The quick brown fox jumps over the lazy dog.\\\"\\n1\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nfun isPangram(s: String): Boolean {\\n if (s.length < 26) return false\\n val t = s.toLowerCase()\\n for (c in 'a' .. 'z')\\n if (c !in t) return false\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n val candidates = arrayOf(\\n \\\"The quick brown fox jumps over the lazy dog\\\",\\n \\\"New job: fix Mr. Gluck's hazy TV, PDQ!\\\",\\n \\\"A very bad quack might jinx zippy fowls\\\",\\n \\\"A very mad quack might jinx zippy fowls\\\" // no 'b' now!\\n )\\n for (candidate in candidates)\\n println(\\\"'$candidate' is ${if (isPangram(candidate)) \\\"a\\\" else \\\"not a\\\"} pangram\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"#!/bin/ksh\\n\\n# Pangram checker\\n\\n#\\t# Variables:\\n#\\nalphabet='abcdefghijklmnopqrstuvwxyz'\\n\\ntypeset -a strs\\nstrs+=( 'Mr. Jock, TV quiz PhD., bags few lynx.' )\\nstrs+=( 'A very mad quack might jinx zippy fowls.' )\\n\\n#\\t# Functions:\\n#\\n\\n#\\t# Function _ispangram(str) - return 0 if str is a pangram\\n#\\nfunction _ispangram {\\n\\ttypeset _str ; typeset -l _str=\\\"$1\\\"\\n\\ttypeset _buff ; _buff=\\\"${alphabet}\\\"\\n\\ttypeset _i ; typeset -si _i\\n\\n\\tfor ((_i=0; _i<${#_str} && ${#_buff}>0; _i++)); do\\n\\t\\t_buff=${_buff/${_str:${_i}:1}/}\\n\\tdone\\n\\treturn ${#_buff}\\n}\\n\\n ######\\n# main #\\n ######\\n\\ntypeset -si i\\nfor ((i=0; i<${#strs[*]}; i++)); do\\n\\t_ispangram \\\"${strs[i]}\\\"\\n\\tif (( ! $? )); then\\n\\t\\tprint \\\"${strs[i]} <<< IS A PANGRAM.\\\"\\n\\telse\\n\\t\\tprint \\\"${strs[i]} <<< Is not a pangram.\\\"\\n\\tfi\\ndone\\n\",\n \"language\": \"Ksh\"\n },\n {\n \"code\": \"'Returns 0 if the string is NOT a pangram or >0 if it IS a pangram\\nstring$ = \\\"The quick brown fox jumps over the lazy dog.\\\"\\n\\nPrint isPangram(string$)\\n\\nFunction isPangram(string$)\\n string$ = Lower$(string$)\\n For i = Asc(\\\"a\\\") To Asc(\\\"z\\\")\\n isPangram = Instr(string$, chr$(i))\\n If isPangram = 0 Then Exit Function\\n Next i\\nEnd Function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"to remove.all :s :set\\n if empty? :s [output :set]\\n if word? :s [output remove.all butfirst :s remove first :s :set]\\n output remove.all butfirst :s remove.all first :s :set\\nend\\nto pangram? :s\\n output empty? remove.all :s \\\"abcdefghijklmnopqrstuvwxyz\\nend\\n\\nshow pangram? [The five boxing wizards jump quickly.] ; true\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \"require\\\"lpeg\\\"\\nS, C = lpeg.S, lpeg.C\\nfunction ispangram(s)\\n return #(C(S(s)^0):match\\\"abcdefghijklmnopqrstuvwxyz\\\") == 26\\nend\\n\\nprint(ispangram\\\"waltz, bad nymph, for quick jigs vex\\\")\\nprint(ispangram\\\"bobby\\\")\\nprint(ispangram\\\"long sentence\\\")\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"#Used built-in StringTools package\\nis_pangram := proc(str)\\n\\tlocal present := StringTools:-LowerCase~(select(StringTools:-HasAlpha, StringTools:-Explode(str)));\\n\\tlocal alphabets := {\\\"a\\\",\\\"b\\\",\\\"c\\\",\\\"d\\\",\\\"e\\\",\\\"f\\\",\\\"g\\\",\\\"h\\\",\\\"i\\\",\\\"j\\\",\\\"k\\\",\\\"l\\\",\\\"m\\\",\\\"n\\\",\\\"o\\\",\\\"p\\\",\\\"q\\\",\\\"r\\\",\\\"s\\\",\\\"t\\\",\\\"u\\\",\\\"v\\\",\\\"w\\\",\\\"x\\\",\\\"y\\\",\\\"z\\\"};\\n\\tpresent := convert(present, set);\\n\\treturn evalb(present = alphabets);\\nend proc;\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"is_pangram(\\\"The quick brown fox jumps over the lazy dog.\\\");\\nis_pangram(\\\"The 2 QUIck brown foxes jumped over the lazy DOG!!\\\");\\nis_pangram(\\\"\\\"The quick brown fox jumps over the lay dog.\\\");\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"pangramQ[msg_]:=Complement[CharacterRange[\\\"a\\\", \\\"z\\\"], Characters[ToLowerCase[msg]]]=== {}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"pangramQ[msg_] :=\\n Function[If[# === {}, Print[\\\"The string is a pangram!\\\"],\\n Print[\\\"The string is not a pangram. It's missing the letters \\\" <>\\n ToString[#]]]][\\n Complement[CharacterRange[\\\"a\\\", \\\"z\\\"], Characters[ToLowerCase[msg]]]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"function trueFalse = isPangram(string)\\n\\n %This works by histogramming the ascii character codes for lower case\\n %letters contained in the string (which is first converted to all\\n %lower case letters). Then it finds the index of the first letter that\\n %is not contained in the string (this is faster than using the find\\n %without the second parameter). If the find returns an empty array then\\n %the original string is a pangram, if not then it isn't.\\n\\n trueFalse = isempty(find( histc(lower(string),(97:122))==0,1 ));\\n\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"isPangram('The quick brown fox jumps over the lazy dog.')\\n\\nans =\\n\\n 1\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"function trueFalse = isPangram(string)\\n % X is a histogram of letters\\n X = sparse(abs(lower(string)),1,1,128,1);\\n trueFalse = full(all(X('a':'z') > 0));\\nend\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"\\\"abcdefghijklmnopqrstuvwxyz\\\" \\\"\\\" split =alphabet\\n('alphabet dip lowercase (swap match) prepend all?) :pangram?\\n\\n\\\"The quick brown fox jumps over the lazy dog.\\\" pangram? puts\\n\",\n \"language\": \"Min\"\n },\n {\n \"code\": \"sentences = [\\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"Peter Piper picked a peck of pickled peppers.\\\",\\n \\\"Waltz job vexed quick frog nymphs.\\\"]\\n\\nalphabet = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\npangram = function (toCheck)\\n sentence = toCheck.lower\\n fail = false\\n for c in alphabet\\n if sentence.indexOf(c) == null then return false\\n end for\\n return true\\nend function\\n\\nfor sentence in sentences\\n if pangram(sentence) then\\n print \\\"\\\"\\\"\\\" + sentence + \\\"\\\"\\\" is a Pangram\\\"\\n else\\n print \\\"\\\"\\\"\\\" + sentence + \\\"\\\"\\\" is not a Pangram\\\"\\n end if\\nend for\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"fun to_locase s = implode ` map (c_downcase) ` explode s\\n\\nfun is_pangram\\n\\t(h :: t, T) =\\n\\t\\tlet\\n\\t\\t\\tval flen = len (filter (fn c = c eql h) T)\\n\\t\\tin\\n\\t\\t\\tif (flen = 0) then\\n\\t\\t\\t\\tfalse\\n\\t\\t\\telse\\n\\t\\t\\t\\tis_pangram (t, T)\\n\\t\\tend\\n|\\t([], T) = true\\n| \\tS = is_pangram (explode \\\"abcdefghijklmnopqrstuvwxyz\\\", explode ` to_locase S)\\n\\nfun is_pangram_i\\n\\t(h :: t, T) =\\n\\t\\tlet\\n\\t\\t\\tval flen = len (filter (fn c = c eql h) T)\\n\\t\\tin\\n\\t\\t\\tif (flen = 0) then\\n\\t\\t\\t\\tfalse\\n\\t\\t\\telse\\n\\t\\t\\t\\tis_pangram (t, T)\\n\\t\\tend\\n|\\t([], T) = true\\n| \\t(A,S) = is_pangram (explode A, explode ` to_locase S)\\n\\nfun test (f, arg, res, ok, notok) = if (f arg eql res) then (\\\"'\\\" @ arg @ \\\"' \\\" @ ok) else (\\\"'\\\" @ arg @ \\\"' \\\" @ notok)\\nfun test2 (f, arg, res, ok, notok) = if (f arg eql res) then (\\\"'\\\" @ ref (arg,1) @ \\\"' \\\" @ ok) else (\\\"'\\\" @ ref (arg,1) @ \\\"' \\\" @ notok)\\n\\n;\\nprintln ` test (is_pangram, \\\"The quick brown fox jumps over the lazy dog\\\", true, \\\"is a pangram\\\", \\\"is not a pangram\\\");\\nprintln ` test (is_pangram, \\\"abcdefghijklopqrstuvwxyz\\\", true, \\\"is a pangram\\\", \\\"is not a pangram\\\");\\nval SValphabet = \\\"abcdefghijklmnopqrstuvwxyzåäö\\\";\\nval SVsentence = \\\"Yxskaftbud, ge vår wczonmö iq hjälp\\\";\\nprintln ` test2 (is_pangram_i, (SValphabet, SVsentence), true, \\\"is a Swedish pangram\\\", \\\"is not a Swedish pangram\\\");\\n\",\n \"language\": \"MLite\"\n },\n {\n \"code\": \"MODULE Pangrams;\\nFROM InOut IMPORT WriteString, WriteLn;\\nFROM Strings IMPORT Length;\\n\\n(* Check if a string is a pangram *)\\nPROCEDURE pangram(s: ARRAY OF CHAR): BOOLEAN;\\n VAR letters: ARRAY [0..25] OF BOOLEAN;\\n i: CARDINAL;\\nBEGIN\\n FOR i := 0 TO 25 DO letters[i] := FALSE; END;\\n FOR i := 0 TO Length(s)-1 DO\\n IF (s[i] >= 'A') AND (s[i] <= 'Z') THEN\\n letters[ORD(s[i]) - ORD('A')] := TRUE;\\n ELSIF (s[i] >= 'a') AND (s[i] <= 'z') THEN\\n letters[ORD(s[i]) - ORD('a')] := TRUE;\\n END;\\n END;\\n FOR i := 0 TO 25 DO\\n IF NOT letters[i] THEN\\n RETURN FALSE;\\n END;\\n END;\\n RETURN TRUE;\\nEND pangram;\\n\\nPROCEDURE example(s: ARRAY OF CHAR);\\nBEGIN\\n WriteString(\\\"'\\\");\\n WriteString(s);\\n WriteString(\\\"' is \\\");\\n IF NOT pangram(s) THEN\\n WriteString(\\\"not \\\");\\n END;\\n WriteString(\\\"a pangram.\\\");\\n WriteLn();\\nEND example;\\n\\nBEGIN\\n example(\\\"The quick brown fox jumps over the lazy dog\\\");\\n example(\\\"The five boxing wizards dump quickly\\\");\\n example(\\\"abcdefghijklmnopqrstuvwxyz\\\");\\nEND Pangrams.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref savelog symbols nobinary\\n\\nA2Z = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n\\npangrams = create_samples\\n\\nloop p_ = 1 to pangrams[0]\\n pangram = pangrams[p_]\\n q_ = A2Z.verify(pangram.upper) -- <= it basically all happens in this function call!\\n say pangram.left(64)'\\\\-'\\n if q_ == 0 then -\\n say ' [OK, a pangram]'\\n else -\\n say ' [Not a pangram. Missing:' A2Z.substr(q_, 1)']'\\n end p_\\n\\nmethod create_samples public static returns Rexx\\n\\n pangrams = ''\\n\\n x_ = 0\\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over a lazy dog.' -- best/shortest pangram\\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumps over the lazy dog.' -- not as short but at least it's still a pangram\\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick brown fox jumped over the lazy dog.' -- common misquote; not a pangram\\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'The quick onyx goblin jumps over the lazy dwarf.'\\n x_ = x_ + 1; pangrams[0] = x_; pangrams[x_] = 'Bored? Craving a pub quiz fix? Why, just come to the Royal Oak!' -- (Used to advertise a pub quiz in Bowness-on-Windermere)\\n\\n return pangrams\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"(context 'PGR) ;; Switch to context (say namespace) PGR\\n(define (is-pangram? str)\\n (setf chars (explode (upper-case str))) ;; Uppercase + convert string into a list of chars\\n (setf is-pangram-status true) ;; Default return value of function\\n (for (c (char \\\"A\\\") (char \\\"Z\\\") 1 (nil? is-pangram-status)) ;; For loop with break condition\\n (if (not (find (char c) chars)) ;; If char not found in list, \\\"is-pangram-status\\\" becomes \\\"nil\\\"\\n (setf is-pangram-status nil)\\n )\\n )\\n is-pangram-status ;; Return current value of symbol \\\"is-pangram-status\\\"\\n)\\n(context 'MAIN) ;; Back to MAIN context\\n\\n;; - - - - - - - - - -\\n\\n(println (PGR:is-pangram? \\\"abcdefghijklmnopqrstuvwxyz\\\")) ;; Print true\\n(println (PGR:is-pangram? \\\"abcdef\\\")) ;; Print nil\\n(exit)\\n\",\n \"language\": \"NewLISP\"\n },\n {\n \"code\": \"import rdstdin\\n\\nproc isPangram(sentence: string, alphabet = {'a'..'z'}): bool =\\n var sentset: set[char] = {}\\n for c in sentence: sentset.incl c\\n alphabet <= sentset\\n\\necho isPangram(readLineFromStdin \\\"Sentence: \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"bundle Default {\\n class Pangram {\\n function : native : IsPangram(test : String) ~ Bool {\\n for(a := 'A'; a <= 'Z'; a += 1;) {\\n if(test->Find(a) < 0 & test->Find(a->ToLower()) < 0) {\\n return false;\\n };\\n };\\n\\n return true;\\n }\\n\\n function : Main(args : String[]) ~ Nil {\\n IsPangram(\\\"the quick brown fox jumps over the lazy dog\\\")->PrintLine(); # true\\n IsPangram(\\\"the quick brown fox jumped over the lazy dog\\\")->PrintLine(); # false, no s\\n IsPangram(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\")->PrintLine(); # true\\n IsPangram(\\\"ABCDEFGHIJKLMNOPQSTUVWXYZ\\\")->PrintLine(); # false, no r\\n IsPangram(\\\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\\\")->PrintLine(); # false, no m\\n IsPangram(\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\")->PrintLine(); # true\\n IsPangram(\\\"\\\")->PrintLine(); # false\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"let pangram str =\\n let ar = Array.make 26 false in\\n String.iter (function\\n | 'a'..'z' as c -> ar.(Char.code c - Char.code 'a') <- true\\n | _ -> ()\\n ) (String.lowercase str);\\n Array.fold_left ( && ) true ar\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"let check str =\\n Printf.printf \\\" %b -- %s\\\\n\\\" (pangram str) str\\n\\nlet () =\\n check \\\"this is a sentence\\\";\\n check \\\"The quick brown fox jumps over the lazy dog.\\\";\\n;;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"declare\\n fun {IsPangram Xs}\\n {List.sub\\n {List.number &a &z 1}\\n {Sort {Map Xs Char.toLower} Value.'<'}}\\n end\\nin\\n {Show {IsPangram \\\"The quick brown fox jumps over the lazy dog.\\\"}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"pangram(s)={\\n s=vecsort(Vec(s),,8);\\n for(i=97,122,\\n if(!setsearch(s,Strchr(i)) && !setsearch(s,Strchr(i-32)),\\n return(0)\\n )\\n );\\n 1\\n};\\n\\npangram(\\\"The quick brown fox jumps over the lazy dog.\\\")\\npangram(\\\"The quick brown fox jumps over the lazy doe.\\\")\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nsub pangram1 {\\n my($str,@set) = @_;\\n use List::MoreUtils 'all';\\n all { $str =~ /$_/i } @set;\\n}\\n\\nsub pangram2 {\\n my($str,@set) = @_;\\n '' eq (join '',@set) =~ s/[$str]//gir;\\n}\\n\\nmy @alpha = 'a' .. 'z';\\n\\nfor (\\n 'Cozy Lummox Gives Smart Squid Who Asks For Job Pen.',\\n 'Crabby Lummox Gives Smart Squid Who Asks For Job Pen.'\\n) {\\n say pangram1($_,@alpha) ? 'Yes' : 'No';\\n say pangram2($_,@alpha) ? 'Yes' : 'No';\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pangram</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">az</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">26</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">lower</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #008000;\\\">'a'</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #008000;\\\">'z'</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">az</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">26</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">az</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">az</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">96</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">checks</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"The quick brown fox jumped over the lazy dog\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"The quick brown fox jumps over the lazy dog\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\".!$\\\\\\\"AbCdEfghijklmnoprqstuvwxyz\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"THE FIVE BOXING WIZARDS DUMP QUICKLY.\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"THE FIVE BOXING WIZARDS JUMP QUICKLY.\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"HEAVY BOXES PERFORM WALTZES AND JIGS.\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"PACK MY BOX WITH FIVE DOZEN LIQUOR JUGS.\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"Big fjiords vex quick waltz nymph\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"The quick onyx goblin jumps over the lazy dwarf.\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">\\\"no\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">checks</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ci</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">checks</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pangram</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ci</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%-50s - %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">ci</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"yes\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">\\\"no \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"include ..\\\\Utilitys.pmt\\n\\ndef pangram?\\n\\tlower \\\"abcdefghijklmnopqrstuvwxyz\\\" swap remove len not nip\\nenddef\\n\\n\\\"The quick brown fox jumps over the lazy dog.\\\" pangram?\\n\\\"This is a test\\\" pangram?\\n\\\"NOPQRSTUVWXYZ abcdefghijklm\\\" pangram?\\n\\\"abcdefghijklopqrstuvwxyz\\\" pangram?\\n\\npstack\\n\",\n \"language\": \"Phixmonti\"\n },\n {\n \"code\": \"function isPangram($text) {\\n foreach (str_split($text) as $c) {\\n if ($c >= 'a' && $c <= 'z')\\n $bitset |= (1 << (ord($c) - ord('a')));\\n else if ($c >= 'A' && $c <= 'Z')\\n $bitset |= (1 << (ord($c) - ord('A')));\\n }\\n return $bitset == 0x3ffffff;\\n}\\n\\n$test = array(\\n \\\"the quick brown fox jumps over the lazy dog\\\",\\n \\\"the quick brown fox jumped over the lazy dog\\\",\\n \\\"ABCDEFGHIJKLMNOPQSTUVWXYZ\\\",\\n \\\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\\\",\\n \\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\"\\n);\\n\\nforeach ($test as $str)\\n echo \\\"$str : \\\", isPangram($str) ? 'T' : 'F', '</br>';\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"function is_pangram( $sentence ) {\\n\\n // define \\\"alphabet\\\"\\n $alpha = range( 'a', 'z' );\\n\\n // split lowercased string into array\\n $a_sentence = str_split( strtolower( $sentence ) );\\n\\n // check that there are no letters present in alpha not in sentence\\n return empty( array_diff( $alpha, $a_sentence ) );\\n\\n}\\n\\n$tests = array(\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"The brown fox jumps over the lazy dog.\\\",\\n \\\"ABCDEFGHIJKL.NOPQRSTUVWXYZ\\\",\\n \\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\",\\n \\\"How vexingly quick daft zebras jump\\\",\\n \\\"Is hotdog?\\\",\\n \\\"How razorback-jumping frogs can level six piqued gymnasts!\\\"\\n);\\n\\nforeach ( $tests as $txt ) {\\n echo '\\\"', $txt, '\\\"', PHP_EOL;\\n echo is_pangram( $txt ) ? \\\"Yes\\\" : \\\"No\\\", PHP_EOL, PHP_EOL;\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"go =>\\n S1 = \\\"The quick brown fox jumps over the lazy dog\\\",\\n S2 = \\\"The slow brown fox jumps over the lazy dog\\\",\\n println([S1, is_pangram(S1)]),\\n println([S2, is_pangram(S2)]),\\n nl,\\n println(\\\"With missing chars:\\\"),\\n println([S1, is_pangram2(S1)]),\\n println([S2, is_pangram2(S2)]),\\n nl.\\n\\n% Check if S is a pangram and get the missing chars\\nis_pangram(S) = P =>\\n Lower = S.to_lowercase,\\n Alpha = [chr(I+96) : I in 1..26],\\n foreach(A in Alpha) membchk(A,Lower) end -> P = true ; P = false.\\n\\n% Check if S is a pangram and get the missing chars (if any)\\nis_pangram2(S) = [pangram=cond(Missing==[],true,false),missing=Missing] =>\\n Lower = S.to_lowercase,\\n Missing = [A : A in [chr(I+96) : I in 1..26], not membchk(A,Lower)].\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de isPangram (Str)\\n (not\\n (diff\\n '`(chop \\\"abcdefghijklmnopqrstuvwxyz\\\")\\n (chop (lowc Str)) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"test_pangram: procedure options (main);\\n\\nis_pangram: procedure() returns (bit(1) aligned);\\n\\n declare text character (200) varying;\\n declare c character (1);\\n\\n get edit (text) (L);\\n put skip list (text);\\n\\n text = lowercase(text);\\n\\n do c = 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',\\n 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',\\n 'v', 'w', 'x', 'y', 'z';\\n if index(text, c) = 0 then return ('0'b);\\n end;\\n return ('1'b);\\nend is_pangram;\\n\\n put skip list ('Please type a sentence');\\n\\n if is_pangram() then\\n put skip list ('The sentence is a pangram.');\\n else\\n put skip list ('The sentence is not a pangram.');\\n\\nend test_pangram;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"function Test-Pangram ( [string]$Text, [string]$Alphabet = 'abcdefghijklmnopqrstuvwxyz' )\\n {\\n $Text = $Text.ToLower()\\n $Alphabet = $Alphabet.ToLower()\\n\\n $IsPangram = @( $Alphabet.ToCharArray() | Where-Object { $Text.Contains( $_ ) } ).Count -eq $Alphabet.Length\\n\\n return $IsPangram\\n }\\n\\nTest-Pangram 'The quick brown fox jumped over the lazy dog.'\\nTest-Pangram 'The quick brown fox jumps over the lazy dog.'\\nTest-Pangram 'Съешь же ещё этих мягких французских булок, да выпей чаю' 'абвгдежзийклмнопрстуфхцчшщъыьэюяё'\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Function Test-Pangram ( [string]$Text, [string]$Alphabet = 'abcdefghijklmnopqrstuvwxyz' )\\n{\\n $alSet = [Collections.Generic.HashSet[char]]::new($Alphabet.ToLower())\\n $textSet = [Collections.Generic.HashSet[char]]::new($Text.ToLower())\\n\\n $alSet.ExceptWith($textSet) # remove text chars from the alphabet\\n\\n return $alSet.Count -eq 0 # any alphabet letters still remaining?\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"pangram(L) :-\\n\\tnumlist(0'a, 0'z, Alphabet),\\n\\tforall(member(C, Alphabet), member(C, L)).\\n\\npangram_example :-\\n\\tL1 = \\\"the quick brown fox jumps over the lazy dog\\\",\\n\\t( pangram(L1) -> R1= ok; R1 = ko),\\n\\tformat('~s --> ~w ~n', [L1,R1]),\\n\\n\\tL2 = \\\"the quick brown fox jumped over the lazy dog\\\",\\n\\t( pangram(L2) -> R2 = ok; R2 = ko),\\n\\tformat('~s --> ~w ~n', [L2, R2]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure IsPangram_fast(String$)\\n String$ = LCase(string$)\\n char_a=Asc(\\\"a\\\")\\n ; sets bits in a variable if a letter is found, reads string only once\\n For a = 1 To Len(string$)\\n char$ = Mid(String$, a, 1)\\n pos = Asc(char$) - char_a\\n check.l | 1 << pos\\n Next\\n If check & $3FFFFFF = $3FFFFFF\\n ProcedureReturn 1\\n EndIf\\n ProcedureReturn 0\\nEndProcedure\\n\\nProcedure IsPangram_simple(String$)\\n String$ = LCase(string$)\\n found = 1\\n For a = Asc(\\\"a\\\") To Asc(\\\"z\\\")\\n ; searches for every letter in whole string\\n If FindString(String$, Chr(a), 0) = 0\\n found = 0\\n EndIf\\n Next\\n ProcedureReturn found\\nEndProcedure\\n\\nDebug IsPangram_fast(\\\"The quick brown fox jumps over lazy dogs.\\\")\\nDebug IsPangram_simple(\\\"The quick brown fox jumps over lazy dogs.\\\")\\nDebug IsPangram_fast(\\\"No pangram\\\")\\nDebug IsPangram_simple(\\\"No pangram\\\")\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import string, sys\\nif sys.version_info[0] < 3:\\n input = raw_input\\n\\ndef ispangram(sentence, alphabet=string.ascii_lowercase):\\n alphaset = set(alphabet)\\n return alphaset <= set(sentence.lower())\\n\\nprint ( ispangram(input('Sentence: ')) )\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"DECLARE FUNCTION IsPangram! (sentence AS STRING)\\n\\nDIM x AS STRING\\n\\nx = \\\"My dog has fleas.\\\"\\nGOSUB doIt\\nx = \\\"The lazy dog jumps over the quick brown fox.\\\"\\nGOSUB doIt\\nx = \\\"Jackdaws love my big sphinx of quartz.\\\"\\nGOSUB doIt\\nx = \\\"What's a jackdaw?\\\"\\nGOSUB doIt\\n\\nEND\\n\\ndoIt:\\n PRINT IsPangram!(x), x\\n RETURN\\n\\nFUNCTION IsPangram! (sentence AS STRING)\\n 'returns -1 (true) if sentence is a pangram, 0 (false) otherwise\\n DIM l AS INTEGER, s AS STRING, t AS INTEGER\\n DIM letters(25) AS INTEGER\\n\\n FOR l = 1 TO LEN(sentence)\\n s = UCASE$(MID$(sentence, l, 1))\\n SELECT CASE s\\n CASE \\\"A\\\" TO \\\"Z\\\"\\n t = ASC(s) - 65\\n letters(t) = 1\\n END SELECT\\n NEXT\\n\\n FOR l = 0 TO 25\\n IF letters(l) < 1 THEN\\n IsPangram! = 0\\n EXIT FUNCTION\\n END IF\\n NEXT\\n\\n IsPangram! = -1\\nEND FUNCTION\\n\",\n \"language\": \"QBasic\"\n },\n {\n \"code\": \" [ dup char A char [ within\\n swap char a char { within\\n or ] is letter ( c --> b )\\n\\n [ 0 26 of swap witheach\\n [ dup letter iff\\n [ 1 unrot lower\\n char a - poke ]\\n else drop ]\\n 0 swap find 26 = ] is pangram ( $ --> b )\\n\\n $ \\\"This is a sentence.\\\" pangram echo cr ( 0 )\\n $ \\\"The five boxing wizards jumped quickly.\\\" pangram echo cr ( 1 )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"checkPangram <- function(sentence){\\n my.letters <- tolower(unlist(strsplit(sentence, \\\"\\\")))\\n is.pangram <- all(letters %in% my.letters)\\n\\n if (is.pangram){\\n cat(\\\"\\\\\\\"\\\", sentence, \\\"\\\\\\\" is a pangram! \\\\n\\\", sep=\\\"\\\")\\n } else {\\n cat(\\\"\\\\\\\"\\\", sentence, \\\"\\\\\\\" is not a pangram! \\\\n\\\", sep=\\\"\\\")\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(define (pangram? str)\\n (define chars (regexp-replace* #rx\\\"[^a-z]+\\\" (string-downcase str) \\\"\\\"))\\n (= 26 (length (remove-duplicates (string->list chars)))))\\n(pangram? \\\"The quick Brown Fox jumps over the Lazy Dog\\\")\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"constant Eng = set 'a' .. 'z';\\nconstant Cyr = (set 'а' .. 'ё') (-) (set 'ъ', 'ѐ');\\nconstant Hex = set 'a' .. 'f';\\n\\nsub pangram($str, Set $alpha = Eng) {\\n $alpha ⊆ $str.lc.comb\\n}\\n\\nsay pangram(\\\"The quick brown fox jumps over the lazy dog.\\\");\\nsay pangram(\\\"My dog has fleas.\\\");\\nsay pangram(\\\"My dog has fleas.\\\", Hex);\\nsay pangram(\\\"My dog backs fleas.\\\", Hex);\\nsay pangram \\\"Съешь же ещё этих мягких французских булок, да выпей чаю\\\", Cyr;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"'abcdefghijklmnopqrstuvwxyz 'FULL s:const\\n'__________________________ 'TEST s:const\\n:s:pangram? (s-f)\\n '__________________________ &TEST #26 copy\\n s:to-lower [ c:letter? ] s:filter\\n [ dup $a - &TEST + store ] s:for-each\\n &TEST &FULL s:eq? ;\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program verifies if an entered/supplied string (sentence) is a pangram. */\\n@abc= 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' /*a list of all (Latin) capital letters*/\\n\\n do forever; say /*keep promoting 'til null (or blanks).*/\\n say '──────── Please enter a pangramic sentence (or a blank to quit):'; say\\n pull y /*this also uppercases the Y variable.*/\\n if y='' then leave /*if nothing entered, then we're done.*/\\n absent= space( translate( @abc, , y), 0) /*obtain a list of any absent letters. */\\n if absent=='' then say \\\"──────── Sentence is a pangram.\\\"\\n else say \\\"──────── Sentence isn't a pangram, missing: \\\" absent\\n say\\n end /*forever*/\\n\\nsay '──────── PANGRAM program ended. ────────' /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"pangram = 0\\ns = \\\"The quick brown fox jumps over the lazy dog.\\\"\\nsee \\\"\\\" + pangram(s) + \\\" \\\" + s + nl\\n\\ns = \\\"My dog has fleas.\\\"\\nsee \\\"\\\" + pangram(s) + \\\" \\\" + s + nl\\n\\nfunc pangram str\\n str = lower(str)\\n for i = ascii(\\\"a\\\") to ascii(\\\"z\\\")\\n bool = substr(str, char(i)) > 0\\n pangram = pangram + bool\\n next\\n pan = (pangram = 26)\\n return pan\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def pangram?(sentence)\\n s = sentence.downcase\\n ('a'..'z').all? {|char| s.include? (char) }\\nend\\n\\np pangram?('this is a sentence') # ==> false\\np pangram?('The quick brown fox jumps over the lazy dog.') # ==> true\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"s$ = \\\"The quick brown fox jumps over the lazy dog.\\\"\\nPrint pangram(s$);\\\" \\\";s$\\n\\ns$ = \\\"My dog has fleas.\\\"\\nPrint pangram(s$);\\\" \\\";s$\\n\\nfunction pangram(str$)\\n str$ = lower$(str$)\\n for i = asc(\\\"a\\\") to asc(\\\"z\\\")\\n pangram = pangram + (instr(str$, chr$(i)) <> 0)\\n next i\\npangram = (pangram = 26)\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"#![feature(test)]\\n\\nextern crate test;\\n\\nuse std::collections::HashSet;\\n\\npub fn is_pangram_via_bitmask(s: &str) -> bool {\\n\\n // Create a mask of set bits and convert to false as we find characters.\\n let mut mask = (1 << 26) - 1;\\n\\n for chr in s.chars() {\\n let val = chr as u32 & !0x20; /* 0x20 converts lowercase to upper */\\n if val <= 'Z' as u32 && val >= 'A' as u32 {\\n mask = mask & !(1 << (val - 'A' as u32));\\n }\\n }\\n\\n mask == 0\\n}\\n\\npub fn is_pangram_via_hashset(s: &str) -> bool {\\n\\n // Insert lowercase letters into a HashSet, then check if we have at least 26.\\n let letters = s.chars()\\n .flat_map(|chr| chr.to_lowercase())\\n .filter(|&chr| chr >= 'a' && chr <= 'z')\\n .fold(HashSet::new(), |mut letters, chr| {\\n letters.insert(chr);\\n letters\\n });\\n\\n letters.len() == 26\\n}\\n\\npub fn is_pangram_via_sort(s: &str) -> bool {\\n\\n // Copy chars into a vector, convert to lowercase, sort, and remove duplicates.\\n let mut chars: Vec<char> = s.chars()\\n .flat_map(|chr| chr.to_lowercase())\\n .filter(|&chr| chr >= 'a' && chr <= 'z')\\n .collect();\\n\\n chars.sort();\\n chars.dedup();\\n\\n chars.len() == 26\\n}\\n\\nfn main() {\\n\\n let examples = [\\\"The quick brown fox jumps over the lazy dog\\\",\\n \\\"The quick white cat jumps over the lazy dog\\\"];\\n\\n for &text in examples.iter() {\\n let is_pangram_sort = is_pangram_via_sort(text);\\n println!(\\\"Is \\\\\\\"{}\\\\\\\" a pangram via sort? - {}\\\", text, is_pangram_sort);\\n\\n let is_pangram_bitmask = is_pangram_via_bitmask(text);\\n println!(\\\"Is \\\\\\\"{}\\\\\\\" a pangram via bitmask? - {}\\\",\\n text,\\n is_pangram_bitmask);\\n\\n let is_pangram_hashset = is_pangram_via_hashset(text);\\n println!(\\\"Is \\\\\\\"{}\\\\\\\" a pangram via bitmask? - {}\\\",\\n text,\\n is_pangram_hashset);\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"def is_pangram(sentence: String) = sentence.toLowerCase.filter(c => c >= 'a' && c <= 'z').toSet.size == 26\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"scala> is_pangram(\\\"This is a sentence\\\")\\nres0: Boolean = false\\n\\nscala> is_pangram(\\\"The quick brown fox jumps over the lazy dog\\\")\\nres1: Boolean = true\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func boolean: isPangram (in string: stri) is func\\n result\\n var boolean: isPangram is FALSE;\\n local\\n var char: ch is ' ';\\n var set of char: usedChars is (set of char).value;\\n begin\\n for ch range lower(stri) do\\n if ch in {'a' .. 'z'} then\\n incl(usedChars, ch);\\n end if;\\n end for;\\n isPangram := usedChars = {'a' .. 'z'};\\n end func;\\n\\nconst proc: main is func\\n begin\\n writeln(isPangram(\\\"This is a test\\\"));\\n writeln(isPangram(\\\"The quick brown fox jumps over the lazy dog\\\"));\\n writeln(isPangram(\\\"NOPQRSTUVWXYZ abcdefghijklm\\\"));\\n writeln(isPangram(\\\"abcdefghijklopqrstuvwxyz\\\")); # Missing m, n\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"define Eng = 'a'..'z';\\ndefine Hex = 'a'..'f';\\ndefine Cyr = %w(а б в г д е ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я ё);\\n\\nfunc pangram(str, alpha=Eng) {\\n var lstr = str.lc;\\n alpha.all {|c| lstr.contains(c) };\\n}\\n\\nsay pangram(\\\"The quick brown fox jumps over the lazy dog.\\\");\\nsay pangram(\\\"My dog has fleas.\\\");\\nsay pangram(\\\"My dog has fleas.\\\", Hex);\\nsay pangram(\\\"My dog backs fleas.\\\", Hex);\\nsay pangram(\\\"Съешь же ещё этих мягких французских булок, да выпей чаю\\\", Cyr);\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" 10 LET A$=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n 20 LET L=26\\n 30 INPUT P$\\n 40 IF LEN P$<26 THEN GOTO 170\\n 50 FAST\\n 60 LET C=1\\n 70 IF P$(C)<\\\"A\\\" OR P$(C)>\\\"Z\\\" THEN GOTO 120\\n 80 IF A$(CODE P$(C)-37)=\\\" \\\" THEN GOTO 120\\n 90 LET A$(CODE P$(C)-37)=\\\" \\\"\\n100 LET L=L-1\\n110 IF L=0 THEN GOTO 150\\n120 IF C=LEN P$ THEN GOTO 170\\n130 LET C=C+1\\n140 GOTO 70\\n150 PRINT \\\"PANGRAM\\\"\\n160 GOTO 180\\n170 PRINT \\\"NOT A PANGRAM\\\"\\n180 SLOW\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"!String methodsFor: 'testing'!\\nisPangram\\n\\t^((self collect: [:c | c asUppercase]) select: [:c | c >= $A and: [c <= $Z]]) asSet size = 26\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \"'The quick brown fox jumps over the lazy dog.' isPangram\\n\",\n \"language\": \"Smalltalk\"\n },\n {\n \"code\": \" define('pangram(str)alfa,c') :(pangram_end)\\npangram str = replace(str,&ucase,&lcase)\\n alfa = &lcase\\npgr_1 alfa len(1) . c = :f(return)\\n str c :s(pgr_1)f(freturn)\\npangram_end\\n\\n define('panchk(str)tf') :(panchk_end)\\npanchk output = str\\n tf = 'False'; tf = pangram(str) 'True'\\n output = 'Pangram: ' tf :(return)\\npanchk_end\\n\\n* # Test and display\\n panchk(\\\"The quick brown fox jumped over the lazy dogs.\\\")\\n panchk(\\\"My girl wove six dozen plaid jackets before she quit.\\\")\\n panchk(\\\"This 41-character string: it's a pangram!\\\")\\nend\\n\",\n \"language\": \"SNOBOL4\"\n },\n {\n \"code\": \"import Foundation\\n\\nlet str = \\\"the quick brown fox jumps over the lazy dog\\\"\\n\\nfunc isPangram(str:String) -> Bool {\\n let stringArray = Array(str.lowercaseString)\\n for char in \\\"abcdefghijklmnopqrstuvwxyz\\\" {\\n if (find(stringArray, char) == nil) {\\n return false\\n }\\n }\\n return true\\n}\\n\\nisPangram(str) // True\\nisPangram(\\\"Test string\\\") // False\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"func isPangram(str: String) -> Bool {\\n let (char, alph) = (Set(str.characters), \\\"abcdefghijklmnopqrstuvwxyz\\\".characters)\\n return !alph.contains {!char.contains($0)}\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc pangram? {sentence} {\\n set letters [regexp -all -inline {[a-z]} [string tolower $sentence]]\\n expr {\\n [llength [lsort -unique $letters]] == 26\\n }\\n}\\nputs [pangram? \\\"This is a sentence\\\"]; # ==> false\\nputs [pangram? \\\"The quick brown fox jumps over the lazy dog.\\\"]; # ==> true\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \":Prompt Str1\\n:For(L,1,26\\n:If not(inString(Str1,sub(\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",L,1))\\n:L=28\\n:End\\n:If L<28\\n:Disp \\\"IS A PANGRAM\\\"\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"$$ MODE TUSCRIPT,{}\\nalfabet=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\nsentences = *\\nDATA The quick brown fox jumps over the lazy dog\\nDATA the quick brown fox falls over the lazy dog\\nLOOP s=sentences\\n getchars =STRINGS (s,\\\" {&a} \\\")\\n sortchars =ALPHA_SORT (getchars)\\n reducechars =REDUCE (sortchars)\\n chars_in_s =EXCHANGE (reducechars,\\\" ' \\\")\\n IF (chars_in_s==alfabet) PRINT \\\" pangram: \\\",s\\n IF (chars_in_s!=alfabet) PRINT \\\"no pangram: \\\",s\\nENDLOOP\\n\",\n \"language\": \"TUSCRIPT\"\n },\n {\n \"code\": \"@/.*[Aa].*&.*[Bb].*&.*[Cc].*&.*[Dd].*& \\\\\\n .*[Ee].*&.*[Ff].*&.*[Gg].*&.*[Hh].*& \\\\\\n .*[Ii].*&.*[Jj].*&.*[Kk].*&.*[Ll].*& \\\\\\n .*[Mm].*&.*[Nn].*&.*[Oo].*&.*[Pp].*& \\\\\\n .*[Qq].*&.*[Rr].*&.*[Ss].*&.*[Tt].*& \\\\\\n .*[Uu].*&.*[Vv].*&.*[Ww].*&.*[Xx].*& \\\\\\n .*[Yy].*&.*[Zz].*/\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"function is_pangram {\\n typeset alphabet=abcdefghijklmnopqrstuvwxyz\\n typeset -l string=$*\\n while [[ -n $string && -n $alphabet ]]; do\\n typeset ch=${string%%${string#?}}\\n string=${string#?}\\n alphabet=${alphabet/$ch}\\n done\\n [[ -z $alphabet ]]\\n}\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n\\nis_pangram = ^jZ^(!@l,*+ @rlp -:~&) ~=`A-~ letters\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %bL\\n\\ntest =\\n\\nis_pangram* <\\n 'The quick brown fox jumps over the lazy dog',\\n 'this is not a pangram'>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Function pangram2(s As String) As Boolean\\n Const sKey As String = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n Dim sLow As String\\n Dim i As Integer\\n\\n sLow = LCase(s)\\n For i = 1 To 26\\n If InStr(sLow, Mid(sKey, i, 1)) = 0 Then\\n pangram2 = False\\n Exit Function\\n End If\\n Next\\n pangram2 = True\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"function pangram( s )\\n\\tdim i\\n\\tdim sKey\\n\\tdim sChar\\n\\tdim nOffset\\n\\tsKey = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\tfor i = 1 to len( s )\\n\\t\\tsChar = lcase(mid(s,i,1))\\n\\t\\tif sChar <> \\\" \\\" then\\n\\t\\t\\tif instr(sKey, sChar) then\\n\\t\\t\\t\\tnOffset = asc( sChar ) - asc(\\\"a\\\") + 1\\n\\t\\t\\t\\tif nOffset > 1 then\\n\\t\\t\\t\\t\\tsKey = left(sKey, nOffset - 1) & \\\" \\\" & mid( sKey, nOffset + 1)\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tsKey = \\\" \\\" & mid( sKey, nOffset + 1)\\n\\t\\t\\t\\tend if\\n\\t\\t\\tend if\\n\\t\\tend if\\n\\tnext\\n\\tpangram = ( ltrim(sKey) = vbnullstring )\\nend function\\n\\nfunction eef( bCond, exp1, exp2 )\\n\\tif bCond then\\n\\t\\teef = exp1\\n\\telse\\n\\t\\teef = exp2\\n\\tend if\\nend function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"wscript.echo eef(pangram(\\\"a quick brown fox jumps over the lazy dog\\\"), \\\"is a pangram\\\", \\\"is not a pangram\\\")\\nwscript.echo eef(pangram(\\\"\\\"), \\\"is a pangram\\\", \\\"is not a pangram\\\")\\\"\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"10 I=1\\n20 :I)=0\\n30 I=I+1\\n40 #=26>I*20\\n50 ?=\\\"Enter sentence: \\\";\\n60 C=$\\n70 #=C=13*120\\n80 C=C<97*32+C-96\\n90 #=C>27*60\\n100 :C)=1\\n110 #=60\\n120 ?=\\\"\\\"\\n130 I=1\\n140 N=0\\n150 N=N+:I)\\n160 I=I+1\\n170 #=26>I*150\\n180 #=N=26*200\\n190 ?=\\\"not \\\";\\n200 ?=\\\"a pangram\\\"\\n\",\n \"language\": \"VTL-2\"\n },\n {\n \"code\": \"import \\\"./str\\\" for Str\\n\\nvar isPangram = Fn.new { |s|\\n s = Str.lower(s)\\n var used = List.filled(26, false)\\n for (cp in s.codePoints) {\\n if (cp >= 97 && cp <= 122) used[cp-97] = true\\n }\\n for (u in used) if (!u) return false\\n return true\\n}\\n\\nvar candidates = [\\n \\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"New job: fix Mr. Gluck's hazy TV, PDQ!\\\",\\n \\\"Peter Piper picked a peck of pickled peppers.\\\",\\n \\\"Sphinx of black quartz, judge my vow.\\\",\\n \\\"Foxy diva Jennifer Lopez wasn’t baking my quiche.\\\",\\n \\\"Grumpy wizards make a toxic stew for the jovial queen.\\\"\\n]\\n\\nSystem.print(\\\"Are the following pangrams?\\\")\\nfor (candidate in candidates) {\\n System.print(\\\" %(candidate) -> %(isPangram.call(candidate))\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes; \\\\intrinsic 'code' declarations\\nstring 0; \\\\use zero-terminated strings\\n\\nfunc StrLen(Str); \\\\Return number of characters in an ASCIIZ string\\nchar Str;\\nint I;\\nfor I:= 0 to -1>>1-1 do\\n if Str(I) = 0 then return I;\\n\\nfunc Pangram(S);\\nchar S;\\nint A, I, C;\\n[A:= 0;\\nfor I:= 0 to StrLen(S)-1 do\\n [C:= S(I);\\n if C>=^A & C<=^Z then C:= C or $20;\\n if C>=^a & C<=^z then [C:= C - ^a; A:= A or 1<<C];\\n ];\\nreturn A = $3FFFFFF;\\n]; \\\\Pangram\\n\\nint Sentence, I;\\n[Sentence:=\\n [\\\"The quick brown fox jumps over the lazy dog.\\\",\\n \\\"Pack my box with five dozen liquor jugs.\\\",\\n \\\"Now is the time for all good men to come to the aid of their country.\\\"];\\nfor I:= 0 to 3-1 do\\n [Text(0, if Pangram(Sentence(I)) then \\\"yes\\\" else \\\"no\\\");\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"sub isPangram$(t$, l1$)\\n\\tlocal lt, ll, r$, i, cc, ic\\n\\n\\tif numparams = 1 then\\n\\t\\tl1$ = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n\\tend if\\n\\n\\tt$ = lower$(t$)\\n\\tll = len(l1$)\\n\\tfor i = 1 to ll\\n\\t\\tr$ = r$ + \\\" \\\"\\n\\tnext\\n\\tlt = len(t$)\\n\\tcc = asc(\\\"a\\\")\\n\\n\\tfor i = 1 to lt\\n\\t\\tic = asc(mid$(t$, i, 1)) - cc + 1\\n\\t\\tif ic > 0 and ic <= ll then\\n\\t\\t\\tmid$(r$, ic, 1) = chr$(ic + cc - 1)\\n\\t\\tend if\\n\\tnext i\\n\\n\\tif l1$ = r$ then return \\\"true\\\" else return \\\"false\\\" end if\\n\\nend sub\\n\\nprint isPangram$(\\\"The quick brown fox jumps over the lazy dog.\\\") // --> true\\nprint isPangram$(\\\"The quick brown fox jumped over the lazy dog.\\\") // --> false\\nprint isPangram$(\\\"ABC.D.E.FGHI*J/KL-M+NO*PQ R\\\\nSTUVWXYZ\\\") // --> true\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"var letters=[\\\"a\\\"..\\\"z\\\"].pump(String); //-->\\\"abcdefghijklmnopqrstuvwxyz\\\"\\nfcn isPangram(text){(not (letters-text.toLower()))}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pangram-checker"}}},{"rowIdx":1480,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Paraffins\n","language":"00-META"},{"code":"This organic chemistry task is essentially to implement a tree enumeration algorithm.\n\n\n;Task:\nEnumerate, without repetitions and in order of increasing size, all possible paraffin molecules (also known as [[wp:alkane|alkane]]s). \n\n\nParaffins are built up using only carbon atoms, which has four bonds, and hydrogen, which has one bond. All bonds for each atom must be used, so it is easiest to think of an alkane as linked carbon atoms forming the \"backbone\" structure, with adding hydrogen atoms linking the remaining unused bonds.\n\nIn a paraffin, one is allowed neither double bonds (two bonds between the same pair of atoms), nor cycles of linked carbons. So all paraffins with '''n''' carbon atoms share the empirical formula <big>C<sub>n</sub>H<sub>2n+2</sub></big>\n\nBut for all '''n''' ≥ 4 there are several distinct molecules (\"isomers\") with the same formula but different structures. \n\nThe number of isomers rises rather rapidly when '''n''' increases. \n\nIn counting isomers it should be borne in mind that the four bond positions on a given carbon atom can be freely interchanged and bonds rotated (including 3-D \"out of the paper\" rotations when it's being observed on a flat diagram), so rotations or re-orientations of parts of the molecule (without breaking bonds) do not give different isomers. So what seem at first to be different molecules may in fact turn out to be different orientations of the same molecule.\n\n\n;Example:\nWith '''n''' = 3 there is only one way of linking the carbons despite the different orientations the molecule can be drawn; and with '''n''' = 4 there are two configurations: \n:::* a straight chain: <big>(CH<sub>3</sub>)(CH<sub>2</sub>)(CH<sub>2</sub>)(CH<sub>3</sub>)</big> \n:::* a branched chain: <big>(CH<sub>3</sub>)(CH(CH<sub>3</sub>))(CH<sub>3</sub>)</big>\n\n<br>\nDue to bond rotations, it doesn't matter which direction the branch points in. \n\nThe phenomenon of \"stereo-isomerism\" (a molecule being different from its mirror image due to the actual 3-D arrangement of bonds) is ignored for the purpose of this task.\n\nThe input is the number '''n''' of carbon atoms of a molecule (for instance '''17'''). \n\nThe output is how many different different paraffins there are with '''n''' carbon atoms (for instance 24,894 if '''n''' = 17).\n\nThe sequence of those results is visible in the OEIS entry: \n::: [[oeis:A00602|A00602: number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers]]. \n\nThe sequence is (the index starts from zero, and represents the number of carbon atoms):\n\n 1, 1, 1, 1, 2, 3, 5, 9, 18, 35, 75, 159, 355, 802, 1858, 4347, 10359,\n 24894, 60523, 148284, 366319, 910726, 2278658, 5731580, 14490245,\n 36797588, 93839412, 240215803, 617105614, 1590507121, 4111846763,\n 10660307791, 27711253769, ...\n\n\n;Extra credit:\nShow the paraffins in some way. \n\nA flat 1D representation, with arrays or lists is enough, for instance:\n\n<syntaxhighlight lang=\"text\">*Main> all_paraffins 1\n [CCP H H H H]\n*Main> all_paraffins 2\n [BCP (C H H H) (C H H H)]\n*Main> all_paraffins 3\n [CCP H H (C H H H) (C H H H)]\n*Main> all_paraffins 4\n [BCP (C H H (C H H H)) (C H H (C H H H)),\n CCP H (C H H H) (C H H H) (C H H H)]\n*Main> all_paraffins 5\n [CCP H H (C H H (C H H H)) (C H H (C H H H)),\n CCP H (C H H H) (C H H H) (C H H (C H H H)),\n CCP (C H H H) (C H H H) (C H H H) (C H H H)]\n*Main> all_paraffins 6\n [BCP (C H H (C H H (C H H H))) (C H H (C H H (C H H H))),\n BCP (C H H (C H H (C H H H))) (C H (C H H H) (C H H H)),\n BCP (C H (C H H H) (C H H H)) (C H (C H H H) (C H H H)),\n CCP H (C H H H) (C H H (C H H H)) (C H H (C H H H)),\n CCP (C H H H) (C H H H) (C H H H) (C H H (C H H H))]</syntaxhighlight>\nShowing a basic 2D ASCII-art representation of the paraffins is better; for instance (molecule names aren't necessary):\n<syntaxhighlight lang=\"text\"> methane ethane propane isobutane\n \n H H H H H H H H H\n │ │ │ │ │ │ │ │ │\n H ─ C ─ H H ─ C ─ C ─ H H ─ C ─ C ─ C ─ H H ─ C ─ C ─ C ─ H\n │ │ │ │ │ │ │ │ │\n H H H H H H H │ H\n │\n H ─ C ─ H\n │\n H</syntaxhighlight> \n\n;Links:\n* A paper that explains the problem and its solution in a functional language:\nhttp://www.cs.wright.edu/~tkprasad/courses/cs776/paraffins-turner.pdf\n\n* A Haskell implementation:\nhttps://github.com/ghc/nofib/blob/master/imaginary/paraffins/Main.hs\n\n* A Scheme implementation:\nhttp://www.ccs.neu.edu/home/will/Twobit/src/paraffins.scm\n\n* A Fortress implementation: (this site has been closed)\nhttp://java.net/projects/projectfortress/sources/sources/content/ProjectFortress/demos/turnersParaffins0.fss?rev=3005\n<br><br>\n\n","language":"00-TASK"},{"code":"V nMax = 250\nV nBranches = 4\nV rooted = [BigInt(0)] * (nMax + 1)\nV unrooted = [BigInt(0)] * (nMax + 1)\nrooted[0] = BigInt(1)\nrooted[1] = BigInt(1)\nunrooted[0] = BigInt(1)\nunrooted[1] = BigInt(1)\n\nF choose(m, k)\n I k == 1\n R m\n V result = m\n L(i) 1 .< k\n result = result * (m + i) I/ (i + 1)\n R result\n\nF tree(br, n, l, sum, cnt)\n V s = 0\n L(b) br + 1 .. :nBranches\n s = sum + (b - br) * n\n I s > :nMax {R}\n\n V c = choose(:rooted[n], b - br) * cnt\n\n I l * 2 < s {:unrooted[s] += c}\n I b == :nBranches {R}\n :rooted[s] += c\n L(m) (n - 1 .< 0).step(-1)\n tree(b, m, l, s, c)\n\nF bicenter(s)\n I (s [&] 1) == 0\n :unrooted[s] += :rooted[s I/ 2] * (:rooted[s I/ 2] + 1) I/ 2\n\nL(n) 1 .. nMax\n tree(0, n, n, 1, BigInt(1))\n bicenter(n)\n print(n‘: ’unrooted[n])\n","language":"11l"},{"code":"#include <stdio.h>\n\n#define MAX_N 33\t/* max number of tree nodes */\n#define BRANCH 4\t/* max number of edges a single node can have */\n\n/* The basic idea: a paraffin molecule can be thought as a simple tree\n with each node being a carbon atom. Counting molecules is thus the\n problem of counting free (unrooted) trees of given number of nodes.\n\n An unrooted tree needs to be uniquely represented, so we need a way\n to cannonicalize equivalent free trees. For that, we need to first\n define the cannonical form of rooted trees. Since rooted trees can\n be constructed by a root node and up to BRANCH rooted subtrees that\n are arranged in some definite order, we can define it thusly:\n * Given the root of a tree, the weight of each of its branches is\n the number of nodes contained in that branch;\n * A cannonical rooted tree would have its direct subtrees ordered\n in descending order by weight;\n * In case multiple subtrees are the same weight, they are ordered\n by some unstated, but definite, order (this code doesn't really\n care what the ordering is; it only counts the number of choices\n in such a case, not enumerating individual trees.)\n\n A rooted tree of N nodes can then be constructed by adding smaller,\n cannonical rooted trees to a root node, such that:\n * Each subtree has fewer than BRANCH branches (since it must have\n an empty slot for an edge to connect to the new root);\n * Weight of those subtrees added later are no higher than earlier\n ones;\n * Their weight total N-1.\n A rooted tree so constructed would be itself cannonical.\n\n For an unrooted tree, we can define the radius of any of its nodes:\n it's the maximum weight of any of the subtrees if this node is used\n as the root. A node is the center of a tree if it has the smallest\n radius among all the nodes. A tree can have either one or two such\n centers; if two, they must be adjacent (cf. Knuth, tAoCP 2.3.4.4).\n\n An important fact is that, a node in a tree is its sole center, IFF\n its radius times 2 is no greater than the sum of the weights of all\n branches (ibid). While we are making rooted trees, we can add such\n trees encountered to the count of cannonical unrooted trees.\n\n A bi-centered unrooted tree with N nodes can be made by joining two\n trees, each with N/2 nodes and fewer than BRANCH subtrees, at root.\n The pair must be ordered in aforementioned implicit way so that the\n product is cannonical. */\n\ntypedef unsigned long long xint;\n#define FMT \"llu\"\n\nxint rooted[MAX_N] = {1, 1, 0};\nxint unrooted[MAX_N] = {1, 1, 0};\n\n/* choose k out of m possible values; chosen values may repeat, but the\n ordering of them does not matter. It's binomial(m + k - 1, k) */\nxint choose(xint m, xint k)\n{\n\txint i, r;\n\n\tif (k == 1) return m;\n\tfor (r = m, i = 1; i < k; i++)\n\t\tr = r * (m + i) / (i + 1);\n\treturn r;\n}\n\n/* constructing rooted trees of BR branches at root, with at most\n N radius, and SUM nodes in the partial tree already built. It's\n recursive, and CNT and L carry down the number of combinations\n and the tree radius already encountered. */\nvoid tree(xint br, xint n, xint cnt, xint sum, xint l)\n{\n\txint b, c, m, s;\n\n\tfor (b = br + 1; b <= BRANCH; b++) {\n\t\ts = sum + (b - br) * n;\n\t\tif (s >= MAX_N) return;\n\n\t\t/* First B of BR branches are all of weight n; the\n\t\t rest are at most of weight N-1 */\n\t\tc = choose(rooted[n], b - br) * cnt;\n\n\t\t/* This partial tree is singly centered as is */\n\t\tif (l * 2 < s) unrooted[s] += c;\n\n\t\t/* Trees saturate at root can't be used as building\n\t\t blocks for larger trees, so forget them */\n\t\tif (b == BRANCH) return;\n\t\trooted[s] += c;\n\n\t\t/* Build the rest of the branches */\n\t\tfor (m = n; --m; ) tree(b, m, c, s, l);\n\t}\n}\n\nvoid bicenter(int s)\n{\n\tif (s & 1) return;\n\n\t/* Pick two of the half-size building blocks, allowing\n\t repetition. */\n\tunrooted[s] += rooted[s/2] * (rooted[s/2] + 1) / 2;\n}\n\nint main()\n{\n\txint n;\n\tfor (n = 1; n < MAX_N; n++) {\n\t\ttree(0, n, 1, 1, n);\n\t\tbicenter(n);\n\t\tprintf(\"%\"FMT\": %\"FMT\"\\n\", n, unrooted[n]);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <gmp.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#define MAX_BRANCH 4\n#define MAX_N 500\n\nmpz_t bcache[MAX_N + 1];\nmpz_t ucache[MAX_N + 1];\nmpz_t *rcache[MAX_N + 1][MAX_BRANCH + 1];\n\nmpz_t tmp1, tmp2;\nvoid choose(mpz_t r, mpz_t m, int k)\n{\n\tint i;\n\tmpz_set(r, m);\n\n\tmpz_add_ui(tmp1, m, 1);\n\tfor (i = 1; i < k; ) {\n\t\tmpz_mul(r, r, tmp1);\n\t\tmpz_divexact_ui(r, r, ++i);\n\n\t\tif (i >= k) break;\n\t\tmpz_add_ui(tmp1, tmp1, 1);\n\t}\n}\n\nmpz_t rtmp1, rtmp2;\nvoid calc_rooted(mpz_t res, int n, int b, int r)\n{\n\tmpz_set_ui(res, 0);\n\n\tif (n == 1 && b == 0 && r == 0) {\n\t\tmpz_set_ui(res, 1);\n\t\treturn;\n\t} else if (n <= b || n <= r || n == 1 || b == 0 || r == 0)\n\t\treturn;\n\n\tint b1, r1;\n\tfor (b1 = 1; b1 <= b && r * b1 < n; b1++) {\n\t\tchoose(rtmp1, bcache[r], b1);\n\t\tmpz_set_ui(rtmp2, 0);\n\t\tfor (r1 = 0; r1 < r && r1 + r * b1 < n; r1++)\n\t\t\tmpz_add(rtmp2, rtmp2, rcache[n - r * b1][b - b1][r1]);\n\t\t\n\t\tmpz_addmul(res, rtmp1, rtmp2);\n\t}\n}\n\nvoid calc_first_branch(int n)\n{\n\tint b, r;\n\tmpz_init_set_ui(bcache[n], 0);\n\n\tfor (b = 0; b < MAX_BRANCH; b++)\n\t\tfor (r = 0; r < n; r++)\n\t\t\tmpz_add(bcache[n], bcache[n], rcache[n][b][r]);\n}\n\nvoid calc_unrooted(int n)\n{\n\tint b, r;\n\n\tfor (b = 0; b <= MAX_BRANCH; b++) {\n\t\tmpz_t *p = malloc(sizeof(mpz_t) * n);\n\t\trcache[n][b] = p;\n\t\tfor (r = 0; r < n; r++) {\n\t\t\tmpz_init(p[r]);\n\t\t\tcalc_rooted(p[r], n, b, r);\n\t\t}\n\t}\n\n\tcalc_first_branch(n);\n\n\tmpz_init_set_ui(ucache[n], 0);\n\tfor (r = 0; r * 2 < n; r++)\n\t\tfor (b = 0; b <= MAX_BRANCH; b++)\n\t\t\tmpz_add(ucache[n], ucache[n], rcache[n][b][r]);\n\t\n\tif (!(n & 1)) {\n\t\tmpz_add_ui(rtmp1, bcache[n/2], 1);\n\t\tmpz_mul(rtmp1, rtmp1, bcache[n/2]);\n\t\tmpz_divexact_ui(rtmp1, rtmp1, 2);\n\t\tmpz_add(ucache[n], ucache[n], rtmp1);\n\t}\n}\n\nvoid init(void)\n{\n\tmpz_init(tmp1), mpz_init(tmp2);\n\tmpz_init(rtmp1), mpz_init(rtmp2);\n}\n\nint main(void)\n{\n\tint i;\n\n\tinit();\n\n\tfor (i = 0; i <= MAX_N; i++) {\n\t\tcalc_unrooted(i);\n\t\tgmp_printf(\"%d: %Zd\\n\", i, ucache[i]);\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <cstdint>\n#include <iostream>\n#include <vector>\n\nconst int32_t MAX_TREE_NODES = 52;\nconst int32_t MAX_BRANCHES = 4;\n\nstd::vector<uint64_t> rooted(MAX_TREE_NODES + 1, 0);\nstd::vector<uint64_t> unrooted(MAX_TREE_NODES + 1,0);\nstd::vector<uint64_t> count(MAX_BRANCHES, 0);\n\nvoid tree(const int32_t& branches, const int32_t& radius, const int32_t& combinations,\n\t\t const int32_t& previous_nodes, const uint64_t& branches_count) {\n\t\n\tint32_t nodes = previous_nodes;\n\tfor ( int32_t branch = branches + 1; branch <= MAX_BRANCHES; ++branch ) {\n\t\tnodes += radius;\n\n\t\tif ( nodes > MAX_TREE_NODES || ( combinations * 2 >= nodes && branch >= MAX_BRANCHES ) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tif ( branch == branches + 1 ) {\n\t\t\tcount[branches] = rooted[radius] * branches_count;\n\t\t} else {\n\t\t\tcount[branches] *= ( rooted[radius] + branch - branches - 1 );\n\t\t\tcount[branches] /= ( branch - branches );\n\t\t}\n\n\t\tif ( combinations * 2 < nodes ) {\n\t\t\tunrooted[nodes] += count[branches];\n\t\t}\n\n\t\tif ( branch < MAX_BRANCHES ) {\n\t\t\trooted[nodes] += count[branches];\n\t\t}\n\n\t\tfor ( int32_t next_radius = radius - 1; next_radius > 0; --next_radius ) {\n\t\t\ttree(branch, next_radius, combinations, nodes, count[branches]);\n\t\t}\n\t}\n}\n\nvoid bicenter(const int32_t& node) {\n\tif ( ( node & 1 ) == 0 ) {\n\t\tconst uint64_t temp = ( rooted[node / 2] + 1 ) * rooted[node / 2];\n\t\tunrooted[node] += temp / 2;\n\t}\n}\n\nint main() {\n\trooted[0] = rooted[1] = 1;\n\tunrooted[0] = unrooted[1] = 1;\n\n\tfor ( int32_t node = 1; node <= MAX_TREE_NODES; ++node ) {\n\t\ttree(0, node, node, 1, 1);\n\t\tbicenter(node);\n\t\tstd::cout << node << \": \" << unrooted[node] << std::endl;\n\t}\n}\n","language":"C++"},{"code":"import std.stdio, std.bigint;\n\nenum uint nMax = 250;\nenum uint nBranches = 4;\n\n__gshared BigInt[nMax + 1] rooted = [1.BigInt, 1.BigInt /*...*/],\n unrooted = [1.BigInt, 1.BigInt /*...*/];\n\nvoid tree(in uint br, in uint n, in uint l, in uint inSum,\n in BigInt cnt) nothrow {\n __gshared static BigInt[nBranches] c;\n\n uint sum = inSum;\n foreach (immutable b; br + 1 .. nBranches + 1) {\n sum += n;\n if (sum > nMax || (l * 2 >= sum && b >= nBranches))\n return;\n if (b == br + 1) {\n c[br] = rooted[n] * cnt;\n } else {\n c[br] *= rooted[n] + b - br - 1;\n c[br] /= b - br;\n }\n if (l * 2 < sum)\n unrooted[sum] += c[br];\n if (b < nBranches)\n rooted[sum] += c[br];\n foreach_reverse (immutable m; 1 .. n)\n tree(b, m, l, sum, c[br]);\n }\n}\n\nvoid bicenter(in uint s) nothrow {\n if ((s & 1) == 0)\n unrooted[s] += rooted[s / 2] * (rooted[s / 2] + 1) / 2;\n}\n\nvoid main() {\n foreach (immutable n; 1 .. nMax + 1) {\n tree(0, n, n, 1, 1.BigInt);\n n.bicenter;\n writeln(n, \": \", unrooted[n]);\n }\n}\n","language":"D"},{"code":"' version 31-12-2016\n' compile with: fbc -s console\n' uses gmp, translation from pascal\n\n#Include Once \"gmp.bi\"\n\nConst As Integer max_n = 500, branch = 4\n\nDim Shared As mpz_ptr rooted(), unrooted(), c()\nDim Shared As mpz_ptr cnt, tmp\n\nSub tree(br As UInteger, n As UInteger, l As UInteger, sum As UInteger, cnt As mpz_ptr)\n\n Dim As UInteger b, m\n\n For b = br +1 To branch\n sum = sum + n\n If sum > max_n Then Return\n\n ' prevent unneeded long math\n If (l * 2 >= sum) And (b >= branch) Then Return\n\n If b = (br +1) Then\n mpz_mul(c(br), rooted(n), cnt)\n Else\n mpz_add_ui(tmp, rooted(n), b - br -1)\n mpz_mul(c(br), c(br), tmp)\n mpz_divexact_ui(c(br), c(br), b - br)\n End If\n\n If l * 2 < sum Then\n mpz_add(unrooted(sum), unrooted(sum), c(br))\n End If\n If b < branch Then\n mpz_add(rooted(sum), rooted(sum), c(br))\n For m = n -1 To 1 Step -1\n tree(b, m, l, sum, c(br))\n Next\n End If\n Next\n\nEnd Sub\n\nSub bicenter(s As UInteger)\n If (s And 1) = 1 Then Return\n mpz_add_ui(tmp, rooted(s \\ 2), 1)\n mpz_mul(tmp, rooted(s \\ 2), tmp)\n mpz_tdiv_q_2exp(tmp, tmp, 1)\n mpz_add(unrooted(s), unrooted(s), tmp)\nEnd Sub\n\n' ------=< MAIN >=------\n\nDim As UInteger n, sum\nDim As ZString Ptr ans\n\nReDim rooted(max_n), unrooted(max_n)\nFor n = 0 To max_n\n rooted(n) = Allocate(Len(__mpz_struct)) : Mpz_init( rooted(n))\n unrooted(n) = Allocate(Len(__mpz_struct)) : Mpz_init(unrooted(n))\nNext\nFor n = 0 To 1\n mpz_set_ui( rooted(n), 1)\n mpz_set_ui(unrooted(n), 1)\nNext\n\nReDim c(branch -1)\nFor n = 0 To branch -1\n c(n) = Allocate(Len(__mpz_struct)) : Mpz_init(c(n))\nNext\n\ncnt = Allocate(Len(__mpz_struct)) : Mpz_init_set_ui(cnt, 1)\ntmp = Allocate(Len(__mpz_struct)) : Mpz_init(tmp)\n\nsum = 1\nFor n = 1 To max_n\n tree(0, n, n, sum, cnt)\n bicenter(n)\n 'gmp_printf(\"%d: %Zd\"+Chr(13)+Chr(10), n, unrooted(n))\n ans = Mpz_get_str (0, 10, unrooted(n))\n Print Using \"###: \"; n; : Print *ans\nNext\n\nFor n = 0 To max_n\n mpz_Clear( rooted(n))\n mpz_Clear(unrooted(n))\nNext\n\nFor n = 0 To branch -1\n mpz_clear(c(n))\nNext\n\nmpz_clear(cnt)\nmpz_clear(tmp)\n\n' empty keyboard buffer\nWhile Inkey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\nconst branches = 4\nconst nMax = 500\n\nvar rooted, unrooted [nMax + 1]big.Int\nvar c [branches]big.Int\nvar tmp = new(big.Int)\nvar one = big.NewInt(1)\n\nfunc tree(br, n, l, sum int, cnt *big.Int) {\n for b := br + 1; b <= branches; b++ {\n sum += n\n if sum > nMax {\n return\n }\n if l*2 >= sum && b >= branches {\n return\n }\n if b == br+1 {\n c[br].Mul(&rooted[n], cnt)\n } else {\n tmp.Add(&rooted[n], tmp.SetInt64(int64(b-br-1)))\n c[br].Mul(&c[br], tmp)\n c[br].Div(&c[br], tmp.SetInt64(int64(b-br)))\n }\n if l*2 < sum {\n unrooted[sum].Add(&unrooted[sum], &c[br])\n }\n if b < branches {\n rooted[sum].Add(&rooted[sum], &c[br])\n }\n for m := n - 1; m > 0; m-- {\n tree(b, m, l, sum, &c[br])\n }\n }\n}\n\nfunc bicenter(s int) {\n if s&1 == 0 {\n tmp.Rsh(tmp.Mul(&rooted[s/2], tmp.Add(&rooted[s/2], one)), 1)\n unrooted[s].Add(&unrooted[s], tmp)\n }\n}\n\nfunc main() {\n rooted[0].SetInt64(1)\n rooted[1].SetInt64(1)\n unrooted[0].SetInt64(1)\n unrooted[1].SetInt64(1)\n for n := 1; n <= nMax; n++ {\n tree(0, n, n, 1, big.NewInt(1))\n bicenter(n)\n fmt.Printf(\"%d: %d\\n\", n, &unrooted[n])\n }\n}\n","language":"Go"},{"code":"-- polynomial utils\na `nmul` n = map (*n) a\na `ndiv` n = map (`div` n) a\n\ninstance (Integral a) => Num [a] where\n (+) = zipWith (+)\n negate = map negate\n a * b = foldr f undefined b where\n f x z = (a `nmul` x) + (0 : z)\n abs _ = undefined\n signum _ = undefined\n fromInteger n = fromInteger n : repeat 0\n\n-- replace x in polynomial with x^n\nrepl a n = concatMap (: replicate (n-1) 0) a\n\n-- S2: (a^2 + b)/2\ncycleIndexS2 a b = (a*a + b)`ndiv` 2\n\n-- S4: (a^4 + 6 a^2 b + 8 a c + 3 b^2 + 6 d) / 24\ncycleIndexS4 a b c d =\t((a ^ 4) +\n\t\t\t (a ^ 2 * b) `nmul` 6 +\n\t\t\t (a * c) `nmul` 8 +\n\t\t\t (b ^ 2) `nmul` 3 +\n\t\t\t d `nmul` 6) `ndiv` 24\n\n\na598 = x1\n-- A000598: A(x) = 1 + (1/6)*x*(A(x)^3 + 3*A(x)*A(x^2) + 2*A(x^3))\nx1 = 1 : ((x1^3) + ((x2*x1)`nmul` 3) + (x3`nmul`2)) `ndiv` 6\nx2 = x1`repl`2\nx3 = x1`repl`3\nx4 = x1`repl`4\n\n-- A000678 = x CycleIndex(S4, A000598(x))\na678 = 0 : cycleIndexS4 x1 x2 x3 x4\n\n-- A000599 = CycleIndex(S2, A000598(x) - 1)\na599 = cycleIndexS2 (0 : tail x1) (0 : tail x2)\n\n-- A000602 = A000678(x) - A000599(x) + A000599(x^2)\na602 = a678 - a599 + x2\n\nmain = mapM_ print $ take 200 $ zip [0 ..] a602\n","language":"Haskell"},{"code":"import Data.Array\n\nchoose :: Integer -> Int -> Integer\nchoose m k = let kk = toInteger k in (product [m..m+kk-1]) `div` (product [1..kk])\n\nmax_branches = 4\nmax_nodes = 200\n\nbcache = listArray (0, max_nodes)\n\t[sum[rcache!n!b!r | r <- [0..n], b <- [0..max_branches-1]] | n <- [0..max_nodes]]\nbuild_block = (bcache !)\n\nrcache = listArray (0,max_nodes) [arr_b i | i <- [0..max_nodes]] where\n\tarr_b n = listArray(0,max_branches) [arr_r b n | b <- [0..max_branches]]\n\tarr_r b n = listArray(0,n) [rooted n b r | r <- [0..n]]\n\nrooted 1 0 0 = 1\nrooted 1 _ _ = 0\nrooted _ 0 _ = 0\nrooted _ _ 0 = 0\nrooted n b r\n\t| (n <= b) || (n <= r) = 0\n\t| otherwise = sum [(firsts b1) * (rests b1) | b1 <- [1..b], r * b1 < n] where\n\t\tfirsts = choose (build_block r)\n\t\trests bb = sum [rcache!(n-r*bb)!(b - bb)!r1 | r1 <- [0..r-1], r1 < (n-r*bb)]\n\nunrooted n = unicenter + bycenter where\n\tunicenter = sum [ rcache!n!b!r | b <- [0..max_branches], r <-[0..n], r * 2 < n]\n\tbycenter| odd n = 0\n\t\t| otherwise = x * (x + 1) `div` 2 where x = build_block (n `div` 2)\n\nmain = mapM_ print $ map (\\x->(x, unrooted x)) [1..max_nodes]\n","language":"Haskell"},{"code":"part3=: ;@((<@([(],.(-+/\"1))],.]+i.@(]-~1+<.@-:@-))\"0 i.@>:@<.@%&3))\n\npart4=: 3 :0\nij=.; (,.]+i.@:(]-~1+[:<.3%~y-]))&.> i.1+<.y%4\n(,.y - +/\"1) ; (<@(],\"1 0 <.@-:@(y-[) (] + i.@>:@-) {:@] >. (>.-:y)-[)~+/)\"1 ij\n)\n\nc0=: */@:{\nc1=: 13 :'(*-:@(*>:))/y{~}:x'\nc2=: 13 :'(*-:@(*>:))~/y{~}.x'\nc3=: 13 :'3!2+y{~{.x'\n\nradGenN=: [:;[:(],[:+/c0`c1`c2`c3@.(#.@(}.=}:)@[)\"1)&.>/(<1x),~part3&.>@ i.@-\n\nbcpGenN=: [: , 0 ,.~ -:@(*>:)@({~i.)\n\nc11=: 13 :'*/(y{~0 1{x), -:(*>:)y{~{:x'\nc12=: 13 :'*/(y{~0 3{x), -:(*>:)y{~2{x'\nc13=: 13 :'*/(y{~{.x) , 3!2+ y{~{: x'\nc14=: 13 :'*/(y{~_2{.x), -:(*>:)y{~{.x'\nc15=: 13 :'*/ -:(*>:) y{~0 3{x'\nc16=: 13 :'*/(y{~{:x) , 3!2+ y{~{. x'\nc17=: 13 :'4!3+y{~{.x'\n\ncassl=: c0`c11`c12`c13`c14`c15`c16`c17\n\nccpGenN=: 4 :0\nif. 0=y do. i.0 return. end.\ny{.2({.,0,}.) 0,+/@:(x cassl@.(#.@(}.=}:)@[)\"1~[)@:part4\"0 [1-.~i.y-1\n)\n\nNofParaff=: {. radGenN ((ccpGenN +:) + bcpGenN ) 2&|+<.@-:\n","language":"J"},{"code":" 6 6 $ NofParaff 36\n 1 1 1 1 2 3\n 5 9 18 35 75 159\n 355 802 1858 4347 10359 24894\n 60523 148284 366319 910726 2278658 5731580\n 14490245 36797588 93839412 240215803 617105614 1590507121\n4111846763 10660307791 27711253769 72214088660 188626236139 493782952902\n","language":"J"},{"code":"import java.math.BigInteger;\nimport java.util.Arrays;\n\nclass Test {\n final static int nMax = 250;\n final static int nBranches = 4;\n\n static BigInteger[] rooted = new BigInteger[nMax + 1];\n static BigInteger[] unrooted = new BigInteger[nMax + 1];\n static BigInteger[] c = new BigInteger[nBranches];\n\n static void tree(int br, int n, int l, int inSum, BigInteger cnt) {\n int sum = inSum;\n for (int b = br + 1; b <= nBranches; b++) {\n sum += n;\n\n if (sum > nMax || (l * 2 >= sum && b >= nBranches))\n return;\n\n BigInteger tmp = rooted[n];\n if (b == br + 1) {\n c[br] = tmp.multiply(cnt);\n } else {\n c[br] = c[br].multiply(tmp.add(BigInteger.valueOf(b - br - 1)));\n c[br] = c[br].divide(BigInteger.valueOf(b - br));\n }\n\n if (l * 2 < sum)\n unrooted[sum] = unrooted[sum].add(c[br]);\n\n if (b < nBranches)\n rooted[sum] = rooted[sum].add(c[br]);\n\n for (int m = n - 1; m > 0; m--)\n tree(b, m, l, sum, c[br]);\n }\n }\n\n static void bicenter(int s) {\n if ((s & 1) == 0) {\n BigInteger tmp = rooted[s / 2];\n tmp = tmp.add(BigInteger.ONE).multiply(rooted[s / 2]);\n unrooted[s] = unrooted[s].add(tmp.shiftRight(1));\n }\n }\n\n public static void main(String[] args) {\n Arrays.fill(rooted, BigInteger.ZERO);\n Arrays.fill(unrooted, BigInteger.ZERO);\n rooted[0] = rooted[1] = BigInteger.ONE;\n unrooted[0] = unrooted[1] = BigInteger.ONE;\n\n for (int n = 1; n <= nMax; n++) {\n tree(0, n, n, 1, BigInteger.ONE);\n bicenter(n);\n System.out.printf(\"%d: %s%n\", n, unrooted[n]);\n }\n }\n}\n","language":"Java"},{"code":"def MAX_N: 500; # imprecision begins at 46\ndef BRANCH: 4;\n\n# state: [unrooted, ra]\n# tree(br; n; l; sum; cnt) where initially: l=n, sum=1 and cnt=1\ndef tree(br; n; l; sum; cnt):\n\n # The inner function is used to implement the range(b+1; BRANCH) loop\n # as there are early exits.\n # On completion, _tree returns [unrooted, ra]\n def _tree: # state [ (b, c, sum), (unrooted, ra)]\n if length != 5 then error(\"_tree input has length \\(length)\") else . end\n | .[0] as $b | .[1] as $c | .[2] as $sum | .[3] as $unrooted | .[4] as $ra\n | if $b > BRANCH then [$unrooted, $ra]\n else\n ($sum + n) as $sum\n | if $sum >= MAX_N or\n # prevent unneeded long math\n ( l * 2 >= $sum and $b >= BRANCH) then [$unrooted, $ra] # return\n else (if $b == br + 1 then $ra[n] * cnt\n else ($c * ($ra[n] + (($b - br - 1)))) / ($b - br) | floor\n end) as $c\n | (if l * 2 < $sum then ($unrooted | .[$sum] += $c)\n else $unrooted end) as $unrooted\n | if $b >= BRANCH then [$b+1, $c, $sum, $unrooted, $ra] | _tree # next\n else [$unrooted, ($ra | .[$sum] += $c) ]\n | reduce range(1; n) as $m (.; tree($b; $m; l; $sum; $c))\n | ([$b + 1, $c, $sum] + .) | _tree\n end\n end\n end\n ;\n\n # start by incrementing b, and prepending values for (b,c,sum)\n ([br+1, cnt, sum] + .) | _tree\n;\n\n# input and output: [unrooted, ra]\ndef bicenter(s):\n if s % 2 == 1 then .\n else\n .[1][s / 2] as $aux\n | .[0][s] += ($aux * ($aux + 1)) / 2 # 2 divides odd*even\n end\n;\n\ndef array(n;init): [][n-1] = init | map(init);\n\ndef ra: array( MAX_N; 0) | .[0] = 1 | .[1] = 1;\n\ndef unrooted: ra;\n\n# See below for a simpler implementation using \"foreach\"\ndef paraffins:\n # range(1; MAX_N)\n def _paraffins(n):\n if n >= MAX_N then empty\n else tree(0; n; n; 1; 1) | bicenter(n)\n | [n, .[0][n]], # output\n _paraffins(n+1)\n end;\n [unrooted, ra] | _paraffins(1)\n;\n\nparaffins\n","language":"Jq"},{"code":"def paraffins:\n foreach range(1; MAX_N) as $n\n ( [unrooted, ra];\n tree(0; $n; $n; 1; 1) | bicenter($n);\n [$n, .[0][$n]]\n )\n;\n","language":"Jq"},{"code":"const branches = 4\nconst nmax = 500\n\nconst rooted = zeros(BigInt, nmax + 1)\nconst unrooted = zeros(BigInt, nmax + 1)\nrooted[1] = rooted[2] = unrooted[1] = unrooted[2] = 1\nconst c = zeros(BigInt, branches)\n\nfunction tree(br, n, l, sum, cnt)\n for b in br+1:branches\n sum += n\n if (sum > nmax) || (l * 2 >= sum && b >= branches)\n return\n elseif b == br + 1\n c[br + 1] = rooted[n + 1] * cnt\n else\n c[br + 1] *= rooted[n + 1] + b - br - 1\n c[br + 1] = div(c[br + 1], b - br)\n end\n if l*2 < sum\n unrooted[sum + 1] += c[br + 1]\n end\n if b < branches\n rooted[sum + 1] += c[br + 1]\n end\n for m in n-1:-1:1\n tree(b, m, l, sum, c[br + 1])\n end\n end\nend\n\nbicenter(n) = if iseven(n) unrooted[n + 1] += div(rooted[div(n, 2) + 1] * (rooted[div(n, 2) + 1] + 1), 2) end\n\nfunction paraffins()\n for n in 1:nmax\n tree(0, n, n, 1, one(BigInt))\n bicenter(n)\n println(\"$n: $(unrooted[n + 1])\")\n end\nend\n\nparaffins()\n","language":"Julia"},{"code":"// version 1.1.4-3\n\nimport java.math.BigInteger\n\nconst val MAX_N = 250\nconst val BRANCHES = 4\n\nval rooted = Array(MAX_N + 1) { if (it < 2) BigInteger.ONE else BigInteger.ZERO }\nval unrooted = Array(MAX_N + 1) { if (it < 2) BigInteger.ONE else BigInteger.ZERO }\nval c = Array(BRANCHES) { BigInteger.ZERO }\n\nfun tree(br: Int, n: Int, l: Int, s: Int, cnt: BigInteger) {\n var sum = s\n for (b in (br + 1)..BRANCHES) {\n sum += n\n if (sum > MAX_N || (l * 2 >= sum && b >= BRANCHES)) return\n\n var tmp = rooted[n]\n if (b == br + 1) {\n c[br] = tmp * cnt\n }\n else {\n val diff = (b - br).toLong()\n c[br] *= tmp + BigInteger.valueOf(diff - 1L)\n c[br] /= BigInteger.valueOf(diff)\n }\n\n if (l * 2 < sum) unrooted[sum] += c[br]\n if (b < BRANCHES) rooted[sum] += c[br]\n for (m in n - 1 downTo 1) tree(b, m, l, sum, c[br])\n }\n}\n\nfun bicenter(s: Int) {\n if ((s and 1) == 0) {\n var tmp = rooted[s / 2]\n tmp *= tmp + BigInteger.ONE\n unrooted[s] += tmp.shiftRight(1)\n }\n}\n\nfun main(args: Array<String>) {\n for (n in 1..MAX_N) {\n tree(0, n, n, 1, BigInteger.ONE)\n bicenter(n)\n println(\"$n: ${unrooted[n]}\")\n }\n}\n","language":"Kotlin"},{"code":"s[m_, p_, n_] :=\n CycleIndexPolynomial[SymmetricGroup[m],\n Table[ComposeSeries[p, x^i + O[x]^(n + 1)], {i, m}]];\nG000598[n_] := Nest[1 + x s[3, #, n] &, 1 + O[x], n];\nG000602[n_] :=\n x s[4, #, n] - s[2, # - 1, n] +\n ComposeSeries[#, x^2 + O[x]^(n + 1)] &[G000598[n]];\nA000602[n_] := SeriesCoefficient[G000602[n], n];\nA000602List[n_] := CoefficientList[G000602[n], x];\nGrid@Transpose@{Range[0, 200], A000602List@200}\n","language":"Mathematica"},{"code":"import bigints\n\nconst\n nMax: int32 = 250\n nBranches = 4\n\nvar rooted, unrooted: array[nMax + 1, BigInt]\nrooted[0..1] = [1.initBigInt, 1.initBigInt]\nunrooted[0..1] = [1.initBigInt, 1.initBigInt]\nfor i in 2 .. nMax:\n rooted[i] = 0.initBigInt\n unrooted[i] = 0.initBigInt\n\nproc choose(m: BigInt; k: int32): BigInt =\n result = m\n if k == 1: return\n for i in 1 ..< k:\n result = result * (m + i) div (i + 1)\n\nproc tree(br, n, l, sum: int32; cnt: BigInt) =\n var s: int32 = 0\n for b in br + 1 .. nBranches:\n s = sum + (b - br) * n\n if s > nMax: return\n\n let c = choose(rooted[n], b - br) * cnt\n\n if l * 2 < s: unrooted[s] += c\n if b == nBranches: return\n rooted[s] += c\n for m in countdown(n-1, 1):\n tree b, m, l, s, c\n\nproc bicenter(s: int32) =\n if (s and 1) == 0:\n unrooted[s] += rooted[s div 2] * (rooted[s div 2] + 1) div 2\n\nfor n in 1 .. nMax:\n tree 0, n, n, 1, 1.initBigInt\n n.bicenter\n echo n, \": \", unrooted[n]\n","language":"Nim"},{"code":"paraffin(p) =\n{\n local (P = p+1, R, U = R = Vec([1,1], P));\n\n for (n = 1, p,\n ((B,n,C,S,l=n) -> my(b,c,i,s);\n for (b = 1, 4-B,\n if ((s = S + b * n) < P,\n c = R[n+1] * C * prod(i = 1, b-1, (R[n+1]+i)/(i+1));\n if (l+l < s, U[s+1] += c);\n if (B+b < 4, R[s+1] += c; i = n; while (i--, self()(B+b, i, c, s, l)))))\n )(0,n,1,1);\n if (n % 2,, U[n+1] += R[n/2+1] * (R[n/2+1]+1)/2);\n print([n, U[n+1]]))\n}\n","language":"PARI-GP"},{"code":"iso(B,n,C,S,l=n) =\n{\n my (b,c,i,s);\n\n for (b = 1, 4-B,\n if ((s = S + b * n) < P,\n c = R[n+1] * C * prod(i = 1, b-1, (R[n+1]+i)/(i+1));\n if (l+l < s, U[s+1] += c);\n if (B+b < 4, R[s+1] += c; i = n; while (i--, iso(B+b, i, c, s, l)))))\n}\n\nparaffin(p) =\n{\n local (P = p+1, R, U = R = Vec([1,1], P));\n\n for (n = 1, p, iso(0, n, 1, 1);\n if (n % 2,, U[n+1] += R[n/2+1] * (R[n/2+1]+1)/2);\n print([n, U[n+1]]))\n}\n","language":"PARI-GP"},{"code":"Program Paraffins;\n\nuses\n gmp;\n\nconst\n max_n = 500;\n branch = 4;\n\nvar\n rooted, unrooted: array [0 .. max_n-1] of mpz_t;\n c: array [0 .. branch-1] of mpz_t;\n cnt, tmp: mpz_t;\n n: integer;\n fmt: pchar;\n sum: integer;\n\nprocedure tree(br, n, l: integer; sum: integer; cnt: mpz_t);\n var\n b, m: integer;\n begin\n for b := br + 1 to branch do\n begin\n sum := sum + n;\n if sum >= max_n then\n\texit;\n\n (* prevent unneeded long math *)\n if (l * 2 >= sum) and (b >= branch) then\n\texit;\n\n if b = (br + 1) then\n\tmpz_mul(c[br], rooted[n], cnt)\n else\n begin\n\tmpz_add_ui(tmp, rooted[n], b - br - 1);\n\tmpz_mul(c[br], c[br], tmp);\n\tmpz_divexact_ui(c[br], c[br], b - br);\n end;\n\n if l * 2 < sum then\n\tmpz_add(unrooted[sum], unrooted[sum], c[br]);\n\n if b < branch then\n begin\n\tmpz_add(rooted[sum], rooted[sum], c[br]);\n\tfor m := n-1 downto 1 do\n\t tree(b, m, l, sum, c[br]);\n end;\n end;\n end;\n\nprocedure bicenter(s: integer);\nbegin\n if odd(s) then\n exit;\n mpz_add_ui(tmp, rooted[s div 2], 1);\n mpz_mul(tmp, rooted[s div 2], tmp);\n mpz_tdiv_q_2exp(tmp, tmp, 1);\n\n mpz_add(unrooted[s], unrooted[s], tmp);\nend;\n\nbegin\n for n := 0 to 1 do\n begin\n mpz_init_set_ui(rooted[n], 1);\n mpz_init_set_ui(unrooted[n], 1);\n end;\n for n := 2 to max_n-1 do\n begin\n mpz_init_set_ui(rooted[n], 0);\n mpz_init_set_ui(unrooted[n], 0);\n end;\n for n := 0 to BRANCH-1 do\n mpz_init(c[n]);\n\n mpz_init(tmp);\n\n mpz_init_set_ui(cnt, 1);\n sum := 1;\n for n := 1 to MAX_N do\n begin\n tree(0, n, n, sum, cnt);\n bicenter(n);\n mp_printf('%d: %Zd'+chr(13)+chr(10), n, @unrooted[n]);\n end;\nend.\n","language":"Pascal"},{"code":"program CountAlkanes;\n\n{$mode objfpc}{$H+}\n\nuses SysUtils; // only for output\n\ntype TArrayUint64 = array of uint64;\n{\n Function to count alkanes, based on: Shinsaku Fujita,\n \"Numbers of Alkanes and Monosubstituted Alkanes.\n A Long-Standing Interdisciplinary Problem over 130 Years\",\n Bull. Chem. Soc. Jpn. Vol. 83, No. 1, 1–18 (2010)\n}\nfunction CountAlkanes() : TArrayUint64;\nconst\n MAX_RESULT_INDEX = 49; // as far as this code can get without multi-precision\n MAX_R_INDEX = MAX_RESULT_INDEX div 2;\nvar\n R : array [0..MAX_R_INDEX] of uint64;\n nrCentUnb : uint64; // number of centroidal unbalanced alkanes\n temp : uint64;\n m, n, h, i, j, k : integer;\nbegin\n SetLength( result, MAX_RESULT_INDEX + 1); // zero-based\n{\n Calculate enough of the coefficients R[], where the generating function\n r(x) = R[0] + R[1]x + R[2]x^2 + R[3]x^3 + ... satifies\n r(x) = 1 + (x/6)[r(x)^3 + 2r(x^3) + 3r(x)r(x^2)] (Fujita, equation 4)\n}\n R[0] := 1;\n n := 0;\n repeat\n if (n mod 3 = 0) then temp := 2*R[n div 3]\n else temp := 0;\n for j := 0 to (n div 2) do begin\n inc( temp, 3 * R[j] * R[n - 2*j]);\n end;\n for j := 0 to n do begin\n for k := 0 to (n - j) do begin\n inc(temp, R[j] * R[k] * R[n - j - k]);\n end;\n end;\n Assert( temp mod 6 = 0); // keep an eye on it\n inc(n);\n R[n] := temp div 6;\n until (n = MAX_R_INDEX);\n{\n Now use the generating function\n (x/24)[r(x)^4 + 3r(x^2)^2 + *r(x)r(x^3) + 6r(x)^2r(x^2) + 6r(x^4)]\n where inserting r(x) up to the term in x^m will give the number of alkanes\n of orders 2m+1 and 2m+2, as the coefficients of x^(2m+1) and x^(2m+2).\n\n Note: In Fujita's paper, equation 23, the factor is 1/24 not x/24,\n but x/24 seems to be needed to give correct results.\n}\n result[0] := 1; // conventional\n for n := 1 to MAX_RESULT_INDEX do begin\n m := (n - 1) div 2; // so n = 2*m + 1 or 2*m + 2\n temp := 0;\n\n // These loops are written for clarity not efficiency\n for k := 0 to m do begin\n for j := 0 to m do begin\n for i := 0 to m do begin\n h := n - 1 - i - j - k;\n if (h >= 0) and (h <= m) then inc( temp, R[h]*R[i]*R[j]*R[k]);\n end;\n end;\n end;\n\n if Odd(n) then begin\n for k := 0 to m do begin\n inc( temp, 3*R[k]*R[m - k]);\n end;\n end;\n\n for k := 0 to (n - 1) div 3 do begin\n j := n - 1 - 3*k;\n if (j <= m) then inc( temp, 8*R[j]*R[k]);\n end;\n\n for k := 0 to m do begin\n for j := 0 to m do begin\n i := n - 1 - 2*k - j;\n if (i >= 0) and (i <= m) then inc( temp, 6*R[i]*R[j]*R[k]);\n end;\n end;\n\n if (n mod 4 = 1) then inc( temp, 6*R[(n - 1) div 4]);\n\n Assert( temp mod 24 = 0); // keep an eye on it\n nrCentUnb := temp div 24;\n if Odd(n) then\n result[n] := nrCentUnb\n else begin\n temp := R[n div 2];\n result[n] := nrCentUnb + (temp*(temp + 1) div 2);\n end;\n end;\nend;\n\n// Call function and display the results\nvar\n nrAlkanes : TArrayUint64;\n k : integer;\nbegin\n nrAlkanes := CountAlkanes();\n for k := 0 to Length( nrAlkanes) - 1 do\n WriteLn( SysUtils.Format( '%2d %d', [k, nrAlkanes[k]]));\nend.\n","language":"Pascal"},{"code":"use Math::GMPz;\n\nmy $nmax = 250;\nmy $nbranches = 4;\n\nmy @rooted = map { Math::GMPz->new($_) } 1,1,(0) x $nmax;\nmy @unrooted = map { Math::GMPz->new($_) } 1,1,(0) x $nmax;\nmy @c = map { Math::GMPz->new(0) } 0 .. $nbranches-1;\n\nsub tree {\n my($br, $n, $l, $sum, $cnt) = @_;\n for my $b ($br+1 .. $nbranches) {\n $sum += $n;\n return if $sum > $nmax || ($l*2 >= $sum && $b >= $nbranches);\n if ($b == $br+1) {\n $c[$br] = $rooted[$n] * $cnt;\n } else {\n $c[$br] *= $rooted[$n] + $b - $br - 1;\n $c[$br] /= $b - $br;\n }\n $unrooted[$sum] += $c[$br] if $l*2 < $sum;\n return if $b >= $nbranches;\n $rooted[$sum] += $c[$br];\n for my $m (reverse 1 .. $n-1) {\n next if $sum+$m > $nmax;\n tree($b, $m, $l, $sum, $c[$br]);\n }\n }\n}\n\nsub bicenter {\n my $s = shift;\n $unrooted[$s] += $rooted[$s/2] * ($rooted[$s/2]+1) / 2 unless $s & 1;\n}\n\nfor my $n (1 .. $nmax) {\n tree(0, $n, $n, 1, Math::GMPz->new(1));\n bicenter($n);\n print \"$n: $unrooted[$n]\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">MAX_N</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">32</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">BRANCH</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">4</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rooted</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">MAX_N</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">unrooted</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">MAX_N</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">BRANCH</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tot</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">MAX_N</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">tot</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">BRANCH</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">==</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n1</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">cnt</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n1</span><span style=\"color: #0000FF;\">]+(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">))/(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">tot</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">t1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">BRANCH</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">t1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">c</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">tot</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">bicenter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">even</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">aux</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">aux</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">aux</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">MAX_N</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">bicenter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">MAX_N</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d: %d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">max_n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">200</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">branch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">4</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ivals</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">max_n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">rooted</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">max_n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ivals</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">unrooted</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">max_n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ivals</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">branch</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">tmp</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">cbr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">br</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">branch</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">n</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">max_n</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">s</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #000000;\">branch</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">br</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">mpz_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_divexact_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">br</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">s</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">u</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">branch</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cbr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">bicenter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">even</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">aux</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">u</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">aux</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">aux</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_tdiv_q_2exp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">u</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">tmp</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">cnt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">max_n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cnt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">bicenter</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">25</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">mpz_get_short_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">unrooted</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">elapsed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"int MAX_N = 300;\nint BRANCH = 4;\n\narray ra = allocate(MAX_N);\narray unrooted = allocate(MAX_N);\n\nvoid tree(int br, int n, int l, int sum, int cnt)\n{\n int c;\n for (int b = br + 1; b < BRANCH + 1; b++)\n {\n sum += n;\n if (sum >= MAX_N)\n return;\n\n // prevent unneeded long math\n if (l * 2 >= sum && b >= BRANCH)\n return;\n\n if (b == br + 1)\n {\n c = ra[n] * cnt;\n }\n else\n {\n c = c * (ra[n] + (b - br - 1)) / (b - br);\n }\n\n if (l * 2 < sum)\n unrooted[sum] += c;\n\n if (b < BRANCH)\n {\n ra[sum] += c;\n for (int m=1; m < n; m++)\n {\n tree(b, m, l, sum, c);\n }\n }\n }\n}\n\nvoid bicenter(int s)\n{\n if (!(s & 1))\n {\n int aux = ra[s / 2];\n unrooted[s] += aux * (aux + 1) / 2;\n }\n}\n\n\nvoid main()\n{\n ra[0] = ra[1] = unrooted[0] = unrooted[1] = 1;\n\n for (int n = 1; n < MAX_N; n++)\n {\n tree(0, n, n, 1, 1);\n bicenter(n);\n write(\"%d: %d\\n\", n, unrooted[n]);\n }\n}\n","language":"Pike"},{"code":"try:\n import psyco\n psyco.full()\nexcept ImportError:\n pass\n\nMAX_N = 300\nBRANCH = 4\n\nra = [0] * MAX_N\nunrooted = [0] * MAX_N\n\ndef tree(br, n, l, sum = 1, cnt = 1):\n global ra, unrooted, MAX_N, BRANCH\n for b in xrange(br + 1, BRANCH + 1):\n sum += n\n if sum >= MAX_N:\n return\n\n # prevent unneeded long math\n if l * 2 >= sum and b >= BRANCH:\n return\n\n if b == br + 1:\n c = ra[n] * cnt\n else:\n c = c * (ra[n] + (b - br - 1)) / (b - br)\n\n if l * 2 < sum:\n unrooted[sum] += c\n\n if b < BRANCH:\n ra[sum] += c;\n for m in range(1, n):\n tree(b, m, l, sum, c)\n\ndef bicenter(s):\n global ra, unrooted\n if not (s & 1):\n aux = ra[s / 2]\n unrooted[s] += aux * (aux + 1) / 2\n\n\ndef main():\n global ra, unrooted, MAX_N\n ra[0] = ra[1] = unrooted[0] = unrooted[1] = 1\n\n for n in xrange(1, MAX_N):\n tree(0, n, n)\n bicenter(n)\n print \"%d: %d\" % (n, unrooted[n])\n\nmain()\n","language":"Python"},{"code":"from itertools import count, chain, tee, islice, cycle\nfrom fractions import Fraction\nfrom sys import setrecursionlimit\nsetrecursionlimit(5000)\n\ndef frac(a,b): return a//b if a%b == 0 else Fraction(a,b)\n\n# infinite polynomial class\nclass Poly:\n def __init__(self, gen = None):\n self.gen, self.source = (None, gen) if type(gen) is Poly \\\n else (gen, None)\n\n def __iter__(self):\n # We're essentially tee'ing it everytime the iterator\n # is, well, iterated. This may be excessive.\n return Poly(self)\n\n def getsource(self):\n if self.gen == None:\n s = self.source\n s.getsource()\n s.gen, self.gen = tee(s.gen, 2)\n\n def next(self):\n self.getsource()\n return next(self.gen)\n\n __next__ = next\n\n # Overload \"<<\" as stream input operator. Hey, C++ does it.\n def __lshift__(self, a): self.gen = a\n\n # The other operators are pretty much what one would expect\n def __neg__(self): return Poly(-x for x in self)\n\n def __sub__(a, b): return a + (-b)\n\n def __rsub__(a, n):\n a = Poly(a)\n def gen():\n yield(n - next(a))\n for x in a: yield(-x)\n return Poly(gen())\n\n def __add__(a, b):\n if type(b) is Poly:\n return Poly(x + y for (x,y) in zip(a,b))\n\n a = Poly(a)\n def gen():\n yield(next(a) + b)\n for x in a: yield(x)\n\n return Poly(gen())\n\n def __radd__(a,b):\n return a + b\n\n def __mul__(a,b):\n if not type(b) is Poly:\n return Poly(x*b for x in a)\n\n def gen():\n s = Poly(cycle([0]))\n for y in b:\n s += y*a\n yield(next(s))\n\n return Poly(gen())\n\n def __rmul__(a,b): return a*b\n\n def __truediv__(a,b):\n if not type(b) is Poly:\n return Poly(frac(x, b) for x in a)\n\n a, b = Poly(a), Poly(b)\n def gen():\n r, bb = a,next(b)\n while True:\n aa = next(r)\n q = frac(aa, bb)\n yield(q)\n r -= q*b\n\n return Poly(gen())\n\n def repl(self, n):\n def gen():\n for x in self:\n yield(x)\n for i in range(n-1): yield(0)\n return Poly(gen())\n\n def __pow__(self, n):\n return Poly(self) if n == 1 else self * self**(n-1)\n\ndef S2(a,b): return (a*a + b)/2\ndef S4(a,b,c,d): return a**4/24 + a**2*b/4 + a*c/3 + b**2/8 + d/4\n\nx1 = Poly()\nx2 = x1.repl(2)\nx3 = x1.repl(3)\nx4 = x1.repl(4)\nx1 << chain([1], (x1**3 + 3*x1*x2 + 2*x3)/6)\n\na598 = x1\na678 = Poly(chain([0], S4(x1, x2, x3, x4)))\na599 = S2(x1 - 1, x2 - 1)\na602 = a678 - a599 + x2\n\nfor n,x in zip(count(0), islice(a602, 500)): print(n,x)\n","language":"Python"},{"code":"#!/usr/bin/python3\n\nfrom functools import lru_cache\n\ndef Z_S(n, f, k):\n \"\"\"\n The cycle index of the symmetric group has recurrence\n Z(S_n, f(x)) = 1/n \\sum_{i=1}^n f(x^i) Z(S_{n-i}, f(x)).\n This function finds the coefficient of x^k in Z(S_n, f(x))\n \"\"\"\n # Special case to avoid division by zero\n if n == 0:\n return 1 if k == 0 else 0\n # Special case as a speed optimisation\n if n == 1:\n return f(k)\n return sum(\n sum(f(ij // i) * Z_S(n-i, f, k - ij) for ij in range(0, k+1, i))\n for i in range(1, n+1)\n ) // n\n\n@lru_cache(maxsize=None)\ndef A000598(k): return 1 if k == 0 else Z_S(3, A000598, k-1)\n\n@lru_cache(maxsize=None)\ndef A000642(k): return Z_S(2, A000598, k)\n\ndef A000631(k): return Z_S(2, A000642, k)\n\ndef A000602(k): return A000642(k) + (A000642((k-1) // 2) if k % 2 == 1 else 0) - A000631(k-1)\n\nfor k in range(500): print(k, A000602(k))\n","language":"Python"},{"code":"#lang racket\n\n(define MAX_N 33)\n(define BRANCH 4)\n\n(define rooted (make-vector MAX_N 0))\n(define unrooted (make-vector MAX_N 0))\n(for ([i 2]) (vector-set! rooted i 1) (vector-set! unrooted i 1))\n\n(define (vector-inc! v i d) (vector-set! v i (+ d (vector-ref v i))))\n\n(define (choose m k)\n (if (= k 1) m\n (for/fold ([r m]) ([i (in-range 1 k)]) (/ (* r (+ m i)) (add1 i)))))\n\n(define (tree br n cnt sum l)\n (let/ec return\n (for ([b (in-range (add1 br) (add1 BRANCH))])\n (define s (+ sum (* (- b br) n)))\n (when (>= s MAX_N) (return))\n (define c (* (choose (vector-ref rooted n) (- b br)) cnt))\n (when (< (* l 2) s) (vector-inc! unrooted s c))\n (when (= b BRANCH) (return))\n (vector-inc! rooted s c)\n (for ([m (in-range (sub1 n) 0 -1)]) (tree b m c s l)))))\n\n(define (bicenter s)\n (when (even? s)\n (vector-inc! unrooted s (* (vector-ref rooted (/ s 2))\n (add1 (vector-ref rooted (/ s 2)))\n 1/2))))\n\n(for ([n (in-range 1 MAX_N)])\n (tree 0 n 1 1 n)\n (bicenter n)\n (printf \"~a: ~a\\n\" n (vector-ref unrooted n)))\n","language":"Racket"},{"code":"sub count-unrooted-trees(Int $max-branches, Int $max-weight) {\n my @rooted = flat 1,1,0 xx $max-weight - 1;\n my @unrooted = flat 1,1,0 xx $max-weight - 1;\n\n sub count-trees-with-centroid(Int $radius) {\n sub add-branches(\n Int $branches, # number of branches to add\n Int $w, # weight of heaviest branch to add\n Int $weight is copy, # accumulated weight of tree\n Int $choices is copy, # number of choices so far\n ) {\n $choices *= @rooted[$w];\n for 1 .. $branches -> $b {\n ($weight += $w) <= $max-weight or last;\n @unrooted[$weight] += $choices if $weight > 2*$radius;\n if $b < $branches {\n @rooted[$weight] += $choices;\n add-branches($branches - $b, $_, $weight, $choices) for 1 ..^ $w;\n $choices = $choices * (@rooted[$w] + $b) div ($b + 1);\n }\n }\n }\n add-branches($max-branches, $radius, 1, 1);\n }\n\n sub count-trees-with-bicentroid(Int $weight) {\n if $weight %% 2 {\n my \\halfs = @rooted[$weight div 2];\n @unrooted[$weight] += (halfs * (halfs + 1)) div 2;\n }\n }\n\n gather {\n take 1;\n for 1 .. $max-weight {\n count-trees-with-centroid($_);\n count-trees-with-bicentroid($_);\n take @unrooted[$_];\n }\n }\n}\n\nmy constant N = 100;\nmy @paraffins = count-unrooted-trees(4, N);\nsay .fmt('%3d'), ': ', @paraffins[$_] for flat 1 .. 30, N;\n","language":"Raku"},{"code":"/*REXX pgm enumerates (without repetition) the number of paraffins with N carbon atoms. */\nparse arg nodes . /*obtain optional argument from the CL.*/\nif nodes=='' | nodes==\",\" then nodes= 100 /*Not specified? Then use the default.*/\n rooted. = 0; rooted.0= 1; rooted.1= 1 /*define the base rooted numbers.*/\nunrooted. = 0; unrooted.0= 1; unrooted.1= 1 /* \" \" \" unrooted \" */\nnumeric digits max(9, nodes % 2) /*this program may use gihugeic numbers*/\nw= length(nodes) /*W: used for aligning formatted nodes*/\nsay right(0, w) unrooted.0 /*show enumerations of 0 carbon atoms*/\n /* [↓] process all nodes (up to NODES)*/\n do C=1 for nodes; h= C % 2 /*C: is the number of carbon atoms. */\n call tree 0, C, C, 1, 1 /* [↓] if # of carbon atoms is even···*/\n if \\(C//2) then unrooted.C= unrooted.C + rooted.h * (rooted.h + 1) % 2\n say right(C, w) unrooted.C /*display an aligned formatted number. */\n end /*C*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntree: procedure expose rooted. unrooted. nodes #. /*this function is recursive.*/\n parse arg br,n,L,sum,cnt; nm= n - 1; LL= L + L\n brp= br + 1\n do b=brp to 4; sum= sum + n\n if sum>nodes then leave\n if b==4 then if LL>=sum then leave\n if b==brp then #.br= rooted.n * cnt\n else #.br= #.br * (rooted.n + b - brp) % (b - br)\n if LL<sum then unrooted.sum= unrooted.sum + #.br\n if b==4 then leave\n rooted.sum= rooted.sum + #.br\n do m=nm by -1 for nm; call tree b, m, L, sum, #.br\n end /*m*/\n end /*b*/ /* ↑↑↑↑↑↑↑↑↑ recursive. */\n return\n","language":"REXX"},{"code":"MAX_N = 500\nBRANCH = 4\n\ndef tree(br, n, l=n, sum=1, cnt=1)\n for b in br+1 .. BRANCH\n sum += n\n return if sum >= MAX_N\n # prevent unneeded long math\n return if l * 2 >= sum and b >= BRANCH\n if b == br + 1\n c = $ra[n] * cnt\n else\n c = c * ($ra[n] + (b - br - 1)) / (b - br)\n end\n $unrooted[sum] += c if l * 2 < sum\n next if b >= BRANCH\n $ra[sum] += c\n (1...n).each {|m| tree(b, m, l, sum, c)}\n end\nend\n\ndef bicenter(s)\n return if s.odd?\n aux = $ra[s / 2]\n $unrooted[s] += aux * (aux + 1) / 2\nend\n\n$ra = [0] * MAX_N\n$unrooted = [0] * MAX_N\n\n$ra[0] = $ra[1] = $unrooted[0] = $unrooted[1] = 1\nfor n in 1...MAX_N\n tree(0, n)\n bicenter(n)\n puts \"%d: %d\" % [n, $unrooted[n]]\nend\n","language":"Ruby"},{"code":"object Paraffins extends App {\n val (nMax, nBranches) = (250, 4)\n val rooted, unrooted = Array.tabulate(nMax + 1)(i => if (i < 2) BigInt(1) else BigInt(0))\n val (unrooted, c) = (rooted.clone(), new Array[BigInt](nBranches))\n\n for (n <- 1 to nMax) {\n def tree(br: Int, n: Int, l: Int, inSum: Int, cnt: BigInt): Unit = {\n var sum = inSum\n for (b <- br + 1 to nBranches) {\n sum += n\n if (sum > nMax || (l * 2 >= sum && b >= nBranches)) return\n\n if (b == br + 1) c(br) = rooted(n) * cnt\n else {\n c(br) = c(br) * (rooted(n) + BigInt(b - br - 1))\n c(br) = c(br) / BigInt(b - br)\n }\n if (l * 2 < sum) unrooted(sum) = unrooted(sum) + c(br)\n if (b < nBranches) rooted(sum) = rooted(sum) + c(br)\n\n for (m <- n - 1 to 1 by -1) tree(b, m, l, sum, c(br))\n }\n }\n\n def bicenter(s: Int): Unit = if ((s & 1) == 0) {\n val halves = rooted(s / 2)\n unrooted(s) = unrooted(s) + ((halves + BigInt(1)) * halves >> 1)\n }\n\n tree(0, n, n, 1, BigInt(1))\n bicenter(n)\n println(f\"$n%3d: ${unrooted(n)}%s\")\n }\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"bigint.s7i\";\n\nconst integer: max_n is 500;\nconst integer: branch is 4;\n\nvar array bigInteger: rooted is max_n times 0_;\nvar array bigInteger: unrooted is max_n times 0_;\n\nconst proc: tree (in integer: br, in integer: n, in integer: l, in var integer: sum, in bigInteger: cnt) is func\n local\n var integer: b is 0;\n var integer: m is 0;\n var bigInteger: c is 0_;\n var bigInteger: diff is 0_;\n begin\n for b range br + 1 to branch do\n sum +:= n;\n if sum > max_n or l * 2 >= sum and b >= branch then\n # Prevent unneeded long math.\n b := branch;\n else\n if b = (br + 1) then\n c := rooted[n] * cnt;\n else\n diff := bigInteger conv (b - br);\n c := c * (rooted[n] + pred(diff)) div diff;\n end if;\n if l * 2 < sum then\n unrooted[sum] +:= c;\n end if;\n if b < branch then\n rooted[sum] +:= c;\n for m range n-1 downto 1 do\n tree(b, m, l, sum, c);\n end for;\n end if;\n end if;\n end for;\n end func;\n\nconst proc: bicenter (in integer: s) is func\n begin\n if not odd(s) then\n unrooted[s] +:= (rooted[s div 2] * succ(rooted[s div 2])) >> 1;\n end if;\n end func;\n\nconst proc: main is func\n local\n var bigInteger: cnt is 1_;\n var integer: n is 0;\n var integer: sum is 1;\n begin\n rooted[1] := 1_;\n unrooted[1] := 1_;\n for n range 1 to max_n do\n tree(0, n, n, sum, cnt);\n bicenter(n);\n writeln(n <& \": \" <& unrooted[n]);\n end for;\n end func;\n","language":"Seed7"},{"code":"package require Tcl 8.5\n\nset maxN 200\nset rooted [lrepeat $maxN 0]\nlset rooted 0 1; lset rooted 1 1\nset unrooted $rooted\n\nproc choose {m k} {\n if {$k == 1} {\n\treturn $m\n }\n for {set r $m; set i 1} {$i < $k} {incr i} {\n\tset r [expr {$r * ($m+$i) / ($i+1)}]\n }\n return $r\n}\n\nproc tree {br n cnt sum l} {\n global maxN rooted unrooted\n for {set b [expr {$br+1}]} {$b <= 4} {incr b} {\n\tset s [expr {$sum + ($b-$br) * $n}]\n\tif {$s >= $maxN} return\n\tset c [expr {[choose [lindex $rooted $n] [expr {$b-$br}]] * $cnt}]\n\tif {$l*2 < $s} {\n\t lset unrooted $s [expr {[lindex $unrooted $s] + $c}]\n\t}\n\tif {$b == 4} return\n\tlset rooted $s [expr {[lindex $rooted $s] + $c}]\n\tfor {set m $n} {[incr m -1]} {} {\n\t tree $b $m $c $s $l\n\t}\n }\n}\n\nproc bicenter {s} {\n if {$s & 1} return\n global unrooted rooted\n set r [lindex $rooted [expr {$s/2}]]\n lset unrooted $s [expr {[lindex $unrooted $s] + $r*($r+1)/2}]\n}\n\nfor {set n 1} {$n < $maxN} {incr n} {\n tree 0 $n 1 1 $n\n bicenter $n\n puts \"${n}: [lindex $unrooted $n]\"\n}\n","language":"Tcl"},{"code":"import \"./big\" for BigInt\nimport \"./fmt\" for Fmt\n\nvar branches = 4\nvar nMax = 250\nvar rooted = List.filled(nMax + 1, BigInt.zero)\nvar unrooted = List.filled(nMax + 1, BigInt.zero)\nvar c = List.filled(branches, BigInt.zero)\n\nvar tree\ntree = Fn.new { |br, n, l, sum, cnt|\n var b = br + 1\n while (b <= branches) {\n sum = sum + n\n if (sum > nMax) return\n if (l*2 >= sum && b >= branches) return\n if (b == br + 1) {\n c[br] = rooted[n] * cnt\n } else {\n var tmp = rooted[n] + BigInt.new(b - br - 1)\n c[br] = c[br] * tmp\n c[br] = c[br] / BigInt.new(b - br)\n }\n if (l*2 < sum) unrooted[sum] = unrooted[sum] + c[br]\n if (b < branches) rooted[sum] = rooted[sum] + c[br]\n var m = n - 1\n while (m > 0) {\n tree.call(b, m, l, sum, c[br])\n m = m - 1\n }\n b = b + 1\n }\n}\n\nvar bicenter = Fn.new { |s|\n if (s%2 == 0) {\n var tmp = (rooted[(s/2).floor] + BigInt.one) * rooted[(s/2).floor]\n tmp = tmp >> 1\n unrooted[s] = unrooted[s] + tmp\n }\n}\n\nrooted[0] = BigInt.one\nrooted[1] = BigInt.one\nunrooted[0] = BigInt.one\nunrooted[1] = BigInt.one\nfor (n in 1..nMax) {\n tree.call(0, n, n, 1, BigInt.one)\n bicenter.call(n)\n Fmt.print(\"$3d: $i\", n, unrooted[n])\n}\n","language":"Wren"},{"code":"var BN=Import(\"zklBigNum\");\n\nconst nMax=100, nBranches=4;\n\nvar rooted =(nMax+1).pump(List.createLong(nMax+1).write,BN.fp(0)),\n unrooted=(nMax+1).pump(List.createLong(nMax+1).write,BN.fp(0));\nrooted[0]=BN(1); rooted[1]=BN(1); unrooted[0]=BN(1); unrooted[1]=BN(1);\n\nfcn tree(br,n,l,inSum,cnt){\n var c=(nBranches).pump(List().write,0); // happens only once\n\n sum := inSum;\n foreach b in ([br + 1 .. nBranches]){\n sum += n;\n if (sum > nMax or (l * 2 >= sum and b >= nBranches)) return();\n if (b == br + 1) c[br] = rooted[n] * cnt; // -->BigInt\n else{\n\t c[br].mul(rooted[n] + b - br - 1);\n\t c[br].div(b - br);\n }\n if (l * 2 < sum) unrooted[sum].add(c[br]);\n if (b < nBranches) rooted[sum].add(c[br]);\n foreach m in ([n-1 .. 1,-1]) { tree(b, m, l, sum, c[br]); }\n }\n}\n\nfcn bicenter(s){\n if (s.isEven) unrooted[s].add(rooted[s / 2] * (rooted[s / 2] + 1) / 2);\n}\n\nforeach n in ([1 .. nMax]){\n tree(0, n, n, 1, BN(1));\n bicenter(n);\n println(n, \": \", unrooted[n]);\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Paraffins\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This organic chemistry task is essentially to implement a tree enumeration algorithm.\\n\\n\\n;Task:\\nEnumerate, without repetitions and in order of increasing size, all possible paraffin molecules (also known as [[wp:alkane|alkane]]s). \\n\\n\\nParaffins are built up using only carbon atoms, which has four bonds, and hydrogen, which has one bond. All bonds for each atom must be used, so it is easiest to think of an alkane as linked carbon atoms forming the \\\"backbone\\\" structure, with adding hydrogen atoms linking the remaining unused bonds.\\n\\nIn a paraffin, one is allowed neither double bonds (two bonds between the same pair of atoms), nor cycles of linked carbons. So all paraffins with '''n''' carbon atoms share the empirical formula <big>C<sub>n</sub>H<sub>2n+2</sub></big>\\n\\nBut for all '''n''' ≥ 4 there are several distinct molecules (\\\"isomers\\\") with the same formula but different structures. \\n\\nThe number of isomers rises rather rapidly when '''n''' increases. \\n\\nIn counting isomers it should be borne in mind that the four bond positions on a given carbon atom can be freely interchanged and bonds rotated (including 3-D \\\"out of the paper\\\" rotations when it's being observed on a flat diagram), so rotations or re-orientations of parts of the molecule (without breaking bonds) do not give different isomers. So what seem at first to be different molecules may in fact turn out to be different orientations of the same molecule.\\n\\n\\n;Example:\\nWith '''n''' = 3 there is only one way of linking the carbons despite the different orientations the molecule can be drawn; and with '''n''' = 4 there are two configurations: \\n:::* a straight chain: <big>(CH<sub>3</sub>)(CH<sub>2</sub>)(CH<sub>2</sub>)(CH<sub>3</sub>)</big> \\n:::* a branched chain: <big>(CH<sub>3</sub>)(CH(CH<sub>3</sub>))(CH<sub>3</sub>)</big>\\n\\n<br>\\nDue to bond rotations, it doesn't matter which direction the branch points in. \\n\\nThe phenomenon of \\\"stereo-isomerism\\\" (a molecule being different from its mirror image due to the actual 3-D arrangement of bonds) is ignored for the purpose of this task.\\n\\nThe input is the number '''n''' of carbon atoms of a molecule (for instance '''17'''). \\n\\nThe output is how many different different paraffins there are with '''n''' carbon atoms (for instance 24,894 if '''n''' = 17).\\n\\nThe sequence of those results is visible in the OEIS entry: \\n::: [[oeis:A00602|A00602: number of n-node unrooted quartic trees; number of n-carbon alkanes C(n)H(2n+2) ignoring stereoisomers]]. \\n\\nThe sequence is (the index starts from zero, and represents the number of carbon atoms):\\n\\n 1, 1, 1, 1, 2, 3, 5, 9, 18, 35, 75, 159, 355, 802, 1858, 4347, 10359,\\n 24894, 60523, 148284, 366319, 910726, 2278658, 5731580, 14490245,\\n 36797588, 93839412, 240215803, 617105614, 1590507121, 4111846763,\\n 10660307791, 27711253769, ...\\n\\n\\n;Extra credit:\\nShow the paraffins in some way. \\n\\nA flat 1D representation, with arrays or lists is enough, for instance:\\n\\n<syntaxhighlight lang=\\\"text\\\">*Main> all_paraffins 1\\n [CCP H H H H]\\n*Main> all_paraffins 2\\n [BCP (C H H H) (C H H H)]\\n*Main> all_paraffins 3\\n [CCP H H (C H H H) (C H H H)]\\n*Main> all_paraffins 4\\n [BCP (C H H (C H H H)) (C H H (C H H H)),\\n CCP H (C H H H) (C H H H) (C H H H)]\\n*Main> all_paraffins 5\\n [CCP H H (C H H (C H H H)) (C H H (C H H H)),\\n CCP H (C H H H) (C H H H) (C H H (C H H H)),\\n CCP (C H H H) (C H H H) (C H H H) (C H H H)]\\n*Main> all_paraffins 6\\n [BCP (C H H (C H H (C H H H))) (C H H (C H H (C H H H))),\\n BCP (C H H (C H H (C H H H))) (C H (C H H H) (C H H H)),\\n BCP (C H (C H H H) (C H H H)) (C H (C H H H) (C H H H)),\\n CCP H (C H H H) (C H H (C H H H)) (C H H (C H H H)),\\n CCP (C H H H) (C H H H) (C H H H) (C H H (C H H H))]</syntaxhighlight>\\nShowing a basic 2D ASCII-art representation of the paraffins is better; for instance (molecule names aren't necessary):\\n<syntaxhighlight lang=\\\"text\\\"> methane ethane propane isobutane\\n \\n H H H H H H H H H\\n │ │ │ │ │ │ │ │ │\\n H ─ C ─ H H ─ C ─ C ─ H H ─ C ─ C ─ C ─ H H ─ C ─ C ─ C ─ H\\n │ │ │ │ │ │ │ │ │\\n H H H H H H H │ H\\n │\\n H ─ C ─ H\\n │\\n H</syntaxhighlight> \\n\\n;Links:\\n* A paper that explains the problem and its solution in a functional language:\\nhttp://www.cs.wright.edu/~tkprasad/courses/cs776/paraffins-turner.pdf\\n\\n* A Haskell implementation:\\nhttps://github.com/ghc/nofib/blob/master/imaginary/paraffins/Main.hs\\n\\n* A Scheme implementation:\\nhttp://www.ccs.neu.edu/home/will/Twobit/src/paraffins.scm\\n\\n* A Fortress implementation: (this site has been closed)\\nhttp://java.net/projects/projectfortress/sources/sources/content/ProjectFortress/demos/turnersParaffins0.fss?rev=3005\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V nMax = 250\\nV nBranches = 4\\nV rooted = [BigInt(0)] * (nMax + 1)\\nV unrooted = [BigInt(0)] * (nMax + 1)\\nrooted[0] = BigInt(1)\\nrooted[1] = BigInt(1)\\nunrooted[0] = BigInt(1)\\nunrooted[1] = BigInt(1)\\n\\nF choose(m, k)\\n I k == 1\\n R m\\n V result = m\\n L(i) 1 .< k\\n result = result * (m + i) I/ (i + 1)\\n R result\\n\\nF tree(br, n, l, sum, cnt)\\n V s = 0\\n L(b) br + 1 .. :nBranches\\n s = sum + (b - br) * n\\n I s > :nMax {R}\\n\\n V c = choose(:rooted[n], b - br) * cnt\\n\\n I l * 2 < s {:unrooted[s] += c}\\n I b == :nBranches {R}\\n :rooted[s] += c\\n L(m) (n - 1 .< 0).step(-1)\\n tree(b, m, l, s, c)\\n\\nF bicenter(s)\\n I (s [&] 1) == 0\\n :unrooted[s] += :rooted[s I/ 2] * (:rooted[s I/ 2] + 1) I/ 2\\n\\nL(n) 1 .. nMax\\n tree(0, n, n, 1, BigInt(1))\\n bicenter(n)\\n print(n‘: ’unrooted[n])\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n#define MAX_N 33\\t/* max number of tree nodes */\\n#define BRANCH 4\\t/* max number of edges a single node can have */\\n\\n/* The basic idea: a paraffin molecule can be thought as a simple tree\\n with each node being a carbon atom. Counting molecules is thus the\\n problem of counting free (unrooted) trees of given number of nodes.\\n\\n An unrooted tree needs to be uniquely represented, so we need a way\\n to cannonicalize equivalent free trees. For that, we need to first\\n define the cannonical form of rooted trees. Since rooted trees can\\n be constructed by a root node and up to BRANCH rooted subtrees that\\n are arranged in some definite order, we can define it thusly:\\n * Given the root of a tree, the weight of each of its branches is\\n the number of nodes contained in that branch;\\n * A cannonical rooted tree would have its direct subtrees ordered\\n in descending order by weight;\\n * In case multiple subtrees are the same weight, they are ordered\\n by some unstated, but definite, order (this code doesn't really\\n care what the ordering is; it only counts the number of choices\\n in such a case, not enumerating individual trees.)\\n\\n A rooted tree of N nodes can then be constructed by adding smaller,\\n cannonical rooted trees to a root node, such that:\\n * Each subtree has fewer than BRANCH branches (since it must have\\n an empty slot for an edge to connect to the new root);\\n * Weight of those subtrees added later are no higher than earlier\\n ones;\\n * Their weight total N-1.\\n A rooted tree so constructed would be itself cannonical.\\n\\n For an unrooted tree, we can define the radius of any of its nodes:\\n it's the maximum weight of any of the subtrees if this node is used\\n as the root. A node is the center of a tree if it has the smallest\\n radius among all the nodes. A tree can have either one or two such\\n centers; if two, they must be adjacent (cf. Knuth, tAoCP 2.3.4.4).\\n\\n An important fact is that, a node in a tree is its sole center, IFF\\n its radius times 2 is no greater than the sum of the weights of all\\n branches (ibid). While we are making rooted trees, we can add such\\n trees encountered to the count of cannonical unrooted trees.\\n\\n A bi-centered unrooted tree with N nodes can be made by joining two\\n trees, each with N/2 nodes and fewer than BRANCH subtrees, at root.\\n The pair must be ordered in aforementioned implicit way so that the\\n product is cannonical. */\\n\\ntypedef unsigned long long xint;\\n#define FMT \\\"llu\\\"\\n\\nxint rooted[MAX_N] = {1, 1, 0};\\nxint unrooted[MAX_N] = {1, 1, 0};\\n\\n/* choose k out of m possible values; chosen values may repeat, but the\\n ordering of them does not matter. It's binomial(m + k - 1, k) */\\nxint choose(xint m, xint k)\\n{\\n\\txint i, r;\\n\\n\\tif (k == 1) return m;\\n\\tfor (r = m, i = 1; i < k; i++)\\n\\t\\tr = r * (m + i) / (i + 1);\\n\\treturn r;\\n}\\n\\n/* constructing rooted trees of BR branches at root, with at most\\n N radius, and SUM nodes in the partial tree already built. It's\\n recursive, and CNT and L carry down the number of combinations\\n and the tree radius already encountered. */\\nvoid tree(xint br, xint n, xint cnt, xint sum, xint l)\\n{\\n\\txint b, c, m, s;\\n\\n\\tfor (b = br + 1; b <= BRANCH; b++) {\\n\\t\\ts = sum + (b - br) * n;\\n\\t\\tif (s >= MAX_N) return;\\n\\n\\t\\t/* First B of BR branches are all of weight n; the\\n\\t\\t rest are at most of weight N-1 */\\n\\t\\tc = choose(rooted[n], b - br) * cnt;\\n\\n\\t\\t/* This partial tree is singly centered as is */\\n\\t\\tif (l * 2 < s) unrooted[s] += c;\\n\\n\\t\\t/* Trees saturate at root can't be used as building\\n\\t\\t blocks for larger trees, so forget them */\\n\\t\\tif (b == BRANCH) return;\\n\\t\\trooted[s] += c;\\n\\n\\t\\t/* Build the rest of the branches */\\n\\t\\tfor (m = n; --m; ) tree(b, m, c, s, l);\\n\\t}\\n}\\n\\nvoid bicenter(int s)\\n{\\n\\tif (s & 1) return;\\n\\n\\t/* Pick two of the half-size building blocks, allowing\\n\\t repetition. */\\n\\tunrooted[s] += rooted[s/2] * (rooted[s/2] + 1) / 2;\\n}\\n\\nint main()\\n{\\n\\txint n;\\n\\tfor (n = 1; n < MAX_N; n++) {\\n\\t\\ttree(0, n, 1, 1, n);\\n\\t\\tbicenter(n);\\n\\t\\tprintf(\\\"%\\\"FMT\\\": %\\\"FMT\\\"\\\\n\\\", n, unrooted[n]);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <gmp.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\n#define MAX_BRANCH 4\\n#define MAX_N 500\\n\\nmpz_t bcache[MAX_N + 1];\\nmpz_t ucache[MAX_N + 1];\\nmpz_t *rcache[MAX_N + 1][MAX_BRANCH + 1];\\n\\nmpz_t tmp1, tmp2;\\nvoid choose(mpz_t r, mpz_t m, int k)\\n{\\n\\tint i;\\n\\tmpz_set(r, m);\\n\\n\\tmpz_add_ui(tmp1, m, 1);\\n\\tfor (i = 1; i < k; ) {\\n\\t\\tmpz_mul(r, r, tmp1);\\n\\t\\tmpz_divexact_ui(r, r, ++i);\\n\\n\\t\\tif (i >= k) break;\\n\\t\\tmpz_add_ui(tmp1, tmp1, 1);\\n\\t}\\n}\\n\\nmpz_t rtmp1, rtmp2;\\nvoid calc_rooted(mpz_t res, int n, int b, int r)\\n{\\n\\tmpz_set_ui(res, 0);\\n\\n\\tif (n == 1 && b == 0 && r == 0) {\\n\\t\\tmpz_set_ui(res, 1);\\n\\t\\treturn;\\n\\t} else if (n <= b || n <= r || n == 1 || b == 0 || r == 0)\\n\\t\\treturn;\\n\\n\\tint b1, r1;\\n\\tfor (b1 = 1; b1 <= b && r * b1 < n; b1++) {\\n\\t\\tchoose(rtmp1, bcache[r], b1);\\n\\t\\tmpz_set_ui(rtmp2, 0);\\n\\t\\tfor (r1 = 0; r1 < r && r1 + r * b1 < n; r1++)\\n\\t\\t\\tmpz_add(rtmp2, rtmp2, rcache[n - r * b1][b - b1][r1]);\\n\\t\\t\\n\\t\\tmpz_addmul(res, rtmp1, rtmp2);\\n\\t}\\n}\\n\\nvoid calc_first_branch(int n)\\n{\\n\\tint b, r;\\n\\tmpz_init_set_ui(bcache[n], 0);\\n\\n\\tfor (b = 0; b < MAX_BRANCH; b++)\\n\\t\\tfor (r = 0; r < n; r++)\\n\\t\\t\\tmpz_add(bcache[n], bcache[n], rcache[n][b][r]);\\n}\\n\\nvoid calc_unrooted(int n)\\n{\\n\\tint b, r;\\n\\n\\tfor (b = 0; b <= MAX_BRANCH; b++) {\\n\\t\\tmpz_t *p = malloc(sizeof(mpz_t) * n);\\n\\t\\trcache[n][b] = p;\\n\\t\\tfor (r = 0; r < n; r++) {\\n\\t\\t\\tmpz_init(p[r]);\\n\\t\\t\\tcalc_rooted(p[r], n, b, r);\\n\\t\\t}\\n\\t}\\n\\n\\tcalc_first_branch(n);\\n\\n\\tmpz_init_set_ui(ucache[n], 0);\\n\\tfor (r = 0; r * 2 < n; r++)\\n\\t\\tfor (b = 0; b <= MAX_BRANCH; b++)\\n\\t\\t\\tmpz_add(ucache[n], ucache[n], rcache[n][b][r]);\\n\\t\\n\\tif (!(n & 1)) {\\n\\t\\tmpz_add_ui(rtmp1, bcache[n/2], 1);\\n\\t\\tmpz_mul(rtmp1, rtmp1, bcache[n/2]);\\n\\t\\tmpz_divexact_ui(rtmp1, rtmp1, 2);\\n\\t\\tmpz_add(ucache[n], ucache[n], rtmp1);\\n\\t}\\n}\\n\\nvoid init(void)\\n{\\n\\tmpz_init(tmp1), mpz_init(tmp2);\\n\\tmpz_init(rtmp1), mpz_init(rtmp2);\\n}\\n\\nint main(void)\\n{\\n\\tint i;\\n\\n\\tinit();\\n\\n\\tfor (i = 0; i <= MAX_N; i++) {\\n\\t\\tcalc_unrooted(i);\\n\\t\\tgmp_printf(\\\"%d: %Zd\\\\n\\\", i, ucache[i]);\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdint>\\n#include <iostream>\\n#include <vector>\\n\\nconst int32_t MAX_TREE_NODES = 52;\\nconst int32_t MAX_BRANCHES = 4;\\n\\nstd::vector<uint64_t> rooted(MAX_TREE_NODES + 1, 0);\\nstd::vector<uint64_t> unrooted(MAX_TREE_NODES + 1,0);\\nstd::vector<uint64_t> count(MAX_BRANCHES, 0);\\n\\nvoid tree(const int32_t& branches, const int32_t& radius, const int32_t& combinations,\\n\\t\\t const int32_t& previous_nodes, const uint64_t& branches_count) {\\n\\t\\n\\tint32_t nodes = previous_nodes;\\n\\tfor ( int32_t branch = branches + 1; branch <= MAX_BRANCHES; ++branch ) {\\n\\t\\tnodes += radius;\\n\\n\\t\\tif ( nodes > MAX_TREE_NODES || ( combinations * 2 >= nodes && branch >= MAX_BRANCHES ) ) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tif ( branch == branches + 1 ) {\\n\\t\\t\\tcount[branches] = rooted[radius] * branches_count;\\n\\t\\t} else {\\n\\t\\t\\tcount[branches] *= ( rooted[radius] + branch - branches - 1 );\\n\\t\\t\\tcount[branches] /= ( branch - branches );\\n\\t\\t}\\n\\n\\t\\tif ( combinations * 2 < nodes ) {\\n\\t\\t\\tunrooted[nodes] += count[branches];\\n\\t\\t}\\n\\n\\t\\tif ( branch < MAX_BRANCHES ) {\\n\\t\\t\\trooted[nodes] += count[branches];\\n\\t\\t}\\n\\n\\t\\tfor ( int32_t next_radius = radius - 1; next_radius > 0; --next_radius ) {\\n\\t\\t\\ttree(branch, next_radius, combinations, nodes, count[branches]);\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid bicenter(const int32_t& node) {\\n\\tif ( ( node & 1 ) == 0 ) {\\n\\t\\tconst uint64_t temp = ( rooted[node / 2] + 1 ) * rooted[node / 2];\\n\\t\\tunrooted[node] += temp / 2;\\n\\t}\\n}\\n\\nint main() {\\n\\trooted[0] = rooted[1] = 1;\\n\\tunrooted[0] = unrooted[1] = 1;\\n\\n\\tfor ( int32_t node = 1; node <= MAX_TREE_NODES; ++node ) {\\n\\t\\ttree(0, node, node, 1, 1);\\n\\t\\tbicenter(node);\\n\\t\\tstd::cout << node << \\\": \\\" << unrooted[node] << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.stdio, std.bigint;\\n\\nenum uint nMax = 250;\\nenum uint nBranches = 4;\\n\\n__gshared BigInt[nMax + 1] rooted = [1.BigInt, 1.BigInt /*...*/],\\n unrooted = [1.BigInt, 1.BigInt /*...*/];\\n\\nvoid tree(in uint br, in uint n, in uint l, in uint inSum,\\n in BigInt cnt) nothrow {\\n __gshared static BigInt[nBranches] c;\\n\\n uint sum = inSum;\\n foreach (immutable b; br + 1 .. nBranches + 1) {\\n sum += n;\\n if (sum > nMax || (l * 2 >= sum && b >= nBranches))\\n return;\\n if (b == br + 1) {\\n c[br] = rooted[n] * cnt;\\n } else {\\n c[br] *= rooted[n] + b - br - 1;\\n c[br] /= b - br;\\n }\\n if (l * 2 < sum)\\n unrooted[sum] += c[br];\\n if (b < nBranches)\\n rooted[sum] += c[br];\\n foreach_reverse (immutable m; 1 .. n)\\n tree(b, m, l, sum, c[br]);\\n }\\n}\\n\\nvoid bicenter(in uint s) nothrow {\\n if ((s & 1) == 0)\\n unrooted[s] += rooted[s / 2] * (rooted[s / 2] + 1) / 2;\\n}\\n\\nvoid main() {\\n foreach (immutable n; 1 .. nMax + 1) {\\n tree(0, n, n, 1, 1.BigInt);\\n n.bicenter;\\n writeln(n, \\\": \\\", unrooted[n]);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"' version 31-12-2016\\n' compile with: fbc -s console\\n' uses gmp, translation from pascal\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\nConst As Integer max_n = 500, branch = 4\\n\\nDim Shared As mpz_ptr rooted(), unrooted(), c()\\nDim Shared As mpz_ptr cnt, tmp\\n\\nSub tree(br As UInteger, n As UInteger, l As UInteger, sum As UInteger, cnt As mpz_ptr)\\n\\n Dim As UInteger b, m\\n\\n For b = br +1 To branch\\n sum = sum + n\\n If sum > max_n Then Return\\n\\n ' prevent unneeded long math\\n If (l * 2 >= sum) And (b >= branch) Then Return\\n\\n If b = (br +1) Then\\n mpz_mul(c(br), rooted(n), cnt)\\n Else\\n mpz_add_ui(tmp, rooted(n), b - br -1)\\n mpz_mul(c(br), c(br), tmp)\\n mpz_divexact_ui(c(br), c(br), b - br)\\n End If\\n\\n If l * 2 < sum Then\\n mpz_add(unrooted(sum), unrooted(sum), c(br))\\n End If\\n If b < branch Then\\n mpz_add(rooted(sum), rooted(sum), c(br))\\n For m = n -1 To 1 Step -1\\n tree(b, m, l, sum, c(br))\\n Next\\n End If\\n Next\\n\\nEnd Sub\\n\\nSub bicenter(s As UInteger)\\n If (s And 1) = 1 Then Return\\n mpz_add_ui(tmp, rooted(s \\\\ 2), 1)\\n mpz_mul(tmp, rooted(s \\\\ 2), tmp)\\n mpz_tdiv_q_2exp(tmp, tmp, 1)\\n mpz_add(unrooted(s), unrooted(s), tmp)\\nEnd Sub\\n\\n' ------=< MAIN >=------\\n\\nDim As UInteger n, sum\\nDim As ZString Ptr ans\\n\\nReDim rooted(max_n), unrooted(max_n)\\nFor n = 0 To max_n\\n rooted(n) = Allocate(Len(__mpz_struct)) : Mpz_init( rooted(n))\\n unrooted(n) = Allocate(Len(__mpz_struct)) : Mpz_init(unrooted(n))\\nNext\\nFor n = 0 To 1\\n mpz_set_ui( rooted(n), 1)\\n mpz_set_ui(unrooted(n), 1)\\nNext\\n\\nReDim c(branch -1)\\nFor n = 0 To branch -1\\n c(n) = Allocate(Len(__mpz_struct)) : Mpz_init(c(n))\\nNext\\n\\ncnt = Allocate(Len(__mpz_struct)) : Mpz_init_set_ui(cnt, 1)\\ntmp = Allocate(Len(__mpz_struct)) : Mpz_init(tmp)\\n\\nsum = 1\\nFor n = 1 To max_n\\n tree(0, n, n, sum, cnt)\\n bicenter(n)\\n 'gmp_printf(\\\"%d: %Zd\\\"+Chr(13)+Chr(10), n, unrooted(n))\\n ans = Mpz_get_str (0, 10, unrooted(n))\\n Print Using \\\"###: \\\"; n; : Print *ans\\nNext\\n\\nFor n = 0 To max_n\\n mpz_Clear( rooted(n))\\n mpz_Clear(unrooted(n))\\nNext\\n\\nFor n = 0 To branch -1\\n mpz_clear(c(n))\\nNext\\n\\nmpz_clear(cnt)\\nmpz_clear(tmp)\\n\\n' empty keyboard buffer\\nWhile Inkey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\nconst branches = 4\\nconst nMax = 500\\n\\nvar rooted, unrooted [nMax + 1]big.Int\\nvar c [branches]big.Int\\nvar tmp = new(big.Int)\\nvar one = big.NewInt(1)\\n\\nfunc tree(br, n, l, sum int, cnt *big.Int) {\\n for b := br + 1; b <= branches; b++ {\\n sum += n\\n if sum > nMax {\\n return\\n }\\n if l*2 >= sum && b >= branches {\\n return\\n }\\n if b == br+1 {\\n c[br].Mul(&rooted[n], cnt)\\n } else {\\n tmp.Add(&rooted[n], tmp.SetInt64(int64(b-br-1)))\\n c[br].Mul(&c[br], tmp)\\n c[br].Div(&c[br], tmp.SetInt64(int64(b-br)))\\n }\\n if l*2 < sum {\\n unrooted[sum].Add(&unrooted[sum], &c[br])\\n }\\n if b < branches {\\n rooted[sum].Add(&rooted[sum], &c[br])\\n }\\n for m := n - 1; m > 0; m-- {\\n tree(b, m, l, sum, &c[br])\\n }\\n }\\n}\\n\\nfunc bicenter(s int) {\\n if s&1 == 0 {\\n tmp.Rsh(tmp.Mul(&rooted[s/2], tmp.Add(&rooted[s/2], one)), 1)\\n unrooted[s].Add(&unrooted[s], tmp)\\n }\\n}\\n\\nfunc main() {\\n rooted[0].SetInt64(1)\\n rooted[1].SetInt64(1)\\n unrooted[0].SetInt64(1)\\n unrooted[1].SetInt64(1)\\n for n := 1; n <= nMax; n++ {\\n tree(0, n, n, 1, big.NewInt(1))\\n bicenter(n)\\n fmt.Printf(\\\"%d: %d\\\\n\\\", n, &unrooted[n])\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"-- polynomial utils\\na `nmul` n = map (*n) a\\na `ndiv` n = map (`div` n) a\\n\\ninstance (Integral a) => Num [a] where\\n (+) = zipWith (+)\\n negate = map negate\\n a * b = foldr f undefined b where\\n f x z = (a `nmul` x) + (0 : z)\\n abs _ = undefined\\n signum _ = undefined\\n fromInteger n = fromInteger n : repeat 0\\n\\n-- replace x in polynomial with x^n\\nrepl a n = concatMap (: replicate (n-1) 0) a\\n\\n-- S2: (a^2 + b)/2\\ncycleIndexS2 a b = (a*a + b)`ndiv` 2\\n\\n-- S4: (a^4 + 6 a^2 b + 8 a c + 3 b^2 + 6 d) / 24\\ncycleIndexS4 a b c d =\\t((a ^ 4) +\\n\\t\\t\\t (a ^ 2 * b) `nmul` 6 +\\n\\t\\t\\t (a * c) `nmul` 8 +\\n\\t\\t\\t (b ^ 2) `nmul` 3 +\\n\\t\\t\\t d `nmul` 6) `ndiv` 24\\n\\n\\na598 = x1\\n-- A000598: A(x) = 1 + (1/6)*x*(A(x)^3 + 3*A(x)*A(x^2) + 2*A(x^3))\\nx1 = 1 : ((x1^3) + ((x2*x1)`nmul` 3) + (x3`nmul`2)) `ndiv` 6\\nx2 = x1`repl`2\\nx3 = x1`repl`3\\nx4 = x1`repl`4\\n\\n-- A000678 = x CycleIndex(S4, A000598(x))\\na678 = 0 : cycleIndexS4 x1 x2 x3 x4\\n\\n-- A000599 = CycleIndex(S2, A000598(x) - 1)\\na599 = cycleIndexS2 (0 : tail x1) (0 : tail x2)\\n\\n-- A000602 = A000678(x) - A000599(x) + A000599(x^2)\\na602 = a678 - a599 + x2\\n\\nmain = mapM_ print $ take 200 $ zip [0 ..] a602\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Data.Array\\n\\nchoose :: Integer -> Int -> Integer\\nchoose m k = let kk = toInteger k in (product [m..m+kk-1]) `div` (product [1..kk])\\n\\nmax_branches = 4\\nmax_nodes = 200\\n\\nbcache = listArray (0, max_nodes)\\n\\t[sum[rcache!n!b!r | r <- [0..n], b <- [0..max_branches-1]] | n <- [0..max_nodes]]\\nbuild_block = (bcache !)\\n\\nrcache = listArray (0,max_nodes) [arr_b i | i <- [0..max_nodes]] where\\n\\tarr_b n = listArray(0,max_branches) [arr_r b n | b <- [0..max_branches]]\\n\\tarr_r b n = listArray(0,n) [rooted n b r | r <- [0..n]]\\n\\nrooted 1 0 0 = 1\\nrooted 1 _ _ = 0\\nrooted _ 0 _ = 0\\nrooted _ _ 0 = 0\\nrooted n b r\\n\\t| (n <= b) || (n <= r) = 0\\n\\t| otherwise = sum [(firsts b1) * (rests b1) | b1 <- [1..b], r * b1 < n] where\\n\\t\\tfirsts = choose (build_block r)\\n\\t\\trests bb = sum [rcache!(n-r*bb)!(b - bb)!r1 | r1 <- [0..r-1], r1 < (n-r*bb)]\\n\\nunrooted n = unicenter + bycenter where\\n\\tunicenter = sum [ rcache!n!b!r | b <- [0..max_branches], r <-[0..n], r * 2 < n]\\n\\tbycenter| odd n = 0\\n\\t\\t| otherwise = x * (x + 1) `div` 2 where x = build_block (n `div` 2)\\n\\nmain = mapM_ print $ map (\\\\x->(x, unrooted x)) [1..max_nodes]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"part3=: ;@((<@([(],.(-+/\\\"1))],.]+i.@(]-~1+<.@-:@-))\\\"0 i.@>:@<.@%&3))\\n\\npart4=: 3 :0\\nij=.; (,.]+i.@:(]-~1+[:<.3%~y-]))&.> i.1+<.y%4\\n(,.y - +/\\\"1) ; (<@(],\\\"1 0 <.@-:@(y-[) (] + i.@>:@-) {:@] >. (>.-:y)-[)~+/)\\\"1 ij\\n)\\n\\nc0=: */@:{\\nc1=: 13 :'(*-:@(*>:))/y{~}:x'\\nc2=: 13 :'(*-:@(*>:))~/y{~}.x'\\nc3=: 13 :'3!2+y{~{.x'\\n\\nradGenN=: [:;[:(],[:+/c0`c1`c2`c3@.(#.@(}.=}:)@[)\\\"1)&.>/(<1x),~part3&.>@ i.@-\\n\\nbcpGenN=: [: , 0 ,.~ -:@(*>:)@({~i.)\\n\\nc11=: 13 :'*/(y{~0 1{x), -:(*>:)y{~{:x'\\nc12=: 13 :'*/(y{~0 3{x), -:(*>:)y{~2{x'\\nc13=: 13 :'*/(y{~{.x) , 3!2+ y{~{: x'\\nc14=: 13 :'*/(y{~_2{.x), -:(*>:)y{~{.x'\\nc15=: 13 :'*/ -:(*>:) y{~0 3{x'\\nc16=: 13 :'*/(y{~{:x) , 3!2+ y{~{. x'\\nc17=: 13 :'4!3+y{~{.x'\\n\\ncassl=: c0`c11`c12`c13`c14`c15`c16`c17\\n\\nccpGenN=: 4 :0\\nif. 0=y do. i.0 return. end.\\ny{.2({.,0,}.) 0,+/@:(x cassl@.(#.@(}.=}:)@[)\\\"1~[)@:part4\\\"0 [1-.~i.y-1\\n)\\n\\nNofParaff=: {. radGenN ((ccpGenN +:) + bcpGenN ) 2&|+<.@-:\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 6 6 $ NofParaff 36\\n 1 1 1 1 2 3\\n 5 9 18 35 75 159\\n 355 802 1858 4347 10359 24894\\n 60523 148284 366319 910726 2278658 5731580\\n 14490245 36797588 93839412 240215803 617105614 1590507121\\n4111846763 10660307791 27711253769 72214088660 188626236139 493782952902\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\nimport java.util.Arrays;\\n\\nclass Test {\\n final static int nMax = 250;\\n final static int nBranches = 4;\\n\\n static BigInteger[] rooted = new BigInteger[nMax + 1];\\n static BigInteger[] unrooted = new BigInteger[nMax + 1];\\n static BigInteger[] c = new BigInteger[nBranches];\\n\\n static void tree(int br, int n, int l, int inSum, BigInteger cnt) {\\n int sum = inSum;\\n for (int b = br + 1; b <= nBranches; b++) {\\n sum += n;\\n\\n if (sum > nMax || (l * 2 >= sum && b >= nBranches))\\n return;\\n\\n BigInteger tmp = rooted[n];\\n if (b == br + 1) {\\n c[br] = tmp.multiply(cnt);\\n } else {\\n c[br] = c[br].multiply(tmp.add(BigInteger.valueOf(b - br - 1)));\\n c[br] = c[br].divide(BigInteger.valueOf(b - br));\\n }\\n\\n if (l * 2 < sum)\\n unrooted[sum] = unrooted[sum].add(c[br]);\\n\\n if (b < nBranches)\\n rooted[sum] = rooted[sum].add(c[br]);\\n\\n for (int m = n - 1; m > 0; m--)\\n tree(b, m, l, sum, c[br]);\\n }\\n }\\n\\n static void bicenter(int s) {\\n if ((s & 1) == 0) {\\n BigInteger tmp = rooted[s / 2];\\n tmp = tmp.add(BigInteger.ONE).multiply(rooted[s / 2]);\\n unrooted[s] = unrooted[s].add(tmp.shiftRight(1));\\n }\\n }\\n\\n public static void main(String[] args) {\\n Arrays.fill(rooted, BigInteger.ZERO);\\n Arrays.fill(unrooted, BigInteger.ZERO);\\n rooted[0] = rooted[1] = BigInteger.ONE;\\n unrooted[0] = unrooted[1] = BigInteger.ONE;\\n\\n for (int n = 1; n <= nMax; n++) {\\n tree(0, n, n, 1, BigInteger.ONE);\\n bicenter(n);\\n System.out.printf(\\\"%d: %s%n\\\", n, unrooted[n]);\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def MAX_N: 500; # imprecision begins at 46\\ndef BRANCH: 4;\\n\\n# state: [unrooted, ra]\\n# tree(br; n; l; sum; cnt) where initially: l=n, sum=1 and cnt=1\\ndef tree(br; n; l; sum; cnt):\\n\\n # The inner function is used to implement the range(b+1; BRANCH) loop\\n # as there are early exits.\\n # On completion, _tree returns [unrooted, ra]\\n def _tree: # state [ (b, c, sum), (unrooted, ra)]\\n if length != 5 then error(\\\"_tree input has length \\\\(length)\\\") else . end\\n | .[0] as $b | .[1] as $c | .[2] as $sum | .[3] as $unrooted | .[4] as $ra\\n | if $b > BRANCH then [$unrooted, $ra]\\n else\\n ($sum + n) as $sum\\n | if $sum >= MAX_N or\\n # prevent unneeded long math\\n ( l * 2 >= $sum and $b >= BRANCH) then [$unrooted, $ra] # return\\n else (if $b == br + 1 then $ra[n] * cnt\\n else ($c * ($ra[n] + (($b - br - 1)))) / ($b - br) | floor\\n end) as $c\\n | (if l * 2 < $sum then ($unrooted | .[$sum] += $c)\\n else $unrooted end) as $unrooted\\n | if $b >= BRANCH then [$b+1, $c, $sum, $unrooted, $ra] | _tree # next\\n else [$unrooted, ($ra | .[$sum] += $c) ]\\n | reduce range(1; n) as $m (.; tree($b; $m; l; $sum; $c))\\n | ([$b + 1, $c, $sum] + .) | _tree\\n end\\n end\\n end\\n ;\\n\\n # start by incrementing b, and prepending values for (b,c,sum)\\n ([br+1, cnt, sum] + .) | _tree\\n;\\n\\n# input and output: [unrooted, ra]\\ndef bicenter(s):\\n if s % 2 == 1 then .\\n else\\n .[1][s / 2] as $aux\\n | .[0][s] += ($aux * ($aux + 1)) / 2 # 2 divides odd*even\\n end\\n;\\n\\ndef array(n;init): [][n-1] = init | map(init);\\n\\ndef ra: array( MAX_N; 0) | .[0] = 1 | .[1] = 1;\\n\\ndef unrooted: ra;\\n\\n# See below for a simpler implementation using \\\"foreach\\\"\\ndef paraffins:\\n # range(1; MAX_N)\\n def _paraffins(n):\\n if n >= MAX_N then empty\\n else tree(0; n; n; 1; 1) | bicenter(n)\\n | [n, .[0][n]], # output\\n _paraffins(n+1)\\n end;\\n [unrooted, ra] | _paraffins(1)\\n;\\n\\nparaffins\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def paraffins:\\n foreach range(1; MAX_N) as $n\\n ( [unrooted, ra];\\n tree(0; $n; $n; 1; 1) | bicenter($n);\\n [$n, .[0][$n]]\\n )\\n;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"const branches = 4\\nconst nmax = 500\\n\\nconst rooted = zeros(BigInt, nmax + 1)\\nconst unrooted = zeros(BigInt, nmax + 1)\\nrooted[1] = rooted[2] = unrooted[1] = unrooted[2] = 1\\nconst c = zeros(BigInt, branches)\\n\\nfunction tree(br, n, l, sum, cnt)\\n for b in br+1:branches\\n sum += n\\n if (sum > nmax) || (l * 2 >= sum && b >= branches)\\n return\\n elseif b == br + 1\\n c[br + 1] = rooted[n + 1] * cnt\\n else\\n c[br + 1] *= rooted[n + 1] + b - br - 1\\n c[br + 1] = div(c[br + 1], b - br)\\n end\\n if l*2 < sum\\n unrooted[sum + 1] += c[br + 1]\\n end\\n if b < branches\\n rooted[sum + 1] += c[br + 1]\\n end\\n for m in n-1:-1:1\\n tree(b, m, l, sum, c[br + 1])\\n end\\n end\\nend\\n\\nbicenter(n) = if iseven(n) unrooted[n + 1] += div(rooted[div(n, 2) + 1] * (rooted[div(n, 2) + 1] + 1), 2) end\\n\\nfunction paraffins()\\n for n in 1:nmax\\n tree(0, n, n, 1, one(BigInt))\\n bicenter(n)\\n println(\\\"$n: $(unrooted[n + 1])\\\")\\n end\\nend\\n\\nparaffins()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\nimport java.math.BigInteger\\n\\nconst val MAX_N = 250\\nconst val BRANCHES = 4\\n\\nval rooted = Array(MAX_N + 1) { if (it < 2) BigInteger.ONE else BigInteger.ZERO }\\nval unrooted = Array(MAX_N + 1) { if (it < 2) BigInteger.ONE else BigInteger.ZERO }\\nval c = Array(BRANCHES) { BigInteger.ZERO }\\n\\nfun tree(br: Int, n: Int, l: Int, s: Int, cnt: BigInteger) {\\n var sum = s\\n for (b in (br + 1)..BRANCHES) {\\n sum += n\\n if (sum > MAX_N || (l * 2 >= sum && b >= BRANCHES)) return\\n\\n var tmp = rooted[n]\\n if (b == br + 1) {\\n c[br] = tmp * cnt\\n }\\n else {\\n val diff = (b - br).toLong()\\n c[br] *= tmp + BigInteger.valueOf(diff - 1L)\\n c[br] /= BigInteger.valueOf(diff)\\n }\\n\\n if (l * 2 < sum) unrooted[sum] += c[br]\\n if (b < BRANCHES) rooted[sum] += c[br]\\n for (m in n - 1 downTo 1) tree(b, m, l, sum, c[br])\\n }\\n}\\n\\nfun bicenter(s: Int) {\\n if ((s and 1) == 0) {\\n var tmp = rooted[s / 2]\\n tmp *= tmp + BigInteger.ONE\\n unrooted[s] += tmp.shiftRight(1)\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n for (n in 1..MAX_N) {\\n tree(0, n, n, 1, BigInteger.ONE)\\n bicenter(n)\\n println(\\\"$n: ${unrooted[n]}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"s[m_, p_, n_] :=\\n CycleIndexPolynomial[SymmetricGroup[m],\\n Table[ComposeSeries[p, x^i + O[x]^(n + 1)], {i, m}]];\\nG000598[n_] := Nest[1 + x s[3, #, n] &, 1 + O[x], n];\\nG000602[n_] :=\\n x s[4, #, n] - s[2, # - 1, n] +\\n ComposeSeries[#, x^2 + O[x]^(n + 1)] &[G000598[n]];\\nA000602[n_] := SeriesCoefficient[G000602[n], n];\\nA000602List[n_] := CoefficientList[G000602[n], x];\\nGrid@Transpose@{Range[0, 200], A000602List@200}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import bigints\\n\\nconst\\n nMax: int32 = 250\\n nBranches = 4\\n\\nvar rooted, unrooted: array[nMax + 1, BigInt]\\nrooted[0..1] = [1.initBigInt, 1.initBigInt]\\nunrooted[0..1] = [1.initBigInt, 1.initBigInt]\\nfor i in 2 .. nMax:\\n rooted[i] = 0.initBigInt\\n unrooted[i] = 0.initBigInt\\n\\nproc choose(m: BigInt; k: int32): BigInt =\\n result = m\\n if k == 1: return\\n for i in 1 ..< k:\\n result = result * (m + i) div (i + 1)\\n\\nproc tree(br, n, l, sum: int32; cnt: BigInt) =\\n var s: int32 = 0\\n for b in br + 1 .. nBranches:\\n s = sum + (b - br) * n\\n if s > nMax: return\\n\\n let c = choose(rooted[n], b - br) * cnt\\n\\n if l * 2 < s: unrooted[s] += c\\n if b == nBranches: return\\n rooted[s] += c\\n for m in countdown(n-1, 1):\\n tree b, m, l, s, c\\n\\nproc bicenter(s: int32) =\\n if (s and 1) == 0:\\n unrooted[s] += rooted[s div 2] * (rooted[s div 2] + 1) div 2\\n\\nfor n in 1 .. nMax:\\n tree 0, n, n, 1, 1.initBigInt\\n n.bicenter\\n echo n, \\\": \\\", unrooted[n]\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"paraffin(p) =\\n{\\n local (P = p+1, R, U = R = Vec([1,1], P));\\n\\n for (n = 1, p,\\n ((B,n,C,S,l=n) -> my(b,c,i,s);\\n for (b = 1, 4-B,\\n if ((s = S + b * n) < P,\\n c = R[n+1] * C * prod(i = 1, b-1, (R[n+1]+i)/(i+1));\\n if (l+l < s, U[s+1] += c);\\n if (B+b < 4, R[s+1] += c; i = n; while (i--, self()(B+b, i, c, s, l)))))\\n )(0,n,1,1);\\n if (n % 2,, U[n+1] += R[n/2+1] * (R[n/2+1]+1)/2);\\n print([n, U[n+1]]))\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"iso(B,n,C,S,l=n) =\\n{\\n my (b,c,i,s);\\n\\n for (b = 1, 4-B,\\n if ((s = S + b * n) < P,\\n c = R[n+1] * C * prod(i = 1, b-1, (R[n+1]+i)/(i+1));\\n if (l+l < s, U[s+1] += c);\\n if (B+b < 4, R[s+1] += c; i = n; while (i--, iso(B+b, i, c, s, l)))))\\n}\\n\\nparaffin(p) =\\n{\\n local (P = p+1, R, U = R = Vec([1,1], P));\\n\\n for (n = 1, p, iso(0, n, 1, 1);\\n if (n % 2,, U[n+1] += R[n/2+1] * (R[n/2+1]+1)/2);\\n print([n, U[n+1]]))\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program Paraffins;\\n\\nuses\\n gmp;\\n\\nconst\\n max_n = 500;\\n branch = 4;\\n\\nvar\\n rooted, unrooted: array [0 .. max_n-1] of mpz_t;\\n c: array [0 .. branch-1] of mpz_t;\\n cnt, tmp: mpz_t;\\n n: integer;\\n fmt: pchar;\\n sum: integer;\\n\\nprocedure tree(br, n, l: integer; sum: integer; cnt: mpz_t);\\n var\\n b, m: integer;\\n begin\\n for b := br + 1 to branch do\\n begin\\n sum := sum + n;\\n if sum >= max_n then\\n\\texit;\\n\\n (* prevent unneeded long math *)\\n if (l * 2 >= sum) and (b >= branch) then\\n\\texit;\\n\\n if b = (br + 1) then\\n\\tmpz_mul(c[br], rooted[n], cnt)\\n else\\n begin\\n\\tmpz_add_ui(tmp, rooted[n], b - br - 1);\\n\\tmpz_mul(c[br], c[br], tmp);\\n\\tmpz_divexact_ui(c[br], c[br], b - br);\\n end;\\n\\n if l * 2 < sum then\\n\\tmpz_add(unrooted[sum], unrooted[sum], c[br]);\\n\\n if b < branch then\\n begin\\n\\tmpz_add(rooted[sum], rooted[sum], c[br]);\\n\\tfor m := n-1 downto 1 do\\n\\t tree(b, m, l, sum, c[br]);\\n end;\\n end;\\n end;\\n\\nprocedure bicenter(s: integer);\\nbegin\\n if odd(s) then\\n exit;\\n mpz_add_ui(tmp, rooted[s div 2], 1);\\n mpz_mul(tmp, rooted[s div 2], tmp);\\n mpz_tdiv_q_2exp(tmp, tmp, 1);\\n\\n mpz_add(unrooted[s], unrooted[s], tmp);\\nend;\\n\\nbegin\\n for n := 0 to 1 do\\n begin\\n mpz_init_set_ui(rooted[n], 1);\\n mpz_init_set_ui(unrooted[n], 1);\\n end;\\n for n := 2 to max_n-1 do\\n begin\\n mpz_init_set_ui(rooted[n], 0);\\n mpz_init_set_ui(unrooted[n], 0);\\n end;\\n for n := 0 to BRANCH-1 do\\n mpz_init(c[n]);\\n\\n mpz_init(tmp);\\n\\n mpz_init_set_ui(cnt, 1);\\n sum := 1;\\n for n := 1 to MAX_N do\\n begin\\n tree(0, n, n, sum, cnt);\\n bicenter(n);\\n mp_printf('%d: %Zd'+chr(13)+chr(10), n, @unrooted[n]);\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"program CountAlkanes;\\n\\n{$mode objfpc}{$H+}\\n\\nuses SysUtils; // only for output\\n\\ntype TArrayUint64 = array of uint64;\\n{\\n Function to count alkanes, based on: Shinsaku Fujita,\\n \\\"Numbers of Alkanes and Monosubstituted Alkanes.\\n A Long-Standing Interdisciplinary Problem over 130 Years\\\",\\n Bull. Chem. Soc. Jpn. Vol. 83, No. 1, 1–18 (2010)\\n}\\nfunction CountAlkanes() : TArrayUint64;\\nconst\\n MAX_RESULT_INDEX = 49; // as far as this code can get without multi-precision\\n MAX_R_INDEX = MAX_RESULT_INDEX div 2;\\nvar\\n R : array [0..MAX_R_INDEX] of uint64;\\n nrCentUnb : uint64; // number of centroidal unbalanced alkanes\\n temp : uint64;\\n m, n, h, i, j, k : integer;\\nbegin\\n SetLength( result, MAX_RESULT_INDEX + 1); // zero-based\\n{\\n Calculate enough of the coefficients R[], where the generating function\\n r(x) = R[0] + R[1]x + R[2]x^2 + R[3]x^3 + ... satifies\\n r(x) = 1 + (x/6)[r(x)^3 + 2r(x^3) + 3r(x)r(x^2)] (Fujita, equation 4)\\n}\\n R[0] := 1;\\n n := 0;\\n repeat\\n if (n mod 3 = 0) then temp := 2*R[n div 3]\\n else temp := 0;\\n for j := 0 to (n div 2) do begin\\n inc( temp, 3 * R[j] * R[n - 2*j]);\\n end;\\n for j := 0 to n do begin\\n for k := 0 to (n - j) do begin\\n inc(temp, R[j] * R[k] * R[n - j - k]);\\n end;\\n end;\\n Assert( temp mod 6 = 0); // keep an eye on it\\n inc(n);\\n R[n] := temp div 6;\\n until (n = MAX_R_INDEX);\\n{\\n Now use the generating function\\n (x/24)[r(x)^4 + 3r(x^2)^2 + *r(x)r(x^3) + 6r(x)^2r(x^2) + 6r(x^4)]\\n where inserting r(x) up to the term in x^m will give the number of alkanes\\n of orders 2m+1 and 2m+2, as the coefficients of x^(2m+1) and x^(2m+2).\\n\\n Note: In Fujita's paper, equation 23, the factor is 1/24 not x/24,\\n but x/24 seems to be needed to give correct results.\\n}\\n result[0] := 1; // conventional\\n for n := 1 to MAX_RESULT_INDEX do begin\\n m := (n - 1) div 2; // so n = 2*m + 1 or 2*m + 2\\n temp := 0;\\n\\n // These loops are written for clarity not efficiency\\n for k := 0 to m do begin\\n for j := 0 to m do begin\\n for i := 0 to m do begin\\n h := n - 1 - i - j - k;\\n if (h >= 0) and (h <= m) then inc( temp, R[h]*R[i]*R[j]*R[k]);\\n end;\\n end;\\n end;\\n\\n if Odd(n) then begin\\n for k := 0 to m do begin\\n inc( temp, 3*R[k]*R[m - k]);\\n end;\\n end;\\n\\n for k := 0 to (n - 1) div 3 do begin\\n j := n - 1 - 3*k;\\n if (j <= m) then inc( temp, 8*R[j]*R[k]);\\n end;\\n\\n for k := 0 to m do begin\\n for j := 0 to m do begin\\n i := n - 1 - 2*k - j;\\n if (i >= 0) and (i <= m) then inc( temp, 6*R[i]*R[j]*R[k]);\\n end;\\n end;\\n\\n if (n mod 4 = 1) then inc( temp, 6*R[(n - 1) div 4]);\\n\\n Assert( temp mod 24 = 0); // keep an eye on it\\n nrCentUnb := temp div 24;\\n if Odd(n) then\\n result[n] := nrCentUnb\\n else begin\\n temp := R[n div 2];\\n result[n] := nrCentUnb + (temp*(temp + 1) div 2);\\n end;\\n end;\\nend;\\n\\n// Call function and display the results\\nvar\\n nrAlkanes : TArrayUint64;\\n k : integer;\\nbegin\\n nrAlkanes := CountAlkanes();\\n for k := 0 to Length( nrAlkanes) - 1 do\\n WriteLn( SysUtils.Format( '%2d %d', [k, nrAlkanes[k]]));\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use Math::GMPz;\\n\\nmy $nmax = 250;\\nmy $nbranches = 4;\\n\\nmy @rooted = map { Math::GMPz->new($_) } 1,1,(0) x $nmax;\\nmy @unrooted = map { Math::GMPz->new($_) } 1,1,(0) x $nmax;\\nmy @c = map { Math::GMPz->new(0) } 0 .. $nbranches-1;\\n\\nsub tree {\\n my($br, $n, $l, $sum, $cnt) = @_;\\n for my $b ($br+1 .. $nbranches) {\\n $sum += $n;\\n return if $sum > $nmax || ($l*2 >= $sum && $b >= $nbranches);\\n if ($b == $br+1) {\\n $c[$br] = $rooted[$n] * $cnt;\\n } else {\\n $c[$br] *= $rooted[$n] + $b - $br - 1;\\n $c[$br] /= $b - $br;\\n }\\n $unrooted[$sum] += $c[$br] if $l*2 < $sum;\\n return if $b >= $nbranches;\\n $rooted[$sum] += $c[$br];\\n for my $m (reverse 1 .. $n-1) {\\n next if $sum+$m > $nmax;\\n tree($b, $m, $l, $sum, $c[$br]);\\n }\\n }\\n}\\n\\nsub bicenter {\\n my $s = shift;\\n $unrooted[$s] += $rooted[$s/2] * ($rooted[$s/2]+1) / 2 unless $s & 1;\\n}\\n\\nfor my $n (1 .. $nmax) {\\n tree(0, $n, $n, 1, Math::GMPz->new(1));\\n bicenter($n);\\n print \\\"$n: $unrooted[$n]\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">MAX_N</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">32</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">BRANCH</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">4</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rooted</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">MAX_N</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">unrooted</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">MAX_N</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">BRANCH</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">MAX_N</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">BRANCH</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">==</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n1</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">cnt</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n1</span><span style=\\\"color: #0000FF;\\\">]+(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">))/(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">tot</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">t1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">BRANCH</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">t1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">c</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">tot</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">bicenter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">even</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">aux</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">aux</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">aux</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">MAX_N</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">bicenter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">MAX_N</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d: %d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">max_n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">200</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">branch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">4</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ivals</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">max_n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">rooted</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">max_n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ivals</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">unrooted</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">max_n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ivals</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">branch</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">tmp</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">cbr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">br</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">branch</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">n</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">max_n</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #000000;\\\">branch</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">br</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_divexact_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">br</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">u</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">branch</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cbr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">bicenter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">even</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">aux</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">u</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">aux</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">aux</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_tdiv_q_2exp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">u</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">tmp</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">cnt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">max_n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cnt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">bicenter</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">25</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">mpz_get_short_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">unrooted</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">elapsed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"int MAX_N = 300;\\nint BRANCH = 4;\\n\\narray ra = allocate(MAX_N);\\narray unrooted = allocate(MAX_N);\\n\\nvoid tree(int br, int n, int l, int sum, int cnt)\\n{\\n int c;\\n for (int b = br + 1; b < BRANCH + 1; b++)\\n {\\n sum += n;\\n if (sum >= MAX_N)\\n return;\\n\\n // prevent unneeded long math\\n if (l * 2 >= sum && b >= BRANCH)\\n return;\\n\\n if (b == br + 1)\\n {\\n c = ra[n] * cnt;\\n }\\n else\\n {\\n c = c * (ra[n] + (b - br - 1)) / (b - br);\\n }\\n\\n if (l * 2 < sum)\\n unrooted[sum] += c;\\n\\n if (b < BRANCH)\\n {\\n ra[sum] += c;\\n for (int m=1; m < n; m++)\\n {\\n tree(b, m, l, sum, c);\\n }\\n }\\n }\\n}\\n\\nvoid bicenter(int s)\\n{\\n if (!(s & 1))\\n {\\n int aux = ra[s / 2];\\n unrooted[s] += aux * (aux + 1) / 2;\\n }\\n}\\n\\n\\nvoid main()\\n{\\n ra[0] = ra[1] = unrooted[0] = unrooted[1] = 1;\\n\\n for (int n = 1; n < MAX_N; n++)\\n {\\n tree(0, n, n, 1, 1);\\n bicenter(n);\\n write(\\\"%d: %d\\\\n\\\", n, unrooted[n]);\\n }\\n}\\n\",\n \"language\": \"Pike\"\n },\n {\n \"code\": \"try:\\n import psyco\\n psyco.full()\\nexcept ImportError:\\n pass\\n\\nMAX_N = 300\\nBRANCH = 4\\n\\nra = [0] * MAX_N\\nunrooted = [0] * MAX_N\\n\\ndef tree(br, n, l, sum = 1, cnt = 1):\\n global ra, unrooted, MAX_N, BRANCH\\n for b in xrange(br + 1, BRANCH + 1):\\n sum += n\\n if sum >= MAX_N:\\n return\\n\\n # prevent unneeded long math\\n if l * 2 >= sum and b >= BRANCH:\\n return\\n\\n if b == br + 1:\\n c = ra[n] * cnt\\n else:\\n c = c * (ra[n] + (b - br - 1)) / (b - br)\\n\\n if l * 2 < sum:\\n unrooted[sum] += c\\n\\n if b < BRANCH:\\n ra[sum] += c;\\n for m in range(1, n):\\n tree(b, m, l, sum, c)\\n\\ndef bicenter(s):\\n global ra, unrooted\\n if not (s & 1):\\n aux = ra[s / 2]\\n unrooted[s] += aux * (aux + 1) / 2\\n\\n\\ndef main():\\n global ra, unrooted, MAX_N\\n ra[0] = ra[1] = unrooted[0] = unrooted[1] = 1\\n\\n for n in xrange(1, MAX_N):\\n tree(0, n, n)\\n bicenter(n)\\n print \\\"%d: %d\\\" % (n, unrooted[n])\\n\\nmain()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from itertools import count, chain, tee, islice, cycle\\nfrom fractions import Fraction\\nfrom sys import setrecursionlimit\\nsetrecursionlimit(5000)\\n\\ndef frac(a,b): return a//b if a%b == 0 else Fraction(a,b)\\n\\n# infinite polynomial class\\nclass Poly:\\n def __init__(self, gen = None):\\n self.gen, self.source = (None, gen) if type(gen) is Poly \\\\\\n else (gen, None)\\n\\n def __iter__(self):\\n # We're essentially tee'ing it everytime the iterator\\n # is, well, iterated. This may be excessive.\\n return Poly(self)\\n\\n def getsource(self):\\n if self.gen == None:\\n s = self.source\\n s.getsource()\\n s.gen, self.gen = tee(s.gen, 2)\\n\\n def next(self):\\n self.getsource()\\n return next(self.gen)\\n\\n __next__ = next\\n\\n # Overload \\\"<<\\\" as stream input operator. Hey, C++ does it.\\n def __lshift__(self, a): self.gen = a\\n\\n # The other operators are pretty much what one would expect\\n def __neg__(self): return Poly(-x for x in self)\\n\\n def __sub__(a, b): return a + (-b)\\n\\n def __rsub__(a, n):\\n a = Poly(a)\\n def gen():\\n yield(n - next(a))\\n for x in a: yield(-x)\\n return Poly(gen())\\n\\n def __add__(a, b):\\n if type(b) is Poly:\\n return Poly(x + y for (x,y) in zip(a,b))\\n\\n a = Poly(a)\\n def gen():\\n yield(next(a) + b)\\n for x in a: yield(x)\\n\\n return Poly(gen())\\n\\n def __radd__(a,b):\\n return a + b\\n\\n def __mul__(a,b):\\n if not type(b) is Poly:\\n return Poly(x*b for x in a)\\n\\n def gen():\\n s = Poly(cycle([0]))\\n for y in b:\\n s += y*a\\n yield(next(s))\\n\\n return Poly(gen())\\n\\n def __rmul__(a,b): return a*b\\n\\n def __truediv__(a,b):\\n if not type(b) is Poly:\\n return Poly(frac(x, b) for x in a)\\n\\n a, b = Poly(a), Poly(b)\\n def gen():\\n r, bb = a,next(b)\\n while True:\\n aa = next(r)\\n q = frac(aa, bb)\\n yield(q)\\n r -= q*b\\n\\n return Poly(gen())\\n\\n def repl(self, n):\\n def gen():\\n for x in self:\\n yield(x)\\n for i in range(n-1): yield(0)\\n return Poly(gen())\\n\\n def __pow__(self, n):\\n return Poly(self) if n == 1 else self * self**(n-1)\\n\\ndef S2(a,b): return (a*a + b)/2\\ndef S4(a,b,c,d): return a**4/24 + a**2*b/4 + a*c/3 + b**2/8 + d/4\\n\\nx1 = Poly()\\nx2 = x1.repl(2)\\nx3 = x1.repl(3)\\nx4 = x1.repl(4)\\nx1 << chain([1], (x1**3 + 3*x1*x2 + 2*x3)/6)\\n\\na598 = x1\\na678 = Poly(chain([0], S4(x1, x2, x3, x4)))\\na599 = S2(x1 - 1, x2 - 1)\\na602 = a678 - a599 + x2\\n\\nfor n,x in zip(count(0), islice(a602, 500)): print(n,x)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#!/usr/bin/python3\\n\\nfrom functools import lru_cache\\n\\ndef Z_S(n, f, k):\\n \\\"\\\"\\\"\\n The cycle index of the symmetric group has recurrence\\n Z(S_n, f(x)) = 1/n \\\\sum_{i=1}^n f(x^i) Z(S_{n-i}, f(x)).\\n This function finds the coefficient of x^k in Z(S_n, f(x))\\n \\\"\\\"\\\"\\n # Special case to avoid division by zero\\n if n == 0:\\n return 1 if k == 0 else 0\\n # Special case as a speed optimisation\\n if n == 1:\\n return f(k)\\n return sum(\\n sum(f(ij // i) * Z_S(n-i, f, k - ij) for ij in range(0, k+1, i))\\n for i in range(1, n+1)\\n ) // n\\n\\n@lru_cache(maxsize=None)\\ndef A000598(k): return 1 if k == 0 else Z_S(3, A000598, k-1)\\n\\n@lru_cache(maxsize=None)\\ndef A000642(k): return Z_S(2, A000598, k)\\n\\ndef A000631(k): return Z_S(2, A000642, k)\\n\\ndef A000602(k): return A000642(k) + (A000642((k-1) // 2) if k % 2 == 1 else 0) - A000631(k-1)\\n\\nfor k in range(500): print(k, A000602(k))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define MAX_N 33)\\n(define BRANCH 4)\\n\\n(define rooted (make-vector MAX_N 0))\\n(define unrooted (make-vector MAX_N 0))\\n(for ([i 2]) (vector-set! rooted i 1) (vector-set! unrooted i 1))\\n\\n(define (vector-inc! v i d) (vector-set! v i (+ d (vector-ref v i))))\\n\\n(define (choose m k)\\n (if (= k 1) m\\n (for/fold ([r m]) ([i (in-range 1 k)]) (/ (* r (+ m i)) (add1 i)))))\\n\\n(define (tree br n cnt sum l)\\n (let/ec return\\n (for ([b (in-range (add1 br) (add1 BRANCH))])\\n (define s (+ sum (* (- b br) n)))\\n (when (>= s MAX_N) (return))\\n (define c (* (choose (vector-ref rooted n) (- b br)) cnt))\\n (when (< (* l 2) s) (vector-inc! unrooted s c))\\n (when (= b BRANCH) (return))\\n (vector-inc! rooted s c)\\n (for ([m (in-range (sub1 n) 0 -1)]) (tree b m c s l)))))\\n\\n(define (bicenter s)\\n (when (even? s)\\n (vector-inc! unrooted s (* (vector-ref rooted (/ s 2))\\n (add1 (vector-ref rooted (/ s 2)))\\n 1/2))))\\n\\n(for ([n (in-range 1 MAX_N)])\\n (tree 0 n 1 1 n)\\n (bicenter n)\\n (printf \\\"~a: ~a\\\\n\\\" n (vector-ref unrooted n)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub count-unrooted-trees(Int $max-branches, Int $max-weight) {\\n my @rooted = flat 1,1,0 xx $max-weight - 1;\\n my @unrooted = flat 1,1,0 xx $max-weight - 1;\\n\\n sub count-trees-with-centroid(Int $radius) {\\n sub add-branches(\\n Int $branches, # number of branches to add\\n Int $w, # weight of heaviest branch to add\\n Int $weight is copy, # accumulated weight of tree\\n Int $choices is copy, # number of choices so far\\n ) {\\n $choices *= @rooted[$w];\\n for 1 .. $branches -> $b {\\n ($weight += $w) <= $max-weight or last;\\n @unrooted[$weight] += $choices if $weight > 2*$radius;\\n if $b < $branches {\\n @rooted[$weight] += $choices;\\n add-branches($branches - $b, $_, $weight, $choices) for 1 ..^ $w;\\n $choices = $choices * (@rooted[$w] + $b) div ($b + 1);\\n }\\n }\\n }\\n add-branches($max-branches, $radius, 1, 1);\\n }\\n\\n sub count-trees-with-bicentroid(Int $weight) {\\n if $weight %% 2 {\\n my \\\\halfs = @rooted[$weight div 2];\\n @unrooted[$weight] += (halfs * (halfs + 1)) div 2;\\n }\\n }\\n\\n gather {\\n take 1;\\n for 1 .. $max-weight {\\n count-trees-with-centroid($_);\\n count-trees-with-bicentroid($_);\\n take @unrooted[$_];\\n }\\n }\\n}\\n\\nmy constant N = 100;\\nmy @paraffins = count-unrooted-trees(4, N);\\nsay .fmt('%3d'), ': ', @paraffins[$_] for flat 1 .. 30, N;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm enumerates (without repetition) the number of paraffins with N carbon atoms. */\\nparse arg nodes . /*obtain optional argument from the CL.*/\\nif nodes=='' | nodes==\\\",\\\" then nodes= 100 /*Not specified? Then use the default.*/\\n rooted. = 0; rooted.0= 1; rooted.1= 1 /*define the base rooted numbers.*/\\nunrooted. = 0; unrooted.0= 1; unrooted.1= 1 /* \\\" \\\" \\\" unrooted \\\" */\\nnumeric digits max(9, nodes % 2) /*this program may use gihugeic numbers*/\\nw= length(nodes) /*W: used for aligning formatted nodes*/\\nsay right(0, w) unrooted.0 /*show enumerations of 0 carbon atoms*/\\n /* [↓] process all nodes (up to NODES)*/\\n do C=1 for nodes; h= C % 2 /*C: is the number of carbon atoms. */\\n call tree 0, C, C, 1, 1 /* [↓] if # of carbon atoms is even···*/\\n if \\\\(C//2) then unrooted.C= unrooted.C + rooted.h * (rooted.h + 1) % 2\\n say right(C, w) unrooted.C /*display an aligned formatted number. */\\n end /*C*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntree: procedure expose rooted. unrooted. nodes #. /*this function is recursive.*/\\n parse arg br,n,L,sum,cnt; nm= n - 1; LL= L + L\\n brp= br + 1\\n do b=brp to 4; sum= sum + n\\n if sum>nodes then leave\\n if b==4 then if LL>=sum then leave\\n if b==brp then #.br= rooted.n * cnt\\n else #.br= #.br * (rooted.n + b - brp) % (b - br)\\n if LL<sum then unrooted.sum= unrooted.sum + #.br\\n if b==4 then leave\\n rooted.sum= rooted.sum + #.br\\n do m=nm by -1 for nm; call tree b, m, L, sum, #.br\\n end /*m*/\\n end /*b*/ /* ↑↑↑↑↑↑↑↑↑ recursive. */\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"MAX_N = 500\\nBRANCH = 4\\n\\ndef tree(br, n, l=n, sum=1, cnt=1)\\n for b in br+1 .. BRANCH\\n sum += n\\n return if sum >= MAX_N\\n # prevent unneeded long math\\n return if l * 2 >= sum and b >= BRANCH\\n if b == br + 1\\n c = $ra[n] * cnt\\n else\\n c = c * ($ra[n] + (b - br - 1)) / (b - br)\\n end\\n $unrooted[sum] += c if l * 2 < sum\\n next if b >= BRANCH\\n $ra[sum] += c\\n (1...n).each {|m| tree(b, m, l, sum, c)}\\n end\\nend\\n\\ndef bicenter(s)\\n return if s.odd?\\n aux = $ra[s / 2]\\n $unrooted[s] += aux * (aux + 1) / 2\\nend\\n\\n$ra = [0] * MAX_N\\n$unrooted = [0] * MAX_N\\n\\n$ra[0] = $ra[1] = $unrooted[0] = $unrooted[1] = 1\\nfor n in 1...MAX_N\\n tree(0, n)\\n bicenter(n)\\n puts \\\"%d: %d\\\" % [n, $unrooted[n]]\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object Paraffins extends App {\\n val (nMax, nBranches) = (250, 4)\\n val rooted, unrooted = Array.tabulate(nMax + 1)(i => if (i < 2) BigInt(1) else BigInt(0))\\n val (unrooted, c) = (rooted.clone(), new Array[BigInt](nBranches))\\n\\n for (n <- 1 to nMax) {\\n def tree(br: Int, n: Int, l: Int, inSum: Int, cnt: BigInt): Unit = {\\n var sum = inSum\\n for (b <- br + 1 to nBranches) {\\n sum += n\\n if (sum > nMax || (l * 2 >= sum && b >= nBranches)) return\\n\\n if (b == br + 1) c(br) = rooted(n) * cnt\\n else {\\n c(br) = c(br) * (rooted(n) + BigInt(b - br - 1))\\n c(br) = c(br) / BigInt(b - br)\\n }\\n if (l * 2 < sum) unrooted(sum) = unrooted(sum) + c(br)\\n if (b < nBranches) rooted(sum) = rooted(sum) + c(br)\\n\\n for (m <- n - 1 to 1 by -1) tree(b, m, l, sum, c(br))\\n }\\n }\\n\\n def bicenter(s: Int): Unit = if ((s & 1) == 0) {\\n val halves = rooted(s / 2)\\n unrooted(s) = unrooted(s) + ((halves + BigInt(1)) * halves >> 1)\\n }\\n\\n tree(0, n, n, 1, BigInt(1))\\n bicenter(n)\\n println(f\\\"$n%3d: ${unrooted(n)}%s\\\")\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"bigint.s7i\\\";\\n\\nconst integer: max_n is 500;\\nconst integer: branch is 4;\\n\\nvar array bigInteger: rooted is max_n times 0_;\\nvar array bigInteger: unrooted is max_n times 0_;\\n\\nconst proc: tree (in integer: br, in integer: n, in integer: l, in var integer: sum, in bigInteger: cnt) is func\\n local\\n var integer: b is 0;\\n var integer: m is 0;\\n var bigInteger: c is 0_;\\n var bigInteger: diff is 0_;\\n begin\\n for b range br + 1 to branch do\\n sum +:= n;\\n if sum > max_n or l * 2 >= sum and b >= branch then\\n # Prevent unneeded long math.\\n b := branch;\\n else\\n if b = (br + 1) then\\n c := rooted[n] * cnt;\\n else\\n diff := bigInteger conv (b - br);\\n c := c * (rooted[n] + pred(diff)) div diff;\\n end if;\\n if l * 2 < sum then\\n unrooted[sum] +:= c;\\n end if;\\n if b < branch then\\n rooted[sum] +:= c;\\n for m range n-1 downto 1 do\\n tree(b, m, l, sum, c);\\n end for;\\n end if;\\n end if;\\n end for;\\n end func;\\n\\nconst proc: bicenter (in integer: s) is func\\n begin\\n if not odd(s) then\\n unrooted[s] +:= (rooted[s div 2] * succ(rooted[s div 2])) >> 1;\\n end if;\\n end func;\\n\\nconst proc: main is func\\n local\\n var bigInteger: cnt is 1_;\\n var integer: n is 0;\\n var integer: sum is 1;\\n begin\\n rooted[1] := 1_;\\n unrooted[1] := 1_;\\n for n range 1 to max_n do\\n tree(0, n, n, sum, cnt);\\n bicenter(n);\\n writeln(n <& \\\": \\\" <& unrooted[n]);\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nset maxN 200\\nset rooted [lrepeat $maxN 0]\\nlset rooted 0 1; lset rooted 1 1\\nset unrooted $rooted\\n\\nproc choose {m k} {\\n if {$k == 1} {\\n\\treturn $m\\n }\\n for {set r $m; set i 1} {$i < $k} {incr i} {\\n\\tset r [expr {$r * ($m+$i) / ($i+1)}]\\n }\\n return $r\\n}\\n\\nproc tree {br n cnt sum l} {\\n global maxN rooted unrooted\\n for {set b [expr {$br+1}]} {$b <= 4} {incr b} {\\n\\tset s [expr {$sum + ($b-$br) * $n}]\\n\\tif {$s >= $maxN} return\\n\\tset c [expr {[choose [lindex $rooted $n] [expr {$b-$br}]] * $cnt}]\\n\\tif {$l*2 < $s} {\\n\\t lset unrooted $s [expr {[lindex $unrooted $s] + $c}]\\n\\t}\\n\\tif {$b == 4} return\\n\\tlset rooted $s [expr {[lindex $rooted $s] + $c}]\\n\\tfor {set m $n} {[incr m -1]} {} {\\n\\t tree $b $m $c $s $l\\n\\t}\\n }\\n}\\n\\nproc bicenter {s} {\\n if {$s & 1} return\\n global unrooted rooted\\n set r [lindex $rooted [expr {$s/2}]]\\n lset unrooted $s [expr {[lindex $unrooted $s] + $r*($r+1)/2}]\\n}\\n\\nfor {set n 1} {$n < $maxN} {incr n} {\\n tree 0 $n 1 1 $n\\n bicenter $n\\n puts \\\"${n}: [lindex $unrooted $n]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar branches = 4\\nvar nMax = 250\\nvar rooted = List.filled(nMax + 1, BigInt.zero)\\nvar unrooted = List.filled(nMax + 1, BigInt.zero)\\nvar c = List.filled(branches, BigInt.zero)\\n\\nvar tree\\ntree = Fn.new { |br, n, l, sum, cnt|\\n var b = br + 1\\n while (b <= branches) {\\n sum = sum + n\\n if (sum > nMax) return\\n if (l*2 >= sum && b >= branches) return\\n if (b == br + 1) {\\n c[br] = rooted[n] * cnt\\n } else {\\n var tmp = rooted[n] + BigInt.new(b - br - 1)\\n c[br] = c[br] * tmp\\n c[br] = c[br] / BigInt.new(b - br)\\n }\\n if (l*2 < sum) unrooted[sum] = unrooted[sum] + c[br]\\n if (b < branches) rooted[sum] = rooted[sum] + c[br]\\n var m = n - 1\\n while (m > 0) {\\n tree.call(b, m, l, sum, c[br])\\n m = m - 1\\n }\\n b = b + 1\\n }\\n}\\n\\nvar bicenter = Fn.new { |s|\\n if (s%2 == 0) {\\n var tmp = (rooted[(s/2).floor] + BigInt.one) * rooted[(s/2).floor]\\n tmp = tmp >> 1\\n unrooted[s] = unrooted[s] + tmp\\n }\\n}\\n\\nrooted[0] = BigInt.one\\nrooted[1] = BigInt.one\\nunrooted[0] = BigInt.one\\nunrooted[1] = BigInt.one\\nfor (n in 1..nMax) {\\n tree.call(0, n, n, 1, BigInt.one)\\n bicenter.call(n)\\n Fmt.print(\\\"$3d: $i\\\", n, unrooted[n])\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"var BN=Import(\\\"zklBigNum\\\");\\n\\nconst nMax=100, nBranches=4;\\n\\nvar rooted =(nMax+1).pump(List.createLong(nMax+1).write,BN.fp(0)),\\n unrooted=(nMax+1).pump(List.createLong(nMax+1).write,BN.fp(0));\\nrooted[0]=BN(1); rooted[1]=BN(1); unrooted[0]=BN(1); unrooted[1]=BN(1);\\n\\nfcn tree(br,n,l,inSum,cnt){\\n var c=(nBranches).pump(List().write,0); // happens only once\\n\\n sum := inSum;\\n foreach b in ([br + 1 .. nBranches]){\\n sum += n;\\n if (sum > nMax or (l * 2 >= sum and b >= nBranches)) return();\\n if (b == br + 1) c[br] = rooted[n] * cnt; // -->BigInt\\n else{\\n\\t c[br].mul(rooted[n] + b - br - 1);\\n\\t c[br].div(b - br);\\n }\\n if (l * 2 < sum) unrooted[sum].add(c[br]);\\n if (b < nBranches) rooted[sum].add(c[br]);\\n foreach m in ([n-1 .. 1,-1]) { tree(b, m, l, sum, c[br]); }\\n }\\n}\\n\\nfcn bicenter(s){\\n if (s.isEven) unrooted[s].add(rooted[s / 2] * (rooted[s / 2] + 1) / 2);\\n}\\n\\nforeach n in ([1 .. nMax]){\\n tree(0, n, n, 1, BN(1));\\n bicenter(n);\\n println(n, \\\": \\\", unrooted[n]);\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Paraffins"}}},{"rowIdx":1481,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Parallel_calculations\nnote: Control Structures\n","language":"00-META"},{"code":"Many programming languages allow you to specify computations to be run in parallel. \nWhile [[Concurrent computing]] is focused on concurrency, \nthe purpose of this task is to distribute time-consuming calculations \non as many CPUs as possible.\n\nAssume we have a collection of numbers, and want to find the one \nwith the largest minimal prime factor \n(that is, the one that contains relatively large factors). \nTo speed up the search, the factorization should be done \nin parallel using separate threads or processes, \nto take advantage of multi-core CPUs.\n\nShow how this can be formulated in your language. \nParallelize the factorization of those numbers, \nthen search the returned list of numbers and factors \nfor the largest minimal factor, \nand return that number and its prime factors.\n\nFor the prime number decomposition \nyou may use the solution of the [[Prime decomposition]] task.\n\n{{omit from|J}}\n\n","language":"00-TASK"},{"code":"generic\n type Number is private;\n Zero : Number;\n One : Number;\n Two : Number;\n with function Image (X : Number) return String is <>;\n with function \"+\" (X, Y : Number) return Number is <>;\n with function \"/\" (X, Y : Number) return Number is <>;\n with function \"mod\" (X, Y : Number) return Number is <>;\n with function \">=\" (X, Y : Number) return Boolean is <>;\npackage Prime_Numbers is\n type Number_List is array (Positive range <>) of Number;\n\n procedure Put (List : Number_List);\n\n task type Calculate_Factors is\n entry Start (The_Number : in Number);\n entry Get_Size (Size : out Natural);\n entry Get_Result (List : out Number_List);\n end Calculate_Factors;\n\nend Prime_Numbers;\n","language":"Ada"},{"code":"with Ada.Text_IO;\npackage body Prime_Numbers is\n\n procedure Put (List : Number_List) is\n begin\n for Index in List'Range loop\n Ada.Text_IO.Put (Image (List (Index)));\n end loop;\n end Put;\n\n task body Calculate_Factors is\n Size : Natural := 0;\n N : Number;\n M : Number;\n K : Number := Two;\n begin\n accept Start (The_Number : in Number) do\n N := The_Number;\n M := N;\n end Start;\n -- Estimation of the result length from above\n while M >= Two loop\n M := (M + One) / Two;\n Size := Size + 1;\n end loop;\n M := N;\n -- Filling the result with prime numbers\n declare\n Result : Number_List (1 .. Size);\n Index : Positive := 1;\n begin\n while N >= K loop -- Divisors loop\n while Zero = (M mod K) loop -- While divides\n Result (Index) := K;\n Index := Index + 1;\n M := M / K;\n end loop;\n K := K + One;\n end loop;\n Index := Index - 1;\n accept Get_Size (Size : out Natural) do\n Size := Index;\n end Get_Size;\n accept Get_Result (List : out Number_List) do\n List (1 .. Index) := Result (1 .. Index);\n end Get_Result;\n end;\n end Calculate_Factors;\n\nend Prime_Numbers;\n","language":"Ada"},{"code":"with Ada.Text_IO;\nwith Prime_Numbers;\nprocedure Parallel is\n package Integer_Primes is new Prime_Numbers (\n Number => Integer, -- use Large_Integer for longer numbers\n Zero => 0,\n One => 1,\n Two => 2,\n Image => Integer'Image);\n\n My_List : Integer_Primes.Number_List :=\n ( 12757923,\n 12878611,\n 12757923,\n 15808973,\n 15780709,\n 197622519);\n\n Decomposers : array (My_List'Range) of Integer_Primes.Calculate_Factors;\n Lengths : array (My_List'Range) of Natural;\n Max_Length : Natural := 0;\nbegin\n for I in My_List'Range loop\n -- starts the tasks\n Decomposers (I).Start (My_List (I));\n end loop;\n for I in My_List'Range loop\n -- wait until task has reached Get_Size entry\n Decomposers (I).Get_Size (Lengths (I));\n if Lengths (I) > Max_Length then\n Max_Length := Lengths (I);\n end if;\n end loop;\n declare\n Results :\n array (My_List'Range) of Integer_Primes.Number_List (1 .. Max_Length);\n Largest_Minimal_Factor : Integer := 0;\n Winning_Index : Positive;\n begin\n for I in My_List'Range loop\n -- after Get_Result, the tasks terminate\n Decomposers (I).Get_Result (Results (I));\n if Results (I) (1) > Largest_Minimal_Factor then\n Largest_Minimal_Factor := Results (I) (1);\n Winning_Index := I;\n end if;\n end loop;\n Ada.Text_IO.Put_Line\n (\"Number\" & Integer'Image (My_List (Winning_Index)) &\n \" has largest minimal factor:\");\n Integer_Primes.Put (Results (Winning_Index) (1 .. Lengths (Winning_Index)));\n Ada.Text_IO.New_Line;\n end;\nend Parallel;\n","language":"Ada"},{"code":"#include <stdio.h>\n#include <omp.h>\n\nint main()\n{\n int data[] = {12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519};\n int largest, largest_factor = 0;\n\n omp_set_num_threads(4);\n /* \"omp parallel for\" turns the for loop multithreaded by making each thread\n * iterating only a part of the loop variable, in this case i; variables declared\n * as \"shared\" will be implicitly locked on access\n */\n #pragma omp parallel for shared(largest_factor, largest)\n for (int i = 0; i < 7; i++) {\n int p, n = data[i];\n\n for (p = 3; p * p <= n && n % p; p += 2);\n if (p * p > n) p = n;\n if (p > largest_factor) {\n largest_factor = p;\n largest = n;\n printf(\"thread %d: found larger: %d of %d\\n\",\n omp_get_thread_num(), p, n);\n } else {\n printf(\"thread %d: not larger: %d of %d\\n\",\n omp_get_thread_num(), p, n);\n }\n }\n\n printf(\"Largest factor: %d of %d\\n\", largest_factor, largest);\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <iterator>\n#include <vector>\n#include <ppl.h> // MSVC++\n#include <concurrent_vector.h> // MSVC++\n\nstruct Factors\n{\n int number;\n std::vector<int> primes;\n};\n\nconst int data[] =\n{\n 12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519\n};\n\nint main()\n{\n // concurrency-safe container replaces std::vector<>\n Concurrency::concurrent_vector<Factors> results;\n\n // parallel algorithm replaces std::for_each()\n Concurrency::parallel_for_each(std::begin(data), std::end(data), [&](int n)\n {\n Factors factors;\n factors.number = n;\n for (int f = 2; n > 1; ++f)\n {\n while (n % f == 0)\n {\n factors.primes.push_back(f);\n n /= f;\n }\n }\n results.push_back(factors); // add factorization to results\n });\n // end of parallel calculations\n\n // find largest minimal prime factor in results\n auto max = std::max_element(results.begin(), results.end(), [](const Factors &a, const Factors &b)\n {\n return a.primes.front() < b.primes.front();\n });\n\n // print number(s) and factorization\n std::for_each(results.begin(), results.end(), [&](const Factors &f)\n {\n if (f.primes.front() == max->primes.front())\n {\n std::cout << f.number << \" = [ \";\n std::copy(f.primes.begin(), f.primes.end(), std::ostream_iterator<int>(std::cout, \" \"));\n std::cout << \"]\\n\";\n }\n });\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\nclass Program\n{\n public static List<int> PrimeFactors(int number)\n {\n var primes = new List<int>();\n for (int div = 2; div <= number; div++)\n {\n while (number % div == 0)\n {\n primes.Add(div);\n number = number / div;\n }\n }\n return primes;\n }\n\n static void Main(string[] args)\n {\n int[] n = { 12757923, 12878611, 12757923, 15808973, 15780709, 197622519 };\n // Calculate each of those numbers' prime factors, in parallel\n var factors = n.AsParallel().Select(PrimeFactors).ToList();\n // Make a new list showing the smallest factor for each\n var smallestFactors = factors.Select(thisNumbersFactors => thisNumbersFactors.Min()).ToList();\n // Find the index that corresponds with the largest of those factors\n int biggestFactor = smallestFactors.Max();\n int whatIndexIsThat = smallestFactors.IndexOf(biggestFactor);\n Console.WriteLine(\"{0} has the largest minimum prime factor: {1}\", n[whatIndexIsThat], biggestFactor);\n Console.WriteLine(string.Join(\" \", factors[whatIndexIsThat]));\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Threading.Tasks;\n\nprivate static void Main(string[] args)\n{\n int j = 0, m = 0;\n decimal[] n = {12757923, 12878611, 12757923, 15808973, 15780709, 197622519};\n var l = new List<int>[n.Length];\n\n Parallel.For(0, n.Length, i => { l[i] = getPrimes(n[i]); });\n\n for (int i = 0; i<n.Length; i++)\n if (l[i].Min()>m)\n {\n m = l[i].Min();\n j = i;\n }\n\n Console.WriteLine(\"Number {0} has largest minimal factor:\", n[j]);\n foreach (int list in l[j])\n Console.Write(\" \"+list);\n}\n","language":"C-sharp"},{"code":"(use '[clojure.contrib.lazy-seqs :only [primes]])\n\n(defn lpf [n]\n [n (or (last\n (for [p (take-while #(<= (* % %) n) primes)\n :when (zero? (rem n p))]\n p))\n 1)])\n\n(->> (range 2 100000)\n (pmap lpf)\n (apply max-key second)\n println\n time)\n","language":"Clojure"},{"code":"(ql:quickload '(lparallel))\n\n(setf lparallel:*kernel* (lparallel:make-kernel 4)) ;; Configure for your system.\n\n(defun factor (n &optional (acc '()))\n (when (> n 1)\n (loop with max-d = (isqrt n)\n for d = 2 then (if (evenp d) (1+ d) (+ d 2)) do\n (cond ((> d max-d) (return (cons (list n 1) acc)))\n ((zerop (rem n d))\n (return (factor (truncate n d)\n (if (eq d (caar acc))\n (cons\n (list (caar acc) (1+ (cadar acc)))\n (cdr acc))\n (cons (list d 1) acc)))))))))\n\n(defun max-minimum-factor (numbers)\n (lparallel:pmap-reduce\n (lambda (n) (cons n (apply #'min (mapcar #'car (factor n)))))\n (lambda (a b) (if (> (cdr a) (cdr b)) a b))\n numbers))\n\n(defun print-max-factor (pair)\n (format t \"~a has the largest minimum factor ~a~%\" (car pair) (cdr pair)))\n","language":"Common-Lisp"},{"code":"CL-USER> (print-max-factor (max-minimum-factor '(12757923 12878611 12878893 12757923 15808973 15780709 197622519)))\n12878893 has the largest minimum factor 47\n","language":"Common-Lisp"},{"code":"ulong[] decompose(ulong n) pure nothrow {\n typeof(return) result;\n for (ulong i = 2; n >= i * i; i++)\n for (; n % i == 0; n /= i)\n result ~= i;\n if (n != 1)\n result ~= n;\n return result;\n}\n\nvoid main() {\n import std.stdio, std.algorithm, std.parallelism, std.typecons;\n\n immutable ulong[] data = [\n 2UL^^59-1, 2UL^^59-1, 2UL^^59-1, 112_272_537_195_293UL,\n 115_284_584_522_153, 115_280_098_190_773,\n 115_797_840_077_099, 112_582_718_962_171,\n 112_272_537_095_293, 1_099_726_829_285_419];\n\n //auto factors = taskPool.amap!(n => tuple(decompose(n), n))(data);\n //static enum genPair = (ulong n) pure => tuple(decompose(n), n);\n static genPair(ulong n) pure { return tuple(decompose(n), n); }\n auto factors = taskPool.amap!genPair(data);\n\n auto pairs = factors.map!(p => tuple(p[0].reduce!min, p[1]));\n writeln(\"N. with largest min factor: \", pairs.reduce!max[1]);\n}\n","language":"D"},{"code":"import std.stdio, std.math, std.algorithm, std.typecons,\n core.thread, core.stdc.time;\n\nfinal class MinFactor: Thread {\n private immutable ulong num;\n private ulong[] fac;\n private ulong minFac;\n\n this(in ulong n) /*pure nothrow*/ {\n super(&run);\n num = n;\n fac = new ulong[0];\n }\n\n @property ulong number() const pure nothrow {\n return num;\n }\n\n @property const(ulong[]) factors() const pure nothrow {\n return fac;\n }\n\n @property ulong minFactor() const pure nothrow {\n return minFac;\n }\n\n private void run() {\n immutable clock_t begin = clock;\n switch (num) {\n case 0: fac = [];\n break;\n\n case 1: fac = [1];\n break;\n\n default:\n uint limit = cast(uint)(1 + double(num).sqrt);\n ulong n = num;\n for (ulong divi = 3; divi < limit; divi += 2) {\n if (n == 1)\n break;\n if ((n % divi) == 0) {\n while ((n > 1) && ((n % divi) == 0)) {\n fac ~= divi;\n n /= divi;\n }\n limit = cast(uint)(1 + double(n).sqrt);\n }\n }\n if (n > 1)\n fac ~= n;\n }\n minFac = fac.reduce!min;\n immutable clock_t end = clock;\n writefln(\"num: %20d --> min. factor: %20d ticks(%7d -> %7d)\",\n num, minFac, begin, end);\n }\n}\n\nvoid main() {\n immutable ulong[] numbers = [\n 2UL^^59-1, 2UL^^59-1, 2UL^^59-1, 112_272_537_195_293UL,\n 115_284_584_522_153, 115_280_098_190_773,\n 115_797_840_077_099, 112_582_718_962_171,\n 112_272_537_095_293, 1_099_726_829_285_419];\n\n auto tGroup = new ThreadGroup;\n foreach (const n; numbers)\n tGroup.add(new MinFactor(n));\n\n writeln(\"Minimum factors for respective numbers are:\");\n foreach (t; tGroup)\n t.start;\n tGroup.joinAll;\n\n auto maxMin = tuple(0UL, [0UL], 0UL);\n foreach (thread; tGroup) {\n auto s = cast(MinFactor)thread;\n if (s !is null && maxMin[2] < s.minFactor)\n maxMin = tuple(s.number, s.factors.dup, s.minFactor);\n }\n\n writefln(\"Number with largest min. factor is %16d,\" ~\n \" with factors:\\n\\t%s\", maxMin.tupleof);\n}\n","language":"D"},{"code":"program Parallel_calculations;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n System.Threading,\n Velthuis.BigIntegers;\n\nfunction IsPrime(n: BigInteger): Boolean;\nvar\n i: BigInteger;\nbegin\n if n <= 1 then\n exit(False);\n\n i := 2;\n while i < BigInteger.Sqrt(n) do\n begin\n if n mod i = 0 then\n exit(False);\n inc(i);\n end;\n\n Result := True;\nend;\n\nfunction GetPrimes(n: BigInteger): TArray<BigInteger>;\nvar\n divisor, next, rest: BigInteger;\nbegin\n divisor := 2;\n next := 3;\n rest := n;\n while (rest <> 1) do\n begin\n while (rest mod divisor = 0) do\n begin\n SetLength(Result, Length(Result) + 1);\n Result[High(Result)] := divisor;\n rest := rest div divisor;\n end;\n divisor := next;\n next := next + 2;\n end;\nend;\n\nfunction Min(l: TArray<BigInteger>): BigInteger;\nbegin\n if Length(l) = 0 then\n exit(0);\n\n Result := l[0];\n for var v in l do\n if v < result then\n Result := v;\nend;\n\nconst\n n: array of Uint64 = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519];\n\nvar\n m: BigInteger;\n len, j, i: Uint64;\n l: TArray<TArray<BigInteger>>;\n\nbegin\n j := 0;\n m := 0;\n len := length(n);\n SetLength(l, len);\n\n TParallel.for (0, len - 1,\n procedure(i: Integer)\n begin\n l[i] := getPrimes(n[i]);\n end);\n\n for i := 0 to len - 1 do\n begin\n var _min := Min(l[i]);\n if _min > m then\n begin\n m := _min;\n j := i;\n end;\n end;\n\n writeln('Number ', n[j].ToString, ' has largest minimal factor:');\n for var v in l[j] do\n write(' ', v.ToString);\n\n readln;\nend.\n","language":"Delphi"},{"code":"-module( parallel_calculations ).\n\n-export( [fun_results/2, task/0] ).\n\nfun_results( Fun, Datas ) ->\n My_pid = erlang:self(),\n\tPids = [fun_spawn( Fun, X, My_pid ) || X <- Datas],\n\t[fun_receive(X) || X <- Pids].\n\ntask() ->\n Numbers = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519],\n Results = fun_results( fun factors/1, Numbers ),\n Min_results = [lists:min(X) || X <- Results],\n {_Max_min_factor, Number} = lists:max( lists:zip(Min_results, Numbers) ),\n {Number, Factors} = lists:keyfind( Number, 1, lists:zip(Numbers, Results) ),\n io:fwrite( \"~p has largest minimal factor among its prime factors ~p~n\", [Number, Factors] ).\n\n\n\nfactors(N) -> factors(N,2,[]).\n\nfactors(1,_,Acc) -> Acc;\nfactors(N,K,Acc) when N rem K == 0 -> factors(N div K,K, [K|Acc]);\nfactors(N,K,Acc) -> factors(N,K+1,Acc).\n\nfun_receive( Pid ) ->\n receive\n {ok, Result, Pid} -> Result;\n\t{Type, Error, Pid} -> erlang:Type( Error )\n end.\n\nfun_spawn( Fun, Data, My_pid ) ->\n erlang:spawn( fun() ->\n Result = try\n {ok, Fun(Data), erlang:self()}\n\n\t\t catch\n\t Type:Error -> {Type, Error, erlang:self()}\n\n\t\t end,\n\t My_pid ! Result\n end ).\n","language":"Erlang"},{"code":"open System\nopen PrimeDecomp // Has the decompose function from the Prime decomposition task\n\nlet data = [112272537195293L; 112582718962171L; 112272537095293L; 115280098190773L; 115797840077099L; 1099726829285419L]\nlet decomp num = decompose num 2L\n\nlet largestMinPrimeFactor (numbers: int64 list) =\n let decompDetails = Async.Parallel [ for n in numbers -> async { return n, decomp n } ] // Compute the number and its prime decomposition list\n |> Async.RunSynchronously // Start and wait for all parallel computations to complete.\n |> Array.sortBy (snd >> List.min >> (~-)) // Sort in descending order, based on the min prime decomp number.\n\n decompDetails.[0]\n\nlet showLargestMinPrimeFactor numbers =\n let number, primeList = largestMinPrimeFactor numbers\n printf \"Number %d has largest minimal factor:\\n \" number\n List.iter (printf \"%d \") primeList\n\nshowLargestMinPrimeFactor data\n","language":"F-Sharp"},{"code":"USING: io kernel fry locals sequences arrays math.primes.factors math.parser channels threads prettyprint ;\nIN: <filename>\n\n:: map-parallel ( seq quot -- newseq )\n <channel> :> ch\n seq [ '[ _ quot call ch to ] \"factors\" spawn ] { } map-as\n dup length [ ch from ] replicate nip ;\n\n{ 576460752303423487 576460752303423487\n 576460752303423487 112272537195293\n 115284584522153 115280098190773\n 115797840077099 112582718962171\n 112272537095293 1099726829285419 }\ndup [ factors ] map-parallel\ndup [ infimum ] map dup supremum\nswap index swap dupd nth -rot swap nth\n\"Number with largest min. factor is \" swap number>string append\n\", with factors: \" append write .\n","language":"Factor"},{"code":"USING: kernel io prettyprint sequences arrays math.primes.factors math.parser concurrency.combinators ;\n{ 576460752303423487 576460752303423487 576460752303423487 112272537195293\n 115284584522153 115280098190773 115797840077099 112582718962171 }\ndup [ factors ] parallel-map dup [ infimum ] map dup supremum\nswap index swap dupd nth -rot swap nth\n\"Number with largest min. factor is \" swap number>string append\n\", with factors: \" append write .\n","language":"Factor"},{"code":"program Primes\n\n use ISO_FORTRAN_ENV\n\n implicit none\n\n integer(int64), dimension(7) :: data = (/2099726827, 15780709, 1122725370, 15808973, 576460741, 12878611, 12757923/)\n integer(int64), dimension(100) :: outprimes\n integer(int64) :: largest_factor = 0, largest = 0, minim = 0, val = 0\n integer(int16) :: count = 0, OMP_GET_THREAD_NUM\n\n call omp_set_num_threads(4);\n !$omp parallel do private(val,outprimes,count) shared(data,largest_factor,largest)\n do val = 1, 7\n outprimes = 0\n call find_factors(data(val), outprimes, count)\n minim = minval(outprimes(1:count))\n if (minim > largest_factor) then\n largest_factor = minim\n largest = data(val)\n end if\n write(*, fmt = '(A7,i0,A2,i12,100i12)') 'Thread ', OMP_GET_THREAD_NUM(), ': ', data(val), outprimes(1:count)\n end do\n !$omp end parallel do\n\n write(*, fmt = '(i0,A26,i0)') largest, ' have the Largest factor: ', largest_factor\n\n return\n\ncontains\n\n subroutine find_factors(n, d, count)\n integer(int64), intent(in) :: n\n integer(int64), dimension(:), intent(out) :: d\n integer(int16), intent(out) :: count\n integer(int16) :: i\n integer(int64) :: div, next, rest\n\n i = 1\n div = 2; next = 3; rest = n\n\n do while (rest /= 1)\n do while (mod(rest, div) == 0)\n d(i) = div\n i = i + 1\n rest = rest / div\n end do\n div = next\n next = next + 2\n end do\n count = i - 1\n end subroutine find_factors\n\nend program Primes\n","language":"Fortran"},{"code":"#ifdef __FB_WIN32__\n ' ... instructions only for Win ...\n #Include \"windows.bi\"\n\n Function ThreadFunc As Dword Cdecl Alias \"ThreadFunc\"(param As Any Ptr) Export\n Print \"Thread running\"\n Function = 0\n End Function\n\n Dim As HANDLE thread\n Dim As Dword threadId\n\n thread = CreateThread(NULL, 0, @ThreadFunc, NULL, 0, @threadId)\n\n If thread = NULL Then\n Print \"Error creating thread\"\n Sleep\n End 1\n End If\n\n WaitForSingleObject(thread, INFINITE)\n#endif\n\n#ifdef __FB_LINUX__\n ' ... instructions only for Linux ...\n #Include \"crt/pthread.bi\"\n\n Function ThreadFunc As Any Ptr Cdecl Alias \"ThreadFunc\"(param As Any Ptr) Export\n Print \"Thread running\"\n Function = 0\n End Function\n\n Dim As pthread_t thread\n\n If pthread_create(@thread, NULL, @ThreadFunc, NULL) <> 0 Then\n Print \"Error creating thread\"\n Sleep\n End 1\n End If\n\n pthread_join(thread, NULL)\n#endif\n\nPrint \"Thread finished\"\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n)\n\n// collection of numbers. A slice is used for the collection.\n// The elements are big integers, since that's what the function Primes\n// uses (as was specified by the Prime decomposition task.)\nvar numbers = []*big.Int{\n big.NewInt(12757923),\n big.NewInt(12878611),\n big.NewInt(12878893),\n big.NewInt(12757923),\n big.NewInt(15808973),\n big.NewInt(15780709),\n}\n\n// main just calls the function specified by the task description and\n// prints results. note it allows for multiple numbers with the largest\n// minimal factor. the task didn't specify to handle this, but obviously\n// it's possible.\nfunc main() {\n rs := lmf(numbers)\n fmt.Println(\"largest minimal factor:\", rs[0].decomp[0])\n for _, r := range rs {\n fmt.Println(r.number, \"->\", r.decomp)\n }\n}\n\n// this type associates a number with it's prime decomposition.\n// the type is neccessary so that they can be sent together over\n// a Go channel, but it turns out to be convenient as well for\n// the return type of lmf.\ntype result struct {\n number *big.Int\n decomp []*big.Int\n}\n\n// the function specified by the task description, \"largest minimal factor.\"\nfunc lmf([]*big.Int) []result {\n // construct result channel and start a goroutine to decompose each number.\n // goroutines run in parallel as CPU cores are available.\n rCh := make(chan result)\n for _, n := range numbers {\n go decomp(n, rCh)\n }\n\n // collect results. <-rCh returns a single result from the result channel.\n // we know how many results to expect so code here collects exactly that\n // many results, and accumulates a list of those with the largest\n // minimal factor.\n rs := []result{<-rCh}\n for i := 1; i < len(numbers); i++ {\n switch r := <-rCh; r.decomp[0].Cmp(rs[0].decomp[0]) {\n case 1:\n rs = rs[:1]\n rs[0] = r\n case 0:\n rs = append(rs, r)\n }\n }\n return rs\n}\n\n// decomp is the function run as a goroutine. multiple instances of this\n// function will run concurrently, one for each number being decomposed.\n// it acts as a driver for Primes, calling Primes as needed, packaging\n// the result, and sending the packaged result on the channel.\n// \"as needed\" turns out to mean sending Primes a copy of n, as Primes\n// as written is destructive on its argument.\nfunc decomp(n *big.Int, rCh chan result) {\n rCh <- result{n, Primes(new(big.Int).Set(n))}\n}\n\n// code below copied from Prime decomposition task\nvar (\n ZERO = big.NewInt(0)\n ONE = big.NewInt(1)\n)\n\nfunc Primes(n *big.Int) []*big.Int {\n res := []*big.Int{}\n mod, div := new(big.Int), new(big.Int)\n for i := big.NewInt(2); i.Cmp(n) != 1; {\n div.DivMod(n, i, mod)\n for mod.Cmp(ZERO) == 0 {\n res = append(res, new(big.Int).Set(i))\n n.Set(div)\n div.DivMod(n, i, mod)\n }\n i.Add(i, ONE)\n }\n return res\n}\n","language":"Go"},{"code":"import Control.Parallel.Strategies (parMap, rdeepseq)\nimport Control.DeepSeq (NFData)\nimport Data.List (maximumBy)\nimport Data.Function (on)\n\nnums :: [Integer]\nnums =\n [ 112272537195293\n , 112582718962171\n , 112272537095293\n , 115280098190773\n , 115797840077099\n , 1099726829285419\n ]\n\nlowestFactor\n :: Integral a\n => a -> a -> a\nlowestFactor s n\n | even n = 2\n | otherwise = head y\n where\n y =\n [ x\n | x <- [s .. ceiling . sqrt $ fromIntegral n] ++ [n]\n , n `rem` x == 0\n , odd x ]\n\nprimeFactors\n :: Integral a\n => a -> a -> [a]\nprimeFactors l n = f n l []\n where\n f n l xs =\n if n > 1\n then f (n `div` l) (lowestFactor (max l 3) (n `div` l)) (l : xs)\n else xs\n\nminPrimes\n :: (Control.DeepSeq.NFData a, Integral a)\n => [a] -> (a, [a])\nminPrimes ns =\n (\\(x, y) -> (x, primeFactors y x)) $\n maximumBy (compare `on` snd) $ zip ns (parMap rdeepseq (lowestFactor 3) ns)\n\nmain :: IO ()\nmain = print $ minPrimes nums\n","language":"Haskell"},{"code":"procedure main(A)\n threads := []\n L := list(*A)\n every i := 1 to *A do put(threads, thread L[i] := primedecomp(A[i]))\n every wait(!threads)\n\n maxminF := L[maxminI := 1][1]\n every i := 2 to *L do if maxminF <:= L[i][1] then maxminI := i\n every writes((A[maxminI]||\": \")|(!L[maxminI]||\" \")|\"\\n\")\nend\n\nprocedure primedecomp(n) #: return a list of factors\n every put(F := [], genfactors(n))\n return F\nend\n\nlink factors\n","language":"Haskell"},{"code":" numbers =. 12757923 12878611 12878893 12757923 15808973 15780709 197622519\n factors =. q:&.> parallelize 2 numbers NB. q: is parallelized here\n ind =. (i. >./) <./@> factors\n ind { numbers ;\"_1 factors\n┌────────┬───────────┐\n│12878611│47 101 2713│\n└────────┴───────────┘\n","language":"J"},{"code":"import static java.lang.System.out;\nimport static java.util.Arrays.stream;\nimport static java.util.Comparator.comparing;\n\npublic interface ParallelCalculations {\n public static final long[] NUMBERS = {\n 12757923,\n 12878611,\n 12878893,\n 12757923,\n 15808973,\n 15780709,\n 197622519\n };\n\n public static void main(String... arguments) {\n stream(NUMBERS)\n .unordered()\n .parallel()\n .mapToObj(ParallelCalculations::minimalPrimeFactor)\n .max(comparing(a -> a[0]))\n .ifPresent(res -> out.printf(\n \"%d has the largest minimum prime factor: %d%n\",\n res[1],\n res[0]\n ));\n }\n\n public static long[] minimalPrimeFactor(long n) {\n for (long i = 2; n >= i * i; i++) {\n if (n % i == 0) {\n return new long[]{i, n};\n }\n }\n return new long[]{n, n};\n }\n}\n","language":"Java"},{"code":"var onmessage = function(event) {\n postMessage({\"n\" : event.data.n,\n \"factors\" : factor(event.data.n),\n \"id\" : event.data.id});\n};\n\nfunction factor(n) {\n var factors = [];\n for(p = 2; p <= n; p++) {\n if((n % p) == 0) {\n factors[factors.length] = p;\n n /= p;\n }\n }\n return factors;\n}\n","language":"JavaScript"},{"code":"var numbers = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519];\nvar workers = [];\nvar worker_count = 0;\n\nvar results = [];\n\nfor(var i = 0; i < numbers.length; i++) {\n worker_count++;\n workers[i] = new Worker(\"parallel_worker.js\");\n workers[i].onmessage = accumulate;\n workers[i].postMessage({n: numbers[i], id: i});\n}\n\nfunction accumulate(event) {\n n = event.data.n;\n factors = event.data.factors;\n id = event.data.id;\n console.log(n + \" : \" + factors);\n results[id] = {n:n, factors:factors};\n // Cleanup - kill the worker and countdown until all work is done\n workers[id].terminate();\n worker_count--;\n if(worker_count == 0)\n\treduce();\n}\n\nfunction reduce() {\n answer = 0;\n for(i = 1; i < results.length; i++) {\n\tmin = results[i].factors[0];\n\tlargest_min = results[answer].factors[0];\n\tif(min > largest_min)\n\t answer = i;\n }\n n = results[answer].n;\n factors = results[answer].factors;\n console.log(\"The number with the relatively largest factors is: \" + n + \" : \" + factors);\n}\n","language":"JavaScript"},{"code":"using Primes\n\nfactortodict(d, n) = (d[minimum(collect(keys(factor(n))))] = n)\n\n# Numbers are from from the Raku example.\nnumbers = [64921987050997300559, 70251412046988563035, 71774104902986066597,\n 83448083465633593921, 84209429893632345702, 87001033462961102237,\n 87762379890959854011, 89538854889623608177, 98421229882942378967,\n 259826672618677756753, 262872058330672763871, 267440136898665274575,\n 278352769033314050117, 281398154745309057242, 292057004737291582187]\n\nmins = Dict()\n\nBase.@sync(\n Threads.@threads for n in numbers\n factortodict(mins, n)\n end\n)\n\nanswer = maximum(keys(mins))\nprintln(\"The number that has the largest minimum prime factor is $(mins[answer]), with a smallest factor of $answer\")\n","language":"Julia"},{"code":"// version 1.1.51\n\nimport java.util.stream.Collectors\n\n/* returns the number itself, its smallest prime factor and all its prime factors */\nfun primeFactorInfo(n: Int): Triple<Int, Int, List<Int>> {\n if (n <= 1) throw IllegalArgumentException(\"Number must be more than one\")\n if (isPrime(n)) return Triple(n, n, listOf(n))\n val factors = mutableListOf<Int>()\n var factor = 2\n var nn = n\n while (true) {\n if (nn % factor == 0) {\n factors.add(factor)\n nn /= factor\n if (nn == 1) return Triple(n, factors.min()!!, factors)\n if (isPrime(nn)) factor = nn\n }\n else if (factor >= 3) factor += 2\n else factor = 3\n }\n}\n\nfun isPrime(n: Int) : Boolean {\n if (n < 2) return false\n if (n % 2 == 0) return n == 2\n if (n % 3 == 0) return n == 3\n var d = 5\n while (d * d <= n) {\n if (n % d == 0) return false\n d += 2\n if (n % d == 0) return false\n d += 4\n }\n return true\n}\n\nfun main(args: Array<String>) {\n val numbers = listOf(\n 12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519\n )\n val info = numbers.stream()\n .parallel()\n .map { primeFactorInfo(it) }\n .collect(Collectors.toList())\n val maxFactor = info.maxBy { it.second }!!.second\n val results = info.filter { it.second == maxFactor }\n println(\"The following number(s) have the largest minimal prime factor of $maxFactor:\")\n for (result in results) {\n println(\" ${result.first} whose prime factors are ${result.third}\")\n }\n}\n","language":"Kotlin"},{"code":"hasSmallestFactor[data_List]:=Sort[Transpose[{ParallelTable[FactorInteger[x][[1, 1]], {x, data}],data}]][[1, 2]]\n","language":"Mathematica"},{"code":"import strformat, strutils, threadpool\n\nconst Numbers = [576460752303423487,\n 576460752303423487,\n 576460752303423487,\n 112272537195293,\n 115284584522153,\n 115280098190773,\n 115797840077099,\n 112582718962171,\n 299866111963290359]\n\n\nproc lowestFactor(n: int64): int64 =\n if n mod 2 == 0: return 2\n if n mod 3 == 0: return 3\n var p = 5\n var delta = 2\n while p * p < n:\n if n mod p == 0: return p\n inc p, delta\n delta = 6 - delta\n result = n\n\n\nproc factors(n, lowest: int64): seq[int64] =\n var n = n\n var lowest = lowest\n while true:\n result.add lowest\n n = n div lowest\n if n == 1: break\n lowest = lowestFactor(n)\n\n\n# Launch a thread for each number to process.\nvar responses: array[Numbers.len, FlowVar[int64]]\nfor i, n in Numbers:\n responses[i] = spawn lowestFactor(n)\n\n# Read the results and find the largest minimum prime factor.\nvar maxMinfact = 0i64\nvar maxIdx: int\nfor i in 0..responses.high:\n let minfact = ^responses[i] # Blocking read.\n echo &\"For n = {Numbers[i]}, the lowest factor is {minfact}.\"\n if minfact > maxMinfact:\n maxMinfact = minfact\n maxIdx = i\nlet result = Numbers[maxIdx]\n\necho \"\"\necho \"The first number with the largest minimum prime factor is: \", result\necho \"Its factors are: \", result.factors(maxMinfact).join(\", \")\n","language":"Nim"},{"code":"import sequtils, strutils, threadpool\n\n{.experimental: \"parallel\".}\n\nconst Numbers = [576460752303423487,\n 576460752303423487,\n 576460752303423487,\n 112272537195293,\n 115284584522153,\n 115280098190773,\n 115797840077099,\n 112582718962171,\n 299866111963290359]\n\n\nproc lowestFactor(n: int64): int64 =\n if n mod 2 == 0: return 2\n if n mod 3 == 0: return 3\n var p = 5\n var delta = 2\n while p * p < n:\n if n mod p == 0: return p\n inc p, delta\n delta = 6 - delta\n result = n\n\n\nproc factors(n, lowest: int64): seq[int64] =\n var n = n\n var lowest = lowest\n while true:\n result.add lowest\n n = n div lowest\n if n == 1: break\n lowest = lowestFactor(n)\n\n\n# Launch the threads.\nvar results: array[Numbers.len, int64] # To store the results.\nparallel:\n for i, n in Numbers:\n results[i] = spawn lowestFactor(n)\n\n# Find the minimum prime factor and the first number with this minimum factor.\nlet maxIdx = results.maxIndex()\nlet maxMinfact = results[maxIdx]\nlet result = Numbers[maxIdx]\n\necho \"\"\necho \"The first number with the largest minimum prime factor is: \", result\necho \"Its factors are: \", result.factors(maxMinfact).join(\", \")\n","language":"Nim"},{"code":"import: parallel\n\n: largeMinFactor dup mapParallel(#factors) zip maxFor(#[ second first ]) ;\n","language":"Oforth"},{"code":"/* Concurrency in ooRexx. Example of early reply */\nobject1 = .example~new\nobject2 = .example~new\nsay object1~primes(1,11111111111,11111111114)\nsay object2~primes(2,11111111111,11111111114)\nsay \"Main ended at\" time()\nexit\n::class example\n::method primes\nuse arg which,bot,top\nreply \"Start primes\"which':' time()\nSelect\n When which=1 Then Call pd1 bot top\n When which=2 Then Call pd2 bot top\n End\n","language":"OoRexx"},{"code":"/*PD1 REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/\nCall Time 'R'\nnumeric digits 1000 /*handle thousand digits for the powers*/\nparse arg bot top step base add /*get optional arguments from the C.L. */\nif bot=='' then do; bot=1; top=100; end /*no BOT given? Then use the default.*/\nif top=='' then top=bot /* \" TOP? \" \" \" \" \" */\nif step=='' then step= 1 /* \" STEP? \" \" \" \" \" */\nif add =='' then add= -1 /* \" ADD? \" \" \" \" \" */\ntell= top>0; top=abs(top) /*if TOP is negative, suppress displays*/\nw=length(top) /*get maximum width for aligned display*/\nif base\\=='' then w=length(base**top) /*will be testing powers of two later? */\ncommat.=left('', 7); commat.0=\"{unity}\"; commat.1='[prime]' /*some literals: pad; prime (or not).*/\nnumeric digits max(9, w+1) /*maybe increase the digits precision. */\nhash=0 /*hash: is the number of primes found. */\n do n=bot to top by step /*process a single number or a range.*/\n ?=n; if base\\=='' then ?=base**n + add /*should we perform a \"Mercenne\" test? */\n pf=factr(?); f=words(pf) /*get prime factors; number of factors.*/\n if f==1 then hash=hash+1 /*Is N prime? Then bump prime counter.*/\n if tell then say right(?,w) right('('f\")\",9) 'prime factors: ' commat.f pf\n end /*n*/\nsay\nps= 'primes'; if p==1 then ps= \"prime\" /*setup for proper English in sentence.*/\nsay right(hash, w+9+1) ps 'found.' /*display the number of primes found. */\nSay 'PD1 took' time('E') 'seconds'\nexit /*stick a fork in it, we're all done. */\n/*--------------------------------------------------------------------------------------*/\nfactr: procedure; parse arg x 1 d,dollar /*set X, D to argument 1; dollar to null.*/\nif x==1 then return '' /*handle the special case of X = 1. */\n do while x//2==0; dollar=dollar 2; x=x%2; end /*append all the 2 factors of new X.*/\n do while x//3==0; dollar=dollar 3; x=x%3; end /* \" \" \" 3 \" \" \" \" */\n do while x//5==0; dollar=dollar 5; x=x%5; end /* \" \" \" 5 \" \" \" \" */\n do while x//7==0; dollar=dollar 7; x=x%7; end /* \" \" \" 7 \" \" \" \" */\n /* ___*/\nq=1; do while q<=x; q=q*4; end /*these two lines compute integer v X */\nr=0; do while q>1; q=q%4; _=d-r-q; r=r%2; if _>=0 then do; d=_; r=r+q; end; end\n\n do j=11 by 6 to r /*insure that J isn't divisible by 3.*/\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\n if _\\==5 then do while x//j==0; dollar=dollar j; x=x%j; end /*maybe reduce by J. */\n if _ ==3 then iterate /*Is next Y is divisible by 5? Skip.*/\n y=j+2; do while x//y==0; dollar=dollar y; x=x%y; end /*maybe reduce by J. */\n end /*j*/\n /* [?] The dollar list has a leading blank.*/\nif x==1 then return dollar /*Is residual=unity? Then don't append.*/\n return dollar x /*return dollar with appended residual. */\n","language":"OoRexx"},{"code":"/*PD2 REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/\nCall time 'R'\nnumeric digits 1000 /*handle thousand digits for the powers*/\nparse arg bot top step base add /*get optional arguments from the C.L. */\nif bot=='' then do; bot=1; top=100; end /*no BOT given? Then use the default.*/\nif top=='' then top=bot /* \" TOP? \" \" \" \" \" */\nif step=='' then step= 1 /* \" STEP? \" \" \" \" \" */\nif add =='' then add= -1 /* \" ADD? \" \" \" \" \" */\ntell= top>0; top=abs(top) /*if TOP is negative, suppress displays*/\nw=length(top) /*get maximum width for aligned display*/\nif base\\=='' then w=length(base**top) /*will be testing powers of two later? */\ncommat.=left('', 7); commat.0=\"{unity}\"; commat.1='[prime]' /*some literals: pad; prime (or not).*/\nnumeric digits max(9, w+1) /*maybe increase the digits precision. */\nhash=0 /*hash: is the number of primes found. */\n do n=bot to top by step /*process a single number or a range.*/\n ?=n; if base\\=='' then ?=base**n + add /*should we perform a \"Mercenne\" test? */\n pf=factr(?); f=words(pf) /*get prime factors; number of factors.*/\n if f==1 then hash=hash+1 /*Is N prime? Then bump prime counter.*/\n if tell then say right(?,w) right('('f\")\",9) 'prime factors: ' commat.f pf\n end /*n*/\nsay\nps= 'primes'; if p==1 then ps= \"prime\" /*setup for proper English in sentence.*/\nsay right(hash, w+9+1) ps 'found.' /*display the number of primes found. */\nSay 'PD2 took' time('E') 'seconds'\nexit /*stick a fork in it, we're all done. */\n/*--------------------------------------------------------------------------------------*/\nfactr: procedure; parse arg x 1 d,dollar /*set X, D to argument 1; dollar to null.*/\nif x==1 then return '' /*handle the special case of X = 1. */\n do while x// 2==0; dollar=dollar 2; x=x%2; end /*append all the 2 factors of new X.*/\n do while x// 3==0; dollar=dollar 3; x=x%3; end /* \" \" \" 3 \" \" \" \" */\n do while x// 5==0; dollar=dollar 5; x=x%5; end /* \" \" \" 5 \" \" \" \" */\n do while x// 7==0; dollar=dollar 7; x=x%7; end /* \" \" \" 7 \" \" \" \" */\n do while x//11==0; dollar=dollar 11; x=x%11; end /* \" \" \" 11 \" \" \" \" */ /* ?¦¦¦¦ added.*/\n do while x//13==0; dollar=dollar 13; x=x%13; end /* \" \" \" 13 \" \" \" \" */ /* ?¦¦¦¦ added.*/\n do while x//17==0; dollar=dollar 17; x=x%17; end /* \" \" \" 17 \" \" \" \" */ /* ?¦¦¦¦ added.*/\n do while x//19==0; dollar=dollar 19; x=x%19; end /* \" \" \" 19 \" \" \" \" */ /* ?¦¦¦¦ added.*/\n do while x//23==0; dollar=dollar 23; x=x%23; end /* \" \" \" 23 \" \" \" \" */ /* ?¦¦¦¦ added.*/\n /* ___*/\nq=1; do while q<=x; q=q*4; end /*these two lines compute integer v X */\nr=0; do while q>1; q=q%4; _=d-r-q; r=r%2; if _>=0 then do; d=_; r=r+q; end; end\n\n do j=29 by 6 to r /*insure that J isn't divisible by 3.*/ /* ?¦¦¦¦ changed.*/\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\n if _\\==5 then do while x//j==0; dollar=dollar j; x=x%j; end /*maybe reduce by J. */\n if _ ==3 then iterate /*Is next Y is divisible by 5? Skip.*/\n y=j+2; do while x//y==0; dollar=dollar y; x=x%y; end /*maybe reduce by J. */\n end /*j*/\n /* [?] The dollar list has a leading blank.*/\nif x==1 then return dollar /*Is residual=unity? Then don't append.*/\n return dollar x /*return dollar with appended residual. */\n","language":"OoRexx"},{"code":"'CONFIGURATION\n'=============\n\n% max 8192 'Maximum amount of Prime Numbers (must be 2^n) (excluding 1 and 2)\n% cores 4 'CPU cores available (limited to 4 here)\n% share 2048 'Amount of numbers allocated to each core\n\n'SETUP\n'=====\n\n'SOURCE DATA BUFFERS\n\nsys primes[max]\nsys numbers[max]\n\n'RESULT BUFFER\n\ndouble pp[max] 'main thread\n\n\n'MULTITHREADING AND TIMING API\n'=============================\n\nextern lib \"kernel32.dll\"\n'\nvoid QueryPerformanceCounter(quad*c)\nvoid QueryPerformanceFrequency(quad*freq)\nsys CreateThread (sys lpThreadAttributes, dwStackSize, lpStartAddress, lpParameter, dwCreationFlags, *lpThreadId)\ndword WaitForMultipleObjects(sys nCount,*lpHandles, bWaitAll, dwMilliseconds)\nbool CloseHandle(sys hObject)\nvoid Sleep(sys dwMilliSeconds)\n'\nquad freq,t1,t2\nQueryPerformanceFrequency freq\n\n\n'MACROS AND FUNCTIONS\n'====================\n\n\nmacro FindPrimes(p)\n'==================\nfinit\nsys n=1\nsys c,k\ndo\n n+=2\n if c>=max then exit do\n '\n 'IS IT DIVISIBLE BE ANY PREVIOUS PRIME\n '\n for k=1 to c\n if frac(n/p[k])=0 then exit for\n next\n '\n if k>c then\n c++\n p[c]=n 'STORE PRIME\n end if\nend do\nend macro\n\n\nmacro ProcessNumbers(p,bb)\n'=========================\nfinit\nsys i,b,e\nb=bb*share\ne=b+share\nsys v,w\nfor i=b+1 to e\n v=numbers(i)\n for j=max to 1 step -1\n w=primes(j)\n if w<v then\n if frac(v/w)=0 then\n p(i)=primes(j) 'store highest factor\n exit for 'process next number\n end if\n end if\n next\nnext\nend macro\n\n'THREAD FUNCTIONS\n\nfunction threadA(sys v) as sys\nProcessNumbers(pp,v)\nend function\n\n\nfunction threadB(sys v) as sys\nProcessNumbers(pp,v)\nend function\n\n\nfunction threadC(sys v) as sys\nProcessNumbers(pp,v)\nend function\n\n\nend extern\n\nfunction mainThread(sys b)\n'===========================\nProcessNumbers(pp,b)\nend function\n\n\n'SOURCE DATA GENERATION\n\nsys seed = 0x12345678\n\nfunction Rnd() as sys\n'====================\n'\nmov eax,seed\nrol eax,7\nimul eax,eax,13\nmov seed,eax\nreturn eax\nend function\n\n\nfunction GenerateNumbers()\n'=========================\nsys i,v,mask\nmask=max * 8 -1 'as bit mask\nfor i=1 to max\n v=rnd()\n v and=mask\n numbers(i)=v\nnext\nend function\n\n\n\nFindPrimes(primes)\n\nGenerateNumbers()\n\n\n\n% threads Cores-1\n\n% INFINITE 0xFFFFFFFF 'Infinite timeout\n\nsys Funs[threads]={@threadA,@threadB,@threadC} '3 additional threads\nsys hThread[threads], id[threads], i\n'\n'START TIMER\n'\nQueryPerformanceCounter t1\n'\nfor i=1 to threads\n hThread(i) = CreateThread 0,0,funs(i),i,0,id(i)\nnext\n\n\nMainThread(0) 'process numbers in main thread (bottom share)\n\nif threads>0 then\n WaitForMultipleObjects Threads, hThread, 1, INFINITE\nend if\n\nfor i=1 to Threads\n CloseHandle hThread(i)\nnext\n\n'CAPTURE NUMBER WITH HIGHEST PRIME FACTOR\n\nsys n,f\nfor i=1 to max\n if pp(i)>f then f=pp(i) : n=i\nnext\n\n'STOP TIMER\n\nQueryPerformanceCounter t2\n\nprint str((t2-t1)/freq,3) \" secs \" numbers(n) \" \" f 'number with highest prime factor\n","language":"OxygenBasic"},{"code":"v=pareval(vector(1000,i,()->factor(2^i+1)[1,1]));\nvecmin(v)\n","language":"PARI-GP"},{"code":"use ntheory qw/factor vecmax/;\nuse threads;\nuse threads::shared;\nmy @results :shared;\n\nmy $tnum = 0;\n$_->join() for\n map { threads->create('tfactor', $tnum++, $_) }\n (qw/576460752303423487 576460752303423487 576460752303423487 112272537195293\n 115284584522153 115280098190773 115797840077099 112582718962171 299866111963290359/);\n\nmy $lmf = vecmax( map { $_->[1] } @results );\nprint \"Largest minimal factor of $lmf found in:\\n\";\nprint \" $_->[0] = [@$_[1..$#$_]]\\n\" for grep { $_->[1] == $lmf } @results;\n\nsub tfactor {\n my($tnum, $n) = @_;\n push @results, shared_clone([$n, factor($n)]);\n}\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\ParallelCalculations.exw\n -- =====================================\n --\n -- Proof that more threads can make things faster...\n --</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (threads)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">res_cs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">init_cs</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #000080;font-style:italic;\">-- critical section</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">athread</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">z</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #7060A8;\">enter_cs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res_cs</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">integer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">i</span>\n <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">leave_cs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res_cs</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">mpz_ui_pow_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add_ui</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_prime_factors</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1_000_000</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">enter_cs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res_cs</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">r</span>\n <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #7060A8;\">leave_cs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res_cs</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">exit_thread</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">nthreads</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">progress</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"testing %d threads...\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">nthreads</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">tagset</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">threads</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">nthreads</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">threads</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">threads</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">create_thread</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">routine_id</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"athread\"</span><span style=\"color: #0000FF;\">),{}))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">wait_thread</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">threads</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">largest</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">e</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">elapsed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"largest is 2^%d+1 with smallest factor of %d (%d threads, %s)\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">nthreads</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">e</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">delete_cs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res_cs</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(let Lst\n (mapcan\n '((N)\n (later (cons) # When done,\n (cons N (factor N)) ) ) # return the number and its factors\n (quote\n 188573867500151328137405845301 # Process a collection of 12 numbers\n 3326500147448018653351160281\n 979950537738920439376739947\n 2297143294659738998811251\n 136725986940237175592672413\n 3922278474227311428906119\n 839038954347805828784081\n 42834604813424961061749793\n 2651919914968647665159621\n 967022047408233232418982157\n 2532817738450130259664889\n 122811709478644363796375689 ) )\n (wait NIL (full Lst)) # Wait until all computations are done\n (maxi '((L) (apply min L)) Lst) ) # Result: Number in CAR, factors in CDR\n","language":"PicoLisp"},{"code":"threaded_decomp(Number,ID):-\n\tthread_create(\n\t\t (prime_decomp(Number,Y),\n\t\t thread_exit((Number,Y)))\n\t\t ,ID,[]).\n\nthreaded_decomp_list(List,Erg):-\n\tmaplist(threaded_decomp,List,IDs),\n\tmaplist(thread_join,IDs,Results),\n\tmaplist(pack_exit_out,Results,Smallest_Factors_List),\n\tlargest_min_factor(Smallest_Factors_List,Erg).\n\npack_exit_out(exited(X),X).\n%Note that here some error handling should happen.\n\nlargest_min_factor([(N,Facs)|A],(N2,Fs2)):-\n\tmin_list(Facs,MF),\n\tlargest_min_factor(A,(N,MF,Facs),(N2,_,Fs2)).\n\nlargest_min_factor([],Acc,Acc).\nlargest_min_factor([(N1,Facs1)|Rest],(N2,MF2,Facs2),Goal):-\n\tmin_list(Facs1, MF1),\n\t(MF1 > MF2->\n\tlargest_min_factor(Rest,(N1,MF1,Facs1),Goal);\n\tlargest_min_factor(Rest,(N2,MF2,Facs2),Goal)).\n\n\nformat_it(List):-\n\tthreaded_decomp_list(List,(Number,Factors)),\n\tformat('Number with largest minimal Factor is ~w\\nFactors are ~w\\n',\n\t [Number,Factors]).\n","language":"Prolog"},{"code":"Structure IO_block\n ThreadID.i\n StartSeamaphore.i\n Value.q\n MinimumFactor.i\n List Factors.i()\nEndStructure\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\nDeclare Factorize(*IO.IO_block)\nDeclare main()\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\nMain()\nEnd\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\nProcedure Main()\n Protected AvailableCpu, MainSemaphore\n Protected i, j, qData.q, Title$, Message$\n NewList T.IO_block()\n ;\n AvailableCpu = Val(GetEnvironmentVariable(\"NUMBER_OF_PROCESSORS\"))\n If AvailableCpu<1: AvailableCpu=1: EndIf\n MainSemaphore = CreateSemaphore(AvailableCpu)\n ;\n Restore Start_of_data\n For i=1 To (?end_of_data-?Start_of_data) / SizeOf(Quad)\n ; Start all threads at ones, they will then be let to\n ; self-oganize according to the availiable Cores.\n AddElement(T())\n Read.q qData\n T()\\Value = qData\n T()\\StartSeamaphore = MainSemaphore\n T()\\ThreadID = CreateThread(@Factorize(), @T())\n Next\n ;\n ForEach T()\n ; Wait for all threads to complete their work and\n ; find the smallest factor from eact task.\n WaitThread(T()\\ThreadID)\n Next\n ;\n i = OffsetOf(IO_block\\MinimumFactor)\n SortStructuredList(T(), #PB_Sort_Integer, i, #PB_Sort_Descending)\n FirstElement(T())\n Title$=\"Info\"\n Message$=\"Number \"+Str(T()\\Value)+\" has largest minimal factor:\"+#CRLF$\n ForEach T()\\Factors()\n Message$ + Str(T()\\Factors())+\" \"\n Next\n MessageRequester(Title$, Message$)\nEndProcedure\n\nProcedureDLL Factorize(*IO.IO_block) ; Fill list Factors() with the factor parts of Number\n ;Based on http://rosettacode.org/wiki/Prime_decomposition#PureBasic\n With *IO\n Protected Value.q=\\Value\n WaitSemaphore(\\StartSeamaphore)\n Protected I = 3\n ClearList(\\Factors())\n While Value % 2 = 0\n AddElement(\\Factors())\n \\Factors() = 2\n Value / 2\n Wend\n Protected Max = Value\n While I <= Max And Value > 1\n While Value % I = 0\n AddElement(\\Factors())\n \\Factors() = I\n Value / I\n Wend\n I + 2\n Wend\n SortList(\\Factors(), #PB_Sort_Ascending)\n FirstElement(\\Factors())\n \\MinimumFactor=\\Factors()\n SignalSemaphore(\\StartSeamaphore)\n EndWith ;*IO\nEndProcedure\n\nDataSection\n Start_of_data: ; Same numbers as Ada\n Data.q 12757923, 12878611, 12757923, 15808973, 15780709, 197622519\n end_of_data:\nEndDataSection\n","language":"PureBasic"},{"code":"from concurrent import futures\nfrom math import floor, sqrt\n\nNUMBERS = [\n 112272537195293,\n 112582718962171,\n 112272537095293,\n 115280098190773,\n 115797840077099,\n 1099726829285419]\n# NUMBERS = [33, 44, 55, 275]\n\ndef lowest_factor(n, _start=3):\n if n % 2 == 0:\n return 2\n search_max = int(floor(sqrt(n))) + 1\n for i in range(_start, search_max, 2):\n if n % i == 0:\n return i\n return n\n\ndef prime_factors(n, lowest):\n pf = []\n while n > 1:\n pf.append(lowest)\n n //= lowest\n lowest = lowest_factor(n, max(lowest, 3))\n return pf\n\ndef prime_factors_of_number_with_lowest_prime_factor(NUMBERS):\n with futures.ProcessPoolExecutor() as executor:\n low_factor, number = max( (l, f) for l, f in zip(executor.map(lowest_factor, NUMBERS), NUMBERS) )\n all_factors = prime_factors(number, low_factor)\n return number, all_factors\n\n\ndef main():\n print('For these numbers:')\n print('\\n '.join(str(p) for p in NUMBERS))\n number, all_factors = prime_factors_of_number_with_lowest_prime_factor(NUMBERS)\n print(' The one with the largest minimum prime factor is {}:'.format(number))\n print(' All its prime factors in order are: {}'.format(all_factors))\n\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"import multiprocessing\n\n# ========== #Python3 - concurrent\nfrom math import floor, sqrt\n\nnumbers = [\n 112272537195293,\n 112582718962171,\n 112272537095293,\n 115280098190773,\n 115797840077099,\n 1099726829285419]\n# numbers = [33, 44, 55, 275]\n\ndef lowest_factor(n, _start=3):\n if n % 2 == 0:\n return 2\n search_max = int(floor(sqrt(n))) + 1\n for i in range(_start, search_max, 2):\n if n % i == 0:\n return i\n return n\n\ndef prime_factors(n, lowest):\n pf = []\n while n > 1:\n pf.append(lowest)\n n //= lowest\n lowest = lowest_factor(n, max(lowest, 3))\n return pf\n# ========== #Python3 - concurrent\n\ndef prime_factors_of_number_with_lowest_prime_factor(numbers):\n pool = multiprocessing.Pool(processes=5)\n factors = pool.map(lowest_factor,numbers)\n\n low_factor,number = max((l,f) for l,f in zip(factors,numbers))\n all_factors = prime_factors(number,low_factor)\n return number,all_factors\n\nif __name__ == '__main__':\n print('For these numbers:')\n print('\\n '.join(str(p) for p in numbers))\n number, all_factors = prime_factors_of_number_with_lowest_prime_factor(numbers)\n print(' The one with the largest minimum prime factor is {}:'.format(number))\n print(' All its prime factors in order are: {}'.format(all_factors))\n","language":"Python"},{"code":"#lang racket\n(require math)\n(provide main)\n\n(define (smallest-factor n)\n (list (first (first (factorize n))) n))\n\n(define numbers\n '(112272537195293 112582718962171 112272537095293\n 115280098190773 115797840077099 1099726829285419))\n\n(define (main)\n ; create as many instances of Racket as\n ; there are numbers:\n (define ps\n (for/list ([_ numbers])\n (place ch\n (place-channel-put\n ch\n (smallest-factor\n (place-channel-get ch))))))\n ; send the numbers to the instances:\n (map place-channel-put ps numbers)\n ; get the results and find the maximum:\n (argmax first (map place-channel-get ps)))\n","language":"Racket"},{"code":"> (main)\n'(544651 115797840077099)\n","language":"Racket"},{"code":"my @nums = 64921987050997300559, 70251412046988563035, 71774104902986066597,\n 83448083465633593921, 84209429893632345702, 87001033462961102237,\n 87762379890959854011, 89538854889623608177, 98421229882942378967,\n 259826672618677756753, 262872058330672763871, 267440136898665274575,\n 278352769033314050117, 281398154745309057242, 292057004737291582187;\n\nmy @factories = @nums.hyper(:3batch).map: &prime-factors;\nprintf \"%21d factors: %s\\n\", |$_ for @nums Z @factories;\nmy $gmf = {}.append(@factories»[0] »=>« @nums).max: +*.key;\nsay \"\\nGreatest minimum factor: \", $gmf.key;\nsay \"from: { $gmf.value }\\n\";\nsay 'Run time: ', now - INIT now;\nsay '-' x 80;\n\n# For amusements sake and for relative comparison, using the same 100\n# numbers as in the SequenceL example, testing with different numbers of threads.\n\n@nums = <625070029 413238785 815577134 738415913 400125878 967798656 830022841\n 774153795 114250661 259366941 571026384 522503284 757673286 509866901 6303092\n 516535622 177377611 520078930 996973832 148686385 33604768 384564659 95268916\n 659700539 149740384 320999438 822361007 701572051 897604940 2091927 206462079\n 290027015 307100080 904465970 689995756 203175746 802376955 220768968 433644101\n 892007533 244830058 36338487 870509730 350043612 282189614 262732002 66723331\n 908238109 635738243 335338769 461336039 225527523 256718333 277834108 430753136\n 151142121 602303689 847642943 538451532 683561566 724473614 422235315 921779758\n 766603317 364366380 60185500 333804616 988528614 933855820 168694202 219881490\n 703969452 308390898 567869022 719881996 577182004 462330772 770409840 203075270\n 666478446 351859802 660783778 503851023 789751915 224633442 347265052 782142901\n 43731988 246754498 736887493 875621732 594506110 854991694 829661614 377470268\n 984990763 275192380 39848200 892766084 76503760>».Int;\n\nfor 1..8 -> $degree {\n my $start = now;\n my \\factories = @nums.hyper(:degree($degree), :3batch).map: &prime-factors;\n my $gmf = {}.append(factories»[0] »=>« @nums).max: +*.key;\n say \"\\nFactoring {+@nums} numbers, greatest minimum factor: {$gmf.key}\";\n say \"Using: $degree thread{ $degree > 1 ?? 's' !! ''}\";\n my $end = now;\n say 'Run time: ', $end - $start, ' seconds.';\n}\n\n# Prime factoring routines from the Prime decomposition task\nsub prime-factors ( Int $n where * > 0 ) {\n return $n if $n.is-prime;\n return [] if $n == 1;\n my $factor = find-factor( $n );\n sort flat prime-factors( $factor ), prime-factors( $n div $factor );\n}\n\nsub find-factor ( Int $n, $constant = 1 ) {\n return 2 unless $n +& 1;\n if (my $gcd = $n gcd 6541380665835015) > 1 {\n return $gcd if $gcd != $n\n }\n my $x = 2;\n my $rho = 1;\n my $factor = 1;\n while $factor == 1 {\n $rho *= 2;\n my $fixed = $x;\n for ^$rho {\n $x = ( $x * $x + $constant ) % $n;\n $factor = ( $x - $fixed ) gcd $n;\n last if 1 < $factor;\n }\n }\n $factor = find-factor( $n, $constant + 1 ) if $n == $factor;\n $factor;\n}\n","language":"Raku"},{"code":"//! This solution uses [rayon](https://github.com/rayon-rs/rayon), a data-parallelism library.\n//! Since Rust guarantees that a program has no data races, adding parallelism to a sequential\n//! computation is as easy as importing the rayon traits and calling the `par_iter()` method.\n\nextern crate rayon;\n\nextern crate prime_decomposition;\n\nuse rayon::prelude::*;\n\n/// Returns the largest minimal factor of the numbers in a slice\npub fn largest_min_factor(numbers: &[usize]) -> usize {\n numbers\n .par_iter()\n .map(|n| {\n // `factor` returns a sorted vector, so we just take the first element.\n prime_decomposition::factor(*n)[0]\n })\n .max()\n .unwrap()\n}\n\nfn main() {\n let numbers = &[\n 1_122_725, 1_125_827, 1_122_725, 1_152_800, 1_157_978, 1_099_726,\n ];\n let max = largest_min_factor(numbers);\n println!(\"The largest minimal factor is {}\", max);\n}\n","language":"Rust"},{"code":"import <Utilities/Conversion.sl>;\nimport <Utilities/Math.sl>;\nimport <Utilities/Sequence.sl>;\n\t\t\nmain(args(2)) :=\n\tlet\n\t\tinputs := stringToInt(args);\n\t\tfactored := primeFactorization(inputs);\n\t\tminFactors := vectorMin(factored);\n\t\t\n\t\tindexOfMax := firstIndexOf(minFactors, vectorMax(minFactors));\n\tin\n\t\t\"Number \" ++ intToString(inputs[indexOfMax]) ++ \" has largest minimal factor:\\n\" ++ delimit(intToString(factored[indexOfMax]), ' ');\n","language":"SequenceL"},{"code":"factored := primeFactorization(inputs);\n","language":"SequenceL"},{"code":"var nums = [1275792312878611, 12345678915808973,\n 1578070919762253, 14700694496703910,];\n\nvar factors = nums.map {|n| prime_factors.ffork(n) }.map { .wait }\nsay ((nums ~Z factors)->max_by {|m| m[1][0] })\n","language":"Sidef"},{"code":"structure TTd = Thread.Thread ;\nstructure TTm = Thread.Mutex ;\n\n\nval threadedBigPrime = fn input:IntInf.int list =>\n\nlet\n\n(* --------------------- code from prime decomposition page ------------------- *)\n val factor = fn n :IntInf.int =>\n let\n val unfactored = fn (u,_,_) => u; val factors = fn (_,f,_) => f; val try = fn (_,_,i) => i; fun getresult t = unfactored t::(factors t);\n fun until done change x = if done x then getresult x else until done change (change x); (* iteration *)\n fun lastprime t = unfactored t < (try t)*(try t)\n fun trymore t = if unfactored t mod (try t) = 0 then (unfactored t div (try t) , try t::(factors t) , try t) else (unfactored t, factors t , try t + 1)\n in until lastprime trymore (n,[],2) end;\n(* --------------------- end of code from prime decomposition page ------------ *)\n\n\n val mx = TTm.mutex () ;\n val results : IntInf.int list list ref = ref [ ] ;\n val tasks : IntInf.int list list ref = ref [ ] ;\n\n\n val divideup = fn cores => fn inp : IntInf.int list =>\n let\n val np = (List.length inp) div cores + (cores +1) div cores (* assume length > cores to reduce code *)\n val rec divd = fn ([], outp) => ([],outp )\n | (inp,outp) => divd ( List.drop (inp,np) , (List.take (inp,np))::outp ) handle Subscript => ([],inp :: outp)\n in\n #2 ( divd (inp, [ ] ))\n end;\n\n\n val doTask = fn () =>\n let\n val mytask : IntInf.int list ref = ref [];\n val myres : IntInf.int list list ref = ref [];\n in\n ( TTm.lock mx ; mytask := hd ( !tasks ) ; tasks:= tl (!tasks) ; TTm.unlock mx ;\n myres := List.map factor ( !mytask ) ;\n TTm.lock mx ; results := !myres @ ( !results ) ; TTm.unlock mx ;\n TTd.exit ()\n )\n end;\n\n\n val cores = TTd.numProcessors ();\n val tmp = tasks := divideup cores input ;\n val processes = List.tabulate ( cores , fn i => TTd.fork (doTask , []) ) ;\n val maxim = ( while ( List.exists TTd.isActive processes ) do (Posix.Process.sleep (Time.fromReal 1.0 ));\n List.foldr IntInf.max 1 ( List.map (fn i => List.last i ) (!results) ) ) (* maximal lowest prime *)\n\nin\n\n List.filter (fn lst => List.last lst = maxim ) (!results)\n\nend ;\n","language":"Standard-ML"},{"code":"> threadedBigPrime [ 62478923478923409323, 69478923478923409313, 79234790234098402349,\n 33498023480920234793, 92834098234098023409, 31908234098234098243,\n 92873400002348028833, 73498200234098200239, 4349023423478999243,\n 13480234982340982343, 62478923478925971503, 5340823480234982007,\n 134802349691098498233, 81780923490092302251, 802487292348792949 ] ;\n\nval it = [[1463103844669601, 42703], [1463103844669541, 42703]]:\n\n(* numbers *)\n> List.map (List.foldr IntInf.* 1 ) it ;\nval it = [62478923478925971503, 62478923478923409323]: IntInf.int list\n","language":"Standard-ML"},{"code":"import BigInt\nimport Foundation\n\nextension BinaryInteger {\n @inlinable\n public func primeDecomposition() -> [Self] {\n guard self > 1 else { return [] }\n\n func step(_ x: Self) -> Self {\n return 1 + (x << 2) - ((x >> 1) << 1)\n }\n\n let maxQ = Self(Double(self).squareRoot())\n var d: Self = 1\n var q: Self = self & 1 == 0 ? 2 : 3\n\n while q <= maxQ && self % q != 0 {\n q = step(d)\n d += 1\n }\n\n return q <= maxQ ? [q] + (self / q).primeDecomposition() : [self]\n }\n}\n\nlet numbers = [\n 112272537195293,\n 112582718962171,\n 112272537095293,\n 115280098190773,\n 115797840077099,\n 1099726829285419,\n 1275792312878611,\n BigInt(\"64921987050997300559\")\n]\n\nfunc findLargestMinFactor<T: BinaryInteger>(for nums: [T], then: @escaping ((n: T, factors: [T])) -> ()) {\n let waiter = DispatchSemaphore(value: 0)\n let lock = DispatchSemaphore(value: 1)\n var factors = [(n: T, factors: [T])]()\n\n DispatchQueue.concurrentPerform(iterations: nums.count) {i in\n let n = nums[i]\n\n print(\"Factoring \\(n)\")\n\n let nFacs = n.primeDecomposition().sorted()\n\n print(\"Factored \\(n)\")\n\n lock.wait()\n factors.append((n, nFacs))\n\n if factors.count == nums.count {\n waiter.signal()\n }\n\n lock.signal()\n }\n\n waiter.wait()\n\n then(factors.sorted(by: { $0.factors.first! > $1.factors.first! }).first!)\n}\n\nfindLargestMinFactor(for: numbers) {res in\n let (n, factors) = res\n\n print(\"Number with largest min prime factor: \\(n); factors: \\(factors)\")\n\n exit(0)\n}\n\ndispatchMain()\n","language":"Swift"},{"code":"package require Tcl 8.6\npackage require Thread\n\n# Pooled computation engine; runs event loop internally\nnamespace eval pooled {\n variable poolSize 3; # Needs to be tuned to system size\n\n proc computation {computationDefinition entryPoint values} {\n\tvariable result\n\tvariable poolSize\n\t# Add communication shim\n\tappend computationDefinition [subst -nocommands {\n\t proc poolcompute {value target} {\n\t\tset outcome [$entryPoint \\$value]\n\t\tset msg [list set ::pooled::result(\\$value) \\$outcome]\n\t\tthread::send -async \\$target \\$msg\n\t }\n\t}]\n\n\t# Set up the pool\n\tset pool [tpool::create -initcmd $computationDefinition \\\n\t\t -maxworkers $poolSize]\n\n\t# Prepare to receive results\n\tunset -nocomplain result\n\tarray set result {}\n\n\t# Dispatch the computations\n\tforeach value $values {\n\t tpool::post $pool [list poolcompute $value [thread::id]]\n\t}\n\n\t# Wait for results\n\twhile {[array size result] < [llength $values]} {vwait pooled::result}\n\n\t# Dispose of the pool\n\ttpool::release $pool\n\n\t# Return the results\n\treturn [array get result]\n }\n}\n","language":"Tcl"},{"code":"# Code for computing the prime factors of a number\nset computationCode {\n namespace eval prime {\n\tvariable primes [list 2 3 5 7 11]\n\tproc restart {} {\n\t variable index -1\n\t variable primes\n\t variable current [lindex $primes end]\n\t}\n\n\tproc get_next_prime {} {\n\t variable primes\n\t variable index\n\t if {$index < [llength $primes]-1} {\n\t\treturn [lindex $primes [incr index]]\n\t }\n\t variable current\n\t while 1 {\n\t\tincr current 2\n\t\tset p 1\n\t\tforeach prime $primes {\n\t\t if {$current % $prime} {} else {\n\t\t\tset p 0\n\t\t\tbreak\n\t\t }\n\t\t}\n\t\tif {$p} {\n\t\t return [lindex [lappend primes $current] [incr index]]\n\t\t}\n\t }\n\t}\n\n\tproc factors {num} {\n\t restart\n\t set factors [dict create]\n\t for {set i [get_next_prime]} {$i <= $num} {} {\n\t\tif {$num % $i == 0} {\n\t\t dict incr factors $i\n\t\t set num [expr {$num / $i}]\n\t\t continue\n\t\t} elseif {$i*$i > $num} {\n\t\t dict incr factors $num\n\t\t break\n\t\t} else {\n\t\t set i [get_next_prime]\n\t\t}\n\t }\n\t return $factors\n\t}\n }\n}\n\n# The values to be factored\nset values {\n 188573867500151328137405845301\n 3326500147448018653351160281\n 979950537738920439376739947\n 2297143294659738998811251\n 136725986940237175592672413\n 3922278474227311428906119\n 839038954347805828784081\n 42834604813424961061749793\n 2651919914968647665159621\n 967022047408233232418982157\n 2532817738450130259664889\n 122811709478644363796375689\n}\n","language":"Tcl"},{"code":"# Do the computation, getting back a dictionary that maps\n# values to its results (itself an ordered dictionary)\nset results [pooled::computation $computationCode prime::factors $values]\n\n# Find the maximum minimum factor with sorting magic\nset best [lindex [lsort -integer -stride 2 -index {1 0} $results] end-1]\n\n# Print in human-readable form\nproc renderFactors {factorDict} {\n dict for {factor times} $factorDict {\n\tlappend v {*}[lrepeat $times $factor]\n }\n return [join $v \"*\"]\n}\nputs \"$best = [renderFactors [dict get $results $best]]\"\n","language":"Tcl"},{"code":"/* Parallel_calculations.wren */\n\nimport \"./math\" for Int\n\nclass C {\n static minPrimeFactor(n) { Int.primeFactors(n)[0] }\n\n static allPrimeFactors(n) { Int.primeFactors(n) }\n}\n","language":"Wren"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <omp.h>\n#include \"wren.h\"\n\n#define NUM_VMS 4\n\nWrenVM* vms[NUM_VMS]; // array of VMs\n\nvoid doParallelCalcs() {\n int data[] = {12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519};\n int i, count, largest, largest_factor = 0;\n omp_set_num_threads(4);\n // we can share the same call and class handles amongst VMs\n WrenHandle* callHandle = wrenMakeCallHandle(vms[0], \"minPrimeFactor(_)\");\n WrenHandle* callHandle2 = wrenMakeCallHandle(vms[0], \"allPrimeFactors(_)\");\n wrenEnsureSlots(vms[0], 1);\n wrenGetVariable(vms[0], \"main\", \"C\", 0);\n WrenHandle* classHandle = wrenGetSlotHandle(vms[0], 0);\n\n #pragma omp parallel for shared(largest_factor, largest)\n for (i = 0; i < 7; ++i) {\n int n = data[i];\n int vi = omp_get_thread_num(); // assign a VM (via its array index) for this number\n wrenEnsureSlots(vms[vi], 2);\n wrenSetSlotHandle(vms[vi], 0, classHandle);\n wrenSetSlotDouble(vms[vi], 1, (double)n);\n wrenCall(vms[vi], callHandle);\n int p = (int)wrenGetSlotDouble(vms[vi], 0);\n if (p > largest_factor) {\n largest_factor = p;\n largest = n;\n printf(\"Thread %d: found larger: %d of %d\\n\", vi, p, n);\n } else {\n printf(\"Thread %d: not larger: %d of %d\\n\", vi, p, n);\n }\n }\n\n printf(\"\\nLargest minimal prime factor: %d of %d\\n\", largest_factor, largest);\n printf(\"All prime factors for this number: \");\n wrenEnsureSlots(vms[0], 2);\n wrenSetSlotHandle(vms[0], 0, classHandle);\n wrenSetSlotDouble(vms[0], 1, (double)largest);\n wrenCall(vms[0], callHandle2);\n count = wrenGetListCount(vms[0], 0);\n for (i = 0; i < count; ++i) {\n wrenGetListElement(vms[0], 0, i, 1);\n printf(\"%d \", (int)wrenGetSlotDouble(vms[0], 1));\n }\n printf(\"\\n\");\n wrenReleaseHandle(vms[0], callHandle);\n wrenReleaseHandle(vms[0], callHandle2);\n wrenReleaseHandle(vms[0], classHandle);\n}\n\nstatic void writeFn(WrenVM* vm, const char* text) {\n printf(\"%s\", text);\n}\n\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\n switch (errorType) {\n case WREN_ERROR_COMPILE:\n printf(\"[%s line %d] [Error] %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_STACK_TRACE:\n printf(\"[%s line %d] in %s\\n\", module, line, msg);\n break;\n case WREN_ERROR_RUNTIME:\n printf(\"[Runtime Error] %s\\n\", msg);\n break;\n }\n}\n\nchar *readFile(const char *fileName) {\n FILE *f = fopen(fileName, \"r\");\n fseek(f, 0, SEEK_END);\n long fsize = ftell(f);\n rewind(f);\n char *script = malloc(fsize + 1);\n fread(script, 1, fsize, f);\n fclose(f);\n script[fsize] = 0;\n return script;\n}\n\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\n if( result.source) free((void*)result.source);\n}\n\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\n WrenLoadModuleResult result = {0};\n if (strcmp(name, \"random\") != 0 && strcmp(name, \"meta\") != 0) {\n result.onComplete = loadModuleComplete;\n char fullName[strlen(name) + 6];\n strcpy(fullName, name);\n strcat(fullName, \".wren\");\n result.source = readFile(fullName);\n }\n return result;\n}\n\nint main(int argc, char **argv) {\n WrenConfiguration config;\n wrenInitConfiguration(&config);\n config.writeFn = &writeFn;\n config.errorFn = &errorFn;\n config.loadModuleFn = &loadModule;\n const char* module = \"main\";\n const char* fileName = \"Parallel_calculations.wren\";\n char *script = readFile(fileName);\n\n // config the VMs and interpret the script\n int i;\n for (i = 0; i < NUM_VMS; ++i) {\n vms[i] = wrenNewVM(&config);\n wrenInterpret(vms[i], module, script);\n }\n doParallelCalcs();\n for (i = 0; i < NUM_VMS; ++i) wrenFreeVM(vms[i]);\n free(script);\n return 0;\n}\n","language":"Wren"},{"code":"fcn factorize(x,y,z,etc){\n xyzs:=vm.arglist;\n fs:=xyzs.apply(factors.strand) // queue up factorizing for x,y,...\n .apply(\"noop\")\t\t // wait for all threads to finish factoring\n .apply(fcn{ (0).min(vm.arglist) }); // find minimum factor for x,y...\n [0..].zip(fs).filter(fcn([(n,x)],M){ x==M }.fp1((0).max(fs))) // find max of mins\n .apply('wrap([(n,_)]){ xyzs[n] }) // and pluck src from arglist\n}\n","language":"Zkl"},{"code":"factorize(12757923,12878611,12757923,15808973,15780709,197622519).println();\n // do a bunch so I can watch the system monitor\nfactorize( (0).pump(5000,List,fcn{(1000).random() }).xplode() ).println();\n","language":"Zkl"},{"code":"fcn factors(n){ // Return a list of factors of n\n acc:=fcn(n,k,acc,maxD){ // k is 2,3,5,7,9,... not optimum\n if(n==1 or k>maxD) acc.close();\n else{\n\t q,r:=n.divr(k); // divr-->(quotient,remainder)\n\t if(r==0) return(self.fcn(q,k,acc.write(k),q.toFloat().sqrt()));\n\t return(self.fcn(n,k+1+k.isOdd,acc,maxD))\n }\n }(n,2,Sink(List),n.toFloat().sqrt());\n m:=acc.reduce('*,1); // mulitply factors\n if(n!=m) acc.append(n/m); // opps, missed last factor\n else acc;\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Parallel_calculations\\nnote: Control Structures\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Many programming languages allow you to specify computations to be run in parallel. \\nWhile [[Concurrent computing]] is focused on concurrency, \\nthe purpose of this task is to distribute time-consuming calculations \\non as many CPUs as possible.\\n\\nAssume we have a collection of numbers, and want to find the one \\nwith the largest minimal prime factor \\n(that is, the one that contains relatively large factors). \\nTo speed up the search, the factorization should be done \\nin parallel using separate threads or processes, \\nto take advantage of multi-core CPUs.\\n\\nShow how this can be formulated in your language. \\nParallelize the factorization of those numbers, \\nthen search the returned list of numbers and factors \\nfor the largest minimal factor, \\nand return that number and its prime factors.\\n\\nFor the prime number decomposition \\nyou may use the solution of the [[Prime decomposition]] task.\\n\\n{{omit from|J}}\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"generic\\n type Number is private;\\n Zero : Number;\\n One : Number;\\n Two : Number;\\n with function Image (X : Number) return String is <>;\\n with function \\\"+\\\" (X, Y : Number) return Number is <>;\\n with function \\\"/\\\" (X, Y : Number) return Number is <>;\\n with function \\\"mod\\\" (X, Y : Number) return Number is <>;\\n with function \\\">=\\\" (X, Y : Number) return Boolean is <>;\\npackage Prime_Numbers is\\n type Number_List is array (Positive range <>) of Number;\\n\\n procedure Put (List : Number_List);\\n\\n task type Calculate_Factors is\\n entry Start (The_Number : in Number);\\n entry Get_Size (Size : out Natural);\\n entry Get_Result (List : out Number_List);\\n end Calculate_Factors;\\n\\nend Prime_Numbers;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\npackage body Prime_Numbers is\\n\\n procedure Put (List : Number_List) is\\n begin\\n for Index in List'Range loop\\n Ada.Text_IO.Put (Image (List (Index)));\\n end loop;\\n end Put;\\n\\n task body Calculate_Factors is\\n Size : Natural := 0;\\n N : Number;\\n M : Number;\\n K : Number := Two;\\n begin\\n accept Start (The_Number : in Number) do\\n N := The_Number;\\n M := N;\\n end Start;\\n -- Estimation of the result length from above\\n while M >= Two loop\\n M := (M + One) / Two;\\n Size := Size + 1;\\n end loop;\\n M := N;\\n -- Filling the result with prime numbers\\n declare\\n Result : Number_List (1 .. Size);\\n Index : Positive := 1;\\n begin\\n while N >= K loop -- Divisors loop\\n while Zero = (M mod K) loop -- While divides\\n Result (Index) := K;\\n Index := Index + 1;\\n M := M / K;\\n end loop;\\n K := K + One;\\n end loop;\\n Index := Index - 1;\\n accept Get_Size (Size : out Natural) do\\n Size := Index;\\n end Get_Size;\\n accept Get_Result (List : out Number_List) do\\n List (1 .. Index) := Result (1 .. Index);\\n end Get_Result;\\n end;\\n end Calculate_Factors;\\n\\nend Prime_Numbers;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO;\\nwith Prime_Numbers;\\nprocedure Parallel is\\n package Integer_Primes is new Prime_Numbers (\\n Number => Integer, -- use Large_Integer for longer numbers\\n Zero => 0,\\n One => 1,\\n Two => 2,\\n Image => Integer'Image);\\n\\n My_List : Integer_Primes.Number_List :=\\n ( 12757923,\\n 12878611,\\n 12757923,\\n 15808973,\\n 15780709,\\n 197622519);\\n\\n Decomposers : array (My_List'Range) of Integer_Primes.Calculate_Factors;\\n Lengths : array (My_List'Range) of Natural;\\n Max_Length : Natural := 0;\\nbegin\\n for I in My_List'Range loop\\n -- starts the tasks\\n Decomposers (I).Start (My_List (I));\\n end loop;\\n for I in My_List'Range loop\\n -- wait until task has reached Get_Size entry\\n Decomposers (I).Get_Size (Lengths (I));\\n if Lengths (I) > Max_Length then\\n Max_Length := Lengths (I);\\n end if;\\n end loop;\\n declare\\n Results :\\n array (My_List'Range) of Integer_Primes.Number_List (1 .. Max_Length);\\n Largest_Minimal_Factor : Integer := 0;\\n Winning_Index : Positive;\\n begin\\n for I in My_List'Range loop\\n -- after Get_Result, the tasks terminate\\n Decomposers (I).Get_Result (Results (I));\\n if Results (I) (1) > Largest_Minimal_Factor then\\n Largest_Minimal_Factor := Results (I) (1);\\n Winning_Index := I;\\n end if;\\n end loop;\\n Ada.Text_IO.Put_Line\\n (\\\"Number\\\" & Integer'Image (My_List (Winning_Index)) &\\n \\\" has largest minimal factor:\\\");\\n Integer_Primes.Put (Results (Winning_Index) (1 .. Lengths (Winning_Index)));\\n Ada.Text_IO.New_Line;\\n end;\\nend Parallel;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <omp.h>\\n\\nint main()\\n{\\n int data[] = {12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519};\\n int largest, largest_factor = 0;\\n\\n omp_set_num_threads(4);\\n /* \\\"omp parallel for\\\" turns the for loop multithreaded by making each thread\\n * iterating only a part of the loop variable, in this case i; variables declared\\n * as \\\"shared\\\" will be implicitly locked on access\\n */\\n #pragma omp parallel for shared(largest_factor, largest)\\n for (int i = 0; i < 7; i++) {\\n int p, n = data[i];\\n\\n for (p = 3; p * p <= n && n % p; p += 2);\\n if (p * p > n) p = n;\\n if (p > largest_factor) {\\n largest_factor = p;\\n largest = n;\\n printf(\\\"thread %d: found larger: %d of %d\\\\n\\\",\\n omp_get_thread_num(), p, n);\\n } else {\\n printf(\\\"thread %d: not larger: %d of %d\\\\n\\\",\\n omp_get_thread_num(), p, n);\\n }\\n }\\n\\n printf(\\\"Largest factor: %d of %d\\\\n\\\", largest_factor, largest);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iterator>\\n#include <vector>\\n#include <ppl.h> // MSVC++\\n#include <concurrent_vector.h> // MSVC++\\n\\nstruct Factors\\n{\\n int number;\\n std::vector<int> primes;\\n};\\n\\nconst int data[] =\\n{\\n 12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519\\n};\\n\\nint main()\\n{\\n // concurrency-safe container replaces std::vector<>\\n Concurrency::concurrent_vector<Factors> results;\\n\\n // parallel algorithm replaces std::for_each()\\n Concurrency::parallel_for_each(std::begin(data), std::end(data), [&](int n)\\n {\\n Factors factors;\\n factors.number = n;\\n for (int f = 2; n > 1; ++f)\\n {\\n while (n % f == 0)\\n {\\n factors.primes.push_back(f);\\n n /= f;\\n }\\n }\\n results.push_back(factors); // add factorization to results\\n });\\n // end of parallel calculations\\n\\n // find largest minimal prime factor in results\\n auto max = std::max_element(results.begin(), results.end(), [](const Factors &a, const Factors &b)\\n {\\n return a.primes.front() < b.primes.front();\\n });\\n\\n // print number(s) and factorization\\n std::for_each(results.begin(), results.end(), [&](const Factors &f)\\n {\\n if (f.primes.front() == max->primes.front())\\n {\\n std::cout << f.number << \\\" = [ \\\";\\n std::copy(f.primes.begin(), f.primes.end(), std::ostream_iterator<int>(std::cout, \\\" \\\"));\\n std::cout << \\\"]\\\\n\\\";\\n }\\n });\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\nclass Program\\n{\\n public static List<int> PrimeFactors(int number)\\n {\\n var primes = new List<int>();\\n for (int div = 2; div <= number; div++)\\n {\\n while (number % div == 0)\\n {\\n primes.Add(div);\\n number = number / div;\\n }\\n }\\n return primes;\\n }\\n\\n static void Main(string[] args)\\n {\\n int[] n = { 12757923, 12878611, 12757923, 15808973, 15780709, 197622519 };\\n // Calculate each of those numbers' prime factors, in parallel\\n var factors = n.AsParallel().Select(PrimeFactors).ToList();\\n // Make a new list showing the smallest factor for each\\n var smallestFactors = factors.Select(thisNumbersFactors => thisNumbersFactors.Min()).ToList();\\n // Find the index that corresponds with the largest of those factors\\n int biggestFactor = smallestFactors.Max();\\n int whatIndexIsThat = smallestFactors.IndexOf(biggestFactor);\\n Console.WriteLine(\\\"{0} has the largest minimum prime factor: {1}\\\", n[whatIndexIsThat], biggestFactor);\\n Console.WriteLine(string.Join(\\\" \\\", factors[whatIndexIsThat]));\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Threading.Tasks;\\n\\nprivate static void Main(string[] args)\\n{\\n int j = 0, m = 0;\\n decimal[] n = {12757923, 12878611, 12757923, 15808973, 15780709, 197622519};\\n var l = new List<int>[n.Length];\\n\\n Parallel.For(0, n.Length, i => { l[i] = getPrimes(n[i]); });\\n\\n for (int i = 0; i<n.Length; i++)\\n if (l[i].Min()>m)\\n {\\n m = l[i].Min();\\n j = i;\\n }\\n\\n Console.WriteLine(\\\"Number {0} has largest minimal factor:\\\", n[j]);\\n foreach (int list in l[j])\\n Console.Write(\\\" \\\"+list);\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(use '[clojure.contrib.lazy-seqs :only [primes]])\\n\\n(defn lpf [n]\\n [n (or (last\\n (for [p (take-while #(<= (* % %) n) primes)\\n :when (zero? (rem n p))]\\n p))\\n 1)])\\n\\n(->> (range 2 100000)\\n (pmap lpf)\\n (apply max-key second)\\n println\\n time)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(ql:quickload '(lparallel))\\n\\n(setf lparallel:*kernel* (lparallel:make-kernel 4)) ;; Configure for your system.\\n\\n(defun factor (n &optional (acc '()))\\n (when (> n 1)\\n (loop with max-d = (isqrt n)\\n for d = 2 then (if (evenp d) (1+ d) (+ d 2)) do\\n (cond ((> d max-d) (return (cons (list n 1) acc)))\\n ((zerop (rem n d))\\n (return (factor (truncate n d)\\n (if (eq d (caar acc))\\n (cons\\n (list (caar acc) (1+ (cadar acc)))\\n (cdr acc))\\n (cons (list d 1) acc)))))))))\\n\\n(defun max-minimum-factor (numbers)\\n (lparallel:pmap-reduce\\n (lambda (n) (cons n (apply #'min (mapcar #'car (factor n)))))\\n (lambda (a b) (if (> (cdr a) (cdr b)) a b))\\n numbers))\\n\\n(defun print-max-factor (pair)\\n (format t \\\"~a has the largest minimum factor ~a~%\\\" (car pair) (cdr pair)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"CL-USER> (print-max-factor (max-minimum-factor '(12757923 12878611 12878893 12757923 15808973 15780709 197622519)))\\n12878893 has the largest minimum factor 47\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"ulong[] decompose(ulong n) pure nothrow {\\n typeof(return) result;\\n for (ulong i = 2; n >= i * i; i++)\\n for (; n % i == 0; n /= i)\\n result ~= i;\\n if (n != 1)\\n result ~= n;\\n return result;\\n}\\n\\nvoid main() {\\n import std.stdio, std.algorithm, std.parallelism, std.typecons;\\n\\n immutable ulong[] data = [\\n 2UL^^59-1, 2UL^^59-1, 2UL^^59-1, 112_272_537_195_293UL,\\n 115_284_584_522_153, 115_280_098_190_773,\\n 115_797_840_077_099, 112_582_718_962_171,\\n 112_272_537_095_293, 1_099_726_829_285_419];\\n\\n //auto factors = taskPool.amap!(n => tuple(decompose(n), n))(data);\\n //static enum genPair = (ulong n) pure => tuple(decompose(n), n);\\n static genPair(ulong n) pure { return tuple(decompose(n), n); }\\n auto factors = taskPool.amap!genPair(data);\\n\\n auto pairs = factors.map!(p => tuple(p[0].reduce!min, p[1]));\\n writeln(\\\"N. with largest min factor: \\\", pairs.reduce!max[1]);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.math, std.algorithm, std.typecons,\\n core.thread, core.stdc.time;\\n\\nfinal class MinFactor: Thread {\\n private immutable ulong num;\\n private ulong[] fac;\\n private ulong minFac;\\n\\n this(in ulong n) /*pure nothrow*/ {\\n super(&run);\\n num = n;\\n fac = new ulong[0];\\n }\\n\\n @property ulong number() const pure nothrow {\\n return num;\\n }\\n\\n @property const(ulong[]) factors() const pure nothrow {\\n return fac;\\n }\\n\\n @property ulong minFactor() const pure nothrow {\\n return minFac;\\n }\\n\\n private void run() {\\n immutable clock_t begin = clock;\\n switch (num) {\\n case 0: fac = [];\\n break;\\n\\n case 1: fac = [1];\\n break;\\n\\n default:\\n uint limit = cast(uint)(1 + double(num).sqrt);\\n ulong n = num;\\n for (ulong divi = 3; divi < limit; divi += 2) {\\n if (n == 1)\\n break;\\n if ((n % divi) == 0) {\\n while ((n > 1) && ((n % divi) == 0)) {\\n fac ~= divi;\\n n /= divi;\\n }\\n limit = cast(uint)(1 + double(n).sqrt);\\n }\\n }\\n if (n > 1)\\n fac ~= n;\\n }\\n minFac = fac.reduce!min;\\n immutable clock_t end = clock;\\n writefln(\\\"num: %20d --> min. factor: %20d ticks(%7d -> %7d)\\\",\\n num, minFac, begin, end);\\n }\\n}\\n\\nvoid main() {\\n immutable ulong[] numbers = [\\n 2UL^^59-1, 2UL^^59-1, 2UL^^59-1, 112_272_537_195_293UL,\\n 115_284_584_522_153, 115_280_098_190_773,\\n 115_797_840_077_099, 112_582_718_962_171,\\n 112_272_537_095_293, 1_099_726_829_285_419];\\n\\n auto tGroup = new ThreadGroup;\\n foreach (const n; numbers)\\n tGroup.add(new MinFactor(n));\\n\\n writeln(\\\"Minimum factors for respective numbers are:\\\");\\n foreach (t; tGroup)\\n t.start;\\n tGroup.joinAll;\\n\\n auto maxMin = tuple(0UL, [0UL], 0UL);\\n foreach (thread; tGroup) {\\n auto s = cast(MinFactor)thread;\\n if (s !is null && maxMin[2] < s.minFactor)\\n maxMin = tuple(s.number, s.factors.dup, s.minFactor);\\n }\\n\\n writefln(\\\"Number with largest min. factor is %16d,\\\" ~\\n \\\" with factors:\\\\n\\\\t%s\\\", maxMin.tupleof);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program Parallel_calculations;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n System.Threading,\\n Velthuis.BigIntegers;\\n\\nfunction IsPrime(n: BigInteger): Boolean;\\nvar\\n i: BigInteger;\\nbegin\\n if n <= 1 then\\n exit(False);\\n\\n i := 2;\\n while i < BigInteger.Sqrt(n) do\\n begin\\n if n mod i = 0 then\\n exit(False);\\n inc(i);\\n end;\\n\\n Result := True;\\nend;\\n\\nfunction GetPrimes(n: BigInteger): TArray<BigInteger>;\\nvar\\n divisor, next, rest: BigInteger;\\nbegin\\n divisor := 2;\\n next := 3;\\n rest := n;\\n while (rest <> 1) do\\n begin\\n while (rest mod divisor = 0) do\\n begin\\n SetLength(Result, Length(Result) + 1);\\n Result[High(Result)] := divisor;\\n rest := rest div divisor;\\n end;\\n divisor := next;\\n next := next + 2;\\n end;\\nend;\\n\\nfunction Min(l: TArray<BigInteger>): BigInteger;\\nbegin\\n if Length(l) = 0 then\\n exit(0);\\n\\n Result := l[0];\\n for var v in l do\\n if v < result then\\n Result := v;\\nend;\\n\\nconst\\n n: array of Uint64 = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519];\\n\\nvar\\n m: BigInteger;\\n len, j, i: Uint64;\\n l: TArray<TArray<BigInteger>>;\\n\\nbegin\\n j := 0;\\n m := 0;\\n len := length(n);\\n SetLength(l, len);\\n\\n TParallel.for (0, len - 1,\\n procedure(i: Integer)\\n begin\\n l[i] := getPrimes(n[i]);\\n end);\\n\\n for i := 0 to len - 1 do\\n begin\\n var _min := Min(l[i]);\\n if _min > m then\\n begin\\n m := _min;\\n j := i;\\n end;\\n end;\\n\\n writeln('Number ', n[j].ToString, ' has largest minimal factor:');\\n for var v in l[j] do\\n write(' ', v.ToString);\\n\\n readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"-module( parallel_calculations ).\\n\\n-export( [fun_results/2, task/0] ).\\n\\nfun_results( Fun, Datas ) ->\\n My_pid = erlang:self(),\\n\\tPids = [fun_spawn( Fun, X, My_pid ) || X <- Datas],\\n\\t[fun_receive(X) || X <- Pids].\\n\\ntask() ->\\n Numbers = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519],\\n Results = fun_results( fun factors/1, Numbers ),\\n Min_results = [lists:min(X) || X <- Results],\\n {_Max_min_factor, Number} = lists:max( lists:zip(Min_results, Numbers) ),\\n {Number, Factors} = lists:keyfind( Number, 1, lists:zip(Numbers, Results) ),\\n io:fwrite( \\\"~p has largest minimal factor among its prime factors ~p~n\\\", [Number, Factors] ).\\n\\n\\n\\nfactors(N) -> factors(N,2,[]).\\n\\nfactors(1,_,Acc) -> Acc;\\nfactors(N,K,Acc) when N rem K == 0 -> factors(N div K,K, [K|Acc]);\\nfactors(N,K,Acc) -> factors(N,K+1,Acc).\\n\\nfun_receive( Pid ) ->\\n receive\\n {ok, Result, Pid} -> Result;\\n\\t{Type, Error, Pid} -> erlang:Type( Error )\\n end.\\n\\nfun_spawn( Fun, Data, My_pid ) ->\\n erlang:spawn( fun() ->\\n Result = try\\n {ok, Fun(Data), erlang:self()}\\n\\n\\t\\t catch\\n\\t Type:Error -> {Type, Error, erlang:self()}\\n\\n\\t\\t end,\\n\\t My_pid ! Result\\n end ).\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"open System\\nopen PrimeDecomp // Has the decompose function from the Prime decomposition task\\n\\nlet data = [112272537195293L; 112582718962171L; 112272537095293L; 115280098190773L; 115797840077099L; 1099726829285419L]\\nlet decomp num = decompose num 2L\\n\\nlet largestMinPrimeFactor (numbers: int64 list) =\\n let decompDetails = Async.Parallel [ for n in numbers -> async { return n, decomp n } ] // Compute the number and its prime decomposition list\\n |> Async.RunSynchronously // Start and wait for all parallel computations to complete.\\n |> Array.sortBy (snd >> List.min >> (~-)) // Sort in descending order, based on the min prime decomp number.\\n\\n decompDetails.[0]\\n\\nlet showLargestMinPrimeFactor numbers =\\n let number, primeList = largestMinPrimeFactor numbers\\n printf \\\"Number %d has largest minimal factor:\\\\n \\\" number\\n List.iter (printf \\\"%d \\\") primeList\\n\\nshowLargestMinPrimeFactor data\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: io kernel fry locals sequences arrays math.primes.factors math.parser channels threads prettyprint ;\\nIN: <filename>\\n\\n:: map-parallel ( seq quot -- newseq )\\n <channel> :> ch\\n seq [ '[ _ quot call ch to ] \\\"factors\\\" spawn ] { } map-as\\n dup length [ ch from ] replicate nip ;\\n\\n{ 576460752303423487 576460752303423487\\n 576460752303423487 112272537195293\\n 115284584522153 115280098190773\\n 115797840077099 112582718962171\\n 112272537095293 1099726829285419 }\\ndup [ factors ] map-parallel\\ndup [ infimum ] map dup supremum\\nswap index swap dupd nth -rot swap nth\\n\\\"Number with largest min. factor is \\\" swap number>string append\\n\\\", with factors: \\\" append write .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"USING: kernel io prettyprint sequences arrays math.primes.factors math.parser concurrency.combinators ;\\n{ 576460752303423487 576460752303423487 576460752303423487 112272537195293\\n 115284584522153 115280098190773 115797840077099 112582718962171 }\\ndup [ factors ] parallel-map dup [ infimum ] map dup supremum\\nswap index swap dupd nth -rot swap nth\\n\\\"Number with largest min. factor is \\\" swap number>string append\\n\\\", with factors: \\\" append write .\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"program Primes\\n\\n use ISO_FORTRAN_ENV\\n\\n implicit none\\n\\n integer(int64), dimension(7) :: data = (/2099726827, 15780709, 1122725370, 15808973, 576460741, 12878611, 12757923/)\\n integer(int64), dimension(100) :: outprimes\\n integer(int64) :: largest_factor = 0, largest = 0, minim = 0, val = 0\\n integer(int16) :: count = 0, OMP_GET_THREAD_NUM\\n\\n call omp_set_num_threads(4);\\n !$omp parallel do private(val,outprimes,count) shared(data,largest_factor,largest)\\n do val = 1, 7\\n outprimes = 0\\n call find_factors(data(val), outprimes, count)\\n minim = minval(outprimes(1:count))\\n if (minim > largest_factor) then\\n largest_factor = minim\\n largest = data(val)\\n end if\\n write(*, fmt = '(A7,i0,A2,i12,100i12)') 'Thread ', OMP_GET_THREAD_NUM(), ': ', data(val), outprimes(1:count)\\n end do\\n !$omp end parallel do\\n\\n write(*, fmt = '(i0,A26,i0)') largest, ' have the Largest factor: ', largest_factor\\n\\n return\\n\\ncontains\\n\\n subroutine find_factors(n, d, count)\\n integer(int64), intent(in) :: n\\n integer(int64), dimension(:), intent(out) :: d\\n integer(int16), intent(out) :: count\\n integer(int16) :: i\\n integer(int64) :: div, next, rest\\n\\n i = 1\\n div = 2; next = 3; rest = n\\n\\n do while (rest /= 1)\\n do while (mod(rest, div) == 0)\\n d(i) = div\\n i = i + 1\\n rest = rest / div\\n end do\\n div = next\\n next = next + 2\\n end do\\n count = i - 1\\n end subroutine find_factors\\n\\nend program Primes\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#ifdef __FB_WIN32__\\n ' ... instructions only for Win ...\\n #Include \\\"windows.bi\\\"\\n\\n Function ThreadFunc As Dword Cdecl Alias \\\"ThreadFunc\\\"(param As Any Ptr) Export\\n Print \\\"Thread running\\\"\\n Function = 0\\n End Function\\n\\n Dim As HANDLE thread\\n Dim As Dword threadId\\n\\n thread = CreateThread(NULL, 0, @ThreadFunc, NULL, 0, @threadId)\\n\\n If thread = NULL Then\\n Print \\\"Error creating thread\\\"\\n Sleep\\n End 1\\n End If\\n\\n WaitForSingleObject(thread, INFINITE)\\n#endif\\n\\n#ifdef __FB_LINUX__\\n ' ... instructions only for Linux ...\\n #Include \\\"crt/pthread.bi\\\"\\n\\n Function ThreadFunc As Any Ptr Cdecl Alias \\\"ThreadFunc\\\"(param As Any Ptr) Export\\n Print \\\"Thread running\\\"\\n Function = 0\\n End Function\\n\\n Dim As pthread_t thread\\n\\n If pthread_create(@thread, NULL, @ThreadFunc, NULL) <> 0 Then\\n Print \\\"Error creating thread\\\"\\n Sleep\\n End 1\\n End If\\n\\n pthread_join(thread, NULL)\\n#endif\\n\\nPrint \\\"Thread finished\\\"\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n)\\n\\n// collection of numbers. A slice is used for the collection.\\n// The elements are big integers, since that's what the function Primes\\n// uses (as was specified by the Prime decomposition task.)\\nvar numbers = []*big.Int{\\n big.NewInt(12757923),\\n big.NewInt(12878611),\\n big.NewInt(12878893),\\n big.NewInt(12757923),\\n big.NewInt(15808973),\\n big.NewInt(15780709),\\n}\\n\\n// main just calls the function specified by the task description and\\n// prints results. note it allows for multiple numbers with the largest\\n// minimal factor. the task didn't specify to handle this, but obviously\\n// it's possible.\\nfunc main() {\\n rs := lmf(numbers)\\n fmt.Println(\\\"largest minimal factor:\\\", rs[0].decomp[0])\\n for _, r := range rs {\\n fmt.Println(r.number, \\\"->\\\", r.decomp)\\n }\\n}\\n\\n// this type associates a number with it's prime decomposition.\\n// the type is neccessary so that they can be sent together over\\n// a Go channel, but it turns out to be convenient as well for\\n// the return type of lmf.\\ntype result struct {\\n number *big.Int\\n decomp []*big.Int\\n}\\n\\n// the function specified by the task description, \\\"largest minimal factor.\\\"\\nfunc lmf([]*big.Int) []result {\\n // construct result channel and start a goroutine to decompose each number.\\n // goroutines run in parallel as CPU cores are available.\\n rCh := make(chan result)\\n for _, n := range numbers {\\n go decomp(n, rCh)\\n }\\n\\n // collect results. <-rCh returns a single result from the result channel.\\n // we know how many results to expect so code here collects exactly that\\n // many results, and accumulates a list of those with the largest\\n // minimal factor.\\n rs := []result{<-rCh}\\n for i := 1; i < len(numbers); i++ {\\n switch r := <-rCh; r.decomp[0].Cmp(rs[0].decomp[0]) {\\n case 1:\\n rs = rs[:1]\\n rs[0] = r\\n case 0:\\n rs = append(rs, r)\\n }\\n }\\n return rs\\n}\\n\\n// decomp is the function run as a goroutine. multiple instances of this\\n// function will run concurrently, one for each number being decomposed.\\n// it acts as a driver for Primes, calling Primes as needed, packaging\\n// the result, and sending the packaged result on the channel.\\n// \\\"as needed\\\" turns out to mean sending Primes a copy of n, as Primes\\n// as written is destructive on its argument.\\nfunc decomp(n *big.Int, rCh chan result) {\\n rCh <- result{n, Primes(new(big.Int).Set(n))}\\n}\\n\\n// code below copied from Prime decomposition task\\nvar (\\n ZERO = big.NewInt(0)\\n ONE = big.NewInt(1)\\n)\\n\\nfunc Primes(n *big.Int) []*big.Int {\\n res := []*big.Int{}\\n mod, div := new(big.Int), new(big.Int)\\n for i := big.NewInt(2); i.Cmp(n) != 1; {\\n div.DivMod(n, i, mod)\\n for mod.Cmp(ZERO) == 0 {\\n res = append(res, new(big.Int).Set(i))\\n n.Set(div)\\n div.DivMod(n, i, mod)\\n }\\n i.Add(i, ONE)\\n }\\n return res\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Parallel.Strategies (parMap, rdeepseq)\\nimport Control.DeepSeq (NFData)\\nimport Data.List (maximumBy)\\nimport Data.Function (on)\\n\\nnums :: [Integer]\\nnums =\\n [ 112272537195293\\n , 112582718962171\\n , 112272537095293\\n , 115280098190773\\n , 115797840077099\\n , 1099726829285419\\n ]\\n\\nlowestFactor\\n :: Integral a\\n => a -> a -> a\\nlowestFactor s n\\n | even n = 2\\n | otherwise = head y\\n where\\n y =\\n [ x\\n | x <- [s .. ceiling . sqrt $ fromIntegral n] ++ [n]\\n , n `rem` x == 0\\n , odd x ]\\n\\nprimeFactors\\n :: Integral a\\n => a -> a -> [a]\\nprimeFactors l n = f n l []\\n where\\n f n l xs =\\n if n > 1\\n then f (n `div` l) (lowestFactor (max l 3) (n `div` l)) (l : xs)\\n else xs\\n\\nminPrimes\\n :: (Control.DeepSeq.NFData a, Integral a)\\n => [a] -> (a, [a])\\nminPrimes ns =\\n (\\\\(x, y) -> (x, primeFactors y x)) $\\n maximumBy (compare `on` snd) $ zip ns (parMap rdeepseq (lowestFactor 3) ns)\\n\\nmain :: IO ()\\nmain = print $ minPrimes nums\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main(A)\\n threads := []\\n L := list(*A)\\n every i := 1 to *A do put(threads, thread L[i] := primedecomp(A[i]))\\n every wait(!threads)\\n\\n maxminF := L[maxminI := 1][1]\\n every i := 2 to *L do if maxminF <:= L[i][1] then maxminI := i\\n every writes((A[maxminI]||\\\": \\\")|(!L[maxminI]||\\\" \\\")|\\\"\\\\n\\\")\\nend\\n\\nprocedure primedecomp(n) #: return a list of factors\\n every put(F := [], genfactors(n))\\n return F\\nend\\n\\nlink factors\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" numbers =. 12757923 12878611 12878893 12757923 15808973 15780709 197622519\\n factors =. q:&.> parallelize 2 numbers NB. q: is parallelized here\\n ind =. (i. >./) <./@> factors\\n ind { numbers ;\\\"_1 factors\\n┌────────┬───────────┐\\n│12878611│47 101 2713│\\n└────────┴───────────┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import static java.lang.System.out;\\nimport static java.util.Arrays.stream;\\nimport static java.util.Comparator.comparing;\\n\\npublic interface ParallelCalculations {\\n public static final long[] NUMBERS = {\\n 12757923,\\n 12878611,\\n 12878893,\\n 12757923,\\n 15808973,\\n 15780709,\\n 197622519\\n };\\n\\n public static void main(String... arguments) {\\n stream(NUMBERS)\\n .unordered()\\n .parallel()\\n .mapToObj(ParallelCalculations::minimalPrimeFactor)\\n .max(comparing(a -> a[0]))\\n .ifPresent(res -> out.printf(\\n \\\"%d has the largest minimum prime factor: %d%n\\\",\\n res[1],\\n res[0]\\n ));\\n }\\n\\n public static long[] minimalPrimeFactor(long n) {\\n for (long i = 2; n >= i * i; i++) {\\n if (n % i == 0) {\\n return new long[]{i, n};\\n }\\n }\\n return new long[]{n, n};\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"var onmessage = function(event) {\\n postMessage({\\\"n\\\" : event.data.n,\\n \\\"factors\\\" : factor(event.data.n),\\n \\\"id\\\" : event.data.id});\\n};\\n\\nfunction factor(n) {\\n var factors = [];\\n for(p = 2; p <= n; p++) {\\n if((n % p) == 0) {\\n factors[factors.length] = p;\\n n /= p;\\n }\\n }\\n return factors;\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"var numbers = [12757923, 12878611, 12757923, 15808973, 15780709, 197622519];\\nvar workers = [];\\nvar worker_count = 0;\\n\\nvar results = [];\\n\\nfor(var i = 0; i < numbers.length; i++) {\\n worker_count++;\\n workers[i] = new Worker(\\\"parallel_worker.js\\\");\\n workers[i].onmessage = accumulate;\\n workers[i].postMessage({n: numbers[i], id: i});\\n}\\n\\nfunction accumulate(event) {\\n n = event.data.n;\\n factors = event.data.factors;\\n id = event.data.id;\\n console.log(n + \\\" : \\\" + factors);\\n results[id] = {n:n, factors:factors};\\n // Cleanup - kill the worker and countdown until all work is done\\n workers[id].terminate();\\n worker_count--;\\n if(worker_count == 0)\\n\\treduce();\\n}\\n\\nfunction reduce() {\\n answer = 0;\\n for(i = 1; i < results.length; i++) {\\n\\tmin = results[i].factors[0];\\n\\tlargest_min = results[answer].factors[0];\\n\\tif(min > largest_min)\\n\\t answer = i;\\n }\\n n = results[answer].n;\\n factors = results[answer].factors;\\n console.log(\\\"The number with the relatively largest factors is: \\\" + n + \\\" : \\\" + factors);\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"using Primes\\n\\nfactortodict(d, n) = (d[minimum(collect(keys(factor(n))))] = n)\\n\\n# Numbers are from from the Raku example.\\nnumbers = [64921987050997300559, 70251412046988563035, 71774104902986066597,\\n 83448083465633593921, 84209429893632345702, 87001033462961102237,\\n 87762379890959854011, 89538854889623608177, 98421229882942378967,\\n 259826672618677756753, 262872058330672763871, 267440136898665274575,\\n 278352769033314050117, 281398154745309057242, 292057004737291582187]\\n\\nmins = Dict()\\n\\nBase.@sync(\\n Threads.@threads for n in numbers\\n factortodict(mins, n)\\n end\\n)\\n\\nanswer = maximum(keys(mins))\\nprintln(\\\"The number that has the largest minimum prime factor is $(mins[answer]), with a smallest factor of $answer\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.51\\n\\nimport java.util.stream.Collectors\\n\\n/* returns the number itself, its smallest prime factor and all its prime factors */\\nfun primeFactorInfo(n: Int): Triple<Int, Int, List<Int>> {\\n if (n <= 1) throw IllegalArgumentException(\\\"Number must be more than one\\\")\\n if (isPrime(n)) return Triple(n, n, listOf(n))\\n val factors = mutableListOf<Int>()\\n var factor = 2\\n var nn = n\\n while (true) {\\n if (nn % factor == 0) {\\n factors.add(factor)\\n nn /= factor\\n if (nn == 1) return Triple(n, factors.min()!!, factors)\\n if (isPrime(nn)) factor = nn\\n }\\n else if (factor >= 3) factor += 2\\n else factor = 3\\n }\\n}\\n\\nfun isPrime(n: Int) : Boolean {\\n if (n < 2) return false\\n if (n % 2 == 0) return n == 2\\n if (n % 3 == 0) return n == 3\\n var d = 5\\n while (d * d <= n) {\\n if (n % d == 0) return false\\n d += 2\\n if (n % d == 0) return false\\n d += 4\\n }\\n return true\\n}\\n\\nfun main(args: Array<String>) {\\n val numbers = listOf(\\n 12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519\\n )\\n val info = numbers.stream()\\n .parallel()\\n .map { primeFactorInfo(it) }\\n .collect(Collectors.toList())\\n val maxFactor = info.maxBy { it.second }!!.second\\n val results = info.filter { it.second == maxFactor }\\n println(\\\"The following number(s) have the largest minimal prime factor of $maxFactor:\\\")\\n for (result in results) {\\n println(\\\" ${result.first} whose prime factors are ${result.third}\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"hasSmallestFactor[data_List]:=Sort[Transpose[{ParallelTable[FactorInteger[x][[1, 1]], {x, data}],data}]][[1, 2]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import strformat, strutils, threadpool\\n\\nconst Numbers = [576460752303423487,\\n 576460752303423487,\\n 576460752303423487,\\n 112272537195293,\\n 115284584522153,\\n 115280098190773,\\n 115797840077099,\\n 112582718962171,\\n 299866111963290359]\\n\\n\\nproc lowestFactor(n: int64): int64 =\\n if n mod 2 == 0: return 2\\n if n mod 3 == 0: return 3\\n var p = 5\\n var delta = 2\\n while p * p < n:\\n if n mod p == 0: return p\\n inc p, delta\\n delta = 6 - delta\\n result = n\\n\\n\\nproc factors(n, lowest: int64): seq[int64] =\\n var n = n\\n var lowest = lowest\\n while true:\\n result.add lowest\\n n = n div lowest\\n if n == 1: break\\n lowest = lowestFactor(n)\\n\\n\\n# Launch a thread for each number to process.\\nvar responses: array[Numbers.len, FlowVar[int64]]\\nfor i, n in Numbers:\\n responses[i] = spawn lowestFactor(n)\\n\\n# Read the results and find the largest minimum prime factor.\\nvar maxMinfact = 0i64\\nvar maxIdx: int\\nfor i in 0..responses.high:\\n let minfact = ^responses[i] # Blocking read.\\n echo &\\\"For n = {Numbers[i]}, the lowest factor is {minfact}.\\\"\\n if minfact > maxMinfact:\\n maxMinfact = minfact\\n maxIdx = i\\nlet result = Numbers[maxIdx]\\n\\necho \\\"\\\"\\necho \\\"The first number with the largest minimum prime factor is: \\\", result\\necho \\\"Its factors are: \\\", result.factors(maxMinfact).join(\\\", \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import sequtils, strutils, threadpool\\n\\n{.experimental: \\\"parallel\\\".}\\n\\nconst Numbers = [576460752303423487,\\n 576460752303423487,\\n 576460752303423487,\\n 112272537195293,\\n 115284584522153,\\n 115280098190773,\\n 115797840077099,\\n 112582718962171,\\n 299866111963290359]\\n\\n\\nproc lowestFactor(n: int64): int64 =\\n if n mod 2 == 0: return 2\\n if n mod 3 == 0: return 3\\n var p = 5\\n var delta = 2\\n while p * p < n:\\n if n mod p == 0: return p\\n inc p, delta\\n delta = 6 - delta\\n result = n\\n\\n\\nproc factors(n, lowest: int64): seq[int64] =\\n var n = n\\n var lowest = lowest\\n while true:\\n result.add lowest\\n n = n div lowest\\n if n == 1: break\\n lowest = lowestFactor(n)\\n\\n\\n# Launch the threads.\\nvar results: array[Numbers.len, int64] # To store the results.\\nparallel:\\n for i, n in Numbers:\\n results[i] = spawn lowestFactor(n)\\n\\n# Find the minimum prime factor and the first number with this minimum factor.\\nlet maxIdx = results.maxIndex()\\nlet maxMinfact = results[maxIdx]\\nlet result = Numbers[maxIdx]\\n\\necho \\\"\\\"\\necho \\\"The first number with the largest minimum prime factor is: \\\", result\\necho \\\"Its factors are: \\\", result.factors(maxMinfact).join(\\\", \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"import: parallel\\n\\n: largeMinFactor dup mapParallel(#factors) zip maxFor(#[ second first ]) ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"/* Concurrency in ooRexx. Example of early reply */\\nobject1 = .example~new\\nobject2 = .example~new\\nsay object1~primes(1,11111111111,11111111114)\\nsay object2~primes(2,11111111111,11111111114)\\nsay \\\"Main ended at\\\" time()\\nexit\\n::class example\\n::method primes\\nuse arg which,bot,top\\nreply \\\"Start primes\\\"which':' time()\\nSelect\\n When which=1 Then Call pd1 bot top\\n When which=2 Then Call pd2 bot top\\n End\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"/*PD1 REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/\\nCall Time 'R'\\nnumeric digits 1000 /*handle thousand digits for the powers*/\\nparse arg bot top step base add /*get optional arguments from the C.L. */\\nif bot=='' then do; bot=1; top=100; end /*no BOT given? Then use the default.*/\\nif top=='' then top=bot /* \\\" TOP? \\\" \\\" \\\" \\\" \\\" */\\nif step=='' then step= 1 /* \\\" STEP? \\\" \\\" \\\" \\\" \\\" */\\nif add =='' then add= -1 /* \\\" ADD? \\\" \\\" \\\" \\\" \\\" */\\ntell= top>0; top=abs(top) /*if TOP is negative, suppress displays*/\\nw=length(top) /*get maximum width for aligned display*/\\nif base\\\\=='' then w=length(base**top) /*will be testing powers of two later? */\\ncommat.=left('', 7); commat.0=\\\"{unity}\\\"; commat.1='[prime]' /*some literals: pad; prime (or not).*/\\nnumeric digits max(9, w+1) /*maybe increase the digits precision. */\\nhash=0 /*hash: is the number of primes found. */\\n do n=bot to top by step /*process a single number or a range.*/\\n ?=n; if base\\\\=='' then ?=base**n + add /*should we perform a \\\"Mercenne\\\" test? */\\n pf=factr(?); f=words(pf) /*get prime factors; number of factors.*/\\n if f==1 then hash=hash+1 /*Is N prime? Then bump prime counter.*/\\n if tell then say right(?,w) right('('f\\\")\\\",9) 'prime factors: ' commat.f pf\\n end /*n*/\\nsay\\nps= 'primes'; if p==1 then ps= \\\"prime\\\" /*setup for proper English in sentence.*/\\nsay right(hash, w+9+1) ps 'found.' /*display the number of primes found. */\\nSay 'PD1 took' time('E') 'seconds'\\nexit /*stick a fork in it, we're all done. */\\n/*--------------------------------------------------------------------------------------*/\\nfactr: procedure; parse arg x 1 d,dollar /*set X, D to argument 1; dollar to null.*/\\nif x==1 then return '' /*handle the special case of X = 1. */\\n do while x//2==0; dollar=dollar 2; x=x%2; end /*append all the 2 factors of new X.*/\\n do while x//3==0; dollar=dollar 3; x=x%3; end /* \\\" \\\" \\\" 3 \\\" \\\" \\\" \\\" */\\n do while x//5==0; dollar=dollar 5; x=x%5; end /* \\\" \\\" \\\" 5 \\\" \\\" \\\" \\\" */\\n do while x//7==0; dollar=dollar 7; x=x%7; end /* \\\" \\\" \\\" 7 \\\" \\\" \\\" \\\" */\\n /* ___*/\\nq=1; do while q<=x; q=q*4; end /*these two lines compute integer v X */\\nr=0; do while q>1; q=q%4; _=d-r-q; r=r%2; if _>=0 then do; d=_; r=r+q; end; end\\n\\n do j=11 by 6 to r /*insure that J isn't divisible by 3.*/\\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\\n if _\\\\==5 then do while x//j==0; dollar=dollar j; x=x%j; end /*maybe reduce by J. */\\n if _ ==3 then iterate /*Is next Y is divisible by 5? Skip.*/\\n y=j+2; do while x//y==0; dollar=dollar y; x=x%y; end /*maybe reduce by J. */\\n end /*j*/\\n /* [?] The dollar list has a leading blank.*/\\nif x==1 then return dollar /*Is residual=unity? Then don't append.*/\\n return dollar x /*return dollar with appended residual. */\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"/*PD2 REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/\\nCall time 'R'\\nnumeric digits 1000 /*handle thousand digits for the powers*/\\nparse arg bot top step base add /*get optional arguments from the C.L. */\\nif bot=='' then do; bot=1; top=100; end /*no BOT given? Then use the default.*/\\nif top=='' then top=bot /* \\\" TOP? \\\" \\\" \\\" \\\" \\\" */\\nif step=='' then step= 1 /* \\\" STEP? \\\" \\\" \\\" \\\" \\\" */\\nif add =='' then add= -1 /* \\\" ADD? \\\" \\\" \\\" \\\" \\\" */\\ntell= top>0; top=abs(top) /*if TOP is negative, suppress displays*/\\nw=length(top) /*get maximum width for aligned display*/\\nif base\\\\=='' then w=length(base**top) /*will be testing powers of two later? */\\ncommat.=left('', 7); commat.0=\\\"{unity}\\\"; commat.1='[prime]' /*some literals: pad; prime (or not).*/\\nnumeric digits max(9, w+1) /*maybe increase the digits precision. */\\nhash=0 /*hash: is the number of primes found. */\\n do n=bot to top by step /*process a single number or a range.*/\\n ?=n; if base\\\\=='' then ?=base**n + add /*should we perform a \\\"Mercenne\\\" test? */\\n pf=factr(?); f=words(pf) /*get prime factors; number of factors.*/\\n if f==1 then hash=hash+1 /*Is N prime? Then bump prime counter.*/\\n if tell then say right(?,w) right('('f\\\")\\\",9) 'prime factors: ' commat.f pf\\n end /*n*/\\nsay\\nps= 'primes'; if p==1 then ps= \\\"prime\\\" /*setup for proper English in sentence.*/\\nsay right(hash, w+9+1) ps 'found.' /*display the number of primes found. */\\nSay 'PD2 took' time('E') 'seconds'\\nexit /*stick a fork in it, we're all done. */\\n/*--------------------------------------------------------------------------------------*/\\nfactr: procedure; parse arg x 1 d,dollar /*set X, D to argument 1; dollar to null.*/\\nif x==1 then return '' /*handle the special case of X = 1. */\\n do while x// 2==0; dollar=dollar 2; x=x%2; end /*append all the 2 factors of new X.*/\\n do while x// 3==0; dollar=dollar 3; x=x%3; end /* \\\" \\\" \\\" 3 \\\" \\\" \\\" \\\" */\\n do while x// 5==0; dollar=dollar 5; x=x%5; end /* \\\" \\\" \\\" 5 \\\" \\\" \\\" \\\" */\\n do while x// 7==0; dollar=dollar 7; x=x%7; end /* \\\" \\\" \\\" 7 \\\" \\\" \\\" \\\" */\\n do while x//11==0; dollar=dollar 11; x=x%11; end /* \\\" \\\" \\\" 11 \\\" \\\" \\\" \\\" */ /* ?¦¦¦¦ added.*/\\n do while x//13==0; dollar=dollar 13; x=x%13; end /* \\\" \\\" \\\" 13 \\\" \\\" \\\" \\\" */ /* ?¦¦¦¦ added.*/\\n do while x//17==0; dollar=dollar 17; x=x%17; end /* \\\" \\\" \\\" 17 \\\" \\\" \\\" \\\" */ /* ?¦¦¦¦ added.*/\\n do while x//19==0; dollar=dollar 19; x=x%19; end /* \\\" \\\" \\\" 19 \\\" \\\" \\\" \\\" */ /* ?¦¦¦¦ added.*/\\n do while x//23==0; dollar=dollar 23; x=x%23; end /* \\\" \\\" \\\" 23 \\\" \\\" \\\" \\\" */ /* ?¦¦¦¦ added.*/\\n /* ___*/\\nq=1; do while q<=x; q=q*4; end /*these two lines compute integer v X */\\nr=0; do while q>1; q=q%4; _=d-r-q; r=r%2; if _>=0 then do; d=_; r=r+q; end; end\\n\\n do j=29 by 6 to r /*insure that J isn't divisible by 3.*/ /* ?¦¦¦¦ changed.*/\\n parse var j '' -1 _ /*obtain the last decimal digit of J. */\\n if _\\\\==5 then do while x//j==0; dollar=dollar j; x=x%j; end /*maybe reduce by J. */\\n if _ ==3 then iterate /*Is next Y is divisible by 5? Skip.*/\\n y=j+2; do while x//y==0; dollar=dollar y; x=x%y; end /*maybe reduce by J. */\\n end /*j*/\\n /* [?] The dollar list has a leading blank.*/\\nif x==1 then return dollar /*Is residual=unity? Then don't append.*/\\n return dollar x /*return dollar with appended residual. */\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"'CONFIGURATION\\n'=============\\n\\n% max 8192 'Maximum amount of Prime Numbers (must be 2^n) (excluding 1 and 2)\\n% cores 4 'CPU cores available (limited to 4 here)\\n% share 2048 'Amount of numbers allocated to each core\\n\\n'SETUP\\n'=====\\n\\n'SOURCE DATA BUFFERS\\n\\nsys primes[max]\\nsys numbers[max]\\n\\n'RESULT BUFFER\\n\\ndouble pp[max] 'main thread\\n\\n\\n'MULTITHREADING AND TIMING API\\n'=============================\\n\\nextern lib \\\"kernel32.dll\\\"\\n'\\nvoid QueryPerformanceCounter(quad*c)\\nvoid QueryPerformanceFrequency(quad*freq)\\nsys CreateThread (sys lpThreadAttributes, dwStackSize, lpStartAddress, lpParameter, dwCreationFlags, *lpThreadId)\\ndword WaitForMultipleObjects(sys nCount,*lpHandles, bWaitAll, dwMilliseconds)\\nbool CloseHandle(sys hObject)\\nvoid Sleep(sys dwMilliSeconds)\\n'\\nquad freq,t1,t2\\nQueryPerformanceFrequency freq\\n\\n\\n'MACROS AND FUNCTIONS\\n'====================\\n\\n\\nmacro FindPrimes(p)\\n'==================\\nfinit\\nsys n=1\\nsys c,k\\ndo\\n n+=2\\n if c>=max then exit do\\n '\\n 'IS IT DIVISIBLE BE ANY PREVIOUS PRIME\\n '\\n for k=1 to c\\n if frac(n/p[k])=0 then exit for\\n next\\n '\\n if k>c then\\n c++\\n p[c]=n 'STORE PRIME\\n end if\\nend do\\nend macro\\n\\n\\nmacro ProcessNumbers(p,bb)\\n'=========================\\nfinit\\nsys i,b,e\\nb=bb*share\\ne=b+share\\nsys v,w\\nfor i=b+1 to e\\n v=numbers(i)\\n for j=max to 1 step -1\\n w=primes(j)\\n if w<v then\\n if frac(v/w)=0 then\\n p(i)=primes(j) 'store highest factor\\n exit for 'process next number\\n end if\\n end if\\n next\\nnext\\nend macro\\n\\n'THREAD FUNCTIONS\\n\\nfunction threadA(sys v) as sys\\nProcessNumbers(pp,v)\\nend function\\n\\n\\nfunction threadB(sys v) as sys\\nProcessNumbers(pp,v)\\nend function\\n\\n\\nfunction threadC(sys v) as sys\\nProcessNumbers(pp,v)\\nend function\\n\\n\\nend extern\\n\\nfunction mainThread(sys b)\\n'===========================\\nProcessNumbers(pp,b)\\nend function\\n\\n\\n'SOURCE DATA GENERATION\\n\\nsys seed = 0x12345678\\n\\nfunction Rnd() as sys\\n'====================\\n'\\nmov eax,seed\\nrol eax,7\\nimul eax,eax,13\\nmov seed,eax\\nreturn eax\\nend function\\n\\n\\nfunction GenerateNumbers()\\n'=========================\\nsys i,v,mask\\nmask=max * 8 -1 'as bit mask\\nfor i=1 to max\\n v=rnd()\\n v and=mask\\n numbers(i)=v\\nnext\\nend function\\n\\n\\n\\nFindPrimes(primes)\\n\\nGenerateNumbers()\\n\\n\\n\\n% threads Cores-1\\n\\n% INFINITE 0xFFFFFFFF 'Infinite timeout\\n\\nsys Funs[threads]={@threadA,@threadB,@threadC} '3 additional threads\\nsys hThread[threads], id[threads], i\\n'\\n'START TIMER\\n'\\nQueryPerformanceCounter t1\\n'\\nfor i=1 to threads\\n hThread(i) = CreateThread 0,0,funs(i),i,0,id(i)\\nnext\\n\\n\\nMainThread(0) 'process numbers in main thread (bottom share)\\n\\nif threads>0 then\\n WaitForMultipleObjects Threads, hThread, 1, INFINITE\\nend if\\n\\nfor i=1 to Threads\\n CloseHandle hThread(i)\\nnext\\n\\n'CAPTURE NUMBER WITH HIGHEST PRIME FACTOR\\n\\nsys n,f\\nfor i=1 to max\\n if pp(i)>f then f=pp(i) : n=i\\nnext\\n\\n'STOP TIMER\\n\\nQueryPerformanceCounter t2\\n\\nprint str((t2-t1)/freq,3) \\\" secs \\\" numbers(n) \\\" \\\" f 'number with highest prime factor\\n\",\n \"language\": \"OxygenBasic\"\n },\n {\n \"code\": \"v=pareval(vector(1000,i,()->factor(2^i+1)[1,1]));\\nvecmin(v)\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use ntheory qw/factor vecmax/;\\nuse threads;\\nuse threads::shared;\\nmy @results :shared;\\n\\nmy $tnum = 0;\\n$_->join() for\\n map { threads->create('tfactor', $tnum++, $_) }\\n (qw/576460752303423487 576460752303423487 576460752303423487 112272537195293\\n 115284584522153 115280098190773 115797840077099 112582718962171 299866111963290359/);\\n\\nmy $lmf = vecmax( map { $_->[1] } @results );\\nprint \\\"Largest minimal factor of $lmf found in:\\\\n\\\";\\nprint \\\" $_->[0] = [@$_[1..$#$_]]\\\\n\\\" for grep { $_->[1] == $lmf } @results;\\n\\nsub tfactor {\\n my($tnum, $n) = @_;\\n push @results, shared_clone([$n, factor($n)]);\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\ParallelCalculations.exw\\n -- =====================================\\n --\\n -- Proof that more threads can make things faster...\\n --</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (threads)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">res_cs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">init_cs</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- critical section</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">athread</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #7060A8;\\\">enter_cs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res_cs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">integer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">i</span>\\n <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">leave_cs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res_cs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_ui_pow_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add_ui</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_prime_factors</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1_000_000</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">enter_cs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res_cs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">r</span>\\n <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #7060A8;\\\">leave_cs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res_cs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">exit_thread</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">nthreads</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">progress</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"testing %d threads...\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">nthreads</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">tagset</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">threads</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">nthreads</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">threads</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">threads</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">create_thread</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">routine_id</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"athread\\\"</span><span style=\\\"color: #0000FF;\\\">),{}))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">wait_thread</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">threads</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">largest</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">e</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">elapsed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"largest is 2^%d+1 with smallest factor of %d (%d threads, %s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">nthreads</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">e</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">delete_cs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res_cs</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(let Lst\\n (mapcan\\n '((N)\\n (later (cons) # When done,\\n (cons N (factor N)) ) ) # return the number and its factors\\n (quote\\n 188573867500151328137405845301 # Process a collection of 12 numbers\\n 3326500147448018653351160281\\n 979950537738920439376739947\\n 2297143294659738998811251\\n 136725986940237175592672413\\n 3922278474227311428906119\\n 839038954347805828784081\\n 42834604813424961061749793\\n 2651919914968647665159621\\n 967022047408233232418982157\\n 2532817738450130259664889\\n 122811709478644363796375689 ) )\\n (wait NIL (full Lst)) # Wait until all computations are done\\n (maxi '((L) (apply min L)) Lst) ) # Result: Number in CAR, factors in CDR\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"threaded_decomp(Number,ID):-\\n\\tthread_create(\\n\\t\\t (prime_decomp(Number,Y),\\n\\t\\t thread_exit((Number,Y)))\\n\\t\\t ,ID,[]).\\n\\nthreaded_decomp_list(List,Erg):-\\n\\tmaplist(threaded_decomp,List,IDs),\\n\\tmaplist(thread_join,IDs,Results),\\n\\tmaplist(pack_exit_out,Results,Smallest_Factors_List),\\n\\tlargest_min_factor(Smallest_Factors_List,Erg).\\n\\npack_exit_out(exited(X),X).\\n%Note that here some error handling should happen.\\n\\nlargest_min_factor([(N,Facs)|A],(N2,Fs2)):-\\n\\tmin_list(Facs,MF),\\n\\tlargest_min_factor(A,(N,MF,Facs),(N2,_,Fs2)).\\n\\nlargest_min_factor([],Acc,Acc).\\nlargest_min_factor([(N1,Facs1)|Rest],(N2,MF2,Facs2),Goal):-\\n\\tmin_list(Facs1, MF1),\\n\\t(MF1 > MF2->\\n\\tlargest_min_factor(Rest,(N1,MF1,Facs1),Goal);\\n\\tlargest_min_factor(Rest,(N2,MF2,Facs2),Goal)).\\n\\n\\nformat_it(List):-\\n\\tthreaded_decomp_list(List,(Number,Factors)),\\n\\tformat('Number with largest minimal Factor is ~w\\\\nFactors are ~w\\\\n',\\n\\t [Number,Factors]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Structure IO_block\\n ThreadID.i\\n StartSeamaphore.i\\n Value.q\\n MinimumFactor.i\\n List Factors.i()\\nEndStructure\\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\nDeclare Factorize(*IO.IO_block)\\nDeclare main()\\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\nMain()\\nEnd\\n;\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\n\\nProcedure Main()\\n Protected AvailableCpu, MainSemaphore\\n Protected i, j, qData.q, Title$, Message$\\n NewList T.IO_block()\\n ;\\n AvailableCpu = Val(GetEnvironmentVariable(\\\"NUMBER_OF_PROCESSORS\\\"))\\n If AvailableCpu<1: AvailableCpu=1: EndIf\\n MainSemaphore = CreateSemaphore(AvailableCpu)\\n ;\\n Restore Start_of_data\\n For i=1 To (?end_of_data-?Start_of_data) / SizeOf(Quad)\\n ; Start all threads at ones, they will then be let to\\n ; self-oganize according to the availiable Cores.\\n AddElement(T())\\n Read.q qData\\n T()\\\\Value = qData\\n T()\\\\StartSeamaphore = MainSemaphore\\n T()\\\\ThreadID = CreateThread(@Factorize(), @T())\\n Next\\n ;\\n ForEach T()\\n ; Wait for all threads to complete their work and\\n ; find the smallest factor from eact task.\\n WaitThread(T()\\\\ThreadID)\\n Next\\n ;\\n i = OffsetOf(IO_block\\\\MinimumFactor)\\n SortStructuredList(T(), #PB_Sort_Integer, i, #PB_Sort_Descending)\\n FirstElement(T())\\n Title$=\\\"Info\\\"\\n Message$=\\\"Number \\\"+Str(T()\\\\Value)+\\\" has largest minimal factor:\\\"+#CRLF$\\n ForEach T()\\\\Factors()\\n Message$ + Str(T()\\\\Factors())+\\\" \\\"\\n Next\\n MessageRequester(Title$, Message$)\\nEndProcedure\\n\\nProcedureDLL Factorize(*IO.IO_block) ; Fill list Factors() with the factor parts of Number\\n ;Based on http://rosettacode.org/wiki/Prime_decomposition#PureBasic\\n With *IO\\n Protected Value.q=\\\\Value\\n WaitSemaphore(\\\\StartSeamaphore)\\n Protected I = 3\\n ClearList(\\\\Factors())\\n While Value % 2 = 0\\n AddElement(\\\\Factors())\\n \\\\Factors() = 2\\n Value / 2\\n Wend\\n Protected Max = Value\\n While I <= Max And Value > 1\\n While Value % I = 0\\n AddElement(\\\\Factors())\\n \\\\Factors() = I\\n Value / I\\n Wend\\n I + 2\\n Wend\\n SortList(\\\\Factors(), #PB_Sort_Ascending)\\n FirstElement(\\\\Factors())\\n \\\\MinimumFactor=\\\\Factors()\\n SignalSemaphore(\\\\StartSeamaphore)\\n EndWith ;*IO\\nEndProcedure\\n\\nDataSection\\n Start_of_data: ; Same numbers as Ada\\n Data.q 12757923, 12878611, 12757923, 15808973, 15780709, 197622519\\n end_of_data:\\nEndDataSection\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"from concurrent import futures\\nfrom math import floor, sqrt\\n\\nNUMBERS = [\\n 112272537195293,\\n 112582718962171,\\n 112272537095293,\\n 115280098190773,\\n 115797840077099,\\n 1099726829285419]\\n# NUMBERS = [33, 44, 55, 275]\\n\\ndef lowest_factor(n, _start=3):\\n if n % 2 == 0:\\n return 2\\n search_max = int(floor(sqrt(n))) + 1\\n for i in range(_start, search_max, 2):\\n if n % i == 0:\\n return i\\n return n\\n\\ndef prime_factors(n, lowest):\\n pf = []\\n while n > 1:\\n pf.append(lowest)\\n n //= lowest\\n lowest = lowest_factor(n, max(lowest, 3))\\n return pf\\n\\ndef prime_factors_of_number_with_lowest_prime_factor(NUMBERS):\\n with futures.ProcessPoolExecutor() as executor:\\n low_factor, number = max( (l, f) for l, f in zip(executor.map(lowest_factor, NUMBERS), NUMBERS) )\\n all_factors = prime_factors(number, low_factor)\\n return number, all_factors\\n\\n\\ndef main():\\n print('For these numbers:')\\n print('\\\\n '.join(str(p) for p in NUMBERS))\\n number, all_factors = prime_factors_of_number_with_lowest_prime_factor(NUMBERS)\\n print(' The one with the largest minimum prime factor is {}:'.format(number))\\n print(' All its prime factors in order are: {}'.format(all_factors))\\n\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"import multiprocessing\\n\\n# ========== #Python3 - concurrent\\nfrom math import floor, sqrt\\n\\nnumbers = [\\n 112272537195293,\\n 112582718962171,\\n 112272537095293,\\n 115280098190773,\\n 115797840077099,\\n 1099726829285419]\\n# numbers = [33, 44, 55, 275]\\n\\ndef lowest_factor(n, _start=3):\\n if n % 2 == 0:\\n return 2\\n search_max = int(floor(sqrt(n))) + 1\\n for i in range(_start, search_max, 2):\\n if n % i == 0:\\n return i\\n return n\\n\\ndef prime_factors(n, lowest):\\n pf = []\\n while n > 1:\\n pf.append(lowest)\\n n //= lowest\\n lowest = lowest_factor(n, max(lowest, 3))\\n return pf\\n# ========== #Python3 - concurrent\\n\\ndef prime_factors_of_number_with_lowest_prime_factor(numbers):\\n pool = multiprocessing.Pool(processes=5)\\n factors = pool.map(lowest_factor,numbers)\\n\\n low_factor,number = max((l,f) for l,f in zip(factors,numbers))\\n all_factors = prime_factors(number,low_factor)\\n return number,all_factors\\n\\nif __name__ == '__main__':\\n print('For these numbers:')\\n print('\\\\n '.join(str(p) for p in numbers))\\n number, all_factors = prime_factors_of_number_with_lowest_prime_factor(numbers)\\n print(' The one with the largest minimum prime factor is {}:'.format(number))\\n print(' All its prime factors in order are: {}'.format(all_factors))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require math)\\n(provide main)\\n\\n(define (smallest-factor n)\\n (list (first (first (factorize n))) n))\\n\\n(define numbers\\n '(112272537195293 112582718962171 112272537095293\\n 115280098190773 115797840077099 1099726829285419))\\n\\n(define (main)\\n ; create as many instances of Racket as\\n ; there are numbers:\\n (define ps\\n (for/list ([_ numbers])\\n (place ch\\n (place-channel-put\\n ch\\n (smallest-factor\\n (place-channel-get ch))))))\\n ; send the numbers to the instances:\\n (map place-channel-put ps numbers)\\n ; get the results and find the maximum:\\n (argmax first (map place-channel-get ps)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"> (main)\\n'(544651 115797840077099)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @nums = 64921987050997300559, 70251412046988563035, 71774104902986066597,\\n 83448083465633593921, 84209429893632345702, 87001033462961102237,\\n 87762379890959854011, 89538854889623608177, 98421229882942378967,\\n 259826672618677756753, 262872058330672763871, 267440136898665274575,\\n 278352769033314050117, 281398154745309057242, 292057004737291582187;\\n\\nmy @factories = @nums.hyper(:3batch).map: &prime-factors;\\nprintf \\\"%21d factors: %s\\\\n\\\", |$_ for @nums Z @factories;\\nmy $gmf = {}.append(@factories»[0] »=>« @nums).max: +*.key;\\nsay \\\"\\\\nGreatest minimum factor: \\\", $gmf.key;\\nsay \\\"from: { $gmf.value }\\\\n\\\";\\nsay 'Run time: ', now - INIT now;\\nsay '-' x 80;\\n\\n# For amusements sake and for relative comparison, using the same 100\\n# numbers as in the SequenceL example, testing with different numbers of threads.\\n\\n@nums = <625070029 413238785 815577134 738415913 400125878 967798656 830022841\\n 774153795 114250661 259366941 571026384 522503284 757673286 509866901 6303092\\n 516535622 177377611 520078930 996973832 148686385 33604768 384564659 95268916\\n 659700539 149740384 320999438 822361007 701572051 897604940 2091927 206462079\\n 290027015 307100080 904465970 689995756 203175746 802376955 220768968 433644101\\n 892007533 244830058 36338487 870509730 350043612 282189614 262732002 66723331\\n 908238109 635738243 335338769 461336039 225527523 256718333 277834108 430753136\\n 151142121 602303689 847642943 538451532 683561566 724473614 422235315 921779758\\n 766603317 364366380 60185500 333804616 988528614 933855820 168694202 219881490\\n 703969452 308390898 567869022 719881996 577182004 462330772 770409840 203075270\\n 666478446 351859802 660783778 503851023 789751915 224633442 347265052 782142901\\n 43731988 246754498 736887493 875621732 594506110 854991694 829661614 377470268\\n 984990763 275192380 39848200 892766084 76503760>».Int;\\n\\nfor 1..8 -> $degree {\\n my $start = now;\\n my \\\\factories = @nums.hyper(:degree($degree), :3batch).map: &prime-factors;\\n my $gmf = {}.append(factories»[0] »=>« @nums).max: +*.key;\\n say \\\"\\\\nFactoring {+@nums} numbers, greatest minimum factor: {$gmf.key}\\\";\\n say \\\"Using: $degree thread{ $degree > 1 ?? 's' !! ''}\\\";\\n my $end = now;\\n say 'Run time: ', $end - $start, ' seconds.';\\n}\\n\\n# Prime factoring routines from the Prime decomposition task\\nsub prime-factors ( Int $n where * > 0 ) {\\n return $n if $n.is-prime;\\n return [] if $n == 1;\\n my $factor = find-factor( $n );\\n sort flat prime-factors( $factor ), prime-factors( $n div $factor );\\n}\\n\\nsub find-factor ( Int $n, $constant = 1 ) {\\n return 2 unless $n +& 1;\\n if (my $gcd = $n gcd 6541380665835015) > 1 {\\n return $gcd if $gcd != $n\\n }\\n my $x = 2;\\n my $rho = 1;\\n my $factor = 1;\\n while $factor == 1 {\\n $rho *= 2;\\n my $fixed = $x;\\n for ^$rho {\\n $x = ( $x * $x + $constant ) % $n;\\n $factor = ( $x - $fixed ) gcd $n;\\n last if 1 < $factor;\\n }\\n }\\n $factor = find-factor( $n, $constant + 1 ) if $n == $factor;\\n $factor;\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"//! This solution uses [rayon](https://github.com/rayon-rs/rayon), a data-parallelism library.\\n//! Since Rust guarantees that a program has no data races, adding parallelism to a sequential\\n//! computation is as easy as importing the rayon traits and calling the `par_iter()` method.\\n\\nextern crate rayon;\\n\\nextern crate prime_decomposition;\\n\\nuse rayon::prelude::*;\\n\\n/// Returns the largest minimal factor of the numbers in a slice\\npub fn largest_min_factor(numbers: &[usize]) -> usize {\\n numbers\\n .par_iter()\\n .map(|n| {\\n // `factor` returns a sorted vector, so we just take the first element.\\n prime_decomposition::factor(*n)[0]\\n })\\n .max()\\n .unwrap()\\n}\\n\\nfn main() {\\n let numbers = &[\\n 1_122_725, 1_125_827, 1_122_725, 1_152_800, 1_157_978, 1_099_726,\\n ];\\n let max = largest_min_factor(numbers);\\n println!(\\\"The largest minimal factor is {}\\\", max);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import <Utilities/Conversion.sl>;\\nimport <Utilities/Math.sl>;\\nimport <Utilities/Sequence.sl>;\\n\\t\\t\\nmain(args(2)) :=\\n\\tlet\\n\\t\\tinputs := stringToInt(args);\\n\\t\\tfactored := primeFactorization(inputs);\\n\\t\\tminFactors := vectorMin(factored);\\n\\t\\t\\n\\t\\tindexOfMax := firstIndexOf(minFactors, vectorMax(minFactors));\\n\\tin\\n\\t\\t\\\"Number \\\" ++ intToString(inputs[indexOfMax]) ++ \\\" has largest minimal factor:\\\\n\\\" ++ delimit(intToString(factored[indexOfMax]), ' ');\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"factored := primeFactorization(inputs);\\n\",\n \"language\": \"SequenceL\"\n },\n {\n \"code\": \"var nums = [1275792312878611, 12345678915808973,\\n 1578070919762253, 14700694496703910,];\\n\\nvar factors = nums.map {|n| prime_factors.ffork(n) }.map { .wait }\\nsay ((nums ~Z factors)->max_by {|m| m[1][0] })\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"structure TTd = Thread.Thread ;\\nstructure TTm = Thread.Mutex ;\\n\\n\\nval threadedBigPrime = fn input:IntInf.int list =>\\n\\nlet\\n\\n(* --------------------- code from prime decomposition page ------------------- *)\\n val factor = fn n :IntInf.int =>\\n let\\n val unfactored = fn (u,_,_) => u; val factors = fn (_,f,_) => f; val try = fn (_,_,i) => i; fun getresult t = unfactored t::(factors t);\\n fun until done change x = if done x then getresult x else until done change (change x); (* iteration *)\\n fun lastprime t = unfactored t < (try t)*(try t)\\n fun trymore t = if unfactored t mod (try t) = 0 then (unfactored t div (try t) , try t::(factors t) , try t) else (unfactored t, factors t , try t + 1)\\n in until lastprime trymore (n,[],2) end;\\n(* --------------------- end of code from prime decomposition page ------------ *)\\n\\n\\n val mx = TTm.mutex () ;\\n val results : IntInf.int list list ref = ref [ ] ;\\n val tasks : IntInf.int list list ref = ref [ ] ;\\n\\n\\n val divideup = fn cores => fn inp : IntInf.int list =>\\n let\\n val np = (List.length inp) div cores + (cores +1) div cores (* assume length > cores to reduce code *)\\n val rec divd = fn ([], outp) => ([],outp )\\n | (inp,outp) => divd ( List.drop (inp,np) , (List.take (inp,np))::outp ) handle Subscript => ([],inp :: outp)\\n in\\n #2 ( divd (inp, [ ] ))\\n end;\\n\\n\\n val doTask = fn () =>\\n let\\n val mytask : IntInf.int list ref = ref [];\\n val myres : IntInf.int list list ref = ref [];\\n in\\n ( TTm.lock mx ; mytask := hd ( !tasks ) ; tasks:= tl (!tasks) ; TTm.unlock mx ;\\n myres := List.map factor ( !mytask ) ;\\n TTm.lock mx ; results := !myres @ ( !results ) ; TTm.unlock mx ;\\n TTd.exit ()\\n )\\n end;\\n\\n\\n val cores = TTd.numProcessors ();\\n val tmp = tasks := divideup cores input ;\\n val processes = List.tabulate ( cores , fn i => TTd.fork (doTask , []) ) ;\\n val maxim = ( while ( List.exists TTd.isActive processes ) do (Posix.Process.sleep (Time.fromReal 1.0 ));\\n List.foldr IntInf.max 1 ( List.map (fn i => List.last i ) (!results) ) ) (* maximal lowest prime *)\\n\\nin\\n\\n List.filter (fn lst => List.last lst = maxim ) (!results)\\n\\nend ;\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"> threadedBigPrime [ 62478923478923409323, 69478923478923409313, 79234790234098402349,\\n 33498023480920234793, 92834098234098023409, 31908234098234098243,\\n 92873400002348028833, 73498200234098200239, 4349023423478999243,\\n 13480234982340982343, 62478923478925971503, 5340823480234982007,\\n 134802349691098498233, 81780923490092302251, 802487292348792949 ] ;\\n\\nval it = [[1463103844669601, 42703], [1463103844669541, 42703]]:\\n\\n(* numbers *)\\n> List.map (List.foldr IntInf.* 1 ) it ;\\nval it = [62478923478925971503, 62478923478923409323]: IntInf.int list\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"import BigInt\\nimport Foundation\\n\\nextension BinaryInteger {\\n @inlinable\\n public func primeDecomposition() -> [Self] {\\n guard self > 1 else { return [] }\\n\\n func step(_ x: Self) -> Self {\\n return 1 + (x << 2) - ((x >> 1) << 1)\\n }\\n\\n let maxQ = Self(Double(self).squareRoot())\\n var d: Self = 1\\n var q: Self = self & 1 == 0 ? 2 : 3\\n\\n while q <= maxQ && self % q != 0 {\\n q = step(d)\\n d += 1\\n }\\n\\n return q <= maxQ ? [q] + (self / q).primeDecomposition() : [self]\\n }\\n}\\n\\nlet numbers = [\\n 112272537195293,\\n 112582718962171,\\n 112272537095293,\\n 115280098190773,\\n 115797840077099,\\n 1099726829285419,\\n 1275792312878611,\\n BigInt(\\\"64921987050997300559\\\")\\n]\\n\\nfunc findLargestMinFactor<T: BinaryInteger>(for nums: [T], then: @escaping ((n: T, factors: [T])) -> ()) {\\n let waiter = DispatchSemaphore(value: 0)\\n let lock = DispatchSemaphore(value: 1)\\n var factors = [(n: T, factors: [T])]()\\n\\n DispatchQueue.concurrentPerform(iterations: nums.count) {i in\\n let n = nums[i]\\n\\n print(\\\"Factoring \\\\(n)\\\")\\n\\n let nFacs = n.primeDecomposition().sorted()\\n\\n print(\\\"Factored \\\\(n)\\\")\\n\\n lock.wait()\\n factors.append((n, nFacs))\\n\\n if factors.count == nums.count {\\n waiter.signal()\\n }\\n\\n lock.signal()\\n }\\n\\n waiter.wait()\\n\\n then(factors.sorted(by: { $0.factors.first! > $1.factors.first! }).first!)\\n}\\n\\nfindLargestMinFactor(for: numbers) {res in\\n let (n, factors) = res\\n\\n print(\\\"Number with largest min prime factor: \\\\(n); factors: \\\\(factors)\\\")\\n\\n exit(0)\\n}\\n\\ndispatchMain()\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.6\\npackage require Thread\\n\\n# Pooled computation engine; runs event loop internally\\nnamespace eval pooled {\\n variable poolSize 3; # Needs to be tuned to system size\\n\\n proc computation {computationDefinition entryPoint values} {\\n\\tvariable result\\n\\tvariable poolSize\\n\\t# Add communication shim\\n\\tappend computationDefinition [subst -nocommands {\\n\\t proc poolcompute {value target} {\\n\\t\\tset outcome [$entryPoint \\\\$value]\\n\\t\\tset msg [list set ::pooled::result(\\\\$value) \\\\$outcome]\\n\\t\\tthread::send -async \\\\$target \\\\$msg\\n\\t }\\n\\t}]\\n\\n\\t# Set up the pool\\n\\tset pool [tpool::create -initcmd $computationDefinition \\\\\\n\\t\\t -maxworkers $poolSize]\\n\\n\\t# Prepare to receive results\\n\\tunset -nocomplain result\\n\\tarray set result {}\\n\\n\\t# Dispatch the computations\\n\\tforeach value $values {\\n\\t tpool::post $pool [list poolcompute $value [thread::id]]\\n\\t}\\n\\n\\t# Wait for results\\n\\twhile {[array size result] < [llength $values]} {vwait pooled::result}\\n\\n\\t# Dispose of the pool\\n\\ttpool::release $pool\\n\\n\\t# Return the results\\n\\treturn [array get result]\\n }\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Code for computing the prime factors of a number\\nset computationCode {\\n namespace eval prime {\\n\\tvariable primes [list 2 3 5 7 11]\\n\\tproc restart {} {\\n\\t variable index -1\\n\\t variable primes\\n\\t variable current [lindex $primes end]\\n\\t}\\n\\n\\tproc get_next_prime {} {\\n\\t variable primes\\n\\t variable index\\n\\t if {$index < [llength $primes]-1} {\\n\\t\\treturn [lindex $primes [incr index]]\\n\\t }\\n\\t variable current\\n\\t while 1 {\\n\\t\\tincr current 2\\n\\t\\tset p 1\\n\\t\\tforeach prime $primes {\\n\\t\\t if {$current % $prime} {} else {\\n\\t\\t\\tset p 0\\n\\t\\t\\tbreak\\n\\t\\t }\\n\\t\\t}\\n\\t\\tif {$p} {\\n\\t\\t return [lindex [lappend primes $current] [incr index]]\\n\\t\\t}\\n\\t }\\n\\t}\\n\\n\\tproc factors {num} {\\n\\t restart\\n\\t set factors [dict create]\\n\\t for {set i [get_next_prime]} {$i <= $num} {} {\\n\\t\\tif {$num % $i == 0} {\\n\\t\\t dict incr factors $i\\n\\t\\t set num [expr {$num / $i}]\\n\\t\\t continue\\n\\t\\t} elseif {$i*$i > $num} {\\n\\t\\t dict incr factors $num\\n\\t\\t break\\n\\t\\t} else {\\n\\t\\t set i [get_next_prime]\\n\\t\\t}\\n\\t }\\n\\t return $factors\\n\\t}\\n }\\n}\\n\\n# The values to be factored\\nset values {\\n 188573867500151328137405845301\\n 3326500147448018653351160281\\n 979950537738920439376739947\\n 2297143294659738998811251\\n 136725986940237175592672413\\n 3922278474227311428906119\\n 839038954347805828784081\\n 42834604813424961061749793\\n 2651919914968647665159621\\n 967022047408233232418982157\\n 2532817738450130259664889\\n 122811709478644363796375689\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"# Do the computation, getting back a dictionary that maps\\n# values to its results (itself an ordered dictionary)\\nset results [pooled::computation $computationCode prime::factors $values]\\n\\n# Find the maximum minimum factor with sorting magic\\nset best [lindex [lsort -integer -stride 2 -index {1 0} $results] end-1]\\n\\n# Print in human-readable form\\nproc renderFactors {factorDict} {\\n dict for {factor times} $factorDict {\\n\\tlappend v {*}[lrepeat $times $factor]\\n }\\n return [join $v \\\"*\\\"]\\n}\\nputs \\\"$best = [renderFactors [dict get $results $best]]\\\"\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"/* Parallel_calculations.wren */\\n\\nimport \\\"./math\\\" for Int\\n\\nclass C {\\n static minPrimeFactor(n) { Int.primeFactors(n)[0] }\\n\\n static allPrimeFactors(n) { Int.primeFactors(n) }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <omp.h>\\n#include \\\"wren.h\\\"\\n\\n#define NUM_VMS 4\\n\\nWrenVM* vms[NUM_VMS]; // array of VMs\\n\\nvoid doParallelCalcs() {\\n int data[] = {12757923, 12878611, 12878893, 12757923, 15808973, 15780709, 197622519};\\n int i, count, largest, largest_factor = 0;\\n omp_set_num_threads(4);\\n // we can share the same call and class handles amongst VMs\\n WrenHandle* callHandle = wrenMakeCallHandle(vms[0], \\\"minPrimeFactor(_)\\\");\\n WrenHandle* callHandle2 = wrenMakeCallHandle(vms[0], \\\"allPrimeFactors(_)\\\");\\n wrenEnsureSlots(vms[0], 1);\\n wrenGetVariable(vms[0], \\\"main\\\", \\\"C\\\", 0);\\n WrenHandle* classHandle = wrenGetSlotHandle(vms[0], 0);\\n\\n #pragma omp parallel for shared(largest_factor, largest)\\n for (i = 0; i < 7; ++i) {\\n int n = data[i];\\n int vi = omp_get_thread_num(); // assign a VM (via its array index) for this number\\n wrenEnsureSlots(vms[vi], 2);\\n wrenSetSlotHandle(vms[vi], 0, classHandle);\\n wrenSetSlotDouble(vms[vi], 1, (double)n);\\n wrenCall(vms[vi], callHandle);\\n int p = (int)wrenGetSlotDouble(vms[vi], 0);\\n if (p > largest_factor) {\\n largest_factor = p;\\n largest = n;\\n printf(\\\"Thread %d: found larger: %d of %d\\\\n\\\", vi, p, n);\\n } else {\\n printf(\\\"Thread %d: not larger: %d of %d\\\\n\\\", vi, p, n);\\n }\\n }\\n\\n printf(\\\"\\\\nLargest minimal prime factor: %d of %d\\\\n\\\", largest_factor, largest);\\n printf(\\\"All prime factors for this number: \\\");\\n wrenEnsureSlots(vms[0], 2);\\n wrenSetSlotHandle(vms[0], 0, classHandle);\\n wrenSetSlotDouble(vms[0], 1, (double)largest);\\n wrenCall(vms[0], callHandle2);\\n count = wrenGetListCount(vms[0], 0);\\n for (i = 0; i < count; ++i) {\\n wrenGetListElement(vms[0], 0, i, 1);\\n printf(\\\"%d \\\", (int)wrenGetSlotDouble(vms[0], 1));\\n }\\n printf(\\\"\\\\n\\\");\\n wrenReleaseHandle(vms[0], callHandle);\\n wrenReleaseHandle(vms[0], callHandle2);\\n wrenReleaseHandle(vms[0], classHandle);\\n}\\n\\nstatic void writeFn(WrenVM* vm, const char* text) {\\n printf(\\\"%s\\\", text);\\n}\\n\\nvoid errorFn(WrenVM* vm, WrenErrorType errorType, const char* module, const int line, const char* msg) {\\n switch (errorType) {\\n case WREN_ERROR_COMPILE:\\n printf(\\\"[%s line %d] [Error] %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_STACK_TRACE:\\n printf(\\\"[%s line %d] in %s\\\\n\\\", module, line, msg);\\n break;\\n case WREN_ERROR_RUNTIME:\\n printf(\\\"[Runtime Error] %s\\\\n\\\", msg);\\n break;\\n }\\n}\\n\\nchar *readFile(const char *fileName) {\\n FILE *f = fopen(fileName, \\\"r\\\");\\n fseek(f, 0, SEEK_END);\\n long fsize = ftell(f);\\n rewind(f);\\n char *script = malloc(fsize + 1);\\n fread(script, 1, fsize, f);\\n fclose(f);\\n script[fsize] = 0;\\n return script;\\n}\\n\\nstatic void loadModuleComplete(WrenVM* vm, const char* module, WrenLoadModuleResult result) {\\n if( result.source) free((void*)result.source);\\n}\\n\\nWrenLoadModuleResult loadModule(WrenVM* vm, const char* name) {\\n WrenLoadModuleResult result = {0};\\n if (strcmp(name, \\\"random\\\") != 0 && strcmp(name, \\\"meta\\\") != 0) {\\n result.onComplete = loadModuleComplete;\\n char fullName[strlen(name) + 6];\\n strcpy(fullName, name);\\n strcat(fullName, \\\".wren\\\");\\n result.source = readFile(fullName);\\n }\\n return result;\\n}\\n\\nint main(int argc, char **argv) {\\n WrenConfiguration config;\\n wrenInitConfiguration(&config);\\n config.writeFn = &writeFn;\\n config.errorFn = &errorFn;\\n config.loadModuleFn = &loadModule;\\n const char* module = \\\"main\\\";\\n const char* fileName = \\\"Parallel_calculations.wren\\\";\\n char *script = readFile(fileName);\\n\\n // config the VMs and interpret the script\\n int i;\\n for (i = 0; i < NUM_VMS; ++i) {\\n vms[i] = wrenNewVM(&config);\\n wrenInterpret(vms[i], module, script);\\n }\\n doParallelCalcs();\\n for (i = 0; i < NUM_VMS; ++i) wrenFreeVM(vms[i]);\\n free(script);\\n return 0;\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn factorize(x,y,z,etc){\\n xyzs:=vm.arglist;\\n fs:=xyzs.apply(factors.strand) // queue up factorizing for x,y,...\\n .apply(\\\"noop\\\")\\t\\t // wait for all threads to finish factoring\\n .apply(fcn{ (0).min(vm.arglist) }); // find minimum factor for x,y...\\n [0..].zip(fs).filter(fcn([(n,x)],M){ x==M }.fp1((0).max(fs))) // find max of mins\\n .apply('wrap([(n,_)]){ xyzs[n] }) // and pluck src from arglist\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"factorize(12757923,12878611,12757923,15808973,15780709,197622519).println();\\n // do a bunch so I can watch the system monitor\\nfactorize( (0).pump(5000,List,fcn{(1000).random() }).xplode() ).println();\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn factors(n){ // Return a list of factors of n\\n acc:=fcn(n,k,acc,maxD){ // k is 2,3,5,7,9,... not optimum\\n if(n==1 or k>maxD) acc.close();\\n else{\\n\\t q,r:=n.divr(k); // divr-->(quotient,remainder)\\n\\t if(r==0) return(self.fcn(q,k,acc.write(k),q.toFloat().sqrt()));\\n\\t return(self.fcn(n,k+1+k.isOdd,acc,maxD))\\n }\\n }(n,2,Sink(List),n.toFloat().sqrt());\\n m:=acc.reduce('*,1); // mulitply factors\\n if(n!=m) acc.append(n/m); // opps, missed last factor\\n else acc;\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parallel-calculations"}}},{"rowIdx":1482,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Parameterized_SQL_statement\nnote: Database operations\n","language":"00-META"},{"code":"Parameterized SQL statements are an easy way to avoid [[wp:SQL injection|SQL injection]] attacks. SQL drivers and libraries will automatically \"sanitize\" input to parameterized SQL statements to avoid these catastrophic database attacks. Second, parameterized SQL performs better. A lot better.\n\nUsing a SQL update statement like this one (spacing is optional):\n<syntaxhighlight lang=\"sql\">UPDATE players\n SET name = 'Smith, Steve', score = 42, active = true\n WHERE jerseyNum = 99</syntaxhighlight>show how to make a parameterized SQL statement, set the parameters to the values given above, and execute the statement.\n\n<blockquote cite=\"http://blog.codinghorror.com/give-me-parameterized-sql-or-give-me-death/\">Non-parameterized SQL is the GoTo statement of database programming. Don't do it, and make sure your coworkers don't either.</blockquote>\n\n","language":"00-TASK"},{"code":"\\ assuming the var 'db' contains an opened database with a schema matching the problem:\ndb @\n\"UPDATE players SET name=?1,score=?2,active=?3 WHERE jerseyNum=?4\"\ndb:prepare var, stmt\n\n\\ bind values to the statement:\nstmt @ 1 \"Smith, Steve\" db:bind\n 2 42 db:bind\n 3 true db:bind\n 4 99 db:bind\n\n\\ execute the query\ndb @ swap db:exec\n","language":"8th"},{"code":"-- Version for sqlite\nwith GNATCOLL.SQL_Impl; use GNATCOLL.SQL_Impl;\nwith GNATCOLL.SQL.Exec; use GNATCOLL.SQL.Exec;\nwith GNATCOLL.SQL.Sqlite; use GNATCOLL.SQL;\n\nprocedure Prepared_Query is\n\n DB_Descr : Database_Description;\n Conn : Database_Connection;\n Query : Prepared_Statement;\n --sqlite does not support boolean fields\n True_Str : aliased String := \"TRUE\";\n Param : SQL_Parameters (1 .. 4) :=\n (1 => (Parameter_Text, null),\n 2 => (Parameter_Integer, 0),\n 3 => (Parameter_Text, null),\n 4 => (Parameter_Integer, 0));\nbegin\n -- Allocate and initialize the description of the connection\n Setup_Database (DB_Descr, \"rosetta.db\", \"\", \"\", \"\", DBMS_Sqlite);\n -- Allocate the connection\n Conn := Sqlite.Build_Sqlite_Connection (DB_Descr);\n -- Initialize the connection\n Reset_Connection (DB_Descr, Conn);\n Query :=\n Prepare\n (\"UPDATE players SET name = ?, score = ?, active = ? \" &\n \" WHERE jerseyNum = ?\");\n declare\n Name : aliased String := \"Smith, Steve\";\n begin\n Param := (\"+\" (Name'Access), \"+\" (42), \"+\" (True_Str'Access), \"+\" (99));\n Execute (Conn, Query, Param);\n end;\n Commit_Or_Rollback (Conn);\n Free (Conn);\n Free (DB_Descr);\nend Prepared_Query;\n","language":"Ada"},{"code":"; Helper functions\n\ncreateTable: function [][\n query db {!sql DROP TABLE IF EXISTS users}\n query db {!sql\n CREATE TABLE users (\n ID INTEGER PRIMARY KEY AUTOINCREMENT,\n username TEXT NOT NULL,\n email TEXT NOT NULL,\n age INTEGER\n )\n }\n]\n\naddUser: function [name, email, age][\n query.id db .with:@[name,email,age] {!sql\n INSERT INTO users (username, email, age)\n VALUES (?,?,?)\n }\n]\n\nfindUser: function [name][\n query db .with:@[name] ~{!sql\n SELECT *\n FROM users\n WHERE username=?\n }\n]\n\ndb: open.sqlite \"users.db\"\n\ncreateTable\n\nprint [\"added user with id:\" addUser \"JohnDoe\" \"jodoe@gmail.com\" 35]\nprint [\"added user with id:\" addUser \"JaneDoe\" \"jadoe@gmail.com\" 14]\n\nprint [\"getting user with name: JohnDoe =>\" findUser \"JohnDoe\"]\n\nclose db\n","language":"Arturo"},{"code":"# open database file\ndbopen \"players.sqlite3\"\n\n# delete old players table - trap error if new database\nonerror errortrap\n# delete old database if it exists\ndbexecute \"DROP TABLE IF EXISTS players;\"\n\n# create database table with sample data\n# include the IF NOT EXISTS clause to avoid an error if the table already exists.\ndbexecute \"CREATE TABLE IF NOT EXISTS players (name TEXT NOT NULL, score INTEGER, active BIT, jerseyNum INTEGER);\"\ndbexecute \"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\"\ndbexecute \"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\"\ndbexecute \"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\"\n\ndbexecute \"UPDATE players SET name = 'Smith, Steve', score = 42, active = 'TRUE' WHERE jerseyNum = 99;\"\n\ndbopenset \"SELECT * FROM players;\"\nwhile dbrow()\n\tprint \"['\" + dbstring(0) + \", '\" + dbstring(1) + \", '\" + dbstring(2) + \"', \" + dbstring(3) + \"]\"\nend while\ndbcloseset\n\nofferror\n# wrap everything up\ndbclose\nend\n\nerrortrap:\n# accept error - display nothing - return to next statement\nreturn\n","language":"BASIC256"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <sqlite3.h>\n\nstatic const char* db_file = \":memory:\"; // Create an in-memory database.\n\nvoid check_error(int result_code, sqlite3 *db);\nint select_callback(void* data, int column_count, char** columns, char** column_names);\n\nint main(void) {\n sqlite3 *db;\n int result_code;\n char *sql;\n char *insert_statements[4];\n sqlite3_stmt *compiled_statement;\n int i;\n\n // Open the database.\n result_code = sqlite3_open(db_file, &db);\n check_error(result_code, db);\n\n // Create the players table in the database.\n sql = \"create table players(\"\n \"id integer primary key asc, \"\n \"name text, \"\n \"score real, \"\n \"active integer, \" // Store the bool value as integer (see https://sqlite.org/datatype3.html chapter 2.1).\n \"jerseyNum integer);\";\n result_code = sqlite3_exec(db, sql, NULL, NULL, NULL);\n check_error(result_code, db);\n\n // Insert some values into the players table.\n insert_statements[0] = \"insert into players (name, score, active, jerseyNum) \"\n \"values ('Roethlisberger, Ben', 94.1, 1, 7);\";\n insert_statements[1] = \"insert into players (name, score, active, jerseyNum) \"\n \"values ('Smith, Alex', 85.3, 1, 11);\";\n insert_statements[2] = \"insert into players (name, score, active, jerseyNum) \"\n \"values ('Manning, Payton', 96.5, 0, 18);\";\n insert_statements[3] = \"insert into players (name, score, active, jerseyNum) \"\n \"values ('Doe, John', 15, 0, 99);\";\n\n for (i=0; i<4; i++) {\n result_code = sqlite3_exec(db, insert_statements[i], NULL, NULL, NULL);\n check_error(result_code, db);\n }\n\n // Display the contents of the players table.\n printf(\"Before update:\\n\");\n sql = \"select * from players;\";\n result_code = sqlite3_exec(db, sql, select_callback, NULL, NULL);\n check_error(result_code, db);\n\n // Prepare the parametrized SQL statement to update player #99.\n sql = \"update players set name=?, score=?, active=? where jerseyNum=?;\";\n result_code = sqlite3_prepare_v2(db, sql, -1, &compiled_statement, NULL);\n check_error(result_code, db);\n\n // Bind the values to the parameters (see https://sqlite.org/c3ref/bind_blob.html).\n result_code = sqlite3_bind_text(compiled_statement, 1, \"Smith, Steve\", -1, NULL);\n check_error(result_code, db);\n result_code = sqlite3_bind_double(compiled_statement, 2, 42);\n check_error(result_code, db);\n result_code = sqlite3_bind_int(compiled_statement, 3, 1);\n check_error(result_code, db);\n result_code = sqlite3_bind_int(compiled_statement, 4, 99);\n check_error(result_code, db);\n\n // Evaluate the prepared SQL statement.\n result_code = sqlite3_step(compiled_statement);\n if (result_code != SQLITE_DONE) {\n printf(\"Error #%d: %s\\n\", result_code, sqlite3_errmsg(db));\n sqlite3_close(db);\n return result_code;\n }\n\n // Destroy the prepared statement object.\n result_code = sqlite3_finalize(compiled_statement);\n check_error(result_code, db);\n\n // Display the contents of the players table.\n printf(\"After update:\\n\");\n sql = \"select * from players;\";\n result_code = sqlite3_exec(db, sql, select_callback, NULL, NULL);\n check_error(result_code, db);\n\n // Close the database connection.\n sqlite3_close(db);\n\n return EXIT_SUCCESS;\n}\n\n/*\n Checks the result code from an SQLite operation.\n If it contains an error code then this function prints the error message,\n closes the database and exits.\n*/\nvoid check_error(int result_code, sqlite3 *db) {\n if (result_code != SQLITE_OK) {\n printf(\"Error #%d: %s\\n\", result_code, sqlite3_errmsg(db));\n sqlite3_close(db);\n exit(result_code);\n }\n}\n\n/* This callback function prints the results of the select statement. */\nint select_callback(void* data, int column_count, char** columns, char** column_names) {\n int i;\n\n for (i=0; i<column_count; i++) {\n printf(columns[i]);\n if (i < column_count-1) printf(\" | \");\n }\n printf(\"\\n\");\n}\n","language":"C"},{"code":"#include <QtSql>\n#include <iostream>\n\n// Command line arguments: data-source user password\n// Obviously in a real application the password would be obtained in a secure manner.\n\nint main(int argc, char *argv[]) {\n if (argc != 4) {\n std::cerr << \"Usage: \" << argv[0] << \" data-source user password\\n\";\n return 1;\n }\n QSqlDatabase db = QSqlDatabase::addDatabase(\"QODBC\");\n db.setDatabaseName(argv[1]);\n if (!db.open(argv[2], argv[3])) {\n auto error = db.lastError();\n std::cerr << \"Cannot connect to data source: \" << error.text().toStdString() << '\\n';\n } else {\n std::cout << \"Connected to data source.\\n\";\n QSqlQuery query(db);\n query.prepare(\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\");\n query.bindValue(0, \"Smith, Steve\");\n query.bindValue(1, 42);\n query.bindValue(2, true);\n query.bindValue(3, 99);\n if (!query.exec()) {\n auto error = db.lastError();\n std::cerr << \"Cannot update database: \" << error.text().toStdString() << '\\n';\n } else {\n std::cout << \"Update succeeded.\\n\";\n }\n }\n return 0;\n}\n","language":"C++"},{"code":"using System.Data.Sql;\nusing System.Data.SqlClient;\n\nnamespace ConsoleApplication1\n{\n class Program\n {\n static void Main(string[] args)\n {\n using var tConn = new SqlConnection(\"ConnectionString\");\n\n using var tCommand = tConn.CreateCommand();\n tCommand.CommandText = \"UPDATE players SET name = @name, score = @score, active = @active WHERE jerseyNum = @jerseyNum\";\n\n tCommand.Parameters.Add(new SqlParameter(\"@name\", System.Data.SqlDbType.VarChar).Value = \"Smith, Steve\");\n tCommand.Parameters.Add(new SqlParameter(\"@score\", System.Data.SqlDbType.Int).Value = \"42\");\n tCommand.Parameters.Add(new SqlParameter(\"@active\", System.Data.SqlDbType.Bit).Value = true);\n tCommand.Parameters.Add(new SqlParameter(\"@jerseyNum\", System.Data.SqlDbType.Int).Value = \"99\");\n\n tCommand.ExecuteNonQuery();\n }\n }\n}\n","language":"C-sharp"},{"code":"(require '[clojure.java.jdbc :as sql])\n; Using h2database for this simple example.\n(def db {:classname \"org.h2.Driver\"\n :subprotocol \"h2:file\"\n :subname \"db/my-dbname\"})\n\n(sql/update! db :players {:name \"Smith, Steve\" :score 42 :active true} [\"jerseyNum = ?\" 99])\n\n; As an alternative to update!, use execute!\n(sql/execute! db [\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\" \"Smith, Steve\" 42 true 99])\n","language":"Clojure"},{"code":"open System.Data.SqlClient\n\n[<EntryPoint>]\nlet main argv =\n use tConn = new SqlConnection(\"ConnectionString\")\n\n use tCommand = new SqlCommand()\n tCommand.Connection <- tConn\n tCommand.CommandText <- \"UPDATE players SET name = @name, score = @score, active = @active WHERE jerseyNum = @jerseyNum\"\n\n tCommand.Parameters.Add(SqlParameter(\"@name\", System.Data.SqlDbType.VarChar).Value = box \"Smith, Steve\") |> ignore\n tCommand.Parameters.Add(SqlParameter(\"@score\", System.Data.SqlDbType.Int).Value = box 42) |> ignore\n tCommand.Parameters.Add(SqlParameter(\"@active\", System.Data.SqlDbType.Bit).Value = box true) |> ignore\n tCommand.Parameters.Add(SqlParameter(\"@jerseyNum\", System.Data.SqlDbType.Int).Value = box 99) |> ignore\n\n tCommand.ExecuteNonQuery() |> ignore\n 0\n","language":"F-Sharp"},{"code":"#include once \"sqlite3.bi\"\n#define NULL 0\n\nDim As sqlite3 Ptr db\nDim As sqlite3_stmt Ptr stmt\nDim As Integer rc\n\n' Open database file\nrc = sqlite3_open(\"players.sqlite3\", @db)\n\nIf rc <> SQLITE_OK Then\n Print \"No se puede abrir la base de datos: \"; *sqlite3_errmsg(db)\n sqlite3_close(db)\n End 1\nEnd If\n\n' Delete old database if it exists\nsqlite3_exec(db, \"DROP TABLE IF EXISTS players;\", NULL, NULL, NULL)\n\n' Create database table with sample data\nsqlite3_exec(db, \"CREATE TABLE IF NOT EXISTS players (name TEXT NOT NULL, score INTEGER, active BIT, jerseyNum INTEGER);\", NULL, NULL, NULL)\nsqlite3_exec(db, \"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\", NULL, NULL, NULL)\nsqlite3_exec(db, \"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\", NULL, NULL, NULL)\nsqlite3_exec(db, \"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\", NULL, NULL, NULL)\n\n' Update name and score of player with jersey number 99\nsqlite3_exec(db, \"UPDATE players SET name = 'Smith, Steve', score = 42, active = 'TRUE' WHERE jerseyNum = 99;\", NULL, NULL, NULL)\n\n' Query and display all player table records\nDim As sqlite3_stmt Ptr stmt2\nDim As String query3 = \"SELECT * FROM players\"\nrc = sqlite3_prepare_v2(db, Strptr(query3), -1, @stmt2, 0)\n\nWhile sqlite3_step(stmt2) = SQLITE_ROW\n Print \"['\"; *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 0)); \"', \";\n Print *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 1)); \", \";\n Print *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 2)); \", \";\n Print sqlite3_column_int(stmt2, 3); \"]\"\nWend\n\n' Close the database\nsqlite3_finalize(stmt2)\nsqlite3_close(db)\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"database/sql\"\n \"fmt\"\n\n _ \"github.com/mattn/go-sqlite3\"\n)\n\nfunc main() {\n db, _ := sql.Open(\"sqlite3\", \"rc.db\")\n defer db.Close()\n db.Exec(`create table players (name, score, active, jerseyNum)`)\n db.Exec(`insert into players values (\"\",0,0,\"99\")`)\n db.Exec(`insert into players values (\"\",0,0,\"100\")`)\n\n // Parameterized\n db.Exec(`update players set name=?, score=?, active=? where jerseyNum=?`,\n \"Smith, Steve\", 42, true, \"99\")\n\n rows, _ := db.Query(\"select * from players\")\n var (\n name string\n score int\n active bool\n jerseyNum string\n )\n for rows.Next() {\n rows.Scan(&name, &score, &active, &jerseyNum)\n fmt.Printf(\"%3s %12s %3d %t\\n\", jerseyNum, name, score, active)\n }\n rows.Close()\n}\n","language":"Go"},{"code":"module Main (main) where\n\nimport Database.HDBC (IConnection, commit, run, toSql)\n\nupdatePlayers :: IConnection a => a -> String -> Int -> Bool -> Int -> IO Bool\nupdatePlayers conn name score active jerseyNum = do\n rowCount <- run conn\n \"UPDATE players\\\n \\ SET name = ?, score = ?, active = ?\\\n \\ WHERE jerseyNum = ?\"\n [ toSql name\n , toSql score\n , toSql active\n , toSql jerseyNum\n ]\n commit conn\n return $ rowCount == 1\n\nmain :: IO ()\nmain = undefined\n","language":"Haskell"},{"code":"import Database as db;\nimport Algorithms as algo;\nimport FileSystem as fs;\n\nmain() {\n dbPath = \"/tmp/parametrized-sql.sqlite\";\n fs.remove( dbPath );\n fs.open( dbPath, fs.OPEN_MODE.WRITE );\n conn = db.connect( \"sqlite3:///\" + dbPath );\n\n // Setup...\n conn.query(\n \"CREATE TABLE Players (\\n\"\n \"\\tname VARCHAR(64),\\n\"\n \"\\tscore FLOAT,\\n\"\n \"\\tactive INTEGER,\\n\"\n \"\\tno VARCHAR(8)\\n\"\n \");\"\n ).execute();\n conn.query(\n \"INSERT INTO Players VALUES ( 'name', 0, 'false', 99 );\"\n ).execute();\n conn.query(\n \"INSERT INTO Players VALUES ( 'name', 0, 'false', 100 );\"\n ).execute();\n\n // Demonstrate parameterized SQL...\n parametrizedQuery = conn.query(\n \"UPDATE Players SET name=?, score=?, active=? WHERE no=?\"\n );\n for ( i, v : algo.enumerate( ( \"Smith, Steve\", 42, true, 99 ) ) ) {\n parametrizedQuery.bind( i + 1, string( v ) );\n }\n parametrizedQuery.execute();\n\n // and show the results...\n for ( record : conn.query( \"SELECT * FROM Players;\" ).execute() ) {\n print( \"{}\\n\".format( record ) );\n }\n return ( 0 );\n}\n","language":"Huginn"},{"code":"import java.sql.DriverManager;\nimport java.sql.Connection;\nimport java.sql.PreparedStatement;\n\npublic class DBDemo{\n private String protocol; //set this to some connection protocol like \"jdbc:sqlserver://\"\n private String dbName; //set this to the name of your database\n private String username;\n private String password;\n\n PreparedStatement query;\n\n public int setUpAndExecPS(){\n try {\n Connection conn = DriverManager.getConnection(protocol + dbName, username, password);\n\n query = conn.prepareStatement(\n \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\");\n\n query.setString(1, \"Smith, Steve\");//automatically sanitizes and adds quotes\n query.setInt(2, 42);\n query.setBoolean(3, true);\n query.setInt(4, 99);\n //there are similar methods for other SQL types in PerparedStatement\n return query.executeUpdate();//returns the number of rows changed\n //PreparedStatement.executeQuery() will return a java.sql.ResultSet,\n //execute() will simply return a boolean saying whether it succeeded or not\n\n } catch (Exception e) {\n e.printStackTrace();\n }\n\n return 0;\n }\n}\n","language":"Java"},{"code":"using SQLite\n\nname = \"Smith, Steve\"\njerseys = Dict(\"Smith, Steve\" => 99)\nsqlbool(tf::Bool) = if(tf) \"TRUE\" else \"FALSE\" end\n\ndb = SQLite.DB() # no filename given, so create an in-memory temporary\nSQLite.execute!(db, \"create table players (id integer primary key,\n name text,\n score number,\n active bool,\n jerseynum integer)\")\n\nSQLite.query(db, \"INSERT INTO players (name, score, active, jerseynum) values ('Jones, James', 9, 'FALSE', 99)\")\nSQLite.query(db, \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseynum = ?\";\n values = [\"Smith, Steve\", 42, sqlbool(true), jerseys[name]])\n\ntbl = SQLite.query(db, \"SELECT * from players\")\nprintln(tbl)\n","language":"Julia"},{"code":"// Version 1.2.41\n\nimport java.sql.DriverManager\nimport java.sql.Connection\n\nfun main(args: Array<String>) {\n val url = \"jdbc:mysql://localhost:3306/test\"\n val username = \"example\"\n val password = \"password123\"\n val conn = DriverManager.getConnection(url, username, password)\n val query = conn.prepareStatement(\n \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\"\n )\n with (query) {\n setString(1, \"Smith, Steve\")\n setInt(2, 42)\n setBoolean(3, true)\n setInt(4, 99)\n val rowCount = executeUpdate()\n if (rowCount == 0) println(\"Update failed\")\n close()\n }\n conn.close()\n}\n","language":"Kotlin"},{"code":"Module Parametrized_Sql {\n\tBase \"rosetta\" ' warning erase database if found it in current directory\n\tExecute \"rosetta\", {create table players (name VarChar(64), score Float, active Integer, jerseyNum Integer);}\n\tAppend \"rosetta\", \"players\",\"name\",0,FALSE,99\n\tsql$={\n\tUPDATE players\n\t SET name = '{0}', score = {1}, active = {2}\n\t WHERE jerseyNum = {3}\n\t}\n\tExecute \"rosetta\", format$(sql$,\"Smith, Steve\", 42,TRUE, 99)\n\tRetrieve \"rosetta\",\"players\",1,\"jerseyNum\",99\n\tRead how_many\n\tRead Name$,score, active,jerseynum\n\tPrint Name$=\"Smith, Steve\", score=42, active=True, jerseynum=99 ' true true true true\n}\nParametrized_Sql\n","language":"M2000-Interpreter"},{"code":"Needs[\"DatabaseLink`\"];\nconn=OpenSQLConnection[JDBC[\"ODBC(DSN)\",\"testdb\"],\"Username\"->\"John\",\"Password\"->\"JohnsPassword\"];\nSQLExecute[conn,\"UPDATE players SET name = `1`, score = `2`, active = `3` WHERE jerseyNum = `4`\", {SQLArgument[\"Smith, Steve\",42,True,99]}]\nCloseSQLConnection[conn];\n","language":"Mathematica"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nimport java.sql.\n\n-- =============================================================================\nclass RParameterizedSQLSimple public\n\n properties indirect\n connexion = Connection\n\n properties inheritable constant\n DRIVER = \"org.apache.derby.jdbc.EmbeddedDriver\"\n DBURL = \"jdbc:derby:\"\n DBNAME = \"/workspace/DB.DerbySamples/DB/TEAMS01\"\n DBMODE_CREATE = \";create=true\"\n DBMODE_NOCREATE = \";create=false\"\n DBMODE_SHUTDOWN = \";shutdown=true\"\n\n-- =============================================================================\nmethod RParameterizedSQLSimple()\n setConnexion(null)\n return\n\n-- =============================================================================\nmethod createConnexion() inheritable returns Connection signals ClassNotFoundException, InstantiationException, IllegalAccessException\n if getConnexion() = null then do\n props = Properties()\n props.put(\"user\", \"user1\")\n props.put(\"password\", \"user1\")\n\n xURL = String DBURL || DBNAME || DBMODE_CREATE\n loadDriver(DRIVER)\n setConnexion(DriverManager.getConnection(xURL, props))\n end\n\n return getConnexion()\n\n-- =============================================================================\nmethod shutdownConnexion() inheritable returns boolean signals SQLException\n\n dbState = boolean\n xURL = String DBURL || DBNAME || DBMODE_SHUTDOWN\n\n do\n DriverManager.getConnection(xURL)\n dbState = isTrue\n\n catch se = SQLException\n if (se.getErrorCode() = 50000) & (\"XJ015\".equals(se.getSQLState())) then do\n say \"Derby shut down normally\"\n dbState = isTrue\n end\n else if (se.getErrorCode() = 45000) & (\"08006\".equals(se.getSQLState())) then do\n say \"Derby database shut down normally\"\n dbState = isTrue\n end\n else do\n say \"Derby did not shut down normally\"\n dbState = isFalse\n signal se\n end\n end\n\n return dbState\n\n-- =============================================================================\nmethod loadDriver(xdriver = String) inheritable static signals ClassNotFoundException, InstantiationException, IllegalAccessException\n\n do\n Class.forName(xdriver).newInstance()\n say \"Loaded the appropriate driver\"\n\n catch cnfe = ClassNotFoundException\n say \"Unable to load the JDBC driver\" xdriver\n say \"Please check your CLASSPATH.\"\n signal cnfe\n\n catch ie = InstantiationException\n say \"Unable to instantiate the JDBC driver\" xdriver\n signal ie\n\n catch iae = IllegalAccessException\n say \"Not allowed to access the JDBC driver\" xdriver\n signal iae\n\n end\n\n return\n\n-- =============================================================================\nmethod updatePlayer(jerseyNum = int, name = String, score = int, active = boolean) binary inheritable returns int signals SQLException\n\n updateSQL = \"\" -\n || \"UPDATE TEAM.PLAYERS\" -\n || \" SET NAME = ?, SCORE = ?, ACTIVE = ?\" -\n || \" WHERE JERSEYNUM = ?\"\n\n rowCt = int\n ix = int 0\n\n ps = getConnexion().prepareStatement(updateSQL)\n ix = ix + 1; ps.setString(ix, name)\n ix = ix + 1; ps.setInt(ix, score)\n ix = ix + 1; ps.setBoolean(ix, active)\n ix = ix + 1; ps.setInt(ix, jerseyNum)\n rowCt = ps.executeUpdate()\n\n return rowCt\n\n-- =============================================================================\nmethod main(args = String[]) public static\n\n do\n tda = RParameterizedSQLSimple()\n tda.createConnexion()\n\n if tda.getConnexion() \\= null then do\n updated = tda.updatePlayer(99, \"Smith, Steve\", 42, isTrue)\n if updated > 0 then say \"Update successful\"\n else say \"Update failed\"\n\n finally\n tda.shutdownConnexion()\n end\n\n catch ex = Exception\n ex.printStackTrace\n end\n\n return\n\n-- =============================================================================\nmethod isTrue() public static returns boolean\n return 1 == 1\n\n-- =============================================================================\nmethod isFalse() public static returns boolean\n return \\isTrue\n","language":"NetRexx"},{"code":"import db_sqlite\n\nlet db = open(\":memory:\", \"\", \"\", \"\")\n\n# Setup\ndb.exec(sql\"CREATE TABLE players (name, score, active, jerseyNum)\")\ndb.exec(sql\"INSERT INTO players VALUES (?, ?, ?, ?)\", \"name\", 0, \"false\", 99)\n\n# Update the row.\ndb.exec(sql\"UPDATE players SET name=?, score=?, active=? WHERE jerseyNum=?\",\n \"Smith, Steve\", 42, true, 99)\n\n# Display result.\nfor row in db.fastRows(sql\"SELECT * FROM players\"):\n echo row\n\ndb.close()\n","language":"Nim"},{"code":"use IO;\nuse ODBC;\n\nbundle Default {\n class Sql {\n function : Main(args : String[]) ~ Nil {\n conn := Connection->New(\"ds\", \"user\", \"password\");\n if(conn <> Nil) {\n sql := \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\";\n pstmt := conn->CreateParameterStatement(sql);\n pstmt->SetVarchar(1, \"Smith, Steve\");\n pstmt->SetInt(2, 42);\n pstmt->SetBit(3, true);\n pstmt->SetInt(4, 99);\n pstmt->Update()->PrintLine();\n conn->Close();\n };\n }\n}\n","language":"Objeck"},{"code":"program Parametrized_SQL_Statement;\nuses\n sqlite3, sysutils;\n\nconst\n DB_FILE : PChar = ':memory:'; // Create an in-memory database.\n\nvar\n DB :Psqlite3;\n ResultCode :Integer;\n SQL :PChar;\n InsertStatements :array [1..4] of PChar;\n CompiledStatement :Psqlite3_stmt;\n i :integer;\n\n{ CheckError\n\n Checks the result code from an SQLite operation.\n If it contains an error code then this procedure prints the error message,\n closes the database and halts the program. }\n\nprocedure CheckError(ResultCode: integer; DB: Psqlite3);\nbegin\n if ResultCode <> SQLITE_OK then\n begin\n writeln(format('Error #%d: %s', [ResultCode, sqlite3_errmsg(db)]));\n sqlite3_close(DB);\n halt(ResultCode);\n end;\nend;\n\n{ SelectCallback\n\n This callback function prints the results of the select statement.}\n\nfunction SelectCallback(Data: pointer; ColumnCount: longint; Columns: PPChar; ColumnNames: PPChar):longint; cdecl;\nvar\n i :longint;\n col :PPChar;\nbegin\n col := Columns;\n for i:=0 to ColumnCount-1 do\n begin\n write(col^); // Print the current column value.\n inc(col); // Advance the pointer.\n if i<>ColumnCount-1 then write(' | ');\n end;\n writeln;\nend;\n\nbegin\n // Open the database.\n ResultCode := sqlite3_open(DB_FILE, @DB);\n CheckError(ResultCode, DB);\n\n // Create the players table in the database.\n SQL := 'create table players(' +\n 'id integer primary key asc, ' +\n 'name text, ' +\n 'score real, ' +\n 'active integer, ' + // Store the bool value as integer (see https://sqlite.org/datatype3.html chapter 2.1).\n 'jerseyNum integer);';\n ResultCode := sqlite3_exec(DB, SQL, nil, nil, nil);\n CheckError(ResultCode, DB);\n\n // Insert some values into the players table.\n InsertStatements[1] := 'insert into players (name, score, active, jerseyNum) ' +\n 'values (''Roethlisberger, Ben'', 94.1, 1, 7);';\n InsertStatements[2] := 'insert into players (name, score, active, jerseyNum) ' +\n 'values (''Smith, Alex'', 85.3, 1, 11);';\n InsertStatements[3] := 'insert into players (name, score, active, jerseyNum) ' +\n 'values (''Manning, Payton'', 96.5, 0, 18);';\n InsertStatements[4] := 'insert into players (name, score, active, jerseyNum) ' +\n 'values (''Doe, John'', 15, 0, 99);';\n\n for i:=1 to 4 do\n begin\n ResultCode := sqlite3_exec(DB, InsertStatements[i], nil, nil, nil);\n CheckError(ResultCode, DB);\n end;\n\n // Display the contents of the players table.\n writeln('Before update:');\n SQL := 'select * from players;';\n ResultCode := sqlite3_exec(DB, SQL, @SelectCallback, nil, nil);\n CheckError(ResultCode, DB);\n\n // Prepare the parametrized SQL statement to update player #99.\n SQL := 'update players set name=?, score=?, active=? where jerseyNum=?;';\n ResultCode := sqlite3_prepare_v2(DB, SQL, -1, @CompiledStatement, nil);\n CheckError(ResultCode, DB);\n\n // Bind the values to the parameters (see https://sqlite.org/c3ref/bind_blob.html).\n ResultCode := sqlite3_bind_text(CompiledStatement, 1, PChar('Smith, Steve'), -1, nil);\n CheckError(ResultCode, DB);\n ResultCode := sqlite3_bind_double(CompiledStatement, 2, 42);\n CheckError(ResultCode, DB);\n ResultCode := sqlite3_bind_int(CompiledStatement, 3, 1);\n CheckError(ResultCode, DB);\n ResultCode := sqlite3_bind_int(CompiledStatement, 4, 99);\n CheckError(ResultCode, DB);\n\n // Evaluate the prepared SQL statement.\n ResultCode := sqlite3_step(CompiledStatement);\n if ResultCode <> SQLITE_DONE then\n begin\n writeln(format('Error #%d: %s', [ResultCode, sqlite3_errmsg(db)]));\n sqlite3_close(DB);\n halt(ResultCode);\n end;\n\n // Destroy the prepared statement object.\n ResultCode := sqlite3_finalize(CompiledStatement);\n CheckError(ResultCode, DB);\n\n // Display the contents of the players table.\n writeln('After update:');\n SQL := 'select * from players;';\n ResultCode := sqlite3_exec(DB, SQL, @SelectCallback, nil, nil);\n CheckError(ResultCode, DB);\n\n // Close the database connection.\n sqlite3_close(db);\nend.\n","language":"Pascal"},{"code":"use DBI;\n\nmy $db = DBI->connect('DBI:mysql:mydatabase:host','login','password');\n\n$statment = $db->prepare(\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\");\n\n$rows_affected = $statment->execute(\"Smith, Steve\",42,'true',99);\n","language":"Perl"},{"code":"(notonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Parameterized_SQL_statement.exw\n -- ============================================\n -- </span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (pSQLite)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pSQLite</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #000080;font-style:italic;\">--<some pretty printing, not really part of the demo></span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">coltypes</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">colfmts</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">colrids</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">columnize</span><span style=\"color: #0000FF;\">({</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">SQLITE_INTEGER</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%4d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sqlite3_column_int</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">SQLITE_FLOAT</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%4g\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sqlite3_column_double</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">SQLITE_TEXT</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%-20s\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sqlite3_column_text</span><span style=\"color: #0000FF;\">}})</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">show</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">what</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sqlite3</span> <span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s:\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">what</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">sqlite3_stmt</span> <span style=\"color: #000000;\">pStmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_prepare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"SELECT * FROM players;\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_step</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">SQLITE_DONE</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">SQLITE_ROW</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">sqlite3_column_count</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ctype</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_column_type</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ctype</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">coltypes</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">rid</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">colrids</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">cdx</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">name</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_column_name</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">data</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">colfmts</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">cdx</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">text</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\" %s:%s\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">text</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_finalize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000080;font-style:italic;\">--</pretty printing></span>\n\n <span style=\"color: #000000;\">sqlite3</span> <span style=\"color: #000000;\">db</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\":memory:\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`create table players (name, score, active, jerseyNum)`</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`insert into players values ('Roethlisberger, Ben', 94.1, 1, 7 )`</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`insert into players values ('Smith, Alex', 85.3, 1, 11)`</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`insert into players values ('Doe, John', 15, 0, 99)`</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_exec</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`insert into players values ('Manning, Payton', 96.5, 0, 123)`</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">show</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Before\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">--pp({\"Before\",sqlite3_get_table(db, \"select * from players\")},{pp_Nest,2})\n\n -- For comparison against some other entries, this is how you would do numbered parameters:\n --/*\n sqlite3_stmt pStmt = sqlite3_prepare(db, `update players set name=?, score=?, active=? where jerseyNum=?`)\n sqlite3_bind_text(pStmt,1,\"Smith, Steve\")\n sqlite3_bind_double(pStmt,2,42)\n sqlite3_bind_int(pStmt,3,true)\n sqlite3_bind_int(pStmt,4,99)\n --*/\n -- However, ordinarily I would prefer named parameters and sqlbind_parameter_index() calls:</span>\n <span style=\"color: #000000;\">sqlite3_stmt</span> <span style=\"color: #000000;\">pStmt</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_prepare</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">`update players set name=:name, score=:score, active=:active where jerseyNum=:jerseyn`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">k_name</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_bind_parameter_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\":name\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k_score</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_bind_parameter_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\":score\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k_active</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_bind_parameter_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\":active\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">k_jerseyn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">sqlite3_bind_parameter_index</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\":jerseyn\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sqlite3_bind_text</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k_name</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Smith, Steve\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sqlite3_bind_double</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k_score</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">42</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sqlite3_bind_int</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k_active</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">sqlite3_bind_int</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">k_jerseyn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">99</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_step</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_DONE</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">sqlite3_finalize</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pStmt</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">SQLITE_OK</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">show</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"After\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">--pp({\"After\",sqlite3_get_table(db, \"select * from players\")},{pp_Nest,2})</span>\n\n <span style=\"color: #000000;\">sqlite3_close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">db</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"$updatePlayers = \"UPDATE `players` SET `name` = ?, `score` = ?, `active` = ?\\n\".\n\t\t\"WHERE `jerseyNum` = ?\";\n$dbh = new PDO( \"mysql:dbname=db;host=localhost\", \"username\", \"password\" );\n\n$updateStatement = $dbh->prepare( $updatePlayers );\n\n$updateStatement->bindValue( 1, \"Smith, Steve\", PDO::PARAM_STR );\n$updateStatement->bindValue( 2, 42, PDO::PARAM_INT );\n$updateStatement->bindValue( 3, 1, PDO::PARAM_INT );\n$updateStatement->bindValue( 4, 99, PDO::PARAM_INT );\n\n$updateStatement->execute();\n\n// alternatively pass parameters as an array to the execute method\n$updateStatement = $dbh->prepare( $updatePlayers );\n$updateStatement->execute( array( \"Smith, Steve\", 42, 1, 99 ) );\n","language":"PHP"},{"code":"(for P (collect 'jerseyNum '+Players 99)\n (put!> P 'name \"Smith, Steve\")\n (put!> P 'score 42)\n (put!> P 'active T) )\n","language":"PicoLisp"},{"code":"UseSQLiteDatabase()\n\nProcedure CheckDatabaseUpdate(database, query$)\n result = DatabaseUpdate(database, query$)\n If result = 0\n PrintN(DatabaseError())\n EndIf\n\n ProcedureReturn result\nEndProcedure\n\nIf OpenConsole()\n If OpenDatabase(0, \":memory:\", \"\", \"\")\n ;create players table with sample data\n CheckDatabaseUpdate(0, \"CREATE table players (name, score, active, jerseyNum)\")\n CheckDatabaseUpdate(0, \"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\")\n CheckDatabaseUpdate(0, \"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\")\n CheckDatabaseUpdate(0, \"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\")\n\n Define name$, score, active$, jerseynum\n name$ = \"Smith, Steve\"\n score = 42\n active$ =\"TRUE\"\n jerseynum = 99\n SetDatabaseString(0, 0, name$)\n SetDatabaseLong(0, 1, score)\n SetDatabaseString(0, 2, active$)\n SetDatabaseLong(0, 3, jerseynum)\n CheckDatabaseUpdate(0, \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\")\n\n ;display database contents\n If DatabaseQuery(0, \"Select * from players\")\n While NextDatabaseRow(0)\n name$ = GetDatabaseString(0, 0)\n score = GetDatabaseLong(0, 1)\n active$ = GetDatabaseString(0, 2)\n jerseynum = GetDatabaseLong(0, 3)\n row$ = \"['\" + name$ + \"', \" + score + \", '\" + active$ + \"', \" + jerseynum + \"]\"\n PrintN(row$)\n Wend\n\n FinishDatabaseQuery(0)\n EndIf\n\n CloseDatabase(0)\n Else\n PrintN(\"Can't open database !\")\n EndIf\n\n Print(#CRLF$ + #CRLF$ + \"Press ENTER to exit\"): Input()\n CloseConsole()\nEndIf\n","language":"PureBasic"},{"code":"import sqlite3\n\ndb = sqlite3.connect(':memory:')\n\n# setup\ndb.execute('create temp table players (name, score, active, jerseyNum)')\ndb.execute('insert into players values (\"name\",0,\"false\",99)')\ndb.execute('insert into players values (\"name\",0,\"false\",100)')\n\n# demonstrate parameterized SQL\n\n# example 1 -- simple placeholders\ndb.execute('update players set name=?, score=?, active=? where jerseyNum=?', ('Smith, Steve', 42, True, 99))\n\n# example 2 -- named placeholders\ndb.execute('update players set name=:name, score=:score, active=:active where jerseyNum=:num',\n {'num': 100,\n 'name': 'John Doe',\n 'active': False,\n 'score': -1}\n)\n\n# and show the results\nfor row in db.execute('select * from players'):\n print(row)\n","language":"Python"},{"code":"#lang racket/base\n(require sql db)\n\n(define pgc\n ; Don't actually inline sensitive data ;)\n (postgresql-connect #:user \"resu\"\n #:database \"esabatad\"\n #:server \"example.com\"\n #:port 5432\n #:password \"s3>r37P455\"))\n\n(define update-player\n (parameterize ((current-sql-dialect 'postgresql))\n (update players\n #:set [name ?] [score ?] [active ?]\n #:where [jerseyNum ?])))\n\n(apply query\n pgc\n update-player\n '(\"Smith, Steve\" 42 #t 99))\n","language":"Racket"},{"code":"use DBIish;\n\nmy $db = DBIish.connect('DBI:mysql:mydatabase:host','login','password');\n\nmy $update = $db.prepare(\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\");\n\nmy $rows-affected = $update.execute(\"Smith, Steve\",42,'true',99);\n","language":"Raku"},{"code":"require 'sqlite3'\n\ndb = SQLite3::Database.new(\":memory:\")\n\n# setup\ndb.execute('create temp table players (name, score, active, jerseyNum)')\ndb.execute('insert into players values (\"name\",0,\"false\",99)')\ndb.execute('insert into players values (\"name\",0,\"false\",100)')\ndb.execute('insert into players values (\"name\",0,\"false\",101)')\n\n# demonstrate parameterized SQL\n\n# example 1 -- simple placeholders\ndb.execute('update players set name=?, score=?, active=? where jerseyNum=?', 'Smith, Steve', 42, true, 99)\n\n# example 2 -- named placeholders\ndb.execute('update players set name=:name, score=:score, active=:active where jerseyNum=:num',\n :num => 100,\n :name => 'John Doe',\n :active => false,\n :score => -1\n)\n\n# example 3 -- numbered placeholders\nstmt = db.prepare('update players set name=?4, score=?3, active=?2 where jerseyNum=?1')\nstmt.bind_param(1, 101)\nstmt.bind_param(2, true)\nstmt.bind_param(3, 3)\nstmt.bind_param(4, \"Robert'; DROP TABLE players--\")\nstmt.execute\n\n# and show the results\ndb.execute2('select * from players') {|row| p row}\n","language":"Ruby"},{"code":"sqliteconnect #mem, \":memory:\"\n#mem execute(\"CREATE table players (name, score, active, jerseyNum)\")\n#mem execute(\"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\")\n#mem execute(\"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\")\n#mem execute(\"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\")\nsql$ = \"\nUPDATE players\n SET name = 'Smith, Steve',\n score = 42,\n active = 'TRUE'\n WHERE jerseyNum = 99\"\n#mem execute(sql$)\n#mem execute(\"SELECT * FROM players ORDER BY jerseyNum\")\nWHILE #mem hasanswer()\n\t#row = #mem #nextrow()\n\tname$ = #row name$()\n\tscore = #row score()\n\tactive$ = #row active$()\n\tjerseyNum = #row jerseyNum()\n\t\nprint name$;chr$(9);score;chr$(9);active$;chr$(9);jerseyNum\nWEND\nend\n","language":"Run-BASIC"},{"code":"import slick.jdbc.H2Profile.api._\nimport slick.sql.SqlProfile.ColumnOption.SqlType\n\nimport scala.concurrent.Await\nimport scala.concurrent.ExecutionContext.Implicits.global\nimport scala.concurrent.duration.Duration\n\nobject PlayersApp extends App {\n lazy val playerRecords = TableQuery[PlayerRecords]\n val db = Database.forURL(\"jdbc:h2:mem:test1;DB_CLOSE_DELAY=-1\", driver = \"org.h2.Driver\")\n // Pre-compiled parameterized statement\n val compiledUpdate = Compiled { jerseyN: Rep[Int] =>\n for {c <- playerRecords if c.jerseyNum === jerseyN} yield (c.name, c.score, c.active)\n }\n\n def setup = DBIO.seq(\n playerRecords.schema.create,\n playerRecords ++= Seq( // JDBC batch update\n (7, \"Roethlisberger, Ben\", 94.1f, true),\n (11, \"Smith, Alex\", 85.3f, true),\n (18, \"Manning, Payton\", 96.5f, false),\n (99, \"Doe, John\", 15f, false))\n )\n\n def queryPlayers(prelude: String) = {\n println(\"\\n \" +prelude)\n println(\n \"│ Name │Scor│ Active │Jerseynum│\\n\" +\n \"├───────────────────────────────┼────┼────────┼─────────┤\"\n )\n DBIO.seq(playerRecords.result.map(_.map {\n case (jerseyN, name, score, active) =>\n f\"$name%32s $score ${(if (active) \"\" else \"in\") + \"active\"}%8s $jerseyN%8d\"\n }.foreach(println)))\n }\n\n // Definition of the PLAYERS table\n class PlayerRecords(tag: Tag) extends Table[(Int, String, Float, Boolean)](tag, \"PLAYER_RECORDS\") {\n def active = column[Boolean](\"ACTIVE\")\n def jerseyNum = column[Int](\"JERSEY_NUM\", O.PrimaryKey)\n def name = column[String](\"NAME\", SqlType(\"VARCHAR2(32)\"))\n def score = column[Float](\"SCORE\")\n\n def * = (jerseyNum, name, score, active)\n }\n\n println(s\"The pre-compiled parameterized update DML:\\n${compiledUpdate(0).updateStatement}\")\n\n Await.result(db.run(\n for { // Using the for comprehension\n _ <- setup\n _ <- queryPlayers(\"Before update:\")\n n <- compiledUpdate(99).update(\"Smith, Steve\", 42f, true)\n _ <- queryPlayers(\"After update:\")\n } yield n), Duration.Inf)\n\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n include \"sql_base.s7i\";\n\nconst proc: main is func\n local\n var database: testDb is database.value;\n var sqlStatement: statement is sqlStatement.value;\n var string: name is \"Smith, Steve\";\n begin\n testDb := openDatabase(DB_SQLITE, \"test\", \"test\", \"test\");\n execute(testDb, \"create table players (name CHAR(32), score INTEGER, active CHAR, jerseyNum INTEGER)\");\n execute(testDb, \"insert into players values ('Jones, Bob',0,0,99)\");\n execute(testDb, \"insert into players values ('Jesten, Jim',0,0,100)\");\n execute(testDb, \"insert into players values ('Jello, Frank',0,0,101)\");\n statement := prepare(testDb, \"update players set name = ?, score = ?, active = ? \\\n \\where jerseyNum = ?\");\n bind(statement, 1, name);\n bind(statement, 2, 42);\n bind(statement, 3, TRUE);\n bind(statement, 4, 99);\n execute(statement);\n statement := prepare(testDb, \"select * from players\");\n execute(statement);\n while fetch(statement) do\n writeln(column(statement, 1, string) <& \" \" <&\n column(statement, 2, integer) <& \" \" <&\n column(statement, 3, boolean) <& \" \" <&\n column(statement, 4, integer));\n end while;\n execute(testDb, \"drop table players\");\n close(testDb);\n end func;\n","language":"Seed7"},{"code":"-- This works in Oracle's SQL*Plus command line utility\n\nVARIABLE P_NAME VARCHAR2(20);\nVARIABLE P_SCORE NUMBER;\nVARIABLE P_ACTIVE VARCHAR2(5);\nVARIABLE P_JERSEYNUM NUMBER;\n\nbegin\n\n:P_NAME := 'Smith, Steve';\n:P_SCORE := 42;\n:P_ACTIVE := 'TRUE';\n:P_JERSEYNUM := 99;\n\nend;\n/\n\ndrop table players;\n\ncreate table players\n(\nNAME VARCHAR2(20),\nSCORE NUMBER,\nACTIVE VARCHAR2(5),\nJERSEYNUM NUMBER\n);\n\ninsert into players values ('No name',0,'FALSE',99);\n\ncommit;\n\nselect * from players;\n\nUPDATE players\n SET name = :P_NAME, score = :P_SCORE, active = :P_ACTIVE\n WHERE jerseyNum = :P_JERSEYNUM;\n\ncommit;\n\nselect * from players;\n","language":"SQL"},{"code":"--#SET TERMINATOR @\n\nCREATE TABLE PLAYERS (\n NAME VARCHAR(32),\n SCORE INT,\n ACTIVE SMALLINT,\n JERSEYNUM INT\n) @\n\nCREATE PROCEDURE UPDATE_PLAYER (\n IN PLAYER_NAME VARCHAR(32),\n IN PLAYER_SCORE INT,\n IN PLAYER_ACTIVE SMALLINT,\n IN JERSEY_NUMBER INT\n )\n BEGIN\n UPDATE PLAYERS\n SET NAME = PLAYER_NAME, SCORE = PLAYER_SCORE, ACTIVE = PLAYER_ACTIVE\n WHERE JERSEYNUM = JERSEY_NUMBER;\n END @\n\nINSERT INTO PLAYERS VALUES ('Pele', '1280', 0, 10) @\n\nCALL UPDATE_PLAYER ('Maradona', '600', 1, 10) @\n\nSELECT * FROM PLAYERS @\n","language":"SQL-PL"},{"code":"package require Tcl 8.6\n\n# These next two lines are the only ones specific to SQLite\npackage require tdbc::sqlite3\nset db [tdbc::sqlite3::connection new /path/to/database.sql]\n\n# Use a helper procedure to make a scope\nproc setPlayer {db jersey -> playerName playerScore playerActive} {\n # Note that the '->' above is just syntactic noise for readability\n $db allrows {\n\tUPDATE players\n\tSET name = :playerName, score = :playerScore, active = :playerActive\n\tWHERE jerseyNum = :jersey\n }\n # The named parameters are bound to local variables by default\n}\n\n# How to use...\nsetPlayer $db 99 -> \"Smith, Steve\" 42 true\n# With apologies to http://xkcd.com/327/\nsetPlayer $db 76 -> \"Robert'; DROP TABLE players--\" 0 false\n$db close\n","language":"Tcl"},{"code":"import \"./sql\" for Connection\n\nvar db = Connection.open(\"rc.db\")\n\nvar createSql = [\n \"DROP TABLE IF EXISTS players\",\n \"CREATE table players (name, score, active, jerseyNum)\",\n \"INSERT INTO players VALUES ('Roethlisberger, Ben', 94.1, TRUE, 7)\",\n \"INSERT INTO players VALUES ('Smith, Alex', 85.3, TRUE, 11)\",\n \"INSERT INTO players VALUES ('Doe, John', 15, FALSE, 99)\",\n \"INSERT INTO players VALUES ('Manning, Payton', 96.5, FALSE, 123)\"\n]\n\nfor (sql in createSql) db.exec(sql)\n\nvar widths = [22, 7, 7, 9]\nSystem.print(\"Before update:\\n\")\ndb.printTable(\"SELECT * FROM players\", widths)\n\nvar updateSql = \"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = 99\"\nvar ps = db.prepare(updateSql)\nps.bindText(1, \"Smith, Steve\")\nps.bindDouble(2, 42)\nps.bindBool(3, true)\nps.bindInt(4, 99)\nps.step()\n\nSystem.print(\"\\nAfter update:\\n\")\ndb.printTable(\"SELECT * FROM players\", widths)\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Parameterized_SQL_statement\\nnote: Database operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Parameterized SQL statements are an easy way to avoid [[wp:SQL injection|SQL injection]] attacks. SQL drivers and libraries will automatically \\\"sanitize\\\" input to parameterized SQL statements to avoid these catastrophic database attacks. Second, parameterized SQL performs better. A lot better.\\n\\nUsing a SQL update statement like this one (spacing is optional):\\n<syntaxhighlight lang=\\\"sql\\\">UPDATE players\\n SET name = 'Smith, Steve', score = 42, active = true\\n WHERE jerseyNum = 99</syntaxhighlight>show how to make a parameterized SQL statement, set the parameters to the values given above, and execute the statement.\\n\\n<blockquote cite=\\\"http://blog.codinghorror.com/give-me-parameterized-sql-or-give-me-death/\\\">Non-parameterized SQL is the GoTo statement of database programming. Don't do it, and make sure your coworkers don't either.</blockquote>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"\\\\ assuming the var 'db' contains an opened database with a schema matching the problem:\\ndb @\\n\\\"UPDATE players SET name=?1,score=?2,active=?3 WHERE jerseyNum=?4\\\"\\ndb:prepare var, stmt\\n\\n\\\\ bind values to the statement:\\nstmt @ 1 \\\"Smith, Steve\\\" db:bind\\n 2 42 db:bind\\n 3 true db:bind\\n 4 99 db:bind\\n\\n\\\\ execute the query\\ndb @ swap db:exec\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"-- Version for sqlite\\nwith GNATCOLL.SQL_Impl; use GNATCOLL.SQL_Impl;\\nwith GNATCOLL.SQL.Exec; use GNATCOLL.SQL.Exec;\\nwith GNATCOLL.SQL.Sqlite; use GNATCOLL.SQL;\\n\\nprocedure Prepared_Query is\\n\\n DB_Descr : Database_Description;\\n Conn : Database_Connection;\\n Query : Prepared_Statement;\\n --sqlite does not support boolean fields\\n True_Str : aliased String := \\\"TRUE\\\";\\n Param : SQL_Parameters (1 .. 4) :=\\n (1 => (Parameter_Text, null),\\n 2 => (Parameter_Integer, 0),\\n 3 => (Parameter_Text, null),\\n 4 => (Parameter_Integer, 0));\\nbegin\\n -- Allocate and initialize the description of the connection\\n Setup_Database (DB_Descr, \\\"rosetta.db\\\", \\\"\\\", \\\"\\\", \\\"\\\", DBMS_Sqlite);\\n -- Allocate the connection\\n Conn := Sqlite.Build_Sqlite_Connection (DB_Descr);\\n -- Initialize the connection\\n Reset_Connection (DB_Descr, Conn);\\n Query :=\\n Prepare\\n (\\\"UPDATE players SET name = ?, score = ?, active = ? \\\" &\\n \\\" WHERE jerseyNum = ?\\\");\\n declare\\n Name : aliased String := \\\"Smith, Steve\\\";\\n begin\\n Param := (\\\"+\\\" (Name'Access), \\\"+\\\" (42), \\\"+\\\" (True_Str'Access), \\\"+\\\" (99));\\n Execute (Conn, Query, Param);\\n end;\\n Commit_Or_Rollback (Conn);\\n Free (Conn);\\n Free (DB_Descr);\\nend Prepared_Query;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"; Helper functions\\n\\ncreateTable: function [][\\n query db {!sql DROP TABLE IF EXISTS users}\\n query db {!sql\\n CREATE TABLE users (\\n ID INTEGER PRIMARY KEY AUTOINCREMENT,\\n username TEXT NOT NULL,\\n email TEXT NOT NULL,\\n age INTEGER\\n )\\n }\\n]\\n\\naddUser: function [name, email, age][\\n query.id db .with:@[name,email,age] {!sql\\n INSERT INTO users (username, email, age)\\n VALUES (?,?,?)\\n }\\n]\\n\\nfindUser: function [name][\\n query db .with:@[name] ~{!sql\\n SELECT *\\n FROM users\\n WHERE username=?\\n }\\n]\\n\\ndb: open.sqlite \\\"users.db\\\"\\n\\ncreateTable\\n\\nprint [\\\"added user with id:\\\" addUser \\\"JohnDoe\\\" \\\"jodoe@gmail.com\\\" 35]\\nprint [\\\"added user with id:\\\" addUser \\\"JaneDoe\\\" \\\"jadoe@gmail.com\\\" 14]\\n\\nprint [\\\"getting user with name: JohnDoe =>\\\" findUser \\\"JohnDoe\\\"]\\n\\nclose db\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# open database file\\ndbopen \\\"players.sqlite3\\\"\\n\\n# delete old players table - trap error if new database\\nonerror errortrap\\n# delete old database if it exists\\ndbexecute \\\"DROP TABLE IF EXISTS players;\\\"\\n\\n# create database table with sample data\\n# include the IF NOT EXISTS clause to avoid an error if the table already exists.\\ndbexecute \\\"CREATE TABLE IF NOT EXISTS players (name TEXT NOT NULL, score INTEGER, active BIT, jerseyNum INTEGER);\\\"\\ndbexecute \\\"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\\\"\\ndbexecute \\\"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\\\"\\ndbexecute \\\"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\\\"\\n\\ndbexecute \\\"UPDATE players SET name = 'Smith, Steve', score = 42, active = 'TRUE' WHERE jerseyNum = 99;\\\"\\n\\ndbopenset \\\"SELECT * FROM players;\\\"\\nwhile dbrow()\\n\\tprint \\\"['\\\" + dbstring(0) + \\\", '\\\" + dbstring(1) + \\\", '\\\" + dbstring(2) + \\\"', \\\" + dbstring(3) + \\\"]\\\"\\nend while\\ndbcloseset\\n\\nofferror\\n# wrap everything up\\ndbclose\\nend\\n\\nerrortrap:\\n# accept error - display nothing - return to next statement\\nreturn\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <sqlite3.h>\\n\\nstatic const char* db_file = \\\":memory:\\\"; // Create an in-memory database.\\n\\nvoid check_error(int result_code, sqlite3 *db);\\nint select_callback(void* data, int column_count, char** columns, char** column_names);\\n\\nint main(void) {\\n sqlite3 *db;\\n int result_code;\\n char *sql;\\n char *insert_statements[4];\\n sqlite3_stmt *compiled_statement;\\n int i;\\n\\n // Open the database.\\n result_code = sqlite3_open(db_file, &db);\\n check_error(result_code, db);\\n\\n // Create the players table in the database.\\n sql = \\\"create table players(\\\"\\n \\\"id integer primary key asc, \\\"\\n \\\"name text, \\\"\\n \\\"score real, \\\"\\n \\\"active integer, \\\" // Store the bool value as integer (see https://sqlite.org/datatype3.html chapter 2.1).\\n \\\"jerseyNum integer);\\\";\\n result_code = sqlite3_exec(db, sql, NULL, NULL, NULL);\\n check_error(result_code, db);\\n\\n // Insert some values into the players table.\\n insert_statements[0] = \\\"insert into players (name, score, active, jerseyNum) \\\"\\n \\\"values ('Roethlisberger, Ben', 94.1, 1, 7);\\\";\\n insert_statements[1] = \\\"insert into players (name, score, active, jerseyNum) \\\"\\n \\\"values ('Smith, Alex', 85.3, 1, 11);\\\";\\n insert_statements[2] = \\\"insert into players (name, score, active, jerseyNum) \\\"\\n \\\"values ('Manning, Payton', 96.5, 0, 18);\\\";\\n insert_statements[3] = \\\"insert into players (name, score, active, jerseyNum) \\\"\\n \\\"values ('Doe, John', 15, 0, 99);\\\";\\n\\n for (i=0; i<4; i++) {\\n result_code = sqlite3_exec(db, insert_statements[i], NULL, NULL, NULL);\\n check_error(result_code, db);\\n }\\n\\n // Display the contents of the players table.\\n printf(\\\"Before update:\\\\n\\\");\\n sql = \\\"select * from players;\\\";\\n result_code = sqlite3_exec(db, sql, select_callback, NULL, NULL);\\n check_error(result_code, db);\\n\\n // Prepare the parametrized SQL statement to update player #99.\\n sql = \\\"update players set name=?, score=?, active=? where jerseyNum=?;\\\";\\n result_code = sqlite3_prepare_v2(db, sql, -1, &compiled_statement, NULL);\\n check_error(result_code, db);\\n\\n // Bind the values to the parameters (see https://sqlite.org/c3ref/bind_blob.html).\\n result_code = sqlite3_bind_text(compiled_statement, 1, \\\"Smith, Steve\\\", -1, NULL);\\n check_error(result_code, db);\\n result_code = sqlite3_bind_double(compiled_statement, 2, 42);\\n check_error(result_code, db);\\n result_code = sqlite3_bind_int(compiled_statement, 3, 1);\\n check_error(result_code, db);\\n result_code = sqlite3_bind_int(compiled_statement, 4, 99);\\n check_error(result_code, db);\\n\\n // Evaluate the prepared SQL statement.\\n result_code = sqlite3_step(compiled_statement);\\n if (result_code != SQLITE_DONE) {\\n printf(\\\"Error #%d: %s\\\\n\\\", result_code, sqlite3_errmsg(db));\\n sqlite3_close(db);\\n return result_code;\\n }\\n\\n // Destroy the prepared statement object.\\n result_code = sqlite3_finalize(compiled_statement);\\n check_error(result_code, db);\\n\\n // Display the contents of the players table.\\n printf(\\\"After update:\\\\n\\\");\\n sql = \\\"select * from players;\\\";\\n result_code = sqlite3_exec(db, sql, select_callback, NULL, NULL);\\n check_error(result_code, db);\\n\\n // Close the database connection.\\n sqlite3_close(db);\\n\\n return EXIT_SUCCESS;\\n}\\n\\n/*\\n Checks the result code from an SQLite operation.\\n If it contains an error code then this function prints the error message,\\n closes the database and exits.\\n*/\\nvoid check_error(int result_code, sqlite3 *db) {\\n if (result_code != SQLITE_OK) {\\n printf(\\\"Error #%d: %s\\\\n\\\", result_code, sqlite3_errmsg(db));\\n sqlite3_close(db);\\n exit(result_code);\\n }\\n}\\n\\n/* This callback function prints the results of the select statement. */\\nint select_callback(void* data, int column_count, char** columns, char** column_names) {\\n int i;\\n\\n for (i=0; i<column_count; i++) {\\n printf(columns[i]);\\n if (i < column_count-1) printf(\\\" | \\\");\\n }\\n printf(\\\"\\\\n\\\");\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <QtSql>\\n#include <iostream>\\n\\n// Command line arguments: data-source user password\\n// Obviously in a real application the password would be obtained in a secure manner.\\n\\nint main(int argc, char *argv[]) {\\n if (argc != 4) {\\n std::cerr << \\\"Usage: \\\" << argv[0] << \\\" data-source user password\\\\n\\\";\\n return 1;\\n }\\n QSqlDatabase db = QSqlDatabase::addDatabase(\\\"QODBC\\\");\\n db.setDatabaseName(argv[1]);\\n if (!db.open(argv[2], argv[3])) {\\n auto error = db.lastError();\\n std::cerr << \\\"Cannot connect to data source: \\\" << error.text().toStdString() << '\\\\n';\\n } else {\\n std::cout << \\\"Connected to data source.\\\\n\\\";\\n QSqlQuery query(db);\\n query.prepare(\\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\");\\n query.bindValue(0, \\\"Smith, Steve\\\");\\n query.bindValue(1, 42);\\n query.bindValue(2, true);\\n query.bindValue(3, 99);\\n if (!query.exec()) {\\n auto error = db.lastError();\\n std::cerr << \\\"Cannot update database: \\\" << error.text().toStdString() << '\\\\n';\\n } else {\\n std::cout << \\\"Update succeeded.\\\\n\\\";\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System.Data.Sql;\\nusing System.Data.SqlClient;\\n\\nnamespace ConsoleApplication1\\n{\\n class Program\\n {\\n static void Main(string[] args)\\n {\\n using var tConn = new SqlConnection(\\\"ConnectionString\\\");\\n\\n using var tCommand = tConn.CreateCommand();\\n tCommand.CommandText = \\\"UPDATE players SET name = @name, score = @score, active = @active WHERE jerseyNum = @jerseyNum\\\";\\n\\n tCommand.Parameters.Add(new SqlParameter(\\\"@name\\\", System.Data.SqlDbType.VarChar).Value = \\\"Smith, Steve\\\");\\n tCommand.Parameters.Add(new SqlParameter(\\\"@score\\\", System.Data.SqlDbType.Int).Value = \\\"42\\\");\\n tCommand.Parameters.Add(new SqlParameter(\\\"@active\\\", System.Data.SqlDbType.Bit).Value = true);\\n tCommand.Parameters.Add(new SqlParameter(\\\"@jerseyNum\\\", System.Data.SqlDbType.Int).Value = \\\"99\\\");\\n\\n tCommand.ExecuteNonQuery();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(require '[clojure.java.jdbc :as sql])\\n; Using h2database for this simple example.\\n(def db {:classname \\\"org.h2.Driver\\\"\\n :subprotocol \\\"h2:file\\\"\\n :subname \\\"db/my-dbname\\\"})\\n\\n(sql/update! db :players {:name \\\"Smith, Steve\\\" :score 42 :active true} [\\\"jerseyNum = ?\\\" 99])\\n\\n; As an alternative to update!, use execute!\\n(sql/execute! db [\\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\" \\\"Smith, Steve\\\" 42 true 99])\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"open System.Data.SqlClient\\n\\n[<EntryPoint>]\\nlet main argv =\\n use tConn = new SqlConnection(\\\"ConnectionString\\\")\\n\\n use tCommand = new SqlCommand()\\n tCommand.Connection <- tConn\\n tCommand.CommandText <- \\\"UPDATE players SET name = @name, score = @score, active = @active WHERE jerseyNum = @jerseyNum\\\"\\n\\n tCommand.Parameters.Add(SqlParameter(\\\"@name\\\", System.Data.SqlDbType.VarChar).Value = box \\\"Smith, Steve\\\") |> ignore\\n tCommand.Parameters.Add(SqlParameter(\\\"@score\\\", System.Data.SqlDbType.Int).Value = box 42) |> ignore\\n tCommand.Parameters.Add(SqlParameter(\\\"@active\\\", System.Data.SqlDbType.Bit).Value = box true) |> ignore\\n tCommand.Parameters.Add(SqlParameter(\\\"@jerseyNum\\\", System.Data.SqlDbType.Int).Value = box 99) |> ignore\\n\\n tCommand.ExecuteNonQuery() |> ignore\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"#include once \\\"sqlite3.bi\\\"\\n#define NULL 0\\n\\nDim As sqlite3 Ptr db\\nDim As sqlite3_stmt Ptr stmt\\nDim As Integer rc\\n\\n' Open database file\\nrc = sqlite3_open(\\\"players.sqlite3\\\", @db)\\n\\nIf rc <> SQLITE_OK Then\\n Print \\\"No se puede abrir la base de datos: \\\"; *sqlite3_errmsg(db)\\n sqlite3_close(db)\\n End 1\\nEnd If\\n\\n' Delete old database if it exists\\nsqlite3_exec(db, \\\"DROP TABLE IF EXISTS players;\\\", NULL, NULL, NULL)\\n\\n' Create database table with sample data\\nsqlite3_exec(db, \\\"CREATE TABLE IF NOT EXISTS players (name TEXT NOT NULL, score INTEGER, active BIT, jerseyNum INTEGER);\\\", NULL, NULL, NULL)\\nsqlite3_exec(db, \\\"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\\\", NULL, NULL, NULL)\\nsqlite3_exec(db, \\\"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\\\", NULL, NULL, NULL)\\nsqlite3_exec(db, \\\"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\\\", NULL, NULL, NULL)\\n\\n' Update name and score of player with jersey number 99\\nsqlite3_exec(db, \\\"UPDATE players SET name = 'Smith, Steve', score = 42, active = 'TRUE' WHERE jerseyNum = 99;\\\", NULL, NULL, NULL)\\n\\n' Query and display all player table records\\nDim As sqlite3_stmt Ptr stmt2\\nDim As String query3 = \\\"SELECT * FROM players\\\"\\nrc = sqlite3_prepare_v2(db, Strptr(query3), -1, @stmt2, 0)\\n\\nWhile sqlite3_step(stmt2) = SQLITE_ROW\\n Print \\\"['\\\"; *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 0)); \\\"', \\\";\\n Print *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 1)); \\\", \\\";\\n Print *Cptr(ZString Ptr, sqlite3_column_text(stmt2, 2)); \\\", \\\";\\n Print sqlite3_column_int(stmt2, 3); \\\"]\\\"\\nWend\\n\\n' Close the database\\nsqlite3_finalize(stmt2)\\nsqlite3_close(db)\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"database/sql\\\"\\n \\\"fmt\\\"\\n\\n _ \\\"github.com/mattn/go-sqlite3\\\"\\n)\\n\\nfunc main() {\\n db, _ := sql.Open(\\\"sqlite3\\\", \\\"rc.db\\\")\\n defer db.Close()\\n db.Exec(`create table players (name, score, active, jerseyNum)`)\\n db.Exec(`insert into players values (\\\"\\\",0,0,\\\"99\\\")`)\\n db.Exec(`insert into players values (\\\"\\\",0,0,\\\"100\\\")`)\\n\\n // Parameterized\\n db.Exec(`update players set name=?, score=?, active=? where jerseyNum=?`,\\n \\\"Smith, Steve\\\", 42, true, \\\"99\\\")\\n\\n rows, _ := db.Query(\\\"select * from players\\\")\\n var (\\n name string\\n score int\\n active bool\\n jerseyNum string\\n )\\n for rows.Next() {\\n rows.Scan(&name, &score, &active, &jerseyNum)\\n fmt.Printf(\\\"%3s %12s %3d %t\\\\n\\\", jerseyNum, name, score, active)\\n }\\n rows.Close()\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"module Main (main) where\\n\\nimport Database.HDBC (IConnection, commit, run, toSql)\\n\\nupdatePlayers :: IConnection a => a -> String -> Int -> Bool -> Int -> IO Bool\\nupdatePlayers conn name score active jerseyNum = do\\n rowCount <- run conn\\n \\\"UPDATE players\\\\\\n \\\\ SET name = ?, score = ?, active = ?\\\\\\n \\\\ WHERE jerseyNum = ?\\\"\\n [ toSql name\\n , toSql score\\n , toSql active\\n , toSql jerseyNum\\n ]\\n commit conn\\n return $ rowCount == 1\\n\\nmain :: IO ()\\nmain = undefined\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Database as db;\\nimport Algorithms as algo;\\nimport FileSystem as fs;\\n\\nmain() {\\n dbPath = \\\"/tmp/parametrized-sql.sqlite\\\";\\n fs.remove( dbPath );\\n fs.open( dbPath, fs.OPEN_MODE.WRITE );\\n conn = db.connect( \\\"sqlite3:///\\\" + dbPath );\\n\\n // Setup...\\n conn.query(\\n \\\"CREATE TABLE Players (\\\\n\\\"\\n \\\"\\\\tname VARCHAR(64),\\\\n\\\"\\n \\\"\\\\tscore FLOAT,\\\\n\\\"\\n \\\"\\\\tactive INTEGER,\\\\n\\\"\\n \\\"\\\\tno VARCHAR(8)\\\\n\\\"\\n \\\");\\\"\\n ).execute();\\n conn.query(\\n \\\"INSERT INTO Players VALUES ( 'name', 0, 'false', 99 );\\\"\\n ).execute();\\n conn.query(\\n \\\"INSERT INTO Players VALUES ( 'name', 0, 'false', 100 );\\\"\\n ).execute();\\n\\n // Demonstrate parameterized SQL...\\n parametrizedQuery = conn.query(\\n \\\"UPDATE Players SET name=?, score=?, active=? WHERE no=?\\\"\\n );\\n for ( i, v : algo.enumerate( ( \\\"Smith, Steve\\\", 42, true, 99 ) ) ) {\\n parametrizedQuery.bind( i + 1, string( v ) );\\n }\\n parametrizedQuery.execute();\\n\\n // and show the results...\\n for ( record : conn.query( \\\"SELECT * FROM Players;\\\" ).execute() ) {\\n print( \\\"{}\\\\n\\\".format( record ) );\\n }\\n return ( 0 );\\n}\\n\",\n \"language\": \"Huginn\"\n },\n {\n \"code\": \"import java.sql.DriverManager;\\nimport java.sql.Connection;\\nimport java.sql.PreparedStatement;\\n\\npublic class DBDemo{\\n private String protocol; //set this to some connection protocol like \\\"jdbc:sqlserver://\\\"\\n private String dbName; //set this to the name of your database\\n private String username;\\n private String password;\\n\\n PreparedStatement query;\\n\\n public int setUpAndExecPS(){\\n try {\\n Connection conn = DriverManager.getConnection(protocol + dbName, username, password);\\n\\n query = conn.prepareStatement(\\n \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\");\\n\\n query.setString(1, \\\"Smith, Steve\\\");//automatically sanitizes and adds quotes\\n query.setInt(2, 42);\\n query.setBoolean(3, true);\\n query.setInt(4, 99);\\n //there are similar methods for other SQL types in PerparedStatement\\n return query.executeUpdate();//returns the number of rows changed\\n //PreparedStatement.executeQuery() will return a java.sql.ResultSet,\\n //execute() will simply return a boolean saying whether it succeeded or not\\n\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n\\n return 0;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using SQLite\\n\\nname = \\\"Smith, Steve\\\"\\njerseys = Dict(\\\"Smith, Steve\\\" => 99)\\nsqlbool(tf::Bool) = if(tf) \\\"TRUE\\\" else \\\"FALSE\\\" end\\n\\ndb = SQLite.DB() # no filename given, so create an in-memory temporary\\nSQLite.execute!(db, \\\"create table players (id integer primary key,\\n name text,\\n score number,\\n active bool,\\n jerseynum integer)\\\")\\n\\nSQLite.query(db, \\\"INSERT INTO players (name, score, active, jerseynum) values ('Jones, James', 9, 'FALSE', 99)\\\")\\nSQLite.query(db, \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseynum = ?\\\";\\n values = [\\\"Smith, Steve\\\", 42, sqlbool(true), jerseys[name]])\\n\\ntbl = SQLite.query(db, \\\"SELECT * from players\\\")\\nprintln(tbl)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.2.41\\n\\nimport java.sql.DriverManager\\nimport java.sql.Connection\\n\\nfun main(args: Array<String>) {\\n val url = \\\"jdbc:mysql://localhost:3306/test\\\"\\n val username = \\\"example\\\"\\n val password = \\\"password123\\\"\\n val conn = DriverManager.getConnection(url, username, password)\\n val query = conn.prepareStatement(\\n \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\"\\n )\\n with (query) {\\n setString(1, \\\"Smith, Steve\\\")\\n setInt(2, 42)\\n setBoolean(3, true)\\n setInt(4, 99)\\n val rowCount = executeUpdate()\\n if (rowCount == 0) println(\\\"Update failed\\\")\\n close()\\n }\\n conn.close()\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"Module Parametrized_Sql {\\n\\tBase \\\"rosetta\\\" ' warning erase database if found it in current directory\\n\\tExecute \\\"rosetta\\\", {create table players (name VarChar(64), score Float, active Integer, jerseyNum Integer);}\\n\\tAppend \\\"rosetta\\\", \\\"players\\\",\\\"name\\\",0,FALSE,99\\n\\tsql$={\\n\\tUPDATE players\\n\\t SET name = '{0}', score = {1}, active = {2}\\n\\t WHERE jerseyNum = {3}\\n\\t}\\n\\tExecute \\\"rosetta\\\", format$(sql$,\\\"Smith, Steve\\\", 42,TRUE, 99)\\n\\tRetrieve \\\"rosetta\\\",\\\"players\\\",1,\\\"jerseyNum\\\",99\\n\\tRead how_many\\n\\tRead Name$,score, active,jerseynum\\n\\tPrint Name$=\\\"Smith, Steve\\\", score=42, active=True, jerseynum=99 ' true true true true\\n}\\nParametrized_Sql\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Needs[\\\"DatabaseLink`\\\"];\\nconn=OpenSQLConnection[JDBC[\\\"ODBC(DSN)\\\",\\\"testdb\\\"],\\\"Username\\\"->\\\"John\\\",\\\"Password\\\"->\\\"JohnsPassword\\\"];\\nSQLExecute[conn,\\\"UPDATE players SET name = `1`, score = `2`, active = `3` WHERE jerseyNum = `4`\\\", {SQLArgument[\\\"Smith, Steve\\\",42,True,99]}]\\nCloseSQLConnection[conn];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nimport java.sql.\\n\\n-- =============================================================================\\nclass RParameterizedSQLSimple public\\n\\n properties indirect\\n connexion = Connection\\n\\n properties inheritable constant\\n DRIVER = \\\"org.apache.derby.jdbc.EmbeddedDriver\\\"\\n DBURL = \\\"jdbc:derby:\\\"\\n DBNAME = \\\"/workspace/DB.DerbySamples/DB/TEAMS01\\\"\\n DBMODE_CREATE = \\\";create=true\\\"\\n DBMODE_NOCREATE = \\\";create=false\\\"\\n DBMODE_SHUTDOWN = \\\";shutdown=true\\\"\\n\\n-- =============================================================================\\nmethod RParameterizedSQLSimple()\\n setConnexion(null)\\n return\\n\\n-- =============================================================================\\nmethod createConnexion() inheritable returns Connection signals ClassNotFoundException, InstantiationException, IllegalAccessException\\n if getConnexion() = null then do\\n props = Properties()\\n props.put(\\\"user\\\", \\\"user1\\\")\\n props.put(\\\"password\\\", \\\"user1\\\")\\n\\n xURL = String DBURL || DBNAME || DBMODE_CREATE\\n loadDriver(DRIVER)\\n setConnexion(DriverManager.getConnection(xURL, props))\\n end\\n\\n return getConnexion()\\n\\n-- =============================================================================\\nmethod shutdownConnexion() inheritable returns boolean signals SQLException\\n\\n dbState = boolean\\n xURL = String DBURL || DBNAME || DBMODE_SHUTDOWN\\n\\n do\\n DriverManager.getConnection(xURL)\\n dbState = isTrue\\n\\n catch se = SQLException\\n if (se.getErrorCode() = 50000) & (\\\"XJ015\\\".equals(se.getSQLState())) then do\\n say \\\"Derby shut down normally\\\"\\n dbState = isTrue\\n end\\n else if (se.getErrorCode() = 45000) & (\\\"08006\\\".equals(se.getSQLState())) then do\\n say \\\"Derby database shut down normally\\\"\\n dbState = isTrue\\n end\\n else do\\n say \\\"Derby did not shut down normally\\\"\\n dbState = isFalse\\n signal se\\n end\\n end\\n\\n return dbState\\n\\n-- =============================================================================\\nmethod loadDriver(xdriver = String) inheritable static signals ClassNotFoundException, InstantiationException, IllegalAccessException\\n\\n do\\n Class.forName(xdriver).newInstance()\\n say \\\"Loaded the appropriate driver\\\"\\n\\n catch cnfe = ClassNotFoundException\\n say \\\"Unable to load the JDBC driver\\\" xdriver\\n say \\\"Please check your CLASSPATH.\\\"\\n signal cnfe\\n\\n catch ie = InstantiationException\\n say \\\"Unable to instantiate the JDBC driver\\\" xdriver\\n signal ie\\n\\n catch iae = IllegalAccessException\\n say \\\"Not allowed to access the JDBC driver\\\" xdriver\\n signal iae\\n\\n end\\n\\n return\\n\\n-- =============================================================================\\nmethod updatePlayer(jerseyNum = int, name = String, score = int, active = boolean) binary inheritable returns int signals SQLException\\n\\n updateSQL = \\\"\\\" -\\n || \\\"UPDATE TEAM.PLAYERS\\\" -\\n || \\\" SET NAME = ?, SCORE = ?, ACTIVE = ?\\\" -\\n || \\\" WHERE JERSEYNUM = ?\\\"\\n\\n rowCt = int\\n ix = int 0\\n\\n ps = getConnexion().prepareStatement(updateSQL)\\n ix = ix + 1; ps.setString(ix, name)\\n ix = ix + 1; ps.setInt(ix, score)\\n ix = ix + 1; ps.setBoolean(ix, active)\\n ix = ix + 1; ps.setInt(ix, jerseyNum)\\n rowCt = ps.executeUpdate()\\n\\n return rowCt\\n\\n-- =============================================================================\\nmethod main(args = String[]) public static\\n\\n do\\n tda = RParameterizedSQLSimple()\\n tda.createConnexion()\\n\\n if tda.getConnexion() \\\\= null then do\\n updated = tda.updatePlayer(99, \\\"Smith, Steve\\\", 42, isTrue)\\n if updated > 0 then say \\\"Update successful\\\"\\n else say \\\"Update failed\\\"\\n\\n finally\\n tda.shutdownConnexion()\\n end\\n\\n catch ex = Exception\\n ex.printStackTrace\\n end\\n\\n return\\n\\n-- =============================================================================\\nmethod isTrue() public static returns boolean\\n return 1 == 1\\n\\n-- =============================================================================\\nmethod isFalse() public static returns boolean\\n return \\\\isTrue\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import db_sqlite\\n\\nlet db = open(\\\":memory:\\\", \\\"\\\", \\\"\\\", \\\"\\\")\\n\\n# Setup\\ndb.exec(sql\\\"CREATE TABLE players (name, score, active, jerseyNum)\\\")\\ndb.exec(sql\\\"INSERT INTO players VALUES (?, ?, ?, ?)\\\", \\\"name\\\", 0, \\\"false\\\", 99)\\n\\n# Update the row.\\ndb.exec(sql\\\"UPDATE players SET name=?, score=?, active=? WHERE jerseyNum=?\\\",\\n \\\"Smith, Steve\\\", 42, true, 99)\\n\\n# Display result.\\nfor row in db.fastRows(sql\\\"SELECT * FROM players\\\"):\\n echo row\\n\\ndb.close()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use IO;\\nuse ODBC;\\n\\nbundle Default {\\n class Sql {\\n function : Main(args : String[]) ~ Nil {\\n conn := Connection->New(\\\"ds\\\", \\\"user\\\", \\\"password\\\");\\n if(conn <> Nil) {\\n sql := \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\";\\n pstmt := conn->CreateParameterStatement(sql);\\n pstmt->SetVarchar(1, \\\"Smith, Steve\\\");\\n pstmt->SetInt(2, 42);\\n pstmt->SetBit(3, true);\\n pstmt->SetInt(4, 99);\\n pstmt->Update()->PrintLine();\\n conn->Close();\\n };\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"program Parametrized_SQL_Statement;\\nuses\\n sqlite3, sysutils;\\n\\nconst\\n DB_FILE : PChar = ':memory:'; // Create an in-memory database.\\n\\nvar\\n DB :Psqlite3;\\n ResultCode :Integer;\\n SQL :PChar;\\n InsertStatements :array [1..4] of PChar;\\n CompiledStatement :Psqlite3_stmt;\\n i :integer;\\n\\n{ CheckError\\n\\n Checks the result code from an SQLite operation.\\n If it contains an error code then this procedure prints the error message,\\n closes the database and halts the program. }\\n\\nprocedure CheckError(ResultCode: integer; DB: Psqlite3);\\nbegin\\n if ResultCode <> SQLITE_OK then\\n begin\\n writeln(format('Error #%d: %s', [ResultCode, sqlite3_errmsg(db)]));\\n sqlite3_close(DB);\\n halt(ResultCode);\\n end;\\nend;\\n\\n{ SelectCallback\\n\\n This callback function prints the results of the select statement.}\\n\\nfunction SelectCallback(Data: pointer; ColumnCount: longint; Columns: PPChar; ColumnNames: PPChar):longint; cdecl;\\nvar\\n i :longint;\\n col :PPChar;\\nbegin\\n col := Columns;\\n for i:=0 to ColumnCount-1 do\\n begin\\n write(col^); // Print the current column value.\\n inc(col); // Advance the pointer.\\n if i<>ColumnCount-1 then write(' | ');\\n end;\\n writeln;\\nend;\\n\\nbegin\\n // Open the database.\\n ResultCode := sqlite3_open(DB_FILE, @DB);\\n CheckError(ResultCode, DB);\\n\\n // Create the players table in the database.\\n SQL := 'create table players(' +\\n 'id integer primary key asc, ' +\\n 'name text, ' +\\n 'score real, ' +\\n 'active integer, ' + // Store the bool value as integer (see https://sqlite.org/datatype3.html chapter 2.1).\\n 'jerseyNum integer);';\\n ResultCode := sqlite3_exec(DB, SQL, nil, nil, nil);\\n CheckError(ResultCode, DB);\\n\\n // Insert some values into the players table.\\n InsertStatements[1] := 'insert into players (name, score, active, jerseyNum) ' +\\n 'values (''Roethlisberger, Ben'', 94.1, 1, 7);';\\n InsertStatements[2] := 'insert into players (name, score, active, jerseyNum) ' +\\n 'values (''Smith, Alex'', 85.3, 1, 11);';\\n InsertStatements[3] := 'insert into players (name, score, active, jerseyNum) ' +\\n 'values (''Manning, Payton'', 96.5, 0, 18);';\\n InsertStatements[4] := 'insert into players (name, score, active, jerseyNum) ' +\\n 'values (''Doe, John'', 15, 0, 99);';\\n\\n for i:=1 to 4 do\\n begin\\n ResultCode := sqlite3_exec(DB, InsertStatements[i], nil, nil, nil);\\n CheckError(ResultCode, DB);\\n end;\\n\\n // Display the contents of the players table.\\n writeln('Before update:');\\n SQL := 'select * from players;';\\n ResultCode := sqlite3_exec(DB, SQL, @SelectCallback, nil, nil);\\n CheckError(ResultCode, DB);\\n\\n // Prepare the parametrized SQL statement to update player #99.\\n SQL := 'update players set name=?, score=?, active=? where jerseyNum=?;';\\n ResultCode := sqlite3_prepare_v2(DB, SQL, -1, @CompiledStatement, nil);\\n CheckError(ResultCode, DB);\\n\\n // Bind the values to the parameters (see https://sqlite.org/c3ref/bind_blob.html).\\n ResultCode := sqlite3_bind_text(CompiledStatement, 1, PChar('Smith, Steve'), -1, nil);\\n CheckError(ResultCode, DB);\\n ResultCode := sqlite3_bind_double(CompiledStatement, 2, 42);\\n CheckError(ResultCode, DB);\\n ResultCode := sqlite3_bind_int(CompiledStatement, 3, 1);\\n CheckError(ResultCode, DB);\\n ResultCode := sqlite3_bind_int(CompiledStatement, 4, 99);\\n CheckError(ResultCode, DB);\\n\\n // Evaluate the prepared SQL statement.\\n ResultCode := sqlite3_step(CompiledStatement);\\n if ResultCode <> SQLITE_DONE then\\n begin\\n writeln(format('Error #%d: %s', [ResultCode, sqlite3_errmsg(db)]));\\n sqlite3_close(DB);\\n halt(ResultCode);\\n end;\\n\\n // Destroy the prepared statement object.\\n ResultCode := sqlite3_finalize(CompiledStatement);\\n CheckError(ResultCode, DB);\\n\\n // Display the contents of the players table.\\n writeln('After update:');\\n SQL := 'select * from players;';\\n ResultCode := sqlite3_exec(DB, SQL, @SelectCallback, nil, nil);\\n CheckError(ResultCode, DB);\\n\\n // Close the database connection.\\n sqlite3_close(db);\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use DBI;\\n\\nmy $db = DBI->connect('DBI:mysql:mydatabase:host','login','password');\\n\\n$statment = $db->prepare(\\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\");\\n\\n$rows_affected = $statment->execute(\\\"Smith, Steve\\\",42,'true',99);\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(notonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Parameterized_SQL_statement.exw\\n -- ============================================\\n -- </span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (pSQLite)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pSQLite</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">--<some pretty printing, not really part of the demo></span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">coltypes</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">colfmts</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">colrids</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">columnize</span><span style=\\\"color: #0000FF;\\\">({</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">SQLITE_INTEGER</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%4d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sqlite3_column_int</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">SQLITE_FLOAT</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%4g\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sqlite3_column_double</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">SQLITE_TEXT</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%-20s\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sqlite3_column_text</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">show</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">what</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sqlite3</span> <span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">what</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_stmt</span> <span style=\\\"color: #000000;\\\">pStmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_prepare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"SELECT * FROM players;\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_step</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">SQLITE_DONE</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">SQLITE_ROW</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">sqlite3_column_count</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ctype</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_column_type</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ctype</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">coltypes</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">rid</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">colrids</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">cdx</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">name</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_column_name</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">data</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">colfmts</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">cdx</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">text</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\" %s:%s\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">text</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_finalize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--</pretty printing></span>\\n\\n <span style=\\\"color: #000000;\\\">sqlite3</span> <span style=\\\"color: #000000;\\\">db</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\":memory:\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`create table players (name, score, active, jerseyNum)`</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`insert into players values ('Roethlisberger, Ben', 94.1, 1, 7 )`</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`insert into players values ('Smith, Alex', 85.3, 1, 11)`</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`insert into players values ('Doe, John', 15, 0, 99)`</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_exec</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`insert into players values ('Manning, Payton', 96.5, 0, 123)`</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">show</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Before\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--pp({\\\"Before\\\",sqlite3_get_table(db, \\\"select * from players\\\")},{pp_Nest,2})\\n\\n -- For comparison against some other entries, this is how you would do numbered parameters:\\n --/*\\n sqlite3_stmt pStmt = sqlite3_prepare(db, `update players set name=?, score=?, active=? where jerseyNum=?`)\\n sqlite3_bind_text(pStmt,1,\\\"Smith, Steve\\\")\\n sqlite3_bind_double(pStmt,2,42)\\n sqlite3_bind_int(pStmt,3,true)\\n sqlite3_bind_int(pStmt,4,99)\\n --*/\\n -- However, ordinarily I would prefer named parameters and sqlbind_parameter_index() calls:</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_stmt</span> <span style=\\\"color: #000000;\\\">pStmt</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_prepare</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">`update players set name=:name, score=:score, active=:active where jerseyNum=:jerseyn`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">k_name</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_bind_parameter_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\":name\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k_score</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_bind_parameter_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\":score\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k_active</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_bind_parameter_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\":active\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">k_jerseyn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">sqlite3_bind_parameter_index</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\":jerseyn\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_bind_text</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k_name</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Smith, Steve\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_bind_double</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k_score</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">42</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_bind_int</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k_active</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">sqlite3_bind_int</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">k_jerseyn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">99</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_step</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_DONE</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">sqlite3_finalize</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pStmt</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">SQLITE_OK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">show</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"After\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--pp({\\\"After\\\",sqlite3_get_table(db, \\\"select * from players\\\")},{pp_Nest,2})</span>\\n\\n <span style=\\\"color: #000000;\\\">sqlite3_close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">db</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"$updatePlayers = \\\"UPDATE `players` SET `name` = ?, `score` = ?, `active` = ?\\\\n\\\".\\n\\t\\t\\\"WHERE `jerseyNum` = ?\\\";\\n$dbh = new PDO( \\\"mysql:dbname=db;host=localhost\\\", \\\"username\\\", \\\"password\\\" );\\n\\n$updateStatement = $dbh->prepare( $updatePlayers );\\n\\n$updateStatement->bindValue( 1, \\\"Smith, Steve\\\", PDO::PARAM_STR );\\n$updateStatement->bindValue( 2, 42, PDO::PARAM_INT );\\n$updateStatement->bindValue( 3, 1, PDO::PARAM_INT );\\n$updateStatement->bindValue( 4, 99, PDO::PARAM_INT );\\n\\n$updateStatement->execute();\\n\\n// alternatively pass parameters as an array to the execute method\\n$updateStatement = $dbh->prepare( $updatePlayers );\\n$updateStatement->execute( array( \\\"Smith, Steve\\\", 42, 1, 99 ) );\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(for P (collect 'jerseyNum '+Players 99)\\n (put!> P 'name \\\"Smith, Steve\\\")\\n (put!> P 'score 42)\\n (put!> P 'active T) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"UseSQLiteDatabase()\\n\\nProcedure CheckDatabaseUpdate(database, query$)\\n result = DatabaseUpdate(database, query$)\\n If result = 0\\n PrintN(DatabaseError())\\n EndIf\\n\\n ProcedureReturn result\\nEndProcedure\\n\\nIf OpenConsole()\\n If OpenDatabase(0, \\\":memory:\\\", \\\"\\\", \\\"\\\")\\n ;create players table with sample data\\n CheckDatabaseUpdate(0, \\\"CREATE table players (name, score, active, jerseyNum)\\\")\\n CheckDatabaseUpdate(0, \\\"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\\\")\\n CheckDatabaseUpdate(0, \\\"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\\\")\\n CheckDatabaseUpdate(0, \\\"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\\\")\\n\\n Define name$, score, active$, jerseynum\\n name$ = \\\"Smith, Steve\\\"\\n score = 42\\n active$ =\\\"TRUE\\\"\\n jerseynum = 99\\n SetDatabaseString(0, 0, name$)\\n SetDatabaseLong(0, 1, score)\\n SetDatabaseString(0, 2, active$)\\n SetDatabaseLong(0, 3, jerseynum)\\n CheckDatabaseUpdate(0, \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\")\\n\\n ;display database contents\\n If DatabaseQuery(0, \\\"Select * from players\\\")\\n While NextDatabaseRow(0)\\n name$ = GetDatabaseString(0, 0)\\n score = GetDatabaseLong(0, 1)\\n active$ = GetDatabaseString(0, 2)\\n jerseynum = GetDatabaseLong(0, 3)\\n row$ = \\\"['\\\" + name$ + \\\"', \\\" + score + \\\", '\\\" + active$ + \\\"', \\\" + jerseynum + \\\"]\\\"\\n PrintN(row$)\\n Wend\\n\\n FinishDatabaseQuery(0)\\n EndIf\\n\\n CloseDatabase(0)\\n Else\\n PrintN(\\\"Can't open database !\\\")\\n EndIf\\n\\n Print(#CRLF$ + #CRLF$ + \\\"Press ENTER to exit\\\"): Input()\\n CloseConsole()\\nEndIf\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import sqlite3\\n\\ndb = sqlite3.connect(':memory:')\\n\\n# setup\\ndb.execute('create temp table players (name, score, active, jerseyNum)')\\ndb.execute('insert into players values (\\\"name\\\",0,\\\"false\\\",99)')\\ndb.execute('insert into players values (\\\"name\\\",0,\\\"false\\\",100)')\\n\\n# demonstrate parameterized SQL\\n\\n# example 1 -- simple placeholders\\ndb.execute('update players set name=?, score=?, active=? where jerseyNum=?', ('Smith, Steve', 42, True, 99))\\n\\n# example 2 -- named placeholders\\ndb.execute('update players set name=:name, score=:score, active=:active where jerseyNum=:num',\\n {'num': 100,\\n 'name': 'John Doe',\\n 'active': False,\\n 'score': -1}\\n)\\n\\n# and show the results\\nfor row in db.execute('select * from players'):\\n print(row)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket/base\\n(require sql db)\\n\\n(define pgc\\n ; Don't actually inline sensitive data ;)\\n (postgresql-connect #:user \\\"resu\\\"\\n #:database \\\"esabatad\\\"\\n #:server \\\"example.com\\\"\\n #:port 5432\\n #:password \\\"s3>r37P455\\\"))\\n\\n(define update-player\\n (parameterize ((current-sql-dialect 'postgresql))\\n (update players\\n #:set [name ?] [score ?] [active ?]\\n #:where [jerseyNum ?])))\\n\\n(apply query\\n pgc\\n update-player\\n '(\\\"Smith, Steve\\\" 42 #t 99))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use DBIish;\\n\\nmy $db = DBIish.connect('DBI:mysql:mydatabase:host','login','password');\\n\\nmy $update = $db.prepare(\\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = ?\\\");\\n\\nmy $rows-affected = $update.execute(\\\"Smith, Steve\\\",42,'true',99);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"require 'sqlite3'\\n\\ndb = SQLite3::Database.new(\\\":memory:\\\")\\n\\n# setup\\ndb.execute('create temp table players (name, score, active, jerseyNum)')\\ndb.execute('insert into players values (\\\"name\\\",0,\\\"false\\\",99)')\\ndb.execute('insert into players values (\\\"name\\\",0,\\\"false\\\",100)')\\ndb.execute('insert into players values (\\\"name\\\",0,\\\"false\\\",101)')\\n\\n# demonstrate parameterized SQL\\n\\n# example 1 -- simple placeholders\\ndb.execute('update players set name=?, score=?, active=? where jerseyNum=?', 'Smith, Steve', 42, true, 99)\\n\\n# example 2 -- named placeholders\\ndb.execute('update players set name=:name, score=:score, active=:active where jerseyNum=:num',\\n :num => 100,\\n :name => 'John Doe',\\n :active => false,\\n :score => -1\\n)\\n\\n# example 3 -- numbered placeholders\\nstmt = db.prepare('update players set name=?4, score=?3, active=?2 where jerseyNum=?1')\\nstmt.bind_param(1, 101)\\nstmt.bind_param(2, true)\\nstmt.bind_param(3, 3)\\nstmt.bind_param(4, \\\"Robert'; DROP TABLE players--\\\")\\nstmt.execute\\n\\n# and show the results\\ndb.execute2('select * from players') {|row| p row}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"sqliteconnect #mem, \\\":memory:\\\"\\n#mem execute(\\\"CREATE table players (name, score, active, jerseyNum)\\\")\\n#mem execute(\\\"INSERT INTO players VALUES ('Jones, Bob',0,'N',99)\\\")\\n#mem execute(\\\"INSERT INTO players VALUES ('Jesten, Jim',0,'N',100)\\\")\\n#mem execute(\\\"INSERT INTO players VALUES ('Jello, Frank',0,'N',101)\\\")\\nsql$ = \\\"\\nUPDATE players\\n SET name = 'Smith, Steve',\\n score = 42,\\n active = 'TRUE'\\n WHERE jerseyNum = 99\\\"\\n#mem execute(sql$)\\n#mem execute(\\\"SELECT * FROM players ORDER BY jerseyNum\\\")\\nWHILE #mem hasanswer()\\n\\t#row = #mem #nextrow()\\n\\tname$ = #row name$()\\n\\tscore = #row score()\\n\\tactive$ = #row active$()\\n\\tjerseyNum = #row jerseyNum()\\n\\t\\nprint name$;chr$(9);score;chr$(9);active$;chr$(9);jerseyNum\\nWEND\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"import slick.jdbc.H2Profile.api._\\nimport slick.sql.SqlProfile.ColumnOption.SqlType\\n\\nimport scala.concurrent.Await\\nimport scala.concurrent.ExecutionContext.Implicits.global\\nimport scala.concurrent.duration.Duration\\n\\nobject PlayersApp extends App {\\n lazy val playerRecords = TableQuery[PlayerRecords]\\n val db = Database.forURL(\\\"jdbc:h2:mem:test1;DB_CLOSE_DELAY=-1\\\", driver = \\\"org.h2.Driver\\\")\\n // Pre-compiled parameterized statement\\n val compiledUpdate = Compiled { jerseyN: Rep[Int] =>\\n for {c <- playerRecords if c.jerseyNum === jerseyN} yield (c.name, c.score, c.active)\\n }\\n\\n def setup = DBIO.seq(\\n playerRecords.schema.create,\\n playerRecords ++= Seq( // JDBC batch update\\n (7, \\\"Roethlisberger, Ben\\\", 94.1f, true),\\n (11, \\\"Smith, Alex\\\", 85.3f, true),\\n (18, \\\"Manning, Payton\\\", 96.5f, false),\\n (99, \\\"Doe, John\\\", 15f, false))\\n )\\n\\n def queryPlayers(prelude: String) = {\\n println(\\\"\\\\n \\\" +prelude)\\n println(\\n \\\"│ Name │Scor│ Active │Jerseynum│\\\\n\\\" +\\n \\\"├───────────────────────────────┼────┼────────┼─────────┤\\\"\\n )\\n DBIO.seq(playerRecords.result.map(_.map {\\n case (jerseyN, name, score, active) =>\\n f\\\"$name%32s $score ${(if (active) \\\"\\\" else \\\"in\\\") + \\\"active\\\"}%8s $jerseyN%8d\\\"\\n }.foreach(println)))\\n }\\n\\n // Definition of the PLAYERS table\\n class PlayerRecords(tag: Tag) extends Table[(Int, String, Float, Boolean)](tag, \\\"PLAYER_RECORDS\\\") {\\n def active = column[Boolean](\\\"ACTIVE\\\")\\n def jerseyNum = column[Int](\\\"JERSEY_NUM\\\", O.PrimaryKey)\\n def name = column[String](\\\"NAME\\\", SqlType(\\\"VARCHAR2(32)\\\"))\\n def score = column[Float](\\\"SCORE\\\")\\n\\n def * = (jerseyNum, name, score, active)\\n }\\n\\n println(s\\\"The pre-compiled parameterized update DML:\\\\n${compiledUpdate(0).updateStatement}\\\")\\n\\n Await.result(db.run(\\n for { // Using the for comprehension\\n _ <- setup\\n _ <- queryPlayers(\\\"Before update:\\\")\\n n <- compiledUpdate(99).update(\\\"Smith, Steve\\\", 42f, true)\\n _ <- queryPlayers(\\\"After update:\\\")\\n } yield n), Duration.Inf)\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n include \\\"sql_base.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var database: testDb is database.value;\\n var sqlStatement: statement is sqlStatement.value;\\n var string: name is \\\"Smith, Steve\\\";\\n begin\\n testDb := openDatabase(DB_SQLITE, \\\"test\\\", \\\"test\\\", \\\"test\\\");\\n execute(testDb, \\\"create table players (name CHAR(32), score INTEGER, active CHAR, jerseyNum INTEGER)\\\");\\n execute(testDb, \\\"insert into players values ('Jones, Bob',0,0,99)\\\");\\n execute(testDb, \\\"insert into players values ('Jesten, Jim',0,0,100)\\\");\\n execute(testDb, \\\"insert into players values ('Jello, Frank',0,0,101)\\\");\\n statement := prepare(testDb, \\\"update players set name = ?, score = ?, active = ? \\\\\\n \\\\where jerseyNum = ?\\\");\\n bind(statement, 1, name);\\n bind(statement, 2, 42);\\n bind(statement, 3, TRUE);\\n bind(statement, 4, 99);\\n execute(statement);\\n statement := prepare(testDb, \\\"select * from players\\\");\\n execute(statement);\\n while fetch(statement) do\\n writeln(column(statement, 1, string) <& \\\" \\\" <&\\n column(statement, 2, integer) <& \\\" \\\" <&\\n column(statement, 3, boolean) <& \\\" \\\" <&\\n column(statement, 4, integer));\\n end while;\\n execute(testDb, \\\"drop table players\\\");\\n close(testDb);\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"-- This works in Oracle's SQL*Plus command line utility\\n\\nVARIABLE P_NAME VARCHAR2(20);\\nVARIABLE P_SCORE NUMBER;\\nVARIABLE P_ACTIVE VARCHAR2(5);\\nVARIABLE P_JERSEYNUM NUMBER;\\n\\nbegin\\n\\n:P_NAME := 'Smith, Steve';\\n:P_SCORE := 42;\\n:P_ACTIVE := 'TRUE';\\n:P_JERSEYNUM := 99;\\n\\nend;\\n/\\n\\ndrop table players;\\n\\ncreate table players\\n(\\nNAME VARCHAR2(20),\\nSCORE NUMBER,\\nACTIVE VARCHAR2(5),\\nJERSEYNUM NUMBER\\n);\\n\\ninsert into players values ('No name',0,'FALSE',99);\\n\\ncommit;\\n\\nselect * from players;\\n\\nUPDATE players\\n SET name = :P_NAME, score = :P_SCORE, active = :P_ACTIVE\\n WHERE jerseyNum = :P_JERSEYNUM;\\n\\ncommit;\\n\\nselect * from players;\\n\",\n \"language\": \"SQL\"\n },\n {\n \"code\": \"--#SET TERMINATOR @\\n\\nCREATE TABLE PLAYERS (\\n NAME VARCHAR(32),\\n SCORE INT,\\n ACTIVE SMALLINT,\\n JERSEYNUM INT\\n) @\\n\\nCREATE PROCEDURE UPDATE_PLAYER (\\n IN PLAYER_NAME VARCHAR(32),\\n IN PLAYER_SCORE INT,\\n IN PLAYER_ACTIVE SMALLINT,\\n IN JERSEY_NUMBER INT\\n )\\n BEGIN\\n UPDATE PLAYERS\\n SET NAME = PLAYER_NAME, SCORE = PLAYER_SCORE, ACTIVE = PLAYER_ACTIVE\\n WHERE JERSEYNUM = JERSEY_NUMBER;\\n END @\\n\\nINSERT INTO PLAYERS VALUES ('Pele', '1280', 0, 10) @\\n\\nCALL UPDATE_PLAYER ('Maradona', '600', 1, 10) @\\n\\nSELECT * FROM PLAYERS @\\n\",\n \"language\": \"SQL-PL\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\n# These next two lines are the only ones specific to SQLite\\npackage require tdbc::sqlite3\\nset db [tdbc::sqlite3::connection new /path/to/database.sql]\\n\\n# Use a helper procedure to make a scope\\nproc setPlayer {db jersey -> playerName playerScore playerActive} {\\n # Note that the '->' above is just syntactic noise for readability\\n $db allrows {\\n\\tUPDATE players\\n\\tSET name = :playerName, score = :playerScore, active = :playerActive\\n\\tWHERE jerseyNum = :jersey\\n }\\n # The named parameters are bound to local variables by default\\n}\\n\\n# How to use...\\nsetPlayer $db 99 -> \\\"Smith, Steve\\\" 42 true\\n# With apologies to http://xkcd.com/327/\\nsetPlayer $db 76 -> \\\"Robert'; DROP TABLE players--\\\" 0 false\\n$db close\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./sql\\\" for Connection\\n\\nvar db = Connection.open(\\\"rc.db\\\")\\n\\nvar createSql = [\\n \\\"DROP TABLE IF EXISTS players\\\",\\n \\\"CREATE table players (name, score, active, jerseyNum)\\\",\\n \\\"INSERT INTO players VALUES ('Roethlisberger, Ben', 94.1, TRUE, 7)\\\",\\n \\\"INSERT INTO players VALUES ('Smith, Alex', 85.3, TRUE, 11)\\\",\\n \\\"INSERT INTO players VALUES ('Doe, John', 15, FALSE, 99)\\\",\\n \\\"INSERT INTO players VALUES ('Manning, Payton', 96.5, FALSE, 123)\\\"\\n]\\n\\nfor (sql in createSql) db.exec(sql)\\n\\nvar widths = [22, 7, 7, 9]\\nSystem.print(\\\"Before update:\\\\n\\\")\\ndb.printTable(\\\"SELECT * FROM players\\\", widths)\\n\\nvar updateSql = \\\"UPDATE players SET name = ?, score = ?, active = ? WHERE jerseyNum = 99\\\"\\nvar ps = db.prepare(updateSql)\\nps.bindText(1, \\\"Smith, Steve\\\")\\nps.bindDouble(2, 42)\\nps.bindBool(3, true)\\nps.bindInt(4, 99)\\nps.step()\\n\\nSystem.print(\\\"\\\\nAfter update:\\\\n\\\")\\ndb.printTable(\\\"SELECT * FROM players\\\", widths)\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parameterized-SQL-statement"}}},{"rowIdx":1483,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Type System\nfrom: http://rosettacode.org/wiki/Parametric_polymorphism\nnote: Basic language learning\n","language":"00-META"},{"code":"[[wp:Parametric Polymorphism|Parametric Polymorphism]] is a way to define types or functions that are generic over other types. The genericity can be expressed by using ''type variables'' for the parameter type, and by a mechanism to explicitly or implicitly replace the type variables with concrete types when necessary.\n\n\n;Task:\nWrite a small example for a type declaration that is parametric over another type, together with a short bit of code (and its type signature) that uses it. \n\n\nA good example is a container type, let's say a binary tree, together with some function that traverses the tree, say, a ''map''-function that operates on every element of the tree.\n\nThis language feature only applies to statically-typed languages.\n<br><br>\n\n","language":"00-TASK"},{"code":"generic\n type Element_Type is private;\npackage Container is\n type Tree is tagged private;\n procedure Replace_All(The_Tree : in out Tree; New_Value : Element_Type);\nprivate\n type Node;\n type Node_Access is access Node;\n type Tree tagged record\n Value : Element_type;\n Left : Node_Access := null;\n Right : Node_Access := null;\n end record;\nend Container;\n","language":"Ada"},{"code":"package body Container is\n procedure Replace_All(The_Tree : in out Tree; New_Value : Element_Type) is\n begin\n The_Tree.Value := New_Value;\n If The_Tree.Left /= null then\n The_Tree.Left.all.Replace_All(New_Value);\n end if;\n if The_tree.Right /= null then\n The_Tree.Right.all.Replace_All(New_Value);\n end if;\n end Replace_All;\nend Container;\n","language":"Ada"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\n#define decl_tree_type(T) \\\n typedef struct node_##T##_t node_##T##_t, *node_##T; \\\n struct node_##T##_t { node_##T left, right; T value; }; \\\n \\\n node_##T node_##T##_new(T v) { \\\n node_##T node = malloc(sizeof(node_##T##_t)); \\\n node->value = v; \\\n node->left = node->right = 0; \\\n return node; \\\n } \\\n node_##T node_##T##_insert(node_##T root, T v) { \\\n node_##T n = node_##T##_new(v); \\\n while (root) { \\\n if (root->value < n->value) \\\n if (!root->left) return root->left = n; \\\n else root = root->left; \\\n else \\\n if (!root->right) return root->right = n; \\\n else root = root->right; \\\n } \\\n return 0; \\\n }\n\n#define tree_node(T) node_##T\n#define node_insert(T, r, x) node_##T##_insert(r, x)\n#define node_new(T, x) node_##T##_new(x)\n\ndecl_tree_type(double);\ndecl_tree_type(int);\n\nint main()\n{\n int i;\n tree_node(double) root_d = node_new(double, (double)rand() / RAND_MAX);\n\n for (i = 0; i < 10000; i++)\n node_insert(double, root_d, (double)rand() / RAND_MAX);\n\n tree_node(int) root_i = node_new(int, rand());\n for (i = 0; i < 10000; i++)\n node_insert(int, root_i, rand());\n\n return 0;\n}\n","language":"C"},{"code":"template<typename T>\nclass tree {\n T value;\n tree *left;\n tree *right;\npublic:\n void replace_all (T new_value);\n};\n","language":"C++"},{"code":"template<class T>\nvoid tree<T>::replace_all(T new_value) {\n value = new_value;\n if (left != nullptr)\n left->replace_all(new_value);\n if (right != nullptr)\n right->replace_all(new_value);\n}\n","language":"C++"},{"code":"using System;\n\nclass BinaryTree<T>\n{\n public T value;\n public BinaryTree<T> left;\n public BinaryTree<T> right;\n\n public BinaryTree(T value)\n {\n this.value = value;\n }\n\n public BinaryTree<U> Map<U>(Func<T, U> f)\n {\n BinaryTree<U> tree = new BinaryTree<U>(f(this.value));\n if (this.left != null)\n {\n tree.left = this.left.Map(f);\n }\n if (this.right != null)\n {\n tree.right = this.right.Map(f);\n }\n return tree;\n }\n}\n","language":"C-sharp"},{"code":"class Program\n{\n static void Main(string[] args)\n {\n BinaryTree<int> b = new BinaryTree<int>(6);\n b.left = new BinaryTree<int>(5);\n b.right = new BinaryTree<int>(7);\n\n BinaryTree<double> b2 = b.Map(x => x * 0.5);\n }\n}\n","language":"C-sharp"},{"code":"using System;\n\nclass BinaryTree<T>\n{\n public BinaryTree<T> Left { get; }\n public BinaryTree<T> Right { get; }\n public T Value { get; }\n\n public BinaryTree(T value, BinaryTree<T> left = null, BinaryTree<T> right = null)\n {\n this.Value = value;\n this.Left = left;\n this.Right = right;\n }\n\n public BinaryTree<U> Map<U>(Func<T, U> f)\n {\n return new BinaryTree<U>(f(this.Value), this.Left?.Map(f), this.Right?.Map(f));\n }\n\n public override string ToString()\n {\n var sb = new System.Text.StringBuilder();\n this.ToString(sb, 0);\n return sb.ToString();\n }\n\n private void ToString(System.Text.StringBuilder sb, int depth)\n {\n sb.Append(new string('\\t', depth));\n sb.AppendLine(this.Value?.ToString());\n this.Left?.ToString(sb, depth + 1);\n this.Right?.ToString(sb, depth + 1);\n }\n}\n\nstatic class Program\n{\n static void Main()\n {\n var b = new BinaryTree<int>(6, new BinaryTree<int>(5), new BinaryTree<int>(7));\n\n BinaryTree<double> b2 = b.Map(x => x * 0.5);\n\n Console.WriteLine(b);\n Console.WriteLine(b2);\n }\n}\n","language":"C-sharp"},{"code":"module tree(<Type>);\n\nstruct Tree\n{\n Type value;\n Tree* left;\n Tree* right;\n}\n\nfn void Tree.replace_all(&self, Type new_value)\n{\n self.value = new_value;\n if (self.left) self.left.replace_all(new_value);\n if (self.right) self.right.replace_all(new_value);\n}\n","language":"C3"},{"code":"import tree;\n\nfn void test()\n{\n Tree(<int>) inttree;\n inttree.replace_all(3);\n}\n","language":"C3"},{"code":"class BinaryTree<Data>(shared Data data, shared BinaryTree<Data>? left = null, shared BinaryTree<Data>? right = null) {\n\t\n\tshared BinaryTree<NewData> myMap<NewData>(NewData f(Data d)) =>\n\t\t\tBinaryTree {\n\t\t\t\tdata = f(data);\n\t\t\t\tleft = left?.myMap(f);\n\t\t\t\tright = right?.myMap(f);\n\t\t\t};\n}\n\nshared void run() {\n\t\n\tvalue tree1 = BinaryTree {\n\t\tdata = 3;\n\t\tleft = BinaryTree {\n\t\t\tdata = 4;\n\t\t};\n\t\tright = BinaryTree {\n\t\t\tdata = 5;\n\t\t\tleft = BinaryTree {\n\t\t\t\tdata = 6;\n\t\t\t};\n\t\t};\n\t};\n\t\n\ttree1.myMap(print);\n\tprint(\"\");\n\t\n\tvalue tree2 = tree1.myMap((x) => x * 333.33);\n\ttree2.myMap(print);\n}\n","language":"Ceylon"},{"code":"::Tree a = Empty | Node a (Tree a) (Tree a)\n\nmapTree :: (a -> b) (Tree a) -> (Tree b)\nmapTree f Empty = Empty\nmapTree f (Node x l r) = Node (f x) (mapTree f l) (mapTree f r)\n","language":"Clean"},{"code":"instance Functor Tree where\n fmap f Empty = Empty\n fmap f (Node x l r) = Node (f x) (fmap f l) (fmap f r)\n","language":"Clean"},{"code":"add1Everywhere :: (f a) -> (f a) | Functor f & Num a\nadd1Everywhere nums = fmap (\\x = x + 1) nums\n","language":"Clean"},{"code":"(deftype pair (&key (car 't) (cdr 't))\n `(cons ,car ,cdr))\n","language":"Common-Lisp"},{"code":"class ArrayTree(T, uint N) {\n T[N] data;\n typeof(this) left, right;\n\n this(T initValue) { this.data[] = initValue; }\n\n void tmap(const void delegate(ref typeof(data)) dg) {\n dg(this.data);\n if (left) left.tmap(dg);\n if (right) right.tmap(dg);\n }\n}\n\nvoid main() { // Demo code.\n import std.stdio;\n\n // Instantiate the template ArrayTree of three doubles.\n alias AT3 = ArrayTree!(double, 3);\n\n // Allocate the tree root.\n auto root = new AT3(1.00);\n\n // Add some nodes.\n root.left = new AT3(1.10);\n root.left.left = new AT3(1.11);\n root.left.right = new AT3(1.12);\n\n root.right = new AT3(1.20);\n root.right.left = new AT3(1.21);\n root.right.right = new AT3(1.22);\n\n // Now the tree has seven nodes.\n\n // Show the arrays of the whole tree.\n //root.tmap(x => writefln(\"%(%.2f %)\", x));\n root.tmap((ref x) => writefln(\"%(%.2f %)\", x));\n\n // Modify the arrays of the whole tree.\n //root.tmap((x){ x[] += 10; });\n root.tmap((ref x){ x[] += 10; });\n\n // Show the arrays of the whole tree again.\n writeln();\n //root.tmap(x => writefln(\"%(%.2f %)\", x));\n root.tmap((ref x) => writefln(\"%(%.2f %)\", x));\n}\n","language":"D"},{"code":"class TreeNode<T> {\n\n T value;\n TreeNode<T> left;\n TreeNode<T> right;\n\n TreeNode(this.value);\n\n TreeNode map(T f(T t)) {\n var node = new TreeNode(f(value));\n if(left != null) {\n node.left = left.map(f);\n }\n if(right != null) {\n node.right = right.map(f);\n }\n return node;\n }\n\n void forEach(void f(T t)) {\n f(value);\n if(left != null) {\n left.forEach(f);\n }\n if(right != null) {\n right.forEach(f);\n }\n }\n}\n\nvoid main() {\n TreeNode root = new TreeNode(1);\n root.left = new TreeNode(2);\n root.right = new TreeNode(3);\n root.left.right = new TreeNode(4);\n\n print('first tree');\n root.forEach(print);\n var newRoot = root.map((t) => t * 222);\n print('second tree');\n newRoot.forEach(print);\n}\n","language":"Dart"},{"code":"interface TreeAny guards TreeStamp {}\ndef Tree {\n to get(Value) {\n def Tree1 {\n to coerce(specimen, ejector) {\n def tree := TreeAny.coerce(specimen, ejector)\n if (tree.valueType() != Value) {\n throw.eject(ejector, \"Tree value type mismatch\")\n }\n return tree\n }\n }\n return Tree1\n }\n}\n\ndef makeTree(T, var value :T, left :nullOk[Tree[T]], right :nullOk[Tree[T]]) {\n def tree implements TreeStamp {\n to valueType() { return T }\n to map(f) {\n value := f(value) # the declaration of value causes this to be checked\n if (left != null) {\n left.map(f)\n }\n if (right != null) {\n right.map(f)\n }\n }\n }\n return tree\n}\n","language":"E"},{"code":"? def t := makeTree(int, 0, null, null)\n# value: <tree>\n\n? t :Tree[String]\n# problem: Tree value type mismatch\n\n? t :Tree[Int]\n# problem: Failed: Undefined variable: Int\n\n? t :Tree[int]\n# value: <tree>\n","language":"E"},{"code":" namespace RosettaCode\n\n type BinaryTree<'T> =\n | Element of 'T\n | Tree of 'T * BinaryTree<'T> * BinaryTree<'T>\n member this.Map(f) =\n match this with\n | Element(x) -> Element(f x)\n | Tree(x,left,right) -> Tree((f x), left.Map(f), right.Map(f))\n","language":"F-Sharp"},{"code":" let t1 = Tree(2, Element(1), Tree(4,Element(3),Element(5)) )\n let t2 = t1.Map(fun x -> x * 10)\n","language":"F-Sharp"},{"code":" MODULE SORTSEARCH\t\t!Genuflect towards Prof. D. Knuth.\n\n INTERFACE FIND\t\t\t!Binary chop search, not indexed.\n MODULE PROCEDURE\n 1 FINDI4,\t\t\t\t!I: of integers.\n 2 FINDF4,FINDF8,\t\t\t\t!F: of numbers.\n 3 FINDTTI2,FINDTTI4\t\t!T: of texts.\n END INTERFACE FIND\n\n CONTAINS\n INTEGER FUNCTION FINDI4(THIS,NUMB,N)\t!Binary chopper. Find i such that THIS = NUMB(i)\n USE ASSISTANCE\t\t!Only for the trace stuff.\n INTENT(IN) THIS,NUMB,N\t!Imply read-only, but definitely no need for any \"copy-back\".\n INTEGER*4 THIS,NUMB(1:*)\t!Where is THIS in array NUMB(1:N)?\n INTEGER N\t\t!The count. In other versions, it is supplied by the index.\n INTEGER L,R,P\t\t!Fingers.\nChop away.\n L = 0\t\t\t!Establish outer bounds.\n R = N + 1\t\t!One before, and one after, the first and last.\n 1 P = (R - L)/2\t\t!Probe point offset. Beware integer overflow with (L + R)/2.\n IF (P.LE.0) THEN\t!Aha! Nowhere! And THIS follows NUMB(L).\n FINDI4 = -L\t\t!Having -L rather than 0 (or other code) might be of interest.\n RETURN\t\t!Finished.\n END IF\t\t\t!So much for exhaustion.\n P = P + L\t\t!Convert from offset to probe point.\n IF (THIS - NUMB(P)) 3,4,2\t!Compare to the probe point.\n 2 L = P\t\t\t!Shift the left bound up: THIS follows NUMB(P).\n GO TO 1\t\t\t!Another chop.\n 3 R = P\t\t\t!Shift the right bound down: THIS precedes NUMB(P).\n GO TO 1\t\t\t!Try again.\nCaught it! THIS = NUMB(P)\n 4 FINDI4 = P\t\t!So, THIS is found, here!\n END FUNCTION FINDI4\t!On success, THIS = NUMB(FINDI4); no fancy index here...\n\n END MODULE SORTSEARCH\n","language":"Fortran"},{"code":" TYPE STUFF\n INTEGER CODE !A key number.\n CHARACTER*6 NAME !Associated data.\n INTEGER THIS !etc.\n END TYPE STUFF\n TYPE(STUFF) TABLE(600) !An array of such entries.\n","language":"Fortran"},{"code":"Type BinaryTree\n valor As Integer\n izda As BinaryTree Ptr\n dcha As BinaryTree Ptr\nEnd Type\n\nSub PrintTree(t As BinaryTree Ptr, depth As Integer)\n If t = 0 Then Exit Sub\n Print String(depth, Chr(9)); t->valor\n PrintTree(t->izda, depth + 1)\n PrintTree(t->dcha, depth + 1)\nEnd Sub\n\nDim As BinaryTree b = Type(6)\nDim As BinaryTree bLeft = Type(5)\nDim As BinaryTree bRight = Type(7)\nb.izda = @bLeft\nb.dcha = @bRight\n\nPrintTree(@b, 0)\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nfunc average(c intCollection) float64 {\n var sum, count int\n c.mapElements(func(n int) {\n sum += n\n count++\n })\n return float64(sum) / float64(count)\n}\n\nfunc main() {\n t1 := new(binaryTree)\n t2 := new(bTree)\n a1 := average(t1)\n a2 := average(t2)\n fmt.Println(\"binary tree average:\", a1)\n fmt.Println(\"b-tree average:\", a2)\n}\n\ntype intCollection interface {\n mapElements(func(int))\n}\n\ntype binaryTree struct {\n // dummy representation details\n left, right bool\n}\n\nfunc (t *binaryTree) mapElements(visit func(int)) {\n // dummy implementation\n if t.left == t.right {\n visit(3)\n visit(1)\n visit(4)\n }\n}\n\ntype bTree struct {\n // dummy representation details\n buckets int\n}\n\nfunc (t *bTree) mapElements(visit func(int)) {\n // dummy implementation\n if t.buckets >= 0 {\n visit(1)\n visit(5)\n visit(9)\n }\n}\n","language":"Go"},{"code":"package rosettacode\n\ntype Tree(type T) struct {\n val T\n left *Tree(T)\n right *Tree(T)\n}\n\nfunc (t *Tree(T)) ReplaceAll(rep T) {\n t.val = rep\n if t.left != nil { t.left.ReplaceAll(rep) }\n if t.right != nil { t.right.ReplaceAll(rep) }\n}\n","language":"Go"},{"code":"class Tree<T> {\n T value\n Tree<T> left\n Tree<T> right\n\n Tree(T value = null, Tree<T> left = null, Tree<T> right = null) {\n this.value = value\n this.left = left\n this.right = right\n }\n\n void replaceAll(T value) {\n this.value = value\n left?.replaceAll(value)\n right?.replaceAll(value)\n }\n}\n","language":"Groovy"},{"code":"data Tree a = Empty | Node a (Tree a) (Tree a)\n\nmapTree :: (a -> b) -> Tree a -> Tree b\nmapTree f Empty = Empty\nmapTree f (Node x l r) = Node (f x) (mapTree f l) (mapTree f r)\n","language":"Haskell"},{"code":"instance Functor Tree where\n fmap f Empty = Empty\n fmap f (Node x l r) = Node (f x) (fmap f l) (fmap f r)\n","language":"Haskell"},{"code":"add1Everywhere :: (Functor f, Num a) => f a -> f a\nadd1Everywhere nums = fmap (\\x -> x + 1) nums\n","language":"Haskell"},{"code":"procedure main()\n bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]]\n mapTree(bTree, write)\n bTree := [1, [\"two\", [\"four\", [7]], [5]], [3, [\"six\", [\"eight\"], [9]]]]\n mapTree(bTree, write)\nend\n\nprocedure mapTree(tree, f)\n every f(\\tree[1]) | mapTree(!tree[2:0], f)\nend\n","language":"Icon"},{"code":"Polymorphism is a room.\n\nTo find (V - K) in (L - list of values of kind K):\n\trepeat with N running from 1 to the number of entries in L:\n\t\tif entry N in L is V:\n\t\t\tsay \"Found [V] at entry [N] in [L].\";\n\t\t\tstop;\n\tsay \"Did not find [V] in [L].\"\n\nWhen play begins:\n\tfind \"needle\" in {\"parrot\", \"needle\", \"rutabaga\"};\n\tfind 6 in {2, 3, 4};\n\tend the story.\n","language":"Inform-7"},{"code":"list of numbers\nrelation of texts to rooms\nobject based rulebook producing a number\ndescription of things\nactivity on things\nnumber valued property\ntext valued table column\nphrase (text, text) -> number\n","language":"Inform-7"},{"code":"public class Tree<T>{\n\tprivate T value;\n\tprivate Tree<T> left;\n\tprivate Tree<T> right;\n\n\tpublic void replaceAll(T value){\n\t\tthis.value = value;\n\t\tif (left != null)\n\t\t\tleft.replaceAll(value);\n\t\tif (right != null)\n\t\t\tright.replaceAll(value);\n\t}\n}\n","language":"Java"},{"code":"module BinaryTrees\n\nmutable struct BinaryTree{V}\n v::V\n l::Union{BinaryTree{V}, Nothing}\n r::Union{BinaryTree{V}, Nothing}\nend\n\nBinaryTree(v) = BinaryTree(v, nothing, nothing)\n\nmap(f, bt::BinaryTree) = BinaryTree(f(bt.v), map(f, bt.l), map(f, bt.r))\nmap(f, bt::Nothing) = nothing\n\nlet inttree = BinaryTree(\n 0,\n BinaryTree(\n 1,\n BinaryTree(3),\n BinaryTree(5),\n ),\n BinaryTree(\n 2,\n BinaryTree(4),\n nothing,\n ),\n )\n map(x -> 2x^2, inttree)\nend\n\nlet strtree = BinaryTree(\n \"hello\",\n BinaryTree(\n \"world!\",\n BinaryTree(\"Julia\"),\n nothing,\n ),\n BinaryTree(\n \"foo\",\n BinaryTree(\"bar\"),\n BinaryTree(\"baz\"),\n ),\n )\n map(uppercase, strtree)\nend\n\nend\n","language":"Julia"},{"code":"// version 1.0.6\n\nclass BinaryTree<T>(var value: T) {\n var left : BinaryTree<T>? = null\n var right: BinaryTree<T>? = null\n\n fun <U> map(f: (T) -> U): BinaryTree<U> {\n val tree = BinaryTree<U>(f(value))\n if (left != null) tree.left = left?.map(f)\n if (right != null) tree.right = right?.map(f)\n return tree\n }\n\n fun showTopThree() = \"(${left?.value}, $value, ${right?.value})\"\n}\n\nfun main(args: Array<String>) {\n val b = BinaryTree(6)\n b.left = BinaryTree(5)\n b.right = BinaryTree(7)\n println(b.showTopThree())\n val b2 = b.map { it * 10.0 }\n println(b2.showTopThree())\n}\n","language":"Kotlin"},{"code":"f[a_] := Join[a, a]\nf[{1, 2, 3}]\nf[{\"1\", \"2\", \"3\"}]\nf[{1.1, 2.1, 3.1}]\nf[G[1, \"a\", Pi]]\ng[x_] := x^2\ng[2]\ng[3.5]\ng[Pi]\ng[\"a\"]\n","language":"Mathematica"},{"code":":- type tree(A) ---> empty ; node(A, tree(A), tree(A)).\n\n:- func map(func(A) = B, tree(A)) = tree(B).\n\nmap(_, empty) = empty.\nmap(F, node(A, Left, Right)) = node(F(A), map(F, Left), map(F, Right)).\n","language":"Mercury"},{"code":"import strutils, sugar\n\ntype Tree[T] = ref object\n value: T\n left, right: Tree[T]\n\n\nproc newTree[T](value = default(T)): Tree[T] =\n ## Create a tree with a single node with the given value.\n Tree[T](value: value)\n\n\nproc map[T, U](tree: Tree[T]; f: (T) -> U): Tree[U] =\n ## Apply function \"f\" to each element of a tree, building\n ## another tree.\n result = newTree[U](f(tree.value))\n if not tree.left.isNil:\n result.left = tree.left.map(f)\n if not tree.right.isNil:\n result.right = tree.right.map(f)\n\n\nproc print(tree: Tree; indent = 0) =\n ## Print a tree.\n let start = repeat(' ', indent)\n echo start, \"value: \", tree.value\n if tree.left.isNil:\n echo start, \" nil\"\n else:\n print(tree.left, indent + 2)\n if tree.right.isNil:\n echo start, \" nil\"\n else:\n print(tree.right, indent + 2)\n\n\nwhen isMainModule:\n\n echo \"Initial tree:\"\n var tree = newTree[int](5)\n tree.left = newTree[int](2)\n tree.right = newTree[int](7)\n print(tree)\n\n echo \"\"\n echo \"Tree created by applying a function to each node:\"\n let tree1 = tree.map((x) => 1 / x)\n print(tree1)\n","language":"Nim"},{"code":"@interface Tree<T> : NSObject {\n T value;\n Tree<T> *left;\n Tree<T> *right;\n}\n\n- (void)replaceAll:(T)v;\n@end\n\n@implementation Tree\n- (void)replaceAll:(id)v {\n value = v;\n [left replaceAll:v];\n [right replaceAll:v];\n}\n@end\n","language":"Objective-C"},{"code":"type 'a tree = Empty | Node of 'a * 'a tree * 'a tree\n\n(** val map_tree : ('a -> 'b) -> 'a tree -> 'b tree *)\nlet rec map_tree f = function\n | Empty -> Empty\n | Node (x,l,r) -> Node (f x, map_tree f l, map_tree f r)\n","language":"OCaml"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #7060A8;\">sort</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"oranges\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"apples\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">}))</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">right</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">tmap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">data</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #004600;\">null</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tmap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #004600;\">null</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tmap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tree</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">rid</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">tree</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">null</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">null</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">add10</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">root</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.00</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- Add some nodes.</span>\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.11</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.12</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.20</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">left</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.21</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">right</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1.22</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Now the tree has seven nodes.\n\n -- Show the whole tree.</span>\n <span style=\"color: #7060A8;\">ppOpt</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #004600;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Modify the whole tree.</span>\n <span style=\"color: #000000;\">root</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tmap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">add10</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Create a whole new tree.</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">root2</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tmap</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">newnode</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Show the whole tree again.</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">root</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"(de mapTree (Tree Fun)\n (set Tree (Fun (car Tree)))\n (and (cadr Tree) (mapTree @ Fun))\n (and (cddr Tree) (mapTree @ Fun)) )\n","language":"PicoLisp"},{"code":"% Tree Definition\ntree(leaf(_)).\ntree(branch(Left, Right)) :- tree(Left), tree(Right).\n\n% Definition of the addone function\naddone(X, Y) :- Y is X + 1.\n\n% Definition of treewalk\ntreewalk(leaf(Value), Func, leaf(NewValue)) :- call(Func, Value, NewValue).\ntreewalk(branch(Left, Right), Func, branch(NewLeft, NewRight)) :-\n treewalk(Left, Func, NewLeft),\n treewalk(Right, Func, NewRight).\n\n% Execution\nrun :-\n X = branch(leaf(2), branch(leaf(3),leaf(4))),\n treewalk(X, addone, Y),\n write(Y).\n","language":"Prolog"},{"code":"#lang typed/racket\n\n(define-type (Tree A) (U False (Node A)))\n\n(struct: (A) Node\n ([val : A] [left : (Tree A)] [right : (Tree A)])\n #:transparent)\n\n(: tree-map (All (A B) (A -> B) (Tree A) -> (Tree B)))\n(define (tree-map f tree)\n (match tree\n [#f #f]\n [(Node val left right)\n (Node (f val) (tree-map f left) (tree-map f right))]))\n\n;; unit tests\n(require typed/rackunit)\n(check-equal?\n (tree-map add1 (Node 5 (Node 3 #f #f) #f))\n (Node 6 (Node 4 #f #f) #f))\n","language":"Racket"},{"code":"role BinaryTree[::T] {\n has T $.value;\n has BinaryTree[T] $.left;\n has BinaryTree[T] $.right;\n\n method replace-all(T $value) {\n $!value = $value;\n $!left.replace-all($value) if $!left.defined;\n $!right.replace-all($value) if $!right.defined;\n }\n}\n\nclass IntTree does BinaryTree[Int] { }\n\nmy IntTree $it .= new(value => 1,\n left => IntTree.new(value => 2),\n right => IntTree.new(value => 3));\n\n$it.replace-all(42);\nsay $it;\n","language":"Raku"},{"code":"/*REXX program demonstrates (with displays) a method of parametric polymorphism. */\ncall newRoot 1.00, 3 /*new root, and also indicate 3 stems.*/\n /* [↓] no need to label the stems. */\ncall addStem 1.10 /*a new stem and its initial value. */\ncall addStem 1.11 /*\" \" \" \" \" \" \" */\ncall addStem 1.12 /*\" \" \" \" \" \" \" */\ncall addStem 1.20 /*\" \" \" \" \" \" \" */\ncall addStem 1.21 /*\" \" \" \" \" \" \" */\ncall addStem 1.22 /*\" \" \" \" \" \" \" */\n call sayNodes /*display some nicely formatted values.*/\ncall modRoot 50 /*modRoot will add fifty to all stems. */\n call sayNodes /*display some nicely formatted values.*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\naddStem: nodes= nodes + 1; do j=1 for stems; root.nodes.j= arg(1); end; return\nnewRoot: parse arg @,stems; nodes= -1; call addStem copies('═',9); call addStem @; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nmodRoot: arg #; do j=1 for nodes /*traipse through all the defined nodes*/\n do k=1 for stems /*add bias ──►───────────────────────┐ */\n if datatype(root.j.k, 'N') then root.j.k= root.j.k + # /* ◄───┘ */\n end /*k*/ /* [↑] add if stem value is numeric.*/\n end /*j*/\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nsayNodes: w= 9; do j=0 to nodes; _= /*ensure each of the nodes gets shown. */\n do k=1 for stems; _= _ center(root.j.k, w) /*concatenate a node.*/\n end /*k*/\n $= word('node='j, 1 + (j<1) ) /*define a label for this line's output*/\n say center($, w) substr(_, 2) /*ignore 1st (leading) blank which was */\n end /*j*/ /* [↑] caused by concatenation.*/\n say /*show a blank line to separate outputs*/\n return\n","language":"REXX"},{"code":"struct TreeNode<T> {\n value: T,\n left: Option<Box<TreeNode<T>>>,\n right: Option<Box<TreeNode<T>>>,\n}\n\nimpl <T> TreeNode<T> {\n fn my_map<U,F>(&self, f: &F) -> TreeNode<U> where\n F: Fn(&T) -> U {\n TreeNode {\n value: f(&self.value),\n left: match self.left {\n None => None,\n Some(ref n) => Some(Box::new(n.my_map(f))),\n },\n right: match self.right {\n None => None,\n Some(ref n) => Some(Box::new(n.my_map(f))),\n },\n }\n }\n}\n\nfn main() {\n let root = TreeNode {\n value: 3,\n left: Some(Box::new(TreeNode {\n value: 55,\n left: None,\n right: None,\n })),\n right: Some(Box::new(TreeNode {\n value: 234,\n left: Some(Box::new(TreeNode {\n value: 0,\n left: None,\n right: None,\n })),\n right: None,\n })),\n };\n root.my_map(&|x| { println!(\"{}\" , x)});\n println!(\"---------------\");\n let new_root = root.my_map(&|x| *x as f64 * 333.333f64);\n new_root.my_map(&|x| { println!(\"{}\" , x) });\n}\n","language":"Rust"},{"code":"case class Tree[+A](value: A, left: Option[Tree[A]], right: Option[Tree[A]]) {\n def map[B](f: A => B): Tree[B] =\n Tree(f(value), left map (_.map(f)), right map (_.map(f)))\n}\n","language":"Scala"},{"code":"class Employee(val name: String)\nclass Manager(name: String) extends Employee(name)\n\nval t = Tree(new Manager(\"PHB\"), None, None)\nval t2: Tree[Employee] = t\n","language":"Scala"},{"code":"def toName(e: Employee) = e.name\nval treeOfNames = t.map(toName)\n","language":"Scala"},{"code":"trait Function1[-T1, +R]\n","language":"Scala"},{"code":"case class Tree[+A](value: A, left: Option[Tree[A]], right: Option[Tree[A]]) {\n def map[B](f: A => B): Tree[B] =\n Tree(f(value), left map (_.map(f)), right map (_.map(f)))\n def find[B >: A](what: B): Boolean =\n (value == what) || left.map(_.find(what)).getOrElse(false) || right.map(_.find(what)).getOrElse(false)\n}\n","language":"Scala"},{"code":"if (t2.find(new Employee(\"Dilbert\")))\n println(\"Call Catbert!\")\n","language":"Scala"},{"code":"trait DFA {\n type Element\n val map = new collection.mutable.HashMap[Element, DFA]()\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func type: container (in type: elemType) is func\n result\n var type: container is void;\n begin\n container := array elemType;\n\n global\n\n const func container: map (in container: aContainer,\n inout elemType: aVariable, ref func elemType: aFunc) is func\n result\n var container: mapResult is container.value;\n begin\n for aVariable range aContainer do\n mapResult &:= aFunc;\n end for;\n end func;\n\n end global;\n end func;\n\nconst type: intContainer is container(integer);\nvar intContainer: container1 is [] (1, 2, 4, 6, 10, 12, 16, 18, 22);\nvar intContainer: container2 is 0 times 0;\n\nconst proc: main is func\n local\n var integer: num is 0;\n begin\n container2 := map(container1, num, num + 1);\n for num range container2 do\n write(num <& \" \");\n end for;\n writeln;\n end func;\n","language":"Seed7"},{"code":"datatype 'a tree = Empty | Node of 'a * 'a tree * 'a tree\n\n(** val map_tree = fn : ('a -> 'b) -> 'a tree -> 'b tree *)\nfun map_tree f Empty = Empty\n | map_tree f (Node (x,l,r)) = Node (f x, map_tree f l, map_tree f r)\n","language":"Standard-ML"},{"code":"class Tree<T> {\n var value: T?\n var left: Tree<T>?\n var right: Tree<T>?\n\n func replaceAll(value: T?) {\n self.value = value\n left?.replaceAll(value)\n right?.replaceAll(value)\n }\n}\n","language":"Swift"},{"code":"enum Tree<T> {\n case Empty\n indirect case Node(T, Tree<T>, Tree<T>)\n\n func map<U>(f : T -> U) -> Tree<U> {\n switch(self) {\n case .Empty : return .Empty\n case let .Node(x, l, r): return .Node(f(x), l.map(f), r.map(f))\n }\n }\n}\n","language":"Swift"},{"code":"binary_tree_of \"node-type\" = \"node-type\"%hhhhWZAZ\n","language":"Ursala"},{"code":"#import tag\n\n#fix general_type_fixer 1\n\nbinary_tree_of \"node-type\" = (\"node-type\",(binary_tree_of \"node-type\")%Z)%drWZwlwAZ\n","language":"Ursala"},{"code":"binary_tree_of = %-hhhhWZAZ\n","language":"Ursala"},{"code":"binary_tree_map \"f\" = ~&a^& ^A/\"f\"@an ~&amPfamPWB\n","language":"Ursala"},{"code":"binary_tree_map = ~&a^&+ ^A\\~&amPfamPWB+ @an\n","language":"Ursala"},{"code":"string_tree = binary_tree_of %s\n\nx = 'foo': ('bar': (),'baz': ())\n\n#cast string_tree\n\nexample = (binary_tree_map \"s\". \"s\"--\"s\") x\n","language":"Ursala"},{"code":"Class BinaryTree(Of T)\n ReadOnly Property Left As BinaryTree(Of T)\n ReadOnly Property Right As BinaryTree(Of T)\n ReadOnly Property Value As T\n\n Sub New(value As T, Optional left As BinaryTree(Of T) = Nothing, Optional right As BinaryTree(Of T) = Nothing)\n Me.Value = value\n Me.Left = left\n Me.Right = right\n End Sub\n\n Function Map(Of U)(f As Func(Of T, U)) As BinaryTree(Of U)\n Return New BinaryTree(Of U)(f(Me.Value), Me.Left?.Map(f), Me.Right?.Map(f))\n End Function\n\n Overrides Function ToString() As String\n Dim sb As New Text.StringBuilder()\n Me.ToString(sb, 0)\n Return sb.ToString()\n End Function\n\n Private Overloads Sub ToString(sb As Text.StringBuilder, depth As Integer)\n sb.Append(New String(ChrW(AscW(vbTab)), depth))\n sb.AppendLine(Me.Value?.ToString())\n Me.Left?.ToString(sb, depth + 1)\n Me.Right?.ToString(sb, depth + 1)\n End Sub\nEnd Class\n\nModule Program\n Sub Main()\n Dim b As New BinaryTree(Of Integer)(6, New BinaryTree(Of Integer)(5), New BinaryTree(Of Integer)(7))\n Dim b2 As BinaryTree(Of Double) = b.Map(Function(x) x * 0.5)\n\n Console.WriteLine(b)\n Console.WriteLine(b2)\n End Sub\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"domains\n tree{Type} = branch(tree{Type} Left, tree{Type} Right); leaf(Type Value).\n\nclass predicates\n treewalk : (tree{X},function{X,Y}) -> tree{Y} procedure (i,i).\n\nclauses\n treewalk(branch(Left,Right),Func) = branch(NewLeft,NewRight) :-\n NewLeft = treewalk(Left,Func), NewRight = treewalk(Right,Func).\n\n treewalk(leaf(Value),Func) = leaf(X) :-\n X = Func(Value).\n\n run():-\n init(),\n X = branch(leaf(2), branch(leaf(3),leaf(4))),\n Y = treewalk(X,addone),\n write(Y),\n succeed().\n","language":"Visual-Prolog"},{"code":"class BinaryTree {\n construct new(T, value) {\n if (!(T is Class)) Fiber.abort (\"T must be a class.\")\n if (value.type != T) Fiber.abort(\"Value must be of type T.\")\n _kind = T\n _value = value\n _left = null\n _right = null\n }\n\n // constructor overload to enable kind to be inferred from type of value\n static new (value) { new(value.type, value) }\n\n kind { _kind }\n value { _value}\n value=(v) {\n if (v.type != _kind) Fiber.abort(\"Value must be of type %(_kind)\")\n _value = v\n }\n\n left { _left }\n right { _right }\n left=(b) {\n if (b.type != BinaryTree || b.kind != _kind) {\n Fiber.abort(\"Argument must be a BinaryTree of type %(_kind)\")\n }\n _left = b\n }\n right=(b) {\n if (b.type != BinaryTree || b.kind != _kind) {\n Fiber.abort(\"Argument must be a BinaryTree of type %(_kind)\")\n }\n _right = b\n }\n\n map(f) {\n var tree = BinaryTree.new(f.call(_value))\n if (_left) tree.left = left.map(f)\n if (_right) tree.right = right.map(f)\n return tree\n }\n\n showTopThree() { \"(%(left.value), %(value), %(right.value))\" }\n}\n\nvar b = BinaryTree.new(6)\nb.left = BinaryTree.new(5)\nb.right = BinaryTree.new(7)\nSystem.print(b.showTopThree())\n\nvar b2 = b.map{ |i| i * 10 }\nSystem.print(b2.showTopThree())\nb2.value = \"six\" // generates an error because \"six\" is not a Num\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Type System\\nfrom: http://rosettacode.org/wiki/Parametric_polymorphism\\nnote: Basic language learning\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[[wp:Parametric Polymorphism|Parametric Polymorphism]] is a way to define types or functions that are generic over other types. The genericity can be expressed by using ''type variables'' for the parameter type, and by a mechanism to explicitly or implicitly replace the type variables with concrete types when necessary.\\n\\n\\n;Task:\\nWrite a small example for a type declaration that is parametric over another type, together with a short bit of code (and its type signature) that uses it. \\n\\n\\nA good example is a container type, let's say a binary tree, together with some function that traverses the tree, say, a ''map''-function that operates on every element of the tree.\\n\\nThis language feature only applies to statically-typed languages.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"generic\\n type Element_Type is private;\\npackage Container is\\n type Tree is tagged private;\\n procedure Replace_All(The_Tree : in out Tree; New_Value : Element_Type);\\nprivate\\n type Node;\\n type Node_Access is access Node;\\n type Tree tagged record\\n Value : Element_type;\\n Left : Node_Access := null;\\n Right : Node_Access := null;\\n end record;\\nend Container;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Container is\\n procedure Replace_All(The_Tree : in out Tree; New_Value : Element_Type) is\\n begin\\n The_Tree.Value := New_Value;\\n If The_Tree.Left /= null then\\n The_Tree.Left.all.Replace_All(New_Value);\\n end if;\\n if The_tree.Right /= null then\\n The_Tree.Right.all.Replace_All(New_Value);\\n end if;\\n end Replace_All;\\nend Container;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\n#define decl_tree_type(T) \\\\\\n typedef struct node_##T##_t node_##T##_t, *node_##T; \\\\\\n struct node_##T##_t { node_##T left, right; T value; }; \\\\\\n \\\\\\n node_##T node_##T##_new(T v) { \\\\\\n node_##T node = malloc(sizeof(node_##T##_t)); \\\\\\n node->value = v; \\\\\\n node->left = node->right = 0; \\\\\\n return node; \\\\\\n } \\\\\\n node_##T node_##T##_insert(node_##T root, T v) { \\\\\\n node_##T n = node_##T##_new(v); \\\\\\n while (root) { \\\\\\n if (root->value < n->value) \\\\\\n if (!root->left) return root->left = n; \\\\\\n else root = root->left; \\\\\\n else \\\\\\n if (!root->right) return root->right = n; \\\\\\n else root = root->right; \\\\\\n } \\\\\\n return 0; \\\\\\n }\\n\\n#define tree_node(T) node_##T\\n#define node_insert(T, r, x) node_##T##_insert(r, x)\\n#define node_new(T, x) node_##T##_new(x)\\n\\ndecl_tree_type(double);\\ndecl_tree_type(int);\\n\\nint main()\\n{\\n int i;\\n tree_node(double) root_d = node_new(double, (double)rand() / RAND_MAX);\\n\\n for (i = 0; i < 10000; i++)\\n node_insert(double, root_d, (double)rand() / RAND_MAX);\\n\\n tree_node(int) root_i = node_new(int, rand());\\n for (i = 0; i < 10000; i++)\\n node_insert(int, root_i, rand());\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"template<typename T>\\nclass tree {\\n T value;\\n tree *left;\\n tree *right;\\npublic:\\n void replace_all (T new_value);\\n};\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"template<class T>\\nvoid tree<T>::replace_all(T new_value) {\\n value = new_value;\\n if (left != nullptr)\\n left->replace_all(new_value);\\n if (right != nullptr)\\n right->replace_all(new_value);\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass BinaryTree<T>\\n{\\n public T value;\\n public BinaryTree<T> left;\\n public BinaryTree<T> right;\\n\\n public BinaryTree(T value)\\n {\\n this.value = value;\\n }\\n\\n public BinaryTree<U> Map<U>(Func<T, U> f)\\n {\\n BinaryTree<U> tree = new BinaryTree<U>(f(this.value));\\n if (this.left != null)\\n {\\n tree.left = this.left.Map(f);\\n }\\n if (this.right != null)\\n {\\n tree.right = this.right.Map(f);\\n }\\n return tree;\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"class Program\\n{\\n static void Main(string[] args)\\n {\\n BinaryTree<int> b = new BinaryTree<int>(6);\\n b.left = new BinaryTree<int>(5);\\n b.right = new BinaryTree<int>(7);\\n\\n BinaryTree<double> b2 = b.Map(x => x * 0.5);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\n\\nclass BinaryTree<T>\\n{\\n public BinaryTree<T> Left { get; }\\n public BinaryTree<T> Right { get; }\\n public T Value { get; }\\n\\n public BinaryTree(T value, BinaryTree<T> left = null, BinaryTree<T> right = null)\\n {\\n this.Value = value;\\n this.Left = left;\\n this.Right = right;\\n }\\n\\n public BinaryTree<U> Map<U>(Func<T, U> f)\\n {\\n return new BinaryTree<U>(f(this.Value), this.Left?.Map(f), this.Right?.Map(f));\\n }\\n\\n public override string ToString()\\n {\\n var sb = new System.Text.StringBuilder();\\n this.ToString(sb, 0);\\n return sb.ToString();\\n }\\n\\n private void ToString(System.Text.StringBuilder sb, int depth)\\n {\\n sb.Append(new string('\\\\t', depth));\\n sb.AppendLine(this.Value?.ToString());\\n this.Left?.ToString(sb, depth + 1);\\n this.Right?.ToString(sb, depth + 1);\\n }\\n}\\n\\nstatic class Program\\n{\\n static void Main()\\n {\\n var b = new BinaryTree<int>(6, new BinaryTree<int>(5), new BinaryTree<int>(7));\\n\\n BinaryTree<double> b2 = b.Map(x => x * 0.5);\\n\\n Console.WriteLine(b);\\n Console.WriteLine(b2);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"module tree(<Type>);\\n\\nstruct Tree\\n{\\n Type value;\\n Tree* left;\\n Tree* right;\\n}\\n\\nfn void Tree.replace_all(&self, Type new_value)\\n{\\n self.value = new_value;\\n if (self.left) self.left.replace_all(new_value);\\n if (self.right) self.right.replace_all(new_value);\\n}\\n\",\n \"language\": \"C3\"\n },\n {\n \"code\": \"import tree;\\n\\nfn void test()\\n{\\n Tree(<int>) inttree;\\n inttree.replace_all(3);\\n}\\n\",\n \"language\": \"C3\"\n },\n {\n \"code\": \"class BinaryTree<Data>(shared Data data, shared BinaryTree<Data>? left = null, shared BinaryTree<Data>? right = null) {\\n\\t\\n\\tshared BinaryTree<NewData> myMap<NewData>(NewData f(Data d)) =>\\n\\t\\t\\tBinaryTree {\\n\\t\\t\\t\\tdata = f(data);\\n\\t\\t\\t\\tleft = left?.myMap(f);\\n\\t\\t\\t\\tright = right?.myMap(f);\\n\\t\\t\\t};\\n}\\n\\nshared void run() {\\n\\t\\n\\tvalue tree1 = BinaryTree {\\n\\t\\tdata = 3;\\n\\t\\tleft = BinaryTree {\\n\\t\\t\\tdata = 4;\\n\\t\\t};\\n\\t\\tright = BinaryTree {\\n\\t\\t\\tdata = 5;\\n\\t\\t\\tleft = BinaryTree {\\n\\t\\t\\t\\tdata = 6;\\n\\t\\t\\t};\\n\\t\\t};\\n\\t};\\n\\t\\n\\ttree1.myMap(print);\\n\\tprint(\\\"\\\");\\n\\t\\n\\tvalue tree2 = tree1.myMap((x) => x * 333.33);\\n\\ttree2.myMap(print);\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"::Tree a = Empty | Node a (Tree a) (Tree a)\\n\\nmapTree :: (a -> b) (Tree a) -> (Tree b)\\nmapTree f Empty = Empty\\nmapTree f (Node x l r) = Node (f x) (mapTree f l) (mapTree f r)\\n\",\n \"language\": \"Clean\"\n },\n {\n \"code\": \"instance Functor Tree where\\n fmap f Empty = Empty\\n fmap f (Node x l r) = Node (f x) (fmap f l) (fmap f r)\\n\",\n \"language\": \"Clean\"\n },\n {\n \"code\": \"add1Everywhere :: (f a) -> (f a) | Functor f & Num a\\nadd1Everywhere nums = fmap (\\\\x = x + 1) nums\\n\",\n \"language\": \"Clean\"\n },\n {\n \"code\": \"(deftype pair (&key (car 't) (cdr 't))\\n `(cons ,car ,cdr))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"class ArrayTree(T, uint N) {\\n T[N] data;\\n typeof(this) left, right;\\n\\n this(T initValue) { this.data[] = initValue; }\\n\\n void tmap(const void delegate(ref typeof(data)) dg) {\\n dg(this.data);\\n if (left) left.tmap(dg);\\n if (right) right.tmap(dg);\\n }\\n}\\n\\nvoid main() { // Demo code.\\n import std.stdio;\\n\\n // Instantiate the template ArrayTree of three doubles.\\n alias AT3 = ArrayTree!(double, 3);\\n\\n // Allocate the tree root.\\n auto root = new AT3(1.00);\\n\\n // Add some nodes.\\n root.left = new AT3(1.10);\\n root.left.left = new AT3(1.11);\\n root.left.right = new AT3(1.12);\\n\\n root.right = new AT3(1.20);\\n root.right.left = new AT3(1.21);\\n root.right.right = new AT3(1.22);\\n\\n // Now the tree has seven nodes.\\n\\n // Show the arrays of the whole tree.\\n //root.tmap(x => writefln(\\\"%(%.2f %)\\\", x));\\n root.tmap((ref x) => writefln(\\\"%(%.2f %)\\\", x));\\n\\n // Modify the arrays of the whole tree.\\n //root.tmap((x){ x[] += 10; });\\n root.tmap((ref x){ x[] += 10; });\\n\\n // Show the arrays of the whole tree again.\\n writeln();\\n //root.tmap(x => writefln(\\\"%(%.2f %)\\\", x));\\n root.tmap((ref x) => writefln(\\\"%(%.2f %)\\\", x));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"class TreeNode<T> {\\n\\n T value;\\n TreeNode<T> left;\\n TreeNode<T> right;\\n\\n TreeNode(this.value);\\n\\n TreeNode map(T f(T t)) {\\n var node = new TreeNode(f(value));\\n if(left != null) {\\n node.left = left.map(f);\\n }\\n if(right != null) {\\n node.right = right.map(f);\\n }\\n return node;\\n }\\n\\n void forEach(void f(T t)) {\\n f(value);\\n if(left != null) {\\n left.forEach(f);\\n }\\n if(right != null) {\\n right.forEach(f);\\n }\\n }\\n}\\n\\nvoid main() {\\n TreeNode root = new TreeNode(1);\\n root.left = new TreeNode(2);\\n root.right = new TreeNode(3);\\n root.left.right = new TreeNode(4);\\n\\n print('first tree');\\n root.forEach(print);\\n var newRoot = root.map((t) => t * 222);\\n print('second tree');\\n newRoot.forEach(print);\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"interface TreeAny guards TreeStamp {}\\ndef Tree {\\n to get(Value) {\\n def Tree1 {\\n to coerce(specimen, ejector) {\\n def tree := TreeAny.coerce(specimen, ejector)\\n if (tree.valueType() != Value) {\\n throw.eject(ejector, \\\"Tree value type mismatch\\\")\\n }\\n return tree\\n }\\n }\\n return Tree1\\n }\\n}\\n\\ndef makeTree(T, var value :T, left :nullOk[Tree[T]], right :nullOk[Tree[T]]) {\\n def tree implements TreeStamp {\\n to valueType() { return T }\\n to map(f) {\\n value := f(value) # the declaration of value causes this to be checked\\n if (left != null) {\\n left.map(f)\\n }\\n if (right != null) {\\n right.map(f)\\n }\\n }\\n }\\n return tree\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"? def t := makeTree(int, 0, null, null)\\n# value: <tree>\\n\\n? t :Tree[String]\\n# problem: Tree value type mismatch\\n\\n? t :Tree[Int]\\n# problem: Failed: Undefined variable: Int\\n\\n? t :Tree[int]\\n# value: <tree>\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \" namespace RosettaCode\\n\\n type BinaryTree<'T> =\\n | Element of 'T\\n | Tree of 'T * BinaryTree<'T> * BinaryTree<'T>\\n member this.Map(f) =\\n match this with\\n | Element(x) -> Element(f x)\\n | Tree(x,left,right) -> Tree((f x), left.Map(f), right.Map(f))\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \" let t1 = Tree(2, Element(1), Tree(4,Element(3),Element(5)) )\\n let t2 = t1.Map(fun x -> x * 10)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \" MODULE SORTSEARCH\\t\\t!Genuflect towards Prof. D. Knuth.\\n\\n INTERFACE FIND\\t\\t\\t!Binary chop search, not indexed.\\n MODULE PROCEDURE\\n 1 FINDI4,\\t\\t\\t\\t!I: of integers.\\n 2 FINDF4,FINDF8,\\t\\t\\t\\t!F: of numbers.\\n 3 FINDTTI2,FINDTTI4\\t\\t!T: of texts.\\n END INTERFACE FIND\\n\\n CONTAINS\\n INTEGER FUNCTION FINDI4(THIS,NUMB,N)\\t!Binary chopper. Find i such that THIS = NUMB(i)\\n USE ASSISTANCE\\t\\t!Only for the trace stuff.\\n INTENT(IN) THIS,NUMB,N\\t!Imply read-only, but definitely no need for any \\\"copy-back\\\".\\n INTEGER*4 THIS,NUMB(1:*)\\t!Where is THIS in array NUMB(1:N)?\\n INTEGER N\\t\\t!The count. In other versions, it is supplied by the index.\\n INTEGER L,R,P\\t\\t!Fingers.\\nChop away.\\n L = 0\\t\\t\\t!Establish outer bounds.\\n R = N + 1\\t\\t!One before, and one after, the first and last.\\n 1 P = (R - L)/2\\t\\t!Probe point offset. Beware integer overflow with (L + R)/2.\\n IF (P.LE.0) THEN\\t!Aha! Nowhere! And THIS follows NUMB(L).\\n FINDI4 = -L\\t\\t!Having -L rather than 0 (or other code) might be of interest.\\n RETURN\\t\\t!Finished.\\n END IF\\t\\t\\t!So much for exhaustion.\\n P = P + L\\t\\t!Convert from offset to probe point.\\n IF (THIS - NUMB(P)) 3,4,2\\t!Compare to the probe point.\\n 2 L = P\\t\\t\\t!Shift the left bound up: THIS follows NUMB(P).\\n GO TO 1\\t\\t\\t!Another chop.\\n 3 R = P\\t\\t\\t!Shift the right bound down: THIS precedes NUMB(P).\\n GO TO 1\\t\\t\\t!Try again.\\nCaught it! THIS = NUMB(P)\\n 4 FINDI4 = P\\t\\t!So, THIS is found, here!\\n END FUNCTION FINDI4\\t!On success, THIS = NUMB(FINDI4); no fancy index here...\\n\\n END MODULE SORTSEARCH\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \" TYPE STUFF\\n INTEGER CODE !A key number.\\n CHARACTER*6 NAME !Associated data.\\n INTEGER THIS !etc.\\n END TYPE STUFF\\n TYPE(STUFF) TABLE(600) !An array of such entries.\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Type BinaryTree\\n valor As Integer\\n izda As BinaryTree Ptr\\n dcha As BinaryTree Ptr\\nEnd Type\\n\\nSub PrintTree(t As BinaryTree Ptr, depth As Integer)\\n If t = 0 Then Exit Sub\\n Print String(depth, Chr(9)); t->valor\\n PrintTree(t->izda, depth + 1)\\n PrintTree(t->dcha, depth + 1)\\nEnd Sub\\n\\nDim As BinaryTree b = Type(6)\\nDim As BinaryTree bLeft = Type(5)\\nDim As BinaryTree bRight = Type(7)\\nb.izda = @bLeft\\nb.dcha = @bRight\\n\\nPrintTree(@b, 0)\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc average(c intCollection) float64 {\\n var sum, count int\\n c.mapElements(func(n int) {\\n sum += n\\n count++\\n })\\n return float64(sum) / float64(count)\\n}\\n\\nfunc main() {\\n t1 := new(binaryTree)\\n t2 := new(bTree)\\n a1 := average(t1)\\n a2 := average(t2)\\n fmt.Println(\\\"binary tree average:\\\", a1)\\n fmt.Println(\\\"b-tree average:\\\", a2)\\n}\\n\\ntype intCollection interface {\\n mapElements(func(int))\\n}\\n\\ntype binaryTree struct {\\n // dummy representation details\\n left, right bool\\n}\\n\\nfunc (t *binaryTree) mapElements(visit func(int)) {\\n // dummy implementation\\n if t.left == t.right {\\n visit(3)\\n visit(1)\\n visit(4)\\n }\\n}\\n\\ntype bTree struct {\\n // dummy representation details\\n buckets int\\n}\\n\\nfunc (t *bTree) mapElements(visit func(int)) {\\n // dummy implementation\\n if t.buckets >= 0 {\\n visit(1)\\n visit(5)\\n visit(9)\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package rosettacode\\n\\ntype Tree(type T) struct {\\n val T\\n left *Tree(T)\\n right *Tree(T)\\n}\\n\\nfunc (t *Tree(T)) ReplaceAll(rep T) {\\n t.val = rep\\n if t.left != nil { t.left.ReplaceAll(rep) }\\n if t.right != nil { t.right.ReplaceAll(rep) }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class Tree<T> {\\n T value\\n Tree<T> left\\n Tree<T> right\\n\\n Tree(T value = null, Tree<T> left = null, Tree<T> right = null) {\\n this.value = value\\n this.left = left\\n this.right = right\\n }\\n\\n void replaceAll(T value) {\\n this.value = value\\n left?.replaceAll(value)\\n right?.replaceAll(value)\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"data Tree a = Empty | Node a (Tree a) (Tree a)\\n\\nmapTree :: (a -> b) -> Tree a -> Tree b\\nmapTree f Empty = Empty\\nmapTree f (Node x l r) = Node (f x) (mapTree f l) (mapTree f r)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"instance Functor Tree where\\n fmap f Empty = Empty\\n fmap f (Node x l r) = Node (f x) (fmap f l) (fmap f r)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"add1Everywhere :: (Functor f, Num a) => f a -> f a\\nadd1Everywhere nums = fmap (\\\\x -> x + 1) nums\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n bTree := [1, [2, [4, [7]], [5]], [3, [6, [8], [9]]]]\\n mapTree(bTree, write)\\n bTree := [1, [\\\"two\\\", [\\\"four\\\", [7]], [5]], [3, [\\\"six\\\", [\\\"eight\\\"], [9]]]]\\n mapTree(bTree, write)\\nend\\n\\nprocedure mapTree(tree, f)\\n every f(\\\\tree[1]) | mapTree(!tree[2:0], f)\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Polymorphism is a room.\\n\\nTo find (V - K) in (L - list of values of kind K):\\n\\trepeat with N running from 1 to the number of entries in L:\\n\\t\\tif entry N in L is V:\\n\\t\\t\\tsay \\\"Found [V] at entry [N] in [L].\\\";\\n\\t\\t\\tstop;\\n\\tsay \\\"Did not find [V] in [L].\\\"\\n\\nWhen play begins:\\n\\tfind \\\"needle\\\" in {\\\"parrot\\\", \\\"needle\\\", \\\"rutabaga\\\"};\\n\\tfind 6 in {2, 3, 4};\\n\\tend the story.\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"list of numbers\\nrelation of texts to rooms\\nobject based rulebook producing a number\\ndescription of things\\nactivity on things\\nnumber valued property\\ntext valued table column\\nphrase (text, text) -> number\\n\",\n \"language\": \"Inform-7\"\n },\n {\n \"code\": \"public class Tree<T>{\\n\\tprivate T value;\\n\\tprivate Tree<T> left;\\n\\tprivate Tree<T> right;\\n\\n\\tpublic void replaceAll(T value){\\n\\t\\tthis.value = value;\\n\\t\\tif (left != null)\\n\\t\\t\\tleft.replaceAll(value);\\n\\t\\tif (right != null)\\n\\t\\t\\tright.replaceAll(value);\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"module BinaryTrees\\n\\nmutable struct BinaryTree{V}\\n v::V\\n l::Union{BinaryTree{V}, Nothing}\\n r::Union{BinaryTree{V}, Nothing}\\nend\\n\\nBinaryTree(v) = BinaryTree(v, nothing, nothing)\\n\\nmap(f, bt::BinaryTree) = BinaryTree(f(bt.v), map(f, bt.l), map(f, bt.r))\\nmap(f, bt::Nothing) = nothing\\n\\nlet inttree = BinaryTree(\\n 0,\\n BinaryTree(\\n 1,\\n BinaryTree(3),\\n BinaryTree(5),\\n ),\\n BinaryTree(\\n 2,\\n BinaryTree(4),\\n nothing,\\n ),\\n )\\n map(x -> 2x^2, inttree)\\nend\\n\\nlet strtree = BinaryTree(\\n \\\"hello\\\",\\n BinaryTree(\\n \\\"world!\\\",\\n BinaryTree(\\\"Julia\\\"),\\n nothing,\\n ),\\n BinaryTree(\\n \\\"foo\\\",\\n BinaryTree(\\\"bar\\\"),\\n BinaryTree(\\\"baz\\\"),\\n ),\\n )\\n map(uppercase, strtree)\\nend\\n\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.0.6\\n\\nclass BinaryTree<T>(var value: T) {\\n var left : BinaryTree<T>? = null\\n var right: BinaryTree<T>? = null\\n\\n fun <U> map(f: (T) -> U): BinaryTree<U> {\\n val tree = BinaryTree<U>(f(value))\\n if (left != null) tree.left = left?.map(f)\\n if (right != null) tree.right = right?.map(f)\\n return tree\\n }\\n\\n fun showTopThree() = \\\"(${left?.value}, $value, ${right?.value})\\\"\\n}\\n\\nfun main(args: Array<String>) {\\n val b = BinaryTree(6)\\n b.left = BinaryTree(5)\\n b.right = BinaryTree(7)\\n println(b.showTopThree())\\n val b2 = b.map { it * 10.0 }\\n println(b2.showTopThree())\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"f[a_] := Join[a, a]\\nf[{1, 2, 3}]\\nf[{\\\"1\\\", \\\"2\\\", \\\"3\\\"}]\\nf[{1.1, 2.1, 3.1}]\\nf[G[1, \\\"a\\\", Pi]]\\ng[x_] := x^2\\ng[2]\\ng[3.5]\\ng[Pi]\\ng[\\\"a\\\"]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \":- type tree(A) ---> empty ; node(A, tree(A), tree(A)).\\n\\n:- func map(func(A) = B, tree(A)) = tree(B).\\n\\nmap(_, empty) = empty.\\nmap(F, node(A, Left, Right)) = node(F(A), map(F, Left), map(F, Right)).\\n\",\n \"language\": \"Mercury\"\n },\n {\n \"code\": \"import strutils, sugar\\n\\ntype Tree[T] = ref object\\n value: T\\n left, right: Tree[T]\\n\\n\\nproc newTree[T](value = default(T)): Tree[T] =\\n ## Create a tree with a single node with the given value.\\n Tree[T](value: value)\\n\\n\\nproc map[T, U](tree: Tree[T]; f: (T) -> U): Tree[U] =\\n ## Apply function \\\"f\\\" to each element of a tree, building\\n ## another tree.\\n result = newTree[U](f(tree.value))\\n if not tree.left.isNil:\\n result.left = tree.left.map(f)\\n if not tree.right.isNil:\\n result.right = tree.right.map(f)\\n\\n\\nproc print(tree: Tree; indent = 0) =\\n ## Print a tree.\\n let start = repeat(' ', indent)\\n echo start, \\\"value: \\\", tree.value\\n if tree.left.isNil:\\n echo start, \\\" nil\\\"\\n else:\\n print(tree.left, indent + 2)\\n if tree.right.isNil:\\n echo start, \\\" nil\\\"\\n else:\\n print(tree.right, indent + 2)\\n\\n\\nwhen isMainModule:\\n\\n echo \\\"Initial tree:\\\"\\n var tree = newTree[int](5)\\n tree.left = newTree[int](2)\\n tree.right = newTree[int](7)\\n print(tree)\\n\\n echo \\\"\\\"\\n echo \\\"Tree created by applying a function to each node:\\\"\\n let tree1 = tree.map((x) => 1 / x)\\n print(tree1)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"@interface Tree<T> : NSObject {\\n T value;\\n Tree<T> *left;\\n Tree<T> *right;\\n}\\n\\n- (void)replaceAll:(T)v;\\n@end\\n\\n@implementation Tree\\n- (void)replaceAll:(id)v {\\n value = v;\\n [left replaceAll:v];\\n [right replaceAll:v];\\n}\\n@end\\n\",\n \"language\": \"Objective-C\"\n },\n {\n \"code\": \"type 'a tree = Empty | Node of 'a * 'a tree * 'a tree\\n\\n(** val map_tree : ('a -> 'b) -> 'a tree -> 'b tree *)\\nlet rec map_tree f = function\\n | Empty -> Empty\\n | Node (x,l,r) -> Node (f x, map_tree f l, map_tree f r)\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #7060A8;\\\">sort</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"oranges\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"apples\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">}))</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">right</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">tmap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">data</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #004600;\\\">null</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tmap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #004600;\\\">null</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tmap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tree</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">rid</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">tree</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">null</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">null</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">add10</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.00</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Add some nodes.</span>\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.11</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.12</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.20</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">left</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.21</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">right</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1.22</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Now the tree has seven nodes.\\n\\n -- Show the whole tree.</span>\\n <span style=\\\"color: #7060A8;\\\">ppOpt</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #004600;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Modify the whole tree.</span>\\n <span style=\\\"color: #000000;\\\">root</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tmap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">add10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Create a whole new tree.</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">root2</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tmap</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">newnode</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Show the whole tree again.</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">root</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de mapTree (Tree Fun)\\n (set Tree (Fun (car Tree)))\\n (and (cadr Tree) (mapTree @ Fun))\\n (and (cddr Tree) (mapTree @ Fun)) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"% Tree Definition\\ntree(leaf(_)).\\ntree(branch(Left, Right)) :- tree(Left), tree(Right).\\n\\n% Definition of the addone function\\naddone(X, Y) :- Y is X + 1.\\n\\n% Definition of treewalk\\ntreewalk(leaf(Value), Func, leaf(NewValue)) :- call(Func, Value, NewValue).\\ntreewalk(branch(Left, Right), Func, branch(NewLeft, NewRight)) :-\\n treewalk(Left, Func, NewLeft),\\n treewalk(Right, Func, NewRight).\\n\\n% Execution\\nrun :-\\n X = branch(leaf(2), branch(leaf(3),leaf(4))),\\n treewalk(X, addone, Y),\\n write(Y).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"#lang typed/racket\\n\\n(define-type (Tree A) (U False (Node A)))\\n\\n(struct: (A) Node\\n ([val : A] [left : (Tree A)] [right : (Tree A)])\\n #:transparent)\\n\\n(: tree-map (All (A B) (A -> B) (Tree A) -> (Tree B)))\\n(define (tree-map f tree)\\n (match tree\\n [#f #f]\\n [(Node val left right)\\n (Node (f val) (tree-map f left) (tree-map f right))]))\\n\\n;; unit tests\\n(require typed/rackunit)\\n(check-equal?\\n (tree-map add1 (Node 5 (Node 3 #f #f) #f))\\n (Node 6 (Node 4 #f #f) #f))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"role BinaryTree[::T] {\\n has T $.value;\\n has BinaryTree[T] $.left;\\n has BinaryTree[T] $.right;\\n\\n method replace-all(T $value) {\\n $!value = $value;\\n $!left.replace-all($value) if $!left.defined;\\n $!right.replace-all($value) if $!right.defined;\\n }\\n}\\n\\nclass IntTree does BinaryTree[Int] { }\\n\\nmy IntTree $it .= new(value => 1,\\n left => IntTree.new(value => 2),\\n right => IntTree.new(value => 3));\\n\\n$it.replace-all(42);\\nsay $it;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program demonstrates (with displays) a method of parametric polymorphism. */\\ncall newRoot 1.00, 3 /*new root, and also indicate 3 stems.*/\\n /* [↓] no need to label the stems. */\\ncall addStem 1.10 /*a new stem and its initial value. */\\ncall addStem 1.11 /*\\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall addStem 1.12 /*\\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall addStem 1.20 /*\\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall addStem 1.21 /*\\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\ncall addStem 1.22 /*\\\" \\\" \\\" \\\" \\\" \\\" \\\" */\\n call sayNodes /*display some nicely formatted values.*/\\ncall modRoot 50 /*modRoot will add fifty to all stems. */\\n call sayNodes /*display some nicely formatted values.*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\naddStem: nodes= nodes + 1; do j=1 for stems; root.nodes.j= arg(1); end; return\\nnewRoot: parse arg @,stems; nodes= -1; call addStem copies('═',9); call addStem @; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nmodRoot: arg #; do j=1 for nodes /*traipse through all the defined nodes*/\\n do k=1 for stems /*add bias ──►───────────────────────┐ */\\n if datatype(root.j.k, 'N') then root.j.k= root.j.k + # /* ◄───┘ */\\n end /*k*/ /* [↑] add if stem value is numeric.*/\\n end /*j*/\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nsayNodes: w= 9; do j=0 to nodes; _= /*ensure each of the nodes gets shown. */\\n do k=1 for stems; _= _ center(root.j.k, w) /*concatenate a node.*/\\n end /*k*/\\n $= word('node='j, 1 + (j<1) ) /*define a label for this line's output*/\\n say center($, w) substr(_, 2) /*ignore 1st (leading) blank which was */\\n end /*j*/ /* [↑] caused by concatenation.*/\\n say /*show a blank line to separate outputs*/\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"struct TreeNode<T> {\\n value: T,\\n left: Option<Box<TreeNode<T>>>,\\n right: Option<Box<TreeNode<T>>>,\\n}\\n\\nimpl <T> TreeNode<T> {\\n fn my_map<U,F>(&self, f: &F) -> TreeNode<U> where\\n F: Fn(&T) -> U {\\n TreeNode {\\n value: f(&self.value),\\n left: match self.left {\\n None => None,\\n Some(ref n) => Some(Box::new(n.my_map(f))),\\n },\\n right: match self.right {\\n None => None,\\n Some(ref n) => Some(Box::new(n.my_map(f))),\\n },\\n }\\n }\\n}\\n\\nfn main() {\\n let root = TreeNode {\\n value: 3,\\n left: Some(Box::new(TreeNode {\\n value: 55,\\n left: None,\\n right: None,\\n })),\\n right: Some(Box::new(TreeNode {\\n value: 234,\\n left: Some(Box::new(TreeNode {\\n value: 0,\\n left: None,\\n right: None,\\n })),\\n right: None,\\n })),\\n };\\n root.my_map(&|x| { println!(\\\"{}\\\" , x)});\\n println!(\\\"---------------\\\");\\n let new_root = root.my_map(&|x| *x as f64 * 333.333f64);\\n new_root.my_map(&|x| { println!(\\\"{}\\\" , x) });\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"case class Tree[+A](value: A, left: Option[Tree[A]], right: Option[Tree[A]]) {\\n def map[B](f: A => B): Tree[B] =\\n Tree(f(value), left map (_.map(f)), right map (_.map(f)))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"class Employee(val name: String)\\nclass Manager(name: String) extends Employee(name)\\n\\nval t = Tree(new Manager(\\\"PHB\\\"), None, None)\\nval t2: Tree[Employee] = t\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def toName(e: Employee) = e.name\\nval treeOfNames = t.map(toName)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"trait Function1[-T1, +R]\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"case class Tree[+A](value: A, left: Option[Tree[A]], right: Option[Tree[A]]) {\\n def map[B](f: A => B): Tree[B] =\\n Tree(f(value), left map (_.map(f)), right map (_.map(f)))\\n def find[B >: A](what: B): Boolean =\\n (value == what) || left.map(_.find(what)).getOrElse(false) || right.map(_.find(what)).getOrElse(false)\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"if (t2.find(new Employee(\\\"Dilbert\\\")))\\n println(\\\"Call Catbert!\\\")\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"trait DFA {\\n type Element\\n val map = new collection.mutable.HashMap[Element, DFA]()\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func type: container (in type: elemType) is func\\n result\\n var type: container is void;\\n begin\\n container := array elemType;\\n\\n global\\n\\n const func container: map (in container: aContainer,\\n inout elemType: aVariable, ref func elemType: aFunc) is func\\n result\\n var container: mapResult is container.value;\\n begin\\n for aVariable range aContainer do\\n mapResult &:= aFunc;\\n end for;\\n end func;\\n\\n end global;\\n end func;\\n\\nconst type: intContainer is container(integer);\\nvar intContainer: container1 is [] (1, 2, 4, 6, 10, 12, 16, 18, 22);\\nvar intContainer: container2 is 0 times 0;\\n\\nconst proc: main is func\\n local\\n var integer: num is 0;\\n begin\\n container2 := map(container1, num, num + 1);\\n for num range container2 do\\n write(num <& \\\" \\\");\\n end for;\\n writeln;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"datatype 'a tree = Empty | Node of 'a * 'a tree * 'a tree\\n\\n(** val map_tree = fn : ('a -> 'b) -> 'a tree -> 'b tree *)\\nfun map_tree f Empty = Empty\\n | map_tree f (Node (x,l,r)) = Node (f x, map_tree f l, map_tree f r)\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"class Tree<T> {\\n var value: T?\\n var left: Tree<T>?\\n var right: Tree<T>?\\n\\n func replaceAll(value: T?) {\\n self.value = value\\n left?.replaceAll(value)\\n right?.replaceAll(value)\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"enum Tree<T> {\\n case Empty\\n indirect case Node(T, Tree<T>, Tree<T>)\\n\\n func map<U>(f : T -> U) -> Tree<U> {\\n switch(self) {\\n case .Empty : return .Empty\\n case let .Node(x, l, r): return .Node(f(x), l.map(f), r.map(f))\\n }\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"binary_tree_of \\\"node-type\\\" = \\\"node-type\\\"%hhhhWZAZ\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#import tag\\n\\n#fix general_type_fixer 1\\n\\nbinary_tree_of \\\"node-type\\\" = (\\\"node-type\\\",(binary_tree_of \\\"node-type\\\")%Z)%drWZwlwAZ\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"binary_tree_of = %-hhhhWZAZ\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"binary_tree_map \\\"f\\\" = ~&a^& ^A/\\\"f\\\"@an ~&amPfamPWB\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"binary_tree_map = ~&a^&+ ^A\\\\~&amPfamPWB+ @an\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"string_tree = binary_tree_of %s\\n\\nx = 'foo': ('bar': (),'baz': ())\\n\\n#cast string_tree\\n\\nexample = (binary_tree_map \\\"s\\\". \\\"s\\\"--\\\"s\\\") x\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Class BinaryTree(Of T)\\n ReadOnly Property Left As BinaryTree(Of T)\\n ReadOnly Property Right As BinaryTree(Of T)\\n ReadOnly Property Value As T\\n\\n Sub New(value As T, Optional left As BinaryTree(Of T) = Nothing, Optional right As BinaryTree(Of T) = Nothing)\\n Me.Value = value\\n Me.Left = left\\n Me.Right = right\\n End Sub\\n\\n Function Map(Of U)(f As Func(Of T, U)) As BinaryTree(Of U)\\n Return New BinaryTree(Of U)(f(Me.Value), Me.Left?.Map(f), Me.Right?.Map(f))\\n End Function\\n\\n Overrides Function ToString() As String\\n Dim sb As New Text.StringBuilder()\\n Me.ToString(sb, 0)\\n Return sb.ToString()\\n End Function\\n\\n Private Overloads Sub ToString(sb As Text.StringBuilder, depth As Integer)\\n sb.Append(New String(ChrW(AscW(vbTab)), depth))\\n sb.AppendLine(Me.Value?.ToString())\\n Me.Left?.ToString(sb, depth + 1)\\n Me.Right?.ToString(sb, depth + 1)\\n End Sub\\nEnd Class\\n\\nModule Program\\n Sub Main()\\n Dim b As New BinaryTree(Of Integer)(6, New BinaryTree(Of Integer)(5), New BinaryTree(Of Integer)(7))\\n Dim b2 As BinaryTree(Of Double) = b.Map(Function(x) x * 0.5)\\n\\n Console.WriteLine(b)\\n Console.WriteLine(b2)\\n End Sub\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"domains\\n tree{Type} = branch(tree{Type} Left, tree{Type} Right); leaf(Type Value).\\n\\nclass predicates\\n treewalk : (tree{X},function{X,Y}) -> tree{Y} procedure (i,i).\\n\\nclauses\\n treewalk(branch(Left,Right),Func) = branch(NewLeft,NewRight) :-\\n NewLeft = treewalk(Left,Func), NewRight = treewalk(Right,Func).\\n\\n treewalk(leaf(Value),Func) = leaf(X) :-\\n X = Func(Value).\\n\\n run():-\\n init(),\\n X = branch(leaf(2), branch(leaf(3),leaf(4))),\\n Y = treewalk(X,addone),\\n write(Y),\\n succeed().\\n\",\n \"language\": \"Visual-Prolog\"\n },\n {\n \"code\": \"class BinaryTree {\\n construct new(T, value) {\\n if (!(T is Class)) Fiber.abort (\\\"T must be a class.\\\")\\n if (value.type != T) Fiber.abort(\\\"Value must be of type T.\\\")\\n _kind = T\\n _value = value\\n _left = null\\n _right = null\\n }\\n\\n // constructor overload to enable kind to be inferred from type of value\\n static new (value) { new(value.type, value) }\\n\\n kind { _kind }\\n value { _value}\\n value=(v) {\\n if (v.type != _kind) Fiber.abort(\\\"Value must be of type %(_kind)\\\")\\n _value = v\\n }\\n\\n left { _left }\\n right { _right }\\n left=(b) {\\n if (b.type != BinaryTree || b.kind != _kind) {\\n Fiber.abort(\\\"Argument must be a BinaryTree of type %(_kind)\\\")\\n }\\n _left = b\\n }\\n right=(b) {\\n if (b.type != BinaryTree || b.kind != _kind) {\\n Fiber.abort(\\\"Argument must be a BinaryTree of type %(_kind)\\\")\\n }\\n _right = b\\n }\\n\\n map(f) {\\n var tree = BinaryTree.new(f.call(_value))\\n if (_left) tree.left = left.map(f)\\n if (_right) tree.right = right.map(f)\\n return tree\\n }\\n\\n showTopThree() { \\\"(%(left.value), %(value), %(right.value))\\\" }\\n}\\n\\nvar b = BinaryTree.new(6)\\nb.left = BinaryTree.new(5)\\nb.right = BinaryTree.new(7)\\nSystem.print(b.showTopThree())\\n\\nvar b2 = b.map{ |i| i * 10 }\\nSystem.print(b2.showTopThree())\\nb2.value = \\\"six\\\" // generates an error because \\\"six\\\" is not a Num\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parametric-polymorphism"}}},{"rowIdx":1484,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Parsing/RPN_calculator_algorithm\n","language":"00-META"},{"code":";Task:\nCreate a stack-based evaluator for an expression in [[wp:Reverse Polish notation|<u>r</u>everse <u>P</u>olish <u>n</u>otation (RPN)]] that also shows the changes in the stack as each individual token is processed ''as a table''.\n\n\n* Assume an input of a correct, space separated, string of tokens of an RPN expression\n* Test with the RPN expression generated from the [[Parsing/Shunting-yard algorithm]] task: <br>\n <big><big><code> 3 4 2 * 1 5 - 2 3 ^ ^ / + </code></big></big> \n* Print or display the output here\n\n\n;Notes:\n* <big><b> '''^''' </b></big> means exponentiation in the expression above.\n* <big><b> '''/''' </b></big> means division.\n\n\n;See also:\n* [[Parsing/Shunting-yard algorithm]] for a method of generating an RPN from an infix expression.\n* Several solutions to [[24 game/Solve]] make use of RPN evaluators (although tracing how they work is not a part of that task).\n* [[Parsing/RPN to infix conversion]].\n* [[Arithmetic evaluation]].\n<br><br>\n\n","language":"00-TASK"},{"code":"[Float] a\n[String = ((Float, Float) -> Float)] b\nb[‘+’] = (x, y) -> y + x\nb[‘-’] = (x, y) -> y - x\nb[‘*’] = (x, y) -> y * x\nb[‘/’] = (x, y) -> y / x\nb[‘^’] = (x, y) -> y ^ x\n\nL(c) ‘3 4 2 * 1 5 - 2 3 ^ ^ / +’.split(‘ ’)\n I c C b\n V first = a.pop()\n V second = a.pop()\n a.append(b[c](first, second))\n E\n a.append(Float(c))\n print(c‘ ’a)\n","language":"11l"},{"code":"* RPN calculator RC 25/01/2019\nREVPOL CSECT\n USING REVPOL,R13 base register\n B 72(R15) skip savearea\n DC 17F'0' savearea\n STM R14,R12,12(R13) save previous context\n ST R13,4(R15) link backward\n ST R15,8(R13) link forward\n LR R13,R15 set addressability\n XPRNT TEXT,L'TEXT print expression !?\n L R4,0 js=0 offset in stack\n LA R5,0 ns=0 number of stack items\n LA R6,0 jt=0 offset in text\n LA R7,TEXT r7=@text\n MVC CC,0(R7) cc first char of token\n DO WHILE=(CLI,CC,NE,X'00') do while cc<>'0'x\n MVC CTOK,=CL5' ' ctok=''\n MVC CTOK(1),CC ctok=cc\n CLI CC,C' ' if cc=' '\n BE ITERATE then goto iterate\n IF CLI,CC,GE,C'0',AND,CLI,CC,LE,C'9' THEN\n MVC DEED,=C'Load' deed='Load'\n XDECI R2,0(R7) r2=cint(text); r1=@text\n ST R2,STACK(R4) stack(js)=cc\n SR R1,R7 lt length of token\n BCTR R1,0 lt-1\n EX R1,MVCV MVC CTOK(\"R1\"),0(R7)\n AR R6,R1 jt+=lt-1\n AR R7,R1 @text+=lt-1\n LA R4,4(R4) js+=4\n LA R5,1(R5) ns++\n ELSE , else\n MVC DEED,=C'Exec' deed='Exec'\n LA R9,STACK-8(R4) @stack(j-1)\n IF CLI,CC,EQ,C'+' THEN if cc='+' then\n L R1,STACK-8(R4) stack(j-1)\n A R1,STACK-4(R4) stack(j-1)+stack(j)\n ST R1,0(R9) stack(j-1)=stack(j-1)+stack(j)\n ENDIF , endif\n IF CLI,CC,EQ,C'-' THEN if cc='-' then\n L R1,STACK-8(R4) stack(j-1)\n S R1,STACK-4(R4) stack(j-1)-stack(j)\n ST R1,0(R9) stack(j-1)=stack(j-1)-stack(j)\n ENDIF , endif\n IF CLI,CC,EQ,C'*' THEN if cc='*' then\n L R3,STACK-8(R4) stack(j-1)\n M R2,STACK-4(R4) stack(j-1)*stack(j)\n ST R3,0(R9) stack(j-1)=stack(j-1)*stack(j)\n ENDIF , endif\n IF CLI,CC,EQ,C'/' THEN if cc='/' then\n L R2,STACK-8(R4) stack(j-1)\n SRDA R2,32 for sign propagation\n D R2,STACK-4(R4) stack(j-1)/stack(j)\n ST R3,0(R9) stack(j-1)=stack(j-1)/stack(j)\n ENDIF , endif\n IF CLI,CC,EQ,C'^' THEN if cc='^' then\n LA R3,1 r3=1\n L R0,STACK-4(R4) r0=stack(j) [loop count]\nEXPONENT M R2,STACK-8(R4) r3=r3*stack(j-1)\n BCT R0,EXPONENT if r0--<>0 then goto exponent\n ST R3,0(R9) stack(j-1)=stack(j-1)^stack(j)\n ENDIF , endif\n S R4,=F'4' js-=4\n BCTR R5,0 ns--\n ENDIF , endif\n MVC PG,=CL80' ' clean buffer\n MVC PG(4),DEED output deed\n MVC PG+5(5),CTOK output cc\n MVC PG+11(6),=C'Stack:' output\n LA R2,1 i=1\n LA R3,STACK @stack\n LA R9,PG+18 @buffer\n DO WHILE=(CR,R2,LE,R5) do i=1 to ns\n L R1,0(R3) stack(i)\n XDECO R1,XDEC edit stack(i)\n MVC 0(5,R9),XDEC+7 output stack(i)\n LA R2,1(R2) i=i+1\n LA R3,4(R3) @stack+=4\n LA R9,6(R9) @buffer+=6\n ENDDO , enddo\n XPRNT PG,L'PG print\nITERATE LA R6,1(R6) jt++\n LA R7,1(R7) @text++\n MVC CC,0(R7) cc next char\n ENDDO , enddo\n L R1,STACK stack(1)\n XDECO R1,XDEC edit stack(1)\n MVC XDEC(4),=C'Val=' output\n XPRNT XDEC,L'XDEC print stack(1)\n L R13,4(0,R13) restore previous savearea pointer\n LM R14,R12,12(R13) restore previous context\n XR R15,R15 rc=0\n BR R14 exit\nMVCV MVC CTOK(0),0(R7) patern mvc\nTEXT DC C'3 4 2 * 1 5 - 2 3 ^ ^ / +',X'00'\nSTACK DS 16F stack(16)\nDEED DS CL4\nCC DS C\nCTOK DS CL5\nPG DS CL80\nXDEC DS CL12\n YREGS\n END REVPOL\n","language":"360-Assembly"},{"code":"INCLUDE \"D2:REAL.ACT\" ;from the Action! Tool Kit\n\nDEFINE PTR=\"CARD\"\nDEFINE BUFFER_SIZE=\"60\"\nDEFINE ENTRY_SIZE=\"6\"\nDEFINE MAX_SIZE=\"10\"\nBYTE ARRAY stack(BUFFER_SIZE)\nBYTE stackSize=[0]\n\nBYTE FUNC IsEmpty()\n IF stackSize=0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nPTR FUNC GetPtr(BYTE i)\nRETURN (stack+i*ENTRY_SIZE)\n\nPROC Push(REAL POINTER v)\n REAL POINTER p\n\n IF stackSize=MAX_SIZE THEN\n PrintE(\"Error: stack is full!\")\n Break()\n FI\n p=GetPtr(stackSize)\n RealAssign(v,p)\n stackSize==+1\nRETURN\n\nPROC Pop(REAL POINTER v)\n REAL POINTER p\n\n IF IsEmpty() THEN\n PrintE(\"Error: stack is empty!\")\n Break()\n FI\n stackSize==-1\n p=GetPtr(stackSize)\n RealAssign(p,v)\nRETURN\n\nPROC PrintStack()\n INT i\n REAL POINTER p\n\n FOR i=0 TO stackSize-1\n DO\n p=GetPtr(i)\n PrintR(p) Put(32)\n OD\n PutE()\nRETURN\n\nBYTE FUNC GetToken(CHAR ARRAY s BYTE start CHAR ARRAY t)\n BYTE pos\n\n pos=start\n WHILE pos<=s(0) AND s(pos)#'\n DO\n pos==+1\n OD\n SCopyS(t,s,start,pos-1)\nRETURN (pos)\n\nPROC MyPower(REAL POINTER base,exp,res)\n INT i,expI\n REAL tmp\n\n expI=RealToInt(exp)\n IF expI<0 THEN Break() FI\n\n IntToReal(1,res)\n FOR i=1 TO expI\n DO\n RealMult(res,base,tmp)\n RealAssign(tmp,res)\n OD\nRETURN\n\nPROC Process(CHAR ARRAY s)\n DEFINE Pop21=\"Pop(v2) Pop(v1)\"\n CHAR ARRAY t(100)\n BYTE i,j\n CHAR c\n REAL v1,v2,v3\n\n i=1\n WHILE i<=s(0)\n DO\n WHILE i<=s(0) AND s(i)='\n DO i==+1 OD\n IF i>s(0) THEN EXIT FI\n\n i=GetToken(s,i,t)\n IF SCompare(t,\"+\")=0 THEN\n Pop21 RealAdd(v1,v2,v3)\n Print(\"calc +: \")\n ELSEIF SCompare(t,\"-\")=0 THEN\n Pop21 RealSub(v1,v2,v3)\n Print(\"calc -: \")\n ELSEIF SCompare(t,\"*\")=0 THEN\n Pop21 RealMult(v1,v2,v3)\n Print(\"calc *: \")\n ELSEIF SCompare(t,\"/\")=0 THEN\n Pop21 RealDiv(v1,v2,v3)\n Print(\"calc /: \")\n ELSEIF SCompare(t,\"^\")=0 THEN\n Pop21 MyPower(v1,v2,v3)\n Print(\"calc ^: \")\n ELSE\n ValR(t,v3)\n PrintF(\"push %S: \",t)\n FI\n Push(v3)\n PrintStack()\n OD\nRETURN\n\nPROC Test(CHAR ARRAY s)\n PrintE(s) PutE()\n Process(s)\nRETURN\n\nPROC Main()\n Put(125) PutE() ;clear the screen\n Test(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\nRETURN\n","language":"Action-"},{"code":"with Ada.Text_IO, Ada.Containers.Vectors;\n\nprocedure RPN_Calculator is\n\n package IIO is new Ada.Text_IO.Float_IO(Float);\n\n package Float_Vec is new Ada.Containers.Vectors\n (Index_Type => Positive, Element_Type => Float);\n Stack: Float_Vec.Vector;\n\n Input: String := Ada.Text_IO.Get_Line;\n Cursor: Positive := Input'First;\n New_Cursor: Positive;\n\nbegin\n loop\n -- read spaces\n while Cursor <= Input'Last and then Input(Cursor)=' ' loop\n Cursor := Cursor + 1;\n end loop;\n\n exit when Cursor > Input'Last;\n\n New_Cursor := Cursor;\n while New_Cursor <= Input'Last and then Input(New_Cursor) /= ' ' loop\n New_Cursor := New_Cursor + 1;\n end loop;\n\n -- try to read a number and push it to the stack\n declare\n Last: Positive;\n Value: Float;\n X, Y: Float;\n begin\n IIO.Get(From => Input(Cursor .. New_Cursor - 1),\n Item => Value,\n Last => Last);\n Stack.Append(Value);\n Cursor := New_Cursor;\n\n exception -- if reading the number fails, try to read an operator token\n when others =>\n Y := Stack.Last_Element; Stack.Delete_Last; -- pick two elements\n X := Stack.Last_Element; Stack.Delete_Last; -- from the stack\n case Input(Cursor) is\n when '+' => Stack.Append(X+Y);\n when '-' => Stack.Append(X-Y);\n when '*' => Stack.Append(X*Y);\n when '/' => Stack.Append(X/Y);\n when '^' => Stack.Append(X ** Integer(Float'Rounding(Y)));\n when others => raise Program_Error with \"unecpected token '\"\n & Input(Cursor) & \"' at column\" & Integer'Image(Cursor);\n end case;\n Cursor := New_Cursor;\n end;\n\n for I in Stack.First_Index .. Stack.Last_Index loop\n Ada.Text_IO.Put(\" \");\n IIO.Put(Stack.Element(I), Aft => 5, Exp => 0);\n end loop;\n Ada.Text_IO.New_Line;\n end loop;\n\n Ada.Text_IO.Put(\"Result = \");\n IIO.Put(Item => Stack.Last_Element, Aft => 5, Exp => 0);\n\n\nend RPN_Calculator;\n","language":"Ada"},{"code":"# RPN Expression evaluator - handles numbers and + - * / ^ #\n# the right-hand operand for ^ is converted to an integer #\n\n# expression terminator #\nCHAR end of expression character = REPR 12;\n\n# evaluates the specified rpn expression #\nPROC evaluate = ( STRING rpn expression )VOID:\nBEGIN\n\n [ 256 ]REAL stack;\n INT stack pos := 0;\n\n # pops an element off the stack #\n PROC pop = REAL:\n BEGIN\n stack pos -:= 1;\n stack[ stack pos + 1 ]\n END; # pop #\n\n INT rpn pos := LWB rpn expression;\n\n # evaluate tokens from the expression until we get the end of expression #\n WHILE\n\n # get the next token from the string #\n\n STRING token type;\n REAL value;\n\n # skip spaces #\n WHILE rpn expression[ rpn pos ] = \" \"\n DO\n rpn pos +:= 1\n OD;\n\n # handle the token #\n IF rpn expression[ rpn pos ] = end of expression character\n THEN\n # no more tokens #\n FALSE\n\n ELSE\n # have a token #\n\n IF rpn expression[ rpn pos ] >= \"0\"\n AND rpn expression[ rpn pos ] <= \"9\"\n THEN\n # have a number #\n\n # find where the nmumber is in the expression #\n INT number start = rpn pos;\n WHILE ( rpn expression[ rpn pos ] >= \"0\"\n AND rpn expression[ rpn pos ] <= \"9\"\n )\n OR rpn expression[ rpn pos ] = \".\"\n DO\n rpn pos +:= 1\n OD;\n\n # read the number from the expression #\n FILE number f;\n associate( number f\n , LOC STRING := rpn expression[ number start : rpn pos - 1 ]\n );\n get( number f, ( value ) );\n close( number f );\n\n token type := \"number\"\n\n ELSE\n # must be an operator #\n CHAR op = rpn expression[ rpn pos ];\n rpn pos +:= 1;\n\n REAL arg1 := pop;\n REAL arg2 := pop;\n token type := op;\n\n value := IF op = \"+\"\n THEN\n # add the top two stack elements #\n arg1 + arg2\n ELIF op = \"-\"\n THEN\n # subtract the top two stack elements #\n arg2 - arg1\n ELIF op = \"*\"\n THEN\n # multiply the top two stack elements #\n arg2 * arg1\n ELIF op = \"/\"\n THEN\n # divide the top two stack elements #\n arg2 / arg1\n ELIF op = \"^\"\n THEN\n # raise op2 to the power of op1 #\n arg2 ^ ENTIER arg1\n ELSE\n # unknown operator #\n print( ( \"Unknown operator: \"\"\" + op + \"\"\"\", newline ) );\n 0\n FI\n\n FI;\n\n TRUE\n FI\n DO\n # push the new value on the stack and show the new stack #\n\n stack[ stack pos +:= 1 ] := value;\n\n print( ( ( token type + \" \" )[ 1 : 8 ] ) );\n FOR element FROM LWB stack TO stack pos\n DO\n print( ( \" \", fixed( stack[ element ], 8, 4 ) ) )\n OD;\n print( ( newline ) )\n\n OD;\n\n print( ( \"Result is: \", fixed( stack[ stack pos ], 12, 8 ), newline ) )\n\nEND; # evaluate #\n\nmain: (\n\n # get the RPN expresson from the user #\n\n STRING rpn expression;\n\n print( ( \"Enter expression: \" ) );\n read( ( rpn expression, newline ) );\n\n # add a space to terminate the final token and an expression terminator #\n rpn expression +:= \" \" + end of expression character;\n\n # execute the expression #\n evaluate( rpn expression )\n\n)\n","language":"ALGOL-68"},{"code":"1000 DECLARE EXTERNAL SUB rpn\n1010 PUBLIC NUMERIC R(64) ! stack\n1020 PUBLIC STRING expn$ ! for keyboard input\n1030 PUBLIC NUMERIC i, lenn, n, true, false ! global values\n1040 LET true = -1\n1050 LET false = 0\n1060 DO\n1070 PRINT \"enter an RPN expression:\"\n1080 INPUT expn$\n1090 IF LEN( expn$ ) = 0 THEN EXIT DO\n1100 PRINT \"expn: \";expn$\n1110 CALL rpn( expn$ )\n1120 LOOP\n1130 END\n1140 !\n1150 ! interpret reverse polish (postfix) expression\n1160 EXTERNAL SUB rpn( expn$ )\n1170 DECLARE EXTERNAL FUNCTION is_digit, get_number\n1180 DECLARE EXTERNAL SUB print_stack\n1190 DECLARE STRING ch$\n1200 LET expn$ = expn$ & \" \" ! must terminate line with space\n1210 LET lenn = LEN( expn$ )\n1220 LET i = 0\n1230 LET n = 1\n1240 LET R(n) = 0.0 ! push zero for unary operations\n1250 DO\n1260 IF i >= lenn THEN EXIT DO ! at end of line\n1270 LET i = i + 1\n1280 IF expn$(i:i) <> \" \" THEN ! skip white spaces\n1290 IF is_digit( expn$(i:i) ) = true THEN ! push number onto stack\n1300 LET n = n + 1\n1310 LET R(n) = get_number\n1320 CALL print_stack\n1330 ELSEIF expn$(i:i) = \"+\" then ! add and pop stack\n1340 IF n < 2 THEN\n1350 PRINT \"stack underflow\"\n1360 ELSE\n1370 LET R(n-1) = R(n-1) + R(n)\n1380 LET n = n - 1\n1390 CALL print_stack\n1400 END IF\n1410 ELSEIF expn$(i:i) = \"-\" then ! subtract and pop stack\n1420 IF n < 2 THEN\n1430 PRINT \"stack underflow\"\n1440 ELSE\n1450 LET R(n-1) = R(n-1) - R(n)\n1460 LET n = n - 1\n1470 CALL print_stack\n1480 END IF\n1490 ELSEIF expn$(i:i) = \"*\" then ! multiply and pop stack\n1500 IF n < 2 THEN\n1510 PRINT \"stack underflow\"\n1520 ELSE\n1530 LET R(n-1) = R(n-1) * R(n)\n1540 LET n = n - 1\n1550 CALL print_stack\n1560 END IF\n1570 ELSEIF expn$(i:i) = \"/\" THEN ! divide and pop stack\n1580 IF n < 2 THEN\n1590 PRINT \"stack underflow\"\n1600 ELSE\n1610 LET R(n-1) = R(n-1) / R(n)\n1620 LET n = n - 1\n1630 CALL print_stack\n1640 END IF\n1650 ELSEIF expn$(i:i) = \"^\" THEN ! raise to power and pop stack\n1660 IF n < 2 THEN\n1670 PRINT \"stack underflow\"\n1680 ELSE\n1690 LET R(n-1) = R(n-1) ^ R(n)\n1700 LET n = n - 1\n1710 CALL print_stack\n1720 END IF\n1730 ELSE\n1740 PRINT REPEAT$( \" \", i+5 ); \"^ error\"\n1750 EXIT DO\n1760 END IF\n1770 END IF\n1780 LOOP\n1790 PRINT \"result: \"; R(n) ! end of main program\n1800 END SUB\n1810 !\n1820 ! extract a number from a string\n1830 EXTERNAL FUNCTION get_number\n1840 DECLARE EXTERNAL FUNCTION is_digit\n1850 LET i1 = i ! start of number substring\n1860 DO ! get integer part\n1870 LET i = i + 1\n1880 IF is_digit( expn$(i:i) ) = false THEN\n1890 IF expn$(i:i) = \".\" THEN\n1900 LET i = i + 1\n1910 DO WHILE is_digit( expn$(i:i) ) = true ! get fractional part\n1920 LET i = i + 1\n1930 LOOP\n1940 END IF\n1950 EXIT DO\n1960 END IF\n1970 LOOP\n1980 LET get_number = VAL( expn$(i1:i - 1) )\n1990 END FUNCTION\n2000 !\n2010 ! check for digit character\n2020 EXTERNAL FUNCTION is_digit( ch$ )\n2030 IF \"0\" <= ch$ AND ch$ <= \"9\" THEN\n2040 LET is_digit = true\n2050 ELSE\n2060 LET is_digit = false\n2070 END IF\n2080 END FUNCTION\n2090 !\n2100 EXTERNAL SUB print_stack\n2110 PRINT expn$(i:i);\" \";\n2120 FOR ptr=n TO 2 STEP -1\n2130 PRINT USING \"-----%.####\":R(ptr);\n2140 NEXT ptr\n2150 PRINT\n2160 END SUB\n","language":"ANSI-BASIC"},{"code":"grammar rpnC ;\n//\n// rpn Calculator\n//\n// Nigel Galloway - April 7th., 2012\n//\n@members {\nStack<Double> s = new Stack<Double>();\n}\nrpn\t:\t(WS* (num|op) (WS | WS* NEWLINE {System.out.println(s.pop());}))*;\nnum\t:\t'-'? Digit+ ('.' Digit+)? {s.push(Double.parseDouble($num.text));};\nDigit\t:\t'0'..'9';\nop\t:\t'-' {double x = s.pop(); s.push(s.pop() - x);}\n\t|\t'/' {double x = s.pop(); s.push(s.pop() / x);}\n\t|\t'*' {s.push(s.pop() * s.pop());}\n\t|\t'^' {double x = s.pop(); s.push(Math.pow(s.pop(), x));}\n\t|\t'+' {s.push(s.pop() + s.pop());};\nWS\t:\t(' ' | '\\t'){skip()};\nNEWLINE\t:\t'\\r'? '\\n';\n","language":"ANTLR"},{"code":"evalRPN(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\nevalRPN(s){\n\tstack := []\n\tout := \"For RPN expression: '\" s \"'`r`n`r`nTOKEN`t`tACTION`t`t`tSTACK`r`n\"\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)\n\t\t\t\t, out .= t \"`tPush num onto top of stack`t\" stackShow(stack) \"`r`n\"\n\t\t\t\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:l = \"^\" ? b **a\n\t\t\t\t\t\t:0\t)\n\t\t\t\tout .= l \"`tApply op \" l \" to top of stack`t\" stackShow(stack) \"`r`n\"\n\t\t\t}\n\t\t}\n\tr := stack.Remove()\n\tout .= \"`r`n The final output value is: '\" r \"'\"\n\tclipboard := out\n\treturn r\n}\nStackShow(stack){\n\tfor each, value in stack\n\t\tout .= A_Space value\n\treturn subStr(out, 2)\n}\n","language":"AutoHotkey"},{"code":" @% = &60B\n RPN$ = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n\n DIM Stack(1000)\n SP% = 0\n\n FOR i% = 1 TO LEN(RPN$)\n Token$ = MID$(RPN$,i%,1)\n IF Token$ <> \" \" THEN\n PRINT Token$ \" :\";\n CASE Token$ OF\n WHEN \"+\": PROCpush(FNpop + FNpop)\n WHEN \"-\": PROCpush(-FNpop + FNpop)\n WHEN \"*\": PROCpush(FNpop * FNpop)\n WHEN \"/\": n = FNpop : PROCpush(FNpop / n)\n WHEN \"^\": n = FNpop : PROCpush(FNpop ^ n)\n WHEN \"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\":\n PROCpush(VALMID$(RPN$,i%))\n WHILE ASCMID$(RPN$,i%)>=48 AND ASCMID$(RPN$,1)<=57\n i% += 1\n ENDWHILE\n ENDCASE\n FOR j% = SP%-1 TO 0 STEP -1 : PRINT Stack(j%); : NEXT\n PRINT\n ENDIF\n NEXT i%\n END\n\n DEF PROCpush(n)\n IF SP% > DIM(Stack(),1) ERROR 100, \"Stack full\"\n Stack(SP%) = n\n SP% += 1\n ENDPROC\n\n DEF FNpop\n IF SP% = 0 ERROR 100, \"Stack empty\"\n SP% -= 1\n = Stack(SP%)\n","language":"BBC-BASIC"},{"code":"( ( show\n = line a\n . \\n:?line\n & whl\n ' (!arg:%?a ?arg&!a \" \" !line:?line)\n & put$(str$!line)\n )\n& :?stack\n& map\n $ ( (\n = a b\n . show$(!arg !stack)\n & ( !arg\n : ( \"+\"\n | \"-\"\n | \"*\"\n | \"/\"\n | \"^\"\n )\n & !stack:%?a %?b ?stack\n & ( !arg:\"+\"&!a+!b\n | !arg:\"-\"&-1*!a+!b\n | !arg:\"*\"&!a*!b\n | !arg:\"/\"&!a*!b^-1\n | !a^!b\n )\n | !arg\n )\n !stack\n : ?stack\n )\n . vap$((=.!arg).get'(,STR).\" \")\n )\n& out$!stack\n)\n","language":"Bracmat"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\nvoid die(const char *msg)\n{\n\tfprintf(stderr, \"%s\", msg);\n\tabort();\n}\n\n#define MAX_D 256\ndouble stack[MAX_D];\nint depth;\n\nvoid push(double v)\n{\n\tif (depth >= MAX_D) die(\"stack overflow\\n\");\n\tstack[depth++] = v;\n}\n\ndouble pop()\n{\n\tif (!depth) die(\"stack underflow\\n\");\n\treturn stack[--depth];\n}\n\ndouble rpn(char *s)\n{\n\tdouble a, b;\n\tint i;\n\tchar *e, *w = \" \\t\\n\\r\\f\";\n\n\tfor (s = strtok(s, w); s; s = strtok(0, w)) {\n\t\ta = strtod(s, &e);\n\t\tif (e > s)\t\tprintf(\" :\"), push(a);\n#define binop(x) printf(\"%c:\", *s), b = pop(), a = pop(), push(x)\n\t\telse if (*s == '+')\tbinop(a + b);\n\t\telse if (*s == '-')\tbinop(a - b);\n\t\telse if (*s == '*')\tbinop(a * b);\n\t\telse if (*s == '/')\tbinop(a / b);\n\t\telse if (*s == '^')\tbinop(pow(a, b));\n#undef binop\n\t\telse {\n\t\t\tfprintf(stderr, \"'%c': \", *s);\n\t\t\tdie(\"unknown oeprator\\n\");\n\t\t}\n\t\tfor (i = depth; i-- || 0 * putchar('\\n'); )\n\t\t\tprintf(\" %g\", stack[i]);\n\t}\n\n\tif (depth != 1) die(\"stack leftover\\n\");\n\n\treturn pop();\n}\n\nint main(void)\n{\n\tchar s[] = \" 3 4 2 * 1 5 - 2 3 ^ ^ / + \";\n\tprintf(\"%g\\n\", rpn(s));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <ctype.h>\n#include <string.h>\n#include <math.h>\n\n#define die(msg) fprintf(stderr, msg\"\\n\"), abort();\ndouble get(const char *s, const char *e, char **new_e)\n{\n\tconst char *t;\n\tdouble a, b;\n\n\tfor (e--; e >= s && isspace(*e); e--);\n\tfor (t = e; t > s && !isspace(t[-1]); t--);\n\n\tif (t < s) die(\"underflow\");\n\n#define get2(expr) b = get(s, t, (char **)&t), a = get(s, t, (char **)&t), a = expr\n\ta = strtod(t, (char **)&e);\n\tif (e <= t) {\n\t\tif\t(t[0] == '+') get2(a + b);\n\t\telse if (t[0] == '-') get2(a - b);\n\t\telse if (t[0] == '*') get2(a * b);\n\t\telse if (t[0] == '/') get2(a / b);\n\t\telse if (t[0] == '^') get2(pow(a, b));\n\t\telse {\n\t\t\tfprintf(stderr, \"'%c': \", t[0]);\n\t\t\tdie(\"unknown token\");\n\t\t}\n\t}\n#undef get2\n\n\t*(const char **)new_e = t;\n\treturn a;\n}\n\ndouble rpn(const char *s)\n{\n\tconst char *e = s + strlen(s);\n\tdouble v = get(s, e, (char**)&e);\n\n\twhile (e > s && isspace(e[-1])) e--;\n\tif (e == s) return v;\n\n\tfprintf(stderr, \"\\\"%.*s\\\": \", e - s, s);\n\tdie(\"front garbage\");\n}\n\nint main(void)\n{\n\tprintf(\"%g\\n\", rpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"));\n\treturn 0;\n}\n","language":"C"},{"code":"#include <vector>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <iterator>\n#include <cstdlib>\n\ndouble rpn(const std::string &expr){\n std::istringstream iss(expr);\n std::vector<double> stack;\n std::cout << \"Input\\tOperation\\tStack after\" << std::endl;\n std::string token;\n while (iss >> token) {\n std::cout << token << \"\\t\";\n double tokenNum;\n if (std::istringstream(token) >> tokenNum) {\n std::cout << \"Push\\t\\t\";\n stack.push_back(tokenNum);\n } else {\n std::cout << \"Operate\\t\\t\";\n double secondOperand = stack.back();\n stack.pop_back();\n double firstOperand = stack.back();\n stack.pop_back();\n if (token == \"*\")\n\tstack.push_back(firstOperand * secondOperand);\n else if (token == \"/\")\n\tstack.push_back(firstOperand / secondOperand);\n else if (token == \"-\")\n\tstack.push_back(firstOperand - secondOperand);\n else if (token == \"+\")\n\tstack.push_back(firstOperand + secondOperand);\n else if (token == \"^\")\n\tstack.push_back(std::pow(firstOperand, secondOperand));\n else { //just in case\n\tstd::cerr << \"Error\" << std::endl;\n\tstd::exit(1);\n }\n }\n std::copy(stack.begin(), stack.end(), std::ostream_iterator<double>(std::cout, \" \"));\n std::cout << std::endl;\n }\n return stack.back();\n}\n\nint main() {\n std::string s = \" 3 4 2 * 1 5 - 2 3 ^ ^ / + \";\n std::cout << \"Final answer: \" << rpn(s) << std::endl;\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Globalization;\nusing System.Threading;\n\nnamespace RPNEvaluator\n{\n class RPNEvaluator\n {\n static void Main(string[] args)\n {\n Thread.CurrentThread.CurrentCulture = CultureInfo.InvariantCulture;\n\n string rpn = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\";\n Console.WriteLine(\"{0}\\n\", rpn);\n\n decimal result = CalculateRPN(rpn);\n Console.WriteLine(\"\\nResult is {0}\", result);\n }\n\n static decimal CalculateRPN(string rpn)\n {\n string[] rpnTokens = rpn.Split(' ');\n Stack<decimal> stack = new Stack<decimal>();\n decimal number = decimal.Zero;\n\n foreach (string token in rpnTokens)\n {\n if (decimal.TryParse(token, out number))\n {\n stack.Push(number);\n }\n else\n {\n switch (token)\n {\n case \"^\":\n case \"pow\":\n {\n number = stack.Pop();\n stack.Push((decimal)Math.Pow((double)stack.Pop(), (double)number));\n break;\n }\n case \"ln\":\n {\n stack.Push((decimal)Math.Log((double)stack.Pop(), Math.E));\n break;\n }\n case \"sqrt\":\n {\n stack.Push((decimal)Math.Sqrt((double)stack.Pop()));\n break;\n }\n case \"*\":\n {\n stack.Push(stack.Pop() * stack.Pop());\n break;\n }\n case \"/\":\n {\n number = stack.Pop();\n stack.Push(stack.Pop() / number);\n break;\n }\n case \"+\":\n {\n stack.Push(stack.Pop() + stack.Pop());\n break;\n }\n case \"-\":\n {\n number = stack.Pop();\n stack.Push(stack.Pop() - number);\n break;\n }\n default:\n Console.WriteLine(\"Error in CalculateRPN(string) Method!\");\n break;\n }\n }\n PrintState(stack);\n }\n\n return stack.Pop();\n }\n\n static void PrintState(Stack<decimal> stack)\n {\n decimal[] arr = stack.ToArray();\n\n for (int i = arr.Length - 1; i >= 0; i--)\n {\n Console.Write(\"{0,-8:F3}\", arr[i]);\n }\n\n Console.WriteLine();\n }\n }\n}\n","language":"C-sharp"},{"code":"import ceylon.collection {\n\n\tArrayList\n}\n\nshared void run() {\n\t\n\tvalue ops = map {\n\t\t\"+\" -> plus<Float>,\n\t\t\"*\" -> times<Float>,\n\t\t\"-\" -> ((Float a, Float b) => a - b),\n\t\t\"/\" -> ((Float a, Float b) => a / b),\n\t\t\"^\" -> ((Float a, Float b) => a ^ b)\n\t};\n\t\n\tvoid printTableRow(String|Float token, String description, {Float*} stack) {\n\t\tprint(\"``token.string.padTrailing(8)````description.padTrailing(30)````stack``\");\n\t}\n\t\n\tfunction calculate(String input) {\n\t\t\n\t\tvalue stack = ArrayList<Float>();\n\t\tvalue tokens = input.split().map((String element)\n\t\t\t=> if(ops.keys.contains(element)) then element else parseFloat(element));\n\t\t\n\t\tprint(\"Token Operation Stack\");\n\t\t\n\t\tfor(token in tokens.coalesced) {\n\t\t\tif(is Float token) {\n\t\t\t\tstack.push(token);\n\t\t\t\tprintTableRow(token, \"push\", stack);\n\t\t\t} else if(exists op = ops[token], exists first = stack.pop(), exists second = stack.pop()) {\n\t\t\t\tvalue result = op(second, first);\n\t\t\t\tstack.push(result);\n\t\t\t\tprintTableRow(token, \"perform ``token`` on ``formatFloat(second, 1, 1)`` and ``formatFloat(first, 1, 1)``\", stack);\n\t\t\t} else {\n\t\t\t\tthrow Exception(\"bad syntax\");\n\t\t\t}\n\t\t}\n\t\treturn stack.pop();\n\t}\n\t\n\tprint(calculate(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"));\n}\n","language":"Ceylon"},{"code":"(ns rosettacode.parsing-rpn-calculator-algorithm\n (:require clojure.math.numeric-tower\n clojure.string\n clojure.pprint))\n\n(def operators\n \"the only allowable operators for our calculator\"\n {\"+\" +\n \"-\" -\n \"*\" *\n \"/\" /\n \"^\" clojure.math.numeric-tower/expt})\n\n(defn rpn\n \"takes a string and returns a lazy-seq of all the stacks\"\n [string]\n (letfn [(rpn-reducer [stack item] ; this takes a stack and one item and makes a new stack\n (if (contains? operators item)\n (let [operand-1 (peek stack) ; if we used lists instead of vectors, we could use destructuring, but stacks would look backwards\n stack-1 (pop stack)] ;we're assuming that all the operators are binary\n (conj (pop stack-1)\n ((operators item) (peek stack-1) operand-1)))\n (conj stack (Long. item))))] ; if it wasn't an operator, we'll assume it's a long. Could choose bigint, or even read-line\n (reductions rpn-reducer [] (clojure.string/split string #\"\\s+\")))) ;reductions is like reduce only shows all the intermediate steps\n\n(let [stacks (rpn \"3 4 2 * 1 5 - 2 3 ^ ^ / +\")] ;bind it so we can output the answer separately.\n (println \"stacks: \")\n (clojure.pprint/pprint stacks)\n (print \"answer:\" (->> stacks last first)))\n","language":"Clojure"},{"code":"% Split string by whitespace\nsplit = iter (expr: string) yields (string)\n own whitespace: string := \" \\r\\n\\t\"\n cur: array[char] := array[char]$[]\n for c: char in string$chars(expr) do\n if string$indexc(c, whitespace) = 0 then\n array[char]$addh(cur, c)\n else\n if array[char]$empty(cur) then continue end\n yield(string$ac2s(cur))\n cur := array[char]$[]\n end\n end\n if ~array[char]$empty(cur) then\n yield(string$ac2s(cur))\n end\nend split\n\n% Tokenize a RPN expression\ntoken = oneof[number: real, op: char]\ntokens = iter (expr: string) yields (token) signals (parse_error(string))\n own operators: string := \"+-*/^\"\n for t: string in split(expr) do\n if string$size(t) = 1 cand string$indexc(t[1], operators)~=0 then\n yield(token$make_op(t[1]))\n else\n yield(token$make_number(real$parse(t)))\n except when bad_format:\n signal parse_error(t)\n end\n end\n end\nend tokens\n\n% Print the stack\nprint_stack = proc (stack: array[real])\n po: stream := stream$primary_output()\n for num: real in array[real]$elements(stack) do\n stream$puts(po, f_form(num, 5, 5) || \" \")\n end\n stream$putl(po, \"\")\nend print_stack\n\n% Evaluate an expression, printing the stack at each point\nevaluate_rpn = proc (expr: string) returns (real) signals (parse_error(string), bounds)\n stack: array[real] := array[real]$[]\n for t: token in tokens(expr) do\n tagcase t\n tag number (n: real): array[real]$addh(stack, n)\n tag op (f: char):\n r: real := array[real]$remh(stack)\n l: real := array[real]$remh(stack)\n n: real\n if f='+' then n := l+r\n elseif f='-' then n := l-r\n elseif f='*' then n := l*r\n elseif f='/' then n := l/r\n elseif f='^' then n := l**r\n end\n array[real]$addh(stack, n)\n end\n print_stack(stack)\n end resignal parse_error\n return(array[real]$reml(stack))\nend evaluate_rpn\n\nstart_up = proc ()\n po: stream := stream$primary_output()\n expr: string := \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n\n stream$putl(po, \"Expression: \" || expr)\n stream$putl(po, \"Result: \" || f_form(evaluate_rpn(expr), 5, 5))\nend start_up\n","language":"CLU"},{"code":" IDENTIFICATION DIVISION.\n PROGRAM-ID. RPN.\n AUTHOR. Bill Gunshannon.\n INSTALLATION.\n DATE-WRITTEN. 9 Feb 2020.\n ************************************************************\n ** Program Abstract:\n ** Create a stack-based evaluator for an expression in\n ** reverse Polish notation (RPN) that also shows the\n ** changes in the stack as each individual token is\n ** processed as a table.\n ************************************************************\n\n DATA DIVISION.\n\n\n WORKING-STORAGE SECTION.\n\n 01 LineIn PIC X(25).\n 01 IP PIC 99\n VALUE 1.\n 01 CInNum PIC XXXX.\n\n 01 Stack PIC S999999V9999999\n OCCURS 50 times.\n 01 SP PIC 99\n VALUE 1.\n 01 Operator PIC X.\n 01 Value1 PIC S999999V9999999.\n 01 Value2 PIC S999999V9999999.\n 01 Result PIC S999999V9999999.\n 01 Idx PIC 99.\n 01 FormatNum PIC ZZZZZZ9.9999999.\n 01 Zip PIC X.\n\n PROCEDURE DIVISION.\n\n Main-Program.\n DISPLAY \"Enter the RPN Equation: \"\n WITH NO ADVANCING.\n ACCEPT LineIn.\n\n PERFORM UNTIL IP GREATER THAN\n FUNCTION STORED-CHAR-LENGTH(LineIn)\n\n\n UNSTRING LineIn DELIMITED BY SPACE INTO CInNum\n WITH POINTER IP\n\n MOVE CInNum TO Operator\n\n PERFORM Do-Operation\n\n PERFORM Show-Stack\n\n END-PERFORM.\n\n DISPLAY \"End Result: \" FormatNum\n\n STOP RUN.\n\n Do-Operation.\n\n EVALUATE Operator\n WHEN \"+\"\n PERFORM Pop\n Compute Result = Value2 + Value1\n PERFORM Push\n\n WHEN \"-\"\n PERFORM Pop\n Compute Result = Value2 - Value1\n PERFORM Push\n\n WHEN \"*\"\n PERFORM Pop\n Compute Result = Value2 * Value1\n PERFORM Push\n\n WHEN \"/\"\n PERFORM Pop\n Compute Result = Value2 / Value1\n PERFORM Push\n\n WHEN \"^\"\n PERFORM Pop\n Compute Result = Value2 ** Value1\n PERFORM Push\n\n WHEN NUMERIC\n MOVE Operator TO Result\n PERFORM Push\n END-EVALUATE.\n\n\n Show-Stack.\n\n DISPLAY \"STACK: \" WITH NO ADVANCING.\n MOVE 1 TO Idx.\n PERFORM UNTIL (Idx = SP)\n MOVE Stack(Idx) TO FormatNum\n IF Stack(Idx) IS NEGATIVE\n THEN\n DISPLAY \" -\" FUNCTION TRIM(FormatNum)\n WITH NO ADVANCING\n ELSE\n DISPLAY FormatNum WITH NO ADVANCING\n END-IF\n ADD 1 to Idx\n END-PERFORM.\n DISPLAY \" \".\n\n Push.\n\n MOVE Result TO Stack(SP)\n ADD 1 TO SP.\n\n Pop.\n\n SUBTRACT 1 FROM SP\n MOVE Stack(SP) TO Value1\n SUBTRACT 1 FROM SP\n MOVE Stack(SP) TO Value2.\n\n\n END-PROGRAM.\n","language":"COBOL"},{"code":"(setf (symbol-function '^) #'expt) ; Make ^ an alias for EXPT\n\n(defun print-stack (token stack)\n (format T \"~a: ~{~a ~}~%\" token (reverse stack)))\n\n(defun rpn (tokens &key stack verbose )\n (cond\n ((and (not tokens) (not stack)) 0)\n ((not tokens) (car stack))\n (T\n (let* ((current (car tokens))\n (next-stack (if (numberp current)\n (cons current stack)\n (let* ((arg2 (car stack))\n (arg1 (cadr stack))\n (fun (car tokens)))\n (cons (funcall fun arg1 arg2) (cddr stack))))))\n (when verbose\n (print-stack current next-stack))\n (rpn (cdr tokens) :stack next-stack :verbose verbose)))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.string, std.conv, std.typetuple;\n\nvoid main() {\n auto input = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\";\n writeln(\"For postfix expression: \", input);\n writeln(\"\\nToken Action Stack\");\n real[] stack;\n foreach (tok; input.split()) {\n auto action = \"Apply op to top of stack\";\n switch (tok) {\n foreach (o; TypeTuple!(\"+\", \"-\", \"*\", \"/\", \"^\")) {\n case o:\n mixin(\"stack[$ - 2]\" ~\n (o == \"^\" ? \"^^\" : o) ~ \"=stack[$ - 1];\");\n stack.length--;\n break;\n }\n break;\n default:\n action = \"Push num onto top of stack\";\n stack ~= to!real(tok);\n }\n writefln(\"%3s %-26s %s\", tok, action, stack);\n }\n writeln(\"\\nThe final value is \", stack[0]);\n}\n","language":"D"},{"code":"{This code normally exists in a library, but is presented here for clarity}\n\nfunction ExtractToken(S: string; Sep: char; var P: integer): string;\n{Extract token from S, starting at P up to but not including Sep}\n{Terminates with P pointing past Sep or past end of string}\nvar C: char;\nbegin\nResult:='';\nwhile P<=Length(S) do\n\tbegin\n\tC:=S[P]; Inc(P);\n\tif C=Sep then break\n\telse Result:=Result+C;\n\tend;\nend;\n\n{Create stack object to handle parsing}\n\ntype TRealStack = class(TObject)\n private\n Data: array of double;\n protected\n public\n function GetStackStr: string;\n procedure Push(D: double);\n function Pop: double;\n end;\n\nprocedure TRealStack.Push(D: double);\n{Push double on stack}\nbegin\nSetLength(Data,Length(Data)+1);\nData[High(Data)]:=D;\nend;\n\n\nfunction TRealStack.Pop: double;\n{Pop double off stack, raises exception if stack empty}\nbegin\nif Length(Data)<1 then raise exception.Create('Stack Empty');\nResult:=Data[High(Data)];\nSetLength(Data,Length(Data)-1);\nend;\n\n\nfunction TRealStack.GetStackStr: string;\n{Get string representation of stack data}\nvar I: integer;\nbegin\nResult:='';\nfor I:=0 to High(Data) do\n\tbegin\n\tif I<>0 then Result:=Result+', ';\n\tResult:=Result+FloatToStrF(Data[I],ffGeneral,18,4);\n\tend;\nend;\n\n\n\nprocedure RPNParser(Memo: TMemo; S: string);\n{Parse RPN string and display all operations}\nvar I: integer;\nvar Stack: TRealStack;\nvar Token: string;\nvar D: double;\n\n\n\tfunction HandleOperator(S: string): boolean;\n\t{Handle numerical operator command}\n\tvar Arg1,Arg2: double;\n\tbegin\n\tResult:=False;\n\t{Empty comand string? }\n\tif Length(S)>1 then exit;\n\t{Invalid command? }\n\tif not (S[1] in ['+','-','*','/','^']) then exit;\n\t{Get arguments off stack}\n\tArg1:=Stack.Pop; Arg2:=Stack.Pop;\n\tResult:=True;\n\t{Decode command}\n\tcase S[1] of\n\t '+': Stack.Push(Arg2 + Arg1);\n\t '-': Stack.Push(Arg2 - Arg1);\n\t '*': Stack.Push(Arg2 * Arg1);\n\t '/': Stack.Push(Arg2 / Arg1);\n\t '^': Stack.Push(Power(Arg2,Arg1));\n\t else Result:=False;\n\t end;\n\tend;\n\n\nbegin\nStack:=TRealStack.Create;\ntry\nI:=1;\nwhile true do\n\tbegin\n\t{Extract one token from string}\n\tToken:=ExtractToken(S,' ',I);\n\t{Exit if no more data}\n\tif Token='' then break;\n\t{If token is a number convert it to a double otherwise, process an operator}\n\tif Token[1] in ['0'..'9'] then Stack.Push(StrToFloat(Token))\n\telse if not HandleOperator(Token) then raise Exception.Create('Illegal Token: '+Token);\n\tMemo.Lines.Add(Token+' ['+Stack.GetStackStr+']');\n\tend;\nfinally Stack.Free; end;\nend;\n\n\nprocedure ShowRPNParser(Memo: TMemo);\nvar S: string;\nbegin\nS:='3 4 2 * 1 5 - 2 3 ^ ^ / + ';\nRPNParser(Memo,S);\nend;\n","language":"Delphi"},{"code":";; RPN (postfix) evaluator\n\n(lib 'hash)\n\n(define OPS (make-hash))\n(hash-set OPS \"^\" expt)\n(hash-set OPS \"*\" *)\n(hash-set OPS \"/\" //) ;; float divide\n(hash-set OPS \"+\" +)\n(hash-set OPS \"-\" -)\n\n(define (op? op) (hash-ref OPS op))\n\n;; algorithm : https://en.wikipedia.org/wiki/Reverse_Polish_notation#Postfix_algorithm\n\n(define (calculator rpn S)\n\t(for ((token rpn))\n\t(if (op? token)\n\t\t(let [(op2 (pop S)) (op1 (pop S))]\n\t\t\t(unless (and op1 op2) (error \"cannot calculate expression at:\" token))\n\t \t(push S ((op? token) op1 op2))\n\t \t(writeln op1 token op2 \"→\" (stack-top S)))\n\t (push S (string->number token))))\n\t(pop S))\n\t\n(define (task rpn)\n (define S (stack 'S))\n (calculator (text-parse rpn) S ))\n","language":"EchoLisp"},{"code":"open string generic monad io\n\ntype OpType = Push | Operate\n deriving Show\n\ntype Op = Op (OpType typ) input stack\n deriving Show\n\nparse str = split \" \" str\n\neval stack [] = []\neval stack (x::xs) = op :: eval nst xs\n where (op, nst) = conv x stack\n conv \"+\"@x = operate x (+)\n conv \"-\"@x = operate x (-)\n conv \"*\"@x = operate x (*)\n conv \"/\"@x = operate x (/)\n conv \"^\"@x = operate x (**)\n conv x = \\stack ->\n let n = gread x::stack in\n (Op Push x n, n)\n operate input fn (x::y::ys) =\n let n = (y `fn` x) :: ys in\n (Op Operate input n, n)\n\nprint_line (Op typ input stack) = do\n putStr input\n putStr \"\\t\"\n put typ\n putStr \"\\t\\t\"\n putLn stack\n\nprint ((Op typ input stack)@x::xs) lv = print_line x `seq` print xs (head stack)\nprint [] lv = lv\n\nprint_result xs = do\n putStrLn \"Input\\tOperation\\tStack after\"\n res <- return $ print xs 0\n putStrLn (\"Result: \" ++ show res)\n\nres = parse \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" |> eval []\nprint_result res ::: IO\n","language":"Ela"},{"code":"-module(rpn).\n-export([eval/1]).\n\nparse(Expression) ->\n parse(string:tokens(Expression,\" \"),[]).\n\nparse([],Expression) ->\n lists:reverse(Expression);\nparse([\"+\"|Xs],Expression) ->\n parse(Xs,[fun erlang:'+'/2|Expression]);\nparse([\"-\"|Xs],Expression) ->\n parse(Xs,[fun erlang:'-'/2|Expression]);\nparse([\"*\"|Xs],Expression) ->\n parse(Xs,[fun erlang:'*'/2|Expression]);\nparse([\"/\"|Xs],Expression) ->\n parse(Xs,[fun erlang:'/'/2|Expression]);\nparse([\"^\"|Xs],Expression) ->\n parse(Xs,[fun math:pow/2|Expression]);\nparse([X|Xs],Expression) ->\n {N,_} = string:to_integer(X),\n parse(Xs,[N|Expression]).\n\n%% The expression should be entered as a string of numbers and\n%% operators separated by spaces. No error handling is included if\n%% another string format is used.\neval(Expression) ->\n eval(parse(Expression),[]).\n\neval([],[N]) ->\n N;\neval([N|Exp],Stack) when is_number(N) ->\n NewStack = [N|Stack],\n print(NewStack),\n eval(Exp,NewStack);\neval([F|Exp],[X,Y|Stack]) ->\n NewStack = [F(Y,X)|Stack],\n print(NewStack),\n eval(Exp,NewStack).\n\nprint(Stack) ->\n lists:map(fun (X) when is_integer(X) -> io:format(\"~12.12b \",[X]);\n (X) when is_float(X) -> io:format(\"~12f \",[X]) end, Stack),\n io:format(\"~n\").\n","language":"Erlang"},{"code":"let reduce op = function\n | b::a::r -> (op a b)::r\n | _ -> failwith \"invalid expression\"\n\nlet interprete s = function\n | \"+\" -> \"add\", reduce ( + ) s\n | \"-\" -> \"subtr\", reduce ( - ) s\n | \"*\" -> \"mult\", reduce ( * ) s\n | \"/\" -> \"divide\", reduce ( / ) s\n | \"^\" -> \"exp\", reduce ( ** ) s\n | str -> \"push\", (System.Double.Parse str) :: s\n\nlet interp_and_show s inp =\n let op,s'' = interprete s inp\n printf \"%5s%8s \" inp op\n List.iter (printf \" %-6.3F\") (List.rev s'')\n printf \"\\n\";\n s''\n\nlet eval str =\n printfn \"Token Action Stack\";\n let ss = str.ToString().Split() |> Array.toList\n List.fold interp_and_show [] ss\n","language":"F-Sharp"},{"code":"IN: scratchpad 3 4 2 * 1 5 - 2 3 ^ ^ / +\n\n--- Data stack:\n3+1/8192\n","language":"Factor"},{"code":"{ 3 4 2 * 1 5 - 2 3 ^ ^ / + }\n[ dup pprint bl 1quotation call get-datastack . ] each\n","language":"Factor"},{"code":": ^ over swap 1 ?do over * loop nip ;\ns\" 3 4 2 * 1 5 - 2 3 ^ ^ / +\" evaluate .\n","language":"Forth"},{"code":": ^ over swap 1 ?do over * loop nip ;\n: detail\n begin\n cr .\" stack: \" .s\n bl word count dup\n 0<> while\n .\" , read: \" 2dup type evaluate\n repeat\n 2drop\n;\ndetail 3 4 2 * 1 5 - 2 3 ^ ^ / +\n","language":"Forth"},{"code":" REAL FUNCTION EVALRP(TEXT)\t!Evaluates a Reverse Polish string.\nCaution: deals with single digits only.\n CHARACTER*(*) TEXT\t!The RPN string.\n INTEGER SP,STACKLIMIT\t\t!Needed for the evaluation.\n PARAMETER (STACKLIMIT = 6)\t!This should do.\n REAL*8 STACK(STACKLIMIT)\t\t!Though with ^ there's no upper limit.\n INTEGER L,D\t\t!Assistants for the scan.\n CHARACTER*4 DEED\t\t!A scratchpad for the annotation.\n CHARACTER*1 C\t\t!The character of the moment.\n WRITE (6,1) TEXT\t!A function that writes messages... Improper.\n 1 FORMAT (\"Evaluation of the Reverse Polish string \",A,//\t!Still, it's good to see stuff.\n 1 \"Char Token Action SP:Stack...\")\t!Such as a heading for the trace.\n SP = 0\t\t\t!Commence with the stack empty.\n STACK = -666\t\t!This value should cause trouble.\n DO L = 1,LEN(TEXT)\t!Step through the text.\n C = TEXT(L:L)\t\t\t!Grab a character.\n IF (C.LE.\" \") CYCLE\t\t!Boring.\n D = ICHAR(C) - ICHAR(\"0\")\t!Uncouth test to check for a digit.\n IF (D.GE.0 .AND. D.LE.9) THEN\t!Is it one?\n DEED = \"Load\"\t\t\t!Yes. So, load its value.\n SP = SP + 1\t\t\t\t!By going up one.\n IF (SP.GT.STACKLIMIT) STOP \"Stack overflow!\"\t!Or, maybe not.\n STACK(SP) = D\t\t\t!And stashing the value.\n ELSE\t\t\t\t!Otherwise, it must be an operator.\n IF (SP.LT.2) STOP \"Stack underflow!\"\t!They all require two operands.\n DEED = \"XEQ\"\t\t!So, I'm about to do so.\n SELECT CASE(C)\t\t!Which one this time?\n CASE(\"+\"); STACK(SP - 1) = STACK(SP - 1) + STACK(SP)\t!A + B = B + A, so it is easy.\n CASE(\"-\"); STACK(SP - 1) = STACK(SP - 1) - STACK(SP)\t!A is in STACK(SP - 1), B in STACK(SP)\n CASE(\"*\"); STACK(SP - 1) = STACK(SP - 1)*STACK(SP)\t\t!Again, order doesn't count.\n CASE(\"/\"); STACK(SP - 1) = STACK(SP - 1)/STACK(SP)\t\t!But for division, A/B becomes A B /\n CASE(\"^\"); STACK(SP - 1) = STACK(SP - 1)**STACK(SP)\t!So, this way around.\n CASE DEFAULT\t\t!This should never happen!\n STOP \"Unknown operator!\"\t!If the RPN script is indeed correct.\n END SELECT\t\t\t!So much for that operator.\n SP = SP - 1\t\t!All of them take two operands and make one.\n END IF\t\t!So much for that item.\n WRITE (6,2) L,C,DEED,SP,STACK(1:SP)\t!Reveal the state now.\n 2 FORMAT (I4,A6,A7,I4,\":\",66F14.6)\t!Aligned with the heading of FORMAT 1.\n END DO\t\t\t!On to the next symbol.\n EVALRP = STACK(1)\t!The RPN string being correct, this is the result.\n END\t!Simple enough!\n\n PROGRAM HSILOP\n REAL V\n V = EVALRP(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\t!The specified example.\n WRITE (6,*) \"Result is...\",V\n END\n","language":"Fortran"},{"code":"#define NULL 0\n\ntype node\n 'implement the stack as a linked list\n n as double\n p as node ptr\nend type\n\nfunction spctok( byref s as string ) as string\n 'returns everything in the string up to the first space\n 'modifies the original string to begin at the fist non-space char after the first space\n dim as string r\n dim as double i = 1\n while mid(s,i,1)<>\" \" and i<=len(s)\n r += mid(s,i,1)\n i+=1\n wend\n do\n i+=1\n loop until mid(s,i,1)<>\" \" or i >= len(s)\n s = right(s,len(s)-i+1)\n return r\nend function\n\nsub print_stack( byval S as node ptr )\n 'display everything on the stack\n print \"Stack <--- \";\n while S->p <> NULL\n S = S->p\n print S->n;\" \";\n wend\n print\nend sub\n\nsub push( byval S as node ptr, v as double )\n 'push a value onto the stack\n dim as node ptr x\n x = allocate(sizeof(node))\n x->n = v\n x->p = S->p\n S->p = x\nend sub\n\nfunction pop( byval S as node ptr ) as double\n 'pop a value from the stack\n if s->P = NULL then return -99999\n dim as double r = S->p->n\n dim as node ptr junk = S->p\n S->p = S->p->p\n deallocate(junk)\n return r\nend function\n\ndim as string s = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\", c\ndim as node StackHead\n\nwhile len(s) > 0\n c = spctok(s)\n print \"Token: \";c;\" \";\n select case c\n case \"+\"\n push(@StackHead, pop(@StackHead) + pop(@StackHead))\n print \"Operation + \";\n case \"-\"\n push(@StackHead, -(pop(@StackHead) - pop(@StackHead)))\n print \"Operation - \";\n case \"/\"\n push(@StackHead, 1./(pop(@StackHead) / pop(@StackHead)))\n print \"Operation / \";\n case \"*\"\n push(@StackHead, pop(@StackHead) * pop(@StackHead))\n print \"Operation * \";\n case \"^\"\n push(@StackHead, pop(@StackHead) ^ pop(@StackHead))\n print \"Operation ^ \";\n case else\n push(@StackHead, val(c))\n print \"Operation push \";\n end select\n print_stack(@StackHead)\nwend\n","language":"FreeBASIC"},{"code":"def evaluate( expr ) =\n stack = []\n\n for token <- expr.split( '''\\s+''' )\n case number( token )\n Some( n ) ->\n stack = n : stack\n println( \"push $token: ${stack.reversed()}\" )\n None ->\n case {'+': (+), '-': (-), '*': (*), '/': (/), '^': (^)}.>get( token )\n Some( op ) ->\n stack = op( stack.tail().head(), stack.head() ) : stack.tail().tail()\n println( \"perform $token: ${stack.reversed()}\" )\n None -> error( \"unrecognized operator '$token'\" )\n\n stack.head()\n\nres = evaluate( '3 4 2 * 1 5 - 2 3 ^ ^ / +' )\nprintln( res + (if res is Integer then '' else \" or ${float(res)}\") )\n","language":"FunL"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math\"\n \"strconv\"\n \"strings\"\n)\n\nvar input = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n\nfunc main() {\n fmt.Printf(\"For postfix %q\\n\", input)\n fmt.Println(\"\\nToken Action Stack\")\n var stack []float64\n for _, tok := range strings.Fields(input) {\n action := \"Apply op to top of stack\"\n switch tok {\n case \"+\":\n stack[len(stack)-2] += stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n case \"-\":\n stack[len(stack)-2] -= stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n case \"*\":\n stack[len(stack)-2] *= stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n case \"/\":\n stack[len(stack)-2] /= stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n case \"^\":\n stack[len(stack)-2] =\n math.Pow(stack[len(stack)-2], stack[len(stack)-1])\n stack = stack[:len(stack)-1]\n default:\n action = \"Push num onto top of stack\"\n f, _ := strconv.ParseFloat(tok, 64)\n stack = append(stack, f)\n }\n fmt.Printf(\"%3s %-26s %v\\n\", tok, action, stack)\n }\n fmt.Println(\"\\nThe final value is\", stack[0])\n}\n","language":"Go"},{"code":"def evaluateRPN(expression) {\n def stack = [] as Stack\n def binaryOp = { action -> return { action.call(stack.pop(), stack.pop()) } }\n def actions = [\n '+': binaryOp { a, b -> b + a },\n '-': binaryOp { a, b -> b - a },\n '*': binaryOp { a, b -> b * a },\n '/': binaryOp { a, b -> b / a },\n '^': binaryOp { a, b -> b ** a }\n ]\n expression.split(' ').each { item ->\n def action = actions[item] ?: { item as BigDecimal }\n stack.push(action.call())\n\n println \"$item: $stack\"\n }\n assert stack.size() == 1 : \"Unbalanced Expression: $expression ($stack)\"\n stack.pop()\n}\n","language":"Groovy"},{"code":"println evaluateRPN('3 4 2 * 1 5 - 2 3 ^ ^ / +')\n","language":"Groovy"},{"code":"10 REM Parsing/RPN calculator algorithm\n20 MAX.INDEX% = 63\n30 REM Stack\n40 REM TOP.INDEX% - top index of the stack\n50 DIM ELEMS(MAX.INDEX%)\n60 EXPR$ = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\": GOSUB 200\n70 END\n190 REM ** Evaluate the expression in RPN\n200 GOSUB 1000\n210 PRINT \"Input\", \"Operation\", \"Stack after\"\n220 REM SP% - start position of token, DP% - position of delimiter\n230 DP% = 0\n240 REM Loop: do ... until DP% = 0\n250 SP% = DP% + 1\n260 DP% = INSTR(DP% + 1, EXPR$, \" \")\n270 IF DP% = 0 THEN TOKEN$ = MID$(EXPR$, SP%, LEN(EXPR$) - SP% + 1) ELSE TE% = DP% - 1: TOKEN$ = MID$(EXPR$, SP%, DP% - SP%)\n280 PRINT TOKEN$,\n290 IF TOKEN$ <> \"*\" THEN 350\n300 PRINT \"Operate\",\n310 GOSUB 1060: SECOND = POP\n320 GOSUB 1060: FIRST = POP\n330 X = FIRST * SECOND: GOSUB 1160\n340 GOTO 610\n350 IF TOKEN$ <> \"/\" THEN 410\n360 PRINT \"Operate\",\n370 GOSUB 1060: SECOND = POP\n380 GOSUB 1060: FIRST = POP\n390 X = FIRST / SECOND: GOSUB 1160\n400 GOTO 610\n410 IF TOKEN$ <> \"-\" THEN 470\n420 PRINT \"Operate\",\n430 GOSUB 1060: SECOND = POP\n440 GOSUB 1060: FIRST = POP\n450 X = FIRST - SECOND: GOSUB 1160\n460 GOTO 610\n470 IF TOKEN$ <> \"+\" THEN 530\n480 PRINT \"Operate\",\n490 GOSUB 1060: SECOND = POP\n500 GOSUB 1060: FIRST = POP\n510 X = FIRST + SECOND: GOSUB 1160\n520 GOTO 610\n530 IF TOKEN$ <> \"^\" THEN 590\n540 PRINT \"Operate\",\n550 GOSUB 1060: SECOND = POP\n560 GOSUB 1060: FIRST = POP\n570 X = FIRST ^ SECOND: GOSUB 1160\n580 GOTO 610\n590 PRINT \"Push\",\n600 X = VAL(TOKEN$): GOSUB 1160\n610 GOSUB 1100\n620 IF DP% <> 0 THEN 250\n630 GOSUB 1060:\n640 PRINT \"Final answer: \"; POP\n650 GOSUB 1030\n660 IF NOT EMPTY% THEN PRINT \"Error, too many operands: \"; : GOSUB 1100: STOP\n670 RETURN\n980 REM ** Operations on the stack\n990 REM ** Make the stack empty\n1000 TOP.INDEX% = MAX.INDEX% + 1\n1010 RETURN\n1020 REM ** Is the stack empty?\n1030 EMPTY% = TOP.INDEX% > MAX.INDEX%\n1040 RETURN\n1050 REM ** Pop from the stack\n1060 GOSUB 1030\n1070 IF NOT EMPTY% THEN POP = ELEMS(TOP.INDEX%): TOP.INDEX% = TOP.INDEX% + 1 ELSE PRINT \"The stack is empty.\": STOP\n1080 RETURN\n1090 REM ** Print the stack\n1100 FOR PTR% = TOP.INDEX% TO MAX.INDEX%\n1110 PRINT USING \"######.###\"; ELEMS(PTR%);\n1120 NEXT PTR%\n1130 PRINT\n1140 RETURN\n1150 REM ** Push to the stack\n1160 IF TOP.INDEX% > 0 THEN TOP.INDEX% = TOP.INDEX% - 1: ELEMS(TOP.INDEX%) = X ELSE PRINT \"The stack is full.\": STOP\n1170 RETURN\n","language":"GW-BASIC"},{"code":"calcRPN :: String -> [Double]\ncalcRPN = foldl interprete [] . words\n\ninterprete s x\n | x `elem` [\"+\",\"-\",\"*\",\"/\",\"^\"] = operate x s\n | otherwise = read x:s\n where\n operate op (x:y:s) = case op of\n \"+\" -> x + y:s\n \"-\" -> y - x:s\n \"*\" -> x * y:s\n \"/\" -> y / x:s\n \"^\" -> y ** x:s\n","language":"Haskell"},{"code":"calcRPNLog :: String -> ([Double],[(String, [Double])])\ncalcRPNLog input = mkLog $ zip commands $ tail result\n where result = scanl interprete [] commands\n commands = words input\n mkLog [] = ([], [])\n mkLog res = (snd $ last res, res)\n","language":"Haskell"},{"code":"import Control.Monad (foldM)\n\ncalcRPNIO :: String -> IO [Double]\ncalcRPNIO = foldM (verbose interprete) [] . words\n\nverbose f s x = write (x ++ \"\\t\" ++ show res ++ \"\\n\") >> return res\n where res = f s x\n","language":"Haskell"},{"code":"class Monad m => Logger m where\n write :: String -> m ()\n\ninstance Logger IO where write = putStr\ninstance a ~ String => Logger (Writer a) where write = tell\n\nverbose2 f x y = write (show x ++ \" \" ++\n show y ++ \" ==> \" ++\n show res ++ \"\\n\") >> return res\n where res = f x y\n","language":"Haskell"},{"code":"calcRPNM :: Logger m => String -> m [Double]\ncalcRPNM = foldM (verbose interprete) [] . words\n","language":"Haskell"},{"code":"procedure main()\n EvalRPN(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\nend\n\nlink printf\ninvocable all\n\nprocedure EvalRPN(expr) #: evaluate (and trace stack) an RPN string\n\n stack := []\n expr ? until pos(0) do {\n tab(many(' ')) # consume previous seperator\n token := tab(upto(' ')|0) # get token\n if token := numeric(token) then { # ... numeric\n push(stack,token)\n printf(\"pushed numeric %i : %s\\n\",token,list2string(stack))\n }\n else { # ... operator\n every b|a := pop(stack) # pop & reverse operands\n case token of {\n \"+\"|\"-\"|\"*\"|\"^\" : push(stack,token(a,b))\n \"/\" : push(stack,token(real(a),b))\n default : runerr(205,token)\n }\n printf(\"applied operator %s : %s\\n\",token,list2string(stack))\n }\n }\nend\n\nprocedure list2string(L) #: format list as a string\n every (s := \"[ \") ||:= !L || \" \"\n return s || \"]\"\nend\n","language":"Icon"},{"code":" a: , <;._1 ' ' , '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n┌┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┐\n││3│4│2│*│1│5│-│2│3│^│^│/│+│\n└┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┘\n","language":"J"},{"code":" isOp=: '_+-*/^' e.~ {.@>@{.\n mo=: 1 :'(}: , u@{:) @ ['\n dy=: 1 :'(_2&}. , u/@(_2&{.)) @ ['\n dispatch=: (-mo)`(+dy)`(-dy)`(*dy)`(%dy)`(^dy)@.('_+-*/^' i. {.@>@])\n doShift=: (<@, \".@>@{.) , }.@]\n doApply=: }.@] ,~ [ <@dispatch {.@]\n consume=: [: ([ smoutput@>@{.) >@{. doShift`doApply@.(isOp@]) }.\n consume ^: (<:@#) a: , <;._1 ' ' , '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n3\n3 4\n3 4 2\n3 8\n3 8 1\n3 8 1 5\n3 8 _4\n3 8 _4 2\n3 8 _4 2 3\n3 8 _4 8\n3 8 65536\n3 0.00012207\n3.00012\n┌───────┐\n│3.00012│\n└───────┘\n consume ^: (<:@#) a: , <;._1 ' ' , '3 _ 4 +'\n3\n_3\n_3 4\n1\n┌─┐\n│1│\n└─┘\n","language":"J"},{"code":"rpn=: 3 :0\n queue=. |.3 :'|.3 :y 0'::]each;: y\n op=. 1 :'2 (u~/@:{.,}.)S:0 ,@]'\n ops=. +op`(-op)`(*op)`(%op)`(^op)`(,&;)\n choose=. ((;:'+-*/^')&i.@[)\n ,ops@.choose/queue\n)\n","language":"J"},{"code":" rpn '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n3.00012\n","language":"J"},{"code":"rpnD=: 3 :0\n queue=. |.3 :'|.3 :y 0'::]each;: y\n op=. 1 :'2 (u~/@:{.,}.)S:0 ,@([smoutput)@]'\n ops=. +op`(-op)`(*op)`(%op)`(^op)`(,&;)\n choose=. ((;:'+-*/^')&i.@[)\n ,ops@.choose/queue\n)\n","language":"J"},{"code":" rpnD '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n┌─────┐\n│2 4 3│\n└─────┘\n5 1 8 3\n3 2 _4 8 3\n8 _4 8 3\n65536 8 3\n0.00012207 3\n3.00012\n","language":"J"},{"code":"import java.util.LinkedList;\n\npublic class RPN{\n\tpublic static void main(String[] args) {\n\t\tevalRPN(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\");\n\t}\n\n\tprivate static void evalRPN(String expr){\n\t\tLinkedList<Double> stack = new LinkedList<Double>();\n\t\tSystem.out.println(\"Input\\tOperation\\tStack after\");\n\t\tfor (String token : expr.split(\"\\\\s\")){\n\t\t\tSystem.out.print(token + \"\\t\");\n\t\t\tif (token.equals(\"*\")) {\n\t\t\t\tSystem.out.print(\"Operate\\t\\t\");\n\t\t\t\tdouble secondOperand = stack.pop();\n\t\t\t\tdouble firstOperand = stack.pop();\n\t\t\t\tstack.push(firstOperand * secondOperand);\n\t\t\t} else if (token.equals(\"/\")) {\n\t\t\t\tSystem.out.print(\"Operate\\t\\t\");\n\t\t\t\tdouble secondOperand = stack.pop();\n\t\t\t\tdouble firstOperand = stack.pop();\n\t\t\t\tstack.push(firstOperand / secondOperand);\n\t\t\t} else if (token.equals(\"-\")) {\n\t\t\t\tSystem.out.print(\"Operate\\t\\t\");\n\t\t\t\tdouble secondOperand = stack.pop();\n\t\t\t\tdouble firstOperand = stack.pop();\n\t\t\t\tstack.push(firstOperand - secondOperand);\n\t\t\t} else if (token.equals(\"+\")) {\n\t\t\t\tSystem.out.print(\"Operate\\t\\t\");\n\t\t\t\tdouble secondOperand = stack.pop();\n\t\t\t\tdouble firstOperand = stack.pop();\n\t\t\t\tstack.push(firstOperand + secondOperand);\n\t\t\t} else if (token.equals(\"^\")) {\n\t\t\t\tSystem.out.print(\"Operate\\t\\t\");\n\t\t\t\tdouble secondOperand = stack.pop();\n\t\t\t\tdouble firstOperand = stack.pop();\n\t\t\t\tstack.push(Math.pow(firstOperand, secondOperand));\n\t\t\t} else {\n\t\t\t\tSystem.out.print(\"Push\\t\\t\");\n\t\t\t\ttry {\n\t\t\t\t\tstack.push(Double.parseDouble(token+\"\"));\n\t\t\t\t} catch (NumberFormatException e) {\n \t\t\t\t\tSystem.out.println(\"\\nError: invalid token \" + token);\n \t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tSystem.out.println(stack);\n\t\t}\n\t\tif (stack.size() > 1) {\n\t\t\tSystem.out.println(\"Error, too many operands: \" + stack);\n\t\t\treturn;\n\t\t}\n\t\tSystem.out.println(\"Final answer: \" + stack.pop());\n\t}\n}\n","language":"Java"},{"code":"const e = '3 4 2 * 1 5 - 2 3 ^ ^ / +';\nconst s = [], tokens = e.split(' ');\nfor (const t of tokens) {\n const n = Number(t);\n if (!isNaN(n)) {\n s.push(n);\n } else {\n if (s.length < 2) {\n throw new Error(`${t}: ${s}: insufficient operands.`);\n }\n const o2 = s.pop(), o1 = s.pop();\n switch (t) {\n case '+': s.push(o1 + o2); break;\n case '-': s.push(o1 - o2); break;\n case '*': s.push(o1 * o2); break;\n case '/': s.push(o1 / o2); break;\n case '^': s.push(Math.pow(o1, o2)); break;\n default: throw new Error(`Unrecognized operator: [${t}]`);\n }\n }\n console.log(`${t}: ${s}`);\n}\n\nif (s.length > 1) {\n throw new Error(`${s}: insufficient operators.`);\n}\n","language":"JavaScript"},{"code":"# Input: an array representing a stack, with .[-1] being its top.\n# Output: the updated array after applying `op`\ndef rpn(op):\n def two: .[-2:];\n def update($x): (.[:-2] + [$x]);\n if length<=1 then .\n elif op == \"+\" then update(two | add)\n elif op == \"*\" then update(two | (.[0] * .[1]))\n elif op == \"/\" then update(two | (.[0] / .[1]))\n elif op == \"-\" then update(two | (.[0] - .[1]))\n elif op == \"^\" then update(two | (pow(.[0]; .[1])))\n else (\"ignoring unrecognized op \\(op)\" | debug) as $debug | .\n end;\n\ndef eval:\n foreach .[] as $item ([];\n if ($item | type) == \"number\" then . + [$item]\n else rpn($item)\n end;\n \"\\($item) => \\(.)\" ) ;\n\n\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n| split(\" \") | map( (try tonumber) // .)\n| eval\n","language":"Jq"},{"code":"function rpn(s)\n stack = Any[]\n for op in map(eval, map(parse, split(s)))\n if isa(op, Function)\n arg2 = pop!(stack)\n arg1 = pop!(stack)\n push!(stack, op(arg1, arg2))\n else\n push!(stack, op)\n end\n println(\"$op: \", join(stack, \", \"))\n end\n length(stack) != 1 && error(\"invalid RPN expression $s\")\n return stack[1]\nend\nrpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n","language":"Julia"},{"code":"// version 1.1.2\n\nfun rpnCalculate(expr: String) {\n if (expr.isEmpty()) throw IllegalArgumentException(\"Expresssion cannot be empty\")\n println(\"For expression = $expr\\n\")\n println(\"Token Action Stack\")\n val tokens = expr.split(' ').filter { it != \"\" }\n val stack = mutableListOf<Double>()\n for (token in tokens) {\n val d = token.toDoubleOrNull()\n if (d != null) {\n stack.add(d)\n println(\" $d Push num onto top of stack $stack\")\n }\n else if ((token.length > 1) || (token !in \"+-*/^\")) {\n throw IllegalArgumentException(\"$token is not a valid token\")\n }\n else if (stack.size < 2) {\n throw IllegalArgumentException(\"Stack contains too few operands\")\n }\n else {\n val d1 = stack.removeAt(stack.lastIndex)\n val d2 = stack.removeAt(stack.lastIndex)\n stack.add(when (token) {\n \"+\" -> d2 + d1\n \"-\" -> d2 - d1\n \"*\" -> d2 * d1\n \"/\" -> d2 / d1\n else -> Math.pow(d2, d1)\n })\n println(\" $token Apply op to top of stack $stack\")\n }\n }\n println(\"\\nThe final value is ${stack[0]}\")\n}\n\nfun main(args: Array<String>) {\n val expr = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n rpnCalculate(expr)\n}\n","language":"Kotlin"},{"code":"{calc 3 4 2 * 1 5 - 2 3 pow pow / +}\n->\n 3:\n 4: 3\n 2: 4 3\n *: 2 4 3\n 1: 8 3\n 5: 1 8 3\n -: 5 1 8 3\n 2: -4 8 3\n 3: 2 -4 8 3\n pow: 3 2 -4 8 3\n pow: 8 -4 8 3\n /: 65536 8 3\n +: 0.0001220703125 3\n -> 3.0001220703125\n\nwhere\n\n{def calc\n {def calc.r\n {lambda {:x :s}\n {if {empty? :x}\n then -> {car :s}\n else {car :x}: {disp :s}{br}\n {calc.r {cdr :x}\n {if {unop? {car :x}}\n then {cons {{car :x} {car :s}} {cdr :s}}\n else {if {binop? {car :x}}\n then {cons {{car :x} {car {cdr :s}} {car :s}} {cdr {cdr :s}}}\n else {cons {car :x} :s}} }}}}}\n {lambda {:s}\n {calc.r {list :s} nil}}}\n\nusing the unop? & binop? functions to test unary and binary operators\n\n{def unop?\n {lambda {:op}\n {or {W.equal? :op sqrt} // n sqrt sqrt(n)\n {W.equal? :op exp} // n exp exp(n)\n {W.equal? :op log} // n log log(n)\n {W.equal? :op cos} // n cos cos(n)\n ... and so // ...\n}}}\n\n{def binop?\n {lambda {:op}\n {or {W.equal? :op +} // m n + m+n\n {W.equal? :op -} // m n - m-n\n {W.equal? :op *} // m n * m*n\n {W.equal? :op /} // m n / m/n\n {W.equal? :op %} // m n % m%n\n {W.equal? :op pow} // m n pow m^n\n ... and so on // ...\n}}}\n\nand the list, empty? and disp functions to create\na list from a string, test its emptynes and display it.\n\n{def list\n {lambda {:s}\n {if {W.empty? {S.rest :s}}\n then {cons {S.first :s} nil}\n else {cons {S.first :s} {list {S.rest :s}}}}}}\n\n{def empty?\n {lambda {:x}\n {W.equal? :x nil}}}\n\n{def disp\n {lambda {:l}\n {if {empty? :l}\n then\n else {car :l} {disp {cdr :l}}}}}\n\nNote that everything is exclusively built on 5 lambdatalk primitives:\n- \"cons, car, cdr\", to create lists,\n- \"W.equal?\" which test the equality between two words,\n- and the \"or\" boolean function.\n","language":"Kotlin"},{"code":"global stack$\n\nexpr$ = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\nprint \"Expression:\"\nprint expr$\nprint\n\nprint \"Input\",\"Operation\",\"Stack after\"\n\nstack$=\"\"\ntoken$ = \"#\"\ni = 1\ntoken$ = word$(expr$, i)\ntoken2$ = \" \"+token$+\" \"\n\ndo\n print \"Token \";i;\": \";token$,\n select case\n 'operation\n case instr(\"+-*/^\",token$)<>0\n print \"operate\",\n op2$=pop$()\n op1$=pop$()\n if op1$=\"\" then\n print \"Error: stack empty for \";i;\"-th token: \";token$\n end\n end if\n\n op1=val(op1$)\n op2=val(op2$)\n\n select case token$\n case \"+\"\n res = op1+op2\n case \"-\"\n res = op1-op2\n case \"*\"\n res = op1*op2\n case \"/\"\n res = op1/op2\n case \"^\"\n res = op1^op2\n end select\n\n call push str$(res)\n 'default:number\n case else\n print \"push\",\n call push token$\n end select\n print \"Stack: \";reverse$(stack$)\n i = i+1\n token$ = word$(expr$, i)\n token2$ = \" \"+token$+\" \"\nloop until token$ =\"\"\n\nres$=pop$()\nprint\nprint \"Result:\" ;res$\nextra$=pop$()\nif extra$<>\"\" then\n print \"Error: extra things on a stack: \";extra$\nend if\nend\n\n'---------------------------------------\nfunction reverse$(s$)\n reverse$ = \"\"\n token$=\"#\"\n while token$<>\"\"\n i=i+1\n token$=word$(s$,i,\"|\")\n reverse$ = token$;\" \";reverse$\n wend\nend function\n'---------------------------------------\nsub push s$\n stack$=s$+\"|\"+stack$ 'stack\nend sub\n\nfunction pop$()\n 'it does return empty on empty stack\n pop$=word$(stack$,1,\"|\")\n stack$=mid$(stack$,instr(stack$,\"|\")+1)\nend function\n","language":"Liberty-BASIC"},{"code":"local stack = {}\nfunction push( a ) table.insert( stack, 1, a ) end\nfunction pop()\n if #stack == 0 then return nil end\n return table.remove( stack, 1 )\nend\nfunction writeStack()\n for i = #stack, 1, -1 do\n io.write( stack[i], \" \" )\n end\n print()\nend\nfunction operate( a )\n local s\n if a == \"+\" then\n push( pop() + pop() )\n io.write( a .. \"\\tadd\\t\" ); writeStack()\n elseif a == \"-\" then\n s = pop(); push( pop() - s )\n io.write( a .. \"\\tsub\\t\" ); writeStack()\n elseif a == \"*\" then\n push( pop() * pop() )\n io.write( a .. \"\\tmul\\t\" ); writeStack()\n elseif a == \"/\" then\n s = pop(); push( pop() / s )\n io.write( a .. \"\\tdiv\\t\" ); writeStack()\n elseif a == \"^\" then\n s = pop(); push( pop() ^ s )\n io.write( a .. \"\\tpow\\t\" ); writeStack()\n elseif a == \"%\" then\n s = pop(); push( pop() % s )\n io.write( a .. \"\\tmod\\t\" ); writeStack()\n else\n push( tonumber( a ) )\n io.write( a .. \"\\tpush\\t\" ); writeStack()\n end\nend\nfunction calc( s )\n local t, a = \"\", \"\"\n print( \"\\nINPUT\", \"OP\", \"STACK\" )\n for i = 1, #s do\n a = s:sub( i, i )\n if a == \" \" then operate( t ); t = \"\"\n else t = t .. a\n end\n end\n if a ~= \"\" then operate( a ) end\n print( string.format( \"\\nresult: %.13f\", pop() ) )\nend\n--[[ entry point ]]--\ncalc( \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" )\ncalc( \"22 11 *\" )\n","language":"Lua"},{"code":"Module Rpn_Calc {\n\tRem Form 80,60\n\tfunction rpn_calc(a$) {\n\t\tdef m=0\n\t\tdim token$()\n\t\ttoken$()=piece$(a$,\" \")\n\t\tl=len(token$())\n\t\tdim type(l)=0, reg(l)\n\t\twhere=-1\n\t\tfor i=0 to l-1\n\t\t\tc=val(token$(i),\"\",m)\n\t\t\tif m>-1 then\n\t\t\t\twhere++\n\t\t\t\treg(where)=c\n\t\t\telse\n\t\t\t\treg(where-1)=eval(str$(reg(where-1))+token$(i)+str$(reg(where)))\n\t\t\t\twhere--\n\t\t\tend if\n\t\t\tinf=each(reg(),1, where+1)\n\t\t\twhile inf\n\t\t\t\texport$<=token$(i)+\" [\"+str$(inf^,\"\")+\"] \"+ str$(array(inf))+{\n\t\t\t\t}\n\t\t\t\ttoken$(i)=\" \"\n\t\t\tend while\n\t\tnext i\n\t\t=reg(0)\n\t}\n\tGlobal export$\n\tdocument export$\n\texample1=rpn_calc(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n\texample2=rpn_calc(\"1 2 + 3 4 + ^ 5 6 + ^\")\n\tPrint example1, example2\n\tRem Print #-2, Export$\n\tClipBoard Export$\n}\nRpn_Calc\n","language":"M2000-Interpreter"},{"code":"calc[rpn_] :=\n Module[{tokens = StringSplit[rpn], s = \"(\" <> ToString@InputForm@# <> \")\" &, op, steps},\n op[o_, x_, y_] := ToExpression[s@x <> o <> s@y];\n steps = FoldList[Switch[#2, _?DigitQ, Append[#, FromDigits[#2]],\n _, Append[#[[;; -3]], op[#2, #[[-2]], #[[-1]]]]\n ] &, {}, tokens][[2 ;;]];\n Grid[Transpose[{# <> \":\" & /@ tokens,\n StringRiffle[ToString[#, InputForm] & /@ #] & /@ steps}]]];\nPrint[calc[\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"]];\n","language":"Mathematica"},{"code":"rmod(i, j) := mod(j, i)$\nrpow(x, y) := y^x$\n\nrpn(sexpr) := (\n operands: [],\n expr: charlist(sexpr),\n\n for token in expr do (\n if token = \"+\" then (\n push(pop(operands) + pop(operands), operands)\n )\n elseif token = \"-\" then (\n push(-1 * (pop(operands) - pop(operands)), operands)\n )\n elseif token = \"*\" then (\n push(pop(operands) * pop(operands), operands)\n )\n elseif token = \"/\" then (\n push(1 / (pop(operands) / pop(operands)), operands)\n )\n elseif token = \"%\" then (\n push(rmod(pop(operands), pop(operands)), operands)\n )\n elseif token = \"^\" then (\n push(rpow(pop(operands), pop(operands)), operands)\n )\n elseif token # \" \" then (\n push(parse_string(token), operands)\n ),\n\n if token # \" \" then (\n print(token, \" : \", operands)\n )\n ),\n\n pop(operands)\n)$\n\nrpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"), numer;\n","language":"Maxima"},{"code":"(%i5) ev(rpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"),numer)\n3 : [3]\n4 : [4, 3]\n2 : [2, 4, 3]\n* : [8, 3]\n1 : [1, 8, 3]\n5 : [5, 1, 8, 3]\n- : [- 4, 8, 3]\n2 : [2, - 4, 8, 3]\n3 : [3, 2, - 4, 8, 3]\n^ : [8, - 4, 8, 3]\n^ : [65536, 8, 3]\n/ : [1.220703125e-4, 3]\n+ : [3.0001220703125]\n(%o5) 3.0001220703125\n","language":"Maxima"},{"code":"RPN = function(inputText)\n tokens = inputText.split\n stack = []\n while tokens\n tok = tokens.pull\n if \"+-*/^\".indexOf(tok) != null then\n b = stack.pop\n a = stack.pop\n if tok == \"+\" then stack.push a + b\n if tok == \"-\" then stack.push a - b\n if tok == \"*\" then stack.push a * b\n if tok == \"/\" then stack.push a / b\n if tok == \"^\" then stack.push a ^ b\n else\n stack.push val(tok)\n end if\n print tok + \" --> \" + stack\n end while\n return stack[0]\nend function\n\nprint RPN(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n","language":"MiniScript"},{"code":".ig\n RPN parser implementation in TROFF\n\n..\n.\\\" \\(*A stack implementation\n.nr Ac 0\n.af Ac 1\n.de APUSH\n.if (\\\\n(Ac>=0)&(\\\\n(Ac<27) \\{ \\\n.\tnr Ac +1\n.\taf Ac A\n.\tnr A\\\\n(Ac \\\\$1\n.\taf Ac 1\n\\}\n..\n.de APOP\n.if (\\\\n(Ac>0)&(\\\\n(Ac<27) \\{ \\\n.\taf Ac A\n.\trr A\\\\n(Ac \\\\$1\n.\taf Ac 1\n.\tnr Ac -1\n..\n.\\\" Facility to print entire stack\n.de L2\n.af Ac 1\n.if \\\\n(Li<=\\\\n(Ac \\{ \\\n.\taf Li A\n\\\\n(A\\\\n(Li\n.\taf Li 1\n.\tnr Li +1\n.\tL2\n\\}\n..\n.de APRINT\n.nr Li 1\n.L2\n.br\n..\n.\\\" Integer exponentiation algorithm\n.de L1\n.if \\\\n(Li<\\\\$2 \\{ \\\n.\tnr Rs \\\\n(Rs*\\\\$1\n.\tnr Li +1\n.\tL1 \\\\$1 \\\\$2\n\\}\n..\n.de EXP\n.nr Li 0\n.nr Rs 1\n.L1 \\\\$1 \\\\$2\n..\n.\\\" RPN Parser\n.de REAP\n.af Ac A\n.nr O2 \\\\n(A\\\\n(Ac\n.af Ac 1\n.nr Ai \\\\n(Ac-1\n.af Ai A\n.nr O1 \\\\n(A\\\\n(Ai\n.APOP\n.APOP\n..\n.de RPNPUSH\n.ie '\\\\$1'+' \\{ \\\n.\tREAP\n.\tnr Rs \\\\n(O1+\\\\n(O2\n\\}\n.el \\{ \\\n.\tie '\\\\$1'-' \\{ \\\n.\t\tREAP\n.\t\tnr Rs \\\\n(O1-\\\\n(O2\n\\}\n.\tel \\{ \\\n.\t\tie '\\\\$1'*' \\{ \\\n.\t\t\tREAP\n.\t\t\tnr Rs \\\\n(O1*\\\\n(O2\n\\}\n.\t\tel \\{ \\\n.\t\t\tie '\\\\$1'/' \\{ \\\n.\t\t\t\tREAP\n.\t\t\t\tnr Rs \\\\n(O1/\\\\n(O2\n\\}\n.\t\t\tel \\{ \\\n.\t\t\t\tie '\\\\$1'%' \\{ \\\n.\t\t\t\t\tREAP\n.\t\t\t\t\tnr Rs \\\\n(O1%\\\\n(O2\n\\}\n.\t\t\t\tel \\{ \\\n.\t\t\t\t\tie '\\\\$1'^' \\{ \\\n.\t\t\t\t\t\tREAP\n.\t\t\t\t\t\tEXP \\\\n(O1 \\\\n(O2\n\\}\n.\t\t\t\t\tel .nr Rs \\\\$1\n\\}\n\\}\n\\}\n\\}\n\\}\n.APUSH \\\\n(Rs\n.APRINT\n..\n.de RPNPRINT\n.if \\\\n(Ac>1 .tm ERROR (rpn.roff): Malformed input expression. Evaluation stack size: \\\\n(Ac > 1 .\n\\\\n(AA\n..\n.de RPNPARSE\n.RPNPUSH \\\\$1\n.ie \\\\n(.$>1 \\{ \\\n.\tshift\n.\tRPNPARSE \\\\$@\n\\}\n.el .RPNPRINT\n..\n.RPNPARSE 3 4 2 * 1 5 - 2 3 ^ ^ / + \\\" Our input expression\n","language":"N-t-roff"},{"code":" 3\n 3 4\n 3 4 2\n 3 8\n 3 8 1\n 3 8 1 5\n 3 8 ‐4\n 3 8 ‐4 2\n 3 8 ‐4 2 3\n 3 8 ‐4 8\n 3 8 16\n 3 0\n 3\n3\n","language":"N-t-roff"},{"code":".ig\n===========================\n Array implementation\n===========================\n..\n.de end\n..\n.de array\n.\tnr \\\\$1.c 0 1\n.\tde \\\\$1.push end\n.\t\tnr \\\\$1..\\\\\\\\n+[\\\\$1.c] \\\\\\\\$1\n.\tend\n.\tde \\\\$1.pop end\n.\t\tif \\\\\\\\n[\\\\$1.c]>0 \\{ \\\n.\t\t\trr \\\\$1..\\\\\\\\n[\\\\$1.c]\n.\t\t\tnr \\\\$1.c -1\\\n.\t\t\\}\n.\tend\n.\tde \\\\$1.dump end\n.\t\tnr i 0 1\n.\t\trm ou\n.\t\twhile \\\\\\\\n+i<=\\\\\\\\n[\\\\$1.c] \\{ \\\n.\t\t\tas ou \"\\\\\\\\n[\\\\$1..\\\\\\\\ni]\n.\t\t\\}\n.\t\ttm \\\\\\\\*(ou\n.\t\trr i\n.\tend\n..\n.ig\n==========================\n End array implementation\n==========================\n..\n.array stack\n.de hyper3\n.\tnr rs 1\n.\tnr i 0 1\n.\twhile \\\\n+i<=\\\\$2 .nr rs \\\\n(rs*\\\\$1\n.\trr i\n..\n.de pop2\n.\tnr O2 \\\\n[\\\\$1..\\\\n[\\\\$1.c]]\n.\t\\\\$1.pop\n.\tnr O1 \\\\n[\\\\$1..\\\\n[\\\\$1.c]]\n.\t\\\\$1.pop\n..\n.de rpn\n.\tie '\\\\$1'+' \\{ \\\n.\t\tpop2 stack\n.\t\tnr rs \\\\n(O1+\\\\n(O2\n.\t\\}\n.\tel \\{ \\\n.\tie '\\\\$1'-' \\{ \\\n.\t\tpop2 stack\n.\t\tnr rs \\\\n(O1-\\\\n(O2\n.\t\\}\n.\tel \\{ \\\n.\tie '\\\\$1'*' \\{ \\\n.\t\tpop2 stack\n.\t\tnr rs \\\\n(O1*\\\\n(O2\n.\t\\}\n.\tel \\{ \\\n.\tie '\\\\$1'/' \\{ \\\n.\t\tpop2 stack\n.\t\tnr rs \\\\n(O1/\\\\n(O2\n.\t\\}\n.\tel \\{ \\\n.\tie '\\\\$1'%' \\{ \\\n.\t\tpop2 stack\n.\t\tnr rs \\\\n(O1%\\\\n(O2\n.\t\\}\n.\tel \\{ \\\n.\tie '\\\\$1'^' \\{ \\\n.\t\tpop2 stack\n.\t\thyper3 \\\\n(O1 \\\\n(O2\n.\t\\}\n.\tel .nr rs \\\\$1\n.\t\\}\\}\\}\\}\\}\n.\n.\tstack.push \\\\n(rs\n.\tstack.dump\n.\n.\tif \\\\n(.$>1 \\{ \\\n.\t\tshift\n.\t\trpn \\\\$@\n.\t\\}\n..\n.rpn 3 4 2 * 1 5 - 2 3 ^ ^ / +\n.stack.dump\n","language":"N-t-roff"},{"code":"3\n3 4\n3 4 2\n3 8\n3 8 1\n3 8 1 5\n3 8 -4\n3 8 -4 2\n3 8 -4 2 3\n3 8 -4 8\n3 8 16\n3 0\n3\n3\n","language":"N-t-roff"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nnumeric digits 20\n\nrpnDefaultExpression = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\nEODAD = '.*'\n\nparse arg rpnString\n\nif rpnString = '.' then rpnString = rpnDefaultExpression\nif rpnString = '' then do\n say 'Enter numbers or operators [to stop enter' EODAD']:'\n loop label rpnloop forever\n rpnval = ask\n if rpnval == EODAD then leave rpnloop\n rpnString = rpnString rpnval\n end rpnloop\n end\n\nrpnString = rpnString.space(1)\nsay rpnString':' evaluateRPN(rpnString)\n\nreturn\n\n-- -----------------------------------------------------------------------------\nmethod evaluateRPN(rpnString) public static returns Rexx\n\n stack = LinkedList()\n op = 0\n L = 'L'\n R = 'R'\n rpnString = rpnString.strip('b')\n say 'Input\\tOperation\\tStack after'\n loop label rpn while rpnString.length > 0\n parse rpnString token rest\n rpnString = rest.strip('b')\n say token || '\\t\\-'\n select label tox case token\n when '*' then do\n say 'Operate\\t\\t\\-'\n op[R] = Rexx stack.pop()\n op[L] = Rexx stack.pop()\n stack.push(op[L] * op[R])\n end\n when '/' then do\n say 'Operate\\t\\t\\-'\n op[R] = Rexx stack.pop()\n op[L] = Rexx stack.pop()\n stack.push(op[L] / op[R])\n end\n when '+' then do\n say 'Operate\\t\\t\\-'\n op[R] = Rexx stack.pop()\n op[L] = Rexx stack.pop()\n stack.push(op[L] + op[R])\n end\n when '-' then do\n say 'Operate\\t\\t\\-'\n op[R] = Rexx stack.pop()\n op[L] = Rexx stack.pop()\n stack.push(op[L] - op[R])\n end\n when '^' then do\n say 'Operate\\t\\t\\-'\n op[R] = Rexx stack.pop()\n op[L] = Rexx stack.pop()\n -- If exponent is a whole number use Rexx built-in exponentiation operation, otherwise use Math.pow()\n op[R] = op[R] + 0\n if op[R].datatype('w') then stack.push(op[L] ** op[R])\n else stack.push(Rexx Math.pow(op[L], op[R]))\n end\n otherwise do\n if token.datatype('n') then do\n say 'Push\\t\\t\\-'\n stack.push(token)\n end\n else do\n say 'Error\\t\\t\\-'\n end\n end\n end tox\n calc = Rexx\n say stack.toString\n end rpn\n say\n calc = stack.toString\n return calc\n","language":"NetRexx"},{"code":"import math, rdstdin, strutils, tables\n\ntype Stack = seq[float]\n\nproc opPow(s: var Stack) =\n let b = s.pop\n let a = s.pop\n s.add a.pow b\n\nproc opMul(s: var Stack) =\n let b = s.pop\n let a = s.pop\n s.add a * b\n\nproc opDiv(s: var Stack) =\n let b = s.pop\n let a = s.pop\n s.add a / b\n\nproc opAdd(s: var Stack) =\n let b = s.pop\n let a = s.pop\n s.add a + b\n\nproc opSub(s: var Stack) =\n let b = s.pop\n let a = s.pop\n s.add a - b\n\nproc opNum(s: var Stack; num: float) =\n s.add num\n\nlet ops = toTable({\"^\": opPow,\n \"*\": opMul,\n \"/\": opDiv,\n \"+\": opAdd,\n \"-\": opSub})\n\nproc getInput(inp = \"\"): seq[string] =\n var inp = inp\n if inp.len == 0:\n inp = readLineFromStdin \"Expression: \"\n result = inp.strip.split\n\nproc rpnCalc(tokens: seq[string]): seq[seq[string]] =\n var s: Stack\n result = @[@[\"TOKEN\",\"ACTION\",\"STACK\"]]\n for token in tokens:\n var action = \"\"\n if ops.hasKey token:\n action = \"Apply op to top of stack\"\n ops[token](s)\n else:\n action = \"Push num onto top of stack\"\n s.opNum token.parseFloat\n result.add(@[token, action, s.join(\" \")])\n\nlet rpn = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\necho \"For RPN expression: \", rpn\nlet rp = rpnCalc rpn.getInput\n\nvar maxColWidths = newSeq[int](rp[0].len)\nfor i in 0 .. rp[0].high:\n for x in rp:\n maxColWidths[i] = max(maxColWidths[i], x[i].len + 3)\n\nfor x in rp:\n for i, y in x:\n stdout.write y.alignLeft(maxColWidths[i])\n echo \"\"\n","language":"Nim"},{"code":"use IO;\nuse Struct;\n\nbundle Default {\n class RpnCalc {\n function : Main(args : String[]) ~ Nil {\n Caculate(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\");\n }\n\n function : native : Caculate(rpn : String) ~ Nil {\n rpn->PrintLine();\n\n tokens := rpn->Split(\" \");\n stack := FloatVector->New();\n each(i : tokens) {\n token := tokens[i]->Trim();\n if(token->Size() > 0) {\n if(token->Get(0)->IsDigit()) {\n stack->AddBack(token->ToFloat());\n }\n else {\n right := stack->Get(stack->Size() - 1); stack->RemoveBack();\n left := stack->Get(stack->Size() - 1); stack->RemoveBack();\n select(token->Get(0)) {\n label '+': {\n stack->AddBack(left + right);\n }\n\n label '-': {\n stack->AddBack(left - right);\n }\n\n label '*': {\n stack->AddBack(left * right);\n }\n\n label '/': {\n stack->AddBack(left / right);\n }\n\n label '^': {\n stack->AddBack(right->Power(left));\n }\n };\n };\n PrintStack(stack);\n };\n };\n Console->Print(\"result: \")->PrintLine(stack->Get(0));\n }\n\n function : PrintStack(stack : FloatVector) ~ Nil {\n \" [\"->Print();\n each(i : stack) {\n stack->Get(i)->Print();\n if(i + 1< stack->Size()) {\n \", \"->Print();\n };\n };\n ']'->PrintLine();\n }\n }\n}\n","language":"Objeck"},{"code":"(* binop : ('a -> 'a -> 'a) -> 'a list -> 'a list *)\nlet binop op = function\n | b::a::r -> (op a b)::r\n | _ -> failwith \"invalid expression\"\n\n(* interp : float list -> string -> string * float list *)\nlet interp s = function\n | \"+\" -> \"add\", binop ( +. ) s\n | \"-\" -> \"subtr\", binop ( -. ) s\n | \"*\" -> \"mult\", binop ( *. ) s\n | \"/\" -> \"divide\", binop ( /. ) s\n | \"^\" -> \"exp\", binop ( ** ) s\n | str -> \"push\", (float_of_string str) :: s\n\n(* interp_and_show : float list -> string -> float list *)\nlet interp_and_show s inp =\n let op,s' = interp s inp in\n Printf.printf \"%s\\t%s\\t\" inp op;\n List.(iter (Printf.printf \"%F \") (rev s'));\n print_newline ();\n s'\n\n(* rpn_eval : string -> float list *)\nlet rpn_eval str =\n Printf.printf \"Token\\tAction\\tStack\\n\";\n let ss = Str.(split (regexp_string \" \") str) in\n List.fold_left interp_and_show [] ss\n","language":"OCaml"},{"code":"\"3 4 2 * 1 5 - 2 3 ^ ^ / +\" eval println\n","language":"Oforth"},{"code":": rpn(s) { s words apply(#[ eval .l ]) }\n\nrpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n","language":"Oforth"},{"code":"/* ooRexx *************************************************************\n* 10.11.2012 Walter Pachl translated from PL/I via REXX\n**********************************************************************/\nfid='rpl.txt'\nex=linein(fid)\nSay 'Input:' ex\n/* ex=' 3 4 2 * 1 5 - 2 3 ^ ^ / +' */\nNumeric Digits 15\nexpr=''\nst=.circularqueue~new(100)\nSay 'Stack contents:'\ndo While ex<>''\n Parse Var ex ch +1 ex\n expr=expr||ch;\n if ch<>' ' then do\n If pos(ch,'0123456789')>0 Then /* a digit goes onto stack */\n st~push(ch)\n Else Do /* an operator */\n op=st~pull /* get top element */\n select /* and modify the (now) top el*/\n when ch='+' Then st~push(st~pull + op)\n when ch='-' Then st~push(st~pull - op)\n when ch='*' Then st~push(st~pull * op)\n when ch='/' Then st~push(st~pull / op)\n when ch='^' Then st~push(st~pull ** op)\n end;\n Say st~string(' ','L') /* show stack in LIFO order */\n end\n end\n end\nSay 'The reverse polish expression = 'expr\nSay 'The evaluated expression = 'st~pull\n","language":"OoRexx"},{"code":"estack = [];\n\nepush(x) = {\n estack = vector(#estack + 1, i, if(i <= #estack, estack[i], x));\n return(#estack);\n};\n\nepop() = {\n local(val = estack[#estack]);\n estack = vector(#estack - 1, i, estack[i]);\n return(val);\n};\n\nregisterRPNToken(t) = {\n local(o1, o2);\n\n if(type(t) == \"t_STR\",\n if(t == \"+\", o2 = epop(); o1 = epop(); epush(o1 + o2),\n if(t == \"-\", o2 = epop(); o1 = epop(); epush(o1 - o2),\n if(t == \"*\", o2 = epop(); o1 = epop(); epush(o1 * o2),\n if(t == \"/\", o2 = epop(); o1 = epop(); epush(o1 / o2),\n if(t == \"%\", o2 = epop(); o1 = epop(); epush(o1 % o2),\n if(t == \"^\", o2 = epop(); o1 = epop(); epush(o1 ^ o2)\n )))))),\n if(type(t) == \"t_INT\" || type(t) == \"t_REAL\" || type(t) == \"t_FRAC\",\n epush(t))\n );\n print(estack);\n};\n\nparseRPN(s) = {\n estack = [];\n for(i = 1, #s, registerRPNToken(s[i]));\n\n if(#estack > 1, error(\"Malformed postfix expression.\"));\n return(estack[1]);\n};\n\nparseRPN([3, 4, 2, \"*\", 1, 5, \"-\", 2, 3, \"^\", \"^\", \"/\", \"+\"]); \\\\ Our input expression\n","language":"PARI-GP"},{"code":"[3]\n[3, 4]\n[3, 4, 2]\n[3, 8]\n[3, 8, 1]\n[3, 8, 1, 5]\n[3, 8, -4]\n[3, 8, -4, 2]\n[3, 8, -4, 2, 3]\n[3, 8, -4, 8]\n[3, 8, 65536]\n[3, 1/8192]\n[24577/8192]\n","language":"PARI-GP"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nmy $number = '[+-]?(?:\\.\\d+|\\d+(?:\\.\\d*)?)';\nmy $operator = '[-+*/^]';\n\nmy @tests = ('3 4 2 * 1 5 - 2 3 ^ ^ / +');\n\nfor (@tests) {\n while (\n s/ \\s* ((?<left>$number)) # 1st operand\n \\s+ ((?<right>$number)) # 2nd operand\n \\s+ ((?<op>$operator)) # operator\n (?:\\s+|$) # more to parse, or done?\n /\n ' '.evaluate().' ' # substitute results of evaluation\n /ex\n ) {}\n say;\n}\n\nsub evaluate {\n (my $a = \"($+{left})$+{op}($+{right})\") =~ s/\\^/**/;\n say $a;\n eval $a;\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">evalRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">ops</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">op</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">switch</span> <span style=\"color: #000000;\">op</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">];</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">];</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]*</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">];</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"/\"</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]/</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">];</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">case</span> <span style=\"color: #008000;\">\"^\"</span><span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">power</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]);</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">default</span> <span style=\"color: #0000FF;\">:</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">scanf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">)[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">switch</span>\n <span style=\"color: #0000FF;\">?{</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">evalRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"<?php\nfunction rpn($postFix){\n $stack = Array();\n echo \"Input\\tOperation\\tStack\\tafter\\n\" ;\n\t$token = explode(\" \", trim($postFix));\n\t$count = count($token);\n\t\n for($i = 0 ; $i<$count;$i++)\n\t{\n echo $token[$i] .\" \\t\";\n $tokenNum = \"\";\n\t\t\n if (is_numeric($token[$i])) {\n echo \"Push\";\n\t\t\tarray_push($stack,$token[$i]);\n }\n else\n {\n echo \"Operate\";\n $secondOperand = end($stack);\n\t\t\tarray_pop($stack);\n $firstOperand = end($stack);\n array_pop($stack);\n\n if ($token[$i] == \"*\")\n\t\t\t\tarray_push($stack,$firstOperand * $secondOperand);\n else if ($token[$i] == \"/\")\n array_push($stack,$firstOperand / $secondOperand);\n else if ($token[$i] == \"-\")\n array_push($stack,$firstOperand - $secondOperand);\n else if ($token[$i] == \"+\")\n array_push($stack,$firstOperand + $secondOperand);\n else if ($token[$i] == \"^\")\n array_push($stack,pow($firstOperand,$secondOperand));\n else {\n die(\"Error\");\n }\n }\n\t\techo \"\\t\\t\" . implode(\" \", $stack) . \"\\n\";\n }\n return end($stack);\n}\n\necho \"Compute Value: \" . rpn(\"3 4 2 * 1 5 - 2 3 ^ ^ / + \");\n?>\n","language":"PHP"},{"code":"(de rpnCalculator (Str)\n (let (^ ** Stack) # Define '^' from the built-in '**'\n (prinl \"Token Stack\")\n (for Token (str Str \"*+-/\\^\")\n (if (num? Token)\n (push 'Stack @)\n (set (cdr Stack)\n ((intern Token) (cadr Stack) (pop 'Stack)) ) )\n (prin Token)\n (space 6)\n (println Stack) )\n (println (car Stack)) ) )\n","language":"PicoLisp"},{"code":": (rpnCalculator \"3 4 2 * 1 5 - 2 3 \\^ \\^ / +\")\nToken Stack\n3 (3)\n4 (4 3)\n2 (2 4 3)\n* (8 3)\n1 (1 8 3)\n5 (5 1 8 3)\n- (-4 8 3)\n2 (2 -4 8 3)\n3 (3 2 -4 8 3)\n^ (8 -4 8 3)\n^ (65536 8 3)\n/ (0 3)\n+ (3)\n3\n-> 3\n","language":"PicoLisp"},{"code":"Calculator: procedure options (main); /* 14 Sept. 2012 */\n declare expression character (100) varying initial ('');\n declare ch character (1);\n declare (stack controlled, operand) float (18);\n declare in file input;\n\n open file (in) title ('/CALCULAT.DAT,type(text),recsize(100)');\n on endfile (in) go to done;\n\n put ('Stack contents:');\nmain_loop:\n do forever;\n get file (in) edit (ch) (a(1));\n expression = expression || ch;\n if ch = ' ' then iterate;\n select (ch);\n when ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9')\n do; allocate stack; stack = ch; iterate main_loop; end;\n when ('+') do; operand = stack; free stack; stack = stack + operand; end;\n when ('-') do; operand = stack; free stack; stack = stack - operand; end;\n when ('*') do; operand = stack; free stack; stack = stack * operand; end;\n when ('/') do; operand = stack; free stack; stack = stack / operand; end;\n when ('^') do; operand = stack; free stack; stack = stack ** operand; end;\n end;\n call show_stack;\n end;\n\ndone:\n put skip list ('The reverse polish expression = ' || expression);\n put skip list ('The evaluated expression = ' || stack);\n\nend Calculator;\n","language":"PL-I"},{"code":"create or replace function rpn_calc(str varchar2) return number as\n type num_aa is table of number index by pls_integer;\n type num_stack is record (a num_aa, top pls_integer default 0);\n ns num_stack;\n pos1 integer := 1;\n pos2 integer;\n token varchar2(100);\n op2 number;\n procedure push(s in out nocopy num_stack, x number) is\n begin\n s.top := s.top + 1;\n s.a(s.top) := x;\n end;\n function pop(s in out nocopy num_stack) return number is\n x number;\n begin\n x := s.a(s.top);\n s.top := s.top - 1;\n return x;\n end;\n procedure print_stack(s num_stack) is -- for debugging only; remove from final version\n ps varchar2(4000);\n begin\n for i in 1 .. s.top loop\n ps := ps || s.a(i) || ' ';\n end loop;\n dbms_output.put_line('Stack: ' || rtrim(ps));\n end;\nbegin\n while pos1 <= length(str) loop\n pos2 := instr(str || ' ', ' ', pos1);\n token := substr(str, pos1, pos2 - pos1);\n pos1 := pos2 + 1;\n case token\n when '+' then push(ns, pop(ns) + pop(ns));\n when '-' then op2 := pop(ns); push(ns, pop(ns) - op2);\n when '*' then push(ns, pop(ns) * pop(ns));\n when '/' then op2 := pop(ns); push(ns, pop(ns) / op2);\n when '^' then op2 := pop(ns); push(ns, power(pop(ns), op2));\n else push(ns, to_number(token));\n end case;\n print_stack(ns); -- for debugging purposes only\n end loop;\n return pop(ns);\nend rpn_calc;\n/\n","language":"PL-SQL"},{"code":"begin\n dbms_output.put_line(chr(10) || 'Result: ' || rpn_calc('3 4 2 * 1 5 - 2 3 ^ ^ / +'));\nend;\n/\n","language":"PL-SQL"},{"code":"function Invoke-Rpn\n{\n <#\n .SYNOPSIS\n A stack-based evaluator for an expression in reverse Polish notation.\n .DESCRIPTION\n A stack-based evaluator for an expression in reverse Polish notation.\n\n All methods in the Math and Decimal classes are available.\n .PARAMETER Expression\n A space separated, string of tokens.\n .PARAMETER DisplayState\n This switch shows the changes in the stack as each individual token is processed as a table.\n .EXAMPLE\n Invoke-Rpn -Expression \"3 4 Max\"\n .EXAMPLE\n Invoke-Rpn -Expression \"3 4 Log2\"\n .EXAMPLE\n Invoke-Rpn -Expression \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n .EXAMPLE\n Invoke-Rpn -Expression \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" -DisplayState\n#>\n [CmdletBinding()]\n Param\n (\n [Parameter(Mandatory=$true)]\n [AllowEmptyString()]\n [string]\n $Expression,\n\n [Parameter(Mandatory=$false)]\n [switch]\n $DisplayState\n )\n Begin\n {\n function Out-State ([System.Collections.Stack]$Stack)\n {\n $array = $Stack.ToArray()\n [Array]::Reverse($array)\n $array | ForEach-Object -Process { Write-Host (\"{0,-8:F3}\" -f $_) -NoNewline } -End { Write-Host }\n }\n\n function New-RpnEvaluation\n {\n $stack = New-Object -Type System.Collections.Stack\n\n $shortcuts = @{\n \"+\" = \"Add\"; \"-\" = \"Subtract\"; \"/\" = \"Divide\"; \"*\" = \"Multiply\"; \"%\" = \"Remainder\"; \"^\" = \"Pow\"\n }\n\n :ARGUMENT_LOOP foreach ($argument in $args)\n {\n if ($DisplayState -and $stack.Count)\n {\n Out-State $stack\n }\n\n if ($shortcuts[$argument])\n {\n $argument = $shortcuts[$argument]\n }\n\n try\n {\n $stack.Push([decimal]$argument)\n continue\n }\n catch\n {\n }\n\n $argCountList = $argument -replace \"(\\D+)(\\d*)\",‘$2’\n $operation = $argument.Substring(0, $argument.Length – $argCountList.Length)\n\n foreach($type in [Decimal],[Math])\n {\n if ($definition = $type::$operation)\n {\n if (-not $argCountList)\n {\n $argCountList = $definition.OverloadDefinitions |\n Foreach-Object { ($_ -split \", \").Count } |\n Sort-Object -Unique\n }\n\n foreach ($argCount in $argCountList)\n {\n try\n {\n $methodArguments = $stack.ToArray()[($argCount–1)..0]\n $result = $type::$operation.Invoke($methodArguments)\n\n $null = 1..$argCount | Foreach-Object { $stack.Pop() }\n\n $stack.Push($result)\n\n continue ARGUMENT_LOOP\n }\n catch\n {\n ## If error, try with the next number of arguments\n }\n }\n }\n }\n }\n\n if ($DisplayState -and $stack.Count)\n {\n Out-State $stack\n if ($stack.Count)\n {\n Write-Host \"`nResult = $($stack.Peek())\"\n }\n }\n else\n {\n $stack\n }\n }\n }\n Process\n {\n Invoke-Expression -Command \"New-RpnEvaluation $Expression\"\n }\n End\n {\n }\n}\n\nInvoke-Rpn -Expression \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" -DisplayState\n","language":"PowerShell"},{"code":"rpn(L) :-\n\twriteln('Token Action Stack'),\n\tparse(L, [],[X] ,[]),\n\tformat('~nThe final output value is ~w~n', [X]).\n\n% skip spaces\nparse([X|L], St) -->\n\t{char_type(X, white)},\n\tparse(L, St).\n\n% detect operators\nparse([Op|L], [Y, X | St]) -->\n\t{ is_op(Op, X, Y, V),\n\t writef(' %s', [[Op]]),\n\t with_output_to(atom(Str2), writef('Apply %s on top of stack', [[Op]])),\n\t writef(' %35l', [Str2]),\n\t writef('%w\\n', [[V | St]])},\n\tparse(L, [V | St]).\n\n% detect number\nparse([N|L], St) -->\n\t{char_type(N, digit)},\n\tparse_number(L, [N], St).\n\n% string is finished\nparse([], St) --> St.\n\n% compute numbers\nparse_number([N|L], NC, St) -->\n\t{char_type(N, digit)},\n\tparse_number(L, [N|NC], St).\n\nparse_number(S, NC, St) -->\n\t{ reverse(NC, RNC),\n\t number_chars(V, RNC),\n\t writef('%5r', [V]),\n\t with_output_to(atom(Str2), writef('Push num %w on top of stack', [V])),\n\t writef(' %35l', [Str2]),\n\t writef('%w\\n', [[V | St]])},\n\tparse(S, [V|St]).\n\n% defining operations\nis_op(42, X, Y, V) :-\tV is X*Y.\nis_op(43, X, Y, V) :-\tV is X+Y.\nis_op(45, X, Y, V) :-\tV is X-Y.\nis_op(47, X, Y, V) :-\tV is X/Y.\nis_op(94, X, Y, V) :-\tV is X**Y.\n","language":"Prolog"},{"code":"def op_pow(stack):\n b = stack.pop(); a = stack.pop()\n stack.append( a ** b )\ndef op_mul(stack):\n b = stack.pop(); a = stack.pop()\n stack.append( a * b )\ndef op_div(stack):\n b = stack.pop(); a = stack.pop()\n stack.append( a / b )\ndef op_add(stack):\n b = stack.pop(); a = stack.pop()\n stack.append( a + b )\ndef op_sub(stack):\n b = stack.pop(); a = stack.pop()\n stack.append( a - b )\ndef op_num(stack, num):\n stack.append( num )\n\nops = {\n '^': op_pow,\n '*': op_mul,\n '/': op_div,\n '+': op_add,\n '-': op_sub,\n }\n\ndef get_input(inp = None):\n 'Inputs an expression and returns list of tokens'\n\n if inp is None:\n inp = input('expression: ')\n tokens = inp.strip().split()\n return tokens\n\ndef rpn_calc(tokens):\n stack = []\n table = ['TOKEN,ACTION,STACK'.split(',')]\n for token in tokens:\n if token in ops:\n action = 'Apply op to top of stack'\n ops[token](stack)\n table.append( (token, action, ' '.join(str(s) for s in stack)) )\n else:\n action = 'Push num onto top of stack'\n op_num(stack, eval(token))\n table.append( (token, action, ' '.join(str(s) for s in stack)) )\n return table\n\nif __name__ == '__main__':\n rpn = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n print( 'For RPN expression: %r\\n' % rpn )\n rp = rpn_calc(get_input(rpn))\n maxcolwidths = [max(len(y) for y in x) for x in zip(*rp)]\n row = rp[0]\n print( ' '.join('{cell:^{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\n for row in rp[1:]:\n print( ' '.join('{cell:<{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\n\n print('\\n The final output value is: %r' % rp[-1][2])\n","language":"Python"},{"code":"a=[]\nb={'+': lambda x,y: y+x, '-': lambda x,y: y-x, '*': lambda x,y: y*x,'/': lambda x,y:y/x,'^': lambda x,y:y**x}\nfor c in '3 4 2 * 1 5 - 2 3 ^ ^ / +'.split():\n if c in b: a.append(b[c](a.pop(),a.pop()))\n else: a.append(float(c))\n print c, a\n","language":"Python"},{"code":"[ stack ] is switch.arg ( --> [ )\n\n[ switch.arg put ] is switch ( x --> )\n\n[ switch.arg release ] is otherwise ( --> )\n\n[ switch.arg share\n != iff ]else[ done\n otherwise\n ]'[ do ]done[ ] is case ( x --> )\n\n[ say \"Applying: \"\n swap echo$ sp\n temp take\n temp take\n swap rot do\n temp put ] is apply ( $ x --> )\n\n[ say \"Pushing: \" dup echo$ sp\n $->n drop temp put ] is isnumber ( $ --> )\n\n[ temp copy echo cr ] is display ( --> )\n\n[ nest$ witheach\n [ dup switch\n [ $ '+' case [ ' + apply ]\n $ '-' case [ ' - apply ]\n $ '*' case [ ' * apply ]\n $ '/' case [ ' / apply ]\n $ '^' case [ ' ** apply ]\n otherwise [ isnumber ] ]\n display ]\n temp take ] is rpncalc ( $ --> n )\n\n$ \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" rpncalc\nsay \"Result: \" echo\n","language":"Quackery"},{"code":"' Parsing/RPN calculator algorithm\nDECLARE SUB MakeEmpty (S AS ANY)\nDECLARE SUB Push (X AS SINGLE, S AS ANY)\nDECLARE SUB PrintStack (S AS ANY)\nDECLARE SUB EvalRPN (Expr$)\nDECLARE FUNCTION Empty% (S AS ANY)\nDECLARE FUNCTION Pop! (S AS ANY)\n\nCONST MAXINDEX = 63\n\nTYPE TNumStack\n TopIndex AS INTEGER\n Elems(MAXINDEX) AS SINGLE\nEND TYPE\n\nEvalRPN (\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\nEND\n\nFUNCTION Empty% (S AS TNumStack)\n Empty% = S.TopIndex > MAXINDEX\nEND FUNCTION\n\nSUB EvalRPN (Expr$)\n DIM S AS TNumStack\n MakeEmpty S\n PRINT \"Input\", \"Operation\", \"Stack after\"\n ' SP% - start position of token\n ' DP% - position of delimiter\n DP% = 0\n DO\n SP% = DP% + 1\n DP% = INSTR(DP% + 1, Expr$, \" \")\n IF DP% <> 0 THEN\n TE% = DP% - 1\n Token$ = MID$(Expr$, SP%, DP% - SP%)\n ELSE\n Token$ = MID$(Expr$, SP%, LEN(Expr$) - SP% + 1)\n END IF\n PRINT Token$,\n IF Token$ = \"*\" THEN\n PRINT \"Operate\",\n Second = Pop(S): First = Pop(S)\n Push First * Second, S\n ELSEIF Token$ = \"/\" THEN\n PRINT \"Operate\",\n Second = Pop(S): First = Pop(S)\n Push First / Second, S\n ELSEIF Token$ = \"-\" THEN\n PRINT \"Operate\",\n Second = Pop(S): First = Pop(S)\n Push First - Second, S\n ELSEIF Token$ = \"+\" THEN\n PRINT \"Operate\",\n Second = Pop(S): First = Pop(S)\n Push First + Second, S\n ELSEIF Token$ = \"^\" THEN\n PRINT \"Operate\",\n Second = Pop(S): First = Pop(S)\n Push First ^ Second, S\n ELSE\n PRINT \"Push\",\n Push VAL(Token$), S\n END IF\n PrintStack S\n LOOP UNTIL DP% = 0\n PRINT \"Final answer: \"; Pop(S)\n IF NOT Empty(S) THEN\n PRINT \"Error, too many operands: \";\n PrintStack S\n STOP\n END IF\nEND SUB\n\nSUB MakeEmpty (S AS TNumStack)\n S.TopIndex = MAXINDEX + 1\nEND SUB\n\nFUNCTION Pop (S AS TNumStack)\n IF Empty%(S) THEN\n PRINT \"The stack is empty.\"\n STOP\n ELSE\n Pop = S.Elems(S.TopIndex)\n S.TopIndex = S.TopIndex + 1\n END IF\nEND FUNCTION\n\nSUB PrintStack (S AS TNumStack)\n FOR Ptr% = S.TopIndex% TO MAXINDEX\n PRINT USING \"######.###\"; S.Elems(Ptr%);\n NEXT Ptr%\n PRINT\nEND SUB\n\nSUB Push (X AS SINGLE, S AS TNumStack)\n IF S.TopIndex = 0 THEN\n PRINT \"The stack is full.\"\n STOP\n ELSE\n S.TopIndex = S.TopIndex - 1\n S.Elems(S.TopIndex) = X\n END IF\nEND SUB\n","language":"QuickBASIC"},{"code":"#lang racket\n\n(define (calculate-RPN expr)\n (for/fold ([stack '()]) ([token expr])\n (printf \"~a\\t -> ~a~N\" token stack)\n (match* (token stack)\n [((? number? n) s) (cons n s)]\n [('+ (list x y s ___)) (cons (+ x y) s)]\n [('- (list x y s ___)) (cons (- y x) s)]\n [('* (list x y s ___)) (cons (* x y) s)]\n [('/ (list x y s ___)) (cons (/ y x) s)]\n [('^ (list x y s ___)) (cons (expt y x) s)]\n [(x s) (error \"calculate-RPN: Cannot calculate the expression:\"\n (reverse (cons x s)))])))\n","language":"Racket"},{"code":"(calculate-RPN (in-port read (open-input-string \"3.0 4 2 * 1 5 - 2 3 ^ ^ / +\")))\n","language":"Racket"},{"code":"my $proggie = '3 4 2 * 1 5 - 2 3 ^ ^ / +';\n\nclass RPN is Array {\n\n method binop(&op) { self.push: self.pop R[&op] self.pop }\n\n method run($p) {\n for $p.words {\n say \"$_ ({self})\";\n when /\\d/ { self.push: $_ }\n when '+' { self.binop: &[+] }\n when '-' { self.binop: &[-] }\n when '*' { self.binop: &[*] }\n when '/' { self.binop: &[/] }\n when '^' { self.binop: &[**] }\n default { die \"$_ is bogus\" }\n }\n say self;\n }\n}\n\nRPN.new.run($proggie);\n","language":"Raku"},{"code":"/* REXX ***************************************************************\n* 09.11.2012 Walter Pachl translates from PL/I\n**********************************************************************/\nfid='rpl.txt'\nex=linein(fid)\nSay 'Input:' ex\n/* ex=' 3 4 2 * 1 5 - 2 3 ^ ^ / +' */\nNumeric Digits 15\nexpr=''\nst.=0\nSay 'Stack contents:'\ndo While ex<>''\n Parse Var ex ch +1 ex\n expr=expr||ch;\n if ch<>' ' then do\n select\n When pos(ch,'0123456789')>0 Then Do\n Call stack ch\n Iterate\n End\n when ch='+' Then do; operand=getstack(); st.sti = st.sti + operand; end;\n when ch='-' Then do; operand=getstack(); st.sti = st.sti - operand; end;\n when ch='*' Then do; operand=getstack(); st.sti = st.sti * operand; end;\n when ch='/' Then do; operand=getstack(); st.sti = st.sti / operand; end;\n when ch='^' Then do; operand=getstack(); st.sti = st.sti ** operand; end;\n end;\n call show_stack\n end\n end\nSay 'The reverse polish expression = 'expr\nSay 'The evaluated expression = 'st.1\nExit\nstack: Procedure Expose st.\n/* put the argument on top of the stack */\n z=st.0+1\n st.z=arg(1)\n st.0=z\n Return\ngetstack: Procedure Expose st. sti\n/* remove and return the stack's top element */\n z=st.0\n stk=st.z\n st.0=st.0-1\n sti=st.0\n Return stk\nshow_stack: procedure Expose st.\n/* show the stack's contents */\n ol=''\n do i=1 To st.0\n ol=ol format(st.i,5,10)\n End\n Say ol\n Return\n","language":"REXX"},{"code":"/*REXX program evaluates a ═════ Reverse Polish notation (RPN) ═════ expression. */\nparse arg x /*obtain optional arguments from the CL*/\nif x='' then x= \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" /*Not specified? Then use the default.*/\ntokens=words(x) /*save the number of tokens \" \". */\nshowSteps=1 /*set to 0 if working steps not wanted.*/\nox=x /*save the original value of X. */\n do i=1 for tokens; @.i=word(x,i) /*assign the input tokens to an array. */\n end /*i*/\nx=space(x) /*remove any superfluous blanks in X. */\nL=max(20, length(x)) /*use 20 for the minimum display width.*/\nnumeric digits L /*ensure enough decimal digits for ans.*/\nsay center('operand', L, \"─\") center('stack', L+L, \"─\") /*display title*/\n$= /*nullify the stack (completely empty).*/\n do k=1 for tokens; ?=@.k; ??=? /*process each token from the @. list.*/\n #=words($) /*stack the count (the number entries).*/\n if datatype(?,'N') then do; $=$ ?; call show \"add to───►stack\"; iterate; end\n if ?=='^' then ??= \"**\" /*REXXify ^ ───► ** (make legal).*/\n interpret 'y='word($,#-1) ?? word($,#) /*compute via the famous REXX INTERPRET*/\n if datatype(y,'N') then y=y/1 /*normalize the number with ÷ by unity.*/\n $=subword($, 1, #-2) y /*rebuild the stack with the answer. */\n call show ? /*display steps (tracing into), maybe.*/\n end /*k*/\nsay /*display a blank line, better perusing*/\nsay ' RPN input:' ox; say \" answer──►\"$ /*display original input; display ans.*/\nparse source upper . y . /*invoked via C.L. or via a REXX pgm?*/\nif y=='COMMAND' | \\datatype($,\"W\") then exit /*stick a fork in it, we're all done. */\n else exit $ /*return the answer ───► the invoker.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nshow: if showSteps then say center(arg(1), L) left(space($), L); return\n","language":"REXX"},{"code":"/*REXX program evaluates a ═════ Reverse Polish notation (RPN) ═════ expression. */\nparse arg x /*obtain optional arguments from the CL*/\nif x='' then x= \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" /*Not specified? Then use the default.*/\ntokens=words(x) /*save the number of tokens \" \". */\nshowSteps=1 /*set to 0 if working steps not wanted.*/\nox=x /*save the original value of X. */\n do i=1 for tokens; @.i=word(x,i) /*assign the input tokens to an array. */\n end /*i*/\nx=space(x) /*remove any superfluous blanks in X. */\nL=max(20, length(x)) /*use 20 for the minimum display width.*/\nnumeric digits L /*ensure enough decimal digits for ans.*/\nsay center('operand', L, \"─\") center('stack', L+L, \"─\") /*display title*/\nDop= '/ // % ÷'; Bop='& | &&' /*division operators; binary operands.*/\nAop= '- + * ^ **' Dop Bop; Lop=Aop \"||\" /*arithmetic operators; legal operands.*/\n$= /*nullify the stack (completely empty).*/\n do k=1 for tokens; ?=@.k; ??=? /*process each token from the @. list.*/\n #=words($); b=word($, max(1, #) ) /*the stack count; the last entry. */\n a=word($, max(1, #-1) ) /*stack's \"first\" operand. */\n division =wordpos(?, Dop)\\==0 /*flag: doing a some kind of division.*/\n arith =wordpos(?, Aop)\\==0 /*flag: doing arithmetic. */\n bitOp =wordpos(?, Bop)\\==0 /*flag: doing some kind of binary oper*/\n if datatype(?, 'N') then do; $=$ ?; call show \"add to───►stack\"; iterate; end\n if wordpos(?, Lop)==0 then do; $=e 'illegal operator:' ?; leave; end\n if w<2 then do; $=e 'illegal RPN expression.'; leave; end\n if ?=='^' then ??= \"**\" /*REXXify ^ ──► ** (make it legal). */\n if ?=='÷' then ??= \"/\" /*REXXify ÷ ──► / (make it legal). */\n if division & b=0 then do; $=e 'division by zero.' ; leave; end\n if bitOp & \\isBit(a) then do; $=e \"token isn't logical: \" a; leave; end\n if bitOp & \\isBit(b) then do; $=e \"token isn't logical: \" b; leave; end\n interpret 'y=' a ?? b /*compute with two stack operands*/\n if datatype(y, 'W') then y=y/1 /*normalize the number with ÷ by unity.*/\n _=subword($, 1, #-2); $=_ y /*rebuild the stack with the answer. */\n call show ? /*display (possibly) a working step. */\n end /*k*/\nsay /*display a blank line, better perusing*/\nif word($,1)==e then $= /*handle the special case of errors. */\nsay ' RPN input:' ox; say \" answer───►\"$ /*display original input; display ans.*/\nparse source upper . y . /*invoked via C.L. or via a REXX pgm?*/\nif y=='COMMAND' | \\datatype($,\"W\") then exit /*stick a fork in it, we're all done. */\n else exit $ /*return the answer ───► the invoker.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nisBit: return arg(1)==0 | arg(1)==1 /*returns 1 if arg1 is a binary bit*/\nshow: if showSteps then say center(arg(1), L) left(space($), L); return\n","language":"REXX"},{"code":"rpn = RPNExpression(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\nvalue = rpn.eval\n","language":"Ruby"},{"code":"prn$ = \"3 4 2 * 1 5 - 2 3 ^ ^ / + \"\n\nj = 0\nwhile word$(prn$,i + 1,\" \") <> \"\"\ni = i + 1\n n$ = word$(prn$,i,\" \")\n if n$ < \"0\" or n$ > \"9\" then\n num1 = val(word$(stack$,s,\" \"))\n num2 = val(word$(stack$,s-1,\" \"))\n n = op(n$,num2,num1)\n s = s - 1\n stack$ = stk$(stack$,s -1,str$(n))\n print \"Push Opr \";n$;\" to stack: \";stack$\n else\n s = s + 1\n stack$ = stack$ + n$ + \" \"\n print \"Push Num \";n$;\" to stack: \";stack$\nend if\nwend\n\nfunction stk$(stack$,s,a$)\nfor i = 1 to s\n stk$ = stk$ + word$(stack$,i,\" \") + \" \"\nnext i\nstk$ = stk$ + a$ + \" \"\nend function\n\nFUNCTION op(op$,a,b)\nif op$ = \"*\" then op = a * b\nif op$ = \"/\" then op = a / b\nif op$ = \"^\" then op = a ^ b\nif op$ = \"+\" then op = a + b\nif op$ = \"-\" then op = a - b\nend function\n","language":"Run-BASIC"},{"code":"fn rpn(text: &str) -> f64 {\n let tokens = text.split_whitespace();\n let mut stack: Vec<f64> = vec![];\n println!(\"input operation stack\");\n\n for token in tokens {\n print!(\"{:^5} \", token);\n match token.parse() {\n Ok(num) => {\n stack.push(num);\n println!(\"push {:?}\", stack);\n }\n Err(_) => {\n match token {\n \"+\" => {\n let b = stack.pop().expect(\"missing first operand\");\n let a = stack.pop().expect(\"missing second operand\");\n stack.push(a + b);\n }\n \"-\" => {\n let b = stack.pop().expect(\"missing first operand\");\n let a = stack.pop().expect(\"missing second operand\");\n stack.push(a - b);\n }\n \"*\" => {\n let b = stack.pop().expect(\"missing first operand\");\n let a = stack.pop().expect(\"missing second operand\");\n stack.push(a * b);\n }\n \"/\" => {\n let b = stack.pop().expect(\"missing first operand\");\n let a = stack.pop().expect(\"missing second operand\");\n stack.push(a / b);\n }\n \"^\" => {\n let b = stack.pop().expect(\"missing first operand\");\n let a = stack.pop().expect(\"missing second operand\");\n stack.push(a.powf(b));\n }\n _ => panic!(\"unknown operator {}\", token),\n }\n println!(\"calculate {:?}\", stack);\n }\n }\n }\n\n stack.pop().unwrap_or(0.0)\n}\n\nfn main() {\n let text = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\";\n\n println!(\"\\nresult: {}\", rpn(text));\n}\n","language":"Rust"},{"code":"object RPN {\n val PRINT_STACK_CONTENTS: Boolean = true\n\n def main(args: Array[String]): Unit = {\n val result = evaluate(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\".split(\" \").toList)\n println(\"Answer: \" + result)\n }\n\n def evaluate(tokens: List[String]): Double = {\n import scala.collection.mutable.Stack\n val stack: Stack[Double] = new Stack[Double]\n for (token <- tokens) {\n if (isOperator(token)) token match {\n case \"+\" => stack.push(stack.pop + stack.pop)\n case \"-\" => val x = stack.pop; stack.push(stack.pop - x)\n case \"*\" => stack.push(stack.pop * stack.pop)\n case \"/\" => val x = stack.pop; stack.push(stack.pop / x)\n case \"^\" => val x = stack.pop; stack.push(math.pow(stack.pop, x))\n case _ => throw new RuntimeException( s\"\"\"\"$token\" is not an operator\"\"\")\n }\n else stack.push(token.toDouble)\n\n if (PRINT_STACK_CONTENTS) {\n print(\"Input: \" + token)\n print(\" Stack: \")\n for (element <- stack.seq.reverse) print(element + \" \");\n println(\"\")\n }\n }\n\n stack.pop\n }\n\n def isOperator(token: String): Boolean = {\n token match {\n case \"+\" => true; case \"-\" => true; case \"*\" => true; case \"/\" => true; case \"^\" => true\n case _ => false\n }\n }\n}\n","language":"Scala"},{"code":"var proggie = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\n\nclass RPN(arr=[]) {\n\n method binop(op) {\n var x = arr.pop\n var y = arr.pop\n arr << y.(op)(x)\n }\n\n method run(p) {\n p.each_word { |w|\n say \"#{w} (#{arr})\"\n given (w) {\n when (/\\d/) {\n arr << Num(w)\n }\n when (<+ - * />) {\n self.binop(w)\n }\n when ('^') {\n self.binop('**')\n }\n default {\n die \"#{w} is bogus\"\n }\n }\n }\n say arr[0]\n }\n}\n\nRPN.new.run(proggie)\n","language":"Sidef"},{"code":" 10 DIM S(5)\n 20 LET P=1\n 30 INPUT E$\n 40 LET I=0\n 50 LET I=I+1\n 60 IF E$(I)=\" \" THEN GOTO 110\n 70 IF I<LEN E$ THEN GOTO 50\n 80 LET W$=E$\n 90 GOSUB 150\n100 STOP\n110 LET W$=E$( TO I-1)\n120 LET E$=E$(I+1 TO )\n130 GOSUB 150\n140 GOTO 40\n150 IF W$=\"+\" OR W$=\"-\" OR W$=\"*\" OR W$=\"/\" OR W$=\"**\" THEN GOTO 250\n160 LET S(P)=VAL W$\n170 LET P=P+1\n180 PRINT W$;\n190 PRINT \":\";\n200 FOR I=P-1 TO 1 STEP -1\n210 PRINT \" \";S(I);\n220 NEXT I\n230 PRINT\n240 RETURN\n250 IF W$=\"**\" THEN LET S(P-2)=ABS S(P-2)\n260 LET S(P-2)=VAL (STR$ S(P-2)+W$+STR$ S(P-1))\n270 LET P=P-1\n280 GOTO 180\n","language":"Sinclair-ZX81-BASIC"},{"code":"let opa = [\n \"^\": (prec: 4, rAssoc: true),\n \"*\": (prec: 3, rAssoc: false),\n \"/\": (prec: 3, rAssoc: false),\n \"+\": (prec: 2, rAssoc: false),\n \"-\": (prec: 2, rAssoc: false),\n]\n\nfunc rpn(tokens: [String]) -> [String] {\n var rpn : [String] = []\n var stack : [String] = [] // holds operators and left parenthesis\n\n for tok in tokens {\n switch tok {\n case \"(\":\n stack += [tok] // push \"(\" to stack\n case \")\":\n while !stack.isEmpty {\n let op = stack.removeLast() // pop item from stack\n if op == \"(\" {\n break // discard \"(\"\n } else {\n rpn += [op] // add operator to result\n }\n }\n default:\n if let o1 = opa[tok] { // token is an operator?\n for op in stack.reverse() {\n if let o2 = opa[op] {\n if !(o1.prec > o2.prec || (o1.prec == o2.prec && o1.rAssoc)) {\n // top item is an operator that needs to come off\n rpn += [stack.removeLast()] // pop and add it to the result\n continue\n }\n }\n break\n }\n\n stack += [tok] // push operator (the new one) to stack\n } else { // token is not an operator\n rpn += [tok] // add operand to result\n }\n }\n }\n\n return rpn + stack.reverse()\n}\n\nfunc parseInfix(e: String) -> String {\n let tokens = e.characters.split{ $0 == \" \" }.map(String.init)\n return rpn(tokens).joinWithSeparator(\" \")\n}\n\nvar input : String\n\ninput = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n\"infix: \\(input)\"\n\"postfix: \\(parseInfix(input))\"\n","language":"Swift"},{"code":"# Helper\nproc pop stk {\n upvar 1 $stk s\n set val [lindex $s end]\n set s [lreplace $s end end]\n return $val\n}\n\nproc evaluate rpn {\n set stack {}\n foreach token $rpn {\n\tset act \"apply\"\n\tswitch $token {\n\t \"^\" {\n\t\t# Non-commutative operation\n\t\tset a [pop stack]\n\t\tlappend stack [expr {[pop stack] ** $a}]\n\t }\n\t \"/\" {\n\t\t# Non-commutative, special float handling\n\t\tset a [pop stack]\n\t\tset b [expr {[pop stack] / double($a)}]\n\t\tif {$b == round($b)} {set b [expr {round($b)}]}\n\t\tlappend stack $b\n\t }\n\t \"*\" {\n\t\t# Commutative operation\n\t\tlappend stack [expr {[pop stack] * [pop stack]}]\n\t }\n\t \"-\" {\n\t\t# Non-commutative operation\n\t\tset a [pop stack]\n\t\tlappend stack [expr {[pop stack] - $a}]\n\t }\n\t \"+\" {\n\t\t# Commutative operation\n\t\tlappend stack [expr {[pop stack] + [pop stack]}]\n\t }\n\t default {\n\t\tset act \"push\"\n\t\tlappend stack $token\n\t }\n\t}\n\tputs \"$token\\t$act\\t$stack\"\n }\n return [lindex $stack end]\n}\n\nputs [evaluate {3 4 2 * 1 5 - 2 3 ^ ^ / +}]\n","language":"Tcl"},{"code":"#!/bin/sh\n\nexp() {\n R=1\n local i=1\n\n while [ $i -le $2 ]; do\n R=$(($R * $1))\n i=$(($i + 1))\n done\n}\n\nrpn() {\n local O1 O2 stack\n\n while [ $# -ge 1 ]; do\n grep -iE '^-?[0-9]+$' <<< \"$1\" > /dev/null 2>&1\n if [ \"$?\" -eq 0 ]; then\n stack=`sed -e '$a'\"$1\" -e '/^$/d' <<< \"$stack\"`\n else\n grep -iE '^[-\\+\\*\\/\\%\\^]$' <<< \"$1\" > /dev/null 2>&1\n if [ \"$?\" -eq 0 ]; then\n O2=`sed -n '$p' <<< \"$stack\"`\n stack=`sed '$d' <<< \"$stack\"`\n O1=`sed -n '$p' <<< \"$stack\"`\n\n case \"$1\" in\n '+')\n stack=`sed -e '$a'\"$(($O1 + $O2))\" -e '/^$/d' -e '$d' \\\n <<< \"$stack\"`;;\n '-')\n stack=`sed -e '$a'\"$(($O1 - $O2))\" -e '/^$/d' -e '$d' \\\n <<< \"$stack\"`;;\n '*')\n stack=`sed -e '$a'\"$(($O1 * $O2))\" -e '/^$/d' -e '$d' \\\n <<< \"$stack\"`;;\n '/')\n stack=`sed -e '$a'\"$(($O1 / $O2))\" -e '/^$/d' -e '$d' \\\n <<< \"$stack\"`;;\n '%')\n stack=`sed -e '$a'\"$(($O1 % $O2))\" -e '/^$/d' -e '$d' \\\n <<< \"$stack\"`;;\n '^')\n exp $O1 $O2\n stack=`sed -e '$a'\"$(($R))\" -e '/^$/d' -e '$d' <<< \\\n \"$stack\"`;;\n esac\n else\n echo \"Unknown RPN token \\`\\`$1''\"\n fi\n fi\n echo \"$1\" \":\" $stack\n shift\n done\n\n sed -n '1p' <<< \"$stack\"\n if [ \"`wc -l <<< \"$stack\"`\" -gt 1 ]; then\n echo \"Malformed input expression\" > /dev/stderr\n return 1\n else\n return 0\n fi\n}\n\nrpn 3 4 2 '*' 1 5 '-' 2 3 '^' '^' '/' '+'\n","language":"UNIX-Shell"},{"code":"3 : 3\n4 : 3 4\n2 : 3 4 2\n* : 3 8\n1 : 3 8 1\n5 : 3 8 1 5\n- : 3 8 -4\n2 : 3 8 -4 2\n3 : 3 8 -4 2 3\n^ : 3 8 -4 8\n^ : 3 8 65536\n/ : 3 0\n+ : 3\n3\n","language":"UNIX-Shell"},{"code":"import math\n\nconst (\n supported_operations = ['+', '-', '*', '/', '^']\n max_depth = 256\n)\n\nstruct Stack {\nmut:\n\tdata []f32 = [f32(0)].repeat(max_depth)\n\tdepth int\n}\n\nfn (mut stack Stack) push(value f32) {\n\tif stack.depth >= max_depth {\n\t\tprintln('Stack Overflow!!')\n\t\treturn\n\t}\n\tstack.data[stack.depth] = value\n\tstack.depth++\n}\n\nfn (mut stack Stack) pop() ?f32 {\n\tif stack.depth > 0 {\n\t\tstack.depth--\n\t\tresult := stack.data[stack.depth]\n\t\treturn result\n\t}\n\treturn error('Stack Underflow!!')\n}\n\nfn (stack Stack) peek() ?f32 {\n\tif stack.depth > 0 {\n\t\tresult := stack.data[0]\n\t\treturn result\n\t}\n\treturn error('Out of Bounds...')\n}\n\nfn (mut stack Stack) rpn(input string) ?f32 {\n\tprintln('Input: $input')\n\ttokens := input.split(' ')\n\tmut a := f32(0)\n\tmut b := f32(0)\n\tprintln('Token Stack')\n\tfor token in tokens {\n\t\tif token.str.is_digit() {\n\t\t\tstack.push(token.f32())\n\t\t} else if token in supported_operations {\n\t\t\tb = stack.pop() or { f32(0) }\n\t\t\ta = stack.pop() or { f32(0) }\n\t\t\tmatch token {\n\t\t\t\t'+' {\n\t\t\t\t\tstack.push(a + b)\n\t\t\t\t}\n\t\t\t\t'-' {\n\t\t\t\t\tstack.push(a - b)\n\t\t\t\t}\n\t\t\t\t'*' {\n\t\t\t\t\tstack.push(a * b)\n\t\t\t\t}\n\t\t\t\t'/' {\n\t\t\t\t\tstack.push(a / b)\n\t\t\t\t}\n\t\t\t\t'^' {\n\t\t\t\t\tstack.push(f32(math.pow(a, b)))\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tprintln('Oofffff')\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprint('${token:5s} ')\n\t\tfor i := 0; i < stack.depth; i++ {\n\t\t\tif i == stack.depth - 1 {\n\t\t\t\tprintln('${stack.data[i]:0.6f} |>')\n\t\t\t} else {\n\t\t\t\tprint('${stack.data[i]:0.6f}, ')\n\t\t\t}\n\t\t}\n\t}\n\treturn stack.peek()\n}\n\nfn main() {\n\tmut calc := Stack{}\n\tresult := calc.rpn('3 4 2 * 1 5 - 2 3 ^ ^ / +') or { return }\n\tprintln('\\nResult: $result')\n}\n","language":"V-(Vlang)"},{"code":"Global stack$\n\nFunction RPN(expr$)\nDebug.Print \"Expression:\"\nDebug.Print expr$\nDebug.Print \"Input\", \"Operation\", \"Stack after\"\n\nstack$ = \"\"\ntoken$ = \"#\"\ni = 1\ntoken$ = Split(expr$)(i - 1) 'split is base 0\ntoken2$ = \" \" + token$ + \" \"\n\nDo\n Debug.Print \"Token \"; i; \": \"; token$,\n 'operation\n If InStr(\"+-*/^\", token$) <> 0 Then\n Debug.Print \"operate\",\n op2$ = pop$()\n op1$ = pop$()\n If op1$ = \"\" Then\n Debug.Print \"Error: stack empty for \"; i; \"-th token: \"; token$\n End\n End If\n\n op1 = Val(op1$)\n op2 = Val(op2$)\n\n Select Case token$\n Case \"+\"\n res = CDbl(op1) + CDbl(op2)\n Case \"-\"\n res = CDbl(op1) - CDbl(op2)\n Case \"*\"\n res = CDbl(op1) * CDbl(op2)\n Case \"/\"\n res = CDbl(op1) / CDbl(op2)\n Case \"^\"\n res = CDbl(op1) ^ CDbl(op2)\n End Select\n\n Call push2(str$(res))\n 'default:number\n Else\n Debug.Print \"push\",\n Call push2(token$)\n End If\n Debug.Print \"Stack: \"; reverse$(stack$)\n i = i + 1\n If i > Len(Join(Split(expr, \" \"), \"\")) Then\n token$ = \"\"\n Else\n token$ = Split(expr$)(i - 1) 'base 0\n token2$ = \" \" + token$ + \" \"\n End If\nLoop Until token$ = \"\"\n\nDebug.Print\nDebug.Print \"Result:\"; pop$()\n'extra$ = pop$()\nIf stack <> \"\" Then\n Debug.Print \"Error: extra things on a stack: \"; stack$\nEnd If\nEnd\nEnd Function\n\n'---------------------------------------\nFunction reverse$(s$)\n reverse$ = \"\"\n token$ = \"#\"\n While token$ <> \"\"\n i = i + 1\n token$ = Split(s$, \"|\")(i - 1) 'split is base 0\n reverse$ = token$ & \" \" & reverse$\n Wend\nEnd Function\n'---------------------------------------\nSub push2(s$)\n stack$ = s$ + \"|\" + stack$ 'stack\nEnd Sub\n\nFunction pop$()\n 'it does return empty on empty stack\n pop$ = Split(stack$, \"|\")(0)\n stack$ = Mid$(stack$, InStr(stack$, \"|\") + 1)\nEnd Function\n","language":"VBA"},{"code":"import \"./seq\" for Stack\n\nvar rpnCalculate = Fn.new { |expr|\n if (expr == \"\") Fiber.abort(\"Expression cannot be empty.\")\n System.print(\"For expression = %(expr)\\n\")\n System.print(\"Token Action Stack\")\n var tokens = expr.split(\" \").where { |t| t != \"\" }\n var stack = Stack.new()\n for (token in tokens) {\n var d = Num.fromString(token)\n if (d) {\n stack.push(d)\n System.print(\" %(d) Push num onto top of stack %(stack)\")\n } else if ((token.count > 1) || !\"+-*/^\".contains(token)) {\n Fiber.abort(\"%(token) is not a valid token.\")\n } else if (stack.count < 2) {\n Fiber.abort(\"Stack contains too few operands.\")\n } else {\n var d1 = stack.pop()\n var d2 = stack.pop()\n stack.push(token == \"+\" ? d2 + d1 :\n token == \"-\" ? d2 - d1 :\n token == \"*\" ? d2 * d1 :\n token == \"/\" ? d2 / d1 : d2.pow(d1))\n System.print(\" %(token) Apply op to top of stack %(stack)\")\n }\n }\n System.print(\"\\nThe final value is %(stack.pop())\")\n}\n\nvar expr = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\nrpnCalculate.call(expr)\n","language":"Wren"},{"code":"Function RPN(expr As String) As String\n Dim tokenArray() As String\n Dim stack() As String\n\n Dim Wert1 As Double\n Dim Wert2 As Double\n\n 'Initialize array (removed later)\n ReDim tokenArray(1)\n ReDim stack(1)\n\n tokenArray = Split(expr, \" \")\n\n Dim i As integer\n i = 0\n\n While i <= tokenArray.Ubound\n If tokenArray(i) = \"+\" Then\n Wert2 = Val(stack.pop)\n Wert1 = Val(stack.pop)\n stack.Append(Str(Wert1+Wert2))\n ElseIf tokenArray(i) = \"-\" Then\n Wert2 = Val(stack.pop)\n Wert1 = Val(stack.pop)\n stack.Append(Str(Wert1-Wert2))\n ElseIf tokenArray(i) = \"*\" Then\n Wert2 = Val(stack.pop)\n Wert1 = Val(stack.pop)\n stack.Append(Str(Wert1*Wert2))\n ElseIf tokenArray(i) = \"/\" Then\n Wert2 = Val(stack.pop)\n Wert1 = Val(stack.pop)\n stack.Append(Str(Wert1/Wert2))\n ElseIf tokenArray(i) = \"^\" Then\n Wert2 = Val(stack.pop)\n Wert1 = Val(stack.pop)\n stack.Append(Str(pow(Wert1,Wert2)))\n Else\n stack.Append(tokenArray(i))\n End If\n i = i +1\n Wend\n\n Return stack(2)\n\nEnd Function\n","language":"Xojo"},{"code":"real Stack(10);\nint SP;\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\nchar Str; real Top; int Token, I;\n[Str:= \"3 4 2 * 1 5 - 2 3 ^^ ^^ / + \";\nSP:= 0;\nFormat(6, 8);\nloop [repeat Token:= Str(0); Str:= Str+1;\n until Token # ^ ; \\skip space characters\n case Token of\n ^+: [Top:= Pop; Push(Pop+Top)];\n ^-: [Top:= Pop; Push(Pop-Top)];\n ^*: [Top:= Pop; Push(Pop*Top)];\n ^/: [Top:= Pop; Push(Pop/Top)];\n ^^: [Top:= Pop; Push(Pow(Pop, Top))];\n $A0: quit \\space with MSB set\n other [Push(float(Token-^0))]; \\single digit number\n ChOut(0, Token);\n for I:= 0 to SP-1 do \\show stack\n RlOut(0, Stack(I));\n CrLf(0);\n ];\n]\n","language":"XPL0"},{"code":"var ops=D(\"^\",True, \"*\",'*, \"/\",'/, \"+\",'+, \"-\",'-);\n\nfcn parseRPN(e){\n println(\"\\npostfix: \", e);\n stack:=L();\n foreach tok in (e.split()){\n op:=ops.find(tok);\n if(op){\n\t y := stack.pop(); x := stack.pop();\n\t if(True==op) x=x.pow(y);\n\t else\t x=op(x,y);\n\t stack.append(x);\n }\n else stack.append(tok.toFloat());\n println(tok,\" --> \",stack);\n }\n println(\"result: \", stack[0])\n}\n","language":"Zkl"},{"code":"tests:=T(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\");\nforeach t in (tests) { parseRPN(t) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Parsing/RPN_calculator_algorithm\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate a stack-based evaluator for an expression in [[wp:Reverse Polish notation|<u>r</u>everse <u>P</u>olish <u>n</u>otation (RPN)]] that also shows the changes in the stack as each individual token is processed ''as a table''.\\n\\n\\n* Assume an input of a correct, space separated, string of tokens of an RPN expression\\n* Test with the RPN expression generated from the [[Parsing/Shunting-yard algorithm]] task: <br>\\n <big><big><code> 3 4 2 * 1 5 - 2 3 ^ ^ / + </code></big></big> \\n* Print or display the output here\\n\\n\\n;Notes:\\n* <big><b> '''^''' </b></big> means exponentiation in the expression above.\\n* <big><b> '''/''' </b></big> means division.\\n\\n\\n;See also:\\n* [[Parsing/Shunting-yard algorithm]] for a method of generating an RPN from an infix expression.\\n* Several solutions to [[24 game/Solve]] make use of RPN evaluators (although tracing how they work is not a part of that task).\\n* [[Parsing/RPN to infix conversion]].\\n* [[Arithmetic evaluation]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"[Float] a\\n[String = ((Float, Float) -> Float)] b\\nb[‘+’] = (x, y) -> y + x\\nb[‘-’] = (x, y) -> y - x\\nb[‘*’] = (x, y) -> y * x\\nb[‘/’] = (x, y) -> y / x\\nb[‘^’] = (x, y) -> y ^ x\\n\\nL(c) ‘3 4 2 * 1 5 - 2 3 ^ ^ / +’.split(‘ ’)\\n I c C b\\n V first = a.pop()\\n V second = a.pop()\\n a.append(b[c](first, second))\\n E\\n a.append(Float(c))\\n print(c‘ ’a)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* RPN calculator RC 25/01/2019\\nREVPOL CSECT\\n USING REVPOL,R13 base register\\n B 72(R15) skip savearea\\n DC 17F'0' savearea\\n STM R14,R12,12(R13) save previous context\\n ST R13,4(R15) link backward\\n ST R15,8(R13) link forward\\n LR R13,R15 set addressability\\n XPRNT TEXT,L'TEXT print expression !?\\n L R4,0 js=0 offset in stack\\n LA R5,0 ns=0 number of stack items\\n LA R6,0 jt=0 offset in text\\n LA R7,TEXT r7=@text\\n MVC CC,0(R7) cc first char of token\\n DO WHILE=(CLI,CC,NE,X'00') do while cc<>'0'x\\n MVC CTOK,=CL5' ' ctok=''\\n MVC CTOK(1),CC ctok=cc\\n CLI CC,C' ' if cc=' '\\n BE ITERATE then goto iterate\\n IF CLI,CC,GE,C'0',AND,CLI,CC,LE,C'9' THEN\\n MVC DEED,=C'Load' deed='Load'\\n XDECI R2,0(R7) r2=cint(text); r1=@text\\n ST R2,STACK(R4) stack(js)=cc\\n SR R1,R7 lt length of token\\n BCTR R1,0 lt-1\\n EX R1,MVCV MVC CTOK(\\\"R1\\\"),0(R7)\\n AR R6,R1 jt+=lt-1\\n AR R7,R1 @text+=lt-1\\n LA R4,4(R4) js+=4\\n LA R5,1(R5) ns++\\n ELSE , else\\n MVC DEED,=C'Exec' deed='Exec'\\n LA R9,STACK-8(R4) @stack(j-1)\\n IF CLI,CC,EQ,C'+' THEN if cc='+' then\\n L R1,STACK-8(R4) stack(j-1)\\n A R1,STACK-4(R4) stack(j-1)+stack(j)\\n ST R1,0(R9) stack(j-1)=stack(j-1)+stack(j)\\n ENDIF , endif\\n IF CLI,CC,EQ,C'-' THEN if cc='-' then\\n L R1,STACK-8(R4) stack(j-1)\\n S R1,STACK-4(R4) stack(j-1)-stack(j)\\n ST R1,0(R9) stack(j-1)=stack(j-1)-stack(j)\\n ENDIF , endif\\n IF CLI,CC,EQ,C'*' THEN if cc='*' then\\n L R3,STACK-8(R4) stack(j-1)\\n M R2,STACK-4(R4) stack(j-1)*stack(j)\\n ST R3,0(R9) stack(j-1)=stack(j-1)*stack(j)\\n ENDIF , endif\\n IF CLI,CC,EQ,C'/' THEN if cc='/' then\\n L R2,STACK-8(R4) stack(j-1)\\n SRDA R2,32 for sign propagation\\n D R2,STACK-4(R4) stack(j-1)/stack(j)\\n ST R3,0(R9) stack(j-1)=stack(j-1)/stack(j)\\n ENDIF , endif\\n IF CLI,CC,EQ,C'^' THEN if cc='^' then\\n LA R3,1 r3=1\\n L R0,STACK-4(R4) r0=stack(j) [loop count]\\nEXPONENT M R2,STACK-8(R4) r3=r3*stack(j-1)\\n BCT R0,EXPONENT if r0--<>0 then goto exponent\\n ST R3,0(R9) stack(j-1)=stack(j-1)^stack(j)\\n ENDIF , endif\\n S R4,=F'4' js-=4\\n BCTR R5,0 ns--\\n ENDIF , endif\\n MVC PG,=CL80' ' clean buffer\\n MVC PG(4),DEED output deed\\n MVC PG+5(5),CTOK output cc\\n MVC PG+11(6),=C'Stack:' output\\n LA R2,1 i=1\\n LA R3,STACK @stack\\n LA R9,PG+18 @buffer\\n DO WHILE=(CR,R2,LE,R5) do i=1 to ns\\n L R1,0(R3) stack(i)\\n XDECO R1,XDEC edit stack(i)\\n MVC 0(5,R9),XDEC+7 output stack(i)\\n LA R2,1(R2) i=i+1\\n LA R3,4(R3) @stack+=4\\n LA R9,6(R9) @buffer+=6\\n ENDDO , enddo\\n XPRNT PG,L'PG print\\nITERATE LA R6,1(R6) jt++\\n LA R7,1(R7) @text++\\n MVC CC,0(R7) cc next char\\n ENDDO , enddo\\n L R1,STACK stack(1)\\n XDECO R1,XDEC edit stack(1)\\n MVC XDEC(4),=C'Val=' output\\n XPRNT XDEC,L'XDEC print stack(1)\\n L R13,4(0,R13) restore previous savearea pointer\\n LM R14,R12,12(R13) restore previous context\\n XR R15,R15 rc=0\\n BR R14 exit\\nMVCV MVC CTOK(0),0(R7) patern mvc\\nTEXT DC C'3 4 2 * 1 5 - 2 3 ^ ^ / +',X'00'\\nSTACK DS 16F stack(16)\\nDEED DS CL4\\nCC DS C\\nCTOK DS CL5\\nPG DS CL80\\nXDEC DS CL12\\n YREGS\\n END REVPOL\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:REAL.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE PTR=\\\"CARD\\\"\\nDEFINE BUFFER_SIZE=\\\"60\\\"\\nDEFINE ENTRY_SIZE=\\\"6\\\"\\nDEFINE MAX_SIZE=\\\"10\\\"\\nBYTE ARRAY stack(BUFFER_SIZE)\\nBYTE stackSize=[0]\\n\\nBYTE FUNC IsEmpty()\\n IF stackSize=0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nPTR FUNC GetPtr(BYTE i)\\nRETURN (stack+i*ENTRY_SIZE)\\n\\nPROC Push(REAL POINTER v)\\n REAL POINTER p\\n\\n IF stackSize=MAX_SIZE THEN\\n PrintE(\\\"Error: stack is full!\\\")\\n Break()\\n FI\\n p=GetPtr(stackSize)\\n RealAssign(v,p)\\n stackSize==+1\\nRETURN\\n\\nPROC Pop(REAL POINTER v)\\n REAL POINTER p\\n\\n IF IsEmpty() THEN\\n PrintE(\\\"Error: stack is empty!\\\")\\n Break()\\n FI\\n stackSize==-1\\n p=GetPtr(stackSize)\\n RealAssign(p,v)\\nRETURN\\n\\nPROC PrintStack()\\n INT i\\n REAL POINTER p\\n\\n FOR i=0 TO stackSize-1\\n DO\\n p=GetPtr(i)\\n PrintR(p) Put(32)\\n OD\\n PutE()\\nRETURN\\n\\nBYTE FUNC GetToken(CHAR ARRAY s BYTE start CHAR ARRAY t)\\n BYTE pos\\n\\n pos=start\\n WHILE pos<=s(0) AND s(pos)#'\\n DO\\n pos==+1\\n OD\\n SCopyS(t,s,start,pos-1)\\nRETURN (pos)\\n\\nPROC MyPower(REAL POINTER base,exp,res)\\n INT i,expI\\n REAL tmp\\n\\n expI=RealToInt(exp)\\n IF expI<0 THEN Break() FI\\n\\n IntToReal(1,res)\\n FOR i=1 TO expI\\n DO\\n RealMult(res,base,tmp)\\n RealAssign(tmp,res)\\n OD\\nRETURN\\n\\nPROC Process(CHAR ARRAY s)\\n DEFINE Pop21=\\\"Pop(v2) Pop(v1)\\\"\\n CHAR ARRAY t(100)\\n BYTE i,j\\n CHAR c\\n REAL v1,v2,v3\\n\\n i=1\\n WHILE i<=s(0)\\n DO\\n WHILE i<=s(0) AND s(i)='\\n DO i==+1 OD\\n IF i>s(0) THEN EXIT FI\\n\\n i=GetToken(s,i,t)\\n IF SCompare(t,\\\"+\\\")=0 THEN\\n Pop21 RealAdd(v1,v2,v3)\\n Print(\\\"calc +: \\\")\\n ELSEIF SCompare(t,\\\"-\\\")=0 THEN\\n Pop21 RealSub(v1,v2,v3)\\n Print(\\\"calc -: \\\")\\n ELSEIF SCompare(t,\\\"*\\\")=0 THEN\\n Pop21 RealMult(v1,v2,v3)\\n Print(\\\"calc *: \\\")\\n ELSEIF SCompare(t,\\\"/\\\")=0 THEN\\n Pop21 RealDiv(v1,v2,v3)\\n Print(\\\"calc /: \\\")\\n ELSEIF SCompare(t,\\\"^\\\")=0 THEN\\n Pop21 MyPower(v1,v2,v3)\\n Print(\\\"calc ^: \\\")\\n ELSE\\n ValR(t,v3)\\n PrintF(\\\"push %S: \\\",t)\\n FI\\n Push(v3)\\n PrintStack()\\n OD\\nRETURN\\n\\nPROC Test(CHAR ARRAY s)\\n PrintE(s) PutE()\\n Process(s)\\nRETURN\\n\\nPROC Main()\\n Put(125) PutE() ;clear the screen\\n Test(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Containers.Vectors;\\n\\nprocedure RPN_Calculator is\\n\\n package IIO is new Ada.Text_IO.Float_IO(Float);\\n\\n package Float_Vec is new Ada.Containers.Vectors\\n (Index_Type => Positive, Element_Type => Float);\\n Stack: Float_Vec.Vector;\\n\\n Input: String := Ada.Text_IO.Get_Line;\\n Cursor: Positive := Input'First;\\n New_Cursor: Positive;\\n\\nbegin\\n loop\\n -- read spaces\\n while Cursor <= Input'Last and then Input(Cursor)=' ' loop\\n Cursor := Cursor + 1;\\n end loop;\\n\\n exit when Cursor > Input'Last;\\n\\n New_Cursor := Cursor;\\n while New_Cursor <= Input'Last and then Input(New_Cursor) /= ' ' loop\\n New_Cursor := New_Cursor + 1;\\n end loop;\\n\\n -- try to read a number and push it to the stack\\n declare\\n Last: Positive;\\n Value: Float;\\n X, Y: Float;\\n begin\\n IIO.Get(From => Input(Cursor .. New_Cursor - 1),\\n Item => Value,\\n Last => Last);\\n Stack.Append(Value);\\n Cursor := New_Cursor;\\n\\n exception -- if reading the number fails, try to read an operator token\\n when others =>\\n Y := Stack.Last_Element; Stack.Delete_Last; -- pick two elements\\n X := Stack.Last_Element; Stack.Delete_Last; -- from the stack\\n case Input(Cursor) is\\n when '+' => Stack.Append(X+Y);\\n when '-' => Stack.Append(X-Y);\\n when '*' => Stack.Append(X*Y);\\n when '/' => Stack.Append(X/Y);\\n when '^' => Stack.Append(X ** Integer(Float'Rounding(Y)));\\n when others => raise Program_Error with \\\"unecpected token '\\\"\\n & Input(Cursor) & \\\"' at column\\\" & Integer'Image(Cursor);\\n end case;\\n Cursor := New_Cursor;\\n end;\\n\\n for I in Stack.First_Index .. Stack.Last_Index loop\\n Ada.Text_IO.Put(\\\" \\\");\\n IIO.Put(Stack.Element(I), Aft => 5, Exp => 0);\\n end loop;\\n Ada.Text_IO.New_Line;\\n end loop;\\n\\n Ada.Text_IO.Put(\\\"Result = \\\");\\n IIO.Put(Item => Stack.Last_Element, Aft => 5, Exp => 0);\\n\\n\\nend RPN_Calculator;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# RPN Expression evaluator - handles numbers and + - * / ^ #\\n# the right-hand operand for ^ is converted to an integer #\\n\\n# expression terminator #\\nCHAR end of expression character = REPR 12;\\n\\n# evaluates the specified rpn expression #\\nPROC evaluate = ( STRING rpn expression )VOID:\\nBEGIN\\n\\n [ 256 ]REAL stack;\\n INT stack pos := 0;\\n\\n # pops an element off the stack #\\n PROC pop = REAL:\\n BEGIN\\n stack pos -:= 1;\\n stack[ stack pos + 1 ]\\n END; # pop #\\n\\n INT rpn pos := LWB rpn expression;\\n\\n # evaluate tokens from the expression until we get the end of expression #\\n WHILE\\n\\n # get the next token from the string #\\n\\n STRING token type;\\n REAL value;\\n\\n # skip spaces #\\n WHILE rpn expression[ rpn pos ] = \\\" \\\"\\n DO\\n rpn pos +:= 1\\n OD;\\n\\n # handle the token #\\n IF rpn expression[ rpn pos ] = end of expression character\\n THEN\\n # no more tokens #\\n FALSE\\n\\n ELSE\\n # have a token #\\n\\n IF rpn expression[ rpn pos ] >= \\\"0\\\"\\n AND rpn expression[ rpn pos ] <= \\\"9\\\"\\n THEN\\n # have a number #\\n\\n # find where the nmumber is in the expression #\\n INT number start = rpn pos;\\n WHILE ( rpn expression[ rpn pos ] >= \\\"0\\\"\\n AND rpn expression[ rpn pos ] <= \\\"9\\\"\\n )\\n OR rpn expression[ rpn pos ] = \\\".\\\"\\n DO\\n rpn pos +:= 1\\n OD;\\n\\n # read the number from the expression #\\n FILE number f;\\n associate( number f\\n , LOC STRING := rpn expression[ number start : rpn pos - 1 ]\\n );\\n get( number f, ( value ) );\\n close( number f );\\n\\n token type := \\\"number\\\"\\n\\n ELSE\\n # must be an operator #\\n CHAR op = rpn expression[ rpn pos ];\\n rpn pos +:= 1;\\n\\n REAL arg1 := pop;\\n REAL arg2 := pop;\\n token type := op;\\n\\n value := IF op = \\\"+\\\"\\n THEN\\n # add the top two stack elements #\\n arg1 + arg2\\n ELIF op = \\\"-\\\"\\n THEN\\n # subtract the top two stack elements #\\n arg2 - arg1\\n ELIF op = \\\"*\\\"\\n THEN\\n # multiply the top two stack elements #\\n arg2 * arg1\\n ELIF op = \\\"/\\\"\\n THEN\\n # divide the top two stack elements #\\n arg2 / arg1\\n ELIF op = \\\"^\\\"\\n THEN\\n # raise op2 to the power of op1 #\\n arg2 ^ ENTIER arg1\\n ELSE\\n # unknown operator #\\n print( ( \\\"Unknown operator: \\\"\\\"\\\" + op + \\\"\\\"\\\"\\\", newline ) );\\n 0\\n FI\\n\\n FI;\\n\\n TRUE\\n FI\\n DO\\n # push the new value on the stack and show the new stack #\\n\\n stack[ stack pos +:= 1 ] := value;\\n\\n print( ( ( token type + \\\" \\\" )[ 1 : 8 ] ) );\\n FOR element FROM LWB stack TO stack pos\\n DO\\n print( ( \\\" \\\", fixed( stack[ element ], 8, 4 ) ) )\\n OD;\\n print( ( newline ) )\\n\\n OD;\\n\\n print( ( \\\"Result is: \\\", fixed( stack[ stack pos ], 12, 8 ), newline ) )\\n\\nEND; # evaluate #\\n\\nmain: (\\n\\n # get the RPN expresson from the user #\\n\\n STRING rpn expression;\\n\\n print( ( \\\"Enter expression: \\\" ) );\\n read( ( rpn expression, newline ) );\\n\\n # add a space to terminate the final token and an expression terminator #\\n rpn expression +:= \\\" \\\" + end of expression character;\\n\\n # execute the expression #\\n evaluate( rpn expression )\\n\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"1000 DECLARE EXTERNAL SUB rpn\\n1010 PUBLIC NUMERIC R(64) ! stack\\n1020 PUBLIC STRING expn$ ! for keyboard input\\n1030 PUBLIC NUMERIC i, lenn, n, true, false ! global values\\n1040 LET true = -1\\n1050 LET false = 0\\n1060 DO\\n1070 PRINT \\\"enter an RPN expression:\\\"\\n1080 INPUT expn$\\n1090 IF LEN( expn$ ) = 0 THEN EXIT DO\\n1100 PRINT \\\"expn: \\\";expn$\\n1110 CALL rpn( expn$ )\\n1120 LOOP\\n1130 END\\n1140 !\\n1150 ! interpret reverse polish (postfix) expression\\n1160 EXTERNAL SUB rpn( expn$ )\\n1170 DECLARE EXTERNAL FUNCTION is_digit, get_number\\n1180 DECLARE EXTERNAL SUB print_stack\\n1190 DECLARE STRING ch$\\n1200 LET expn$ = expn$ & \\\" \\\" ! must terminate line with space\\n1210 LET lenn = LEN( expn$ )\\n1220 LET i = 0\\n1230 LET n = 1\\n1240 LET R(n) = 0.0 ! push zero for unary operations\\n1250 DO\\n1260 IF i >= lenn THEN EXIT DO ! at end of line\\n1270 LET i = i + 1\\n1280 IF expn$(i:i) <> \\\" \\\" THEN ! skip white spaces\\n1290 IF is_digit( expn$(i:i) ) = true THEN ! push number onto stack\\n1300 LET n = n + 1\\n1310 LET R(n) = get_number\\n1320 CALL print_stack\\n1330 ELSEIF expn$(i:i) = \\\"+\\\" then ! add and pop stack\\n1340 IF n < 2 THEN\\n1350 PRINT \\\"stack underflow\\\"\\n1360 ELSE\\n1370 LET R(n-1) = R(n-1) + R(n)\\n1380 LET n = n - 1\\n1390 CALL print_stack\\n1400 END IF\\n1410 ELSEIF expn$(i:i) = \\\"-\\\" then ! subtract and pop stack\\n1420 IF n < 2 THEN\\n1430 PRINT \\\"stack underflow\\\"\\n1440 ELSE\\n1450 LET R(n-1) = R(n-1) - R(n)\\n1460 LET n = n - 1\\n1470 CALL print_stack\\n1480 END IF\\n1490 ELSEIF expn$(i:i) = \\\"*\\\" then ! multiply and pop stack\\n1500 IF n < 2 THEN\\n1510 PRINT \\\"stack underflow\\\"\\n1520 ELSE\\n1530 LET R(n-1) = R(n-1) * R(n)\\n1540 LET n = n - 1\\n1550 CALL print_stack\\n1560 END IF\\n1570 ELSEIF expn$(i:i) = \\\"/\\\" THEN ! divide and pop stack\\n1580 IF n < 2 THEN\\n1590 PRINT \\\"stack underflow\\\"\\n1600 ELSE\\n1610 LET R(n-1) = R(n-1) / R(n)\\n1620 LET n = n - 1\\n1630 CALL print_stack\\n1640 END IF\\n1650 ELSEIF expn$(i:i) = \\\"^\\\" THEN ! raise to power and pop stack\\n1660 IF n < 2 THEN\\n1670 PRINT \\\"stack underflow\\\"\\n1680 ELSE\\n1690 LET R(n-1) = R(n-1) ^ R(n)\\n1700 LET n = n - 1\\n1710 CALL print_stack\\n1720 END IF\\n1730 ELSE\\n1740 PRINT REPEAT$( \\\" \\\", i+5 ); \\\"^ error\\\"\\n1750 EXIT DO\\n1760 END IF\\n1770 END IF\\n1780 LOOP\\n1790 PRINT \\\"result: \\\"; R(n) ! end of main program\\n1800 END SUB\\n1810 !\\n1820 ! extract a number from a string\\n1830 EXTERNAL FUNCTION get_number\\n1840 DECLARE EXTERNAL FUNCTION is_digit\\n1850 LET i1 = i ! start of number substring\\n1860 DO ! get integer part\\n1870 LET i = i + 1\\n1880 IF is_digit( expn$(i:i) ) = false THEN\\n1890 IF expn$(i:i) = \\\".\\\" THEN\\n1900 LET i = i + 1\\n1910 DO WHILE is_digit( expn$(i:i) ) = true ! get fractional part\\n1920 LET i = i + 1\\n1930 LOOP\\n1940 END IF\\n1950 EXIT DO\\n1960 END IF\\n1970 LOOP\\n1980 LET get_number = VAL( expn$(i1:i - 1) )\\n1990 END FUNCTION\\n2000 !\\n2010 ! check for digit character\\n2020 EXTERNAL FUNCTION is_digit( ch$ )\\n2030 IF \\\"0\\\" <= ch$ AND ch$ <= \\\"9\\\" THEN\\n2040 LET is_digit = true\\n2050 ELSE\\n2060 LET is_digit = false\\n2070 END IF\\n2080 END FUNCTION\\n2090 !\\n2100 EXTERNAL SUB print_stack\\n2110 PRINT expn$(i:i);\\\" \\\";\\n2120 FOR ptr=n TO 2 STEP -1\\n2130 PRINT USING \\\"-----%.####\\\":R(ptr);\\n2140 NEXT ptr\\n2150 PRINT\\n2160 END SUB\\n\",\n \"language\": \"ANSI-BASIC\"\n },\n {\n \"code\": \"grammar rpnC ;\\n//\\n// rpn Calculator\\n//\\n// Nigel Galloway - April 7th., 2012\\n//\\n@members {\\nStack<Double> s = new Stack<Double>();\\n}\\nrpn\\t:\\t(WS* (num|op) (WS | WS* NEWLINE {System.out.println(s.pop());}))*;\\nnum\\t:\\t'-'? Digit+ ('.' Digit+)? {s.push(Double.parseDouble($num.text));};\\nDigit\\t:\\t'0'..'9';\\nop\\t:\\t'-' {double x = s.pop(); s.push(s.pop() - x);}\\n\\t|\\t'/' {double x = s.pop(); s.push(s.pop() / x);}\\n\\t|\\t'*' {s.push(s.pop() * s.pop());}\\n\\t|\\t'^' {double x = s.pop(); s.push(Math.pow(s.pop(), x));}\\n\\t|\\t'+' {s.push(s.pop() + s.pop());};\\nWS\\t:\\t(' ' | '\\\\t'){skip()};\\nNEWLINE\\t:\\t'\\\\r'? '\\\\n';\\n\",\n \"language\": \"ANTLR\"\n },\n {\n \"code\": \"evalRPN(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\nevalRPN(s){\\n\\tstack := []\\n\\tout := \\\"For RPN expression: '\\\" s \\\"'`r`n`r`nTOKEN`t`tACTION`t`t`tSTACK`r`n\\\"\\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)\\n\\t\\t\\t\\t, out .= t \\\"`tPush num onto top of stack`t\\\" stackShow(stack) \\\"`r`n\\\"\\n\\t\\t\\t\\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:l = \\\"^\\\" ? b **a\\n\\t\\t\\t\\t\\t\\t:0\\t)\\n\\t\\t\\t\\tout .= l \\\"`tApply op \\\" l \\\" to top of stack`t\\\" stackShow(stack) \\\"`r`n\\\"\\n\\t\\t\\t}\\n\\t\\t}\\n\\tr := stack.Remove()\\n\\tout .= \\\"`r`n The final output value is: '\\\" r \\\"'\\\"\\n\\tclipboard := out\\n\\treturn r\\n}\\nStackShow(stack){\\n\\tfor each, value in stack\\n\\t\\tout .= A_Space value\\n\\treturn subStr(out, 2)\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" @% = &60B\\n RPN$ = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n\\n DIM Stack(1000)\\n SP% = 0\\n\\n FOR i% = 1 TO LEN(RPN$)\\n Token$ = MID$(RPN$,i%,1)\\n IF Token$ <> \\\" \\\" THEN\\n PRINT Token$ \\\" :\\\";\\n CASE Token$ OF\\n WHEN \\\"+\\\": PROCpush(FNpop + FNpop)\\n WHEN \\\"-\\\": PROCpush(-FNpop + FNpop)\\n WHEN \\\"*\\\": PROCpush(FNpop * FNpop)\\n WHEN \\\"/\\\": n = FNpop : PROCpush(FNpop / n)\\n WHEN \\\"^\\\": n = FNpop : PROCpush(FNpop ^ n)\\n WHEN \\\"0\\\",\\\"1\\\",\\\"2\\\",\\\"3\\\",\\\"4\\\",\\\"5\\\",\\\"6\\\",\\\"7\\\",\\\"8\\\",\\\"9\\\":\\n PROCpush(VALMID$(RPN$,i%))\\n WHILE ASCMID$(RPN$,i%)>=48 AND ASCMID$(RPN$,1)<=57\\n i% += 1\\n ENDWHILE\\n ENDCASE\\n FOR j% = SP%-1 TO 0 STEP -1 : PRINT Stack(j%); : NEXT\\n PRINT\\n ENDIF\\n NEXT i%\\n END\\n\\n DEF PROCpush(n)\\n IF SP% > DIM(Stack(),1) ERROR 100, \\\"Stack full\\\"\\n Stack(SP%) = n\\n SP% += 1\\n ENDPROC\\n\\n DEF FNpop\\n IF SP% = 0 ERROR 100, \\\"Stack empty\\\"\\n SP% -= 1\\n = Stack(SP%)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"( ( show\\n = line a\\n . \\\\n:?line\\n & whl\\n ' (!arg:%?a ?arg&!a \\\" \\\" !line:?line)\\n & put$(str$!line)\\n )\\n& :?stack\\n& map\\n $ ( (\\n = a b\\n . show$(!arg !stack)\\n & ( !arg\\n : ( \\\"+\\\"\\n | \\\"-\\\"\\n | \\\"*\\\"\\n | \\\"/\\\"\\n | \\\"^\\\"\\n )\\n & !stack:%?a %?b ?stack\\n & ( !arg:\\\"+\\\"&!a+!b\\n | !arg:\\\"-\\\"&-1*!a+!b\\n | !arg:\\\"*\\\"&!a*!b\\n | !arg:\\\"/\\\"&!a*!b^-1\\n | !a^!b\\n )\\n | !arg\\n )\\n !stack\\n : ?stack\\n )\\n . vap$((=.!arg).get'(,STR).\\\" \\\")\\n )\\n& out$!stack\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n\\nvoid die(const char *msg)\\n{\\n\\tfprintf(stderr, \\\"%s\\\", msg);\\n\\tabort();\\n}\\n\\n#define MAX_D 256\\ndouble stack[MAX_D];\\nint depth;\\n\\nvoid push(double v)\\n{\\n\\tif (depth >= MAX_D) die(\\\"stack overflow\\\\n\\\");\\n\\tstack[depth++] = v;\\n}\\n\\ndouble pop()\\n{\\n\\tif (!depth) die(\\\"stack underflow\\\\n\\\");\\n\\treturn stack[--depth];\\n}\\n\\ndouble rpn(char *s)\\n{\\n\\tdouble a, b;\\n\\tint i;\\n\\tchar *e, *w = \\\" \\\\t\\\\n\\\\r\\\\f\\\";\\n\\n\\tfor (s = strtok(s, w); s; s = strtok(0, w)) {\\n\\t\\ta = strtod(s, &e);\\n\\t\\tif (e > s)\\t\\tprintf(\\\" :\\\"), push(a);\\n#define binop(x) printf(\\\"%c:\\\", *s), b = pop(), a = pop(), push(x)\\n\\t\\telse if (*s == '+')\\tbinop(a + b);\\n\\t\\telse if (*s == '-')\\tbinop(a - b);\\n\\t\\telse if (*s == '*')\\tbinop(a * b);\\n\\t\\telse if (*s == '/')\\tbinop(a / b);\\n\\t\\telse if (*s == '^')\\tbinop(pow(a, b));\\n#undef binop\\n\\t\\telse {\\n\\t\\t\\tfprintf(stderr, \\\"'%c': \\\", *s);\\n\\t\\t\\tdie(\\\"unknown oeprator\\\\n\\\");\\n\\t\\t}\\n\\t\\tfor (i = depth; i-- || 0 * putchar('\\\\n'); )\\n\\t\\t\\tprintf(\\\" %g\\\", stack[i]);\\n\\t}\\n\\n\\tif (depth != 1) die(\\\"stack leftover\\\\n\\\");\\n\\n\\treturn pop();\\n}\\n\\nint main(void)\\n{\\n\\tchar s[] = \\\" 3 4 2 * 1 5 - 2 3 ^ ^ / + \\\";\\n\\tprintf(\\\"%g\\\\n\\\", rpn(s));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <ctype.h>\\n#include <string.h>\\n#include <math.h>\\n\\n#define die(msg) fprintf(stderr, msg\\\"\\\\n\\\"), abort();\\ndouble get(const char *s, const char *e, char **new_e)\\n{\\n\\tconst char *t;\\n\\tdouble a, b;\\n\\n\\tfor (e--; e >= s && isspace(*e); e--);\\n\\tfor (t = e; t > s && !isspace(t[-1]); t--);\\n\\n\\tif (t < s) die(\\\"underflow\\\");\\n\\n#define get2(expr) b = get(s, t, (char **)&t), a = get(s, t, (char **)&t), a = expr\\n\\ta = strtod(t, (char **)&e);\\n\\tif (e <= t) {\\n\\t\\tif\\t(t[0] == '+') get2(a + b);\\n\\t\\telse if (t[0] == '-') get2(a - b);\\n\\t\\telse if (t[0] == '*') get2(a * b);\\n\\t\\telse if (t[0] == '/') get2(a / b);\\n\\t\\telse if (t[0] == '^') get2(pow(a, b));\\n\\t\\telse {\\n\\t\\t\\tfprintf(stderr, \\\"'%c': \\\", t[0]);\\n\\t\\t\\tdie(\\\"unknown token\\\");\\n\\t\\t}\\n\\t}\\n#undef get2\\n\\n\\t*(const char **)new_e = t;\\n\\treturn a;\\n}\\n\\ndouble rpn(const char *s)\\n{\\n\\tconst char *e = s + strlen(s);\\n\\tdouble v = get(s, e, (char**)&e);\\n\\n\\twhile (e > s && isspace(e[-1])) e--;\\n\\tif (e == s) return v;\\n\\n\\tfprintf(stderr, \\\"\\\\\\\"%.*s\\\\\\\": \\\", e - s, s);\\n\\tdie(\\\"front garbage\\\");\\n}\\n\\nint main(void)\\n{\\n\\tprintf(\\\"%g\\\\n\\\", rpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"));\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <vector>\\n#include <string>\\n#include <sstream>\\n#include <iostream>\\n#include <cmath>\\n#include <algorithm>\\n#include <iterator>\\n#include <cstdlib>\\n\\ndouble rpn(const std::string &expr){\\n std::istringstream iss(expr);\\n std::vector<double> stack;\\n std::cout << \\\"Input\\\\tOperation\\\\tStack after\\\" << std::endl;\\n std::string token;\\n while (iss >> token) {\\n std::cout << token << \\\"\\\\t\\\";\\n double tokenNum;\\n if (std::istringstream(token) >> tokenNum) {\\n std::cout << \\\"Push\\\\t\\\\t\\\";\\n stack.push_back(tokenNum);\\n } else {\\n std::cout << \\\"Operate\\\\t\\\\t\\\";\\n double secondOperand = stack.back();\\n stack.pop_back();\\n double firstOperand = stack.back();\\n stack.pop_back();\\n if (token == \\\"*\\\")\\n\\tstack.push_back(firstOperand * secondOperand);\\n else if (token == \\\"/\\\")\\n\\tstack.push_back(firstOperand / secondOperand);\\n else if (token == \\\"-\\\")\\n\\tstack.push_back(firstOperand - secondOperand);\\n else if (token == \\\"+\\\")\\n\\tstack.push_back(firstOperand + secondOperand);\\n else if (token == \\\"^\\\")\\n\\tstack.push_back(std::pow(firstOperand, secondOperand));\\n else { //just in case\\n\\tstd::cerr << \\\"Error\\\" << std::endl;\\n\\tstd::exit(1);\\n }\\n }\\n std::copy(stack.begin(), stack.end(), std::ostream_iterator<double>(std::cout, \\\" \\\"));\\n std::cout << std::endl;\\n }\\n return stack.back();\\n}\\n\\nint main() {\\n std::string s = \\\" 3 4 2 * 1 5 - 2 3 ^ ^ / + \\\";\\n std::cout << \\\"Final answer: \\\" << rpn(s) << std::endl;\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Globalization;\\nusing System.Threading;\\n\\nnamespace RPNEvaluator\\n{\\n class RPNEvaluator\\n {\\n static void Main(string[] args)\\n {\\n Thread.CurrentThread.CurrentCulture = CultureInfo.InvariantCulture;\\n\\n string rpn = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\";\\n Console.WriteLine(\\\"{0}\\\\n\\\", rpn);\\n\\n decimal result = CalculateRPN(rpn);\\n Console.WriteLine(\\\"\\\\nResult is {0}\\\", result);\\n }\\n\\n static decimal CalculateRPN(string rpn)\\n {\\n string[] rpnTokens = rpn.Split(' ');\\n Stack<decimal> stack = new Stack<decimal>();\\n decimal number = decimal.Zero;\\n\\n foreach (string token in rpnTokens)\\n {\\n if (decimal.TryParse(token, out number))\\n {\\n stack.Push(number);\\n }\\n else\\n {\\n switch (token)\\n {\\n case \\\"^\\\":\\n case \\\"pow\\\":\\n {\\n number = stack.Pop();\\n stack.Push((decimal)Math.Pow((double)stack.Pop(), (double)number));\\n break;\\n }\\n case \\\"ln\\\":\\n {\\n stack.Push((decimal)Math.Log((double)stack.Pop(), Math.E));\\n break;\\n }\\n case \\\"sqrt\\\":\\n {\\n stack.Push((decimal)Math.Sqrt((double)stack.Pop()));\\n break;\\n }\\n case \\\"*\\\":\\n {\\n stack.Push(stack.Pop() * stack.Pop());\\n break;\\n }\\n case \\\"/\\\":\\n {\\n number = stack.Pop();\\n stack.Push(stack.Pop() / number);\\n break;\\n }\\n case \\\"+\\\":\\n {\\n stack.Push(stack.Pop() + stack.Pop());\\n break;\\n }\\n case \\\"-\\\":\\n {\\n number = stack.Pop();\\n stack.Push(stack.Pop() - number);\\n break;\\n }\\n default:\\n Console.WriteLine(\\\"Error in CalculateRPN(string) Method!\\\");\\n break;\\n }\\n }\\n PrintState(stack);\\n }\\n\\n return stack.Pop();\\n }\\n\\n static void PrintState(Stack<decimal> stack)\\n {\\n decimal[] arr = stack.ToArray();\\n\\n for (int i = arr.Length - 1; i >= 0; i--)\\n {\\n Console.Write(\\\"{0,-8:F3}\\\", arr[i]);\\n }\\n\\n Console.WriteLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import ceylon.collection {\\n\\n\\tArrayList\\n}\\n\\nshared void run() {\\n\\t\\n\\tvalue ops = map {\\n\\t\\t\\\"+\\\" -> plus<Float>,\\n\\t\\t\\\"*\\\" -> times<Float>,\\n\\t\\t\\\"-\\\" -> ((Float a, Float b) => a - b),\\n\\t\\t\\\"/\\\" -> ((Float a, Float b) => a / b),\\n\\t\\t\\\"^\\\" -> ((Float a, Float b) => a ^ b)\\n\\t};\\n\\t\\n\\tvoid printTableRow(String|Float token, String description, {Float*} stack) {\\n\\t\\tprint(\\\"``token.string.padTrailing(8)````description.padTrailing(30)````stack``\\\");\\n\\t}\\n\\t\\n\\tfunction calculate(String input) {\\n\\t\\t\\n\\t\\tvalue stack = ArrayList<Float>();\\n\\t\\tvalue tokens = input.split().map((String element)\\n\\t\\t\\t=> if(ops.keys.contains(element)) then element else parseFloat(element));\\n\\t\\t\\n\\t\\tprint(\\\"Token Operation Stack\\\");\\n\\t\\t\\n\\t\\tfor(token in tokens.coalesced) {\\n\\t\\t\\tif(is Float token) {\\n\\t\\t\\t\\tstack.push(token);\\n\\t\\t\\t\\tprintTableRow(token, \\\"push\\\", stack);\\n\\t\\t\\t} else if(exists op = ops[token], exists first = stack.pop(), exists second = stack.pop()) {\\n\\t\\t\\t\\tvalue result = op(second, first);\\n\\t\\t\\t\\tstack.push(result);\\n\\t\\t\\t\\tprintTableRow(token, \\\"perform ``token`` on ``formatFloat(second, 1, 1)`` and ``formatFloat(first, 1, 1)``\\\", stack);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tthrow Exception(\\\"bad syntax\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn stack.pop();\\n\\t}\\n\\t\\n\\tprint(calculate(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"));\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(ns rosettacode.parsing-rpn-calculator-algorithm\\n (:require clojure.math.numeric-tower\\n clojure.string\\n clojure.pprint))\\n\\n(def operators\\n \\\"the only allowable operators for our calculator\\\"\\n {\\\"+\\\" +\\n \\\"-\\\" -\\n \\\"*\\\" *\\n \\\"/\\\" /\\n \\\"^\\\" clojure.math.numeric-tower/expt})\\n\\n(defn rpn\\n \\\"takes a string and returns a lazy-seq of all the stacks\\\"\\n [string]\\n (letfn [(rpn-reducer [stack item] ; this takes a stack and one item and makes a new stack\\n (if (contains? operators item)\\n (let [operand-1 (peek stack) ; if we used lists instead of vectors, we could use destructuring, but stacks would look backwards\\n stack-1 (pop stack)] ;we're assuming that all the operators are binary\\n (conj (pop stack-1)\\n ((operators item) (peek stack-1) operand-1)))\\n (conj stack (Long. item))))] ; if it wasn't an operator, we'll assume it's a long. Could choose bigint, or even read-line\\n (reductions rpn-reducer [] (clojure.string/split string #\\\"\\\\s+\\\")))) ;reductions is like reduce only shows all the intermediate steps\\n\\n(let [stacks (rpn \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")] ;bind it so we can output the answer separately.\\n (println \\\"stacks: \\\")\\n (clojure.pprint/pprint stacks)\\n (print \\\"answer:\\\" (->> stacks last first)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"% Split string by whitespace\\nsplit = iter (expr: string) yields (string)\\n own whitespace: string := \\\" \\\\r\\\\n\\\\t\\\"\\n cur: array[char] := array[char]$[]\\n for c: char in string$chars(expr) do\\n if string$indexc(c, whitespace) = 0 then\\n array[char]$addh(cur, c)\\n else\\n if array[char]$empty(cur) then continue end\\n yield(string$ac2s(cur))\\n cur := array[char]$[]\\n end\\n end\\n if ~array[char]$empty(cur) then\\n yield(string$ac2s(cur))\\n end\\nend split\\n\\n% Tokenize a RPN expression\\ntoken = oneof[number: real, op: char]\\ntokens = iter (expr: string) yields (token) signals (parse_error(string))\\n own operators: string := \\\"+-*/^\\\"\\n for t: string in split(expr) do\\n if string$size(t) = 1 cand string$indexc(t[1], operators)~=0 then\\n yield(token$make_op(t[1]))\\n else\\n yield(token$make_number(real$parse(t)))\\n except when bad_format:\\n signal parse_error(t)\\n end\\n end\\n end\\nend tokens\\n\\n% Print the stack\\nprint_stack = proc (stack: array[real])\\n po: stream := stream$primary_output()\\n for num: real in array[real]$elements(stack) do\\n stream$puts(po, f_form(num, 5, 5) || \\\" \\\")\\n end\\n stream$putl(po, \\\"\\\")\\nend print_stack\\n\\n% Evaluate an expression, printing the stack at each point\\nevaluate_rpn = proc (expr: string) returns (real) signals (parse_error(string), bounds)\\n stack: array[real] := array[real]$[]\\n for t: token in tokens(expr) do\\n tagcase t\\n tag number (n: real): array[real]$addh(stack, n)\\n tag op (f: char):\\n r: real := array[real]$remh(stack)\\n l: real := array[real]$remh(stack)\\n n: real\\n if f='+' then n := l+r\\n elseif f='-' then n := l-r\\n elseif f='*' then n := l*r\\n elseif f='/' then n := l/r\\n elseif f='^' then n := l**r\\n end\\n array[real]$addh(stack, n)\\n end\\n print_stack(stack)\\n end resignal parse_error\\n return(array[real]$reml(stack))\\nend evaluate_rpn\\n\\nstart_up = proc ()\\n po: stream := stream$primary_output()\\n expr: string := \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n\\n stream$putl(po, \\\"Expression: \\\" || expr)\\n stream$putl(po, \\\"Result: \\\" || f_form(evaluate_rpn(expr), 5, 5))\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \" IDENTIFICATION DIVISION.\\n PROGRAM-ID. RPN.\\n AUTHOR. Bill Gunshannon.\\n INSTALLATION.\\n DATE-WRITTEN. 9 Feb 2020.\\n ************************************************************\\n ** Program Abstract:\\n ** Create a stack-based evaluator for an expression in\\n ** reverse Polish notation (RPN) that also shows the\\n ** changes in the stack as each individual token is\\n ** processed as a table.\\n ************************************************************\\n\\n DATA DIVISION.\\n\\n\\n WORKING-STORAGE SECTION.\\n\\n 01 LineIn PIC X(25).\\n 01 IP PIC 99\\n VALUE 1.\\n 01 CInNum PIC XXXX.\\n\\n 01 Stack PIC S999999V9999999\\n OCCURS 50 times.\\n 01 SP PIC 99\\n VALUE 1.\\n 01 Operator PIC X.\\n 01 Value1 PIC S999999V9999999.\\n 01 Value2 PIC S999999V9999999.\\n 01 Result PIC S999999V9999999.\\n 01 Idx PIC 99.\\n 01 FormatNum PIC ZZZZZZ9.9999999.\\n 01 Zip PIC X.\\n\\n PROCEDURE DIVISION.\\n\\n Main-Program.\\n DISPLAY \\\"Enter the RPN Equation: \\\"\\n WITH NO ADVANCING.\\n ACCEPT LineIn.\\n\\n PERFORM UNTIL IP GREATER THAN\\n FUNCTION STORED-CHAR-LENGTH(LineIn)\\n\\n\\n UNSTRING LineIn DELIMITED BY SPACE INTO CInNum\\n WITH POINTER IP\\n\\n MOVE CInNum TO Operator\\n\\n PERFORM Do-Operation\\n\\n PERFORM Show-Stack\\n\\n END-PERFORM.\\n\\n DISPLAY \\\"End Result: \\\" FormatNum\\n\\n STOP RUN.\\n\\n Do-Operation.\\n\\n EVALUATE Operator\\n WHEN \\\"+\\\"\\n PERFORM Pop\\n Compute Result = Value2 + Value1\\n PERFORM Push\\n\\n WHEN \\\"-\\\"\\n PERFORM Pop\\n Compute Result = Value2 - Value1\\n PERFORM Push\\n\\n WHEN \\\"*\\\"\\n PERFORM Pop\\n Compute Result = Value2 * Value1\\n PERFORM Push\\n\\n WHEN \\\"/\\\"\\n PERFORM Pop\\n Compute Result = Value2 / Value1\\n PERFORM Push\\n\\n WHEN \\\"^\\\"\\n PERFORM Pop\\n Compute Result = Value2 ** Value1\\n PERFORM Push\\n\\n WHEN NUMERIC\\n MOVE Operator TO Result\\n PERFORM Push\\n END-EVALUATE.\\n\\n\\n Show-Stack.\\n\\n DISPLAY \\\"STACK: \\\" WITH NO ADVANCING.\\n MOVE 1 TO Idx.\\n PERFORM UNTIL (Idx = SP)\\n MOVE Stack(Idx) TO FormatNum\\n IF Stack(Idx) IS NEGATIVE\\n THEN\\n DISPLAY \\\" -\\\" FUNCTION TRIM(FormatNum)\\n WITH NO ADVANCING\\n ELSE\\n DISPLAY FormatNum WITH NO ADVANCING\\n END-IF\\n ADD 1 to Idx\\n END-PERFORM.\\n DISPLAY \\\" \\\".\\n\\n Push.\\n\\n MOVE Result TO Stack(SP)\\n ADD 1 TO SP.\\n\\n Pop.\\n\\n SUBTRACT 1 FROM SP\\n MOVE Stack(SP) TO Value1\\n SUBTRACT 1 FROM SP\\n MOVE Stack(SP) TO Value2.\\n\\n\\n END-PROGRAM.\\n\",\n \"language\": \"COBOL\"\n },\n {\n \"code\": \"(setf (symbol-function '^) #'expt) ; Make ^ an alias for EXPT\\n\\n(defun print-stack (token stack)\\n (format T \\\"~a: ~{~a ~}~%\\\" token (reverse stack)))\\n\\n(defun rpn (tokens &key stack verbose )\\n (cond\\n ((and (not tokens) (not stack)) 0)\\n ((not tokens) (car stack))\\n (T\\n (let* ((current (car tokens))\\n (next-stack (if (numberp current)\\n (cons current stack)\\n (let* ((arg2 (car stack))\\n (arg1 (cadr stack))\\n (fun (car tokens)))\\n (cons (funcall fun arg1 arg2) (cddr stack))))))\\n (when verbose\\n (print-stack current next-stack))\\n (rpn (cdr tokens) :stack next-stack :verbose verbose)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.conv, std.typetuple;\\n\\nvoid main() {\\n auto input = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\";\\n writeln(\\\"For postfix expression: \\\", input);\\n writeln(\\\"\\\\nToken Action Stack\\\");\\n real[] stack;\\n foreach (tok; input.split()) {\\n auto action = \\\"Apply op to top of stack\\\";\\n switch (tok) {\\n foreach (o; TypeTuple!(\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\", \\\"^\\\")) {\\n case o:\\n mixin(\\\"stack[$ - 2]\\\" ~\\n (o == \\\"^\\\" ? \\\"^^\\\" : o) ~ \\\"=stack[$ - 1];\\\");\\n stack.length--;\\n break;\\n }\\n break;\\n default:\\n action = \\\"Push num onto top of stack\\\";\\n stack ~= to!real(tok);\\n }\\n writefln(\\\"%3s %-26s %s\\\", tok, action, stack);\\n }\\n writeln(\\\"\\\\nThe final value is \\\", stack[0]);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"{This code normally exists in a library, but is presented here for clarity}\\n\\nfunction ExtractToken(S: string; Sep: char; var P: integer): string;\\n{Extract token from S, starting at P up to but not including Sep}\\n{Terminates with P pointing past Sep or past end of string}\\nvar C: char;\\nbegin\\nResult:='';\\nwhile P<=Length(S) do\\n\\tbegin\\n\\tC:=S[P]; Inc(P);\\n\\tif C=Sep then break\\n\\telse Result:=Result+C;\\n\\tend;\\nend;\\n\\n{Create stack object to handle parsing}\\n\\ntype TRealStack = class(TObject)\\n private\\n Data: array of double;\\n protected\\n public\\n function GetStackStr: string;\\n procedure Push(D: double);\\n function Pop: double;\\n end;\\n\\nprocedure TRealStack.Push(D: double);\\n{Push double on stack}\\nbegin\\nSetLength(Data,Length(Data)+1);\\nData[High(Data)]:=D;\\nend;\\n\\n\\nfunction TRealStack.Pop: double;\\n{Pop double off stack, raises exception if stack empty}\\nbegin\\nif Length(Data)<1 then raise exception.Create('Stack Empty');\\nResult:=Data[High(Data)];\\nSetLength(Data,Length(Data)-1);\\nend;\\n\\n\\nfunction TRealStack.GetStackStr: string;\\n{Get string representation of stack data}\\nvar I: integer;\\nbegin\\nResult:='';\\nfor I:=0 to High(Data) do\\n\\tbegin\\n\\tif I<>0 then Result:=Result+', ';\\n\\tResult:=Result+FloatToStrF(Data[I],ffGeneral,18,4);\\n\\tend;\\nend;\\n\\n\\n\\nprocedure RPNParser(Memo: TMemo; S: string);\\n{Parse RPN string and display all operations}\\nvar I: integer;\\nvar Stack: TRealStack;\\nvar Token: string;\\nvar D: double;\\n\\n\\n\\tfunction HandleOperator(S: string): boolean;\\n\\t{Handle numerical operator command}\\n\\tvar Arg1,Arg2: double;\\n\\tbegin\\n\\tResult:=False;\\n\\t{Empty comand string? }\\n\\tif Length(S)>1 then exit;\\n\\t{Invalid command? }\\n\\tif not (S[1] in ['+','-','*','/','^']) then exit;\\n\\t{Get arguments off stack}\\n\\tArg1:=Stack.Pop; Arg2:=Stack.Pop;\\n\\tResult:=True;\\n\\t{Decode command}\\n\\tcase S[1] of\\n\\t '+': Stack.Push(Arg2 + Arg1);\\n\\t '-': Stack.Push(Arg2 - Arg1);\\n\\t '*': Stack.Push(Arg2 * Arg1);\\n\\t '/': Stack.Push(Arg2 / Arg1);\\n\\t '^': Stack.Push(Power(Arg2,Arg1));\\n\\t else Result:=False;\\n\\t end;\\n\\tend;\\n\\n\\nbegin\\nStack:=TRealStack.Create;\\ntry\\nI:=1;\\nwhile true do\\n\\tbegin\\n\\t{Extract one token from string}\\n\\tToken:=ExtractToken(S,' ',I);\\n\\t{Exit if no more data}\\n\\tif Token='' then break;\\n\\t{If token is a number convert it to a double otherwise, process an operator}\\n\\tif Token[1] in ['0'..'9'] then Stack.Push(StrToFloat(Token))\\n\\telse if not HandleOperator(Token) then raise Exception.Create('Illegal Token: '+Token);\\n\\tMemo.Lines.Add(Token+' ['+Stack.GetStackStr+']');\\n\\tend;\\nfinally Stack.Free; end;\\nend;\\n\\n\\nprocedure ShowRPNParser(Memo: TMemo);\\nvar S: string;\\nbegin\\nS:='3 4 2 * 1 5 - 2 3 ^ ^ / + ';\\nRPNParser(Memo,S);\\nend;\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \";; RPN (postfix) evaluator\\n\\n(lib 'hash)\\n\\n(define OPS (make-hash))\\n(hash-set OPS \\\"^\\\" expt)\\n(hash-set OPS \\\"*\\\" *)\\n(hash-set OPS \\\"/\\\" //) ;; float divide\\n(hash-set OPS \\\"+\\\" +)\\n(hash-set OPS \\\"-\\\" -)\\n\\n(define (op? op) (hash-ref OPS op))\\n\\n;; algorithm : https://en.wikipedia.org/wiki/Reverse_Polish_notation#Postfix_algorithm\\n\\n(define (calculator rpn S)\\n\\t(for ((token rpn))\\n\\t(if (op? token)\\n\\t\\t(let [(op2 (pop S)) (op1 (pop S))]\\n\\t\\t\\t(unless (and op1 op2) (error \\\"cannot calculate expression at:\\\" token))\\n\\t \\t(push S ((op? token) op1 op2))\\n\\t \\t(writeln op1 token op2 \\\"→\\\" (stack-top S)))\\n\\t (push S (string->number token))))\\n\\t(pop S))\\n\\t\\n(define (task rpn)\\n (define S (stack 'S))\\n (calculator (text-parse rpn) S ))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open string generic monad io\\n\\ntype OpType = Push | Operate\\n deriving Show\\n\\ntype Op = Op (OpType typ) input stack\\n deriving Show\\n\\nparse str = split \\\" \\\" str\\n\\neval stack [] = []\\neval stack (x::xs) = op :: eval nst xs\\n where (op, nst) = conv x stack\\n conv \\\"+\\\"@x = operate x (+)\\n conv \\\"-\\\"@x = operate x (-)\\n conv \\\"*\\\"@x = operate x (*)\\n conv \\\"/\\\"@x = operate x (/)\\n conv \\\"^\\\"@x = operate x (**)\\n conv x = \\\\stack ->\\n let n = gread x::stack in\\n (Op Push x n, n)\\n operate input fn (x::y::ys) =\\n let n = (y `fn` x) :: ys in\\n (Op Operate input n, n)\\n\\nprint_line (Op typ input stack) = do\\n putStr input\\n putStr \\\"\\\\t\\\"\\n put typ\\n putStr \\\"\\\\t\\\\t\\\"\\n putLn stack\\n\\nprint ((Op typ input stack)@x::xs) lv = print_line x `seq` print xs (head stack)\\nprint [] lv = lv\\n\\nprint_result xs = do\\n putStrLn \\\"Input\\\\tOperation\\\\tStack after\\\"\\n res <- return $ print xs 0\\n putStrLn (\\\"Result: \\\" ++ show res)\\n\\nres = parse \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" |> eval []\\nprint_result res ::: IO\\n\",\n \"language\": \"Ela\"\n },\n {\n \"code\": \"-module(rpn).\\n-export([eval/1]).\\n\\nparse(Expression) ->\\n parse(string:tokens(Expression,\\\" \\\"),[]).\\n\\nparse([],Expression) ->\\n lists:reverse(Expression);\\nparse([\\\"+\\\"|Xs],Expression) ->\\n parse(Xs,[fun erlang:'+'/2|Expression]);\\nparse([\\\"-\\\"|Xs],Expression) ->\\n parse(Xs,[fun erlang:'-'/2|Expression]);\\nparse([\\\"*\\\"|Xs],Expression) ->\\n parse(Xs,[fun erlang:'*'/2|Expression]);\\nparse([\\\"/\\\"|Xs],Expression) ->\\n parse(Xs,[fun erlang:'/'/2|Expression]);\\nparse([\\\"^\\\"|Xs],Expression) ->\\n parse(Xs,[fun math:pow/2|Expression]);\\nparse([X|Xs],Expression) ->\\n {N,_} = string:to_integer(X),\\n parse(Xs,[N|Expression]).\\n\\n%% The expression should be entered as a string of numbers and\\n%% operators separated by spaces. No error handling is included if\\n%% another string format is used.\\neval(Expression) ->\\n eval(parse(Expression),[]).\\n\\neval([],[N]) ->\\n N;\\neval([N|Exp],Stack) when is_number(N) ->\\n NewStack = [N|Stack],\\n print(NewStack),\\n eval(Exp,NewStack);\\neval([F|Exp],[X,Y|Stack]) ->\\n NewStack = [F(Y,X)|Stack],\\n print(NewStack),\\n eval(Exp,NewStack).\\n\\nprint(Stack) ->\\n lists:map(fun (X) when is_integer(X) -> io:format(\\\"~12.12b \\\",[X]);\\n (X) when is_float(X) -> io:format(\\\"~12f \\\",[X]) end, Stack),\\n io:format(\\\"~n\\\").\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"let reduce op = function\\n | b::a::r -> (op a b)::r\\n | _ -> failwith \\\"invalid expression\\\"\\n\\nlet interprete s = function\\n | \\\"+\\\" -> \\\"add\\\", reduce ( + ) s\\n | \\\"-\\\" -> \\\"subtr\\\", reduce ( - ) s\\n | \\\"*\\\" -> \\\"mult\\\", reduce ( * ) s\\n | \\\"/\\\" -> \\\"divide\\\", reduce ( / ) s\\n | \\\"^\\\" -> \\\"exp\\\", reduce ( ** ) s\\n | str -> \\\"push\\\", (System.Double.Parse str) :: s\\n\\nlet interp_and_show s inp =\\n let op,s'' = interprete s inp\\n printf \\\"%5s%8s \\\" inp op\\n List.iter (printf \\\" %-6.3F\\\") (List.rev s'')\\n printf \\\"\\\\n\\\";\\n s''\\n\\nlet eval str =\\n printfn \\\"Token Action Stack\\\";\\n let ss = str.ToString().Split() |> Array.toList\\n List.fold interp_and_show [] ss\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"IN: scratchpad 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n\\n--- Data stack:\\n3+1/8192\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"{ 3 4 2 * 1 5 - 2 3 ^ ^ / + }\\n[ dup pprint bl 1quotation call get-datastack . ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \": ^ over swap 1 ?do over * loop nip ;\\ns\\\" 3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" evaluate .\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": ^ over swap 1 ?do over * loop nip ;\\n: detail\\n begin\\n cr .\\\" stack: \\\" .s\\n bl word count dup\\n 0<> while\\n .\\\" , read: \\\" 2dup type evaluate\\n repeat\\n 2drop\\n;\\ndetail 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \" REAL FUNCTION EVALRP(TEXT)\\t!Evaluates a Reverse Polish string.\\nCaution: deals with single digits only.\\n CHARACTER*(*) TEXT\\t!The RPN string.\\n INTEGER SP,STACKLIMIT\\t\\t!Needed for the evaluation.\\n PARAMETER (STACKLIMIT = 6)\\t!This should do.\\n REAL*8 STACK(STACKLIMIT)\\t\\t!Though with ^ there's no upper limit.\\n INTEGER L,D\\t\\t!Assistants for the scan.\\n CHARACTER*4 DEED\\t\\t!A scratchpad for the annotation.\\n CHARACTER*1 C\\t\\t!The character of the moment.\\n WRITE (6,1) TEXT\\t!A function that writes messages... Improper.\\n 1 FORMAT (\\\"Evaluation of the Reverse Polish string \\\",A,//\\t!Still, it's good to see stuff.\\n 1 \\\"Char Token Action SP:Stack...\\\")\\t!Such as a heading for the trace.\\n SP = 0\\t\\t\\t!Commence with the stack empty.\\n STACK = -666\\t\\t!This value should cause trouble.\\n DO L = 1,LEN(TEXT)\\t!Step through the text.\\n C = TEXT(L:L)\\t\\t\\t!Grab a character.\\n IF (C.LE.\\\" \\\") CYCLE\\t\\t!Boring.\\n D = ICHAR(C) - ICHAR(\\\"0\\\")\\t!Uncouth test to check for a digit.\\n IF (D.GE.0 .AND. D.LE.9) THEN\\t!Is it one?\\n DEED = \\\"Load\\\"\\t\\t\\t!Yes. So, load its value.\\n SP = SP + 1\\t\\t\\t\\t!By going up one.\\n IF (SP.GT.STACKLIMIT) STOP \\\"Stack overflow!\\\"\\t!Or, maybe not.\\n STACK(SP) = D\\t\\t\\t!And stashing the value.\\n ELSE\\t\\t\\t\\t!Otherwise, it must be an operator.\\n IF (SP.LT.2) STOP \\\"Stack underflow!\\\"\\t!They all require two operands.\\n DEED = \\\"XEQ\\\"\\t\\t!So, I'm about to do so.\\n SELECT CASE(C)\\t\\t!Which one this time?\\n CASE(\\\"+\\\"); STACK(SP - 1) = STACK(SP - 1) + STACK(SP)\\t!A + B = B + A, so it is easy.\\n CASE(\\\"-\\\"); STACK(SP - 1) = STACK(SP - 1) - STACK(SP)\\t!A is in STACK(SP - 1), B in STACK(SP)\\n CASE(\\\"*\\\"); STACK(SP - 1) = STACK(SP - 1)*STACK(SP)\\t\\t!Again, order doesn't count.\\n CASE(\\\"/\\\"); STACK(SP - 1) = STACK(SP - 1)/STACK(SP)\\t\\t!But for division, A/B becomes A B /\\n CASE(\\\"^\\\"); STACK(SP - 1) = STACK(SP - 1)**STACK(SP)\\t!So, this way around.\\n CASE DEFAULT\\t\\t!This should never happen!\\n STOP \\\"Unknown operator!\\\"\\t!If the RPN script is indeed correct.\\n END SELECT\\t\\t\\t!So much for that operator.\\n SP = SP - 1\\t\\t!All of them take two operands and make one.\\n END IF\\t\\t!So much for that item.\\n WRITE (6,2) L,C,DEED,SP,STACK(1:SP)\\t!Reveal the state now.\\n 2 FORMAT (I4,A6,A7,I4,\\\":\\\",66F14.6)\\t!Aligned with the heading of FORMAT 1.\\n END DO\\t\\t\\t!On to the next symbol.\\n EVALRP = STACK(1)\\t!The RPN string being correct, this is the result.\\n END\\t!Simple enough!\\n\\n PROGRAM HSILOP\\n REAL V\\n V = EVALRP(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\t!The specified example.\\n WRITE (6,*) \\\"Result is...\\\",V\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#define NULL 0\\n\\ntype node\\n 'implement the stack as a linked list\\n n as double\\n p as node ptr\\nend type\\n\\nfunction spctok( byref s as string ) as string\\n 'returns everything in the string up to the first space\\n 'modifies the original string to begin at the fist non-space char after the first space\\n dim as string r\\n dim as double i = 1\\n while mid(s,i,1)<>\\\" \\\" and i<=len(s)\\n r += mid(s,i,1)\\n i+=1\\n wend\\n do\\n i+=1\\n loop until mid(s,i,1)<>\\\" \\\" or i >= len(s)\\n s = right(s,len(s)-i+1)\\n return r\\nend function\\n\\nsub print_stack( byval S as node ptr )\\n 'display everything on the stack\\n print \\\"Stack <--- \\\";\\n while S->p <> NULL\\n S = S->p\\n print S->n;\\\" \\\";\\n wend\\n print\\nend sub\\n\\nsub push( byval S as node ptr, v as double )\\n 'push a value onto the stack\\n dim as node ptr x\\n x = allocate(sizeof(node))\\n x->n = v\\n x->p = S->p\\n S->p = x\\nend sub\\n\\nfunction pop( byval S as node ptr ) as double\\n 'pop a value from the stack\\n if s->P = NULL then return -99999\\n dim as double r = S->p->n\\n dim as node ptr junk = S->p\\n S->p = S->p->p\\n deallocate(junk)\\n return r\\nend function\\n\\ndim as string s = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", c\\ndim as node StackHead\\n\\nwhile len(s) > 0\\n c = spctok(s)\\n print \\\"Token: \\\";c;\\\" \\\";\\n select case c\\n case \\\"+\\\"\\n push(@StackHead, pop(@StackHead) + pop(@StackHead))\\n print \\\"Operation + \\\";\\n case \\\"-\\\"\\n push(@StackHead, -(pop(@StackHead) - pop(@StackHead)))\\n print \\\"Operation - \\\";\\n case \\\"/\\\"\\n push(@StackHead, 1./(pop(@StackHead) / pop(@StackHead)))\\n print \\\"Operation / \\\";\\n case \\\"*\\\"\\n push(@StackHead, pop(@StackHead) * pop(@StackHead))\\n print \\\"Operation * \\\";\\n case \\\"^\\\"\\n push(@StackHead, pop(@StackHead) ^ pop(@StackHead))\\n print \\\"Operation ^ \\\";\\n case else\\n push(@StackHead, val(c))\\n print \\\"Operation push \\\";\\n end select\\n print_stack(@StackHead)\\nwend\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"def evaluate( expr ) =\\n stack = []\\n\\n for token <- expr.split( '''\\\\s+''' )\\n case number( token )\\n Some( n ) ->\\n stack = n : stack\\n println( \\\"push $token: ${stack.reversed()}\\\" )\\n None ->\\n case {'+': (+), '-': (-), '*': (*), '/': (/), '^': (^)}.>get( token )\\n Some( op ) ->\\n stack = op( stack.tail().head(), stack.head() ) : stack.tail().tail()\\n println( \\\"perform $token: ${stack.reversed()}\\\" )\\n None -> error( \\\"unrecognized operator '$token'\\\" )\\n\\n stack.head()\\n\\nres = evaluate( '3 4 2 * 1 5 - 2 3 ^ ^ / +' )\\nprintln( res + (if res is Integer then '' else \\\" or ${float(res)}\\\") )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math\\\"\\n \\\"strconv\\\"\\n \\\"strings\\\"\\n)\\n\\nvar input = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n\\nfunc main() {\\n fmt.Printf(\\\"For postfix %q\\\\n\\\", input)\\n fmt.Println(\\\"\\\\nToken Action Stack\\\")\\n var stack []float64\\n for _, tok := range strings.Fields(input) {\\n action := \\\"Apply op to top of stack\\\"\\n switch tok {\\n case \\\"+\\\":\\n stack[len(stack)-2] += stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n case \\\"-\\\":\\n stack[len(stack)-2] -= stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n case \\\"*\\\":\\n stack[len(stack)-2] *= stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n case \\\"/\\\":\\n stack[len(stack)-2] /= stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n case \\\"^\\\":\\n stack[len(stack)-2] =\\n math.Pow(stack[len(stack)-2], stack[len(stack)-1])\\n stack = stack[:len(stack)-1]\\n default:\\n action = \\\"Push num onto top of stack\\\"\\n f, _ := strconv.ParseFloat(tok, 64)\\n stack = append(stack, f)\\n }\\n fmt.Printf(\\\"%3s %-26s %v\\\\n\\\", tok, action, stack)\\n }\\n fmt.Println(\\\"\\\\nThe final value is\\\", stack[0])\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def evaluateRPN(expression) {\\n def stack = [] as Stack\\n def binaryOp = { action -> return { action.call(stack.pop(), stack.pop()) } }\\n def actions = [\\n '+': binaryOp { a, b -> b + a },\\n '-': binaryOp { a, b -> b - a },\\n '*': binaryOp { a, b -> b * a },\\n '/': binaryOp { a, b -> b / a },\\n '^': binaryOp { a, b -> b ** a }\\n ]\\n expression.split(' ').each { item ->\\n def action = actions[item] ?: { item as BigDecimal }\\n stack.push(action.call())\\n\\n println \\\"$item: $stack\\\"\\n }\\n assert stack.size() == 1 : \\\"Unbalanced Expression: $expression ($stack)\\\"\\n stack.pop()\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"println evaluateRPN('3 4 2 * 1 5 - 2 3 ^ ^ / +')\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 REM Parsing/RPN calculator algorithm\\n20 MAX.INDEX% = 63\\n30 REM Stack\\n40 REM TOP.INDEX% - top index of the stack\\n50 DIM ELEMS(MAX.INDEX%)\\n60 EXPR$ = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\": GOSUB 200\\n70 END\\n190 REM ** Evaluate the expression in RPN\\n200 GOSUB 1000\\n210 PRINT \\\"Input\\\", \\\"Operation\\\", \\\"Stack after\\\"\\n220 REM SP% - start position of token, DP% - position of delimiter\\n230 DP% = 0\\n240 REM Loop: do ... until DP% = 0\\n250 SP% = DP% + 1\\n260 DP% = INSTR(DP% + 1, EXPR$, \\\" \\\")\\n270 IF DP% = 0 THEN TOKEN$ = MID$(EXPR$, SP%, LEN(EXPR$) - SP% + 1) ELSE TE% = DP% - 1: TOKEN$ = MID$(EXPR$, SP%, DP% - SP%)\\n280 PRINT TOKEN$,\\n290 IF TOKEN$ <> \\\"*\\\" THEN 350\\n300 PRINT \\\"Operate\\\",\\n310 GOSUB 1060: SECOND = POP\\n320 GOSUB 1060: FIRST = POP\\n330 X = FIRST * SECOND: GOSUB 1160\\n340 GOTO 610\\n350 IF TOKEN$ <> \\\"/\\\" THEN 410\\n360 PRINT \\\"Operate\\\",\\n370 GOSUB 1060: SECOND = POP\\n380 GOSUB 1060: FIRST = POP\\n390 X = FIRST / SECOND: GOSUB 1160\\n400 GOTO 610\\n410 IF TOKEN$ <> \\\"-\\\" THEN 470\\n420 PRINT \\\"Operate\\\",\\n430 GOSUB 1060: SECOND = POP\\n440 GOSUB 1060: FIRST = POP\\n450 X = FIRST - SECOND: GOSUB 1160\\n460 GOTO 610\\n470 IF TOKEN$ <> \\\"+\\\" THEN 530\\n480 PRINT \\\"Operate\\\",\\n490 GOSUB 1060: SECOND = POP\\n500 GOSUB 1060: FIRST = POP\\n510 X = FIRST + SECOND: GOSUB 1160\\n520 GOTO 610\\n530 IF TOKEN$ <> \\\"^\\\" THEN 590\\n540 PRINT \\\"Operate\\\",\\n550 GOSUB 1060: SECOND = POP\\n560 GOSUB 1060: FIRST = POP\\n570 X = FIRST ^ SECOND: GOSUB 1160\\n580 GOTO 610\\n590 PRINT \\\"Push\\\",\\n600 X = VAL(TOKEN$): GOSUB 1160\\n610 GOSUB 1100\\n620 IF DP% <> 0 THEN 250\\n630 GOSUB 1060:\\n640 PRINT \\\"Final answer: \\\"; POP\\n650 GOSUB 1030\\n660 IF NOT EMPTY% THEN PRINT \\\"Error, too many operands: \\\"; : GOSUB 1100: STOP\\n670 RETURN\\n980 REM ** Operations on the stack\\n990 REM ** Make the stack empty\\n1000 TOP.INDEX% = MAX.INDEX% + 1\\n1010 RETURN\\n1020 REM ** Is the stack empty?\\n1030 EMPTY% = TOP.INDEX% > MAX.INDEX%\\n1040 RETURN\\n1050 REM ** Pop from the stack\\n1060 GOSUB 1030\\n1070 IF NOT EMPTY% THEN POP = ELEMS(TOP.INDEX%): TOP.INDEX% = TOP.INDEX% + 1 ELSE PRINT \\\"The stack is empty.\\\": STOP\\n1080 RETURN\\n1090 REM ** Print the stack\\n1100 FOR PTR% = TOP.INDEX% TO MAX.INDEX%\\n1110 PRINT USING \\\"######.###\\\"; ELEMS(PTR%);\\n1120 NEXT PTR%\\n1130 PRINT\\n1140 RETURN\\n1150 REM ** Push to the stack\\n1160 IF TOP.INDEX% > 0 THEN TOP.INDEX% = TOP.INDEX% - 1: ELEMS(TOP.INDEX%) = X ELSE PRINT \\\"The stack is full.\\\": STOP\\n1170 RETURN\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"calcRPN :: String -> [Double]\\ncalcRPN = foldl interprete [] . words\\n\\ninterprete s x\\n | x `elem` [\\\"+\\\",\\\"-\\\",\\\"*\\\",\\\"/\\\",\\\"^\\\"] = operate x s\\n | otherwise = read x:s\\n where\\n operate op (x:y:s) = case op of\\n \\\"+\\\" -> x + y:s\\n \\\"-\\\" -> y - x:s\\n \\\"*\\\" -> x * y:s\\n \\\"/\\\" -> y / x:s\\n \\\"^\\\" -> y ** x:s\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"calcRPNLog :: String -> ([Double],[(String, [Double])])\\ncalcRPNLog input = mkLog $ zip commands $ tail result\\n where result = scanl interprete [] commands\\n commands = words input\\n mkLog [] = ([], [])\\n mkLog res = (snd $ last res, res)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Control.Monad (foldM)\\n\\ncalcRPNIO :: String -> IO [Double]\\ncalcRPNIO = foldM (verbose interprete) [] . words\\n\\nverbose f s x = write (x ++ \\\"\\\\t\\\" ++ show res ++ \\\"\\\\n\\\") >> return res\\n where res = f s x\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"class Monad m => Logger m where\\n write :: String -> m ()\\n\\ninstance Logger IO where write = putStr\\ninstance a ~ String => Logger (Writer a) where write = tell\\n\\nverbose2 f x y = write (show x ++ \\\" \\\" ++\\n show y ++ \\\" ==> \\\" ++\\n show res ++ \\\"\\\\n\\\") >> return res\\n where res = f x y\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"calcRPNM :: Logger m => String -> m [Double]\\ncalcRPNM = foldM (verbose interprete) [] . words\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n EvalRPN(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\nend\\n\\nlink printf\\ninvocable all\\n\\nprocedure EvalRPN(expr) #: evaluate (and trace stack) an RPN string\\n\\n stack := []\\n expr ? until pos(0) do {\\n tab(many(' ')) # consume previous seperator\\n token := tab(upto(' ')|0) # get token\\n if token := numeric(token) then { # ... numeric\\n push(stack,token)\\n printf(\\\"pushed numeric %i : %s\\\\n\\\",token,list2string(stack))\\n }\\n else { # ... operator\\n every b|a := pop(stack) # pop & reverse operands\\n case token of {\\n \\\"+\\\"|\\\"-\\\"|\\\"*\\\"|\\\"^\\\" : push(stack,token(a,b))\\n \\\"/\\\" : push(stack,token(real(a),b))\\n default : runerr(205,token)\\n }\\n printf(\\\"applied operator %s : %s\\\\n\\\",token,list2string(stack))\\n }\\n }\\nend\\n\\nprocedure list2string(L) #: format list as a string\\n every (s := \\\"[ \\\") ||:= !L || \\\" \\\"\\n return s || \\\"]\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \" a: , <;._1 ' ' , '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n┌┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┐\\n││3│4│2│*│1│5│-│2│3│^│^│/│+│\\n└┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" isOp=: '_+-*/^' e.~ {.@>@{.\\n mo=: 1 :'(}: , u@{:) @ ['\\n dy=: 1 :'(_2&}. , u/@(_2&{.)) @ ['\\n dispatch=: (-mo)`(+dy)`(-dy)`(*dy)`(%dy)`(^dy)@.('_+-*/^' i. {.@>@])\\n doShift=: (<@, \\\".@>@{.) , }.@]\\n doApply=: }.@] ,~ [ <@dispatch {.@]\\n consume=: [: ([ smoutput@>@{.) >@{. doShift`doApply@.(isOp@]) }.\\n consume ^: (<:@#) a: , <;._1 ' ' , '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n3\\n3 4\\n3 4 2\\n3 8\\n3 8 1\\n3 8 1 5\\n3 8 _4\\n3 8 _4 2\\n3 8 _4 2 3\\n3 8 _4 8\\n3 8 65536\\n3 0.00012207\\n3.00012\\n┌───────┐\\n│3.00012│\\n└───────┘\\n consume ^: (<:@#) a: , <;._1 ' ' , '3 _ 4 +'\\n3\\n_3\\n_3 4\\n1\\n┌─┐\\n│1│\\n└─┘\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"rpn=: 3 :0\\n queue=. |.3 :'|.3 :y 0'::]each;: y\\n op=. 1 :'2 (u~/@:{.,}.)S:0 ,@]'\\n ops=. +op`(-op)`(*op)`(%op)`(^op)`(,&;)\\n choose=. ((;:'+-*/^')&i.@[)\\n ,ops@.choose/queue\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rpn '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n3.00012\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"rpnD=: 3 :0\\n queue=. |.3 :'|.3 :y 0'::]each;: y\\n op=. 1 :'2 (u~/@:{.,}.)S:0 ,@([smoutput)@]'\\n ops=. +op`(-op)`(*op)`(%op)`(^op)`(,&;)\\n choose=. ((;:'+-*/^')&i.@[)\\n ,ops@.choose/queue\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" rpnD '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n┌─────┐\\n│2 4 3│\\n└─────┘\\n5 1 8 3\\n3 2 _4 8 3\\n8 _4 8 3\\n65536 8 3\\n0.00012207 3\\n3.00012\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.LinkedList;\\n\\npublic class RPN{\\n\\tpublic static void main(String[] args) {\\n\\t\\tevalRPN(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\");\\n\\t}\\n\\n\\tprivate static void evalRPN(String expr){\\n\\t\\tLinkedList<Double> stack = new LinkedList<Double>();\\n\\t\\tSystem.out.println(\\\"Input\\\\tOperation\\\\tStack after\\\");\\n\\t\\tfor (String token : expr.split(\\\"\\\\\\\\s\\\")){\\n\\t\\t\\tSystem.out.print(token + \\\"\\\\t\\\");\\n\\t\\t\\tif (token.equals(\\\"*\\\")) {\\n\\t\\t\\t\\tSystem.out.print(\\\"Operate\\\\t\\\\t\\\");\\n\\t\\t\\t\\tdouble secondOperand = stack.pop();\\n\\t\\t\\t\\tdouble firstOperand = stack.pop();\\n\\t\\t\\t\\tstack.push(firstOperand * secondOperand);\\n\\t\\t\\t} else if (token.equals(\\\"/\\\")) {\\n\\t\\t\\t\\tSystem.out.print(\\\"Operate\\\\t\\\\t\\\");\\n\\t\\t\\t\\tdouble secondOperand = stack.pop();\\n\\t\\t\\t\\tdouble firstOperand = stack.pop();\\n\\t\\t\\t\\tstack.push(firstOperand / secondOperand);\\n\\t\\t\\t} else if (token.equals(\\\"-\\\")) {\\n\\t\\t\\t\\tSystem.out.print(\\\"Operate\\\\t\\\\t\\\");\\n\\t\\t\\t\\tdouble secondOperand = stack.pop();\\n\\t\\t\\t\\tdouble firstOperand = stack.pop();\\n\\t\\t\\t\\tstack.push(firstOperand - secondOperand);\\n\\t\\t\\t} else if (token.equals(\\\"+\\\")) {\\n\\t\\t\\t\\tSystem.out.print(\\\"Operate\\\\t\\\\t\\\");\\n\\t\\t\\t\\tdouble secondOperand = stack.pop();\\n\\t\\t\\t\\tdouble firstOperand = stack.pop();\\n\\t\\t\\t\\tstack.push(firstOperand + secondOperand);\\n\\t\\t\\t} else if (token.equals(\\\"^\\\")) {\\n\\t\\t\\t\\tSystem.out.print(\\\"Operate\\\\t\\\\t\\\");\\n\\t\\t\\t\\tdouble secondOperand = stack.pop();\\n\\t\\t\\t\\tdouble firstOperand = stack.pop();\\n\\t\\t\\t\\tstack.push(Math.pow(firstOperand, secondOperand));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tSystem.out.print(\\\"Push\\\\t\\\\t\\\");\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tstack.push(Double.parseDouble(token+\\\"\\\"));\\n\\t\\t\\t\\t} catch (NumberFormatException e) {\\n \\t\\t\\t\\t\\tSystem.out.println(\\\"\\\\nError: invalid token \\\" + token);\\n \\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(stack);\\n\\t\\t}\\n\\t\\tif (stack.size() > 1) {\\n\\t\\t\\tSystem.out.println(\\\"Error, too many operands: \\\" + stack);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Final answer: \\\" + stack.pop());\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const e = '3 4 2 * 1 5 - 2 3 ^ ^ / +';\\nconst s = [], tokens = e.split(' ');\\nfor (const t of tokens) {\\n const n = Number(t);\\n if (!isNaN(n)) {\\n s.push(n);\\n } else {\\n if (s.length < 2) {\\n throw new Error(`${t}: ${s}: insufficient operands.`);\\n }\\n const o2 = s.pop(), o1 = s.pop();\\n switch (t) {\\n case '+': s.push(o1 + o2); break;\\n case '-': s.push(o1 - o2); break;\\n case '*': s.push(o1 * o2); break;\\n case '/': s.push(o1 / o2); break;\\n case '^': s.push(Math.pow(o1, o2)); break;\\n default: throw new Error(`Unrecognized operator: [${t}]`);\\n }\\n }\\n console.log(`${t}: ${s}`);\\n}\\n\\nif (s.length > 1) {\\n throw new Error(`${s}: insufficient operators.`);\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Input: an array representing a stack, with .[-1] being its top.\\n# Output: the updated array after applying `op`\\ndef rpn(op):\\n def two: .[-2:];\\n def update($x): (.[:-2] + [$x]);\\n if length<=1 then .\\n elif op == \\\"+\\\" then update(two | add)\\n elif op == \\\"*\\\" then update(two | (.[0] * .[1]))\\n elif op == \\\"/\\\" then update(two | (.[0] / .[1]))\\n elif op == \\\"-\\\" then update(two | (.[0] - .[1]))\\n elif op == \\\"^\\\" then update(two | (pow(.[0]; .[1])))\\n else (\\\"ignoring unrecognized op \\\\(op)\\\" | debug) as $debug | .\\n end;\\n\\ndef eval:\\n foreach .[] as $item ([];\\n if ($item | type) == \\\"number\\\" then . + [$item]\\n else rpn($item)\\n end;\\n \\\"\\\\($item) => \\\\(.)\\\" ) ;\\n\\n\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n| split(\\\" \\\") | map( (try tonumber) // .)\\n| eval\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function rpn(s)\\n stack = Any[]\\n for op in map(eval, map(parse, split(s)))\\n if isa(op, Function)\\n arg2 = pop!(stack)\\n arg1 = pop!(stack)\\n push!(stack, op(arg1, arg2))\\n else\\n push!(stack, op)\\n end\\n println(\\\"$op: \\\", join(stack, \\\", \\\"))\\n end\\n length(stack) != 1 && error(\\\"invalid RPN expression $s\\\")\\n return stack[1]\\nend\\nrpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nfun rpnCalculate(expr: String) {\\n if (expr.isEmpty()) throw IllegalArgumentException(\\\"Expresssion cannot be empty\\\")\\n println(\\\"For expression = $expr\\\\n\\\")\\n println(\\\"Token Action Stack\\\")\\n val tokens = expr.split(' ').filter { it != \\\"\\\" }\\n val stack = mutableListOf<Double>()\\n for (token in tokens) {\\n val d = token.toDoubleOrNull()\\n if (d != null) {\\n stack.add(d)\\n println(\\\" $d Push num onto top of stack $stack\\\")\\n }\\n else if ((token.length > 1) || (token !in \\\"+-*/^\\\")) {\\n throw IllegalArgumentException(\\\"$token is not a valid token\\\")\\n }\\n else if (stack.size < 2) {\\n throw IllegalArgumentException(\\\"Stack contains too few operands\\\")\\n }\\n else {\\n val d1 = stack.removeAt(stack.lastIndex)\\n val d2 = stack.removeAt(stack.lastIndex)\\n stack.add(when (token) {\\n \\\"+\\\" -> d2 + d1\\n \\\"-\\\" -> d2 - d1\\n \\\"*\\\" -> d2 * d1\\n \\\"/\\\" -> d2 / d1\\n else -> Math.pow(d2, d1)\\n })\\n println(\\\" $token Apply op to top of stack $stack\\\")\\n }\\n }\\n println(\\\"\\\\nThe final value is ${stack[0]}\\\")\\n}\\n\\nfun main(args: Array<String>) {\\n val expr = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n rpnCalculate(expr)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"{calc 3 4 2 * 1 5 - 2 3 pow pow / +}\\n->\\n 3:\\n 4: 3\\n 2: 4 3\\n *: 2 4 3\\n 1: 8 3\\n 5: 1 8 3\\n -: 5 1 8 3\\n 2: -4 8 3\\n 3: 2 -4 8 3\\n pow: 3 2 -4 8 3\\n pow: 8 -4 8 3\\n /: 65536 8 3\\n +: 0.0001220703125 3\\n -> 3.0001220703125\\n\\nwhere\\n\\n{def calc\\n {def calc.r\\n {lambda {:x :s}\\n {if {empty? :x}\\n then -> {car :s}\\n else {car :x}: {disp :s}{br}\\n {calc.r {cdr :x}\\n {if {unop? {car :x}}\\n then {cons {{car :x} {car :s}} {cdr :s}}\\n else {if {binop? {car :x}}\\n then {cons {{car :x} {car {cdr :s}} {car :s}} {cdr {cdr :s}}}\\n else {cons {car :x} :s}} }}}}}\\n {lambda {:s}\\n {calc.r {list :s} nil}}}\\n\\nusing the unop? & binop? functions to test unary and binary operators\\n\\n{def unop?\\n {lambda {:op}\\n {or {W.equal? :op sqrt} // n sqrt sqrt(n)\\n {W.equal? :op exp} // n exp exp(n)\\n {W.equal? :op log} // n log log(n)\\n {W.equal? :op cos} // n cos cos(n)\\n ... and so // ...\\n}}}\\n\\n{def binop?\\n {lambda {:op}\\n {or {W.equal? :op +} // m n + m+n\\n {W.equal? :op -} // m n - m-n\\n {W.equal? :op *} // m n * m*n\\n {W.equal? :op /} // m n / m/n\\n {W.equal? :op %} // m n % m%n\\n {W.equal? :op pow} // m n pow m^n\\n ... and so on // ...\\n}}}\\n\\nand the list, empty? and disp functions to create\\na list from a string, test its emptynes and display it.\\n\\n{def list\\n {lambda {:s}\\n {if {W.empty? {S.rest :s}}\\n then {cons {S.first :s} nil}\\n else {cons {S.first :s} {list {S.rest :s}}}}}}\\n\\n{def empty?\\n {lambda {:x}\\n {W.equal? :x nil}}}\\n\\n{def disp\\n {lambda {:l}\\n {if {empty? :l}\\n then\\n else {car :l} {disp {cdr :l}}}}}\\n\\nNote that everything is exclusively built on 5 lambdatalk primitives:\\n- \\\"cons, car, cdr\\\", to create lists,\\n- \\\"W.equal?\\\" which test the equality between two words,\\n- and the \\\"or\\\" boolean function.\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"global stack$\\n\\nexpr$ = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\nprint \\\"Expression:\\\"\\nprint expr$\\nprint\\n\\nprint \\\"Input\\\",\\\"Operation\\\",\\\"Stack after\\\"\\n\\nstack$=\\\"\\\"\\ntoken$ = \\\"#\\\"\\ni = 1\\ntoken$ = word$(expr$, i)\\ntoken2$ = \\\" \\\"+token$+\\\" \\\"\\n\\ndo\\n print \\\"Token \\\";i;\\\": \\\";token$,\\n select case\\n 'operation\\n case instr(\\\"+-*/^\\\",token$)<>0\\n print \\\"operate\\\",\\n op2$=pop$()\\n op1$=pop$()\\n if op1$=\\\"\\\" then\\n print \\\"Error: stack empty for \\\";i;\\\"-th token: \\\";token$\\n end\\n end if\\n\\n op1=val(op1$)\\n op2=val(op2$)\\n\\n select case token$\\n case \\\"+\\\"\\n res = op1+op2\\n case \\\"-\\\"\\n res = op1-op2\\n case \\\"*\\\"\\n res = op1*op2\\n case \\\"/\\\"\\n res = op1/op2\\n case \\\"^\\\"\\n res = op1^op2\\n end select\\n\\n call push str$(res)\\n 'default:number\\n case else\\n print \\\"push\\\",\\n call push token$\\n end select\\n print \\\"Stack: \\\";reverse$(stack$)\\n i = i+1\\n token$ = word$(expr$, i)\\n token2$ = \\\" \\\"+token$+\\\" \\\"\\nloop until token$ =\\\"\\\"\\n\\nres$=pop$()\\nprint\\nprint \\\"Result:\\\" ;res$\\nextra$=pop$()\\nif extra$<>\\\"\\\" then\\n print \\\"Error: extra things on a stack: \\\";extra$\\nend if\\nend\\n\\n'---------------------------------------\\nfunction reverse$(s$)\\n reverse$ = \\\"\\\"\\n token$=\\\"#\\\"\\n while token$<>\\\"\\\"\\n i=i+1\\n token$=word$(s$,i,\\\"|\\\")\\n reverse$ = token$;\\\" \\\";reverse$\\n wend\\nend function\\n'---------------------------------------\\nsub push s$\\n stack$=s$+\\\"|\\\"+stack$ 'stack\\nend sub\\n\\nfunction pop$()\\n 'it does return empty on empty stack\\n pop$=word$(stack$,1,\\\"|\\\")\\n stack$=mid$(stack$,instr(stack$,\\\"|\\\")+1)\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"local stack = {}\\nfunction push( a ) table.insert( stack, 1, a ) end\\nfunction pop()\\n if #stack == 0 then return nil end\\n return table.remove( stack, 1 )\\nend\\nfunction writeStack()\\n for i = #stack, 1, -1 do\\n io.write( stack[i], \\\" \\\" )\\n end\\n print()\\nend\\nfunction operate( a )\\n local s\\n if a == \\\"+\\\" then\\n push( pop() + pop() )\\n io.write( a .. \\\"\\\\tadd\\\\t\\\" ); writeStack()\\n elseif a == \\\"-\\\" then\\n s = pop(); push( pop() - s )\\n io.write( a .. \\\"\\\\tsub\\\\t\\\" ); writeStack()\\n elseif a == \\\"*\\\" then\\n push( pop() * pop() )\\n io.write( a .. \\\"\\\\tmul\\\\t\\\" ); writeStack()\\n elseif a == \\\"/\\\" then\\n s = pop(); push( pop() / s )\\n io.write( a .. \\\"\\\\tdiv\\\\t\\\" ); writeStack()\\n elseif a == \\\"^\\\" then\\n s = pop(); push( pop() ^ s )\\n io.write( a .. \\\"\\\\tpow\\\\t\\\" ); writeStack()\\n elseif a == \\\"%\\\" then\\n s = pop(); push( pop() % s )\\n io.write( a .. \\\"\\\\tmod\\\\t\\\" ); writeStack()\\n else\\n push( tonumber( a ) )\\n io.write( a .. \\\"\\\\tpush\\\\t\\\" ); writeStack()\\n end\\nend\\nfunction calc( s )\\n local t, a = \\\"\\\", \\\"\\\"\\n print( \\\"\\\\nINPUT\\\", \\\"OP\\\", \\\"STACK\\\" )\\n for i = 1, #s do\\n a = s:sub( i, i )\\n if a == \\\" \\\" then operate( t ); t = \\\"\\\"\\n else t = t .. a\\n end\\n end\\n if a ~= \\\"\\\" then operate( a ) end\\n print( string.format( \\\"\\\\nresult: %.13f\\\", pop() ) )\\nend\\n--[[ entry point ]]--\\ncalc( \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" )\\ncalc( \\\"22 11 *\\\" )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Rpn_Calc {\\n\\tRem Form 80,60\\n\\tfunction rpn_calc(a$) {\\n\\t\\tdef m=0\\n\\t\\tdim token$()\\n\\t\\ttoken$()=piece$(a$,\\\" \\\")\\n\\t\\tl=len(token$())\\n\\t\\tdim type(l)=0, reg(l)\\n\\t\\twhere=-1\\n\\t\\tfor i=0 to l-1\\n\\t\\t\\tc=val(token$(i),\\\"\\\",m)\\n\\t\\t\\tif m>-1 then\\n\\t\\t\\t\\twhere++\\n\\t\\t\\t\\treg(where)=c\\n\\t\\t\\telse\\n\\t\\t\\t\\treg(where-1)=eval(str$(reg(where-1))+token$(i)+str$(reg(where)))\\n\\t\\t\\t\\twhere--\\n\\t\\t\\tend if\\n\\t\\t\\tinf=each(reg(),1, where+1)\\n\\t\\t\\twhile inf\\n\\t\\t\\t\\texport$<=token$(i)+\\\" [\\\"+str$(inf^,\\\"\\\")+\\\"] \\\"+ str$(array(inf))+{\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttoken$(i)=\\\" \\\"\\n\\t\\t\\tend while\\n\\t\\tnext i\\n\\t\\t=reg(0)\\n\\t}\\n\\tGlobal export$\\n\\tdocument export$\\n\\texample1=rpn_calc(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n\\texample2=rpn_calc(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\")\\n\\tPrint example1, example2\\n\\tRem Print #-2, Export$\\n\\tClipBoard Export$\\n}\\nRpn_Calc\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"calc[rpn_] :=\\n Module[{tokens = StringSplit[rpn], s = \\\"(\\\" <> ToString@InputForm@# <> \\\")\\\" &, op, steps},\\n op[o_, x_, y_] := ToExpression[s@x <> o <> s@y];\\n steps = FoldList[Switch[#2, _?DigitQ, Append[#, FromDigits[#2]],\\n _, Append[#[[;; -3]], op[#2, #[[-2]], #[[-1]]]]\\n ] &, {}, tokens][[2 ;;]];\\n Grid[Transpose[{# <> \\\":\\\" & /@ tokens,\\n StringRiffle[ToString[#, InputForm] & /@ #] & /@ steps}]]];\\nPrint[calc[\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"rmod(i, j) := mod(j, i)$\\nrpow(x, y) := y^x$\\n\\nrpn(sexpr) := (\\n operands: [],\\n expr: charlist(sexpr),\\n\\n for token in expr do (\\n if token = \\\"+\\\" then (\\n push(pop(operands) + pop(operands), operands)\\n )\\n elseif token = \\\"-\\\" then (\\n push(-1 * (pop(operands) - pop(operands)), operands)\\n )\\n elseif token = \\\"*\\\" then (\\n push(pop(operands) * pop(operands), operands)\\n )\\n elseif token = \\\"/\\\" then (\\n push(1 / (pop(operands) / pop(operands)), operands)\\n )\\n elseif token = \\\"%\\\" then (\\n push(rmod(pop(operands), pop(operands)), operands)\\n )\\n elseif token = \\\"^\\\" then (\\n push(rpow(pop(operands), pop(operands)), operands)\\n )\\n elseif token # \\\" \\\" then (\\n push(parse_string(token), operands)\\n ),\\n\\n if token # \\\" \\\" then (\\n print(token, \\\" : \\\", operands)\\n )\\n ),\\n\\n pop(operands)\\n)$\\n\\nrpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"), numer;\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"(%i5) ev(rpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"),numer)\\n3 : [3]\\n4 : [4, 3]\\n2 : [2, 4, 3]\\n* : [8, 3]\\n1 : [1, 8, 3]\\n5 : [5, 1, 8, 3]\\n- : [- 4, 8, 3]\\n2 : [2, - 4, 8, 3]\\n3 : [3, 2, - 4, 8, 3]\\n^ : [8, - 4, 8, 3]\\n^ : [65536, 8, 3]\\n/ : [1.220703125e-4, 3]\\n+ : [3.0001220703125]\\n(%o5) 3.0001220703125\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"RPN = function(inputText)\\n tokens = inputText.split\\n stack = []\\n while tokens\\n tok = tokens.pull\\n if \\\"+-*/^\\\".indexOf(tok) != null then\\n b = stack.pop\\n a = stack.pop\\n if tok == \\\"+\\\" then stack.push a + b\\n if tok == \\\"-\\\" then stack.push a - b\\n if tok == \\\"*\\\" then stack.push a * b\\n if tok == \\\"/\\\" then stack.push a / b\\n if tok == \\\"^\\\" then stack.push a ^ b\\n else\\n stack.push val(tok)\\n end if\\n print tok + \\\" --> \\\" + stack\\n end while\\n return stack[0]\\nend function\\n\\nprint RPN(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \".ig\\n RPN parser implementation in TROFF\\n\\n..\\n.\\\\\\\" \\\\(*A stack implementation\\n.nr Ac 0\\n.af Ac 1\\n.de APUSH\\n.if (\\\\\\\\n(Ac>=0)&(\\\\\\\\n(Ac<27) \\\\{ \\\\\\n.\\tnr Ac +1\\n.\\taf Ac A\\n.\\tnr A\\\\\\\\n(Ac \\\\\\\\$1\\n.\\taf Ac 1\\n\\\\}\\n..\\n.de APOP\\n.if (\\\\\\\\n(Ac>0)&(\\\\\\\\n(Ac<27) \\\\{ \\\\\\n.\\taf Ac A\\n.\\trr A\\\\\\\\n(Ac \\\\\\\\$1\\n.\\taf Ac 1\\n.\\tnr Ac -1\\n..\\n.\\\\\\\" Facility to print entire stack\\n.de L2\\n.af Ac 1\\n.if \\\\\\\\n(Li<=\\\\\\\\n(Ac \\\\{ \\\\\\n.\\taf Li A\\n\\\\\\\\n(A\\\\\\\\n(Li\\n.\\taf Li 1\\n.\\tnr Li +1\\n.\\tL2\\n\\\\}\\n..\\n.de APRINT\\n.nr Li 1\\n.L2\\n.br\\n..\\n.\\\\\\\" Integer exponentiation algorithm\\n.de L1\\n.if \\\\\\\\n(Li<\\\\\\\\$2 \\\\{ \\\\\\n.\\tnr Rs \\\\\\\\n(Rs*\\\\\\\\$1\\n.\\tnr Li +1\\n.\\tL1 \\\\\\\\$1 \\\\\\\\$2\\n\\\\}\\n..\\n.de EXP\\n.nr Li 0\\n.nr Rs 1\\n.L1 \\\\\\\\$1 \\\\\\\\$2\\n..\\n.\\\\\\\" RPN Parser\\n.de REAP\\n.af Ac A\\n.nr O2 \\\\\\\\n(A\\\\\\\\n(Ac\\n.af Ac 1\\n.nr Ai \\\\\\\\n(Ac-1\\n.af Ai A\\n.nr O1 \\\\\\\\n(A\\\\\\\\n(Ai\\n.APOP\\n.APOP\\n..\\n.de RPNPUSH\\n.ie '\\\\\\\\$1'+' \\\\{ \\\\\\n.\\tREAP\\n.\\tnr Rs \\\\\\\\n(O1+\\\\\\\\n(O2\\n\\\\}\\n.el \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'-' \\\\{ \\\\\\n.\\t\\tREAP\\n.\\t\\tnr Rs \\\\\\\\n(O1-\\\\\\\\n(O2\\n\\\\}\\n.\\tel \\\\{ \\\\\\n.\\t\\tie '\\\\\\\\$1'*' \\\\{ \\\\\\n.\\t\\t\\tREAP\\n.\\t\\t\\tnr Rs \\\\\\\\n(O1*\\\\\\\\n(O2\\n\\\\}\\n.\\t\\tel \\\\{ \\\\\\n.\\t\\t\\tie '\\\\\\\\$1'/' \\\\{ \\\\\\n.\\t\\t\\t\\tREAP\\n.\\t\\t\\t\\tnr Rs \\\\\\\\n(O1/\\\\\\\\n(O2\\n\\\\}\\n.\\t\\t\\tel \\\\{ \\\\\\n.\\t\\t\\t\\tie '\\\\\\\\$1'%' \\\\{ \\\\\\n.\\t\\t\\t\\t\\tREAP\\n.\\t\\t\\t\\t\\tnr Rs \\\\\\\\n(O1%\\\\\\\\n(O2\\n\\\\}\\n.\\t\\t\\t\\tel \\\\{ \\\\\\n.\\t\\t\\t\\t\\tie '\\\\\\\\$1'^' \\\\{ \\\\\\n.\\t\\t\\t\\t\\t\\tREAP\\n.\\t\\t\\t\\t\\t\\tEXP \\\\\\\\n(O1 \\\\\\\\n(O2\\n\\\\}\\n.\\t\\t\\t\\t\\tel .nr Rs \\\\\\\\$1\\n\\\\}\\n\\\\}\\n\\\\}\\n\\\\}\\n\\\\}\\n.APUSH \\\\\\\\n(Rs\\n.APRINT\\n..\\n.de RPNPRINT\\n.if \\\\\\\\n(Ac>1 .tm ERROR (rpn.roff): Malformed input expression. Evaluation stack size: \\\\\\\\n(Ac > 1 .\\n\\\\\\\\n(AA\\n..\\n.de RPNPARSE\\n.RPNPUSH \\\\\\\\$1\\n.ie \\\\\\\\n(.$>1 \\\\{ \\\\\\n.\\tshift\\n.\\tRPNPARSE \\\\\\\\$@\\n\\\\}\\n.el .RPNPRINT\\n..\\n.RPNPARSE 3 4 2 * 1 5 - 2 3 ^ ^ / + \\\\\\\" Our input expression\\n\",\n \"language\": \"N-t-roff\"\n },\n {\n \"code\": \" 3\\n 3 4\\n 3 4 2\\n 3 8\\n 3 8 1\\n 3 8 1 5\\n 3 8 ‐4\\n 3 8 ‐4 2\\n 3 8 ‐4 2 3\\n 3 8 ‐4 8\\n 3 8 16\\n 3 0\\n 3\\n3\\n\",\n \"language\": \"N-t-roff\"\n },\n {\n \"code\": \".ig\\n===========================\\n Array implementation\\n===========================\\n..\\n.de end\\n..\\n.de array\\n.\\tnr \\\\\\\\$1.c 0 1\\n.\\tde \\\\\\\\$1.push end\\n.\\t\\tnr \\\\\\\\$1..\\\\\\\\\\\\\\\\n+[\\\\\\\\$1.c] \\\\\\\\\\\\\\\\$1\\n.\\tend\\n.\\tde \\\\\\\\$1.pop end\\n.\\t\\tif \\\\\\\\\\\\\\\\n[\\\\\\\\$1.c]>0 \\\\{ \\\\\\n.\\t\\t\\trr \\\\\\\\$1..\\\\\\\\\\\\\\\\n[\\\\\\\\$1.c]\\n.\\t\\t\\tnr \\\\\\\\$1.c -1\\\\\\n.\\t\\t\\\\}\\n.\\tend\\n.\\tde \\\\\\\\$1.dump end\\n.\\t\\tnr i 0 1\\n.\\t\\trm ou\\n.\\t\\twhile \\\\\\\\\\\\\\\\n+i<=\\\\\\\\\\\\\\\\n[\\\\\\\\$1.c] \\\\{ \\\\\\n.\\t\\t\\tas ou \\\"\\\\\\\\\\\\\\\\n[\\\\\\\\$1..\\\\\\\\\\\\\\\\ni]\\n.\\t\\t\\\\}\\n.\\t\\ttm \\\\\\\\\\\\\\\\*(ou\\n.\\t\\trr i\\n.\\tend\\n..\\n.ig\\n==========================\\n End array implementation\\n==========================\\n..\\n.array stack\\n.de hyper3\\n.\\tnr rs 1\\n.\\tnr i 0 1\\n.\\twhile \\\\\\\\n+i<=\\\\\\\\$2 .nr rs \\\\\\\\n(rs*\\\\\\\\$1\\n.\\trr i\\n..\\n.de pop2\\n.\\tnr O2 \\\\\\\\n[\\\\\\\\$1..\\\\\\\\n[\\\\\\\\$1.c]]\\n.\\t\\\\\\\\$1.pop\\n.\\tnr O1 \\\\\\\\n[\\\\\\\\$1..\\\\\\\\n[\\\\\\\\$1.c]]\\n.\\t\\\\\\\\$1.pop\\n..\\n.de rpn\\n.\\tie '\\\\\\\\$1'+' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\tnr rs \\\\\\\\n(O1+\\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'-' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\tnr rs \\\\\\\\n(O1-\\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'*' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\tnr rs \\\\\\\\n(O1*\\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'/' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\tnr rs \\\\\\\\n(O1/\\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'%' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\tnr rs \\\\\\\\n(O1%\\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel \\\\{ \\\\\\n.\\tie '\\\\\\\\$1'^' \\\\{ \\\\\\n.\\t\\tpop2 stack\\n.\\t\\thyper3 \\\\\\\\n(O1 \\\\\\\\n(O2\\n.\\t\\\\}\\n.\\tel .nr rs \\\\\\\\$1\\n.\\t\\\\}\\\\}\\\\}\\\\}\\\\}\\n.\\n.\\tstack.push \\\\\\\\n(rs\\n.\\tstack.dump\\n.\\n.\\tif \\\\\\\\n(.$>1 \\\\{ \\\\\\n.\\t\\tshift\\n.\\t\\trpn \\\\\\\\$@\\n.\\t\\\\}\\n..\\n.rpn 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n.stack.dump\\n\",\n \"language\": \"N-t-roff\"\n },\n {\n \"code\": \"3\\n3 4\\n3 4 2\\n3 8\\n3 8 1\\n3 8 1 5\\n3 8 -4\\n3 8 -4 2\\n3 8 -4 2 3\\n3 8 -4 8\\n3 8 16\\n3 0\\n3\\n3\\n\",\n \"language\": \"N-t-roff\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nnumeric digits 20\\n\\nrpnDefaultExpression = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\nEODAD = '.*'\\n\\nparse arg rpnString\\n\\nif rpnString = '.' then rpnString = rpnDefaultExpression\\nif rpnString = '' then do\\n say 'Enter numbers or operators [to stop enter' EODAD']:'\\n loop label rpnloop forever\\n rpnval = ask\\n if rpnval == EODAD then leave rpnloop\\n rpnString = rpnString rpnval\\n end rpnloop\\n end\\n\\nrpnString = rpnString.space(1)\\nsay rpnString':' evaluateRPN(rpnString)\\n\\nreturn\\n\\n-- -----------------------------------------------------------------------------\\nmethod evaluateRPN(rpnString) public static returns Rexx\\n\\n stack = LinkedList()\\n op = 0\\n L = 'L'\\n R = 'R'\\n rpnString = rpnString.strip('b')\\n say 'Input\\\\tOperation\\\\tStack after'\\n loop label rpn while rpnString.length > 0\\n parse rpnString token rest\\n rpnString = rest.strip('b')\\n say token || '\\\\t\\\\-'\\n select label tox case token\\n when '*' then do\\n say 'Operate\\\\t\\\\t\\\\-'\\n op[R] = Rexx stack.pop()\\n op[L] = Rexx stack.pop()\\n stack.push(op[L] * op[R])\\n end\\n when '/' then do\\n say 'Operate\\\\t\\\\t\\\\-'\\n op[R] = Rexx stack.pop()\\n op[L] = Rexx stack.pop()\\n stack.push(op[L] / op[R])\\n end\\n when '+' then do\\n say 'Operate\\\\t\\\\t\\\\-'\\n op[R] = Rexx stack.pop()\\n op[L] = Rexx stack.pop()\\n stack.push(op[L] + op[R])\\n end\\n when '-' then do\\n say 'Operate\\\\t\\\\t\\\\-'\\n op[R] = Rexx stack.pop()\\n op[L] = Rexx stack.pop()\\n stack.push(op[L] - op[R])\\n end\\n when '^' then do\\n say 'Operate\\\\t\\\\t\\\\-'\\n op[R] = Rexx stack.pop()\\n op[L] = Rexx stack.pop()\\n -- If exponent is a whole number use Rexx built-in exponentiation operation, otherwise use Math.pow()\\n op[R] = op[R] + 0\\n if op[R].datatype('w') then stack.push(op[L] ** op[R])\\n else stack.push(Rexx Math.pow(op[L], op[R]))\\n end\\n otherwise do\\n if token.datatype('n') then do\\n say 'Push\\\\t\\\\t\\\\-'\\n stack.push(token)\\n end\\n else do\\n say 'Error\\\\t\\\\t\\\\-'\\n end\\n end\\n end tox\\n calc = Rexx\\n say stack.toString\\n end rpn\\n say\\n calc = stack.toString\\n return calc\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"import math, rdstdin, strutils, tables\\n\\ntype Stack = seq[float]\\n\\nproc opPow(s: var Stack) =\\n let b = s.pop\\n let a = s.pop\\n s.add a.pow b\\n\\nproc opMul(s: var Stack) =\\n let b = s.pop\\n let a = s.pop\\n s.add a * b\\n\\nproc opDiv(s: var Stack) =\\n let b = s.pop\\n let a = s.pop\\n s.add a / b\\n\\nproc opAdd(s: var Stack) =\\n let b = s.pop\\n let a = s.pop\\n s.add a + b\\n\\nproc opSub(s: var Stack) =\\n let b = s.pop\\n let a = s.pop\\n s.add a - b\\n\\nproc opNum(s: var Stack; num: float) =\\n s.add num\\n\\nlet ops = toTable({\\\"^\\\": opPow,\\n \\\"*\\\": opMul,\\n \\\"/\\\": opDiv,\\n \\\"+\\\": opAdd,\\n \\\"-\\\": opSub})\\n\\nproc getInput(inp = \\\"\\\"): seq[string] =\\n var inp = inp\\n if inp.len == 0:\\n inp = readLineFromStdin \\\"Expression: \\\"\\n result = inp.strip.split\\n\\nproc rpnCalc(tokens: seq[string]): seq[seq[string]] =\\n var s: Stack\\n result = @[@[\\\"TOKEN\\\",\\\"ACTION\\\",\\\"STACK\\\"]]\\n for token in tokens:\\n var action = \\\"\\\"\\n if ops.hasKey token:\\n action = \\\"Apply op to top of stack\\\"\\n ops[token](s)\\n else:\\n action = \\\"Push num onto top of stack\\\"\\n s.opNum token.parseFloat\\n result.add(@[token, action, s.join(\\\" \\\")])\\n\\nlet rpn = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\necho \\\"For RPN expression: \\\", rpn\\nlet rp = rpnCalc rpn.getInput\\n\\nvar maxColWidths = newSeq[int](rp[0].len)\\nfor i in 0 .. rp[0].high:\\n for x in rp:\\n maxColWidths[i] = max(maxColWidths[i], x[i].len + 3)\\n\\nfor x in rp:\\n for i, y in x:\\n stdout.write y.alignLeft(maxColWidths[i])\\n echo \\\"\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use IO;\\nuse Struct;\\n\\nbundle Default {\\n class RpnCalc {\\n function : Main(args : String[]) ~ Nil {\\n Caculate(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\");\\n }\\n\\n function : native : Caculate(rpn : String) ~ Nil {\\n rpn->PrintLine();\\n\\n tokens := rpn->Split(\\\" \\\");\\n stack := FloatVector->New();\\n each(i : tokens) {\\n token := tokens[i]->Trim();\\n if(token->Size() > 0) {\\n if(token->Get(0)->IsDigit()) {\\n stack->AddBack(token->ToFloat());\\n }\\n else {\\n right := stack->Get(stack->Size() - 1); stack->RemoveBack();\\n left := stack->Get(stack->Size() - 1); stack->RemoveBack();\\n select(token->Get(0)) {\\n label '+': {\\n stack->AddBack(left + right);\\n }\\n\\n label '-': {\\n stack->AddBack(left - right);\\n }\\n\\n label '*': {\\n stack->AddBack(left * right);\\n }\\n\\n label '/': {\\n stack->AddBack(left / right);\\n }\\n\\n label '^': {\\n stack->AddBack(right->Power(left));\\n }\\n };\\n };\\n PrintStack(stack);\\n };\\n };\\n Console->Print(\\\"result: \\\")->PrintLine(stack->Get(0));\\n }\\n\\n function : PrintStack(stack : FloatVector) ~ Nil {\\n \\\" [\\\"->Print();\\n each(i : stack) {\\n stack->Get(i)->Print();\\n if(i + 1< stack->Size()) {\\n \\\", \\\"->Print();\\n };\\n };\\n ']'->PrintLine();\\n }\\n }\\n}\\n\",\n \"language\": \"Objeck\"\n },\n {\n \"code\": \"(* binop : ('a -> 'a -> 'a) -> 'a list -> 'a list *)\\nlet binop op = function\\n | b::a::r -> (op a b)::r\\n | _ -> failwith \\\"invalid expression\\\"\\n\\n(* interp : float list -> string -> string * float list *)\\nlet interp s = function\\n | \\\"+\\\" -> \\\"add\\\", binop ( +. ) s\\n | \\\"-\\\" -> \\\"subtr\\\", binop ( -. ) s\\n | \\\"*\\\" -> \\\"mult\\\", binop ( *. ) s\\n | \\\"/\\\" -> \\\"divide\\\", binop ( /. ) s\\n | \\\"^\\\" -> \\\"exp\\\", binop ( ** ) s\\n | str -> \\\"push\\\", (float_of_string str) :: s\\n\\n(* interp_and_show : float list -> string -> float list *)\\nlet interp_and_show s inp =\\n let op,s' = interp s inp in\\n Printf.printf \\\"%s\\\\t%s\\\\t\\\" inp op;\\n List.(iter (Printf.printf \\\"%F \\\") (rev s'));\\n print_newline ();\\n s'\\n\\n(* rpn_eval : string -> float list *)\\nlet rpn_eval str =\\n Printf.printf \\\"Token\\\\tAction\\\\tStack\\\\n\\\";\\n let ss = Str.(split (regexp_string \\\" \\\") str) in\\n List.fold_left interp_and_show [] ss\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" eval println\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \": rpn(s) { s words apply(#[ eval .l ]) }\\n\\nrpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"/* ooRexx *************************************************************\\n* 10.11.2012 Walter Pachl translated from PL/I via REXX\\n**********************************************************************/\\nfid='rpl.txt'\\nex=linein(fid)\\nSay 'Input:' ex\\n/* ex=' 3 4 2 * 1 5 - 2 3 ^ ^ / +' */\\nNumeric Digits 15\\nexpr=''\\nst=.circularqueue~new(100)\\nSay 'Stack contents:'\\ndo While ex<>''\\n Parse Var ex ch +1 ex\\n expr=expr||ch;\\n if ch<>' ' then do\\n If pos(ch,'0123456789')>0 Then /* a digit goes onto stack */\\n st~push(ch)\\n Else Do /* an operator */\\n op=st~pull /* get top element */\\n select /* and modify the (now) top el*/\\n when ch='+' Then st~push(st~pull + op)\\n when ch='-' Then st~push(st~pull - op)\\n when ch='*' Then st~push(st~pull * op)\\n when ch='/' Then st~push(st~pull / op)\\n when ch='^' Then st~push(st~pull ** op)\\n end;\\n Say st~string(' ','L') /* show stack in LIFO order */\\n end\\n end\\n end\\nSay 'The reverse polish expression = 'expr\\nSay 'The evaluated expression = 'st~pull\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"estack = [];\\n\\nepush(x) = {\\n estack = vector(#estack + 1, i, if(i <= #estack, estack[i], x));\\n return(#estack);\\n};\\n\\nepop() = {\\n local(val = estack[#estack]);\\n estack = vector(#estack - 1, i, estack[i]);\\n return(val);\\n};\\n\\nregisterRPNToken(t) = {\\n local(o1, o2);\\n\\n if(type(t) == \\\"t_STR\\\",\\n if(t == \\\"+\\\", o2 = epop(); o1 = epop(); epush(o1 + o2),\\n if(t == \\\"-\\\", o2 = epop(); o1 = epop(); epush(o1 - o2),\\n if(t == \\\"*\\\", o2 = epop(); o1 = epop(); epush(o1 * o2),\\n if(t == \\\"/\\\", o2 = epop(); o1 = epop(); epush(o1 / o2),\\n if(t == \\\"%\\\", o2 = epop(); o1 = epop(); epush(o1 % o2),\\n if(t == \\\"^\\\", o2 = epop(); o1 = epop(); epush(o1 ^ o2)\\n )))))),\\n if(type(t) == \\\"t_INT\\\" || type(t) == \\\"t_REAL\\\" || type(t) == \\\"t_FRAC\\\",\\n epush(t))\\n );\\n print(estack);\\n};\\n\\nparseRPN(s) = {\\n estack = [];\\n for(i = 1, #s, registerRPNToken(s[i]));\\n\\n if(#estack > 1, error(\\\"Malformed postfix expression.\\\"));\\n return(estack[1]);\\n};\\n\\nparseRPN([3, 4, 2, \\\"*\\\", 1, 5, \\\"-\\\", 2, 3, \\\"^\\\", \\\"^\\\", \\\"/\\\", \\\"+\\\"]); \\\\\\\\ Our input expression\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"[3]\\n[3, 4]\\n[3, 4, 2]\\n[3, 8]\\n[3, 8, 1]\\n[3, 8, 1, 5]\\n[3, 8, -4]\\n[3, 8, -4, 2]\\n[3, 8, -4, 2, 3]\\n[3, 8, -4, 8]\\n[3, 8, 65536]\\n[3, 1/8192]\\n[24577/8192]\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nmy $number = '[+-]?(?:\\\\.\\\\d+|\\\\d+(?:\\\\.\\\\d*)?)';\\nmy $operator = '[-+*/^]';\\n\\nmy @tests = ('3 4 2 * 1 5 - 2 3 ^ ^ / +');\\n\\nfor (@tests) {\\n while (\\n s/ \\\\s* ((?<left>$number)) # 1st operand\\n \\\\s+ ((?<right>$number)) # 2nd operand\\n \\\\s+ ((?<op>$operator)) # operator\\n (?:\\\\s+|$) # more to parse, or done?\\n /\\n ' '.evaluate().' ' # substitute results of evaluation\\n /ex\\n ) {}\\n say;\\n}\\n\\nsub evaluate {\\n (my $a = \\\"($+{left})$+{op}($+{right})\\\") =~ s/\\\\^/**/;\\n say $a;\\n eval $a;\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">evalRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">ops</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">op</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">switch</span> <span style=\\\"color: #000000;\\\">op</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">];</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">];</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]*</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">];</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"/\\\"</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]/</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">];</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">case</span> <span style=\\\"color: #008000;\\\">\\\"^\\\"</span><span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">power</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]);</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">default</span> <span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">scanf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">)[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">switch</span>\\n <span style=\\\"color: #0000FF;\\\">?{</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">evalRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\nfunction rpn($postFix){\\n $stack = Array();\\n echo \\\"Input\\\\tOperation\\\\tStack\\\\tafter\\\\n\\\" ;\\n\\t$token = explode(\\\" \\\", trim($postFix));\\n\\t$count = count($token);\\n\\t\\n for($i = 0 ; $i<$count;$i++)\\n\\t{\\n echo $token[$i] .\\\" \\\\t\\\";\\n $tokenNum = \\\"\\\";\\n\\t\\t\\n if (is_numeric($token[$i])) {\\n echo \\\"Push\\\";\\n\\t\\t\\tarray_push($stack,$token[$i]);\\n }\\n else\\n {\\n echo \\\"Operate\\\";\\n $secondOperand = end($stack);\\n\\t\\t\\tarray_pop($stack);\\n $firstOperand = end($stack);\\n array_pop($stack);\\n\\n if ($token[$i] == \\\"*\\\")\\n\\t\\t\\t\\tarray_push($stack,$firstOperand * $secondOperand);\\n else if ($token[$i] == \\\"/\\\")\\n array_push($stack,$firstOperand / $secondOperand);\\n else if ($token[$i] == \\\"-\\\")\\n array_push($stack,$firstOperand - $secondOperand);\\n else if ($token[$i] == \\\"+\\\")\\n array_push($stack,$firstOperand + $secondOperand);\\n else if ($token[$i] == \\\"^\\\")\\n array_push($stack,pow($firstOperand,$secondOperand));\\n else {\\n die(\\\"Error\\\");\\n }\\n }\\n\\t\\techo \\\"\\\\t\\\\t\\\" . implode(\\\" \\\", $stack) . \\\"\\\\n\\\";\\n }\\n return end($stack);\\n}\\n\\necho \\\"Compute Value: \\\" . rpn(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / + \\\");\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"(de rpnCalculator (Str)\\n (let (^ ** Stack) # Define '^' from the built-in '**'\\n (prinl \\\"Token Stack\\\")\\n (for Token (str Str \\\"*+-/\\\\^\\\")\\n (if (num? Token)\\n (push 'Stack @)\\n (set (cdr Stack)\\n ((intern Token) (cadr Stack) (pop 'Stack)) ) )\\n (prin Token)\\n (space 6)\\n (println Stack) )\\n (println (car Stack)) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (rpnCalculator \\\"3 4 2 * 1 5 - 2 3 \\\\^ \\\\^ / +\\\")\\nToken Stack\\n3 (3)\\n4 (4 3)\\n2 (2 4 3)\\n* (8 3)\\n1 (1 8 3)\\n5 (5 1 8 3)\\n- (-4 8 3)\\n2 (2 -4 8 3)\\n3 (3 2 -4 8 3)\\n^ (8 -4 8 3)\\n^ (65536 8 3)\\n/ (0 3)\\n+ (3)\\n3\\n-> 3\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"Calculator: procedure options (main); /* 14 Sept. 2012 */\\n declare expression character (100) varying initial ('');\\n declare ch character (1);\\n declare (stack controlled, operand) float (18);\\n declare in file input;\\n\\n open file (in) title ('/CALCULAT.DAT,type(text),recsize(100)');\\n on endfile (in) go to done;\\n\\n put ('Stack contents:');\\nmain_loop:\\n do forever;\\n get file (in) edit (ch) (a(1));\\n expression = expression || ch;\\n if ch = ' ' then iterate;\\n select (ch);\\n when ('0', '1', '2', '3', '4', '5', '6', '7', '8', '9')\\n do; allocate stack; stack = ch; iterate main_loop; end;\\n when ('+') do; operand = stack; free stack; stack = stack + operand; end;\\n when ('-') do; operand = stack; free stack; stack = stack - operand; end;\\n when ('*') do; operand = stack; free stack; stack = stack * operand; end;\\n when ('/') do; operand = stack; free stack; stack = stack / operand; end;\\n when ('^') do; operand = stack; free stack; stack = stack ** operand; end;\\n end;\\n call show_stack;\\n end;\\n\\ndone:\\n put skip list ('The reverse polish expression = ' || expression);\\n put skip list ('The evaluated expression = ' || stack);\\n\\nend Calculator;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"create or replace function rpn_calc(str varchar2) return number as\\n type num_aa is table of number index by pls_integer;\\n type num_stack is record (a num_aa, top pls_integer default 0);\\n ns num_stack;\\n pos1 integer := 1;\\n pos2 integer;\\n token varchar2(100);\\n op2 number;\\n procedure push(s in out nocopy num_stack, x number) is\\n begin\\n s.top := s.top + 1;\\n s.a(s.top) := x;\\n end;\\n function pop(s in out nocopy num_stack) return number is\\n x number;\\n begin\\n x := s.a(s.top);\\n s.top := s.top - 1;\\n return x;\\n end;\\n procedure print_stack(s num_stack) is -- for debugging only; remove from final version\\n ps varchar2(4000);\\n begin\\n for i in 1 .. s.top loop\\n ps := ps || s.a(i) || ' ';\\n end loop;\\n dbms_output.put_line('Stack: ' || rtrim(ps));\\n end;\\nbegin\\n while pos1 <= length(str) loop\\n pos2 := instr(str || ' ', ' ', pos1);\\n token := substr(str, pos1, pos2 - pos1);\\n pos1 := pos2 + 1;\\n case token\\n when '+' then push(ns, pop(ns) + pop(ns));\\n when '-' then op2 := pop(ns); push(ns, pop(ns) - op2);\\n when '*' then push(ns, pop(ns) * pop(ns));\\n when '/' then op2 := pop(ns); push(ns, pop(ns) / op2);\\n when '^' then op2 := pop(ns); push(ns, power(pop(ns), op2));\\n else push(ns, to_number(token));\\n end case;\\n print_stack(ns); -- for debugging purposes only\\n end loop;\\n return pop(ns);\\nend rpn_calc;\\n/\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"begin\\n dbms_output.put_line(chr(10) || 'Result: ' || rpn_calc('3 4 2 * 1 5 - 2 3 ^ ^ / +'));\\nend;\\n/\\n\",\n \"language\": \"PL-SQL\"\n },\n {\n \"code\": \"function Invoke-Rpn\\n{\\n <#\\n .SYNOPSIS\\n A stack-based evaluator for an expression in reverse Polish notation.\\n .DESCRIPTION\\n A stack-based evaluator for an expression in reverse Polish notation.\\n\\n All methods in the Math and Decimal classes are available.\\n .PARAMETER Expression\\n A space separated, string of tokens.\\n .PARAMETER DisplayState\\n This switch shows the changes in the stack as each individual token is processed as a table.\\n .EXAMPLE\\n Invoke-Rpn -Expression \\\"3 4 Max\\\"\\n .EXAMPLE\\n Invoke-Rpn -Expression \\\"3 4 Log2\\\"\\n .EXAMPLE\\n Invoke-Rpn -Expression \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n .EXAMPLE\\n Invoke-Rpn -Expression \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" -DisplayState\\n#>\\n [CmdletBinding()]\\n Param\\n (\\n [Parameter(Mandatory=$true)]\\n [AllowEmptyString()]\\n [string]\\n $Expression,\\n\\n [Parameter(Mandatory=$false)]\\n [switch]\\n $DisplayState\\n )\\n Begin\\n {\\n function Out-State ([System.Collections.Stack]$Stack)\\n {\\n $array = $Stack.ToArray()\\n [Array]::Reverse($array)\\n $array | ForEach-Object -Process { Write-Host (\\\"{0,-8:F3}\\\" -f $_) -NoNewline } -End { Write-Host }\\n }\\n\\n function New-RpnEvaluation\\n {\\n $stack = New-Object -Type System.Collections.Stack\\n\\n $shortcuts = @{\\n \\\"+\\\" = \\\"Add\\\"; \\\"-\\\" = \\\"Subtract\\\"; \\\"/\\\" = \\\"Divide\\\"; \\\"*\\\" = \\\"Multiply\\\"; \\\"%\\\" = \\\"Remainder\\\"; \\\"^\\\" = \\\"Pow\\\"\\n }\\n\\n :ARGUMENT_LOOP foreach ($argument in $args)\\n {\\n if ($DisplayState -and $stack.Count)\\n {\\n Out-State $stack\\n }\\n\\n if ($shortcuts[$argument])\\n {\\n $argument = $shortcuts[$argument]\\n }\\n\\n try\\n {\\n $stack.Push([decimal]$argument)\\n continue\\n }\\n catch\\n {\\n }\\n\\n $argCountList = $argument -replace \\\"(\\\\D+)(\\\\d*)\\\",‘$2’\\n $operation = $argument.Substring(0, $argument.Length – $argCountList.Length)\\n\\n foreach($type in [Decimal],[Math])\\n {\\n if ($definition = $type::$operation)\\n {\\n if (-not $argCountList)\\n {\\n $argCountList = $definition.OverloadDefinitions |\\n Foreach-Object { ($_ -split \\\", \\\").Count } |\\n Sort-Object -Unique\\n }\\n\\n foreach ($argCount in $argCountList)\\n {\\n try\\n {\\n $methodArguments = $stack.ToArray()[($argCount–1)..0]\\n $result = $type::$operation.Invoke($methodArguments)\\n\\n $null = 1..$argCount | Foreach-Object { $stack.Pop() }\\n\\n $stack.Push($result)\\n\\n continue ARGUMENT_LOOP\\n }\\n catch\\n {\\n ## If error, try with the next number of arguments\\n }\\n }\\n }\\n }\\n }\\n\\n if ($DisplayState -and $stack.Count)\\n {\\n Out-State $stack\\n if ($stack.Count)\\n {\\n Write-Host \\\"`nResult = $($stack.Peek())\\\"\\n }\\n }\\n else\\n {\\n $stack\\n }\\n }\\n }\\n Process\\n {\\n Invoke-Expression -Command \\\"New-RpnEvaluation $Expression\\\"\\n }\\n End\\n {\\n }\\n}\\n\\nInvoke-Rpn -Expression \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" -DisplayState\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"rpn(L) :-\\n\\twriteln('Token Action Stack'),\\n\\tparse(L, [],[X] ,[]),\\n\\tformat('~nThe final output value is ~w~n', [X]).\\n\\n% skip spaces\\nparse([X|L], St) -->\\n\\t{char_type(X, white)},\\n\\tparse(L, St).\\n\\n% detect operators\\nparse([Op|L], [Y, X | St]) -->\\n\\t{ is_op(Op, X, Y, V),\\n\\t writef(' %s', [[Op]]),\\n\\t with_output_to(atom(Str2), writef('Apply %s on top of stack', [[Op]])),\\n\\t writef(' %35l', [Str2]),\\n\\t writef('%w\\\\n', [[V | St]])},\\n\\tparse(L, [V | St]).\\n\\n% detect number\\nparse([N|L], St) -->\\n\\t{char_type(N, digit)},\\n\\tparse_number(L, [N], St).\\n\\n% string is finished\\nparse([], St) --> St.\\n\\n% compute numbers\\nparse_number([N|L], NC, St) -->\\n\\t{char_type(N, digit)},\\n\\tparse_number(L, [N|NC], St).\\n\\nparse_number(S, NC, St) -->\\n\\t{ reverse(NC, RNC),\\n\\t number_chars(V, RNC),\\n\\t writef('%5r', [V]),\\n\\t with_output_to(atom(Str2), writef('Push num %w on top of stack', [V])),\\n\\t writef(' %35l', [Str2]),\\n\\t writef('%w\\\\n', [[V | St]])},\\n\\tparse(S, [V|St]).\\n\\n% defining operations\\nis_op(42, X, Y, V) :-\\tV is X*Y.\\nis_op(43, X, Y, V) :-\\tV is X+Y.\\nis_op(45, X, Y, V) :-\\tV is X-Y.\\nis_op(47, X, Y, V) :-\\tV is X/Y.\\nis_op(94, X, Y, V) :-\\tV is X**Y.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"def op_pow(stack):\\n b = stack.pop(); a = stack.pop()\\n stack.append( a ** b )\\ndef op_mul(stack):\\n b = stack.pop(); a = stack.pop()\\n stack.append( a * b )\\ndef op_div(stack):\\n b = stack.pop(); a = stack.pop()\\n stack.append( a / b )\\ndef op_add(stack):\\n b = stack.pop(); a = stack.pop()\\n stack.append( a + b )\\ndef op_sub(stack):\\n b = stack.pop(); a = stack.pop()\\n stack.append( a - b )\\ndef op_num(stack, num):\\n stack.append( num )\\n\\nops = {\\n '^': op_pow,\\n '*': op_mul,\\n '/': op_div,\\n '+': op_add,\\n '-': op_sub,\\n }\\n\\ndef get_input(inp = None):\\n 'Inputs an expression and returns list of tokens'\\n\\n if inp is None:\\n inp = input('expression: ')\\n tokens = inp.strip().split()\\n return tokens\\n\\ndef rpn_calc(tokens):\\n stack = []\\n table = ['TOKEN,ACTION,STACK'.split(',')]\\n for token in tokens:\\n if token in ops:\\n action = 'Apply op to top of stack'\\n ops[token](stack)\\n table.append( (token, action, ' '.join(str(s) for s in stack)) )\\n else:\\n action = 'Push num onto top of stack'\\n op_num(stack, eval(token))\\n table.append( (token, action, ' '.join(str(s) for s in stack)) )\\n return table\\n\\nif __name__ == '__main__':\\n rpn = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n print( 'For RPN expression: %r\\\\n' % rpn )\\n rp = rpn_calc(get_input(rpn))\\n maxcolwidths = [max(len(y) for y in x) for x in zip(*rp)]\\n row = rp[0]\\n print( ' '.join('{cell:^{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\\n for row in rp[1:]:\\n print( ' '.join('{cell:<{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\\n\\n print('\\\\n The final output value is: %r' % rp[-1][2])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"a=[]\\nb={'+': lambda x,y: y+x, '-': lambda x,y: y-x, '*': lambda x,y: y*x,'/': lambda x,y:y/x,'^': lambda x,y:y**x}\\nfor c in '3 4 2 * 1 5 - 2 3 ^ ^ / +'.split():\\n if c in b: a.append(b[c](a.pop(),a.pop()))\\n else: a.append(float(c))\\n print c, a\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"[ stack ] is switch.arg ( --> [ )\\n\\n[ switch.arg put ] is switch ( x --> )\\n\\n[ switch.arg release ] is otherwise ( --> )\\n\\n[ switch.arg share\\n != iff ]else[ done\\n otherwise\\n ]'[ do ]done[ ] is case ( x --> )\\n\\n[ say \\\"Applying: \\\"\\n swap echo$ sp\\n temp take\\n temp take\\n swap rot do\\n temp put ] is apply ( $ x --> )\\n\\n[ say \\\"Pushing: \\\" dup echo$ sp\\n $->n drop temp put ] is isnumber ( $ --> )\\n\\n[ temp copy echo cr ] is display ( --> )\\n\\n[ nest$ witheach\\n [ dup switch\\n [ $ '+' case [ ' + apply ]\\n $ '-' case [ ' - apply ]\\n $ '*' case [ ' * apply ]\\n $ '/' case [ ' / apply ]\\n $ '^' case [ ' ** apply ]\\n otherwise [ isnumber ] ]\\n display ]\\n temp take ] is rpncalc ( $ --> n )\\n\\n$ \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" rpncalc\\nsay \\\"Result: \\\" echo\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"' Parsing/RPN calculator algorithm\\nDECLARE SUB MakeEmpty (S AS ANY)\\nDECLARE SUB Push (X AS SINGLE, S AS ANY)\\nDECLARE SUB PrintStack (S AS ANY)\\nDECLARE SUB EvalRPN (Expr$)\\nDECLARE FUNCTION Empty% (S AS ANY)\\nDECLARE FUNCTION Pop! (S AS ANY)\\n\\nCONST MAXINDEX = 63\\n\\nTYPE TNumStack\\n TopIndex AS INTEGER\\n Elems(MAXINDEX) AS SINGLE\\nEND TYPE\\n\\nEvalRPN (\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\nEND\\n\\nFUNCTION Empty% (S AS TNumStack)\\n Empty% = S.TopIndex > MAXINDEX\\nEND FUNCTION\\n\\nSUB EvalRPN (Expr$)\\n DIM S AS TNumStack\\n MakeEmpty S\\n PRINT \\\"Input\\\", \\\"Operation\\\", \\\"Stack after\\\"\\n ' SP% - start position of token\\n ' DP% - position of delimiter\\n DP% = 0\\n DO\\n SP% = DP% + 1\\n DP% = INSTR(DP% + 1, Expr$, \\\" \\\")\\n IF DP% <> 0 THEN\\n TE% = DP% - 1\\n Token$ = MID$(Expr$, SP%, DP% - SP%)\\n ELSE\\n Token$ = MID$(Expr$, SP%, LEN(Expr$) - SP% + 1)\\n END IF\\n PRINT Token$,\\n IF Token$ = \\\"*\\\" THEN\\n PRINT \\\"Operate\\\",\\n Second = Pop(S): First = Pop(S)\\n Push First * Second, S\\n ELSEIF Token$ = \\\"/\\\" THEN\\n PRINT \\\"Operate\\\",\\n Second = Pop(S): First = Pop(S)\\n Push First / Second, S\\n ELSEIF Token$ = \\\"-\\\" THEN\\n PRINT \\\"Operate\\\",\\n Second = Pop(S): First = Pop(S)\\n Push First - Second, S\\n ELSEIF Token$ = \\\"+\\\" THEN\\n PRINT \\\"Operate\\\",\\n Second = Pop(S): First = Pop(S)\\n Push First + Second, S\\n ELSEIF Token$ = \\\"^\\\" THEN\\n PRINT \\\"Operate\\\",\\n Second = Pop(S): First = Pop(S)\\n Push First ^ Second, S\\n ELSE\\n PRINT \\\"Push\\\",\\n Push VAL(Token$), S\\n END IF\\n PrintStack S\\n LOOP UNTIL DP% = 0\\n PRINT \\\"Final answer: \\\"; Pop(S)\\n IF NOT Empty(S) THEN\\n PRINT \\\"Error, too many operands: \\\";\\n PrintStack S\\n STOP\\n END IF\\nEND SUB\\n\\nSUB MakeEmpty (S AS TNumStack)\\n S.TopIndex = MAXINDEX + 1\\nEND SUB\\n\\nFUNCTION Pop (S AS TNumStack)\\n IF Empty%(S) THEN\\n PRINT \\\"The stack is empty.\\\"\\n STOP\\n ELSE\\n Pop = S.Elems(S.TopIndex)\\n S.TopIndex = S.TopIndex + 1\\n END IF\\nEND FUNCTION\\n\\nSUB PrintStack (S AS TNumStack)\\n FOR Ptr% = S.TopIndex% TO MAXINDEX\\n PRINT USING \\\"######.###\\\"; S.Elems(Ptr%);\\n NEXT Ptr%\\n PRINT\\nEND SUB\\n\\nSUB Push (X AS SINGLE, S AS TNumStack)\\n IF S.TopIndex = 0 THEN\\n PRINT \\\"The stack is full.\\\"\\n STOP\\n ELSE\\n S.TopIndex = S.TopIndex - 1\\n S.Elems(S.TopIndex) = X\\n END IF\\nEND SUB\\n\",\n \"language\": \"QuickBASIC\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (calculate-RPN expr)\\n (for/fold ([stack '()]) ([token expr])\\n (printf \\\"~a\\\\t -> ~a~N\\\" token stack)\\n (match* (token stack)\\n [((? number? n) s) (cons n s)]\\n [('+ (list x y s ___)) (cons (+ x y) s)]\\n [('- (list x y s ___)) (cons (- y x) s)]\\n [('* (list x y s ___)) (cons (* x y) s)]\\n [('/ (list x y s ___)) (cons (/ y x) s)]\\n [('^ (list x y s ___)) (cons (expt y x) s)]\\n [(x s) (error \\\"calculate-RPN: Cannot calculate the expression:\\\"\\n (reverse (cons x s)))])))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(calculate-RPN (in-port read (open-input-string \\\"3.0 4 2 * 1 5 - 2 3 ^ ^ / +\\\")))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my $proggie = '3 4 2 * 1 5 - 2 3 ^ ^ / +';\\n\\nclass RPN is Array {\\n\\n method binop(&op) { self.push: self.pop R[&op] self.pop }\\n\\n method run($p) {\\n for $p.words {\\n say \\\"$_ ({self})\\\";\\n when /\\\\d/ { self.push: $_ }\\n when '+' { self.binop: &[+] }\\n when '-' { self.binop: &[-] }\\n when '*' { self.binop: &[*] }\\n when '/' { self.binop: &[/] }\\n when '^' { self.binop: &[**] }\\n default { die \\\"$_ is bogus\\\" }\\n }\\n say self;\\n }\\n}\\n\\nRPN.new.run($proggie);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* 09.11.2012 Walter Pachl translates from PL/I\\n**********************************************************************/\\nfid='rpl.txt'\\nex=linein(fid)\\nSay 'Input:' ex\\n/* ex=' 3 4 2 * 1 5 - 2 3 ^ ^ / +' */\\nNumeric Digits 15\\nexpr=''\\nst.=0\\nSay 'Stack contents:'\\ndo While ex<>''\\n Parse Var ex ch +1 ex\\n expr=expr||ch;\\n if ch<>' ' then do\\n select\\n When pos(ch,'0123456789')>0 Then Do\\n Call stack ch\\n Iterate\\n End\\n when ch='+' Then do; operand=getstack(); st.sti = st.sti + operand; end;\\n when ch='-' Then do; operand=getstack(); st.sti = st.sti - operand; end;\\n when ch='*' Then do; operand=getstack(); st.sti = st.sti * operand; end;\\n when ch='/' Then do; operand=getstack(); st.sti = st.sti / operand; end;\\n when ch='^' Then do; operand=getstack(); st.sti = st.sti ** operand; end;\\n end;\\n call show_stack\\n end\\n end\\nSay 'The reverse polish expression = 'expr\\nSay 'The evaluated expression = 'st.1\\nExit\\nstack: Procedure Expose st.\\n/* put the argument on top of the stack */\\n z=st.0+1\\n st.z=arg(1)\\n st.0=z\\n Return\\ngetstack: Procedure Expose st. sti\\n/* remove and return the stack's top element */\\n z=st.0\\n stk=st.z\\n st.0=st.0-1\\n sti=st.0\\n Return stk\\nshow_stack: procedure Expose st.\\n/* show the stack's contents */\\n ol=''\\n do i=1 To st.0\\n ol=ol format(st.i,5,10)\\n End\\n Say ol\\n Return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program evaluates a ═════ Reverse Polish notation (RPN) ═════ expression. */\\nparse arg x /*obtain optional arguments from the CL*/\\nif x='' then x= \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" /*Not specified? Then use the default.*/\\ntokens=words(x) /*save the number of tokens \\\" \\\". */\\nshowSteps=1 /*set to 0 if working steps not wanted.*/\\nox=x /*save the original value of X. */\\n do i=1 for tokens; @.i=word(x,i) /*assign the input tokens to an array. */\\n end /*i*/\\nx=space(x) /*remove any superfluous blanks in X. */\\nL=max(20, length(x)) /*use 20 for the minimum display width.*/\\nnumeric digits L /*ensure enough decimal digits for ans.*/\\nsay center('operand', L, \\\"─\\\") center('stack', L+L, \\\"─\\\") /*display title*/\\n$= /*nullify the stack (completely empty).*/\\n do k=1 for tokens; ?=@.k; ??=? /*process each token from the @. list.*/\\n #=words($) /*stack the count (the number entries).*/\\n if datatype(?,'N') then do; $=$ ?; call show \\\"add to───►stack\\\"; iterate; end\\n if ?=='^' then ??= \\\"**\\\" /*REXXify ^ ───► ** (make legal).*/\\n interpret 'y='word($,#-1) ?? word($,#) /*compute via the famous REXX INTERPRET*/\\n if datatype(y,'N') then y=y/1 /*normalize the number with ÷ by unity.*/\\n $=subword($, 1, #-2) y /*rebuild the stack with the answer. */\\n call show ? /*display steps (tracing into), maybe.*/\\n end /*k*/\\nsay /*display a blank line, better perusing*/\\nsay ' RPN input:' ox; say \\\" answer──►\\\"$ /*display original input; display ans.*/\\nparse source upper . y . /*invoked via C.L. or via a REXX pgm?*/\\nif y=='COMMAND' | \\\\datatype($,\\\"W\\\") then exit /*stick a fork in it, we're all done. */\\n else exit $ /*return the answer ───► the invoker.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nshow: if showSteps then say center(arg(1), L) left(space($), L); return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program evaluates a ═════ Reverse Polish notation (RPN) ═════ expression. */\\nparse arg x /*obtain optional arguments from the CL*/\\nif x='' then x= \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" /*Not specified? Then use the default.*/\\ntokens=words(x) /*save the number of tokens \\\" \\\". */\\nshowSteps=1 /*set to 0 if working steps not wanted.*/\\nox=x /*save the original value of X. */\\n do i=1 for tokens; @.i=word(x,i) /*assign the input tokens to an array. */\\n end /*i*/\\nx=space(x) /*remove any superfluous blanks in X. */\\nL=max(20, length(x)) /*use 20 for the minimum display width.*/\\nnumeric digits L /*ensure enough decimal digits for ans.*/\\nsay center('operand', L, \\\"─\\\") center('stack', L+L, \\\"─\\\") /*display title*/\\nDop= '/ // % ÷'; Bop='& | &&' /*division operators; binary operands.*/\\nAop= '- + * ^ **' Dop Bop; Lop=Aop \\\"||\\\" /*arithmetic operators; legal operands.*/\\n$= /*nullify the stack (completely empty).*/\\n do k=1 for tokens; ?=@.k; ??=? /*process each token from the @. list.*/\\n #=words($); b=word($, max(1, #) ) /*the stack count; the last entry. */\\n a=word($, max(1, #-1) ) /*stack's \\\"first\\\" operand. */\\n division =wordpos(?, Dop)\\\\==0 /*flag: doing a some kind of division.*/\\n arith =wordpos(?, Aop)\\\\==0 /*flag: doing arithmetic. */\\n bitOp =wordpos(?, Bop)\\\\==0 /*flag: doing some kind of binary oper*/\\n if datatype(?, 'N') then do; $=$ ?; call show \\\"add to───►stack\\\"; iterate; end\\n if wordpos(?, Lop)==0 then do; $=e 'illegal operator:' ?; leave; end\\n if w<2 then do; $=e 'illegal RPN expression.'; leave; end\\n if ?=='^' then ??= \\\"**\\\" /*REXXify ^ ──► ** (make it legal). */\\n if ?=='÷' then ??= \\\"/\\\" /*REXXify ÷ ──► / (make it legal). */\\n if division & b=0 then do; $=e 'division by zero.' ; leave; end\\n if bitOp & \\\\isBit(a) then do; $=e \\\"token isn't logical: \\\" a; leave; end\\n if bitOp & \\\\isBit(b) then do; $=e \\\"token isn't logical: \\\" b; leave; end\\n interpret 'y=' a ?? b /*compute with two stack operands*/\\n if datatype(y, 'W') then y=y/1 /*normalize the number with ÷ by unity.*/\\n _=subword($, 1, #-2); $=_ y /*rebuild the stack with the answer. */\\n call show ? /*display (possibly) a working step. */\\n end /*k*/\\nsay /*display a blank line, better perusing*/\\nif word($,1)==e then $= /*handle the special case of errors. */\\nsay ' RPN input:' ox; say \\\" answer───►\\\"$ /*display original input; display ans.*/\\nparse source upper . y . /*invoked via C.L. or via a REXX pgm?*/\\nif y=='COMMAND' | \\\\datatype($,\\\"W\\\") then exit /*stick a fork in it, we're all done. */\\n else exit $ /*return the answer ───► the invoker.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nisBit: return arg(1)==0 | arg(1)==1 /*returns 1 if arg1 is a binary bit*/\\nshow: if showSteps then say center(arg(1), L) left(space($), L); return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"rpn = RPNExpression(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\nvalue = rpn.eval\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"prn$ = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / + \\\"\\n\\nj = 0\\nwhile word$(prn$,i + 1,\\\" \\\") <> \\\"\\\"\\ni = i + 1\\n n$ = word$(prn$,i,\\\" \\\")\\n if n$ < \\\"0\\\" or n$ > \\\"9\\\" then\\n num1 = val(word$(stack$,s,\\\" \\\"))\\n num2 = val(word$(stack$,s-1,\\\" \\\"))\\n n = op(n$,num2,num1)\\n s = s - 1\\n stack$ = stk$(stack$,s -1,str$(n))\\n print \\\"Push Opr \\\";n$;\\\" to stack: \\\";stack$\\n else\\n s = s + 1\\n stack$ = stack$ + n$ + \\\" \\\"\\n print \\\"Push Num \\\";n$;\\\" to stack: \\\";stack$\\nend if\\nwend\\n\\nfunction stk$(stack$,s,a$)\\nfor i = 1 to s\\n stk$ = stk$ + word$(stack$,i,\\\" \\\") + \\\" \\\"\\nnext i\\nstk$ = stk$ + a$ + \\\" \\\"\\nend function\\n\\nFUNCTION op(op$,a,b)\\nif op$ = \\\"*\\\" then op = a * b\\nif op$ = \\\"/\\\" then op = a / b\\nif op$ = \\\"^\\\" then op = a ^ b\\nif op$ = \\\"+\\\" then op = a + b\\nif op$ = \\\"-\\\" then op = a - b\\nend function\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn rpn(text: &str) -> f64 {\\n let tokens = text.split_whitespace();\\n let mut stack: Vec<f64> = vec![];\\n println!(\\\"input operation stack\\\");\\n\\n for token in tokens {\\n print!(\\\"{:^5} \\\", token);\\n match token.parse() {\\n Ok(num) => {\\n stack.push(num);\\n println!(\\\"push {:?}\\\", stack);\\n }\\n Err(_) => {\\n match token {\\n \\\"+\\\" => {\\n let b = stack.pop().expect(\\\"missing first operand\\\");\\n let a = stack.pop().expect(\\\"missing second operand\\\");\\n stack.push(a + b);\\n }\\n \\\"-\\\" => {\\n let b = stack.pop().expect(\\\"missing first operand\\\");\\n let a = stack.pop().expect(\\\"missing second operand\\\");\\n stack.push(a - b);\\n }\\n \\\"*\\\" => {\\n let b = stack.pop().expect(\\\"missing first operand\\\");\\n let a = stack.pop().expect(\\\"missing second operand\\\");\\n stack.push(a * b);\\n }\\n \\\"/\\\" => {\\n let b = stack.pop().expect(\\\"missing first operand\\\");\\n let a = stack.pop().expect(\\\"missing second operand\\\");\\n stack.push(a / b);\\n }\\n \\\"^\\\" => {\\n let b = stack.pop().expect(\\\"missing first operand\\\");\\n let a = stack.pop().expect(\\\"missing second operand\\\");\\n stack.push(a.powf(b));\\n }\\n _ => panic!(\\\"unknown operator {}\\\", token),\\n }\\n println!(\\\"calculate {:?}\\\", stack);\\n }\\n }\\n }\\n\\n stack.pop().unwrap_or(0.0)\\n}\\n\\nfn main() {\\n let text = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\";\\n\\n println!(\\\"\\\\nresult: {}\\\", rpn(text));\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object RPN {\\n val PRINT_STACK_CONTENTS: Boolean = true\\n\\n def main(args: Array[String]): Unit = {\\n val result = evaluate(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\".split(\\\" \\\").toList)\\n println(\\\"Answer: \\\" + result)\\n }\\n\\n def evaluate(tokens: List[String]): Double = {\\n import scala.collection.mutable.Stack\\n val stack: Stack[Double] = new Stack[Double]\\n for (token <- tokens) {\\n if (isOperator(token)) token match {\\n case \\\"+\\\" => stack.push(stack.pop + stack.pop)\\n case \\\"-\\\" => val x = stack.pop; stack.push(stack.pop - x)\\n case \\\"*\\\" => stack.push(stack.pop * stack.pop)\\n case \\\"/\\\" => val x = stack.pop; stack.push(stack.pop / x)\\n case \\\"^\\\" => val x = stack.pop; stack.push(math.pow(stack.pop, x))\\n case _ => throw new RuntimeException( s\\\"\\\"\\\"\\\"$token\\\" is not an operator\\\"\\\"\\\")\\n }\\n else stack.push(token.toDouble)\\n\\n if (PRINT_STACK_CONTENTS) {\\n print(\\\"Input: \\\" + token)\\n print(\\\" Stack: \\\")\\n for (element <- stack.seq.reverse) print(element + \\\" \\\");\\n println(\\\"\\\")\\n }\\n }\\n\\n stack.pop\\n }\\n\\n def isOperator(token: String): Boolean = {\\n token match {\\n case \\\"+\\\" => true; case \\\"-\\\" => true; case \\\"*\\\" => true; case \\\"/\\\" => true; case \\\"^\\\" => true\\n case _ => false\\n }\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var proggie = '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\n\\nclass RPN(arr=[]) {\\n\\n method binop(op) {\\n var x = arr.pop\\n var y = arr.pop\\n arr << y.(op)(x)\\n }\\n\\n method run(p) {\\n p.each_word { |w|\\n say \\\"#{w} (#{arr})\\\"\\n given (w) {\\n when (/\\\\d/) {\\n arr << Num(w)\\n }\\n when (<+ - * />) {\\n self.binop(w)\\n }\\n when ('^') {\\n self.binop('**')\\n }\\n default {\\n die \\\"#{w} is bogus\\\"\\n }\\n }\\n }\\n say arr[0]\\n }\\n}\\n\\nRPN.new.run(proggie)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \" 10 DIM S(5)\\n 20 LET P=1\\n 30 INPUT E$\\n 40 LET I=0\\n 50 LET I=I+1\\n 60 IF E$(I)=\\\" \\\" THEN GOTO 110\\n 70 IF I<LEN E$ THEN GOTO 50\\n 80 LET W$=E$\\n 90 GOSUB 150\\n100 STOP\\n110 LET W$=E$( TO I-1)\\n120 LET E$=E$(I+1 TO )\\n130 GOSUB 150\\n140 GOTO 40\\n150 IF W$=\\\"+\\\" OR W$=\\\"-\\\" OR W$=\\\"*\\\" OR W$=\\\"/\\\" OR W$=\\\"**\\\" THEN GOTO 250\\n160 LET S(P)=VAL W$\\n170 LET P=P+1\\n180 PRINT W$;\\n190 PRINT \\\":\\\";\\n200 FOR I=P-1 TO 1 STEP -1\\n210 PRINT \\\" \\\";S(I);\\n220 NEXT I\\n230 PRINT\\n240 RETURN\\n250 IF W$=\\\"**\\\" THEN LET S(P-2)=ABS S(P-2)\\n260 LET S(P-2)=VAL (STR$ S(P-2)+W$+STR$ S(P-1))\\n270 LET P=P-1\\n280 GOTO 180\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"let opa = [\\n \\\"^\\\": (prec: 4, rAssoc: true),\\n \\\"*\\\": (prec: 3, rAssoc: false),\\n \\\"/\\\": (prec: 3, rAssoc: false),\\n \\\"+\\\": (prec: 2, rAssoc: false),\\n \\\"-\\\": (prec: 2, rAssoc: false),\\n]\\n\\nfunc rpn(tokens: [String]) -> [String] {\\n var rpn : [String] = []\\n var stack : [String] = [] // holds operators and left parenthesis\\n\\n for tok in tokens {\\n switch tok {\\n case \\\"(\\\":\\n stack += [tok] // push \\\"(\\\" to stack\\n case \\\")\\\":\\n while !stack.isEmpty {\\n let op = stack.removeLast() // pop item from stack\\n if op == \\\"(\\\" {\\n break // discard \\\"(\\\"\\n } else {\\n rpn += [op] // add operator to result\\n }\\n }\\n default:\\n if let o1 = opa[tok] { // token is an operator?\\n for op in stack.reverse() {\\n if let o2 = opa[op] {\\n if !(o1.prec > o2.prec || (o1.prec == o2.prec && o1.rAssoc)) {\\n // top item is an operator that needs to come off\\n rpn += [stack.removeLast()] // pop and add it to the result\\n continue\\n }\\n }\\n break\\n }\\n\\n stack += [tok] // push operator (the new one) to stack\\n } else { // token is not an operator\\n rpn += [tok] // add operand to result\\n }\\n }\\n }\\n\\n return rpn + stack.reverse()\\n}\\n\\nfunc parseInfix(e: String) -> String {\\n let tokens = e.characters.split{ $0 == \\\" \\\" }.map(String.init)\\n return rpn(tokens).joinWithSeparator(\\\" \\\")\\n}\\n\\nvar input : String\\n\\ninput = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n\\\"infix: \\\\(input)\\\"\\n\\\"postfix: \\\\(parseInfix(input))\\\"\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"# Helper\\nproc pop stk {\\n upvar 1 $stk s\\n set val [lindex $s end]\\n set s [lreplace $s end end]\\n return $val\\n}\\n\\nproc evaluate rpn {\\n set stack {}\\n foreach token $rpn {\\n\\tset act \\\"apply\\\"\\n\\tswitch $token {\\n\\t \\\"^\\\" {\\n\\t\\t# Non-commutative operation\\n\\t\\tset a [pop stack]\\n\\t\\tlappend stack [expr {[pop stack] ** $a}]\\n\\t }\\n\\t \\\"/\\\" {\\n\\t\\t# Non-commutative, special float handling\\n\\t\\tset a [pop stack]\\n\\t\\tset b [expr {[pop stack] / double($a)}]\\n\\t\\tif {$b == round($b)} {set b [expr {round($b)}]}\\n\\t\\tlappend stack $b\\n\\t }\\n\\t \\\"*\\\" {\\n\\t\\t# Commutative operation\\n\\t\\tlappend stack [expr {[pop stack] * [pop stack]}]\\n\\t }\\n\\t \\\"-\\\" {\\n\\t\\t# Non-commutative operation\\n\\t\\tset a [pop stack]\\n\\t\\tlappend stack [expr {[pop stack] - $a}]\\n\\t }\\n\\t \\\"+\\\" {\\n\\t\\t# Commutative operation\\n\\t\\tlappend stack [expr {[pop stack] + [pop stack]}]\\n\\t }\\n\\t default {\\n\\t\\tset act \\\"push\\\"\\n\\t\\tlappend stack $token\\n\\t }\\n\\t}\\n\\tputs \\\"$token\\\\t$act\\\\t$stack\\\"\\n }\\n return [lindex $stack end]\\n}\\n\\nputs [evaluate {3 4 2 * 1 5 - 2 3 ^ ^ / +}]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/bin/sh\\n\\nexp() {\\n R=1\\n local i=1\\n\\n while [ $i -le $2 ]; do\\n R=$(($R * $1))\\n i=$(($i + 1))\\n done\\n}\\n\\nrpn() {\\n local O1 O2 stack\\n\\n while [ $# -ge 1 ]; do\\n grep -iE '^-?[0-9]+$' <<< \\\"$1\\\" > /dev/null 2>&1\\n if [ \\\"$?\\\" -eq 0 ]; then\\n stack=`sed -e '$a'\\\"$1\\\" -e '/^$/d' <<< \\\"$stack\\\"`\\n else\\n grep -iE '^[-\\\\+\\\\*\\\\/\\\\%\\\\^]$' <<< \\\"$1\\\" > /dev/null 2>&1\\n if [ \\\"$?\\\" -eq 0 ]; then\\n O2=`sed -n '$p' <<< \\\"$stack\\\"`\\n stack=`sed '$d' <<< \\\"$stack\\\"`\\n O1=`sed -n '$p' <<< \\\"$stack\\\"`\\n\\n case \\\"$1\\\" in\\n '+')\\n stack=`sed -e '$a'\\\"$(($O1 + $O2))\\\" -e '/^$/d' -e '$d' \\\\\\n <<< \\\"$stack\\\"`;;\\n '-')\\n stack=`sed -e '$a'\\\"$(($O1 - $O2))\\\" -e '/^$/d' -e '$d' \\\\\\n <<< \\\"$stack\\\"`;;\\n '*')\\n stack=`sed -e '$a'\\\"$(($O1 * $O2))\\\" -e '/^$/d' -e '$d' \\\\\\n <<< \\\"$stack\\\"`;;\\n '/')\\n stack=`sed -e '$a'\\\"$(($O1 / $O2))\\\" -e '/^$/d' -e '$d' \\\\\\n <<< \\\"$stack\\\"`;;\\n '%')\\n stack=`sed -e '$a'\\\"$(($O1 % $O2))\\\" -e '/^$/d' -e '$d' \\\\\\n <<< \\\"$stack\\\"`;;\\n '^')\\n exp $O1 $O2\\n stack=`sed -e '$a'\\\"$(($R))\\\" -e '/^$/d' -e '$d' <<< \\\\\\n \\\"$stack\\\"`;;\\n esac\\n else\\n echo \\\"Unknown RPN token \\\\`\\\\`$1''\\\"\\n fi\\n fi\\n echo \\\"$1\\\" \\\":\\\" $stack\\n shift\\n done\\n\\n sed -n '1p' <<< \\\"$stack\\\"\\n if [ \\\"`wc -l <<< \\\"$stack\\\"`\\\" -gt 1 ]; then\\n echo \\\"Malformed input expression\\\" > /dev/stderr\\n return 1\\n else\\n return 0\\n fi\\n}\\n\\nrpn 3 4 2 '*' 1 5 '-' 2 3 '^' '^' '/' '+'\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"3 : 3\\n4 : 3 4\\n2 : 3 4 2\\n* : 3 8\\n1 : 3 8 1\\n5 : 3 8 1 5\\n- : 3 8 -4\\n2 : 3 8 -4 2\\n3 : 3 8 -4 2 3\\n^ : 3 8 -4 8\\n^ : 3 8 65536\\n/ : 3 0\\n+ : 3\\n3\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import math\\n\\nconst (\\n supported_operations = ['+', '-', '*', '/', '^']\\n max_depth = 256\\n)\\n\\nstruct Stack {\\nmut:\\n\\tdata []f32 = [f32(0)].repeat(max_depth)\\n\\tdepth int\\n}\\n\\nfn (mut stack Stack) push(value f32) {\\n\\tif stack.depth >= max_depth {\\n\\t\\tprintln('Stack Overflow!!')\\n\\t\\treturn\\n\\t}\\n\\tstack.data[stack.depth] = value\\n\\tstack.depth++\\n}\\n\\nfn (mut stack Stack) pop() ?f32 {\\n\\tif stack.depth > 0 {\\n\\t\\tstack.depth--\\n\\t\\tresult := stack.data[stack.depth]\\n\\t\\treturn result\\n\\t}\\n\\treturn error('Stack Underflow!!')\\n}\\n\\nfn (stack Stack) peek() ?f32 {\\n\\tif stack.depth > 0 {\\n\\t\\tresult := stack.data[0]\\n\\t\\treturn result\\n\\t}\\n\\treturn error('Out of Bounds...')\\n}\\n\\nfn (mut stack Stack) rpn(input string) ?f32 {\\n\\tprintln('Input: $input')\\n\\ttokens := input.split(' ')\\n\\tmut a := f32(0)\\n\\tmut b := f32(0)\\n\\tprintln('Token Stack')\\n\\tfor token in tokens {\\n\\t\\tif token.str.is_digit() {\\n\\t\\t\\tstack.push(token.f32())\\n\\t\\t} else if token in supported_operations {\\n\\t\\t\\tb = stack.pop() or { f32(0) }\\n\\t\\t\\ta = stack.pop() or { f32(0) }\\n\\t\\t\\tmatch token {\\n\\t\\t\\t\\t'+' {\\n\\t\\t\\t\\t\\tstack.push(a + b)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t'-' {\\n\\t\\t\\t\\t\\tstack.push(a - b)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t'*' {\\n\\t\\t\\t\\t\\tstack.push(a * b)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t'/' {\\n\\t\\t\\t\\t\\tstack.push(a / b)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t'^' {\\n\\t\\t\\t\\t\\tstack.push(f32(math.pow(a, b)))\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tprintln('Oofffff')\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprint('${token:5s} ')\\n\\t\\tfor i := 0; i < stack.depth; i++ {\\n\\t\\t\\tif i == stack.depth - 1 {\\n\\t\\t\\t\\tprintln('${stack.data[i]:0.6f} |>')\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprint('${stack.data[i]:0.6f}, ')\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn stack.peek()\\n}\\n\\nfn main() {\\n\\tmut calc := Stack{}\\n\\tresult := calc.rpn('3 4 2 * 1 5 - 2 3 ^ ^ / +') or { return }\\n\\tprintln('\\\\nResult: $result')\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Global stack$\\n\\nFunction RPN(expr$)\\nDebug.Print \\\"Expression:\\\"\\nDebug.Print expr$\\nDebug.Print \\\"Input\\\", \\\"Operation\\\", \\\"Stack after\\\"\\n\\nstack$ = \\\"\\\"\\ntoken$ = \\\"#\\\"\\ni = 1\\ntoken$ = Split(expr$)(i - 1) 'split is base 0\\ntoken2$ = \\\" \\\" + token$ + \\\" \\\"\\n\\nDo\\n Debug.Print \\\"Token \\\"; i; \\\": \\\"; token$,\\n 'operation\\n If InStr(\\\"+-*/^\\\", token$) <> 0 Then\\n Debug.Print \\\"operate\\\",\\n op2$ = pop$()\\n op1$ = pop$()\\n If op1$ = \\\"\\\" Then\\n Debug.Print \\\"Error: stack empty for \\\"; i; \\\"-th token: \\\"; token$\\n End\\n End If\\n\\n op1 = Val(op1$)\\n op2 = Val(op2$)\\n\\n Select Case token$\\n Case \\\"+\\\"\\n res = CDbl(op1) + CDbl(op2)\\n Case \\\"-\\\"\\n res = CDbl(op1) - CDbl(op2)\\n Case \\\"*\\\"\\n res = CDbl(op1) * CDbl(op2)\\n Case \\\"/\\\"\\n res = CDbl(op1) / CDbl(op2)\\n Case \\\"^\\\"\\n res = CDbl(op1) ^ CDbl(op2)\\n End Select\\n\\n Call push2(str$(res))\\n 'default:number\\n Else\\n Debug.Print \\\"push\\\",\\n Call push2(token$)\\n End If\\n Debug.Print \\\"Stack: \\\"; reverse$(stack$)\\n i = i + 1\\n If i > Len(Join(Split(expr, \\\" \\\"), \\\"\\\")) Then\\n token$ = \\\"\\\"\\n Else\\n token$ = Split(expr$)(i - 1) 'base 0\\n token2$ = \\\" \\\" + token$ + \\\" \\\"\\n End If\\nLoop Until token$ = \\\"\\\"\\n\\nDebug.Print\\nDebug.Print \\\"Result:\\\"; pop$()\\n'extra$ = pop$()\\nIf stack <> \\\"\\\" Then\\n Debug.Print \\\"Error: extra things on a stack: \\\"; stack$\\nEnd If\\nEnd\\nEnd Function\\n\\n'---------------------------------------\\nFunction reverse$(s$)\\n reverse$ = \\\"\\\"\\n token$ = \\\"#\\\"\\n While token$ <> \\\"\\\"\\n i = i + 1\\n token$ = Split(s$, \\\"|\\\")(i - 1) 'split is base 0\\n reverse$ = token$ & \\\" \\\" & reverse$\\n Wend\\nEnd Function\\n'---------------------------------------\\nSub push2(s$)\\n stack$ = s$ + \\\"|\\\" + stack$ 'stack\\nEnd Sub\\n\\nFunction pop$()\\n 'it does return empty on empty stack\\n pop$ = Split(stack$, \\\"|\\\")(0)\\n stack$ = Mid$(stack$, InStr(stack$, \\\"|\\\") + 1)\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Stack\\n\\nvar rpnCalculate = Fn.new { |expr|\\n if (expr == \\\"\\\") Fiber.abort(\\\"Expression cannot be empty.\\\")\\n System.print(\\\"For expression = %(expr)\\\\n\\\")\\n System.print(\\\"Token Action Stack\\\")\\n var tokens = expr.split(\\\" \\\").where { |t| t != \\\"\\\" }\\n var stack = Stack.new()\\n for (token in tokens) {\\n var d = Num.fromString(token)\\n if (d) {\\n stack.push(d)\\n System.print(\\\" %(d) Push num onto top of stack %(stack)\\\")\\n } else if ((token.count > 1) || !\\\"+-*/^\\\".contains(token)) {\\n Fiber.abort(\\\"%(token) is not a valid token.\\\")\\n } else if (stack.count < 2) {\\n Fiber.abort(\\\"Stack contains too few operands.\\\")\\n } else {\\n var d1 = stack.pop()\\n var d2 = stack.pop()\\n stack.push(token == \\\"+\\\" ? d2 + d1 :\\n token == \\\"-\\\" ? d2 - d1 :\\n token == \\\"*\\\" ? d2 * d1 :\\n token == \\\"/\\\" ? d2 / d1 : d2.pow(d1))\\n System.print(\\\" %(token) Apply op to top of stack %(stack)\\\")\\n }\\n }\\n System.print(\\\"\\\\nThe final value is %(stack.pop())\\\")\\n}\\n\\nvar expr = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\nrpnCalculate.call(expr)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Function RPN(expr As String) As String\\n Dim tokenArray() As String\\n Dim stack() As String\\n\\n Dim Wert1 As Double\\n Dim Wert2 As Double\\n\\n 'Initialize array (removed later)\\n ReDim tokenArray(1)\\n ReDim stack(1)\\n\\n tokenArray = Split(expr, \\\" \\\")\\n\\n Dim i As integer\\n i = 0\\n\\n While i <= tokenArray.Ubound\\n If tokenArray(i) = \\\"+\\\" Then\\n Wert2 = Val(stack.pop)\\n Wert1 = Val(stack.pop)\\n stack.Append(Str(Wert1+Wert2))\\n ElseIf tokenArray(i) = \\\"-\\\" Then\\n Wert2 = Val(stack.pop)\\n Wert1 = Val(stack.pop)\\n stack.Append(Str(Wert1-Wert2))\\n ElseIf tokenArray(i) = \\\"*\\\" Then\\n Wert2 = Val(stack.pop)\\n Wert1 = Val(stack.pop)\\n stack.Append(Str(Wert1*Wert2))\\n ElseIf tokenArray(i) = \\\"/\\\" Then\\n Wert2 = Val(stack.pop)\\n Wert1 = Val(stack.pop)\\n stack.Append(Str(Wert1/Wert2))\\n ElseIf tokenArray(i) = \\\"^\\\" Then\\n Wert2 = Val(stack.pop)\\n Wert1 = Val(stack.pop)\\n stack.Append(Str(pow(Wert1,Wert2)))\\n Else\\n stack.Append(tokenArray(i))\\n End If\\n i = i +1\\n Wend\\n\\n Return stack(2)\\n\\nEnd Function\\n\",\n \"language\": \"Xojo\"\n },\n {\n \"code\": \"real Stack(10);\\nint SP;\\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\\nchar Str; real Top; int Token, I;\\n[Str:= \\\"3 4 2 * 1 5 - 2 3 ^^ ^^ / + \\\";\\nSP:= 0;\\nFormat(6, 8);\\nloop [repeat Token:= Str(0); Str:= Str+1;\\n until Token # ^ ; \\\\skip space characters\\n case Token of\\n ^+: [Top:= Pop; Push(Pop+Top)];\\n ^-: [Top:= Pop; Push(Pop-Top)];\\n ^*: [Top:= Pop; Push(Pop*Top)];\\n ^/: [Top:= Pop; Push(Pop/Top)];\\n ^^: [Top:= Pop; Push(Pow(Pop, Top))];\\n $A0: quit \\\\space with MSB set\\n other [Push(float(Token-^0))]; \\\\single digit number\\n ChOut(0, Token);\\n for I:= 0 to SP-1 do \\\\show stack\\n RlOut(0, Stack(I));\\n CrLf(0);\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var ops=D(\\\"^\\\",True, \\\"*\\\",'*, \\\"/\\\",'/, \\\"+\\\",'+, \\\"-\\\",'-);\\n\\nfcn parseRPN(e){\\n println(\\\"\\\\npostfix: \\\", e);\\n stack:=L();\\n foreach tok in (e.split()){\\n op:=ops.find(tok);\\n if(op){\\n\\t y := stack.pop(); x := stack.pop();\\n\\t if(True==op) x=x.pow(y);\\n\\t else\\t x=op(x,y);\\n\\t stack.append(x);\\n }\\n else stack.append(tok.toFloat());\\n println(tok,\\\" --> \\\",stack);\\n }\\n println(\\\"result: \\\", stack[0])\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"tests:=T(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\");\\nforeach t in (tests) { parseRPN(t) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parsing-RPN-calculator-algorithm"}}},{"rowIdx":1485,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Parsing/RPN_to_infix_conversion\n","language":"00-META"},{"code":";Task:\nCreate a program that takes an [[wp:Reverse Polish notation|RPN]] representation of an expression formatted as a space separated sequence of tokens and generates the equivalent expression in [[wp:Infix notation|infix notation]].\n\n* Assume an input of a correct, space separated, string of tokens\n* Generate a space separated output string representing the same expression in infix notation\n* Show how the major datastructure of your algorithm changes with each new token parsed.\n* Test with the following input RPN strings then print and display the output here.\n:::::{| class=\"wikitable\"\n! RPN input !! sample output\n|- || align=\"center\"\n| <code>3 4 2 * 1 5 - 2 3 ^ ^ / +</code>|| <code>3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3</code>\n|- || align=\"center\"\n| <code>1 2 + 3 4 + ^ 5 6 + ^</code>|| <code>( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )</code>\n|}\n\n* Operator precedence and operator associativity is given in this table:\n::::::::{| class=\"wikitable\"\n\n! operator !! [[wp:Order_of_operations|precedence]] !! [[wp:Operator_associativity|associativity]] !! operation\n|- || align=\"center\" \n| <big><big> ^ </big></big> || 4 || right || exponentiation\n|- || align=\"center\" \n| <big><big> * </big></big> || 3 || left || multiplication\n|- || align=\"center\" \n| <big><big> / </big></big> || 3 || left || division\n|- || align=\"center\" \n| <big><big> + </big></big> || 2 || left || addition\n|- || align=\"center\" \n| <big><big> - </big></big> || 2 || left || subtraction\n|}\n\n\n;See also:\n* [[Parsing/Shunting-yard algorithm]] for a method of generating an RPN from an infix expression.\n* [[Parsing/RPN calculator algorithm]] for a method of calculating a final value from this output RPN expression.\n* [http://www.rubyquiz.com/quiz148.html Postfix to infix] from the RubyQuiz site.\n<br><br>\n\n","language":"00-TASK"},{"code":"-V ops = ‘-+/*^’\n\nF postfix_to_infix(postfix)\n T Expression\n String op, ex\n prec = 3\n\n F (String e1, e2 = ‘’, o = ‘’)\n I o == ‘’\n .ex = e1\n E\n .ex = e1‘ ’o‘ ’e2\n .op = o\n .prec = :ops.index(o) I/ 2\n\n F String()\n R .ex\n\n [Expression] expr\n\n L(token) postfix.split(re:‘\\s+’)\n V c = token[0]\n V? idx = :ops.find(c)\n I idx != N\n V r = expr.pop()\n V l = expr.pop()\n V opPrec = idx I/ 2\n\n I l.prec < opPrec | (l.prec == opPrec & c == ‘^’)\n l.ex = ‘(’l.ex‘)’\n\n I r.prec < opPrec | (r.prec == opPrec & c != ‘^’)\n r.ex = ‘(’r.ex‘)’\n expr.append(Expression(l.ex, r.ex, token))\n E\n expr.append(Expression(token))\n\n print(token‘ -> ’expr)\n\n assert(expr.len == 1)\n R expr[0].ex\n\nL(e) [‘3 4 2 * 1 5 - 2 3 ^ ^ / +’,\n ‘1 2 + 3 4 + ^ 5 6 + ^’]\n print(‘Postfix : ’e)\n print(‘Infix : ’postfix_to_infix(e))\n print()\n","language":"11l"},{"code":" type Priority is range 1..4;\n type Infix is record\n Precedence : Priority;\n Expression : Unbounded_String;\n end record;\n package Expression_Stack is new Generic_Stack (Infix);\n use Expression_Stack;\n\n function Convert (RPN : String) return String is\n Arguments : Stack;\n procedure Pop\n ( Operation : Character;\n Precedence : Priority;\n Association : Priority\n ) is\n Right, Left : Infix;\n Result : Infix;\n begin\n Pop (Right, Arguments);\n Pop (Left, Arguments);\n Result.Precedence := Association;\n if Left.Precedence < Precedence then\n Append (Result.Expression, '(');\n Append (Result.Expression, Left.Expression);\n Append (Result.Expression, ')');\n else\n Append (Result.Expression, Left.Expression);\n end if;\n Append (Result.Expression, ' ');\n Append (Result.Expression, Operation);\n Append (Result.Expression, ' ');\n if Right.Precedence < Precedence then\n Append (Result.Expression, '(');\n Append (Result.Expression, Right.Expression);\n Append (Result.Expression, ')');\n else\n Append (Result.Expression, Right.Expression);\n end if;\n Push (Result, Arguments);\n end Pop;\n Pointer : Integer := RPN'First;\n begin\n while Pointer <= RPN'Last loop\n case RPN (Pointer) is\n when ' ' =>\n Pointer := Pointer + 1;\n when '0'..'9' =>\n declare\n Start : constant Integer := Pointer;\n begin\n loop\n Pointer := Pointer + 1;\n exit when Pointer > RPN'Last\n or else RPN (Pointer) not in '0'..'9';\n end loop;\n Push\n ( ( 4,\n To_Unbounded_String (RPN (Start..Pointer - 1))\n ),\n Arguments\n );\n end;\n when '+' | '-' =>\n Pop (RPN (Pointer), 1, 1);\n Pointer := Pointer + 1;\n when '*' | '/' =>\n Pop (RPN (Pointer), 2, 2);\n Pointer := Pointer + 1;\n when '^' =>\n Pop (RPN (Pointer), 4, 3);\n Pointer := Pointer + 1;\n when others =>\n raise Constraint_Error with \"Syntax\";\n end case;\n end loop;\n declare\n Result : Infix;\n begin\n Pop (Result, Arguments);\n return To_String (Result.Expression);\n end;\n end Convert;\n","language":"Ada"},{"code":"with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\nwith Ada.Text_IO; use Ada.Text_IO;\nwith Generic_Stack;\n\nprocedure RPN_to_Infix is\n -- The code above\nbegin\n Put_Line (\"3 4 2 * 1 5 - 2 3 ^ ^ / + = \");\n Put_Line (Convert (\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"));\n Put_Line (\"1 2 + 3 4 + ^ 5 6 + ^ = \");\n Put_Line (Convert (\"1 2 + 3 4 + ^ 5 6 + ^\"));\nend RPN_to_Infix;\n","language":"Ada"},{"code":"# rpn to infix - parses an RPN expression and generates the equivalent #\n# infix expression #\nPROC rpn to infix = ( STRING rpn )STRING:\nBEGIN\n\n # we parse the string backwards using recursive descent #\n INT rpn pos := UPB rpn;\n BOOL had error := FALSE;\n\n # mode to hold nodes of the parse tree #\n MODE NODE = STRUCT( INT op\n , UNION( REF NODE, STRING ) left\n , REF NODE right\n );\n\n REF NODE nil node = NIL;\n\n\n # op codes #\n INT error = 1;\n INT factor = 2;\n INT add = 3;\n INT sub = 4;\n INT mul = 5;\n INT div = 6;\n INT pwr = 7;\n\n []STRING op name = ( \"error\", \"factor\", \"+\", \"-\", \"*\", \"/\", \"^\" );\n []BOOL right associative\n = ( FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, TRUE );\n []INT priority = ( 1, 1, 2, 2, 3, 3, 4 );\n\n\n\n # returns TRUE if we have reached the end of the rpn string, #\n # FALSE otherwise #\n PROC at end = BOOL: rpn pos < LWB rpn;\n\n # positions to the previous character, if there is one #\n PROC next = VOID: rpn pos -:= 1;\n\n # skip spaces in the rpn string #\n PROC skip spaces = VOID:\n WHILE have( \" \" )\n DO\n next\n OD # skip spaces # ;\n\n # returns TRUE if the rpn character at rpn pos is c, #\n # FALSE if the character is not c or there is no character #\n # at rpn pos #\n PROC have = ( CHAR c )BOOL:\n IF at end\n THEN\n # no character at rpn pos #\n FALSE\n ELSE\n # have a character - check it is the required one #\n rpn[ rpn pos ] = c\n FI # have # ;\n\n # gets an operand from the rpn string #\n # an operand is either a number or a sub-expression #\n PROC get operand = ( STRING rpn, STRING operand name )REF NODE:\n BEGIN\n\n # handle the operator or operand, if there is one #\n\n skip spaces;\n\n print( ( ( \"parsing \"\n + operand name\n + \" from: \"\n + IF at end THEN \"\" ELSE rpn[ LWB rpn : rpn pos ] FI\n )\n , newline\n )\n );\n\n REF NODE result :=\n IF at end\n THEN\n # no operand #\n had error := TRUE;\n HEAP NODE := ( error, \"!! Missing operand !!\", NIL )\n ELIF have( \"+\" )\n THEN\n # addition #\n next;\n HEAP NODE right := get operand( rpn, \"+ right operand\" );\n HEAP NODE left := get operand( rpn, \"+ left operand\" );\n HEAP NODE := ( add, left, right )\n ELIF have( \"-\" )\n THEN\n # subtraction #\n next;\n HEAP NODE right := get operand( rpn, \"- right operand\" );\n HEAP NODE left := get operand( rpn, \"- left operand\" );\n HEAP NODE := ( sub, left, right )\n ELIF have( \"*\" )\n THEN\n # multiplication #\n next;\n HEAP NODE right := get operand( rpn, \"* right operand\" );\n HEAP NODE left := get operand( rpn, \"* left operand\" );\n HEAP NODE := ( mul, left, right )\n ELIF have( \"/\" )\n THEN\n # division #\n next;\n HEAP NODE right := get operand( rpn, \"/ right operand\" );\n HEAP NODE left := get operand( rpn, \"/ left operand\" );\n HEAP NODE := ( div, left, right )\n ELIF have( \"^\" )\n THEN\n # exponentiation #\n next;\n HEAP NODE right := get operand( rpn, \"^ right operand\" );\n HEAP NODE left := get operand( rpn, \"^ left operand\" );\n HEAP NODE := ( pwr, left, right )\n ELSE\n # must be an operand #\n STRING value := \"\";\n\n WHILE NOT at end\n AND NOT have( \" \" )\n DO\n rpn[ rpn pos ] +=: value;\n next\n OD;\n\n HEAP NODE := ( factor, value, NIL )\n FI;\n\n print( ( operand name + \": \" + TOSTRING result, newline ) );\n\n result\n END # get operand # ;\n\n\n # converts the parse tree to a string with apppropriate parenthesis #\n OP TOSTRING = ( REF NODE operand )STRING:\n BEGIN\n\n # converts a node of the parse tree to a string, inserting #\n # parenthesis if necessary #\n PROC possible parenthesis = ( INT op, REF NODE expr )STRING:\n IF op OF expr = error\n OR op OF expr = factor\n THEN\n # operand is an error/factor - parenthisis not needed #\n TOSTRING expr\n ELIF priority( op OF expr ) < priority( op )\n THEN\n # the expression is a higher precedence operator than the #\n # one we are building the expression for - need parenthesis #\n ( \"( \" + TOSTRING expr + \" )\" )\n ELIF right associative[ op OF operand ]\n AND op OF left( operand ) = op OF operand\n THEN\n # right associative operator #\n ( \"( \" + TOSTRING expr + \" )\" )\n ELSE\n # lower precedence expression - parenthesis not needed #\n TOSTRING expr\n FI # possible parenthesis # ;\n\n # gets the left branch of a node, which must be a node #\n PROC left = ( REF NODE operand )REF NODE:\n CASE left OF operand\n IN ( REF NODE o ): o\n , ( STRING s ): HEAP NODE := ( error, s, NIL )\n ESAC # left # ;\n\n IF had error\n THEN\n # an error occured parsing the expression #\n \"Invalid expression\"\n ELIF operand IS nil node\n THEN\n # no operand? #\n \"<empty>\"\n ELIF op OF operand = error\n OR op OF operand = factor\n THEN\n # error parsing the expression #\n # or a factor #\n CASE left OF operand\n IN ( REF NODE o ): \"Error: String expected: (\" + TOSTRING o + \")\"\n , ( STRING s ): s\n ESAC\n ELSE\n # general operand #\n ( possible parenthesis( op OF operand, left( operand ) )\n + \" \" + op name[ op OF operand ] + \" \"\n + possible parenthesis( op OF operand, right OF operand )\n )\n FI\n END # TOSTRING # ;\n\n STRING result = TOSTRING get operand( rpn, \"expression\" );\n\n # ensure there are no more tokens in the string #\n skip spaces;\n IF at end\n THEN\n # OK - there was only one expression #\n result\n ELSE\n # extraneous tokens #\n ( \"Error - unexpected text before expression: (\"\n + rpn[ LWB rpn : rpn pos ]\n + \")\"\n )\n FI\nEND # rpn to infix # ;\n\n\n\nmain: (\n\n # test the RPN to Infix comnverter #\n STRING rpn;\n\n rpn := \"3 4 2 * 1 5 - 2 3 ^ ^ / +\";\n print( ( rpn, \": \", rpn to infix( rpn ), newline, newline ) );\n\n rpn := \"1 2 + 3 4 + ^ 5 6 + ^\";\n print( ( rpn, \": \", rpn to infix( rpn ), newline ) )\n\n)\n","language":"ALGOL-68"},{"code":"expr := \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n\nstack := {push: func(\"ObjInsert\"), pop: func(\"ObjRemove\")}\nout := \"TOKEN`tACTION STACK (comma separated)`r`n\"\nLoop Parse, expr, %A_Space%\n{\n\ttoken := A_LoopField\n\tif token is number\n\t\tstack.push([0, token])\n\tif isOp(token)\n\t{\n\t\tb := stack.pop(), a := stack.pop(), p := b.1 > a.1 ? b.1 : a.1\n\t\tp := Precedence(token) > p ? precedence(token) : p\n\t\tif (a.1 < b.1) and isRight(token)\n\t\t\tstack.push([p, \"( \" . a.2 \" ) \" token \" \" b.2])\n\t\telse if (a.1 > b.1) and isLeft(token)\n\t\t\tstack.push([p, a.2 token \" ( \" b.2 \" ) \"])\n\t\telse\n\t\t\tstack.push([p, a.2 . \" \" . token . \" \" . b.2])\n\t}\n\tout .= token \"`t\" (isOp(token) ? \"Push Partial expression \"\n\t\t\t : \"Push num\" space(16)) disp(stack) \"`r`n\"\n}\nout .= \"`r`n The final output infix expression is: '\" disp(stack) \"'\"\nclipboard := out\nisOp(t){\n return (!!InStr(\"+-*/^\", t) && t)\n}\nIsLeft(o){\n return !!InStr(\"*/+-\", o)\n}\nIsRight(o){\n return o = \"^\"\n}\nPrecedence(o){\n return (InStr(\"+-/*^\", o)+3)//2\n}\nDisp(obj){\n for each, val in obj\n\t\tif val[2]\n\t\t\to .= \", \" val[2]\n return SubStr(o,3)\n}\nSpace(n){\n return n>0 ? A_Space Space(n-1) : \"\"\n}\n","language":"AutoHotkey"},{"code":"#!/usr/bin/awk -f\n\nBEGIN {\n initStack()\n initOpers()\n print \"Infix: \" toInfix(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n print \"\"\n print \"Infix: \" toInfix(\"1 2 + 3 4 + ^ 5 6 + ^\")\n print \"\"\n print \"Infix: \" toInfix(\"moon stars mud + * fire soup * ^\")\n exit\n}\n\nfunction initStack() {\n delete stack\n stackPtr = 0\n}\n\nfunction initOpers() {\n VALPREC = \"9\"\n LEFT = \"l\"\n RIGHT = \"r\"\n operToks = \"+\" \"-\" \"/\" \"*\" \"^\"\n operPrec = \"2\" \"2\" \"3\" \"3\" \"4\"\n operAssoc = LEFT LEFT LEFT LEFT RIGHT\n}\n\nfunction toInfix(rpn, t, toks, tok, a, ap, b, bp, tp, ta) {\n print \"Postfix: \" rpn\n split(rpn, toks, / +/)\n for (t = 1; t <= length(toks); t++) {\n tok = toks[t]\n if (!isOper(tok)) {\n push(VALPREC tok)\n }\n else {\n b = pop()\n bp = prec(b)\n b = tail(b)\n a = pop()\n ap = prec(a)\n a = tail(a)\n tp = tokPrec(tok)\n ta = tokAssoc(tok)\n if (ap < tp || (ap == tp && ta == RIGHT)) {\n a = \"(\" a \")\"\n }\n if (bp < tp || (bp == tp && ta == LEFT)) {\n b = \"(\" b \")\"\n }\n push(tp a \" \" tok \" \" b)\n }\n print \" \" tok \" -> \" stackToStr()\n }\n return tail(pop())\n}\n\nfunction push(expr) {\n stack[stackPtr] = expr\n stackPtr++\n}\n\nfunction pop() {\n stackPtr--\n return stack[stackPtr]\n}\n\nfunction isOper(tok) {\n return index(operToks, tok) != 0\n}\n\nfunction prec(expr) {\n return substr(expr, 1, 1)\n}\n\nfunction tokPrec(tok) {\n return substr(operPrec, operIdx(tok), 1)\n}\n\nfunction tokAssoc(tok) {\n return substr(operAssoc, operIdx(tok), 1)\n}\n\nfunction operIdx(tok) {\n return index(operToks, tok)\n}\n\nfunction tail(s) {\n return substr(s, 2)\n}\n\nfunction stackToStr( s, i, t, p) {\n s = \"\"\n for (i = 0; i < stackPtr; i++) {\n t = stack[i]\n p = prec(t)\n if (index(t, \" \")) t = \"{\" tail(t) \"}\"\n else t = tail(t)\n s = s \"{\" p \" \" t \"} \"\n }\n return s\n}\n","language":"AWK"},{"code":"#include<stdlib.h>\n#include<string.h>\n#include<stdio.h>\n\nchar** components;\nint counter = 0;\n\ntypedef struct elem{\n\tchar data[10];\n\tstruct elem* left;\n\tstruct elem* right;\n}node;\n\ntypedef node* tree;\n\nint precedenceCheck(char oper1,char oper2){\n\treturn (oper1==oper2)? 0:(oper1=='^')? 1:(oper2=='^')? 2:(oper1=='/')? 1:(oper2=='/')? 2:(oper1=='*')? 1:(oper2=='*')? 2:(oper1=='+')? 1:(oper2=='+')? 2:(oper1=='-')? 1:2;\n}\n\nint isOperator(char c){\n\treturn (c=='+'||c=='-'||c=='*'||c=='/'||c=='^');\n}\n\nvoid inorder(tree t){\n\tif(t!=NULL){\n\t\tif(t->left!=NULL && isOperator(t->left->data[0])==1 && (precedenceCheck(t->data[0],t->left->data[0])==1 || (precedenceCheck(t->data[0],t->left->data[0])==0 && t->data[0]=='^'))){\n\t\t\tprintf(\"(\");\n\t\t\tinorder(t->left);\n\t\t\tprintf(\")\");\n\t\t}\n\t\telse\n\t\t\tinorder(t->left);\n\t\n\t\tprintf(\" %s \",t->data);\n\t\n\t\tif(t->right!=NULL && isOperator(t->right->data[0])==1 && (precedenceCheck(t->data[0],t->right->data[0])==1 || (precedenceCheck(t->data[0],t->right->data[0])==0 && t->data[0]!='^'))){\n\t\t\tprintf(\"(\");\n\t\t\tinorder(t->right);\n\t\t\tprintf(\")\");\n\t\t}\n\t\telse\n\t\t\tinorder(t->right);\n\t}\n}\n\nchar* getNextString(){\n\tif(counter<0){\n\t\tprintf(\"\\nInvalid RPN !\");\n\t\texit(0);\n\t}\n\treturn components[counter--];\n}\n\ntree buildTree(char* obj,char* trace){\n\ttree t = (tree)malloc(sizeof(node));\n\t\n\tstrcpy(t->data,obj);\n\t\n\tt->right = (isOperator(obj[0])==1)?buildTree(getNextString(),trace):NULL;\n\tt->left = (isOperator(obj[0])==1)?buildTree(getNextString(),trace):NULL;\n\t\n\tif(trace!=NULL){\n\t\t\tprintf(\"\\n\");\n\t\t\tinorder(t);\n\t}\n\n\treturn t;\n}\n\nint checkRPN(){\n\tint i, operSum = 0, numberSum = 0;\n\t\n\tif(isOperator(components[counter][0])==0)\n\t\treturn 0;\n\t\n\tfor(i=0;i<=counter;i++)\n\t\t(isOperator(components[i][0])==1)?operSum++:numberSum++;\n\n\treturn (numberSum - operSum == 1);\n}\n\nvoid buildStack(char* str){\n\tint i;\n\tchar* token;\n\t\n\tfor(i=0;str[i]!=00;i++)\n\t\tif(str[i]==' ')\n\t\t\tcounter++;\n\t\t\n\tcomponents = (char**)malloc((counter + 1)*sizeof(char*));\n\t\n\ttoken = strtok(str,\" \");\n\t\n\ti = 0;\n\t\n\twhile(token!=NULL){\n\t\tcomponents[i] = (char*)malloc(strlen(token)*sizeof(char));\n\t\tstrcpy(components[i],token);\n\t\ttoken = strtok(NULL,\" \");\n\t\ti++;\n\t}\n}\n\nint main(int argC,char* argV[]){\n\tint i;\n\ttree t;\n\t\n\tif(argC==1)\n\t\tprintf(\"Usage : %s <RPN expression enclosed by quotes> <optional parameter to trace the build process>\",argV[0]);\n\telse{\n\t\tbuildStack(argV[1]);\n\t\t\n\t\tif(checkRPN()==0){\n\t\t\tprintf(\"\\nInvalid RPN !\");\n\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tt = buildTree(getNextString(),argV[2]);\n\t\t\n\t\tprintf(\"\\nFinal infix expression : \");\n\t\tinorder(t);\n\t}\n\t\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <stack>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\n\nstruct Entry_\n{\n\tstring expr_;\n\tstring op_;\n};\n\nbool PrecedenceLess(const string& lhs, const string& rhs, bool assoc)\n{\n\tstatic const map<string, int> KNOWN({ { \"+\", 1 }, { \"-\", 1 }, { \"*\", 2 }, { \"/\", 2 }, { \"^\", 3 } });\n\tstatic const set<string> ASSOCIATIVE({ \"+\", \"*\" });\n\treturn (KNOWN.count(lhs) ? KNOWN.find(lhs)->second : 0) < (KNOWN.count(rhs) ? KNOWN.find(rhs)->second : 0) + (assoc && !ASSOCIATIVE.count(rhs) ? 1 : 0);\n}\nvoid Parenthesize(Entry_* old, const string& token, bool assoc)\n{\n\tif (!old->op_.empty() && PrecedenceLess(old->op_, token, assoc))\n\t\told->expr_ = '(' + old->expr_ + ')';\n}\n\nvoid AddToken(stack<Entry_>* stack, const string& token)\n{\n\tif (token.find_first_of(\"0123456789\") != string::npos)\n\t\tstack->push(Entry_({ token, string() }));\t// it's a number, no operator\n\telse\n\t{\t// it's an operator\n\t\tif (stack->size() < 2)\n\t\t\tcout<<\"Stack underflow\";\n\t\tauto rhs = stack->top();\n\t\tParenthesize(&rhs, token, false);\n\t\tstack->pop();\n\t\tauto lhs = stack->top();\n\t\tParenthesize(&lhs, token, true);\n\t\tstack->top().expr_ = lhs.expr_ + ' ' + token + ' ' + rhs.expr_;\n\t\tstack->top().op_ = token;\n\t}\n}\n\n\nstring ToInfix(const string& src)\n{\n\tstack<Entry_> stack;\n\tfor (auto start = src.begin(), p = src.begin(); ; ++p)\n\t{\n\t\tif (p == src.end() || *p == ' ')\n\t\t{\n\t\t\tif (p > start)\n\t\t\t\tAddToken(&stack, string(start, p));\n\t\t\tif (p == src.end())\n\t\t\t\tbreak;\n\t\t\tstart = p + 1;\n\t\t}\n\t}\n\tif (stack.size() != 1)\n\t\tcout<<\"Incomplete expression\";\n\treturn stack.top().expr_;\n}\n\nint main(void)\n{\n\ttry\n\t{\n\t\tcout << ToInfix(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\") << \"\\n\";\n\t\tcout << ToInfix(\"1 2 + 3 4 + ^ 5 6 + ^\") << \"\\n\";\n\t\treturn 0;\n\t}\n\tcatch (...)\n\t{\n\t\tcout << \"Failed\\n\";\n\t\treturn -1;\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text.RegularExpressions;\n\nnamespace PostfixToInfix\n{\n class Program\n {\n class Operator\n {\n public Operator(char t, int p, bool i = false)\n {\n Token = t;\n Precedence = p;\n IsRightAssociative = i;\n }\n\n public char Token { get; private set; }\n public int Precedence { get; private set; }\n public bool IsRightAssociative { get; private set; }\n }\n\n static IReadOnlyDictionary<char, Operator> operators = new Dictionary<char, Operator>\n {\n { '+', new Operator('+', 2) },\n { '-', new Operator('-', 2) },\n { '/', new Operator('/', 3) },\n { '*', new Operator('*', 3) },\n { '^', new Operator('^', 4, true) }\n };\n\n class Expression\n {\n public String ex;\n public Operator op;\n\n public Expression(String e)\n {\n ex = e;\n }\n\n public Expression(String e1, String e2, Operator o)\n {\n ex = String.Format(\"{0} {1} {2}\", e1, o.Token, e2);\n op = o;\n }\n }\n\n static String PostfixToInfix(String postfix)\n {\n var stack = new Stack<Expression>();\n\n foreach (var token in Regex.Split(postfix, @\"\\s+\"))\n {\n char c = token[0];\n\n var op = operators.FirstOrDefault(kv => kv.Key == c).Value;\n if (op != null && token.Length == 1)\n {\n Expression rhs = stack.Pop();\n Expression lhs = stack.Pop();\n\n int opPrec = op.Precedence;\n\n int lhsPrec = lhs.op != null ? lhs.op.Precedence : int.MaxValue;\n int rhsPrec = rhs.op != null ? rhs.op.Precedence : int.MaxValue;\n\n if ((lhsPrec < opPrec || (lhsPrec == opPrec && c == '^')))\n lhs.ex = '(' + lhs.ex + ')';\n\n if ((rhsPrec < opPrec || (rhsPrec == opPrec && c != '^')))\n rhs.ex = '(' + rhs.ex + ')';\n\n stack.Push(new Expression(lhs.ex, rhs.ex, op));\n }\n else\n {\n stack.Push(new Expression(token));\n }\n\n // print intermediate result\n Console.WriteLine(\"{0} -> [{1}]\", token,\n string.Join(\", \", stack.Reverse().Select(e => e.ex)));\n }\n return stack.Peek().ex;\n }\n\n static void Main(string[] args)\n {\n string[] inputs = { \"3 4 2 * 1 5 - 2 3 ^ ^ / +\", \"1 2 + 3 4 + ^ 5 6 + ^\" };\n foreach (var e in inputs)\n {\n Console.WriteLine(\"Postfix : {0}\", e);\n Console.WriteLine(\"Infix : {0}\", PostfixToInfix(e));\n Console.WriteLine(); ;\n }\n Console.ReadLine();\n }\n }\n}\n","language":"C-sharp"},{"code":";;;; Parsing/RPN to infix conversion\n(defstruct (node (:print-function print-node)) opr infix)\n(defun print-node (node stream depth)\n (format stream \"opr:=~A infix:=\\\"~A\\\"\" (node-opr node) (node-infix node)))\n\n(defconstant OPERATORS '((#\\^ . 4) (#\\* . 3) (#\\/ . 3) (#\\+ . 2) (#\\- . 2)))\n\n;;; (char,char[,boolean])->boolean\n(defun higher-p (opp opc &optional (left-node-p nil))\n (or (> (cdr (assoc opp OPERATORS)) (cdr (assoc opc OPERATORS)))\n (and left-node-p (char= opp #\\^) (char= opc #\\^))))\n\n;;; string->list\n(defun string-split (expr)\n (let ((p (position #\\Space expr)))\n (if (null p) (list expr)\n (append (list (subseq expr 0 p))\n (string-split (subseq expr (1+ p)))))))\n\n;;; string->string\n(defun parse (expr)\n (let ((stack '()))\n (format t \"TOKEN STACK~%\")\n (dolist (tok (string-split expr))\n (if (assoc (char tok 0) OPERATORS) ; operator?\n (push (make-node :opr (char tok 0) :infix (infix (char tok 0) (pop stack) (pop stack))) stack)\n (push tok stack))\n\n ;; print stack at each token\n (format t \"~3,A\" tok)\n (dotimes (i (length stack)) (format t \"~8,T[~D] ~A~%\" i (nth i stack))))\n\n ;; print final infix expression\n (if (= (length stack) 1)\n (format nil \"~A\" (node-infix (first stack)))\n (format nil \"syntax error in ~A\" expr))))\n\n;;; (char,node,node)->string\n(defun infix (operator rightn leftn)\n\n ;; (char,node[,boolean]->string\n (defun string-node (operator anode &optional (left-node-p nil))\n (if (stringp anode) anode\n (if (higher-p operator (node-opr anode) left-node-p)\n (format nil \"( ~A )\" (node-infix anode)) (node-infix anode))))\n\n (concatenate 'string\n (string-node operator leftn t)\n (format nil \" ~A \" operator)\n (string-node operator rightn)))\n\n;;; nil->[printed infix expressions]\n(defun main ()\n (let ((expressions '(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\n \"1 2 + 3 4 + ^ 5 6 + ^\"\n \"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\")))\n (dolist (expr expressions)\n (format t \"~%Parsing:\\\"~A\\\"~%\" expr)\n (format t \"RPN:\\\"~A\\\" INFIX:\\\"~A\\\"~%\" expr (parse expr)))))\n","language":"Common-Lisp"},{"code":"import std.stdio, std.string, std.array;\n\nvoid parseRPN(in string e) {\n enum nPrec = 9;\n static struct Info { int prec; bool rAssoc; }\n immutable /*static*/ opa = [\"^\": Info(4, true),\n \"*\": Info(3, false),\n \"/\": Info(3, false),\n \"+\": Info(2, false),\n \"-\": Info(2, false)];\n\n writeln(\"\\nPostfix input: \", e);\n static struct Sf { int prec; string expr; }\n Sf[] stack;\n foreach (immutable tok; e.split()) {\n writeln(\"Token: \", tok);\n if (tok in opa) {\n immutable op = opa[tok];\n immutable rhs = stack.back;\n stack.popBack();\n auto lhs = &stack.back;\n if (lhs.prec < op.prec ||\n (lhs.prec == op.prec && op.rAssoc))\n lhs.expr = \"(\" ~ lhs.expr ~ \")\";\n lhs.expr ~= \" \" ~ tok ~ \" \";\n lhs.expr ~= (rhs.prec < op.prec ||\n (rhs.prec == op.prec && !op.rAssoc)) ?\n \"(\" ~ rhs.expr ~ \")\" :\n rhs.expr;\n lhs.prec = op.prec;\n } else\n stack ~= Sf(nPrec, tok);\n foreach (immutable f; stack)\n writefln(` %d \"%s\"`, f.prec, f.expr);\n }\n writeln(\"Infix result: \", stack[0].expr);\n}\n\nvoid main() {\n foreach (immutable test; [\"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\"])\n parseRPN(test);\n}\n","language":"D"},{"code":"import std.stdio, std.string, std.array, std.algorithm;\n\nvoid rpmToInfix(in string str) @safe {\n static struct Exp { int p; string e; }\n immutable P = (in Exp pair, in int prec) pure =>\n pair.p < prec ? format(\"( %s )\", pair.e) : pair.e;\n immutable F = (in string[] s...) pure nothrow => s.join(' ');\n\n writefln(\"=================\\n%s\", str);\n Exp[] stack;\n foreach (const w; str.split) {\n if (w.isNumeric)\n stack ~= Exp(9, w);\n else {\n const y = stack.back; stack.popBack;\n const x = stack.back; stack.popBack;\n switch (w) {\n case \"^\": stack ~= Exp(4, F(P(x, 5), w, P(y, 4)));\n break;\n case \"*\", \"/\": stack ~= Exp(3, F(P(x, 3), w, P(y, 3)));\n break;\n case \"+\", \"-\": stack ~= Exp(2, F(P(x, 2), w, P(y, 2)));\n break;\n default: throw new Error(\"Wrong part: \" ~ w);\n }\n }\n stack.map!q{ a.e }.writeln;\n }\n writeln(\"-----------------\\n\", stack.back.e);\n}\n\nvoid main() {\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\".rpmToInfix;\n \"1 2 + 3 4 + ^ 5 6 + ^\".rpmToInfix;\n}\n","language":"D"},{"code":"(require 'hash)\n(string-delimiter \"\")\n\n(define (^ a b ) (expt a b)) ;; add this not-native function\n(define-syntax-rule (r-assoc? op) (= op \"^\"))\n(define-syntax-rule (l-assoc? op) (not ( = op \"^\" )))\n(define PRECEDENCES (list->hash\n\t'((\"+\" . 2) (\"-\" . 2) (\"*\" . 3) (\"/\" . 3) (\"//\" . 3) (\"^\" . 4))\n\t(make-hash)))\n\n;; RPN vector or list -> infix tree -> (a op (b op c) d) ..\n(define (rpn->infix rpn)\n(define S (stack 'S))\n\t(for ((token rpn))\n\t(if (procedure? token)\n\t\t(let [(op2 (pop S)) (op1 (pop S))]\n\t\t\t(unless (and op1 op2) (error \"cannot translate expression\" rpn))\n\t \t(push S (list op1 token op2))\n\t \t)\n\t (push S token ))\n\t(writeln 'token (string token) 'stack (stack->list S)))\n\t(begin0\n\t\t(pop S) ;; return (top S)\n\t\t(unless (stack-empty? S) (error \"ill-formed rpn\" rpn)))\n\t)\n\t\n;; a node tree is (left op right) or a number\n(define-syntax-id _.left (first _)) ; mynode.left expands to (first mynode)\n(define-syntax-id _.right (third _))\n(define-syntax-id _.op (string (second _ )))\n(define-syntax-rule (precedence node) (hash-ref PRECEDENCES (string (second node))))\n\n(define (left-par? node) ; does lhs needs ( lhs ) ?\n\t(cond\n\t[(number? node.left) #f]\n\t[(< (precedence node.left) (precedence node)) #t]\n\t[(and\n\t\t \t(r-assoc? node.op)\n\t\t \t(= (precedence node.left) (precedence node))) #t]\n\t[else #f]))\n\t\n(define (right-par? node)\n\t(cond\n\t[(number? node.right) #f]\n\t[(< (precedence node.right) (precedence node)) #t]\n\t[(and\n\t\t \t(l-assoc? node.op)\n\t\t \t(= (precedence node.right) (precedence node))) #t]\n\t[else #f]))\n\t\n;; infix tree -> char string\n(define (infix->string node)\n\t(cond\n\t[(number? node) (string node)]\n\t[else (let\n\t\t[(lhs (infix->string node.left))\n\t\t(rhs (infix->string node.right))]\n\t\t(when (left-par? node) (set! lhs (string-append \"(\" lhs \")\")))\n\t\t(when (right-par? node) (set! rhs (string-append \"(\" rhs \")\")))\n\t\t(string-append lhs \" \" node.op \" \" rhs))]))\n","language":"EchoLisp"},{"code":"type ast =\n | Num of int\n | Add of ast * ast | Sub of ast * ast\n | Mul of ast * ast | Div of ast * ast\n | Exp of ast * ast\n\nlet (|Int|_|) = System.Int32.TryParse >> function | (true, v) -> Some(v) | (false, _) -> None\n\nlet rec parse =\n function\n | [] -> failwith \"Not enough tokens\"\n | (Int head)::tail -> (Num(head), tail)\n | op::tail ->\n let (left, rest1) = parse tail\n let (right, rest2) = parse rest1\n match op with\n | \"+\" -> (Add (right, left)), rest2\n | \"-\" -> (Sub (right, left)), rest2\n | \"*\" -> (Mul (right, left)), rest2\n | \"/\" -> (Div (right, left)), rest2\n | \"^\" -> (Exp (right, left)), rest2\n | _ -> failwith (\"unknown op: \" + op)\n\nlet rec infix p x =\n let brackets (x : ast) = seq { yield \"(\"; yield! infix 0 x; yield \")\" }\n let left op context l r = seq { yield! infix context l; yield op; yield! infix context r }\n let right op context l r = seq { yield! brackets l; yield op; yield! infix context r }\n seq {\n match x with\n | Num (n) -> yield n.ToString()\n | Add (l, r) when p <= 2 -> yield! left \"+\" 2 l r\n | Sub (l, r) when p <= 2 -> yield! left \"-\" 2 l r\n | Mul (l, r) when p <= 3 -> yield! left \"*\" 3 l r\n | Div (l, r) when p <= 3 -> yield! left \"/\" 3 l r\n | Exp (Exp(ll, lr), r) -> yield! right \"^\" 4 (Exp(ll,lr)) r\n | Exp (l, r) -> yield! left \"^\" 4 l r\n | _ -> yield! brackets x\n }\n\n[<EntryPoint>]\nlet main argv =\n let (tree, rest) =\n argv |> Array.rev |> Seq.toList |> parse\n match rest with\n | [] -> printfn \"%A\" tree\n | _ -> failwith (\"not a valid RPN expression (excess tokens): \" + System.String.Join(\" \", argv))\n Seq.iter (printf \" %s\") (infix 0 tree); printfn \"\"\n 0\n","language":"F-Sharp"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nvar tests = []string{\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\",\n}\n\nvar opa = map[string]struct {\n prec int\n rAssoc bool\n}{\n \"^\": {4, true},\n \"*\": {3, false},\n \"/\": {3, false},\n \"+\": {2, false},\n \"-\": {2, false},\n}\n\nconst nPrec = 9\n\nfunc main() {\n for _, t := range tests {\n parseRPN(t)\n }\n}\n\nfunc parseRPN(e string) {\n fmt.Println(\"\\npostfix:\", e)\n type sf struct {\n prec int\n expr string\n }\n var stack []sf\n for _, tok := range strings.Fields(e) {\n fmt.Println(\"token:\", tok)\n if op, isOp := opa[tok]; isOp {\n rhs := &stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n lhs := &stack[len(stack)-1]\n if lhs.prec < op.prec || (lhs.prec == op.prec && op.rAssoc) {\n lhs.expr = \"(\" + lhs.expr + \")\"\n }\n lhs.expr += \" \" + tok + \" \"\n if rhs.prec < op.prec || (rhs.prec == op.prec && !op.rAssoc) {\n lhs.expr += \"(\" + rhs.expr + \")\"\n } else {\n lhs.expr += rhs.expr\n }\n lhs.prec = op.prec\n } else {\n stack = append(stack, sf{nPrec, tok})\n }\n for _, f := range stack {\n fmt.Printf(\" %d %q\\n\", f.prec, f.expr)\n }\n }\n fmt.Println(\"infix:\", stack[0].expr)\n}\n","language":"Go"},{"code":"class PostfixToInfix {\n static class Expression {\n final static String ops = \"-+/*^\"\n\n String op, ex\n int precedence = 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 precedence = (ops.indexOf(o) / 2) as int\n }\n\n @Override\n String toString() {\n return ex\n }\n }\n\n static String postfixToInfix(final String postfix) {\n Stack<Expression> expr = new Stack<>()\n\n for (String token in postfix.split(\"\\\\s+\")) {\n char c = token.charAt(0)\n int idx = Expression.ops.indexOf(c as int)\n if (idx != -1 && token.length() == 1) {\n\n Expression r = expr.pop()\n Expression l = expr.pop()\n\n int opPrecedence = (idx / 2) as int\n\n if (l.precedence < opPrecedence || (l.precedence == opPrecedence && c == '^' as char))\n l.ex = '(' + l.ex + ')'\n\n if (r.precedence < opPrecedence || (r.precedence == opPrecedence && c != '^' as char))\n r.ex = '(' + r.ex + ')'\n\n expr << new Expression(l.ex, r.ex, token)\n } else {\n expr << new Expression(token)\n }\n printf \"%s -> %s%n\", token, expr\n }\n expr.peek().ex\n }\n\n static void main(String[] args) {\n ([\"3 4 2 * 1 5 - 2 3 ^ ^ / +\", \"1 2 + 3 4 + ^ 5 6 + ^\"]).each { String e ->\n printf \"Postfix : %s%n\", e\n printf \"Infix : %s%n\", postfixToInfix(e)\n println()\n }\n }\n}\n","language":"Groovy"},{"code":"import Debug.Trace\n\ndata Expression = Const String | Exp Expression String Expression\n\n------------- INFIX EXPRESSION FROM RPN STRING -----------\n\ninfixFromRPN :: String -> Expression\ninfixFromRPN = head . foldl buildExp [] . words\n\nbuildExp :: [Expression] -> String -> [Expression]\nbuildExp stack x\n | (not . isOp) x =\n let v = Const x : stack\n in trace (show v) v\n | otherwise =\n let v = Exp l x r : rest\n in trace (show v) v\n where\n r : l : rest = stack\n isOp = (`elem` [\"^\", \"*\", \"/\", \"+\", \"-\"])\n\n\n--------------------------- TEST -------------------------\nmain :: IO ()\nmain =\n mapM_\n ( \\s ->\n putStr (s <> \"\\n-->\\n\")\n >> (print . infixFromRPN)\n s\n >> putStrLn []\n )\n [ \"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\",\n \"1 4 + 5 3 + 2 3 * * *\",\n \"1 2 * 3 4 * *\",\n \"1 2 + 3 4 + +\"\n ]\n\n---------------------- SHOW INSTANCE ---------------------\ninstance Show Expression where\n show (Const x) = x\n show exp@(Exp l op r) = left <> \" \" <> op <> \" \" <> right\n where\n left\n | leftNeedParen = \"( \" <> show l <> \" )\"\n | otherwise = show l\n right\n | rightNeedParen = \"( \" <> show r <> \" )\"\n | otherwise = show r\n leftNeedParen =\n (leftPrec < opPrec)\n || ((leftPrec == opPrec) && rightAssoc exp)\n rightNeedParen =\n (rightPrec < opPrec)\n || ((rightPrec == opPrec) && leftAssoc exp)\n leftPrec = precedence l\n rightPrec = precedence r\n opPrec = precedence exp\n\nleftAssoc :: Expression -> Bool\nleftAssoc (Const _) = False\nleftAssoc (Exp _ op _) = op `notElem` [\"^\", \"*\", \"+\"]\n\nrightAssoc :: Expression -> Bool\nrightAssoc (Const _) = False\nrightAssoc (Exp _ op _) = op == \"^\"\n\nprecedence :: Expression -> Int\nprecedence (Const _) = 5\nprecedence (Exp _ op _)\n | op == \"^\" = 4\n | op `elem` [\"*\", \"/\"] = 3\n | op `elem` [\"+\", \"-\"] = 2\n | otherwise = 0\n","language":"Haskell"},{"code":"procedure main()\nevery rpn := ![\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\", # reqd\n \"1 2 + 3 4 + 5 6 + ^ ^\",\n \"1 2 + 3 4 + 5 6 + ^ ^\",\n \"1 2 + 3 4 + ^ 5 6 + ^\" # reqd\n ] do {\n printf(\"\\nRPN = %i\\n\",rpn)\n printf(\"infix = %i\\n\",RPN2Infix(rpn,show))\n show := 1 # turn off inner working display\n }\nend\n\nlink printf\n\nprocedure RPN2Infix(expr,show) #: RPN to Infix conversion\nstatic oi\ninitial {\n oi := table([9,\"'\"]) # precedence & associativity\n every oi[!\"+-\"] := [2,\"l\"] # 2L\n every oi[!\"*/\"] := [3,\"l\"] # 3L\n oi[\"^\"] := [4,\"r\"] # 4R\n }\n\n show := if /show then printf else 1 # to show inner workings or not\n stack := []\n expr ? until pos(0) do { # Reformat as a tree\n tab(many(' ')) # consume previous seperator\n token := tab(upto(' ')|0) # get token\n if token := numeric(token) then { # ... numeric\n push(stack,oi[token]|||[token])\n show(\"pushed numeric %i : %s\\n\",token,list2string(stack))\n }\n else { # ... operator\n every b|a := pop(stack) # pop & reverse operands\n pr := oi[token,1]\n as := oi[token,2]\n if a[1] < pr | (a[1] = pr & oi[token,2] == \"r\") then\n a[3] := sprintf(\"( %s )\",a[3])\n if b[1] < pr | (b[1] == pr & oi[token,2] == \"l\") then\n b[3] := sprintf(\"( %s )\",b[3])\n s := sprintf(\"%s %s %s\",a[3],token,b[3])\n push(stack,[pr,as,s]) # stack [prec, assoc, expr]\n show(\"applied operator %s : %s\\n\",token,list2string(stack))\n }\n }\n\n if *stack ~= 1 then stop(\"Parser failure\")\n return stack[1,3]\nend\n\nprocedure list2string(L) #: format list as a string\n s := \"[ \"\n every x := !L do\n s ||:= ( if type(x) == \"list\" then list2string(x)\n else x) || \" \"\n return s || \"]\"\nend\n","language":"Icon"},{"code":"tokenize=: ' ' <;._1@, deb\n\nops=: ;:'+ - * / ^'\ndoOp=: plus`minus`times`divide`exponent`push@.(ops&i.)\nparse=:3 :0\n stack=: i.0 2\n for_token.tokenize y do.doOp token end.\n 1{:: ,stack\n)\n\nparens=:4 :0\n if. y do. '( ',x,' )' else. x end.\n)\n\nNB. m: precedence, n: is right associative, y: token\nop=:2 :0\n L=. m - n\n R=. m - -.n\n smoutput;'operation: ';y\n 'Lprec left Rprec right'=. ,_2{.stack\n expr=. ;(left parens L > Lprec);' ';y,' ';right parens R > Rprec\n stack=: (_2}.stack),m;expr\n smoutput stack\n)\n\nplus=: 2 op 0\nminus=: 2 op 0\ntimes=: 3 op 0\ndivide=: 3 op 0\nexponent=: 4 op 1\n\npush=:3 :0\n smoutput;'pushing: ';y\n stack=: stack,_;y\n smoutput stack\n)\n","language":"J"},{"code":" parse '3 4 2 * 1 5 - 2 3 ^ ^ / +'\npushing: 3\n+-+-+\n|_|3|\n+-+-+\npushing: 4\n+-+-+\n|_|3|\n+-+-+\n|_|4|\n+-+-+\npushing: 2\n+-+-+\n|_|3|\n+-+-+\n|_|4|\n+-+-+\n|_|2|\n+-+-+\noperation: *\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\npushing: 1\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|_|1 |\n+-+-----+\npushing: 5\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|_|1 |\n+-+-----+\n|_|5 |\n+-+-----+\noperation: -\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|2|1 - 5|\n+-+-----+\npushing: 2\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|2|1 - 5|\n+-+-----+\n|_|2 |\n+-+-----+\npushing: 3\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|2|1 - 5|\n+-+-----+\n|_|2 |\n+-+-----+\n|_|3 |\n+-+-----+\noperation: ^\n+-+-----+\n|_|3 |\n+-+-----+\n|3|4 * 2|\n+-+-----+\n|2|1 - 5|\n+-+-----+\n|4|2 ^ 3|\n+-+-----+\noperation: ^\n+-+-----------------+\n|_|3 |\n+-+-----------------+\n|3|4 * 2 |\n+-+-----------------+\n|4|( 1 - 5 ) ^ 2 ^ 3|\n+-+-----------------+\noperation: /\n+-+-------------------------+\n|_|3 |\n+-+-------------------------+\n|3|4 * 2 / ( 1 - 5 ) ^ 2 ^ 3|\n+-+-------------------------+\noperation: +\n+-+-----------------------------+\n|2|3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3|\n+-+-----------------------------+\n3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\n","language":"J"},{"code":"import java.util.Stack;\n\npublic class PostfixToInfix {\n\n public static void main(String[] args) {\n for (String e : new String[]{\"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\"}) {\n System.out.printf(\"Postfix : %s%n\", e);\n System.out.printf(\"Infix : %s%n\", postfixToInfix(e));\n System.out.println();\n }\n }\n\n static String postfixToInfix(final String postfix) {\n\n class Expression {\n final static String ops = \"-+/*^\";\n\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 @Override\n public String toString() {\n return ex;\n }\n }\n\n Stack<Expression> expr = new Stack<>();\n\n for (String token : postfix.split(\"\\\\s+\")) {\n char c = token.charAt(0);\n int idx = Expression.ops.indexOf(c);\n if (idx != -1 && token.length() == 1) {\n\n Expression r = expr.pop();\n Expression l = expr.pop();\n\n int opPrec = idx / 2;\n\n if (l.prec < opPrec || (l.prec == opPrec && c == '^'))\n l.ex = '(' + l.ex + ')';\n\n if (r.prec < opPrec || (r.prec == opPrec && c != '^'))\n r.ex = '(' + r.ex + ')';\n\n expr.push(new Expression(l.ex, r.ex, token));\n } else {\n expr.push(new Expression(token));\n }\n System.out.printf(\"%s -> %s%n\", token, expr);\n }\n return expr.peek().ex;\n }\n}\n","language":"Java"},{"code":"const Associativity = {\n /** a / b / c = (a / b) / c */\n left: 0,\n /** a ^ b ^ c = a ^ (b ^ c) */\n right: 1,\n /** a + b + c = (a + b) + c = a + (b + c) */\n both: 2,\n};\nconst operators = {\n '+': { precedence: 2, associativity: Associativity.both },\n '-': { precedence: 2, associativity: Associativity.left },\n '*': { precedence: 3, associativity: Associativity.both },\n '/': { precedence: 3, associativity: Associativity.left },\n '^': { precedence: 4, associativity: Associativity.right },\n};\nclass NumberNode {\n constructor(text) { this.text = text; }\n toString() { return this.text; }\n}\nclass InfixNode {\n constructor(fnname, operands) {\n this.fnname = fnname;\n this.operands = operands;\n }\n toString(parentPrecedence = 0) {\n const op = operators[this.fnname];\n const leftAdd = op.associativity === Associativity.right ? 0.01 : 0;\n const rightAdd = op.associativity === Associativity.left ? 0.01 : 0;\n if (this.operands.length !== 2) throw Error(\"invalid operand count\");\n const result = this.operands[0].toString(op.precedence + leftAdd)\n +` ${this.fnname} ${this.operands[1].toString(op.precedence + rightAdd)}`;\n if (parentPrecedence > op.precedence) return `( ${result} )`;\n else return result;\n }\n}\nfunction rpnToTree(tokens) {\n const stack = [];\n console.log(`input = ${tokens}`);\n for (const token of tokens.split(\" \")) {\n if (token in operators) {\n const op = operators[token], arity = 2; // all of these operators take 2 arguments\n if (stack.length < arity) throw Error(\"stack error\");\n stack.push(new InfixNode(token, stack.splice(stack.length - arity)));\n }\n else stack.push(new NumberNode(token));\n console.log(`read ${token}, stack = [${stack.join(\", \")}]`);\n }\n if (stack.length !== 1) throw Error(\"stack error \" + stack);\n return stack[0];\n}\nconst tests = [\n [\"3 4 2 * 1 5 - 2 3 ^ ^ / +\", \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"],\n [\"1 2 + 3 4 + ^ 5 6 + ^\", \"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\"],\n [\"1 2 3 + +\", \"1 + 2 + 3\"] // test associativity (1+(2+3)) == (1+2+3)\n];\nfor (const [inp, oup] of tests) {\n const realOup = rpnToTree(inp).toString();\n console.log(realOup === oup ? \"Correct!\" : \"Incorrect!\");\n}\n","language":"JavaScript"},{"code":"### PEG infrastructure\ndef box(E):\n ((.result = null) | E) as $e\n | .remainder = $e.remainder\n | .result += [$e.result] # the magic sauce\n ;\n\n### Tokenize the RPN string.\n# Input: a string representing an expression using RPN.\n# Output: an array of corresponding tokens.\ndef tokens:\n [splits(\"[ \\n\\r\\t]+\")]\n | map(select(. != \"\")\n | . as $in\n | try tonumber catch $in);\n\n### Parse the reversed array of tokens as produced by `tokens`.\n# On entry, .remainder should be the reversed array.\n# Output: {remainder, result}\ndef rrpn:\n def found: .result += [.remainder[0]] | (.remainder |= .[1:]);\n def nonempty: select(.remainder|length>0);\n def check(predicate):\n nonempty | select(.remainder[0] | predicate);\n\n def recognize(predicate): check(predicate) | found;\n\n def number : recognize(type==\"number\");\n def operator: recognize(type==\"string\");\n def operand : number // rrpn;\n box(operator | operand | operand);\n\n# Input: an array of tokens as produced by `tokens`\n# Output: the infix equivalent expressed as a string.\ndef tokens2infix:\n def infix:\n if type != \"array\" then .\n elif length == 1 then .[0] | infix\n elif length == 3 then \"(\\(.[2] | infix) \\(.[0]) \\(.[1] | infix))\"\n else error\n end;\n\n {remainder: reverse} | rrpn | .result | infix;\n\n# Input: an RPN string\n# Output: the equivalent expression as a string using infix notation\ndef rpn2infix: tokens | tokens2infix;\n\ndef tests:\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\"\n;\n\ntests | \"\\\"\\(.)\\\" =>\", rpn2infix, \"\"\n","language":"Jq"},{"code":"function parseRPNstring(rpns)\n infix = []\n rpn = split(rpns)\n for tok in rpn\n if all(isnumber, tok)\n push!(infix, parse(Int, tok))\n else\n last = pop!(infix)\n prev = pop!(infix)\n push!(infix, Expr(:call, Symbol(tok), prev, last))\n println(\"Current step: $infix\")\n end\n end\n infix\nend\n\nunany(s) = replace(string(s), r\"Any\\[:\\((.+)\\)\\]\", s\"\\1\")\n\nprintln(\"The final infix result: \", parseRPNstring(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\") |> unany, \"\\n\")\nprintln(\"The final infix result: \", parseRPNstring(\"1 2 + 3 4 + ^ 5 6 + ^\") |> unany)\n","language":"Julia"},{"code":"// version 1.2.0\n\nimport java.util.Stack\n\nclass Expression(var ex: String, val op: String = \"\", val prec: Int = 3) {\n\n constructor(e1: String, e2: String, o: String) :\n this(\"$e1 $o $e2\", o, OPS.indexOf(o) / 2)\n\n override fun toString() = ex\n\n companion object {\n const val OPS = \"-+/*^\"\n }\n}\n\nfun postfixToInfix(postfix: String): String {\n val expr = Stack<Expression>()\n val rx = Regex(\"\"\"\\s+\"\"\")\n for (token in postfix.split(rx)) {\n val c = token[0]\n val idx = Expression.OPS.indexOf(c)\n if (idx != -1 && token.length == 1) {\n val r = expr.pop()\n val l = expr.pop()\n val opPrec = idx / 2\n if (l.prec < opPrec || (l.prec == opPrec && c == '^')) {\n l.ex = \"(${l.ex})\"\n }\n if (r.prec < opPrec || (r.prec == opPrec && c != '^')) {\n r.ex = \"(${r.ex})\"\n }\n expr.push(Expression(l.ex, r.ex, token))\n }\n else {\n expr.push(Expression(token))\n }\n println(\"$token -> $expr\")\n }\n return expr.peek().ex\n}\n\nfun main(args: Array<String>) {\n val es = listOf(\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\"\n )\n for (e in es) {\n println(\"Postfix : $e\")\n println(\"Infix : ${postfixToInfix(e)}\\n\")\n }\n}\n","language":"Kotlin"},{"code":"function tokenize(rpn)\n local out = {}\n local cnt = 0\n for word in rpn:gmatch(\"%S+\") do\n table.insert(out, word)\n cnt = cnt + 1\n end\n return {tokens = out, pos = 1, size = cnt}\nend\n\nfunction advance(lex)\n if lex.pos <= lex.size then\n lex.pos = lex.pos + 1\n return true\n else\n return false\n end\nend\n\nfunction current(lex)\n return lex.tokens[lex.pos]\nend\n\nfunction isOperator(sym)\n return sym == '+' or sym == '-'\n or sym == '*' or sym == '/'\n or sym == '^'\nend\n\nfunction buildTree(lex)\n local stack = {}\n\n while lex.pos <= lex.size do\n local sym = current(lex)\n advance(lex)\n\n if isOperator(sym) then\n local b = table.remove(stack)\n local a = table.remove(stack)\n\n local t = {op=sym, left=a, right=b}\n table.insert(stack, t)\n else\n table.insert(stack, sym)\n end\n end\n\n return table.remove(stack)\nend\n\nfunction infix(tree)\n if type(tree) == \"table\" then\n local a = {}\n local b = {}\n\n if type(tree.left) == \"table\" then\n a = '(' .. infix(tree.left) .. ')'\n else\n a = tree.left\n end\n\n if type(tree.right) == \"table\" then\n b = '(' .. infix(tree.right) .. ')'\n else\n b = tree.right\n end\n\n return a .. ' ' .. tree.op .. ' ' .. b\n else\n return tree\n end\nend\n\nfunction convert(str)\n local lex = tokenize(str)\n local tree = buildTree(lex)\n print(infix(tree))\nend\n\nfunction main()\n convert(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n convert(\"1 2 + 3 4 + ^ 5 6 + ^\")\nend\n\nmain()\n","language":"Lua"},{"code":"Module Rpn_2_Infix {\n\tRem Form 80,60\n\tfunction rpn_to_infix$(a$) {\n\t\tdef m=0\n\t\tinventory precendence=\"-\":=2,\"+\":=2,\"*\":=3,\"/\":=3,\"^\":=4\n\t\tdim token$()\n\t\ttoken$()=piece$(a$,\" \")\n\t\tl=len(token$())\n\t\tdim type(l)=0, right(l)=0, infix$(l)\n\t\tinfix=-1\n\t\tfor i=0 to l-1\n\t\t\tif exist(precendence, token$(i)) then\n\t\t\t\ttype(i)=precendence(token$(i))\n\t\t\t\tif type(i)=4 then right(i)=-1\n\t\t\tend if\n\t\t\tif type(i)=0 then\n\t\t\t\tinfix++\n\t\t\t\tinfix$(infix)=token$(i)\n\t\t\t\ttype(infix)=100\n\t\t\telse\n\t\t\t\tif right(i) then\n\t\t\t\t\tif type(infix)<type(i) then infix$(infix)=\"(\"+infix$(infix)+\")\"\n\t\t\t\t\tif type(infix-1)<100 then infix$(infix-1)=\"(\"+infix$(infix-1)+\")\"\n\t\t\t\t\tinfix$(infix-1)=infix$(infix-1)+token$(i)+infix$(infix)\n\t\t\t\telse\n\t\t\t\t\tif type(infix)<type(i) then infix$(infix)=\"(\"+infix$(infix)+\")\"\n\t\t\t\t\tif type(infix-1)<type(i) then\n\t\t\t\t\t\tinfix$(infix-1)=\"(\"+infix$(infix-1)+\")\"+token$(i)+infix$(infix)\n\t\t\t\t\telse\n\t\t\t\t\t\tinfix$(infix-1)=infix$(infix-1)+token$(i)+infix$(infix)\n\t\t\t\t\tend if\n\t\t\t\tend if\n\t\t\t\ttype(infix-1)=type(i)\n\t\t\t\tinfix--\n\t\t\tend if\n\t\t\tinf=each(infix$(),1, infix+1)\n\t\t\twhile inf\n\t\t\t\texport$<=token$(i)+\" [\"+str$(inf^,\"\")+\"] \"+ array$(inf)+{\n\t\t\t\t}\n\t\t\t\ttoken$(i)=\" \"\n\t\t\tend while\n\t\tnext i\n\t\t=infix$(0)\n\t}\n\tGlobal export$\n\tdocument export$\n\texample1=rpn_to_infix$(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")=\"3+4*2/(1-5)^2^3\"\n\texample2=rpn_to_infix$(\"1 2 + 3 4 + ^ 5 6 + ^\")=\"((1+2)^(3+4))^(5+6)\"\n\t\\\\ a test from Phix example\n\texample3=rpn_to_infix$(\"moon stars mud + * fire soup * ^\")=\"(moon*(stars+mud))^(fire*soup)\"\n\tPrint example1, example2, example3\n\tRem Print #-2, Export$\n\tClipBoard Export$\n\n}\nRpn_2_Infix\n","language":"M2000-Interpreter"},{"code":"import tables, strutils\n\nconst nPrec = 9\n\nlet ops: Table[string, tuple[prec: int, rAssoc: bool]] =\n { \"^\": (4, true)\n , \"*\": (3, false)\n , \"/\": (3, false)\n , \"+\": (2, false)\n , \"-\": (2, false)\n }.toTable\n\nproc parseRPN(e: string) =\n echo \"postfix: \", e\n var stack = newSeq[tuple[prec: int, expr: string]]()\n\n for tok in e.split:\n echo \"Token: \", tok\n if ops.hasKey tok:\n let op = ops[tok]\n let rhs = stack.pop\n var lhs = stack.pop\n\n if lhs.prec < op.prec or (lhs.prec == op.prec and op.rAssoc):\n lhs.expr = \"(\" & lhs.expr & \")\"\n\n lhs.expr.add \" \" & tok & \" \"\n\n if rhs.prec < op.prec or (rhs.prec == op.prec and not op.rAssoc):\n lhs.expr.add \"(\" & rhs.expr & \")\"\n else:\n lhs.expr.add rhs.expr\n\n lhs.prec = op.prec\n stack.add lhs\n else:\n stack.add((nPrec, tok))\n\n for f in stack:\n echo \" \", f.prec, \" \", f.expr\n\n echo \"infix: \", stack[0].expr\n\nfor test in [\"3 4 2 * 1 5 - 2 3 ^ ^ / +\", \"1 2 + 3 4 + ^ 5 6 + ^\"]:\n test.parseRPN\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nmy $number = '[+-/$]?(?:\\.\\d+|\\d+(?:\\.\\d*)?)';\nmy $operator = '[-+*/^]';\n\nmy @tests = ('1 2 + 3 4 + ^ 5 6 + ^', '3 4 2 * 1 5 - 2 3 ^ ^ / +');\n\nfor (@tests) {\n my(@elems,$n);\n $n = -1;\n while (\n s/\n \\s* (?<left>$number) # 1st operand (will be 'left' in infix)\n \\s+ (?<right>$number) # 2nd operand (will be 'right' in infix)\n \\s+ (?<op>$operator) # operator\n (?:\\s+|$) # more to parse, or done?\n /\n ' '.('$'.++$n).' ' # placeholders\n /ex) {\n $elems[$n] = \"($+{left}$+{op}$+{right})\" # infix expression\n }\n while (\n s/ (\\$)(\\d+) # for each placeholder\n / $elems[$2] # evaluate expression, substitute numeric value\n /ex\n ) { say } # track progress\n say '=>' . substr($_,2,-2).\"\\n\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">operators</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"/\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">precedence</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">rassoc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">'r'</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'l'</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'l'</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">expr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">ops</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">expr</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">lhs</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rhs</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">lprec</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rprec</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Postfix input: %-32s%s\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">expr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">show_workings</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"error\"</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">op</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">operators</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"error\"</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">rprec</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rhs</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[$];</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">lprec</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lhs</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[$]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">prec</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">precedence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">assoc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rassoc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lprec</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">prec</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">lprec</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">prec</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">assoc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'r'</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">lhs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"(\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">lhs</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\")\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rprec</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">prec</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rprec</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">prec</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">assoc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">'l'</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">rhs</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"(\"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">rhs</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\")\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">prec</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">lhs</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">rhs</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">?{</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Infix result: %s [%s]\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">expected</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"ok\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"**ERROR**\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 + 3 4 + ^ 5 6 + ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"((1 + 2) ^ (3 + 4)) ^ (5 + 6)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 + 3 4 + 5 6 + ^ ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(1 + 2) ^ (3 + 4) ^ (5 + 6)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"moon stars mud + * fire soup * ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(moon * (stars + mud)) ^ (fire * soup)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"((3 ^ 4) ^ 2 ^ 9) ^ 2 ^ 5\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 6 * * + +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"error\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"error\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 4 + 5 3 + 2 3 * * *\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(1 + 4) * (5 + 3) * 2 * 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 * 3 4 * *\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 * 2 * 3 * 4\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 + 3 4 + +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 + 2 + 3 + 4\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 + 3 4 + ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(1 + 2) ^ (3 + 4)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 6 ^ 7 ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(5 ^ 6) ^ 7\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 4 3 2 ^ ^ ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 ^ 4 ^ 3 ^ 2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 3 + +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 + 2 + 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 + 3 +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 + 2 + 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 3 ^ ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 ^ 2 ^ 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 ^ 3 ^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(1 ^ 2) ^ 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 1 - 3 +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 - 1 + 3\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 1 1 - +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 + 1 - 1\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- [txr says 3 + (1 - 1)]</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 2 3 + -\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 - (2 + 3)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 3 2 + +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 + 3 + 2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 4 3 2 + + +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 + 4 + 3 + 2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 4 3 2 * * *\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 * 4 * 3 * 2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 4 3 2 + - +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 + 4 - (3 + 2)\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- [python says 5 + (4 - (3 + 2))]</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 5 * -\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 - 4 * 5\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 5 - *\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 * (4 - 5)\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- [python says (3 - 4) * 5] [!!flagged!!]</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 - 5 *\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"(3 - 4) * 5\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 2 * 1 5 - +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 * 2 + 1 - 5\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- [python says 4 * 2 + (1 - 5)]</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 2 * 1 5 - 2 ^ /\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 * 2 / (1 - 5) ^ 2\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">parseRPN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(de leftAssoc (Op)\n (member Op '(\"*\" \"/\" \"+\" \"-\")) )\n\n(de precedence (Op)\n (case Op\n (\"\\^\" 4)\n ((\"*\" \"/\") 3)\n ((\"+\" \"-\") 2) ) )\n\n(de rpnToInfix (Str)\n (let Stack NIL\n (prinl \"Token Stack\")\n (for Token (str Str \"_\")\n (cond\n ((num? Token) (push 'Stack (cons 9 @))) # Highest precedence\n ((not (cdr Stack)) (quit \"Stack empty\"))\n (T\n (let (X (pop 'Stack) P (precedence Token))\n (set Stack\n (cons P\n (pack\n (if ((if (leftAssoc Token) < <=) (caar Stack) P)\n (pack \"(\" (cdar Stack) \")\")\n (cdar Stack) )\n \" \" Token \" \"\n (if ((if (leftAssoc Token) <= <) (car X) P)\n (pack \"(\" (cdr X) \")\")\n (cdr X) ) ) ) ) ) ) )\n (prin Token)\n (space 6)\n (println Stack) )\n (prog1 (cdr (pop 'Stack))\n (and Stack (quit \"Garbage remained on stack\")) ) ) )\n","language":"PicoLisp"},{"code":": (rpnToInfix \"3 4 2 * 1 5 - 2 3 \\^ \\^ / +\")\nToken Stack\n3 ((9 . 3))\n4 ((9 . 4) (9 . 3))\n2 ((9 . 2) (9 . 4) (9 . 3))\n* ((3 . \"4 * 2\") (9 . 3))\n1 ((9 . 1) (3 . \"4 * 2\") (9 . 3))\n5 ((9 . 5) (9 . 1) (3 . \"4 * 2\") (9 . 3))\n- ((2 . \"1 - 5\") (3 . \"4 * 2\") (9 . 3))\n2 ((9 . 2) (2 . \"1 - 5\") (3 . \"4 * 2\") (9 . 3))\n3 ((9 . 3) (9 . 2) (2 . \"1 - 5\") (3 . \"4 * 2\") (9 . 3))\n^ ((4 . \"2 \\^ 3\") (2 . \"1 - 5\") (3 . \"4 * 2\") (9 . 3))\n^ ((4 . \"(1 - 5) \\^ 2 \\^ 3\") (3 . \"4 * 2\") (9 . 3))\n/ ((3 . \"4 * 2 / (1 - 5) \\^ 2 \\^ 3\") (9 . 3))\n+ ((2 . \"3 + 4 * 2 / (1 - 5) \\^ 2 \\^ 3\"))\n-> \"3 + 4 * 2 / (1 - 5) \\^ 2 \\^ 3\"\n\n: (rpnToInfix \"1 2 + 3 4 + \\^ 5 6 + \\^\")\nToken Stack\n1 ((9 . 1))\n2 ((9 . 2) (9 . 1))\n+ ((2 . \"1 + 2\"))\n3 ((9 . 3) (2 . \"1 + 2\"))\n4 ((9 . 4) (9 . 3) (2 . \"1 + 2\"))\n+ ((2 . \"3 + 4\") (2 . \"1 + 2\"))\n^ ((4 . \"(1 + 2) \\^ (3 + 4)\"))\n5 ((9 . 5) (4 . \"(1 + 2) \\^ (3 + 4)\"))\n6 ((9 . 6) (9 . 5) (4 . \"(1 + 2) \\^ (3 + 4)\"))\n+ ((2 . \"5 + 6\") (4 . \"(1 + 2) \\^ (3 + 4)\"))\n^ ((4 . \"((1 + 2) \\^ (3 + 4)) \\^ (5 + 6)\"))\n-> \"((1 + 2) \\^ (3 + 4)) \\^ (5 + 6)\"\n","language":"PicoLisp"},{"code":"/* Uses a push-down pop-up stack for the stack (instead of array) */\ncvt: procedure options (main); /* 10 Sept. 2012 */\n declare (true initial ('1'b), false initial ('0'b) ) bit (1);\n declare list character (1) controlled, written bit (1) controlled;\n declare (RPN, out) character (100) varying;\n declare s character (1);\n declare input_priority (5) fixed (1) static initial (1, 1, 2, 2, 3);\n declare stack_priority (5) fixed (1) static initial (1, 1, 2, 2, 4);\n declare (i, ki, kl) fixed binary;\n\n put ('Convert a Reverse Polish expression to orthodox.');\n put skip list ('Enclose the expression in apostrophes:');\n get list (RPN);\n put skip list ('The original Reverse Polish expression = ' || RPN);\n out = '';\n\n allocate list, written;\n list = substr(RPN, length(RPN), 1); written = false;\n\ntranslation:\n do i = length (RPN)-1 to 1 by -1;\n s = substr(RPN, i, 1);\n if s = ' ' then iterate;\n ki = index('+-*/^', s);\n kl = index('+-*/^', list);\n if ki > 0 then /* we have an operator */\n do;\n if input_priority (ki) < stack_priority (kl) then\n do; /* transfer ')' to list, then operator. */\n allocate list, written;\n list = '('; written = false;\n out = ')' || out;\n end;\n allocate list, written;\n list = s; written = false;\n end;\n else /* It's a variable name */\n do;\n out = s || out;\nnext_list:\n if allocation(list) > 0 then if written then free written, list;\n if allocation(list) > 0 then if list = '(' then\n do; out = list || out; free written, list; end;\n if allocation (list) = 0 then leave translation;\n if written then go to next_list;\n written = true;\n out = list || out; /* Output an operator. */\n end;\n put skip edit ('INPUT=' || s) (a); call show_stack;\n put edit (' OUTPUT=', out) (col(30), 2 a);\n end;\n put skip list ('ALGEBRAIC EXPRESSION=', out);\n\nend cvt;\n","language":"PL-I"},{"code":"\"\"\"\n>>> # EXAMPLE USAGE\n>>> result = rpn_to_infix('3 4 2 * 1 5 - 2 3 ^ ^ / +', VERBOSE=True)\nTOKEN STACK\n3 ['3']\n4 ['3', '4']\n2 ['3', '4', '2']\n* ['3', Node('2','*','4')]\n1 ['3', Node('2','*','4'), '1']\n5 ['3', Node('2','*','4'), '1', '5']\n- ['3', Node('2','*','4'), Node('5','-','1')]\n2 ['3', Node('2','*','4'), Node('5','-','1'), '2']\n3 ['3', Node('2','*','4'), Node('5','-','1'), '2', '3']\n^ ['3', Node('2','*','4'), Node('5','-','1'), Node('3','^','2')]\n^ ['3', Node('2','*','4'), Node(Node('3','^','2'),'^',Node('5','-','1'))]\n/ ['3', Node(Node(Node('3','^','2'),'^',Node('5','-','1')),'/',Node('2','*','4'))]\n+ [Node(Node(Node(Node('3','^','2'),'^',Node('5','-','1')),'/',Node('2','*','4')),'+','3')]\n\"\"\"\n\nprec_dict = {'^':4, '*':3, '/':3, '+':2, '-':2}\nassoc_dict = {'^':1, '*':0, '/':0, '+':0, '-':0}\n\nclass Node:\n def __init__(self,x,op,y=None):\n self.precedence = prec_dict[op]\n self.assocright = assoc_dict[op]\n self.op = op\n self.x,self.y = x,y\n\n def __str__(self):\n \"\"\"\n Building an infix string that evaluates correctly is easy.\n Building an infix string that looks pretty and evaluates\n correctly requires more effort.\n \"\"\"\n # easy case, Node is unary\n if self.y == None:\n return '%s(%s)'%(self.op,str(self.x))\n\n # determine left side string\n str_y = str(self.y)\n if self.y < self or \\\n (self.y == self and self.assocright) or \\\n (str_y[0] is '-' and self.assocright):\n\n str_y = '(%s)'%str_y\n # determine right side string and operator\n str_x = str(self.x)\n str_op = self.op\n if self.op is '+' and not isinstance(self.x, Node) and str_x[0] is '-':\n str_x = str_x[1:]\n str_op = '-'\n elif self.op is '-' and not isinstance(self.x, Node) and str_x[0] is '-':\n str_x = str_x[1:]\n str_op = '+'\n elif self.x < self or \\\n (self.x == self and not self.assocright and \\\n getattr(self.x, 'op', 1) != getattr(self, 'op', 2)):\n\n str_x = '(%s)'%str_x\n return ' '.join([str_y, str_op, str_x])\n\n def __repr__(self):\n \"\"\"\n >>> repr(Node('3','+','4')) == repr(eval(repr(Node('3','+','4'))))\n True\n \"\"\"\n return 'Node(%s,%s,%s)'%(repr(self.x), repr(self.op), repr(self.y))\n\n def __lt__(self, other):\n if isinstance(other, Node):\n return self.precedence < other.precedence\n return self.precedence < prec_dict.get(other,9)\n\n def __gt__(self, other):\n if isinstance(other, Node):\n return self.precedence > other.precedence\n return self.precedence > prec_dict.get(other,9)\n\n def __eq__(self, other):\n if isinstance(other, Node):\n return self.precedence == other.precedence\n return self.precedence > prec_dict.get(other,9)\n\n\n\ndef rpn_to_infix(s, VERBOSE=False):\n \"\"\"\n\n converts rpn notation to infix notation for string s\n\n \"\"\"\n if VERBOSE : print('TOKEN STACK')\n\n stack=[]\n for token in s.replace('^','^').split():\n if token in prec_dict:\n stack.append(Node(stack.pop(),token,stack.pop()))\n else:\n stack.append(token)\n\n # can't use \\t in order to make global docstring pass doctest\n if VERBOSE : print(token+' '*(7-len(token))+repr(stack))\n\n return str(stack[0])\n\nstrTest = \"3 4 2 * 1 5 - 2 3 ^ ^ / +\"\nstrResult = rpn_to_infix(strTest, VERBOSE=False)\nprint (\"Input: \",strTest)\nprint (\"Output:\",strResult)\n\nprint()\n\nstrTest = \"1 2 + 3 4 + ^ 5 6 + ^\"\nstrResult = rpn_to_infix(strTest, VERBOSE=False)\nprint (\"Input: \",strTest)\nprint (\"Output:\",strResult)\n","language":"Python"},{"code":"#lang racket\n(require racket/dict)\n\n(define (RPN->infix expr)\n (define-values (res _)\n (for/fold ([stack '()] [prec '()]) ([t expr])\n (show t stack prec)\n (cond\n [(dict-has-key? operators t)\n (match-define (list pt at) (dict-ref operators t))\n (match-define (list y x ss ...) stack)\n (match-define (list py px ps ...) prec)\n (define fexpr\n (cond\n [(> pt (max px py)) \"(~a) ~a (~a)\"]\n [(or (< px pt) (and (= pt px) (eq? at 'r))) \"(~a) ~a ~a\"]\n [(or (< py pt) (and (= pt py) (eq? at 'l))) \"~a ~a (~a)\"]\n [else \"~a ~a ~a\"]))\n (define term (format fexpr x t y))\n (values (cons term ss) (cons pt ps))]\n [else (values (cons t stack) (cons +inf.0 prec))])))\n (car res))\n\n;; the list of operators and their properties\n(define operators '((+ 2 l) (- 2 l) (* 3 l) (/ 3 l) (^ 4 r)))\n\n;; printing out the intermediate stages\n(define (show t stack prec)\n (printf \"~a\\t\" t)\n (for ([s stack] [p prec])\n (if (eq? +inf.0 p) (printf \"[~a] \" s) (printf \"[~a {~a}] \" s p)))\n (newline))\n","language":"Racket"},{"code":"sub p ($pair, $prec) { $pair.key < $prec ?? \"( {$pair.value} )\" !! $pair.value }\n\nsub rpm-to-infix($string) {\n my @stack;\n for $string.words {\n when /\\d/ { @stack.push: 9 => $_ }\n my ($y,$x) = @stack.pop, @stack.pop;\n when '^' { @stack.push: 4 => ~(p($x,5), $_, p($y,4)) }\n when '*' | '/' { @stack.push: 3 => ~(p($x,3), $_, p($y,3)) }\n when '+' | '-' { @stack.push: 2 => ~(p($x,2), $_, p($y,2)) }\n }\n ($string, @stack».value).join(\"\\n\") ~ \"\\n\";\n}\n\nsay rpm-to-infix $_ for\n '3 4 2 * 1 5 - 2 3 ^ ^ / +',\n '1 2 + 3 4 + ^ 5 6 + ^';\n","language":"Raku"},{"code":"/*REXX program converts Reverse Polish Notation (RPN) ───► an infix notation. */\nshowAction = 1 /* 0 if no showActions wanted. */\n # = 0 /*initialize stack pointer to 0 (zero).*/\n oS = '+ - / * ^' /*the operator symbols. */\n oP = '2 2 3 3 4' /*the operator priorities. */\n oA = '◄ ◄ ◄ ◄ ►' /*the operator associations. */\nsay \"infix: \" toInfix( \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" )\nsay \"infix: \" toInfix( \"1 2 + 3 4 + ^ 5 6 + ^\" ) /* [↓] Sprechen Sie Deutsch? */\nsay \"infix: \" toInfix( \"Mond Sterne Schlamm + * Feur Suppe * ^\" )\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npop: pop= #; #= # - 1; return @.pop\npush: #= # + 1; @.#= arg(1); return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nstack2str: $=; do j=1 for #; _ = @.j; y= left(_, 1)\n if pos(' ', _)==0 then _ = '{'strip( substr(_, 2) )\"}\"\n else _ = substr(_, 2)\n $=$ '{'strip(y _)\"}\"\n end /*j*/\n return space($)\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ntoInfix: parse arg rpn; say copies('─', 80 - 1); say 'RPN: ' space(rpn)\n\n do N=1 for words(RPN) /*process each of the RPN tokens.*/\n ?= word(RPN, N) /*obtain next item in the list. */\n if pos(?,oS)==0 then call push '¥' ? /*when in doubt, add a Yen to it.*/\n else do; g= pop(); gp= left(g, 1); g= substr(g, 2)\n h= pop(); hp= left(h, 1); h= substr(h, 2)\n tp= substr(oP, pos(?, oS), 1)\n ta= substr(oA, pos(?, oS), 1)\n if hp<tp | (hp==tp & ta=='►') then h= \"(\"h\")\"\n if gp<tp | (gp==tp & ta=='◄') then g= \"(\"g\")\"\n call push tp || h ? g\n end\n if showAction then say right(?, 25) \"──►\" stack2str()\n end /*N*/\n\n return space( substr( pop(), 2) )\n","language":"REXX"},{"code":"rpn = RPNExpression.new(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\ninfix = rpn.to_infix\nruby = rpn.to_ruby\n","language":"Ruby"},{"code":"func p(pair, prec) {\n pair[0] < prec ? \"( #{pair[1]} )\" : pair[1]\n}\n \nfunc rpm_to_infix(string) {\n say \"#{'='*17}\\n#{string}\"\n var stack = []\n string.each_word { |w|\n if (w ~~ /\\d/) {\n stack << [9, Num(w)]\n }\n else {\n var y = stack.pop\n var x = stack.pop\n given(w) {\n when ('^') { stack << [4, [p(x,5), w, p(y,4)].join(' ')] }\n when (<* />) { stack << [3, [p(x,3), w, p(y,3)].join(' ')] }\n when (<+ ->) { stack << [2, [p(x,2), w, p(y,2)].join(' ')] }\n }\n say stack\n }\n }\n say '-'*17\n stack.map{_[1]}\n}\n \nvar tests = [\n '3 4 2 * 1 5 - 2 3 ^ ^ / +',\n '1 2 + 3 4 + ^ 5 6 + ^',\n]\n \ntests.each { say rpm_to_infix(_).join(' ') }\n","language":"Sidef"},{"code":"package require Tcl 8.5\n\n# Helpers\nproc precassoc op {\n dict get {^ {4 right} * {3 left} / {3 left} + {2 left} - {2 left}} $op\n}\nproc pop stk {\n upvar 1 $stk s\n set val [lindex $s end]\n set s [lreplace $s end end]\n return $val\n}\n\nproc rpn2infix rpn {\n foreach token $rpn {\n\tswitch $token {\n\t \"^\" - \"/\" - \"*\" - \"+\" - \"-\" {\n\t\tlassign [pop stack] bprec b\n\t\tlassign [pop stack] aprec a\n\t\tlassign [precassoc $token] p assoc\n\t\tif {$aprec < $p || ($aprec == $p && $assoc eq \"right\")} {\n\t\t set a \"($a)\"\n\t\t}\n\t\tif {$bprec < $p || ($bprec == $p && $assoc eq \"left\")} {\n\t\t set b \"($b)\"\n\t\t}\n\t\tlappend stack [list $p \"$a $token $b\"]\n\t }\n\t default {\n\t\tlappend stack [list 9 $token]\n\t }\n\t}\n\tputs \"$token -> $stack\"\n }\n return [lindex $stack end 1]\n}\n\nputs [rpn2infix {3 4 2 * 1 5 - 2 3 ^ ^ / +}]\nputs [rpn2infix {1 2 + 3 4 + ^ 5 6 + ^}]\n","language":"Tcl"},{"code":";; alias for circumflex, which is reserved syntax\n(defvar exp (intern \"^\"))\n\n(defvar *prec* ^((,exp . 4) (* . 3) (/ . 3) (+ . 2) (- . 2)))\n\n(defvar *asso* ^((,exp . :right) (* . nil)\n (/ . :left) (+ . nil) (- . :left)))\n\n(defun debug-print (label val)\n (format t \"~a: ~a\\n\" label val)\n val)\n\n(defun rpn-to-lisp (rpn)\n (let (stack)\n (each ((term rpn))\n (if (symbolp (debug-print \"rpn term\" term))\n (let ((right (pop stack))\n (left (pop stack)))\n (push ^(,term ,left ,right) stack))\n (push term stack))\n (debug-print \"stack\" stack))\n (if (rest stack)\n (return-from error \"*excess stack elements*\"))\n (debug-print \"lisp\" (pop stack))))\n\n(defun prec (term)\n (or (cdr (assoc term *prec*)) 99))\n\n(defun asso (term dfl)\n (or (cdr (assoc term *asso*)) dfl))\n\n(defun inf-term (op term left-or-right)\n (if (atom term)\n `@term`\n (let ((pt (prec (car term)))\n (po (prec op))\n (at (asso (car term) left-or-right))\n (ao (asso op left-or-right)))\n (cond\n ((< pt po) `(@(lisp-to-infix term))`)\n ((> pt po) `@(lisp-to-infix term)`)\n ((and (eq at ao) (eq left-or-right ao)) `@(lisp-to-infix term)`)\n (t `(@(lisp-to-infix term))`)))))\n\n(defun lisp-to-infix (lisp)\n (tree-case lisp\n ((op left right) (let ((left-inf (inf-term op left :left))\n (right-inf (inf-term op right :right)))\n `@{left-inf} @op @{right-inf}`))\n (() (return-from error \"*stack underflow*\"))\n (else `@lisp`)))\n\n(defun string-to-rpn (str)\n (debug-print \"rpn\"\n (mapcar (do if (int-str @1) (int-str @1) (intern @1))\n (tok-str str #/[^ \\t]+/))))\n\n(debug-print \"infix\"\n (block error\n (tree-case *args*\n ((a b . c) \"*excess args*\")\n ((a) (lisp-to-infix (rpn-to-lisp (string-to-rpn a))))\n (else \"*arg needed*\"))))\n","language":"TXR"},{"code":"Option Strict On\n\nImports System.Text.RegularExpressions\n\nModule Module1\n\n Class Operator_\n Sub New(t As Char, p As Integer, Optional i As Boolean = False)\n Token = t\n Precedence = p\n IsRightAssociative = i\n End Sub\n\n Property Token As Char\n Get\n Return m_token\n End Get\n Private Set(value As Char)\n m_token = value\n End Set\n End Property\n\n Property Precedence As Integer\n Get\n Return m_precedence\n End Get\n Private Set(value As Integer)\n m_precedence = value\n End Set\n End Property\n\n Property IsRightAssociative As Boolean\n Get\n Return m_right\n End Get\n Private Set(value As Boolean)\n m_right = value\n End Set\n End Property\n\n Private m_token As Char\n Private m_precedence As Integer\n Private m_right As Boolean\n End Class\n\n ReadOnly operators As New Dictionary(Of Char, Operator_) From {\n {\"+\"c, New Operator_(\"+\"c, 2)},\n {\"-\"c, New Operator_(\"-\"c, 2)},\n {\"/\"c, New Operator_(\"/\"c, 3)},\n {\"*\"c, New Operator_(\"*\"c, 3)},\n {\"^\"c, New Operator_(\"^\"c, 4, True)}\n }\n\n Class Expression\n Public Sub New(e As String)\n Ex = e\n End Sub\n\n Sub New(e1 As String, e2 As String, o As Operator_)\n Ex = String.Format(\"{0} {1} {2}\", e1, o.Token, e2)\n Op = o\n End Sub\n\n ReadOnly Property Ex As String\n ReadOnly Property Op As Operator_\n End Class\n\n Function PostfixToInfix(postfix As String) As String\n Dim stack As New Stack(Of Expression)\n\n For Each token As String In Regex.Split(postfix, \"\\s+\")\n Dim c = token(0)\n Dim op = operators.FirstOrDefault(Function(kv) kv.Key = c).Value\n If Not IsNothing(op) AndAlso token.Length = 1 Then\n Dim rhs = stack.Pop()\n Dim lhs = stack.Pop()\n\n Dim opPrec = op.Precedence\n\n Dim lhsPrec = If(IsNothing(lhs.Op), Integer.MaxValue, lhs.Op.Precedence)\n Dim rhsPrec = If(IsNothing(rhs.Op), Integer.MaxValue, rhs.Op.Precedence)\n\n Dim newLhs As String\n If lhsPrec < opPrec OrElse (lhsPrec = opPrec AndAlso c = \"^\") Then\n 'lhs.Ex = \"(\" + lhs.Ex + \")\"\n newLhs = \"(\" + lhs.Ex + \")\"\n Else\n newLhs = lhs.Ex\n End If\n\n Dim newRhs As String\n If rhsPrec < opPrec OrElse (rhsPrec = opPrec AndAlso c <> \"^\") Then\n 'rhs.Ex = \"(\" + rhs.Ex + \")\"\n newRhs = \"(\" + rhs.Ex + \")\"\n Else\n newRhs = rhs.Ex\n End If\n\n stack.Push(New Expression(newLhs, newRhs, op))\n Else\n stack.Push(New Expression(token))\n End If\n\n 'Print intermediate result\n Console.WriteLine(\"{0} -> [{1}]\", token, String.Join(\", \", stack.Reverse().Select(Function(e) e.Ex)))\n Next\n\n Return stack.Peek().Ex\n End Function\n\n Sub Main()\n Dim inputs = {\"3 4 2 * 1 5 - 2 3 ^ ^ / +\", \"1 2 + 3 4 + ^ 5 6 + ^\"}\n For Each e In inputs\n Console.WriteLine(\"Postfix : {0}\", e)\n Console.WriteLine(\"Infix : {0}\", PostfixToInfix(e))\n Console.WriteLine()\n Next\n Console.ReadLine() 'remove before submit\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./seq\" for Stack\nimport \"./pattern\" for Pattern\n\nclass Expression {\n static ops { \"-+/*^\" }\n\n construct new(ex, op, prec) {\n _ex = ex\n _op = op\n _prec = prec\n }\n\n static build(e1, e2, o) { new(\"%(e1) %(o) %(e2)\", o, (ops.indexOf(o)/2).floor) }\n\n ex { _ex }\n ex=(other) { _ex = other }\n prec { _prec }\n\n toString { _ex }\n}\n\nvar postfixToInfix = Fn.new { |postfix|\n var expr = Stack.new()\n var p = Pattern.new(\"+1/s\")\n for (token in p.splitAll(postfix)) {\n var c = token[0]\n var idx = Expression.ops.indexOf(c)\n if (idx != -1 && token.count == 1) {\n var r = expr.pop()\n var l = expr.pop()\n var opPrec = (idx/2).floor\n if (l.prec < opPrec || (l.prec == opPrec && c == \"^\")) {\n l.ex = \"(%(l.ex))\"\n }\n if (r.prec < opPrec || (r.prec == opPrec && c != \"^\")) {\n r.ex = \"(%(r.ex))\"\n }\n expr.push(Expression.build(l.ex, r.ex, token))\n } else {\n expr.push(Expression.new(token, \"\", 3))\n }\n System.print(\"%(token) -> %(expr)\")\n }\n return expr.peek().ex\n}\n\nvar es = [\n \"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\n \"1 2 + 3 4 + ^ 5 6 + ^\"\n]\nfor (e in es) {\n System.print(\"Postfix : %(e)\")\n System.print(\"Infix : %(postfixToInfix.call(e))\\n\")\n}\n","language":"Wren"},{"code":"tests:=T(\"3 4 2 * 1 5 - 2 3 ^ ^ / +\",\"1 2 + 3 4 + ^ 5 6 + ^\");\n\nvar opa=D(\n \"^\",T(4, True),\n \"*\",T(3, False), \"/\",T(3, False),\n \"+\",T(2, False), \"-\",T(2, False) );\n\nconst nPrec = 9;\n\nforeach t in (tests) { parseRPN(t) }\n\nfcn parseRPN(e){\n println(\"\\npostfix:\", e);\n stack:=L();\n foreach tok in (e.split()){\n println(\"token: \", tok);\n opPrec,rAssoc:=opa.find(tok,T(Void,Void));\n if(opPrec){\n\t rhsPrec,rhsExpr := stack.pop();\n\t lhsPrec,lhsExpr := stack.pop();\n\t if(lhsPrec < opPrec or (lhsPrec == opPrec and rAssoc))\n\t lhsExpr = \"(\" + lhsExpr + \")\";\n\t lhsExpr += \" \" + tok + \" \";\n\t if(rhsPrec < opPrec or (rhsPrec == opPrec and not rAssoc)){\n\t lhsExpr += \"(\" + rhsExpr + \")\"\n\t } else\n\t lhsExpr += rhsExpr;\n\t lhsPrec = opPrec;\n\t stack.append(T(lhsPrec,lhsExpr));\n } else\n\t stack.append(T(nPrec, tok));\n foreach f in (stack){\n println(0'| %d \"%s\"|.fmt(f.xplode()))\n }\n }\n println(\"infix:\", stack[0][1])\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Parsing/RPN_to_infix_conversion\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nCreate a program that takes an [[wp:Reverse Polish notation|RPN]] representation of an expression formatted as a space separated sequence of tokens and generates the equivalent expression in [[wp:Infix notation|infix notation]].\\n\\n* Assume an input of a correct, space separated, string of tokens\\n* Generate a space separated output string representing the same expression in infix notation\\n* Show how the major datastructure of your algorithm changes with each new token parsed.\\n* Test with the following input RPN strings then print and display the output here.\\n:::::{| class=\\\"wikitable\\\"\\n! RPN input !! sample output\\n|- || align=\\\"center\\\"\\n| <code>3 4 2 * 1 5 - 2 3 ^ ^ / +</code>|| <code>3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3</code>\\n|- || align=\\\"center\\\"\\n| <code>1 2 + 3 4 + ^ 5 6 + ^</code>|| <code>( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )</code>\\n|}\\n\\n* Operator precedence and operator associativity is given in this table:\\n::::::::{| class=\\\"wikitable\\\"\\n\\n! operator !! [[wp:Order_of_operations|precedence]] !! [[wp:Operator_associativity|associativity]] !! operation\\n|- || align=\\\"center\\\" \\n| <big><big> ^ </big></big> || 4 || right || exponentiation\\n|- || align=\\\"center\\\" \\n| <big><big> * </big></big> || 3 || left || multiplication\\n|- || align=\\\"center\\\" \\n| <big><big> / </big></big> || 3 || left || division\\n|- || align=\\\"center\\\" \\n| <big><big> + </big></big> || 2 || left || addition\\n|- || align=\\\"center\\\" \\n| <big><big> - </big></big> || 2 || left || subtraction\\n|}\\n\\n\\n;See also:\\n* [[Parsing/Shunting-yard algorithm]] for a method of generating an RPN from an infix expression.\\n* [[Parsing/RPN calculator algorithm]] for a method of calculating a final value from this output RPN expression.\\n* [http://www.rubyquiz.com/quiz148.html Postfix to infix] from the RubyQuiz site.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"-V ops = ‘-+/*^’\\n\\nF postfix_to_infix(postfix)\\n T Expression\\n String op, ex\\n prec = 3\\n\\n F (String e1, e2 = ‘’, o = ‘’)\\n I o == ‘’\\n .ex = e1\\n E\\n .ex = e1‘ ’o‘ ’e2\\n .op = o\\n .prec = :ops.index(o) I/ 2\\n\\n F String()\\n R .ex\\n\\n [Expression] expr\\n\\n L(token) postfix.split(re:‘\\\\s+’)\\n V c = token[0]\\n V? idx = :ops.find(c)\\n I idx != N\\n V r = expr.pop()\\n V l = expr.pop()\\n V opPrec = idx I/ 2\\n\\n I l.prec < opPrec | (l.prec == opPrec & c == ‘^’)\\n l.ex = ‘(’l.ex‘)’\\n\\n I r.prec < opPrec | (r.prec == opPrec & c != ‘^’)\\n r.ex = ‘(’r.ex‘)’\\n expr.append(Expression(l.ex, r.ex, token))\\n E\\n expr.append(Expression(token))\\n\\n print(token‘ -> ’expr)\\n\\n assert(expr.len == 1)\\n R expr[0].ex\\n\\nL(e) [‘3 4 2 * 1 5 - 2 3 ^ ^ / +’,\\n ‘1 2 + 3 4 + ^ 5 6 + ^’]\\n print(‘Postfix : ’e)\\n print(‘Infix : ’postfix_to_infix(e))\\n print()\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \" type Priority is range 1..4;\\n type Infix is record\\n Precedence : Priority;\\n Expression : Unbounded_String;\\n end record;\\n package Expression_Stack is new Generic_Stack (Infix);\\n use Expression_Stack;\\n\\n function Convert (RPN : String) return String is\\n Arguments : Stack;\\n procedure Pop\\n ( Operation : Character;\\n Precedence : Priority;\\n Association : Priority\\n ) is\\n Right, Left : Infix;\\n Result : Infix;\\n begin\\n Pop (Right, Arguments);\\n Pop (Left, Arguments);\\n Result.Precedence := Association;\\n if Left.Precedence < Precedence then\\n Append (Result.Expression, '(');\\n Append (Result.Expression, Left.Expression);\\n Append (Result.Expression, ')');\\n else\\n Append (Result.Expression, Left.Expression);\\n end if;\\n Append (Result.Expression, ' ');\\n Append (Result.Expression, Operation);\\n Append (Result.Expression, ' ');\\n if Right.Precedence < Precedence then\\n Append (Result.Expression, '(');\\n Append (Result.Expression, Right.Expression);\\n Append (Result.Expression, ')');\\n else\\n Append (Result.Expression, Right.Expression);\\n end if;\\n Push (Result, Arguments);\\n end Pop;\\n Pointer : Integer := RPN'First;\\n begin\\n while Pointer <= RPN'Last loop\\n case RPN (Pointer) is\\n when ' ' =>\\n Pointer := Pointer + 1;\\n when '0'..'9' =>\\n declare\\n Start : constant Integer := Pointer;\\n begin\\n loop\\n Pointer := Pointer + 1;\\n exit when Pointer > RPN'Last\\n or else RPN (Pointer) not in '0'..'9';\\n end loop;\\n Push\\n ( ( 4,\\n To_Unbounded_String (RPN (Start..Pointer - 1))\\n ),\\n Arguments\\n );\\n end;\\n when '+' | '-' =>\\n Pop (RPN (Pointer), 1, 1);\\n Pointer := Pointer + 1;\\n when '*' | '/' =>\\n Pop (RPN (Pointer), 2, 2);\\n Pointer := Pointer + 1;\\n when '^' =>\\n Pop (RPN (Pointer), 4, 3);\\n Pointer := Pointer + 1;\\n when others =>\\n raise Constraint_Error with \\\"Syntax\\\";\\n end case;\\n end loop;\\n declare\\n Result : Infix;\\n begin\\n Pop (Result, Arguments);\\n return To_String (Result.Expression);\\n end;\\n end Convert;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;\\nwith Ada.Text_IO; use Ada.Text_IO;\\nwith Generic_Stack;\\n\\nprocedure RPN_to_Infix is\\n -- The code above\\nbegin\\n Put_Line (\\\"3 4 2 * 1 5 - 2 3 ^ ^ / + = \\\");\\n Put_Line (Convert (\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"));\\n Put_Line (\\\"1 2 + 3 4 + ^ 5 6 + ^ = \\\");\\n Put_Line (Convert (\\\"1 2 + 3 4 + ^ 5 6 + ^\\\"));\\nend RPN_to_Infix;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"# rpn to infix - parses an RPN expression and generates the equivalent #\\n# infix expression #\\nPROC rpn to infix = ( STRING rpn )STRING:\\nBEGIN\\n\\n # we parse the string backwards using recursive descent #\\n INT rpn pos := UPB rpn;\\n BOOL had error := FALSE;\\n\\n # mode to hold nodes of the parse tree #\\n MODE NODE = STRUCT( INT op\\n , UNION( REF NODE, STRING ) left\\n , REF NODE right\\n );\\n\\n REF NODE nil node = NIL;\\n\\n\\n # op codes #\\n INT error = 1;\\n INT factor = 2;\\n INT add = 3;\\n INT sub = 4;\\n INT mul = 5;\\n INT div = 6;\\n INT pwr = 7;\\n\\n []STRING op name = ( \\\"error\\\", \\\"factor\\\", \\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\", \\\"^\\\" );\\n []BOOL right associative\\n = ( FALSE, FALSE, FALSE, FALSE, FALSE, FALSE, TRUE );\\n []INT priority = ( 1, 1, 2, 2, 3, 3, 4 );\\n\\n\\n\\n # returns TRUE if we have reached the end of the rpn string, #\\n # FALSE otherwise #\\n PROC at end = BOOL: rpn pos < LWB rpn;\\n\\n # positions to the previous character, if there is one #\\n PROC next = VOID: rpn pos -:= 1;\\n\\n # skip spaces in the rpn string #\\n PROC skip spaces = VOID:\\n WHILE have( \\\" \\\" )\\n DO\\n next\\n OD # skip spaces # ;\\n\\n # returns TRUE if the rpn character at rpn pos is c, #\\n # FALSE if the character is not c or there is no character #\\n # at rpn pos #\\n PROC have = ( CHAR c )BOOL:\\n IF at end\\n THEN\\n # no character at rpn pos #\\n FALSE\\n ELSE\\n # have a character - check it is the required one #\\n rpn[ rpn pos ] = c\\n FI # have # ;\\n\\n # gets an operand from the rpn string #\\n # an operand is either a number or a sub-expression #\\n PROC get operand = ( STRING rpn, STRING operand name )REF NODE:\\n BEGIN\\n\\n # handle the operator or operand, if there is one #\\n\\n skip spaces;\\n\\n print( ( ( \\\"parsing \\\"\\n + operand name\\n + \\\" from: \\\"\\n + IF at end THEN \\\"\\\" ELSE rpn[ LWB rpn : rpn pos ] FI\\n )\\n , newline\\n )\\n );\\n\\n REF NODE result :=\\n IF at end\\n THEN\\n # no operand #\\n had error := TRUE;\\n HEAP NODE := ( error, \\\"!! Missing operand !!\\\", NIL )\\n ELIF have( \\\"+\\\" )\\n THEN\\n # addition #\\n next;\\n HEAP NODE right := get operand( rpn, \\\"+ right operand\\\" );\\n HEAP NODE left := get operand( rpn, \\\"+ left operand\\\" );\\n HEAP NODE := ( add, left, right )\\n ELIF have( \\\"-\\\" )\\n THEN\\n # subtraction #\\n next;\\n HEAP NODE right := get operand( rpn, \\\"- right operand\\\" );\\n HEAP NODE left := get operand( rpn, \\\"- left operand\\\" );\\n HEAP NODE := ( sub, left, right )\\n ELIF have( \\\"*\\\" )\\n THEN\\n # multiplication #\\n next;\\n HEAP NODE right := get operand( rpn, \\\"* right operand\\\" );\\n HEAP NODE left := get operand( rpn, \\\"* left operand\\\" );\\n HEAP NODE := ( mul, left, right )\\n ELIF have( \\\"/\\\" )\\n THEN\\n # division #\\n next;\\n HEAP NODE right := get operand( rpn, \\\"/ right operand\\\" );\\n HEAP NODE left := get operand( rpn, \\\"/ left operand\\\" );\\n HEAP NODE := ( div, left, right )\\n ELIF have( \\\"^\\\" )\\n THEN\\n # exponentiation #\\n next;\\n HEAP NODE right := get operand( rpn, \\\"^ right operand\\\" );\\n HEAP NODE left := get operand( rpn, \\\"^ left operand\\\" );\\n HEAP NODE := ( pwr, left, right )\\n ELSE\\n # must be an operand #\\n STRING value := \\\"\\\";\\n\\n WHILE NOT at end\\n AND NOT have( \\\" \\\" )\\n DO\\n rpn[ rpn pos ] +=: value;\\n next\\n OD;\\n\\n HEAP NODE := ( factor, value, NIL )\\n FI;\\n\\n print( ( operand name + \\\": \\\" + TOSTRING result, newline ) );\\n\\n result\\n END # get operand # ;\\n\\n\\n # converts the parse tree to a string with apppropriate parenthesis #\\n OP TOSTRING = ( REF NODE operand )STRING:\\n BEGIN\\n\\n # converts a node of the parse tree to a string, inserting #\\n # parenthesis if necessary #\\n PROC possible parenthesis = ( INT op, REF NODE expr )STRING:\\n IF op OF expr = error\\n OR op OF expr = factor\\n THEN\\n # operand is an error/factor - parenthisis not needed #\\n TOSTRING expr\\n ELIF priority( op OF expr ) < priority( op )\\n THEN\\n # the expression is a higher precedence operator than the #\\n # one we are building the expression for - need parenthesis #\\n ( \\\"( \\\" + TOSTRING expr + \\\" )\\\" )\\n ELIF right associative[ op OF operand ]\\n AND op OF left( operand ) = op OF operand\\n THEN\\n # right associative operator #\\n ( \\\"( \\\" + TOSTRING expr + \\\" )\\\" )\\n ELSE\\n # lower precedence expression - parenthesis not needed #\\n TOSTRING expr\\n FI # possible parenthesis # ;\\n\\n # gets the left branch of a node, which must be a node #\\n PROC left = ( REF NODE operand )REF NODE:\\n CASE left OF operand\\n IN ( REF NODE o ): o\\n , ( STRING s ): HEAP NODE := ( error, s, NIL )\\n ESAC # left # ;\\n\\n IF had error\\n THEN\\n # an error occured parsing the expression #\\n \\\"Invalid expression\\\"\\n ELIF operand IS nil node\\n THEN\\n # no operand? #\\n \\\"<empty>\\\"\\n ELIF op OF operand = error\\n OR op OF operand = factor\\n THEN\\n # error parsing the expression #\\n # or a factor #\\n CASE left OF operand\\n IN ( REF NODE o ): \\\"Error: String expected: (\\\" + TOSTRING o + \\\")\\\"\\n , ( STRING s ): s\\n ESAC\\n ELSE\\n # general operand #\\n ( possible parenthesis( op OF operand, left( operand ) )\\n + \\\" \\\" + op name[ op OF operand ] + \\\" \\\"\\n + possible parenthesis( op OF operand, right OF operand )\\n )\\n FI\\n END # TOSTRING # ;\\n\\n STRING result = TOSTRING get operand( rpn, \\\"expression\\\" );\\n\\n # ensure there are no more tokens in the string #\\n skip spaces;\\n IF at end\\n THEN\\n # OK - there was only one expression #\\n result\\n ELSE\\n # extraneous tokens #\\n ( \\\"Error - unexpected text before expression: (\\\"\\n + rpn[ LWB rpn : rpn pos ]\\n + \\\")\\\"\\n )\\n FI\\nEND # rpn to infix # ;\\n\\n\\n\\nmain: (\\n\\n # test the RPN to Infix comnverter #\\n STRING rpn;\\n\\n rpn := \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\";\\n print( ( rpn, \\\": \\\", rpn to infix( rpn ), newline, newline ) );\\n\\n rpn := \\\"1 2 + 3 4 + ^ 5 6 + ^\\\";\\n print( ( rpn, \\\": \\\", rpn to infix( rpn ), newline ) )\\n\\n)\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"expr := \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n\\nstack := {push: func(\\\"ObjInsert\\\"), pop: func(\\\"ObjRemove\\\")}\\nout := \\\"TOKEN`tACTION STACK (comma separated)`r`n\\\"\\nLoop Parse, expr, %A_Space%\\n{\\n\\ttoken := A_LoopField\\n\\tif token is number\\n\\t\\tstack.push([0, token])\\n\\tif isOp(token)\\n\\t{\\n\\t\\tb := stack.pop(), a := stack.pop(), p := b.1 > a.1 ? b.1 : a.1\\n\\t\\tp := Precedence(token) > p ? precedence(token) : p\\n\\t\\tif (a.1 < b.1) and isRight(token)\\n\\t\\t\\tstack.push([p, \\\"( \\\" . a.2 \\\" ) \\\" token \\\" \\\" b.2])\\n\\t\\telse if (a.1 > b.1) and isLeft(token)\\n\\t\\t\\tstack.push([p, a.2 token \\\" ( \\\" b.2 \\\" ) \\\"])\\n\\t\\telse\\n\\t\\t\\tstack.push([p, a.2 . \\\" \\\" . token . \\\" \\\" . b.2])\\n\\t}\\n\\tout .= token \\\"`t\\\" (isOp(token) ? \\\"Push Partial expression \\\"\\n\\t\\t\\t : \\\"Push num\\\" space(16)) disp(stack) \\\"`r`n\\\"\\n}\\nout .= \\\"`r`n The final output infix expression is: '\\\" disp(stack) \\\"'\\\"\\nclipboard := out\\nisOp(t){\\n return (!!InStr(\\\"+-*/^\\\", t) && t)\\n}\\nIsLeft(o){\\n return !!InStr(\\\"*/+-\\\", o)\\n}\\nIsRight(o){\\n return o = \\\"^\\\"\\n}\\nPrecedence(o){\\n return (InStr(\\\"+-/*^\\\", o)+3)//2\\n}\\nDisp(obj){\\n for each, val in obj\\n\\t\\tif val[2]\\n\\t\\t\\to .= \\\", \\\" val[2]\\n return SubStr(o,3)\\n}\\nSpace(n){\\n return n>0 ? A_Space Space(n-1) : \\\"\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#!/usr/bin/awk -f\\n\\nBEGIN {\\n initStack()\\n initOpers()\\n print \\\"Infix: \\\" toInfix(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n print \\\"\\\"\\n print \\\"Infix: \\\" toInfix(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\")\\n print \\\"\\\"\\n print \\\"Infix: \\\" toInfix(\\\"moon stars mud + * fire soup * ^\\\")\\n exit\\n}\\n\\nfunction initStack() {\\n delete stack\\n stackPtr = 0\\n}\\n\\nfunction initOpers() {\\n VALPREC = \\\"9\\\"\\n LEFT = \\\"l\\\"\\n RIGHT = \\\"r\\\"\\n operToks = \\\"+\\\" \\\"-\\\" \\\"/\\\" \\\"*\\\" \\\"^\\\"\\n operPrec = \\\"2\\\" \\\"2\\\" \\\"3\\\" \\\"3\\\" \\\"4\\\"\\n operAssoc = LEFT LEFT LEFT LEFT RIGHT\\n}\\n\\nfunction toInfix(rpn, t, toks, tok, a, ap, b, bp, tp, ta) {\\n print \\\"Postfix: \\\" rpn\\n split(rpn, toks, / +/)\\n for (t = 1; t <= length(toks); t++) {\\n tok = toks[t]\\n if (!isOper(tok)) {\\n push(VALPREC tok)\\n }\\n else {\\n b = pop()\\n bp = prec(b)\\n b = tail(b)\\n a = pop()\\n ap = prec(a)\\n a = tail(a)\\n tp = tokPrec(tok)\\n ta = tokAssoc(tok)\\n if (ap < tp || (ap == tp && ta == RIGHT)) {\\n a = \\\"(\\\" a \\\")\\\"\\n }\\n if (bp < tp || (bp == tp && ta == LEFT)) {\\n b = \\\"(\\\" b \\\")\\\"\\n }\\n push(tp a \\\" \\\" tok \\\" \\\" b)\\n }\\n print \\\" \\\" tok \\\" -> \\\" stackToStr()\\n }\\n return tail(pop())\\n}\\n\\nfunction push(expr) {\\n stack[stackPtr] = expr\\n stackPtr++\\n}\\n\\nfunction pop() {\\n stackPtr--\\n return stack[stackPtr]\\n}\\n\\nfunction isOper(tok) {\\n return index(operToks, tok) != 0\\n}\\n\\nfunction prec(expr) {\\n return substr(expr, 1, 1)\\n}\\n\\nfunction tokPrec(tok) {\\n return substr(operPrec, operIdx(tok), 1)\\n}\\n\\nfunction tokAssoc(tok) {\\n return substr(operAssoc, operIdx(tok), 1)\\n}\\n\\nfunction operIdx(tok) {\\n return index(operToks, tok)\\n}\\n\\nfunction tail(s) {\\n return substr(s, 2)\\n}\\n\\nfunction stackToStr( s, i, t, p) {\\n s = \\\"\\\"\\n for (i = 0; i < stackPtr; i++) {\\n t = stack[i]\\n p = prec(t)\\n if (index(t, \\\" \\\")) t = \\\"{\\\" tail(t) \\\"}\\\"\\n else t = tail(t)\\n s = s \\\"{\\\" p \\\" \\\" t \\\"} \\\"\\n }\\n return s\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include<stdlib.h>\\n#include<string.h>\\n#include<stdio.h>\\n\\nchar** components;\\nint counter = 0;\\n\\ntypedef struct elem{\\n\\tchar data[10];\\n\\tstruct elem* left;\\n\\tstruct elem* right;\\n}node;\\n\\ntypedef node* tree;\\n\\nint precedenceCheck(char oper1,char oper2){\\n\\treturn (oper1==oper2)? 0:(oper1=='^')? 1:(oper2=='^')? 2:(oper1=='/')? 1:(oper2=='/')? 2:(oper1=='*')? 1:(oper2=='*')? 2:(oper1=='+')? 1:(oper2=='+')? 2:(oper1=='-')? 1:2;\\n}\\n\\nint isOperator(char c){\\n\\treturn (c=='+'||c=='-'||c=='*'||c=='/'||c=='^');\\n}\\n\\nvoid inorder(tree t){\\n\\tif(t!=NULL){\\n\\t\\tif(t->left!=NULL && isOperator(t->left->data[0])==1 && (precedenceCheck(t->data[0],t->left->data[0])==1 || (precedenceCheck(t->data[0],t->left->data[0])==0 && t->data[0]=='^'))){\\n\\t\\t\\tprintf(\\\"(\\\");\\n\\t\\t\\tinorder(t->left);\\n\\t\\t\\tprintf(\\\")\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t\\tinorder(t->left);\\n\\t\\n\\t\\tprintf(\\\" %s \\\",t->data);\\n\\t\\n\\t\\tif(t->right!=NULL && isOperator(t->right->data[0])==1 && (precedenceCheck(t->data[0],t->right->data[0])==1 || (precedenceCheck(t->data[0],t->right->data[0])==0 && t->data[0]!='^'))){\\n\\t\\t\\tprintf(\\\"(\\\");\\n\\t\\t\\tinorder(t->right);\\n\\t\\t\\tprintf(\\\")\\\");\\n\\t\\t}\\n\\t\\telse\\n\\t\\t\\tinorder(t->right);\\n\\t}\\n}\\n\\nchar* getNextString(){\\n\\tif(counter<0){\\n\\t\\tprintf(\\\"\\\\nInvalid RPN !\\\");\\n\\t\\texit(0);\\n\\t}\\n\\treturn components[counter--];\\n}\\n\\ntree buildTree(char* obj,char* trace){\\n\\ttree t = (tree)malloc(sizeof(node));\\n\\t\\n\\tstrcpy(t->data,obj);\\n\\t\\n\\tt->right = (isOperator(obj[0])==1)?buildTree(getNextString(),trace):NULL;\\n\\tt->left = (isOperator(obj[0])==1)?buildTree(getNextString(),trace):NULL;\\n\\t\\n\\tif(trace!=NULL){\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\tinorder(t);\\n\\t}\\n\\n\\treturn t;\\n}\\n\\nint checkRPN(){\\n\\tint i, operSum = 0, numberSum = 0;\\n\\t\\n\\tif(isOperator(components[counter][0])==0)\\n\\t\\treturn 0;\\n\\t\\n\\tfor(i=0;i<=counter;i++)\\n\\t\\t(isOperator(components[i][0])==1)?operSum++:numberSum++;\\n\\n\\treturn (numberSum - operSum == 1);\\n}\\n\\nvoid buildStack(char* str){\\n\\tint i;\\n\\tchar* token;\\n\\t\\n\\tfor(i=0;str[i]!=00;i++)\\n\\t\\tif(str[i]==' ')\\n\\t\\t\\tcounter++;\\n\\t\\t\\n\\tcomponents = (char**)malloc((counter + 1)*sizeof(char*));\\n\\t\\n\\ttoken = strtok(str,\\\" \\\");\\n\\t\\n\\ti = 0;\\n\\t\\n\\twhile(token!=NULL){\\n\\t\\tcomponents[i] = (char*)malloc(strlen(token)*sizeof(char));\\n\\t\\tstrcpy(components[i],token);\\n\\t\\ttoken = strtok(NULL,\\\" \\\");\\n\\t\\ti++;\\n\\t}\\n}\\n\\nint main(int argC,char* argV[]){\\n\\tint i;\\n\\ttree t;\\n\\t\\n\\tif(argC==1)\\n\\t\\tprintf(\\\"Usage : %s <RPN expression enclosed by quotes> <optional parameter to trace the build process>\\\",argV[0]);\\n\\telse{\\n\\t\\tbuildStack(argV[1]);\\n\\t\\t\\n\\t\\tif(checkRPN()==0){\\n\\t\\t\\tprintf(\\\"\\\\nInvalid RPN !\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\t\\n\\t\\tt = buildTree(getNextString(),argV[2]);\\n\\t\\t\\n\\t\\tprintf(\\\"\\\\nFinal infix expression : \\\");\\n\\t\\tinorder(t);\\n\\t}\\n\\t\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <stack>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\n\\nstruct Entry_\\n{\\n\\tstring expr_;\\n\\tstring op_;\\n};\\n\\nbool PrecedenceLess(const string& lhs, const string& rhs, bool assoc)\\n{\\n\\tstatic const map<string, int> KNOWN({ { \\\"+\\\", 1 }, { \\\"-\\\", 1 }, { \\\"*\\\", 2 }, { \\\"/\\\", 2 }, { \\\"^\\\", 3 } });\\n\\tstatic const set<string> ASSOCIATIVE({ \\\"+\\\", \\\"*\\\" });\\n\\treturn (KNOWN.count(lhs) ? KNOWN.find(lhs)->second : 0) < (KNOWN.count(rhs) ? KNOWN.find(rhs)->second : 0) + (assoc && !ASSOCIATIVE.count(rhs) ? 1 : 0);\\n}\\nvoid Parenthesize(Entry_* old, const string& token, bool assoc)\\n{\\n\\tif (!old->op_.empty() && PrecedenceLess(old->op_, token, assoc))\\n\\t\\told->expr_ = '(' + old->expr_ + ')';\\n}\\n\\nvoid AddToken(stack<Entry_>* stack, const string& token)\\n{\\n\\tif (token.find_first_of(\\\"0123456789\\\") != string::npos)\\n\\t\\tstack->push(Entry_({ token, string() }));\\t// it's a number, no operator\\n\\telse\\n\\t{\\t// it's an operator\\n\\t\\tif (stack->size() < 2)\\n\\t\\t\\tcout<<\\\"Stack underflow\\\";\\n\\t\\tauto rhs = stack->top();\\n\\t\\tParenthesize(&rhs, token, false);\\n\\t\\tstack->pop();\\n\\t\\tauto lhs = stack->top();\\n\\t\\tParenthesize(&lhs, token, true);\\n\\t\\tstack->top().expr_ = lhs.expr_ + ' ' + token + ' ' + rhs.expr_;\\n\\t\\tstack->top().op_ = token;\\n\\t}\\n}\\n\\n\\nstring ToInfix(const string& src)\\n{\\n\\tstack<Entry_> stack;\\n\\tfor (auto start = src.begin(), p = src.begin(); ; ++p)\\n\\t{\\n\\t\\tif (p == src.end() || *p == ' ')\\n\\t\\t{\\n\\t\\t\\tif (p > start)\\n\\t\\t\\t\\tAddToken(&stack, string(start, p));\\n\\t\\t\\tif (p == src.end())\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tstart = p + 1;\\n\\t\\t}\\n\\t}\\n\\tif (stack.size() != 1)\\n\\t\\tcout<<\\\"Incomplete expression\\\";\\n\\treturn stack.top().expr_;\\n}\\n\\nint main(void)\\n{\\n\\ttry\\n\\t{\\n\\t\\tcout << ToInfix(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\") << \\\"\\\\n\\\";\\n\\t\\tcout << ToInfix(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\") << \\\"\\\\n\\\";\\n\\t\\treturn 0;\\n\\t}\\n\\tcatch (...)\\n\\t{\\n\\t\\tcout << \\\"Failed\\\\n\\\";\\n\\t\\treturn -1;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\nusing System.Text.RegularExpressions;\\n\\nnamespace PostfixToInfix\\n{\\n class Program\\n {\\n class Operator\\n {\\n public Operator(char t, int p, bool i = false)\\n {\\n Token = t;\\n Precedence = p;\\n IsRightAssociative = i;\\n }\\n\\n public char Token { get; private set; }\\n public int Precedence { get; private set; }\\n public bool IsRightAssociative { get; private set; }\\n }\\n\\n static IReadOnlyDictionary<char, Operator> operators = new Dictionary<char, Operator>\\n {\\n { '+', new Operator('+', 2) },\\n { '-', new Operator('-', 2) },\\n { '/', new Operator('/', 3) },\\n { '*', new Operator('*', 3) },\\n { '^', new Operator('^', 4, true) }\\n };\\n\\n class Expression\\n {\\n public String ex;\\n public Operator op;\\n\\n public Expression(String e)\\n {\\n ex = e;\\n }\\n\\n public Expression(String e1, String e2, Operator o)\\n {\\n ex = String.Format(\\\"{0} {1} {2}\\\", e1, o.Token, e2);\\n op = o;\\n }\\n }\\n\\n static String PostfixToInfix(String postfix)\\n {\\n var stack = new Stack<Expression>();\\n\\n foreach (var token in Regex.Split(postfix, @\\\"\\\\s+\\\"))\\n {\\n char c = token[0];\\n\\n var op = operators.FirstOrDefault(kv => kv.Key == c).Value;\\n if (op != null && token.Length == 1)\\n {\\n Expression rhs = stack.Pop();\\n Expression lhs = stack.Pop();\\n\\n int opPrec = op.Precedence;\\n\\n int lhsPrec = lhs.op != null ? lhs.op.Precedence : int.MaxValue;\\n int rhsPrec = rhs.op != null ? rhs.op.Precedence : int.MaxValue;\\n\\n if ((lhsPrec < opPrec || (lhsPrec == opPrec && c == '^')))\\n lhs.ex = '(' + lhs.ex + ')';\\n\\n if ((rhsPrec < opPrec || (rhsPrec == opPrec && c != '^')))\\n rhs.ex = '(' + rhs.ex + ')';\\n\\n stack.Push(new Expression(lhs.ex, rhs.ex, op));\\n }\\n else\\n {\\n stack.Push(new Expression(token));\\n }\\n\\n // print intermediate result\\n Console.WriteLine(\\\"{0} -> [{1}]\\\", token,\\n string.Join(\\\", \\\", stack.Reverse().Select(e => e.ex)));\\n }\\n return stack.Peek().ex;\\n }\\n\\n static void Main(string[] args)\\n {\\n string[] inputs = { \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", \\\"1 2 + 3 4 + ^ 5 6 + ^\\\" };\\n foreach (var e in inputs)\\n {\\n Console.WriteLine(\\\"Postfix : {0}\\\", e);\\n Console.WriteLine(\\\"Infix : {0}\\\", PostfixToInfix(e));\\n Console.WriteLine(); ;\\n }\\n Console.ReadLine();\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \";;;; Parsing/RPN to infix conversion\\n(defstruct (node (:print-function print-node)) opr infix)\\n(defun print-node (node stream depth)\\n (format stream \\\"opr:=~A infix:=\\\\\\\"~A\\\\\\\"\\\" (node-opr node) (node-infix node)))\\n\\n(defconstant OPERATORS '((#\\\\^ . 4) (#\\\\* . 3) (#\\\\/ . 3) (#\\\\+ . 2) (#\\\\- . 2)))\\n\\n;;; (char,char[,boolean])->boolean\\n(defun higher-p (opp opc &optional (left-node-p nil))\\n (or (> (cdr (assoc opp OPERATORS)) (cdr (assoc opc OPERATORS)))\\n (and left-node-p (char= opp #\\\\^) (char= opc #\\\\^))))\\n\\n;;; string->list\\n(defun string-split (expr)\\n (let ((p (position #\\\\Space expr)))\\n (if (null p) (list expr)\\n (append (list (subseq expr 0 p))\\n (string-split (subseq expr (1+ p)))))))\\n\\n;;; string->string\\n(defun parse (expr)\\n (let ((stack '()))\\n (format t \\\"TOKEN STACK~%\\\")\\n (dolist (tok (string-split expr))\\n (if (assoc (char tok 0) OPERATORS) ; operator?\\n (push (make-node :opr (char tok 0) :infix (infix (char tok 0) (pop stack) (pop stack))) stack)\\n (push tok stack))\\n\\n ;; print stack at each token\\n (format t \\\"~3,A\\\" tok)\\n (dotimes (i (length stack)) (format t \\\"~8,T[~D] ~A~%\\\" i (nth i stack))))\\n\\n ;; print final infix expression\\n (if (= (length stack) 1)\\n (format nil \\\"~A\\\" (node-infix (first stack)))\\n (format nil \\\"syntax error in ~A\\\" expr))))\\n\\n;;; (char,node,node)->string\\n(defun infix (operator rightn leftn)\\n\\n ;; (char,node[,boolean]->string\\n (defun string-node (operator anode &optional (left-node-p nil))\\n (if (stringp anode) anode\\n (if (higher-p operator (node-opr anode) left-node-p)\\n (format nil \\\"( ~A )\\\" (node-infix anode)) (node-infix anode))))\\n\\n (concatenate 'string\\n (string-node operator leftn t)\\n (format nil \\\" ~A \\\" operator)\\n (string-node operator rightn)))\\n\\n;;; nil->[printed infix expressions]\\n(defun main ()\\n (let ((expressions '(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"\\n \\\"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\\\")))\\n (dolist (expr expressions)\\n (format t \\\"~%Parsing:\\\\\\\"~A\\\\\\\"~%\\\" expr)\\n (format t \\\"RPN:\\\\\\\"~A\\\\\\\" INFIX:\\\\\\\"~A\\\\\\\"~%\\\" expr (parse expr)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.array;\\n\\nvoid parseRPN(in string e) {\\n enum nPrec = 9;\\n static struct Info { int prec; bool rAssoc; }\\n immutable /*static*/ opa = [\\\"^\\\": Info(4, true),\\n \\\"*\\\": Info(3, false),\\n \\\"/\\\": Info(3, false),\\n \\\"+\\\": Info(2, false),\\n \\\"-\\\": Info(2, false)];\\n\\n writeln(\\\"\\\\nPostfix input: \\\", e);\\n static struct Sf { int prec; string expr; }\\n Sf[] stack;\\n foreach (immutable tok; e.split()) {\\n writeln(\\\"Token: \\\", tok);\\n if (tok in opa) {\\n immutable op = opa[tok];\\n immutable rhs = stack.back;\\n stack.popBack();\\n auto lhs = &stack.back;\\n if (lhs.prec < op.prec ||\\n (lhs.prec == op.prec && op.rAssoc))\\n lhs.expr = \\\"(\\\" ~ lhs.expr ~ \\\")\\\";\\n lhs.expr ~= \\\" \\\" ~ tok ~ \\\" \\\";\\n lhs.expr ~= (rhs.prec < op.prec ||\\n (rhs.prec == op.prec && !op.rAssoc)) ?\\n \\\"(\\\" ~ rhs.expr ~ \\\")\\\" :\\n rhs.expr;\\n lhs.prec = op.prec;\\n } else\\n stack ~= Sf(nPrec, tok);\\n foreach (immutable f; stack)\\n writefln(` %d \\\"%s\\\"`, f.prec, f.expr);\\n }\\n writeln(\\\"Infix result: \\\", stack[0].expr);\\n}\\n\\nvoid main() {\\n foreach (immutable test; [\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"])\\n parseRPN(test);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.array, std.algorithm;\\n\\nvoid rpmToInfix(in string str) @safe {\\n static struct Exp { int p; string e; }\\n immutable P = (in Exp pair, in int prec) pure =>\\n pair.p < prec ? format(\\\"( %s )\\\", pair.e) : pair.e;\\n immutable F = (in string[] s...) pure nothrow => s.join(' ');\\n\\n writefln(\\\"=================\\\\n%s\\\", str);\\n Exp[] stack;\\n foreach (const w; str.split) {\\n if (w.isNumeric)\\n stack ~= Exp(9, w);\\n else {\\n const y = stack.back; stack.popBack;\\n const x = stack.back; stack.popBack;\\n switch (w) {\\n case \\\"^\\\": stack ~= Exp(4, F(P(x, 5), w, P(y, 4)));\\n break;\\n case \\\"*\\\", \\\"/\\\": stack ~= Exp(3, F(P(x, 3), w, P(y, 3)));\\n break;\\n case \\\"+\\\", \\\"-\\\": stack ~= Exp(2, F(P(x, 2), w, P(y, 2)));\\n break;\\n default: throw new Error(\\\"Wrong part: \\\" ~ w);\\n }\\n }\\n stack.map!q{ a.e }.writeln;\\n }\\n writeln(\\\"-----------------\\\\n\\\", stack.back.e);\\n}\\n\\nvoid main() {\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\".rpmToInfix;\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\".rpmToInfix;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(require 'hash)\\n(string-delimiter \\\"\\\")\\n\\n(define (^ a b ) (expt a b)) ;; add this not-native function\\n(define-syntax-rule (r-assoc? op) (= op \\\"^\\\"))\\n(define-syntax-rule (l-assoc? op) (not ( = op \\\"^\\\" )))\\n(define PRECEDENCES (list->hash\\n\\t'((\\\"+\\\" . 2) (\\\"-\\\" . 2) (\\\"*\\\" . 3) (\\\"/\\\" . 3) (\\\"//\\\" . 3) (\\\"^\\\" . 4))\\n\\t(make-hash)))\\n\\n;; RPN vector or list -> infix tree -> (a op (b op c) d) ..\\n(define (rpn->infix rpn)\\n(define S (stack 'S))\\n\\t(for ((token rpn))\\n\\t(if (procedure? token)\\n\\t\\t(let [(op2 (pop S)) (op1 (pop S))]\\n\\t\\t\\t(unless (and op1 op2) (error \\\"cannot translate expression\\\" rpn))\\n\\t \\t(push S (list op1 token op2))\\n\\t \\t)\\n\\t (push S token ))\\n\\t(writeln 'token (string token) 'stack (stack->list S)))\\n\\t(begin0\\n\\t\\t(pop S) ;; return (top S)\\n\\t\\t(unless (stack-empty? S) (error \\\"ill-formed rpn\\\" rpn)))\\n\\t)\\n\\t\\n;; a node tree is (left op right) or a number\\n(define-syntax-id _.left (first _)) ; mynode.left expands to (first mynode)\\n(define-syntax-id _.right (third _))\\n(define-syntax-id _.op (string (second _ )))\\n(define-syntax-rule (precedence node) (hash-ref PRECEDENCES (string (second node))))\\n\\n(define (left-par? node) ; does lhs needs ( lhs ) ?\\n\\t(cond\\n\\t[(number? node.left) #f]\\n\\t[(< (precedence node.left) (precedence node)) #t]\\n\\t[(and\\n\\t\\t \\t(r-assoc? node.op)\\n\\t\\t \\t(= (precedence node.left) (precedence node))) #t]\\n\\t[else #f]))\\n\\t\\n(define (right-par? node)\\n\\t(cond\\n\\t[(number? node.right) #f]\\n\\t[(< (precedence node.right) (precedence node)) #t]\\n\\t[(and\\n\\t\\t \\t(l-assoc? node.op)\\n\\t\\t \\t(= (precedence node.right) (precedence node))) #t]\\n\\t[else #f]))\\n\\t\\n;; infix tree -> char string\\n(define (infix->string node)\\n\\t(cond\\n\\t[(number? node) (string node)]\\n\\t[else (let\\n\\t\\t[(lhs (infix->string node.left))\\n\\t\\t(rhs (infix->string node.right))]\\n\\t\\t(when (left-par? node) (set! lhs (string-append \\\"(\\\" lhs \\\")\\\")))\\n\\t\\t(when (right-par? node) (set! rhs (string-append \\\"(\\\" rhs \\\")\\\")))\\n\\t\\t(string-append lhs \\\" \\\" node.op \\\" \\\" rhs))]))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"type ast =\\n | Num of int\\n | Add of ast * ast | Sub of ast * ast\\n | Mul of ast * ast | Div of ast * ast\\n | Exp of ast * ast\\n\\nlet (|Int|_|) = System.Int32.TryParse >> function | (true, v) -> Some(v) | (false, _) -> None\\n\\nlet rec parse =\\n function\\n | [] -> failwith \\\"Not enough tokens\\\"\\n | (Int head)::tail -> (Num(head), tail)\\n | op::tail ->\\n let (left, rest1) = parse tail\\n let (right, rest2) = parse rest1\\n match op with\\n | \\\"+\\\" -> (Add (right, left)), rest2\\n | \\\"-\\\" -> (Sub (right, left)), rest2\\n | \\\"*\\\" -> (Mul (right, left)), rest2\\n | \\\"/\\\" -> (Div (right, left)), rest2\\n | \\\"^\\\" -> (Exp (right, left)), rest2\\n | _ -> failwith (\\\"unknown op: \\\" + op)\\n\\nlet rec infix p x =\\n let brackets (x : ast) = seq { yield \\\"(\\\"; yield! infix 0 x; yield \\\")\\\" }\\n let left op context l r = seq { yield! infix context l; yield op; yield! infix context r }\\n let right op context l r = seq { yield! brackets l; yield op; yield! infix context r }\\n seq {\\n match x with\\n | Num (n) -> yield n.ToString()\\n | Add (l, r) when p <= 2 -> yield! left \\\"+\\\" 2 l r\\n | Sub (l, r) when p <= 2 -> yield! left \\\"-\\\" 2 l r\\n | Mul (l, r) when p <= 3 -> yield! left \\\"*\\\" 3 l r\\n | Div (l, r) when p <= 3 -> yield! left \\\"/\\\" 3 l r\\n | Exp (Exp(ll, lr), r) -> yield! right \\\"^\\\" 4 (Exp(ll,lr)) r\\n | Exp (l, r) -> yield! left \\\"^\\\" 4 l r\\n | _ -> yield! brackets x\\n }\\n\\n[<EntryPoint>]\\nlet main argv =\\n let (tree, rest) =\\n argv |> Array.rev |> Seq.toList |> parse\\n match rest with\\n | [] -> printfn \\\"%A\\\" tree\\n | _ -> failwith (\\\"not a valid RPN expression (excess tokens): \\\" + System.String.Join(\\\" \\\", argv))\\n Seq.iter (printf \\\" %s\\\") (infix 0 tree); printfn \\\"\\\"\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nvar tests = []string{\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\",\\n}\\n\\nvar opa = map[string]struct {\\n prec int\\n rAssoc bool\\n}{\\n \\\"^\\\": {4, true},\\n \\\"*\\\": {3, false},\\n \\\"/\\\": {3, false},\\n \\\"+\\\": {2, false},\\n \\\"-\\\": {2, false},\\n}\\n\\nconst nPrec = 9\\n\\nfunc main() {\\n for _, t := range tests {\\n parseRPN(t)\\n }\\n}\\n\\nfunc parseRPN(e string) {\\n fmt.Println(\\\"\\\\npostfix:\\\", e)\\n type sf struct {\\n prec int\\n expr string\\n }\\n var stack []sf\\n for _, tok := range strings.Fields(e) {\\n fmt.Println(\\\"token:\\\", tok)\\n if op, isOp := opa[tok]; isOp {\\n rhs := &stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n lhs := &stack[len(stack)-1]\\n if lhs.prec < op.prec || (lhs.prec == op.prec && op.rAssoc) {\\n lhs.expr = \\\"(\\\" + lhs.expr + \\\")\\\"\\n }\\n lhs.expr += \\\" \\\" + tok + \\\" \\\"\\n if rhs.prec < op.prec || (rhs.prec == op.prec && !op.rAssoc) {\\n lhs.expr += \\\"(\\\" + rhs.expr + \\\")\\\"\\n } else {\\n lhs.expr += rhs.expr\\n }\\n lhs.prec = op.prec\\n } else {\\n stack = append(stack, sf{nPrec, tok})\\n }\\n for _, f := range stack {\\n fmt.Printf(\\\" %d %q\\\\n\\\", f.prec, f.expr)\\n }\\n }\\n fmt.Println(\\\"infix:\\\", stack[0].expr)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"class PostfixToInfix {\\n static class Expression {\\n final static String ops = \\\"-+/*^\\\"\\n\\n String op, ex\\n int precedence = 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 precedence = (ops.indexOf(o) / 2) as int\\n }\\n\\n @Override\\n String toString() {\\n return ex\\n }\\n }\\n\\n static String postfixToInfix(final String postfix) {\\n Stack<Expression> expr = new Stack<>()\\n\\n for (String token in postfix.split(\\\"\\\\\\\\s+\\\")) {\\n char c = token.charAt(0)\\n int idx = Expression.ops.indexOf(c as int)\\n if (idx != -1 && token.length() == 1) {\\n\\n Expression r = expr.pop()\\n Expression l = expr.pop()\\n\\n int opPrecedence = (idx / 2) as int\\n\\n if (l.precedence < opPrecedence || (l.precedence == opPrecedence && c == '^' as char))\\n l.ex = '(' + l.ex + ')'\\n\\n if (r.precedence < opPrecedence || (r.precedence == opPrecedence && c != '^' as char))\\n r.ex = '(' + r.ex + ')'\\n\\n expr << new Expression(l.ex, r.ex, token)\\n } else {\\n expr << new Expression(token)\\n }\\n printf \\\"%s -> %s%n\\\", token, expr\\n }\\n expr.peek().ex\\n }\\n\\n static void main(String[] args) {\\n ([\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"]).each { String e ->\\n printf \\\"Postfix : %s%n\\\", e\\n printf \\\"Infix : %s%n\\\", postfixToInfix(e)\\n println()\\n }\\n }\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"import Debug.Trace\\n\\ndata Expression = Const String | Exp Expression String Expression\\n\\n------------- INFIX EXPRESSION FROM RPN STRING -----------\\n\\ninfixFromRPN :: String -> Expression\\ninfixFromRPN = head . foldl buildExp [] . words\\n\\nbuildExp :: [Expression] -> String -> [Expression]\\nbuildExp stack x\\n | (not . isOp) x =\\n let v = Const x : stack\\n in trace (show v) v\\n | otherwise =\\n let v = Exp l x r : rest\\n in trace (show v) v\\n where\\n r : l : rest = stack\\n isOp = (`elem` [\\\"^\\\", \\\"*\\\", \\\"/\\\", \\\"+\\\", \\\"-\\\"])\\n\\n\\n--------------------------- TEST -------------------------\\nmain :: IO ()\\nmain =\\n mapM_\\n ( \\\\s ->\\n putStr (s <> \\\"\\\\n-->\\\\n\\\")\\n >> (print . infixFromRPN)\\n s\\n >> putStrLn []\\n )\\n [ \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\",\\n \\\"1 4 + 5 3 + 2 3 * * *\\\",\\n \\\"1 2 * 3 4 * *\\\",\\n \\\"1 2 + 3 4 + +\\\"\\n ]\\n\\n---------------------- SHOW INSTANCE ---------------------\\ninstance Show Expression where\\n show (Const x) = x\\n show exp@(Exp l op r) = left <> \\\" \\\" <> op <> \\\" \\\" <> right\\n where\\n left\\n | leftNeedParen = \\\"( \\\" <> show l <> \\\" )\\\"\\n | otherwise = show l\\n right\\n | rightNeedParen = \\\"( \\\" <> show r <> \\\" )\\\"\\n | otherwise = show r\\n leftNeedParen =\\n (leftPrec < opPrec)\\n || ((leftPrec == opPrec) && rightAssoc exp)\\n rightNeedParen =\\n (rightPrec < opPrec)\\n || ((rightPrec == opPrec) && leftAssoc exp)\\n leftPrec = precedence l\\n rightPrec = precedence r\\n opPrec = precedence exp\\n\\nleftAssoc :: Expression -> Bool\\nleftAssoc (Const _) = False\\nleftAssoc (Exp _ op _) = op `notElem` [\\\"^\\\", \\\"*\\\", \\\"+\\\"]\\n\\nrightAssoc :: Expression -> Bool\\nrightAssoc (Const _) = False\\nrightAssoc (Exp _ op _) = op == \\\"^\\\"\\n\\nprecedence :: Expression -> Int\\nprecedence (Const _) = 5\\nprecedence (Exp _ op _)\\n | op == \\\"^\\\" = 4\\n | op `elem` [\\\"*\\\", \\\"/\\\"] = 3\\n | op `elem` [\\\"+\\\", \\\"-\\\"] = 2\\n | otherwise = 0\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\nevery rpn := ![\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", # reqd\\n \\\"1 2 + 3 4 + 5 6 + ^ ^\\\",\\n \\\"1 2 + 3 4 + 5 6 + ^ ^\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\" # reqd\\n ] do {\\n printf(\\\"\\\\nRPN = %i\\\\n\\\",rpn)\\n printf(\\\"infix = %i\\\\n\\\",RPN2Infix(rpn,show))\\n show := 1 # turn off inner working display\\n }\\nend\\n\\nlink printf\\n\\nprocedure RPN2Infix(expr,show) #: RPN to Infix conversion\\nstatic oi\\ninitial {\\n oi := table([9,\\\"'\\\"]) # precedence & associativity\\n every oi[!\\\"+-\\\"] := [2,\\\"l\\\"] # 2L\\n every oi[!\\\"*/\\\"] := [3,\\\"l\\\"] # 3L\\n oi[\\\"^\\\"] := [4,\\\"r\\\"] # 4R\\n }\\n\\n show := if /show then printf else 1 # to show inner workings or not\\n stack := []\\n expr ? until pos(0) do { # Reformat as a tree\\n tab(many(' ')) # consume previous seperator\\n token := tab(upto(' ')|0) # get token\\n if token := numeric(token) then { # ... numeric\\n push(stack,oi[token]|||[token])\\n show(\\\"pushed numeric %i : %s\\\\n\\\",token,list2string(stack))\\n }\\n else { # ... operator\\n every b|a := pop(stack) # pop & reverse operands\\n pr := oi[token,1]\\n as := oi[token,2]\\n if a[1] < pr | (a[1] = pr & oi[token,2] == \\\"r\\\") then\\n a[3] := sprintf(\\\"( %s )\\\",a[3])\\n if b[1] < pr | (b[1] == pr & oi[token,2] == \\\"l\\\") then\\n b[3] := sprintf(\\\"( %s )\\\",b[3])\\n s := sprintf(\\\"%s %s %s\\\",a[3],token,b[3])\\n push(stack,[pr,as,s]) # stack [prec, assoc, expr]\\n show(\\\"applied operator %s : %s\\\\n\\\",token,list2string(stack))\\n }\\n }\\n\\n if *stack ~= 1 then stop(\\\"Parser failure\\\")\\n return stack[1,3]\\nend\\n\\nprocedure list2string(L) #: format list as a string\\n s := \\\"[ \\\"\\n every x := !L do\\n s ||:= ( if type(x) == \\\"list\\\" then list2string(x)\\n else x) || \\\" \\\"\\n return s || \\\"]\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"tokenize=: ' ' <;._1@, deb\\n\\nops=: ;:'+ - * / ^'\\ndoOp=: plus`minus`times`divide`exponent`push@.(ops&i.)\\nparse=:3 :0\\n stack=: i.0 2\\n for_token.tokenize y do.doOp token end.\\n 1{:: ,stack\\n)\\n\\nparens=:4 :0\\n if. y do. '( ',x,' )' else. x end.\\n)\\n\\nNB. m: precedence, n: is right associative, y: token\\nop=:2 :0\\n L=. m - n\\n R=. m - -.n\\n smoutput;'operation: ';y\\n 'Lprec left Rprec right'=. ,_2{.stack\\n expr=. ;(left parens L > Lprec);' ';y,' ';right parens R > Rprec\\n stack=: (_2}.stack),m;expr\\n smoutput stack\\n)\\n\\nplus=: 2 op 0\\nminus=: 2 op 0\\ntimes=: 3 op 0\\ndivide=: 3 op 0\\nexponent=: 4 op 1\\n\\npush=:3 :0\\n smoutput;'pushing: ';y\\n stack=: stack,_;y\\n smoutput stack\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" parse '3 4 2 * 1 5 - 2 3 ^ ^ / +'\\npushing: 3\\n+-+-+\\n|_|3|\\n+-+-+\\npushing: 4\\n+-+-+\\n|_|3|\\n+-+-+\\n|_|4|\\n+-+-+\\npushing: 2\\n+-+-+\\n|_|3|\\n+-+-+\\n|_|4|\\n+-+-+\\n|_|2|\\n+-+-+\\noperation: *\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\npushing: 1\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|_|1 |\\n+-+-----+\\npushing: 5\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|_|1 |\\n+-+-----+\\n|_|5 |\\n+-+-----+\\noperation: -\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|2|1 - 5|\\n+-+-----+\\npushing: 2\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|2|1 - 5|\\n+-+-----+\\n|_|2 |\\n+-+-----+\\npushing: 3\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|2|1 - 5|\\n+-+-----+\\n|_|2 |\\n+-+-----+\\n|_|3 |\\n+-+-----+\\noperation: ^\\n+-+-----+\\n|_|3 |\\n+-+-----+\\n|3|4 * 2|\\n+-+-----+\\n|2|1 - 5|\\n+-+-----+\\n|4|2 ^ 3|\\n+-+-----+\\noperation: ^\\n+-+-----------------+\\n|_|3 |\\n+-+-----------------+\\n|3|4 * 2 |\\n+-+-----------------+\\n|4|( 1 - 5 ) ^ 2 ^ 3|\\n+-+-----------------+\\noperation: /\\n+-+-------------------------+\\n|_|3 |\\n+-+-------------------------+\\n|3|4 * 2 / ( 1 - 5 ) ^ 2 ^ 3|\\n+-+-------------------------+\\noperation: +\\n+-+-----------------------------+\\n|2|3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3|\\n+-+-----------------------------+\\n3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Stack;\\n\\npublic class PostfixToInfix {\\n\\n public static void main(String[] args) {\\n for (String e : new String[]{\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"}) {\\n System.out.printf(\\\"Postfix : %s%n\\\", e);\\n System.out.printf(\\\"Infix : %s%n\\\", postfixToInfix(e));\\n System.out.println();\\n }\\n }\\n\\n static String postfixToInfix(final String postfix) {\\n\\n class Expression {\\n final static String ops = \\\"-+/*^\\\";\\n\\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 @Override\\n public String toString() {\\n return ex;\\n }\\n }\\n\\n Stack<Expression> expr = new Stack<>();\\n\\n for (String token : postfix.split(\\\"\\\\\\\\s+\\\")) {\\n char c = token.charAt(0);\\n int idx = Expression.ops.indexOf(c);\\n if (idx != -1 && token.length() == 1) {\\n\\n Expression r = expr.pop();\\n Expression l = expr.pop();\\n\\n int opPrec = idx / 2;\\n\\n if (l.prec < opPrec || (l.prec == opPrec && c == '^'))\\n l.ex = '(' + l.ex + ')';\\n\\n if (r.prec < opPrec || (r.prec == opPrec && c != '^'))\\n r.ex = '(' + r.ex + ')';\\n\\n expr.push(new Expression(l.ex, r.ex, token));\\n } else {\\n expr.push(new Expression(token));\\n }\\n System.out.printf(\\\"%s -> %s%n\\\", token, expr);\\n }\\n return expr.peek().ex;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const Associativity = {\\n /** a / b / c = (a / b) / c */\\n left: 0,\\n /** a ^ b ^ c = a ^ (b ^ c) */\\n right: 1,\\n /** a + b + c = (a + b) + c = a + (b + c) */\\n both: 2,\\n};\\nconst operators = {\\n '+': { precedence: 2, associativity: Associativity.both },\\n '-': { precedence: 2, associativity: Associativity.left },\\n '*': { precedence: 3, associativity: Associativity.both },\\n '/': { precedence: 3, associativity: Associativity.left },\\n '^': { precedence: 4, associativity: Associativity.right },\\n};\\nclass NumberNode {\\n constructor(text) { this.text = text; }\\n toString() { return this.text; }\\n}\\nclass InfixNode {\\n constructor(fnname, operands) {\\n this.fnname = fnname;\\n this.operands = operands;\\n }\\n toString(parentPrecedence = 0) {\\n const op = operators[this.fnname];\\n const leftAdd = op.associativity === Associativity.right ? 0.01 : 0;\\n const rightAdd = op.associativity === Associativity.left ? 0.01 : 0;\\n if (this.operands.length !== 2) throw Error(\\\"invalid operand count\\\");\\n const result = this.operands[0].toString(op.precedence + leftAdd)\\n +` ${this.fnname} ${this.operands[1].toString(op.precedence + rightAdd)}`;\\n if (parentPrecedence > op.precedence) return `( ${result} )`;\\n else return result;\\n }\\n}\\nfunction rpnToTree(tokens) {\\n const stack = [];\\n console.log(`input = ${tokens}`);\\n for (const token of tokens.split(\\\" \\\")) {\\n if (token in operators) {\\n const op = operators[token], arity = 2; // all of these operators take 2 arguments\\n if (stack.length < arity) throw Error(\\\"stack error\\\");\\n stack.push(new InfixNode(token, stack.splice(stack.length - arity)));\\n }\\n else stack.push(new NumberNode(token));\\n console.log(`read ${token}, stack = [${stack.join(\\\", \\\")}]`);\\n }\\n if (stack.length !== 1) throw Error(\\\"stack error \\\" + stack);\\n return stack[0];\\n}\\nconst tests = [\\n [\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"],\\n [\\\"1 2 + 3 4 + ^ 5 6 + ^\\\", \\\"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\\\"],\\n [\\\"1 2 3 + +\\\", \\\"1 + 2 + 3\\\"] // test associativity (1+(2+3)) == (1+2+3)\\n];\\nfor (const [inp, oup] of tests) {\\n const realOup = rpnToTree(inp).toString();\\n console.log(realOup === oup ? \\\"Correct!\\\" : \\\"Incorrect!\\\");\\n}\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"### PEG infrastructure\\ndef box(E):\\n ((.result = null) | E) as $e\\n | .remainder = $e.remainder\\n | .result += [$e.result] # the magic sauce\\n ;\\n\\n### Tokenize the RPN string.\\n# Input: a string representing an expression using RPN.\\n# Output: an array of corresponding tokens.\\ndef tokens:\\n [splits(\\\"[ \\\\n\\\\r\\\\t]+\\\")]\\n | map(select(. != \\\"\\\")\\n | . as $in\\n | try tonumber catch $in);\\n\\n### Parse the reversed array of tokens as produced by `tokens`.\\n# On entry, .remainder should be the reversed array.\\n# Output: {remainder, result}\\ndef rrpn:\\n def found: .result += [.remainder[0]] | (.remainder |= .[1:]);\\n def nonempty: select(.remainder|length>0);\\n def check(predicate):\\n nonempty | select(.remainder[0] | predicate);\\n\\n def recognize(predicate): check(predicate) | found;\\n\\n def number : recognize(type==\\\"number\\\");\\n def operator: recognize(type==\\\"string\\\");\\n def operand : number // rrpn;\\n box(operator | operand | operand);\\n\\n# Input: an array of tokens as produced by `tokens`\\n# Output: the infix equivalent expressed as a string.\\ndef tokens2infix:\\n def infix:\\n if type != \\\"array\\\" then .\\n elif length == 1 then .[0] | infix\\n elif length == 3 then \\\"(\\\\(.[2] | infix) \\\\(.[0]) \\\\(.[1] | infix))\\\"\\n else error\\n end;\\n\\n {remainder: reverse} | rrpn | .result | infix;\\n\\n# Input: an RPN string\\n# Output: the equivalent expression as a string using infix notation\\ndef rpn2infix: tokens | tokens2infix;\\n\\ndef tests:\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"\\n;\\n\\ntests | \\\"\\\\\\\"\\\\(.)\\\\\\\" =>\\\", rpn2infix, \\\"\\\"\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function parseRPNstring(rpns)\\n infix = []\\n rpn = split(rpns)\\n for tok in rpn\\n if all(isnumber, tok)\\n push!(infix, parse(Int, tok))\\n else\\n last = pop!(infix)\\n prev = pop!(infix)\\n push!(infix, Expr(:call, Symbol(tok), prev, last))\\n println(\\\"Current step: $infix\\\")\\n end\\n end\\n infix\\nend\\n\\nunany(s) = replace(string(s), r\\\"Any\\\\[:\\\\((.+)\\\\)\\\\]\\\", s\\\"\\\\1\\\")\\n\\nprintln(\\\"The final infix result: \\\", parseRPNstring(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\") |> unany, \\\"\\\\n\\\")\\nprintln(\\\"The final infix result: \\\", parseRPNstring(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\") |> unany)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.0\\n\\nimport java.util.Stack\\n\\nclass Expression(var ex: String, val op: String = \\\"\\\", val prec: Int = 3) {\\n\\n constructor(e1: String, e2: String, o: String) :\\n this(\\\"$e1 $o $e2\\\", o, OPS.indexOf(o) / 2)\\n\\n override fun toString() = ex\\n\\n companion object {\\n const val OPS = \\\"-+/*^\\\"\\n }\\n}\\n\\nfun postfixToInfix(postfix: String): String {\\n val expr = Stack<Expression>()\\n val rx = Regex(\\\"\\\"\\\"\\\\s+\\\"\\\"\\\")\\n for (token in postfix.split(rx)) {\\n val c = token[0]\\n val idx = Expression.OPS.indexOf(c)\\n if (idx != -1 && token.length == 1) {\\n val r = expr.pop()\\n val l = expr.pop()\\n val opPrec = idx / 2\\n if (l.prec < opPrec || (l.prec == opPrec && c == '^')) {\\n l.ex = \\\"(${l.ex})\\\"\\n }\\n if (r.prec < opPrec || (r.prec == opPrec && c != '^')) {\\n r.ex = \\\"(${r.ex})\\\"\\n }\\n expr.push(Expression(l.ex, r.ex, token))\\n }\\n else {\\n expr.push(Expression(token))\\n }\\n println(\\\"$token -> $expr\\\")\\n }\\n return expr.peek().ex\\n}\\n\\nfun main(args: Array<String>) {\\n val es = listOf(\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"\\n )\\n for (e in es) {\\n println(\\\"Postfix : $e\\\")\\n println(\\\"Infix : ${postfixToInfix(e)}\\\\n\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function tokenize(rpn)\\n local out = {}\\n local cnt = 0\\n for word in rpn:gmatch(\\\"%S+\\\") do\\n table.insert(out, word)\\n cnt = cnt + 1\\n end\\n return {tokens = out, pos = 1, size = cnt}\\nend\\n\\nfunction advance(lex)\\n if lex.pos <= lex.size then\\n lex.pos = lex.pos + 1\\n return true\\n else\\n return false\\n end\\nend\\n\\nfunction current(lex)\\n return lex.tokens[lex.pos]\\nend\\n\\nfunction isOperator(sym)\\n return sym == '+' or sym == '-'\\n or sym == '*' or sym == '/'\\n or sym == '^'\\nend\\n\\nfunction buildTree(lex)\\n local stack = {}\\n\\n while lex.pos <= lex.size do\\n local sym = current(lex)\\n advance(lex)\\n\\n if isOperator(sym) then\\n local b = table.remove(stack)\\n local a = table.remove(stack)\\n\\n local t = {op=sym, left=a, right=b}\\n table.insert(stack, t)\\n else\\n table.insert(stack, sym)\\n end\\n end\\n\\n return table.remove(stack)\\nend\\n\\nfunction infix(tree)\\n if type(tree) == \\\"table\\\" then\\n local a = {}\\n local b = {}\\n\\n if type(tree.left) == \\\"table\\\" then\\n a = '(' .. infix(tree.left) .. ')'\\n else\\n a = tree.left\\n end\\n\\n if type(tree.right) == \\\"table\\\" then\\n b = '(' .. infix(tree.right) .. ')'\\n else\\n b = tree.right\\n end\\n\\n return a .. ' ' .. tree.op .. ' ' .. b\\n else\\n return tree\\n end\\nend\\n\\nfunction convert(str)\\n local lex = tokenize(str)\\n local tree = buildTree(lex)\\n print(infix(tree))\\nend\\n\\nfunction main()\\n convert(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n convert(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\")\\nend\\n\\nmain()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Rpn_2_Infix {\\n\\tRem Form 80,60\\n\\tfunction rpn_to_infix$(a$) {\\n\\t\\tdef m=0\\n\\t\\tinventory precendence=\\\"-\\\":=2,\\\"+\\\":=2,\\\"*\\\":=3,\\\"/\\\":=3,\\\"^\\\":=4\\n\\t\\tdim token$()\\n\\t\\ttoken$()=piece$(a$,\\\" \\\")\\n\\t\\tl=len(token$())\\n\\t\\tdim type(l)=0, right(l)=0, infix$(l)\\n\\t\\tinfix=-1\\n\\t\\tfor i=0 to l-1\\n\\t\\t\\tif exist(precendence, token$(i)) then\\n\\t\\t\\t\\ttype(i)=precendence(token$(i))\\n\\t\\t\\t\\tif type(i)=4 then right(i)=-1\\n\\t\\t\\tend if\\n\\t\\t\\tif type(i)=0 then\\n\\t\\t\\t\\tinfix++\\n\\t\\t\\t\\tinfix$(infix)=token$(i)\\n\\t\\t\\t\\ttype(infix)=100\\n\\t\\t\\telse\\n\\t\\t\\t\\tif right(i) then\\n\\t\\t\\t\\t\\tif type(infix)<type(i) then infix$(infix)=\\\"(\\\"+infix$(infix)+\\\")\\\"\\n\\t\\t\\t\\t\\tif type(infix-1)<100 then infix$(infix-1)=\\\"(\\\"+infix$(infix-1)+\\\")\\\"\\n\\t\\t\\t\\t\\tinfix$(infix-1)=infix$(infix-1)+token$(i)+infix$(infix)\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tif type(infix)<type(i) then infix$(infix)=\\\"(\\\"+infix$(infix)+\\\")\\\"\\n\\t\\t\\t\\t\\tif type(infix-1)<type(i) then\\n\\t\\t\\t\\t\\t\\tinfix$(infix-1)=\\\"(\\\"+infix$(infix-1)+\\\")\\\"+token$(i)+infix$(infix)\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tinfix$(infix-1)=infix$(infix-1)+token$(i)+infix$(infix)\\n\\t\\t\\t\\t\\tend if\\n\\t\\t\\t\\tend if\\n\\t\\t\\t\\ttype(infix-1)=type(i)\\n\\t\\t\\t\\tinfix--\\n\\t\\t\\tend if\\n\\t\\t\\tinf=each(infix$(),1, infix+1)\\n\\t\\t\\twhile inf\\n\\t\\t\\t\\texport$<=token$(i)+\\\" [\\\"+str$(inf^,\\\"\\\")+\\\"] \\\"+ array$(inf)+{\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttoken$(i)=\\\" \\\"\\n\\t\\t\\tend while\\n\\t\\tnext i\\n\\t\\t=infix$(0)\\n\\t}\\n\\tGlobal export$\\n\\tdocument export$\\n\\texample1=rpn_to_infix$(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")=\\\"3+4*2/(1-5)^2^3\\\"\\n\\texample2=rpn_to_infix$(\\\"1 2 + 3 4 + ^ 5 6 + ^\\\")=\\\"((1+2)^(3+4))^(5+6)\\\"\\n\\t\\\\\\\\ a test from Phix example\\n\\texample3=rpn_to_infix$(\\\"moon stars mud + * fire soup * ^\\\")=\\\"(moon*(stars+mud))^(fire*soup)\\\"\\n\\tPrint example1, example2, example3\\n\\tRem Print #-2, Export$\\n\\tClipBoard Export$\\n\\n}\\nRpn_2_Infix\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"import tables, strutils\\n\\nconst nPrec = 9\\n\\nlet ops: Table[string, tuple[prec: int, rAssoc: bool]] =\\n { \\\"^\\\": (4, true)\\n , \\\"*\\\": (3, false)\\n , \\\"/\\\": (3, false)\\n , \\\"+\\\": (2, false)\\n , \\\"-\\\": (2, false)\\n }.toTable\\n\\nproc parseRPN(e: string) =\\n echo \\\"postfix: \\\", e\\n var stack = newSeq[tuple[prec: int, expr: string]]()\\n\\n for tok in e.split:\\n echo \\\"Token: \\\", tok\\n if ops.hasKey tok:\\n let op = ops[tok]\\n let rhs = stack.pop\\n var lhs = stack.pop\\n\\n if lhs.prec < op.prec or (lhs.prec == op.prec and op.rAssoc):\\n lhs.expr = \\\"(\\\" & lhs.expr & \\\")\\\"\\n\\n lhs.expr.add \\\" \\\" & tok & \\\" \\\"\\n\\n if rhs.prec < op.prec or (rhs.prec == op.prec and not op.rAssoc):\\n lhs.expr.add \\\"(\\\" & rhs.expr & \\\")\\\"\\n else:\\n lhs.expr.add rhs.expr\\n\\n lhs.prec = op.prec\\n stack.add lhs\\n else:\\n stack.add((nPrec, tok))\\n\\n for f in stack:\\n echo \\\" \\\", f.prec, \\\" \\\", f.expr\\n\\n echo \\\"infix: \\\", stack[0].expr\\n\\nfor test in [\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"]:\\n test.parseRPN\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nmy $number = '[+-/$]?(?:\\\\.\\\\d+|\\\\d+(?:\\\\.\\\\d*)?)';\\nmy $operator = '[-+*/^]';\\n\\nmy @tests = ('1 2 + 3 4 + ^ 5 6 + ^', '3 4 2 * 1 5 - 2 3 ^ ^ / +');\\n\\nfor (@tests) {\\n my(@elems,$n);\\n $n = -1;\\n while (\\n s/\\n \\\\s* (?<left>$number) # 1st operand (will be 'left' in infix)\\n \\\\s+ (?<right>$number) # 2nd operand (will be 'right' in infix)\\n \\\\s+ (?<op>$operator) # operator\\n (?:\\\\s+|$) # more to parse, or done?\\n /\\n ' '.('$'.++$n).' ' # placeholders\\n /ex) {\\n $elems[$n] = \\\"($+{left}$+{op}$+{right})\\\" # infix expression\\n }\\n while (\\n s/ (\\\\$)(\\\\d+) # for each placeholder\\n / $elems[$2] # evaluate expression, substitute numeric value\\n /ex\\n ) { say } # track progress\\n say '=>' . substr($_,2,-2).\\\"\\\\n\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">operators</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"/\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">precedence</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">rassoc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">'r'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'l'</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'l'</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">expr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">ops</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">expr</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">lhs</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rhs</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">lprec</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rprec</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Postfix input: %-32s%s\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">expr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">show_workings</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"error\\\"</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">op</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">operators</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"error\\\"</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">rprec</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rhs</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[$];</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">lprec</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lhs</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[$]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">precedence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">assoc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rassoc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lprec</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">lprec</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">assoc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'r'</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">lhs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"(\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">lhs</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\")\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rprec</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rprec</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">assoc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">'l'</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">rhs</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"(\\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">rhs</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\")\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">prec</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">lhs</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">rhs</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">?{</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Infix result: %s [%s]\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">expected</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"ok\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"**ERROR**\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + ^ 5 6 + ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"((1 + 2) ^ (3 + 4)) ^ (5 + 6)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + 5 6 + ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(1 + 2) ^ (3 + 4) ^ (5 + 6)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"moon stars mud + * fire soup * ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(moon * (stars + mud)) ^ (fire * soup)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"((3 ^ 4) ^ 2 ^ 9) ^ 2 ^ 5\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 6 * * + +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"error\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"error\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 4 + 5 3 + 2 3 * * *\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(1 + 4) * (5 + 3) * 2 * 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 * 3 4 * *\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 * 2 * 3 * 4\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 + 2 + 3 + 4\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(1 + 2) ^ (3 + 4)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 6 ^ 7 ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(5 ^ 6) ^ 7\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 4 3 2 ^ ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 ^ 4 ^ 3 ^ 2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 3 + +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 + 2 + 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 + 2 + 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 3 ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 ^ 2 ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 ^ 3 ^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(1 ^ 2) ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 1 - 3 +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 - 1 + 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 1 1 - +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 + 1 - 1\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- [txr says 3 + (1 - 1)]</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 2 3 + -\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 - (2 + 3)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 3 2 + +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 + 3 + 2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 4 3 2 + + +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 + 4 + 3 + 2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 4 3 2 * * *\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 * 4 * 3 * 2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 4 3 2 + - +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 + 4 - (3 + 2)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- [python says 5 + (4 - (3 + 2))]</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 5 * -\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 - 4 * 5\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 5 - *\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 * (4 - 5)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- [python says (3 - 4) * 5] [!!flagged!!]</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 - 5 *\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"(3 - 4) * 5\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 2 * 1 5 - +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 * 2 + 1 - 5\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- [python says 4 * 2 + (1 - 5)]</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 2 * 1 5 - 2 ^ /\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 * 2 / (1 - 5) ^ 2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">parseRPN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de leftAssoc (Op)\\n (member Op '(\\\"*\\\" \\\"/\\\" \\\"+\\\" \\\"-\\\")) )\\n\\n(de precedence (Op)\\n (case Op\\n (\\\"\\\\^\\\" 4)\\n ((\\\"*\\\" \\\"/\\\") 3)\\n ((\\\"+\\\" \\\"-\\\") 2) ) )\\n\\n(de rpnToInfix (Str)\\n (let Stack NIL\\n (prinl \\\"Token Stack\\\")\\n (for Token (str Str \\\"_\\\")\\n (cond\\n ((num? Token) (push 'Stack (cons 9 @))) # Highest precedence\\n ((not (cdr Stack)) (quit \\\"Stack empty\\\"))\\n (T\\n (let (X (pop 'Stack) P (precedence Token))\\n (set Stack\\n (cons P\\n (pack\\n (if ((if (leftAssoc Token) < <=) (caar Stack) P)\\n (pack \\\"(\\\" (cdar Stack) \\\")\\\")\\n (cdar Stack) )\\n \\\" \\\" Token \\\" \\\"\\n (if ((if (leftAssoc Token) <= <) (car X) P)\\n (pack \\\"(\\\" (cdr X) \\\")\\\")\\n (cdr X) ) ) ) ) ) ) )\\n (prin Token)\\n (space 6)\\n (println Stack) )\\n (prog1 (cdr (pop 'Stack))\\n (and Stack (quit \\\"Garbage remained on stack\\\")) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (rpnToInfix \\\"3 4 2 * 1 5 - 2 3 \\\\^ \\\\^ / +\\\")\\nToken Stack\\n3 ((9 . 3))\\n4 ((9 . 4) (9 . 3))\\n2 ((9 . 2) (9 . 4) (9 . 3))\\n* ((3 . \\\"4 * 2\\\") (9 . 3))\\n1 ((9 . 1) (3 . \\\"4 * 2\\\") (9 . 3))\\n5 ((9 . 5) (9 . 1) (3 . \\\"4 * 2\\\") (9 . 3))\\n- ((2 . \\\"1 - 5\\\") (3 . \\\"4 * 2\\\") (9 . 3))\\n2 ((9 . 2) (2 . \\\"1 - 5\\\") (3 . \\\"4 * 2\\\") (9 . 3))\\n3 ((9 . 3) (9 . 2) (2 . \\\"1 - 5\\\") (3 . \\\"4 * 2\\\") (9 . 3))\\n^ ((4 . \\\"2 \\\\^ 3\\\") (2 . \\\"1 - 5\\\") (3 . \\\"4 * 2\\\") (9 . 3))\\n^ ((4 . \\\"(1 - 5) \\\\^ 2 \\\\^ 3\\\") (3 . \\\"4 * 2\\\") (9 . 3))\\n/ ((3 . \\\"4 * 2 / (1 - 5) \\\\^ 2 \\\\^ 3\\\") (9 . 3))\\n+ ((2 . \\\"3 + 4 * 2 / (1 - 5) \\\\^ 2 \\\\^ 3\\\"))\\n-> \\\"3 + 4 * 2 / (1 - 5) \\\\^ 2 \\\\^ 3\\\"\\n\\n: (rpnToInfix \\\"1 2 + 3 4 + \\\\^ 5 6 + \\\\^\\\")\\nToken Stack\\n1 ((9 . 1))\\n2 ((9 . 2) (9 . 1))\\n+ ((2 . \\\"1 + 2\\\"))\\n3 ((9 . 3) (2 . \\\"1 + 2\\\"))\\n4 ((9 . 4) (9 . 3) (2 . \\\"1 + 2\\\"))\\n+ ((2 . \\\"3 + 4\\\") (2 . \\\"1 + 2\\\"))\\n^ ((4 . \\\"(1 + 2) \\\\^ (3 + 4)\\\"))\\n5 ((9 . 5) (4 . \\\"(1 + 2) \\\\^ (3 + 4)\\\"))\\n6 ((9 . 6) (9 . 5) (4 . \\\"(1 + 2) \\\\^ (3 + 4)\\\"))\\n+ ((2 . \\\"5 + 6\\\") (4 . \\\"(1 + 2) \\\\^ (3 + 4)\\\"))\\n^ ((4 . \\\"((1 + 2) \\\\^ (3 + 4)) \\\\^ (5 + 6)\\\"))\\n-> \\\"((1 + 2) \\\\^ (3 + 4)) \\\\^ (5 + 6)\\\"\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* Uses a push-down pop-up stack for the stack (instead of array) */\\ncvt: procedure options (main); /* 10 Sept. 2012 */\\n declare (true initial ('1'b), false initial ('0'b) ) bit (1);\\n declare list character (1) controlled, written bit (1) controlled;\\n declare (RPN, out) character (100) varying;\\n declare s character (1);\\n declare input_priority (5) fixed (1) static initial (1, 1, 2, 2, 3);\\n declare stack_priority (5) fixed (1) static initial (1, 1, 2, 2, 4);\\n declare (i, ki, kl) fixed binary;\\n\\n put ('Convert a Reverse Polish expression to orthodox.');\\n put skip list ('Enclose the expression in apostrophes:');\\n get list (RPN);\\n put skip list ('The original Reverse Polish expression = ' || RPN);\\n out = '';\\n\\n allocate list, written;\\n list = substr(RPN, length(RPN), 1); written = false;\\n\\ntranslation:\\n do i = length (RPN)-1 to 1 by -1;\\n s = substr(RPN, i, 1);\\n if s = ' ' then iterate;\\n ki = index('+-*/^', s);\\n kl = index('+-*/^', list);\\n if ki > 0 then /* we have an operator */\\n do;\\n if input_priority (ki) < stack_priority (kl) then\\n do; /* transfer ')' to list, then operator. */\\n allocate list, written;\\n list = '('; written = false;\\n out = ')' || out;\\n end;\\n allocate list, written;\\n list = s; written = false;\\n end;\\n else /* It's a variable name */\\n do;\\n out = s || out;\\nnext_list:\\n if allocation(list) > 0 then if written then free written, list;\\n if allocation(list) > 0 then if list = '(' then\\n do; out = list || out; free written, list; end;\\n if allocation (list) = 0 then leave translation;\\n if written then go to next_list;\\n written = true;\\n out = list || out; /* Output an operator. */\\n end;\\n put skip edit ('INPUT=' || s) (a); call show_stack;\\n put edit (' OUTPUT=', out) (col(30), 2 a);\\n end;\\n put skip list ('ALGEBRAIC EXPRESSION=', out);\\n\\nend cvt;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"\\\"\\\"\\\"\\n>>> # EXAMPLE USAGE\\n>>> result = rpn_to_infix('3 4 2 * 1 5 - 2 3 ^ ^ / +', VERBOSE=True)\\nTOKEN STACK\\n3 ['3']\\n4 ['3', '4']\\n2 ['3', '4', '2']\\n* ['3', Node('2','*','4')]\\n1 ['3', Node('2','*','4'), '1']\\n5 ['3', Node('2','*','4'), '1', '5']\\n- ['3', Node('2','*','4'), Node('5','-','1')]\\n2 ['3', Node('2','*','4'), Node('5','-','1'), '2']\\n3 ['3', Node('2','*','4'), Node('5','-','1'), '2', '3']\\n^ ['3', Node('2','*','4'), Node('5','-','1'), Node('3','^','2')]\\n^ ['3', Node('2','*','4'), Node(Node('3','^','2'),'^',Node('5','-','1'))]\\n/ ['3', Node(Node(Node('3','^','2'),'^',Node('5','-','1')),'/',Node('2','*','4'))]\\n+ [Node(Node(Node(Node('3','^','2'),'^',Node('5','-','1')),'/',Node('2','*','4')),'+','3')]\\n\\\"\\\"\\\"\\n\\nprec_dict = {'^':4, '*':3, '/':3, '+':2, '-':2}\\nassoc_dict = {'^':1, '*':0, '/':0, '+':0, '-':0}\\n\\nclass Node:\\n def __init__(self,x,op,y=None):\\n self.precedence = prec_dict[op]\\n self.assocright = assoc_dict[op]\\n self.op = op\\n self.x,self.y = x,y\\n\\n def __str__(self):\\n \\\"\\\"\\\"\\n Building an infix string that evaluates correctly is easy.\\n Building an infix string that looks pretty and evaluates\\n correctly requires more effort.\\n \\\"\\\"\\\"\\n # easy case, Node is unary\\n if self.y == None:\\n return '%s(%s)'%(self.op,str(self.x))\\n\\n # determine left side string\\n str_y = str(self.y)\\n if self.y < self or \\\\\\n (self.y == self and self.assocright) or \\\\\\n (str_y[0] is '-' and self.assocright):\\n\\n str_y = '(%s)'%str_y\\n # determine right side string and operator\\n str_x = str(self.x)\\n str_op = self.op\\n if self.op is '+' and not isinstance(self.x, Node) and str_x[0] is '-':\\n str_x = str_x[1:]\\n str_op = '-'\\n elif self.op is '-' and not isinstance(self.x, Node) and str_x[0] is '-':\\n str_x = str_x[1:]\\n str_op = '+'\\n elif self.x < self or \\\\\\n (self.x == self and not self.assocright and \\\\\\n getattr(self.x, 'op', 1) != getattr(self, 'op', 2)):\\n\\n str_x = '(%s)'%str_x\\n return ' '.join([str_y, str_op, str_x])\\n\\n def __repr__(self):\\n \\\"\\\"\\\"\\n >>> repr(Node('3','+','4')) == repr(eval(repr(Node('3','+','4'))))\\n True\\n \\\"\\\"\\\"\\n return 'Node(%s,%s,%s)'%(repr(self.x), repr(self.op), repr(self.y))\\n\\n def __lt__(self, other):\\n if isinstance(other, Node):\\n return self.precedence < other.precedence\\n return self.precedence < prec_dict.get(other,9)\\n\\n def __gt__(self, other):\\n if isinstance(other, Node):\\n return self.precedence > other.precedence\\n return self.precedence > prec_dict.get(other,9)\\n\\n def __eq__(self, other):\\n if isinstance(other, Node):\\n return self.precedence == other.precedence\\n return self.precedence > prec_dict.get(other,9)\\n\\n\\n\\ndef rpn_to_infix(s, VERBOSE=False):\\n \\\"\\\"\\\"\\n\\n converts rpn notation to infix notation for string s\\n\\n \\\"\\\"\\\"\\n if VERBOSE : print('TOKEN STACK')\\n\\n stack=[]\\n for token in s.replace('^','^').split():\\n if token in prec_dict:\\n stack.append(Node(stack.pop(),token,stack.pop()))\\n else:\\n stack.append(token)\\n\\n # can't use \\\\t in order to make global docstring pass doctest\\n if VERBOSE : print(token+' '*(7-len(token))+repr(stack))\\n\\n return str(stack[0])\\n\\nstrTest = \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"\\nstrResult = rpn_to_infix(strTest, VERBOSE=False)\\nprint (\\\"Input: \\\",strTest)\\nprint (\\\"Output:\\\",strResult)\\n\\nprint()\\n\\nstrTest = \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"\\nstrResult = rpn_to_infix(strTest, VERBOSE=False)\\nprint (\\\"Input: \\\",strTest)\\nprint (\\\"Output:\\\",strResult)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require racket/dict)\\n\\n(define (RPN->infix expr)\\n (define-values (res _)\\n (for/fold ([stack '()] [prec '()]) ([t expr])\\n (show t stack prec)\\n (cond\\n [(dict-has-key? operators t)\\n (match-define (list pt at) (dict-ref operators t))\\n (match-define (list y x ss ...) stack)\\n (match-define (list py px ps ...) prec)\\n (define fexpr\\n (cond\\n [(> pt (max px py)) \\\"(~a) ~a (~a)\\\"]\\n [(or (< px pt) (and (= pt px) (eq? at 'r))) \\\"(~a) ~a ~a\\\"]\\n [(or (< py pt) (and (= pt py) (eq? at 'l))) \\\"~a ~a (~a)\\\"]\\n [else \\\"~a ~a ~a\\\"]))\\n (define term (format fexpr x t y))\\n (values (cons term ss) (cons pt ps))]\\n [else (values (cons t stack) (cons +inf.0 prec))])))\\n (car res))\\n\\n;; the list of operators and their properties\\n(define operators '((+ 2 l) (- 2 l) (* 3 l) (/ 3 l) (^ 4 r)))\\n\\n;; printing out the intermediate stages\\n(define (show t stack prec)\\n (printf \\\"~a\\\\t\\\" t)\\n (for ([s stack] [p prec])\\n (if (eq? +inf.0 p) (printf \\\"[~a] \\\" s) (printf \\\"[~a {~a}] \\\" s p)))\\n (newline))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub p ($pair, $prec) { $pair.key < $prec ?? \\\"( {$pair.value} )\\\" !! $pair.value }\\n\\nsub rpm-to-infix($string) {\\n my @stack;\\n for $string.words {\\n when /\\\\d/ { @stack.push: 9 => $_ }\\n my ($y,$x) = @stack.pop, @stack.pop;\\n when '^' { @stack.push: 4 => ~(p($x,5), $_, p($y,4)) }\\n when '*' | '/' { @stack.push: 3 => ~(p($x,3), $_, p($y,3)) }\\n when '+' | '-' { @stack.push: 2 => ~(p($x,2), $_, p($y,2)) }\\n }\\n ($string, @stack».value).join(\\\"\\\\n\\\") ~ \\\"\\\\n\\\";\\n}\\n\\nsay rpm-to-infix $_ for\\n '3 4 2 * 1 5 - 2 3 ^ ^ / +',\\n '1 2 + 3 4 + ^ 5 6 + ^';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program converts Reverse Polish Notation (RPN) ───► an infix notation. */\\nshowAction = 1 /* 0 if no showActions wanted. */\\n # = 0 /*initialize stack pointer to 0 (zero).*/\\n oS = '+ - / * ^' /*the operator symbols. */\\n oP = '2 2 3 3 4' /*the operator priorities. */\\n oA = '◄ ◄ ◄ ◄ ►' /*the operator associations. */\\nsay \\\"infix: \\\" toInfix( \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" )\\nsay \\\"infix: \\\" toInfix( \\\"1 2 + 3 4 + ^ 5 6 + ^\\\" ) /* [↓] Sprechen Sie Deutsch? */\\nsay \\\"infix: \\\" toInfix( \\\"Mond Sterne Schlamm + * Feur Suppe * ^\\\" )\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npop: pop= #; #= # - 1; return @.pop\\npush: #= # + 1; @.#= arg(1); return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nstack2str: $=; do j=1 for #; _ = @.j; y= left(_, 1)\\n if pos(' ', _)==0 then _ = '{'strip( substr(_, 2) )\\\"}\\\"\\n else _ = substr(_, 2)\\n $=$ '{'strip(y _)\\\"}\\\"\\n end /*j*/\\n return space($)\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ntoInfix: parse arg rpn; say copies('─', 80 - 1); say 'RPN: ' space(rpn)\\n\\n do N=1 for words(RPN) /*process each of the RPN tokens.*/\\n ?= word(RPN, N) /*obtain next item in the list. */\\n if pos(?,oS)==0 then call push '¥' ? /*when in doubt, add a Yen to it.*/\\n else do; g= pop(); gp= left(g, 1); g= substr(g, 2)\\n h= pop(); hp= left(h, 1); h= substr(h, 2)\\n tp= substr(oP, pos(?, oS), 1)\\n ta= substr(oA, pos(?, oS), 1)\\n if hp<tp | (hp==tp & ta=='►') then h= \\\"(\\\"h\\\")\\\"\\n if gp<tp | (gp==tp & ta=='◄') then g= \\\"(\\\"g\\\")\\\"\\n call push tp || h ? g\\n end\\n if showAction then say right(?, 25) \\\"──►\\\" stack2str()\\n end /*N*/\\n\\n return space( substr( pop(), 2) )\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"rpn = RPNExpression.new(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\ninfix = rpn.to_infix\\nruby = rpn.to_ruby\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"func p(pair, prec) {\\n pair[0] < prec ? \\\"( #{pair[1]} )\\\" : pair[1]\\n}\\n \\nfunc rpm_to_infix(string) {\\n say \\\"#{'='*17}\\\\n#{string}\\\"\\n var stack = []\\n string.each_word { |w|\\n if (w ~~ /\\\\d/) {\\n stack << [9, Num(w)]\\n }\\n else {\\n var y = stack.pop\\n var x = stack.pop\\n given(w) {\\n when ('^') { stack << [4, [p(x,5), w, p(y,4)].join(' ')] }\\n when (<* />) { stack << [3, [p(x,3), w, p(y,3)].join(' ')] }\\n when (<+ ->) { stack << [2, [p(x,2), w, p(y,2)].join(' ')] }\\n }\\n say stack\\n }\\n }\\n say '-'*17\\n stack.map{_[1]}\\n}\\n \\nvar tests = [\\n '3 4 2 * 1 5 - 2 3 ^ ^ / +',\\n '1 2 + 3 4 + ^ 5 6 + ^',\\n]\\n \\ntests.each { say rpm_to_infix(_).join(' ') }\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# Helpers\\nproc precassoc op {\\n dict get {^ {4 right} * {3 left} / {3 left} + {2 left} - {2 left}} $op\\n}\\nproc pop stk {\\n upvar 1 $stk s\\n set val [lindex $s end]\\n set s [lreplace $s end end]\\n return $val\\n}\\n\\nproc rpn2infix rpn {\\n foreach token $rpn {\\n\\tswitch $token {\\n\\t \\\"^\\\" - \\\"/\\\" - \\\"*\\\" - \\\"+\\\" - \\\"-\\\" {\\n\\t\\tlassign [pop stack] bprec b\\n\\t\\tlassign [pop stack] aprec a\\n\\t\\tlassign [precassoc $token] p assoc\\n\\t\\tif {$aprec < $p || ($aprec == $p && $assoc eq \\\"right\\\")} {\\n\\t\\t set a \\\"($a)\\\"\\n\\t\\t}\\n\\t\\tif {$bprec < $p || ($bprec == $p && $assoc eq \\\"left\\\")} {\\n\\t\\t set b \\\"($b)\\\"\\n\\t\\t}\\n\\t\\tlappend stack [list $p \\\"$a $token $b\\\"]\\n\\t }\\n\\t default {\\n\\t\\tlappend stack [list 9 $token]\\n\\t }\\n\\t}\\n\\tputs \\\"$token -> $stack\\\"\\n }\\n return [lindex $stack end 1]\\n}\\n\\nputs [rpn2infix {3 4 2 * 1 5 - 2 3 ^ ^ / +}]\\nputs [rpn2infix {1 2 + 3 4 + ^ 5 6 + ^}]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \";; alias for circumflex, which is reserved syntax\\n(defvar exp (intern \\\"^\\\"))\\n\\n(defvar *prec* ^((,exp . 4) (* . 3) (/ . 3) (+ . 2) (- . 2)))\\n\\n(defvar *asso* ^((,exp . :right) (* . nil)\\n (/ . :left) (+ . nil) (- . :left)))\\n\\n(defun debug-print (label val)\\n (format t \\\"~a: ~a\\\\n\\\" label val)\\n val)\\n\\n(defun rpn-to-lisp (rpn)\\n (let (stack)\\n (each ((term rpn))\\n (if (symbolp (debug-print \\\"rpn term\\\" term))\\n (let ((right (pop stack))\\n (left (pop stack)))\\n (push ^(,term ,left ,right) stack))\\n (push term stack))\\n (debug-print \\\"stack\\\" stack))\\n (if (rest stack)\\n (return-from error \\\"*excess stack elements*\\\"))\\n (debug-print \\\"lisp\\\" (pop stack))))\\n\\n(defun prec (term)\\n (or (cdr (assoc term *prec*)) 99))\\n\\n(defun asso (term dfl)\\n (or (cdr (assoc term *asso*)) dfl))\\n\\n(defun inf-term (op term left-or-right)\\n (if (atom term)\\n `@term`\\n (let ((pt (prec (car term)))\\n (po (prec op))\\n (at (asso (car term) left-or-right))\\n (ao (asso op left-or-right)))\\n (cond\\n ((< pt po) `(@(lisp-to-infix term))`)\\n ((> pt po) `@(lisp-to-infix term)`)\\n ((and (eq at ao) (eq left-or-right ao)) `@(lisp-to-infix term)`)\\n (t `(@(lisp-to-infix term))`)))))\\n\\n(defun lisp-to-infix (lisp)\\n (tree-case lisp\\n ((op left right) (let ((left-inf (inf-term op left :left))\\n (right-inf (inf-term op right :right)))\\n `@{left-inf} @op @{right-inf}`))\\n (() (return-from error \\\"*stack underflow*\\\"))\\n (else `@lisp`)))\\n\\n(defun string-to-rpn (str)\\n (debug-print \\\"rpn\\\"\\n (mapcar (do if (int-str @1) (int-str @1) (intern @1))\\n (tok-str str #/[^ \\\\t]+/))))\\n\\n(debug-print \\\"infix\\\"\\n (block error\\n (tree-case *args*\\n ((a b . c) \\\"*excess args*\\\")\\n ((a) (lisp-to-infix (rpn-to-lisp (string-to-rpn a))))\\n (else \\\"*arg needed*\\\"))))\\n\",\n \"language\": \"TXR\"\n },\n {\n \"code\": \"Option Strict On\\n\\nImports System.Text.RegularExpressions\\n\\nModule Module1\\n\\n Class Operator_\\n Sub New(t As Char, p As Integer, Optional i As Boolean = False)\\n Token = t\\n Precedence = p\\n IsRightAssociative = i\\n End Sub\\n\\n Property Token As Char\\n Get\\n Return m_token\\n End Get\\n Private Set(value As Char)\\n m_token = value\\n End Set\\n End Property\\n\\n Property Precedence As Integer\\n Get\\n Return m_precedence\\n End Get\\n Private Set(value As Integer)\\n m_precedence = value\\n End Set\\n End Property\\n\\n Property IsRightAssociative As Boolean\\n Get\\n Return m_right\\n End Get\\n Private Set(value As Boolean)\\n m_right = value\\n End Set\\n End Property\\n\\n Private m_token As Char\\n Private m_precedence As Integer\\n Private m_right As Boolean\\n End Class\\n\\n ReadOnly operators As New Dictionary(Of Char, Operator_) From {\\n {\\\"+\\\"c, New Operator_(\\\"+\\\"c, 2)},\\n {\\\"-\\\"c, New Operator_(\\\"-\\\"c, 2)},\\n {\\\"/\\\"c, New Operator_(\\\"/\\\"c, 3)},\\n {\\\"*\\\"c, New Operator_(\\\"*\\\"c, 3)},\\n {\\\"^\\\"c, New Operator_(\\\"^\\\"c, 4, True)}\\n }\\n\\n Class Expression\\n Public Sub New(e As String)\\n Ex = e\\n End Sub\\n\\n Sub New(e1 As String, e2 As String, o As Operator_)\\n Ex = String.Format(\\\"{0} {1} {2}\\\", e1, o.Token, e2)\\n Op = o\\n End Sub\\n\\n ReadOnly Property Ex As String\\n ReadOnly Property Op As Operator_\\n End Class\\n\\n Function PostfixToInfix(postfix As String) As String\\n Dim stack As New Stack(Of Expression)\\n\\n For Each token As String In Regex.Split(postfix, \\\"\\\\s+\\\")\\n Dim c = token(0)\\n Dim op = operators.FirstOrDefault(Function(kv) kv.Key = c).Value\\n If Not IsNothing(op) AndAlso token.Length = 1 Then\\n Dim rhs = stack.Pop()\\n Dim lhs = stack.Pop()\\n\\n Dim opPrec = op.Precedence\\n\\n Dim lhsPrec = If(IsNothing(lhs.Op), Integer.MaxValue, lhs.Op.Precedence)\\n Dim rhsPrec = If(IsNothing(rhs.Op), Integer.MaxValue, rhs.Op.Precedence)\\n\\n Dim newLhs As String\\n If lhsPrec < opPrec OrElse (lhsPrec = opPrec AndAlso c = \\\"^\\\") Then\\n 'lhs.Ex = \\\"(\\\" + lhs.Ex + \\\")\\\"\\n newLhs = \\\"(\\\" + lhs.Ex + \\\")\\\"\\n Else\\n newLhs = lhs.Ex\\n End If\\n\\n Dim newRhs As String\\n If rhsPrec < opPrec OrElse (rhsPrec = opPrec AndAlso c <> \\\"^\\\") Then\\n 'rhs.Ex = \\\"(\\\" + rhs.Ex + \\\")\\\"\\n newRhs = \\\"(\\\" + rhs.Ex + \\\")\\\"\\n Else\\n newRhs = rhs.Ex\\n End If\\n\\n stack.Push(New Expression(newLhs, newRhs, op))\\n Else\\n stack.Push(New Expression(token))\\n End If\\n\\n 'Print intermediate result\\n Console.WriteLine(\\\"{0} -> [{1}]\\\", token, String.Join(\\\", \\\", stack.Reverse().Select(Function(e) e.Ex)))\\n Next\\n\\n Return stack.Peek().Ex\\n End Function\\n\\n Sub Main()\\n Dim inputs = {\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\", \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"}\\n For Each e In inputs\\n Console.WriteLine(\\\"Postfix : {0}\\\", e)\\n Console.WriteLine(\\\"Infix : {0}\\\", PostfixToInfix(e))\\n Console.WriteLine()\\n Next\\n Console.ReadLine() 'remove before submit\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Stack\\nimport \\\"./pattern\\\" for Pattern\\n\\nclass Expression {\\n static ops { \\\"-+/*^\\\" }\\n\\n construct new(ex, op, prec) {\\n _ex = ex\\n _op = op\\n _prec = prec\\n }\\n\\n static build(e1, e2, o) { new(\\\"%(e1) %(o) %(e2)\\\", o, (ops.indexOf(o)/2).floor) }\\n\\n ex { _ex }\\n ex=(other) { _ex = other }\\n prec { _prec }\\n\\n toString { _ex }\\n}\\n\\nvar postfixToInfix = Fn.new { |postfix|\\n var expr = Stack.new()\\n var p = Pattern.new(\\\"+1/s\\\")\\n for (token in p.splitAll(postfix)) {\\n var c = token[0]\\n var idx = Expression.ops.indexOf(c)\\n if (idx != -1 && token.count == 1) {\\n var r = expr.pop()\\n var l = expr.pop()\\n var opPrec = (idx/2).floor\\n if (l.prec < opPrec || (l.prec == opPrec && c == \\\"^\\\")) {\\n l.ex = \\\"(%(l.ex))\\\"\\n }\\n if (r.prec < opPrec || (r.prec == opPrec && c != \\\"^\\\")) {\\n r.ex = \\\"(%(r.ex))\\\"\\n }\\n expr.push(Expression.build(l.ex, r.ex, token))\\n } else {\\n expr.push(Expression.new(token, \\\"\\\", 3))\\n }\\n System.print(\\\"%(token) -> %(expr)\\\")\\n }\\n return expr.peek().ex\\n}\\n\\nvar es = [\\n \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\n \\\"1 2 + 3 4 + ^ 5 6 + ^\\\"\\n]\\nfor (e in es) {\\n System.print(\\\"Postfix : %(e)\\\")\\n System.print(\\\"Infix : %(postfixToInfix.call(e))\\\\n\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"tests:=T(\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\",\\\"1 2 + 3 4 + ^ 5 6 + ^\\\");\\n\\nvar opa=D(\\n \\\"^\\\",T(4, True),\\n \\\"*\\\",T(3, False), \\\"/\\\",T(3, False),\\n \\\"+\\\",T(2, False), \\\"-\\\",T(2, False) );\\n\\nconst nPrec = 9;\\n\\nforeach t in (tests) { parseRPN(t) }\\n\\nfcn parseRPN(e){\\n println(\\\"\\\\npostfix:\\\", e);\\n stack:=L();\\n foreach tok in (e.split()){\\n println(\\\"token: \\\", tok);\\n opPrec,rAssoc:=opa.find(tok,T(Void,Void));\\n if(opPrec){\\n\\t rhsPrec,rhsExpr := stack.pop();\\n\\t lhsPrec,lhsExpr := stack.pop();\\n\\t if(lhsPrec < opPrec or (lhsPrec == opPrec and rAssoc))\\n\\t lhsExpr = \\\"(\\\" + lhsExpr + \\\")\\\";\\n\\t lhsExpr += \\\" \\\" + tok + \\\" \\\";\\n\\t if(rhsPrec < opPrec or (rhsPrec == opPrec and not rAssoc)){\\n\\t lhsExpr += \\\"(\\\" + rhsExpr + \\\")\\\"\\n\\t } else\\n\\t lhsExpr += rhsExpr;\\n\\t lhsPrec = opPrec;\\n\\t stack.append(T(lhsPrec,lhsExpr));\\n } else\\n\\t stack.append(T(nPrec, tok));\\n foreach f in (stack){\\n println(0'| %d \\\"%s\\\"|.fmt(f.xplode()))\\n }\\n }\\n println(\\\"infix:\\\", stack[0][1])\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parsing-RPN-to-infix-conversion"}}},{"rowIdx":1486,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Parsing/Shunting-yard_algorithm\n","language":"00-META"},{"code":";Task:\nGiven the operator characteristics and input from the [[wp:Shunting-yard_algorithm|Shunting-yard algorithm]] page and tables, use the algorithm to show the changes in the operator stack and RPN output\nas each individual token is processed.\n\n* Assume an input of a correct, space separated, string of tokens representing an infix expression\n* Generate a space separated output string representing the RPN\n* Test with the input string:\n:::: <big><big><code> 3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 </code></big></big> \n* print and display the output here.\n* Operator precedence is given in this table:\n:{| class=\"wikitable\"\n\n! operator !! [[wp:Order_of_operations|precedence]] !! [[wp:Operator_associativity|associativity]] !! operation\n|- || align=\"center\"\n| <big><big> ^ </big></big> || 4 || right || exponentiation \n|- || align=\"center\" \n| <big><big> * </big></big> || 3 || left || multiplication\n|- || align=\"center\" \n| <big><big> / </big></big> || 3 || left || division\n|- || align=\"center\" \n| <big><big> + </big></big> || 2 || left || addition\n|- || align=\"center\"\n| <big><big> - </big></big> || 2 || left || subtraction\n|}\n\n<br>\n;Extra credit\nAdd extra text explaining the actions and an optional comment for the action on receipt of each token.\n\n\n;Note\nThe handling of functions and arguments is not required.\n\n\n;See also:\n* [[Parsing/RPN calculator algorithm]] for a method of calculating a final value from this output RPN expression.\n* [[Parsing/RPN to infix conversion]].\n<br><br>\n\n","language":"00-TASK"},{"code":"F infix_to_postfix(infix)\n -V ops = ‘-+/*^’\n V sb = ‘’\n [Int] s\n\n L(token) infix.split(re:‘\\s’)\n I token.empty\n L.continue\n\n V c = token[0]\n V? idx = ops.find(c)\n I idx != N\n I s.empty\n s.append(idx)\n E\n L !s.empty\n V prec2 = s.last I/ 2\n V prec1 = idx I/ 2\n I prec2 > prec1 | (prec2 == prec1 & c != ‘^’)\n sb ‘’= ops[s.pop()]‘ ’\n E\n L.break\n s.append(idx)\n\n E I c == ‘(’\n s.append(-2)\n\n E I c == ‘)’\n L s.last != -2\n sb ‘’= ops[s.pop()]‘ ’\n s.pop()\n\n E\n sb ‘’= token‘ ’\n\n L !s.empty\n sb ‘’= ops[s.pop()]‘ ’\n\n R sb\n\nV infix = ‘3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3’\nprint(‘infix: ’infix)\nprint(‘postfix: ’infix_to_postfix(infix))\n","language":"11l"},{"code":"\\ Convert infix expression to postfix, using 'shunting-yard' algorithm\n\\ https://en.wikipedia.org/wiki/Shunting-yard_algorithm\n\n\n\\ precedence of infix tokens. negative means 'right-associative', otherwise left:\nwith: n\n{\n \"+\" : 2,\n \"-\" : 2,\n \"/\" : 3,\n \"*\" : 3,\n \"^\" : -4,\n \"(\" : 1,\n \")\" : -1\n} var, tokens\n\n: precedence \\ s -- s n\n tokens @ over m:@ nip\n null? if drop 0 then ;\n\nvar ops\nvar out\n\n: >out \\ x --\n out @ swap\n a:push drop ;\n\n: >ops \\ op prec --\n 2 a:close\n ops @ swap\n a:push drop ;\n\n: a:peek -1 a:@ ;\n\n\\ Check the array for items with greater or equal precedence,\n\\ and move them to the out queue:\n: pop-ops \\ op prec ops -- op prec ops\n \\ empty array, do nothing:\n a:len not if ;; then\n\n \\ Look at top of ops stack:\n a:peek a:open \\ op p ops[] op2 p2\n\n \\ if the 'p2' is not less p (meaning item on top of stack is greater or equal\n \\ in precedence), then pop the item from the ops stack and push onto the out:\n 3 pick \\ p2 p\n < not if\n \\ op p ops[] op2\n >out a:pop drop recurse ;;\n then\n drop ;\n\n\n: right-paren\n \"RIGHTPAREN\" . cr\n 2drop\n \\ move non-left-paren from ops and move to out:\n ops @\n repeat\n a:len not if\n break\n else\n a:pop a:open\n 1 = if\n 2drop ;;\n else\n >out\n then\n then\n again drop ;\n\n: .state \\ n --\ndrop \\ \"Token: %s\\n\" s:strfmt .\n \"Out: \" .\n out @ ( . space drop ) a:each drop cr\n \"ops: \" . ops @ ( 0 a:@ . space 2drop ) a:each drop cr cr ;\n\n: handle-number \\ s n --\n \"NUMBER \" . over . cr\n drop >out ;\n\n: left-paren \\ s n --\n \"LEFTPAREN\" . cr\n >ops ;\n\n: handle-op \\ s n --\n \"OPERATOR \" . over . cr\n \\ op precedence\n \\ Is the current op left-associative?\n dup sgn 1 = if\n \\ it is, so check the ops array for items with greater or equal precedence,\n \\ and move them to the out queue:\n ops @ pop-ops drop\n then\n \\ push the operator\n >ops ;\n\n: handle-token \\ s --\n precedence dup not if\n \\ it's a number:\n handle-number\n else\n dup 1 = if left-paren\n else dup -1 = if right-paren\n else handle-op\n then then\n then ;\n\n: infix>postfix \\ s -- s\n /\\s+/ s:/ \\ split to indiviual whitespace-delimited tokens\n\n \\ Initialize our data structures\n a:new ops ! a:new out !\n\n (\n nip dup >r\n handle-token\n r> .state\n ) a:each drop\n \\ remove all remaining ops and put on output:\n out @\n ops @ a:rev\n ( nip a:open drop a:push ) a:each drop\n \\ final string:\n \" \" a:join ;\n\n\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\" infix>postfix . cr\n\n\"Expected: \\n\" . \"3 4 2 * 1 5 - 2 3 ^ ^ / +\" . cr\nbye\n","language":"8th"},{"code":"BEGIN\n # parses s and returns an RPN expression using Dijkstra's \"Shunting Yard\" algorithm #\n # s is expected to contain a valid infix expression containing single-digit numbers and single-character operators #\n PROC parse = ( STRING s )STRING:\n BEGIN\n # add to the output #\n PROC output element = ( CHAR c )VOID:\n BEGIN\n output[ output pos +:= 1 ] := c;\n output pos +:= 1\n END # output element # ;\n PROC stack op = ( CHAR c )VOID: stack[ stack pos +:= 1 ] := c;\n # unstacks and returns the top operator on the stack - stops the program if the stack is empty #\n PROC unstack = CHAR:\n IF stack pos < 1 THEN\n # empty stack #\n print( ( \"Stack underflow\", newline ) );\n stop\n ELSE\n # still something on the stack to unstack #\n CHAR result = stack[ stack pos ];\n stack[ stack pos ] := \" \";\n stack pos -:= 1;\n result\n FI # unstack # ;\n # returns the priority of the operator o - which must be one of \"(\", \"^\", \"*\", \"/\", \"+\" or \"-\" #\n PROC priority of = ( CHAR o )INT: IF o = \"(\" THEN -1 ELIF o = \"^\" THEN 4 ELIF o = \"*\" OR o = \"/\" THEN 3 ELSE 2 FI;\n # returns TRUE if o is a right-associative operator, FALSE otherwise #\n PROC right = ( CHAR c )BOOL: c = \"^\";\n PROC lower or equal priority = ( CHAR c )BOOL:\n IF stack pos < 1 THEN FALSE # empty stack #\n ELSE priority of( c ) <= priority of( stack[ stack pos ] )\n FI # lower or equal priority # ;\n PROC lower priority = ( CHAR c )BOOL:\n IF stack pos < 1 THEN FALSE # empty stack #\n ELSE priority of( c ) < priority of( stack[ stack pos ] )\n FI # lower priority # ;\n # max stack size and output size #\n INT max stack = 32;\n # stack and output queue #\n [ 1 : max stack ]CHAR stack;\n [ 1 : max stack ]CHAR output;\n FOR c pos TO max stack DO stack[ c pos ] := output[ c pos ] := \" \" OD;\n # stack pointer and output queue pointer #\n INT stack pos := 0;\n INT output pos := 0;\n print( ( \"Parsing: \", s, newline ) );\n print( ( \"token output stack\", newline ) );\n FOR s pos FROM LWB s TO UPB s DO\n CHAR c = s[ s pos ];\n IF c /= \" \" THEN\n IF c >= \"0\" AND c <= \"9\" THEN output element( c )\n ELIF c = \"(\" THEN stack op( c )\n ELIF c = \")\" THEN\n # close bracket - unstack to the matching \"(\" and unstack the \"(\" #\n WHILE CHAR op char = unstack;\n op char /= \"(\"\n DO\n output element( op char )\n OD\n ELIF right( c ) THEN\n # right associative operator #\n WHILE lower priority( c ) DO output element( unstack ) OD;\n stack op( c )\n ELSE\n # must be left associative #\n WHILE lower or equal priority( c ) DO output element( unstack ) OD;\n stack op( c )\n FI;\n print( ( c, \" \", output, \" \", stack, newline ) )\n FI\n OD;\n WHILE stack pos >= 1 DO output element( unstack ) OD;\n output[ 1 : output pos ]\n END # parse # ;\n\n print( ( \"result: \", parse( \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\" ), newline ) )\nEND\n","language":"ALGOL-68"},{"code":"SetBatchLines -1\n#NoEnv\n\nexpr := \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n\noutput := \"Testing string '\" expr \"'`r`n`r`nToken`tOutput Queue\"\n . Space(StrLen(expr)-StrLen(\"Output Queue\")+2) \"OP Stack\"\n\n; define a stack with semantic .push() and .pop() funcs\nstack := {push: func(\"ObjInsert\"), pop: func(\"ObjRemove\"), peek: func(\"Peek\")}\n\nLoop Parse, expr, %A_Space%\n{\n token := A_LoopField\n if token is number\n Q .= token A_Space\n if isOp(token){\n o1 := token\n while isOp(o2 := stack.peek())\n and ((isLeft(o1) and Precedence(o1) <= Precedence(o2))\n or (isRight(o1) and Precedence(o1) < Precedence(o2)))\n Q .= stack.pop() A_Space\n stack.push(o1)\n }\n If ( token = \"(\" )\n stack.push(token)\n If ( token = \")\" )\n {\n While ((t := stack.pop()) != \"(\") && (t != \"\")\n Q .= t A_Space\n if (t = \"\")\n throw Exception(\"Unmatched parenthesis. \"\n . \"Character number \" A_Index)\n }\n output .= \"`r`n\" token Space(7) Q Space(StrLen(expr)+2-StrLen(Q))\n . Disp(stack)\n}\noutput .= \"`r`n(empty stack to output)\"\nWhile (t := stack.pop()) != \"\"\n if InStr(\"()\", t)\n throw Exception(\"Unmatched parenthesis.\")\n else Q .= t A_Space, output .= \"`r`n\" Space(8) Q\n . Space(StrLen(expr)+2-StrLen(Q)) Disp(stack)\noutput .= \"`r`n`r`nFinal string: '\" Q \"'\"\nclipboard := output\n\nisOp(t){\n return (!!InStr(\"+-*/^\", t) && t)\n}\nPeek(this){\n r := this.Remove(), this.Insert(r)\n return r\n}\nIsLeft(o){\n return !!InStr(\"*/+-\", o)\n}\nIsRight(o){\n return o = \"^\"\n}\nPrecedence(o){\n return (InStr(\"+-/*^\", o)+3)//2\n}\nDisp(obj){\n for each, val in obj\n o := val . o\n return o\n}\nSpace(n){\n return n>0 ? A_Space Space(n-1) : \"\"\n}\n","language":"AutoHotkey"},{"code":"#include <sys/types.h>\n#include <regex.h>\n#include <stdio.h>\n\ntypedef struct {\n\tconst char *s;\n\tint len, prec, assoc;\n} str_tok_t;\n\ntypedef struct {\n\tconst char * str;\n\tint assoc, prec;\n\tregex_t re;\n} pat_t;\n\nenum assoc { A_NONE, A_L, A_R };\npat_t pat_eos = {\"\", A_NONE, 0};\n\npat_t pat_ops[] = {\n\t{\"^\\\\)\",\tA_NONE, -1},\n\t{\"^\\\\*\\\\*\",\tA_R, 3},\n\t{\"^\\\\^\",\tA_R, 3},\n\t{\"^\\\\*\",\tA_L, 2},\n\t{\"^/\",\t\tA_L, 2},\n\t{\"^\\\\+\",\tA_L, 1},\n\t{\"^-\",\t\tA_L, 1},\n\t{0}\n};\n\npat_t pat_arg[] = {\n\t{\"^[-+]?[0-9]*\\\\.?[0-9]+([eE][-+]?[0-9]+)?\"},\n\t{\"^[a-zA-Z_][a-zA-Z_0-9]*\"},\n\t{\"^\\\\(\", A_L, -1},\n\t{0}\n};\n\nstr_tok_t stack[256]; /* assume these are big enough */\nstr_tok_t queue[256];\nint l_queue, l_stack;\n#define qpush(x) queue[l_queue++] = x\n#define spush(x) stack[l_stack++] = x\n#define spop() stack[--l_stack]\n\nvoid display(const char *s)\n{\n\tint i;\n\tprintf(\"\\033[1;1H\\033[JText | %s\", s);\n\tprintf(\"\\nStack| \");\n\tfor (i = 0; i < l_stack; i++)\n\t\tprintf(\"%.*s \", stack[i].len, stack[i].s); // uses C99 format strings\n\tprintf(\"\\nQueue| \");\n\tfor (i = 0; i < l_queue; i++)\n\t\tprintf(\"%.*s \", queue[i].len, queue[i].s);\n\tputs(\"\\n\\n<press enter>\");\n\tgetchar();\n}\n\nint prec_booster;\n\n#define fail(s1, s2) {fprintf(stderr, \"[Error %s] %s\\n\", s1, s2); return 0;}\n\nint init(void)\n{\n\tint i;\n\tpat_t *p;\n\n\tfor (i = 0, p = pat_ops; p[i].str; i++)\n\t\tif (regcomp(&(p[i].re), p[i].str, REG_NEWLINE|REG_EXTENDED))\n\t\t\tfail(\"comp\", p[i].str);\n\n\tfor (i = 0, p = pat_arg; p[i].str; i++)\n\t\tif (regcomp(&(p[i].re), p[i].str, REG_NEWLINE|REG_EXTENDED))\n\t\t\tfail(\"comp\", p[i].str);\n\n\treturn 1;\n}\n\npat_t* match(const char *s, pat_t *p, str_tok_t * t, const char **e)\n{\n\tint i;\n\tregmatch_t m;\n\n\twhile (*s == ' ') s++;\n\t*e = s;\n\n\tif (!*s) return &pat_eos;\n\n\tfor (i = 0; p[i].str; i++) {\n\t\tif (regexec(&(p[i].re), s, 1, &m, REG_NOTEOL))\n\t\t\tcontinue;\n\t\tt->s = s;\n\t\t*e = s + (t->len = m.rm_eo - m.rm_so);\n\t\treturn p + i;\n\t}\n\treturn 0;\n}\n\nint parse(const char *s) {\n\tpat_t *p;\n\tstr_tok_t *t, tok;\n\n\tprec_booster = l_queue = l_stack = 0;\n\tdisplay(s);\n\twhile (*s) {\n\t\tp = match(s, pat_arg, &tok, &s);\n\t\tif (!p || p == &pat_eos) fail(\"parse arg\", s);\n\n\t\t/* Odd logic here. Don't actually stack the parens: don't need to. */\n\t\tif (p->prec == -1) {\n\t\t\tprec_booster += 100;\n\t\t\tcontinue;\n\t\t}\n\t\tqpush(tok);\n\t\tdisplay(s);\n\nre_op:\t\tp = match(s, pat_ops, &tok, &s);\n\t\tif (!p) fail(\"parse op\", s);\n\n\t\ttok.assoc = p->assoc;\n\t\ttok.prec = p->prec;\n\n\t\tif (p->prec > 0)\n\t\t\ttok.prec = p->prec + prec_booster;\n\t\telse if (p->prec == -1) {\n\t\t\tif (prec_booster < 100)\n\t\t\t\tfail(\"unmatched )\", s);\n\t\t\ttok.prec = prec_booster;\n\t\t}\n\n\t\twhile (l_stack) {\n\t\t\tt = stack + l_stack - 1;\n\t\t\tif (!(t->prec == tok.prec && t->assoc == A_L)\n\t\t\t\t\t&& t->prec <= tok.prec)\n\t\t\t\tbreak;\n\t\t\tqpush(spop());\n\t\t\tdisplay(s);\n\t\t}\n\n\t\tif (p->prec == -1) {\n\t\t\tprec_booster -= 100;\n\t\t\tgoto re_op;\n\t\t}\n\n\t\tif (!p->prec) {\n\t\t\tdisplay(s);\n\t\t\tif (prec_booster)\n\t\t\t\tfail(\"unmatched (\", s);\n\t\t\treturn 1;\n\t\t}\n\n\t\tspush(tok);\n\t\tdisplay(s);\n\t}\n\n\tif (p->prec > 0)\n\t\tfail(\"unexpected eol\", s);\n\n\treturn 1;\n}\n\nint main()\n{\n\tint i;\n\tconst char *tests[] = {\n\t\t\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\",\t/* RC mandated: OK */\n\t\t\"123\",\t\t\t\t\t/* OK */\n\t\t\"3+4 * 2 / ( 1 - 5 ) ^ 2 ^ 3.14\",\t/* OK */\n\t\t\"(((((((1+2+3**(4 + 5))))))\",\t\t/* bad parens */\n\t\t\"a^(b + c/d * .1e5)!\",\t\t\t/* unknown op */\n\t\t\"(1**2)**3\",\t\t\t\t/* OK */\n\t\t\"2 + 2 *\",\t\t\t\t/* unexpected eol */\n\t\t0\n\t};\n\n\tif (!init()) return 1;\n\tfor (i = 0; tests[i]; i++) {\n\t\tprintf(\"Testing string `%s' <enter>\\n\", tests[i]);\n\t\tgetchar();\n\n\t\tprintf(\"string `%s': %s\\n\\n\", tests[i],\n\t\t\tparse(tests[i]) ? \"Ok\" : \"Error\");\n\t}\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <ciso646>\n#include <iostream>\n#include <regex>\n#include <sstream>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\nusing std::vector;\nusing std::string;\n\n//-------------------------------------------------------------------------------------------------\n// throw error( \"You \", profanity, \"ed up!\" ); // Don't mess up, okay?\n//-------------------------------------------------------------------------------------------------\n#include <exception>\n#include <stdexcept>\ntemplate <typename...Args> std::runtime_error error( Args...args )\n{\n return std::runtime_error( (std::ostringstream{} << ... << args).str() );\n};\n\n//-------------------------------------------------------------------------------------------------\n// Stack\n//-------------------------------------------------------------------------------------------------\n// Let us co-opt a vector for our stack type.\n// C++ pedants: no splicing possible == totally okay to do this.\n//\n// Note: C++ provides a more appropriate std::stack class, except that the task requires us to\n// be able to display its contents, and that kind of access is an expressly non-stack behavior.\n\ntemplate <typename T> struct stack : public std::vector <T>\n{\n using base_type = std::vector <T> ;\n T push ( const T& x ) { base_type::push_back( x ); return x; }\n const T& top () { return base_type::back(); }\n T pop () { T x = std::move( top() ); base_type::pop_back(); return x; }\n bool empty() { return base_type::empty(); }\n};\n\n//-------------------------------------------------------------------------------------------------\nusing Number = double;\n//-------------------------------------------------------------------------------------------------\n// Numbers are already too awesome to need extra diddling.\n\n//-------------------------------------------------------------------------------------------------\n// Operators\n//-------------------------------------------------------------------------------------------------\nusing Operator_Name = string;\nusing Precedence = int;\nenum class Associates { none, left_to_right, right_to_left };\n\nstruct Operator_Info { Precedence precedence; Associates associativity; };\n\nstd::unordered_map <Operator_Name, Operator_Info> Operators =\n{\n { \"^\", { 4, Associates::right_to_left } },\n { \"*\", { 3, Associates::left_to_right } },\n { \"/\", { 3, Associates::left_to_right } },\n { \"+\", { 2, Associates::left_to_right } },\n { \"-\", { 2, Associates::left_to_right } },\n};\n\nPrecedence precedence ( const Operator_Name& op ) { return Operators[ op ].precedence; }\nAssociates associativity( const Operator_Name& op ) { return Operators[ op ].associativity; }\n\n//-------------------------------------------------------------------------------------------------\nusing Token = string;\n//-------------------------------------------------------------------------------------------------\nbool is_number ( const Token& t ) { return regex_match( t, std::regex{ R\"z((\\d+(\\.\\d*)?|\\.\\d+)([Ee][\\+\\-]?\\d+)?)z\" } ); }\nbool is_operator ( const Token& t ) { return Operators.count( t ); }\nbool is_open_parenthesis ( const Token& t ) { return t == \"(\"; }\nbool is_close_parenthesis( const Token& t ) { return t == \")\"; }\nbool is_parenthesis ( const Token& t ) { return is_open_parenthesis( t ) or is_close_parenthesis( t ); }\n\n//-------------------------------------------------------------------------------------------------\n// std::cout << a_vector_of_something;\n//-------------------------------------------------------------------------------------------------\n// Weird C++ stream operator stuff (for I/O).\n// Don't worry if this doesn't look like it makes any sense.\n//\ntemplate <typename T> std::ostream& operator << ( std::ostream& outs, const std::vector <T> & xs )\n{\n std::size_t n = 0; for (auto x : xs) outs << (n++ ? \" \" : \"\") << x; return outs;\n}\n\n//-------------------------------------------------------------------------------------------------\n// Progressive_Display\n//-------------------------------------------------------------------------------------------------\n// This implements the required task:\n// \"use the algorithm to show the changes in the operator\n// stack and RPN output as each individual token is processed\"\n//\n#include <iomanip>\n\nstruct Progressive_Display\n{\n string token_name;\n string token_type;\n\n Progressive_Display() // Header for the table we are going to generate\n {\n std::cout << \"\\n\"\n \" INPUT │ TYPE │ ACTION │ STACK │ OUTPUT\\n\"\n \"────────┼──────┼──────────────────┼──────────────┼─────────────────────────────\\n\";\n }\n\n Progressive_Display& operator () ( const Token& token ) // Ready the first two columns\n {\n token_name = token;\n token_type = is_operator ( token ) ? \"op\"\n : is_parenthesis( token ) ? \"()\"\n : is_number ( token ) ? \"num\"\n : \"\";\n return *this;\n }\n\n Progressive_Display& operator () ( // Display all columns of a row\n const string & description,\n const stack <Token> & stack,\n const vector <Token> & output )\n {\n std::cout << std::right\n << std::setw( 7 ) << token_name << \" │ \" << std::left\n << std::setw( 4 ) << token_type << \" │ \"\n << std::setw( 16 ) << description << \" │ \"\n << std::setw( 12 ) << (std::ostringstream{} << stack).str() << \" │ \"\n << output << \"\\n\";\n return operator () ( \"\" ); // Reset the first two columns to empty for next iteration\n }\n};\n\n//-------------------------------------------------------------------------------------------------\nvector <Token> parse( const vector <Token> & tokens )\n//-------------------------------------------------------------------------------------------------\n{\n vector <Token> output;\n stack <Token> stack;\n\n Progressive_Display display;\n\n for (auto token : tokens) // Shunting Yard takes a single linear pass through the tokens\n\n //.........................................................................\n if (is_number( token ))\n {\n output.push_back( token );\n display( token )( \"num --> output\", stack, output );\n }\n\n //.........................................................................\n else if (is_operator( token ) or is_parenthesis( token ))\n {\n display( token );\n\n if (!is_open_parenthesis( token ))\n {\n // pop --> output\n // : until '(' if token is ')'\n // : while prec(token) > prec(top)\n // : while prec(token) == prec(top) AND assoc(token) is left-to-right\n while (!stack.empty()\n and ( (is_close_parenthesis( token ) and !is_open_parenthesis( stack.top() ))\n or (precedence( stack.top() ) > precedence( token ))\n or ( (precedence( stack.top() ) == precedence( token ))\n and (associativity( token ) == Associates::left_to_right))))\n {\n output.push_back( stack.pop() );\n display( \"pop --> output\", stack, output );\n }\n\n // If we popped until '(' because token is ')', toss both parens\n if (is_close_parenthesis( token ))\n {\n stack.pop();\n display( \"pop\", stack, output );\n }\n }\n\n // Everything except ')' --> stack\n if (!is_close_parenthesis( token ))\n {\n stack.push( token );\n display( \"push op\", stack, output );\n }\n }\n\n //.........................................................................\n else throw error( \"unexpected token: \", token );\n\n // Anything left on the operator stack just gets moved to the output\n\n display( \"END\" );\n while (!stack.empty())\n {\n output.push_back( stack.pop() );\n display( \"pop --> output\", stack, output );\n }\n\n return output;\n}\n\n//-------------------------------------------------------------------------------------------------\nint main( int argc, char** argv )\n//-------------------------------------------------------------------------------------------------\ntry\n{\n auto tokens = vector <Token> ( argv+1, argv+argc );\n auto rpn_expr = parse( tokens );\n std::cout\n << \"\\nInfix = \" << tokens\n << \"\\nRPN = \" << rpn_expr\n << \"\\n\";\n}\ncatch (std::exception e)\n{\n std::cerr << \"error: \" << e.what() << \"\\n\";\n return 1;\n}\n","language":"C++"},{"code":"#include <iostream>\n#include <sstream>\n#include <stack>\n\nstd::string infixToPostfix(const std::string& infix) {\n const std::string ops = \"-+/*^\";\n std::stringstream ss;\n std::stack<int> s;\n\n std::stringstream input(infix);\n std::string token;\n while (std::getline(input, token, ' ')) {\n if (token.empty()) {\n continue;\n }\n\n char c = token[0];\n size_t idx = ops.find(c);\n\n // check for operator\n if (idx != std::string::npos) {\n while (!s.empty()) {\n int prec2 = s.top() / 2;\n int prec1 = idx / 2;\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) {\n ss << ops[s.top()] << ' ';\n s.pop();\n } else break;\n }\n s.push(idx);\n } else if (c == '(') {\n s.push(-2); // -2 stands for '('\n } else if (c == ')') {\n // until '(' on stack, pop operators.\n while (s.top() != -2) {\n ss << ops[s.top()] << ' ';\n s.pop();\n }\n s.pop();\n } else {\n ss << token << ' ';\n }\n }\n\n while (!s.empty()) {\n ss << ops[s.top()] << ' ';\n s.pop();\n }\n\n return ss.str();\n}\n\nint main() {\n std::string infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\n std::cout << \"infix: \" << infix << '\\n';\n std::cout << \"postfix: \" << infixToPostfix(infix) << '\\n';\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\nusing System.Linq;\n\npublic class Program\n{\n public static void Main() {\n string infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\n Console.WriteLine(infix.ToPostfix());\n }\n}\n\npublic static class ShuntingYard\n{\n private static readonly Dictionary<string, (string symbol, int precedence, bool rightAssociative)> operators\n = new (string symbol, int precedence, bool rightAssociative) [] {\n (\"^\", 4, true),\n (\"*\", 3, false),\n (\"/\", 3, false),\n (\"+\", 2, false),\n (\"-\", 2, false)\n }.ToDictionary(op => op.symbol);\n\n public static string ToPostfix(this string infix) {\n string[] tokens = infix.Split(' ');\n var stack = new Stack<string>();\n var output = new List<string>();\n foreach (string token in tokens) {\n if (int.TryParse(token, out _)) {\n output.Add(token);\n Print(token);\n } else if (operators.TryGetValue(token, out var op1)) {\n while (stack.Count > 0 && operators.TryGetValue(stack.Peek(), out var op2)) {\n int c = op1.precedence.CompareTo(op2.precedence);\n if (c < 0 || !op1.rightAssociative && c <= 0) {\n output.Add(stack.Pop());\n } else {\n break;\n }\n }\n stack.Push(token);\n Print(token);\n } else if (token == \"(\") {\n stack.Push(token);\n Print(token);\n } else if (token == \")\") {\n string top = \"\";\n while (stack.Count > 0 && (top = stack.Pop()) != \"(\") {\n output.Add(top);\n }\n if (top != \"(\") throw new ArgumentException(\"No matching left parenthesis.\");\n Print(token);\n }\n }\n while (stack.Count > 0) {\n var top = stack.Pop();\n if (!operators.ContainsKey(top)) throw new ArgumentException(\"No matching right parenthesis.\");\n output.Add(top);\n }\n Print(\"pop\");\n return string.Join(\" \", output);\n\n //Yikes!\n void Print(string action) => Console.WriteLine($\"{action + \":\",-4} {$\"stack[ {string.Join(\" \", stack.Reverse())} ]\",-18} {$\"out[ {string.Join(\" \", output)} ]\"}\");\n //A little more readable?\n void Print(string action) => Console.WriteLine(\"{0,-4} {1,-18} {2}\", action + \":\", $\"stack[ {string.Join(\" \", stack.Reverse())} ]\", $\"out[ {string.Join(\" \", output)} ]\");\n }\n}\n","language":"C-sharp"},{"code":"import ceylon.collection {\n\n\tArrayList\n}\n\nabstract class Token(String|Integer data) of IntegerLiteral | Operator | leftParen | rightParen {\n\tstring => data.string;\n}\nclass IntegerLiteral(shared Integer integer) extends Token(integer) {}\nclass Operator extends Token {\n\n\tshared Integer precedence;\n\tshared Boolean rightAssoc;\n\t\n\tshared new plus extends Token(\"+\") {\n\t\tprecedence = 2;\n\t\trightAssoc = false;\n\t}\n\tshared new minus extends Token(\"-\") {\n\t\tprecedence = 2;\n\t\trightAssoc = false;\n\t}\n\tshared new times extends Token(\"*\") {\n\t\tprecedence = 3;\n\t\trightAssoc = false;\n\t}\n\tshared new divides extends Token(\"/\") {\n\t\tprecedence = 3;\n\t\trightAssoc = false;\n\t}\n\tshared new power extends Token(\"^\") {\n\t\tprecedence = 4;\n\t\trightAssoc = true;\n\t}\n\n\tshared Boolean below(Operator other) =>\n\t\t\t!rightAssoc && precedence <= other.precedence || rightAssoc && precedence < other.precedence;\n}\nobject leftParen extends Token(\"(\") {}\nobject rightParen extends Token(\")\") {}\n\n\nshared void run() {\n\t\n\tfunction shunt(String input) {\n\t\t\n\t\tfunction tokenize(String input) =>\n\t\t\t\tinput.split().map((String element) =>\n\t\t\t\t\tswitch(element.trimmed)\n\t\t\t\t\tcase(\"(\") leftParen\n\t\t\t\t\tcase(\")\") rightParen\n\t\t\t\t\tcase(\"+\") Operator.plus\n\t\t\t\t\tcase(\"-\") Operator.minus\n\t\t\t\t\tcase(\"*\") Operator.times\n\t\t\t\t\tcase(\"/\") Operator.divides\n\t\t\t\t\tcase(\"^\") Operator.power\n\t\t\t\t\telse IntegerLiteral(parseInteger(element) else 0)); // no error handling\n\t\t\n\t\tvalue outputQueue = ArrayList<Token>();\n\t\tvalue operatorStack = ArrayList<Token>();\n\t\t\n\t\tvoid report(String action) {\n\t\t\tprint(\"``action.padTrailing(22)`` | ``\" \".join(outputQueue).padTrailing(25)`` | ``\" \".join(operatorStack).padTrailing(10)``\");\n\t\t}\n\t\t\n\t\tprint(\"input is ``input``\\n\");\n\t\tprint(\"Action | Output Queue | Operators' Stack\n\t\t -----------------------|---------------------------|-----------------\");\n\t\t\n\t\tfor(token in tokenize(input)) {\n\t\t\tswitch(token)\n\t\t\tcase(is IntegerLiteral) {\n\t\t\t\toutputQueue.offer(token);\n\t\t\t\treport(\"``token`` from input to queue\");\n\t\t\t}\n\t\t\tcase(leftParen) {\n\t\t\t\toperatorStack.push(token);\n\t\t\t\treport(\"``token`` from input to stack\");\n\t\t\t}\n\t\t\tcase(rightParen){\n\t\t\t\twhile(exists top = operatorStack.pop(), top != leftParen) {\n\t\t\t\t\toutputQueue.offer(top);\n\t\t\t\t\treport(\"``top`` from stack to queue\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tcase(is Operator) {\n\t\t\t\twhile(exists top = operatorStack.top, is Operator top, token.below(top)) {\n\t\t\t\t\toperatorStack.pop();\n\t\t\t\t\toutputQueue.offer(top);\n\t\t\t\t\treport(\"``top`` from stack to queue\");\n\t\t\t\t}\n\t\t\t\toperatorStack.push(token);\n\t\t\t\treport(\"``token`` from input to stack\");\n\t\t\t}\n\t\t}\n\t\twhile(exists top = operatorStack.pop()) {\n\t\t\toutputQueue.offer(top);\n\t\t\treport(\"``top`` from stack to queue\");\n\t\t}\n\t\treturn \" \".join(outputQueue);\n\t}\n\t\n\tvalue rpn = shunt(\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\");\n\tassert(rpn == \"3 4 2 * 1 5 - 2 3 ^ ^ / +\");\n\tprint(\"\\nthe result is ``rpn``\");\n}\n","language":"Ceylon"},{"code":";;;; Parsing/infix to RPN conversion\n(defconstant operators \"^*/+-\")\n(defconstant precedence '(-4 3 3 2 2))\n\n(defun operator-p (op)\n \"string->integer|nil: Returns operator precedence index or nil if not operator.\"\n (and (= (length op) 1) (position (char op 0) operators)))\n\n(defun has-priority (op2 op1)\n \"(string,string)->boolean: True if op2 has output priority over op1.\"\n (defun prec (op) (nth (operator-p op) precedence))\n (or (and (plusp (prec op1)) (<= (prec op1) (abs (prec op2))))\n (and (minusp (prec op1)) (< (- (prec op1)) (abs (prec op2))))))\n\n(defun string-split (expr)\n \"string->list: Tokenize a space separated string.\"\n (let* ((p (position #\\Space expr))\n (tok (if p (subseq expr 0 p) expr)))\n (if p (append (list tok) (string-split (subseq expr (1+ p)))) (list tok))))\n\n(defun classify (tok)\n \"nil|string->symbol: Classify a token.\"\n (cond\n ((null tok) 'NOL)\n ((operator-p tok) 'OPR)\n ((string= tok \"(\") 'LPR)\n ((string= tok \")\") 'RPR)\n (t 'LIT)))\n\n;;; transitions when op2 is dont care\n(defconstant trans1D '((LIT GO) (LPR ENTER)))\n;;; transitions when we check op2 also\n(defconstant trans2D\n '((OPR ((NOL ENTER)\n (LPR ENTER)\n (OPR (lambda (op1 op2) (if (has-priority op2 op1) 'LEAVE 'ENTER)))))\n (RPR ((NOL \"mismatched parentheses\")\n (LPR CLEAR)\n (OPR LEAVE)))\n (NOL ((NOL nil)\n (LPR \"mismatched parentheses\")\n (OPR LEAVE)))))\n\n(defun do-signal (op1 op2)\n \"(nil|string,nil|string)->symbol|string|nil: Emit a signal based on state of inputq and opstack.\n A nil return is a successful lookup (on nil,nil) because all input combinations are specified.\"\n (let ((sig (or (cadr (assoc (classify op1) trans1D))\n (cadr (assoc (classify op2) (cadr (assoc (classify op1) trans2D)))))))\n (if (or (null sig) (symbolp sig) (stringp sig)) sig\n (funcall (coerce sig 'function) op1 op2))))\n\n(defun rpn (expr)\n \"string->string: Parse infix expression into rpn.\"\n (format t \"TOKEN TOS SIGNAL OPSTACK OUTPUTQ~%\")\n\n ;; iterate until both stacks empty\n (do* ((input (string-split expr)) (opstack nil) (outputq \"\")\n (sig (do-signal (first input) (first opstack)) (do-signal (first input) (first opstack))))\n ((null sig) ; until\n ;; print last closing frame\n (format t \"~A~7,T~A~14,T~A~25,T~A~38,T~A~%\" nil nil nil opstack outputq)\n (subseq outputq 1)) ; return final infix expression\n\n ;; print opening frame\n (format t \"~A~7,T~A~14,T\" (first input) (first opstack))\n (format t (if (stringp sig) \"\\\"~A\\\"\" \"~A\") sig)\n\n ;; switch state\n (let ((output (case sig\n (GO (pop input))\n (ENTER (push (pop input) opstack) nil)\n (LEAVE (pop opstack))\n (CLEAR (pop input) (pop opstack) nil)\n (otherwise (pop input) (pop opstack)\n (if (stringp sig) sig \"unknown signal\")))))\n (when output (setf outputq (concatenate 'string outputq \" \" output))))\n\n ;; print closing frame\n (format t \"~25,T~A~38,T~A~%\" opstack outputq))) ; end-do\n\n(defun main (&optional (xtra nil))\n \"nil->[printed rpn expressions]: Main function.\"\n (let ((expressions '(\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n \"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\"\n \"( ( 3 ^ 4 ) ^ 2 ^ 9 ) ^ 2 ^ 5\"\n \"3 + 4 * ( 5 - 6 ) ) 4 * 9\")))\n (dolist (expr (if xtra expressions (list (car expressions))))\n (format t \"~%INFIX:\\\"~A\\\"~%\" expr)\n (format t \"RPN:\\\"~A\\\"~%\" (rpn expr)))))\n","language":"Common-Lisp"},{"code":"import std.container;\nimport std.stdio;\n\nvoid main() {\n string infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\n writeln(\"infix: \", infix);\n writeln(\"postfix: \", infixToPostfix(infix));\n}\n\nstring infixToPostfix(string infix) {\n import std.array;\n\n /* To find out the precedence, we take the index of the\n token in the ops string and divide by 2 (rounding down).\n This will give us: 0, 0, 1, 1, 2 */\n immutable ops = [\"+\", \"-\", \"/\", \"*\", \"^\"];\n\n auto sb = appender!string;\n SList!int stack;\n\n // split the input on whitespace\n foreach (token; infix.split) {\n if (token.empty) {\n continue;\n }\n\n int idx = ops.indexOf(token);\n\n // check for operator\n if (idx != -1) {\n while (!stack.empty) {\n int prec2 = stack.peek / 2;\n int prec1 = idx / 2;\n if (prec2 > prec1 || (prec2 == prec1 && token != \"^\")) {\n sb.put(ops[stack.pop]);\n sb.put(' ');\n } else {\n break;\n }\n }\n stack.push(idx);\n } else if (token == \"(\") {\n stack.push(-2); // -2 stands for '('\n } else if (token == \")\") {\n // until '(' on stack, pop operators.\n while (stack.peek != -2) {\n sb.put(ops[stack.pop]);\n sb.put(' ');\n }\n stack.pop();\n } else {\n sb.put(token);\n sb.put(' ');\n }\n }\n\n while (!stack.empty) {\n sb.put(ops[stack.pop]);\n sb.put(' ');\n }\n\n return sb.data;\n}\n\n// Find the first index of the specified value, or -1 if not found.\nint indexOf(T)(const T[] a, const T v) {\n foreach(i,e; a) {\n if (e == v) {\n return i;\n }\n }\n return -1;\n}\n\n// Convienience for adding a new element\nvoid push(T)(ref SList!T s, T v) {\n s.insertFront(v);\n}\n\n// Convienience for accessing the top element\nauto peek(T)(SList!T s) {\n return s.front;\n}\n\n// Convienience for removing and returning the top element\nauto pop(T)(ref SList!T s) {\n auto v = s.front;\n s.removeFront;\n return v;\n}\n","language":"D"},{"code":"(require 'hash)\n(require 'tree)\n\n(define OPS (make-hash))\n(hash-set OPS \"^\" '( 4 #f)) ;; right assoc\n(hash-set OPS \"*\" '( 3 #t)) ;; left assoc\n(hash-set OPS \"/\" '( 3 #t))\n(hash-set OPS \"+\" '( 2 #t))\n(hash-set OPS \"-\" '( 2 #t))\n\n;; helpers\n(define (is-right-par? token) (string=? token \")\"))\n(define (is-left-par? token) (string=? token \"(\"))\n(define (is-num? op) (not (hash-ref OPS op))) ;; crude\n(define (is-op? op) (hash-ref OPS op))\n(define (is-left? op) (second (hash-ref OPS op)))\n(define (is-right? op) (not (is-left? op)))\n(define (op-prec op) (first (hash-ref OPS op)))\n\n;; Wikipedia algorithm, translated as it is\n\n(define (shunt tokens S Q)\n (for ((token tokens))\n (writeln \"S: \" (stack->list S) \"Q: \" (queue->list Q) \"token: \"token)\n (cond\n [(is-left-par? token) (push S token) ]\n [(is-right-par? token)\n (while (and (stack-top S) (not (is-left-par? (stack-top S))))\n (q-push Q ( pop S)))\n (when (stack-empty? S) (error 'misplaced-parenthesis \"()\" ))\n (pop S)] ; // left par\n\n [(is-op? token)\n (while (and\n (is-op? (stack-top S))\n (or\n (and (is-left? token) (<= (op-prec token) (op-prec (stack-top S))))\n (and (is-right? token) (< (op-prec token) (op-prec (stack-top S))))))\n (q-push Q (pop S)))\n (push S token)]\n\n [(is-num? token) (q-push Q token)]\n [else (error 'bad-token token)])) ; for\n (while (stack-top S) (q-push Q (pop S))))\n\n(string-delimiter \"\")\n(define (task infix)\n (define S (stack 'S))\n (define Q (queue 'Q))\n (shunt (text-parse infix) S Q)\n (writeln 'infix infix)\n (writeln 'RPN (queue->list Q)))\n","language":"EchoLisp"},{"code":"open System\n\ntype action = Shift | ReduceStack | ReduceInput\n\ntype State (input : string list, stack : string list, output : string list) =\n member x.Input with get() = input\n member x.Stack with get() = stack\n member x.Output with get() = output\n\n member x.report act =\n let markTop = function | [] -> [] | x::xs -> (\"[\"+x+\"]\")::xs\n let (s, text) =\n if x.Stack = [] && x.Input = [] then x, \"\"\n else\n match act with\n | Shift -> State((markTop x.Input), x.Stack, x.Output), \"shift\"\n | ReduceStack -> State(x.Input, (markTop x.Stack), x.Output), \"reduce\"\n | ReduceInput -> State((markTop x.Input), x.Stack, x.Output), \"reduce\"\n\n let lstr (x :string list) = String.Join(\" \", (List.toArray x))\n printfn \"%25s %-9s %6s %s\" (lstr (List.rev s.Output)) (lstr (List.rev s.Stack)) text (lstr s.Input)\n\n member x.shift =\n x.report Shift\n State(x.Input.Tail, (x.Input.Head)::x.Stack, x.Output)\n\n member x.reduce =\n x.report ReduceStack\n State (x.Input, (x.Stack.Tail), (x.Stack.Head)::x.Output)\n\n member x.reduceNumber =\n x.report ReduceInput\n State(x.Input.Tail, x.Stack, (x.Input.Head)::x.Output)\n\nlet prec = function\n| \"^\" -> 4 | \"*\" | \"/\" -> 3 | \"+\" | \"-\" -> 2 | \"(\" -> 1\n| x -> failwith (\"No precedence! Not an operator: \" + x)\n\ntype assocKind = | Left | Right\nlet assoc = function | \"^\" -> Right | _ -> Left\n\nlet (|Number|Open|Close|Operator|) x =\n if (Double.TryParse >> fst) x then Number\n elif x = \"(\" then Open\n elif x = \")\" then Close\n else Operator\n\nlet rec shunting_yard (s : State) =\n\n let rec reduce_to_Open (s : State) =\n match s.Stack with\n | [] -> failwith \"mismatched parentheses!\"\n | \"(\"::xs -> State(s.Input.Tail, xs, s.Output)\n | _ ->\n reduce_to_Open s.reduce\n\n let reduce_by_prec_and_shift x s =\n let (xPrec, xAssoc) = (prec x, assoc x)\n let rec loop (s : State) =\n match s.Stack with\n | [] -> s\n | x::xs ->\n let topPrec = prec x\n if xAssoc = Left && xPrec <= topPrec || xAssoc = Right && xPrec < topPrec then\n loop s.reduce\n else\n s\n (loop s).shift\n\n let rec reduce_rest (s : State) =\n match s.Stack with\n | [] -> s\n | \"(\"::_ -> failwith \"mismatched parentheses!\"\n | x::_ ->\n reduce_rest s.reduce\n\n match s.Input with\n | x::inputRest ->\n match x with\n | Number ->\n shunting_yard s.reduceNumber\n | Open ->\n shunting_yard s.shift\n | Close ->\n shunting_yard (reduce_to_Open s)\n | Operator ->\n shunting_yard (reduce_by_prec_and_shift x s)\n | [] -> reduce_rest s\n\n[<EntryPoint>]\nlet main argv =\n let input = if argv.Length = 0 then \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\".Split() else argv\n shunting_yard (State((Array.toList input), [], []))\n |> (fun s -> s.report ReduceStack)\n 0\n","language":"F-Sharp"},{"code":" MODULE COMPILER\t!At least of arithmetic expressions.\n INTEGER KBD,MSG\t\t!I/O units.\n\n INTEGER ENUFF\t\t!How long s a piece of string?\n PARAMETER (ENUFF = 66)\t!This long.\n CHARACTER*(ENUFF) RP\t!Holds the Reverse Polish Notation.\n INTEGER LR\t\t!And this is its length.\n\n INTEGER\t\tOPSYMBOLS\t\t!Recognised operator symbols.\n PARAMETER\t(OPSYMBOLS = 11)\t!There are also some associates.\n TYPE SYMB\t\t!To recognise symbols and carry associated information.\n CHARACTER*1\tIS\t\t!Its text. Careful with the trailing space and comparisons.\n INTEGER*1\tPRECEDENCE\t!Controls the order of evaluation.\n CHARACTER*48\tUSAGE\t\t!Description.\n END TYPE SYMB\t\t!The cross-linkage of precedences is tricky.\n TYPE(SYMB) SYMBOL(0:OPSYMBOLS)\t!Righto, I'll have some.\n PARAMETER (SYMBOL =(/\t!Note that \"*\" is not to be seen as a match to \"**\".\n o SYMB(\" \", 0,\"Not recognised as an operator's symbol.\"),\n 1 SYMB(\" \", 1,\"separates symbols and aids legibility.\"),\n 2 SYMB(\")\", 4,\"opened with ( to bracket a sub-expression.\"),\n 3 SYMB(\"]\", 4,\"opened with [ to bracket a sub-expression.\"),\n 4 SYMB(\"}\", 4,\"opened with { to bracket a sub-expression.\"),\n 5 SYMB(\"+\",11,\"addition, and unary + to no effect.\"),\n 6 SYMB(\"-\",11,\"subtraction, and unary - for neg. numbers.\"),\n 7 SYMB(\"*\",12,\"multiplication.\"),\n 8 SYMB(\"×\",12,\"multiplication, if you can find this.\"),\n 9 SYMB(\"/\",12,\"division.\"),\n o SYMB(\"÷\",12,\"division for those with a fancy keyboard.\"),\nC 13 is used so that stacked ^ will have lower priority than incoming ^, thus delivering right-to-left evaluation.\n 1 SYMB(\"^\",14,\"raise to power. Not recognised is **.\")/))\n CHARACTER*3\tBRAOPEN,BRACLOSE\t!Three types are allowed.\n PARAMETER\t(BRAOPEN = \"([{\", BRACLOSE = \")]}\")\t!These.\n INTEGER\t\tBRALEVEL\t\t!In and out, in and out. That's the game.\n INTEGER\t\tPRBRA,PRPOW\t\t!Special double values.\n PARAMETER (PRBRA = SYMBOL( 3).PRECEDENCE)\t!Bracketing\n PARAMETER (PRPOW = SYMBOL(11).PRECEDENCE)\t!And powers refer leftwards.\n\n CHARACTER*10 DIGIT\t\t!Numberish is a bit more complex.\n PARAMETER (DIGIT = \"0123456789\")\t!But this will do for integers.\n\n INTEGER STACKLIMIT\t\t!How high is a stack?\n PARAMETER (STACKLIMIT = 66)\t!This should suffice.\n TYPE DEFERRED\t\t\t!I need a siding for lower-precedence operations.\n CHARACTER*1\tOPC\t\t!The operation code.\n INTEGER*1\tPRECEDENCE\t!Its precedence in the siding may differ.\n END TYPE DEFERRED\t\t!Anyway, that's enough.\n TYPE(DEFERRED) OPSTACK(0:STACKLIMIT)\t!One siding, please.\n INTEGER OSP\t\t\t!The operation stack pointer.\n\n INTEGER INCOMING,TOKENTYPE,NOTHING,ANUMBER,OPENBRA,HUH\t\t!Some mnemonics.\n PARAMETER (NOTHING = 0, ANUMBER = -1, OPENBRA = -2, HUH = -3)\t!The ordering is not arbitrary.\n CONTAINS\t!Now to mess about.\n SUBROUTINE EMIT(STUFF)\t!The objective is to produce some RPN text.\n CHARACTER*(*) STUFF\t!The term of the moment.\n INTEGER L\t\t!A length.\n WRITE (MSG,1) STUFF\t!Announce.\n 1 FORMAT (\"Emit \",A)\t!Whatever it is.\n IF (STUFF.EQ.\"\") RETURN\t!Ha ha.\n L = LEN(STUFF)\t!So, how much is there to append?\n IF (LR + L.GE.ENUFF) STOP \"Too much RPN for RP!\"\t!Perhaps too much.\n IF (LR.GT.0) THEN\t!Is there existing stuff?\n LR = LR + 1\t\t\t!Yes. Advance one,\n RP(LR:LR) = \" \"\t\t!And place a space.\n END IF\t\t!So much for separators.\n RP(LR + 1:LR + L) = STUFF\t!Place the stuff.\n LR = LR + L\t\t\t!Count it in.\n END SUBROUTINE EMIT\t!Simple enough, if a bit finicky.\n\n SUBROUTINE STACKOP(C,P)\t!Push an item into the siding.\n CHARACTER*1 C\t!The operation code.\n INTEGER P\t!Its precedence.\n OSP = OSP + 1\t\t!Stacking up...\n IF (OSP.GT.STACKLIMIT) STOP \"OSP overtopped!\"\t!Perhaps not.\n OPSTACK(OSP).OPC = C\t\t!Righto,\n OPSTACK(OSP).PRECEDENCE = P\t!The deed is simple.\n WRITE (MSG,1) C,OPSTACK(1:OSP)\t!Announce.\n 1 FORMAT (\"Stack \",A1,9X,\",OpStk=\",33(A1,I2:\",\"))\n END SUBROUTINE STACKOP\t!So this is more for mnemonic ease.\n\n LOGICAL FUNCTION COMPILE(TEXT)\t!A compiler confronts a compiler!\n CHARACTER*(*) TEXT\t!To be inspected.\n INTEGER L1,L2\t\t!Fingers for the scan.\n CHARACTER*1 C\t\t!Character of the moment.\n INTEGER HAPPY\t\t!Ah, shades of mood.\n LR = 0\t\t!No output yet.\n OSP = 0\t\t!Nothing stacked.\n OPSTACK(0).OPC = \"\"\t\t!Prepare a bouncer.\n OPSTACK(0).PRECEDENCE = 0\t!So that loops won't go past.\n BRALEVEL = 0\t\t!None seen.\n HAPPY = +1\t\t!Nor any problems.\n L2 = 1\t\t!Syncopation: one past the end of the previous token.\nChew into an operand, possibly obstructed by an open bracket.\n 100 CALL FORASIGN\t\t!Find something to inspect.\n IF (TOKENTYPE.EQ.NOTHING) THEN\t!Run off the end?\n IF (OSP.GT.0) CALL GRUMP(\"Another operand or one of \"\t!E.g. \"1 +\".\n 1 //BRAOPEN//\" is expected.\")\t\t\t\t!Give a hint, because stacked stuff awaits.\n ELSE IF (TOKENTYPE.EQ.ANUMBER) THEN\t!If a number,\n CALL EMIT(TEXT(L1:L2 - 1))\t\t\t!Roll all its digits.\n ELSE IF (TOKENTYPE.EQ.OPENBRA) THEN\t!Starting a sub-expression?\n CALL STACKOP(C,PRBRA - 1)\t\t\t!Thus ( has less precedence than ).\n GO TO 100\t\t\t\t\t!And I still want an operand.\nC ELSE IF (TOKENTYPE.EQ.ANAME) THEN\t!Name of something?\nC CALL EMIT(TEXT(L1:L2 - 1))\t\t\t!Roll it.\n ELSE\t\t\t\t\t!No further options.\n CALL GRUMP(\"Huh? Unexpected \"//C)\t\t!Probably something like \"1 + +\"\n END IF\t\t\t\t!Righto, finished with operands.\nChase after an operator, possibly interrupted by a close bracket,.\n 200 CALL FORASIGN\t\t!Find something to inspect.\n IF (TOKENTYPE.LT.0) THEN\t!But, have I an operand-like token instead?\n CALL GRUMP(\"Operator expected, not \"//C)\t!It seems so.\n ELSE\t\t\t!Normally, an operator is to hand. Possibly a NOTHING, though.\n WRITE (MSG,201) C,INCOMING,OPSTACK(1:OSP)\t!Document it.\n 201 FORMAT (\"Oprn=>\",A1,\"< Prec=\",I2,\t\t!Try to align with other output.\n 1 \",OpStk=\",33(A1,I2:\",\"))\t\t\t!So as not to clutter the display.\n DO WHILE(OPSTACK(OSP).PRECEDENCE .GE. INCOMING)\t!Shunt higher-precedence stuff out.\n IF (OPSTACK(OSP).PRECEDENCE .EQ. PRBRA - 1)\t\t!Only opening brackets have this precedence.\n 1 CALL GRUMP(\"Unbalanced \"//OPSTACK(OSP).OPC)\t\t!And they vanish only when meeting their closing bracket.\n CALL EMIT(OPSTACK(OSP).OPC)\t\t\t\t!Otherwise we have an operator.\n OSP = OSP - 1\t\t\t\t\t\t!It has gone forth.\n END DO\t\t\t\t\t\t!On to the next.\n IF (TOKENTYPE.GT.NOTHING) THEN\t!Now, only lower-precedence items are still in the stack.\n IF (INCOMING.EQ.PRBRA) THEN\t\t!And this is a special arrival.\n CALL BALANCEBRA(C)\t\t\t!It should match an earlier entry.\n BRALEVEL = BRALEVEL - 1\t\t\t!Count it out.\n GO TO 200\t\t\t\t!And I still haven't got an operator.\n ELSE\t\t\t\t!All others are normal operators.\n IF (C.EQ.\"^\") INCOMING = PRPOW - 1\t!Special trick to cause leftwards association of x^2^3.\n CALL STACKOP(C,INCOMING)\t\t!Shunt aside, to await the next arrival.\n END IF\t\t\t!So much for that operator.\n END IF\t\t\t!Providing it was not just an end-of-input flusher.\n END IF\t\t!And not a misplaced operand.\nCarry on?\n IF (HAPPY .GT. 0) GO TO 100 \t!No problems, and not a nothing from the end of the text.\nCompleted.\n COMPILE = HAPPY.GE.0\t!One hopes so.\n CONTAINS\t!Now for some assistants.\n SUBROUTINE GRUMP(GROWL)\t!There might be a problem.\n CHARACTER*(*) GROWL\t!The fault.\n WRITE (MSG,1) GROWL\t!Say it.\n IF (L1.GT. 1) WRITE (MSG,1) \"Tasty:\",TEXT( 1:L1 - 1)\t!Now explain the context.\n IF (L2.GT.L1) WRITE (MSG,1) \"Nasty:\",TEXT(L1:L2 - 1)\t!This is the token when trouble was found.\n IF (L2.LE.LEN(TEXT)) WRITE (MSG,1) \"Misty:\",TEXT(L2:)\t!And this remains to be seen.\n 1 FORMAT (4X,A,1X,A)\t!A simple layout works nicely for reasonable-length texts.\n HAPPY = -1\t.\t!Just so.\n END SUBROUTINE GRUMP\t!Enuogh said.\n\n SUBROUTINE BALANCEBRA(B)\t!Perhaps a happy meeting.\n CHARACTER*1 B\t!The closer.\n CHARACTER*1 O\t!The putative opener.\n INTEGER IT,L\t\t!Fingers.\n CHARACTER*88 GROWL\t!A scratchpad.\n O = OPSTACK(OSP).OPC\t!This should match B.\n WRITE (MSG,1) O,B\t\t!Perhaps.\n 1 FORMAT (\"Match \",2A)\t!Show what I've got, anyway.\n IT = INDEX(BRAOPEN,O)\t!So, what sort did I save?\n IF (IT .EQ. INDEX(BRACLOSE,B)) THEN\t!A friend?\n OSP = OSP - 1\t\t\t!Yes. They vanish together.\n ELSE\t!Otherwise, something is out of place.\n GROWL = \"Unbalanced {[(...)]} bracketing! The closing \"\t!Alas.\n 1 //B//\" is unmatched.\"\t\t\t\t!So, a mess.\n IF (IT.GT.0) GROWL(62:) = \"A \"//BRACLOSE(IT:IT)\t!Perhaps there had been no opening bracket.\n 1 //\" would be better.\"\t\t!But if there had, this would be its friend.\n CALL GRUMP(GROWL)\t\t!Take that!\n END IF\t\t\t!So much for discrepancies.\n END SUBROUTINE BALANCEBRA\t!But, hopefully, amity prevails.\n\n SUBROUTINE FORASIGN\t!See what comes next.\n INTEGER I\t!A stepper.\n L1 = L2\t\t!Pick up where the previous scan left off.\n 10 IF (L1.GT.LEN(TEXT)) THEN\t!Are we off the end yet?\n C = \"\"\t\t\t!Yes. Scrub the marker.\n L2 = L1\t\t\t!TEXT(L1:L2 - 1) will be null.\n TOKENTYPE = NOTHING\t!But this is to be checked first.\n INCOMING = SYMBOL(1).PRECEDENCE\t!For flushing sidetracked operators.\n HAPPY = 0\t\t\t!Fading away.\n ELSE\t!Otherwise, there is grist.\nCheck for spaces and move past them.\n C = TEXT(L1:L1)\t!Grab the first character of the prospective token.\n IF (C.LE.\" \") THEN\t!Boring?\n L1 = L1 + 1\t\t!Yes. Step past it.\n GO TO 10\t\t!And look afresh.\n END IF\t\t!Otherwise, L1 now fingers the start.\nCaught something to inspect.\n L2 = L1 + 1\t\t!This is one beyond. Just for digit strings.\n IF (INDEX(DIGIT,C).GT.0) THEN\t!So, has one started?\n TOKENTYPE = ANUMBER \t\t!Yep.\n 20 IF (L2.LE.LEN(TEXT)) THEN\t!Probe ahead.\n IF (INDEX(DIGIT,TEXT(L2:L2)).GT.0) THEN\t!Another digit?\n L2 = L2 + 1\t\t\t!Yes. Leaving L1 fingering its start,\n GO TO 20\t\t\t!Chase its end.\n END IF\t\t\t!So much for another digit.\n END IF\t\t\t!And checking against the end.\nC ELSE IF (INDEX(LETTERS,C).GT.0) THEN\t!Some sort of name?\nC advance L2 while in NAMEISH.\n ELSE IF (INDEX(BRAOPEN,C).GT.0) THEN\t!An open bracket?\n TOKENTYPE = OPENBRA\t\t\t!Yep.\n ELSE\t\t\t!Otherwise, anything else.\n DO I = OPSYMBOLS,1,-1\t!Scan backwards, to find ** before *, if present.\n IF (SYMBOL(I).IS .EQ. C) EXIT\t!Found?\n END DO\t\t\t!On to the next. A linear search will do.\n IF (I.LE.0) THEN\t!Is it identified?\n TOKENTYPE = HUH\t\t!No.\n INCOMING = SYMBOL(0).PRECEDENCE\t!And this might provoke a flush.\n ELSE\t\t\t!If it is identified,\n TOKENTYPE = I\t\t\t!Then this is a positive number.\n INCOMING = SYMBOL(I).PRECEDENCE\t!And this is of interest.\n END IF\t\t\t!Righto, anything has been identified, possibly as HUH.\n END IF\t\t!So much for classification.\n END IF\t!If there is something to see.\n WRITE (MSG,30) C,INCOMING,TOKENTYPE\t\t!Announce.\n 30 FORMAT (\"Next=>\",A1,\"< Prec=\",I2,\",Ttype=\",I2)\t!C might be blank.\n END SUBROUTINE FORASIGN\t!I call for a sign, and I see what?\n END FUNCTION COMPILE\t!That's the main activity.\n END MODULE COMPILER\t!So, enough of this.\n\n PROGRAM POKE\n USE COMPILER\n CHARACTER*66 TEXT\n LOGICAL HIC\n MSG = 6\n KBD = 5\n WRITE (MSG,1)\n 1 FORMAT (\"Produce RPN from infix...\",/)\n\n 10 WRITE (MSG,11)\n 11 FORMAT(\"Infix: \",$)\n READ(KBD,12) TEXT\n 12 FORMAT (A)\n IF (TEXT.EQ.\"\") STOP \"Enough.\"\n HIC = COMPILE(TEXT)\n WRITE (MSG,13) HIC,RP(1:LR)\n 13 FORMAT (L6,\" RPN: >\",A,\"<\")\n GO TO 10\n END\n","language":"Fortran"},{"code":"Caution! The apparent gaps in the sequence of precedence values in this table are *not* unused!\nCunning ploys with precedence allow parameter evaluation, and right-to-left order as in x**y**z.\n INTEGER\t\tOPSYMBOLS\t\t!Recognised operator symbols.\n PARAMETER\t(OPSYMBOLS = 25)\t!There are also some associates.\n TYPE SYMB\t\t!To recognise symbols and carry associated information.\n CHARACTER*2\tIS\t\t!Its text. Careful with the trailing space and comparisons.\n INTEGER*1\tPRECEDENCE\t!Controls the order of evaluation.\n INTEGER*1\tPOPCOUNT\t!Stack activity: a+b means + requires two in.\n CHARACTER*48\tUSAGE\t\t!Description.\n END TYPE SYMB\t\t!The cross-linkage of precedences is tricky.\n CHARACTER*5\tIFPARTS(0:4)\t!These appear when an operator would otherwise be expected.\n PARAMETER (IFPARTS = (/\"IF\",\"THEN\",\"ELSE\",\"OWISE\",\"FI\"/))\t!So, bend the usage of \"operator\".\n TYPE(SYMB) SYMBOL(-4:OPSYMBOLS)\t!Righto, I'll have some.\n PARAMETER (SYMBOL =(/\t!Note that \"*\" is not to be seen as a match to \"**\".\n 4 SYMB(\"FI\", 2,0,\"the FI that ends an IF-statement.\"),\t!These negative entries are not for name matching\n 3 SYMB(\"Ow\", 3,0,\"the OWISE part of an IF-statement.\"),\t!Which is instead done via IFPARTS\n 2 SYMB(\"El\", 3,0,\"the ELSE part of an IF-statement.\"),\t!But are here to take advantage of the structure in place.\n 1 SYMB(\"Th\", 3,0,\"the THEN part of an IF-statement.\"),\t!The IF is recognised separately, when expecting an operand.\n o SYMB(\" \", 0,0,\"Not recognised as an operator's symbol.\"),\n 1 SYMB(\" \", 1,0,\"separates symbols and aids legibility.\"),\nC 2 and 3 are used for the parts of an IF-statement. See PRIF.\nC 3 These precedences ensure the desired order of evaluation.\n 2 SYMB(\") \", 4,0,\"opened with ( to bracket a sub-expression.\"),\n 3 SYMB(\"] \", 4,0,\"opened with [ to bracket a sub-expression.\"),\n 4 SYMB(\"} \", 4,0,\"opened with { to bracket a sub-expression.\"),\n 5 SYMB(\", \", 5,0,\"continues a list of parameters to a function.\"),\nC SYMB(\":=\", 6,0,\"marks an on-the-fly assignment of a result\"), Identified differently... see PRREF.\n 6 SYMB(\"| \", 7,2,\"logical OR, similar to addition.\"),\n 7 SYMB(\"& \", 8,2,\"logical AND, similar to multiplication.\"),\n 8 SYMB(\"¬ \", 9,0,\"logical NOT, similar to negation.\"),\n 9 SYMB(\"= \",10,2,\"tests for equality (beware decimal fractions)\"),\n o SYMB(\"< \",10,2,\"tests strictly less than.\"),\n 1 SYMB(\"> \",10,2,\"tests strictly greater than.\"),\n 2 SYMB(\"<>\",10,2,\"tests not equal (there is no 'not' key!)\"),\n 3 SYMB(\"¬=\",10,2,\"tests not equal if you can find a ¬ !\"),\n 4 SYMB(\"<=\",10,2,\"tests less than or equal.\"),\n 5 SYMB(\">=\",10,2,\"tests greater than or equal.\"),\n 6 SYMB(\"+ \",11,2,\"addition, and unary + to no effect.\"),\n 7 SYMB(\"- \",11,2,\"subtraction, and unary - for neg. numbers.\"),\n 8 SYMB(\"* \",12,2,\"multiplication.\"),\n 9 SYMB(\"× \",12,2,\"multiplication, if you can find this.\"),\n o SYMB(\"/ \",12,2,\"division.\"),\n 1 SYMB(\"÷ \",12,2,\"division for those with a fancy keyboard.\"),\n 2 SYMB(\"\\ \",12,2,\"remainder a\\b = a - truncate(a/b)*b; 11\\3 = 2\"),\nC 13 is used so that stacked ** will have lower priority than incoming **, thus delivering right-to-left evaluation.\n 3 SYMB(\"^ \",14,2,\"raise to power: also recognised is **.\"),\t!Uses the previous precedence level also!\n 4 SYMB(\"**\",14,2,\"raise to power: also recognised is ^.\"),\n 5 SYMB(\"! \",15,1,\"factorial, sortof, just for fun.\")/))\n","language":"Fortran"},{"code":"package main\n\nimport (\n \"fmt\"\n \"strings\"\n)\n\nvar input = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n\nvar opa = map[string]struct {\n prec int\n rAssoc bool\n}{\n \"^\": {4, true},\n \"*\": {3, false},\n \"/\": {3, false},\n \"+\": {2, false},\n \"-\": {2, false},\n}\n\nfunc main() {\n fmt.Println(\"infix: \", input)\n fmt.Println(\"postfix:\", parseInfix(input))\n}\n\nfunc parseInfix(e string) (rpn string) {\n var stack []string // holds operators and left parenthesis\n for _, tok := range strings.Fields(e) {\n switch tok {\n case \"(\":\n stack = append(stack, tok) // push \"(\" to stack\n case \")\":\n var op string\n for {\n // pop item (\"(\" or operator) from stack\n op, stack = stack[len(stack)-1], stack[:len(stack)-1]\n if op == \"(\" {\n break // discard \"(\"\n }\n rpn += \" \" + op // add operator to result\n }\n default:\n if o1, isOp := opa[tok]; isOp {\n // token is an operator\n for len(stack) > 0 {\n // consider top item on stack\n op := stack[len(stack)-1]\n if o2, isOp := opa[op]; !isOp || o1.prec > o2.prec ||\n o1.prec == o2.prec && o1.rAssoc {\n break\n }\n // top item is an operator that needs to come off\n stack = stack[:len(stack)-1] // pop it\n rpn += \" \" + op // add it to result\n }\n // push operator (the new one) to stack\n stack = append(stack, tok)\n } else { // token is an operand\n if rpn > \"\" {\n rpn += \" \"\n }\n rpn += tok // add operand to result\n }\n }\n }\n // drain stack to result\n for len(stack) > 0 {\n rpn += \" \" + stack[len(stack)-1]\n stack = stack[:len(stack)-1]\n }\n return\n}\n","language":"Go"},{"code":"import Text.Printf\n\nprec :: String -> Int\nprec \"^\" = 4\nprec \"*\" = 3\nprec \"/\" = 3\nprec \"+\" = 2\nprec \"-\" = 2\n\nleftAssoc :: String -> Bool\nleftAssoc \"^\" = False\nleftAssoc _ = True\n\nisOp :: String -> Bool\nisOp [t] = t `elem` \"-+/*^\"\nisOp _ = False\n\nsimSYA :: [String] -> [([String], [String], String)]\nsimSYA xs = final <> [lastStep]\n where\n final = scanl f ([], [], \"\") xs\n lastStep =\n ( \\(x, y, _) ->\n (reverse y <> x, [], \"\")\n )\n $ last final\n f (out, st, _) t\n | isOp t =\n ( reverse (takeWhile testOp st) <> out,\n (t :) (dropWhile testOp st),\n t\n )\n | t == \"(\" = (out, \"(\" : st, t)\n | t == \")\" =\n ( reverse (takeWhile (/= \"(\") st) <> out,\n tail $ dropWhile (/= \"(\") st,\n t\n )\n | otherwise = (t : out, st, t)\n where\n testOp x =\n isOp x\n && ( leftAssoc t && prec t == prec x\n || prec t < prec x\n )\n\nmain :: IO ()\nmain = do\n a <- getLine\n printf \"%30s%20s%7s\" \"Output\" \"Stack\" \"Token\"\n mapM_\n ( \\(x, y, z) ->\n printf\n \"%30s%20s%7s\\n\"\n (unwords $ reverse x)\n (unwords y)\n z\n )\n $ simSYA $ words a\n","language":"Haskell"},{"code":"{-# LANGUAGE LambdaCase #-}\nimport Control.Applicative\nimport Control.Lens\nimport Control.Monad\nimport Control.Monad.Error\nimport Control.Monad.State\nimport System.Console.Readline\n\ndata InToken = InOp Op | InVal Int | LParen | RParen deriving (Show)\ndata OutToken = OutOp Op | OutVal Int\ndata StackElem = StOp Op | Paren deriving (Show)\ndata Op = Pow | Mul | Div | Add | Sub deriving (Show)\ndata Assoc = L | R deriving (Eq)\n\ntype Env = ([OutToken], [StackElem])\ntype RPNComp = StateT Env (Either String)\n\ninstance Show OutToken where\n show (OutOp x) = snd $ opInfo x\n show (OutVal v) = show v\n\nopInfo = \\case\n Pow -> (4, \"^\")\n Mul -> (3, \"*\")\n Div -> (3, \"/\")\n Add -> (2, \"+\")\n Sub -> (2, \"-\")\n\nprec = fst . opInfo\nleftAssoc Pow = False\nleftAssoc _ = True\n\n--Stateful actions\nprocessToken :: InToken -> RPNComp ()\nprocessToken = \\case\n (InVal z) -> pushVal z\n (InOp op) -> pushOp op\n LParen -> pushParen\n RParen -> pushTillParen\n\npushTillParen :: RPNComp ()\npushTillParen = use _2 >>= \\case\n [] -> throwError \"Unmatched right parenthesis\"\n (s:st) -> case s of\n StOp o -> _1 %= (OutOp o:) >> _2 %= tail >> pushTillParen\n Paren -> _2 %= tail\n\npushOp :: Op -> RPNComp ()\npushOp o = use _2 >>= \\case\n [] -> _2 .= [StOp o]\n (s:st) -> case s of\n (StOp o2) -> if leftAssoc o && prec o == prec o2\n || prec o < prec o2\n then _1 %= (OutOp o2:) >> _2 %= tail >> pushOp o\n else _2 %= (StOp o:)\n Paren -> _2 %= (StOp o:)\n\npushVal :: Int -> RPNComp ()\npushVal n = _1 %= (OutVal n:)\n\npushParen :: RPNComp ()\npushParen = _2 %= (Paren:)\n\n--Run StateT\ntoRPN :: [InToken] -> Either String [OutToken]\ntoRPN xs = evalStateT process ([],[])\n where process = mapM_ processToken xs\n >> get >>= \\(a,b) -> (reverse a++) <$> (mapM toOut b)\n toOut :: StackElem -> RPNComp OutToken\n toOut (StOp o) = return $ OutOp o\n toOut Paren = throwError \"Unmatched left parenthesis\"\n\n--Parsing\nreadTokens :: String -> Either String [InToken]\nreadTokens = mapM f . words\n where f = let g = return . InOp in \\case {\n \"^\" -> g Pow; \"*\" -> g Mul; \"/\" -> g Div;\n \"+\" -> g Add; \"-\" -> g Sub; \"(\" -> return LParen;\n \")\" -> return RParen;\n a -> case reads a of\n [] -> throwError $ \"Invalid token `\" ++ a ++ \"`\"\n [(_,x:[])] -> throwError $ \"Invalid token `\" ++ a ++ \"`\"\n [(v,[])] -> return $ InVal v }\n\n--Showing\nshowOutput (Left msg) = msg\nshowOutput (Right xs) = unwords $ map show xs\n\nmain = do\n a <- readline \"Enter expression: \"\n case a of\n Nothing -> putStrLn \"Please enter a line\" >> main\n Just \"exit\" -> return ()\n Just l -> addHistory l >> case readTokens l of\n Left msg -> putStrLn msg >> main\n Right ts -> putStrLn (showOutput (toRPN ts)) >> main\n","language":"Haskell"},{"code":"procedure main()\n infix := \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n printf(\"Infix = %i\\n\",infix)\n printf(\"RPN = %i\\n\",Infix2RPN(infix))\nend\n\nlink printf\n\nrecord op_info(pr,as) # p=precedence, a=associativity (left=null)\n\nprocedure Infix2RPN(expr) #: Infix to RPN parser - shunting yard\nstatic oi\ninitial {\n oi := table() # precedence & associativity\n every oi[!\"+-\"] := op_info(2) # 2L\n every oi[!\"*/\"] := op_info(3) # 3L\n oi[\"^\"] := op_info(4,1) # 4R\n }\n\n ostack := [] # operator stack\n rpn := \"\" # rpn\n\n pat := sprintf(\"%%5s : %%-%ds : %%s\\n\",*expr) # fmt\n printf(pat,\"Token\",\"Output\",\"Op Stack\") # header\n\n expr ? until pos(0) do { # while tokens\n tab(many(' ')) # consume any seperator\n token := tab(upto(' ')|0) # get token\n printf(pat,token,rpn,list2string(ostack)) # report\n if token := numeric(token) then # ... numeric\n rpn ||:= token || \" \"\n else\n if member(oi,token) then { # ... operator\n while member(oi,op2 := ostack[1]) &\n ( /oi[token].as & oi[token].pr <= oi[op2].pr ) |\n ( \\oi[token].as & oi[token].pr < oi[op2].pr ) do\n rpn ||:= pop(ostack) || \" \"\n push(ostack,token)\n }\n else # ... parenthesis\n if token == \"(\" then\n push(ostack,token)\n else if token == \")\" then {\n until ostack[1] == \"(\" do\n rpn ||:= pop(ostack) || \" \" |\n stop(\"Unbalanced parenthesis\")\n pop(ostack) # discard \"(\"\n }\n }\n\n while token := pop(ostack) do # ... input exhausted\n if token == (\"(\"|\")\") then stop(\"Unbalanced parenthesis\")\n else {\n rpn ||:= token || \" \"\n printf(pat,\"\",rpn,list2string(ostack))\n }\n\n return rpn\nend\n\nprocedure list2string(L) #: format list as a string\n every (s := \"[ \") ||:= !L || \" \"\n return s || \"]\"\nend\n","language":"Icon"},{"code":"NB. j does not have a verb based precedence.\nNB. j evaluates verb noun sequences from right to left.\nNB. Seriously. 18 precedence levels in C++ .\n\ndisplay=: ([: : (smoutput@:(, [: ; ' '&,&.>@:{:@:|:))) :: empty\n\nDisplay=: adverb define\n:\nm display^:(0 -.@:-: x)y\n)\n\nNB. Queue, Stack, Pop: m literal name of vector to use. verbose unless x is 0.\nNB. Implementation includes display, group push and pop not available in the RC FIFO & LIFO pages\nNB. As adverbs, these definitions work with any global variable.\nNB. Pop needs the feature, and it helps with display as well.\nQueue=: adverb define NB. enqueue y\n('m'~)=: y ,~ (m~)\nEMPTY\n:\nx (m,' queue')Display y\nm Queue y\n)\n\nStack=: adverb define NB. Stack y\n('m'~)=: (|.y) , (m~)\nEMPTY\n:\nx (m,' stack')Display y\nm Stack y\n)\n\nPop=: adverb define NB. Pop y items\n0 m Pop y\n:\ny=. 0 {:@:, y NB. if y is empty use 0 instead\nrv=. y {. (m~)\n('m'~)=: y }. (m~)\nx (m,' pop') Display rv\nrv\n)\n\nNB. tests\nTEST=: ''\n'TEST'Stack'abc'\n'TEST'Stack'de'\nassert 'edc' -: 'TEST'Pop 3\nassert 'ba' -: 'TEST'Pop 2\nassert 0 (= #) TEST\n'TEST'Queue'abc'\n'TEST'Queue'de'\nassert 'ab' -: 'TEST'Pop 2\nassert 'cde' -: 'TEST'Pop 3\nassert 0 (= #) TEST\n\nany=: +./\n\nDIGITS=: a. {~ 48+i.10 NB. ASCII 48--57\nprecedence_oppression=: <;._1' +- */ ^ ( ) ',DIGITS\nassociativity=: 'xLLRxxL'\n\nclassify=: {:@:I.@:(1 , any@e.&>)&precedence_oppression\n\nNB. The required tokens are also tokens in j.\nNB. Use the default sequential machine ;: for lexical analysis.\nrclex=: (;~ classify)\"0@:;:\n\n\nNB. numbers can be treated as highest precedence operators\nnumber=: Q Queue NB. put numbers onto the output queue\nleft=: S Stack NB. push left paren onto the stack\n\nNB. Until the token at the top of the stack is (, pop\nNB. operators off the stack onto the output queue.\nNB. Pop the left parenthesis from the stack, but not onto the output queue.\nright=: 4 : 0 NB. If the token is a right parenthesis:\ni=. (S~) (i. rclex) '('\nif. i (= #) S~ do.\n smoutput'Check your parens!'\n throw.\nend.\nx Q Queue x S Pop i\nx S Pop 1\nEMPTY\n)\n\nNB. If the token is an operator, o1, then:\nNB.\nNB. while there is an operator token, o2, at the top of the stack, and\nNB. either o1 is [[left-associative and its precedence is less than or\nNB. equal to that of o2]]\"L*.<:\", or o1 is [[right-associative and its precedence\nNB. is less than that of o2]]\"R*.<\", pop o2 off the stack, onto the output queue;\nNB. [[the tally of adjacent leading truths]]\"NCT\"\nNB.\nNB. push o1 onto the stack.\no=: 4 : 0\nP=. 0 0 {:: y\nL=. 'L' = P { associativity\noperators=. ({.~ i.&(rclex'(')) S~\nNB. NCT L*.<: or R*.<\ni=. (+/@:(*./\\)@:((L *. P&<:) +. ((-.L) *. P&<))@:(0&{::\"1)) :: 0: operators\nx Q Queue x S Pop i\nx (S Stack) y\nEMPTY\n)\n\nNB. terminating version of invalid\ninvalid=: 4 : 0\nsmoutput 'invalid token ',0 1 {:: y\nthrow.\n)\n\nNB. demonstrated invalid\ninvalid=: [: smoutput 'discarding invalid token ' , 0 1 {:: ]\n\nNB. shunt_yard is a verb to implement shunt-yard parsing.\nNB. verbose defaults to 0. (quiet)\nNB. use: verbosity shunt_yard_parse algebraic_string\nshunt_yard_parse=: 0&$: : (4 : 0)\n\nNB. j's data structure is array. Rank 1 arrays (vectors)\nNB. are just right for the stack and output queue.\n\n'S Q'=: ;: 'OPERATOR OUTPUT'\n('S'~)=:('Q'~)=: i.0 2\n\nNB. Follow agenda for all tokens, result saved on global OUTPUT variable\nx (invalid`o`o`o`left`right`number@.(0 0 {:: ])\"2 ,:\"1@:rclex) y\nNB. x (invalid`o`o`o`left`right`o@.(0 0 {:: ])\"2 ,:\"1@:rclex) y NB. numbers can be treated as operators\nNB. check for junk on stack\nif. (rclex'(') e. S~ do.\n smoutput'Check your other parens!'\n throw.\nend.\n\nNB. shift remaining operators onto the output queue\nx Q Queue x S Pop # S~\n\nNB. return the output queue\nQ~\n)\n\nalgebra_to_rpn=: {:@:|:@:shunt_yard_parse\n\nfulfill_requirement=: ;@:(' '&,&.>)@:algebra_to_rpn\n","language":"J"},{"code":" fulfill_requirement '3+4*2/(1-5)^2^3'\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n\n shunt_yard_parse'3*)2+4)'\nCheck your parens!\n\n shunt_yard_parse'3*(2+4'\nCheck your other parens!\n\n algebra_to_rpn'1+x*(3+x)'\ndiscarding invalid token x\ndiscarding invalid token x\n┌─┬─┬─┬─┬─┐\n│1│3│+│*│+│\n└─┴─┴─┴─┴─┘\n\n NB. Boxed form useful for evaluation\n algebra_to_rpn'0+666*(1+666*(2+666*(3)))' NB. polynomial evaluation.\n┌─┬───┬─┬───┬─┬───┬─┬─┬─┬─┬─┬─┬─┐\n│0│666│1│666│2│666│3│*│+│*│+│*│+│\n└─┴───┴─┴───┴─┴───┴─┴─┴─┴─┴─┴─┴─┘\n\n 1 fulfill_requirement'3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\nOUTPUT queue 3\nOPERATOR pop\nOUTPUT queue\nOPERATOR stack +\nOUTPUT queue 4\nOPERATOR pop\nOUTPUT queue\nOPERATOR stack *\nOUTPUT queue 2\nOPERATOR pop *\nOUTPUT queue *\nOPERATOR stack /\nOPERATOR stack (\nOUTPUT queue 1\nOPERATOR pop\nOUTPUT queue\nOPERATOR stack -\nOUTPUT queue 5\nOPERATOR pop -\nOUTPUT queue -\nOPERATOR pop (\nOPERATOR pop\nOUTPUT queue\nOPERATOR stack ^\nOUTPUT queue 2\nOPERATOR pop\nOUTPUT queue\nOPERATOR stack ^\nOUTPUT queue 3\nOPERATOR pop ^ ^ / +\nOUTPUT queue ^ ^ / +\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n","language":"J"},{"code":"import java.util.Stack;\n\npublic class ShuntingYard {\n\n public static void main(String[] args) {\n String infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\n System.out.printf(\"infix: %s%n\", infix);\n System.out.printf(\"postfix: %s%n\", infixToPostfix(infix));\n }\n\n static String infixToPostfix(String infix) {\n /* To find out the precedence, we take the index of the\n token in the ops string and divide by 2 (rounding down).\n This will give us: 0, 0, 1, 1, 2 */\n final String ops = \"-+/*^\";\n\n StringBuilder sb = new StringBuilder();\n Stack<Integer> s = new Stack<>();\n\n for (String token : infix.split(\"\\\\s\")) {\n if (token.isEmpty())\n continue;\n char c = token.charAt(0);\n int idx = ops.indexOf(c);\n\n // check for operator\n if (idx != -1) {\n if (s.isEmpty())\n s.push(idx);\n\n else {\n while (!s.isEmpty()) {\n int prec2 = s.peek() / 2;\n int prec1 = idx / 2;\n if (prec2 > prec1 || (prec2 == prec1 && c != '^'))\n sb.append(ops.charAt(s.pop())).append(' ');\n else break;\n }\n s.push(idx);\n }\n }\n else if (c == '(') {\n s.push(-2); // -2 stands for '('\n }\n else if (c == ')') {\n // until '(' on stack, pop operators.\n while (s.peek() != -2)\n sb.append(ops.charAt(s.pop())).append(' ');\n s.pop();\n }\n else {\n sb.append(token).append(' ');\n }\n }\n while (!s.isEmpty())\n sb.append(ops.charAt(s.pop())).append(' ');\n return sb.toString();\n }\n}\n","language":"Java"},{"code":"function Stack() {\n this.dataStore = [];\n this.top = 0;\n this.push = push;\n this.pop = pop;\n this.peek = peek;\n this.length = length;\n}\n\nfunction push(element) {\n this.dataStore[this.top++] = element;\n}\n\nfunction pop() {\n return this.dataStore[--this.top];\n}\n\nfunction peek() {\n return this.dataStore[this.top-1];\n}\n\nfunction length() {\n return this.top;\n}\n\nvar infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\ninfix = infix.replace(/\\s+/g, ''); // remove spaces, so infix[i]!=\" \"\n\nvar s = new Stack();\nvar ops = \"-+/*^\";\nvar precedence = {\"^\":4, \"*\":3, \"/\":3, \"+\":2, \"-\":2};\nvar associativity = {\"^\":\"Right\", \"*\":\"Left\", \"/\":\"Left\", \"+\":\"Left\", \"-\":\"Left\"};\nvar token;\nvar postfix = \"\";\nvar o1, o2;\n\nfor (var i = 0; i < infix.length; i++) {\n token = infix[i];\n if (token >= \"0\" && token <= \"9\") { // if token is operand (here limited to 0 <= x <= 9)\n postfix += token + \" \";\n }\n else if (ops.indexOf(token) != -1) { // if token is an operator\n o1 = token;\n o2 = s.peek();\n while (ops.indexOf(o2)!=-1 && ( // while operator token, o2, on top of the stack\n // and o1 is left-associative and its precedence is less than or equal to that of o2\n (associativity[o1] == \"Left\" && (precedence[o1] <= precedence[o2]) ) ||\n // the algorithm on wikipedia says: or o1 precedence < o2 precedence, but I think it should be\n // or o1 is right-associative and its precedence is less than that of o2\n (associativity[o1] == \"Right\" && (precedence[o1] < precedence[o2]))\n )){\n postfix += o2 + \" \"; // add o2 to output queue\n s.pop(); // pop o2 of the stack\n o2 = s.peek(); // next round\n }\n s.push(o1); // push o1 onto the stack\n }\n else if (token == \"(\") { // if token is left parenthesis\n s.push(token); // then push it onto the stack\n }\n else if (token == \")\") { // if token is right parenthesis\n while (s.peek() != \"(\"){ // until token at top is (\n postfix += s.pop() + \" \";\n }\n s.pop(); // pop (, but not onto the output queue\n }\n}\npostfix += s.dataStore.reverse().join(\" \");\nprint(postfix);\n","language":"JavaScript"},{"code":"function parseinfix2rpn(s)\n outputq = []\n opstack = []\n infix = split(s)\n for tok in infix\n if all(isnumber, tok)\n push!(outputq, tok)\n elseif tok == \"(\"\n push!(opstack, tok)\n elseif tok == \")\"\n while !isempty(opstack) && (op = pop!(opstack)) != \"(\"\n push!(outputq, op)\n end\n else # operator\n while !isempty(opstack)\n op = pop!(opstack)\n if Base.operator_precedence(Symbol(op)) > Base.operator_precedence(Symbol(tok)) ||\n (Base.operator_precedence(Symbol(op)) ==\n Base.operator_precedence(Symbol(tok)) && op != \"^\")\n push!(outputq, op)\n else\n push!(opstack, op) # undo peek\n break\n end\n end\n push!(opstack, tok)\n end\n println(\"The working output stack is $outputq\")\n end\n while !isempty(opstack)\n if (op = pop!(opstack)) == \"(\"\n throw(\"mismatched parentheses\")\n else\n push!(outputq, op)\n end\n end\n outputq\nend\n\nteststring = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\nprintln(\"\\nResult: $teststring becomes $(join(parseinfix2rpn(teststring), ' '))\")\n","language":"Julia"},{"code":"// version 1.2.0\n\nimport java.util.Stack\n\n/* To find out the precedence, we take the index of the\n token in the OPS string and divide by 2 (rounding down).\n This will give us: 0, 0, 1, 1, 2 */\nconst val OPS = \"-+/*^\"\n\nfun infixToPostfix(infix: String): String {\n val sb = StringBuilder()\n val s = Stack<Int>()\n val rx = Regex(\"\"\"\\s\"\"\")\n for (token in infix.split(rx)) {\n if (token.isEmpty()) continue\n val c = token[0]\n val idx = OPS.indexOf(c)\n\n // check for operator\n if (idx != - 1) {\n if (s.isEmpty()) {\n s.push(idx)\n }\n else {\n while (!s.isEmpty()) {\n val prec2 = s.peek() / 2\n val prec1 = idx / 2\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) {\n sb.append(OPS[s.pop()]).append(' ')\n }\n else break\n }\n s.push(idx)\n }\n }\n else if (c == '(') {\n s.push(-2) // -2 stands for '('\n }\n else if (c == ')') {\n // until '(' on stack, pop operators.\n while (s.peek() != -2) sb.append(OPS[s.pop()]).append(' ')\n s.pop()\n }\n else {\n sb.append(token).append(' ')\n }\n }\n while (!s.isEmpty()) sb.append(OPS[s.pop()]).append(' ')\n return sb.toString()\n}\n\nfun main(args: Array<String>) {\n val es = listOf(\n \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\",\n \"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\"\n )\n for (e in es) {\n println(\"Infix : $e\")\n println(\"Postfix : ${infixToPostfix(e)}\\n\")\n }\n}\n","language":"Kotlin"},{"code":"global stack$,queue$\nstack$=\"\"\nqueue$=\"\"\n\nin$ = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\nprint \"Input:\"\nprint in$\n\ntoken$ = \"#\"\nprint \"No\", \"token\", \"stack\", \"queue\"\n\nwhile 1\n i=i+1\n token$ = word$(in$, i)\n if token$ = \"\" then i=i-1: exit while\n print i, token$, reverse$(stack$), queue$\n\n select case\n case token$ = \"(\"\n call stack.push token$\n\n case token$ = \")\"\n while stack.peek$() <> \"(\"\n 'if stack is empty\n if stack$=\"\" then print \"Error: no matching '(' for token \";i: end\n call queue.push stack.pop$()\n wend\n discard$=stack.pop$() 'discard \"(\"\n\n case isOperator(token$)\n op1$=token$\n while(isOperator(stack.peek$()))\n op2$=stack.peek$()\n select case\n case op2$<>\"^\" and precedence(op1$) = precedence(op2$)\n '\"^\" is the only right-associative operator\n call queue.push stack.pop$()\n case precedence(op1$) < precedence(op2$)\n call queue.push stack.pop$()\n case else\n exit while\n end select\n wend\n call stack.push op1$\n\n case else 'number\n 'actually, wrong operator could end up here, like say %\n 'If the token is a number, then add it to the output queue.\n call queue.push token$\n end select\n\nwend\n\nwhile stack$<>\"\"\n if stack.peek$() = \"(\" then print \"no matching ')'\": end\n call queue.push stack.pop$()\nwend\n\nprint \"Output:\"\nwhile queue$<>\"\"\n print queue.pop$();\" \";\nwend\nprint\n\nend\n\n'------------------------------------------\nfunction isOperator(op$)\n isOperator = instr(\"+-*/^\", op$)<>0 AND len(op$)=1\nend function\n\nfunction precedence(op$)\n if isOperator(op$) then\n precedence = 1 _\n + (instr(\"+-*/^\", op$)<>0) _\n + (instr(\"*/^\", op$)<>0) _\n + (instr(\"^\", op$)<>0)\n end if\nend function\n\n'------------------------------------------\nsub stack.push s$\n stack$=s$+\"|\"+stack$\nend sub\n\nsub queue.push s$\n queue$=queue$+s$+\"|\"\nend sub\n\nfunction queue.pop$()\n 'it does return empty on empty stack or queue\n queue.pop$=word$(queue$,1,\"|\")\n queue$=mid$(queue$,instr(queue$,\"|\")+1)\nend function\n\nfunction stack.pop$()\n 'it does return empty on empty stack or queue\n stack.pop$=word$(stack$,1,\"|\")\n stack$=mid$(stack$,instr(stack$,\"|\")+1)\nend function\n\nfunction stack.peek$()\n 'it does return empty on empty stack or queue\n stack.peek$=word$(stack$,1,\"|\")\nend function\n\nfunction reverse$(s$)\n reverse$ = \"\"\n token$=\"#\"\n while token$<>\"\"\n i=i+1\n token$=word$(s$,i,\"|\")\n reverse$ = token$;\" \";reverse$\n wend\nend function\n","language":"Liberty-BASIC"},{"code":"-- Lua 5.3.5\n-- Retrieved from: https://devforum.roblox.com/t/more-efficient-way-to-implement-shunting-yard/1328711\n-- Modified slightly to ensure conformity with other code snippets posted here\nlocal OPERATOR_PRECEDENCE = {\n -- [operator] = { [precedence], [is left assoc.] }\n ['-'] = { 2, true };\n ['+'] = { 2, true };\n ['/'] = { 3, true };\n ['*'] = { 3, true };\n ['^'] = { 4, false };\n}\n\nlocal function shuntingYard(expression)\n local outputQueue = { }\n local operatorStack = { }\n\n local number, operator, parenthesis, fcall\n\n while #expression > 0 do\n local nStartPos, nEndPos = string.find(expression, '(%-?%d+%.?%d*)')\n\n if nStartPos == 1 and nEndPos > 0 then\n number, expression = string.sub(expression, nStartPos, nEndPos), string.sub(expression, nEndPos + 1)\n table.insert(outputQueue, tonumber(number))\n\n print('token:', number)\n print('queue:', unpack(outputQueue))\n print('stack:', unpack(operatorStack))\n else\n local oStartPos, oEndPos = string.find(expression, '([%-%+%*/%^])')\n\n if oStartPos == 1 and oEndPos > 0 then\n operator, expression = string.sub(expression, oStartPos, oEndPos), string.sub(expression, oEndPos + 1)\n\n if #operatorStack > 0 then\n while operatorStack[1] ~= '(' do\n local operator1Precedence = OPERATOR_PRECEDENCE[operator]\n local operator2Precedence = OPERATOR_PRECEDENCE[operatorStack[1]]\n\n if operator2Precedence and ((operator2Precedence[1] > operator1Precedence[1]) or (operator2Precedence[1] == operator1Precedence[1] and operator1Precedence[2])) then\n table.insert(outputQueue, table.remove(operatorStack, 1))\n else\n break\n end\n end\n end\n\n table.insert(operatorStack, 1, operator)\n\n print('token:', operator)\n print('queue:', unpack(outputQueue))\n print('stack:', unpack(operatorStack))\n else\n local pStartPos, pEndPos = string.find(expression, '[%(%)]')\n\n if pStartPos == 1 and pEndPos > 0 then\n parenthesis, expression = string.sub(expression, pStartPos, pEndPos), string.sub(expression, pEndPos + 1)\n\n if parenthesis == ')' then\n while operatorStack[1] ~= '(' do\n assert(#operatorStack > 0)\n table.insert(outputQueue, table.remove(operatorStack, 1))\n end\n\n assert(operatorStack[1] == '(')\n table.remove(operatorStack, 1)\n else\n table.insert(operatorStack, 1, parenthesis)\n end\n\n print('token:', parenthesis)\n print('queue:', unpack(outputQueue))\n print('stack:', unpack(operatorStack))\n else\n local wStartPos, wEndPos = string.find(expression, '%s+')\n\n if wStartPos == 1 and wEndPos > 0 then\n expression = string.sub(expression, wEndPos + 1)\n else\n error('Invalid character set: '.. expression)\n end\n end\n end\n end\n end\n\n while #operatorStack > 0 do\n assert(operatorStack[1] ~= '(')\n table.insert(outputQueue, table.remove(operatorStack, 1))\n end\n\n return table.concat(outputQueue, ' ')\nend\n\n\nlocal goodmath = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\n\nprint('infix:', goodmath)\nprint('postfix:', shuntingYard(goodmath))\n","language":"Lua"},{"code":"rpn[str_] :=\n StringRiffle[\n ToString /@\n Module[{in = StringSplit[str], stack = {}, out = {}, next},\n While[in != {}, next = in[[1]]; in = in[[2 ;;]];\n Which[DigitQ[next], AppendTo[out, next], LetterQ[next],\n AppendTo[stack, next], next == \",\",\n While[stack[[-1]] != \"(\", AppendTo[out, stack[[-1]]];\n stack = stack[[;; -2]]], next == \"^\", AppendTo[stack, \"^\"],\n next == \"*\",\n While[stack != {} && MatchQ[stack[[-1]], \"^\" | \"*\" | \"/\"],\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\n AppendTo[stack, \"*\"], next == \"/\",\n While[stack != {} && MatchQ[stack[[-1]], \"^\" | \"*\" | \"/\"],\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\n AppendTo[stack, \"/\"], next == \"+\",\n While[stack != {} &&\n MatchQ[stack[[-1]], \"^\" | \"*\" | \"/\" | \"+\" | \"-\"],\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\n AppendTo[stack, \"+\"], next == \"-\",\n While[stack != {} &&\n MatchQ[stack[[-1]], \"^\" | \"*\" | \"/\" | \"+\" | \"-\"],\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\n AppendTo[stack, \"-\"], next == \"(\", AppendTo[stack, \"(\"],\n next == \")\",\n While[stack[[-1]] =!= \"(\", AppendTo[out, stack[[-1]]];\n stack = stack[[;; -2]]]; stack = stack[[;; -2]];\n If[StringQ[stack[[-1]]], AppendTo[out, stack[[-1]]];\n stack = stack[[;; -2]]]]];\n While[stack != {}, AppendTo[out, stack[[-1]]];\n stack = stack[[;; -2]]]; out]];\nPrint[rpn[\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"]];\n","language":"Mathematica"},{"code":"import tables, strutils, strformat\n\ntype operator = tuple[prec:int, rassoc:bool]\n\nlet ops = newTable[string, operator](\n [ (\"^\", (4, true )),\n (\"*\", (3, false)),\n (\"/\", (3, false)),\n (\"+\", (2, false)),\n (\"-\", (2, false)) ])\n\nproc shuntRPN(tokens:seq[string]): string =\n var stack: seq[string]\n var op:string\n\n for token in tokens:\n case token\n of \"(\": stack.add token\n of \")\":\n while stack.len > 0:\n op = stack.pop()\n if op == \"(\": break\n result &= op & \" \"\n else:\n if token in ops:\n while stack.len > 0:\n op = stack[^1] # peek stack top\n if not (op in ops): break\n if ops[token].prec > ops[op].prec or (ops[token].rassoc and (ops[token].prec == ops[op].prec)):\n break\n discard stack.pop()\n result &= op & \" \"\n stack.add token\n else:\n result &= token & \" \"\n echo fmt\"\"\"{token:5} {join(stack,\" \"):18} {result:25} \"\"\"\n\n while stack.len > 0:\n result &= stack.pop() & \" \"\n echo fmt\"\"\" {join(stack,\" \"):18} {result:25} \"\"\"\n\nlet input = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n\necho &\"for infix expression: '{input}' \\n\", \"\\nTOKEN OP STACK RPN OUTPUT\"\necho \"postfix: \", shuntRPN(input.strip.split)\n","language":"Nim"},{"code":"type associativity = Left | Right;;\n\n\nlet prec op =\n match op with\n | \"^\" -> 4\n | \"*\" -> 3\n | \"/\" -> 3\n | \"+\" -> 2\n | \"-\" -> 2\n | _ -> -1;;\n\n\nlet assoc op =\n match op with\n | \"^\" -> Right\n | _ -> Left;;\n\n\nlet split_while p =\n let rec go ls xs =\n match xs with\n | x::xs' when p x -> go (x::ls) xs'\n | _ -> List.rev ls, xs\n in go [];;\n\n\nlet rec intercalate sep xs =\n match xs with\n | [] -> \"\"\n | [x] -> x\n | x::xs' -> x ^ sep ^ intercalate sep xs';;\n\n\nlet shunting_yard =\n let rec pusher stack queue tkns =\n match tkns with\n | [] -> List.rev queue @ stack\n | \"(\"::tkns' -> pusher (\"(\"::stack) queue tkns'\n | \")\"::tkns' ->\n let mv, \"(\"::stack' = split_while ((<>) \"(\") stack in\n pusher stack' (mv @ queue) tkns'\n | t::tkns' when prec t < 0 -> pusher stack (t::queue) tkns'\n | op::tkns' ->\n let mv_to_queue op2 =\n (match assoc op with\n | Left -> prec op <= prec op2\n | Right -> prec op < prec op2)\n in\n let mv, stack' = split_while mv_to_queue stack in\n pusher (op::stack') (mv @ queue) tkns'\n in pusher [] [];;\n\n\nlet () =\n let inp = read_line () in\n let tkns = String.split_on_char ' ' inp in\n let postfix = shunting_yard tkns in\n print_endline (intercalate \" \" postfix);;\n","language":"OCaml"},{"code":"my %prec = (\n '^' => 4,\n '*' => 3,\n '/' => 3,\n '+' => 2,\n '-' => 2,\n '(' => 1\n);\n\nmy %assoc = (\n '^' => 'right',\n '*' => 'left',\n '/' => 'left',\n '+' => 'left',\n '-' => 'left'\n);\n\nsub shunting_yard {\n my @inp = split ' ', $_[0];\n my @ops;\n my @res;\n\n my $report = sub { printf \"%25s %-7s %10s %s\\n\", \"@res\", \"@ops\", $_[0], \"@inp\" };\n my $shift = sub { $report->(\"shift @_\"); push @ops, @_ };\n my $reduce = sub { $report->(\"reduce @_\"); push @res, @_ };\n\n while (@inp) {\n my $token = shift @inp;\n if ( $token =~ /\\d/ ) { $reduce->($token) }\n elsif ( $token eq '(' ) { $shift->($token) }\n elsif ( $token eq ')' ) {\n while ( @ops and \"(\" ne ( my $x = pop @ops ) ) { $reduce->($x) }\n } else {\n my $newprec = $prec{$token};\n while (@ops) {\n my $oldprec = $prec{ $ops[-1] };\n last if $newprec > $oldprec;\n last if $newprec == $oldprec and $assoc{$token} eq 'right';\n $reduce->( pop @ops );\n }\n $shift->($token);\n }\n }\n $reduce->( pop @ops ) while @ops;\n @res;\n}\n\nlocal $, = \" \";\nprint shunting_yard '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">operators</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"^\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"*\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"/\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"-\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">precedence</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">infix</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rpn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">stack_top</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">ops</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">substitute_all</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">infix</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #008000;\">\"(\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\")\"</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\" ( \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" ) \"</span><span style=\"color: #0000FF;\">}),</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Infix input: %-32s%s\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">infix</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">show_workings</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">op</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ops</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"(\"</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\")\"</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">stack_top</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[$]</span>\n <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">stack_top</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"(\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">stack_top</span>\n <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" \"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">operators</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">prec</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">precedence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">stack_top</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[$]</span>\n <span style=\"color: #000000;\">k</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack_top</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">operators</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">prec</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">precedence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">prec</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">precedence</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">stack_top</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"^\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">stack_top</span>\n <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" \"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #000000;\">stack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">op</span>\n <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" \"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">?{</span><span style=\"color: #000000;\">op</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">op</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">stack</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">sep</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #000000;\">op</span>\n <span style=\"color: #000000;\">sep</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" \"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"result: %-22s [%s]\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">rpn</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"ok\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"**ERROR**\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 4 2 * 1 5 - 2 3 ^ ^ / +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">show_workings</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"((1 + 2) ^ (3 + 4)) ^ (5 + 6)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 + 3 4 + ^ 5 6 + ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(1 + 2) ^ (3 + 4) ^ (5 + 6)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 + 3 4 + 5 6 + ^ ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"((3 ^ 4) ^ 2 ^ 9) ^ 2 ^ 5\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(1 + 4) * (5 + 3) * 2 * 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 4 + 5 3 + * 2 * 3 *\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 * 2 * 3 * 4\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 * 3 * 4 *\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 + 2 + 3 + 4\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 + 3 + 4 +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(1 + 2) ^ (3 + 4)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 + 3 4 + ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(5 ^ 6) ^ 7\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 6 ^ 7 ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 ^ 4 ^ 3 ^ 2\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 4 3 2 ^ ^ ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 + 2 + 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 + 3 +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 ^ 2 ^ 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 3 ^ ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(1 ^ 2) ^ 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 ^ 3 ^\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 - 1 + 3\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 1 - 3 +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 + 1 - 1\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 1 + 1 -\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1 - (2 + 3)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"1 2 3 + -\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 + 3 + 2\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 3 + 2 +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 + 4 + 3 + 2\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 4 + 3 + 2 +\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 * 4 * 3 * 2\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 4 * 3 * 2 *\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"5 + 4 - (3 + 2)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"5 4 + 3 2 + -\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 - 4 * 5\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 4 5 * -\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"3 * (4 - 5)\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 4 5 - *\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"(3 - 4) * 5\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"3 4 - 5 *\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 * 2 + 1 - 5\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 2 * 1 + 5 -\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">shunting_yard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"4 * 2 / (1 - 5) ^ 2\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"4 2 * 1 5 - 2 ^ /\"</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(de operator (Op)\n (member Op '(\"\\^\" \"*\" \"/\" \"+\" \"-\")) )\n\n(de leftAssoc (Op)\n (member Op '(\"*\" \"/\" \"+\" \"-\")) )\n\n(de precedence (Op)\n (case Op\n (\"\\^\" 4)\n ((\"*\" \"/\") 3)\n ((\"+\" \"-\") 2) ) )\n\n(de shuntingYard (Str)\n (make\n (let (Fmt (-7 -30 -4) Stack)\n (tab Fmt \"Token\" \"Output\" \"Stack\")\n (for Token (str Str \"_\")\n (cond\n ((num? Token) (link @))\n ((= \"(\" Token) (push 'Stack Token))\n ((= \")\" Token)\n (until (= \"(\" (car Stack))\n (unless Stack\n (quit \"Unbalanced Stack\") )\n (link (pop 'Stack)) )\n (pop 'Stack) )\n (T\n (while\n (and\n (operator (car Stack))\n ((if (leftAssoc (car Stack)) <= <)\n (precedence Token)\n (precedence (car Stack)) ) )\n (link (pop 'Stack)) )\n (push 'Stack Token) ) )\n (tab Fmt Token (glue \" \" (made)) Stack) )\n (while Stack\n (when (= \"(\" (car Stack))\n (quit \"Unbalanced Stack\") )\n (link (pop 'Stack))\n (tab Fmt NIL (glue \" \" (made)) Stack) ) ) ) )\n","language":"PicoLisp"},{"code":": (shuntingYard \"3 + 4 * 2 / (1 - 5) \\^ 2 \\^ 3\")\nToken Output Stack\n3 3\n+ 3 +\n4 3 4 +\n* 3 4 *+\n2 3 4 2 *+\n/ 3 4 2 * /+\n( 3 4 2 * (/+\n1 3 4 2 * 1 (/+\n- 3 4 2 * 1 -(/+\n5 3 4 2 * 1 5 -(/+\n) 3 4 2 * 1 5 - /+\n^ 3 4 2 * 1 5 - ^/+\n2 3 4 2 * 1 5 - 2 ^/+\n^ 3 4 2 * 1 5 - 2 ^^/+\n3 3 4 2 * 1 5 - 2 3 ^^/+\n 3 4 2 * 1 5 - 2 3 ^ ^/+\n 3 4 2 * 1 5 - 2 3 ^ ^ /+\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n-> (3 4 2 \"*\" 1 5 \"-\" 2 3 \"\\^\" \"\\^\" \"/\" \"+\")\n","language":"PicoLisp"},{"code":"cvt: procedure options (main); /* 15 January 2012. */\n declare (in, stack, out) character (100) varying;\n declare (ch, chs) character (1);\n declare display bit (1) static initial ('0'b);\n\n in = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\n\n in = '(' || in || ' ) '; /* Initialize with parentheses */\n\n put skip edit ('INPUT', 'STACK', 'OUTPUT') (a, col(37), a, col(47), a);\n\n stack = ' '; out = ''; /* Initialize */\n do while (length (in) > 0);\n ch = substr(in, 1, 1);\n select (ch);\n when (' ') ;\n\n when ('+', '-', '*', '/', '^')\n do;\n /* Copy any equal or higher-priority operators from the stack */\n /* to the output string */\n chs = substr(stack, 1, 1);\n do while ((spriority(chs) >= priority(ch)) & ( chs ^= ')' ) );\n if display then put skip list ('unstacking: ' || chs);\n out = out || ' ' || chs;\n stack = substr(stack, 2);\n chs = substr(stack, 1, 1);\n end;\n /* Now copy the input to the TOS. */\n if display then put skip list ('copying ' || ch || ' to TOS');\n stack = ch || stack;\n end;\n when ( '(' )\n do;\n stack = '(' || stack;\n if display then put skip list ('stacking the (' );\n end;\n when ( ')' )\n do; /* copy all operators from the stack to the output, */\n /* until a '(' is encountered. */\n chs = substr(stack, 1, 1);\n do while (chs ^= '(' );\n if display then put skip list ('copying stack ' || chs || ' to output');\n put skip edit (stack, out) (col(37), a, col(47), a);\n out = out || ' ' || chs;\n stack = substr(stack, 2);\n chs = substr(stack, 1, 1);\n end;\n /* Now delete the '(' from the input and */\n /* the ')' from the top of the stack. */\n if display then put skip edit ('Deleting ( from TOS') (col(30), a);\n stack = substr(stack, 2);\n /* The '(' on the input is removed at the end of the loop. */\n end;\n otherwise /* it's an operand. */\n do;\n out = out || ' ';\n do while (ch ^= ' ');\n if display then put skip list ('copying ' || ch || ' to output');\n out = out || ch;\n in = substr(in, 2);\n ch = substr(in, 1, 1);\n end;\n end;\n end;\n in = substr(in, 2); /* Remove one character from the input */\n put skip edit (in, stack, out) (a, col(37), a, col(47), a);\n end;\n\npriority: procedure (ch) returns (character(1));\n declare ch character (1);\n\n return ( translate(ch, '1122335', '()+-*/^' ) );\nend priority;\n\nspriority: procedure (ch) returns (character(1));\n declare ch character (1);\n\n return ( translate(ch, '1122334', '()+-*/^' ) );\nend spriority;\n\nend cvt;\n","language":"PL-I"},{"code":"INPUT STACK OUTPUT\n3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) (\n+ 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) ( 3\n 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3\n4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3\n* 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3 4\n 2 / ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4\n2 / ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4\n/ ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4 2\n ( 1 - 5 ) ^ 2 ^ 3 ) /+( 3 4 2 *\n( 1 - 5 ) ^ 2 ^ 3 ) /+( 3 4 2 *\n 1 - 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 *\n1 - 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 *\n- 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 * 1\n 5 ) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1\n5 ) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1\n) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1 5\n -(/+( 3 4 2 * 1 5\n ^ 2 ^ 3 ) /+( 3 4 2 * 1 5 -\n^ 2 ^ 3 ) /+( 3 4 2 * 1 5 -\n 2 ^ 3 ) ^/+( 3 4 2 * 1 5 -\n2 ^ 3 ) ^/+( 3 4 2 * 1 5 -\n^ 3 ) ^/+( 3 4 2 * 1 5 - 2\n 3 ) ^^/+( 3 4 2 * 1 5 - 2\n3 ) ^^/+( 3 4 2 * 1 5 - 2\n) ^^/+( 3 4 2 * 1 5 - 2 3\n ^^/+( 3 4 2 * 1 5 - 2 3\n ^/+( 3 4 2 * 1 5 - 2 3 ^\n /+( 3 4 2 * 1 5 - 2 3 ^ ^\n +( 3 4 2 * 1 5 - 2 3 ^ ^ /\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\n","language":"PL-I"},{"code":"from collections import namedtuple\nfrom pprint import pprint as pp\n\nOpInfo = namedtuple('OpInfo', 'prec assoc')\nL, R = 'Left Right'.split()\n\nops = {\n '^': OpInfo(prec=4, assoc=R),\n '*': OpInfo(prec=3, assoc=L),\n '/': OpInfo(prec=3, assoc=L),\n '+': OpInfo(prec=2, assoc=L),\n '-': OpInfo(prec=2, assoc=L),\n '(': OpInfo(prec=9, assoc=L),\n ')': OpInfo(prec=0, assoc=L),\n }\n\nNUM, LPAREN, RPAREN = 'NUMBER ( )'.split()\n\n\ndef get_input(inp = None):\n 'Inputs an expression and returns list of (TOKENTYPE, tokenvalue)'\n\n if inp is None:\n inp = input('expression: ')\n tokens = inp.strip().split()\n tokenvals = []\n for token in tokens:\n if token in ops:\n tokenvals.append((token, ops[token]))\n #elif token in (LPAREN, RPAREN):\n # tokenvals.append((token, token))\n else:\n tokenvals.append((NUM, token))\n return tokenvals\n\ndef shunting(tokenvals):\n outq, stack = [], []\n table = ['TOKEN,ACTION,RPN OUTPUT,OP STACK,NOTES'.split(',')]\n for token, val in tokenvals:\n note = action = ''\n if token is NUM:\n action = 'Add number to output'\n outq.append(val)\n table.append( (val, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\n elif token in ops:\n t1, (p1, a1) = token, val\n v = t1\n note = 'Pop ops from stack to output'\n while stack:\n t2, (p2, a2) = stack[-1]\n if (a1 == L and p1 <= p2) or (a1 == R and p1 < p2):\n if t1 != RPAREN:\n if t2 != LPAREN:\n stack.pop()\n action = '(Pop op)'\n outq.append(t2)\n else:\n break\n else:\n if t2 != LPAREN:\n stack.pop()\n action = '(Pop op)'\n outq.append(t2)\n else:\n stack.pop()\n action = '(Pop & discard \"(\")'\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\n break\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\n v = note = ''\n else:\n note = ''\n break\n note = ''\n note = ''\n if t1 != RPAREN:\n stack.append((token, val))\n action = 'Push op token to stack'\n else:\n action = 'Discard \")\"'\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\n note = 'Drain stack to output'\n while stack:\n v = ''\n t2, (p2, a2) = stack[-1]\n action = '(Pop op)'\n stack.pop()\n outq.append(t2)\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\n v = note = ''\n return table\n\nif __name__ == '__main__':\n infix = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\n print( 'For infix expression: %r\\n' % infix )\n rp = shunting(get_input(infix))\n maxcolwidths = [len(max(x, key=len)) for x in zip(*rp)]\n row = rp[0]\n print( ' '.join('{cell:^{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\n for row in rp[1:]:\n print( ' '.join('{cell:<{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\n\n print('\\n The final output RPN is: %r' % rp[-1][2])\n","language":"Python"},{"code":"#lang racket\n;print column of width w\n(define (display-col w s)\n (let* ([n-spaces (- w (string-length s))]\n [spaces (make-string n-spaces #\\space)])\n (display (string-append s spaces))))\n;print columns given widths (idea borrowed from PicoLisp)\n(define (tab ws . ss) (for-each display-col ws ss) (newline))\n\n(define input \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\")\n\n(define (paren? s) (or (string=? s \"(\") (string=? s \")\")))\n(define-values (prec lasso? rasso? op?)\n (let ([table '([\"^\" 4 r]\n [\"*\" 3 l]\n [\"/\" 3 l]\n [\"+\" 2 l]\n [\"-\" 2 l])])\n (define (asso x) (caddr (assoc x table)))\n (values (λ (x) (cadr (assoc x table)))\n (λ (x) (symbol=? (asso x) 'l))\n (λ (x) (symbol=? (asso x) 'r))\n (λ (x) (member x (map car table))))))\n\n(define (shunt s)\n (define widths (list 8 (string-length input) (string-length input) 20))\n (tab widths \"TOKEN\" \"OUT\" \"STACK\" \"ACTION\")\n (let shunt ([out '()] [ops '()] [in (string-split s)] [action \"\"])\n (match in\n ['() (if (memf paren? ops)\n (error \"unmatched parens\")\n (reverse (append (reverse ops) out)))]\n [(cons x in)\n (tab widths x (string-join (reverse out) \" \") (string-append* ops) action)\n (match x\n [(? string->number n) (shunt (cons n out) ops in (format \"out ~a\" n))]\n [\"(\" (shunt out (cons \"(\" ops) in \"push (\")]\n [\")\" (let-values ([(l r) (splitf-at ops (λ (y) (not (string=? y \"(\"))))])\n (match r\n ['() (error \"unmatched parens\")]\n [(cons _ r) (shunt (append (reverse l) out) r in \"clear til )\")]))]\n [else (let-values ([(l r) (splitf-at ops (λ (y) (and (op? y)\n ((if (lasso? x) <= <) (prec x) (prec y)))))])\n (shunt (append (reverse l) out) (cons x r) in (format \"out ~a, push ~a\" l x)))])])))\n","language":"Racket"},{"code":" my %prec =\n '^' => 4,\n '*' => 3,\n '/' => 3,\n '+' => 2,\n '-' => 2,\n '(' => 1;\n\nmy %assoc =\n '^' => 'right',\n '*' => 'left',\n '/' => 'left',\n '+' => 'left',\n '-' => 'left';\n\nsub shunting-yard ($prog) {\n my @inp = $prog.words;\n my @ops;\n my @res;\n\n sub report($op) { printf \"%25s %-7s %10s %s\\n\", ~@res, ~@ops, $op, ~@inp }\n sub shift($t) { report( \"shift $t\"); @ops.push: $t }\n sub reduce($t) { report(\"reduce $t\"); @res.push: $t }\n\n while @inp {\n given @inp.shift {\n when /\\d/ { reduce $_ };\n when '(' { shift $_ }\n when ')' { while @ops and (my $x = @ops.pop and $x ne '(') { reduce $x } }\n default {\n my $newprec = %prec{$_};\n while @ops {\n my $oldprec = %prec{@ops[*-1]};\n last if $newprec > $oldprec;\n last if $newprec == $oldprec and %assoc{$_} eq 'right';\n reduce @ops.pop;\n }\n shift $_;\n }\n }\n }\n reduce @ops.pop while @ops;\n @res;\n}\n\nsay shunting-yard '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\n","language":"Raku"},{"code":"/*REXX pgm converts infix arith. expressions to Reverse Polish notation (shunting─yard).*/\nparse arg x /*obtain optional argument from the CL.*/\nif x='' then x= '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3' /*Not specified? Then use the default.*/\nox=x\nx='(' space(x) \") \" /*force stacking for the expression. */\n#=words(x) /*get number of tokens in expression. */\n do i=1 for #; @.i=word(x, i) /*assign the input tokens to an array. */\n end /*i*/\ntell=1 /*set to 0 if working steps not wanted.*/\nL=max( 20, length(x) ) /*use twenty for the minimum show width*/\n\nsay 'token' center(\"input\" , L, '─') center(\"stack\" , L%2, '─'),\n center(\"output\", L, '─') center(\"action\", L, '─')\nop= \")(-+/*^\"; Rop=substr(op,3); p.=; n=length(op); RPN= /*some handy-dandy vars.*/\ns.=\n do i=1 for n; _=substr(op,i,1); s._=(i+1)%2; p._=s._+(i==n); end /*i*/\n$= /* [↑] assign the operator priorities.*/\n do k=1 for #; ?=@.k /*process each token from the @. list.*/\n select /*@.k is: (, operator, ), operand*/\n when ?=='(' then do; $=\"(\" $; call show 'moving' ? \"──► stack\"; end\n when isOp(?) then do; !=word($, 1) /*get token from stack*/\n do while ! \\==')' & s.!>=p.?\n RPN=RPN ! /*add token to RPN.*/\n $=subword($, 2) /*del token from stack*/\n call show 'unstacking:' !\n !=word($, 1) /*get token from stack*/\n end /*while*/\n $=? $ /*add token to stack*/\n call show 'moving' ? \"──► stack\"\n end\n when ?==')' then do; !=word($, 1) /*get token from stack*/\n do while !\\=='('; RPN=RPN ! /*add token to RPN. */\n $=subword($, 2) /*del token from stack*/\n != word($, 1) /*get token from stack*/\n call show 'moving stack' ! \"──► RPN\"\n end /*while*/\n $=subword($, 2) /*del token from stack*/\n call show 'deleting ( from the stack'\n end\n otherwise RPN=RPN ? /*add operand to RPN. */\n call show 'moving' ? \"──► RPN\"\n end /*select*/\n end /*k*/\nsay\nRPN=space(RPN $) /*elide any superfluous blanks in RPN. */\nsay ' input:' ox; say \" RPN──►\" RPN /*display the input and the RPN. */\nparse source upper . y . /*invoked via the C.L. or REXX pgm? */\nif y=='COMMAND' then exit /*stick a fork in it, we're all done. */\n else return RPN /*return RPN to invoker (the RESULT). */\n/*──────────────────────────────────────────────────────────────────────────────────────────*/\nisOp: return pos(arg(1),rOp) \\== 0 /*is the first argument a \"real\" operator? */\nshow: if tell then say center(?,5) left(subword(x,k),L) left($,L%2) left(RPN,L) arg(1); return\n","language":"REXX"},{"code":"/*REXX pgm converts infix arith. expressions to Reverse Polish notation (shunting─yard).*/\nparse arg x /*obtain optional argument from the CL.*/\nif x='' then x= '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3' /*Not specified? Then use the default.*/\ng=0 /* G is a counter of ( and ) */\n do p=1 for words(x); _=word(x,p) /*catches unbalanced ( ) and ) ( */\n if _=='(' then g=g+1\n else if _==')' then do; g=g-1; if g<0 then g=-1e8; end\n end /*p*/\nox=x\nx='(' space(x) \") \" /*force stacking for the expression. */\n#=words(x) /*get number of tokens in expression. */\ngood= (g==0) /*indicate expression is good or bad.*/\n do i=1 for #; @.i=word(x, i) /*assign the input tokens to an array. */\n end /*i*/\ntell=1 /*set to 0 if working steps not wanted.*/\nL=max( 20, length(x) ) /*use twenty for the minimum show width*/\nif good then say 'token' center(\"input\" , L, '─') center(\"stack\" , L%2, '─'),\n center(\"output\", L, '─') center(\"action\", L, '─')\nop= \")(-+/*^\"; Rop=substr(op,3); p.=; n=length(op); RPN= /*some handy-dandy vars.*/\ns.=\n do i=1 for n; _=substr(op,i,1); s._=(i+1)%2; p._=s._+(i==n); end /*i*/\n$= /* [↑] assign the operator priorities.*/\n do k=1 for #*good; ?=@.k /*process each token from the @. list.*/\n select /*@.k is: ( operator ) operand.*/\n when ?=='(' then do; $=\"(\" $; call show 'moving' ? \"──► stack\"; end\n when isOp(?) then do; !=word($, 1) /*get token from stack*/\n do while ! \\==')' & s.!>=p.?\n RPN=RPN ! /*add token to RPN.*/\n $=subword($, 2) /*del token from stack*/\n call show 'unstacking:' !\n !=word($, 1) /*get token from stack*/\n end /*while*/\n $=? $ /*add token to stack*/\n call show 'moving' ? \"──► stack\"\n end\n when ?==')' then do; !=word($, 1) /*get token from stack*/\n do while !\\=='('; RPN=RPN ! /*add token to RPN.*/\n $=subword($, 2) /*del token from stack*/\n != word($, 1) /*get token from stack*/\n call show 'moving stack' ! \"──► RPN\"\n end /*while*/\n $=subword($, 2) /*del token from stack*/\n call show 'deleting ( from the stack'\n end\n otherwise RPN=RPN ? /*add operand to RPN.*/\n call show 'moving' ? \"──► RPN\"\n end /*select*/\n end /*k*/\nsay\nRPN=space(RPN $); if \\good then RPN= '─────── error in expression ───────' /*error? */\nsay ' input:' ox; say \" RPN──►\" RPN /*display the input and the RPN. */\nparse source upper . y . /*invoked via the C.L. or REXX pgm? */\nif y=='COMMAND' then exit /*stick a fork in it, we're all done. */\n else return RPN /*return RPN to invoker (the RESULT). */\n/*──────────────────────────────────────────────────────────────────────────────────────────*/\nisOp: return pos(arg(1), Rop) \\== 0 /*is the first argument a \"real\" operator? */\nshow: if tell then say center(?,5) left(subword(x,k),L) left($,L%2) left(RPN,L) arg(1); return\n","language":"REXX"},{"code":"rpn = RPNExpression.from_infix(\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\")\n","language":"Ruby"},{"code":"type Number = f64;\n\n#[derive(Debug, Copy, Clone, PartialEq)]\nstruct Operator {\n token: char,\n operation: fn(Number, Number) -> Number,\n precedence: u8,\n is_left_associative: bool,\n}\n\n#[derive(Debug, Clone, PartialEq)]\nenum Token {\n Digit(Number),\n Operator(Operator),\n LeftParen,\n RightParen,\n}\n\nimpl Operator {\n fn new_token(\n token: char,\n precedence: u8,\n is_left_associative: bool,\n operation: fn(Number, Number) -> Number,\n ) -> Token {\n Token::Operator(Operator {\n token: token,\n operation: operation,\n precedence: precedence,\n is_left_associative,\n })\n }\n\n fn apply(&self, x: Number, y: Number) -> Number {\n (self.operation)(x, y)\n }\n}\n\ntrait Stack<T> {\n fn top(&self) -> Option<T>;\n}\n\nimpl<T: Clone> Stack<T> for Vec<T> {\n fn top(&self) -> Option<T> {\n if self.is_empty() {\n return None;\n }\n self.last().cloned()\n }\n}\nfn lex_token(input: char) -> Result<Token, char> {\n let ret = match input {\n '0'...'9' => Token::Digit(input.to_digit(10).unwrap() as Number),\n '+' => Operator::new_token('+', 1, true, |x, y| x + y),\n '-' => Operator::new_token('-', 1, true, |x, y| x - y),\n '*' => Operator::new_token('*', 2, true, |x, y| x * y),\n '/' => Operator::new_token('/', 2, true, |x, y| x / y),\n '^' => Operator::new_token('^', 3, false, |x, y| x.powf(y)),\n '(' => Token::LeftParen,\n ')' => Token::RightParen,\n _ => return Err(input),\n };\n Ok(ret)\n}\n\nfn lex(input: String) -> Result<Vec<Token>, char> {\n input\n .chars()\n .filter(|c| !c.is_whitespace())\n .map(lex_token)\n .collect()\n}\n\nfn tilt_until(operators: &mut Vec<Token>, output: &mut Vec<Token>, stop: Token) -> bool {\n while let Some(token) = operators.pop() {\n if token == stop {\n return true;\n }\n output.push(token)\n }\n false\n}\n\nfn shunting_yard(tokens: Vec<Token>) -> Result<Vec<Token>, String> {\n let mut output: Vec<Token> = Vec::new();\n let mut operators: Vec<Token> = Vec::new();\n\n for token in tokens {\n match token {\n Token::Digit(_) => output.push(token),\n Token::LeftParen => operators.push(token),\n Token::Operator(operator) => {\n while let Some(top) = operators.top() {\n match top {\n Token::LeftParen => break,\n Token::Operator(top_op) => {\n let p = top_op.precedence;\n let q = operator.precedence;\n if (p > q) || (p == q && operator.is_left_associative) {\n output.push(operators.pop().unwrap());\n } else {\n break;\n }\n }\n _ => unreachable!(\"{:?} must not be on operator stack\", token),\n }\n }\n operators.push(token);\n }\n Token::RightParen => {\n if !tilt_until(&mut operators, &mut output, Token::LeftParen) {\n return Err(String::from(\"Mismatched ')'\"));\n }\n }\n }\n }\n\n if tilt_until(&mut operators, &mut output, Token::LeftParen) {\n return Err(String::from(\"Mismatched '('\"));\n }\n\n assert!(operators.is_empty());\n Ok(output)\n}\n\nfn calculate(postfix_tokens: Vec<Token>) -> Result<Number, String> {\n let mut stack = Vec::new();\n\n for token in postfix_tokens {\n match token {\n Token::Digit(number) => stack.push(number),\n Token::Operator(operator) => {\n if let Some(y) = stack.pop() {\n if let Some(x) = stack.pop() {\n stack.push(operator.apply(x, y));\n continue;\n }\n }\n return Err(format!(\"Missing operand for operator '{}'\", operator.token));\n }\n _ => unreachable!(\"Unexpected token {:?} during calculation\", token),\n }\n }\n\n assert!(stack.len() == 1);\n Ok(stack.pop().unwrap())\n}\n\nfn run(input: String) -> Result<Number, String> {\n let tokens = match lex(input) {\n Ok(tokens) => tokens,\n Err(c) => return Err(format!(\"Invalid character: {}\", c)),\n };\n let postfix_tokens = match shunting_yard(tokens) {\n Ok(tokens) => tokens,\n Err(message) => return Err(message),\n };\n\n calculate(postfix_tokens)\n}\n","language":"Rust"},{"code":"import scala.util.control.Breaks._\n\nobject ShuntingYard {\n\n def main(args: Array[String]): Unit = {\n val infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n println(s\"infix: $infix\")\n println(s\"postfix: ${infixToPostfix(infix)}\")\n }\n\n def infixToPostfix(infix: String): String = {\n val ops = \"-+/*^\"\n val sb = new StringBuilder\n val s = scala.collection.mutable.Stack[Int]()\n\n infix.split(\"\\\\s\").foreach { token =>\n if (token.nonEmpty) {\n val c = token.head\n val idx = ops.indexOf(c)\n\n if (idx != -1) {\n if (s.isEmpty) s.push(idx)\n else {\n breakable({\n while (s.nonEmpty) {\n val prec2 = s.top / 2\n val prec1 = idx / 2\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) sb.append(ops(s.pop)).append(' ')\n else break\n }\n });\n s.push(idx)\n }\n } else if (c == '(') {\n s.push(-2) // -2 stands for '('\n } else if (c == ')') {\n // until '(' on stack, pop operators.\n while (s.top != -2) sb.append(ops(s.pop)).append(' ')\n s.pop()\n } else {\n sb.append(token).append(' ')\n }\n }\n }\n while (s.nonEmpty) sb.append(ops(s.pop)).append(' ')\n sb.toString\n }\n}\n","language":"Scala"},{"code":"var prec = Hash(\n '^' => 4,\n '*' => 3,\n '/' => 3,\n '+' => 2,\n '-' => 2,\n '(' => 1,\n)\n\nvar assoc = Hash(\n '^' => 'right',\n '*' => 'left',\n '/' => 'left',\n '+' => 'left',\n '-' => 'left',\n)\n\nfunc shunting_yard(prog) {\n var inp = prog.words\n var ops = []\n var res = []\n \n func report (op) {\n printf(\"%25s %-7s %10s %s\\n\",\n res.join(' '), ops.join(' '), op, inp.join(' '))\n }\n\n func shift (t) { report( \"shift #{t}\"); ops << t }\n func reduce (t) { report(\"reduce #{t}\"); res << t }\n \n while (inp) {\n given(var t = inp.shift) {\n when (/\\d/) { reduce(t) }\n when ('(') { shift(t) }\n when (')') {\n while (ops) {\n (var x = ops.pop) == '(' ? break : reduce(x)\n }\n }\n default {\n var newprec = prec{t}\n while (ops) {\n var oldprec = prec{ops[-1]}\n \n break if (newprec > oldprec)\n break if ((newprec == oldprec) && (assoc{t} == 'right'))\n \n reduce(ops.pop)\n }\n shift(t)\n }\n }\n }\n while (ops) { reduce(ops.pop) }\n return res\n}\n \nsay shunting_yard('3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3').join(' ')\n","language":"Sidef"},{"code":"structure Operator = struct\n datatype associativity = LEFT | RIGHT\n type operator = { symbol : char, assoc : associativity, precedence : int }\n\n val operators : operator list = [\n { symbol = #\"^\", precedence = 4, assoc = RIGHT },\n { symbol = #\"*\", precedence = 3, assoc = LEFT },\n { symbol = #\"/\", precedence = 3, assoc = LEFT },\n { symbol = #\"+\", precedence = 2, assoc = LEFT },\n { symbol = #\"-\", precedence = 2, assoc = LEFT }\n ]\n\n fun find (c : char) : operator option = List.find (fn ({symbol, ...} : operator) => symbol = c) operators\n\n infix cmp\n fun ({precedence=p1, assoc=a1, ...} : operator) cmp ({precedence=p2, ...} : operator) =\n case a1 of\n LEFT => p1 <= p2\n | RIGHT => p1 < p2\nend\n\nsignature SHUNTING_YARD = sig\n type 'a tree\n type content\n\n val parse : string -> content tree\nend\n\nstructure ShuntingYard : SHUNTING_YARD = struct\n structure O = Operator\n val cmp = O.cmp\n (* did you know infixity doesn't \"carry out\" of a structure unless you open it? TIL *)\n infix cmp\n fun pop2 (b::a::rest) = ((a, b), rest)\n | pop2 _ = raise Fail \"bad input\"\n\n datatype content = Op of char\n | Int of int\n datatype 'a tree = Leaf\n | Node of 'a tree * 'a * 'a tree\n\n fun parse_int' tokens curr = case tokens of\n [] => (List.rev curr, [])\n | t::ts => if Char.isDigit t then parse_int' ts (t::curr)\n else (List.rev curr, t::ts)\n\n fun parse_int tokens = let\n val (int_chars, rest) = parse_int' tokens []\n in\n ((Option.valOf o Int.fromString o String.implode) int_chars, rest)\n end\n\n fun parse (s : string) : content tree = let\n val tokens = String.explode s\n (* parse': tokens operator_stack trees *)\n fun parse' [] [] [result] = result\n | parse' [] (opr::os) trees =\n if opr = #\"(\" orelse opr = #\")\" then raise Fail \"bad input\"\n else let\n val ((a,b), trees') = pop2 trees\n val trees'' = (Node (a, Op opr, b)) :: trees'\n in\n parse' [] os trees''\n end\n | parse' (t::ts) operators trees =\n if Char.isSpace t then parse' ts operators trees else\n if t = #\"(\" then parse' ts (t::operators) (trees : content tree list) else\n if t = #\")\" then let\n (* process_operators : operators trees *)\n fun process_operators [] _ = raise Fail \"bad input\"\n | process_operators (opr::os) trees =\n if opr = #\"(\" then (os, trees)\n else let\n val ((a, b), trees') = pop2 trees\n val trees'' = (Node (a, Op opr, b)) :: trees'\n in\n process_operators os trees''\n end\n val (operators', trees') = process_operators (operators : char list) (trees : content tree list)\n in\n parse' ts operators' trees'\n end else\n (case O.find (t : char) of\n SOME o1 => let\n (* process_operators : operators trees *)\n fun process_operators [] trees = ([], trees)\n | process_operators (o2::os) trees = (case O.find o2 of\n SOME o2 =>\n if o1 cmp o2 then let\n val ((a, b), trees') = pop2 trees\n val trees'' = (Node (a, Op (#symbol o2), b)) :: trees'\n in\n process_operators os trees''\n end\n else ((#symbol o2)::os, trees)\n | NONE => (o2::os, trees))\n val (operators', trees') = process_operators operators trees\n in\n parse' ts ((#symbol o1)::operators') trees'\n end\n | NONE => let\n val (n, tokens') = parse_int (t::ts)\n in\n parse' tokens' operators ((Node (Leaf, Int n, Leaf)) :: trees)\n end)\n | parse' _ _ _ = raise Fail \"bad input\"\n in\n parse' tokens [] []\n end\nend\n","language":"Standard-ML"},{"code":"// Updated to Swift 5.7\nimport Foundation\n\n// Using arrays for both stack and queue\nstruct Stack<T> {\n\tprivate(set) var elements = [T]()\n\t\n\tvar isEmpty: Bool {\n\t\telements.isEmpty\n\t}\n\t\n\tvar top: T? {\n\t\telements.last\n\t}\n\t\n\tmutating func push(_ newElement: T) {\n\t\telements.append(newElement)\n\t}\n\t\n\tmutating func pop() -> T? {\n\t\tself.isEmpty ? nil : elements.removeLast()\n\t}\n}\n\nstruct Queue<T> {\n\tprivate(set) var elements = [T]()\n\t\n\tvar isEmpty: Bool {\n\t\telements.isEmpty\n\t}\n\t\n\tmutating func enqueue(_ newElement: T) {\n\t\telements.append(newElement)\n\t}\n\t\n\tmutating func dequeue() -> T {\n\t\treturn elements.removeFirst()\n\t}\n}\n\nenum Associativity {\n\tcase Left, Right\n}\n\n// Protocol can be used to restrict Set extension\nprotocol OperatorType: Comparable, Hashable {\n\tvar name: String { get }\n\tvar precedence: Int { get }\n\tvar associativity: Associativity { get }\n}\n\nstruct Operator: OperatorType {\n\tlet name: String\n\tlet precedence: Int\n\tlet associativity: Associativity\n\t\n\t// Duplicate operator names are not allowed\n\tfunc hash(into hasher: inout Hasher) {\n\t\thasher.combine(self.name)\n\t}\n\t\n\tinit(_ name: String, _ precedence: Int, _ associativity: Associativity) {\n\t\tself.name = name; self.precedence = precedence; self.associativity = associativity\n\t}\n}\n\nfunc ==(x: Operator, y: Operator) -> Bool {\n\t// Identified by name\n\tx.name == y.name\n}\n\nfunc <(x: Operator, y: Operator) -> Bool {\n\t// Take precedence and associavity into account\n\t(x.associativity == .Left && x.precedence == y.precedence) || x.precedence < y.precedence\n}\n\nextension Set where Element: OperatorType {\n\tfunc contains(_ operatorName: String) -> Bool {\n\t\tcontains { $0.name == operatorName }\n\t}\n\t\n\tsubscript (operatorName: String) -> Element? {\n\t\tget {\n\t\t\tfilter { $0.name == operatorName }.first\n\t\t}\n\t}\n}\n\n// Convenience\nextension String {\n\tvar isNumber: Bool { return Double(self) != nil }\n}\n\nstruct ShuntingYard {\n\tenum ParseError: Error {\n\t\tcase MismatchedParenthesis(parenthesis: String, expression: String)\n\t\tcase UnrecognizedToken(token: String, expression: String)\n\t\tcase ExtraneousToken(token: String, expression: String)\n\t}\n\t\n\tstatic func parse(_ input: String, operators: Set<Operator>) throws -> String {\n\t\tvar stack = Stack<String>()\n\t\tvar output = Queue<String>()\n\t\tlet tokens = input.components(separatedBy: \" \")\n\t\t\n\t\tfor token in tokens {\n\t\t\t// Number?\n\t\t\tif token.isNumber {\n\t\t\t\t// Add it to the output queue\n\t\t\t\toutput.enqueue(token)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t\n\t\t\t// Operator?\n\t\t\tif operators.contains(token) {\n\t\t\t\t// While there is a operator on top of the stack and has lower precedence than current operator (token)\n\t\t\t\twhile let top = stack.top,\n\t\t\t\t\t operators.contains(top) && Self.hasLowerPrecedence(token, top, operators) {\n\t\t\t\t\t// Pop it off to the output queue\n\t\t\t\t\toutput.enqueue(stack.pop()!)\n\t\t\t\t}\n\t\t\t\t// Push current operator (token) onto the operator stack\n\t\t\t\tstack.push(token)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t\n\t\t\t// Left parenthesis?\n\t\t\tif token == \"(\" {\n\t\t\t\t// Push it onto the stack\n\t\t\t\tstack.push(token)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t\n\t\t\t// Right parenthesis?\n\t\t\tif token == \")\" {\n\t\t\t\t// Until the token at the top of the stack is a left parenthesis\n\t\t\t\twhile let top = stack.top, top != \"(\" {\n\t\t\t\t\t// Pop operators off the stack onto the output queue.\n\t\t\t\t\toutput.enqueue(stack.pop()!)\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Pop the left parenthesis from the stack without putting it onto the output queue\n\t\t\t\tguard let _ = stack.pop() else {\n\t\t\t\t\t// If the stack runs out, than there is no matching left parenthesis\n\t\t\t\t\tthrow ParseError.MismatchedParenthesis(parenthesis: \")\", expression: input)\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t\n\t\t\t// Token not recognized!\n\t\t\tthrow ParseError.UnrecognizedToken(token: token, expression: token)\n\t\t}\n\t\t\n\t\t// No more tokens\n\t\t\n\t\t// Still operators on the stack?\n\t\twhile let top = stack.top,\n\t\t\t operators.contains(top) {\n\t\t\t// Put them onto the output queue\n\t\t\toutput.enqueue(stack.pop()!)\n\t\t}\n\t\t\n\t\t// If the top of the stack is a (left) parenthesis, then there is no matching right parenthesis\n\t\t// Note: Assume that all operators has been popped and put onto the output queue\n\t\tif let top = stack.pop() {\n\t\t\tthrow (\n\t\t\t\ttop == \"(\"\n\t\t\t\t? ParseError.MismatchedParenthesis(parenthesis: \"(\", expression: input)\n\t\t\t\t: ParseError.ExtraneousToken(token: top, expression: input)\n\t\t\t)\n\t\t}\n\t\t\n\t\treturn output.elements.joined(separator: \" \")\n\t}\n\t\n\tstatic private func hasLowerPrecedence(_ firstToken: String, _ secondToken: String, _ operators: Set<Operator>) -> Bool {\n\t\tguard let firstOperator = operators[firstToken],\n\t\t\t let secondOperator = operators[secondToken] else {\n\t\t\treturn false\n\t\t}\n\t\t\n\t\treturn firstOperator < secondOperator\n\t}\n}\n\n/* Include in tests\nfunc testParse() throws {\n\tlet input = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n\tlet operators: Set<Operator> = [\n\t\tOperator(\"^\", 4, .Right),\n\t\tOperator(\"*\", 3, .Left),\n\t\tOperator(\"/\", 3, .Left),\n\t\tOperator(\"+\", 2, .Left),\n\t\tOperator(\"-\", 2, .Left)\n\t]\n\tlet output = try! ShuntingYard.parse(input, operators: operators)\n\tXCTAssertEqual(output, \"3 4 2 * 1 5 - 2 3 ^ ^ / +\")\n}\n*/\n","language":"Swift"},{"code":"package require Tcl 8.5\n\n# Helpers\nproc tokenize {str} {\n regexp -all -inline {[\\d.]+|[-*^+/()]} $str\n}\nproc precedence op {\n dict get {^ 4 * 3 / 3 + 2 - 2} $op\n}\nproc associativity op {\n if {$op eq \"^\"} {return \"right\"} else {return \"left\"}\n}\n\nproc shunting {expression} {\n set stack {}\n foreach token [tokenize $expression] {\n\tif {[string is double $token]} {\n\t puts \"add to output: $token\"\n\t lappend output $token\n\t} elseif {$token eq \"(\"} {\n\t puts \"push parenthesis\"\n\t lappend stack $token\n\t} elseif {$token eq \")\"} {\n\t puts \"popping to parenthesis\"\n\t while {[lindex $stack end] ne \"(\"} {\n\t\tlappend output [lindex $stack end]\n\t\tset stack [lreplace $stack end end]\n\t\tputs \"...popped [lindex $output end] to output\"\n\t }\n\t set stack [lreplace $stack end end]\n\t puts \"...found parenthesis\"\n\t} else {\n\t puts \"adding operator: $token\"\n\t set p [precedence $token]\n\t set a [associativity $token]\n\t while {[llength $stack]} {\n\t\tset o2 [lindex $stack end]\n\t\tif {\n\t\t $o2 ne \"(\" &&\n\t\t (($a eq \"left\" && $p <= [precedence $o2]) ||\n\t\t ($a eq \"right\" && $p < [precedence $o2]))\n\t\t} then {\n\t\t puts \"...popped operator $o2 to output\"\n\t\t lappend output $o2\n\t\t set stack [lreplace $stack end end]\n\t\t} else {\n\t\t break\n\t\t}\n\t }\n\t lappend stack $token\n\t}\n\tputs \"\\t\\tOutput:\\t$output\\n\\t\\tStack:\\t$stack\"\n }\n puts \"transferring tokens from stack to output\"\n lappend output {*}[lreverse $stack]\n}\n\nputs [shunting \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"]\n","language":"Tcl"},{"code":"#!/bin/sh\n\ngetopprec() {\n case \"$1\" in\n '+') echo 2;;\n '-') echo 2;;\n '*') echo 3;;\n '/') echo 4;;\n '%') echo 4;;\n '^') echo 4;;\n '(') echo 5;;\n esac\n}\n\ngetopassoc() {\n case \"$1\" in\n '^') echo r;;\n *) echo l;;\n esac\n}\n\nshowstacks() {\n [ -n \"$1\" ] && echo \"Token: $1\" || echo \"End parsing\"\n echo -e \"\\tOutput: `tr $'\\n' ' ' <<< \"$out\"`\"\n echo -e \"\\tOperators: `tr $'\\n' ' ' <<< \"$ops\"`\"\n}\n\ninfix() {\n local out=\"\" ops=\"\"\n\n while [ \"$#\" -gt 0 ]; do\n grep -qE '^[0-9]+$' <<< \"$1\"\n if [ \"$?\" -eq 0 ]; then\n out=\"`sed -e '$a'\"$1\" -e '/^$/d' <<< \"$out\"`\"\n\n showstacks \"$1\"\n shift && continue\n fi\n\n grep -q '^[-+*/^%]$' <<< \"$1\"\n if [ \"$?\" -eq 0 ]; then\n if [ -n \"$ops\" ]; then\n thispred=`getopprec \"$1\"`\n thisassoc=`getopassoc \"$1\"`\n topop=\"`sed -n '$p' <<< \"$ops\"`\"\n thatpred=`getopprec \"$topop\"`\n thatassoc=`getopassoc \"$topop\"`\n while [ $thatpred -gt $thispred ] 2> /dev/null || ( [ \\\n $thatpred -eq $thispred ] 2> /dev/null && [ $thisassoc = \\\n 'l' ] 2> /dev/null ); do # To /dev/null 'cus u r fake news\n\n [ \"$topop\" = '(' ] && break\n\n op=\"`sed -n '$p' <<< \"$ops\"`\"\n out=\"`sed -e '$a'\"$op\" -e '/^$/d' <<< \"$out\"`\"\n ops=\"`sed '$d' <<< \"$ops\"`\"\n\n topop=\"`sed -n '$p' <<< \"$ops\"`\"\n thatpred=`getopprec \"$topop\"`\n thatassoc=`getopassoc \"$topop\"`\n done\n fi\n ops=\"`sed -e '$a'\"$1\" -e '/^$/d' <<< \"$ops\"`\"\n\n showstacks \"$1\"\n shift && continue\n fi\n\n if [ \"$1\" = '(' ]; then\n ops=\"`sed -e '$a'\"$1\" -e '/^$/d' <<< \"$ops\"`\"\n\n showstacks \"$1\"\n shift && continue\n fi\n\n if [ \"$1\" = ')' ]; then\n grep -q '^($' <<< \"`sed -n '$p' <<< \"$ops\"`\"\n while [ \"$?\" -ne 0 ]; do\n op=\"`sed -n '$p' <<< \"$ops\"`\"\n out=\"`sed -e '$a'\"$op\" -e '/^$/d' <<< \"$out\"`\"\n ops=\"`sed '$d' <<< \"$ops\"`\"\n\n grep -q '^($' <<< \"`sed '$p' <<< \"$ops\"`\"\n done\n ops=\"`sed '$d' <<< \"$ops\"`\"\n\n showstacks \"$1\"\n shift && continue\n fi\n\n shift\n done\n\n while [ -n \"$ops\" ]; do\n op=\"`sed -n '$p' <<< \"$ops\"`\"\n out=\"`sed -e '$a'\"$op\" -e '/^$/d' <<< \"$out\"`\"\n ops=\"`sed '$d' <<< \"$ops\"`\"\n done\n\n showstacks \"$1\"\n}\n\ninfix 3 + 4 \\* 2 / \\( 1 - 5 \\) ^ 2 ^ 3\n","language":"UNIX-Shell"},{"code":"Token: 3\n\tOutput: 3\n\tOperators:\nToken: +\n\tOutput: 3\n\tOperators: +\nToken: 4\n\tOutput: 3 4\n\tOperators: +\nToken: *\n\tOutput: 3 4\n\tOperators: + *\nToken: 2\n\tOutput: 3 4 2\n\tOperators: + *\nToken: /\n\tOutput: 3 4 2\n\tOperators: + * /\nToken: (\n\tOutput: 3 4 2\n\tOperators: + * / (\nToken: 1\n\tOutput: 3 4 2 1\n\tOperators: + * / (\nToken: -\n\tOutput: 3 4 2 1\n\tOperators: + * / ( -\nToken: 5\n\tOutput: 3 4 2 1 5\n\tOperators: + * / ( -\nToken: )\n\tOutput: 3 4 2 1 5 -\n\tOperators: + * /\nToken: ^\n\tOutput: 3 4 2 1 5 -\n\tOperators: + * / ^\nToken: 2\n\tOutput: 3 4 2 1 5 - 2\n\tOperators: + * / ^\nToken: ^\n\tOutput: 3 4 2 1 5 - 2\n\tOperators: + * / ^ ^\nToken: 3\n\tOutput: 3 4 2 1 5 - 2 3\n\tOperators: + * / ^ ^\nEnd parsing\n\tOutput: 3 4 2 1 5 - 2 3 ^ ^ / * +\n\tOperators:\n","language":"UNIX-Shell"},{"code":"Option Explicit\nOption Base 1\n\nFunction ShuntingYard(strInfix As String) As String\nDim i As Long, j As Long, token As String, tokenArray() As String\nDim stack() As Variant, queue() As Variant, discard As String\nDim op1 As String, op2 As String\n\nDebug.Print strInfix\n\n' Get tokens\ntokenArray = Split(strInfix)\n\n' Initialize array (removed later)\nReDim stack(1)\nReDim queue(1)\n\n' Loop over tokens\nDo While 1\n i = i + 1\n If i - 1 > UBound(tokenArray) Then\n Exit Do\n Else\n token = tokenArray(i - 1) 'i-1 due to Split returning a Base 0\n End If\n If token = \"\" Then: Exit Do\n\n ' Print\n Debug.Print i, token, Join(stack, \",\"), Join(queue, \",\")\n ' If-loop over tokens (either brackets, operators, or numbers)\n If token = \"(\" Then\n stack = push(token, stack)\n ElseIf token = \")\" Then\n While Peek(stack) <> \"(\"\n queue = push(pop(stack), queue)\n Wend\n discard = pop(stack) 'discard \"(\"\n ElseIf isOperator(token) Then\n op1 = token\n Do While (isOperator(Peek(stack)))\n' Debug.Print Peek(stack)\n op2 = Peek(stack)\n If op2 <> \"^\" And precedence(op1) = precedence(op2) Then\n '\"^\" is the only right-associative operator\n queue = push(pop(stack), queue)\n ElseIf precedence(op1$) < precedence(op2$) Then\n queue = push(pop(stack), queue)\n Else\n Exit Do\n End If\n Loop\n stack = push(op1, stack)\n Else 'number\n 'actually, wrong operator could end up here, like say %\n 'If the token is a number, then add it to the output queue.\n queue = push(CStr(token), queue)\n End If\nLoop\n\nWhile stack(1) <> \"\"\n If Peek(stack) = \"(\" Then Debug.Print \"no matching ')'\": End\n queue = push(pop(stack), queue)\nWend\n\n' Print final output\nShuntingYard = Join(queue, \" \")\nDebug.Print \"Output:\"\nDebug.Print ShuntingYard\nEnd Function\n\n'------------------------------------------\nFunction isOperator(op As String) As Boolean\n isOperator = InStr(\"+-*/^\", op) <> 0 And Len(op$) = 1\nEnd Function\n\nFunction precedence(op As String) As Integer\n If isOperator(op$) Then\n precedence = 1 _\n - (InStr(\"+-*/^\", op$) <> 0) _\n - (InStr(\"*/^\", op$) <> 0) _\n - (InStr(\"^\", op$) <> 0)\n End If\nEnd Function\n\n'------------------------------------------\nFunction push(str, stack) As Variant\nDim out() As Variant, i As Long\nIf Not IsEmpty(stack(1)) Then\n out = stack\n ReDim Preserve out(1 To UBound(stack) + 1)\n out(UBound(out)) = str\nElse\n ReDim out(1 To 1)\n out(1) = str\nEnd If\npush = out\nEnd Function\n\nFunction pop(stack)\npop = stack(UBound(stack))\nIf UBound(stack) > 1 Then\n ReDim Preserve stack(1 To UBound(stack) - 1)\nElse\n stack(1) = \"\"\nEnd If\nEnd Function\n\nFunction Peek(stack)\n Peek = stack(UBound(stack))\nEnd Function\n","language":"VBA"},{"code":"Module Module1\n Class SymbolType\n Public ReadOnly symbol As String\n Public ReadOnly precedence As Integer\n Public ReadOnly rightAssociative As Boolean\n\n Public Sub New(symbol As String, precedence As Integer, rightAssociative As Boolean)\n Me.symbol = symbol\n Me.precedence = precedence\n Me.rightAssociative = rightAssociative\n End Sub\n End Class\n\n ReadOnly Operators As Dictionary(Of String, SymbolType) = New Dictionary(Of String, SymbolType) From\n {\n {\"^\", New SymbolType(\"^\", 4, True)},\n {\"*\", New SymbolType(\"*\", 3, False)},\n {\"/\", New SymbolType(\"/\", 3, False)},\n {\"+\", New SymbolType(\"+\", 2, False)},\n {\"-\", New SymbolType(\"-\", 2, False)}\n }\n\n Function ToPostfix(infix As String) As String\n Dim tokens = infix.Split(\" \")\n Dim stack As New Stack(Of String)\n Dim output As New List(Of String)\n\n Dim Print = Sub(action As String) Console.WriteLine(\"{0,-4} {1,-18} {2}\", action + \":\", $\"stack[ {String.Join(\" \", stack.Reverse())} ]\", $\"out[ {String.Join(\" \", output)} ]\")\n\n For Each token In tokens\n Dim iv As Integer\n Dim op1 As SymbolType\n Dim op2 As SymbolType\n If Integer.TryParse(token, iv) Then\n output.Add(token)\n Print(token)\n ElseIf Operators.TryGetValue(token, op1) Then\n While stack.Count > 0 AndAlso Operators.TryGetValue(stack.Peek(), op2)\n Dim c = op1.precedence.CompareTo(op2.precedence)\n If c < 0 OrElse Not op1.rightAssociative AndAlso c <= 0 Then\n output.Add(stack.Pop())\n Else\n Exit While\n End If\n End While\n stack.Push(token)\n Print(token)\n ElseIf token = \"(\" Then\n stack.Push(token)\n Print(token)\n ElseIf token = \")\" Then\n Dim top = \"\"\n While stack.Count > 0\n top = stack.Pop()\n If top <> \"(\" Then\n output.Add(top)\n Else\n Exit While\n End If\n End While\n If top <> \"(\" Then\n Throw New ArgumentException(\"No matching left parenthesis.\")\n End If\n Print(token)\n End If\n Next\n While stack.Count > 0\n Dim top = stack.Pop()\n If Not Operators.ContainsKey(top) Then\n Throw New ArgumentException(\"No matching right parenthesis.\")\n End If\n output.Add(top)\n End While\n Print(\"pop\")\n Return String.Join(\" \", output)\n End Function\n\n Sub Main()\n Dim infix = \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\"\n Console.WriteLine(ToPostfix(infix))\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./seq\" for Stack\nimport \"./pattern\" for Pattern\n\n/* To find out the precedence, we take the index of the\n token in the OPS string and divide by 2 (rounding down).\n This will give us: 0, 0, 1, 1, 2 */\nvar ops = \"-+/*^\"\n\nvar infixToPostfix = Fn.new { |infix|\n var sb = \"\"\n var s = Stack.new()\n var p = Pattern.new(\"+1/s\")\n for (token in p.splitAll(infix)) {\n var c = token[0]\n var idx = ops.indexOf(c)\n\n // check for operator\n if (idx != - 1) {\n if (s.isEmpty) {\n s.push(idx)\n } else {\n while (!s.isEmpty) {\n var prec2 = (s.peek()/2).floor\n var prec1 = (idx/2).floor\n if (prec2 > prec1 || (prec2 == prec1 && c != \"^\")) {\n sb = sb + ops[s.pop()] + \" \"\n } else break\n }\n s.push(idx)\n }\n } else if (c == \"(\") {\n s.push(-2) // -2 stands for \"(\"\n } else if (c == \")\") {\n // until \"(\" on stack, pop operators.\n while (s.peek() != -2) sb = sb + ops[s.pop()] + \" \"\n s.pop()\n } else {\n sb = sb + token + \" \"\n }\n }\n while (!s.isEmpty) sb = sb + ops[s.pop()] + \" \"\n return sb\n}\n\nvar es = [\n \"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\",\n \"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\"\n]\nfor (e in es) {\n System.print(\"Infix : %(e)\")\n System.print(\"Postfix : %(infixToPostfix.call(e))\\n\")\n}\n","language":"Wren"},{"code":"Function ShuntingYard(strInfix As String) As String\n\n\n Dim i as Integer\n Dim token, tokenArray() As String\n Dim stack(), queue() As Variant\n Dim discard As String\n Dim op1, op2 As String\n\n Dim Left_Brackets, Right_Brackets As Integer\n\n Dim output As String\n Dim dbl_output As Double\n\n\n Left_Brackets = CountFields(strInfix, \"(\")\n Right_Brackets = CountFields(strInfix, \")\")\n\n If Left_Brackets = Right_Brackets Then\n\n\n\n 'Get tokens\n tokenArray = Split(strInfix,\" \")\n\n\n\n 'Initialize array (removed later)\n ReDim stack(1)\n ReDim queue(1)\n\n 'Loop over tokens\n For i = 0 to tokenArray.Ubound\n\n\n 'i = i + 1\n If i > UBound(tokenArray) Then\n Exit For\n Else\n token = tokenArray(i ) 'i-1 due to Split returning a Base 0\n End If\n If token = \"\" Then\n Exit For\n End If\n\n\n\n\n\n\n Dim stackString As String\n Dim queuString As String\n\n for m as Integer = 0 to stack.Ubound\n stackString = stackString + \" \" + stack(m)\n Next\n\n for m as Integer = 0 to queue.Ubound\n queuString = queuString + \" \" + queue(m)\n Next\n\n MsgBox(Str(i) + \" \" + token + \" \" + stackString + \" \" + queuString)\n\n 'Window1.txtQueu.Text = Window1.txtQueu.Text + Str(i) + \" \" + token + \" \" + stackString + \" \" + queuString + EndOfLIne\n\n\n\n\n ' If-loop over tokens (either brackets, operators, or numbers)\n If token = \"(\" Then\n stack.Append(token)\n\n ElseIf token = \")\" Then\n While stack(stack.Ubound) <> \"(\"\n queue.Append(stack.pop)\n Wend\n\n discard = stack.Pop 'discard \"(\"\n ElseIf isOperator(token) Then\n op1 = token\n\n\n //Do While (isOperator(Peek(stack)))\n While isOperator( stack(stack.Ubound) ) = True\n op2 = stack(stack.Ubound)\n If op2 <> \"^\" And precedence(op1) = precedence(op2) Then\n '\"^\" is the only right-associative operator\n\n queue.Append(stack.pop)\n\n ElseIf precedence(op1) < precedence(op2) Then\n queue.Append(stack.Pop)\n Else\n Exit While\n End If\n Wend\n //Loop\n\n\n stack.Append(op1)\n Else 'number\n 'actually, wrong operator could end up here, like say %\n 'If the token is a number, then add it to the output queue.\n queue.Append(CStr(token))\n End If\n\n\n\n\n Next\n\n\n\n for i = 0 to queue.Ubound\n output = output +queue(i) + \" \"\n next\n\n for i = stack.Ubound DownTo 0\n output = output + stack(i)+\" \"\n next\n\n\n\n While InStr(output, \" \") <> 0\n output = ReplaceAll(output,\" \",\" \")\n Wend\n\n\n output = Trim(output)\n\n\n Return output\n\n Else\n\n MsgBox(\"Syntax Error!\" + EndOfLine + \"Count left brackets: \" + Str(Left_Brackets) + EndOfLine +\"Count right brackets: \" + Str(Right_Brackets))\n\n End If\n\nEnd Function\n\n\nFunction isOperator(op As String) As Boolean\n\n If InStr(\"+-*/^\", op) <> 0 and Len(op) = 1 Then\n Return True\n End If\n\nEnd Function\n\n\nFunction precedence(op As String) As Integer\n\n If isOperator(op) = True Then\n\n\n\n If op = \"+\" or op = \"-\" Then\n Return 2\n ElseIf op = \"/\" or op = \"*\" Then\n Return 3\n ElseIf op = \"^\" Then\n Return 4\n End If\n\n\n End If\n\n\nEnd Function\n","language":"Xojo"},{"code":"int Stack(10);\nint SP; \\stack pointer\n\nproc Push(N);\nint N;\n[Stack(SP):= N; SP:= SP+1];\n\nfunc Pop;\n[SP:= SP-1; return Stack(SP)];\n\nfunc Precedence(Op);\nint Op;\ncase Op of\n ^+, ^-: return 2;\n ^*, ^/: return 3;\n ^^: return 4\nother [];\n\nproc ShowStack;\nint I;\n[ChOut(0, 9\\tab\\);\nfor I:= 0 to SP-1 do\n [ChOut(0, Stack(I)); ChOut(0, ^ )];\nCrLf(0);\n];\n\nchar Str;\nint Token, Op1, Op2;\n[Str:= \"3 + 4 * 2 / ( 1 - 5 ) ^^ 2 ^^ 3 \";\nSP:= 0;\nText(0, \"Input Output Stack^m^j\");\nloop [repeat Token:= Str(0); Str:= Str+1;\n until Token # ^ ; \\skip space characters\n if Token # $A0 \\terminating space\\ then\n [ChOut(0, Token); ChOut(0, 9\\tab\\)];\n case Token of\n ^+, ^-, ^*, ^/, ^^:\n [Op1:= Token;\n loop [if SP <= 0 then quit; \\empty\n Op2:= Stack(SP-1);\n if Op2 = ^( then quit;\n if Precedence(Op2) < Precedence(Op1) then quit;\n if Precedence(Op2) = Precedence(Op1) then\n if Op1 = ^^ then quit;\n ChOut(0, Pop);\n ];\n Push(Op1);\n ];\n ^(: Push(Token);\n ^): [while SP > 0 and Stack(SP-1) # ^( do\n ChOut(0, Pop);\n Pop; \\discard left parenthesis\n ];\n $A0: quit \\terminating space with MSB set\n other ChOut(0, Token); \\print single digit number\n ShowStack;\n ];\nwhile SP > 0 do \\print any remaining operators\n [ChOut(0, 9\\tab\\);\n ChOut(0, Pop);\n ShowStack;\n ];\n]\n","language":"XPL0"},{"code":"var input=\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\";\n\nvar opa=Dictionary(\"^\",T(4,True), \"*\",T(3,False), // op:(prec,rAssoc)\n\t \"/\",T(3,False), \"+\",T(2,False), \"-\",T(2,False),\n);\n\n\"infix: \".println(input);\n\"postfix:\".println(parseInfix(input));\n\nfcn parseInfix(e){\n stack:=List(); // holds operators and left parenthesis\n rpn:=\"\";\n foreach tok in (e.split(\" \")){\n switch(tok){\n case(\"(\"){ stack.append(tok) } // push \"(\" to stack\n\t case(\")\"){\n while(True){ // pop item (\"(\" or operator) from stack\n op:=stack.pop();\n\t if(op==\"(\") break; // discard \"(\"\n\t rpn+=\" \" + op; // add operator to result\n\t }\n\t }\n else{ // default\n\t o1:=opa.find(tok); // op or Void\n\t if(o1){ // token is an operator\n\t while(stack){\n // consider top item on stack\n\t\t op:=stack[-1]; o2:=opa.find(op);\n\t\t if(not o2 or o1[0]>o2[0] or\n (o1[0]==o2[0] and o1[1])) break;\n\t\t // top item is an operator that needs to come off\n\t\t stack.pop();\n\t\t rpn+=\" \" + op; // add it to result\n\t }\n\t // push operator (the new one) to stack\n\t stack.append(tok);\n\t }else // token is an operand\n\t rpn+=(rpn and \" \" or \"\") + tok; // add operand to result\n\t }\n } // switch\n display(tok,rpn,stack);\n } // foreach\n // drain stack to result\n rpn + stack.reverse().concat(\" \");\n}\nfcn display(tok,rpn,stack){\n \"Token|\".println(tok);\n \"Stack|\".println(stack.concat());\n \"Queue|\".println(rpn);\n println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Parsing/Shunting-yard_algorithm\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nGiven the operator characteristics and input from the [[wp:Shunting-yard_algorithm|Shunting-yard algorithm]] page and tables, use the algorithm to show the changes in the operator stack and RPN output\\nas each individual token is processed.\\n\\n* Assume an input of a correct, space separated, string of tokens representing an infix expression\\n* Generate a space separated output string representing the RPN\\n* Test with the input string:\\n:::: <big><big><code> 3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 </code></big></big> \\n* print and display the output here.\\n* Operator precedence is given in this table:\\n:{| class=\\\"wikitable\\\"\\n\\n! operator !! [[wp:Order_of_operations|precedence]] !! [[wp:Operator_associativity|associativity]] !! operation\\n|- || align=\\\"center\\\"\\n| <big><big> ^ </big></big> || 4 || right || exponentiation \\n|- || align=\\\"center\\\" \\n| <big><big> * </big></big> || 3 || left || multiplication\\n|- || align=\\\"center\\\" \\n| <big><big> / </big></big> || 3 || left || division\\n|- || align=\\\"center\\\" \\n| <big><big> + </big></big> || 2 || left || addition\\n|- || align=\\\"center\\\"\\n| <big><big> - </big></big> || 2 || left || subtraction\\n|}\\n\\n<br>\\n;Extra credit\\nAdd extra text explaining the actions and an optional comment for the action on receipt of each token.\\n\\n\\n;Note\\nThe handling of functions and arguments is not required.\\n\\n\\n;See also:\\n* [[Parsing/RPN calculator algorithm]] for a method of calculating a final value from this output RPN expression.\\n* [[Parsing/RPN to infix conversion]].\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F infix_to_postfix(infix)\\n -V ops = ‘-+/*^’\\n V sb = ‘’\\n [Int] s\\n\\n L(token) infix.split(re:‘\\\\s’)\\n I token.empty\\n L.continue\\n\\n V c = token[0]\\n V? idx = ops.find(c)\\n I idx != N\\n I s.empty\\n s.append(idx)\\n E\\n L !s.empty\\n V prec2 = s.last I/ 2\\n V prec1 = idx I/ 2\\n I prec2 > prec1 | (prec2 == prec1 & c != ‘^’)\\n sb ‘’= ops[s.pop()]‘ ’\\n E\\n L.break\\n s.append(idx)\\n\\n E I c == ‘(’\\n s.append(-2)\\n\\n E I c == ‘)’\\n L s.last != -2\\n sb ‘’= ops[s.pop()]‘ ’\\n s.pop()\\n\\n E\\n sb ‘’= token‘ ’\\n\\n L !s.empty\\n sb ‘’= ops[s.pop()]‘ ’\\n\\n R sb\\n\\nV infix = ‘3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3’\\nprint(‘infix: ’infix)\\nprint(‘postfix: ’infix_to_postfix(infix))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"\\\\ Convert infix expression to postfix, using 'shunting-yard' algorithm\\n\\\\ https://en.wikipedia.org/wiki/Shunting-yard_algorithm\\n\\n\\n\\\\ precedence of infix tokens. negative means 'right-associative', otherwise left:\\nwith: n\\n{\\n \\\"+\\\" : 2,\\n \\\"-\\\" : 2,\\n \\\"/\\\" : 3,\\n \\\"*\\\" : 3,\\n \\\"^\\\" : -4,\\n \\\"(\\\" : 1,\\n \\\")\\\" : -1\\n} var, tokens\\n\\n: precedence \\\\ s -- s n\\n tokens @ over m:@ nip\\n null? if drop 0 then ;\\n\\nvar ops\\nvar out\\n\\n: >out \\\\ x --\\n out @ swap\\n a:push drop ;\\n\\n: >ops \\\\ op prec --\\n 2 a:close\\n ops @ swap\\n a:push drop ;\\n\\n: a:peek -1 a:@ ;\\n\\n\\\\ Check the array for items with greater or equal precedence,\\n\\\\ and move them to the out queue:\\n: pop-ops \\\\ op prec ops -- op prec ops\\n \\\\ empty array, do nothing:\\n a:len not if ;; then\\n\\n \\\\ Look at top of ops stack:\\n a:peek a:open \\\\ op p ops[] op2 p2\\n\\n \\\\ if the 'p2' is not less p (meaning item on top of stack is greater or equal\\n \\\\ in precedence), then pop the item from the ops stack and push onto the out:\\n 3 pick \\\\ p2 p\\n < not if\\n \\\\ op p ops[] op2\\n >out a:pop drop recurse ;;\\n then\\n drop ;\\n\\n\\n: right-paren\\n \\\"RIGHTPAREN\\\" . cr\\n 2drop\\n \\\\ move non-left-paren from ops and move to out:\\n ops @\\n repeat\\n a:len not if\\n break\\n else\\n a:pop a:open\\n 1 = if\\n 2drop ;;\\n else\\n >out\\n then\\n then\\n again drop ;\\n\\n: .state \\\\ n --\\ndrop \\\\ \\\"Token: %s\\\\n\\\" s:strfmt .\\n \\\"Out: \\\" .\\n out @ ( . space drop ) a:each drop cr\\n \\\"ops: \\\" . ops @ ( 0 a:@ . space 2drop ) a:each drop cr cr ;\\n\\n: handle-number \\\\ s n --\\n \\\"NUMBER \\\" . over . cr\\n drop >out ;\\n\\n: left-paren \\\\ s n --\\n \\\"LEFTPAREN\\\" . cr\\n >ops ;\\n\\n: handle-op \\\\ s n --\\n \\\"OPERATOR \\\" . over . cr\\n \\\\ op precedence\\n \\\\ Is the current op left-associative?\\n dup sgn 1 = if\\n \\\\ it is, so check the ops array for items with greater or equal precedence,\\n \\\\ and move them to the out queue:\\n ops @ pop-ops drop\\n then\\n \\\\ push the operator\\n >ops ;\\n\\n: handle-token \\\\ s --\\n precedence dup not if\\n \\\\ it's a number:\\n handle-number\\n else\\n dup 1 = if left-paren\\n else dup -1 = if right-paren\\n else handle-op\\n then then\\n then ;\\n\\n: infix>postfix \\\\ s -- s\\n /\\\\s+/ s:/ \\\\ split to indiviual whitespace-delimited tokens\\n\\n \\\\ Initialize our data structures\\n a:new ops ! a:new out !\\n\\n (\\n nip dup >r\\n handle-token\\n r> .state\\n ) a:each drop\\n \\\\ remove all remaining ops and put on output:\\n out @\\n ops @ a:rev\\n ( nip a:open drop a:push ) a:each drop\\n \\\\ final string:\\n \\\" \\\" a:join ;\\n\\n\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\" infix>postfix . cr\\n\\n\\\"Expected: \\\\n\\\" . \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\" . cr\\nbye\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"BEGIN\\n # parses s and returns an RPN expression using Dijkstra's \\\"Shunting Yard\\\" algorithm #\\n # s is expected to contain a valid infix expression containing single-digit numbers and single-character operators #\\n PROC parse = ( STRING s )STRING:\\n BEGIN\\n # add to the output #\\n PROC output element = ( CHAR c )VOID:\\n BEGIN\\n output[ output pos +:= 1 ] := c;\\n output pos +:= 1\\n END # output element # ;\\n PROC stack op = ( CHAR c )VOID: stack[ stack pos +:= 1 ] := c;\\n # unstacks and returns the top operator on the stack - stops the program if the stack is empty #\\n PROC unstack = CHAR:\\n IF stack pos < 1 THEN\\n # empty stack #\\n print( ( \\\"Stack underflow\\\", newline ) );\\n stop\\n ELSE\\n # still something on the stack to unstack #\\n CHAR result = stack[ stack pos ];\\n stack[ stack pos ] := \\\" \\\";\\n stack pos -:= 1;\\n result\\n FI # unstack # ;\\n # returns the priority of the operator o - which must be one of \\\"(\\\", \\\"^\\\", \\\"*\\\", \\\"/\\\", \\\"+\\\" or \\\"-\\\" #\\n PROC priority of = ( CHAR o )INT: IF o = \\\"(\\\" THEN -1 ELIF o = \\\"^\\\" THEN 4 ELIF o = \\\"*\\\" OR o = \\\"/\\\" THEN 3 ELSE 2 FI;\\n # returns TRUE if o is a right-associative operator, FALSE otherwise #\\n PROC right = ( CHAR c )BOOL: c = \\\"^\\\";\\n PROC lower or equal priority = ( CHAR c )BOOL:\\n IF stack pos < 1 THEN FALSE # empty stack #\\n ELSE priority of( c ) <= priority of( stack[ stack pos ] )\\n FI # lower or equal priority # ;\\n PROC lower priority = ( CHAR c )BOOL:\\n IF stack pos < 1 THEN FALSE # empty stack #\\n ELSE priority of( c ) < priority of( stack[ stack pos ] )\\n FI # lower priority # ;\\n # max stack size and output size #\\n INT max stack = 32;\\n # stack and output queue #\\n [ 1 : max stack ]CHAR stack;\\n [ 1 : max stack ]CHAR output;\\n FOR c pos TO max stack DO stack[ c pos ] := output[ c pos ] := \\\" \\\" OD;\\n # stack pointer and output queue pointer #\\n INT stack pos := 0;\\n INT output pos := 0;\\n print( ( \\\"Parsing: \\\", s, newline ) );\\n print( ( \\\"token output stack\\\", newline ) );\\n FOR s pos FROM LWB s TO UPB s DO\\n CHAR c = s[ s pos ];\\n IF c /= \\\" \\\" THEN\\n IF c >= \\\"0\\\" AND c <= \\\"9\\\" THEN output element( c )\\n ELIF c = \\\"(\\\" THEN stack op( c )\\n ELIF c = \\\")\\\" THEN\\n # close bracket - unstack to the matching \\\"(\\\" and unstack the \\\"(\\\" #\\n WHILE CHAR op char = unstack;\\n op char /= \\\"(\\\"\\n DO\\n output element( op char )\\n OD\\n ELIF right( c ) THEN\\n # right associative operator #\\n WHILE lower priority( c ) DO output element( unstack ) OD;\\n stack op( c )\\n ELSE\\n # must be left associative #\\n WHILE lower or equal priority( c ) DO output element( unstack ) OD;\\n stack op( c )\\n FI;\\n print( ( c, \\\" \\\", output, \\\" \\\", stack, newline ) )\\n FI\\n OD;\\n WHILE stack pos >= 1 DO output element( unstack ) OD;\\n output[ 1 : output pos ]\\n END # parse # ;\\n\\n print( ( \\\"result: \\\", parse( \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\" ), newline ) )\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"SetBatchLines -1\\n#NoEnv\\n\\nexpr := \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n\\noutput := \\\"Testing string '\\\" expr \\\"'`r`n`r`nToken`tOutput Queue\\\"\\n . Space(StrLen(expr)-StrLen(\\\"Output Queue\\\")+2) \\\"OP Stack\\\"\\n\\n; define a stack with semantic .push() and .pop() funcs\\nstack := {push: func(\\\"ObjInsert\\\"), pop: func(\\\"ObjRemove\\\"), peek: func(\\\"Peek\\\")}\\n\\nLoop Parse, expr, %A_Space%\\n{\\n token := A_LoopField\\n if token is number\\n Q .= token A_Space\\n if isOp(token){\\n o1 := token\\n while isOp(o2 := stack.peek())\\n and ((isLeft(o1) and Precedence(o1) <= Precedence(o2))\\n or (isRight(o1) and Precedence(o1) < Precedence(o2)))\\n Q .= stack.pop() A_Space\\n stack.push(o1)\\n }\\n If ( token = \\\"(\\\" )\\n stack.push(token)\\n If ( token = \\\")\\\" )\\n {\\n While ((t := stack.pop()) != \\\"(\\\") && (t != \\\"\\\")\\n Q .= t A_Space\\n if (t = \\\"\\\")\\n throw Exception(\\\"Unmatched parenthesis. \\\"\\n . \\\"Character number \\\" A_Index)\\n }\\n output .= \\\"`r`n\\\" token Space(7) Q Space(StrLen(expr)+2-StrLen(Q))\\n . Disp(stack)\\n}\\noutput .= \\\"`r`n(empty stack to output)\\\"\\nWhile (t := stack.pop()) != \\\"\\\"\\n if InStr(\\\"()\\\", t)\\n throw Exception(\\\"Unmatched parenthesis.\\\")\\n else Q .= t A_Space, output .= \\\"`r`n\\\" Space(8) Q\\n . Space(StrLen(expr)+2-StrLen(Q)) Disp(stack)\\noutput .= \\\"`r`n`r`nFinal string: '\\\" Q \\\"'\\\"\\nclipboard := output\\n\\nisOp(t){\\n return (!!InStr(\\\"+-*/^\\\", t) && t)\\n}\\nPeek(this){\\n r := this.Remove(), this.Insert(r)\\n return r\\n}\\nIsLeft(o){\\n return !!InStr(\\\"*/+-\\\", o)\\n}\\nIsRight(o){\\n return o = \\\"^\\\"\\n}\\nPrecedence(o){\\n return (InStr(\\\"+-/*^\\\", o)+3)//2\\n}\\nDisp(obj){\\n for each, val in obj\\n o := val . o\\n return o\\n}\\nSpace(n){\\n return n>0 ? A_Space Space(n-1) : \\\"\\\"\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include <sys/types.h>\\n#include <regex.h>\\n#include <stdio.h>\\n\\ntypedef struct {\\n\\tconst char *s;\\n\\tint len, prec, assoc;\\n} str_tok_t;\\n\\ntypedef struct {\\n\\tconst char * str;\\n\\tint assoc, prec;\\n\\tregex_t re;\\n} pat_t;\\n\\nenum assoc { A_NONE, A_L, A_R };\\npat_t pat_eos = {\\\"\\\", A_NONE, 0};\\n\\npat_t pat_ops[] = {\\n\\t{\\\"^\\\\\\\\)\\\",\\tA_NONE, -1},\\n\\t{\\\"^\\\\\\\\*\\\\\\\\*\\\",\\tA_R, 3},\\n\\t{\\\"^\\\\\\\\^\\\",\\tA_R, 3},\\n\\t{\\\"^\\\\\\\\*\\\",\\tA_L, 2},\\n\\t{\\\"^/\\\",\\t\\tA_L, 2},\\n\\t{\\\"^\\\\\\\\+\\\",\\tA_L, 1},\\n\\t{\\\"^-\\\",\\t\\tA_L, 1},\\n\\t{0}\\n};\\n\\npat_t pat_arg[] = {\\n\\t{\\\"^[-+]?[0-9]*\\\\\\\\.?[0-9]+([eE][-+]?[0-9]+)?\\\"},\\n\\t{\\\"^[a-zA-Z_][a-zA-Z_0-9]*\\\"},\\n\\t{\\\"^\\\\\\\\(\\\", A_L, -1},\\n\\t{0}\\n};\\n\\nstr_tok_t stack[256]; /* assume these are big enough */\\nstr_tok_t queue[256];\\nint l_queue, l_stack;\\n#define qpush(x) queue[l_queue++] = x\\n#define spush(x) stack[l_stack++] = x\\n#define spop() stack[--l_stack]\\n\\nvoid display(const char *s)\\n{\\n\\tint i;\\n\\tprintf(\\\"\\\\033[1;1H\\\\033[JText | %s\\\", s);\\n\\tprintf(\\\"\\\\nStack| \\\");\\n\\tfor (i = 0; i < l_stack; i++)\\n\\t\\tprintf(\\\"%.*s \\\", stack[i].len, stack[i].s); // uses C99 format strings\\n\\tprintf(\\\"\\\\nQueue| \\\");\\n\\tfor (i = 0; i < l_queue; i++)\\n\\t\\tprintf(\\\"%.*s \\\", queue[i].len, queue[i].s);\\n\\tputs(\\\"\\\\n\\\\n<press enter>\\\");\\n\\tgetchar();\\n}\\n\\nint prec_booster;\\n\\n#define fail(s1, s2) {fprintf(stderr, \\\"[Error %s] %s\\\\n\\\", s1, s2); return 0;}\\n\\nint init(void)\\n{\\n\\tint i;\\n\\tpat_t *p;\\n\\n\\tfor (i = 0, p = pat_ops; p[i].str; i++)\\n\\t\\tif (regcomp(&(p[i].re), p[i].str, REG_NEWLINE|REG_EXTENDED))\\n\\t\\t\\tfail(\\\"comp\\\", p[i].str);\\n\\n\\tfor (i = 0, p = pat_arg; p[i].str; i++)\\n\\t\\tif (regcomp(&(p[i].re), p[i].str, REG_NEWLINE|REG_EXTENDED))\\n\\t\\t\\tfail(\\\"comp\\\", p[i].str);\\n\\n\\treturn 1;\\n}\\n\\npat_t* match(const char *s, pat_t *p, str_tok_t * t, const char **e)\\n{\\n\\tint i;\\n\\tregmatch_t m;\\n\\n\\twhile (*s == ' ') s++;\\n\\t*e = s;\\n\\n\\tif (!*s) return &pat_eos;\\n\\n\\tfor (i = 0; p[i].str; i++) {\\n\\t\\tif (regexec(&(p[i].re), s, 1, &m, REG_NOTEOL))\\n\\t\\t\\tcontinue;\\n\\t\\tt->s = s;\\n\\t\\t*e = s + (t->len = m.rm_eo - m.rm_so);\\n\\t\\treturn p + i;\\n\\t}\\n\\treturn 0;\\n}\\n\\nint parse(const char *s) {\\n\\tpat_t *p;\\n\\tstr_tok_t *t, tok;\\n\\n\\tprec_booster = l_queue = l_stack = 0;\\n\\tdisplay(s);\\n\\twhile (*s) {\\n\\t\\tp = match(s, pat_arg, &tok, &s);\\n\\t\\tif (!p || p == &pat_eos) fail(\\\"parse arg\\\", s);\\n\\n\\t\\t/* Odd logic here. Don't actually stack the parens: don't need to. */\\n\\t\\tif (p->prec == -1) {\\n\\t\\t\\tprec_booster += 100;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tqpush(tok);\\n\\t\\tdisplay(s);\\n\\nre_op:\\t\\tp = match(s, pat_ops, &tok, &s);\\n\\t\\tif (!p) fail(\\\"parse op\\\", s);\\n\\n\\t\\ttok.assoc = p->assoc;\\n\\t\\ttok.prec = p->prec;\\n\\n\\t\\tif (p->prec > 0)\\n\\t\\t\\ttok.prec = p->prec + prec_booster;\\n\\t\\telse if (p->prec == -1) {\\n\\t\\t\\tif (prec_booster < 100)\\n\\t\\t\\t\\tfail(\\\"unmatched )\\\", s);\\n\\t\\t\\ttok.prec = prec_booster;\\n\\t\\t}\\n\\n\\t\\twhile (l_stack) {\\n\\t\\t\\tt = stack + l_stack - 1;\\n\\t\\t\\tif (!(t->prec == tok.prec && t->assoc == A_L)\\n\\t\\t\\t\\t\\t&& t->prec <= tok.prec)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tqpush(spop());\\n\\t\\t\\tdisplay(s);\\n\\t\\t}\\n\\n\\t\\tif (p->prec == -1) {\\n\\t\\t\\tprec_booster -= 100;\\n\\t\\t\\tgoto re_op;\\n\\t\\t}\\n\\n\\t\\tif (!p->prec) {\\n\\t\\t\\tdisplay(s);\\n\\t\\t\\tif (prec_booster)\\n\\t\\t\\t\\tfail(\\\"unmatched (\\\", s);\\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\n\\t\\tspush(tok);\\n\\t\\tdisplay(s);\\n\\t}\\n\\n\\tif (p->prec > 0)\\n\\t\\tfail(\\\"unexpected eol\\\", s);\\n\\n\\treturn 1;\\n}\\n\\nint main()\\n{\\n\\tint i;\\n\\tconst char *tests[] = {\\n\\t\\t\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\",\\t/* RC mandated: OK */\\n\\t\\t\\\"123\\\",\\t\\t\\t\\t\\t/* OK */\\n\\t\\t\\\"3+4 * 2 / ( 1 - 5 ) ^ 2 ^ 3.14\\\",\\t/* OK */\\n\\t\\t\\\"(((((((1+2+3**(4 + 5))))))\\\",\\t\\t/* bad parens */\\n\\t\\t\\\"a^(b + c/d * .1e5)!\\\",\\t\\t\\t/* unknown op */\\n\\t\\t\\\"(1**2)**3\\\",\\t\\t\\t\\t/* OK */\\n\\t\\t\\\"2 + 2 *\\\",\\t\\t\\t\\t/* unexpected eol */\\n\\t\\t0\\n\\t};\\n\\n\\tif (!init()) return 1;\\n\\tfor (i = 0; tests[i]; i++) {\\n\\t\\tprintf(\\\"Testing string `%s' <enter>\\\\n\\\", tests[i]);\\n\\t\\tgetchar();\\n\\n\\t\\tprintf(\\\"string `%s': %s\\\\n\\\\n\\\", tests[i],\\n\\t\\t\\tparse(tests[i]) ? \\\"Ok\\\" : \\\"Error\\\");\\n\\t}\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <ciso646>\\n#include <iostream>\\n#include <regex>\\n#include <sstream>\\n#include <string>\\n#include <unordered_map>\\n#include <utility>\\n#include <vector>\\n\\nusing std::vector;\\nusing std::string;\\n\\n//-------------------------------------------------------------------------------------------------\\n// throw error( \\\"You \\\", profanity, \\\"ed up!\\\" ); // Don't mess up, okay?\\n//-------------------------------------------------------------------------------------------------\\n#include <exception>\\n#include <stdexcept>\\ntemplate <typename...Args> std::runtime_error error( Args...args )\\n{\\n return std::runtime_error( (std::ostringstream{} << ... << args).str() );\\n};\\n\\n//-------------------------------------------------------------------------------------------------\\n// Stack\\n//-------------------------------------------------------------------------------------------------\\n// Let us co-opt a vector for our stack type.\\n// C++ pedants: no splicing possible == totally okay to do this.\\n//\\n// Note: C++ provides a more appropriate std::stack class, except that the task requires us to\\n// be able to display its contents, and that kind of access is an expressly non-stack behavior.\\n\\ntemplate <typename T> struct stack : public std::vector <T>\\n{\\n using base_type = std::vector <T> ;\\n T push ( const T& x ) { base_type::push_back( x ); return x; }\\n const T& top () { return base_type::back(); }\\n T pop () { T x = std::move( top() ); base_type::pop_back(); return x; }\\n bool empty() { return base_type::empty(); }\\n};\\n\\n//-------------------------------------------------------------------------------------------------\\nusing Number = double;\\n//-------------------------------------------------------------------------------------------------\\n// Numbers are already too awesome to need extra diddling.\\n\\n//-------------------------------------------------------------------------------------------------\\n// Operators\\n//-------------------------------------------------------------------------------------------------\\nusing Operator_Name = string;\\nusing Precedence = int;\\nenum class Associates { none, left_to_right, right_to_left };\\n\\nstruct Operator_Info { Precedence precedence; Associates associativity; };\\n\\nstd::unordered_map <Operator_Name, Operator_Info> Operators =\\n{\\n { \\\"^\\\", { 4, Associates::right_to_left } },\\n { \\\"*\\\", { 3, Associates::left_to_right } },\\n { \\\"/\\\", { 3, Associates::left_to_right } },\\n { \\\"+\\\", { 2, Associates::left_to_right } },\\n { \\\"-\\\", { 2, Associates::left_to_right } },\\n};\\n\\nPrecedence precedence ( const Operator_Name& op ) { return Operators[ op ].precedence; }\\nAssociates associativity( const Operator_Name& op ) { return Operators[ op ].associativity; }\\n\\n//-------------------------------------------------------------------------------------------------\\nusing Token = string;\\n//-------------------------------------------------------------------------------------------------\\nbool is_number ( const Token& t ) { return regex_match( t, std::regex{ R\\\"z((\\\\d+(\\\\.\\\\d*)?|\\\\.\\\\d+)([Ee][\\\\+\\\\-]?\\\\d+)?)z\\\" } ); }\\nbool is_operator ( const Token& t ) { return Operators.count( t ); }\\nbool is_open_parenthesis ( const Token& t ) { return t == \\\"(\\\"; }\\nbool is_close_parenthesis( const Token& t ) { return t == \\\")\\\"; }\\nbool is_parenthesis ( const Token& t ) { return is_open_parenthesis( t ) or is_close_parenthesis( t ); }\\n\\n//-------------------------------------------------------------------------------------------------\\n// std::cout << a_vector_of_something;\\n//-------------------------------------------------------------------------------------------------\\n// Weird C++ stream operator stuff (for I/O).\\n// Don't worry if this doesn't look like it makes any sense.\\n//\\ntemplate <typename T> std::ostream& operator << ( std::ostream& outs, const std::vector <T> & xs )\\n{\\n std::size_t n = 0; for (auto x : xs) outs << (n++ ? \\\" \\\" : \\\"\\\") << x; return outs;\\n}\\n\\n//-------------------------------------------------------------------------------------------------\\n// Progressive_Display\\n//-------------------------------------------------------------------------------------------------\\n// This implements the required task:\\n// \\\"use the algorithm to show the changes in the operator\\n// stack and RPN output as each individual token is processed\\\"\\n//\\n#include <iomanip>\\n\\nstruct Progressive_Display\\n{\\n string token_name;\\n string token_type;\\n\\n Progressive_Display() // Header for the table we are going to generate\\n {\\n std::cout << \\\"\\\\n\\\"\\n \\\" INPUT │ TYPE │ ACTION │ STACK │ OUTPUT\\\\n\\\"\\n \\\"────────┼──────┼──────────────────┼──────────────┼─────────────────────────────\\\\n\\\";\\n }\\n\\n Progressive_Display& operator () ( const Token& token ) // Ready the first two columns\\n {\\n token_name = token;\\n token_type = is_operator ( token ) ? \\\"op\\\"\\n : is_parenthesis( token ) ? \\\"()\\\"\\n : is_number ( token ) ? \\\"num\\\"\\n : \\\"\\\";\\n return *this;\\n }\\n\\n Progressive_Display& operator () ( // Display all columns of a row\\n const string & description,\\n const stack <Token> & stack,\\n const vector <Token> & output )\\n {\\n std::cout << std::right\\n << std::setw( 7 ) << token_name << \\\" │ \\\" << std::left\\n << std::setw( 4 ) << token_type << \\\" │ \\\"\\n << std::setw( 16 ) << description << \\\" │ \\\"\\n << std::setw( 12 ) << (std::ostringstream{} << stack).str() << \\\" │ \\\"\\n << output << \\\"\\\\n\\\";\\n return operator () ( \\\"\\\" ); // Reset the first two columns to empty for next iteration\\n }\\n};\\n\\n//-------------------------------------------------------------------------------------------------\\nvector <Token> parse( const vector <Token> & tokens )\\n//-------------------------------------------------------------------------------------------------\\n{\\n vector <Token> output;\\n stack <Token> stack;\\n\\n Progressive_Display display;\\n\\n for (auto token : tokens) // Shunting Yard takes a single linear pass through the tokens\\n\\n //.........................................................................\\n if (is_number( token ))\\n {\\n output.push_back( token );\\n display( token )( \\\"num --> output\\\", stack, output );\\n }\\n\\n //.........................................................................\\n else if (is_operator( token ) or is_parenthesis( token ))\\n {\\n display( token );\\n\\n if (!is_open_parenthesis( token ))\\n {\\n // pop --> output\\n // : until '(' if token is ')'\\n // : while prec(token) > prec(top)\\n // : while prec(token) == prec(top) AND assoc(token) is left-to-right\\n while (!stack.empty()\\n and ( (is_close_parenthesis( token ) and !is_open_parenthesis( stack.top() ))\\n or (precedence( stack.top() ) > precedence( token ))\\n or ( (precedence( stack.top() ) == precedence( token ))\\n and (associativity( token ) == Associates::left_to_right))))\\n {\\n output.push_back( stack.pop() );\\n display( \\\"pop --> output\\\", stack, output );\\n }\\n\\n // If we popped until '(' because token is ')', toss both parens\\n if (is_close_parenthesis( token ))\\n {\\n stack.pop();\\n display( \\\"pop\\\", stack, output );\\n }\\n }\\n\\n // Everything except ')' --> stack\\n if (!is_close_parenthesis( token ))\\n {\\n stack.push( token );\\n display( \\\"push op\\\", stack, output );\\n }\\n }\\n\\n //.........................................................................\\n else throw error( \\\"unexpected token: \\\", token );\\n\\n // Anything left on the operator stack just gets moved to the output\\n\\n display( \\\"END\\\" );\\n while (!stack.empty())\\n {\\n output.push_back( stack.pop() );\\n display( \\\"pop --> output\\\", stack, output );\\n }\\n\\n return output;\\n}\\n\\n//-------------------------------------------------------------------------------------------------\\nint main( int argc, char** argv )\\n//-------------------------------------------------------------------------------------------------\\ntry\\n{\\n auto tokens = vector <Token> ( argv+1, argv+argc );\\n auto rpn_expr = parse( tokens );\\n std::cout\\n << \\\"\\\\nInfix = \\\" << tokens\\n << \\\"\\\\nRPN = \\\" << rpn_expr\\n << \\\"\\\\n\\\";\\n}\\ncatch (std::exception e)\\n{\\n std::cerr << \\\"error: \\\" << e.what() << \\\"\\\\n\\\";\\n return 1;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <sstream>\\n#include <stack>\\n\\nstd::string infixToPostfix(const std::string& infix) {\\n const std::string ops = \\\"-+/*^\\\";\\n std::stringstream ss;\\n std::stack<int> s;\\n\\n std::stringstream input(infix);\\n std::string token;\\n while (std::getline(input, token, ' ')) {\\n if (token.empty()) {\\n continue;\\n }\\n\\n char c = token[0];\\n size_t idx = ops.find(c);\\n\\n // check for operator\\n if (idx != std::string::npos) {\\n while (!s.empty()) {\\n int prec2 = s.top() / 2;\\n int prec1 = idx / 2;\\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) {\\n ss << ops[s.top()] << ' ';\\n s.pop();\\n } else break;\\n }\\n s.push(idx);\\n } else if (c == '(') {\\n s.push(-2); // -2 stands for '('\\n } else if (c == ')') {\\n // until '(' on stack, pop operators.\\n while (s.top() != -2) {\\n ss << ops[s.top()] << ' ';\\n s.pop();\\n }\\n s.pop();\\n } else {\\n ss << token << ' ';\\n }\\n }\\n\\n while (!s.empty()) {\\n ss << ops[s.top()] << ' ';\\n s.pop();\\n }\\n\\n return ss.str();\\n}\\n\\nint main() {\\n std::string infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\n std::cout << \\\"infix: \\\" << infix << '\\\\n';\\n std::cout << \\\"postfix: \\\" << infixToPostfix(infix) << '\\\\n';\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\nusing System.Linq;\\n\\npublic class Program\\n{\\n public static void Main() {\\n string infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\n Console.WriteLine(infix.ToPostfix());\\n }\\n}\\n\\npublic static class ShuntingYard\\n{\\n private static readonly Dictionary<string, (string symbol, int precedence, bool rightAssociative)> operators\\n = new (string symbol, int precedence, bool rightAssociative) [] {\\n (\\\"^\\\", 4, true),\\n (\\\"*\\\", 3, false),\\n (\\\"/\\\", 3, false),\\n (\\\"+\\\", 2, false),\\n (\\\"-\\\", 2, false)\\n }.ToDictionary(op => op.symbol);\\n\\n public static string ToPostfix(this string infix) {\\n string[] tokens = infix.Split(' ');\\n var stack = new Stack<string>();\\n var output = new List<string>();\\n foreach (string token in tokens) {\\n if (int.TryParse(token, out _)) {\\n output.Add(token);\\n Print(token);\\n } else if (operators.TryGetValue(token, out var op1)) {\\n while (stack.Count > 0 && operators.TryGetValue(stack.Peek(), out var op2)) {\\n int c = op1.precedence.CompareTo(op2.precedence);\\n if (c < 0 || !op1.rightAssociative && c <= 0) {\\n output.Add(stack.Pop());\\n } else {\\n break;\\n }\\n }\\n stack.Push(token);\\n Print(token);\\n } else if (token == \\\"(\\\") {\\n stack.Push(token);\\n Print(token);\\n } else if (token == \\\")\\\") {\\n string top = \\\"\\\";\\n while (stack.Count > 0 && (top = stack.Pop()) != \\\"(\\\") {\\n output.Add(top);\\n }\\n if (top != \\\"(\\\") throw new ArgumentException(\\\"No matching left parenthesis.\\\");\\n Print(token);\\n }\\n }\\n while (stack.Count > 0) {\\n var top = stack.Pop();\\n if (!operators.ContainsKey(top)) throw new ArgumentException(\\\"No matching right parenthesis.\\\");\\n output.Add(top);\\n }\\n Print(\\\"pop\\\");\\n return string.Join(\\\" \\\", output);\\n\\n //Yikes!\\n void Print(string action) => Console.WriteLine($\\\"{action + \\\":\\\",-4} {$\\\"stack[ {string.Join(\\\" \\\", stack.Reverse())} ]\\\",-18} {$\\\"out[ {string.Join(\\\" \\\", output)} ]\\\"}\\\");\\n //A little more readable?\\n void Print(string action) => Console.WriteLine(\\\"{0,-4} {1,-18} {2}\\\", action + \\\":\\\", $\\\"stack[ {string.Join(\\\" \\\", stack.Reverse())} ]\\\", $\\\"out[ {string.Join(\\\" \\\", output)} ]\\\");\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import ceylon.collection {\\n\\n\\tArrayList\\n}\\n\\nabstract class Token(String|Integer data) of IntegerLiteral | Operator | leftParen | rightParen {\\n\\tstring => data.string;\\n}\\nclass IntegerLiteral(shared Integer integer) extends Token(integer) {}\\nclass Operator extends Token {\\n\\n\\tshared Integer precedence;\\n\\tshared Boolean rightAssoc;\\n\\t\\n\\tshared new plus extends Token(\\\"+\\\") {\\n\\t\\tprecedence = 2;\\n\\t\\trightAssoc = false;\\n\\t}\\n\\tshared new minus extends Token(\\\"-\\\") {\\n\\t\\tprecedence = 2;\\n\\t\\trightAssoc = false;\\n\\t}\\n\\tshared new times extends Token(\\\"*\\\") {\\n\\t\\tprecedence = 3;\\n\\t\\trightAssoc = false;\\n\\t}\\n\\tshared new divides extends Token(\\\"/\\\") {\\n\\t\\tprecedence = 3;\\n\\t\\trightAssoc = false;\\n\\t}\\n\\tshared new power extends Token(\\\"^\\\") {\\n\\t\\tprecedence = 4;\\n\\t\\trightAssoc = true;\\n\\t}\\n\\n\\tshared Boolean below(Operator other) =>\\n\\t\\t\\t!rightAssoc && precedence <= other.precedence || rightAssoc && precedence < other.precedence;\\n}\\nobject leftParen extends Token(\\\"(\\\") {}\\nobject rightParen extends Token(\\\")\\\") {}\\n\\n\\nshared void run() {\\n\\t\\n\\tfunction shunt(String input) {\\n\\t\\t\\n\\t\\tfunction tokenize(String input) =>\\n\\t\\t\\t\\tinput.split().map((String element) =>\\n\\t\\t\\t\\t\\tswitch(element.trimmed)\\n\\t\\t\\t\\t\\tcase(\\\"(\\\") leftParen\\n\\t\\t\\t\\t\\tcase(\\\")\\\") rightParen\\n\\t\\t\\t\\t\\tcase(\\\"+\\\") Operator.plus\\n\\t\\t\\t\\t\\tcase(\\\"-\\\") Operator.minus\\n\\t\\t\\t\\t\\tcase(\\\"*\\\") Operator.times\\n\\t\\t\\t\\t\\tcase(\\\"/\\\") Operator.divides\\n\\t\\t\\t\\t\\tcase(\\\"^\\\") Operator.power\\n\\t\\t\\t\\t\\telse IntegerLiteral(parseInteger(element) else 0)); // no error handling\\n\\t\\t\\n\\t\\tvalue outputQueue = ArrayList<Token>();\\n\\t\\tvalue operatorStack = ArrayList<Token>();\\n\\t\\t\\n\\t\\tvoid report(String action) {\\n\\t\\t\\tprint(\\\"``action.padTrailing(22)`` | ``\\\" \\\".join(outputQueue).padTrailing(25)`` | ``\\\" \\\".join(operatorStack).padTrailing(10)``\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tprint(\\\"input is ``input``\\\\n\\\");\\n\\t\\tprint(\\\"Action | Output Queue | Operators' Stack\\n\\t\\t -----------------------|---------------------------|-----------------\\\");\\n\\t\\t\\n\\t\\tfor(token in tokenize(input)) {\\n\\t\\t\\tswitch(token)\\n\\t\\t\\tcase(is IntegerLiteral) {\\n\\t\\t\\t\\toutputQueue.offer(token);\\n\\t\\t\\t\\treport(\\\"``token`` from input to queue\\\");\\n\\t\\t\\t}\\n\\t\\t\\tcase(leftParen) {\\n\\t\\t\\t\\toperatorStack.push(token);\\n\\t\\t\\t\\treport(\\\"``token`` from input to stack\\\");\\n\\t\\t\\t}\\n\\t\\t\\tcase(rightParen){\\n\\t\\t\\t\\twhile(exists top = operatorStack.pop(), top != leftParen) {\\n\\t\\t\\t\\t\\toutputQueue.offer(top);\\n\\t\\t\\t\\t\\treport(\\\"``top`` from stack to queue\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcase(is Operator) {\\n\\t\\t\\t\\twhile(exists top = operatorStack.top, is Operator top, token.below(top)) {\\n\\t\\t\\t\\t\\toperatorStack.pop();\\n\\t\\t\\t\\t\\toutputQueue.offer(top);\\n\\t\\t\\t\\t\\treport(\\\"``top`` from stack to queue\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\toperatorStack.push(token);\\n\\t\\t\\t\\treport(\\\"``token`` from input to stack\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile(exists top = operatorStack.pop()) {\\n\\t\\t\\toutputQueue.offer(top);\\n\\t\\t\\treport(\\\"``top`` from stack to queue\\\");\\n\\t\\t}\\n\\t\\treturn \\\" \\\".join(outputQueue);\\n\\t}\\n\\t\\n\\tvalue rpn = shunt(\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\");\\n\\tassert(rpn == \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\");\\n\\tprint(\\\"\\\\nthe result is ``rpn``\\\");\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \";;;; Parsing/infix to RPN conversion\\n(defconstant operators \\\"^*/+-\\\")\\n(defconstant precedence '(-4 3 3 2 2))\\n\\n(defun operator-p (op)\\n \\\"string->integer|nil: Returns operator precedence index or nil if not operator.\\\"\\n (and (= (length op) 1) (position (char op 0) operators)))\\n\\n(defun has-priority (op2 op1)\\n \\\"(string,string)->boolean: True if op2 has output priority over op1.\\\"\\n (defun prec (op) (nth (operator-p op) precedence))\\n (or (and (plusp (prec op1)) (<= (prec op1) (abs (prec op2))))\\n (and (minusp (prec op1)) (< (- (prec op1)) (abs (prec op2))))))\\n\\n(defun string-split (expr)\\n \\\"string->list: Tokenize a space separated string.\\\"\\n (let* ((p (position #\\\\Space expr))\\n (tok (if p (subseq expr 0 p) expr)))\\n (if p (append (list tok) (string-split (subseq expr (1+ p)))) (list tok))))\\n\\n(defun classify (tok)\\n \\\"nil|string->symbol: Classify a token.\\\"\\n (cond\\n ((null tok) 'NOL)\\n ((operator-p tok) 'OPR)\\n ((string= tok \\\"(\\\") 'LPR)\\n ((string= tok \\\")\\\") 'RPR)\\n (t 'LIT)))\\n\\n;;; transitions when op2 is dont care\\n(defconstant trans1D '((LIT GO) (LPR ENTER)))\\n;;; transitions when we check op2 also\\n(defconstant trans2D\\n '((OPR ((NOL ENTER)\\n (LPR ENTER)\\n (OPR (lambda (op1 op2) (if (has-priority op2 op1) 'LEAVE 'ENTER)))))\\n (RPR ((NOL \\\"mismatched parentheses\\\")\\n (LPR CLEAR)\\n (OPR LEAVE)))\\n (NOL ((NOL nil)\\n (LPR \\\"mismatched parentheses\\\")\\n (OPR LEAVE)))))\\n\\n(defun do-signal (op1 op2)\\n \\\"(nil|string,nil|string)->symbol|string|nil: Emit a signal based on state of inputq and opstack.\\n A nil return is a successful lookup (on nil,nil) because all input combinations are specified.\\\"\\n (let ((sig (or (cadr (assoc (classify op1) trans1D))\\n (cadr (assoc (classify op2) (cadr (assoc (classify op1) trans2D)))))))\\n (if (or (null sig) (symbolp sig) (stringp sig)) sig\\n (funcall (coerce sig 'function) op1 op2))))\\n\\n(defun rpn (expr)\\n \\\"string->string: Parse infix expression into rpn.\\\"\\n (format t \\\"TOKEN TOS SIGNAL OPSTACK OUTPUTQ~%\\\")\\n\\n ;; iterate until both stacks empty\\n (do* ((input (string-split expr)) (opstack nil) (outputq \\\"\\\")\\n (sig (do-signal (first input) (first opstack)) (do-signal (first input) (first opstack))))\\n ((null sig) ; until\\n ;; print last closing frame\\n (format t \\\"~A~7,T~A~14,T~A~25,T~A~38,T~A~%\\\" nil nil nil opstack outputq)\\n (subseq outputq 1)) ; return final infix expression\\n\\n ;; print opening frame\\n (format t \\\"~A~7,T~A~14,T\\\" (first input) (first opstack))\\n (format t (if (stringp sig) \\\"\\\\\\\"~A\\\\\\\"\\\" \\\"~A\\\") sig)\\n\\n ;; switch state\\n (let ((output (case sig\\n (GO (pop input))\\n (ENTER (push (pop input) opstack) nil)\\n (LEAVE (pop opstack))\\n (CLEAR (pop input) (pop opstack) nil)\\n (otherwise (pop input) (pop opstack)\\n (if (stringp sig) sig \\\"unknown signal\\\")))))\\n (when output (setf outputq (concatenate 'string outputq \\\" \\\" output))))\\n\\n ;; print closing frame\\n (format t \\\"~25,T~A~38,T~A~%\\\" opstack outputq))) ; end-do\\n\\n(defun main (&optional (xtra nil))\\n \\\"nil->[printed rpn expressions]: Main function.\\\"\\n (let ((expressions '(\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n \\\"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\\\"\\n \\\"( ( 3 ^ 4 ) ^ 2 ^ 9 ) ^ 2 ^ 5\\\"\\n \\\"3 + 4 * ( 5 - 6 ) ) 4 * 9\\\")))\\n (dolist (expr (if xtra expressions (list (car expressions))))\\n (format t \\\"~%INFIX:\\\\\\\"~A\\\\\\\"~%\\\" expr)\\n (format t \\\"RPN:\\\\\\\"~A\\\\\\\"~%\\\" (rpn expr)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"import std.container;\\nimport std.stdio;\\n\\nvoid main() {\\n string infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\n writeln(\\\"infix: \\\", infix);\\n writeln(\\\"postfix: \\\", infixToPostfix(infix));\\n}\\n\\nstring infixToPostfix(string infix) {\\n import std.array;\\n\\n /* To find out the precedence, we take the index of the\\n token in the ops string and divide by 2 (rounding down).\\n This will give us: 0, 0, 1, 1, 2 */\\n immutable ops = [\\\"+\\\", \\\"-\\\", \\\"/\\\", \\\"*\\\", \\\"^\\\"];\\n\\n auto sb = appender!string;\\n SList!int stack;\\n\\n // split the input on whitespace\\n foreach (token; infix.split) {\\n if (token.empty) {\\n continue;\\n }\\n\\n int idx = ops.indexOf(token);\\n\\n // check for operator\\n if (idx != -1) {\\n while (!stack.empty) {\\n int prec2 = stack.peek / 2;\\n int prec1 = idx / 2;\\n if (prec2 > prec1 || (prec2 == prec1 && token != \\\"^\\\")) {\\n sb.put(ops[stack.pop]);\\n sb.put(' ');\\n } else {\\n break;\\n }\\n }\\n stack.push(idx);\\n } else if (token == \\\"(\\\") {\\n stack.push(-2); // -2 stands for '('\\n } else if (token == \\\")\\\") {\\n // until '(' on stack, pop operators.\\n while (stack.peek != -2) {\\n sb.put(ops[stack.pop]);\\n sb.put(' ');\\n }\\n stack.pop();\\n } else {\\n sb.put(token);\\n sb.put(' ');\\n }\\n }\\n\\n while (!stack.empty) {\\n sb.put(ops[stack.pop]);\\n sb.put(' ');\\n }\\n\\n return sb.data;\\n}\\n\\n// Find the first index of the specified value, or -1 if not found.\\nint indexOf(T)(const T[] a, const T v) {\\n foreach(i,e; a) {\\n if (e == v) {\\n return i;\\n }\\n }\\n return -1;\\n}\\n\\n// Convienience for adding a new element\\nvoid push(T)(ref SList!T s, T v) {\\n s.insertFront(v);\\n}\\n\\n// Convienience for accessing the top element\\nauto peek(T)(SList!T s) {\\n return s.front;\\n}\\n\\n// Convienience for removing and returning the top element\\nauto pop(T)(ref SList!T s) {\\n auto v = s.front;\\n s.removeFront;\\n return v;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"(require 'hash)\\n(require 'tree)\\n\\n(define OPS (make-hash))\\n(hash-set OPS \\\"^\\\" '( 4 #f)) ;; right assoc\\n(hash-set OPS \\\"*\\\" '( 3 #t)) ;; left assoc\\n(hash-set OPS \\\"/\\\" '( 3 #t))\\n(hash-set OPS \\\"+\\\" '( 2 #t))\\n(hash-set OPS \\\"-\\\" '( 2 #t))\\n\\n;; helpers\\n(define (is-right-par? token) (string=? token \\\")\\\"))\\n(define (is-left-par? token) (string=? token \\\"(\\\"))\\n(define (is-num? op) (not (hash-ref OPS op))) ;; crude\\n(define (is-op? op) (hash-ref OPS op))\\n(define (is-left? op) (second (hash-ref OPS op)))\\n(define (is-right? op) (not (is-left? op)))\\n(define (op-prec op) (first (hash-ref OPS op)))\\n\\n;; Wikipedia algorithm, translated as it is\\n\\n(define (shunt tokens S Q)\\n (for ((token tokens))\\n (writeln \\\"S: \\\" (stack->list S) \\\"Q: \\\" (queue->list Q) \\\"token: \\\"token)\\n (cond\\n [(is-left-par? token) (push S token) ]\\n [(is-right-par? token)\\n (while (and (stack-top S) (not (is-left-par? (stack-top S))))\\n (q-push Q ( pop S)))\\n (when (stack-empty? S) (error 'misplaced-parenthesis \\\"()\\\" ))\\n (pop S)] ; // left par\\n\\n [(is-op? token)\\n (while (and\\n (is-op? (stack-top S))\\n (or\\n (and (is-left? token) (<= (op-prec token) (op-prec (stack-top S))))\\n (and (is-right? token) (< (op-prec token) (op-prec (stack-top S))))))\\n (q-push Q (pop S)))\\n (push S token)]\\n\\n [(is-num? token) (q-push Q token)]\\n [else (error 'bad-token token)])) ; for\\n (while (stack-top S) (q-push Q (pop S))))\\n\\n(string-delimiter \\\"\\\")\\n(define (task infix)\\n (define S (stack 'S))\\n (define Q (queue 'Q))\\n (shunt (text-parse infix) S Q)\\n (writeln 'infix infix)\\n (writeln 'RPN (queue->list Q)))\\n\",\n \"language\": \"EchoLisp\"\n },\n {\n \"code\": \"open System\\n\\ntype action = Shift | ReduceStack | ReduceInput\\n\\ntype State (input : string list, stack : string list, output : string list) =\\n member x.Input with get() = input\\n member x.Stack with get() = stack\\n member x.Output with get() = output\\n\\n member x.report act =\\n let markTop = function | [] -> [] | x::xs -> (\\\"[\\\"+x+\\\"]\\\")::xs\\n let (s, text) =\\n if x.Stack = [] && x.Input = [] then x, \\\"\\\"\\n else\\n match act with\\n | Shift -> State((markTop x.Input), x.Stack, x.Output), \\\"shift\\\"\\n | ReduceStack -> State(x.Input, (markTop x.Stack), x.Output), \\\"reduce\\\"\\n | ReduceInput -> State((markTop x.Input), x.Stack, x.Output), \\\"reduce\\\"\\n\\n let lstr (x :string list) = String.Join(\\\" \\\", (List.toArray x))\\n printfn \\\"%25s %-9s %6s %s\\\" (lstr (List.rev s.Output)) (lstr (List.rev s.Stack)) text (lstr s.Input)\\n\\n member x.shift =\\n x.report Shift\\n State(x.Input.Tail, (x.Input.Head)::x.Stack, x.Output)\\n\\n member x.reduce =\\n x.report ReduceStack\\n State (x.Input, (x.Stack.Tail), (x.Stack.Head)::x.Output)\\n\\n member x.reduceNumber =\\n x.report ReduceInput\\n State(x.Input.Tail, x.Stack, (x.Input.Head)::x.Output)\\n\\nlet prec = function\\n| \\\"^\\\" -> 4 | \\\"*\\\" | \\\"/\\\" -> 3 | \\\"+\\\" | \\\"-\\\" -> 2 | \\\"(\\\" -> 1\\n| x -> failwith (\\\"No precedence! Not an operator: \\\" + x)\\n\\ntype assocKind = | Left | Right\\nlet assoc = function | \\\"^\\\" -> Right | _ -> Left\\n\\nlet (|Number|Open|Close|Operator|) x =\\n if (Double.TryParse >> fst) x then Number\\n elif x = \\\"(\\\" then Open\\n elif x = \\\")\\\" then Close\\n else Operator\\n\\nlet rec shunting_yard (s : State) =\\n\\n let rec reduce_to_Open (s : State) =\\n match s.Stack with\\n | [] -> failwith \\\"mismatched parentheses!\\\"\\n | \\\"(\\\"::xs -> State(s.Input.Tail, xs, s.Output)\\n | _ ->\\n reduce_to_Open s.reduce\\n\\n let reduce_by_prec_and_shift x s =\\n let (xPrec, xAssoc) = (prec x, assoc x)\\n let rec loop (s : State) =\\n match s.Stack with\\n | [] -> s\\n | x::xs ->\\n let topPrec = prec x\\n if xAssoc = Left && xPrec <= topPrec || xAssoc = Right && xPrec < topPrec then\\n loop s.reduce\\n else\\n s\\n (loop s).shift\\n\\n let rec reduce_rest (s : State) =\\n match s.Stack with\\n | [] -> s\\n | \\\"(\\\"::_ -> failwith \\\"mismatched parentheses!\\\"\\n | x::_ ->\\n reduce_rest s.reduce\\n\\n match s.Input with\\n | x::inputRest ->\\n match x with\\n | Number ->\\n shunting_yard s.reduceNumber\\n | Open ->\\n shunting_yard s.shift\\n | Close ->\\n shunting_yard (reduce_to_Open s)\\n | Operator ->\\n shunting_yard (reduce_by_prec_and_shift x s)\\n | [] -> reduce_rest s\\n\\n[<EntryPoint>]\\nlet main argv =\\n let input = if argv.Length = 0 then \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\".Split() else argv\\n shunting_yard (State((Array.toList input), [], []))\\n |> (fun s -> s.report ReduceStack)\\n 0\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \" MODULE COMPILER\\t!At least of arithmetic expressions.\\n INTEGER KBD,MSG\\t\\t!I/O units.\\n\\n INTEGER ENUFF\\t\\t!How long s a piece of string?\\n PARAMETER (ENUFF = 66)\\t!This long.\\n CHARACTER*(ENUFF) RP\\t!Holds the Reverse Polish Notation.\\n INTEGER LR\\t\\t!And this is its length.\\n\\n INTEGER\\t\\tOPSYMBOLS\\t\\t!Recognised operator symbols.\\n PARAMETER\\t(OPSYMBOLS = 11)\\t!There are also some associates.\\n TYPE SYMB\\t\\t!To recognise symbols and carry associated information.\\n CHARACTER*1\\tIS\\t\\t!Its text. Careful with the trailing space and comparisons.\\n INTEGER*1\\tPRECEDENCE\\t!Controls the order of evaluation.\\n CHARACTER*48\\tUSAGE\\t\\t!Description.\\n END TYPE SYMB\\t\\t!The cross-linkage of precedences is tricky.\\n TYPE(SYMB) SYMBOL(0:OPSYMBOLS)\\t!Righto, I'll have some.\\n PARAMETER (SYMBOL =(/\\t!Note that \\\"*\\\" is not to be seen as a match to \\\"**\\\".\\n o SYMB(\\\" \\\", 0,\\\"Not recognised as an operator's symbol.\\\"),\\n 1 SYMB(\\\" \\\", 1,\\\"separates symbols and aids legibility.\\\"),\\n 2 SYMB(\\\")\\\", 4,\\\"opened with ( to bracket a sub-expression.\\\"),\\n 3 SYMB(\\\"]\\\", 4,\\\"opened with [ to bracket a sub-expression.\\\"),\\n 4 SYMB(\\\"}\\\", 4,\\\"opened with { to bracket a sub-expression.\\\"),\\n 5 SYMB(\\\"+\\\",11,\\\"addition, and unary + to no effect.\\\"),\\n 6 SYMB(\\\"-\\\",11,\\\"subtraction, and unary - for neg. numbers.\\\"),\\n 7 SYMB(\\\"*\\\",12,\\\"multiplication.\\\"),\\n 8 SYMB(\\\"×\\\",12,\\\"multiplication, if you can find this.\\\"),\\n 9 SYMB(\\\"/\\\",12,\\\"division.\\\"),\\n o SYMB(\\\"÷\\\",12,\\\"division for those with a fancy keyboard.\\\"),\\nC 13 is used so that stacked ^ will have lower priority than incoming ^, thus delivering right-to-left evaluation.\\n 1 SYMB(\\\"^\\\",14,\\\"raise to power. Not recognised is **.\\\")/))\\n CHARACTER*3\\tBRAOPEN,BRACLOSE\\t!Three types are allowed.\\n PARAMETER\\t(BRAOPEN = \\\"([{\\\", BRACLOSE = \\\")]}\\\")\\t!These.\\n INTEGER\\t\\tBRALEVEL\\t\\t!In and out, in and out. That's the game.\\n INTEGER\\t\\tPRBRA,PRPOW\\t\\t!Special double values.\\n PARAMETER (PRBRA = SYMBOL( 3).PRECEDENCE)\\t!Bracketing\\n PARAMETER (PRPOW = SYMBOL(11).PRECEDENCE)\\t!And powers refer leftwards.\\n\\n CHARACTER*10 DIGIT\\t\\t!Numberish is a bit more complex.\\n PARAMETER (DIGIT = \\\"0123456789\\\")\\t!But this will do for integers.\\n\\n INTEGER STACKLIMIT\\t\\t!How high is a stack?\\n PARAMETER (STACKLIMIT = 66)\\t!This should suffice.\\n TYPE DEFERRED\\t\\t\\t!I need a siding for lower-precedence operations.\\n CHARACTER*1\\tOPC\\t\\t!The operation code.\\n INTEGER*1\\tPRECEDENCE\\t!Its precedence in the siding may differ.\\n END TYPE DEFERRED\\t\\t!Anyway, that's enough.\\n TYPE(DEFERRED) OPSTACK(0:STACKLIMIT)\\t!One siding, please.\\n INTEGER OSP\\t\\t\\t!The operation stack pointer.\\n\\n INTEGER INCOMING,TOKENTYPE,NOTHING,ANUMBER,OPENBRA,HUH\\t\\t!Some mnemonics.\\n PARAMETER (NOTHING = 0, ANUMBER = -1, OPENBRA = -2, HUH = -3)\\t!The ordering is not arbitrary.\\n CONTAINS\\t!Now to mess about.\\n SUBROUTINE EMIT(STUFF)\\t!The objective is to produce some RPN text.\\n CHARACTER*(*) STUFF\\t!The term of the moment.\\n INTEGER L\\t\\t!A length.\\n WRITE (MSG,1) STUFF\\t!Announce.\\n 1 FORMAT (\\\"Emit \\\",A)\\t!Whatever it is.\\n IF (STUFF.EQ.\\\"\\\") RETURN\\t!Ha ha.\\n L = LEN(STUFF)\\t!So, how much is there to append?\\n IF (LR + L.GE.ENUFF) STOP \\\"Too much RPN for RP!\\\"\\t!Perhaps too much.\\n IF (LR.GT.0) THEN\\t!Is there existing stuff?\\n LR = LR + 1\\t\\t\\t!Yes. Advance one,\\n RP(LR:LR) = \\\" \\\"\\t\\t!And place a space.\\n END IF\\t\\t!So much for separators.\\n RP(LR + 1:LR + L) = STUFF\\t!Place the stuff.\\n LR = LR + L\\t\\t\\t!Count it in.\\n END SUBROUTINE EMIT\\t!Simple enough, if a bit finicky.\\n\\n SUBROUTINE STACKOP(C,P)\\t!Push an item into the siding.\\n CHARACTER*1 C\\t!The operation code.\\n INTEGER P\\t!Its precedence.\\n OSP = OSP + 1\\t\\t!Stacking up...\\n IF (OSP.GT.STACKLIMIT) STOP \\\"OSP overtopped!\\\"\\t!Perhaps not.\\n OPSTACK(OSP).OPC = C\\t\\t!Righto,\\n OPSTACK(OSP).PRECEDENCE = P\\t!The deed is simple.\\n WRITE (MSG,1) C,OPSTACK(1:OSP)\\t!Announce.\\n 1 FORMAT (\\\"Stack \\\",A1,9X,\\\",OpStk=\\\",33(A1,I2:\\\",\\\"))\\n END SUBROUTINE STACKOP\\t!So this is more for mnemonic ease.\\n\\n LOGICAL FUNCTION COMPILE(TEXT)\\t!A compiler confronts a compiler!\\n CHARACTER*(*) TEXT\\t!To be inspected.\\n INTEGER L1,L2\\t\\t!Fingers for the scan.\\n CHARACTER*1 C\\t\\t!Character of the moment.\\n INTEGER HAPPY\\t\\t!Ah, shades of mood.\\n LR = 0\\t\\t!No output yet.\\n OSP = 0\\t\\t!Nothing stacked.\\n OPSTACK(0).OPC = \\\"\\\"\\t\\t!Prepare a bouncer.\\n OPSTACK(0).PRECEDENCE = 0\\t!So that loops won't go past.\\n BRALEVEL = 0\\t\\t!None seen.\\n HAPPY = +1\\t\\t!Nor any problems.\\n L2 = 1\\t\\t!Syncopation: one past the end of the previous token.\\nChew into an operand, possibly obstructed by an open bracket.\\n 100 CALL FORASIGN\\t\\t!Find something to inspect.\\n IF (TOKENTYPE.EQ.NOTHING) THEN\\t!Run off the end?\\n IF (OSP.GT.0) CALL GRUMP(\\\"Another operand or one of \\\"\\t!E.g. \\\"1 +\\\".\\n 1 //BRAOPEN//\\\" is expected.\\\")\\t\\t\\t\\t!Give a hint, because stacked stuff awaits.\\n ELSE IF (TOKENTYPE.EQ.ANUMBER) THEN\\t!If a number,\\n CALL EMIT(TEXT(L1:L2 - 1))\\t\\t\\t!Roll all its digits.\\n ELSE IF (TOKENTYPE.EQ.OPENBRA) THEN\\t!Starting a sub-expression?\\n CALL STACKOP(C,PRBRA - 1)\\t\\t\\t!Thus ( has less precedence than ).\\n GO TO 100\\t\\t\\t\\t\\t!And I still want an operand.\\nC ELSE IF (TOKENTYPE.EQ.ANAME) THEN\\t!Name of something?\\nC CALL EMIT(TEXT(L1:L2 - 1))\\t\\t\\t!Roll it.\\n ELSE\\t\\t\\t\\t\\t!No further options.\\n CALL GRUMP(\\\"Huh? Unexpected \\\"//C)\\t\\t!Probably something like \\\"1 + +\\\"\\n END IF\\t\\t\\t\\t!Righto, finished with operands.\\nChase after an operator, possibly interrupted by a close bracket,.\\n 200 CALL FORASIGN\\t\\t!Find something to inspect.\\n IF (TOKENTYPE.LT.0) THEN\\t!But, have I an operand-like token instead?\\n CALL GRUMP(\\\"Operator expected, not \\\"//C)\\t!It seems so.\\n ELSE\\t\\t\\t!Normally, an operator is to hand. Possibly a NOTHING, though.\\n WRITE (MSG,201) C,INCOMING,OPSTACK(1:OSP)\\t!Document it.\\n 201 FORMAT (\\\"Oprn=>\\\",A1,\\\"< Prec=\\\",I2,\\t\\t!Try to align with other output.\\n 1 \\\",OpStk=\\\",33(A1,I2:\\\",\\\"))\\t\\t\\t!So as not to clutter the display.\\n DO WHILE(OPSTACK(OSP).PRECEDENCE .GE. INCOMING)\\t!Shunt higher-precedence stuff out.\\n IF (OPSTACK(OSP).PRECEDENCE .EQ. PRBRA - 1)\\t\\t!Only opening brackets have this precedence.\\n 1 CALL GRUMP(\\\"Unbalanced \\\"//OPSTACK(OSP).OPC)\\t\\t!And they vanish only when meeting their closing bracket.\\n CALL EMIT(OPSTACK(OSP).OPC)\\t\\t\\t\\t!Otherwise we have an operator.\\n OSP = OSP - 1\\t\\t\\t\\t\\t\\t!It has gone forth.\\n END DO\\t\\t\\t\\t\\t\\t!On to the next.\\n IF (TOKENTYPE.GT.NOTHING) THEN\\t!Now, only lower-precedence items are still in the stack.\\n IF (INCOMING.EQ.PRBRA) THEN\\t\\t!And this is a special arrival.\\n CALL BALANCEBRA(C)\\t\\t\\t!It should match an earlier entry.\\n BRALEVEL = BRALEVEL - 1\\t\\t\\t!Count it out.\\n GO TO 200\\t\\t\\t\\t!And I still haven't got an operator.\\n ELSE\\t\\t\\t\\t!All others are normal operators.\\n IF (C.EQ.\\\"^\\\") INCOMING = PRPOW - 1\\t!Special trick to cause leftwards association of x^2^3.\\n CALL STACKOP(C,INCOMING)\\t\\t!Shunt aside, to await the next arrival.\\n END IF\\t\\t\\t!So much for that operator.\\n END IF\\t\\t\\t!Providing it was not just an end-of-input flusher.\\n END IF\\t\\t!And not a misplaced operand.\\nCarry on?\\n IF (HAPPY .GT. 0) GO TO 100 \\t!No problems, and not a nothing from the end of the text.\\nCompleted.\\n COMPILE = HAPPY.GE.0\\t!One hopes so.\\n CONTAINS\\t!Now for some assistants.\\n SUBROUTINE GRUMP(GROWL)\\t!There might be a problem.\\n CHARACTER*(*) GROWL\\t!The fault.\\n WRITE (MSG,1) GROWL\\t!Say it.\\n IF (L1.GT. 1) WRITE (MSG,1) \\\"Tasty:\\\",TEXT( 1:L1 - 1)\\t!Now explain the context.\\n IF (L2.GT.L1) WRITE (MSG,1) \\\"Nasty:\\\",TEXT(L1:L2 - 1)\\t!This is the token when trouble was found.\\n IF (L2.LE.LEN(TEXT)) WRITE (MSG,1) \\\"Misty:\\\",TEXT(L2:)\\t!And this remains to be seen.\\n 1 FORMAT (4X,A,1X,A)\\t!A simple layout works nicely for reasonable-length texts.\\n HAPPY = -1\\t.\\t!Just so.\\n END SUBROUTINE GRUMP\\t!Enuogh said.\\n\\n SUBROUTINE BALANCEBRA(B)\\t!Perhaps a happy meeting.\\n CHARACTER*1 B\\t!The closer.\\n CHARACTER*1 O\\t!The putative opener.\\n INTEGER IT,L\\t\\t!Fingers.\\n CHARACTER*88 GROWL\\t!A scratchpad.\\n O = OPSTACK(OSP).OPC\\t!This should match B.\\n WRITE (MSG,1) O,B\\t\\t!Perhaps.\\n 1 FORMAT (\\\"Match \\\",2A)\\t!Show what I've got, anyway.\\n IT = INDEX(BRAOPEN,O)\\t!So, what sort did I save?\\n IF (IT .EQ. INDEX(BRACLOSE,B)) THEN\\t!A friend?\\n OSP = OSP - 1\\t\\t\\t!Yes. They vanish together.\\n ELSE\\t!Otherwise, something is out of place.\\n GROWL = \\\"Unbalanced {[(...)]} bracketing! The closing \\\"\\t!Alas.\\n 1 //B//\\\" is unmatched.\\\"\\t\\t\\t\\t!So, a mess.\\n IF (IT.GT.0) GROWL(62:) = \\\"A \\\"//BRACLOSE(IT:IT)\\t!Perhaps there had been no opening bracket.\\n 1 //\\\" would be better.\\\"\\t\\t!But if there had, this would be its friend.\\n CALL GRUMP(GROWL)\\t\\t!Take that!\\n END IF\\t\\t\\t!So much for discrepancies.\\n END SUBROUTINE BALANCEBRA\\t!But, hopefully, amity prevails.\\n\\n SUBROUTINE FORASIGN\\t!See what comes next.\\n INTEGER I\\t!A stepper.\\n L1 = L2\\t\\t!Pick up where the previous scan left off.\\n 10 IF (L1.GT.LEN(TEXT)) THEN\\t!Are we off the end yet?\\n C = \\\"\\\"\\t\\t\\t!Yes. Scrub the marker.\\n L2 = L1\\t\\t\\t!TEXT(L1:L2 - 1) will be null.\\n TOKENTYPE = NOTHING\\t!But this is to be checked first.\\n INCOMING = SYMBOL(1).PRECEDENCE\\t!For flushing sidetracked operators.\\n HAPPY = 0\\t\\t\\t!Fading away.\\n ELSE\\t!Otherwise, there is grist.\\nCheck for spaces and move past them.\\n C = TEXT(L1:L1)\\t!Grab the first character of the prospective token.\\n IF (C.LE.\\\" \\\") THEN\\t!Boring?\\n L1 = L1 + 1\\t\\t!Yes. Step past it.\\n GO TO 10\\t\\t!And look afresh.\\n END IF\\t\\t!Otherwise, L1 now fingers the start.\\nCaught something to inspect.\\n L2 = L1 + 1\\t\\t!This is one beyond. Just for digit strings.\\n IF (INDEX(DIGIT,C).GT.0) THEN\\t!So, has one started?\\n TOKENTYPE = ANUMBER \\t\\t!Yep.\\n 20 IF (L2.LE.LEN(TEXT)) THEN\\t!Probe ahead.\\n IF (INDEX(DIGIT,TEXT(L2:L2)).GT.0) THEN\\t!Another digit?\\n L2 = L2 + 1\\t\\t\\t!Yes. Leaving L1 fingering its start,\\n GO TO 20\\t\\t\\t!Chase its end.\\n END IF\\t\\t\\t!So much for another digit.\\n END IF\\t\\t\\t!And checking against the end.\\nC ELSE IF (INDEX(LETTERS,C).GT.0) THEN\\t!Some sort of name?\\nC advance L2 while in NAMEISH.\\n ELSE IF (INDEX(BRAOPEN,C).GT.0) THEN\\t!An open bracket?\\n TOKENTYPE = OPENBRA\\t\\t\\t!Yep.\\n ELSE\\t\\t\\t!Otherwise, anything else.\\n DO I = OPSYMBOLS,1,-1\\t!Scan backwards, to find ** before *, if present.\\n IF (SYMBOL(I).IS .EQ. C) EXIT\\t!Found?\\n END DO\\t\\t\\t!On to the next. A linear search will do.\\n IF (I.LE.0) THEN\\t!Is it identified?\\n TOKENTYPE = HUH\\t\\t!No.\\n INCOMING = SYMBOL(0).PRECEDENCE\\t!And this might provoke a flush.\\n ELSE\\t\\t\\t!If it is identified,\\n TOKENTYPE = I\\t\\t\\t!Then this is a positive number.\\n INCOMING = SYMBOL(I).PRECEDENCE\\t!And this is of interest.\\n END IF\\t\\t\\t!Righto, anything has been identified, possibly as HUH.\\n END IF\\t\\t!So much for classification.\\n END IF\\t!If there is something to see.\\n WRITE (MSG,30) C,INCOMING,TOKENTYPE\\t\\t!Announce.\\n 30 FORMAT (\\\"Next=>\\\",A1,\\\"< Prec=\\\",I2,\\\",Ttype=\\\",I2)\\t!C might be blank.\\n END SUBROUTINE FORASIGN\\t!I call for a sign, and I see what?\\n END FUNCTION COMPILE\\t!That's the main activity.\\n END MODULE COMPILER\\t!So, enough of this.\\n\\n PROGRAM POKE\\n USE COMPILER\\n CHARACTER*66 TEXT\\n LOGICAL HIC\\n MSG = 6\\n KBD = 5\\n WRITE (MSG,1)\\n 1 FORMAT (\\\"Produce RPN from infix...\\\",/)\\n\\n 10 WRITE (MSG,11)\\n 11 FORMAT(\\\"Infix: \\\",$)\\n READ(KBD,12) TEXT\\n 12 FORMAT (A)\\n IF (TEXT.EQ.\\\"\\\") STOP \\\"Enough.\\\"\\n HIC = COMPILE(TEXT)\\n WRITE (MSG,13) HIC,RP(1:LR)\\n 13 FORMAT (L6,\\\" RPN: >\\\",A,\\\"<\\\")\\n GO TO 10\\n END\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Caution! The apparent gaps in the sequence of precedence values in this table are *not* unused!\\nCunning ploys with precedence allow parameter evaluation, and right-to-left order as in x**y**z.\\n INTEGER\\t\\tOPSYMBOLS\\t\\t!Recognised operator symbols.\\n PARAMETER\\t(OPSYMBOLS = 25)\\t!There are also some associates.\\n TYPE SYMB\\t\\t!To recognise symbols and carry associated information.\\n CHARACTER*2\\tIS\\t\\t!Its text. Careful with the trailing space and comparisons.\\n INTEGER*1\\tPRECEDENCE\\t!Controls the order of evaluation.\\n INTEGER*1\\tPOPCOUNT\\t!Stack activity: a+b means + requires two in.\\n CHARACTER*48\\tUSAGE\\t\\t!Description.\\n END TYPE SYMB\\t\\t!The cross-linkage of precedences is tricky.\\n CHARACTER*5\\tIFPARTS(0:4)\\t!These appear when an operator would otherwise be expected.\\n PARAMETER (IFPARTS = (/\\\"IF\\\",\\\"THEN\\\",\\\"ELSE\\\",\\\"OWISE\\\",\\\"FI\\\"/))\\t!So, bend the usage of \\\"operator\\\".\\n TYPE(SYMB) SYMBOL(-4:OPSYMBOLS)\\t!Righto, I'll have some.\\n PARAMETER (SYMBOL =(/\\t!Note that \\\"*\\\" is not to be seen as a match to \\\"**\\\".\\n 4 SYMB(\\\"FI\\\", 2,0,\\\"the FI that ends an IF-statement.\\\"),\\t!These negative entries are not for name matching\\n 3 SYMB(\\\"Ow\\\", 3,0,\\\"the OWISE part of an IF-statement.\\\"),\\t!Which is instead done via IFPARTS\\n 2 SYMB(\\\"El\\\", 3,0,\\\"the ELSE part of an IF-statement.\\\"),\\t!But are here to take advantage of the structure in place.\\n 1 SYMB(\\\"Th\\\", 3,0,\\\"the THEN part of an IF-statement.\\\"),\\t!The IF is recognised separately, when expecting an operand.\\n o SYMB(\\\" \\\", 0,0,\\\"Not recognised as an operator's symbol.\\\"),\\n 1 SYMB(\\\" \\\", 1,0,\\\"separates symbols and aids legibility.\\\"),\\nC 2 and 3 are used for the parts of an IF-statement. See PRIF.\\nC 3 These precedences ensure the desired order of evaluation.\\n 2 SYMB(\\\") \\\", 4,0,\\\"opened with ( to bracket a sub-expression.\\\"),\\n 3 SYMB(\\\"] \\\", 4,0,\\\"opened with [ to bracket a sub-expression.\\\"),\\n 4 SYMB(\\\"} \\\", 4,0,\\\"opened with { to bracket a sub-expression.\\\"),\\n 5 SYMB(\\\", \\\", 5,0,\\\"continues a list of parameters to a function.\\\"),\\nC SYMB(\\\":=\\\", 6,0,\\\"marks an on-the-fly assignment of a result\\\"), Identified differently... see PRREF.\\n 6 SYMB(\\\"| \\\", 7,2,\\\"logical OR, similar to addition.\\\"),\\n 7 SYMB(\\\"& \\\", 8,2,\\\"logical AND, similar to multiplication.\\\"),\\n 8 SYMB(\\\"¬ \\\", 9,0,\\\"logical NOT, similar to negation.\\\"),\\n 9 SYMB(\\\"= \\\",10,2,\\\"tests for equality (beware decimal fractions)\\\"),\\n o SYMB(\\\"< \\\",10,2,\\\"tests strictly less than.\\\"),\\n 1 SYMB(\\\"> \\\",10,2,\\\"tests strictly greater than.\\\"),\\n 2 SYMB(\\\"<>\\\",10,2,\\\"tests not equal (there is no 'not' key!)\\\"),\\n 3 SYMB(\\\"¬=\\\",10,2,\\\"tests not equal if you can find a ¬ !\\\"),\\n 4 SYMB(\\\"<=\\\",10,2,\\\"tests less than or equal.\\\"),\\n 5 SYMB(\\\">=\\\",10,2,\\\"tests greater than or equal.\\\"),\\n 6 SYMB(\\\"+ \\\",11,2,\\\"addition, and unary + to no effect.\\\"),\\n 7 SYMB(\\\"- \\\",11,2,\\\"subtraction, and unary - for neg. numbers.\\\"),\\n 8 SYMB(\\\"* \\\",12,2,\\\"multiplication.\\\"),\\n 9 SYMB(\\\"× \\\",12,2,\\\"multiplication, if you can find this.\\\"),\\n o SYMB(\\\"/ \\\",12,2,\\\"division.\\\"),\\n 1 SYMB(\\\"÷ \\\",12,2,\\\"division for those with a fancy keyboard.\\\"),\\n 2 SYMB(\\\"\\\\ \\\",12,2,\\\"remainder a\\\\b = a - truncate(a/b)*b; 11\\\\3 = 2\\\"),\\nC 13 is used so that stacked ** will have lower priority than incoming **, thus delivering right-to-left evaluation.\\n 3 SYMB(\\\"^ \\\",14,2,\\\"raise to power: also recognised is **.\\\"),\\t!Uses the previous precedence level also!\\n 4 SYMB(\\\"**\\\",14,2,\\\"raise to power: also recognised is ^.\\\"),\\n 5 SYMB(\\\"! \\\",15,1,\\\"factorial, sortof, just for fun.\\\")/))\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"strings\\\"\\n)\\n\\nvar input = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n\\nvar opa = map[string]struct {\\n prec int\\n rAssoc bool\\n}{\\n \\\"^\\\": {4, true},\\n \\\"*\\\": {3, false},\\n \\\"/\\\": {3, false},\\n \\\"+\\\": {2, false},\\n \\\"-\\\": {2, false},\\n}\\n\\nfunc main() {\\n fmt.Println(\\\"infix: \\\", input)\\n fmt.Println(\\\"postfix:\\\", parseInfix(input))\\n}\\n\\nfunc parseInfix(e string) (rpn string) {\\n var stack []string // holds operators and left parenthesis\\n for _, tok := range strings.Fields(e) {\\n switch tok {\\n case \\\"(\\\":\\n stack = append(stack, tok) // push \\\"(\\\" to stack\\n case \\\")\\\":\\n var op string\\n for {\\n // pop item (\\\"(\\\" or operator) from stack\\n op, stack = stack[len(stack)-1], stack[:len(stack)-1]\\n if op == \\\"(\\\" {\\n break // discard \\\"(\\\"\\n }\\n rpn += \\\" \\\" + op // add operator to result\\n }\\n default:\\n if o1, isOp := opa[tok]; isOp {\\n // token is an operator\\n for len(stack) > 0 {\\n // consider top item on stack\\n op := stack[len(stack)-1]\\n if o2, isOp := opa[op]; !isOp || o1.prec > o2.prec ||\\n o1.prec == o2.prec && o1.rAssoc {\\n break\\n }\\n // top item is an operator that needs to come off\\n stack = stack[:len(stack)-1] // pop it\\n rpn += \\\" \\\" + op // add it to result\\n }\\n // push operator (the new one) to stack\\n stack = append(stack, tok)\\n } else { // token is an operand\\n if rpn > \\\"\\\" {\\n rpn += \\\" \\\"\\n }\\n rpn += tok // add operand to result\\n }\\n }\\n }\\n // drain stack to result\\n for len(stack) > 0 {\\n rpn += \\\" \\\" + stack[len(stack)-1]\\n stack = stack[:len(stack)-1]\\n }\\n return\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Text.Printf\\n\\nprec :: String -> Int\\nprec \\\"^\\\" = 4\\nprec \\\"*\\\" = 3\\nprec \\\"/\\\" = 3\\nprec \\\"+\\\" = 2\\nprec \\\"-\\\" = 2\\n\\nleftAssoc :: String -> Bool\\nleftAssoc \\\"^\\\" = False\\nleftAssoc _ = True\\n\\nisOp :: String -> Bool\\nisOp [t] = t `elem` \\\"-+/*^\\\"\\nisOp _ = False\\n\\nsimSYA :: [String] -> [([String], [String], String)]\\nsimSYA xs = final <> [lastStep]\\n where\\n final = scanl f ([], [], \\\"\\\") xs\\n lastStep =\\n ( \\\\(x, y, _) ->\\n (reverse y <> x, [], \\\"\\\")\\n )\\n $ last final\\n f (out, st, _) t\\n | isOp t =\\n ( reverse (takeWhile testOp st) <> out,\\n (t :) (dropWhile testOp st),\\n t\\n )\\n | t == \\\"(\\\" = (out, \\\"(\\\" : st, t)\\n | t == \\\")\\\" =\\n ( reverse (takeWhile (/= \\\"(\\\") st) <> out,\\n tail $ dropWhile (/= \\\"(\\\") st,\\n t\\n )\\n | otherwise = (t : out, st, t)\\n where\\n testOp x =\\n isOp x\\n && ( leftAssoc t && prec t == prec x\\n || prec t < prec x\\n )\\n\\nmain :: IO ()\\nmain = do\\n a <- getLine\\n printf \\\"%30s%20s%7s\\\" \\\"Output\\\" \\\"Stack\\\" \\\"Token\\\"\\n mapM_\\n ( \\\\(x, y, z) ->\\n printf\\n \\\"%30s%20s%7s\\\\n\\\"\\n (unwords $ reverse x)\\n (unwords y)\\n z\\n )\\n $ simSYA $ words a\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"{-# LANGUAGE LambdaCase #-}\\nimport Control.Applicative\\nimport Control.Lens\\nimport Control.Monad\\nimport Control.Monad.Error\\nimport Control.Monad.State\\nimport System.Console.Readline\\n\\ndata InToken = InOp Op | InVal Int | LParen | RParen deriving (Show)\\ndata OutToken = OutOp Op | OutVal Int\\ndata StackElem = StOp Op | Paren deriving (Show)\\ndata Op = Pow | Mul | Div | Add | Sub deriving (Show)\\ndata Assoc = L | R deriving (Eq)\\n\\ntype Env = ([OutToken], [StackElem])\\ntype RPNComp = StateT Env (Either String)\\n\\ninstance Show OutToken where\\n show (OutOp x) = snd $ opInfo x\\n show (OutVal v) = show v\\n\\nopInfo = \\\\case\\n Pow -> (4, \\\"^\\\")\\n Mul -> (3, \\\"*\\\")\\n Div -> (3, \\\"/\\\")\\n Add -> (2, \\\"+\\\")\\n Sub -> (2, \\\"-\\\")\\n\\nprec = fst . opInfo\\nleftAssoc Pow = False\\nleftAssoc _ = True\\n\\n--Stateful actions\\nprocessToken :: InToken -> RPNComp ()\\nprocessToken = \\\\case\\n (InVal z) -> pushVal z\\n (InOp op) -> pushOp op\\n LParen -> pushParen\\n RParen -> pushTillParen\\n\\npushTillParen :: RPNComp ()\\npushTillParen = use _2 >>= \\\\case\\n [] -> throwError \\\"Unmatched right parenthesis\\\"\\n (s:st) -> case s of\\n StOp o -> _1 %= (OutOp o:) >> _2 %= tail >> pushTillParen\\n Paren -> _2 %= tail\\n\\npushOp :: Op -> RPNComp ()\\npushOp o = use _2 >>= \\\\case\\n [] -> _2 .= [StOp o]\\n (s:st) -> case s of\\n (StOp o2) -> if leftAssoc o && prec o == prec o2\\n || prec o < prec o2\\n then _1 %= (OutOp o2:) >> _2 %= tail >> pushOp o\\n else _2 %= (StOp o:)\\n Paren -> _2 %= (StOp o:)\\n\\npushVal :: Int -> RPNComp ()\\npushVal n = _1 %= (OutVal n:)\\n\\npushParen :: RPNComp ()\\npushParen = _2 %= (Paren:)\\n\\n--Run StateT\\ntoRPN :: [InToken] -> Either String [OutToken]\\ntoRPN xs = evalStateT process ([],[])\\n where process = mapM_ processToken xs\\n >> get >>= \\\\(a,b) -> (reverse a++) <$> (mapM toOut b)\\n toOut :: StackElem -> RPNComp OutToken\\n toOut (StOp o) = return $ OutOp o\\n toOut Paren = throwError \\\"Unmatched left parenthesis\\\"\\n\\n--Parsing\\nreadTokens :: String -> Either String [InToken]\\nreadTokens = mapM f . words\\n where f = let g = return . InOp in \\\\case {\\n \\\"^\\\" -> g Pow; \\\"*\\\" -> g Mul; \\\"/\\\" -> g Div;\\n \\\"+\\\" -> g Add; \\\"-\\\" -> g Sub; \\\"(\\\" -> return LParen;\\n \\\")\\\" -> return RParen;\\n a -> case reads a of\\n [] -> throwError $ \\\"Invalid token `\\\" ++ a ++ \\\"`\\\"\\n [(_,x:[])] -> throwError $ \\\"Invalid token `\\\" ++ a ++ \\\"`\\\"\\n [(v,[])] -> return $ InVal v }\\n\\n--Showing\\nshowOutput (Left msg) = msg\\nshowOutput (Right xs) = unwords $ map show xs\\n\\nmain = do\\n a <- readline \\\"Enter expression: \\\"\\n case a of\\n Nothing -> putStrLn \\\"Please enter a line\\\" >> main\\n Just \\\"exit\\\" -> return ()\\n Just l -> addHistory l >> case readTokens l of\\n Left msg -> putStrLn msg >> main\\n Right ts -> putStrLn (showOutput (toRPN ts)) >> main\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"procedure main()\\n infix := \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n printf(\\\"Infix = %i\\\\n\\\",infix)\\n printf(\\\"RPN = %i\\\\n\\\",Infix2RPN(infix))\\nend\\n\\nlink printf\\n\\nrecord op_info(pr,as) # p=precedence, a=associativity (left=null)\\n\\nprocedure Infix2RPN(expr) #: Infix to RPN parser - shunting yard\\nstatic oi\\ninitial {\\n oi := table() # precedence & associativity\\n every oi[!\\\"+-\\\"] := op_info(2) # 2L\\n every oi[!\\\"*/\\\"] := op_info(3) # 3L\\n oi[\\\"^\\\"] := op_info(4,1) # 4R\\n }\\n\\n ostack := [] # operator stack\\n rpn := \\\"\\\" # rpn\\n\\n pat := sprintf(\\\"%%5s : %%-%ds : %%s\\\\n\\\",*expr) # fmt\\n printf(pat,\\\"Token\\\",\\\"Output\\\",\\\"Op Stack\\\") # header\\n\\n expr ? until pos(0) do { # while tokens\\n tab(many(' ')) # consume any seperator\\n token := tab(upto(' ')|0) # get token\\n printf(pat,token,rpn,list2string(ostack)) # report\\n if token := numeric(token) then # ... numeric\\n rpn ||:= token || \\\" \\\"\\n else\\n if member(oi,token) then { # ... operator\\n while member(oi,op2 := ostack[1]) &\\n ( /oi[token].as & oi[token].pr <= oi[op2].pr ) |\\n ( \\\\oi[token].as & oi[token].pr < oi[op2].pr ) do\\n rpn ||:= pop(ostack) || \\\" \\\"\\n push(ostack,token)\\n }\\n else # ... parenthesis\\n if token == \\\"(\\\" then\\n push(ostack,token)\\n else if token == \\\")\\\" then {\\n until ostack[1] == \\\"(\\\" do\\n rpn ||:= pop(ostack) || \\\" \\\" |\\n stop(\\\"Unbalanced parenthesis\\\")\\n pop(ostack) # discard \\\"(\\\"\\n }\\n }\\n\\n while token := pop(ostack) do # ... input exhausted\\n if token == (\\\"(\\\"|\\\")\\\") then stop(\\\"Unbalanced parenthesis\\\")\\n else {\\n rpn ||:= token || \\\" \\\"\\n printf(pat,\\\"\\\",rpn,list2string(ostack))\\n }\\n\\n return rpn\\nend\\n\\nprocedure list2string(L) #: format list as a string\\n every (s := \\\"[ \\\") ||:= !L || \\\" \\\"\\n return s || \\\"]\\\"\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"NB. j does not have a verb based precedence.\\nNB. j evaluates verb noun sequences from right to left.\\nNB. Seriously. 18 precedence levels in C++ .\\n\\ndisplay=: ([: : (smoutput@:(, [: ; ' '&,&.>@:{:@:|:))) :: empty\\n\\nDisplay=: adverb define\\n:\\nm display^:(0 -.@:-: x)y\\n)\\n\\nNB. Queue, Stack, Pop: m literal name of vector to use. verbose unless x is 0.\\nNB. Implementation includes display, group push and pop not available in the RC FIFO & LIFO pages\\nNB. As adverbs, these definitions work with any global variable.\\nNB. Pop needs the feature, and it helps with display as well.\\nQueue=: adverb define NB. enqueue y\\n('m'~)=: y ,~ (m~)\\nEMPTY\\n:\\nx (m,' queue')Display y\\nm Queue y\\n)\\n\\nStack=: adverb define NB. Stack y\\n('m'~)=: (|.y) , (m~)\\nEMPTY\\n:\\nx (m,' stack')Display y\\nm Stack y\\n)\\n\\nPop=: adverb define NB. Pop y items\\n0 m Pop y\\n:\\ny=. 0 {:@:, y NB. if y is empty use 0 instead\\nrv=. y {. (m~)\\n('m'~)=: y }. (m~)\\nx (m,' pop') Display rv\\nrv\\n)\\n\\nNB. tests\\nTEST=: ''\\n'TEST'Stack'abc'\\n'TEST'Stack'de'\\nassert 'edc' -: 'TEST'Pop 3\\nassert 'ba' -: 'TEST'Pop 2\\nassert 0 (= #) TEST\\n'TEST'Queue'abc'\\n'TEST'Queue'de'\\nassert 'ab' -: 'TEST'Pop 2\\nassert 'cde' -: 'TEST'Pop 3\\nassert 0 (= #) TEST\\n\\nany=: +./\\n\\nDIGITS=: a. {~ 48+i.10 NB. ASCII 48--57\\nprecedence_oppression=: <;._1' +- */ ^ ( ) ',DIGITS\\nassociativity=: 'xLLRxxL'\\n\\nclassify=: {:@:I.@:(1 , any@e.&>)&precedence_oppression\\n\\nNB. The required tokens are also tokens in j.\\nNB. Use the default sequential machine ;: for lexical analysis.\\nrclex=: (;~ classify)\\\"0@:;:\\n\\n\\nNB. numbers can be treated as highest precedence operators\\nnumber=: Q Queue NB. put numbers onto the output queue\\nleft=: S Stack NB. push left paren onto the stack\\n\\nNB. Until the token at the top of the stack is (, pop\\nNB. operators off the stack onto the output queue.\\nNB. Pop the left parenthesis from the stack, but not onto the output queue.\\nright=: 4 : 0 NB. If the token is a right parenthesis:\\ni=. (S~) (i. rclex) '('\\nif. i (= #) S~ do.\\n smoutput'Check your parens!'\\n throw.\\nend.\\nx Q Queue x S Pop i\\nx S Pop 1\\nEMPTY\\n)\\n\\nNB. If the token is an operator, o1, then:\\nNB.\\nNB. while there is an operator token, o2, at the top of the stack, and\\nNB. either o1 is [[left-associative and its precedence is less than or\\nNB. equal to that of o2]]\\\"L*.<:\\\", or o1 is [[right-associative and its precedence\\nNB. is less than that of o2]]\\\"R*.<\\\", pop o2 off the stack, onto the output queue;\\nNB. [[the tally of adjacent leading truths]]\\\"NCT\\\"\\nNB.\\nNB. push o1 onto the stack.\\no=: 4 : 0\\nP=. 0 0 {:: y\\nL=. 'L' = P { associativity\\noperators=. ({.~ i.&(rclex'(')) S~\\nNB. NCT L*.<: or R*.<\\ni=. (+/@:(*./\\\\)@:((L *. P&<:) +. ((-.L) *. P&<))@:(0&{::\\\"1)) :: 0: operators\\nx Q Queue x S Pop i\\nx (S Stack) y\\nEMPTY\\n)\\n\\nNB. terminating version of invalid\\ninvalid=: 4 : 0\\nsmoutput 'invalid token ',0 1 {:: y\\nthrow.\\n)\\n\\nNB. demonstrated invalid\\ninvalid=: [: smoutput 'discarding invalid token ' , 0 1 {:: ]\\n\\nNB. shunt_yard is a verb to implement shunt-yard parsing.\\nNB. verbose defaults to 0. (quiet)\\nNB. use: verbosity shunt_yard_parse algebraic_string\\nshunt_yard_parse=: 0&$: : (4 : 0)\\n\\nNB. j's data structure is array. Rank 1 arrays (vectors)\\nNB. are just right for the stack and output queue.\\n\\n'S Q'=: ;: 'OPERATOR OUTPUT'\\n('S'~)=:('Q'~)=: i.0 2\\n\\nNB. Follow agenda for all tokens, result saved on global OUTPUT variable\\nx (invalid`o`o`o`left`right`number@.(0 0 {:: ])\\\"2 ,:\\\"1@:rclex) y\\nNB. x (invalid`o`o`o`left`right`o@.(0 0 {:: ])\\\"2 ,:\\\"1@:rclex) y NB. numbers can be treated as operators\\nNB. check for junk on stack\\nif. (rclex'(') e. S~ do.\\n smoutput'Check your other parens!'\\n throw.\\nend.\\n\\nNB. shift remaining operators onto the output queue\\nx Q Queue x S Pop # S~\\n\\nNB. return the output queue\\nQ~\\n)\\n\\nalgebra_to_rpn=: {:@:|:@:shunt_yard_parse\\n\\nfulfill_requirement=: ;@:(' '&,&.>)@:algebra_to_rpn\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" fulfill_requirement '3+4*2/(1-5)^2^3'\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n\\n shunt_yard_parse'3*)2+4)'\\nCheck your parens!\\n\\n shunt_yard_parse'3*(2+4'\\nCheck your other parens!\\n\\n algebra_to_rpn'1+x*(3+x)'\\ndiscarding invalid token x\\ndiscarding invalid token x\\n┌─┬─┬─┬─┬─┐\\n│1│3│+│*│+│\\n└─┴─┴─┴─┴─┘\\n\\n NB. Boxed form useful for evaluation\\n algebra_to_rpn'0+666*(1+666*(2+666*(3)))' NB. polynomial evaluation.\\n┌─┬───┬─┬───┬─┬───┬─┬─┬─┬─┬─┬─┬─┐\\n│0│666│1│666│2│666│3│*│+│*│+│*│+│\\n└─┴───┴─┴───┴─┴───┴─┴─┴─┴─┴─┴─┴─┘\\n\\n 1 fulfill_requirement'3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\\nOUTPUT queue 3\\nOPERATOR pop\\nOUTPUT queue\\nOPERATOR stack +\\nOUTPUT queue 4\\nOPERATOR pop\\nOUTPUT queue\\nOPERATOR stack *\\nOUTPUT queue 2\\nOPERATOR pop *\\nOUTPUT queue *\\nOPERATOR stack /\\nOPERATOR stack (\\nOUTPUT queue 1\\nOPERATOR pop\\nOUTPUT queue\\nOPERATOR stack -\\nOUTPUT queue 5\\nOPERATOR pop -\\nOUTPUT queue -\\nOPERATOR pop (\\nOPERATOR pop\\nOUTPUT queue\\nOPERATOR stack ^\\nOUTPUT queue 2\\nOPERATOR pop\\nOUTPUT queue\\nOPERATOR stack ^\\nOUTPUT queue 3\\nOPERATOR pop ^ ^ / +\\nOUTPUT queue ^ ^ / +\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Stack;\\n\\npublic class ShuntingYard {\\n\\n public static void main(String[] args) {\\n String infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\n System.out.printf(\\\"infix: %s%n\\\", infix);\\n System.out.printf(\\\"postfix: %s%n\\\", infixToPostfix(infix));\\n }\\n\\n static String infixToPostfix(String infix) {\\n /* To find out the precedence, we take the index of the\\n token in the ops string and divide by 2 (rounding down).\\n This will give us: 0, 0, 1, 1, 2 */\\n final String ops = \\\"-+/*^\\\";\\n\\n StringBuilder sb = new StringBuilder();\\n Stack<Integer> s = new Stack<>();\\n\\n for (String token : infix.split(\\\"\\\\\\\\s\\\")) {\\n if (token.isEmpty())\\n continue;\\n char c = token.charAt(0);\\n int idx = ops.indexOf(c);\\n\\n // check for operator\\n if (idx != -1) {\\n if (s.isEmpty())\\n s.push(idx);\\n\\n else {\\n while (!s.isEmpty()) {\\n int prec2 = s.peek() / 2;\\n int prec1 = idx / 2;\\n if (prec2 > prec1 || (prec2 == prec1 && c != '^'))\\n sb.append(ops.charAt(s.pop())).append(' ');\\n else break;\\n }\\n s.push(idx);\\n }\\n }\\n else if (c == '(') {\\n s.push(-2); // -2 stands for '('\\n }\\n else if (c == ')') {\\n // until '(' on stack, pop operators.\\n while (s.peek() != -2)\\n sb.append(ops.charAt(s.pop())).append(' ');\\n s.pop();\\n }\\n else {\\n sb.append(token).append(' ');\\n }\\n }\\n while (!s.isEmpty())\\n sb.append(ops.charAt(s.pop())).append(' ');\\n return sb.toString();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function Stack() {\\n this.dataStore = [];\\n this.top = 0;\\n this.push = push;\\n this.pop = pop;\\n this.peek = peek;\\n this.length = length;\\n}\\n\\nfunction push(element) {\\n this.dataStore[this.top++] = element;\\n}\\n\\nfunction pop() {\\n return this.dataStore[--this.top];\\n}\\n\\nfunction peek() {\\n return this.dataStore[this.top-1];\\n}\\n\\nfunction length() {\\n return this.top;\\n}\\n\\nvar infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\ninfix = infix.replace(/\\\\s+/g, ''); // remove spaces, so infix[i]!=\\\" \\\"\\n\\nvar s = new Stack();\\nvar ops = \\\"-+/*^\\\";\\nvar precedence = {\\\"^\\\":4, \\\"*\\\":3, \\\"/\\\":3, \\\"+\\\":2, \\\"-\\\":2};\\nvar associativity = {\\\"^\\\":\\\"Right\\\", \\\"*\\\":\\\"Left\\\", \\\"/\\\":\\\"Left\\\", \\\"+\\\":\\\"Left\\\", \\\"-\\\":\\\"Left\\\"};\\nvar token;\\nvar postfix = \\\"\\\";\\nvar o1, o2;\\n\\nfor (var i = 0; i < infix.length; i++) {\\n token = infix[i];\\n if (token >= \\\"0\\\" && token <= \\\"9\\\") { // if token is operand (here limited to 0 <= x <= 9)\\n postfix += token + \\\" \\\";\\n }\\n else if (ops.indexOf(token) != -1) { // if token is an operator\\n o1 = token;\\n o2 = s.peek();\\n while (ops.indexOf(o2)!=-1 && ( // while operator token, o2, on top of the stack\\n // and o1 is left-associative and its precedence is less than or equal to that of o2\\n (associativity[o1] == \\\"Left\\\" && (precedence[o1] <= precedence[o2]) ) ||\\n // the algorithm on wikipedia says: or o1 precedence < o2 precedence, but I think it should be\\n // or o1 is right-associative and its precedence is less than that of o2\\n (associativity[o1] == \\\"Right\\\" && (precedence[o1] < precedence[o2]))\\n )){\\n postfix += o2 + \\\" \\\"; // add o2 to output queue\\n s.pop(); // pop o2 of the stack\\n o2 = s.peek(); // next round\\n }\\n s.push(o1); // push o1 onto the stack\\n }\\n else if (token == \\\"(\\\") { // if token is left parenthesis\\n s.push(token); // then push it onto the stack\\n }\\n else if (token == \\\")\\\") { // if token is right parenthesis\\n while (s.peek() != \\\"(\\\"){ // until token at top is (\\n postfix += s.pop() + \\\" \\\";\\n }\\n s.pop(); // pop (, but not onto the output queue\\n }\\n}\\npostfix += s.dataStore.reverse().join(\\\" \\\");\\nprint(postfix);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"function parseinfix2rpn(s)\\n outputq = []\\n opstack = []\\n infix = split(s)\\n for tok in infix\\n if all(isnumber, tok)\\n push!(outputq, tok)\\n elseif tok == \\\"(\\\"\\n push!(opstack, tok)\\n elseif tok == \\\")\\\"\\n while !isempty(opstack) && (op = pop!(opstack)) != \\\"(\\\"\\n push!(outputq, op)\\n end\\n else # operator\\n while !isempty(opstack)\\n op = pop!(opstack)\\n if Base.operator_precedence(Symbol(op)) > Base.operator_precedence(Symbol(tok)) ||\\n (Base.operator_precedence(Symbol(op)) ==\\n Base.operator_precedence(Symbol(tok)) && op != \\\"^\\\")\\n push!(outputq, op)\\n else\\n push!(opstack, op) # undo peek\\n break\\n end\\n end\\n push!(opstack, tok)\\n end\\n println(\\\"The working output stack is $outputq\\\")\\n end\\n while !isempty(opstack)\\n if (op = pop!(opstack)) == \\\"(\\\"\\n throw(\\\"mismatched parentheses\\\")\\n else\\n push!(outputq, op)\\n end\\n end\\n outputq\\nend\\n\\nteststring = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\nprintln(\\\"\\\\nResult: $teststring becomes $(join(parseinfix2rpn(teststring), ' '))\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.0\\n\\nimport java.util.Stack\\n\\n/* To find out the precedence, we take the index of the\\n token in the OPS string and divide by 2 (rounding down).\\n This will give us: 0, 0, 1, 1, 2 */\\nconst val OPS = \\\"-+/*^\\\"\\n\\nfun infixToPostfix(infix: String): String {\\n val sb = StringBuilder()\\n val s = Stack<Int>()\\n val rx = Regex(\\\"\\\"\\\"\\\\s\\\"\\\"\\\")\\n for (token in infix.split(rx)) {\\n if (token.isEmpty()) continue\\n val c = token[0]\\n val idx = OPS.indexOf(c)\\n\\n // check for operator\\n if (idx != - 1) {\\n if (s.isEmpty()) {\\n s.push(idx)\\n }\\n else {\\n while (!s.isEmpty()) {\\n val prec2 = s.peek() / 2\\n val prec1 = idx / 2\\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) {\\n sb.append(OPS[s.pop()]).append(' ')\\n }\\n else break\\n }\\n s.push(idx)\\n }\\n }\\n else if (c == '(') {\\n s.push(-2) // -2 stands for '('\\n }\\n else if (c == ')') {\\n // until '(' on stack, pop operators.\\n while (s.peek() != -2) sb.append(OPS[s.pop()]).append(' ')\\n s.pop()\\n }\\n else {\\n sb.append(token).append(' ')\\n }\\n }\\n while (!s.isEmpty()) sb.append(OPS[s.pop()]).append(' ')\\n return sb.toString()\\n}\\n\\nfun main(args: Array<String>) {\\n val es = listOf(\\n \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\",\\n \\\"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\\\"\\n )\\n for (e in es) {\\n println(\\\"Infix : $e\\\")\\n println(\\\"Postfix : ${infixToPostfix(e)}\\\\n\\\")\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"global stack$,queue$\\nstack$=\\\"\\\"\\nqueue$=\\\"\\\"\\n\\nin$ = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\nprint \\\"Input:\\\"\\nprint in$\\n\\ntoken$ = \\\"#\\\"\\nprint \\\"No\\\", \\\"token\\\", \\\"stack\\\", \\\"queue\\\"\\n\\nwhile 1\\n i=i+1\\n token$ = word$(in$, i)\\n if token$ = \\\"\\\" then i=i-1: exit while\\n print i, token$, reverse$(stack$), queue$\\n\\n select case\\n case token$ = \\\"(\\\"\\n call stack.push token$\\n\\n case token$ = \\\")\\\"\\n while stack.peek$() <> \\\"(\\\"\\n 'if stack is empty\\n if stack$=\\\"\\\" then print \\\"Error: no matching '(' for token \\\";i: end\\n call queue.push stack.pop$()\\n wend\\n discard$=stack.pop$() 'discard \\\"(\\\"\\n\\n case isOperator(token$)\\n op1$=token$\\n while(isOperator(stack.peek$()))\\n op2$=stack.peek$()\\n select case\\n case op2$<>\\\"^\\\" and precedence(op1$) = precedence(op2$)\\n '\\\"^\\\" is the only right-associative operator\\n call queue.push stack.pop$()\\n case precedence(op1$) < precedence(op2$)\\n call queue.push stack.pop$()\\n case else\\n exit while\\n end select\\n wend\\n call stack.push op1$\\n\\n case else 'number\\n 'actually, wrong operator could end up here, like say %\\n 'If the token is a number, then add it to the output queue.\\n call queue.push token$\\n end select\\n\\nwend\\n\\nwhile stack$<>\\\"\\\"\\n if stack.peek$() = \\\"(\\\" then print \\\"no matching ')'\\\": end\\n call queue.push stack.pop$()\\nwend\\n\\nprint \\\"Output:\\\"\\nwhile queue$<>\\\"\\\"\\n print queue.pop$();\\\" \\\";\\nwend\\nprint\\n\\nend\\n\\n'------------------------------------------\\nfunction isOperator(op$)\\n isOperator = instr(\\\"+-*/^\\\", op$)<>0 AND len(op$)=1\\nend function\\n\\nfunction precedence(op$)\\n if isOperator(op$) then\\n precedence = 1 _\\n + (instr(\\\"+-*/^\\\", op$)<>0) _\\n + (instr(\\\"*/^\\\", op$)<>0) _\\n + (instr(\\\"^\\\", op$)<>0)\\n end if\\nend function\\n\\n'------------------------------------------\\nsub stack.push s$\\n stack$=s$+\\\"|\\\"+stack$\\nend sub\\n\\nsub queue.push s$\\n queue$=queue$+s$+\\\"|\\\"\\nend sub\\n\\nfunction queue.pop$()\\n 'it does return empty on empty stack or queue\\n queue.pop$=word$(queue$,1,\\\"|\\\")\\n queue$=mid$(queue$,instr(queue$,\\\"|\\\")+1)\\nend function\\n\\nfunction stack.pop$()\\n 'it does return empty on empty stack or queue\\n stack.pop$=word$(stack$,1,\\\"|\\\")\\n stack$=mid$(stack$,instr(stack$,\\\"|\\\")+1)\\nend function\\n\\nfunction stack.peek$()\\n 'it does return empty on empty stack or queue\\n stack.peek$=word$(stack$,1,\\\"|\\\")\\nend function\\n\\nfunction reverse$(s$)\\n reverse$ = \\\"\\\"\\n token$=\\\"#\\\"\\n while token$<>\\\"\\\"\\n i=i+1\\n token$=word$(s$,i,\\\"|\\\")\\n reverse$ = token$;\\\" \\\";reverse$\\n wend\\nend function\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"-- Lua 5.3.5\\n-- Retrieved from: https://devforum.roblox.com/t/more-efficient-way-to-implement-shunting-yard/1328711\\n-- Modified slightly to ensure conformity with other code snippets posted here\\nlocal OPERATOR_PRECEDENCE = {\\n -- [operator] = { [precedence], [is left assoc.] }\\n ['-'] = { 2, true };\\n ['+'] = { 2, true };\\n ['/'] = { 3, true };\\n ['*'] = { 3, true };\\n ['^'] = { 4, false };\\n}\\n\\nlocal function shuntingYard(expression)\\n local outputQueue = { }\\n local operatorStack = { }\\n\\n local number, operator, parenthesis, fcall\\n\\n while #expression > 0 do\\n local nStartPos, nEndPos = string.find(expression, '(%-?%d+%.?%d*)')\\n\\n if nStartPos == 1 and nEndPos > 0 then\\n number, expression = string.sub(expression, nStartPos, nEndPos), string.sub(expression, nEndPos + 1)\\n table.insert(outputQueue, tonumber(number))\\n\\n print('token:', number)\\n print('queue:', unpack(outputQueue))\\n print('stack:', unpack(operatorStack))\\n else\\n local oStartPos, oEndPos = string.find(expression, '([%-%+%*/%^])')\\n\\n if oStartPos == 1 and oEndPos > 0 then\\n operator, expression = string.sub(expression, oStartPos, oEndPos), string.sub(expression, oEndPos + 1)\\n\\n if #operatorStack > 0 then\\n while operatorStack[1] ~= '(' do\\n local operator1Precedence = OPERATOR_PRECEDENCE[operator]\\n local operator2Precedence = OPERATOR_PRECEDENCE[operatorStack[1]]\\n\\n if operator2Precedence and ((operator2Precedence[1] > operator1Precedence[1]) or (operator2Precedence[1] == operator1Precedence[1] and operator1Precedence[2])) then\\n table.insert(outputQueue, table.remove(operatorStack, 1))\\n else\\n break\\n end\\n end\\n end\\n\\n table.insert(operatorStack, 1, operator)\\n\\n print('token:', operator)\\n print('queue:', unpack(outputQueue))\\n print('stack:', unpack(operatorStack))\\n else\\n local pStartPos, pEndPos = string.find(expression, '[%(%)]')\\n\\n if pStartPos == 1 and pEndPos > 0 then\\n parenthesis, expression = string.sub(expression, pStartPos, pEndPos), string.sub(expression, pEndPos + 1)\\n\\n if parenthesis == ')' then\\n while operatorStack[1] ~= '(' do\\n assert(#operatorStack > 0)\\n table.insert(outputQueue, table.remove(operatorStack, 1))\\n end\\n\\n assert(operatorStack[1] == '(')\\n table.remove(operatorStack, 1)\\n else\\n table.insert(operatorStack, 1, parenthesis)\\n end\\n\\n print('token:', parenthesis)\\n print('queue:', unpack(outputQueue))\\n print('stack:', unpack(operatorStack))\\n else\\n local wStartPos, wEndPos = string.find(expression, '%s+')\\n\\n if wStartPos == 1 and wEndPos > 0 then\\n expression = string.sub(expression, wEndPos + 1)\\n else\\n error('Invalid character set: '.. expression)\\n end\\n end\\n end\\n end\\n end\\n\\n while #operatorStack > 0 do\\n assert(operatorStack[1] ~= '(')\\n table.insert(outputQueue, table.remove(operatorStack, 1))\\n end\\n\\n return table.concat(outputQueue, ' ')\\nend\\n\\n\\nlocal goodmath = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\\n\\nprint('infix:', goodmath)\\nprint('postfix:', shuntingYard(goodmath))\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"rpn[str_] :=\\n StringRiffle[\\n ToString /@\\n Module[{in = StringSplit[str], stack = {}, out = {}, next},\\n While[in != {}, next = in[[1]]; in = in[[2 ;;]];\\n Which[DigitQ[next], AppendTo[out, next], LetterQ[next],\\n AppendTo[stack, next], next == \\\",\\\",\\n While[stack[[-1]] != \\\"(\\\", AppendTo[out, stack[[-1]]];\\n stack = stack[[;; -2]]], next == \\\"^\\\", AppendTo[stack, \\\"^\\\"],\\n next == \\\"*\\\",\\n While[stack != {} && MatchQ[stack[[-1]], \\\"^\\\" | \\\"*\\\" | \\\"/\\\"],\\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\\n AppendTo[stack, \\\"*\\\"], next == \\\"/\\\",\\n While[stack != {} && MatchQ[stack[[-1]], \\\"^\\\" | \\\"*\\\" | \\\"/\\\"],\\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\\n AppendTo[stack, \\\"/\\\"], next == \\\"+\\\",\\n While[stack != {} &&\\n MatchQ[stack[[-1]], \\\"^\\\" | \\\"*\\\" | \\\"/\\\" | \\\"+\\\" | \\\"-\\\"],\\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\\n AppendTo[stack, \\\"+\\\"], next == \\\"-\\\",\\n While[stack != {} &&\\n MatchQ[stack[[-1]], \\\"^\\\" | \\\"*\\\" | \\\"/\\\" | \\\"+\\\" | \\\"-\\\"],\\n AppendTo[out, stack[[-1]]]; stack = stack[[;; -2]]];\\n AppendTo[stack, \\\"-\\\"], next == \\\"(\\\", AppendTo[stack, \\\"(\\\"],\\n next == \\\")\\\",\\n While[stack[[-1]] =!= \\\"(\\\", AppendTo[out, stack[[-1]]];\\n stack = stack[[;; -2]]]; stack = stack[[;; -2]];\\n If[StringQ[stack[[-1]]], AppendTo[out, stack[[-1]]];\\n stack = stack[[;; -2]]]]];\\n While[stack != {}, AppendTo[out, stack[[-1]]];\\n stack = stack[[;; -2]]]; out]];\\nPrint[rpn[\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"]];\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import tables, strutils, strformat\\n\\ntype operator = tuple[prec:int, rassoc:bool]\\n\\nlet ops = newTable[string, operator](\\n [ (\\\"^\\\", (4, true )),\\n (\\\"*\\\", (3, false)),\\n (\\\"/\\\", (3, false)),\\n (\\\"+\\\", (2, false)),\\n (\\\"-\\\", (2, false)) ])\\n\\nproc shuntRPN(tokens:seq[string]): string =\\n var stack: seq[string]\\n var op:string\\n\\n for token in tokens:\\n case token\\n of \\\"(\\\": stack.add token\\n of \\\")\\\":\\n while stack.len > 0:\\n op = stack.pop()\\n if op == \\\"(\\\": break\\n result &= op & \\\" \\\"\\n else:\\n if token in ops:\\n while stack.len > 0:\\n op = stack[^1] # peek stack top\\n if not (op in ops): break\\n if ops[token].prec > ops[op].prec or (ops[token].rassoc and (ops[token].prec == ops[op].prec)):\\n break\\n discard stack.pop()\\n result &= op & \\\" \\\"\\n stack.add token\\n else:\\n result &= token & \\\" \\\"\\n echo fmt\\\"\\\"\\\"{token:5} {join(stack,\\\" \\\"):18} {result:25} \\\"\\\"\\\"\\n\\n while stack.len > 0:\\n result &= stack.pop() & \\\" \\\"\\n echo fmt\\\"\\\"\\\" {join(stack,\\\" \\\"):18} {result:25} \\\"\\\"\\\"\\n\\nlet input = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n\\necho &\\\"for infix expression: '{input}' \\\\n\\\", \\\"\\\\nTOKEN OP STACK RPN OUTPUT\\\"\\necho \\\"postfix: \\\", shuntRPN(input.strip.split)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"type associativity = Left | Right;;\\n\\n\\nlet prec op =\\n match op with\\n | \\\"^\\\" -> 4\\n | \\\"*\\\" -> 3\\n | \\\"/\\\" -> 3\\n | \\\"+\\\" -> 2\\n | \\\"-\\\" -> 2\\n | _ -> -1;;\\n\\n\\nlet assoc op =\\n match op with\\n | \\\"^\\\" -> Right\\n | _ -> Left;;\\n\\n\\nlet split_while p =\\n let rec go ls xs =\\n match xs with\\n | x::xs' when p x -> go (x::ls) xs'\\n | _ -> List.rev ls, xs\\n in go [];;\\n\\n\\nlet rec intercalate sep xs =\\n match xs with\\n | [] -> \\\"\\\"\\n | [x] -> x\\n | x::xs' -> x ^ sep ^ intercalate sep xs';;\\n\\n\\nlet shunting_yard =\\n let rec pusher stack queue tkns =\\n match tkns with\\n | [] -> List.rev queue @ stack\\n | \\\"(\\\"::tkns' -> pusher (\\\"(\\\"::stack) queue tkns'\\n | \\\")\\\"::tkns' ->\\n let mv, \\\"(\\\"::stack' = split_while ((<>) \\\"(\\\") stack in\\n pusher stack' (mv @ queue) tkns'\\n | t::tkns' when prec t < 0 -> pusher stack (t::queue) tkns'\\n | op::tkns' ->\\n let mv_to_queue op2 =\\n (match assoc op with\\n | Left -> prec op <= prec op2\\n | Right -> prec op < prec op2)\\n in\\n let mv, stack' = split_while mv_to_queue stack in\\n pusher (op::stack') (mv @ queue) tkns'\\n in pusher [] [];;\\n\\n\\nlet () =\\n let inp = read_line () in\\n let tkns = String.split_on_char ' ' inp in\\n let postfix = shunting_yard tkns in\\n print_endline (intercalate \\\" \\\" postfix);;\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"my %prec = (\\n '^' => 4,\\n '*' => 3,\\n '/' => 3,\\n '+' => 2,\\n '-' => 2,\\n '(' => 1\\n);\\n\\nmy %assoc = (\\n '^' => 'right',\\n '*' => 'left',\\n '/' => 'left',\\n '+' => 'left',\\n '-' => 'left'\\n);\\n\\nsub shunting_yard {\\n my @inp = split ' ', $_[0];\\n my @ops;\\n my @res;\\n\\n my $report = sub { printf \\\"%25s %-7s %10s %s\\\\n\\\", \\\"@res\\\", \\\"@ops\\\", $_[0], \\\"@inp\\\" };\\n my $shift = sub { $report->(\\\"shift @_\\\"); push @ops, @_ };\\n my $reduce = sub { $report->(\\\"reduce @_\\\"); push @res, @_ };\\n\\n while (@inp) {\\n my $token = shift @inp;\\n if ( $token =~ /\\\\d/ ) { $reduce->($token) }\\n elsif ( $token eq '(' ) { $shift->($token) }\\n elsif ( $token eq ')' ) {\\n while ( @ops and \\\"(\\\" ne ( my $x = pop @ops ) ) { $reduce->($x) }\\n } else {\\n my $newprec = $prec{$token};\\n while (@ops) {\\n my $oldprec = $prec{ $ops[-1] };\\n last if $newprec > $oldprec;\\n last if $newprec == $oldprec and $assoc{$token} eq 'right';\\n $reduce->( pop @ops );\\n }\\n $shift->($token);\\n }\\n }\\n $reduce->( pop @ops ) while @ops;\\n @res;\\n}\\n\\nlocal $, = \\\" \\\";\\nprint shunting_yard '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">operators</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"^\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"*\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"/\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"-\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">precedence</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">infix</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rpn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">stack_top</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">ops</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">substitute_all</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">infix</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #008000;\\\">\\\"(\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\")\\\"</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\" ( \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" ) \\\"</span><span style=\\\"color: #0000FF;\\\">}),</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Infix input: %-32s%s\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">infix</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">show_workings</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">op</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ops</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"(\\\"</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\")\\\"</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">stack_top</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[$]</span>\\n <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">stack_top</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"(\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">stack_top</span>\\n <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" \\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">operators</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">prec</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">precedence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">stack_top</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[$]</span>\\n <span style=\\\"color: #000000;\\\">k</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack_top</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">operators</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">prec</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">precedence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">prec</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">precedence</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">stack_top</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">stack_top</span>\\n <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" \\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #000000;\\\">stack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">op</span>\\n <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" \\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">?{</span><span style=\\\"color: #000000;\\\">op</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">op</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">stack</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">sep</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #000000;\\\">op</span>\\n <span style=\\\"color: #000000;\\\">sep</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" \\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"result: %-22s [%s]\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">rpn</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"ok\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"**ERROR**\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 + 4 * 2 / (1 - 5) ^ 2 ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">show_workings</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"((1 + 2) ^ (3 + 4)) ^ (5 + 6)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + ^ 5 6 + ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(1 + 2) ^ (3 + 4) ^ (5 + 6)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + 5 6 + ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"((3 ^ 4) ^ 2 ^ 9) ^ 2 ^ 5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 4 ^ 2 9 ^ ^ 2 5 ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(1 + 4) * (5 + 3) * 2 * 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 4 + 5 3 + * 2 * 3 *\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 * 2 * 3 * 4\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 * 3 * 4 *\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 + 2 + 3 + 4\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 + 4 +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(1 + 2) ^ (3 + 4)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 4 + ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(5 ^ 6) ^ 7\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 6 ^ 7 ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 ^ 4 ^ 3 ^ 2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 4 3 2 ^ ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 + 2 + 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 + 3 +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 ^ 2 ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 3 ^ ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(1 ^ 2) ^ 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 ^ 3 ^\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 - 1 + 3\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 1 - 3 +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 + 1 - 1\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 1 + 1 -\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1 - (2 + 3)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"1 2 3 + -\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 + 3 + 2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 3 + 2 +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 + 4 + 3 + 2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 4 + 3 + 2 +\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 * 4 * 3 * 2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 4 * 3 * 2 *\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"5 + 4 - (3 + 2)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"5 4 + 3 2 + -\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 - 4 * 5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 4 5 * -\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"3 * (4 - 5)\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 4 5 - *\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"(3 - 4) * 5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"3 4 - 5 *\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 * 2 + 1 - 5\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 2 * 1 + 5 -\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">shunting_yard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"4 * 2 / (1 - 5) ^ 2\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"4 2 * 1 5 - 2 ^ /\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(de operator (Op)\\n (member Op '(\\\"\\\\^\\\" \\\"*\\\" \\\"/\\\" \\\"+\\\" \\\"-\\\")) )\\n\\n(de leftAssoc (Op)\\n (member Op '(\\\"*\\\" \\\"/\\\" \\\"+\\\" \\\"-\\\")) )\\n\\n(de precedence (Op)\\n (case Op\\n (\\\"\\\\^\\\" 4)\\n ((\\\"*\\\" \\\"/\\\") 3)\\n ((\\\"+\\\" \\\"-\\\") 2) ) )\\n\\n(de shuntingYard (Str)\\n (make\\n (let (Fmt (-7 -30 -4) Stack)\\n (tab Fmt \\\"Token\\\" \\\"Output\\\" \\\"Stack\\\")\\n (for Token (str Str \\\"_\\\")\\n (cond\\n ((num? Token) (link @))\\n ((= \\\"(\\\" Token) (push 'Stack Token))\\n ((= \\\")\\\" Token)\\n (until (= \\\"(\\\" (car Stack))\\n (unless Stack\\n (quit \\\"Unbalanced Stack\\\") )\\n (link (pop 'Stack)) )\\n (pop 'Stack) )\\n (T\\n (while\\n (and\\n (operator (car Stack))\\n ((if (leftAssoc (car Stack)) <= <)\\n (precedence Token)\\n (precedence (car Stack)) ) )\\n (link (pop 'Stack)) )\\n (push 'Stack Token) ) )\\n (tab Fmt Token (glue \\\" \\\" (made)) Stack) )\\n (while Stack\\n (when (= \\\"(\\\" (car Stack))\\n (quit \\\"Unbalanced Stack\\\") )\\n (link (pop 'Stack))\\n (tab Fmt NIL (glue \\\" \\\" (made)) Stack) ) ) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \": (shuntingYard \\\"3 + 4 * 2 / (1 - 5) \\\\^ 2 \\\\^ 3\\\")\\nToken Output Stack\\n3 3\\n+ 3 +\\n4 3 4 +\\n* 3 4 *+\\n2 3 4 2 *+\\n/ 3 4 2 * /+\\n( 3 4 2 * (/+\\n1 3 4 2 * 1 (/+\\n- 3 4 2 * 1 -(/+\\n5 3 4 2 * 1 5 -(/+\\n) 3 4 2 * 1 5 - /+\\n^ 3 4 2 * 1 5 - ^/+\\n2 3 4 2 * 1 5 - 2 ^/+\\n^ 3 4 2 * 1 5 - 2 ^^/+\\n3 3 4 2 * 1 5 - 2 3 ^^/+\\n 3 4 2 * 1 5 - 2 3 ^ ^/+\\n 3 4 2 * 1 5 - 2 3 ^ ^ /+\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n-> (3 4 2 \\\"*\\\" 1 5 \\\"-\\\" 2 3 \\\"\\\\^\\\" \\\"\\\\^\\\" \\\"/\\\" \\\"+\\\")\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"cvt: procedure options (main); /* 15 January 2012. */\\n declare (in, stack, out) character (100) varying;\\n declare (ch, chs) character (1);\\n declare display bit (1) static initial ('0'b);\\n\\n in = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\\n\\n in = '(' || in || ' ) '; /* Initialize with parentheses */\\n\\n put skip edit ('INPUT', 'STACK', 'OUTPUT') (a, col(37), a, col(47), a);\\n\\n stack = ' '; out = ''; /* Initialize */\\n do while (length (in) > 0);\\n ch = substr(in, 1, 1);\\n select (ch);\\n when (' ') ;\\n\\n when ('+', '-', '*', '/', '^')\\n do;\\n /* Copy any equal or higher-priority operators from the stack */\\n /* to the output string */\\n chs = substr(stack, 1, 1);\\n do while ((spriority(chs) >= priority(ch)) & ( chs ^= ')' ) );\\n if display then put skip list ('unstacking: ' || chs);\\n out = out || ' ' || chs;\\n stack = substr(stack, 2);\\n chs = substr(stack, 1, 1);\\n end;\\n /* Now copy the input to the TOS. */\\n if display then put skip list ('copying ' || ch || ' to TOS');\\n stack = ch || stack;\\n end;\\n when ( '(' )\\n do;\\n stack = '(' || stack;\\n if display then put skip list ('stacking the (' );\\n end;\\n when ( ')' )\\n do; /* copy all operators from the stack to the output, */\\n /* until a '(' is encountered. */\\n chs = substr(stack, 1, 1);\\n do while (chs ^= '(' );\\n if display then put skip list ('copying stack ' || chs || ' to output');\\n put skip edit (stack, out) (col(37), a, col(47), a);\\n out = out || ' ' || chs;\\n stack = substr(stack, 2);\\n chs = substr(stack, 1, 1);\\n end;\\n /* Now delete the '(' from the input and */\\n /* the ')' from the top of the stack. */\\n if display then put skip edit ('Deleting ( from TOS') (col(30), a);\\n stack = substr(stack, 2);\\n /* The '(' on the input is removed at the end of the loop. */\\n end;\\n otherwise /* it's an operand. */\\n do;\\n out = out || ' ';\\n do while (ch ^= ' ');\\n if display then put skip list ('copying ' || ch || ' to output');\\n out = out || ch;\\n in = substr(in, 2);\\n ch = substr(in, 1, 1);\\n end;\\n end;\\n end;\\n in = substr(in, 2); /* Remove one character from the input */\\n put skip edit (in, stack, out) (a, col(37), a, col(47), a);\\n end;\\n\\npriority: procedure (ch) returns (character(1));\\n declare ch character (1);\\n\\n return ( translate(ch, '1122335', '()+-*/^' ) );\\nend priority;\\n\\nspriority: procedure (ch) returns (character(1));\\n declare ch character (1);\\n\\n return ( translate(ch, '1122334', '()+-*/^' ) );\\nend spriority;\\n\\nend cvt;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"INPUT STACK OUTPUT\\n3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) (\\n+ 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) ( 3\\n 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3\\n4 * 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3\\n* 2 / ( 1 - 5 ) ^ 2 ^ 3 ) +( 3 4\\n 2 / ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4\\n2 / ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4\\n/ ( 1 - 5 ) ^ 2 ^ 3 ) *+( 3 4 2\\n ( 1 - 5 ) ^ 2 ^ 3 ) /+( 3 4 2 *\\n( 1 - 5 ) ^ 2 ^ 3 ) /+( 3 4 2 *\\n 1 - 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 *\\n1 - 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 *\\n- 5 ) ^ 2 ^ 3 ) (/+( 3 4 2 * 1\\n 5 ) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1\\n5 ) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1\\n) ^ 2 ^ 3 ) -(/+( 3 4 2 * 1 5\\n -(/+( 3 4 2 * 1 5\\n ^ 2 ^ 3 ) /+( 3 4 2 * 1 5 -\\n^ 2 ^ 3 ) /+( 3 4 2 * 1 5 -\\n 2 ^ 3 ) ^/+( 3 4 2 * 1 5 -\\n2 ^ 3 ) ^/+( 3 4 2 * 1 5 -\\n^ 3 ) ^/+( 3 4 2 * 1 5 - 2\\n 3 ) ^^/+( 3 4 2 * 1 5 - 2\\n3 ) ^^/+( 3 4 2 * 1 5 - 2\\n) ^^/+( 3 4 2 * 1 5 - 2 3\\n ^^/+( 3 4 2 * 1 5 - 2 3\\n ^/+( 3 4 2 * 1 5 - 2 3 ^\\n /+( 3 4 2 * 1 5 - 2 3 ^ ^\\n +( 3 4 2 * 1 5 - 2 3 ^ ^ /\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n 3 4 2 * 1 5 - 2 3 ^ ^ / +\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"from collections import namedtuple\\nfrom pprint import pprint as pp\\n\\nOpInfo = namedtuple('OpInfo', 'prec assoc')\\nL, R = 'Left Right'.split()\\n\\nops = {\\n '^': OpInfo(prec=4, assoc=R),\\n '*': OpInfo(prec=3, assoc=L),\\n '/': OpInfo(prec=3, assoc=L),\\n '+': OpInfo(prec=2, assoc=L),\\n '-': OpInfo(prec=2, assoc=L),\\n '(': OpInfo(prec=9, assoc=L),\\n ')': OpInfo(prec=0, assoc=L),\\n }\\n\\nNUM, LPAREN, RPAREN = 'NUMBER ( )'.split()\\n\\n\\ndef get_input(inp = None):\\n 'Inputs an expression and returns list of (TOKENTYPE, tokenvalue)'\\n\\n if inp is None:\\n inp = input('expression: ')\\n tokens = inp.strip().split()\\n tokenvals = []\\n for token in tokens:\\n if token in ops:\\n tokenvals.append((token, ops[token]))\\n #elif token in (LPAREN, RPAREN):\\n # tokenvals.append((token, token))\\n else:\\n tokenvals.append((NUM, token))\\n return tokenvals\\n\\ndef shunting(tokenvals):\\n outq, stack = [], []\\n table = ['TOKEN,ACTION,RPN OUTPUT,OP STACK,NOTES'.split(',')]\\n for token, val in tokenvals:\\n note = action = ''\\n if token is NUM:\\n action = 'Add number to output'\\n outq.append(val)\\n table.append( (val, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\\n elif token in ops:\\n t1, (p1, a1) = token, val\\n v = t1\\n note = 'Pop ops from stack to output'\\n while stack:\\n t2, (p2, a2) = stack[-1]\\n if (a1 == L and p1 <= p2) or (a1 == R and p1 < p2):\\n if t1 != RPAREN:\\n if t2 != LPAREN:\\n stack.pop()\\n action = '(Pop op)'\\n outq.append(t2)\\n else:\\n break\\n else:\\n if t2 != LPAREN:\\n stack.pop()\\n action = '(Pop op)'\\n outq.append(t2)\\n else:\\n stack.pop()\\n action = '(Pop & discard \\\"(\\\")'\\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\\n break\\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\\n v = note = ''\\n else:\\n note = ''\\n break\\n note = ''\\n note = ''\\n if t1 != RPAREN:\\n stack.append((token, val))\\n action = 'Push op token to stack'\\n else:\\n action = 'Discard \\\")\\\"'\\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\\n note = 'Drain stack to output'\\n while stack:\\n v = ''\\n t2, (p2, a2) = stack[-1]\\n action = '(Pop op)'\\n stack.pop()\\n outq.append(t2)\\n table.append( (v, action, ' '.join(outq), ' '.join(s[0] for s in stack), note) )\\n v = note = ''\\n return table\\n\\nif __name__ == '__main__':\\n infix = '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3'\\n print( 'For infix expression: %r\\\\n' % infix )\\n rp = shunting(get_input(infix))\\n maxcolwidths = [len(max(x, key=len)) for x in zip(*rp)]\\n row = rp[0]\\n print( ' '.join('{cell:^{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\\n for row in rp[1:]:\\n print( ' '.join('{cell:<{width}}'.format(width=width, cell=cell) for (width, cell) in zip(maxcolwidths, row)))\\n\\n print('\\\\n The final output RPN is: %r' % rp[-1][2])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n;print column of width w\\n(define (display-col w s)\\n (let* ([n-spaces (- w (string-length s))]\\n [spaces (make-string n-spaces #\\\\space)])\\n (display (string-append s spaces))))\\n;print columns given widths (idea borrowed from PicoLisp)\\n(define (tab ws . ss) (for-each display-col ws ss) (newline))\\n\\n(define input \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\")\\n\\n(define (paren? s) (or (string=? s \\\"(\\\") (string=? s \\\")\\\")))\\n(define-values (prec lasso? rasso? op?)\\n (let ([table '([\\\"^\\\" 4 r]\\n [\\\"*\\\" 3 l]\\n [\\\"/\\\" 3 l]\\n [\\\"+\\\" 2 l]\\n [\\\"-\\\" 2 l])])\\n (define (asso x) (caddr (assoc x table)))\\n (values (λ (x) (cadr (assoc x table)))\\n (λ (x) (symbol=? (asso x) 'l))\\n (λ (x) (symbol=? (asso x) 'r))\\n (λ (x) (member x (map car table))))))\\n\\n(define (shunt s)\\n (define widths (list 8 (string-length input) (string-length input) 20))\\n (tab widths \\\"TOKEN\\\" \\\"OUT\\\" \\\"STACK\\\" \\\"ACTION\\\")\\n (let shunt ([out '()] [ops '()] [in (string-split s)] [action \\\"\\\"])\\n (match in\\n ['() (if (memf paren? ops)\\n (error \\\"unmatched parens\\\")\\n (reverse (append (reverse ops) out)))]\\n [(cons x in)\\n (tab widths x (string-join (reverse out) \\\" \\\") (string-append* ops) action)\\n (match x\\n [(? string->number n) (shunt (cons n out) ops in (format \\\"out ~a\\\" n))]\\n [\\\"(\\\" (shunt out (cons \\\"(\\\" ops) in \\\"push (\\\")]\\n [\\\")\\\" (let-values ([(l r) (splitf-at ops (λ (y) (not (string=? y \\\"(\\\"))))])\\n (match r\\n ['() (error \\\"unmatched parens\\\")]\\n [(cons _ r) (shunt (append (reverse l) out) r in \\\"clear til )\\\")]))]\\n [else (let-values ([(l r) (splitf-at ops (λ (y) (and (op? y)\\n ((if (lasso? x) <= <) (prec x) (prec y)))))])\\n (shunt (append (reverse l) out) (cons x r) in (format \\\"out ~a, push ~a\\\" l x)))])])))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \" my %prec =\\n '^' => 4,\\n '*' => 3,\\n '/' => 3,\\n '+' => 2,\\n '-' => 2,\\n '(' => 1;\\n\\nmy %assoc =\\n '^' => 'right',\\n '*' => 'left',\\n '/' => 'left',\\n '+' => 'left',\\n '-' => 'left';\\n\\nsub shunting-yard ($prog) {\\n my @inp = $prog.words;\\n my @ops;\\n my @res;\\n\\n sub report($op) { printf \\\"%25s %-7s %10s %s\\\\n\\\", ~@res, ~@ops, $op, ~@inp }\\n sub shift($t) { report( \\\"shift $t\\\"); @ops.push: $t }\\n sub reduce($t) { report(\\\"reduce $t\\\"); @res.push: $t }\\n\\n while @inp {\\n given @inp.shift {\\n when /\\\\d/ { reduce $_ };\\n when '(' { shift $_ }\\n when ')' { while @ops and (my $x = @ops.pop and $x ne '(') { reduce $x } }\\n default {\\n my $newprec = %prec{$_};\\n while @ops {\\n my $oldprec = %prec{@ops[*-1]};\\n last if $newprec > $oldprec;\\n last if $newprec == $oldprec and %assoc{$_} eq 'right';\\n reduce @ops.pop;\\n }\\n shift $_;\\n }\\n }\\n }\\n reduce @ops.pop while @ops;\\n @res;\\n}\\n\\nsay shunting-yard '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3';\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX pgm converts infix arith. expressions to Reverse Polish notation (shunting─yard).*/\\nparse arg x /*obtain optional argument from the CL.*/\\nif x='' then x= '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3' /*Not specified? Then use the default.*/\\nox=x\\nx='(' space(x) \\\") \\\" /*force stacking for the expression. */\\n#=words(x) /*get number of tokens in expression. */\\n do i=1 for #; @.i=word(x, i) /*assign the input tokens to an array. */\\n end /*i*/\\ntell=1 /*set to 0 if working steps not wanted.*/\\nL=max( 20, length(x) ) /*use twenty for the minimum show width*/\\n\\nsay 'token' center(\\\"input\\\" , L, '─') center(\\\"stack\\\" , L%2, '─'),\\n center(\\\"output\\\", L, '─') center(\\\"action\\\", L, '─')\\nop= \\\")(-+/*^\\\"; Rop=substr(op,3); p.=; n=length(op); RPN= /*some handy-dandy vars.*/\\ns.=\\n do i=1 for n; _=substr(op,i,1); s._=(i+1)%2; p._=s._+(i==n); end /*i*/\\n$= /* [↑] assign the operator priorities.*/\\n do k=1 for #; ?=@.k /*process each token from the @. list.*/\\n select /*@.k is: (, operator, ), operand*/\\n when ?=='(' then do; $=\\\"(\\\" $; call show 'moving' ? \\\"──► stack\\\"; end\\n when isOp(?) then do; !=word($, 1) /*get token from stack*/\\n do while ! \\\\==')' & s.!>=p.?\\n RPN=RPN ! /*add token to RPN.*/\\n $=subword($, 2) /*del token from stack*/\\n call show 'unstacking:' !\\n !=word($, 1) /*get token from stack*/\\n end /*while*/\\n $=? $ /*add token to stack*/\\n call show 'moving' ? \\\"──► stack\\\"\\n end\\n when ?==')' then do; !=word($, 1) /*get token from stack*/\\n do while !\\\\=='('; RPN=RPN ! /*add token to RPN. */\\n $=subword($, 2) /*del token from stack*/\\n != word($, 1) /*get token from stack*/\\n call show 'moving stack' ! \\\"──► RPN\\\"\\n end /*while*/\\n $=subword($, 2) /*del token from stack*/\\n call show 'deleting ( from the stack'\\n end\\n otherwise RPN=RPN ? /*add operand to RPN. */\\n call show 'moving' ? \\\"──► RPN\\\"\\n end /*select*/\\n end /*k*/\\nsay\\nRPN=space(RPN $) /*elide any superfluous blanks in RPN. */\\nsay ' input:' ox; say \\\" RPN──►\\\" RPN /*display the input and the RPN. */\\nparse source upper . y . /*invoked via the C.L. or REXX pgm? */\\nif y=='COMMAND' then exit /*stick a fork in it, we're all done. */\\n else return RPN /*return RPN to invoker (the RESULT). */\\n/*──────────────────────────────────────────────────────────────────────────────────────────*/\\nisOp: return pos(arg(1),rOp) \\\\== 0 /*is the first argument a \\\"real\\\" operator? */\\nshow: if tell then say center(?,5) left(subword(x,k),L) left($,L%2) left(RPN,L) arg(1); return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX pgm converts infix arith. expressions to Reverse Polish notation (shunting─yard).*/\\nparse arg x /*obtain optional argument from the CL.*/\\nif x='' then x= '3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3' /*Not specified? Then use the default.*/\\ng=0 /* G is a counter of ( and ) */\\n do p=1 for words(x); _=word(x,p) /*catches unbalanced ( ) and ) ( */\\n if _=='(' then g=g+1\\n else if _==')' then do; g=g-1; if g<0 then g=-1e8; end\\n end /*p*/\\nox=x\\nx='(' space(x) \\\") \\\" /*force stacking for the expression. */\\n#=words(x) /*get number of tokens in expression. */\\ngood= (g==0) /*indicate expression is good or bad.*/\\n do i=1 for #; @.i=word(x, i) /*assign the input tokens to an array. */\\n end /*i*/\\ntell=1 /*set to 0 if working steps not wanted.*/\\nL=max( 20, length(x) ) /*use twenty for the minimum show width*/\\nif good then say 'token' center(\\\"input\\\" , L, '─') center(\\\"stack\\\" , L%2, '─'),\\n center(\\\"output\\\", L, '─') center(\\\"action\\\", L, '─')\\nop= \\\")(-+/*^\\\"; Rop=substr(op,3); p.=; n=length(op); RPN= /*some handy-dandy vars.*/\\ns.=\\n do i=1 for n; _=substr(op,i,1); s._=(i+1)%2; p._=s._+(i==n); end /*i*/\\n$= /* [↑] assign the operator priorities.*/\\n do k=1 for #*good; ?=@.k /*process each token from the @. list.*/\\n select /*@.k is: ( operator ) operand.*/\\n when ?=='(' then do; $=\\\"(\\\" $; call show 'moving' ? \\\"──► stack\\\"; end\\n when isOp(?) then do; !=word($, 1) /*get token from stack*/\\n do while ! \\\\==')' & s.!>=p.?\\n RPN=RPN ! /*add token to RPN.*/\\n $=subword($, 2) /*del token from stack*/\\n call show 'unstacking:' !\\n !=word($, 1) /*get token from stack*/\\n end /*while*/\\n $=? $ /*add token to stack*/\\n call show 'moving' ? \\\"──► stack\\\"\\n end\\n when ?==')' then do; !=word($, 1) /*get token from stack*/\\n do while !\\\\=='('; RPN=RPN ! /*add token to RPN.*/\\n $=subword($, 2) /*del token from stack*/\\n != word($, 1) /*get token from stack*/\\n call show 'moving stack' ! \\\"──► RPN\\\"\\n end /*while*/\\n $=subword($, 2) /*del token from stack*/\\n call show 'deleting ( from the stack'\\n end\\n otherwise RPN=RPN ? /*add operand to RPN.*/\\n call show 'moving' ? \\\"──► RPN\\\"\\n end /*select*/\\n end /*k*/\\nsay\\nRPN=space(RPN $); if \\\\good then RPN= '─────── error in expression ───────' /*error? */\\nsay ' input:' ox; say \\\" RPN──►\\\" RPN /*display the input and the RPN. */\\nparse source upper . y . /*invoked via the C.L. or REXX pgm? */\\nif y=='COMMAND' then exit /*stick a fork in it, we're all done. */\\n else return RPN /*return RPN to invoker (the RESULT). */\\n/*──────────────────────────────────────────────────────────────────────────────────────────*/\\nisOp: return pos(arg(1), Rop) \\\\== 0 /*is the first argument a \\\"real\\\" operator? */\\nshow: if tell then say center(?,5) left(subword(x,k),L) left($,L%2) left(RPN,L) arg(1); return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"rpn = RPNExpression.from_infix(\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\")\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"type Number = f64;\\n\\n#[derive(Debug, Copy, Clone, PartialEq)]\\nstruct Operator {\\n token: char,\\n operation: fn(Number, Number) -> Number,\\n precedence: u8,\\n is_left_associative: bool,\\n}\\n\\n#[derive(Debug, Clone, PartialEq)]\\nenum Token {\\n Digit(Number),\\n Operator(Operator),\\n LeftParen,\\n RightParen,\\n}\\n\\nimpl Operator {\\n fn new_token(\\n token: char,\\n precedence: u8,\\n is_left_associative: bool,\\n operation: fn(Number, Number) -> Number,\\n ) -> Token {\\n Token::Operator(Operator {\\n token: token,\\n operation: operation,\\n precedence: precedence,\\n is_left_associative,\\n })\\n }\\n\\n fn apply(&self, x: Number, y: Number) -> Number {\\n (self.operation)(x, y)\\n }\\n}\\n\\ntrait Stack<T> {\\n fn top(&self) -> Option<T>;\\n}\\n\\nimpl<T: Clone> Stack<T> for Vec<T> {\\n fn top(&self) -> Option<T> {\\n if self.is_empty() {\\n return None;\\n }\\n self.last().cloned()\\n }\\n}\\nfn lex_token(input: char) -> Result<Token, char> {\\n let ret = match input {\\n '0'...'9' => Token::Digit(input.to_digit(10).unwrap() as Number),\\n '+' => Operator::new_token('+', 1, true, |x, y| x + y),\\n '-' => Operator::new_token('-', 1, true, |x, y| x - y),\\n '*' => Operator::new_token('*', 2, true, |x, y| x * y),\\n '/' => Operator::new_token('/', 2, true, |x, y| x / y),\\n '^' => Operator::new_token('^', 3, false, |x, y| x.powf(y)),\\n '(' => Token::LeftParen,\\n ')' => Token::RightParen,\\n _ => return Err(input),\\n };\\n Ok(ret)\\n}\\n\\nfn lex(input: String) -> Result<Vec<Token>, char> {\\n input\\n .chars()\\n .filter(|c| !c.is_whitespace())\\n .map(lex_token)\\n .collect()\\n}\\n\\nfn tilt_until(operators: &mut Vec<Token>, output: &mut Vec<Token>, stop: Token) -> bool {\\n while let Some(token) = operators.pop() {\\n if token == stop {\\n return true;\\n }\\n output.push(token)\\n }\\n false\\n}\\n\\nfn shunting_yard(tokens: Vec<Token>) -> Result<Vec<Token>, String> {\\n let mut output: Vec<Token> = Vec::new();\\n let mut operators: Vec<Token> = Vec::new();\\n\\n for token in tokens {\\n match token {\\n Token::Digit(_) => output.push(token),\\n Token::LeftParen => operators.push(token),\\n Token::Operator(operator) => {\\n while let Some(top) = operators.top() {\\n match top {\\n Token::LeftParen => break,\\n Token::Operator(top_op) => {\\n let p = top_op.precedence;\\n let q = operator.precedence;\\n if (p > q) || (p == q && operator.is_left_associative) {\\n output.push(operators.pop().unwrap());\\n } else {\\n break;\\n }\\n }\\n _ => unreachable!(\\\"{:?} must not be on operator stack\\\", token),\\n }\\n }\\n operators.push(token);\\n }\\n Token::RightParen => {\\n if !tilt_until(&mut operators, &mut output, Token::LeftParen) {\\n return Err(String::from(\\\"Mismatched ')'\\\"));\\n }\\n }\\n }\\n }\\n\\n if tilt_until(&mut operators, &mut output, Token::LeftParen) {\\n return Err(String::from(\\\"Mismatched '('\\\"));\\n }\\n\\n assert!(operators.is_empty());\\n Ok(output)\\n}\\n\\nfn calculate(postfix_tokens: Vec<Token>) -> Result<Number, String> {\\n let mut stack = Vec::new();\\n\\n for token in postfix_tokens {\\n match token {\\n Token::Digit(number) => stack.push(number),\\n Token::Operator(operator) => {\\n if let Some(y) = stack.pop() {\\n if let Some(x) = stack.pop() {\\n stack.push(operator.apply(x, y));\\n continue;\\n }\\n }\\n return Err(format!(\\\"Missing operand for operator '{}'\\\", operator.token));\\n }\\n _ => unreachable!(\\\"Unexpected token {:?} during calculation\\\", token),\\n }\\n }\\n\\n assert!(stack.len() == 1);\\n Ok(stack.pop().unwrap())\\n}\\n\\nfn run(input: String) -> Result<Number, String> {\\n let tokens = match lex(input) {\\n Ok(tokens) => tokens,\\n Err(c) => return Err(format!(\\\"Invalid character: {}\\\", c)),\\n };\\n let postfix_tokens = match shunting_yard(tokens) {\\n Ok(tokens) => tokens,\\n Err(message) => return Err(message),\\n };\\n\\n calculate(postfix_tokens)\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"import scala.util.control.Breaks._\\n\\nobject ShuntingYard {\\n\\n def main(args: Array[String]): Unit = {\\n val infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n println(s\\\"infix: $infix\\\")\\n println(s\\\"postfix: ${infixToPostfix(infix)}\\\")\\n }\\n\\n def infixToPostfix(infix: String): String = {\\n val ops = \\\"-+/*^\\\"\\n val sb = new StringBuilder\\n val s = scala.collection.mutable.Stack[Int]()\\n\\n infix.split(\\\"\\\\\\\\s\\\").foreach { token =>\\n if (token.nonEmpty) {\\n val c = token.head\\n val idx = ops.indexOf(c)\\n\\n if (idx != -1) {\\n if (s.isEmpty) s.push(idx)\\n else {\\n breakable({\\n while (s.nonEmpty) {\\n val prec2 = s.top / 2\\n val prec1 = idx / 2\\n if (prec2 > prec1 || (prec2 == prec1 && c != '^')) sb.append(ops(s.pop)).append(' ')\\n else break\\n }\\n });\\n s.push(idx)\\n }\\n } else if (c == '(') {\\n s.push(-2) // -2 stands for '('\\n } else if (c == ')') {\\n // until '(' on stack, pop operators.\\n while (s.top != -2) sb.append(ops(s.pop)).append(' ')\\n s.pop()\\n } else {\\n sb.append(token).append(' ')\\n }\\n }\\n }\\n while (s.nonEmpty) sb.append(ops(s.pop)).append(' ')\\n sb.toString\\n }\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"var prec = Hash(\\n '^' => 4,\\n '*' => 3,\\n '/' => 3,\\n '+' => 2,\\n '-' => 2,\\n '(' => 1,\\n)\\n\\nvar assoc = Hash(\\n '^' => 'right',\\n '*' => 'left',\\n '/' => 'left',\\n '+' => 'left',\\n '-' => 'left',\\n)\\n\\nfunc shunting_yard(prog) {\\n var inp = prog.words\\n var ops = []\\n var res = []\\n \\n func report (op) {\\n printf(\\\"%25s %-7s %10s %s\\\\n\\\",\\n res.join(' '), ops.join(' '), op, inp.join(' '))\\n }\\n\\n func shift (t) { report( \\\"shift #{t}\\\"); ops << t }\\n func reduce (t) { report(\\\"reduce #{t}\\\"); res << t }\\n \\n while (inp) {\\n given(var t = inp.shift) {\\n when (/\\\\d/) { reduce(t) }\\n when ('(') { shift(t) }\\n when (')') {\\n while (ops) {\\n (var x = ops.pop) == '(' ? break : reduce(x)\\n }\\n }\\n default {\\n var newprec = prec{t}\\n while (ops) {\\n var oldprec = prec{ops[-1]}\\n \\n break if (newprec > oldprec)\\n break if ((newprec == oldprec) && (assoc{t} == 'right'))\\n \\n reduce(ops.pop)\\n }\\n shift(t)\\n }\\n }\\n }\\n while (ops) { reduce(ops.pop) }\\n return res\\n}\\n \\nsay shunting_yard('3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3').join(' ')\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"structure Operator = struct\\n datatype associativity = LEFT | RIGHT\\n type operator = { symbol : char, assoc : associativity, precedence : int }\\n\\n val operators : operator list = [\\n { symbol = #\\\"^\\\", precedence = 4, assoc = RIGHT },\\n { symbol = #\\\"*\\\", precedence = 3, assoc = LEFT },\\n { symbol = #\\\"/\\\", precedence = 3, assoc = LEFT },\\n { symbol = #\\\"+\\\", precedence = 2, assoc = LEFT },\\n { symbol = #\\\"-\\\", precedence = 2, assoc = LEFT }\\n ]\\n\\n fun find (c : char) : operator option = List.find (fn ({symbol, ...} : operator) => symbol = c) operators\\n\\n infix cmp\\n fun ({precedence=p1, assoc=a1, ...} : operator) cmp ({precedence=p2, ...} : operator) =\\n case a1 of\\n LEFT => p1 <= p2\\n | RIGHT => p1 < p2\\nend\\n\\nsignature SHUNTING_YARD = sig\\n type 'a tree\\n type content\\n\\n val parse : string -> content tree\\nend\\n\\nstructure ShuntingYard : SHUNTING_YARD = struct\\n structure O = Operator\\n val cmp = O.cmp\\n (* did you know infixity doesn't \\\"carry out\\\" of a structure unless you open it? TIL *)\\n infix cmp\\n fun pop2 (b::a::rest) = ((a, b), rest)\\n | pop2 _ = raise Fail \\\"bad input\\\"\\n\\n datatype content = Op of char\\n | Int of int\\n datatype 'a tree = Leaf\\n | Node of 'a tree * 'a * 'a tree\\n\\n fun parse_int' tokens curr = case tokens of\\n [] => (List.rev curr, [])\\n | t::ts => if Char.isDigit t then parse_int' ts (t::curr)\\n else (List.rev curr, t::ts)\\n\\n fun parse_int tokens = let\\n val (int_chars, rest) = parse_int' tokens []\\n in\\n ((Option.valOf o Int.fromString o String.implode) int_chars, rest)\\n end\\n\\n fun parse (s : string) : content tree = let\\n val tokens = String.explode s\\n (* parse': tokens operator_stack trees *)\\n fun parse' [] [] [result] = result\\n | parse' [] (opr::os) trees =\\n if opr = #\\\"(\\\" orelse opr = #\\\")\\\" then raise Fail \\\"bad input\\\"\\n else let\\n val ((a,b), trees') = pop2 trees\\n val trees'' = (Node (a, Op opr, b)) :: trees'\\n in\\n parse' [] os trees''\\n end\\n | parse' (t::ts) operators trees =\\n if Char.isSpace t then parse' ts operators trees else\\n if t = #\\\"(\\\" then parse' ts (t::operators) (trees : content tree list) else\\n if t = #\\\")\\\" then let\\n (* process_operators : operators trees *)\\n fun process_operators [] _ = raise Fail \\\"bad input\\\"\\n | process_operators (opr::os) trees =\\n if opr = #\\\"(\\\" then (os, trees)\\n else let\\n val ((a, b), trees') = pop2 trees\\n val trees'' = (Node (a, Op opr, b)) :: trees'\\n in\\n process_operators os trees''\\n end\\n val (operators', trees') = process_operators (operators : char list) (trees : content tree list)\\n in\\n parse' ts operators' trees'\\n end else\\n (case O.find (t : char) of\\n SOME o1 => let\\n (* process_operators : operators trees *)\\n fun process_operators [] trees = ([], trees)\\n | process_operators (o2::os) trees = (case O.find o2 of\\n SOME o2 =>\\n if o1 cmp o2 then let\\n val ((a, b), trees') = pop2 trees\\n val trees'' = (Node (a, Op (#symbol o2), b)) :: trees'\\n in\\n process_operators os trees''\\n end\\n else ((#symbol o2)::os, trees)\\n | NONE => (o2::os, trees))\\n val (operators', trees') = process_operators operators trees\\n in\\n parse' ts ((#symbol o1)::operators') trees'\\n end\\n | NONE => let\\n val (n, tokens') = parse_int (t::ts)\\n in\\n parse' tokens' operators ((Node (Leaf, Int n, Leaf)) :: trees)\\n end)\\n | parse' _ _ _ = raise Fail \\\"bad input\\\"\\n in\\n parse' tokens [] []\\n end\\nend\\n\",\n \"language\": \"Standard-ML\"\n },\n {\n \"code\": \"// Updated to Swift 5.7\\nimport Foundation\\n\\n// Using arrays for both stack and queue\\nstruct Stack<T> {\\n\\tprivate(set) var elements = [T]()\\n\\t\\n\\tvar isEmpty: Bool {\\n\\t\\telements.isEmpty\\n\\t}\\n\\t\\n\\tvar top: T? {\\n\\t\\telements.last\\n\\t}\\n\\t\\n\\tmutating func push(_ newElement: T) {\\n\\t\\telements.append(newElement)\\n\\t}\\n\\t\\n\\tmutating func pop() -> T? {\\n\\t\\tself.isEmpty ? nil : elements.removeLast()\\n\\t}\\n}\\n\\nstruct Queue<T> {\\n\\tprivate(set) var elements = [T]()\\n\\t\\n\\tvar isEmpty: Bool {\\n\\t\\telements.isEmpty\\n\\t}\\n\\t\\n\\tmutating func enqueue(_ newElement: T) {\\n\\t\\telements.append(newElement)\\n\\t}\\n\\t\\n\\tmutating func dequeue() -> T {\\n\\t\\treturn elements.removeFirst()\\n\\t}\\n}\\n\\nenum Associativity {\\n\\tcase Left, Right\\n}\\n\\n// Protocol can be used to restrict Set extension\\nprotocol OperatorType: Comparable, Hashable {\\n\\tvar name: String { get }\\n\\tvar precedence: Int { get }\\n\\tvar associativity: Associativity { get }\\n}\\n\\nstruct Operator: OperatorType {\\n\\tlet name: String\\n\\tlet precedence: Int\\n\\tlet associativity: Associativity\\n\\t\\n\\t// Duplicate operator names are not allowed\\n\\tfunc hash(into hasher: inout Hasher) {\\n\\t\\thasher.combine(self.name)\\n\\t}\\n\\t\\n\\tinit(_ name: String, _ precedence: Int, _ associativity: Associativity) {\\n\\t\\tself.name = name; self.precedence = precedence; self.associativity = associativity\\n\\t}\\n}\\n\\nfunc ==(x: Operator, y: Operator) -> Bool {\\n\\t// Identified by name\\n\\tx.name == y.name\\n}\\n\\nfunc <(x: Operator, y: Operator) -> Bool {\\n\\t// Take precedence and associavity into account\\n\\t(x.associativity == .Left && x.precedence == y.precedence) || x.precedence < y.precedence\\n}\\n\\nextension Set where Element: OperatorType {\\n\\tfunc contains(_ operatorName: String) -> Bool {\\n\\t\\tcontains { $0.name == operatorName }\\n\\t}\\n\\t\\n\\tsubscript (operatorName: String) -> Element? {\\n\\t\\tget {\\n\\t\\t\\tfilter { $0.name == operatorName }.first\\n\\t\\t}\\n\\t}\\n}\\n\\n// Convenience\\nextension String {\\n\\tvar isNumber: Bool { return Double(self) != nil }\\n}\\n\\nstruct ShuntingYard {\\n\\tenum ParseError: Error {\\n\\t\\tcase MismatchedParenthesis(parenthesis: String, expression: String)\\n\\t\\tcase UnrecognizedToken(token: String, expression: String)\\n\\t\\tcase ExtraneousToken(token: String, expression: String)\\n\\t}\\n\\t\\n\\tstatic func parse(_ input: String, operators: Set<Operator>) throws -> String {\\n\\t\\tvar stack = Stack<String>()\\n\\t\\tvar output = Queue<String>()\\n\\t\\tlet tokens = input.components(separatedBy: \\\" \\\")\\n\\t\\t\\n\\t\\tfor token in tokens {\\n\\t\\t\\t// Number?\\n\\t\\t\\tif token.isNumber {\\n\\t\\t\\t\\t// Add it to the output queue\\n\\t\\t\\t\\toutput.enqueue(token)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Operator?\\n\\t\\t\\tif operators.contains(token) {\\n\\t\\t\\t\\t// While there is a operator on top of the stack and has lower precedence than current operator (token)\\n\\t\\t\\t\\twhile let top = stack.top,\\n\\t\\t\\t\\t\\t operators.contains(top) && Self.hasLowerPrecedence(token, top, operators) {\\n\\t\\t\\t\\t\\t// Pop it off to the output queue\\n\\t\\t\\t\\t\\toutput.enqueue(stack.pop()!)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Push current operator (token) onto the operator stack\\n\\t\\t\\t\\tstack.push(token)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Left parenthesis?\\n\\t\\t\\tif token == \\\"(\\\" {\\n\\t\\t\\t\\t// Push it onto the stack\\n\\t\\t\\t\\tstack.push(token)\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Right parenthesis?\\n\\t\\t\\tif token == \\\")\\\" {\\n\\t\\t\\t\\t// Until the token at the top of the stack is a left parenthesis\\n\\t\\t\\t\\twhile let top = stack.top, top != \\\"(\\\" {\\n\\t\\t\\t\\t\\t// Pop operators off the stack onto the output queue.\\n\\t\\t\\t\\t\\toutput.enqueue(stack.pop()!)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Pop the left parenthesis from the stack without putting it onto the output queue\\n\\t\\t\\t\\tguard let _ = stack.pop() else {\\n\\t\\t\\t\\t\\t// If the stack runs out, than there is no matching left parenthesis\\n\\t\\t\\t\\t\\tthrow ParseError.MismatchedParenthesis(parenthesis: \\\")\\\", expression: input)\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tcontinue\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Token not recognized!\\n\\t\\t\\tthrow ParseError.UnrecognizedToken(token: token, expression: token)\\n\\t\\t}\\n\\t\\t\\n\\t\\t// No more tokens\\n\\t\\t\\n\\t\\t// Still operators on the stack?\\n\\t\\twhile let top = stack.top,\\n\\t\\t\\t operators.contains(top) {\\n\\t\\t\\t// Put them onto the output queue\\n\\t\\t\\toutput.enqueue(stack.pop()!)\\n\\t\\t}\\n\\t\\t\\n\\t\\t// If the top of the stack is a (left) parenthesis, then there is no matching right parenthesis\\n\\t\\t// Note: Assume that all operators has been popped and put onto the output queue\\n\\t\\tif let top = stack.pop() {\\n\\t\\t\\tthrow (\\n\\t\\t\\t\\ttop == \\\"(\\\"\\n\\t\\t\\t\\t? ParseError.MismatchedParenthesis(parenthesis: \\\"(\\\", expression: input)\\n\\t\\t\\t\\t: ParseError.ExtraneousToken(token: top, expression: input)\\n\\t\\t\\t)\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn output.elements.joined(separator: \\\" \\\")\\n\\t}\\n\\t\\n\\tstatic private func hasLowerPrecedence(_ firstToken: String, _ secondToken: String, _ operators: Set<Operator>) -> Bool {\\n\\t\\tguard let firstOperator = operators[firstToken],\\n\\t\\t\\t let secondOperator = operators[secondToken] else {\\n\\t\\t\\treturn false\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn firstOperator < secondOperator\\n\\t}\\n}\\n\\n/* Include in tests\\nfunc testParse() throws {\\n\\tlet input = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n\\tlet operators: Set<Operator> = [\\n\\t\\tOperator(\\\"^\\\", 4, .Right),\\n\\t\\tOperator(\\\"*\\\", 3, .Left),\\n\\t\\tOperator(\\\"/\\\", 3, .Left),\\n\\t\\tOperator(\\\"+\\\", 2, .Left),\\n\\t\\tOperator(\\\"-\\\", 2, .Left)\\n\\t]\\n\\tlet output = try! ShuntingYard.parse(input, operators: operators)\\n\\tXCTAssertEqual(output, \\\"3 4 2 * 1 5 - 2 3 ^ ^ / +\\\")\\n}\\n*/\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\n# Helpers\\nproc tokenize {str} {\\n regexp -all -inline {[\\\\d.]+|[-*^+/()]} $str\\n}\\nproc precedence op {\\n dict get {^ 4 * 3 / 3 + 2 - 2} $op\\n}\\nproc associativity op {\\n if {$op eq \\\"^\\\"} {return \\\"right\\\"} else {return \\\"left\\\"}\\n}\\n\\nproc shunting {expression} {\\n set stack {}\\n foreach token [tokenize $expression] {\\n\\tif {[string is double $token]} {\\n\\t puts \\\"add to output: $token\\\"\\n\\t lappend output $token\\n\\t} elseif {$token eq \\\"(\\\"} {\\n\\t puts \\\"push parenthesis\\\"\\n\\t lappend stack $token\\n\\t} elseif {$token eq \\\")\\\"} {\\n\\t puts \\\"popping to parenthesis\\\"\\n\\t while {[lindex $stack end] ne \\\"(\\\"} {\\n\\t\\tlappend output [lindex $stack end]\\n\\t\\tset stack [lreplace $stack end end]\\n\\t\\tputs \\\"...popped [lindex $output end] to output\\\"\\n\\t }\\n\\t set stack [lreplace $stack end end]\\n\\t puts \\\"...found parenthesis\\\"\\n\\t} else {\\n\\t puts \\\"adding operator: $token\\\"\\n\\t set p [precedence $token]\\n\\t set a [associativity $token]\\n\\t while {[llength $stack]} {\\n\\t\\tset o2 [lindex $stack end]\\n\\t\\tif {\\n\\t\\t $o2 ne \\\"(\\\" &&\\n\\t\\t (($a eq \\\"left\\\" && $p <= [precedence $o2]) ||\\n\\t\\t ($a eq \\\"right\\\" && $p < [precedence $o2]))\\n\\t\\t} then {\\n\\t\\t puts \\\"...popped operator $o2 to output\\\"\\n\\t\\t lappend output $o2\\n\\t\\t set stack [lreplace $stack end end]\\n\\t\\t} else {\\n\\t\\t break\\n\\t\\t}\\n\\t }\\n\\t lappend stack $token\\n\\t}\\n\\tputs \\\"\\\\t\\\\tOutput:\\\\t$output\\\\n\\\\t\\\\tStack:\\\\t$stack\\\"\\n }\\n puts \\\"transferring tokens from stack to output\\\"\\n lappend output {*}[lreverse $stack]\\n}\\n\\nputs [shunting \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/bin/sh\\n\\ngetopprec() {\\n case \\\"$1\\\" in\\n '+') echo 2;;\\n '-') echo 2;;\\n '*') echo 3;;\\n '/') echo 4;;\\n '%') echo 4;;\\n '^') echo 4;;\\n '(') echo 5;;\\n esac\\n}\\n\\ngetopassoc() {\\n case \\\"$1\\\" in\\n '^') echo r;;\\n *) echo l;;\\n esac\\n}\\n\\nshowstacks() {\\n [ -n \\\"$1\\\" ] && echo \\\"Token: $1\\\" || echo \\\"End parsing\\\"\\n echo -e \\\"\\\\tOutput: `tr $'\\\\n' ' ' <<< \\\"$out\\\"`\\\"\\n echo -e \\\"\\\\tOperators: `tr $'\\\\n' ' ' <<< \\\"$ops\\\"`\\\"\\n}\\n\\ninfix() {\\n local out=\\\"\\\" ops=\\\"\\\"\\n\\n while [ \\\"$#\\\" -gt 0 ]; do\\n grep -qE '^[0-9]+$' <<< \\\"$1\\\"\\n if [ \\\"$?\\\" -eq 0 ]; then\\n out=\\\"`sed -e '$a'\\\"$1\\\" -e '/^$/d' <<< \\\"$out\\\"`\\\"\\n\\n showstacks \\\"$1\\\"\\n shift && continue\\n fi\\n\\n grep -q '^[-+*/^%]$' <<< \\\"$1\\\"\\n if [ \\\"$?\\\" -eq 0 ]; then\\n if [ -n \\\"$ops\\\" ]; then\\n thispred=`getopprec \\\"$1\\\"`\\n thisassoc=`getopassoc \\\"$1\\\"`\\n topop=\\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n thatpred=`getopprec \\\"$topop\\\"`\\n thatassoc=`getopassoc \\\"$topop\\\"`\\n while [ $thatpred -gt $thispred ] 2> /dev/null || ( [ \\\\\\n $thatpred -eq $thispred ] 2> /dev/null && [ $thisassoc = \\\\\\n 'l' ] 2> /dev/null ); do # To /dev/null 'cus u r fake news\\n\\n [ \\\"$topop\\\" = '(' ] && break\\n\\n op=\\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n out=\\\"`sed -e '$a'\\\"$op\\\" -e '/^$/d' <<< \\\"$out\\\"`\\\"\\n ops=\\\"`sed '$d' <<< \\\"$ops\\\"`\\\"\\n\\n topop=\\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n thatpred=`getopprec \\\"$topop\\\"`\\n thatassoc=`getopassoc \\\"$topop\\\"`\\n done\\n fi\\n ops=\\\"`sed -e '$a'\\\"$1\\\" -e '/^$/d' <<< \\\"$ops\\\"`\\\"\\n\\n showstacks \\\"$1\\\"\\n shift && continue\\n fi\\n\\n if [ \\\"$1\\\" = '(' ]; then\\n ops=\\\"`sed -e '$a'\\\"$1\\\" -e '/^$/d' <<< \\\"$ops\\\"`\\\"\\n\\n showstacks \\\"$1\\\"\\n shift && continue\\n fi\\n\\n if [ \\\"$1\\\" = ')' ]; then\\n grep -q '^($' <<< \\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n while [ \\\"$?\\\" -ne 0 ]; do\\n op=\\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n out=\\\"`sed -e '$a'\\\"$op\\\" -e '/^$/d' <<< \\\"$out\\\"`\\\"\\n ops=\\\"`sed '$d' <<< \\\"$ops\\\"`\\\"\\n\\n grep -q '^($' <<< \\\"`sed '$p' <<< \\\"$ops\\\"`\\\"\\n done\\n ops=\\\"`sed '$d' <<< \\\"$ops\\\"`\\\"\\n\\n showstacks \\\"$1\\\"\\n shift && continue\\n fi\\n\\n shift\\n done\\n\\n while [ -n \\\"$ops\\\" ]; do\\n op=\\\"`sed -n '$p' <<< \\\"$ops\\\"`\\\"\\n out=\\\"`sed -e '$a'\\\"$op\\\" -e '/^$/d' <<< \\\"$out\\\"`\\\"\\n ops=\\\"`sed '$d' <<< \\\"$ops\\\"`\\\"\\n done\\n\\n showstacks \\\"$1\\\"\\n}\\n\\ninfix 3 + 4 \\\\* 2 / \\\\( 1 - 5 \\\\) ^ 2 ^ 3\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Token: 3\\n\\tOutput: 3\\n\\tOperators:\\nToken: +\\n\\tOutput: 3\\n\\tOperators: +\\nToken: 4\\n\\tOutput: 3 4\\n\\tOperators: +\\nToken: *\\n\\tOutput: 3 4\\n\\tOperators: + *\\nToken: 2\\n\\tOutput: 3 4 2\\n\\tOperators: + *\\nToken: /\\n\\tOutput: 3 4 2\\n\\tOperators: + * /\\nToken: (\\n\\tOutput: 3 4 2\\n\\tOperators: + * / (\\nToken: 1\\n\\tOutput: 3 4 2 1\\n\\tOperators: + * / (\\nToken: -\\n\\tOutput: 3 4 2 1\\n\\tOperators: + * / ( -\\nToken: 5\\n\\tOutput: 3 4 2 1 5\\n\\tOperators: + * / ( -\\nToken: )\\n\\tOutput: 3 4 2 1 5 -\\n\\tOperators: + * /\\nToken: ^\\n\\tOutput: 3 4 2 1 5 -\\n\\tOperators: + * / ^\\nToken: 2\\n\\tOutput: 3 4 2 1 5 - 2\\n\\tOperators: + * / ^\\nToken: ^\\n\\tOutput: 3 4 2 1 5 - 2\\n\\tOperators: + * / ^ ^\\nToken: 3\\n\\tOutput: 3 4 2 1 5 - 2 3\\n\\tOperators: + * / ^ ^\\nEnd parsing\\n\\tOutput: 3 4 2 1 5 - 2 3 ^ ^ / * +\\n\\tOperators:\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"Option Explicit\\nOption Base 1\\n\\nFunction ShuntingYard(strInfix As String) As String\\nDim i As Long, j As Long, token As String, tokenArray() As String\\nDim stack() As Variant, queue() As Variant, discard As String\\nDim op1 As String, op2 As String\\n\\nDebug.Print strInfix\\n\\n' Get tokens\\ntokenArray = Split(strInfix)\\n\\n' Initialize array (removed later)\\nReDim stack(1)\\nReDim queue(1)\\n\\n' Loop over tokens\\nDo While 1\\n i = i + 1\\n If i - 1 > UBound(tokenArray) Then\\n Exit Do\\n Else\\n token = tokenArray(i - 1) 'i-1 due to Split returning a Base 0\\n End If\\n If token = \\\"\\\" Then: Exit Do\\n\\n ' Print\\n Debug.Print i, token, Join(stack, \\\",\\\"), Join(queue, \\\",\\\")\\n ' If-loop over tokens (either brackets, operators, or numbers)\\n If token = \\\"(\\\" Then\\n stack = push(token, stack)\\n ElseIf token = \\\")\\\" Then\\n While Peek(stack) <> \\\"(\\\"\\n queue = push(pop(stack), queue)\\n Wend\\n discard = pop(stack) 'discard \\\"(\\\"\\n ElseIf isOperator(token) Then\\n op1 = token\\n Do While (isOperator(Peek(stack)))\\n' Debug.Print Peek(stack)\\n op2 = Peek(stack)\\n If op2 <> \\\"^\\\" And precedence(op1) = precedence(op2) Then\\n '\\\"^\\\" is the only right-associative operator\\n queue = push(pop(stack), queue)\\n ElseIf precedence(op1$) < precedence(op2$) Then\\n queue = push(pop(stack), queue)\\n Else\\n Exit Do\\n End If\\n Loop\\n stack = push(op1, stack)\\n Else 'number\\n 'actually, wrong operator could end up here, like say %\\n 'If the token is a number, then add it to the output queue.\\n queue = push(CStr(token), queue)\\n End If\\nLoop\\n\\nWhile stack(1) <> \\\"\\\"\\n If Peek(stack) = \\\"(\\\" Then Debug.Print \\\"no matching ')'\\\": End\\n queue = push(pop(stack), queue)\\nWend\\n\\n' Print final output\\nShuntingYard = Join(queue, \\\" \\\")\\nDebug.Print \\\"Output:\\\"\\nDebug.Print ShuntingYard\\nEnd Function\\n\\n'------------------------------------------\\nFunction isOperator(op As String) As Boolean\\n isOperator = InStr(\\\"+-*/^\\\", op) <> 0 And Len(op$) = 1\\nEnd Function\\n\\nFunction precedence(op As String) As Integer\\n If isOperator(op$) Then\\n precedence = 1 _\\n - (InStr(\\\"+-*/^\\\", op$) <> 0) _\\n - (InStr(\\\"*/^\\\", op$) <> 0) _\\n - (InStr(\\\"^\\\", op$) <> 0)\\n End If\\nEnd Function\\n\\n'------------------------------------------\\nFunction push(str, stack) As Variant\\nDim out() As Variant, i As Long\\nIf Not IsEmpty(stack(1)) Then\\n out = stack\\n ReDim Preserve out(1 To UBound(stack) + 1)\\n out(UBound(out)) = str\\nElse\\n ReDim out(1 To 1)\\n out(1) = str\\nEnd If\\npush = out\\nEnd Function\\n\\nFunction pop(stack)\\npop = stack(UBound(stack))\\nIf UBound(stack) > 1 Then\\n ReDim Preserve stack(1 To UBound(stack) - 1)\\nElse\\n stack(1) = \\\"\\\"\\nEnd If\\nEnd Function\\n\\nFunction Peek(stack)\\n Peek = stack(UBound(stack))\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Module Module1\\n Class SymbolType\\n Public ReadOnly symbol As String\\n Public ReadOnly precedence As Integer\\n Public ReadOnly rightAssociative As Boolean\\n\\n Public Sub New(symbol As String, precedence As Integer, rightAssociative As Boolean)\\n Me.symbol = symbol\\n Me.precedence = precedence\\n Me.rightAssociative = rightAssociative\\n End Sub\\n End Class\\n\\n ReadOnly Operators As Dictionary(Of String, SymbolType) = New Dictionary(Of String, SymbolType) From\\n {\\n {\\\"^\\\", New SymbolType(\\\"^\\\", 4, True)},\\n {\\\"*\\\", New SymbolType(\\\"*\\\", 3, False)},\\n {\\\"/\\\", New SymbolType(\\\"/\\\", 3, False)},\\n {\\\"+\\\", New SymbolType(\\\"+\\\", 2, False)},\\n {\\\"-\\\", New SymbolType(\\\"-\\\", 2, False)}\\n }\\n\\n Function ToPostfix(infix As String) As String\\n Dim tokens = infix.Split(\\\" \\\")\\n Dim stack As New Stack(Of String)\\n Dim output As New List(Of String)\\n\\n Dim Print = Sub(action As String) Console.WriteLine(\\\"{0,-4} {1,-18} {2}\\\", action + \\\":\\\", $\\\"stack[ {String.Join(\\\" \\\", stack.Reverse())} ]\\\", $\\\"out[ {String.Join(\\\" \\\", output)} ]\\\")\\n\\n For Each token In tokens\\n Dim iv As Integer\\n Dim op1 As SymbolType\\n Dim op2 As SymbolType\\n If Integer.TryParse(token, iv) Then\\n output.Add(token)\\n Print(token)\\n ElseIf Operators.TryGetValue(token, op1) Then\\n While stack.Count > 0 AndAlso Operators.TryGetValue(stack.Peek(), op2)\\n Dim c = op1.precedence.CompareTo(op2.precedence)\\n If c < 0 OrElse Not op1.rightAssociative AndAlso c <= 0 Then\\n output.Add(stack.Pop())\\n Else\\n Exit While\\n End If\\n End While\\n stack.Push(token)\\n Print(token)\\n ElseIf token = \\\"(\\\" Then\\n stack.Push(token)\\n Print(token)\\n ElseIf token = \\\")\\\" Then\\n Dim top = \\\"\\\"\\n While stack.Count > 0\\n top = stack.Pop()\\n If top <> \\\"(\\\" Then\\n output.Add(top)\\n Else\\n Exit While\\n End If\\n End While\\n If top <> \\\"(\\\" Then\\n Throw New ArgumentException(\\\"No matching left parenthesis.\\\")\\n End If\\n Print(token)\\n End If\\n Next\\n While stack.Count > 0\\n Dim top = stack.Pop()\\n If Not Operators.ContainsKey(top) Then\\n Throw New ArgumentException(\\\"No matching right parenthesis.\\\")\\n End If\\n output.Add(top)\\n End While\\n Print(\\\"pop\\\")\\n Return String.Join(\\\" \\\", output)\\n End Function\\n\\n Sub Main()\\n Dim infix = \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\"\\n Console.WriteLine(ToPostfix(infix))\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./seq\\\" for Stack\\nimport \\\"./pattern\\\" for Pattern\\n\\n/* To find out the precedence, we take the index of the\\n token in the OPS string and divide by 2 (rounding down).\\n This will give us: 0, 0, 1, 1, 2 */\\nvar ops = \\\"-+/*^\\\"\\n\\nvar infixToPostfix = Fn.new { |infix|\\n var sb = \\\"\\\"\\n var s = Stack.new()\\n var p = Pattern.new(\\\"+1/s\\\")\\n for (token in p.splitAll(infix)) {\\n var c = token[0]\\n var idx = ops.indexOf(c)\\n\\n // check for operator\\n if (idx != - 1) {\\n if (s.isEmpty) {\\n s.push(idx)\\n } else {\\n while (!s.isEmpty) {\\n var prec2 = (s.peek()/2).floor\\n var prec1 = (idx/2).floor\\n if (prec2 > prec1 || (prec2 == prec1 && c != \\\"^\\\")) {\\n sb = sb + ops[s.pop()] + \\\" \\\"\\n } else break\\n }\\n s.push(idx)\\n }\\n } else if (c == \\\"(\\\") {\\n s.push(-2) // -2 stands for \\\"(\\\"\\n } else if (c == \\\")\\\") {\\n // until \\\"(\\\" on stack, pop operators.\\n while (s.peek() != -2) sb = sb + ops[s.pop()] + \\\" \\\"\\n s.pop()\\n } else {\\n sb = sb + token + \\\" \\\"\\n }\\n }\\n while (!s.isEmpty) sb = sb + ops[s.pop()] + \\\" \\\"\\n return sb\\n}\\n\\nvar es = [\\n \\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\",\\n \\\"( ( 1 + 2 ) ^ ( 3 + 4 ) ) ^ ( 5 + 6 )\\\"\\n]\\nfor (e in es) {\\n System.print(\\\"Infix : %(e)\\\")\\n System.print(\\\"Postfix : %(infixToPostfix.call(e))\\\\n\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"Function ShuntingYard(strInfix As String) As String\\n\\n\\n Dim i as Integer\\n Dim token, tokenArray() As String\\n Dim stack(), queue() As Variant\\n Dim discard As String\\n Dim op1, op2 As String\\n\\n Dim Left_Brackets, Right_Brackets As Integer\\n\\n Dim output As String\\n Dim dbl_output As Double\\n\\n\\n Left_Brackets = CountFields(strInfix, \\\"(\\\")\\n Right_Brackets = CountFields(strInfix, \\\")\\\")\\n\\n If Left_Brackets = Right_Brackets Then\\n\\n\\n\\n 'Get tokens\\n tokenArray = Split(strInfix,\\\" \\\")\\n\\n\\n\\n 'Initialize array (removed later)\\n ReDim stack(1)\\n ReDim queue(1)\\n\\n 'Loop over tokens\\n For i = 0 to tokenArray.Ubound\\n\\n\\n 'i = i + 1\\n If i > UBound(tokenArray) Then\\n Exit For\\n Else\\n token = tokenArray(i ) 'i-1 due to Split returning a Base 0\\n End If\\n If token = \\\"\\\" Then\\n Exit For\\n End If\\n\\n\\n\\n\\n\\n\\n Dim stackString As String\\n Dim queuString As String\\n\\n for m as Integer = 0 to stack.Ubound\\n stackString = stackString + \\\" \\\" + stack(m)\\n Next\\n\\n for m as Integer = 0 to queue.Ubound\\n queuString = queuString + \\\" \\\" + queue(m)\\n Next\\n\\n MsgBox(Str(i) + \\\" \\\" + token + \\\" \\\" + stackString + \\\" \\\" + queuString)\\n\\n 'Window1.txtQueu.Text = Window1.txtQueu.Text + Str(i) + \\\" \\\" + token + \\\" \\\" + stackString + \\\" \\\" + queuString + EndOfLIne\\n\\n\\n\\n\\n ' If-loop over tokens (either brackets, operators, or numbers)\\n If token = \\\"(\\\" Then\\n stack.Append(token)\\n\\n ElseIf token = \\\")\\\" Then\\n While stack(stack.Ubound) <> \\\"(\\\"\\n queue.Append(stack.pop)\\n Wend\\n\\n discard = stack.Pop 'discard \\\"(\\\"\\n ElseIf isOperator(token) Then\\n op1 = token\\n\\n\\n //Do While (isOperator(Peek(stack)))\\n While isOperator( stack(stack.Ubound) ) = True\\n op2 = stack(stack.Ubound)\\n If op2 <> \\\"^\\\" And precedence(op1) = precedence(op2) Then\\n '\\\"^\\\" is the only right-associative operator\\n\\n queue.Append(stack.pop)\\n\\n ElseIf precedence(op1) < precedence(op2) Then\\n queue.Append(stack.Pop)\\n Else\\n Exit While\\n End If\\n Wend\\n //Loop\\n\\n\\n stack.Append(op1)\\n Else 'number\\n 'actually, wrong operator could end up here, like say %\\n 'If the token is a number, then add it to the output queue.\\n queue.Append(CStr(token))\\n End If\\n\\n\\n\\n\\n Next\\n\\n\\n\\n for i = 0 to queue.Ubound\\n output = output +queue(i) + \\\" \\\"\\n next\\n\\n for i = stack.Ubound DownTo 0\\n output = output + stack(i)+\\\" \\\"\\n next\\n\\n\\n\\n While InStr(output, \\\" \\\") <> 0\\n output = ReplaceAll(output,\\\" \\\",\\\" \\\")\\n Wend\\n\\n\\n output = Trim(output)\\n\\n\\n Return output\\n\\n Else\\n\\n MsgBox(\\\"Syntax Error!\\\" + EndOfLine + \\\"Count left brackets: \\\" + Str(Left_Brackets) + EndOfLine +\\\"Count right brackets: \\\" + Str(Right_Brackets))\\n\\n End If\\n\\nEnd Function\\n\\n\\nFunction isOperator(op As String) As Boolean\\n\\n If InStr(\\\"+-*/^\\\", op) <> 0 and Len(op) = 1 Then\\n Return True\\n End If\\n\\nEnd Function\\n\\n\\nFunction precedence(op As String) As Integer\\n\\n If isOperator(op) = True Then\\n\\n\\n\\n If op = \\\"+\\\" or op = \\\"-\\\" Then\\n Return 2\\n ElseIf op = \\\"/\\\" or op = \\\"*\\\" Then\\n Return 3\\n ElseIf op = \\\"^\\\" Then\\n Return 4\\n End If\\n\\n\\n End If\\n\\n\\nEnd Function\\n\",\n \"language\": \"Xojo\"\n },\n {\n \"code\": \"int Stack(10);\\nint SP; \\\\stack pointer\\n\\nproc Push(N);\\nint N;\\n[Stack(SP):= N; SP:= SP+1];\\n\\nfunc Pop;\\n[SP:= SP-1; return Stack(SP)];\\n\\nfunc Precedence(Op);\\nint Op;\\ncase Op of\\n ^+, ^-: return 2;\\n ^*, ^/: return 3;\\n ^^: return 4\\nother [];\\n\\nproc ShowStack;\\nint I;\\n[ChOut(0, 9\\\\tab\\\\);\\nfor I:= 0 to SP-1 do\\n [ChOut(0, Stack(I)); ChOut(0, ^ )];\\nCrLf(0);\\n];\\n\\nchar Str;\\nint Token, Op1, Op2;\\n[Str:= \\\"3 + 4 * 2 / ( 1 - 5 ) ^^ 2 ^^ 3 \\\";\\nSP:= 0;\\nText(0, \\\"Input Output Stack^m^j\\\");\\nloop [repeat Token:= Str(0); Str:= Str+1;\\n until Token # ^ ; \\\\skip space characters\\n if Token # $A0 \\\\terminating space\\\\ then\\n [ChOut(0, Token); ChOut(0, 9\\\\tab\\\\)];\\n case Token of\\n ^+, ^-, ^*, ^/, ^^:\\n [Op1:= Token;\\n loop [if SP <= 0 then quit; \\\\empty\\n Op2:= Stack(SP-1);\\n if Op2 = ^( then quit;\\n if Precedence(Op2) < Precedence(Op1) then quit;\\n if Precedence(Op2) = Precedence(Op1) then\\n if Op1 = ^^ then quit;\\n ChOut(0, Pop);\\n ];\\n Push(Op1);\\n ];\\n ^(: Push(Token);\\n ^): [while SP > 0 and Stack(SP-1) # ^( do\\n ChOut(0, Pop);\\n Pop; \\\\discard left parenthesis\\n ];\\n $A0: quit \\\\terminating space with MSB set\\n other ChOut(0, Token); \\\\print single digit number\\n ShowStack;\\n ];\\nwhile SP > 0 do \\\\print any remaining operators\\n [ChOut(0, 9\\\\tab\\\\);\\n ChOut(0, Pop);\\n ShowStack;\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var input=\\\"3 + 4 * 2 / ( 1 - 5 ) ^ 2 ^ 3\\\";\\n\\nvar opa=Dictionary(\\\"^\\\",T(4,True), \\\"*\\\",T(3,False), // op:(prec,rAssoc)\\n\\t \\\"/\\\",T(3,False), \\\"+\\\",T(2,False), \\\"-\\\",T(2,False),\\n);\\n\\n\\\"infix: \\\".println(input);\\n\\\"postfix:\\\".println(parseInfix(input));\\n\\nfcn parseInfix(e){\\n stack:=List(); // holds operators and left parenthesis\\n rpn:=\\\"\\\";\\n foreach tok in (e.split(\\\" \\\")){\\n switch(tok){\\n case(\\\"(\\\"){ stack.append(tok) } // push \\\"(\\\" to stack\\n\\t case(\\\")\\\"){\\n while(True){ // pop item (\\\"(\\\" or operator) from stack\\n op:=stack.pop();\\n\\t if(op==\\\"(\\\") break; // discard \\\"(\\\"\\n\\t rpn+=\\\" \\\" + op; // add operator to result\\n\\t }\\n\\t }\\n else{ // default\\n\\t o1:=opa.find(tok); // op or Void\\n\\t if(o1){ // token is an operator\\n\\t while(stack){\\n // consider top item on stack\\n\\t\\t op:=stack[-1]; o2:=opa.find(op);\\n\\t\\t if(not o2 or o1[0]>o2[0] or\\n (o1[0]==o2[0] and o1[1])) break;\\n\\t\\t // top item is an operator that needs to come off\\n\\t\\t stack.pop();\\n\\t\\t rpn+=\\\" \\\" + op; // add it to result\\n\\t }\\n\\t // push operator (the new one) to stack\\n\\t stack.append(tok);\\n\\t }else // token is an operand\\n\\t rpn+=(rpn and \\\" \\\" or \\\"\\\") + tok; // add operand to result\\n\\t }\\n } // switch\\n display(tok,rpn,stack);\\n } // foreach\\n // drain stack to result\\n rpn + stack.reverse().concat(\\\" \\\");\\n}\\nfcn display(tok,rpn,stack){\\n \\\"Token|\\\".println(tok);\\n \\\"Stack|\\\".println(stack.concat());\\n \\\"Queue|\\\".println(rpn);\\n println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Parsing-Shunting-yard-algorithm"}}},{"rowIdx":1487,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Particle_fountain\n","language":"00-META"},{"code":"Implement a particle fountain.\n\nEmulate a fountain of water droplets in a gravitational field being sprayed up and then falling back down.\n\nThe particle fountain should be generally ordered but individually chaotic; the particles should be going mostly in the same direction, but should have slightly different vectors.\n\nYour fountain should have at least several hundred particles in motion at any one time, and ideally several thousand.\n\nIt is optional to have the individual particle interact with each other.\n\nIf at all possible, link to a short video clip of your fountain in action.\n\n[https://github.com/thundergnat/rc/blob/master/img/fountain-raku.mp4?raw=true Off-site link to a demo video] \n\n","language":"00-TASK"},{"code":"#include <SDL2/SDL.h>\n\n#include <algorithm>\n#include <chrono>\n#include <cmath>\n#include <iostream>\n#include <memory>\n#include <random>\n#include <tuple>\n#include <vector>\n\nauto now() {\n using namespace std::chrono;\n auto time = system_clock::now();\n return duration_cast<milliseconds>(time.time_since_epoch()).count();\n}\n\nauto hsv_to_rgb(int h, double s, double v) {\n double hp = h / 60.0;\n double c = s * v;\n double x = c * (1 - std::abs(std::fmod(hp, 2) - 1));\n double m = v - c;\n double r = 0, g = 0, b = 0;\n if (hp <= 1) {\n r = c;\n g = x;\n } else if (hp <= 2) {\n r = x;\n g = c;\n } else if (hp <= 3) {\n g = c;\n b = x;\n } else if (hp <= 4) {\n g = x;\n b = c;\n } else if (hp <= 5) {\n r = x;\n b = c;\n } else {\n r = c;\n b = x;\n }\n r += m;\n g += m;\n b += m;\n return std::make_tuple(Uint8(r * 255), Uint8(g * 255), Uint8(b * 255));\n}\n\nclass ParticleFountain {\npublic:\n ParticleFountain(int particles, int width, int height);\n void run();\n\nprivate:\n struct WindowDeleter {\n void operator()(SDL_Window* window) const { SDL_DestroyWindow(window); }\n };\n struct RendererDeleter {\n void operator()(SDL_Renderer* renderer) const {\n SDL_DestroyRenderer(renderer);\n }\n };\n struct PointInfo {\n double x = 0;\n double y = 0;\n double vx = 0;\n double vy = 0;\n double lifetime = 0;\n };\n\n void update(double df);\n bool handle_event();\n void render();\n double rand() { return dist_(rng_); }\n double reciprocate() const {\n return reciprocate_ ? range_ * std::sin(now() / 1000.0) : 0.0;\n }\n\n std::unique_ptr<SDL_Window, WindowDeleter> window_;\n std::unique_ptr<SDL_Renderer, RendererDeleter> renderer_;\n int width_;\n int height_;\n std::vector<PointInfo> point_info_;\n std::vector<SDL_Point> points_;\n int num_points_ = 0;\n double saturation_ = 0.4;\n double spread_ = 1.5;\n double range_ = 1.5;\n bool reciprocate_ = false;\n std::mt19937 rng_;\n std::uniform_real_distribution<> dist_;\n};\n\nParticleFountain::ParticleFountain(int n, int width, int height)\n : width_(width), height_(height), point_info_(n), points_(n, {0, 0}),\n rng_(std::random_device{}()), dist_(0.0, 1.0) {\n window_.reset(SDL_CreateWindow(\n \"C++ Particle System!\", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED,\n width, height, SDL_WINDOW_RESIZABLE));\n if (window_ == nullptr)\n throw std::runtime_error(SDL_GetError());\n\n renderer_.reset(\n SDL_CreateRenderer(window_.get(), -1, SDL_RENDERER_ACCELERATED));\n if (renderer_ == nullptr)\n throw std::runtime_error(SDL_GetError());\n}\n\nvoid ParticleFountain::run() {\n for (double df = 0.0001;;) {\n auto start = now();\n if (!handle_event())\n break;\n update(df);\n render();\n df = (now() - start) / 1000.0;\n }\n}\n\nvoid ParticleFountain::update(double df) {\n int pointidx = 0;\n for (PointInfo& point : point_info_) {\n bool willdraw = false;\n if (point.lifetime <= 0.0) {\n if (rand() < df) {\n point.lifetime = 2.5;\n point.x = width_ / 20.0;\n point.y = height_ / 10.0;\n point.vx =\n (spread_ * rand() - spread_ / 2 + reciprocate()) * 10.0;\n point.vy = (rand() - 2.9) * height_ / 20.5;\n willdraw = true;\n }\n } else {\n if (point.y > height_ / 10.0 && point.vy > 0)\n point.vy *= -0.3;\n point.vy += (height_ / 10.0) * df;\n point.x += point.vx * df;\n point.y += point.vy * df;\n point.lifetime -= df;\n willdraw = true;\n }\n if (willdraw) {\n points_[pointidx].x = std::floor(point.x * 10.0);\n points_[pointidx].y = std::floor(point.y * 10.0);\n ++pointidx;\n }\n }\n num_points_ = pointidx;\n}\n\nbool ParticleFountain::handle_event() {\n bool result = true;\n SDL_Event event;\n while (result && SDL_PollEvent(&event)) {\n switch (event.type) {\n case SDL_QUIT:\n result = false;\n break;\n case SDL_WINDOWEVENT:\n if (event.window.event == SDL_WINDOWEVENT_RESIZED) {\n width_ = event.window.data1;\n height_ = event.window.data2;\n }\n break;\n case SDL_KEYDOWN:\n switch (event.key.keysym.scancode) {\n case SDL_SCANCODE_UP:\n saturation_ = std::min(saturation_ + 0.1, 1.0);\n break;\n case SDL_SCANCODE_DOWN:\n saturation_ = std::max(saturation_ - 0.1, 0.0);\n break;\n case SDL_SCANCODE_PAGEUP:\n spread_ = std::min(spread_ + 0.1, 5.0);\n break;\n case SDL_SCANCODE_PAGEDOWN:\n spread_ = std::max(spread_ - 0.1, 0.2);\n break;\n case SDL_SCANCODE_RIGHT:\n range_ = std::min(range_ + 0.1, 2.0);\n break;\n case SDL_SCANCODE_LEFT:\n range_ = std::max(range_ - 0.1, 0.1);\n break;\n case SDL_SCANCODE_SPACE:\n reciprocate_ = !reciprocate_;\n break;\n case SDL_SCANCODE_Q:\n result = false;\n break;\n default:\n break;\n }\n break;\n }\n }\n return result;\n}\n\nvoid ParticleFountain::render() {\n SDL_Renderer* renderer = renderer_.get();\n SDL_SetRenderDrawColor(renderer, 0x0, 0x0, 0x0, 0xff);\n SDL_RenderClear(renderer);\n auto [red, green, blue] = hsv_to_rgb((now() % 5) * 72, saturation_, 1);\n SDL_SetRenderDrawColor(renderer, red, green, blue, 0x7f);\n SDL_RenderDrawPoints(renderer, points_.data(), num_points_);\n SDL_RenderPresent(renderer);\n}\n\nint main() {\n std::cout << \"Use UP and DOWN arrow keys to modify the saturation of the \"\n \"particle colors.\\n\"\n \"Use PAGE UP and PAGE DOWN keys to modify the \\\"spread\\\" of \"\n \"the particles.\\n\"\n \"Toggle reciprocation off / on with the SPACE bar.\\n\"\n \"Use LEFT and RIGHT arrow keys to modify angle range for \"\n \"reciprocation.\\n\"\n \"Press the \\\"q\\\" key to quit.\\n\";\n\n if (SDL_Init(SDL_INIT_VIDEO) != 0) {\n std::cerr << \"ERROR: \" << SDL_GetError() << '\\n';\n return EXIT_FAILURE;\n }\n\n try {\n ParticleFountain pf(3000, 800, 800);\n pf.run();\n } catch (const std::exception& ex) {\n std::cerr << \"ERROR: \" << ex.what() << '\\n';\n SDL_Quit();\n return EXIT_FAILURE;\n }\n\n SDL_Quit();\n return EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"rad = 0.125\nn = 6000\n#\nlen x[] n ; len y[] n\nlen vx[] n ; len vy[] n\nbackground 479\ncolor 999\non animate\n for i = 1 to 32\n ind = (ind + 1) mod1 n\n x[ind] = 50 + randomf\n y[ind] = i / 4\n vx[ind] = (randomf - 0.5) * 0.4\n vy[ind] = 2 + randomf * 0.1\n .\n clear\n for i = 1 to n\n move x[i] y[i]\n circle rad\n x[i] += vx[i] ; y[i] += vy[i]\n vy[i] -= 0.025\n .\n.\n","language":"EasyLang"},{"code":"import java.awt.Canvas;\nimport java.awt.Color;\nimport java.awt.Dimension;\nimport java.awt.EventQueue;\nimport java.awt.Graphics2D;\nimport java.awt.Point;\nimport java.awt.event.KeyAdapter;\nimport java.awt.event.KeyEvent;\nimport java.awt.image.BufferStrategy;\nimport java.util.Arrays;\nimport java.util.concurrent.ExecutorService;\nimport java.util.concurrent.Executors;\nimport java.util.concurrent.ThreadLocalRandom;\n\nimport javax.swing.JFrame;\n\npublic final class ParticleFountainTask {\n\n public static void main(String[] args) {\n \tEventQueue.invokeLater( () -> {\n \t\t JFrame.setDefaultLookAndFeelDecorated(true);\n JFrame frame = new JFrame(\"Particle Fountain\");\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\n frame.setResizable(false);\n ParticleFountain particleFountain = new ParticleFountain(3_000, 1_000, 750);\n frame.add(particleFountain);\n frame.pack();\n frame.setLocationRelativeTo(null);\n frame.setVisible(true);\n\n particleFountain.start();\n \t} );\n }\n\n private static final class ParticleFountain extends Canvas {\n\n public ParticleFountain(int aParticleCount, int aWidth, int aHeight) {\n \tparticleCount = aParticleCount;\n \t\twidth = aWidth;\n \t\theight = aHeight;\n \t\tsaturation = 0.6;\n \t\tspread = 1.5;\n \t\trange = 1.5;\n \t\treciprocate = false; \t\t \t\t\n \t\t\t\t\n \t\tsetPreferredSize( new Dimension(width, height) );\n \t\taddKeyListener( new InputHandler() ); \t\t\n \t\t\n \t\texecutorService = Executors.newSingleThreadExecutor();\n }\n\n public void start() {\n \trequestFocus();\n createBufferStrategy(2);\n executorService.execute( new DrawingCycle() );\n }\n\n private final class DrawingCycle implements Runnable {\n \t\n \tpublic DrawingCycle() {\n \t\tpositions = new double[2 * particleCount];\n \t\tvelocities = new double[2 * particleCount];\n \t lifetimes = new double[particleCount];\n \t points = new Point[particleCount];\n \t Arrays.fill(points, new Point(0, 0) );\n \t\n \t random = ThreadLocalRandom.current();\n \t}\n\n @Override\n public void run() {\n bufferStrategy = getBufferStrategy();\n\n while ( true ) {\n update(0.005);\n draw();\n }\n }\n\n private void update(double animationSpeed) {\n \tint xIndex = 0;\n \t\tint yIndex = 1;\n \t\tpointIndex = 0;\n\n \t\tfor ( int index = 0; index < particleCount; index++ ) {\n \t\t boolean showParticle = false;\n \t\t if ( lifetimes[index] <= 0.0 ) {\n \t\t if ( random.nextDouble() < animationSpeed ) {\n \t\t\t lifetimes[index] = 2.5;\n \t\t\t positions[xIndex] = width / 20;\n \t\t\t positions[yIndex] = height / 10;\n \t\t\t velocities[xIndex] =\n \t\t\t \t10 * ( spread * random.nextDouble() - spread / 2 + additionalXSpeed() );\n \t\t\t velocities[yIndex] = ( random.nextDouble() - 2.9 ) * height / 20.5;\n \t\t\t showParticle = true;\n \t\t }\n \t\t } else {\n \t\t if ( positions[yIndex] > height / 10 && velocities[yIndex] > 0 ) {\n \t\t velocities[yIndex] *= -0.3; // bounce particle\n \t\t }\n \t\t\n \t\t velocities[yIndex] += animationSpeed * height / 10;\n \t\t positions[xIndex] += velocities[xIndex] * animationSpeed;\n \t\t positions[yIndex] += velocities[yIndex] * animationSpeed;\n \t\t lifetimes[index] -= animationSpeed;\n \t\t showParticle = true;\n \t\t }\n\n \t\t if ( showParticle ) {\n \t\t points[pointIndex] = new Point((int) ( positions[xIndex] * 10 ),\n \t\t \t\t (int) ( positions[yIndex] * 10 ));\n \t\t pointIndex += 1;\n \t\t }\n \t\t\n \t\t xIndex += 2;\n \t\t yIndex = xIndex + 1;\n \t\t}\n }\n\n private void draw() {\n Graphics2D graphics2D = (Graphics2D) bufferStrategy.getDrawGraphics();\n \t\tgraphics2D.setColor(Color.BLACK);\n \t\tgraphics2D.fillRect(0, 0, getWidth(), getHeight());\t\t\n \t\tfor ( int i = 0; i < pointIndex; i++ ) {\n \t\t\tgraphics2D.setColor(Color.getHSBColor(random.nextFloat(), (float) saturation, 1.0F));\n \t\t\tgraphics2D.fillOval(points[i].x, points[i].y, 5, 5);\n \t\t}\n \t\tgraphics2D.dispose();\n\n bufferStrategy.show();\n }\n\n private double additionalXSpeed() {\n \t\treturn ( reciprocate ) ? range * Math.sin(System.currentTimeMillis() / 1_000) : 0.0;\t\t\n \t}\n\n private double[] positions;\n \tprivate double[] velocities;\n private double[] lifetimes;\n private int pointIndex;\n private Point[] points;\n private BufferStrategy bufferStrategy;\n private ThreadLocalRandom random;\n\n } // End DrawingCycle class\n\n private final class InputHandler extends KeyAdapter {\n \t\t\n \t\t@Override\n \t\tpublic void keyPressed(KeyEvent aKeyEvent) {\n \t\t\tfinal int keyCode = aKeyEvent.getKeyCode();\n \t\t\tswitch ( keyCode ) {\n \t\t\t\tcase KeyEvent.VK_UP -> saturation = Math.min(saturation + 0.1, 1.0);\n \t\t\t\tcase KeyEvent.VK_DOWN -> saturation = Math.max(saturation - 0.1, 0.0);\n \t\t\t\tcase KeyEvent.VK_PAGE_UP -> spread = Math.min(spread + 0.1, 5.0);\n \t\t\t\tcase KeyEvent.VK_PAGE_DOWN -> spread = Math.max(spread - 0.1, 0.5);\n \t\t\t\tcase KeyEvent.VK_RIGHT -> range = Math.min(range + 0.1, 2.0);\n \t\t\t\tcase KeyEvent.VK_LEFT -> range = Math.max(range + 0.1, 0.1);\n \t\t\t\tcase KeyEvent.VK_SPACE -> reciprocate = ! reciprocate;\n \t\t\t\tcase KeyEvent.VK_Q -> Runtime.getRuntime().exit(0);\n \t\t\t\tdefault -> { /* Take no action */ }\n \t\t\t}\t\n \t\t}\n \t\t\n \t} // End InputHandler class\n\n private int particleCount;\n \tprivate int width;\n \tprivate int height;\n \tprivate double saturation;\n \tprivate double spread;\n \tprivate double range;\n \tprivate boolean reciprocate;\t\n \tprivate ExecutorService executorService; \t \t\n\n } // End ParticleFountain class\n\n} // End ParticleFountainTask class\n","language":"Java"},{"code":"using Dates, Colors, SimpleDirectMediaLayer.LibSDL2\n\nmutable struct ParticleFountain\n particlenum::Int\n positions::Vector{Float64}\n velocities::Vector{Float64}\n lifetimes::Vector{Float64}\n points::Vector{SDL_Point}\n numpoints::Int\n saturation::Float64\n spread::Float64\n range::Float64\n reciprocate::Bool\n ParticleFountain(N) = new(N, zeros(2N), zeros(2N), zeros(N), fill(SDL_Point(0, 0), N),\n 0, 0.4, 1.5, 1.5, false)\nend\n\nfunction update(pf, w, h, df)\n xidx, yidx, pointidx = 1, 2, 0\n recip() = pf.reciprocate ? pf.range * sin(Dates.value(now()) / 1000) : 0.0\n for idx in 1:pf.particlenum\n willdraw = false\n if pf.lifetimes[idx] <= 0.0\n if rand() < df\n pf.lifetimes[idx] = 2.5; # time to live\n pf.positions[xidx] = (w / 20) # starting position x\n pf.positions[yidx] = (h / 10) # and y\n pf.velocities[xidx] = 10 * (pf.spread * rand() - pf.spread / 2 + recip()) # starting velocity x\n pf.velocities[yidx] = (rand() - 2.9) * h / 20.5; # and y (randomized slightly so points reach different heights)\n willdraw = true\n end\n else\n if pf.positions[yidx] > h / 10 && pf.velocities[yidx] > 0\n pf.velocities[yidx] *= -0.3 # \"bounce\"\n end\n pf.velocities[yidx] += df * h / 10 # adjust velocity\n pf.positions[xidx] += pf.velocities[xidx] * df # adjust position x\n pf.positions[yidx] += pf.velocities[yidx] * df # and y\n pf.lifetimes[idx] -= df\n willdraw = true\n end\n\n if willdraw # gather all of the points that are going to be rendered\n pointidx += 1\n pf.points[pointidx] = SDL_Point(Cint(floor(pf.positions[xidx] * 10)),\n Cint(floor(pf.positions[yidx] * 10)))\n end\n xidx += 2\n yidx = xidx + 1\n pf.numpoints = pointidx\n end\n return pf\nend\n\nfunction fountain(particlenum = 3000, w = 800, h = 800)\n SDL_Init(SDL_INIT_VIDEO)\n window = SDL_CreateWindow(\"Julia Particle System!\", SDL_WINDOWPOS_CENTERED_MASK,\n SDL_WINDOWPOS_CENTERED_MASK, w, h, SDL_WINDOW_RESIZABLE)\n renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED)\n SDL_ClearError()\n df = 0.0001\n pf = ParticleFountain(3000)\n overallstart, close, frames = now(), false, 0\n while !close\n dfstart = now()\n event_ref = Ref{SDL_Event}()\n while Bool(SDL_PollEvent(event_ref))\n event_type = event_ref[].type\n evt = event_ref[]\n if event_type == SDL_QUIT\n close = true\n break\n end\n if event_type == SDL_WINDOWEVENT\n if evt.window.event == 5\n w = evt.window.data1\n h = evt.window.data2\n end\n end\n if event_type == SDL_KEYDOWN\n comm = evt.key.keysym.scancode\n if comm == SDL_SCANCODE_UP\n saturation = min(pf.saturation + 0.1, 1.0)\n elseif comm == SDL_SCANCODE_DOWN\n saturation = max(pf.saturation - 0.1, 0.0)\n elseif comm == SDL_SCANCODE_PAGEUP\n spread = min(pf.spread + 1, 50.0)\n elseif comm == SDL_SCANCODE_PAGEDOWN\n spread = max(pf.spread - 0.1, 0.2)\n elseif comm == SDL_SCANCODE_LEFT\n range = min(pf.range + 0.1, 12.0)\n elseif comm == SDL_SCANCODE_RIGHT\n range = max(pf.range - 0.1, 0.1)\n elseif comm == SDL_SCANCODE_SPACE\n pf.reciprocate = !pf.reciprocate\n elseif comm == SDL_SCANCODE_Q\n close = true\n break\n end\n end\n end\n pf = update(pf, w, h, df)\n SDL_SetRenderDrawColor(renderer, 0x0, 0x0, 0x0, 0xff)\n SDL_RenderClear(renderer)\n rgb = parse(UInt32, hex(HSL((Dates.value(now()) % 5) * 72, pf.saturation, 0.5)), base=16)\n red, green, blue = rgb & 0xff, (rgb >> 8) & 0xff, (rgb >>16) & 0xff\n SDL_SetRenderDrawColor(renderer, red, green, blue, 0x7f)\n SDL_RenderDrawPoints(renderer, pf.points, pf.numpoints)\n SDL_RenderPresent(renderer)\n frames += 1\n df = Float64(Dates.value(now()) - Dates.value(dfstart)) / 1000\n elapsed = Float64(Dates.value(now()) - Dates.value(overallstart)) / 1000\n elapsed > 0.5 && print(\"\\r\", ' '^20, \"\\rFPS: \", round(frames / elapsed, digits=1))\n end\n SDL_Quit()\nend\n\nprintln(\"\"\"\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\n Use PAGE UP and PAGE DOWN keys to modify the \"spread\" of the particles.\n Toggle reciprocation off / on with the SPACE bar.\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\n Press the \"q\" key to quit.\n\"\"\")\n\nfountain()\n","language":"Julia"},{"code":"-- Returns canvas of given width and height containing a circle\nfunction initCanvas (width, height)\n local c = love.graphics.newCanvas(width, height)\n love.graphics.setCanvas(c) -- Switch to drawing on canvas 'c'\n love.graphics.circle(\"fill\", width / 2, height / 2, 2, 100)\n love.graphics.setCanvas() -- Switch back to drawing on main screen\n return c\nend\n\n-- Returns particle system with given canvas\nfunction initPartSys (image, maxParticles)\n local ps = love.graphics.newParticleSystem(image, maxParticles)\n ps:setParticleLifetime(3, 5) -- (min, max)\n ps:setDirection(math.pi * 1.5)\n ps:setSpeed(700)\n ps:setLinearAcceleration(-100, 500, 100, 700) -- (minX, minY, maxX, maxY)\n ps:setEmissionRate(1000)\n ps:setPosition(400, 550)\n ps:setColors(1, 1, 1, 1, 0, 0, 1, 0) -- Start solid white, fade to transluscent blue\n return ps\nend\n\n-- LÖVE callback that runs on program start\nfunction love.load ()\n love.window.setTitle(\"Lua particle fountain\")\n local canvas = initCanvas(10, 10)\n psystem = initPartSys(canvas, 10000)\nend\n\n-- LÖVE callback to update values before each frame\nfunction love.update (dt)\n psystem:update(dt)\nend\n\n-- LÖVE callback to draw each frame to the screen\nfunction love.draw ()\n love.graphics.draw(psystem)\nend\n","language":"Lua"},{"code":"import std/[lenientops, math, monotimes, random, times]\nimport sdl2\n\ntype ParticleFountain[N: static Positive] = object\n positions: array[1..2 * N, float]\n velocities: array[1..2 * N, float]\n lifetimes: array[1..N, float]\n points: array[1..N, Point]\n numPoints: int\n saturation: float\n spread: float\n range: float\n reciprocate: bool\n\nproc initParticleFountain[N: static Positive](): ParticleFountain[N] =\n ParticleFountain[N](saturation: 0.4, spread: 1.5, range: 1.5)\n\nproc update(pf: var ParticleFountain; w, h: cint; df: float) =\n var\n xidx = 1\n yidx = 2\n pointidx = 0\n\n template recip(pf: ParticleFountain): float =\n if pf.reciprocate: pf.range * sin(epochTime() / 1000) else: 0.0\n\n for idx in 1..pf.N:\n var willDraw = false\n if pf.lifetimes[idx] <= 0:\n if rand(1.0) < df:\n pf.lifetimes[idx] = 2.5 # Time to live.\n # Starting position.\n pf.positions[xidx] = w / 20\n pf.positions[yidx] = h / 10\n # Starting velocity.\n pf.velocities[xidx] = 10 * (pf.spread * rand(1.0) - pf.spread / 2 + pf.recip())\n pf.velocities[yidx] = (rand(1.0) - 2.9) * h / 20.5\n willDraw = true\n else:\n if pf.positions[yidx] > h / 10 and pf.velocities[yidx] > 0:\n pf.velocities[yidx] *= -0.3 # \"Bounce\".\n pf.velocities[yidx] += df * h / 10 # Adjust velocity.\n pf.positions[xidx] += pf.velocities[xidx] * df # Adjust position x.\n pf.positions[yidx] += pf.velocities[yidx] * df # Adjust position y.\n pf.lifetimes[idx] -= df\n willDraw = true\n\n if willDraw:\n # Gather all of the points that are going to be rendered.\n inc pointIdx\n pf.points[pointidx] = (cint(pf.positions[xidx] * 10), cint(pf.positions[yidx] * 10))\n inc xidx, 2\n yidx = xidx + 1\n pf.numPoints = pointidx\n\nfunc hsvToRgb(h, s, v: float): (byte, byte, byte) =\n let hp = h / 60.0\n let c = s * v\n let x = c * (1 - abs(hp mod 2 - 1))\n let m = v - c\n var (r, g, b) = if hp <= 1: (c, x, 0.0)\n elif hp <= 2: (x, c, 0.0)\n elif hp <= 3: (0.0, c, x)\n elif hp <= 4: (0.0, x, c)\n elif hp <= 5: (x, 0.0, c)\n else: (c, 0.0, x)\n r += m\n g += m\n b += m\n result = (byte(r * 255), byte(g * 255), byte(b * 255))\n\nproc fountain(particleNum = 3000; w = 800; h = 800) =\n var w = w.cint\n var h = h.cint\n discard sdl2.init(INIT_VIDEO or INIT_EVENTS)\n let window = createWindow(\"Nim Particle System!\", SDL_WINDOWPOS_CENTERED_MASK,\n SDL_WINDOWPOS_CENTERED_MASK, w, h, SDL_WINDOW_RESIZABLE)\n let renderer = createRenderer(window, -1, 0)\n clearError()\n var df = 0.0001\n var pf = initParticleFountain[3000]()\n var close = false\n var frames = 0\n block Simulation:\n while not close:\n let dfStart = getMonoTime()\n var event: Event\n while bool(pollEvent(event)):\n case event.kind\n of QuitEvent:\n break Simulation\n of WindowEvent:\n if event.window.event == WindowEvent_Resized:\n w = event.window.data1\n h = event.window.data2\n of KeyDown:\n let comm = event.key.keysym.sym\n case comm\n of K_UP:\n pf.saturation = min(pf.saturation + 0.1, 1.0)\n of K_DOWN:\n pf.saturation = max(pf.saturation - 0.1, 0.0)\n of K_PAGEUP:\n pf.spread = min(pf.spread + 1.0, 50.0)\n of K_PAGEDOWN:\n pf.spread = max(pf.spread - 0.1, 0.2)\n of K_LEFT:\n pf.range = min(pf.range + 0.1, 12.0)\n of K_RIGHT:\n pf.range = max(pf.range - 0.1, 0.1)\n of K_SPACE:\n pf.reciprocate = not pf.reciprocate\n of K_Q:\n break Simulation\n else:\n discard\n else:\n discard\n\n pf.update(w, h, df)\n renderer.setDrawColor(0x0, 0x0, 0x0, 0xff)\n renderer.clear()\n let (red, green, blue) = hsvToRgb(epochTime() mod 5 * 72, pf.saturation, 1.0)\n renderer.setDrawColor(red, green, blue, 0x7f)\n renderer.drawPoints(pf.points[1].addr, pf.numPoints.cint)\n renderer.present()\n inc frames\n df = (getMonoTime() - dfStart).inMilliseconds.float / 1000\n\n sdl2.quit()\n\nrandomize()\necho \"\"\"\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\n Use PAGE UP and PAGE DOWN keys to modify the \"spread\" of the particles.\n Toggle reciprocation off / on with the SPACE bar.\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\n Press the \"q\" key to quit.\n\"\"\"\nfountain()\n","language":"Nim"},{"code":"#!/usr/bin/perl\n\nuse strict; # https://rosettacode.org/wiki/Particle_fountain\nuse warnings;\nuse Tk;\n\nmy $size = 900;\nmy @particles;\nmy $maxparticles = 500;\nmy @colors = qw( red green blue yellow cyan magenta orange white );\n\nmy $mw = MainWindow->new;\nmy $c = $mw->Canvas( -width => $size, -height => $size, -bg => 'black',\n )->pack;\n$mw->Button(-text => 'Exit', -command => sub {$mw->destroy},\n )->pack(-fill => 'x');\n\nstep();\nMainLoop;\n-M $0 < 0 and exec $0;\n\nsub step\n {\n $c->delete('all');\n $c->createLine($size / 2 - 10, $size, $size / 2, $size - 10,\n $size / 2 + 10, $size, -fill => 'white' );\n for ( @particles )\n {\n my ($ox, $oy, $vx, $vy, $color) = @$_;\n my $x = $ox + $vx;\n my $y = $oy + $vy;\n $c->createRectangle($ox, $oy, $x, $y, -fill => $color, -outline => $color);\n if( $y < $size )\n {\n $_->[0] = $x;\n $_->[1] = $y;\n $_->[3] += 0.006; # gravity :)\n }\n else { $_ = undef }\n }\n @particles = grep defined, @particles;\n if( @particles < $maxparticles and --$| )\n {\n push @particles, [ $size >> 1, $size - 10,\n (1 - rand 2) / 2.5 , -3 - rand 0.05, $colors[rand @colors] ];\n }\n $mw->after(1 => \\&step);\n }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Particle_fountain.exw\n -- ==================================\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">canvas</span>\n <span style=\"color: #004080;\">cdCanvas</span> <span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cdcanvas</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">title</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"Particle fountain\"</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">help_text</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n Uparrow increases the saturation of the particle colors,\n downarrow decreases saturation until they all become white.\n PageUp sprays the particles out at a wider angle/spread,\n PageDown makes the jet narrower.\n Space toggles reciprocation (wobble) on and off (straight up).\n Left arrow decreases the angle range for reciprocation,\n right arrow increases the angle range for reciprocation.\n Press the \"q\" key to quit.\n \"\"\"</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">particlenum</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">3000</span>\n <span style=\"color: #000080;font-style:italic;\">-- each particle is {x,y,color,life,dx,dy}</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">particles</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">particlenum</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fps</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">reciprocate</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">range</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1.5</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">spread</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1.5</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">saturation</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.4</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">df</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0.0001</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">redraw_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000080;font-style:italic;\">/*posx*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">/*posy*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetIntInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"DRAWSIZE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasActivate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasClear</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">particles</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">color</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">life</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">particles</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">life</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">cdCanvasPixel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">color</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">cdCanvasFlush</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">map_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">cdcanvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cdCreateCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">CD_IUP</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">cddbuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cdCreateCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">CD_DBUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetBackground</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_BLACK</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">timer_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetIntInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"DRAWSIZE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">fps</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">df</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">start</span>\n <span style=\"color: #000000;\">start</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">particlenum</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">color</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">life</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">particles</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">life</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">()<</span><span style=\"color: #000000;\">df</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">life</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2.5</span> <span style=\"color: #000080;font-style:italic;\">-- time to live</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span> <span style=\"color: #000080;font-style:italic;\">-- starting position x</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span> <span style=\"color: #000080;font-style:italic;\">-- and y\n -- randomize velocity so points reach different heights:</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">reciprocate</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">range</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">sin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()):</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">dx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">spread</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">spread</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">50</span> <span style=\"color: #000080;font-style:italic;\">-- starting velocity x</span>\n <span style=\"color: #000000;\">dy</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">2.9</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">20.5</span> <span style=\"color: #000080;font-style:italic;\">-- and y </span>\n <span style=\"color: #000000;\">color</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">hsv_to_rgb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">round</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">(),</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">saturation</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">dy</span> <span style=\"color: #0000FF;\">*=</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.3</span> <span style=\"color: #000080;font-style:italic;\">-- \"bounce\"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">dy</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">df</span> <span style=\"color: #000080;font-style:italic;\">-- adjust velocity</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">df</span> <span style=\"color: #000080;font-style:italic;\">-- adjust position x</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">df</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">8</span> <span style=\"color: #000080;font-style:italic;\">-- and y</span>\n <span style=\"color: #000000;\">life</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">df</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">particles</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">color</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">life</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">IupRedraw</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">t1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s (%d, %d fps/s [%dx%d])\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">particlenum</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fps</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">t1</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #000000;\">fps</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">key_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*dlg*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_ESC</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">lower</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #008000;\">'q'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CLOSE</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_F1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #7060A8;\">IupMessage</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">help_text</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_UP</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">saturation</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">saturation</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_DOWN</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">saturation</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">saturation</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_PGUP</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">spread</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">spread</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_PGDN</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">spread</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">spread</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_RIGHT</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">range</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">range</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_LEFT</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">range</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">range</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0.1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_SP</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">reciprocate</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">reciprocate</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CONTINUE</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">canvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGLCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"RASTERSIZE=400x300\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallbacks</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"ACTION\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"redraw_cb\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #008000;\">\"MAP_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"map_cb\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`TITLE=\"%s\"`</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">title</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"KEY_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"key_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">timer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupTimer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"timer_cb\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">1000</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">25</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupShowXY</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">IUP_CENTER</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">IUP_CENTER</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"RASTERSIZE\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"# Using SDL2 library: # pip install PySDL2\n\nimport sys\nimport random\nimport time\nimport math\n\nimport sdl2\nimport sdl2.ext\n\nFPS = 60\nNEW_PARTICLES_PER_FRAME = 10\nMAX_PARTICLES = 5_000\nGRAVITY = 100\nWIDTH = 640\nHEIGHT = 480\n\n\ndef clamp(value, min_, max_):\n \"\"\"Return value clamped between min and max\"\"\"\n return max(min_, min(value, max_))\n\n\nclass Particle:\n \"\"\"Particle obeying gravity law.\"\"\"\n\n def __init__(self):\n self.x = 0\n self.y = 0\n self.v_x = 0\n self.v_y = 0\n\n def update(self, dtime: float) -> None:\n \"\"\"Move particle and update speed with gravity\"\"\"\n self.x = self.x + self.v_x * dtime\n self.y = self.y + self.v_y * dtime\n self.v_y = self.v_y + GRAVITY * dtime\n\n def set(self, x, y, v_x, v_y):\n \"\"\"Set particle values\"\"\"\n self.x = x\n self.y = y\n self.v_x = v_x\n self.v_y = v_y\n\n\nclass Fountain:\n \"\"\"The fountain\"\"\"\n\n def __init__(self, max_particles: int, particles_per_frame: int):\n self.particles_per_frame = particles_per_frame\n self.max_particles = max_particles\n self.spread = 10.0\n self.range = math.sqrt(2 * GRAVITY * (HEIGHT - 20 - self.spread))\n self.saturation = 155\n self.reciprocate = False\n self.reciprocating_time = 0.0\n self.particles = [\n self.init_particle(Particle()) for _ in range(self.particles_per_frame)\n ]\n\n def update(self, dtime) -> None:\n \"\"\"Update particles\"\"\"\n if self.reciprocate:\n self.reciprocating_time += dtime\n\n for particle in self.particles:\n particle.update(dtime)\n if particle.y > HEIGHT - 10:\n self.init_particle(particle)\n\n if len(self.particles) < self.max_particles:\n for _ in range(self.particles_per_frame):\n self.particles.append(self.init_particle(Particle()))\n # print(len(particles))\n\n def render(self, renderer: sdl2.ext.renderer.Renderer) -> None:\n \"\"\"Render particles\"\"\"\n points = [(particle.x, particle.y) for particle in self.particles]\n\n renderer.clear()\n renderer.draw_point(\n points, sdl2.ext.Color(self.saturation, self.saturation, 255)\n )\n renderer.present()\n\n def step_parameter(self, param, step):\n \"\"\"Change parameters\"\"\"\n if param == \"spread\":\n self.spread = clamp(self.spread + step, 0, 50)\n elif param == \"range\":\n self.range = clamp(self.range + step, 0, 300)\n elif param == \"color\":\n self.saturation = clamp(self.saturation + step, 0, 255)\n elif param == \"reciprocate\":\n self.reciprocate = not self.reciprocate\n self.reciprocating_time = 0.0\n\n def init_particle(self, particle: Particle) -> Particle:\n \"\"\"Move particle at initial position with a random-y speed\"\"\"\n radius = random.random() * self.spread\n direction = random.random() * math.pi * 2\n v_x = radius * math.cos(direction) + math.sin(self.reciprocating_time) * 20.0\n v_y = -self.range + radius * math.sin(direction)\n particle.set(WIDTH // 2, HEIGHT - 10, v_x, v_y)\n return particle\n\n\ndef make_renderer() -> sdl2.ext.renderer.Renderer:\n \"\"\"Initialise SDL and make renderer\"\"\"\n sdl2.ext.init()\n\n window = sdl2.ext.Window(\"Particle Fountain\", size=(WIDTH, HEIGHT))\n window.show()\n\n renderer = sdl2.ext.renderer.Renderer(window)\n\n return renderer\n\n\ndef limit_frame_rate(fps: float, cur_time: int) -> bool:\n \"\"\"Limit frame rate\"\"\"\n dtime = time.monotonic_ns() - cur_time\n frame_duration = 1e9 / fps\n if dtime < frame_duration:\n time.sleep((frame_duration - dtime) / 1e9)\n return True\n return False\n\n\ndef handle_events(fountain: Fountain):\n \"\"\"Act on events\"\"\"\n key_actions = {\n sdl2.SDL_SCANCODE_PAGEUP: lambda: fountain.step_parameter(\"color\", 5),\n sdl2.SDL_SCANCODE_PAGEDOWN: lambda: fountain.step_parameter(\"color\", -5),\n sdl2.SDL_SCANCODE_UP: lambda: fountain.step_parameter(\"range\", 1),\n sdl2.SDL_SCANCODE_DOWN: lambda: fountain.step_parameter(\"range\", -1),\n sdl2.SDL_SCANCODE_LEFT: lambda: fountain.step_parameter(\"spread\", -1),\n sdl2.SDL_SCANCODE_RIGHT: lambda: fountain.step_parameter(\"spread\", 1),\n sdl2.SDL_SCANCODE_SPACE: lambda: fountain.step_parameter(\"reciprocate\", 1),\n }\n\n events = sdl2.ext.get_events()\n for event in events:\n if event.type == sdl2.SDL_QUIT:\n return False\n if event.type == sdl2.SDL_KEYDOWN:\n if event.key.keysym.scancode in key_actions:\n key_actions[event.key.keysym.scancode]()\n elif event.key.keysym.scancode == sdl2.SDL_SCANCODE_Q:\n return False\n return True\n\n\ndef main_loop(renderer: sdl2.ext.renderer.Renderer, fountain: Fountain) -> None:\n \"\"\"Main animation loop\"\"\"\n running = True\n\n cur_time = time.monotonic_ns()\n while running:\n running = handle_events(fountain)\n\n fountain.render(renderer)\n\n if not limit_frame_rate(FPS, cur_time):\n print(f\"Didn't make it in time with {len(fountain.particles)} particles.\")\n\n dtime = (time.monotonic_ns() - cur_time) / 1e9 # in seconds\n fountain.update(dtime)\n cur_time = time.monotonic_ns()\n\n sdl2.ext.quit()\n\n\ndef run():\n \"\"\"Start!\"\"\"\n\n renderer = make_renderer()\n fountain = Fountain(MAX_PARTICLES, NEW_PARTICLES_PER_FRAME)\n\n main_loop(renderer, fountain)\n\n return 0\n\n\nif __name__ == \"__main__\":\n sys.exit(run())\n","language":"Python"},{"code":"use NativeCall;\nuse SDL2::Raw;\n\nmy int ($w, $h) = 800, 800;\nmy SDL_Window $window;\nmy SDL_Renderer $renderer;\n\nmy int $particlenum = 3000;\n\n\nSDL_Init(VIDEO);\n$window = SDL_CreateWindow(\n \"Raku Particle System!\",\n SDL_WINDOWPOS_CENTERED_MASK, SDL_WINDOWPOS_CENTERED_MASK,\n $w, $h,\n RESIZABLE\n);\n$renderer = SDL_CreateRenderer( $window, -1, ACCELERATED );\n\nSDL_ClearError();\n\nmy num @positions = 0e0 xx ($particlenum * 2);\nmy num @velocities = 0e0 xx ($particlenum * 2);\nmy num @lifetimes = 0e0 xx $particlenum;\n\nmy CArray[int32] $points .= new;\nmy int $numpoints;\nmy Num $saturation = 4e-1;\nmy Num $spread = 15e-1;\nmy &reciprocate = sub { 0 }\nmy $range = 1.5;\n\nsub update (num \\df) {\n my int $xidx = 0;\n my int $yidx = 1;\n my int $pointidx = 0;\n loop (my int $idx = 0; $idx < $particlenum; $idx = $idx + 1) {\n my int $willdraw = 0;\n if (@lifetimes[$idx] <= 0e0) {\n if (rand < df) {\n @lifetimes[$idx] = 25e-1; # time to live\n @positions[$xidx] = ($w / 20e0).Num; # starting position x\n @positions[$yidx] = ($h / 10).Num; # and y\n @velocities[$xidx] = ($spread * rand - $spread/2 + reciprocate()) * 10; # starting velocity x\n @velocities[$yidx] = (rand - 2.9e0) * $h / 20.5; # and y (randomized slightly so points reach different heights)\n $willdraw = 1;\n }\n } else {\n if @positions[$yidx] > $h / 10 && @velocities[$yidx] > 0 {\n @velocities[$yidx] = @velocities[$yidx] * -0.3e0; # \"bounce\"\n }\n\n @velocities[$yidx] = @velocities[$yidx] + $h/10.Num * df; # adjust velocity\n @positions[$xidx] = @positions[$xidx] + @velocities[$xidx] * df; # adjust position x\n @positions[$yidx] = @positions[$yidx] + @velocities[$yidx] * df; # and y\n\n @lifetimes[$idx] = @lifetimes[$idx] - df;\n $willdraw = 1;\n }\n\n if ($willdraw) {\n $points[$pointidx++] = (@positions[$xidx] * 10).floor; # gather all of the points that\n $points[$pointidx++] = (@positions[$yidx] * 10).floor; # are still going to be rendered\n }\n\n $xidx = $xidx + 2;\n $yidx = $xidx + 1;\n }\n $numpoints = ($pointidx - 1) div 2;\n}\n\nsub render {\n SDL_SetRenderDrawColor($renderer, 0x0, 0x0, 0x0, 0xff);\n SDL_RenderClear($renderer);\n\n SDL_SetRenderDrawColor($renderer, |hsv2rgb(((now % 5) / 5).round(.01), $saturation, 1), 0x7f);\n SDL_RenderDrawPoints($renderer, $points, $numpoints);\n\n SDL_RenderPresent($renderer);\n}\n\nenum KEY_CODES (\n K_UP => 82,\n K_DOWN => 81,\n K_LEFT => 80,\n K_RIGHT => 79,\n K_SPACE => 44,\n K_PGUP => 75,\n K_PGDN => 78,\n K_Q => 20,\n);\n\nsay q:to/DOCS/;\nUse UP and DOWN arrow keys to modify the saturation of the particle colors.\nUse PAGE UP and PAGE DOWN keys to modify the \"spread\" of the particles.\nToggle reciprocation off / on with the SPACE bar.\nUse LEFT and RIGHT arrow keys to modify angle range for reciprocation.\nPress the \"q\" key to quit.\nDOCS\n\nmy $event = SDL_Event.new;\n\nmy num $df = 0.0001e0;\n\nmain: loop {\n my $start = now;\n\n while SDL_PollEvent($event) {\n my $casted_event = SDL_CastEvent($event);\n\n given $casted_event {\n when *.type == QUIT {\n last main;\n }\n when *.type == WINDOWEVENT {\n if .event == RESIZED {\n $w = .data1;\n $h = .data2;\n }\n }\n when *.type == KEYDOWN {\n if KEY_CODES(.scancode) -> $comm {\n given $comm {\n when 'K_UP' { $saturation = (($saturation + .1) min 1e0) }\n when 'K_DOWN' { $saturation = (($saturation - .1) max 0e0) }\n when 'K_PGUP' { $spread = (($spread + .1) min 5e0) }\n when 'K_PGDN' { $spread = (($spread - .1) max 2e-1) }\n when 'K_RIGHT' { $range = (($range + .1) min 2e0) }\n when 'K_LEFT' { $range = (($range - .1) max 1e-1) }\n when 'K_SPACE' { &reciprocate = reciprocate() == 0 ?? sub { $range * sin(now) } !! sub { 0 } }\n when 'K_Q' { last main }\n }\n }\n }\n }\n }\n\n update($df);\n\n render();\n\n $df = (now - $start).Num;\n\n print fps();\n}\n\nsay '';\n\nsub fps {\n state $fps-frames = 0;\n state $fps-now = now;\n state $fps = '';\n $fps-frames++;\n if now - $fps-now >= 1 {\n $fps = [~] \"\\r\", ' ' x 20, \"\\r\",\n sprintf \"FPS: %5.1f \", ($fps-frames / (now - $fps-now));\n $fps-frames = 0;\n $fps-now = now;\n }\n $fps\n}\n\nsub hsv2rgb ( $h, $s, $v ){\n state %cache;\n %cache{\"$h|$s|$v\"} //= do {\n my $c = $v * $s;\n my $x = $c * (1 - abs( (($h*6) % 2) - 1 ) );\n my $m = $v - $c;\n [(do given $h {\n when 0..^1/6 { $c, $x, 0 }\n when 1/6..^1/3 { $x, $c, 0 }\n when 1/3..^1/2 { 0, $c, $x }\n when 1/2..^2/3 { 0, $x, $c }\n when 2/3..^5/6 { $x, 0, $c }\n when 5/6..1 { $c, 0, $x }\n } ).map: ((*+$m) * 255).Int]\n }\n}\n","language":"Raku"},{"code":"import \"dome\" for Window, Platform, Process\nimport \"graphics\" for Canvas, Color\nimport \"math\" for Math, Point\nimport \"random\" for Random\nimport \"input\" for Keyboard\nimport \"./dynamic\" for Struct\n\nvar Start = Platform.time\nvar Rand = Random.new()\n\nvar fields = [\n \"particleNum\",\n \"positions\",\n \"velocities\",\n \"lifetimes\",\n \"points\",\n \"numPoints\",\n \"saturation\",\n \"spread\",\n \"range\",\n \"reciprocate\"\n]\nvar ParticleFountain = Struct.create(\"ParticleFountain\", fields)\n\nclass ParticleDisplay {\n construct new(particleNum, width, height) {\n Window.resize(width, height)\n Canvas.resize(width, height)\n Window.title = \"Wren Particle System!\"\n _pn = particleNum\n _w = width\n _h = height\n _df = 1 / 200 // say\n _pf = ParticleFountain.new(\n _pn, // particleNum\n List.filled(_pn * 2, 0), // positions\n List.filled(_pn * 2, 0), // velocities\n List.filled(_pn, 0), // lifetimes\n List.filled(_pn, null), // points\n 0, // numPoints\n 0.4, // saturation\n 1.5, // spread\n 1.5, // range\n false // reciprocate\n )\n for (i in 0..._pn) _pf.points[i] = Point.new(0, 0)\n }\n\n init() {\n Canvas.cls()\n _frames = 0\n }\n\n updatePF() {\n var xidx = 0\n var yidx = 1\n var pointIdx = 0\n var recip = Fn.new { _pf.reciprocate ? _pf.range * Math.sin(Platform.time/1000) : 0 }\n for (idx in 0..._pf.particleNum) {\n var willDraw = false\n if (_pf.lifetimes[idx] <= 0) {\n if (Rand.float() < _df) {\n _pf.lifetimes[idx] = 2.5 // time to live\n _pf.positions[xidx] = _w / 20 // starting position x\n _pf.positions[yidx] = _h / 10 // and y\n\n // starting velocities x and y\n // randomized slightly so points reach different heights\n _pf.velocities[xidx] = 10 * (_pf.spread * Rand.float() - _pf.spread / 2 + recip.call())\n _pf.velocities[yidx] = (Rand.float() - 2.9) * _h / 20.5\n _willDraw = true\n }\n } else {\n if (_pf.positions[yidx] > _h/10 && _pf.velocities[yidx] > 0) {\n _pf.velocities[yidx] = _pf.velocities[yidx] * (-0.3) // bounce\n }\n _pf.velocities[yidx] = _pf.velocities[yidx] + _df * _h / 10 // adjust velocity\n _pf.positions[xidx] = _pf.positions[xidx] + _pf.velocities[xidx] * _df // adjust position x\n _pf.positions[yidx] = _pf.positions[yidx] + _pf.velocities[yidx] * _df // and y\n _pf.lifetimes[idx] = _pf.lifetimes[idx] - _df\n willDraw = true\n }\n if (willDraw) { // gather all the points that are going to be rendered\n _pf.points[pointIdx] = Point.new((_pf.positions[xidx] * 10).floor,\n (_pf.positions[yidx] * 10).floor)\n pointIdx = pointIdx + 1\n }\n xidx = xidx + 2\n yidx = xidx + 1\n _pf.numPoints = pointIdx\n }\n }\n\n update() {\n if (Keyboard[\"Up\"].justPressed) {\n _pf.saturation = Math.min(_pf.saturation + 0.1, 1)\n } else if (Keyboard[\"Down\"].justPressed) {\n _pf.saturation = Math.max(_pf.saturation - 0.1, 0)\n } else if (Keyboard[\"PageUp\"].justPressed) {\n _pf.spread = Math.min(_pf.spread + 1, 50)\n } else if (Keyboard[\"PageDown\"].justPressed) {\n _pf.spread = Math.max(_pf.spread - 0.1, 0.2)\n } else if (Keyboard[\"Left\"].justPressed) {\n _pf.range = Math.min(_pf.range + 0.1, 12)\n } else if (Keyboard[\"Right\"].justPressed) {\n _pf.range = Math.max(_pf.range - 0.1, 0.1)\n } else if (Keyboard[\"Space\"].justPressed) {\n _pf.reciprocate = !_pf.reciprocate\n } else if (Keyboard[\"Q\"].justPressed) {\n Process.exit()\n }\n updatePF()\n }\n\n draw(alpha) {\n var c = Color.hsv((Platform.time % 5) * 72, _pf.saturation, 0.5, 0x7f)\n for (i in 0..._pf.numPoints) {\n Canvas.pset(_pf.points[i].x, _pf.points[i].y, c)\n }\n _frames = _frames + 1\n var now = Platform.time\n if (now - Start >= 1) {\n Start = now\n Window.title = \"Wren Particle System! (FPS = %(_frames))\"\n _frames = 0\n }\n }\n}\n\nSystem.print(\"\"\"\n\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\n Use PAGE UP and PAGE DOWN keys to modify the \"spread\" of the particles.\n Toggle reciprocation off / on with the SPACE bar.\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\n Press the \"q\" key to quit.\n\"\"\")\n\nvar Game = ParticleDisplay.new(3000, 800, 800)\n","language":"Wren"},{"code":"func real RandomF;\nreturn float(Ran(1000)) / 1000.;\n\ndef N = 6000;\nreal X(N), Y(N);\nreal VX(N), VY(N);\ndef Color = 15;\nint I, Ind;\n[SetVid($12);\nInd:= 0;\nrepeat\n for I:= 1 to 32 do\n [Ind:= rem((Ind+1)/N);\n X(Ind):= 50. + RandomF;\n Y(Ind):= float(I)/4.;\n VX(Ind):= (RandomF - 0.5) * 0.4;\n VY(Ind):= 2. + RandomF*0.1;\n ];\n WaitForVSync;\n Clear;\n for I:= 0 to N-1 do\n [Point(fix(X(I)), 480-fix(Y(I)), Color);\n X(I):= X(I) + VX(I); Y(I):= Y(I) + VY(I);\n VY(I):= VY(I) - 0.025;\n ];\nuntil KeyHit;\n]\n","language":"XPL0"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Particle_fountain\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Implement a particle fountain.\\n\\nEmulate a fountain of water droplets in a gravitational field being sprayed up and then falling back down.\\n\\nThe particle fountain should be generally ordered but individually chaotic; the particles should be going mostly in the same direction, but should have slightly different vectors.\\n\\nYour fountain should have at least several hundred particles in motion at any one time, and ideally several thousand.\\n\\nIt is optional to have the individual particle interact with each other.\\n\\nIf at all possible, link to a short video clip of your fountain in action.\\n\\n[https://github.com/thundergnat/rc/blob/master/img/fountain-raku.mp4?raw=true Off-site link to a demo video] \\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"#include <SDL2/SDL.h>\\n\\n#include <algorithm>\\n#include <chrono>\\n#include <cmath>\\n#include <iostream>\\n#include <memory>\\n#include <random>\\n#include <tuple>\\n#include <vector>\\n\\nauto now() {\\n using namespace std::chrono;\\n auto time = system_clock::now();\\n return duration_cast<milliseconds>(time.time_since_epoch()).count();\\n}\\n\\nauto hsv_to_rgb(int h, double s, double v) {\\n double hp = h / 60.0;\\n double c = s * v;\\n double x = c * (1 - std::abs(std::fmod(hp, 2) - 1));\\n double m = v - c;\\n double r = 0, g = 0, b = 0;\\n if (hp <= 1) {\\n r = c;\\n g = x;\\n } else if (hp <= 2) {\\n r = x;\\n g = c;\\n } else if (hp <= 3) {\\n g = c;\\n b = x;\\n } else if (hp <= 4) {\\n g = x;\\n b = c;\\n } else if (hp <= 5) {\\n r = x;\\n b = c;\\n } else {\\n r = c;\\n b = x;\\n }\\n r += m;\\n g += m;\\n b += m;\\n return std::make_tuple(Uint8(r * 255), Uint8(g * 255), Uint8(b * 255));\\n}\\n\\nclass ParticleFountain {\\npublic:\\n ParticleFountain(int particles, int width, int height);\\n void run();\\n\\nprivate:\\n struct WindowDeleter {\\n void operator()(SDL_Window* window) const { SDL_DestroyWindow(window); }\\n };\\n struct RendererDeleter {\\n void operator()(SDL_Renderer* renderer) const {\\n SDL_DestroyRenderer(renderer);\\n }\\n };\\n struct PointInfo {\\n double x = 0;\\n double y = 0;\\n double vx = 0;\\n double vy = 0;\\n double lifetime = 0;\\n };\\n\\n void update(double df);\\n bool handle_event();\\n void render();\\n double rand() { return dist_(rng_); }\\n double reciprocate() const {\\n return reciprocate_ ? range_ * std::sin(now() / 1000.0) : 0.0;\\n }\\n\\n std::unique_ptr<SDL_Window, WindowDeleter> window_;\\n std::unique_ptr<SDL_Renderer, RendererDeleter> renderer_;\\n int width_;\\n int height_;\\n std::vector<PointInfo> point_info_;\\n std::vector<SDL_Point> points_;\\n int num_points_ = 0;\\n double saturation_ = 0.4;\\n double spread_ = 1.5;\\n double range_ = 1.5;\\n bool reciprocate_ = false;\\n std::mt19937 rng_;\\n std::uniform_real_distribution<> dist_;\\n};\\n\\nParticleFountain::ParticleFountain(int n, int width, int height)\\n : width_(width), height_(height), point_info_(n), points_(n, {0, 0}),\\n rng_(std::random_device{}()), dist_(0.0, 1.0) {\\n window_.reset(SDL_CreateWindow(\\n \\\"C++ Particle System!\\\", SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED,\\n width, height, SDL_WINDOW_RESIZABLE));\\n if (window_ == nullptr)\\n throw std::runtime_error(SDL_GetError());\\n\\n renderer_.reset(\\n SDL_CreateRenderer(window_.get(), -1, SDL_RENDERER_ACCELERATED));\\n if (renderer_ == nullptr)\\n throw std::runtime_error(SDL_GetError());\\n}\\n\\nvoid ParticleFountain::run() {\\n for (double df = 0.0001;;) {\\n auto start = now();\\n if (!handle_event())\\n break;\\n update(df);\\n render();\\n df = (now() - start) / 1000.0;\\n }\\n}\\n\\nvoid ParticleFountain::update(double df) {\\n int pointidx = 0;\\n for (PointInfo& point : point_info_) {\\n bool willdraw = false;\\n if (point.lifetime <= 0.0) {\\n if (rand() < df) {\\n point.lifetime = 2.5;\\n point.x = width_ / 20.0;\\n point.y = height_ / 10.0;\\n point.vx =\\n (spread_ * rand() - spread_ / 2 + reciprocate()) * 10.0;\\n point.vy = (rand() - 2.9) * height_ / 20.5;\\n willdraw = true;\\n }\\n } else {\\n if (point.y > height_ / 10.0 && point.vy > 0)\\n point.vy *= -0.3;\\n point.vy += (height_ / 10.0) * df;\\n point.x += point.vx * df;\\n point.y += point.vy * df;\\n point.lifetime -= df;\\n willdraw = true;\\n }\\n if (willdraw) {\\n points_[pointidx].x = std::floor(point.x * 10.0);\\n points_[pointidx].y = std::floor(point.y * 10.0);\\n ++pointidx;\\n }\\n }\\n num_points_ = pointidx;\\n}\\n\\nbool ParticleFountain::handle_event() {\\n bool result = true;\\n SDL_Event event;\\n while (result && SDL_PollEvent(&event)) {\\n switch (event.type) {\\n case SDL_QUIT:\\n result = false;\\n break;\\n case SDL_WINDOWEVENT:\\n if (event.window.event == SDL_WINDOWEVENT_RESIZED) {\\n width_ = event.window.data1;\\n height_ = event.window.data2;\\n }\\n break;\\n case SDL_KEYDOWN:\\n switch (event.key.keysym.scancode) {\\n case SDL_SCANCODE_UP:\\n saturation_ = std::min(saturation_ + 0.1, 1.0);\\n break;\\n case SDL_SCANCODE_DOWN:\\n saturation_ = std::max(saturation_ - 0.1, 0.0);\\n break;\\n case SDL_SCANCODE_PAGEUP:\\n spread_ = std::min(spread_ + 0.1, 5.0);\\n break;\\n case SDL_SCANCODE_PAGEDOWN:\\n spread_ = std::max(spread_ - 0.1, 0.2);\\n break;\\n case SDL_SCANCODE_RIGHT:\\n range_ = std::min(range_ + 0.1, 2.0);\\n break;\\n case SDL_SCANCODE_LEFT:\\n range_ = std::max(range_ - 0.1, 0.1);\\n break;\\n case SDL_SCANCODE_SPACE:\\n reciprocate_ = !reciprocate_;\\n break;\\n case SDL_SCANCODE_Q:\\n result = false;\\n break;\\n default:\\n break;\\n }\\n break;\\n }\\n }\\n return result;\\n}\\n\\nvoid ParticleFountain::render() {\\n SDL_Renderer* renderer = renderer_.get();\\n SDL_SetRenderDrawColor(renderer, 0x0, 0x0, 0x0, 0xff);\\n SDL_RenderClear(renderer);\\n auto [red, green, blue] = hsv_to_rgb((now() % 5) * 72, saturation_, 1);\\n SDL_SetRenderDrawColor(renderer, red, green, blue, 0x7f);\\n SDL_RenderDrawPoints(renderer, points_.data(), num_points_);\\n SDL_RenderPresent(renderer);\\n}\\n\\nint main() {\\n std::cout << \\\"Use UP and DOWN arrow keys to modify the saturation of the \\\"\\n \\\"particle colors.\\\\n\\\"\\n \\\"Use PAGE UP and PAGE DOWN keys to modify the \\\\\\\"spread\\\\\\\" of \\\"\\n \\\"the particles.\\\\n\\\"\\n \\\"Toggle reciprocation off / on with the SPACE bar.\\\\n\\\"\\n \\\"Use LEFT and RIGHT arrow keys to modify angle range for \\\"\\n \\\"reciprocation.\\\\n\\\"\\n \\\"Press the \\\\\\\"q\\\\\\\" key to quit.\\\\n\\\";\\n\\n if (SDL_Init(SDL_INIT_VIDEO) != 0) {\\n std::cerr << \\\"ERROR: \\\" << SDL_GetError() << '\\\\n';\\n return EXIT_FAILURE;\\n }\\n\\n try {\\n ParticleFountain pf(3000, 800, 800);\\n pf.run();\\n } catch (const std::exception& ex) {\\n std::cerr << \\\"ERROR: \\\" << ex.what() << '\\\\n';\\n SDL_Quit();\\n return EXIT_FAILURE;\\n }\\n\\n SDL_Quit();\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"rad = 0.125\\nn = 6000\\n#\\nlen x[] n ; len y[] n\\nlen vx[] n ; len vy[] n\\nbackground 479\\ncolor 999\\non animate\\n for i = 1 to 32\\n ind = (ind + 1) mod1 n\\n x[ind] = 50 + randomf\\n y[ind] = i / 4\\n vx[ind] = (randomf - 0.5) * 0.4\\n vy[ind] = 2 + randomf * 0.1\\n .\\n clear\\n for i = 1 to n\\n move x[i] y[i]\\n circle rad\\n x[i] += vx[i] ; y[i] += vy[i]\\n vy[i] -= 0.025\\n .\\n.\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"import java.awt.Canvas;\\nimport java.awt.Color;\\nimport java.awt.Dimension;\\nimport java.awt.EventQueue;\\nimport java.awt.Graphics2D;\\nimport java.awt.Point;\\nimport java.awt.event.KeyAdapter;\\nimport java.awt.event.KeyEvent;\\nimport java.awt.image.BufferStrategy;\\nimport java.util.Arrays;\\nimport java.util.concurrent.ExecutorService;\\nimport java.util.concurrent.Executors;\\nimport java.util.concurrent.ThreadLocalRandom;\\n\\nimport javax.swing.JFrame;\\n\\npublic final class ParticleFountainTask {\\n\\n public static void main(String[] args) {\\n \\tEventQueue.invokeLater( () -> {\\n \\t\\t JFrame.setDefaultLookAndFeelDecorated(true);\\n JFrame frame = new JFrame(\\\"Particle Fountain\\\");\\n frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\n frame.setResizable(false);\\n ParticleFountain particleFountain = new ParticleFountain(3_000, 1_000, 750);\\n frame.add(particleFountain);\\n frame.pack();\\n frame.setLocationRelativeTo(null);\\n frame.setVisible(true);\\n\\n particleFountain.start();\\n \\t} );\\n }\\n\\n private static final class ParticleFountain extends Canvas {\\n\\n public ParticleFountain(int aParticleCount, int aWidth, int aHeight) {\\n \\tparticleCount = aParticleCount;\\n \\t\\twidth = aWidth;\\n \\t\\theight = aHeight;\\n \\t\\tsaturation = 0.6;\\n \\t\\tspread = 1.5;\\n \\t\\trange = 1.5;\\n \\t\\treciprocate = false; \\t\\t \\t\\t\\n \\t\\t\\t\\t\\n \\t\\tsetPreferredSize( new Dimension(width, height) );\\n \\t\\taddKeyListener( new InputHandler() ); \\t\\t\\n \\t\\t\\n \\t\\texecutorService = Executors.newSingleThreadExecutor();\\n }\\n\\n public void start() {\\n \\trequestFocus();\\n createBufferStrategy(2);\\n executorService.execute( new DrawingCycle() );\\n }\\n\\n private final class DrawingCycle implements Runnable {\\n \\t\\n \\tpublic DrawingCycle() {\\n \\t\\tpositions = new double[2 * particleCount];\\n \\t\\tvelocities = new double[2 * particleCount];\\n \\t lifetimes = new double[particleCount];\\n \\t points = new Point[particleCount];\\n \\t Arrays.fill(points, new Point(0, 0) );\\n \\t\\n \\t random = ThreadLocalRandom.current();\\n \\t}\\n\\n @Override\\n public void run() {\\n bufferStrategy = getBufferStrategy();\\n\\n while ( true ) {\\n update(0.005);\\n draw();\\n }\\n }\\n\\n private void update(double animationSpeed) {\\n \\tint xIndex = 0;\\n \\t\\tint yIndex = 1;\\n \\t\\tpointIndex = 0;\\n\\n \\t\\tfor ( int index = 0; index < particleCount; index++ ) {\\n \\t\\t boolean showParticle = false;\\n \\t\\t if ( lifetimes[index] <= 0.0 ) {\\n \\t\\t if ( random.nextDouble() < animationSpeed ) {\\n \\t\\t\\t lifetimes[index] = 2.5;\\n \\t\\t\\t positions[xIndex] = width / 20;\\n \\t\\t\\t positions[yIndex] = height / 10;\\n \\t\\t\\t velocities[xIndex] =\\n \\t\\t\\t \\t10 * ( spread * random.nextDouble() - spread / 2 + additionalXSpeed() );\\n \\t\\t\\t velocities[yIndex] = ( random.nextDouble() - 2.9 ) * height / 20.5;\\n \\t\\t\\t showParticle = true;\\n \\t\\t }\\n \\t\\t } else {\\n \\t\\t if ( positions[yIndex] > height / 10 && velocities[yIndex] > 0 ) {\\n \\t\\t velocities[yIndex] *= -0.3; // bounce particle\\n \\t\\t }\\n \\t\\t\\n \\t\\t velocities[yIndex] += animationSpeed * height / 10;\\n \\t\\t positions[xIndex] += velocities[xIndex] * animationSpeed;\\n \\t\\t positions[yIndex] += velocities[yIndex] * animationSpeed;\\n \\t\\t lifetimes[index] -= animationSpeed;\\n \\t\\t showParticle = true;\\n \\t\\t }\\n\\n \\t\\t if ( showParticle ) {\\n \\t\\t points[pointIndex] = new Point((int) ( positions[xIndex] * 10 ),\\n \\t\\t \\t\\t (int) ( positions[yIndex] * 10 ));\\n \\t\\t pointIndex += 1;\\n \\t\\t }\\n \\t\\t\\n \\t\\t xIndex += 2;\\n \\t\\t yIndex = xIndex + 1;\\n \\t\\t}\\n }\\n\\n private void draw() {\\n Graphics2D graphics2D = (Graphics2D) bufferStrategy.getDrawGraphics();\\n \\t\\tgraphics2D.setColor(Color.BLACK);\\n \\t\\tgraphics2D.fillRect(0, 0, getWidth(), getHeight());\\t\\t\\n \\t\\tfor ( int i = 0; i < pointIndex; i++ ) {\\n \\t\\t\\tgraphics2D.setColor(Color.getHSBColor(random.nextFloat(), (float) saturation, 1.0F));\\n \\t\\t\\tgraphics2D.fillOval(points[i].x, points[i].y, 5, 5);\\n \\t\\t}\\n \\t\\tgraphics2D.dispose();\\n\\n bufferStrategy.show();\\n }\\n\\n private double additionalXSpeed() {\\n \\t\\treturn ( reciprocate ) ? range * Math.sin(System.currentTimeMillis() / 1_000) : 0.0;\\t\\t\\n \\t}\\n\\n private double[] positions;\\n \\tprivate double[] velocities;\\n private double[] lifetimes;\\n private int pointIndex;\\n private Point[] points;\\n private BufferStrategy bufferStrategy;\\n private ThreadLocalRandom random;\\n\\n } // End DrawingCycle class\\n\\n private final class InputHandler extends KeyAdapter {\\n \\t\\t\\n \\t\\t@Override\\n \\t\\tpublic void keyPressed(KeyEvent aKeyEvent) {\\n \\t\\t\\tfinal int keyCode = aKeyEvent.getKeyCode();\\n \\t\\t\\tswitch ( keyCode ) {\\n \\t\\t\\t\\tcase KeyEvent.VK_UP -> saturation = Math.min(saturation + 0.1, 1.0);\\n \\t\\t\\t\\tcase KeyEvent.VK_DOWN -> saturation = Math.max(saturation - 0.1, 0.0);\\n \\t\\t\\t\\tcase KeyEvent.VK_PAGE_UP -> spread = Math.min(spread + 0.1, 5.0);\\n \\t\\t\\t\\tcase KeyEvent.VK_PAGE_DOWN -> spread = Math.max(spread - 0.1, 0.5);\\n \\t\\t\\t\\tcase KeyEvent.VK_RIGHT -> range = Math.min(range + 0.1, 2.0);\\n \\t\\t\\t\\tcase KeyEvent.VK_LEFT -> range = Math.max(range + 0.1, 0.1);\\n \\t\\t\\t\\tcase KeyEvent.VK_SPACE -> reciprocate = ! reciprocate;\\n \\t\\t\\t\\tcase KeyEvent.VK_Q -> Runtime.getRuntime().exit(0);\\n \\t\\t\\t\\tdefault -> { /* Take no action */ }\\n \\t\\t\\t}\\t\\n \\t\\t}\\n \\t\\t\\n \\t} // End InputHandler class\\n\\n private int particleCount;\\n \\tprivate int width;\\n \\tprivate int height;\\n \\tprivate double saturation;\\n \\tprivate double spread;\\n \\tprivate double range;\\n \\tprivate boolean reciprocate;\\t\\n \\tprivate ExecutorService executorService; \\t \\t\\n\\n } // End ParticleFountain class\\n\\n} // End ParticleFountainTask class\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Dates, Colors, SimpleDirectMediaLayer.LibSDL2\\n\\nmutable struct ParticleFountain\\n particlenum::Int\\n positions::Vector{Float64}\\n velocities::Vector{Float64}\\n lifetimes::Vector{Float64}\\n points::Vector{SDL_Point}\\n numpoints::Int\\n saturation::Float64\\n spread::Float64\\n range::Float64\\n reciprocate::Bool\\n ParticleFountain(N) = new(N, zeros(2N), zeros(2N), zeros(N), fill(SDL_Point(0, 0), N),\\n 0, 0.4, 1.5, 1.5, false)\\nend\\n\\nfunction update(pf, w, h, df)\\n xidx, yidx, pointidx = 1, 2, 0\\n recip() = pf.reciprocate ? pf.range * sin(Dates.value(now()) / 1000) : 0.0\\n for idx in 1:pf.particlenum\\n willdraw = false\\n if pf.lifetimes[idx] <= 0.0\\n if rand() < df\\n pf.lifetimes[idx] = 2.5; # time to live\\n pf.positions[xidx] = (w / 20) # starting position x\\n pf.positions[yidx] = (h / 10) # and y\\n pf.velocities[xidx] = 10 * (pf.spread * rand() - pf.spread / 2 + recip()) # starting velocity x\\n pf.velocities[yidx] = (rand() - 2.9) * h / 20.5; # and y (randomized slightly so points reach different heights)\\n willdraw = true\\n end\\n else\\n if pf.positions[yidx] > h / 10 && pf.velocities[yidx] > 0\\n pf.velocities[yidx] *= -0.3 # \\\"bounce\\\"\\n end\\n pf.velocities[yidx] += df * h / 10 # adjust velocity\\n pf.positions[xidx] += pf.velocities[xidx] * df # adjust position x\\n pf.positions[yidx] += pf.velocities[yidx] * df # and y\\n pf.lifetimes[idx] -= df\\n willdraw = true\\n end\\n\\n if willdraw # gather all of the points that are going to be rendered\\n pointidx += 1\\n pf.points[pointidx] = SDL_Point(Cint(floor(pf.positions[xidx] * 10)),\\n Cint(floor(pf.positions[yidx] * 10)))\\n end\\n xidx += 2\\n yidx = xidx + 1\\n pf.numpoints = pointidx\\n end\\n return pf\\nend\\n\\nfunction fountain(particlenum = 3000, w = 800, h = 800)\\n SDL_Init(SDL_INIT_VIDEO)\\n window = SDL_CreateWindow(\\\"Julia Particle System!\\\", SDL_WINDOWPOS_CENTERED_MASK,\\n SDL_WINDOWPOS_CENTERED_MASK, w, h, SDL_WINDOW_RESIZABLE)\\n renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED)\\n SDL_ClearError()\\n df = 0.0001\\n pf = ParticleFountain(3000)\\n overallstart, close, frames = now(), false, 0\\n while !close\\n dfstart = now()\\n event_ref = Ref{SDL_Event}()\\n while Bool(SDL_PollEvent(event_ref))\\n event_type = event_ref[].type\\n evt = event_ref[]\\n if event_type == SDL_QUIT\\n close = true\\n break\\n end\\n if event_type == SDL_WINDOWEVENT\\n if evt.window.event == 5\\n w = evt.window.data1\\n h = evt.window.data2\\n end\\n end\\n if event_type == SDL_KEYDOWN\\n comm = evt.key.keysym.scancode\\n if comm == SDL_SCANCODE_UP\\n saturation = min(pf.saturation + 0.1, 1.0)\\n elseif comm == SDL_SCANCODE_DOWN\\n saturation = max(pf.saturation - 0.1, 0.0)\\n elseif comm == SDL_SCANCODE_PAGEUP\\n spread = min(pf.spread + 1, 50.0)\\n elseif comm == SDL_SCANCODE_PAGEDOWN\\n spread = max(pf.spread - 0.1, 0.2)\\n elseif comm == SDL_SCANCODE_LEFT\\n range = min(pf.range + 0.1, 12.0)\\n elseif comm == SDL_SCANCODE_RIGHT\\n range = max(pf.range - 0.1, 0.1)\\n elseif comm == SDL_SCANCODE_SPACE\\n pf.reciprocate = !pf.reciprocate\\n elseif comm == SDL_SCANCODE_Q\\n close = true\\n break\\n end\\n end\\n end\\n pf = update(pf, w, h, df)\\n SDL_SetRenderDrawColor(renderer, 0x0, 0x0, 0x0, 0xff)\\n SDL_RenderClear(renderer)\\n rgb = parse(UInt32, hex(HSL((Dates.value(now()) % 5) * 72, pf.saturation, 0.5)), base=16)\\n red, green, blue = rgb & 0xff, (rgb >> 8) & 0xff, (rgb >>16) & 0xff\\n SDL_SetRenderDrawColor(renderer, red, green, blue, 0x7f)\\n SDL_RenderDrawPoints(renderer, pf.points, pf.numpoints)\\n SDL_RenderPresent(renderer)\\n frames += 1\\n df = Float64(Dates.value(now()) - Dates.value(dfstart)) / 1000\\n elapsed = Float64(Dates.value(now()) - Dates.value(overallstart)) / 1000\\n elapsed > 0.5 && print(\\\"\\\\r\\\", ' '^20, \\\"\\\\rFPS: \\\", round(frames / elapsed, digits=1))\\n end\\n SDL_Quit()\\nend\\n\\nprintln(\\\"\\\"\\\"\\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\\n Use PAGE UP and PAGE DOWN keys to modify the \\\"spread\\\" of the particles.\\n Toggle reciprocation off / on with the SPACE bar.\\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\\n Press the \\\"q\\\" key to quit.\\n\\\"\\\"\\\")\\n\\nfountain()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"-- Returns canvas of given width and height containing a circle\\nfunction initCanvas (width, height)\\n local c = love.graphics.newCanvas(width, height)\\n love.graphics.setCanvas(c) -- Switch to drawing on canvas 'c'\\n love.graphics.circle(\\\"fill\\\", width / 2, height / 2, 2, 100)\\n love.graphics.setCanvas() -- Switch back to drawing on main screen\\n return c\\nend\\n\\n-- Returns particle system with given canvas\\nfunction initPartSys (image, maxParticles)\\n local ps = love.graphics.newParticleSystem(image, maxParticles)\\n ps:setParticleLifetime(3, 5) -- (min, max)\\n ps:setDirection(math.pi * 1.5)\\n ps:setSpeed(700)\\n ps:setLinearAcceleration(-100, 500, 100, 700) -- (minX, minY, maxX, maxY)\\n ps:setEmissionRate(1000)\\n ps:setPosition(400, 550)\\n ps:setColors(1, 1, 1, 1, 0, 0, 1, 0) -- Start solid white, fade to transluscent blue\\n return ps\\nend\\n\\n-- LÖVE callback that runs on program start\\nfunction love.load ()\\n love.window.setTitle(\\\"Lua particle fountain\\\")\\n local canvas = initCanvas(10, 10)\\n psystem = initPartSys(canvas, 10000)\\nend\\n\\n-- LÖVE callback to update values before each frame\\nfunction love.update (dt)\\n psystem:update(dt)\\nend\\n\\n-- LÖVE callback to draw each frame to the screen\\nfunction love.draw ()\\n love.graphics.draw(psystem)\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"import std/[lenientops, math, monotimes, random, times]\\nimport sdl2\\n\\ntype ParticleFountain[N: static Positive] = object\\n positions: array[1..2 * N, float]\\n velocities: array[1..2 * N, float]\\n lifetimes: array[1..N, float]\\n points: array[1..N, Point]\\n numPoints: int\\n saturation: float\\n spread: float\\n range: float\\n reciprocate: bool\\n\\nproc initParticleFountain[N: static Positive](): ParticleFountain[N] =\\n ParticleFountain[N](saturation: 0.4, spread: 1.5, range: 1.5)\\n\\nproc update(pf: var ParticleFountain; w, h: cint; df: float) =\\n var\\n xidx = 1\\n yidx = 2\\n pointidx = 0\\n\\n template recip(pf: ParticleFountain): float =\\n if pf.reciprocate: pf.range * sin(epochTime() / 1000) else: 0.0\\n\\n for idx in 1..pf.N:\\n var willDraw = false\\n if pf.lifetimes[idx] <= 0:\\n if rand(1.0) < df:\\n pf.lifetimes[idx] = 2.5 # Time to live.\\n # Starting position.\\n pf.positions[xidx] = w / 20\\n pf.positions[yidx] = h / 10\\n # Starting velocity.\\n pf.velocities[xidx] = 10 * (pf.spread * rand(1.0) - pf.spread / 2 + pf.recip())\\n pf.velocities[yidx] = (rand(1.0) - 2.9) * h / 20.5\\n willDraw = true\\n else:\\n if pf.positions[yidx] > h / 10 and pf.velocities[yidx] > 0:\\n pf.velocities[yidx] *= -0.3 # \\\"Bounce\\\".\\n pf.velocities[yidx] += df * h / 10 # Adjust velocity.\\n pf.positions[xidx] += pf.velocities[xidx] * df # Adjust position x.\\n pf.positions[yidx] += pf.velocities[yidx] * df # Adjust position y.\\n pf.lifetimes[idx] -= df\\n willDraw = true\\n\\n if willDraw:\\n # Gather all of the points that are going to be rendered.\\n inc pointIdx\\n pf.points[pointidx] = (cint(pf.positions[xidx] * 10), cint(pf.positions[yidx] * 10))\\n inc xidx, 2\\n yidx = xidx + 1\\n pf.numPoints = pointidx\\n\\nfunc hsvToRgb(h, s, v: float): (byte, byte, byte) =\\n let hp = h / 60.0\\n let c = s * v\\n let x = c * (1 - abs(hp mod 2 - 1))\\n let m = v - c\\n var (r, g, b) = if hp <= 1: (c, x, 0.0)\\n elif hp <= 2: (x, c, 0.0)\\n elif hp <= 3: (0.0, c, x)\\n elif hp <= 4: (0.0, x, c)\\n elif hp <= 5: (x, 0.0, c)\\n else: (c, 0.0, x)\\n r += m\\n g += m\\n b += m\\n result = (byte(r * 255), byte(g * 255), byte(b * 255))\\n\\nproc fountain(particleNum = 3000; w = 800; h = 800) =\\n var w = w.cint\\n var h = h.cint\\n discard sdl2.init(INIT_VIDEO or INIT_EVENTS)\\n let window = createWindow(\\\"Nim Particle System!\\\", SDL_WINDOWPOS_CENTERED_MASK,\\n SDL_WINDOWPOS_CENTERED_MASK, w, h, SDL_WINDOW_RESIZABLE)\\n let renderer = createRenderer(window, -1, 0)\\n clearError()\\n var df = 0.0001\\n var pf = initParticleFountain[3000]()\\n var close = false\\n var frames = 0\\n block Simulation:\\n while not close:\\n let dfStart = getMonoTime()\\n var event: Event\\n while bool(pollEvent(event)):\\n case event.kind\\n of QuitEvent:\\n break Simulation\\n of WindowEvent:\\n if event.window.event == WindowEvent_Resized:\\n w = event.window.data1\\n h = event.window.data2\\n of KeyDown:\\n let comm = event.key.keysym.sym\\n case comm\\n of K_UP:\\n pf.saturation = min(pf.saturation + 0.1, 1.0)\\n of K_DOWN:\\n pf.saturation = max(pf.saturation - 0.1, 0.0)\\n of K_PAGEUP:\\n pf.spread = min(pf.spread + 1.0, 50.0)\\n of K_PAGEDOWN:\\n pf.spread = max(pf.spread - 0.1, 0.2)\\n of K_LEFT:\\n pf.range = min(pf.range + 0.1, 12.0)\\n of K_RIGHT:\\n pf.range = max(pf.range - 0.1, 0.1)\\n of K_SPACE:\\n pf.reciprocate = not pf.reciprocate\\n of K_Q:\\n break Simulation\\n else:\\n discard\\n else:\\n discard\\n\\n pf.update(w, h, df)\\n renderer.setDrawColor(0x0, 0x0, 0x0, 0xff)\\n renderer.clear()\\n let (red, green, blue) = hsvToRgb(epochTime() mod 5 * 72, pf.saturation, 1.0)\\n renderer.setDrawColor(red, green, blue, 0x7f)\\n renderer.drawPoints(pf.points[1].addr, pf.numPoints.cint)\\n renderer.present()\\n inc frames\\n df = (getMonoTime() - dfStart).inMilliseconds.float / 1000\\n\\n sdl2.quit()\\n\\nrandomize()\\necho \\\"\\\"\\\"\\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\\n Use PAGE UP and PAGE DOWN keys to modify the \\\"spread\\\" of the particles.\\n Toggle reciprocation off / on with the SPACE bar.\\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\\n Press the \\\"q\\\" key to quit.\\n\\\"\\\"\\\"\\nfountain()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\n\\nuse strict; # https://rosettacode.org/wiki/Particle_fountain\\nuse warnings;\\nuse Tk;\\n\\nmy $size = 900;\\nmy @particles;\\nmy $maxparticles = 500;\\nmy @colors = qw( red green blue yellow cyan magenta orange white );\\n\\nmy $mw = MainWindow->new;\\nmy $c = $mw->Canvas( -width => $size, -height => $size, -bg => 'black',\\n )->pack;\\n$mw->Button(-text => 'Exit', -command => sub {$mw->destroy},\\n )->pack(-fill => 'x');\\n\\nstep();\\nMainLoop;\\n-M $0 < 0 and exec $0;\\n\\nsub step\\n {\\n $c->delete('all');\\n $c->createLine($size / 2 - 10, $size, $size / 2, $size - 10,\\n $size / 2 + 10, $size, -fill => 'white' );\\n for ( @particles )\\n {\\n my ($ox, $oy, $vx, $vy, $color) = @$_;\\n my $x = $ox + $vx;\\n my $y = $oy + $vy;\\n $c->createRectangle($ox, $oy, $x, $y, -fill => $color, -outline => $color);\\n if( $y < $size )\\n {\\n $_->[0] = $x;\\n $_->[1] = $y;\\n $_->[3] += 0.006; # gravity :)\\n }\\n else { $_ = undef }\\n }\\n @particles = grep defined, @particles;\\n if( @particles < $maxparticles and --$| )\\n {\\n push @particles, [ $size >> 1, $size - 10,\\n (1 - rand 2) / 2.5 , -3 - rand 0.05, $colors[rand @colors] ];\\n }\\n $mw->after(1 => \\\\&step);\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Particle_fountain.exw\\n -- ==================================\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cdcanvas</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">title</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"Particle fountain\\\"</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">help_text</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n Uparrow increases the saturation of the particle colors,\\n downarrow decreases saturation until they all become white.\\n PageUp sprays the particles out at a wider angle/spread,\\n PageDown makes the jet narrower.\\n Space toggles reciprocation (wobble) on and off (straight up).\\n Left arrow decreases the angle range for reciprocation,\\n right arrow increases the angle range for reciprocation.\\n Press the \\\"q\\\" key to quit.\\n \\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">particlenum</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">3000</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- each particle is {x,y,color,life,dx,dy}</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">particles</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">particlenum</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fps</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">reciprocate</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.5</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">spread</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1.5</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">saturation</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.4</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">df</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0.0001</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">redraw_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posx*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posy*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasActivate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">particles</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">color</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">life</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">particles</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">life</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasPixel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">color</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasFlush</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">map_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cdcanvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_IUP</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_DBUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetBackground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_BLACK</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">timer_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">fps</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">df</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">start</span>\\n <span style=\\\"color: #000000;\\\">start</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">particlenum</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">color</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">life</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">particles</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">life</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">()<</span><span style=\\\"color: #000000;\\\">df</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">life</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2.5</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- time to live</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- starting position x</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- and y\\n -- randomize velocity so points reach different heights:</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">reciprocate</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">range</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">sin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()):</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">dx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">spread</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">spread</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">50</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- starting velocity x</span>\\n <span style=\\\"color: #000000;\\\">dy</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">2.9</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">20.5</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- and y </span>\\n <span style=\\\"color: #000000;\\\">color</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">hsv_to_rgb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">round</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">(),</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">saturation</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">dy</span> <span style=\\\"color: #0000FF;\\\">*=</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.3</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- \\\"bounce\\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">dy</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">df</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- adjust velocity</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">df</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- adjust position x</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">df</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">8</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- and y</span>\\n <span style=\\\"color: #000000;\\\">life</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">df</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">particles</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">color</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">life</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">IupRedraw</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s (%d, %d fps/s [%dx%d])\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">particlenum</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fps</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">t1</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #000000;\\\">fps</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">key_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*dlg*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_ESC</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">lower</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #008000;\\\">'q'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_F1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #7060A8;\\\">IupMessage</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">help_text</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_UP</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">saturation</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">saturation</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_DOWN</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">saturation</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">saturation</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_PGUP</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">spread</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">spread</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_PGDN</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">spread</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">spread</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_RIGHT</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">range</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_LEFT</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">range</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">range</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0.1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_SP</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">reciprocate</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">reciprocate</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CONTINUE</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">canvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGLCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"RASTERSIZE=400x300\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallbacks</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"redraw_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">\\\"MAP_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"map_cb\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"%s\\\"`</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">title</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"KEY_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"key_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">timer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupTimer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"timer_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">1000</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">25</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupShowXY</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">IUP_CENTER</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">IUP_CENTER</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"RASTERSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# Using SDL2 library: # pip install PySDL2\\n\\nimport sys\\nimport random\\nimport time\\nimport math\\n\\nimport sdl2\\nimport sdl2.ext\\n\\nFPS = 60\\nNEW_PARTICLES_PER_FRAME = 10\\nMAX_PARTICLES = 5_000\\nGRAVITY = 100\\nWIDTH = 640\\nHEIGHT = 480\\n\\n\\ndef clamp(value, min_, max_):\\n \\\"\\\"\\\"Return value clamped between min and max\\\"\\\"\\\"\\n return max(min_, min(value, max_))\\n\\n\\nclass Particle:\\n \\\"\\\"\\\"Particle obeying gravity law.\\\"\\\"\\\"\\n\\n def __init__(self):\\n self.x = 0\\n self.y = 0\\n self.v_x = 0\\n self.v_y = 0\\n\\n def update(self, dtime: float) -> None:\\n \\\"\\\"\\\"Move particle and update speed with gravity\\\"\\\"\\\"\\n self.x = self.x + self.v_x * dtime\\n self.y = self.y + self.v_y * dtime\\n self.v_y = self.v_y + GRAVITY * dtime\\n\\n def set(self, x, y, v_x, v_y):\\n \\\"\\\"\\\"Set particle values\\\"\\\"\\\"\\n self.x = x\\n self.y = y\\n self.v_x = v_x\\n self.v_y = v_y\\n\\n\\nclass Fountain:\\n \\\"\\\"\\\"The fountain\\\"\\\"\\\"\\n\\n def __init__(self, max_particles: int, particles_per_frame: int):\\n self.particles_per_frame = particles_per_frame\\n self.max_particles = max_particles\\n self.spread = 10.0\\n self.range = math.sqrt(2 * GRAVITY * (HEIGHT - 20 - self.spread))\\n self.saturation = 155\\n self.reciprocate = False\\n self.reciprocating_time = 0.0\\n self.particles = [\\n self.init_particle(Particle()) for _ in range(self.particles_per_frame)\\n ]\\n\\n def update(self, dtime) -> None:\\n \\\"\\\"\\\"Update particles\\\"\\\"\\\"\\n if self.reciprocate:\\n self.reciprocating_time += dtime\\n\\n for particle in self.particles:\\n particle.update(dtime)\\n if particle.y > HEIGHT - 10:\\n self.init_particle(particle)\\n\\n if len(self.particles) < self.max_particles:\\n for _ in range(self.particles_per_frame):\\n self.particles.append(self.init_particle(Particle()))\\n # print(len(particles))\\n\\n def render(self, renderer: sdl2.ext.renderer.Renderer) -> None:\\n \\\"\\\"\\\"Render particles\\\"\\\"\\\"\\n points = [(particle.x, particle.y) for particle in self.particles]\\n\\n renderer.clear()\\n renderer.draw_point(\\n points, sdl2.ext.Color(self.saturation, self.saturation, 255)\\n )\\n renderer.present()\\n\\n def step_parameter(self, param, step):\\n \\\"\\\"\\\"Change parameters\\\"\\\"\\\"\\n if param == \\\"spread\\\":\\n self.spread = clamp(self.spread + step, 0, 50)\\n elif param == \\\"range\\\":\\n self.range = clamp(self.range + step, 0, 300)\\n elif param == \\\"color\\\":\\n self.saturation = clamp(self.saturation + step, 0, 255)\\n elif param == \\\"reciprocate\\\":\\n self.reciprocate = not self.reciprocate\\n self.reciprocating_time = 0.0\\n\\n def init_particle(self, particle: Particle) -> Particle:\\n \\\"\\\"\\\"Move particle at initial position with a random-y speed\\\"\\\"\\\"\\n radius = random.random() * self.spread\\n direction = random.random() * math.pi * 2\\n v_x = radius * math.cos(direction) + math.sin(self.reciprocating_time) * 20.0\\n v_y = -self.range + radius * math.sin(direction)\\n particle.set(WIDTH // 2, HEIGHT - 10, v_x, v_y)\\n return particle\\n\\n\\ndef make_renderer() -> sdl2.ext.renderer.Renderer:\\n \\\"\\\"\\\"Initialise SDL and make renderer\\\"\\\"\\\"\\n sdl2.ext.init()\\n\\n window = sdl2.ext.Window(\\\"Particle Fountain\\\", size=(WIDTH, HEIGHT))\\n window.show()\\n\\n renderer = sdl2.ext.renderer.Renderer(window)\\n\\n return renderer\\n\\n\\ndef limit_frame_rate(fps: float, cur_time: int) -> bool:\\n \\\"\\\"\\\"Limit frame rate\\\"\\\"\\\"\\n dtime = time.monotonic_ns() - cur_time\\n frame_duration = 1e9 / fps\\n if dtime < frame_duration:\\n time.sleep((frame_duration - dtime) / 1e9)\\n return True\\n return False\\n\\n\\ndef handle_events(fountain: Fountain):\\n \\\"\\\"\\\"Act on events\\\"\\\"\\\"\\n key_actions = {\\n sdl2.SDL_SCANCODE_PAGEUP: lambda: fountain.step_parameter(\\\"color\\\", 5),\\n sdl2.SDL_SCANCODE_PAGEDOWN: lambda: fountain.step_parameter(\\\"color\\\", -5),\\n sdl2.SDL_SCANCODE_UP: lambda: fountain.step_parameter(\\\"range\\\", 1),\\n sdl2.SDL_SCANCODE_DOWN: lambda: fountain.step_parameter(\\\"range\\\", -1),\\n sdl2.SDL_SCANCODE_LEFT: lambda: fountain.step_parameter(\\\"spread\\\", -1),\\n sdl2.SDL_SCANCODE_RIGHT: lambda: fountain.step_parameter(\\\"spread\\\", 1),\\n sdl2.SDL_SCANCODE_SPACE: lambda: fountain.step_parameter(\\\"reciprocate\\\", 1),\\n }\\n\\n events = sdl2.ext.get_events()\\n for event in events:\\n if event.type == sdl2.SDL_QUIT:\\n return False\\n if event.type == sdl2.SDL_KEYDOWN:\\n if event.key.keysym.scancode in key_actions:\\n key_actions[event.key.keysym.scancode]()\\n elif event.key.keysym.scancode == sdl2.SDL_SCANCODE_Q:\\n return False\\n return True\\n\\n\\ndef main_loop(renderer: sdl2.ext.renderer.Renderer, fountain: Fountain) -> None:\\n \\\"\\\"\\\"Main animation loop\\\"\\\"\\\"\\n running = True\\n\\n cur_time = time.monotonic_ns()\\n while running:\\n running = handle_events(fountain)\\n\\n fountain.render(renderer)\\n\\n if not limit_frame_rate(FPS, cur_time):\\n print(f\\\"Didn't make it in time with {len(fountain.particles)} particles.\\\")\\n\\n dtime = (time.monotonic_ns() - cur_time) / 1e9 # in seconds\\n fountain.update(dtime)\\n cur_time = time.monotonic_ns()\\n\\n sdl2.ext.quit()\\n\\n\\ndef run():\\n \\\"\\\"\\\"Start!\\\"\\\"\\\"\\n\\n renderer = make_renderer()\\n fountain = Fountain(MAX_PARTICLES, NEW_PARTICLES_PER_FRAME)\\n\\n main_loop(renderer, fountain)\\n\\n return 0\\n\\n\\nif __name__ == \\\"__main__\\\":\\n sys.exit(run())\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"use NativeCall;\\nuse SDL2::Raw;\\n\\nmy int ($w, $h) = 800, 800;\\nmy SDL_Window $window;\\nmy SDL_Renderer $renderer;\\n\\nmy int $particlenum = 3000;\\n\\n\\nSDL_Init(VIDEO);\\n$window = SDL_CreateWindow(\\n \\\"Raku Particle System!\\\",\\n SDL_WINDOWPOS_CENTERED_MASK, SDL_WINDOWPOS_CENTERED_MASK,\\n $w, $h,\\n RESIZABLE\\n);\\n$renderer = SDL_CreateRenderer( $window, -1, ACCELERATED );\\n\\nSDL_ClearError();\\n\\nmy num @positions = 0e0 xx ($particlenum * 2);\\nmy num @velocities = 0e0 xx ($particlenum * 2);\\nmy num @lifetimes = 0e0 xx $particlenum;\\n\\nmy CArray[int32] $points .= new;\\nmy int $numpoints;\\nmy Num $saturation = 4e-1;\\nmy Num $spread = 15e-1;\\nmy &reciprocate = sub { 0 }\\nmy $range = 1.5;\\n\\nsub update (num \\\\df) {\\n my int $xidx = 0;\\n my int $yidx = 1;\\n my int $pointidx = 0;\\n loop (my int $idx = 0; $idx < $particlenum; $idx = $idx + 1) {\\n my int $willdraw = 0;\\n if (@lifetimes[$idx] <= 0e0) {\\n if (rand < df) {\\n @lifetimes[$idx] = 25e-1; # time to live\\n @positions[$xidx] = ($w / 20e0).Num; # starting position x\\n @positions[$yidx] = ($h / 10).Num; # and y\\n @velocities[$xidx] = ($spread * rand - $spread/2 + reciprocate()) * 10; # starting velocity x\\n @velocities[$yidx] = (rand - 2.9e0) * $h / 20.5; # and y (randomized slightly so points reach different heights)\\n $willdraw = 1;\\n }\\n } else {\\n if @positions[$yidx] > $h / 10 && @velocities[$yidx] > 0 {\\n @velocities[$yidx] = @velocities[$yidx] * -0.3e0; # \\\"bounce\\\"\\n }\\n\\n @velocities[$yidx] = @velocities[$yidx] + $h/10.Num * df; # adjust velocity\\n @positions[$xidx] = @positions[$xidx] + @velocities[$xidx] * df; # adjust position x\\n @positions[$yidx] = @positions[$yidx] + @velocities[$yidx] * df; # and y\\n\\n @lifetimes[$idx] = @lifetimes[$idx] - df;\\n $willdraw = 1;\\n }\\n\\n if ($willdraw) {\\n $points[$pointidx++] = (@positions[$xidx] * 10).floor; # gather all of the points that\\n $points[$pointidx++] = (@positions[$yidx] * 10).floor; # are still going to be rendered\\n }\\n\\n $xidx = $xidx + 2;\\n $yidx = $xidx + 1;\\n }\\n $numpoints = ($pointidx - 1) div 2;\\n}\\n\\nsub render {\\n SDL_SetRenderDrawColor($renderer, 0x0, 0x0, 0x0, 0xff);\\n SDL_RenderClear($renderer);\\n\\n SDL_SetRenderDrawColor($renderer, |hsv2rgb(((now % 5) / 5).round(.01), $saturation, 1), 0x7f);\\n SDL_RenderDrawPoints($renderer, $points, $numpoints);\\n\\n SDL_RenderPresent($renderer);\\n}\\n\\nenum KEY_CODES (\\n K_UP => 82,\\n K_DOWN => 81,\\n K_LEFT => 80,\\n K_RIGHT => 79,\\n K_SPACE => 44,\\n K_PGUP => 75,\\n K_PGDN => 78,\\n K_Q => 20,\\n);\\n\\nsay q:to/DOCS/;\\nUse UP and DOWN arrow keys to modify the saturation of the particle colors.\\nUse PAGE UP and PAGE DOWN keys to modify the \\\"spread\\\" of the particles.\\nToggle reciprocation off / on with the SPACE bar.\\nUse LEFT and RIGHT arrow keys to modify angle range for reciprocation.\\nPress the \\\"q\\\" key to quit.\\nDOCS\\n\\nmy $event = SDL_Event.new;\\n\\nmy num $df = 0.0001e0;\\n\\nmain: loop {\\n my $start = now;\\n\\n while SDL_PollEvent($event) {\\n my $casted_event = SDL_CastEvent($event);\\n\\n given $casted_event {\\n when *.type == QUIT {\\n last main;\\n }\\n when *.type == WINDOWEVENT {\\n if .event == RESIZED {\\n $w = .data1;\\n $h = .data2;\\n }\\n }\\n when *.type == KEYDOWN {\\n if KEY_CODES(.scancode) -> $comm {\\n given $comm {\\n when 'K_UP' { $saturation = (($saturation + .1) min 1e0) }\\n when 'K_DOWN' { $saturation = (($saturation - .1) max 0e0) }\\n when 'K_PGUP' { $spread = (($spread + .1) min 5e0) }\\n when 'K_PGDN' { $spread = (($spread - .1) max 2e-1) }\\n when 'K_RIGHT' { $range = (($range + .1) min 2e0) }\\n when 'K_LEFT' { $range = (($range - .1) max 1e-1) }\\n when 'K_SPACE' { &reciprocate = reciprocate() == 0 ?? sub { $range * sin(now) } !! sub { 0 } }\\n when 'K_Q' { last main }\\n }\\n }\\n }\\n }\\n }\\n\\n update($df);\\n\\n render();\\n\\n $df = (now - $start).Num;\\n\\n print fps();\\n}\\n\\nsay '';\\n\\nsub fps {\\n state $fps-frames = 0;\\n state $fps-now = now;\\n state $fps = '';\\n $fps-frames++;\\n if now - $fps-now >= 1 {\\n $fps = [~] \\\"\\\\r\\\", ' ' x 20, \\\"\\\\r\\\",\\n sprintf \\\"FPS: %5.1f \\\", ($fps-frames / (now - $fps-now));\\n $fps-frames = 0;\\n $fps-now = now;\\n }\\n $fps\\n}\\n\\nsub hsv2rgb ( $h, $s, $v ){\\n state %cache;\\n %cache{\\\"$h|$s|$v\\\"} //= do {\\n my $c = $v * $s;\\n my $x = $c * (1 - abs( (($h*6) % 2) - 1 ) );\\n my $m = $v - $c;\\n [(do given $h {\\n when 0..^1/6 { $c, $x, 0 }\\n when 1/6..^1/3 { $x, $c, 0 }\\n when 1/3..^1/2 { 0, $c, $x }\\n when 1/2..^2/3 { 0, $x, $c }\\n when 2/3..^5/6 { $x, 0, $c }\\n when 5/6..1 { $c, 0, $x }\\n } ).map: ((*+$m) * 255).Int]\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"import \\\"dome\\\" for Window, Platform, Process\\nimport \\\"graphics\\\" for Canvas, Color\\nimport \\\"math\\\" for Math, Point\\nimport \\\"random\\\" for Random\\nimport \\\"input\\\" for Keyboard\\nimport \\\"./dynamic\\\" for Struct\\n\\nvar Start = Platform.time\\nvar Rand = Random.new()\\n\\nvar fields = [\\n \\\"particleNum\\\",\\n \\\"positions\\\",\\n \\\"velocities\\\",\\n \\\"lifetimes\\\",\\n \\\"points\\\",\\n \\\"numPoints\\\",\\n \\\"saturation\\\",\\n \\\"spread\\\",\\n \\\"range\\\",\\n \\\"reciprocate\\\"\\n]\\nvar ParticleFountain = Struct.create(\\\"ParticleFountain\\\", fields)\\n\\nclass ParticleDisplay {\\n construct new(particleNum, width, height) {\\n Window.resize(width, height)\\n Canvas.resize(width, height)\\n Window.title = \\\"Wren Particle System!\\\"\\n _pn = particleNum\\n _w = width\\n _h = height\\n _df = 1 / 200 // say\\n _pf = ParticleFountain.new(\\n _pn, // particleNum\\n List.filled(_pn * 2, 0), // positions\\n List.filled(_pn * 2, 0), // velocities\\n List.filled(_pn, 0), // lifetimes\\n List.filled(_pn, null), // points\\n 0, // numPoints\\n 0.4, // saturation\\n 1.5, // spread\\n 1.5, // range\\n false // reciprocate\\n )\\n for (i in 0..._pn) _pf.points[i] = Point.new(0, 0)\\n }\\n\\n init() {\\n Canvas.cls()\\n _frames = 0\\n }\\n\\n updatePF() {\\n var xidx = 0\\n var yidx = 1\\n var pointIdx = 0\\n var recip = Fn.new { _pf.reciprocate ? _pf.range * Math.sin(Platform.time/1000) : 0 }\\n for (idx in 0..._pf.particleNum) {\\n var willDraw = false\\n if (_pf.lifetimes[idx] <= 0) {\\n if (Rand.float() < _df) {\\n _pf.lifetimes[idx] = 2.5 // time to live\\n _pf.positions[xidx] = _w / 20 // starting position x\\n _pf.positions[yidx] = _h / 10 // and y\\n\\n // starting velocities x and y\\n // randomized slightly so points reach different heights\\n _pf.velocities[xidx] = 10 * (_pf.spread * Rand.float() - _pf.spread / 2 + recip.call())\\n _pf.velocities[yidx] = (Rand.float() - 2.9) * _h / 20.5\\n _willDraw = true\\n }\\n } else {\\n if (_pf.positions[yidx] > _h/10 && _pf.velocities[yidx] > 0) {\\n _pf.velocities[yidx] = _pf.velocities[yidx] * (-0.3) // bounce\\n }\\n _pf.velocities[yidx] = _pf.velocities[yidx] + _df * _h / 10 // adjust velocity\\n _pf.positions[xidx] = _pf.positions[xidx] + _pf.velocities[xidx] * _df // adjust position x\\n _pf.positions[yidx] = _pf.positions[yidx] + _pf.velocities[yidx] * _df // and y\\n _pf.lifetimes[idx] = _pf.lifetimes[idx] - _df\\n willDraw = true\\n }\\n if (willDraw) { // gather all the points that are going to be rendered\\n _pf.points[pointIdx] = Point.new((_pf.positions[xidx] * 10).floor,\\n (_pf.positions[yidx] * 10).floor)\\n pointIdx = pointIdx + 1\\n }\\n xidx = xidx + 2\\n yidx = xidx + 1\\n _pf.numPoints = pointIdx\\n }\\n }\\n\\n update() {\\n if (Keyboard[\\\"Up\\\"].justPressed) {\\n _pf.saturation = Math.min(_pf.saturation + 0.1, 1)\\n } else if (Keyboard[\\\"Down\\\"].justPressed) {\\n _pf.saturation = Math.max(_pf.saturation - 0.1, 0)\\n } else if (Keyboard[\\\"PageUp\\\"].justPressed) {\\n _pf.spread = Math.min(_pf.spread + 1, 50)\\n } else if (Keyboard[\\\"PageDown\\\"].justPressed) {\\n _pf.spread = Math.max(_pf.spread - 0.1, 0.2)\\n } else if (Keyboard[\\\"Left\\\"].justPressed) {\\n _pf.range = Math.min(_pf.range + 0.1, 12)\\n } else if (Keyboard[\\\"Right\\\"].justPressed) {\\n _pf.range = Math.max(_pf.range - 0.1, 0.1)\\n } else if (Keyboard[\\\"Space\\\"].justPressed) {\\n _pf.reciprocate = !_pf.reciprocate\\n } else if (Keyboard[\\\"Q\\\"].justPressed) {\\n Process.exit()\\n }\\n updatePF()\\n }\\n\\n draw(alpha) {\\n var c = Color.hsv((Platform.time % 5) * 72, _pf.saturation, 0.5, 0x7f)\\n for (i in 0..._pf.numPoints) {\\n Canvas.pset(_pf.points[i].x, _pf.points[i].y, c)\\n }\\n _frames = _frames + 1\\n var now = Platform.time\\n if (now - Start >= 1) {\\n Start = now\\n Window.title = \\\"Wren Particle System! (FPS = %(_frames))\\\"\\n _frames = 0\\n }\\n }\\n}\\n\\nSystem.print(\\\"\\\"\\\"\\n\\n Use UP and DOWN arrow keys to modify the saturation of the particle colors.\\n Use PAGE UP and PAGE DOWN keys to modify the \\\"spread\\\" of the particles.\\n Toggle reciprocation off / on with the SPACE bar.\\n Use LEFT and RIGHT arrow keys to modify angle range for reciprocation.\\n Press the \\\"q\\\" key to quit.\\n\\\"\\\"\\\")\\n\\nvar Game = ParticleDisplay.new(3000, 800, 800)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"func real RandomF;\\nreturn float(Ran(1000)) / 1000.;\\n\\ndef N = 6000;\\nreal X(N), Y(N);\\nreal VX(N), VY(N);\\ndef Color = 15;\\nint I, Ind;\\n[SetVid($12);\\nInd:= 0;\\nrepeat\\n for I:= 1 to 32 do\\n [Ind:= rem((Ind+1)/N);\\n X(Ind):= 50. + RandomF;\\n Y(Ind):= float(I)/4.;\\n VX(Ind):= (RandomF - 0.5) * 0.4;\\n VY(Ind):= 2. + RandomF*0.1;\\n ];\\n WaitForVSync;\\n Clear;\\n for I:= 0 to N-1 do\\n [Point(fix(X(I)), 480-fix(Y(I)), Color);\\n X(I):= X(I) + VX(I); Y(I):= Y(I) + VY(I);\\n VY(I):= VY(I) - 0.025;\\n ];\\nuntil KeyHit;\\n]\\n\",\n \"language\": \"XPL0\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Particle-fountain"}}},{"rowIdx":1488,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Partition_an_integer_x_into_n_primes\nnote: Prime Numbers\n","language":"00-META"},{"code":";Task:\nPartition a positive integer '''X''' into '''N''' distinct primes. \n\n\nOr, to put it in another way:\n\nFind '''N''' unique primes such that they add up to '''X'''.\n\n\nShow in the output section the sum '''X''' and the '''N''' primes in ascending order separated by plus ('''+''') signs:\n <big> • </big> partition '''99809''' with 1 prime.\n <big> • </big> partition '''18''' with 2 primes.\n <big> • </big> partition '''19''' with 3 primes.\n <big> • </big> partition '''20''' with 4 primes.\n <big> • </big> partition '''2017''' with 24 primes.\n <big> • </big> partition '''22699''' with 1, 2, 3, <u>and</u> 4 primes.\n <big> • </big> partition '''40355''' with 3 primes.\n\nThe output could/should be shown in a format such as:\n\n Partitioned 19 with 3 primes: 3+5+11\n\n::* Use any spacing that may be appropriate for the display.\n::* You need not validate the input(s).\n::* Use the lowest primes possible; use '''18 = 5+13''', not '''18 = 7+11'''.\n::* You only need to show one solution.\n\nThis task is similar to factoring an integer.\n\n\n;Related tasks:\n:* [[Count in factors]]\n:* [[Prime decomposition]]\n:* [[Factors of an integer]]\n:* [[Sieve of Eratosthenes]]\n:* [[Primality by trial division]]\n:* [[Factors of a Mersenne number]]\n:* [[Factors of a Mersenne number]]\n:* [[Sequence of primes by trial division]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F is_prime(a)\n R !(a < 2 | any((2 .. Int(a ^ 0.5)).map(x -> @a % x == 0)))\n\nF generate_primes(n)\n V r = [2]\n V i = 3\n L\n I is_prime(i)\n r.append(i)\n I r.len == n\n L.break\n i += 2\n R r\n\nV primes = generate_primes(50'000)\n\nF find_combo(k, x, m, n, &combo)\n I k >= m\n I sum(combo.map(idx -> :primes[idx])) == x\n print(‘Partitioned #5 with #2 #.: ’.format(x, m, I m > 1 {‘primes’} E ‘prime ’), end' ‘’)\n L(i) 0 .< m\n print(:primes[combo[i]], end' I i < m - 1 {‘+’} E \"\\n\")\n R 1B\n E\n L(j) 0 .< n\n I k == 0 | j > combo[k - 1]\n combo[k] = j\n I find_combo(k + 1, x, m, n, &combo)\n R 1B\n R 0B\n\nF partition(x, m)\n V n = :primes.filter(a -> a <= @x).len\n V combo = [0] * m\n I !find_combo(0, x, m, n, &combo)\n print(‘Partitioned #5 with #2 #.: (not possible)’.format(x, m, I m > 1 {‘primes’} E ‘prime ’))\n\nV data = [(99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24),\n (22699, 1), (22699, 2), (22699, 3), (22699, 4), (40355, 3)]\n\nL(n, cnt) data\n partition(n, cnt)\n","language":"11l"},{"code":"BEGIN # find the lowest n distinct primes that sum to an integer x #\n\n INT max number = 100 000; # largest number we will consider #\n # sieve the primes to max number #\n [ 1 : max number ]BOOL prime; FOR i TO UPB prime DO prime[ i ] := ODD i OD;\n prime[ 1 ] := FALSE;\n prime[ 2 ] := TRUE;\n FOR s FROM 3 BY 2 TO ENTIER sqrt( max number ) DO\n IF prime[ s ] THEN\n FOR p FROM s * s BY s TO UPB prime DO prime[ p ] := FALSE OD\n FI\n OD;\n\n [ 1 : 0 ]INT no partition; # empty array - used if can't partition #\n\n # returns n partitioned into p primes or an empty array if n can't be #\n # partitioned into p primes, the first prime to try is in start #\n PROC partition from = ( INT n, p, start )[]INT:\n IF p < 1 OR n < 2 OR start < 2 THEN # invalid parameters #\n no partition\n ELIF p = 1 THEN # partition into 1 prime - n must be prime #\n IF NOT prime[ n ] THEN no partition ELSE n FI\n ELIF p = 2 THEN # partition into a pair of primes #\n INT half n = n OVER 2;\n INT p1 := 0, p2 := 0;\n BOOL found := FALSE;\n FOR p pos FROM start TO UPB prime WHILE NOT found AND p pos < half n DO\n IF prime[ p pos ] THEN\n p1 := p pos;\n p2 := n - p pos;\n found := prime[ p2 ]\n FI\n OD;\n IF NOT found THEN no partition ELSE ( p1, p2 ) FI\n ELSE # partition into 3 or more primes #\n [ 1 : p ]INT p2;\n INT half n = n OVER 2;\n INT p1 := 0;\n BOOL found := FALSE;\n FOR p pos FROM start TO UPB prime WHILE NOT found AND p pos < half n DO\n IF prime[ p pos ] THEN\n p1 := p pos;\n []INT sub partition = partition from( n - p1, p - 1, p pos + 1 );\n IF found := UPB sub partition = p - 1 THEN\n # have p - 1 primes summing to n - p1 #\n p2[ 1 ] := p1;\n p2[ 2 : p ] := sub partition\n FI\n FI\n OD;\n IF NOT found THEN no partition ELSE p2 FI\n FI # partition from # ;\n\n # returns the partition of n into p primes or an empty array if that is #\n # not possible #\n PROC partition = ( INT n, p )[]INT: partition from( n, p, 2 );\n\n # show the first partition of n into p primes, if that is possible #\n PROC show partition = ( INT n, p )VOID:\n BEGIN\n []INT primes = partition( n, p );\n STRING partition info = whole( n, -6 ) + \" with \" + whole( p, -2 )\n + \" prime\" + IF p = 1 THEN \" \" ELSE \"s\" FI + \": \";\n IF UPB primes < LWB primes THEN\n print( ( \"Partitioning \", partition info, \"is not possible\" ) )\n ELSE\n print( ( \"Partitioned \", partition info ) );\n print( ( whole( primes[ LWB primes ], 0 ) ) );\n FOR p pos FROM LWB primes + 1 TO UPB primes DO\n print( ( \"+\", whole( primes[ p pos ], 0 ) ) )\n OD\n FI;\n print( ( newline ) )\n END # show partition # ;\n\n # test cases #\n show partition( 99809, 1 );\n show partition( 18, 2 );\n show partition( 19, 3 );\n show partition( 20, 4 );\n show partition( 2017, 24 );\n show partition( 22699, 1 );\n show partition( 22699, 2 );\n show partition( 22699, 3 );\n show partition( 22699, 4 );\n show partition( 40355, 3 )\n\nEND\n","language":"ALGOL-68"},{"code":"primepart←{\n sieve←{\n (⊃{0@(1↓⍺×⍳⌊(⍴⍵)÷⍺)⊢⍵}/(1↓⍳⍵),⊂(0,1↓⍵/1))/⍳⍵\n }\n part←{\n 0=⍴⍺⍺:⍬\n ⍵=1:(⍺⍺=⍺)/⍺⍺\n 0≠⍴r←(⍺-⊃⍺⍺)((1↓⍺⍺)∇∇)⍵-1:(⊃⍺⍺),r\n ⍺((1↓⍺⍺)∇∇)⍵\n }\n ⍺((sieve ⍺)part)⍵\n}\nprimepart_test←{\n tests←(99809 1)(18 2)(19 3)(20 4)(2017 24)\n tests,←(22699 1)(22699 2)(22699 3)(22699 4)(40355 3)\n {\n x n←⍵\n p←x primepart n\n ⍞←'Partition ',(⍕x),' with ',(⍕n),' primes: '\n 0=⍴p:⍞←'not possible.',⎕TC[2]\n ⍞←(1↓∊'+',¨⍕¨p),⎕TC[2]\n }¨tests\n}\n","language":"APL"},{"code":"get \"libhdr\"\n\nlet sieve(n, prime) be\n$( let i = 2\n 0!prime := false\n 1!prime := false\n for i = 2 to n do i!prime := true\n while i*i <= n\n $( let j = i*i\n while j <= n\n $( j!prime := false\n j := j+i\n $)\n i := i+1\n $)\n$)\n\nlet partition(x, n, prime, p, part) =\n p > x -> false,\n n = 1 -> valof $( !part := x; resultis x!prime $),\n valof\n $( p := p+1 repeatuntil p!prime\n !part := p\n if partition(x-p, n-1, prime, p, part+1) resultis true\n resultis partition(x, n, prime, p, part)\n $)\n\nlet showpart(n, part) be\n$( writef(\"%N\", !part)\n unless n=1 do\n $( wrch('+')\n showpart(n-1, part+1)\n $)\n$)\n\nlet show(x, n, prime) be\n$( let part = vec 32\n writef(\"Partitioned %N with %N prime%S: \", x, n, n=1->\"\", \"s\")\n test partition(x, n, prime, 1, part)\n do showpart(n, part)\n or writes(\"not possible\")\n newline()\n$)\n\nlet start() be\n$( let prime = getvec(100000)\n\n let tests = table 99809,1, 18,2, 19,3, 20,4, 2017,24,\n 22699,1, 22699,2, 22699,3, 22699,4, 40355,3\n\n sieve(100000, prime)\n for t = 0 to 9 do show(tests!(t*2), tests!(t*2+1), prime)\n freevec(prime)\n$)\n","language":"BCPL"},{"code":"#include <assert.h>\n#include <stdbool.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n\ntypedef struct bit_array_tag {\n uint32_t size;\n uint32_t* array;\n} bit_array;\n\nbool bit_array_create(bit_array* b, uint32_t size) {\n uint32_t* array = calloc((size + 31)/32, sizeof(uint32_t));\n if (array == NULL)\n return false;\n b->size = size;\n b->array = array;\n return true;\n}\n\nvoid bit_array_destroy(bit_array* b) {\n free(b->array);\n b->array = NULL;\n}\n\nvoid bit_array_set(bit_array* b, uint32_t index, bool value) {\n assert(index < b->size);\n uint32_t* p = &b->array[index >> 5];\n uint32_t bit = 1 << (index & 31);\n if (value)\n *p |= bit;\n else\n *p &= ~bit;\n}\n\nbool bit_array_get(const bit_array* b, uint32_t index) {\n assert(index < b->size);\n uint32_t bit = 1 << (index & 31);\n return (b->array[index >> 5] & bit) != 0;\n}\n\ntypedef struct sieve_tag {\n uint32_t limit;\n bit_array not_prime;\n} sieve;\n\nbool sieve_create(sieve* s, uint32_t limit) {\n if (!bit_array_create(&s->not_prime, limit + 1))\n return false;\n bit_array_set(&s->not_prime, 0, true);\n bit_array_set(&s->not_prime, 1, true);\n for (uint32_t p = 2; p * p <= limit; ++p) {\n if (bit_array_get(&s->not_prime, p) == false) {\n for (uint32_t q = p * p; q <= limit; q += p)\n bit_array_set(&s->not_prime, q, true);\n }\n }\n s->limit = limit;\n return true;\n}\n\nvoid sieve_destroy(sieve* s) {\n bit_array_destroy(&s->not_prime);\n}\n\nbool is_prime(const sieve* s, uint32_t n) {\n assert(n <= s->limit);\n return bit_array_get(&s->not_prime, n) == false;\n}\n\nbool find_prime_partition(const sieve* s, uint32_t number, uint32_t count,\n uint32_t min_prime, uint32_t* p) {\n if (count == 1) {\n if (number >= min_prime && is_prime(s, number)) {\n *p = number;\n return true;\n }\n return false;\n }\n for (uint32_t prime = min_prime; prime < number; ++prime) {\n if (!is_prime(s, prime))\n continue;\n if (find_prime_partition(s, number - prime, count - 1,\n prime + 1, p + 1)) {\n *p = prime;\n return true;\n }\n }\n return false;\n}\n\nvoid print_prime_partition(const sieve* s, uint32_t number, uint32_t count) {\n assert(count > 0);\n uint32_t* primes = malloc(count * sizeof(uint32_t));\n if (primes == NULL) {\n fprintf(stderr, \"Out of memory\\n\");\n return;\n }\n if (!find_prime_partition(s, number, count, 2, primes)) {\n printf(\"%u cannot be partitioned into %u primes.\\n\", number, count);\n } else {\n printf(\"%u = %u\", number, primes[0]);\n for (uint32_t i = 1; i < count; ++i)\n printf(\" + %u\", primes[i]);\n printf(\"\\n\");\n }\n free(primes);\n}\n\nint main() {\n const uint32_t limit = 100000;\n sieve s = { 0 };\n if (!sieve_create(&s, limit)) {\n fprintf(stderr, \"Out of memory\\n\");\n return 1;\n }\n print_prime_partition(&s, 99809, 1);\n print_prime_partition(&s, 18, 2);\n print_prime_partition(&s, 19, 3);\n print_prime_partition(&s, 20, 4);\n print_prime_partition(&s, 2017, 24);\n print_prime_partition(&s, 22699, 1);\n print_prime_partition(&s, 22699, 2);\n print_prime_partition(&s, 22699, 3);\n print_prime_partition(&s, 22699, 4);\n print_prime_partition(&s, 40355, 3);\n sieve_destroy(&s);\n return 0;\n}\n","language":"C"},{"code":"#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <vector>\n\nstd::vector<int> primes;\n\nstruct Seq {\npublic:\n bool empty() {\n return p < 0;\n }\n\n int front() {\n return p;\n }\n\n void popFront() {\n if (p == 2) {\n p++;\n } else {\n p += 2;\n while (!empty() && !isPrime(p)) {\n p += 2;\n }\n }\n }\n\nprivate:\n int p = 2;\n\n bool isPrime(int n) {\n if (n < 2) return false;\n if (n % 2 == 0) return n == 2;\n if (n % 3 == 0) return n == 3;\n\n int d = 5;\n while (d * d <= n) {\n if (n % d == 0) return false;\n d += 2;\n if (n % d == 0) return false;\n d += 4;\n }\n return true;\n }\n};\n\n// generate the first 50,000 primes and call it good\nvoid init() {\n Seq seq;\n\n while (!seq.empty() && primes.size() < 50000) {\n primes.push_back(seq.front());\n seq.popFront();\n }\n}\n\nbool findCombo(int k, int x, int m, int n, std::vector<int>& combo) {\n if (k >= m) {\n int sum = 0;\n for (int idx : combo) {\n sum += primes[idx];\n }\n\n if (sum == x) {\n auto word = (m > 1) ? \"primes\" : \"prime\";\n printf(\"Partitioned %5d with %2d %s \", x, m, word);\n for (int idx = 0; idx < m; ++idx) {\n std::cout << primes[combo[idx]];\n if (idx < m - 1) {\n std::cout << '+';\n } else {\n std::cout << '\\n';\n }\n }\n return true;\n }\n } else {\n for (int j = 0; j < n; j++) {\n if (k == 0 || j > combo[k - 1]) {\n combo[k] = j;\n bool foundCombo = findCombo(k + 1, x, m, n, combo);\n if (foundCombo) {\n return true;\n }\n }\n }\n }\n\n return false;\n}\n\nvoid partition(int x, int m) {\n if (x < 2 || m < 1 || m >= x) {\n throw std::runtime_error(\"Invalid parameters\");\n }\n\n std::vector<int> filteredPrimes;\n std::copy_if(\n primes.cbegin(), primes.cend(),\n std::back_inserter(filteredPrimes),\n [x](int a) { return a <= x; }\n );\n\n int n = filteredPrimes.size();\n if (n < m) {\n throw std::runtime_error(\"Not enough primes\");\n }\n\n std::vector<int> combo;\n combo.resize(m);\n if (!findCombo(0, x, m, n, combo)) {\n auto word = (m > 1) ? \"primes\" : \"prime\";\n printf(\"Partitioned %5d with %2d %s: (not possible)\\n\", x, m, word);\n }\n}\n\nint main() {\n init();\n\n std::vector<std::pair<int, int>> a{\n {99809, 1},\n { 18, 2},\n { 19, 3},\n { 20, 4},\n { 2017, 24},\n {22699, 1},\n {22699, 2},\n {22699, 3},\n {22699, 4},\n {40355, 3}\n };\n\n for (auto& p : a) {\n partition(p.first, p.second);\n }\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing static System.Linq.Enumerable;\n\npublic static class Rosetta\n{\n static void Main()\n {\n foreach ((int x, int n) in new [] {\n (99809, 1),\n (18, 2),\n (19, 3),\n (20, 4),\n (2017, 24),\n (22699, 1),\n (22699, 2),\n (22699, 3),\n (22699, 4),\n (40355, 3)\n }) {\n Console.WriteLine(Partition(x, n));\n }\n }\n\n public static string Partition(int x, int n) {\n if (x < 1 || n < 1) throw new ArgumentOutOfRangeException(\"Parameters must be positive.\");\n string header = $\"{x} with {n} {(n == 1 ? \"prime\" : \"primes\")}: \";\n int[] primes = SievePrimes(x).ToArray();\n if (primes.Length < n) return header + \"not enough primes\";\n int[] solution = CombinationsOf(n, primes).FirstOrDefault(c => c.Sum() == x);\n return header + (solution == null ? \"not possible\" : string.Join(\"+\", solution);\n }\n\n static IEnumerable<int> SievePrimes(int bound) {\n if (bound < 2) yield break;\n yield return 2;\n\n BitArray composite = new BitArray((bound - 1) / 2);\n int limit = ((int)(Math.Sqrt(bound)) - 1) / 2;\n for (int i = 0; i < limit; i++) {\n if (composite[i]) continue;\n int prime = 2 * i + 3;\n yield return prime;\n for (int j = (prime * prime - 2) / 2; j < composite.Count; j += prime) composite[j] = true;\n }\n for (int i = limit; i < composite.Count; i++) {\n if (!composite[i]) yield return 2 * i + 3;\n }\n }\n\n static IEnumerable<int[]> CombinationsOf(int count, int[] input) {\n T[] result = new T[count];\n foreach (int[] indices in Combinations(input.Length, count)) {\n for (int i = 0; i < count; i++) result[i] = input[indices[i]];\n yield return result;\n }\n }\n\n static IEnumerable<int[]> Combinations(int n, int k) {\n var result = new int[k];\n var stack = new Stack<int>();\n stack.Push(0);\n while (stack.Count > 0) {\n int index = stack.Count - 1;\n int value = stack.Pop();\n while (value < n) {\n result[index++] = value++;\n stack.Push(value);\n if (index == k) {\n yield return result;\n break;\n }\n }\n }\n }\n\n}\n","language":"C-sharp"},{"code":"isqrt = proc (s: int) returns (int)\n x0: int := s/2\n if x0 = 0 then return(s) end\n x1: int := (x0 + s/x0) / 2\n while x1 < x0 do\n x0, x1 := x1, (x0 + s/x0) / 2\n end\n return(x0)\nend isqrt\n\nprimes = proc (n: int) returns (sequence[int])\n prime: array[bool] := array[bool]$fill(1, n, true)\n prime[1] := false\n for p: int in int$from_to(2, isqrt(n)) do\n for c: int in int$from_to_by(p*p, n, p) do\n prime[c] := false\n end\n end\n\n pr: array[int] := array[int]$predict(1, n)\n for p: int in array[bool]$indexes(prime) do\n if prime[p] then array[int]$addh(pr, p) end\n end\n\n return(sequence[int]$a2s(pr))\nend primes\n\npartition_sum = proc (x, n: int, nums: sequence[int])\n returns (sequence[int])\n signals (impossible)\n if n<=0 cor sequence[int]$empty(nums) then signal impossible end\n\n if n=1 then\n for k: int in sequence[int]$elements(nums) do\n if x=k then return(sequence[int]$[x]) end\n end\n signal impossible\n end\n\n k: int := sequence[int]$bottom(nums)\n rest: sequence[int] := sequence[int]$reml(nums)\n\n return(sequence[int]$addl(partition_sum(x-k, n-1, rest), k))\n except when impossible:\n return(partition_sum(x, n, rest))\n resignal impossible\n end\nend partition_sum\n\nprime_partition = proc (x, n: int)\n returns (sequence[int])\n signals (impossible)\n return(partition_sum(x, n, primes(x))) resignal impossible\nend prime_partition\n\nformat_sum = proc (nums: sequence[int]) returns (string)\n result: string := \"\"\n for n: int in sequence[int]$elements(nums) do\n result := result || \"+\" || int$unparse(n)\n end\n return(string$rest(result, 2))\nend format_sum\n\nstart_up = proc ()\n test = struct[x: int, n: int]\n tests: sequence[test] := sequence[test]$[\n test${x:99809,n:1}, test${x:18,n:2}, test${x:19,n:3}, test${x:20,n:4},\n test${x:2017,n:24}, test${x:22699,n:1}, test${x:22699,n:2},\n test${x:22699,n:3}, test${x:22699,n:4}, test${x:40355,n:3}\n ]\n\n po: stream := stream$primary_output()\n for t: test in sequence[test]$elements(tests) do\n stream$puts(po, \"Partitioned \" || int$unparse(t.x) || \" with \"\n || int$unparse(t.n) || \" primes: \")\n stream$putl(po, format_sum(prime_partition(t.x, t.n)))\n except when impossible:\n stream$putl(po, \"not possible.\")\n end\n end\nend start_up\n","language":"CLU"},{"code":"include \"cowgol.coh\";\n\nconst MAXPRIM := 100000;\nconst MAXPRIM_B := (MAXPRIM >> 3) + 1;\n\nvar primebits: uint8[MAXPRIM_B];\ntypedef ENTRY_T is @indexof primebits;\n\nsub pentry(n: uint32): (ent: ENTRY_T, bit: uint8) is\n ent := (n >> 3) as ENTRY_T;\n bit := (n & 7) as uint8;\nend sub;\n\nsub setprime(n: uint32, prime: uint8) is\n var ent: ENTRY_T;\n var bit: uint8;\n (ent, bit) := pentry(n);\n var one: uint8 := 1;\n primebits[ent] := primebits[ent] & ~(one << bit);\n primebits[ent] := primebits[ent] | (prime << bit);\nend sub;\n\nsub prime(n: uint32): (prime: uint8) is\n var ent: ENTRY_T;\n var bit: uint8;\n (ent, bit) := pentry(n);\n prime := (primebits[ent] >> bit) & 1;\nend sub;\n\nsub sieve() is\n MemSet(&primebits[0], 0xFF, @bytesof primebits);\n setprime(0, 0);\n setprime(1, 0);\n var p: uint32 := 2;\n while p*p <= MAXPRIM loop\n var c := p*p;\n while c <= MAXPRIM loop\n setprime(c, 0);\n c := c + p;\n end loop;\n p := p + 1;\n end loop;\nend sub;\n\nsub nextprime(p: uint32): (r: uint32) is\n r := p;\n loop\n r := r + 1;\n if prime(r) != 0 then break; end if;\n end loop;\nend sub;\n\nsub partition(x: uint32, n: uint8, part: [uint32]): (r: uint8) is\n record State is\n x: uint32;\n n: uint8;\n p: uint32;\n part: [uint32];\n end record;\n\n var stack: State[128];\n var sp: @indexof stack := 0;\n\n sub Push(x: uint32, n: uint8, p: uint32, part: [uint32]) is\n stack[sp].x := x;\n stack[sp].n := n;\n stack[sp].p := p;\n stack[sp].part := part;\n sp := sp + 1;\n end sub;\n\n sub Pull(): (x: uint32, n: uint8, p: uint32, part: [uint32]) is\n sp := sp - 1;\n x := stack[sp].x;\n n := stack[sp].n;\n p := stack[sp].p;\n part := stack[sp].part;\n end sub;\n\n r := 0;\n Push(x, n, 1, part);\n while sp > 0 loop\n var p: uint32;\n (x, n, p, part) := Pull();\n p := nextprime(p);\n\n if x < p then\n continue;\n end if;\n\n if n == 1 then\n if prime(x) != 0 then\n r := 1;\n [part] := x;\n return;\n end if;\n else\n [part] := p;\n Push(x, n, p, part);\n Push(x-p, n-1, p, @next part);\n end if;\n end loop;\n r := 0;\nend sub;\n\nsub showpartition(x: uint32, n: uint8) is\n print(\"Partitioning \");\n print_i32(x);\n print(\" with \");\n print_i8(n);\n print(\" primes: \");\n\n var part: uint32[64];\n if partition(x, n, &part[0]) != 0 then\n print_i32(part[0]);\n var i: @indexof part := 1;\n while i < n as @indexof part loop\n print_char('+');\n print_i32(part[i]);\n i := i + 1;\n end loop;\n else\n print(\"Not possible\");\n end if;\n print_nl();\nend sub;\n\nsieve();\n\nrecord Test is\n x: uint32;\n n: uint8;\nend record;\n\nvar tests: Test[] := {\n {99809, 1}, {18, 2}, {19, 3}, {20, 4}, {2017, 24},\n {22699, 1}, {22699, 2}, {22699, 3}, {22699, 4}, {40355, 3}\n};\n\nvar test: @indexof tests := 0;\nwhile test < @sizeof tests loop\n showpartition(tests[test].x, tests[test].n);\n test := test + 1;\nend loop;\n","language":"Cowgol"},{"code":"import std.array : array;\nimport std.range : take;\nimport std.stdio;\n\nbool isPrime(int n) {\n if (n < 2) return false;\n if (n % 2 == 0) return n == 2;\n if (n % 3 == 0) return n == 3;\n\n int d = 5;\n while (d*d <= n) {\n if (n % d == 0) return false;\n d += 2;\n if (n % d == 0) return false;\n d += 4;\n }\n return true;\n}\n\nauto generatePrimes() {\n struct Seq {\n int p = 2;\n\n bool empty() {\n return p < 0;\n }\n\n int front() {\n return p;\n }\n\n void popFront() {\n if (p==2) {\n p++;\n } else {\n p += 2;\n while (!empty && !p.isPrime) {\n p += 2;\n }\n }\n }\n }\n\n return Seq();\n}\n\nbool findCombo(int k, int x, int m, int n, int[] combo) {\n import std.algorithm : map, sum;\n auto getPrime = function int(int idx) => primes[idx];\n\n if (k >= m) {\n if (combo.map!getPrime.sum == x) {\n auto word = (m > 1) ? \"primes\" : \"prime\";\n writef(\"Partitioned %5d with %2d %s \", x, m, word);\n foreach (i; 0..m) {\n write(primes[combo[i]]);\n if (i < m-1) {\n write('+');\n } else {\n writeln();\n }\n }\n return true;\n }\n } else {\n foreach (j; 0..n) {\n if (k==0 || j>combo[k-1]) {\n combo[k] = j;\n bool foundCombo = findCombo(k+1, x, m, n, combo);\n if (foundCombo) {\n return true;\n }\n }\n }\n }\n return false;\n}\n\nvoid partition(int x, int m) {\n import std.exception : enforce;\n import std.algorithm : filter;\n enforce(x>=2 && m>=1 && m<x);\n\n auto lessThan = delegate int(int a) => a<=x;\n auto filteredPrimes = primes.filter!lessThan.array;\n auto n = filteredPrimes.length;\n enforce(n>=m, \"Not enough primes\");\n\n int[] combo = new int[m];\n if (!findCombo(0, x, m, n, combo)) {\n auto word = (m > 1) ? \"primes\" : \"prime\";\n writefln(\"Partitioned %5d with %2d %s: (not possible)\", x, m, word);\n }\n}\n\nint[] primes;\nvoid main() {\n // generate first 50,000 and call it good\n primes = generatePrimes().take(50_000).array;\n\n auto a = [\n [99809, 1],\n [ 18, 2],\n [ 19, 3],\n [ 20, 4],\n [ 2017, 24],\n [22699, 1],\n [22699, 2],\n [22699, 3],\n [22699, 4],\n [40355, 3]\n ];\n\n foreach(p; a) {\n partition(p[0], p[1]);\n }\n}\n","language":"D"},{"code":"// Partition an integer as the sum of n primes. Nigel Galloway: November 27th., 2017\nlet rcTask n ng =\n let rec fN i g e l = seq{\n match i with\n |1 -> if isPrime g then yield Some (g::e) else yield None\n |_ -> yield! Seq.mapi (fun n a->fN (i-1) (g-a) (a::e) (Seq.skip (n+1) l)) (l|>Seq.takeWhile(fun n->(g-n)>n))|>Seq.concat}\n match fN n ng [] primes |> Seq.tryPick id with\n |Some n->printfn \"%d is the sum of %A\" ng n\n |_ ->printfn \"No Solution\"\n","language":"F-Sharp"},{"code":"USING: formatting fry grouping kernel math.combinatorics\nmath.parser math.primes sequences ;\n\n: partition ( x n -- str )\n over [ primes-upto ] 2dip '[ sum _ = ] find-combination\n [ number>string ] map \"+\" join ;\n\n: print-partition ( x n seq -- )\n [ \"no solution\" ] when-empty\n \"Partitioned %5d with %2d primes: %s\\n\" printf ;\n\n{ 99809 1 18 2 19 3 20 4 2017 24 22699 1 22699 2 22699 3 22699\n 4 40355 3 } 2 group\n[ first2 2dup partition print-partition ] each\n","language":"Factor"},{"code":" module primes_module\n implicit none\n integer,allocatable :: p(:)\n integer :: a(0:32), b(0:32)\n integer,private :: sum_primes, number\n contains\n!\n subroutine setnum(val)\n implicit none\n integer :: val\n number = val\n return\n end subroutine setnum\n!\n subroutine init(thesize)\n implicit none\n integer :: thesize\n !\n allocate(p(thesize))\n p=0\n a=0\n b=0\n return\n end subroutine init\n!\n subroutine genp(high) ! Store all primes up to high in the array p\n integer, intent(in) :: high\n integer :: i, numprimes, j,k\n logical*1 :: bk(0:high)\n !\n bk = .false.\n p = 0\n a = 0\n b = 0\n call eratosthenes(bk , high)\n j = 0\n numprimes = count(bk)\n k = 0\n do i = 1,high\n if(bk(i))then\n j = j+1\n p(j) = i\n if(j==numprimes)exit !No need to loop more, all primes stored\n endif\n end do\n print*,'numprimes',numprimes, i,p(j)\n return\n end subroutine genp\n\n subroutine getp(z) ! used to update the zth prime number in the sequence of primes that are being used to partition the integer number.\n integer :: z\n integer :: w\n!\n if (a(z) == 0)a(z) = a(z-1)\n a(z) = a(z) + 1\n b(z) = p(a(z))\n return\n end subroutine getp\n\n subroutine part(num_found)\n integer, intent(in) :: num_found\n integer :: i, s, k, r\n logical :: bu\n a = 0\n do i = 1, num_found\n call getp(i)\n end do\n infinite: do\n sum_primes = 0\n bu = .false.\n nextin:do s = 1, num_found\n sum_primes = sum_primes + b(s) !Adds the sth prime to sum_primes.\n if (sum_primes > number) then !If the sum of primes exceeds number:\n if (s == 1)then\n exit infinite !If only one prime has been added, exit the infinite loop.\n endif\n a(s:num_found) = 0 ! Resets the indices of the primes from s to num_found\n do r = s - 1, num_found ! Gets the next set of primes from s-1 to num_found\n call getp(r)\n end do\n bu = .true. ! Sets bu to true and exits the loop over the primes\n exit nextin\n end if\n end do nextin\n if (.not. bu) then ! If bu is false (meaning the sum of primes does not exceed number)\n if (sum_primes == number) exit infinite !We got it so go\n if (sum_primes < number) then\n call getp(num_found) ! If the sum of primes is less than number, gets the next prime\n else\n error stop \" Something wrong here!\"\n endif\n endif\n end do infinite\n write( *,'(/,a,1x,i0,1x,a,1x,i0,1x,a)',advance='yes') \"Partition\", number, \"into\", num_found,trim(adjustl(list(num_found)))\n end subroutine part\n!\n function list(num_found)\n integer, intent(in) :: num_found\n integer :: i\n character(len=128) :: list\n character(len = 10):: pooka\n!\n write(list,'(i0)') b(1)\n if (sum_primes == number) then\n do i = 2, num_found\n pooka = ''\n write(pooka,'(i0)') b(i)\n list = trim(list) // \" + \" // adjustl(pooka)\n end do\n else\n list = \"(not possible)\"\n end if\n list = \"primes: \" // list\n end function list\n !\n subroutine eratosthenes(p , n)\n implicit none\n!\n! dummy arguments\n!\n integer :: n\n logical*1 , dimension(0:*) :: p\n intent (in) n\n intent (inout) p\n!\n! local variables\n!\n integer :: i\n integer :: ii\n logical :: oddeven\n integer :: pr\n!\n p(0:n) = .false.\n p(1) = .false.\n p(2) = .true.\n oddeven = .true.\n do i = 3 , n,2\n p(i) = .true.\n end do\n do i = 2 , int(sqrt(float(n)))\n ii = i + i\n if( p(i) )then\n do pr = i*i , n , ii\n p(pr) = .false.\n end do\n end if\n end do\n return\n end subroutine eratosthenes\n\nend module primes_module\n\nprogram prime_partition\n use primes_module\n implicit none\n integer :: x, n,i\n integer :: xx,yy\n integer :: values(10,2)\n! The given dataset from Rosetta Code\n ! partition 99809 with 1 prime.\n ! partition 18 with 2 primes.\n ! partition 19 with 3 primes.\n ! partition 20 with 4 primes.\n ! partition 2017 with 24 primes.\n ! partition 22699 with 1, 2, 3, and 4 primes.\n ! partition 40355 with 3 primes.\n values(1,:) = (/99809,1/)\n values(2,:) = (/18,2/)\n values(3,:) = (/19,3/)\n values(4,:) = (/20,4/)\n values(5,:) = (/2017,24/)\n values(6,:) = (/22699, 1/)\n values(7,:) = (/22699, 2/)\n values(8,:) = (/22699, 3/)\n values(9,:) = (/22699, 4/)\n values(10,:) = (/40355, 3/)\n i = maxval(values(1:10,1))*2\n call init(i)\t! Set up a few basics\n call genp(i)\t! Generate primes up to i\n do i = 1,10\n call setnum( values(i,1))\n call part(values(i,2))\n end do\n Stop 'Successfully completed'\nend program prime_partition\n","language":"Fortran"},{"code":"package main\n\nimport (\n \"fmt\"\n \"log\"\n)\n\nvar (\n primes = sieve(100000)\n foundCombo = false\n)\n\nfunc sieve(limit uint) []uint {\n primes := []uint{2}\n c := make([]bool, limit+1) // composite = true\n // no need to process even numbers > 2\n p := uint(3)\n for {\n p2 := p * p\n if p2 > limit {\n break\n }\n for i := p2; i <= limit; i += 2 * p {\n c[i] = true\n }\n for {\n p += 2\n if !c[p] {\n break\n }\n }\n }\n for i := uint(3); i <= limit; i += 2 {\n if !c[i] {\n primes = append(primes, i)\n }\n }\n return primes\n}\n\nfunc findCombo(k, x, m, n uint, combo []uint) {\n if k >= m {\n sum := uint(0)\n for _, c := range combo {\n sum += primes[c]\n }\n if sum == x {\n s := \"s\"\n if m == 1 {\n s = \" \"\n }\n fmt.Printf(\"Partitioned %5d with %2d prime%s: \", x, m, s)\n for i := uint(0); i < m; i++ {\n fmt.Print(primes[combo[i]])\n if i < m-1 {\n fmt.Print(\"+\")\n } else {\n fmt.Println()\n }\n }\n foundCombo = true\n }\n } else {\n for j := uint(0); j < n; j++ {\n if k == 0 || j > combo[k-1] {\n combo[k] = j\n if !foundCombo {\n findCombo(k+1, x, m, n, combo)\n }\n }\n }\n }\n}\n\nfunc partition(x, m uint) error {\n if !(x >= 2 && m >= 1 && m < x) {\n return fmt.Errorf(\"x must be at least 2 and m in [1, x)\")\n }\n n := uint(0)\n for _, prime := range primes {\n if prime <= x {\n n++\n }\n }\n if n < m {\n return fmt.Errorf(\"not enough primes\")\n }\n combo := make([]uint, m)\n foundCombo = false\n findCombo(0, x, m, n, combo)\n if !foundCombo {\n s := \"s\"\n if m == 1 {\n s = \" \"\n }\n fmt.Printf(\"Partitioned %5d with %2d prime%s: (impossible)\\n\", x, m, s)\n }\n return nil\n}\n\nfunc main() {\n a := [...][2]uint{\n {99809, 1}, {18, 2}, {19, 3}, {20, 4}, {2017, 24},\n {22699, 1}, {22699, 2}, {22699, 3}, {22699, 4}, {40355, 3},\n }\n for _, p := range a {\n err := partition(p[0], p[1])\n if err != nil {\n log.Println(err)\n }\n }\n}\n","language":"Go"},{"code":"import Data.List (delete, intercalate)\nimport Data.Numbers.Primes (primes)\nimport Data.Bool (bool)\n\n-------------------- PRIME PARTITIONS ---------------------\npartitions :: Int -> Int -> [Int]\npartitions x n\n | n <= 1 =\n [ x\n | x == last ps ]\n | otherwise = go ps x n\n where\n ps = takeWhile (<= x) primes\n go ps_ x 1 =\n [ x\n | x `elem` ps_ ]\n go ps_ x n = ((flip bool [] . head) <*> null) (ps_ >>= found)\n where\n found p =\n ((flip bool [] . return . (p :)) <*> null)\n ((go =<< delete p . flip takeWhile ps_ . (>=)) (x - p) (pred n))\n\n-------------------------- TEST ---------------------------\nmain :: IO ()\nmain =\n mapM_ putStrLn $\n (\\(x, n) ->\n intercalate\n \" -> \"\n [ justifyLeft 9 ' ' (show (x, n))\n , let xs = partitions x n\n in bool\n (tail $ concatMap (('+' :) . show) xs)\n \"(no solution)\"\n (null xs)\n ]) <$>\n concat\n [ [(99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24)]\n , (,) 22699 <$> [1 .. 4]\n , [(40355, 3)]\n ]\n\n------------------------- GENERIC -------------------------\njustifyLeft :: Int -> Char -> String -> String\njustifyLeft n c s = take n (s ++ replicate n c)\n","language":"Haskell"},{"code":"load 'format/printf'\n\nNB. I don't know of any way to easily make an idiomatic lazy exploration,\nNB. except falling back on explicit imperative control strutures.\nNB. However this is clearly not where J shines neither with speed nor elegance.\n\nprimes_up_to =: monad def 'p: i. _1 p: 1 + y'\nterms_as_text =: monad def '; }: , (\": each y),.<'' + '''\n\nsearch_next_terms =: dyad define\n acc=. x NB. -> an accumulator that contains given beginning of the partition.\n p=. >0{y NB. -> number of elements wanted in the partition\n ns=. >1{y NB. -> candidate values to be included in the partition\n sum=. >2{y NB. -> the integer to partition\n\n if. p=0 do.\n if. sum=+/acc do. acc return. end.\n else.\n for_m. i. (#ns)-(p-1) do.\n r =. (acc,m{ns) search_next_terms (p-1);((m+1)}.ns);sum\n if. #r do. r return. end.\n end.\n end.\n\n 0$0 NB. Empty result if nothing found at the end of this path.\n)\n\n\nNB. Prints a partition of y primes whose sum equals x.\npartitioned_in =: dyad define\n terms =. (0$0) search_next_terms y;(primes_up_to x);x\n if. #terms do.\n 'As the sum of %d primes, %d = %s' printf y;x; terms_as_text terms\n else.\n 'Didn''t find a way to express %d as a sum of %d different primes.' printf x;y\n end.\n)\n\n\ntests=: (99809 1) ; (18 2) ; (19 3) ; (20 4) ; (2017 24) ; (22699 1) ; (22699 2) ; (22699 3) ; (22699 4)\n(0&{ partitioned_in 1&{) each tests\n","language":"J"},{"code":"import java.util.Arrays;\nimport java.util.stream.IntStream;\n\npublic class PartitionInteger {\n private static final int[] primes = IntStream.concat(IntStream.of(2), IntStream.iterate(3, n -> n + 2))\n .filter(PartitionInteger::isPrime)\n .limit(50_000)\n .toArray();\n\n private static boolean isPrime(int n) {\n if (n < 2) return false;\n if (n % 2 == 0) return n == 2;\n if (n % 3 == 0) return n == 3;\n int d = 5;\n while (d * d <= n) {\n if (n % d == 0) return false;\n d += 2;\n if (n % d == 0) return false;\n d += 4;\n }\n return true;\n }\n\n private static boolean findCombo(int k, int x, int m, int n, int[] combo) {\n boolean foundCombo = false;\n if (k >= m) {\n if (Arrays.stream(combo).map(i -> primes[i]).sum() == x) {\n String s = m > 1 ? \"s\" : \"\";\n System.out.printf(\"Partitioned %5d with %2d prime%s: \", x, m, s);\n for (int i = 0; i < m; ++i) {\n System.out.print(primes[combo[i]]);\n if (i < m - 1) System.out.print('+');\n else System.out.println();\n }\n foundCombo = true;\n }\n } else {\n for (int j = 0; j < n; ++j) {\n if (k == 0 || j > combo[k - 1]) {\n combo[k] = j;\n if (!foundCombo) {\n foundCombo = findCombo(k + 1, x, m, n, combo);\n }\n }\n }\n }\n return foundCombo;\n }\n\n private static void partition(int x, int m) {\n if (x < 2 || m < 1 || m >= x) {\n throw new IllegalArgumentException();\n }\n int[] filteredPrimes = Arrays.stream(primes).filter(it -> it <= x).toArray();\n int n = filteredPrimes.length;\n if (n < m) throw new IllegalArgumentException(\"Not enough primes\");\n int[] combo = new int[m];\n boolean foundCombo = findCombo(0, x, m, n, combo);\n if (!foundCombo) {\n String s = m > 1 ? \"s\" : \" \";\n System.out.printf(\"Partitioned %5d with %2d prime%s: (not possible)\\n\", x, m, s);\n }\n }\n\n public static void main(String[] args) {\n partition(99809, 1);\n partition(18, 2);\n partition(19, 3);\n partition(20, 4);\n partition(2017, 24);\n partition(22699, 1);\n partition(22699, 2);\n partition(22699, 3);\n partition(22699, 4);\n partition(40355, 3);\n }\n}\n","language":"Java"},{"code":"# Is the input integer a prime?\ndef is_prime:\n if . == 2 then true\n else 2 < . and . % 2 == 1 and\n . as $in\n | (($in + 1) | sqrt) as $m\n | (((($m - 1) / 2) | floor) + 1) as $max\n | all( range(1; $max) ; $in % ((2 * .) + 1) > 0 )\n end;\n\n# Is the input integer a prime?\n# `previous` should be a sorted array of consecutive primes\n# greater than 1 and at least including the greatest prime less than (.|sqrt)\ndef is_prime(previous):\n . as $in\n | (($in + 1) | sqrt) as $sqrt\n | first(previous[]\n | if . > $sqrt then 1\n elif 0 == ($in % .) then 0\n else empty\n end) // 1\n | . == 1;\n\n# This assumes . is an array of consecutive primes beginning with [2,3]\ndef next_prime:\n . as $previous\n | (2 + .[-1] )\n | until(is_prime($previous); . + 2) ;\n\n# Emit primes from 2 up\ndef primes:\n # The helper function has arity 0 for TCO\n # It expects its input to be an array of previously found primes, in order:\n def next:\n . as $previous\n | ($previous|next_prime) as $next\n | $next, (($previous + [$next]) | next) ;\n 2, 3, ([2,3] | next);\n\n# The primes less than or equal to $x\ndef primes($x):\n label $out\n | primes | if . > $x then break $out else . end;\n","language":"Jq"},{"code":"# Emit a stream consisting of arrays, a, of $n items from the input array,\n# preserving order, subject to (a|add) == $sum\ndef take($n; $sum):\n def take:\n . as [$m, $in, $s]\n | if $m==0 and $s == 0 then []\n elif $m==0 or $s <= 0 then empty\n else range(0;$in|length) as $i\n | $in[$i] as $x\n | if $x > $s then empty\n else [$x] + ([$m-1, $in[$i+1:], $s - $x] | take)\n end\n end;\n [$n, ., $sum] | take;\n","language":"Jq"},{"code":"# This function emits a possibly empty stream of arrays.\n# Assuming $primes is primes(.), each array corresponds to a\n# partition of the input into $n distinct primes.\n# The algorithm is unoptimized.\n# The output is a stream of arrays, which would be empty\ndef primepartition($n; $primes):\n . as $x\n | if $n == 1\n then if $primes[-1] == $x then [$x] else null end\n else (if $primes[-1] == $x then $primes[:-1] else $primes end) as $primes\n | ($primes | take($n; $x))\n end ;\n\n# See primepartition/2\ndef primepartition($n):\n . as $x\n | if $n == 1\n then if is_prime then [.] else null end\n else primepartition($n; [primes($x)])\n end;\n\n# Compute first(primepartition($n)) for each $n in the array $ary\ndef primepartitions($ary):\n . as $x\n | [primes($x)] as $px\n | $ary[] as $n\n | $x\n | first(primepartition($n; $px));\n\ndef task($x; $n):\n def pp:\n if . then join(\"+\") else \"(not possible)\" end;\n\n if $n|type == \"array\" then task($x; $n[])\n else \"A partition of \\($x) into \\($n) parts: \\(first($x | primepartition($n)) | pp )\"\n end;\n","language":"Jq"},{"code":"task(18; 2),\ntask(19; 3),\ntask(20; 4),\ntask(2017; 24),\ntask(22699; [1,2,3,4]),\ntask(40355; 3)\n","language":"Jq"},{"code":"using Primes, Combinatorics\n\nfunction primepartition(x::Int64, n::Int64)\n if n == oftype(n, 1)\n return isprime(x) ? [x] : Int64[]\n else\n for combo in combinations(primes(x), n)\n if sum(combo) == x\n return combo\n end\n end\n end\n return Int64[]\nend\n\nfor (x, n) in [[ 18, 2], [ 19, 3], [ 20, 4], [99807, 1], [99809, 1],\n [ 2017, 24],[22699, 1], [22699, 2], [22699, 3], [22699, 4] ,[40355, 3]]\n ans = primepartition(x, n)\n println(\"Partition of \", x, \" into \", n, \" primes: \",\n isempty(ans) ? \"impossible\" : join(ans, \" + \"))\nend\n","language":"Julia"},{"code":"// version 1.1.2\n\n// compiled with flag -Xcoroutines=enable to suppress 'experimental' warning\n\nimport kotlin.coroutines.experimental.*\n\nval primes = generatePrimes().take(50_000).toList() // generate first 50,000 say\nvar foundCombo = false\n\nfun isPrime(n: Int) : Boolean {\n if (n < 2) return false\n if (n % 2 == 0) return n == 2\n if (n % 3 == 0) return n == 3\n var d : Int = 5\n while (d * d <= n) {\n if (n % d == 0) return false\n d += 2\n if (n % d == 0) return false\n d += 4\n }\n return true\n}\n\nfun generatePrimes() =\n buildSequence {\n yield(2)\n var p = 3\n while (p <= Int.MAX_VALUE) {\n if (isPrime(p)) yield(p)\n p += 2\n }\n }\n\nfun findCombo(k: Int, x: Int, m: Int, n: Int, combo: IntArray) {\n if (k >= m) {\n if (combo.sumBy { primes[it] } == x) {\n val s = if (m > 1) \"s\" else \" \"\n print(\"Partitioned ${\"%5d\".format(x)} with ${\"%2d\".format(m)} prime$s: \")\n for (i in 0 until m) {\n print(primes[combo[i]])\n if (i < m - 1) print(\"+\") else println()\n }\n foundCombo = true\n }\n }\n else {\n for (j in 0 until n) {\n if (k == 0 || j > combo[k - 1]) {\n combo[k] = j\n if (!foundCombo) findCombo(k + 1, x, m, n, combo)\n }\n }\n }\n}\n\nfun partition(x: Int, m: Int) {\n require(x >= 2 && m >= 1 && m < x)\n val filteredPrimes = primes.filter { it <= x }\n val n = filteredPrimes.size\n if (n < m) throw IllegalArgumentException(\"Not enough primes\")\n val combo = IntArray(m)\n foundCombo = false\n findCombo(0, x, m, n, combo)\n if (!foundCombo) {\n val s = if (m > 1) \"s\" else \" \"\n println(\"Partitioned ${\"%5d\".format(x)} with ${\"%2d\".format(m)} prime$s: (not possible)\")\n }\n}\n\nfun main(args: Array<String>) {\n val a = arrayOf(\n 99809 to 1,\n 18 to 2,\n 19 to 3,\n 20 to 4,\n 2017 to 24,\n 22699 to 1,\n 22699 to 2,\n 22699 to 3,\n 22699 to 4,\n 40355 to 3\n )\n for (p in a) partition(p.first, p.second)\n}\n","language":"Kotlin"},{"code":"----------------------------------------\n-- returns a sorted list of the <cnt> smallest unique primes that add up to <n>,\n-- or FALSE if there is no such partition of primes for <n>\n----------------------------------------\non getPrimePartition (n, cnt, primes, ptr, res)\n if voidP(primes) then\n primes = _global.sieve.getPrimesInRange(2, n)\n ptr = 1\n res = []\n end if\n if cnt=1 then\n if primes.getPos(n)>=ptr then\n res.addAt(1, n)\n if res.count=cnt+ptr-1 then\n return res\n end if\n return TRUE\n end if\n else\n repeat with i = ptr to primes.count\n p = primes[i]\n ok = getPrimePartition(n-p, cnt-1, primes, i+1, res)\n if ok then\n res.addAt(1, p)\n if res.count=cnt+ptr-1 then\n return res\n end if\n return TRUE\n end if\n end repeat\n end if\n return FALSE\nend\n\n----------------------------------------\n-- gets partition, prints formatted result\n----------------------------------------\non showPrimePartition (n, cnt)\n res = getPrimePartition(n, cnt)\n if res=FALSE then res = \"not prossible\"\n else res = implode(\"+\", res)\n put \"Partitioned \"&n&\" with \"&cnt&\" primes: \" & res\nend\n\n----------------------------------------\n-- implodes list into string\n----------------------------------------\non implode (delim, tList)\n str = \"\"\n repeat with i=1 to tList.count\n put tList[i]&delim after str\n end repeat\n delete char (str.length+1-delim.length) to str.length of str\n return str\nend\n","language":"Lingo"},{"code":"-- main\n_global.sieve = script(\"sieve\").new()\n\nshowPrimePartition(99809, 1)\nshowPrimePartition(18, 2)\nshowPrimePartition(19, 3)\nshowPrimePartition(20, 4)\nshowPrimePartition(2017, 24)\nshowPrimePartition(22699, 1)\nshowPrimePartition(22699, 2)\nshowPrimePartition(22699, 3)\nshowPrimePartition(22699, 4)\nshowPrimePartition(40355, 3)\n","language":"Lingo"},{"code":"NextPrimeMemo[n_] := (NextPrimeMemo[n] = NextPrime[n]);(*This improves performance by 30% or so*)\nPrimeList[count_] := Prime/@Range[count];(*Just a helper to create an initial list of primes of the desired length*)\nAppendPrime[list_] := Append[list,NextPrimeMemo[Last@list]];(*Another helper that makes creating the next candidate less verbose*)\n\nNextCandidate[{list_, target_}] :=\n With[\n {len = Length@list, nextHead = NestWhile[Drop[#, -1] &, list, Total[#] > target &]},\n Which[\n {} == nextHead, {{}, target},\n Total[nextHead] == target && Length@nextHead == len, {nextHead, target},\n True, {NestWhile[AppendPrime, MapAt[NextPrimeMemo, nextHead, -1], Length[#] < Length[list] &], target}\n ]\n ];(*This is the meat of the matter. If it determines that the job is impossible, it returns a structure with an empty list of summands. If the input satisfies the success criteria, it just returns it (this will be our fixed point). Otherwise, it generates a subsequent candidate.*)\n\nFormatResult[{list_, number_}, targetCount_] :=\n StringForm[\n \"Partitioned `1` with `2` prime`4`: `3`\",\n number,\n targetCount,\n If[0 == Length@list, \"no solutions found\", StringRiffle[list, \"+\"]],\n If[1 == Length@list, \"\", \"s\"]]; (*Just a helper for pretty-printing the output*)\n\nPrimePartition[number_, count_] := FixedPoint[NextCandidate, {PrimeList[count], number}];(*This is where things kick off. NextCandidate will eventually return the failure format or a success, and either of those are fixed points of the function.*)\n\nTestCases =\n {\n {99809, 1},\n {18, 2},\n {19, 3},\n {20, 4},\n {2017, 24},\n {22699, 1},\n {22699, 2},\n {22699, 3},\n {22699, 4},\n {40355, 3}\n };\n\nTimedResults = ReleaseHold[Hold[AbsoluteTiming[FormatResult[PrimePartition @@ #, Last@#]]] & /@TestCases](*I thought it would be interesting to include the timings, which are in seconds*)\n\nTimedResults // TableForm\n","language":"Mathematica"},{"code":"import math, sugar\n\nconst N = 100_000\n\n# Fill a sieve of Erathostenes.\nvar isPrime {.noInit.}: array[2..N, bool]\nfor item in isPrime.mitems: item = true\nfor n in 2..int(sqrt(N.toFloat)):\n if isPrime[n]:\n for k in countup(n * n, N, n):\n isPrime[k] = false\n\n# Build list of primes.\nlet primes = collect(newSeq):\n for n in 2..N:\n if isPrime[n]: n\n\n\nproc partition(n, k: int; start = 0): seq[int] =\n ## Partition \"n\" in \"k\" primes starting at position \"start\" in \"primes\".\n ## Return the list of primes or an empty list if partitionning is impossible.\n\n if k == 1:\n return if isPrime[n] and n >= primes[start]: @[n] else: @[]\n\n for i in start..primes.high:\n let a = primes[i]\n if n - a <= 1: break\n result = partition(n - a, k - 1, i + 1)\n if result.len != 0:\n return a & result\n\n\nwhen isMainModule:\n\n import strutils\n\n func plural(k: int): string =\n if k <= 1: \"\" else: \"s\"\n\n for (n, k) in [(99809, 1), (18, 2), (19, 3), (20, 4),\n (2017, 24), (22699, 1), (22699, 2),\n (22699, 3), (22699, 4), (40355, 3)]:\n let part = partition(n, k)\n if part.len == 0:\n echo n, \" cannot be partitionned into \", k, \" prime\", plural(k)\n else:\n echo n, \" = \", part.join(\" + \")\n","language":"Nim"},{"code":"partDistinctPrimes(x,n,mn=2)=\n{\n if(n==1, return(if(isprime(x) && mn<=x, [x], 0)));\n if((x-n)%2,\n if(mn>2, return(0));\n my(t=partDistinctPrimes(x-2,n-1,3));\n return(if(t, concat(2,t), 0))\n );\n if(n==2,\n forprime(p=mn,(x-1)\\2,\n if(isprime(x-p), return([p,x-p]))\n );\n return(0)\n );\n if(n<1, return(if(n, 0, [])));\n\n \\\\ x is the sum of 3 or more odd primes\n my(t);\n forprime(p=mn,(x-1)\\n,\n t=partDistinctPrimes(x-p,n-1,p+2);\n if(t, return(concat(p,t)))\n );\n 0;\n}\ndisplayNicely(x,n)=\n{\n printf(\"Partitioned%6d with%3d prime\", x, n);\n if(n!=1, print1(\"s\"));\n my(t=partDistinctPrimes(x,n));\n if(t===0, print(\": (not possible)\"); return);\n if(#t, print1(\": \"t[1]));\n for(i=2,#t, print1(\"+\"t[i]));\n print();\n}\nV=[[99809,1], [18,2], [19,3], [20,4], [2017,24], [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]];\nfor(i=1,#V, call(displayNicely, V[i]))\n","language":"PARI-GP"},{"code":"use ntheory \":all\";\n\nsub prime_partition {\n my($num, $parts) = @_;\n return is_prime($num) ? [$num] : undef if $parts == 1;\n my @p = @{primes($num)};\n my $r;\n forcomb { lastfor, $r = [@p[@_]] if vecsum(@p[@_]) == $num; } @p, $parts;\n $r;\n}\n\nforeach my $test ([18,2], [19,3], [20,4], [99807,1], [99809,1], [2017,24], [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]) {\n my $partar = prime_partition(@$test);\n printf \"Partition %5d into %2d prime piece%s %s\\n\", $test->[0], $test->[1], ($test->[1] == 1) ? \": \" : \"s:\", defined($partar) ? join(\"+\",@$partar) : \"not possible\";\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.2\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (join(fmt))</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">partition</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)?{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">}:</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">idx</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">np</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">get_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">np</span><span style=\"color: #0000FF;\">>=</span><span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">partition</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">np</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">idx</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #004080;\">sequence</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">prepend</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">np</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">tests</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">99809</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">19</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">2017</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">24</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">22699</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">22699</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">22699</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">22699</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">40355</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">tests</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">partition</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"not possible\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" + \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Partition %d into %d primes: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"prime_partition(N, 1, [N], Min):-\n is_prime(N),\n N > Min,\n !.\nprime_partition(N, K, [P|Rest], Min):-\n K > 1,\n is_prime(P),\n P > Min,\n P < N,\n K1 is K - 1,\n N1 is N - P,\n prime_partition(N1, K1, Rest, P),\n !.\n\nprime_partition(N, K, Primes):-\n prime_partition(N, K, Primes, 1).\n\nprint_primes([Prime]):-\n !,\n writef('%w\\n', [Prime]).\nprint_primes([Prime|Primes]):-\n writef('%w + ', [Prime]),\n print_primes(Primes).\n\nprint_prime_partition(N, K):-\n prime_partition(N, K, Primes),\n !,\n writef('%w = ', [N]),\n print_primes(Primes).\nprint_prime_partition(N, K):-\n writef('%w cannot be partitioned into %w primes.\\n', [N, K]).\n\nmain:-\n find_prime_numbers(100000),\n print_prime_partition(99809, 1),\n print_prime_partition(18, 2),\n print_prime_partition(19, 3),\n print_prime_partition(20, 4),\n print_prime_partition(2017, 24),\n print_prime_partition(22699, 1),\n print_prime_partition(22699, 2),\n print_prime_partition(22699, 3),\n print_prime_partition(22699, 4),\n print_prime_partition(40355, 3).\n","language":"Prolog"},{"code":":- module(prime_numbers, [find_prime_numbers/1, is_prime/1]).\n:- dynamic is_prime/1.\n\nfind_prime_numbers(N):-\n retractall(is_prime(_)),\n assertz(is_prime(2)),\n init_sieve(N, 3),\n sieve(N, 3).\n\ninit_sieve(N, P):-\n P > N,\n !.\ninit_sieve(N, P):-\n assertz(is_prime(P)),\n Q is P + 2,\n init_sieve(N, Q).\n\nsieve(N, P):-\n P * P > N,\n !.\nsieve(N, P):-\n is_prime(P),\n !,\n S is P * P,\n cross_out(S, N, P),\n Q is P + 2,\n sieve(N, Q).\nsieve(N, P):-\n Q is P + 2,\n sieve(N, Q).\n\ncross_out(S, N, _):-\n S > N,\n !.\ncross_out(S, N, P):-\n retract(is_prime(S)),\n !,\n Q is S + 2 * P,\n cross_out(Q, N, P).\ncross_out(S, N, P):-\n Q is S + 2 * P,\n cross_out(Q, N, P).\n","language":"Prolog"},{"code":"from itertools import combinations as cmb\n\n\ndef isP(n):\n if n == 2:\n return True\n if n % 2 == 0:\n return False\n return all(n % x > 0 for x in range(3, int(n ** 0.5) + 1, 2))\n\n\ndef genP(n):\n p = [2]\n p.extend([x for x in range(3, n + 1, 2) if isP(x)])\n return p\n\n\ndata = [\n (99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24),\n (22699, 1), (22699, 2), (22699, 3), (22699, 4), (40355, 3)]\n\n\nfor n, cnt in data:\n ci = iter(cmb(genP(n), cnt))\n while True:\n try:\n c = next(ci)\n if sum(c) == n:\n print(' '.join(\n [repr((n, cnt)), \"->\", '+'.join(str(s) for s in c)]\n ))\n break\n except StopIteration:\n print(repr((n, cnt)) + \" -> Not possible\")\n break\n","language":"Python"},{"code":"#lang racket\n(require math/number-theory)\n\n(define memoised-next-prime\n (let ((m# (make-hash)))\n (λ (P) (hash-ref! m# P (λ () (next-prime P))))))\n\n(define (partition-X-into-N-primes X N)\n (define (partition-x-into-n-primes-starting-at-P x n P result)\n (cond ((= n x 0) result)\n ((or (= n 0) (= x 0) (> P x)) #f)\n (else\n (let ((P′ (memoised-next-prime P)))\n (or (partition-x-into-n-primes-starting-at-P (- x P) (- n 1) P′ (cons P result))\n (partition-x-into-n-primes-starting-at-P x n P′ result))))))\n\n (reverse (or (partition-x-into-n-primes-starting-at-P X N 2 null) (list 'no-solution))))\n\n(define (report-partition X N)\n (let ((result (partition-X-into-N-primes X N)))\n (printf \"partition ~a\\twith ~a\\tprimes: ~a~%\" X N (string-join (map ~a result) \" + \"))))\n\n(module+ test\n (report-partition 99809 1)\n (report-partition 18 2)\n (report-partition 19 3)\n (report-partition 20 4)\n (report-partition 2017 24)\n (report-partition 22699 1)\n (report-partition 22699 2)\n (report-partition 22699 3)\n (report-partition 22699 4)\n (report-partition 40355 3))\n","language":"Racket"},{"code":"use Math::Primesieve;\nmy $sieve = Math::Primesieve.new;\n\n# short circuit for '1' partition\nmulti partition ( Int $number, 1 ) { $number.is-prime ?? $number !! () }\n\nmulti partition ( Int $number, Int $parts where * > 0 = 2 ) {\n my @these = $sieve.primes($number);\n for @these.combinations($parts) { .return if .sum == $number };\n ()\n}\n\n# TESTING\n(18,2, 19,3, 20,4, 99807,1, 99809,1, 2017,24, 22699,1, 22699,2, 22699,3, 22699,4, 40355,3)\\\n .race(:1batch).map: -> $number, $parts {\n say (sprintf \"Partition %5d into %2d prime piece\", $number, $parts),\n $parts == 1 ?? ': ' !! 's: ', join '+', partition($number, $parts) || 'not possible'\n}\n","language":"Raku"},{"code":"$ENTRY Go {\n = <Each Test <Tests>>;\n};\n\nTests {\n = (99809 1) (18 2) (19 3) (20 4) (2017 24)\n (22699 1) (22699 2) (22699 3) (22699 4) (40355 3);\n};\n\nTest {\n (s.X s.N) =\n <Prout 'Partitioned ' <Symb s.X> ' with ' <Symb s.N> ' primes: '\n <Format <PrimePartition s.X s.N>>>;\n};\n\nFormat {\n F = 'not possible';\n T s.N = <Symb s.N>;\n T s.N e.X = <Symb s.N> '+' <Format T e.X>;\n};\n\nPrimePartition {\n s.X s.N = <Partition s.X s.N <Primes s.X>>;\n};\n\nPartition {\n s.X 1 e.Nums, e.Nums: {\n e.1 s.X e.2 = T s.X;\n e.1 = F;\n };\n s.X s.N = F;\n s.X s.N s.Num e.Nums, <Compare s.X s.Num>: '-' =\n <Partition s.X s.N e.Nums>;\n s.X s.N s.Num e.Nums,\n <Partition <- s.X s.Num> <- s.N 1> e.Nums>: {\n T e.List = T s.Num e.List;\n F = <Partition s.X s.N e.Nums>;\n };\n};\n\nPrimes {\n s.N = <Sieve <Iota 2 s.N>>;\n};\n\nIota {\n s.End s.End = s.End;\n s.Start s.End = s.Start <Iota <+ 1 s.Start> s.End>;\n};\n\nCross {\n s.Step e.List = <Cross (s.Step 1) s.Step e.List>;\n (s.Step s.Skip) = ;\n (s.Step 1) s.Item e.List = X <Cross (s.Step s.Step) e.List>;\n (s.Step s.N) s.Item e.List = s.Item <Cross (s.Step <- s.N 1>) e.List>;\n};\n\nSieve {\n = ;\n X e.List = <Sieve e.List>;\n s.N e.List = s.N <Sieve <Cross s.N e.List>>;\n};\n\nEach {\n s.F = ;\n s.F t.X e.R = <Mu s.F t.X> <Each s.F e.R>;\n};\n","language":"Refal"},{"code":"/*REXX program partitions integer(s) (greater than unity) into N primes. */\nparse arg what /*obtain an optional list from the C.L.*/\n\n do until what=='' /*possibly process a series of integers*/\n parse var what x n what; parse var x x '-' y /*get possible range and # partitions.*/\n parse var n n '-' m /* \" \" \" \" \" \" */\n if x=='' | x==\",\" then x= 19 /*Not specified? Then use the default.*/\n if y=='' | y==\",\" then y= x /* \" \" \" \" \" \" */\n if n=='' | n==\",\" then n= 3 /* \" \" \" \" \" \" */\n if m=='' | m==\",\" then m= n /* \" \" \" \" \" \" */\n call genP y /*generate Y number of primes. */\n do g=x to y /*partition X ───► Y into partitions.*/\n do q=n to m; call part /* \" G into Q primes. */\n end /*q*/\n end /*g*/\n end /*until*/\n\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngenP: arg high; @.1= 2; @.2= 3; #= 2 /*get highest prime, assign some vars. */\n do j=@.#+2 by 2 until @.#>high /*only find odd primes from here on. */\n do k=2 while k*k<=j /*divide by some known low odd primes. */\n if j // @.k==0 then iterate j /*Is J divisible by P? Then ¬ prime.*/\n end /*k*/ /* [↓] a prime (J) has been found. */\n #= # + 1; @.#= j /*bump prime count; assign prime to @.*/\n end /*j*/; return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngetP: procedure expose i. p. @.; parse arg z /*bump the prime in the partition list.*/\n if i.z==0 then do; _= z - 1; i.z= i._; end\n i.z= i.z + 1; _= i.z; p.z= @._; return 0\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nlist: _= p.1; if $==g then do j=2 to q; _= _ p.j\n end /*j*/\n else _= '__(not_possible)'\n return 'prime' || word(\"s\", 1 + (q==1)) translate(_, '+ ', \" _\") /*plural? */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npart: i.= 0; do j=1 for q; call getP j\n end /*j*/\n\n do !=0 by 0; $= 0 /*!: a DO variable for LEAVE & ITERATE*/\n do s=1 for q; $= $ + p.s /* [↓] is sum of the primes too large?*/\n if $>g then do; if s==1 then leave ! /*perform a quick exit?*/\n do k=s to q; i.k= 0; end /*k*/\n do r=s-1 to q; call getP r; end /*r*/\n iterate !\n end\n end /*s*/\n if $==g then leave /*is sum of the primes exactly right ? */\n if $ <g then do; call getP q; iterate; end\n end /*!*/ /* [↑] Is sum too low? Bump a prime.*/\n say 'partitioned' center(g,9) \"into\" center(q, 5) list()\n return\n","language":"REXX"},{"code":"# Project : Partition an integer X into N primes\n\nload \"stdlib.ring\"\nnr = 0\nnum = 0\nlist = list(100000)\nitems = newlist(pow(2,len(list))-1,100000)\nwhile true\n nr = nr + 1\n if isprime(nr)\n num = num + 1\n list[num] = nr\n ok\n if num = 100000\n exit\n ok\nend\n\npowerset(list,100000)\nshowarray(items,100000)\nsee nl\n\nfunc showarray(items,ind)\n for p = 1 to 20\n if (p > 17 and p < 21) or p = 99809 or p = 2017 or p = 22699 or p = 40355\n for n = 1 to len(items)\n flag = 0\n for m = 1 to ind\n if items[n][m] = 0\n exit\n ok\n flag = flag + items[n][m]\n next\n if flag = p\n str = \"\"\n for x = 1 to len(items[n])\n if items[n][x] != 0\n str = str + items[n][x] + \" \"\n ok\n next\n str = left(str, len(str) - 1)\n str = str + \"]\"\n if substr(str, \" \") > 0\n see \"\" + p + \" = [\"\n see str + nl\n exit\n else\n str = \"\"\n ok\n ok\n next\n ok\n next\n\nfunc powerset(list,ind)\n num = 0\n num2 = 0\n items = newlist(pow(2,len(list))-1,ind)\n for i = 2 to (2 << len(list)) - 1 step 2\n num2 = 0\n num = num + 1\n for j = 1 to len(list)\n if i & (1 << j)\n num2 = num2 + 1\n if list[j] != 0\n items[num][num2] = list[j]\n ok\n ok\n next\n next\n return items\n","language":"Ring"},{"code":"require \"prime\"\n\ndef prime_partition(x, n)\n Prime.each(x).to_a.combination(n).detect{|primes| primes.sum == x}\nend\n\nTESTCASES = [[99809, 1], [18, 2], [19, 3], [20, 4], [2017, 24],\n [22699, 1], [22699, 2], [22699, 3], [22699, 4], [40355, 3]]\n\nTESTCASES.each do |prime, num|\n res = prime_partition(prime, num)\n str = res.nil? ? \"no solution\" : res.join(\" + \")\n puts \"Partitioned #{prime} with #{num} primes: #{str}\"\nend\n","language":"Ruby"},{"code":"// main.rs\nmod bit_array;\nmod prime_sieve;\n\nuse prime_sieve::PrimeSieve;\n\nfn find_prime_partition(\n sieve: &PrimeSieve,\n number: usize,\n count: usize,\n min_prime: usize,\n primes: &mut Vec<usize>,\n index: usize,\n) -> bool {\n if count == 1 {\n if number >= min_prime && sieve.is_prime(number) {\n primes[index] = number;\n return true;\n }\n return false;\n }\n for p in min_prime..number {\n if sieve.is_prime(p)\n && find_prime_partition(sieve, number - p, count - 1, p + 1, primes, index + 1)\n {\n primes[index] = p;\n return true;\n }\n }\n false\n}\n\nfn print_prime_partition(sieve: &PrimeSieve, number: usize, count: usize) {\n let mut primes = vec![0; count];\n if !find_prime_partition(sieve, number, count, 2, &mut primes, 0) {\n println!(\"{} cannot be partitioned into {} primes.\", number, count);\n } else {\n print!(\"{} = {}\", number, primes[0]);\n for i in 1..count {\n print!(\" + {}\", primes[i]);\n }\n println!();\n }\n}\n\nfn main() {\n let s = PrimeSieve::new(100000);\n print_prime_partition(&s, 99809, 1);\n print_prime_partition(&s, 18, 2);\n print_prime_partition(&s, 19, 3);\n print_prime_partition(&s, 20, 4);\n print_prime_partition(&s, 2017, 24);\n print_prime_partition(&s, 22699, 1);\n print_prime_partition(&s, 22699, 2);\n print_prime_partition(&s, 22699, 3);\n print_prime_partition(&s, 22699, 4);\n print_prime_partition(&s, 40355, 3);\n}\n","language":"Rust"},{"code":"// prime_sieve.rs\nuse crate::bit_array;\n\npub struct PrimeSieve {\n composite: bit_array::BitArray,\n}\n\nimpl PrimeSieve {\n pub fn new(limit: usize) -> PrimeSieve {\n let mut sieve = PrimeSieve {\n composite: bit_array::BitArray::new(limit / 2),\n };\n let mut p = 3;\n while p * p <= limit {\n if !sieve.composite.get(p / 2 - 1) {\n let inc = p * 2;\n let mut q = p * p;\n while q <= limit {\n sieve.composite.set(q / 2 - 1, true);\n q += inc;\n }\n }\n p += 2;\n }\n sieve\n }\n pub fn is_prime(&self, n: usize) -> bool {\n if n < 2 {\n return false;\n }\n if n % 2 == 0 {\n return n == 2;\n }\n !self.composite.get(n / 2 - 1)\n }\n}\n","language":"Rust"},{"code":"// bit_array.rs\npub struct BitArray {\n array: Vec<u32>,\n}\n\nimpl BitArray {\n pub fn new(size: usize) -> BitArray {\n BitArray {\n array: vec![0; (size + 31) / 32],\n }\n }\n pub fn get(&self, index: usize) -> bool {\n let bit = 1 << (index & 31);\n (self.array[index >> 5] & bit) != 0\n }\n pub fn set(&mut self, index: usize, new_val: bool) {\n let bit = 1 << (index & 31);\n if new_val {\n self.array[index >> 5] |= bit;\n } else {\n self.array[index >> 5] &= !bit;\n }\n }\n}\n","language":"Rust"},{"code":"object PartitionInteger {\n\n def sieve(nums: LazyList[Int]): LazyList[Int] =\n LazyList.cons(nums.head, sieve((nums.tail) filter (_ % nums.head != 0)))\n\n // An 'infinite' stream of primes, lazy evaluation and memo-ized\n private val oddPrimes = sieve(LazyList.from(3, 2))\n private val primes = sieve(2 #:: oddPrimes).take(3600 /*50_000*/)\n\n private def findCombo(k: Int, x: Int, m: Int, n: Int, combo: Array[Int]): Boolean = {\n var foundCombo = combo.map(i => primes(i)).sum == x\n if (k >= m) {\n if (foundCombo) {\n val s: String = if (m > 1) \"s\" else \"\"\n printf(\"Partitioned %5d with %2d prime%s: \", x, m, s)\n for (i <- 0 until m) {\n print(primes(combo(i)))\n if (i < m - 1) print('+') else println()\n }\n }\n } else for (j <- 0 until n if k == 0 || j > combo(k - 1)) {\n combo(k) = j\n if (!foundCombo) foundCombo = findCombo(k + 1, x, m, n, combo)\n }\n foundCombo\n }\n\n private def partition(x: Int, m: Int): Unit = {\n val n: Int = primes.count(it => it <= x)\n if (n < m) throw new IllegalArgumentException(\"Not enough primes\")\n\n if (!findCombo(0, x, m, n, new Array[Int](m)))\n printf(\"Partitioned %5d with %2d prime%s: (not possible)\\n\", x, m, if (m > 1) \"s\" else \" \")\n }\n\n def main(args: Array[String]): Unit = {\n partition(99809, 1)\n partition(18, 2)\n partition(19, 3)\n partition(20, 4)\n partition(2017, 24)\n partition(22699, 1)\n partition(22699, 2)\n partition(22699, 3)\n partition(22699, 4)\n partition(40355, 3)\n }\n\n}\n","language":"Scala"},{"code":"program primes_partition;\n tests := [[99809,1], [18,2], [19,3], [20,4], [2017,24],\n [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]];\n\n loop for [x, n] in tests do\n nprint(\"Partitioned\",x,\"with\",n,\"primes:\");\n if (p := partition(x,n)) = om then\n print(\" not possible\");\n else\n print(\" \" + (+/[\"+\" + str pr : pr in p])(2..));\n end if;\n end loop;\n\n proc partition(x,n);\n return findpart(x,n,sieve(x));\n end proc;\n\n proc findpart(x,n,nums);\n if n=1 then\n return if x in nums then [x] else om end;\n end if;\n\n loop while nums /= [] do\n k fromb nums;\n if (l := findpart(x-k, n-1, nums)) /= om then\n return [k] + l;\n end if;\n end loop;\n return om;\n end proc;\n\n proc sieve(n);\n primes := [1..n];\n primes(1) := om;\n loop for p in [2..floor sqrt n] do\n loop for c in [p*p, p*p+p..n] do\n primes(c) := om;\n end loop;\n end loop;\n return [p : p in primes | p /= om];\n end proc;\nend program;\n","language":"SETL"},{"code":"func prime_partition(num, parts) {\n\n if (parts == 1) {\n return (num.is_prime ? [num] : [])\n }\n\n num.primes.combinations(parts, {|*c|\n return c if (c.sum == num)\n })\n\n return []\n}\n\nvar tests = [\n [ 18, 2], [ 19, 3], [ 20, 4],\n [99807, 1], [99809, 1], [ 2017, 24],\n [22699, 1], [22699, 2], [22699, 3],\n [22699, 4], [40355, 3],\n]\n\nfor num,parts (tests) {\n say (\"Partition %5d into %2d prime piece\" % (num, parts),\n parts == 1 ? ': ' : 's: ', prime_partition(num, parts).join('+') || 'not possible')\n}\n","language":"Sidef"},{"code":"import Foundation\n\nclass BitArray {\n var array: [UInt32]\n\n init(size: Int) {\n array = Array(repeating: 0, count: (size + 31)/32)\n }\n\n func get(index: Int) -> Bool {\n let bit = UInt32(1) << (index & 31)\n return (array[index >> 5] & bit) != 0\n }\n\n func set(index: Int, value: Bool) {\n let bit = UInt32(1) << (index & 31)\n if value {\n array[index >> 5] |= bit\n } else {\n array[index >> 5] &= ~bit\n }\n }\n}\n\nclass PrimeSieve {\n let composite: BitArray\n\n init(size: Int) {\n composite = BitArray(size: size/2)\n var p = 3\n while p * p <= size {\n if !composite.get(index: p/2 - 1) {\n let inc = p * 2\n var q = p * p\n while q <= size {\n composite.set(index: q/2 - 1, value: true)\n q += inc\n }\n }\n p += 2\n }\n }\n\n func isPrime(number: Int) -> Bool {\n if number < 2 {\n return false\n }\n if (number & 1) == 0 {\n return number == 2\n }\n return !composite.get(index: number/2 - 1)\n }\n}\n\nfunc findPrimePartition(sieve: PrimeSieve, number: Int,\n count: Int, minPrime: Int,\n primes: inout [Int], index: Int) -> Bool {\n if count == 1 {\n if number >= minPrime && sieve.isPrime(number: number) {\n primes[index] = number\n return true\n }\n return false\n }\n if minPrime >= number {\n return false\n }\n for p in minPrime..<number {\n if sieve.isPrime(number: p)\n && findPrimePartition(sieve: sieve, number: number - p,\n count: count - 1, minPrime: p + 1,\n primes: &primes, index: index + 1) {\n primes[index] = p\n return true\n }\n }\n return false\n}\n\nfunc printPrimePartition(sieve: PrimeSieve, number: Int, count: Int) {\n var primes = Array(repeating: 0, count: count)\n if !findPrimePartition(sieve: sieve, number: number, count: count,\n minPrime: 2, primes: &primes, index: 0) {\n print(\"\\(number) cannot be partitioned into \\(count) primes.\")\n } else {\n print(\"\\(number) = \\(primes[0])\", terminator: \"\")\n for i in 1..<count {\n print(\" + \\(primes[i])\", terminator: \"\")\n }\n print()\n }\n}\n\nlet sieve = PrimeSieve(size: 100000)\nprintPrimePartition(sieve: sieve, number: 99809, count: 1)\nprintPrimePartition(sieve: sieve, number: 18, count: 2)\nprintPrimePartition(sieve: sieve, number: 19, count: 3)\nprintPrimePartition(sieve: sieve, number: 20, count: 4)\nprintPrimePartition(sieve: sieve, number: 2017, count: 24)\nprintPrimePartition(sieve: sieve, number: 22699, count: 1)\nprintPrimePartition(sieve: sieve, number: 22699, count: 2)\nprintPrimePartition(sieve: sieve, number: 22699, count: 3)\nprintPrimePartition(sieve: sieve, number: 22699, count: 4)\nprintPrimePartition(sieve: sieve, number: 40355, count: 3)\n","language":"Swift"},{"code":"' Partition an integer X into N primes\n dim p(),a(32),b(32),v,g: redim p(64)\n what=\"99809 1 18 2 19 3 20 4 2017 24 22699 1-4 40355 3\"\n t1=split(what,\" \")\n for j=0 to ubound(t1)\n t2=split(t1(j)): x=t2(0): n=t2(1)\n t3=split(x,\"-\"): x=clng(t3(0))\n if ubound(t3)=1 then y=clng(t3(1)) else y=x\n t3=split(n,\"-\"): n=clng(t3(0))\n if ubound(t3)=1 then m=clng(t3(1)) else m=n\n genp y 'generate primes in p\n for g=x to y\n for q=n to m: part: next 'q\n next 'g\n next 'j\n\nsub genp(high)\n p(1)=2: p(2)=3: c=2: i=p(c)+2\n do 'i\n k=2: bk=false\n do while k*k<=i and not bk 'k\n if i mod p(k)=0 then bk=true\n k=k+1\n loop 'k\n if not bk then\n c=c+1: if c>ubound(p) then redim preserve p(ubound(p)+8)\n p(c)=i\n end if\n i=i+2\n loop until p(c)>high 'i\nend sub 'genp\n\nsub getp(z)\n if a(z)=0 then w=z-1: a(z)=a(w)\n a(z)=a(z)+1: w=a(z): b(z)=p(w)\nend sub 'getp\n\nfunction list()\n w=b(1)\n if v=g then for i=2 to q: w=w&\"+\"&b(i): next else w=\"(not possible)\"\n list=\"primes: \"&w\nend function 'list\n\nsub part()\n for i=lbound(a) to ubound(a): a(i)=0: next 'i\n for i=1 to q: call getp(i): next 'i\n do while true: v=0: bu=false\n for s=1 to q\n v=v+b(s)\n if v>g then\n if s=1 then exit do\n for k=s to q: a(k)=0: next 'k\n for r=s-1 to q: call getp(r): next 'r\n bu=true: exit for\n end if\n next 's\n if not bu then\n if v=g then exit do\n if v<g then call getp(q)\n end if\n loop\n wscript.echo \"partition \"&g&\" into \"&q&\" \"&list\nend sub 'part\n","language":"VBScript"},{"code":"' Partition an integer X into N primes - 29/03/2017\nOption Explicit On\n\nModule PartitionIntoPrimes\n Dim p(8), a(32), b(32), v, g, q As Long\n\n Sub Main()\n Dim what, t1(), t2(), t3(), xx, nn As String\n Dim x, y, n, m As Long\n what = \"99809 1 18 2 19 3 20 4 2017 24 22699 1-4 40355 3\"\n t1 = Split(what, \" \")\n For j = 0 To UBound(t1)\n t2 = Split(t1(j)) : xx = t2(0) : nn = t2(1)\n t3 = Split(xx, \"-\") : x = CLng(t3(0))\n If UBound(t3) = 1 Then y = CLng(t3(1)) Else y = x\n t3 = Split(nn, \"-\") : n = CLng(t3(0))\n If UBound(t3) = 1 Then m = CLng(t3(1)) Else m = n\n genp(y) 'generate primes in p\n For g = x To y\n For q = n To m : part() : Next 'q\n Next 'g\n Next 'j\n End Sub 'Main\n\n Sub genp(high As Long)\n Dim c, i, k As Long\n Dim bk As Boolean\n p(1) = 2 : p(2) = 3 : c = 2 : i = p(c) + 2\n Do 'i\n k = 2 : bk = False\n Do While k * k <= i And Not bk 'k\n If i Mod p(k) = 0 Then bk = True\n k = k + 1\n Loop 'k\n If Not bk Then\n c = c + 1 : If c > UBound(p) Then ReDim Preserve p(UBound(p) + 8)\n p(c) = i\n End If\n i = i + 2\n Loop Until p(c) > high 'i\n End Sub 'genp\n\n Sub getp(z As Long)\n Dim w As Long\n If a(z) = 0 Then w = z - 1 : a(z) = a(w)\n a(z) = a(z) + 1 : w = a(z) : b(z) = p(w)\n End Sub 'getp\n\n Function list()\n Dim w As String\n w = b(1)\n If v = g Then\n For i = 2 To q : w = w & \"+\" & b(i) : Next\n Else\n w = \"(not possible)\"\n End If\n Return \"primes: \" & w\n End Function 'list\n\n Sub part()\n For i = LBound(a) To UBound(a) : a(i) = 0 : Next 'i\n For i = 1 To q : Call getp(i) : Next 'i\n Do While True : v = 0\n For s = 1 To q\n v = v + b(s)\n If v > g Then\n If s = 1 Then Exit Do\n For k = s To q : a(k) = 0 : Next 'k\n For r = s - 1 To q : Call getp(r) : Next 'r\n Continue Do\n End If\n Next 's\n If v = g Then Exit Do\n If v < g Then Call getp(q)\n Loop\n Console.WriteLine(\"partition \" & g & \" into \" & q & \" \" & list())\n End Sub 'part\n\nEnd Module 'PartitionIntoPrimes\n","language":"Visual-Basic-.NET"},{"code":"import \"./math\" for Int, Nums\nimport \"./fmt\" for Fmt\n\nvar primes = Int.primeSieve(1e5)\nvar foundCombo = false\n\nvar findCombo // recursive\nfindCombo = Fn.new { |k, x, m, n, combo|\n if (k >= m) {\n if (Nums.sum(combo.map { |i| primes[i] }.toList) == x) {\n var s = (m > 1) ? \"s\" : \"\"\n Fmt.write(\"Partitioned $5d with $2d prime$s: \", x, m, s)\n for (i in 0...m) {\n System.write(primes[combo[i]])\n System.write((i < m - 1) ? \"+\" : \"\\n\")\n }\n foundCombo = true\n }\n } else {\n for (j in 0...n) {\n if (k == 0 || j > combo[k - 1]) {\n combo[k] = j\n if (!foundCombo) findCombo.call(k + 1, x, m, n, combo)\n }\n }\n }\n}\n\nvar partition = Fn.new { |x, m|\n if (x < 2 || m < 1 || m >= x) Fiber.abort(\"Invalid argument(s)\")\n var n = primes.where { |p| p <= x }.count\n if (n < m) Fiber.abort(\"Not enough primes\")\n var combo = List.filled(m, 0)\n foundCombo = false\n findCombo.call(0, x, m, n, combo)\n if (!foundCombo) {\n var s = (m > 1) ? \"s\" : \"\"\n Fmt.print(\"Partitioned $5d with $2d prime$s: (not possible)\", x, m, s)\n }\n}\n\nvar a = [\n [99809, 1],\n [18, 2],\n [19, 3],\n [20, 4],\n [2017, 24],\n [22699, 1],\n [22699, 2],\n [22699, 3],\n [22699, 4],\n [40355, 3]\n]\nfor (p in a) partition.call(p[0], p[1])\n","language":"Wren"},{"code":" // Partition integer N into M unique primes\nfcn partition(N,M,idx=0,ps=List()){\n var [const] sieve=Utils.Generator(Import(\"sieve\").postponed_sieve);\n var [const] primes=List();\n while(sieve.peek()<=N){ primes.append(sieve.next()) }\n if(M<2){\n z:=primes.find(N);\n return(if(Void!=z and z>=idx) ps.append(N) else Void);\n }\n foreach z in ([idx..primes.len()-1]){\n p:=primes[z];\n if(p<=N and self.fcn(N-p,M-1,z+1,ps)) return(ps.insert(0,p));\n if(p>N) break;\n }\n Void\t\t// no solution\n}\n","language":"Zkl"},{"code":"foreach n,m in (T( T(18,2),T(19,3),T(99809,1),T(20,4),T(2017,24),\n T(22699,1),T(22699,2),T(22699,3),T(22699,4),T(40355,3), )){\n ps:=partition(n,m);\n if(ps) println(\"Partition %d with %d prime(s): %s\".fmt(n,m,ps.concat(\"+\")));\n else println(\"Can not partition %d with %d prime(s)\".fmt(n,m));\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Partition_an_integer_x_into_n_primes\\nnote: Prime Numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \";Task:\\nPartition a positive integer '''X''' into '''N''' distinct primes. \\n\\n\\nOr, to put it in another way:\\n\\nFind '''N''' unique primes such that they add up to '''X'''.\\n\\n\\nShow in the output section the sum '''X''' and the '''N''' primes in ascending order separated by plus ('''+''') signs:\\n <big> • </big> partition '''99809''' with 1 prime.\\n <big> • </big> partition '''18''' with 2 primes.\\n <big> • </big> partition '''19''' with 3 primes.\\n <big> • </big> partition '''20''' with 4 primes.\\n <big> • </big> partition '''2017''' with 24 primes.\\n <big> • </big> partition '''22699''' with 1, 2, 3, <u>and</u> 4 primes.\\n <big> • </big> partition '''40355''' with 3 primes.\\n\\nThe output could/should be shown in a format such as:\\n\\n Partitioned 19 with 3 primes: 3+5+11\\n\\n::* Use any spacing that may be appropriate for the display.\\n::* You need not validate the input(s).\\n::* Use the lowest primes possible; use '''18 = 5+13''', not '''18 = 7+11'''.\\n::* You only need to show one solution.\\n\\nThis task is similar to factoring an integer.\\n\\n\\n;Related tasks:\\n:* [[Count in factors]]\\n:* [[Prime decomposition]]\\n:* [[Factors of an integer]]\\n:* [[Sieve of Eratosthenes]]\\n:* [[Primality by trial division]]\\n:* [[Factors of a Mersenne number]]\\n:* [[Factors of a Mersenne number]]\\n:* [[Sequence of primes by trial division]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F is_prime(a)\\n R !(a < 2 | any((2 .. Int(a ^ 0.5)).map(x -> @a % x == 0)))\\n\\nF generate_primes(n)\\n V r = [2]\\n V i = 3\\n L\\n I is_prime(i)\\n r.append(i)\\n I r.len == n\\n L.break\\n i += 2\\n R r\\n\\nV primes = generate_primes(50'000)\\n\\nF find_combo(k, x, m, n, &combo)\\n I k >= m\\n I sum(combo.map(idx -> :primes[idx])) == x\\n print(‘Partitioned #5 with #2 #.: ’.format(x, m, I m > 1 {‘primes’} E ‘prime ’), end' ‘’)\\n L(i) 0 .< m\\n print(:primes[combo[i]], end' I i < m - 1 {‘+’} E \\\"\\\\n\\\")\\n R 1B\\n E\\n L(j) 0 .< n\\n I k == 0 | j > combo[k - 1]\\n combo[k] = j\\n I find_combo(k + 1, x, m, n, &combo)\\n R 1B\\n R 0B\\n\\nF partition(x, m)\\n V n = :primes.filter(a -> a <= @x).len\\n V combo = [0] * m\\n I !find_combo(0, x, m, n, &combo)\\n print(‘Partitioned #5 with #2 #.: (not possible)’.format(x, m, I m > 1 {‘primes’} E ‘prime ’))\\n\\nV data = [(99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24),\\n (22699, 1), (22699, 2), (22699, 3), (22699, 4), (40355, 3)]\\n\\nL(n, cnt) data\\n partition(n, cnt)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"BEGIN # find the lowest n distinct primes that sum to an integer x #\\n\\n INT max number = 100 000; # largest number we will consider #\\n # sieve the primes to max number #\\n [ 1 : max number ]BOOL prime; FOR i TO UPB prime DO prime[ i ] := ODD i OD;\\n prime[ 1 ] := FALSE;\\n prime[ 2 ] := TRUE;\\n FOR s FROM 3 BY 2 TO ENTIER sqrt( max number ) DO\\n IF prime[ s ] THEN\\n FOR p FROM s * s BY s TO UPB prime DO prime[ p ] := FALSE OD\\n FI\\n OD;\\n\\n [ 1 : 0 ]INT no partition; # empty array - used if can't partition #\\n\\n # returns n partitioned into p primes or an empty array if n can't be #\\n # partitioned into p primes, the first prime to try is in start #\\n PROC partition from = ( INT n, p, start )[]INT:\\n IF p < 1 OR n < 2 OR start < 2 THEN # invalid parameters #\\n no partition\\n ELIF p = 1 THEN # partition into 1 prime - n must be prime #\\n IF NOT prime[ n ] THEN no partition ELSE n FI\\n ELIF p = 2 THEN # partition into a pair of primes #\\n INT half n = n OVER 2;\\n INT p1 := 0, p2 := 0;\\n BOOL found := FALSE;\\n FOR p pos FROM start TO UPB prime WHILE NOT found AND p pos < half n DO\\n IF prime[ p pos ] THEN\\n p1 := p pos;\\n p2 := n - p pos;\\n found := prime[ p2 ]\\n FI\\n OD;\\n IF NOT found THEN no partition ELSE ( p1, p2 ) FI\\n ELSE # partition into 3 or more primes #\\n [ 1 : p ]INT p2;\\n INT half n = n OVER 2;\\n INT p1 := 0;\\n BOOL found := FALSE;\\n FOR p pos FROM start TO UPB prime WHILE NOT found AND p pos < half n DO\\n IF prime[ p pos ] THEN\\n p1 := p pos;\\n []INT sub partition = partition from( n - p1, p - 1, p pos + 1 );\\n IF found := UPB sub partition = p - 1 THEN\\n # have p - 1 primes summing to n - p1 #\\n p2[ 1 ] := p1;\\n p2[ 2 : p ] := sub partition\\n FI\\n FI\\n OD;\\n IF NOT found THEN no partition ELSE p2 FI\\n FI # partition from # ;\\n\\n # returns the partition of n into p primes or an empty array if that is #\\n # not possible #\\n PROC partition = ( INT n, p )[]INT: partition from( n, p, 2 );\\n\\n # show the first partition of n into p primes, if that is possible #\\n PROC show partition = ( INT n, p )VOID:\\n BEGIN\\n []INT primes = partition( n, p );\\n STRING partition info = whole( n, -6 ) + \\\" with \\\" + whole( p, -2 )\\n + \\\" prime\\\" + IF p = 1 THEN \\\" \\\" ELSE \\\"s\\\" FI + \\\": \\\";\\n IF UPB primes < LWB primes THEN\\n print( ( \\\"Partitioning \\\", partition info, \\\"is not possible\\\" ) )\\n ELSE\\n print( ( \\\"Partitioned \\\", partition info ) );\\n print( ( whole( primes[ LWB primes ], 0 ) ) );\\n FOR p pos FROM LWB primes + 1 TO UPB primes DO\\n print( ( \\\"+\\\", whole( primes[ p pos ], 0 ) ) )\\n OD\\n FI;\\n print( ( newline ) )\\n END # show partition # ;\\n\\n # test cases #\\n show partition( 99809, 1 );\\n show partition( 18, 2 );\\n show partition( 19, 3 );\\n show partition( 20, 4 );\\n show partition( 2017, 24 );\\n show partition( 22699, 1 );\\n show partition( 22699, 2 );\\n show partition( 22699, 3 );\\n show partition( 22699, 4 );\\n show partition( 40355, 3 )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"primepart←{\\n sieve←{\\n (⊃{0@(1↓⍺×⍳⌊(⍴⍵)÷⍺)⊢⍵}/(1↓⍳⍵),⊂(0,1↓⍵/1))/⍳⍵\\n }\\n part←{\\n 0=⍴⍺⍺:⍬\\n ⍵=1:(⍺⍺=⍺)/⍺⍺\\n 0≠⍴r←(⍺-⊃⍺⍺)((1↓⍺⍺)∇∇)⍵-1:(⊃⍺⍺),r\\n ⍺((1↓⍺⍺)∇∇)⍵\\n }\\n ⍺((sieve ⍺)part)⍵\\n}\\nprimepart_test←{\\n tests←(99809 1)(18 2)(19 3)(20 4)(2017 24)\\n tests,←(22699 1)(22699 2)(22699 3)(22699 4)(40355 3)\\n {\\n x n←⍵\\n p←x primepart n\\n ⍞←'Partition ',(⍕x),' with ',(⍕n),' primes: '\\n 0=⍴p:⍞←'not possible.',⎕TC[2]\\n ⍞←(1↓∊'+',¨⍕¨p),⎕TC[2]\\n }¨tests\\n}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet sieve(n, prime) be\\n$( let i = 2\\n 0!prime := false\\n 1!prime := false\\n for i = 2 to n do i!prime := true\\n while i*i <= n\\n $( let j = i*i\\n while j <= n\\n $( j!prime := false\\n j := j+i\\n $)\\n i := i+1\\n $)\\n$)\\n\\nlet partition(x, n, prime, p, part) =\\n p > x -> false,\\n n = 1 -> valof $( !part := x; resultis x!prime $),\\n valof\\n $( p := p+1 repeatuntil p!prime\\n !part := p\\n if partition(x-p, n-1, prime, p, part+1) resultis true\\n resultis partition(x, n, prime, p, part)\\n $)\\n\\nlet showpart(n, part) be\\n$( writef(\\\"%N\\\", !part)\\n unless n=1 do\\n $( wrch('+')\\n showpart(n-1, part+1)\\n $)\\n$)\\n\\nlet show(x, n, prime) be\\n$( let part = vec 32\\n writef(\\\"Partitioned %N with %N prime%S: \\\", x, n, n=1->\\\"\\\", \\\"s\\\")\\n test partition(x, n, prime, 1, part)\\n do showpart(n, part)\\n or writes(\\\"not possible\\\")\\n newline()\\n$)\\n\\nlet start() be\\n$( let prime = getvec(100000)\\n\\n let tests = table 99809,1, 18,2, 19,3, 20,4, 2017,24,\\n 22699,1, 22699,2, 22699,3, 22699,4, 40355,3\\n\\n sieve(100000, prime)\\n for t = 0 to 9 do show(tests!(t*2), tests!(t*2+1), prime)\\n freevec(prime)\\n$)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"#include <assert.h>\\n#include <stdbool.h>\\n#include <stdint.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\ntypedef struct bit_array_tag {\\n uint32_t size;\\n uint32_t* array;\\n} bit_array;\\n\\nbool bit_array_create(bit_array* b, uint32_t size) {\\n uint32_t* array = calloc((size + 31)/32, sizeof(uint32_t));\\n if (array == NULL)\\n return false;\\n b->size = size;\\n b->array = array;\\n return true;\\n}\\n\\nvoid bit_array_destroy(bit_array* b) {\\n free(b->array);\\n b->array = NULL;\\n}\\n\\nvoid bit_array_set(bit_array* b, uint32_t index, bool value) {\\n assert(index < b->size);\\n uint32_t* p = &b->array[index >> 5];\\n uint32_t bit = 1 << (index & 31);\\n if (value)\\n *p |= bit;\\n else\\n *p &= ~bit;\\n}\\n\\nbool bit_array_get(const bit_array* b, uint32_t index) {\\n assert(index < b->size);\\n uint32_t bit = 1 << (index & 31);\\n return (b->array[index >> 5] & bit) != 0;\\n}\\n\\ntypedef struct sieve_tag {\\n uint32_t limit;\\n bit_array not_prime;\\n} sieve;\\n\\nbool sieve_create(sieve* s, uint32_t limit) {\\n if (!bit_array_create(&s->not_prime, limit + 1))\\n return false;\\n bit_array_set(&s->not_prime, 0, true);\\n bit_array_set(&s->not_prime, 1, true);\\n for (uint32_t p = 2; p * p <= limit; ++p) {\\n if (bit_array_get(&s->not_prime, p) == false) {\\n for (uint32_t q = p * p; q <= limit; q += p)\\n bit_array_set(&s->not_prime, q, true);\\n }\\n }\\n s->limit = limit;\\n return true;\\n}\\n\\nvoid sieve_destroy(sieve* s) {\\n bit_array_destroy(&s->not_prime);\\n}\\n\\nbool is_prime(const sieve* s, uint32_t n) {\\n assert(n <= s->limit);\\n return bit_array_get(&s->not_prime, n) == false;\\n}\\n\\nbool find_prime_partition(const sieve* s, uint32_t number, uint32_t count,\\n uint32_t min_prime, uint32_t* p) {\\n if (count == 1) {\\n if (number >= min_prime && is_prime(s, number)) {\\n *p = number;\\n return true;\\n }\\n return false;\\n }\\n for (uint32_t prime = min_prime; prime < number; ++prime) {\\n if (!is_prime(s, prime))\\n continue;\\n if (find_prime_partition(s, number - prime, count - 1,\\n prime + 1, p + 1)) {\\n *p = prime;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nvoid print_prime_partition(const sieve* s, uint32_t number, uint32_t count) {\\n assert(count > 0);\\n uint32_t* primes = malloc(count * sizeof(uint32_t));\\n if (primes == NULL) {\\n fprintf(stderr, \\\"Out of memory\\\\n\\\");\\n return;\\n }\\n if (!find_prime_partition(s, number, count, 2, primes)) {\\n printf(\\\"%u cannot be partitioned into %u primes.\\\\n\\\", number, count);\\n } else {\\n printf(\\\"%u = %u\\\", number, primes[0]);\\n for (uint32_t i = 1; i < count; ++i)\\n printf(\\\" + %u\\\", primes[i]);\\n printf(\\\"\\\\n\\\");\\n }\\n free(primes);\\n}\\n\\nint main() {\\n const uint32_t limit = 100000;\\n sieve s = { 0 };\\n if (!sieve_create(&s, limit)) {\\n fprintf(stderr, \\\"Out of memory\\\\n\\\");\\n return 1;\\n }\\n print_prime_partition(&s, 99809, 1);\\n print_prime_partition(&s, 18, 2);\\n print_prime_partition(&s, 19, 3);\\n print_prime_partition(&s, 20, 4);\\n print_prime_partition(&s, 2017, 24);\\n print_prime_partition(&s, 22699, 1);\\n print_prime_partition(&s, 22699, 2);\\n print_prime_partition(&s, 22699, 3);\\n print_prime_partition(&s, 22699, 4);\\n print_prime_partition(&s, 40355, 3);\\n sieve_destroy(&s);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <functional>\\n#include <iostream>\\n#include <vector>\\n\\nstd::vector<int> primes;\\n\\nstruct Seq {\\npublic:\\n bool empty() {\\n return p < 0;\\n }\\n\\n int front() {\\n return p;\\n }\\n\\n void popFront() {\\n if (p == 2) {\\n p++;\\n } else {\\n p += 2;\\n while (!empty() && !isPrime(p)) {\\n p += 2;\\n }\\n }\\n }\\n\\nprivate:\\n int p = 2;\\n\\n bool isPrime(int n) {\\n if (n < 2) return false;\\n if (n % 2 == 0) return n == 2;\\n if (n % 3 == 0) return n == 3;\\n\\n int d = 5;\\n while (d * d <= n) {\\n if (n % d == 0) return false;\\n d += 2;\\n if (n % d == 0) return false;\\n d += 4;\\n }\\n return true;\\n }\\n};\\n\\n// generate the first 50,000 primes and call it good\\nvoid init() {\\n Seq seq;\\n\\n while (!seq.empty() && primes.size() < 50000) {\\n primes.push_back(seq.front());\\n seq.popFront();\\n }\\n}\\n\\nbool findCombo(int k, int x, int m, int n, std::vector<int>& combo) {\\n if (k >= m) {\\n int sum = 0;\\n for (int idx : combo) {\\n sum += primes[idx];\\n }\\n\\n if (sum == x) {\\n auto word = (m > 1) ? \\\"primes\\\" : \\\"prime\\\";\\n printf(\\\"Partitioned %5d with %2d %s \\\", x, m, word);\\n for (int idx = 0; idx < m; ++idx) {\\n std::cout << primes[combo[idx]];\\n if (idx < m - 1) {\\n std::cout << '+';\\n } else {\\n std::cout << '\\\\n';\\n }\\n }\\n return true;\\n }\\n } else {\\n for (int j = 0; j < n; j++) {\\n if (k == 0 || j > combo[k - 1]) {\\n combo[k] = j;\\n bool foundCombo = findCombo(k + 1, x, m, n, combo);\\n if (foundCombo) {\\n return true;\\n }\\n }\\n }\\n }\\n\\n return false;\\n}\\n\\nvoid partition(int x, int m) {\\n if (x < 2 || m < 1 || m >= x) {\\n throw std::runtime_error(\\\"Invalid parameters\\\");\\n }\\n\\n std::vector<int> filteredPrimes;\\n std::copy_if(\\n primes.cbegin(), primes.cend(),\\n std::back_inserter(filteredPrimes),\\n [x](int a) { return a <= x; }\\n );\\n\\n int n = filteredPrimes.size();\\n if (n < m) {\\n throw std::runtime_error(\\\"Not enough primes\\\");\\n }\\n\\n std::vector<int> combo;\\n combo.resize(m);\\n if (!findCombo(0, x, m, n, combo)) {\\n auto word = (m > 1) ? \\\"primes\\\" : \\\"prime\\\";\\n printf(\\\"Partitioned %5d with %2d %s: (not possible)\\\\n\\\", x, m, word);\\n }\\n}\\n\\nint main() {\\n init();\\n\\n std::vector<std::pair<int, int>> a{\\n {99809, 1},\\n { 18, 2},\\n { 19, 3},\\n { 20, 4},\\n { 2017, 24},\\n {22699, 1},\\n {22699, 2},\\n {22699, 3},\\n {22699, 4},\\n {40355, 3}\\n };\\n\\n for (auto& p : a) {\\n partition(p.first, p.second);\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections;\\nusing System.Collections.Generic;\\nusing static System.Linq.Enumerable;\\n\\npublic static class Rosetta\\n{\\n static void Main()\\n {\\n foreach ((int x, int n) in new [] {\\n (99809, 1),\\n (18, 2),\\n (19, 3),\\n (20, 4),\\n (2017, 24),\\n (22699, 1),\\n (22699, 2),\\n (22699, 3),\\n (22699, 4),\\n (40355, 3)\\n }) {\\n Console.WriteLine(Partition(x, n));\\n }\\n }\\n\\n public static string Partition(int x, int n) {\\n if (x < 1 || n < 1) throw new ArgumentOutOfRangeException(\\\"Parameters must be positive.\\\");\\n string header = $\\\"{x} with {n} {(n == 1 ? \\\"prime\\\" : \\\"primes\\\")}: \\\";\\n int[] primes = SievePrimes(x).ToArray();\\n if (primes.Length < n) return header + \\\"not enough primes\\\";\\n int[] solution = CombinationsOf(n, primes).FirstOrDefault(c => c.Sum() == x);\\n return header + (solution == null ? \\\"not possible\\\" : string.Join(\\\"+\\\", solution);\\n }\\n\\n static IEnumerable<int> SievePrimes(int bound) {\\n if (bound < 2) yield break;\\n yield return 2;\\n\\n BitArray composite = new BitArray((bound - 1) / 2);\\n int limit = ((int)(Math.Sqrt(bound)) - 1) / 2;\\n for (int i = 0; i < limit; i++) {\\n if (composite[i]) continue;\\n int prime = 2 * i + 3;\\n yield return prime;\\n for (int j = (prime * prime - 2) / 2; j < composite.Count; j += prime) composite[j] = true;\\n }\\n for (int i = limit; i < composite.Count; i++) {\\n if (!composite[i]) yield return 2 * i + 3;\\n }\\n }\\n\\n static IEnumerable<int[]> CombinationsOf(int count, int[] input) {\\n T[] result = new T[count];\\n foreach (int[] indices in Combinations(input.Length, count)) {\\n for (int i = 0; i < count; i++) result[i] = input[indices[i]];\\n yield return result;\\n }\\n }\\n\\n static IEnumerable<int[]> Combinations(int n, int k) {\\n var result = new int[k];\\n var stack = new Stack<int>();\\n stack.Push(0);\\n while (stack.Count > 0) {\\n int index = stack.Count - 1;\\n int value = stack.Pop();\\n while (value < n) {\\n result[index++] = value++;\\n stack.Push(value);\\n if (index == k) {\\n yield return result;\\n break;\\n }\\n }\\n }\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"isqrt = proc (s: int) returns (int)\\n x0: int := s/2\\n if x0 = 0 then return(s) end\\n x1: int := (x0 + s/x0) / 2\\n while x1 < x0 do\\n x0, x1 := x1, (x0 + s/x0) / 2\\n end\\n return(x0)\\nend isqrt\\n\\nprimes = proc (n: int) returns (sequence[int])\\n prime: array[bool] := array[bool]$fill(1, n, true)\\n prime[1] := false\\n for p: int in int$from_to(2, isqrt(n)) do\\n for c: int in int$from_to_by(p*p, n, p) do\\n prime[c] := false\\n end\\n end\\n\\n pr: array[int] := array[int]$predict(1, n)\\n for p: int in array[bool]$indexes(prime) do\\n if prime[p] then array[int]$addh(pr, p) end\\n end\\n\\n return(sequence[int]$a2s(pr))\\nend primes\\n\\npartition_sum = proc (x, n: int, nums: sequence[int])\\n returns (sequence[int])\\n signals (impossible)\\n if n<=0 cor sequence[int]$empty(nums) then signal impossible end\\n\\n if n=1 then\\n for k: int in sequence[int]$elements(nums) do\\n if x=k then return(sequence[int]$[x]) end\\n end\\n signal impossible\\n end\\n\\n k: int := sequence[int]$bottom(nums)\\n rest: sequence[int] := sequence[int]$reml(nums)\\n\\n return(sequence[int]$addl(partition_sum(x-k, n-1, rest), k))\\n except when impossible:\\n return(partition_sum(x, n, rest))\\n resignal impossible\\n end\\nend partition_sum\\n\\nprime_partition = proc (x, n: int)\\n returns (sequence[int])\\n signals (impossible)\\n return(partition_sum(x, n, primes(x))) resignal impossible\\nend prime_partition\\n\\nformat_sum = proc (nums: sequence[int]) returns (string)\\n result: string := \\\"\\\"\\n for n: int in sequence[int]$elements(nums) do\\n result := result || \\\"+\\\" || int$unparse(n)\\n end\\n return(string$rest(result, 2))\\nend format_sum\\n\\nstart_up = proc ()\\n test = struct[x: int, n: int]\\n tests: sequence[test] := sequence[test]$[\\n test${x:99809,n:1}, test${x:18,n:2}, test${x:19,n:3}, test${x:20,n:4},\\n test${x:2017,n:24}, test${x:22699,n:1}, test${x:22699,n:2},\\n test${x:22699,n:3}, test${x:22699,n:4}, test${x:40355,n:3}\\n ]\\n\\n po: stream := stream$primary_output()\\n for t: test in sequence[test]$elements(tests) do\\n stream$puts(po, \\\"Partitioned \\\" || int$unparse(t.x) || \\\" with \\\"\\n || int$unparse(t.n) || \\\" primes: \\\")\\n stream$putl(po, format_sum(prime_partition(t.x, t.n)))\\n except when impossible:\\n stream$putl(po, \\\"not possible.\\\")\\n end\\n end\\nend start_up\\n\",\n \"language\": \"CLU\"\n },\n {\n \"code\": \"include \\\"cowgol.coh\\\";\\n\\nconst MAXPRIM := 100000;\\nconst MAXPRIM_B := (MAXPRIM >> 3) + 1;\\n\\nvar primebits: uint8[MAXPRIM_B];\\ntypedef ENTRY_T is @indexof primebits;\\n\\nsub pentry(n: uint32): (ent: ENTRY_T, bit: uint8) is\\n ent := (n >> 3) as ENTRY_T;\\n bit := (n & 7) as uint8;\\nend sub;\\n\\nsub setprime(n: uint32, prime: uint8) is\\n var ent: ENTRY_T;\\n var bit: uint8;\\n (ent, bit) := pentry(n);\\n var one: uint8 := 1;\\n primebits[ent] := primebits[ent] & ~(one << bit);\\n primebits[ent] := primebits[ent] | (prime << bit);\\nend sub;\\n\\nsub prime(n: uint32): (prime: uint8) is\\n var ent: ENTRY_T;\\n var bit: uint8;\\n (ent, bit) := pentry(n);\\n prime := (primebits[ent] >> bit) & 1;\\nend sub;\\n\\nsub sieve() is\\n MemSet(&primebits[0], 0xFF, @bytesof primebits);\\n setprime(0, 0);\\n setprime(1, 0);\\n var p: uint32 := 2;\\n while p*p <= MAXPRIM loop\\n var c := p*p;\\n while c <= MAXPRIM loop\\n setprime(c, 0);\\n c := c + p;\\n end loop;\\n p := p + 1;\\n end loop;\\nend sub;\\n\\nsub nextprime(p: uint32): (r: uint32) is\\n r := p;\\n loop\\n r := r + 1;\\n if prime(r) != 0 then break; end if;\\n end loop;\\nend sub;\\n\\nsub partition(x: uint32, n: uint8, part: [uint32]): (r: uint8) is\\n record State is\\n x: uint32;\\n n: uint8;\\n p: uint32;\\n part: [uint32];\\n end record;\\n\\n var stack: State[128];\\n var sp: @indexof stack := 0;\\n\\n sub Push(x: uint32, n: uint8, p: uint32, part: [uint32]) is\\n stack[sp].x := x;\\n stack[sp].n := n;\\n stack[sp].p := p;\\n stack[sp].part := part;\\n sp := sp + 1;\\n end sub;\\n\\n sub Pull(): (x: uint32, n: uint8, p: uint32, part: [uint32]) is\\n sp := sp - 1;\\n x := stack[sp].x;\\n n := stack[sp].n;\\n p := stack[sp].p;\\n part := stack[sp].part;\\n end sub;\\n\\n r := 0;\\n Push(x, n, 1, part);\\n while sp > 0 loop\\n var p: uint32;\\n (x, n, p, part) := Pull();\\n p := nextprime(p);\\n\\n if x < p then\\n continue;\\n end if;\\n\\n if n == 1 then\\n if prime(x) != 0 then\\n r := 1;\\n [part] := x;\\n return;\\n end if;\\n else\\n [part] := p;\\n Push(x, n, p, part);\\n Push(x-p, n-1, p, @next part);\\n end if;\\n end loop;\\n r := 0;\\nend sub;\\n\\nsub showpartition(x: uint32, n: uint8) is\\n print(\\\"Partitioning \\\");\\n print_i32(x);\\n print(\\\" with \\\");\\n print_i8(n);\\n print(\\\" primes: \\\");\\n\\n var part: uint32[64];\\n if partition(x, n, &part[0]) != 0 then\\n print_i32(part[0]);\\n var i: @indexof part := 1;\\n while i < n as @indexof part loop\\n print_char('+');\\n print_i32(part[i]);\\n i := i + 1;\\n end loop;\\n else\\n print(\\\"Not possible\\\");\\n end if;\\n print_nl();\\nend sub;\\n\\nsieve();\\n\\nrecord Test is\\n x: uint32;\\n n: uint8;\\nend record;\\n\\nvar tests: Test[] := {\\n {99809, 1}, {18, 2}, {19, 3}, {20, 4}, {2017, 24},\\n {22699, 1}, {22699, 2}, {22699, 3}, {22699, 4}, {40355, 3}\\n};\\n\\nvar test: @indexof tests := 0;\\nwhile test < @sizeof tests loop\\n showpartition(tests[test].x, tests[test].n);\\n test := test + 1;\\nend loop;\\n\",\n \"language\": \"Cowgol\"\n },\n {\n \"code\": \"import std.array : array;\\nimport std.range : take;\\nimport std.stdio;\\n\\nbool isPrime(int n) {\\n if (n < 2) return false;\\n if (n % 2 == 0) return n == 2;\\n if (n % 3 == 0) return n == 3;\\n\\n int d = 5;\\n while (d*d <= n) {\\n if (n % d == 0) return false;\\n d += 2;\\n if (n % d == 0) return false;\\n d += 4;\\n }\\n return true;\\n}\\n\\nauto generatePrimes() {\\n struct Seq {\\n int p = 2;\\n\\n bool empty() {\\n return p < 0;\\n }\\n\\n int front() {\\n return p;\\n }\\n\\n void popFront() {\\n if (p==2) {\\n p++;\\n } else {\\n p += 2;\\n while (!empty && !p.isPrime) {\\n p += 2;\\n }\\n }\\n }\\n }\\n\\n return Seq();\\n}\\n\\nbool findCombo(int k, int x, int m, int n, int[] combo) {\\n import std.algorithm : map, sum;\\n auto getPrime = function int(int idx) => primes[idx];\\n\\n if (k >= m) {\\n if (combo.map!getPrime.sum == x) {\\n auto word = (m > 1) ? \\\"primes\\\" : \\\"prime\\\";\\n writef(\\\"Partitioned %5d with %2d %s \\\", x, m, word);\\n foreach (i; 0..m) {\\n write(primes[combo[i]]);\\n if (i < m-1) {\\n write('+');\\n } else {\\n writeln();\\n }\\n }\\n return true;\\n }\\n } else {\\n foreach (j; 0..n) {\\n if (k==0 || j>combo[k-1]) {\\n combo[k] = j;\\n bool foundCombo = findCombo(k+1, x, m, n, combo);\\n if (foundCombo) {\\n return true;\\n }\\n }\\n }\\n }\\n return false;\\n}\\n\\nvoid partition(int x, int m) {\\n import std.exception : enforce;\\n import std.algorithm : filter;\\n enforce(x>=2 && m>=1 && m<x);\\n\\n auto lessThan = delegate int(int a) => a<=x;\\n auto filteredPrimes = primes.filter!lessThan.array;\\n auto n = filteredPrimes.length;\\n enforce(n>=m, \\\"Not enough primes\\\");\\n\\n int[] combo = new int[m];\\n if (!findCombo(0, x, m, n, combo)) {\\n auto word = (m > 1) ? \\\"primes\\\" : \\\"prime\\\";\\n writefln(\\\"Partitioned %5d with %2d %s: (not possible)\\\", x, m, word);\\n }\\n}\\n\\nint[] primes;\\nvoid main() {\\n // generate first 50,000 and call it good\\n primes = generatePrimes().take(50_000).array;\\n\\n auto a = [\\n [99809, 1],\\n [ 18, 2],\\n [ 19, 3],\\n [ 20, 4],\\n [ 2017, 24],\\n [22699, 1],\\n [22699, 2],\\n [22699, 3],\\n [22699, 4],\\n [40355, 3]\\n ];\\n\\n foreach(p; a) {\\n partition(p[0], p[1]);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"// Partition an integer as the sum of n primes. Nigel Galloway: November 27th., 2017\\nlet rcTask n ng =\\n let rec fN i g e l = seq{\\n match i with\\n |1 -> if isPrime g then yield Some (g::e) else yield None\\n |_ -> yield! Seq.mapi (fun n a->fN (i-1) (g-a) (a::e) (Seq.skip (n+1) l)) (l|>Seq.takeWhile(fun n->(g-n)>n))|>Seq.concat}\\n match fN n ng [] primes |> Seq.tryPick id with\\n |Some n->printfn \\\"%d is the sum of %A\\\" ng n\\n |_ ->printfn \\\"No Solution\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: formatting fry grouping kernel math.combinatorics\\nmath.parser math.primes sequences ;\\n\\n: partition ( x n -- str )\\n over [ primes-upto ] 2dip '[ sum _ = ] find-combination\\n [ number>string ] map \\\"+\\\" join ;\\n\\n: print-partition ( x n seq -- )\\n [ \\\"no solution\\\" ] when-empty\\n \\\"Partitioned %5d with %2d primes: %s\\\\n\\\" printf ;\\n\\n{ 99809 1 18 2 19 3 20 4 2017 24 22699 1 22699 2 22699 3 22699\\n 4 40355 3 } 2 group\\n[ first2 2dup partition print-partition ] each\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \" module primes_module\\n implicit none\\n integer,allocatable :: p(:)\\n integer :: a(0:32), b(0:32)\\n integer,private :: sum_primes, number\\n contains\\n!\\n subroutine setnum(val)\\n implicit none\\n integer :: val\\n number = val\\n return\\n end subroutine setnum\\n!\\n subroutine init(thesize)\\n implicit none\\n integer :: thesize\\n !\\n allocate(p(thesize))\\n p=0\\n a=0\\n b=0\\n return\\n end subroutine init\\n!\\n subroutine genp(high) ! Store all primes up to high in the array p\\n integer, intent(in) :: high\\n integer :: i, numprimes, j,k\\n logical*1 :: bk(0:high)\\n !\\n bk = .false.\\n p = 0\\n a = 0\\n b = 0\\n call eratosthenes(bk , high)\\n j = 0\\n numprimes = count(bk)\\n k = 0\\n do i = 1,high\\n if(bk(i))then\\n j = j+1\\n p(j) = i\\n if(j==numprimes)exit !No need to loop more, all primes stored\\n endif\\n end do\\n print*,'numprimes',numprimes, i,p(j)\\n return\\n end subroutine genp\\n\\n subroutine getp(z) ! used to update the zth prime number in the sequence of primes that are being used to partition the integer number.\\n integer :: z\\n integer :: w\\n!\\n if (a(z) == 0)a(z) = a(z-1)\\n a(z) = a(z) + 1\\n b(z) = p(a(z))\\n return\\n end subroutine getp\\n\\n subroutine part(num_found)\\n integer, intent(in) :: num_found\\n integer :: i, s, k, r\\n logical :: bu\\n a = 0\\n do i = 1, num_found\\n call getp(i)\\n end do\\n infinite: do\\n sum_primes = 0\\n bu = .false.\\n nextin:do s = 1, num_found\\n sum_primes = sum_primes + b(s) !Adds the sth prime to sum_primes.\\n if (sum_primes > number) then !If the sum of primes exceeds number:\\n if (s == 1)then\\n exit infinite !If only one prime has been added, exit the infinite loop.\\n endif\\n a(s:num_found) = 0 ! Resets the indices of the primes from s to num_found\\n do r = s - 1, num_found ! Gets the next set of primes from s-1 to num_found\\n call getp(r)\\n end do\\n bu = .true. ! Sets bu to true and exits the loop over the primes\\n exit nextin\\n end if\\n end do nextin\\n if (.not. bu) then ! If bu is false (meaning the sum of primes does not exceed number)\\n if (sum_primes == number) exit infinite !We got it so go\\n if (sum_primes < number) then\\n call getp(num_found) ! If the sum of primes is less than number, gets the next prime\\n else\\n error stop \\\" Something wrong here!\\\"\\n endif\\n endif\\n end do infinite\\n write( *,'(/,a,1x,i0,1x,a,1x,i0,1x,a)',advance='yes') \\\"Partition\\\", number, \\\"into\\\", num_found,trim(adjustl(list(num_found)))\\n end subroutine part\\n!\\n function list(num_found)\\n integer, intent(in) :: num_found\\n integer :: i\\n character(len=128) :: list\\n character(len = 10):: pooka\\n!\\n write(list,'(i0)') b(1)\\n if (sum_primes == number) then\\n do i = 2, num_found\\n pooka = ''\\n write(pooka,'(i0)') b(i)\\n list = trim(list) // \\\" + \\\" // adjustl(pooka)\\n end do\\n else\\n list = \\\"(not possible)\\\"\\n end if\\n list = \\\"primes: \\\" // list\\n end function list\\n !\\n subroutine eratosthenes(p , n)\\n implicit none\\n!\\n! dummy arguments\\n!\\n integer :: n\\n logical*1 , dimension(0:*) :: p\\n intent (in) n\\n intent (inout) p\\n!\\n! local variables\\n!\\n integer :: i\\n integer :: ii\\n logical :: oddeven\\n integer :: pr\\n!\\n p(0:n) = .false.\\n p(1) = .false.\\n p(2) = .true.\\n oddeven = .true.\\n do i = 3 , n,2\\n p(i) = .true.\\n end do\\n do i = 2 , int(sqrt(float(n)))\\n ii = i + i\\n if( p(i) )then\\n do pr = i*i , n , ii\\n p(pr) = .false.\\n end do\\n end if\\n end do\\n return\\n end subroutine eratosthenes\\n\\nend module primes_module\\n\\nprogram prime_partition\\n use primes_module\\n implicit none\\n integer :: x, n,i\\n integer :: xx,yy\\n integer :: values(10,2)\\n! The given dataset from Rosetta Code\\n ! partition 99809 with 1 prime.\\n ! partition 18 with 2 primes.\\n ! partition 19 with 3 primes.\\n ! partition 20 with 4 primes.\\n ! partition 2017 with 24 primes.\\n ! partition 22699 with 1, 2, 3, and 4 primes.\\n ! partition 40355 with 3 primes.\\n values(1,:) = (/99809,1/)\\n values(2,:) = (/18,2/)\\n values(3,:) = (/19,3/)\\n values(4,:) = (/20,4/)\\n values(5,:) = (/2017,24/)\\n values(6,:) = (/22699, 1/)\\n values(7,:) = (/22699, 2/)\\n values(8,:) = (/22699, 3/)\\n values(9,:) = (/22699, 4/)\\n values(10,:) = (/40355, 3/)\\n i = maxval(values(1:10,1))*2\\n call init(i)\\t! Set up a few basics\\n call genp(i)\\t! Generate primes up to i\\n do i = 1,10\\n call setnum( values(i,1))\\n call part(values(i,2))\\n end do\\n Stop 'Successfully completed'\\nend program prime_partition\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n)\\n\\nvar (\\n primes = sieve(100000)\\n foundCombo = false\\n)\\n\\nfunc sieve(limit uint) []uint {\\n primes := []uint{2}\\n c := make([]bool, limit+1) // composite = true\\n // no need to process even numbers > 2\\n p := uint(3)\\n for {\\n p2 := p * p\\n if p2 > limit {\\n break\\n }\\n for i := p2; i <= limit; i += 2 * p {\\n c[i] = true\\n }\\n for {\\n p += 2\\n if !c[p] {\\n break\\n }\\n }\\n }\\n for i := uint(3); i <= limit; i += 2 {\\n if !c[i] {\\n primes = append(primes, i)\\n }\\n }\\n return primes\\n}\\n\\nfunc findCombo(k, x, m, n uint, combo []uint) {\\n if k >= m {\\n sum := uint(0)\\n for _, c := range combo {\\n sum += primes[c]\\n }\\n if sum == x {\\n s := \\\"s\\\"\\n if m == 1 {\\n s = \\\" \\\"\\n }\\n fmt.Printf(\\\"Partitioned %5d with %2d prime%s: \\\", x, m, s)\\n for i := uint(0); i < m; i++ {\\n fmt.Print(primes[combo[i]])\\n if i < m-1 {\\n fmt.Print(\\\"+\\\")\\n } else {\\n fmt.Println()\\n }\\n }\\n foundCombo = true\\n }\\n } else {\\n for j := uint(0); j < n; j++ {\\n if k == 0 || j > combo[k-1] {\\n combo[k] = j\\n if !foundCombo {\\n findCombo(k+1, x, m, n, combo)\\n }\\n }\\n }\\n }\\n}\\n\\nfunc partition(x, m uint) error {\\n if !(x >= 2 && m >= 1 && m < x) {\\n return fmt.Errorf(\\\"x must be at least 2 and m in [1, x)\\\")\\n }\\n n := uint(0)\\n for _, prime := range primes {\\n if prime <= x {\\n n++\\n }\\n }\\n if n < m {\\n return fmt.Errorf(\\\"not enough primes\\\")\\n }\\n combo := make([]uint, m)\\n foundCombo = false\\n findCombo(0, x, m, n, combo)\\n if !foundCombo {\\n s := \\\"s\\\"\\n if m == 1 {\\n s = \\\" \\\"\\n }\\n fmt.Printf(\\\"Partitioned %5d with %2d prime%s: (impossible)\\\\n\\\", x, m, s)\\n }\\n return nil\\n}\\n\\nfunc main() {\\n a := [...][2]uint{\\n {99809, 1}, {18, 2}, {19, 3}, {20, 4}, {2017, 24},\\n {22699, 1}, {22699, 2}, {22699, 3}, {22699, 4}, {40355, 3},\\n }\\n for _, p := range a {\\n err := partition(p[0], p[1])\\n if err != nil {\\n log.Println(err)\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.List (delete, intercalate)\\nimport Data.Numbers.Primes (primes)\\nimport Data.Bool (bool)\\n\\n-------------------- PRIME PARTITIONS ---------------------\\npartitions :: Int -> Int -> [Int]\\npartitions x n\\n | n <= 1 =\\n [ x\\n | x == last ps ]\\n | otherwise = go ps x n\\n where\\n ps = takeWhile (<= x) primes\\n go ps_ x 1 =\\n [ x\\n | x `elem` ps_ ]\\n go ps_ x n = ((flip bool [] . head) <*> null) (ps_ >>= found)\\n where\\n found p =\\n ((flip bool [] . return . (p :)) <*> null)\\n ((go =<< delete p . flip takeWhile ps_ . (>=)) (x - p) (pred n))\\n\\n-------------------------- TEST ---------------------------\\nmain :: IO ()\\nmain =\\n mapM_ putStrLn $\\n (\\\\(x, n) ->\\n intercalate\\n \\\" -> \\\"\\n [ justifyLeft 9 ' ' (show (x, n))\\n , let xs = partitions x n\\n in bool\\n (tail $ concatMap (('+' :) . show) xs)\\n \\\"(no solution)\\\"\\n (null xs)\\n ]) <$>\\n concat\\n [ [(99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24)]\\n , (,) 22699 <$> [1 .. 4]\\n , [(40355, 3)]\\n ]\\n\\n------------------------- GENERIC -------------------------\\njustifyLeft :: Int -> Char -> String -> String\\njustifyLeft n c s = take n (s ++ replicate n c)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"load 'format/printf'\\n\\nNB. I don't know of any way to easily make an idiomatic lazy exploration,\\nNB. except falling back on explicit imperative control strutures.\\nNB. However this is clearly not where J shines neither with speed nor elegance.\\n\\nprimes_up_to =: monad def 'p: i. _1 p: 1 + y'\\nterms_as_text =: monad def '; }: , (\\\": each y),.<'' + '''\\n\\nsearch_next_terms =: dyad define\\n acc=. x NB. -> an accumulator that contains given beginning of the partition.\\n p=. >0{y NB. -> number of elements wanted in the partition\\n ns=. >1{y NB. -> candidate values to be included in the partition\\n sum=. >2{y NB. -> the integer to partition\\n\\n if. p=0 do.\\n if. sum=+/acc do. acc return. end.\\n else.\\n for_m. i. (#ns)-(p-1) do.\\n r =. (acc,m{ns) search_next_terms (p-1);((m+1)}.ns);sum\\n if. #r do. r return. end.\\n end.\\n end.\\n\\n 0$0 NB. Empty result if nothing found at the end of this path.\\n)\\n\\n\\nNB. Prints a partition of y primes whose sum equals x.\\npartitioned_in =: dyad define\\n terms =. (0$0) search_next_terms y;(primes_up_to x);x\\n if. #terms do.\\n 'As the sum of %d primes, %d = %s' printf y;x; terms_as_text terms\\n else.\\n 'Didn''t find a way to express %d as a sum of %d different primes.' printf x;y\\n end.\\n)\\n\\n\\ntests=: (99809 1) ; (18 2) ; (19 3) ; (20 4) ; (2017 24) ; (22699 1) ; (22699 2) ; (22699 3) ; (22699 4)\\n(0&{ partitioned_in 1&{) each tests\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.stream.IntStream;\\n\\npublic class PartitionInteger {\\n private static final int[] primes = IntStream.concat(IntStream.of(2), IntStream.iterate(3, n -> n + 2))\\n .filter(PartitionInteger::isPrime)\\n .limit(50_000)\\n .toArray();\\n\\n private static boolean isPrime(int n) {\\n if (n < 2) return false;\\n if (n % 2 == 0) return n == 2;\\n if (n % 3 == 0) return n == 3;\\n int d = 5;\\n while (d * d <= n) {\\n if (n % d == 0) return false;\\n d += 2;\\n if (n % d == 0) return false;\\n d += 4;\\n }\\n return true;\\n }\\n\\n private static boolean findCombo(int k, int x, int m, int n, int[] combo) {\\n boolean foundCombo = false;\\n if (k >= m) {\\n if (Arrays.stream(combo).map(i -> primes[i]).sum() == x) {\\n String s = m > 1 ? \\\"s\\\" : \\\"\\\";\\n System.out.printf(\\\"Partitioned %5d with %2d prime%s: \\\", x, m, s);\\n for (int i = 0; i < m; ++i) {\\n System.out.print(primes[combo[i]]);\\n if (i < m - 1) System.out.print('+');\\n else System.out.println();\\n }\\n foundCombo = true;\\n }\\n } else {\\n for (int j = 0; j < n; ++j) {\\n if (k == 0 || j > combo[k - 1]) {\\n combo[k] = j;\\n if (!foundCombo) {\\n foundCombo = findCombo(k + 1, x, m, n, combo);\\n }\\n }\\n }\\n }\\n return foundCombo;\\n }\\n\\n private static void partition(int x, int m) {\\n if (x < 2 || m < 1 || m >= x) {\\n throw new IllegalArgumentException();\\n }\\n int[] filteredPrimes = Arrays.stream(primes).filter(it -> it <= x).toArray();\\n int n = filteredPrimes.length;\\n if (n < m) throw new IllegalArgumentException(\\\"Not enough primes\\\");\\n int[] combo = new int[m];\\n boolean foundCombo = findCombo(0, x, m, n, combo);\\n if (!foundCombo) {\\n String s = m > 1 ? \\\"s\\\" : \\\" \\\";\\n System.out.printf(\\\"Partitioned %5d with %2d prime%s: (not possible)\\\\n\\\", x, m, s);\\n }\\n }\\n\\n public static void main(String[] args) {\\n partition(99809, 1);\\n partition(18, 2);\\n partition(19, 3);\\n partition(20, 4);\\n partition(2017, 24);\\n partition(22699, 1);\\n partition(22699, 2);\\n partition(22699, 3);\\n partition(22699, 4);\\n partition(40355, 3);\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Is the input integer a prime?\\ndef is_prime:\\n if . == 2 then true\\n else 2 < . and . % 2 == 1 and\\n . as $in\\n | (($in + 1) | sqrt) as $m\\n | (((($m - 1) / 2) | floor) + 1) as $max\\n | all( range(1; $max) ; $in % ((2 * .) + 1) > 0 )\\n end;\\n\\n# Is the input integer a prime?\\n# `previous` should be a sorted array of consecutive primes\\n# greater than 1 and at least including the greatest prime less than (.|sqrt)\\ndef is_prime(previous):\\n . as $in\\n | (($in + 1) | sqrt) as $sqrt\\n | first(previous[]\\n | if . > $sqrt then 1\\n elif 0 == ($in % .) then 0\\n else empty\\n end) // 1\\n | . == 1;\\n\\n# This assumes . is an array of consecutive primes beginning with [2,3]\\ndef next_prime:\\n . as $previous\\n | (2 + .[-1] )\\n | until(is_prime($previous); . + 2) ;\\n\\n# Emit primes from 2 up\\ndef primes:\\n # The helper function has arity 0 for TCO\\n # It expects its input to be an array of previously found primes, in order:\\n def next:\\n . as $previous\\n | ($previous|next_prime) as $next\\n | $next, (($previous + [$next]) | next) ;\\n 2, 3, ([2,3] | next);\\n\\n# The primes less than or equal to $x\\ndef primes($x):\\n label $out\\n | primes | if . > $x then break $out else . end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Emit a stream consisting of arrays, a, of $n items from the input array,\\n# preserving order, subject to (a|add) == $sum\\ndef take($n; $sum):\\n def take:\\n . as [$m, $in, $s]\\n | if $m==0 and $s == 0 then []\\n elif $m==0 or $s <= 0 then empty\\n else range(0;$in|length) as $i\\n | $in[$i] as $x\\n | if $x > $s then empty\\n else [$x] + ([$m-1, $in[$i+1:], $s - $x] | take)\\n end\\n end;\\n [$n, ., $sum] | take;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# This function emits a possibly empty stream of arrays.\\n# Assuming $primes is primes(.), each array corresponds to a\\n# partition of the input into $n distinct primes.\\n# The algorithm is unoptimized.\\n# The output is a stream of arrays, which would be empty\\ndef primepartition($n; $primes):\\n . as $x\\n | if $n == 1\\n then if $primes[-1] == $x then [$x] else null end\\n else (if $primes[-1] == $x then $primes[:-1] else $primes end) as $primes\\n | ($primes | take($n; $x))\\n end ;\\n\\n# See primepartition/2\\ndef primepartition($n):\\n . as $x\\n | if $n == 1\\n then if is_prime then [.] else null end\\n else primepartition($n; [primes($x)])\\n end;\\n\\n# Compute first(primepartition($n)) for each $n in the array $ary\\ndef primepartitions($ary):\\n . as $x\\n | [primes($x)] as $px\\n | $ary[] as $n\\n | $x\\n | first(primepartition($n; $px));\\n\\ndef task($x; $n):\\n def pp:\\n if . then join(\\\"+\\\") else \\\"(not possible)\\\" end;\\n\\n if $n|type == \\\"array\\\" then task($x; $n[])\\n else \\\"A partition of \\\\($x) into \\\\($n) parts: \\\\(first($x | primepartition($n)) | pp )\\\"\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"task(18; 2),\\ntask(19; 3),\\ntask(20; 4),\\ntask(2017; 24),\\ntask(22699; [1,2,3,4]),\\ntask(40355; 3)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Primes, Combinatorics\\n\\nfunction primepartition(x::Int64, n::Int64)\\n if n == oftype(n, 1)\\n return isprime(x) ? [x] : Int64[]\\n else\\n for combo in combinations(primes(x), n)\\n if sum(combo) == x\\n return combo\\n end\\n end\\n end\\n return Int64[]\\nend\\n\\nfor (x, n) in [[ 18, 2], [ 19, 3], [ 20, 4], [99807, 1], [99809, 1],\\n [ 2017, 24],[22699, 1], [22699, 2], [22699, 3], [22699, 4] ,[40355, 3]]\\n ans = primepartition(x, n)\\n println(\\\"Partition of \\\", x, \\\" into \\\", n, \\\" primes: \\\",\\n isempty(ans) ? \\\"impossible\\\" : join(ans, \\\" + \\\"))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\n// compiled with flag -Xcoroutines=enable to suppress 'experimental' warning\\n\\nimport kotlin.coroutines.experimental.*\\n\\nval primes = generatePrimes().take(50_000).toList() // generate first 50,000 say\\nvar foundCombo = false\\n\\nfun isPrime(n: Int) : Boolean {\\n if (n < 2) return false\\n if (n % 2 == 0) return n == 2\\n if (n % 3 == 0) return n == 3\\n var d : Int = 5\\n while (d * d <= n) {\\n if (n % d == 0) return false\\n d += 2\\n if (n % d == 0) return false\\n d += 4\\n }\\n return true\\n}\\n\\nfun generatePrimes() =\\n buildSequence {\\n yield(2)\\n var p = 3\\n while (p <= Int.MAX_VALUE) {\\n if (isPrime(p)) yield(p)\\n p += 2\\n }\\n }\\n\\nfun findCombo(k: Int, x: Int, m: Int, n: Int, combo: IntArray) {\\n if (k >= m) {\\n if (combo.sumBy { primes[it] } == x) {\\n val s = if (m > 1) \\\"s\\\" else \\\" \\\"\\n print(\\\"Partitioned ${\\\"%5d\\\".format(x)} with ${\\\"%2d\\\".format(m)} prime$s: \\\")\\n for (i in 0 until m) {\\n print(primes[combo[i]])\\n if (i < m - 1) print(\\\"+\\\") else println()\\n }\\n foundCombo = true\\n }\\n }\\n else {\\n for (j in 0 until n) {\\n if (k == 0 || j > combo[k - 1]) {\\n combo[k] = j\\n if (!foundCombo) findCombo(k + 1, x, m, n, combo)\\n }\\n }\\n }\\n}\\n\\nfun partition(x: Int, m: Int) {\\n require(x >= 2 && m >= 1 && m < x)\\n val filteredPrimes = primes.filter { it <= x }\\n val n = filteredPrimes.size\\n if (n < m) throw IllegalArgumentException(\\\"Not enough primes\\\")\\n val combo = IntArray(m)\\n foundCombo = false\\n findCombo(0, x, m, n, combo)\\n if (!foundCombo) {\\n val s = if (m > 1) \\\"s\\\" else \\\" \\\"\\n println(\\\"Partitioned ${\\\"%5d\\\".format(x)} with ${\\\"%2d\\\".format(m)} prime$s: (not possible)\\\")\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n val a = arrayOf(\\n 99809 to 1,\\n 18 to 2,\\n 19 to 3,\\n 20 to 4,\\n 2017 to 24,\\n 22699 to 1,\\n 22699 to 2,\\n 22699 to 3,\\n 22699 to 4,\\n 40355 to 3\\n )\\n for (p in a) partition(p.first, p.second)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"----------------------------------------\\n-- returns a sorted list of the <cnt> smallest unique primes that add up to <n>,\\n-- or FALSE if there is no such partition of primes for <n>\\n----------------------------------------\\non getPrimePartition (n, cnt, primes, ptr, res)\\n if voidP(primes) then\\n primes = _global.sieve.getPrimesInRange(2, n)\\n ptr = 1\\n res = []\\n end if\\n if cnt=1 then\\n if primes.getPos(n)>=ptr then\\n res.addAt(1, n)\\n if res.count=cnt+ptr-1 then\\n return res\\n end if\\n return TRUE\\n end if\\n else\\n repeat with i = ptr to primes.count\\n p = primes[i]\\n ok = getPrimePartition(n-p, cnt-1, primes, i+1, res)\\n if ok then\\n res.addAt(1, p)\\n if res.count=cnt+ptr-1 then\\n return res\\n end if\\n return TRUE\\n end if\\n end repeat\\n end if\\n return FALSE\\nend\\n\\n----------------------------------------\\n-- gets partition, prints formatted result\\n----------------------------------------\\non showPrimePartition (n, cnt)\\n res = getPrimePartition(n, cnt)\\n if res=FALSE then res = \\\"not prossible\\\"\\n else res = implode(\\\"+\\\", res)\\n put \\\"Partitioned \\\"&n&\\\" with \\\"&cnt&\\\" primes: \\\" & res\\nend\\n\\n----------------------------------------\\n-- implodes list into string\\n----------------------------------------\\non implode (delim, tList)\\n str = \\\"\\\"\\n repeat with i=1 to tList.count\\n put tList[i]&delim after str\\n end repeat\\n delete char (str.length+1-delim.length) to str.length of str\\n return str\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"-- main\\n_global.sieve = script(\\\"sieve\\\").new()\\n\\nshowPrimePartition(99809, 1)\\nshowPrimePartition(18, 2)\\nshowPrimePartition(19, 3)\\nshowPrimePartition(20, 4)\\nshowPrimePartition(2017, 24)\\nshowPrimePartition(22699, 1)\\nshowPrimePartition(22699, 2)\\nshowPrimePartition(22699, 3)\\nshowPrimePartition(22699, 4)\\nshowPrimePartition(40355, 3)\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"NextPrimeMemo[n_] := (NextPrimeMemo[n] = NextPrime[n]);(*This improves performance by 30% or so*)\\nPrimeList[count_] := Prime/@Range[count];(*Just a helper to create an initial list of primes of the desired length*)\\nAppendPrime[list_] := Append[list,NextPrimeMemo[Last@list]];(*Another helper that makes creating the next candidate less verbose*)\\n\\nNextCandidate[{list_, target_}] :=\\n With[\\n {len = Length@list, nextHead = NestWhile[Drop[#, -1] &, list, Total[#] > target &]},\\n Which[\\n {} == nextHead, {{}, target},\\n Total[nextHead] == target && Length@nextHead == len, {nextHead, target},\\n True, {NestWhile[AppendPrime, MapAt[NextPrimeMemo, nextHead, -1], Length[#] < Length[list] &], target}\\n ]\\n ];(*This is the meat of the matter. If it determines that the job is impossible, it returns a structure with an empty list of summands. If the input satisfies the success criteria, it just returns it (this will be our fixed point). Otherwise, it generates a subsequent candidate.*)\\n\\nFormatResult[{list_, number_}, targetCount_] :=\\n StringForm[\\n \\\"Partitioned `1` with `2` prime`4`: `3`\\\",\\n number,\\n targetCount,\\n If[0 == Length@list, \\\"no solutions found\\\", StringRiffle[list, \\\"+\\\"]],\\n If[1 == Length@list, \\\"\\\", \\\"s\\\"]]; (*Just a helper for pretty-printing the output*)\\n\\nPrimePartition[number_, count_] := FixedPoint[NextCandidate, {PrimeList[count], number}];(*This is where things kick off. NextCandidate will eventually return the failure format or a success, and either of those are fixed points of the function.*)\\n\\nTestCases =\\n {\\n {99809, 1},\\n {18, 2},\\n {19, 3},\\n {20, 4},\\n {2017, 24},\\n {22699, 1},\\n {22699, 2},\\n {22699, 3},\\n {22699, 4},\\n {40355, 3}\\n };\\n\\nTimedResults = ReleaseHold[Hold[AbsoluteTiming[FormatResult[PrimePartition @@ #, Last@#]]] & /@TestCases](*I thought it would be interesting to include the timings, which are in seconds*)\\n\\nTimedResults // TableForm\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import math, sugar\\n\\nconst N = 100_000\\n\\n# Fill a sieve of Erathostenes.\\nvar isPrime {.noInit.}: array[2..N, bool]\\nfor item in isPrime.mitems: item = true\\nfor n in 2..int(sqrt(N.toFloat)):\\n if isPrime[n]:\\n for k in countup(n * n, N, n):\\n isPrime[k] = false\\n\\n# Build list of primes.\\nlet primes = collect(newSeq):\\n for n in 2..N:\\n if isPrime[n]: n\\n\\n\\nproc partition(n, k: int; start = 0): seq[int] =\\n ## Partition \\\"n\\\" in \\\"k\\\" primes starting at position \\\"start\\\" in \\\"primes\\\".\\n ## Return the list of primes or an empty list if partitionning is impossible.\\n\\n if k == 1:\\n return if isPrime[n] and n >= primes[start]: @[n] else: @[]\\n\\n for i in start..primes.high:\\n let a = primes[i]\\n if n - a <= 1: break\\n result = partition(n - a, k - 1, i + 1)\\n if result.len != 0:\\n return a & result\\n\\n\\nwhen isMainModule:\\n\\n import strutils\\n\\n func plural(k: int): string =\\n if k <= 1: \\\"\\\" else: \\\"s\\\"\\n\\n for (n, k) in [(99809, 1), (18, 2), (19, 3), (20, 4),\\n (2017, 24), (22699, 1), (22699, 2),\\n (22699, 3), (22699, 4), (40355, 3)]:\\n let part = partition(n, k)\\n if part.len == 0:\\n echo n, \\\" cannot be partitionned into \\\", k, \\\" prime\\\", plural(k)\\n else:\\n echo n, \\\" = \\\", part.join(\\\" + \\\")\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"partDistinctPrimes(x,n,mn=2)=\\n{\\n if(n==1, return(if(isprime(x) && mn<=x, [x], 0)));\\n if((x-n)%2,\\n if(mn>2, return(0));\\n my(t=partDistinctPrimes(x-2,n-1,3));\\n return(if(t, concat(2,t), 0))\\n );\\n if(n==2,\\n forprime(p=mn,(x-1)\\\\2,\\n if(isprime(x-p), return([p,x-p]))\\n );\\n return(0)\\n );\\n if(n<1, return(if(n, 0, [])));\\n\\n \\\\\\\\ x is the sum of 3 or more odd primes\\n my(t);\\n forprime(p=mn,(x-1)\\\\n,\\n t=partDistinctPrimes(x-p,n-1,p+2);\\n if(t, return(concat(p,t)))\\n );\\n 0;\\n}\\ndisplayNicely(x,n)=\\n{\\n printf(\\\"Partitioned%6d with%3d prime\\\", x, n);\\n if(n!=1, print1(\\\"s\\\"));\\n my(t=partDistinctPrimes(x,n));\\n if(t===0, print(\\\": (not possible)\\\"); return);\\n if(#t, print1(\\\": \\\"t[1]));\\n for(i=2,#t, print1(\\\"+\\\"t[i]));\\n print();\\n}\\nV=[[99809,1], [18,2], [19,3], [20,4], [2017,24], [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]];\\nfor(i=1,#V, call(displayNicely, V[i]))\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"use ntheory \\\":all\\\";\\n\\nsub prime_partition {\\n my($num, $parts) = @_;\\n return is_prime($num) ? [$num] : undef if $parts == 1;\\n my @p = @{primes($num)};\\n my $r;\\n forcomb { lastfor, $r = [@p[@_]] if vecsum(@p[@_]) == $num; } @p, $parts;\\n $r;\\n}\\n\\nforeach my $test ([18,2], [19,3], [20,4], [99807,1], [99809,1], [2017,24], [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]) {\\n my $partar = prime_partition(@$test);\\n printf \\\"Partition %5d into %2d prime piece%s %s\\\\n\\\", $test->[0], $test->[1], ($test->[1] == 1) ? \\\": \\\" : \\\"s:\\\", defined($partar) ? join(\\\"+\\\",@$partar) : \\\"not possible\\\";\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (join(fmt))</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">partition</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)?{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">}:</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">idx</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">np</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">get_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">np</span><span style=\\\"color: #0000FF;\\\">>=</span><span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">partition</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">np</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">idx</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #004080;\\\">sequence</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">prepend</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">np</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">tests</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">99809</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">19</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2017</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">24</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">22699</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">22699</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">22699</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">22699</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">40355</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">tests</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">partition</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"not possible\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" + \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Partition %d into %d primes: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"prime_partition(N, 1, [N], Min):-\\n is_prime(N),\\n N > Min,\\n !.\\nprime_partition(N, K, [P|Rest], Min):-\\n K > 1,\\n is_prime(P),\\n P > Min,\\n P < N,\\n K1 is K - 1,\\n N1 is N - P,\\n prime_partition(N1, K1, Rest, P),\\n !.\\n\\nprime_partition(N, K, Primes):-\\n prime_partition(N, K, Primes, 1).\\n\\nprint_primes([Prime]):-\\n !,\\n writef('%w\\\\n', [Prime]).\\nprint_primes([Prime|Primes]):-\\n writef('%w + ', [Prime]),\\n print_primes(Primes).\\n\\nprint_prime_partition(N, K):-\\n prime_partition(N, K, Primes),\\n !,\\n writef('%w = ', [N]),\\n print_primes(Primes).\\nprint_prime_partition(N, K):-\\n writef('%w cannot be partitioned into %w primes.\\\\n', [N, K]).\\n\\nmain:-\\n find_prime_numbers(100000),\\n print_prime_partition(99809, 1),\\n print_prime_partition(18, 2),\\n print_prime_partition(19, 3),\\n print_prime_partition(20, 4),\\n print_prime_partition(2017, 24),\\n print_prime_partition(22699, 1),\\n print_prime_partition(22699, 2),\\n print_prime_partition(22699, 3),\\n print_prime_partition(22699, 4),\\n print_prime_partition(40355, 3).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \":- module(prime_numbers, [find_prime_numbers/1, is_prime/1]).\\n:- dynamic is_prime/1.\\n\\nfind_prime_numbers(N):-\\n retractall(is_prime(_)),\\n assertz(is_prime(2)),\\n init_sieve(N, 3),\\n sieve(N, 3).\\n\\ninit_sieve(N, P):-\\n P > N,\\n !.\\ninit_sieve(N, P):-\\n assertz(is_prime(P)),\\n Q is P + 2,\\n init_sieve(N, Q).\\n\\nsieve(N, P):-\\n P * P > N,\\n !.\\nsieve(N, P):-\\n is_prime(P),\\n !,\\n S is P * P,\\n cross_out(S, N, P),\\n Q is P + 2,\\n sieve(N, Q).\\nsieve(N, P):-\\n Q is P + 2,\\n sieve(N, Q).\\n\\ncross_out(S, N, _):-\\n S > N,\\n !.\\ncross_out(S, N, P):-\\n retract(is_prime(S)),\\n !,\\n Q is S + 2 * P,\\n cross_out(Q, N, P).\\ncross_out(S, N, P):-\\n Q is S + 2 * P,\\n cross_out(Q, N, P).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"from itertools import combinations as cmb\\n\\n\\ndef isP(n):\\n if n == 2:\\n return True\\n if n % 2 == 0:\\n return False\\n return all(n % x > 0 for x in range(3, int(n ** 0.5) + 1, 2))\\n\\n\\ndef genP(n):\\n p = [2]\\n p.extend([x for x in range(3, n + 1, 2) if isP(x)])\\n return p\\n\\n\\ndata = [\\n (99809, 1), (18, 2), (19, 3), (20, 4), (2017, 24),\\n (22699, 1), (22699, 2), (22699, 3), (22699, 4), (40355, 3)]\\n\\n\\nfor n, cnt in data:\\n ci = iter(cmb(genP(n), cnt))\\n while True:\\n try:\\n c = next(ci)\\n if sum(c) == n:\\n print(' '.join(\\n [repr((n, cnt)), \\\"->\\\", '+'.join(str(s) for s in c)]\\n ))\\n break\\n except StopIteration:\\n print(repr((n, cnt)) + \\\" -> Not possible\\\")\\n break\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n(require math/number-theory)\\n\\n(define memoised-next-prime\\n (let ((m# (make-hash)))\\n (λ (P) (hash-ref! m# P (λ () (next-prime P))))))\\n\\n(define (partition-X-into-N-primes X N)\\n (define (partition-x-into-n-primes-starting-at-P x n P result)\\n (cond ((= n x 0) result)\\n ((or (= n 0) (= x 0) (> P x)) #f)\\n (else\\n (let ((P′ (memoised-next-prime P)))\\n (or (partition-x-into-n-primes-starting-at-P (- x P) (- n 1) P′ (cons P result))\\n (partition-x-into-n-primes-starting-at-P x n P′ result))))))\\n\\n (reverse (or (partition-x-into-n-primes-starting-at-P X N 2 null) (list 'no-solution))))\\n\\n(define (report-partition X N)\\n (let ((result (partition-X-into-N-primes X N)))\\n (printf \\\"partition ~a\\\\twith ~a\\\\tprimes: ~a~%\\\" X N (string-join (map ~a result) \\\" + \\\"))))\\n\\n(module+ test\\n (report-partition 99809 1)\\n (report-partition 18 2)\\n (report-partition 19 3)\\n (report-partition 20 4)\\n (report-partition 2017 24)\\n (report-partition 22699 1)\\n (report-partition 22699 2)\\n (report-partition 22699 3)\\n (report-partition 22699 4)\\n (report-partition 40355 3))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use Math::Primesieve;\\nmy $sieve = Math::Primesieve.new;\\n\\n# short circuit for '1' partition\\nmulti partition ( Int $number, 1 ) { $number.is-prime ?? $number !! () }\\n\\nmulti partition ( Int $number, Int $parts where * > 0 = 2 ) {\\n my @these = $sieve.primes($number);\\n for @these.combinations($parts) { .return if .sum == $number };\\n ()\\n}\\n\\n# TESTING\\n(18,2, 19,3, 20,4, 99807,1, 99809,1, 2017,24, 22699,1, 22699,2, 22699,3, 22699,4, 40355,3)\\\\\\n .race(:1batch).map: -> $number, $parts {\\n say (sprintf \\\"Partition %5d into %2d prime piece\\\", $number, $parts),\\n $parts == 1 ?? ': ' !! 's: ', join '+', partition($number, $parts) || 'not possible'\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"$ENTRY Go {\\n = <Each Test <Tests>>;\\n};\\n\\nTests {\\n = (99809 1) (18 2) (19 3) (20 4) (2017 24)\\n (22699 1) (22699 2) (22699 3) (22699 4) (40355 3);\\n};\\n\\nTest {\\n (s.X s.N) =\\n <Prout 'Partitioned ' <Symb s.X> ' with ' <Symb s.N> ' primes: '\\n <Format <PrimePartition s.X s.N>>>;\\n};\\n\\nFormat {\\n F = 'not possible';\\n T s.N = <Symb s.N>;\\n T s.N e.X = <Symb s.N> '+' <Format T e.X>;\\n};\\n\\nPrimePartition {\\n s.X s.N = <Partition s.X s.N <Primes s.X>>;\\n};\\n\\nPartition {\\n s.X 1 e.Nums, e.Nums: {\\n e.1 s.X e.2 = T s.X;\\n e.1 = F;\\n };\\n s.X s.N = F;\\n s.X s.N s.Num e.Nums, <Compare s.X s.Num>: '-' =\\n <Partition s.X s.N e.Nums>;\\n s.X s.N s.Num e.Nums,\\n <Partition <- s.X s.Num> <- s.N 1> e.Nums>: {\\n T e.List = T s.Num e.List;\\n F = <Partition s.X s.N e.Nums>;\\n };\\n};\\n\\nPrimes {\\n s.N = <Sieve <Iota 2 s.N>>;\\n};\\n\\nIota {\\n s.End s.End = s.End;\\n s.Start s.End = s.Start <Iota <+ 1 s.Start> s.End>;\\n};\\n\\nCross {\\n s.Step e.List = <Cross (s.Step 1) s.Step e.List>;\\n (s.Step s.Skip) = ;\\n (s.Step 1) s.Item e.List = X <Cross (s.Step s.Step) e.List>;\\n (s.Step s.N) s.Item e.List = s.Item <Cross (s.Step <- s.N 1>) e.List>;\\n};\\n\\nSieve {\\n = ;\\n X e.List = <Sieve e.List>;\\n s.N e.List = s.N <Sieve <Cross s.N e.List>>;\\n};\\n\\nEach {\\n s.F = ;\\n s.F t.X e.R = <Mu s.F t.X> <Each s.F e.R>;\\n};\\n\",\n \"language\": \"Refal\"\n },\n {\n \"code\": \"/*REXX program partitions integer(s) (greater than unity) into N primes. */\\nparse arg what /*obtain an optional list from the C.L.*/\\n\\n do until what=='' /*possibly process a series of integers*/\\n parse var what x n what; parse var x x '-' y /*get possible range and # partitions.*/\\n parse var n n '-' m /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n if x=='' | x==\\\",\\\" then x= 19 /*Not specified? Then use the default.*/\\n if y=='' | y==\\\",\\\" then y= x /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n if n=='' | n==\\\",\\\" then n= 3 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n if m=='' | m==\\\",\\\" then m= n /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n call genP y /*generate Y number of primes. */\\n do g=x to y /*partition X ───► Y into partitions.*/\\n do q=n to m; call part /* \\\" G into Q primes. */\\n end /*q*/\\n end /*g*/\\n end /*until*/\\n\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngenP: arg high; @.1= 2; @.2= 3; #= 2 /*get highest prime, assign some vars. */\\n do j=@.#+2 by 2 until @.#>high /*only find odd primes from here on. */\\n do k=2 while k*k<=j /*divide by some known low odd primes. */\\n if j // @.k==0 then iterate j /*Is J divisible by P? Then ¬ prime.*/\\n end /*k*/ /* [↓] a prime (J) has been found. */\\n #= # + 1; @.#= j /*bump prime count; assign prime to @.*/\\n end /*j*/; return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngetP: procedure expose i. p. @.; parse arg z /*bump the prime in the partition list.*/\\n if i.z==0 then do; _= z - 1; i.z= i._; end\\n i.z= i.z + 1; _= i.z; p.z= @._; return 0\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nlist: _= p.1; if $==g then do j=2 to q; _= _ p.j\\n end /*j*/\\n else _= '__(not_possible)'\\n return 'prime' || word(\\\"s\\\", 1 + (q==1)) translate(_, '+ ', \\\" _\\\") /*plural? */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npart: i.= 0; do j=1 for q; call getP j\\n end /*j*/\\n\\n do !=0 by 0; $= 0 /*!: a DO variable for LEAVE & ITERATE*/\\n do s=1 for q; $= $ + p.s /* [↓] is sum of the primes too large?*/\\n if $>g then do; if s==1 then leave ! /*perform a quick exit?*/\\n do k=s to q; i.k= 0; end /*k*/\\n do r=s-1 to q; call getP r; end /*r*/\\n iterate !\\n end\\n end /*s*/\\n if $==g then leave /*is sum of the primes exactly right ? */\\n if $ <g then do; call getP q; iterate; end\\n end /*!*/ /* [↑] Is sum too low? Bump a prime.*/\\n say 'partitioned' center(g,9) \\\"into\\\" center(q, 5) list()\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Partition an integer X into N primes\\n\\nload \\\"stdlib.ring\\\"\\nnr = 0\\nnum = 0\\nlist = list(100000)\\nitems = newlist(pow(2,len(list))-1,100000)\\nwhile true\\n nr = nr + 1\\n if isprime(nr)\\n num = num + 1\\n list[num] = nr\\n ok\\n if num = 100000\\n exit\\n ok\\nend\\n\\npowerset(list,100000)\\nshowarray(items,100000)\\nsee nl\\n\\nfunc showarray(items,ind)\\n for p = 1 to 20\\n if (p > 17 and p < 21) or p = 99809 or p = 2017 or p = 22699 or p = 40355\\n for n = 1 to len(items)\\n flag = 0\\n for m = 1 to ind\\n if items[n][m] = 0\\n exit\\n ok\\n flag = flag + items[n][m]\\n next\\n if flag = p\\n str = \\\"\\\"\\n for x = 1 to len(items[n])\\n if items[n][x] != 0\\n str = str + items[n][x] + \\\" \\\"\\n ok\\n next\\n str = left(str, len(str) - 1)\\n str = str + \\\"]\\\"\\n if substr(str, \\\" \\\") > 0\\n see \\\"\\\" + p + \\\" = [\\\"\\n see str + nl\\n exit\\n else\\n str = \\\"\\\"\\n ok\\n ok\\n next\\n ok\\n next\\n\\nfunc powerset(list,ind)\\n num = 0\\n num2 = 0\\n items = newlist(pow(2,len(list))-1,ind)\\n for i = 2 to (2 << len(list)) - 1 step 2\\n num2 = 0\\n num = num + 1\\n for j = 1 to len(list)\\n if i & (1 << j)\\n num2 = num2 + 1\\n if list[j] != 0\\n items[num][num2] = list[j]\\n ok\\n ok\\n next\\n next\\n return items\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"require \\\"prime\\\"\\n\\ndef prime_partition(x, n)\\n Prime.each(x).to_a.combination(n).detect{|primes| primes.sum == x}\\nend\\n\\nTESTCASES = [[99809, 1], [18, 2], [19, 3], [20, 4], [2017, 24],\\n [22699, 1], [22699, 2], [22699, 3], [22699, 4], [40355, 3]]\\n\\nTESTCASES.each do |prime, num|\\n res = prime_partition(prime, num)\\n str = res.nil? ? \\\"no solution\\\" : res.join(\\\" + \\\")\\n puts \\\"Partitioned #{prime} with #{num} primes: #{str}\\\"\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// main.rs\\nmod bit_array;\\nmod prime_sieve;\\n\\nuse prime_sieve::PrimeSieve;\\n\\nfn find_prime_partition(\\n sieve: &PrimeSieve,\\n number: usize,\\n count: usize,\\n min_prime: usize,\\n primes: &mut Vec<usize>,\\n index: usize,\\n) -> bool {\\n if count == 1 {\\n if number >= min_prime && sieve.is_prime(number) {\\n primes[index] = number;\\n return true;\\n }\\n return false;\\n }\\n for p in min_prime..number {\\n if sieve.is_prime(p)\\n && find_prime_partition(sieve, number - p, count - 1, p + 1, primes, index + 1)\\n {\\n primes[index] = p;\\n return true;\\n }\\n }\\n false\\n}\\n\\nfn print_prime_partition(sieve: &PrimeSieve, number: usize, count: usize) {\\n let mut primes = vec![0; count];\\n if !find_prime_partition(sieve, number, count, 2, &mut primes, 0) {\\n println!(\\\"{} cannot be partitioned into {} primes.\\\", number, count);\\n } else {\\n print!(\\\"{} = {}\\\", number, primes[0]);\\n for i in 1..count {\\n print!(\\\" + {}\\\", primes[i]);\\n }\\n println!();\\n }\\n}\\n\\nfn main() {\\n let s = PrimeSieve::new(100000);\\n print_prime_partition(&s, 99809, 1);\\n print_prime_partition(&s, 18, 2);\\n print_prime_partition(&s, 19, 3);\\n print_prime_partition(&s, 20, 4);\\n print_prime_partition(&s, 2017, 24);\\n print_prime_partition(&s, 22699, 1);\\n print_prime_partition(&s, 22699, 2);\\n print_prime_partition(&s, 22699, 3);\\n print_prime_partition(&s, 22699, 4);\\n print_prime_partition(&s, 40355, 3);\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// prime_sieve.rs\\nuse crate::bit_array;\\n\\npub struct PrimeSieve {\\n composite: bit_array::BitArray,\\n}\\n\\nimpl PrimeSieve {\\n pub fn new(limit: usize) -> PrimeSieve {\\n let mut sieve = PrimeSieve {\\n composite: bit_array::BitArray::new(limit / 2),\\n };\\n let mut p = 3;\\n while p * p <= limit {\\n if !sieve.composite.get(p / 2 - 1) {\\n let inc = p * 2;\\n let mut q = p * p;\\n while q <= limit {\\n sieve.composite.set(q / 2 - 1, true);\\n q += inc;\\n }\\n }\\n p += 2;\\n }\\n sieve\\n }\\n pub fn is_prime(&self, n: usize) -> bool {\\n if n < 2 {\\n return false;\\n }\\n if n % 2 == 0 {\\n return n == 2;\\n }\\n !self.composite.get(n / 2 - 1)\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"// bit_array.rs\\npub struct BitArray {\\n array: Vec<u32>,\\n}\\n\\nimpl BitArray {\\n pub fn new(size: usize) -> BitArray {\\n BitArray {\\n array: vec![0; (size + 31) / 32],\\n }\\n }\\n pub fn get(&self, index: usize) -> bool {\\n let bit = 1 << (index & 31);\\n (self.array[index >> 5] & bit) != 0\\n }\\n pub fn set(&mut self, index: usize, new_val: bool) {\\n let bit = 1 << (index & 31);\\n if new_val {\\n self.array[index >> 5] |= bit;\\n } else {\\n self.array[index >> 5] &= !bit;\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object PartitionInteger {\\n\\n def sieve(nums: LazyList[Int]): LazyList[Int] =\\n LazyList.cons(nums.head, sieve((nums.tail) filter (_ % nums.head != 0)))\\n\\n // An 'infinite' stream of primes, lazy evaluation and memo-ized\\n private val oddPrimes = sieve(LazyList.from(3, 2))\\n private val primes = sieve(2 #:: oddPrimes).take(3600 /*50_000*/)\\n\\n private def findCombo(k: Int, x: Int, m: Int, n: Int, combo: Array[Int]): Boolean = {\\n var foundCombo = combo.map(i => primes(i)).sum == x\\n if (k >= m) {\\n if (foundCombo) {\\n val s: String = if (m > 1) \\\"s\\\" else \\\"\\\"\\n printf(\\\"Partitioned %5d with %2d prime%s: \\\", x, m, s)\\n for (i <- 0 until m) {\\n print(primes(combo(i)))\\n if (i < m - 1) print('+') else println()\\n }\\n }\\n } else for (j <- 0 until n if k == 0 || j > combo(k - 1)) {\\n combo(k) = j\\n if (!foundCombo) foundCombo = findCombo(k + 1, x, m, n, combo)\\n }\\n foundCombo\\n }\\n\\n private def partition(x: Int, m: Int): Unit = {\\n val n: Int = primes.count(it => it <= x)\\n if (n < m) throw new IllegalArgumentException(\\\"Not enough primes\\\")\\n\\n if (!findCombo(0, x, m, n, new Array[Int](m)))\\n printf(\\\"Partitioned %5d with %2d prime%s: (not possible)\\\\n\\\", x, m, if (m > 1) \\\"s\\\" else \\\" \\\")\\n }\\n\\n def main(args: Array[String]): Unit = {\\n partition(99809, 1)\\n partition(18, 2)\\n partition(19, 3)\\n partition(20, 4)\\n partition(2017, 24)\\n partition(22699, 1)\\n partition(22699, 2)\\n partition(22699, 3)\\n partition(22699, 4)\\n partition(40355, 3)\\n }\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"program primes_partition;\\n tests := [[99809,1], [18,2], [19,3], [20,4], [2017,24],\\n [22699,1], [22699,2], [22699,3], [22699,4], [40355,3]];\\n\\n loop for [x, n] in tests do\\n nprint(\\\"Partitioned\\\",x,\\\"with\\\",n,\\\"primes:\\\");\\n if (p := partition(x,n)) = om then\\n print(\\\" not possible\\\");\\n else\\n print(\\\" \\\" + (+/[\\\"+\\\" + str pr : pr in p])(2..));\\n end if;\\n end loop;\\n\\n proc partition(x,n);\\n return findpart(x,n,sieve(x));\\n end proc;\\n\\n proc findpart(x,n,nums);\\n if n=1 then\\n return if x in nums then [x] else om end;\\n end if;\\n\\n loop while nums /= [] do\\n k fromb nums;\\n if (l := findpart(x-k, n-1, nums)) /= om then\\n return [k] + l;\\n end if;\\n end loop;\\n return om;\\n end proc;\\n\\n proc sieve(n);\\n primes := [1..n];\\n primes(1) := om;\\n loop for p in [2..floor sqrt n] do\\n loop for c in [p*p, p*p+p..n] do\\n primes(c) := om;\\n end loop;\\n end loop;\\n return [p : p in primes | p /= om];\\n end proc;\\nend program;\\n\",\n \"language\": \"SETL\"\n },\n {\n \"code\": \"func prime_partition(num, parts) {\\n\\n if (parts == 1) {\\n return (num.is_prime ? [num] : [])\\n }\\n\\n num.primes.combinations(parts, {|*c|\\n return c if (c.sum == num)\\n })\\n\\n return []\\n}\\n\\nvar tests = [\\n [ 18, 2], [ 19, 3], [ 20, 4],\\n [99807, 1], [99809, 1], [ 2017, 24],\\n [22699, 1], [22699, 2], [22699, 3],\\n [22699, 4], [40355, 3],\\n]\\n\\nfor num,parts (tests) {\\n say (\\\"Partition %5d into %2d prime piece\\\" % (num, parts),\\n parts == 1 ? ': ' : 's: ', prime_partition(num, parts).join('+') || 'not possible')\\n}\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import Foundation\\n\\nclass BitArray {\\n var array: [UInt32]\\n\\n init(size: Int) {\\n array = Array(repeating: 0, count: (size + 31)/32)\\n }\\n\\n func get(index: Int) -> Bool {\\n let bit = UInt32(1) << (index & 31)\\n return (array[index >> 5] & bit) != 0\\n }\\n\\n func set(index: Int, value: Bool) {\\n let bit = UInt32(1) << (index & 31)\\n if value {\\n array[index >> 5] |= bit\\n } else {\\n array[index >> 5] &= ~bit\\n }\\n }\\n}\\n\\nclass PrimeSieve {\\n let composite: BitArray\\n\\n init(size: Int) {\\n composite = BitArray(size: size/2)\\n var p = 3\\n while p * p <= size {\\n if !composite.get(index: p/2 - 1) {\\n let inc = p * 2\\n var q = p * p\\n while q <= size {\\n composite.set(index: q/2 - 1, value: true)\\n q += inc\\n }\\n }\\n p += 2\\n }\\n }\\n\\n func isPrime(number: Int) -> Bool {\\n if number < 2 {\\n return false\\n }\\n if (number & 1) == 0 {\\n return number == 2\\n }\\n return !composite.get(index: number/2 - 1)\\n }\\n}\\n\\nfunc findPrimePartition(sieve: PrimeSieve, number: Int,\\n count: Int, minPrime: Int,\\n primes: inout [Int], index: Int) -> Bool {\\n if count == 1 {\\n if number >= minPrime && sieve.isPrime(number: number) {\\n primes[index] = number\\n return true\\n }\\n return false\\n }\\n if minPrime >= number {\\n return false\\n }\\n for p in minPrime..<number {\\n if sieve.isPrime(number: p)\\n && findPrimePartition(sieve: sieve, number: number - p,\\n count: count - 1, minPrime: p + 1,\\n primes: &primes, index: index + 1) {\\n primes[index] = p\\n return true\\n }\\n }\\n return false\\n}\\n\\nfunc printPrimePartition(sieve: PrimeSieve, number: Int, count: Int) {\\n var primes = Array(repeating: 0, count: count)\\n if !findPrimePartition(sieve: sieve, number: number, count: count,\\n minPrime: 2, primes: &primes, index: 0) {\\n print(\\\"\\\\(number) cannot be partitioned into \\\\(count) primes.\\\")\\n } else {\\n print(\\\"\\\\(number) = \\\\(primes[0])\\\", terminator: \\\"\\\")\\n for i in 1..<count {\\n print(\\\" + \\\\(primes[i])\\\", terminator: \\\"\\\")\\n }\\n print()\\n }\\n}\\n\\nlet sieve = PrimeSieve(size: 100000)\\nprintPrimePartition(sieve: sieve, number: 99809, count: 1)\\nprintPrimePartition(sieve: sieve, number: 18, count: 2)\\nprintPrimePartition(sieve: sieve, number: 19, count: 3)\\nprintPrimePartition(sieve: sieve, number: 20, count: 4)\\nprintPrimePartition(sieve: sieve, number: 2017, count: 24)\\nprintPrimePartition(sieve: sieve, number: 22699, count: 1)\\nprintPrimePartition(sieve: sieve, number: 22699, count: 2)\\nprintPrimePartition(sieve: sieve, number: 22699, count: 3)\\nprintPrimePartition(sieve: sieve, number: 22699, count: 4)\\nprintPrimePartition(sieve: sieve, number: 40355, count: 3)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"' Partition an integer X into N primes\\n dim p(),a(32),b(32),v,g: redim p(64)\\n what=\\\"99809 1 18 2 19 3 20 4 2017 24 22699 1-4 40355 3\\\"\\n t1=split(what,\\\" \\\")\\n for j=0 to ubound(t1)\\n t2=split(t1(j)): x=t2(0): n=t2(1)\\n t3=split(x,\\\"-\\\"): x=clng(t3(0))\\n if ubound(t3)=1 then y=clng(t3(1)) else y=x\\n t3=split(n,\\\"-\\\"): n=clng(t3(0))\\n if ubound(t3)=1 then m=clng(t3(1)) else m=n\\n genp y 'generate primes in p\\n for g=x to y\\n for q=n to m: part: next 'q\\n next 'g\\n next 'j\\n\\nsub genp(high)\\n p(1)=2: p(2)=3: c=2: i=p(c)+2\\n do 'i\\n k=2: bk=false\\n do while k*k<=i and not bk 'k\\n if i mod p(k)=0 then bk=true\\n k=k+1\\n loop 'k\\n if not bk then\\n c=c+1: if c>ubound(p) then redim preserve p(ubound(p)+8)\\n p(c)=i\\n end if\\n i=i+2\\n loop until p(c)>high 'i\\nend sub 'genp\\n\\nsub getp(z)\\n if a(z)=0 then w=z-1: a(z)=a(w)\\n a(z)=a(z)+1: w=a(z): b(z)=p(w)\\nend sub 'getp\\n\\nfunction list()\\n w=b(1)\\n if v=g then for i=2 to q: w=w&\\\"+\\\"&b(i): next else w=\\\"(not possible)\\\"\\n list=\\\"primes: \\\"&w\\nend function 'list\\n\\nsub part()\\n for i=lbound(a) to ubound(a): a(i)=0: next 'i\\n for i=1 to q: call getp(i): next 'i\\n do while true: v=0: bu=false\\n for s=1 to q\\n v=v+b(s)\\n if v>g then\\n if s=1 then exit do\\n for k=s to q: a(k)=0: next 'k\\n for r=s-1 to q: call getp(r): next 'r\\n bu=true: exit for\\n end if\\n next 's\\n if not bu then\\n if v=g then exit do\\n if v<g then call getp(q)\\n end if\\n loop\\n wscript.echo \\\"partition \\\"&g&\\\" into \\\"&q&\\\" \\\"&list\\nend sub 'part\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"' Partition an integer X into N primes - 29/03/2017\\nOption Explicit On\\n\\nModule PartitionIntoPrimes\\n Dim p(8), a(32), b(32), v, g, q As Long\\n\\n Sub Main()\\n Dim what, t1(), t2(), t3(), xx, nn As String\\n Dim x, y, n, m As Long\\n what = \\\"99809 1 18 2 19 3 20 4 2017 24 22699 1-4 40355 3\\\"\\n t1 = Split(what, \\\" \\\")\\n For j = 0 To UBound(t1)\\n t2 = Split(t1(j)) : xx = t2(0) : nn = t2(1)\\n t3 = Split(xx, \\\"-\\\") : x = CLng(t3(0))\\n If UBound(t3) = 1 Then y = CLng(t3(1)) Else y = x\\n t3 = Split(nn, \\\"-\\\") : n = CLng(t3(0))\\n If UBound(t3) = 1 Then m = CLng(t3(1)) Else m = n\\n genp(y) 'generate primes in p\\n For g = x To y\\n For q = n To m : part() : Next 'q\\n Next 'g\\n Next 'j\\n End Sub 'Main\\n\\n Sub genp(high As Long)\\n Dim c, i, k As Long\\n Dim bk As Boolean\\n p(1) = 2 : p(2) = 3 : c = 2 : i = p(c) + 2\\n Do 'i\\n k = 2 : bk = False\\n Do While k * k <= i And Not bk 'k\\n If i Mod p(k) = 0 Then bk = True\\n k = k + 1\\n Loop 'k\\n If Not bk Then\\n c = c + 1 : If c > UBound(p) Then ReDim Preserve p(UBound(p) + 8)\\n p(c) = i\\n End If\\n i = i + 2\\n Loop Until p(c) > high 'i\\n End Sub 'genp\\n\\n Sub getp(z As Long)\\n Dim w As Long\\n If a(z) = 0 Then w = z - 1 : a(z) = a(w)\\n a(z) = a(z) + 1 : w = a(z) : b(z) = p(w)\\n End Sub 'getp\\n\\n Function list()\\n Dim w As String\\n w = b(1)\\n If v = g Then\\n For i = 2 To q : w = w & \\\"+\\\" & b(i) : Next\\n Else\\n w = \\\"(not possible)\\\"\\n End If\\n Return \\\"primes: \\\" & w\\n End Function 'list\\n\\n Sub part()\\n For i = LBound(a) To UBound(a) : a(i) = 0 : Next 'i\\n For i = 1 To q : Call getp(i) : Next 'i\\n Do While True : v = 0\\n For s = 1 To q\\n v = v + b(s)\\n If v > g Then\\n If s = 1 Then Exit Do\\n For k = s To q : a(k) = 0 : Next 'k\\n For r = s - 1 To q : Call getp(r) : Next 'r\\n Continue Do\\n End If\\n Next 's\\n If v = g Then Exit Do\\n If v < g Then Call getp(q)\\n Loop\\n Console.WriteLine(\\\"partition \\\" & g & \\\" into \\\" & q & \\\" \\\" & list())\\n End Sub 'part\\n\\nEnd Module 'PartitionIntoPrimes\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./math\\\" for Int, Nums\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar primes = Int.primeSieve(1e5)\\nvar foundCombo = false\\n\\nvar findCombo // recursive\\nfindCombo = Fn.new { |k, x, m, n, combo|\\n if (k >= m) {\\n if (Nums.sum(combo.map { |i| primes[i] }.toList) == x) {\\n var s = (m > 1) ? \\\"s\\\" : \\\"\\\"\\n Fmt.write(\\\"Partitioned $5d with $2d prime$s: \\\", x, m, s)\\n for (i in 0...m) {\\n System.write(primes[combo[i]])\\n System.write((i < m - 1) ? \\\"+\\\" : \\\"\\\\n\\\")\\n }\\n foundCombo = true\\n }\\n } else {\\n for (j in 0...n) {\\n if (k == 0 || j > combo[k - 1]) {\\n combo[k] = j\\n if (!foundCombo) findCombo.call(k + 1, x, m, n, combo)\\n }\\n }\\n }\\n}\\n\\nvar partition = Fn.new { |x, m|\\n if (x < 2 || m < 1 || m >= x) Fiber.abort(\\\"Invalid argument(s)\\\")\\n var n = primes.where { |p| p <= x }.count\\n if (n < m) Fiber.abort(\\\"Not enough primes\\\")\\n var combo = List.filled(m, 0)\\n foundCombo = false\\n findCombo.call(0, x, m, n, combo)\\n if (!foundCombo) {\\n var s = (m > 1) ? \\\"s\\\" : \\\"\\\"\\n Fmt.print(\\\"Partitioned $5d with $2d prime$s: (not possible)\\\", x, m, s)\\n }\\n}\\n\\nvar a = [\\n [99809, 1],\\n [18, 2],\\n [19, 3],\\n [20, 4],\\n [2017, 24],\\n [22699, 1],\\n [22699, 2],\\n [22699, 3],\\n [22699, 4],\\n [40355, 3]\\n]\\nfor (p in a) partition.call(p[0], p[1])\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \" // Partition integer N into M unique primes\\nfcn partition(N,M,idx=0,ps=List()){\\n var [const] sieve=Utils.Generator(Import(\\\"sieve\\\").postponed_sieve);\\n var [const] primes=List();\\n while(sieve.peek()<=N){ primes.append(sieve.next()) }\\n if(M<2){\\n z:=primes.find(N);\\n return(if(Void!=z and z>=idx) ps.append(N) else Void);\\n }\\n foreach z in ([idx..primes.len()-1]){\\n p:=primes[z];\\n if(p<=N and self.fcn(N-p,M-1,z+1,ps)) return(ps.insert(0,p));\\n if(p>N) break;\\n }\\n Void\\t\\t// no solution\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach n,m in (T( T(18,2),T(19,3),T(99809,1),T(20,4),T(2017,24),\\n T(22699,1),T(22699,2),T(22699,3),T(22699,4),T(40355,3), )){\\n ps:=partition(n,m);\\n if(ps) println(\\\"Partition %d with %d prime(s): %s\\\".fmt(n,m,ps.concat(\\\"+\\\")));\\n else println(\\\"Can not partition %d with %d prime(s)\\\".fmt(n,m));\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Partition-an-integer-x-into-n-primes"}}},{"rowIdx":1489,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\ncategory:\n- Memoization\nfrom: http://rosettacode.org/wiki/Partition_function_P\nnote: Recursion\n","language":"00-META"},{"code":"The [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P] is the function P(n), where n∈ℤ, defined as the number of distinct ways in which n can be expressed as the sum of non-increasing positive integers. \n\n\n;Example:\n P(4) = 5 because 4 = <big>Σ</big>(4) = <big>Σ</big>(3,1) = <big>Σ</big>(2,2) = <big>Σ</big>(2,1,1) = <big>Σ</big>(1,1,1,1)\n\n\nP(n) can be expressed as the recurrence relation: \n P(n) = P(n-1) +P(n-2) -P(n-5) -P(n-7) +P(n-12) +P(n-15) -P(n-22) -P(n-26) +P(n-35) +P(n-40) ...\n\nThe successive numbers in the above equation have the differences: 1, 3, 2, 5, 3, 7, 4, 9, 5, 11, 6, 13, 7, 15, 8 ...\n\nThis task may be of popular interest because [https://www.youtube.com/channel/UC1_uAIS3r8Vu6JjXWvastJg Mathologer] made the video, [https://www.youtube.com/watch?v=iJ8pnCO0nTY The hardest \"What comes next?\" (Euler's pentagonal formula)], where he asks the programmers among his viewers to calculate P(666). The video was viewed more than 100,000 times in the first couple of weeks after its release.\n\nIn Wolfram Language, this function has been implemented as PartitionsP.\n\n\n;Task:\nWrite a function which returns the value of PartitionsP(n). Solutions can be iterative or recursive. \n\nBonus task: show how long it takes to compute PartitionsP(6666).\n\n\n;References:\n* [https://www.youtube.com/watch?v=iJ8pnCO0nTY The hardest \"What comes next?\" (Euler's pentagonal formula)] The explanatory video by Mathologer that makes this task a popular interest.\n* [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P] Mathworld entry for the Partition function.\n* [[wp:Partition_function_(number_theory)|Partition function (number theory)]] Wikipedia entry for the Partition function.\n\n\n;Related tasks:\n* [[9 billion names of God the integer]]\n\n<br><br>\n\n\n","language":"00-TASK"},{"code":"F partitions(n)\n V p = [BigInt(1)] [+] [BigInt(0)] * n\n L(i) 1 .. n\n V k = 0\n L\n k++\n V j = (k * (3 * k - 1)) I/ 2\n I j > i\n L.break\n I k [&] 1\n p[i] += p[i - j]\n E\n p[i] -= p[i - j]\n j = (k * (3 * k + 1)) I/ 2\n I j > i\n L.break\n I k [&] 1\n p[i] += p[i - j]\n E\n p[i] -= p[i - j]\n R p[n]\n\nprint(‘Partitions: ’(0.<15).map(x -> partitions(x)))\n\nV start = time:perf_counter()\nprint(partitions(6666))\nprint(time:perf_counter() - start)\n","language":"11l"},{"code":"#include <stdint.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <time.h>\n#include <gmp.h>\n\nmpz_t* partition(uint64_t n) {\n\tmpz_t *pn = (mpz_t *)malloc((n + 2) * sizeof(mpz_t));\n\tmpz_init_set_ui(pn[0], 1);\n\tmpz_init_set_ui(pn[1], 1);\n\tfor (uint64_t i = 2; i < n + 2; i ++) {\n\t\tmpz_init(pn[i]);\n\t\tfor (uint64_t k = 1, penta; ; k++) {\n\t\t\tpenta = k * (3 * k - 1) >> 1;\n\t\t\tif (penta >= i) break;\n\t\t\tif (k & 1) mpz_add(pn[i], pn[i], pn[i - penta]);\n\t\t\telse mpz_sub(pn[i], pn[i], pn[i - penta]);\n\t\t\tpenta += k;\n\t\t\tif (penta >= i) break;\n\t\t\tif (k & 1) mpz_add(pn[i], pn[i], pn[i - penta]);\n\t\t\telse mpz_sub(pn[i], pn[i], pn[i - penta]);\n\t\t}\n\t}\n\tmpz_t *tmp = &pn[n + 1];\n\tfor (uint64_t i = 0; i < n + 1; i ++) mpz_clear(pn[i]);\n\tfree(pn);\n\treturn tmp;\n}\n\nint main(int argc, char const *argv[]) {\n\tclock_t start = clock();\n\tmpz_t *p = partition(6666);\n\tgmp_printf(\"%Zd\\n\", p);\n\tprintf(\"Elapsed time: %.04f seconds\\n\",\n\t\t(double)(clock() - start) / (double)CLOCKS_PER_SEC);\n\treturn 0;\n}\n","language":"C"},{"code":"#include <chrono>\n#include <iostream>\n#include <vector>\n#include <gmpxx.h>\n\nusing big_int = mpz_class;\n\nbig_int partitions(int n) {\n std::vector<big_int> p(n + 1);\n p[0] = 1;\n for (int i = 1; i <= n; ++i) {\n for (int k = 1;; ++k) {\n int j = (k * (3*k - 1))/2;\n if (j > i)\n break;\n if (k & 1)\n p[i] += p[i - j];\n else\n p[i] -= p[i - j];\n j = (k * (3*k + 1))/2;\n if (j > i)\n break;\n if (k & 1)\n p[i] += p[i - j];\n else\n p[i] -= p[i - j];\n }\n }\n return p[n];\n}\n\nint main() {\n auto start = std::chrono::steady_clock::now();\n auto result = partitions(6666);\n auto end = std::chrono::steady_clock::now();\n std::chrono::duration<double, std::milli> ms(end - start);\n std::cout << result << '\\n';\n std::cout << \"elapsed time: \" << ms.count() << \" milliseconds\\n\";\n}\n","language":"C++"},{"code":"#include <chrono>\n#include <iostream>\n\nusing namespace std;\nusing namespace chrono;\n\nconst long long Lm = (long)1e18;\nconst int Fm = 18;\n\nstruct LI { long long lo, ml, mh, hi, tp; };\n\nLI set(long long s) { LI d;\n d.lo = s; d.ml = d.mh = d.hi = d.tp = 0; return d; }\n\nvoid inc(LI& d, LI s) { // d += s\n if ((d.lo += s.lo) >= Lm) { d.ml++; d.lo -= Lm; }\n if ((d.ml += s.ml) >= Lm) { d.mh++; d.ml -= Lm; }\n if ((d.mh += s.mh) >= Lm) { d.hi++; d.mh -= Lm; }\n if ((d.hi += s.hi) >= Lm) { d.tp++; d.hi -= Lm; }\n d.tp += s.tp;\n}\n\nvoid dec(LI& d, LI s) { // d -= s\n if ((d.lo -= s.lo) < 0) { d.ml--; d.lo += Lm; }\n if ((d.ml -= s.ml) < 0) { d.mh--; d.ml += Lm; }\n if ((d.mh -= s.mh) < 0) { d.hi--; d.mh += Lm; }\n if ((d.hi -= s.hi) < 0) { d.tp--; d.hi += Lm; }\n d.tp -= s.tp;\n}\n\ninline string sf(long long n) {\n int len = Fm;\n string result(len--, '0');\n for (long long i = n; len >= 0 && i > 0; --len, i /= 10)\n result[len] = '0' + i % 10;\n return result;\n}\n\nstring fmt(LI x) { // returns formatted string value of x\n if (x.tp > 0) return to_string(x.tp) + sf(x.hi) + sf(x.mh) + sf(x.ml) + sf(x.lo);\n if (x.hi > 0) return to_string(x.hi) + sf(x.mh) + sf(x.ml) + sf(x.lo);\n if (x.mh > 0) return to_string(x.mh) + sf(x.ml) + sf(x.lo);\n if (x.ml > 0) return to_string(x.ml) + sf(x.lo);\n return to_string(x.lo);\n}\n\nLI partcount(int n) { LI p[n + 1]; p[0] = set(1);\n for (int i = 1; i <= n; i++) {\n int k = 0, d = -2, j = i; LI x = set(0); while (true) {\n if ((j -= (d += 3) - k) >= 0) inc(x, p[j]); else break;\n if ((j -= ++k) >= 0) inc(x, p[j]); else break;\n if ((j -= (d += 3) - k) >= 0) dec(x, p[j]); else break;\n if ((j -= ++k) >= 0) dec(x, p[j]); else break;\n } p[i] = x; } return p[n]; }\n\nint main() {\n auto start = steady_clock::now();\n auto result = partcount(6666);\n auto end = steady_clock::now();\n duration<double, milli> ms(end - start);\n cout << fmt(result) << \" \" << ms.count() << \" ms\";\n}\n","language":"C++"},{"code":"using System;\n\nclass Program {\n\n const long Lm = (long)1e18;\n const string Fm = \"D18\";\n\n // provides 5 x 18 = 90 decimal digits\n struct LI { public long lo, ml, mh, hi, tp; }\n\n static void inc(ref LI d, LI s) { // d += s\n if ((d.lo += s.lo) >= Lm) { d.ml++; d.lo -= Lm; }\n if ((d.ml += s.ml) >= Lm) { d.mh++; d.ml -= Lm; }\n if ((d.mh += s.mh) >= Lm) { d.hi++; d.mh -= Lm; }\n if ((d.hi += s.hi) >= Lm) { d.tp++; d.hi -= Lm; }\n d.tp += s.tp;\n }\n\n static void dec(ref LI d, LI s) { // d -= s\n if ((d.lo -= s.lo) < 0) { d.ml--; d.lo += Lm; }\n if ((d.ml -= s.ml) < 0) { d.mh--; d.ml += Lm; }\n if ((d.mh -= s.mh) < 0) { d.hi--; d.mh += Lm; }\n if ((d.hi -= s.hi) < 0) { d.tp--; d.hi += Lm; }\n d.tp -= s.tp;\n }\n\n static LI set(long s) { LI d;\n d.lo = s; d.ml = d.mh = d.hi = d.tp = 0; return d; }\n\n static string fmt(LI x) { // returns formatted string value of x\n if (x.tp > 0) return x.tp.ToString() + x.hi.ToString(Fm) + x.mh.ToString(Fm) + x.ml.ToString(Fm) + x.lo.ToString(Fm);\n if (x.hi > 0) return x.hi.ToString() + x.mh.ToString(Fm) + x.ml.ToString(Fm) + x.lo.ToString(Fm);\n if (x.mh > 0) return x.mh.ToString() + x.ml.ToString(Fm) + x.lo.ToString(Fm);\n if (x.ml > 0) return x.ml.ToString() + x.lo.ToString(Fm);\n return x.lo.ToString();\n }\n\n static LI partcount(int n) {\n var P = new LI[n + 1]; P[0] = set(1);\n for (int i = 1; i <= n; i++) {\n int k = 0, d = -2, j = i;\n LI x = set(0);\n while (true) {\n if ((j -= (d += 3) -k) >= 0) inc(ref x, P[j]); else break;\n if ((j -= ++k) >= 0) inc(ref x, P[j]); else break;\n if ((j -= (d += 3) -k) >= 0) dec(ref x, P[j]); else break;\n if ((j -= ++k) >= 0) dec(ref x, P[j]); else break;\n }\n P[i] = x;\n }\n return P[n];\n }\n\n static void Main(string[] args) {\n var sw = System.Diagnostics.Stopwatch.StartNew ();\n var res = partcount(6666); sw.Stop();\n Console.Write(\"{0} {1} ms\", fmt(res), sw.Elapsed.TotalMilliseconds);\n }\n}\n","language":"C-sharp"},{"code":"program Partition_function_P;\n\n{$APPTYPE CONSOLE}\n\nuses\n System.SysUtils,\n Velthuis.BigIntegers,\n System.Diagnostics;\n\nvar\n p: TArray<BigInteger>;\n pd: TArray<Integer>;\n\nfunction PartiDiffDiff(n: Integer): Integer;\nbegin\n if n and 1 = 1 then\n exit((n + 1) div 2);\n Result := n + 1;\nend;\n\nfunction partDiff(n: Integer): Integer;\nbegin\n if n < 2 then\n exit(1);\n\n pd[n] := pd[n - 1] + PartiDiffDiff(n - 1);\n Result := pd[n];\nend;\n\nprocedure partitionP(n: Integer);\nbegin\n if n < 2 then\n exit;\n\n var psum: BigInteger := 0;\n for var i := 1 to n do\n begin\n var pdi := partDiff(i);\n if pdi > n then\n Break;\n\n var sign: Int64 := -1;\n\n if (i - 1) mod 4 < 2 then\n sign := 1;\n\n var t: BigInteger := BigInteger(p[n - pdi]) * BigInteger(sign);\n psum := psum + t;\n end;\n p[n] := psum;\nend;\n\nbegin\n var stopwatch := TStopwatch.Create;\n const n = 6666;\n SetLength(p, n + 1);\n SetLength(pd, n + 1);\n stopwatch.Start;\n p[0] := 1;\n pd[0] := 1;\n p[1] := 1;\n pd[1] := 1;\n for var i := 2 to n do\n partitionP(i);\n stopwatch.Stop;\n writeln(format('p[%d] = %s', [n, p[n].ToString]));\n writeln('Took ', stopwatch.ElapsedMilliseconds, 'ms');\n Readln;\nend.\n","language":"Delphi"},{"code":"use Bitwise, skip_operators: true\n\ndefmodule Partition do\n def init(), do:\n :ets.new :pN, [:set, :named_table, :private]\n\n def gpentagonals(), do: Stream.unfold {1, 0}, &next/1\n defp next({m, n}) do\n a = case rem m, 2 do\n 0 -> div m, 2\n 1 -> m\n end\n {n, {m + 1, n + a}}\n end\n\n def p(0), do: 1\n def p(n) do\n case :ets.lookup :pN, n do\n [{^n, val}] -> val\n [] ->\n {val, _} = gpentagonals()\n |> Stream.drop(1)\n |> Stream.take_while(fn m -> m <= n end)\n |> Stream.map(fn g -> p(n - g) end)\n |> Enum.reduce({0, 0},\n fn n, {a, sgn} -> {\n a + (if sgn < 2, do: n, else: -n),\n band(sgn + 1, 3)\n }\n end)\n :ets.insert :pN, {n, val}\n val\n end\n end\nend\n\nPartition.init\nIO.puts Partition.p 6666\n","language":"Elixir"},{"code":"-mode(compile).\n\nmain(_) ->\n ets:new(pN, [set, named_table, protected]),\n io:format(\"~w~n\", [p(6666)]).\n\np(0) -> 1;\np(N) ->\n case ets:lookup(pN, N) of\n [{N, Pn}] -> Pn;\n [] ->\n Terms = [p(N - G) || G <- gpentagonals(N)],\n Pn = sum_partitions(Terms),\n ets:insert(pN, {N, Pn}),\n Pn\n end.\n\nsum_partitions(Terms) -> sum_partitions(Terms, 0, 0).\nsum_partitions([], _, Sum) -> Sum;\nsum_partitions([N|Ns], Sgn, Sum) ->\n Summand = case Sgn < 2 of\n true -> N;\n false -> -N\n end,\n sum_partitions(Ns, (Sgn+1) band 3, Sum + Summand).\n\ngpentagonals(Max) -> gpentagonals(1, Max, [0]).\ngpentagonals(M, Max, Ps = [N|_]) ->\n GP = N + case M rem 2 of\n 0 -> M div 2;\n 1 -> M\n end,\n if\n GP > Max -> tl(lists:reverse(Ps));\n true -> gpentagonals(M + 1, Max, [GP|Ps])\n end.\n","language":"Erlang"},{"code":"// PartionP: Nigel Galloway. April 12th., 2021\nlet pP g=let rec fN i g e l=seq{yield(l,e+i);yield(-l,e+i+g);yield! fN(i+1)(g+2)(e+i+g)(-l)}\n let N,G=Array.create(g+1) 1I,seq{yield (1I,1);yield! fN 1 3 1 1I}|>Seq.takeWhile(fun(_,n)->n<=g)|>List.ofSeq\n seq{2..g}|>Seq.iter(fun p->N.[p]<-G|>List.takeWhile(fun(_,n)->n<=p)|>Seq.fold(fun Σ (n,g)->Σ+n*N.[p-g]) 0I); N.[g]\nprintfn \"666->%A\\n\\n6666->%A\\n\\n123456->%A\" (pP 666) (pP 6666) (pP 123456)\n","language":"F-Sharp"},{"code":"USING: kernel lists lists.lazy math sequences sequences.extras ;\n\n! Compute the nth pentagonal number.\n: penta ( n -- m ) [ sq 3 * ] [ - 2/ ] bi ;\n\n! An infinite lazy list of indices to add and subtract in the\n! sequence of partitions to find the next P.\n: seq ( -- list )\n 1 lfrom [ penta 1 - ] <lazy-map> 1 lfrom [ neg penta 1 - ]\n <lazy-map> lmerge ;\n\n! Reduce a sequence by adding two, subtracting two, adding two,\n! etc...\n: ++-- ( seq -- n ) 0 [ 2/ odd? [ - ] [ + ] if ] reduce-index ;\n\n! Find the next member of the partitions sequence.\n: step ( seq pseq -- seq 'pseq )\n dup length [ < ] curry pick swap take-while over <reversed>\n nths ++-- suffix! ;\n\n: partitions ( m -- n )\n [ seq swap [ <= ] curry lwhile list>array ]\n [ V{ 1 } clone swap [ step ] times last nip ] bi ;\n","language":"Factor"},{"code":"Function PartitionsP(n As UInteger) As ULongInt\n ' if n > 416, the result becomes to large for a unsigned 64bit integer\n Dim As ULongInt p(n)\n Dim As UInteger k, j\n\n p(0) = 1\n For i As UInteger = 1 To n\n k = 0\n While TRUE\n k += 1\n j = (k * (3*k - 1)) \\ 2\n If (j > i) Then Exit While\n If (k And 1) Then\n p(i) += p(i - j)\n Else\n p(i) -= p(i - j)\n End If\n 'j = (k * (3*k + 1)) \\ 2\n j += k\n If (j > i) Then Exit While\n If (k And 1) Then\n p(i) += p(i - j)\n Else\n p(i) -= p(i - j)\n End If\n Wend\n Next i\n Return p(n)\nEnd Function\n\nPrint !\"\\nPartitionsP: \";\nFor x As UInteger = 0 To 12\n Print PartitionsP(x);\" \";\nNext x\n\nPrint !\"\\n\\ndone\"\nSleep\n","language":"FreeBASIC"},{"code":"' version 26-06-2021\n' compile with: fbc -s console\n\n#Include Once \"gmp.bi\"\n\nSub PartitionsP(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\n#Define max 6666\n\nDim As UInteger n\nDim As ZString Ptr ans\nDim As Double t = Timer\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\nPartitionsP(max, big_p())\nans = Mpz_get_str (0, 10, big_p(max))\nPrint \"PartitionsP(\"; Str(max); \") = \"; \" \"; *ans\n\nFor n = 0 To max\n Mpz_clear(big_p(n))\nNext\n\nPrint Using \"time = ###.## ms\"; (Timer - t) * 1000\n\n' empty keyboard buffer\nWhile InKey <> \"\" : Wend\nPrint : Print \"hit any key to end program\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"println[partitionCount[6666]]\n","language":"Frink"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n \"time\"\n)\n\nvar p []*big.Int\nvar pd []int\n\nfunc partDiffDiff(n int) int {\n if n&1 == 1 {\n return (n + 1) / 2\n }\n return n + 1\n}\n\nfunc partDiff(n int) int {\n if n < 2 {\n return 1\n }\n pd[n] = pd[n-1] + partDiffDiff(n-1)\n return pd[n]\n}\n\nfunc partitionsP(n int) {\n if n < 2 {\n return\n }\n psum := new(big.Int)\n for i := 1; i <= n; i++ {\n pdi := partDiff(i)\n if pdi > n {\n break\n }\n sign := int64(-1)\n if (i-1)%4 < 2 {\n sign = 1\n }\n t := new(big.Int).Mul(p[n-pdi], big.NewInt(sign))\n psum.Add(psum, t)\n }\n p[n] = psum\n}\n\nfunc main() {\n start := time.Now()\n const N = 6666\n p = make([]*big.Int, N+1)\n pd = make([]int, N+1)\n p[0], pd[0] = big.NewInt(1), 1\n p[1], pd[1] = big.NewInt(1), 1\n for n := 2; n <= N; n++ {\n partitionsP(n)\n }\n fmt.Printf(\"p[%d)] = %d\\n\", N, p[N])\n fmt.Printf(\"Took %s\\n\", time.Since(start))\n}\n","language":"Go"},{"code":"{-# LANGUAGE DeriveFunctor #-}\n\n------------------------------------------------------------\n-- memoization utilities\n\ndata Memo a = Node a (Memo a) (Memo a)\n deriving (Functor)\n\nmemo :: Integral a => Memo p -> a -> p\nmemo (Node a l r) n\n | n == 0 = a\n | odd n = memo l (n `div` 2)\n | otherwise = memo r (n `div` 2 - 1)\n\nnats :: Memo Int\nnats =\n Node\n 0\n ((+ 1) . (* 2) <$> nats)\n ((* 2) . (+ 1) <$> nats)\n\n------------------------------------------------------------\n-- calculating partitions\n\npartitions :: Memo Integer\npartitions = partitionP <$> nats\n\npartitionP :: Int -> Integer\npartitionP n\n | n < 2 = 1\n | otherwise = sum $ zipWith (*) signs terms\n where\n terms =\n [ memo partitions (n - i)\n | i <- takeWhile (<= n) ofsets\n ]\n signs = cycle [1, 1, -1, -1]\n\nofsets :: [Int]\nofsets = scanl1 (+) $ mix [1, 3 ..] [1, 2 ..]\n where\n mix a b = concat $ zipWith (\\x y -> [x, y]) a b\n\nmain :: IO ()\nmain = print $ partitionP 6666\n","language":"Haskell"},{"code":" pn =: -/@(+/)@:($:\"0)@rec ` (x:@(0&=)) @. (0>:]) M.\n rec=: - (-: (*\"1) _1 1 +/ 3 * ]) @ (>:@i.@>.@%:@((2%3)&*))\n","language":"J"},{"code":"import java.math.BigInteger;\n\npublic class PartitionFunction {\n public static void main(String[] args) {\n long start = System.currentTimeMillis();\n BigInteger result = partitions(6666);\n long end = System.currentTimeMillis();\n System.out.println(\"P(6666) = \" + result);\n System.out.printf(\"elapsed time: %d milliseconds\\n\", end - start);\n }\n\n private static BigInteger partitions(int n) {\n BigInteger[] p = new BigInteger[n + 1];\n p[0] = BigInteger.ONE;\n for (int i = 1; i <= n; ++i) {\n p[i] = BigInteger.ZERO;\n for (int k = 1; ; ++k) {\n int j = (k * (3 * k - 1))/2;\n if (j > i)\n break;\n if ((k & 1) != 0)\n p[i] = p[i].add(p[i - j]);\n else\n p[i] = p[i].subtract(p[i - j]);\n j += k;\n if (j > i)\n break;\n if ((k & 1) != 0)\n p[i] = p[i].add(p[i - j]);\n else\n p[i] = p[i].subtract(p[i - j]);\n }\n }\n return p[n];\n }\n}\n","language":"Java"},{"code":"function p(n){\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\nvar t = Date.now()\nconsole.log(\"p(6666) = \" + p(6666))\nconsole.log(\"Computation time in ms: \", Date.now() - t)\n","language":"JavaScript"},{"code":"def partitions($n):\n def div2: (. - (.%2)) / 2;\n reduce range(1; $n + 1) as $i ( {p: ([1] + [range(0;$n)|0])};\n . + {k: 0, stop: false}\n | until(.stop;\n .k += 1\n | (((.k * (3*.k - 1)) | div2) ) as $j\n | if $j > $i then .stop=true\n \t else if (.k % 2) == 1\n \t then .p[$i] = .p[$i] + .p[$i - $j]\n else .p[$i] = .p[$i] - .p[$i - $j]\n end\n | (((.k * (3*.k + 1)) | div2)) as $j\n | if $j > $i then .stop=true\n elif (.k % 2) == 1\n then .p[$i] = .p[$i] + .p[$i - $j]\n else .p[$i] = .p[$i] - .p[$i - $j]\n \t end\n \tend ))\n | .p[$n] ;\n\n[partitions(range(1;15))]\n","language":"Jq"},{"code":"def partDiffDiff($n):\n if ($n % 2) == 1 then ($n+1) / 2 else $n+1 end;\n\n# in: {n, partDiffMemo}\n# out: object with possibly updated memoization\ndef partDiff:\n .n as $n\n | if .partDiffMemo[$n] then .\n elif $n<2 then .partDiffMemo[$n]=1\n else ((.n=($n-1)) | partDiff)\n | .partDiffMemo[$n] = .partDiffMemo[$n-1] + partDiffDiff($n-1)\n end;\n\n# in: {n, memo, partDiffMemo}\n# where `.memo[i]` memoizes partitions(i)\n# and `.partDiffMemo[i]` memoizes partDiff(i)\n# out: object with possibly updated memoization\ndef partitionsM:\n .n as $n\n | if .memo[$n] then .\n elif $n<2 then .memo[$n] = 1\n else label $out\n | foreach range(1; $n+2) as $i (.emit = false | .psum = 0;\n if $i > $n then .emit = true\n else ((.n = $i) | partDiff)\n\t| .partDiffMemo[$i] as $pd\n | if $pd > $n then .emit=true, break $out\n else {psum, emit} as $local # for restoring relevant state\n\t | ((.n = ($n-$pd)) | partitionsM)\n\t | .memo[$n-$pd] as $increment\n\t | . + $local # restore\n | if (($i-1)%4)<2\n then .psum += $increment\n else .psum -= $increment\n end\n\t end\n end;\n select(.emit) )\n | .memo[$n] = .psum\n end ;\n\ndef partitionsP:\n . as $n\n | {n: $n, memo:[], partDiffMemo:[]}\n | partitionsM\n | .memo[$n];\n\n# Stretch goal:\n6666 | partitionsP\n","language":"Jq"},{"code":"using Memoize\n\nfunction partDiffDiff(n::Int)::Int\n isodd(n) ? (n+1)÷2 : n+1\nend\n\n@memoize function partDiff(n::Int)::Int\n n<2 ? 1 : partDiff(n-1)+partDiffDiff(n-1)\nend\n\n@memoize function partitionsP(n::Int)\n T=BigInt\n if n<2\n one(T)\n else\n psum = zero(T)\n for i ∈ 1:n\n pd = partDiff(i)\n if pd>n\n break\n end\n if ((i-1)%4)<2\n psum += partitionsP(n-pd)\n else\n psum -= partitionsP(n-pd)\n end\n end\n psum\n end\nend\n\nn=6666\n@time println(\"p($n) = \", partitionsP(n))\n","language":"Julia"},{"code":"-- returns number of partitions of n\non partitions(n, res_table)\n if n < 2 then return 1\n if voidP(res_table) then\n res_table = []\n res_table[n] = 0\n else if res_table[n] then\n return res_table[n]\n end if\n res = 0\n i = 0\n param = 1\n repeat while param <= n\n if i mod 4 < 2 then\n res = res + partitions(n - param, res_table)\n else\n res = res - partitions(n - param, res_table)\n end if\n if i mod 2 then\n param = param + i + 2\n else\n param = param + i / 2 + 1\n end if\n i = i + 1\n end repeat\n res_table[n] = res\n return res\nend\n","language":"Lingo"},{"code":"p:=proc(n)\n option remember;\n local k,s:=0,m;\n for k from 1 while (m:=iquo(k*(3*k-1),2))<=n do\n s-=(-1)^k*p(n-m);\n od;\n for k from 1 while (m:=iquo(k*(3*k+1),2))<=n do\n s-=(-1)^k*p(n-m);\n od;\n s\nend:\np(0):=1:\n\ntime(p(6666));\n# 0.796\n\ntime(combinat[numbpart](6666));\n# 0.406\n\np~([$1..20]);\n# [1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627]\n\ncombinat[numbpart]~([$1..20]);\n# [1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627]\n\np(1000)\n# 24061467864032622473692149727991\n\ncombinat[numbpart](1000);\n# 24061467864032622473692149727991\n","language":"Maple"},{"code":"PartitionsP /@ Range[15]\nPartitionsP[666]\nPartitionsP[6666]\n","language":"Mathematica"},{"code":"import sequtils, strformat, times\nimport bignum\n\nfunc partitions(n: int): Int =\n var p = newSeqWith(n + 1, newInt())\n p[0] = newInt(1)\n for i in 1..n:\n var k = 1\n while true:\n var j = k * (3 * k - 1) div 2\n if j > i: break\n if (k and 1) != 0:\n inc p[i], p[i - j]\n else:\n dec p[i], p[i - j]\n j = k * (3 * k + 1) div 2\n if j > i: break\n if (k and 1) != 0:\n inc p[i], p[i - j]\n else:\n dec p[i], p[i - j]\n inc k\n result = p[n]\n\nlet t0 = cpuTime()\necho partitions(6666)\necho &\"Elapsed time: {(cpuTime() - t0) * 1000:.2f} ms\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nno warnings qw(recursion);\nuse Math::AnyNum qw(:overload);\nuse Memoize;\n\nmemoize('partitionsP');\nmemoize('partDiff');\n\nsub partDiffDiff { my($n) = @_; $n%2 != 0 ? ($n+1)/2 : $n+1 }\n\nsub partDiff { my($n) = @_; $n<2 ? 1 : partDiff($n-1) + partDiffDiff($n-1) }\n\nsub partitionsP {\n my($n) = @_;\n return 1 if $n < 2;\n\n my $psum = 0;\n for my $i (1..$n) {\n my $pd = partDiff($i);\n last if $pd > $n;\n if ( (($i-1)%4) < 2 ) { $psum += partitionsP($n-$pd) }\n else { $psum -= partitionsP($n-$pd) }\n }\n return $psum\n}\n\nprint partitionsP($_) . ' ' for 0..25; print \"\\n\";\nprint partitionsP(6666) . \"\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">partDiffDiff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)/(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">partDiff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">pd</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">[$]</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">partDiffDiff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)}</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">partitionsP</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">></span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">nn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">psum</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_init</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">nn</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">partDiff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">nn</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">exit</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">sgn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">remainder</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">2</span> <span style=\"color: #0000FF;\">?</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #0000FF;\">:</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #000000;\">pnmpd</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nn</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">pd</span><span style=\"color: #0000FF;\">)]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">sgn</span><span style=\"color: #0000FF;\">=-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">mpz_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">psum</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">psum</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pnmpd</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">psum</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">psum</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pnmpd</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">pn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">psum</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">pn</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">max</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">t0</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">6666</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"p(%d) = %s (%s)\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">mpz_get_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">partitionsP</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)),</span><span style=\"color: #7060A8;\">elapsed</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">time</span><span style=\"color: #0000FF;\">()-</span><span style=\"color: #000000;\">t0</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"/* Picat 3.0#5 */\n/* Author: Hakan Kjellerstrand */\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 := S - ((-1)**K)*partition1(N-M),\n K := K + 1,\n M := (K*(3*K-1)) // 2\n end,\n K := 1,\n M := (K*(3*K+1)) // 2,\n while (M <= N)\n S := S - ((-1)**K)*partition1(N-M),\n K := K + 1,\n M := (K*(3*K+1)) // 2\n end,\n P = S.\n\nPicat> time(println('p(6666)'=partition1(6666)))\np(6666) = 193655306161707661080005073394486091998480950338405932486880600467114423441282418165863\n\nCPU time 0.206 seconds.\n","language":"Picat"},{"code":"(de gpentagonals (Max)\n (make\n (let (N 0 M 1)\n (loop\n (inc 'N (if (=0 (& M 1)) (>> 1 M) M))\n (T (> N Max))\n (link N)\n (inc 'M)))))\n\n(de p (N)\n (cache '(NIL) N\n (if (=0 N)\n 1\n (let (Sum 0 Sgn 0)\n (for G (gpentagonals N)\n ((if (< Sgn 2) 'inc 'dec) 'Sum (p (- N G)))\n (setq Sgn (& 3 (inc Sgn))))\n Sum))))\n","language":"PicoLisp"},{"code":"/* SWI-Prolog 8.3.21 */\n/* Author: Jan Burse */\n:- table p/2.\np(0, 1) :- !.\np(N, X) :-\n aggregate_all(sum(Z), (between(1,inf,K), M is K*(3*K-1)//2,\n (M>N, !, fail; L is N-M, p(L,Y), Z is (-1)^K*Y)), A),\n aggregate_all(sum(Z), (between(1,inf,K), M is K*(3*K+1)//2,\n (M>N, !, fail; L is N-M, p(L,Y), Z is (-1)^K*Y)), B),\n X is -A-B.\n\n?- time(p(6666,X)).\n% 13,962,294 inferences, 2.610 CPU in 2.743 seconds (95% CPU, 5350059 Lips)\nX = 1936553061617076610800050733944860919984809503384\n05932486880600467114423441282418165863.\n","language":"Prolog"},{"code":"from itertools import islice\n\ndef posd():\n \"diff between position numbers. 1, 2, 3... interleaved with 3, 5, 7...\"\n count, odd = 1, 3\n while True:\n yield count\n yield odd\n count, odd = count + 1, odd + 2\n\ndef pos_gen():\n \"position numbers. 1 3 2 5 7 4 9 ...\"\n val = 1\n diff = posd()\n while True:\n yield val\n val += next(diff)\n\ndef plus_minus():\n \"yield (list_offset, sign) or zero for Partition calc\"\n n, sign = 0, [1, 1]\n p_gen = pos_gen()\n out_on = next(p_gen)\n while True:\n n += 1\n if n == out_on:\n next_sign = sign.pop(0)\n if not sign:\n sign = [-next_sign] * 2\n yield -n, next_sign\n out_on = next(p_gen)\n else:\n yield 0\n\ndef part(n):\n \"Partition numbers\"\n p = [1]\n p_m = plus_minus()\n mods = []\n for _ in range(n):\n next_plus_minus = next(p_m)\n if next_plus_minus:\n mods.append(next_plus_minus)\n p.append(sum(p[offset] * sign for offset, sign in mods))\n return p[-1]\n\nprint(\"(Intermediaries):\")\nprint(\" posd:\", list(islice(posd(), 10)))\nprint(\" pos_gen:\", list(islice(pos_gen(), 10)))\nprint(\" plus_minus:\", list(islice(plus_minus(), 15)))\nprint(\"\\nPartitions:\", [part(x) for x in range(15)])\n","language":"Python"},{"code":"def par_primes():\n \"Prime number generator from the partition machine\"\n p = [1]\n p_m = plus_minus()\n mods = []\n n = 0\n while True:\n n += 1\n next_plus_minus = next(p_m)\n if next_plus_minus:\n mods.append(next_plus_minus)\n p.append(sum(p[offset] * sign for offset, sign in mods))\n if p[0] + 1 == p[-1]:\n yield p[0]\n p[0] += 1\n yield p\n\nprint(\"\\nPrimes:\", list(islice(par_primes(), 15)))\n","language":"Python"},{"code":"from typing import List\n\n\ndef partitions(n: int) -> int:\n \"\"\"Count partitions.\"\"\"\n p: List[int] = [1] + [0] * n\n for i in range(1, n + 1):\n k: int = 0\n while True:\n k += 1\n j: int = (k * (3*k - 1)) // 2\n if (j > i):\n break\n if (k & 1):\n p[i] += p[i - j]\n else:\n p[i] -= p[i - j]\n j = (k * (3*k + 1)) // 2\n if (j > i):\n break\n if (k & 1):\n p[i] += p[i - j]\n else:\n p[i] -= p[i - j]\n\n return p[n]\n\n\nif __name__ == '__main__':\n print(\"\\nPartitions:\", [partitions(x) for x in range(15)])\n","language":"Python"},{"code":" [ 1 swap\n dup 0 = iff drop done\n [ 2dup = iff [ 2drop 1 ] done\n 2dup > iff [ 2drop 0 ] done\n 2dup dip 1+ recurse\n unrot over - recurse + ] ] is partitions ( n --> n )\n\n say \"Partitions of 0 to 29\" cr\n 30 times [ i^ partitions echo sp ]\n","language":"Quackery"},{"code":"#lang racket\n\n(require math/number-theory)\n\n(define σ\n (let ((memo (make-hash)))\n (λ (z)\n (hash-ref! memo z\n (λ () (apply + (divisors z)))))))\n\n(define p\n (let ((memo (make-hash '((0 . 1)))))\n (λ (n)\n (hash-ref!\n memo n\n (λ ()\n (let ((r (if (zero? n) 1\n (/ (for/sum ((k (in-range (sub1 n) -1 -1)))\n (* (σ (- n k))\n (p k)))\n n))))\n (when (zero? (modulo n 1000)) (displayln (cons n r) (current-error-port)))\n r))))))\n\n(map p (range 1 30))\n(p 666)\n(p 1000)\n(p 10000)\n","language":"Racket"},{"code":"my @P = 1, { p(++$) } … *;\nmy @i = lazy [\\+] flat 1, ( 1..* Z (1..*).map: * × 2 + 1 );\nsub p ($n) { sum @P[$n X- @i] Z× (flat (1, 1, -1, -1) xx *) }\n\nput @P[^26];\nput @P[6666];\n","language":"Raku"},{"code":"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\nnumeric digits 1000 /*able to handle some ginormous numbers*/\nparse arg lo hi . /*obtain optional arguments from the CL*/\nif lo=='' | lo==\",\" then lo= 0 /*Not specified? Then use the default.*/\nif hi=='' | hi==\",\" then hi= lo /* \" \" \" \" \" \" */\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*assign default value and low values. */\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /*assign default value and even digits.*/\nw= length( commas(hi) ) /*W: is used for aligning the index. */\n\n do j=lo to hi /*compute a range of partitionsP. */\n say right( commas(j), w) ' ' commas( partP(j) )\n end /*j*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npartP: procedure expose @. !.; parse arg n /*obtain number (index) for computation*/\n if @.n\\==0 then return @.n /*Is it already computed? Return it. */\n #= 0 /*initialize part P number.*/\n do k=1 for n; z= n - (k*3 - 1) * k % 2 /*compute the partition P num*/\n if z<0 then leave /*Is Z negative? Then leave.*/\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\n else x= @.z /*use the pre─computed number*/\n z= z - k /*subtract index (K) from Z. */\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\n else y= @.z /*use the pre─computed number*/\n if k//2 then #= # + x + y /*Odd? Then sum X and Y.*/\n else #= # - (x + y) /*Even? \" subtract \" \" \" */\n end /*k*/\n @.n= #; return # /*define and return partitionsP of N. */\n","language":"REXX"},{"code":"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\nnumeric digits 1000 /*able to handle some ginormous numbers*/\nparse arg lo hi . /*obtain optional arguments from the CL*/\nif lo=='' | lo==\",\" then lo= 0 /*Not specified? Then use the default.*/\nif hi=='' | hi==\",\" then hi= lo /* \" \" \" \" \" \" */\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*default values for some low numbers. */\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /* \" \" \" all the 1─digit #s*/\nw= length( commas(hi) ) /*W: is used for aligning the index. */\n\n do j=lo to hi /*compute a range of partitionsP. */\n say right( commas(j), w) ' ' commas( partP(j) )\n end /*j*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npartP: procedure expose @. !.; parse arg n /*obtain number (index) for computation*/\n if @.n\\==0 then return @.n /*Is it already computed? Return it. */\n #= 0 /*initialize part P number.*/\n do k=1 for n; z= n - (k+k+k - 1) * k % 2 /*compute the partition P num*/\n if z<0 then leave /*Is Z negative? Then leave.*/\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\n else x= @.z /*use the pre─computed number*/\n z= z - k /*subtract index (K) from Z. */\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\n else y= @.z /*use the pre─computed number*/\n parse var k '' -1 _ /*obtain K's last decimal dig*/\n if !._ then #= # + x + y /*Odd? Then sum X and Y.*/\n else #= # - (x + y) /*Even? \" subtract \" \" \" */\n end /*k*/\n @.n= #; return # /*define and return partitionsP of N. */\n","language":"REXX"},{"code":"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\nnumeric digits 1000 /*able to handle some ginormous numbers*/\nparse arg lo hi . /*obtain optional arguments from the CL*/\nif lo=='' | lo==\",\" then lo= 0 /*Not specified? Then use the default.*/\nif hi=='' | hi==\",\" then hi= lo /* \" \" \" \" \" \" */\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*default values for some low numbers. */\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /* \" \" \" all the 1─digit #s*/\nw= length( commas(hi) ) /*W: is used for aligning the index. */\n do i=1 for hi; a.i= (i+i+i - 1) * i % 2 /*calculate HI expressions (for partP).*/\n end /*i*/\n\n do j=lo to hi /*compute a range of partitionsP. */\n say right( commas(j), w) ' ' commas( partP(j) )\n end /*j*/\nexit 0 /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\n/*──────────────────────────────────────────────────────────────────────────────────────*/\npartP: procedure expose @. !. a.; parse arg n /*obtain number (index) for computation*/\n if @.n\\==0 then return @.n /*Is it already computed? Return it. */\n #= 0 /*initialize part P number.*/\n do k=1 for n; z= n - a.k /*compute the partition P num*/\n if z<0 then leave /*Is Z negative? Then leave.*/\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\n else x= @.z /*use the pre─computed number*/\n z= z - k /*subtract index (K) from Z. */\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\n else y= @.z /*use the pre─computed number*/\n parse var k '' -1 _ /*obtain K's last decimal dig*/\n if !._ then #= # + x + y /*Odd? Then sum X and Y.*/\n else #= # - (x + y) /*Even? \" subtract \" \" \" */\n end /*k*/\n @.n= #; return # /*define and return partitionsP of N. */\n","language":"REXX"},{"code":"// [dependencies]\n// rug = \"1.11\"\n\nuse rug::Integer;\n\nfn partitions(n: usize) -> Integer {\n let mut p = Vec::with_capacity(n + 1);\n p.push(Integer::from(1));\n for i in 1..=n {\n let mut num = Integer::from(0);\n let mut k = 1;\n loop {\n let mut j = (k * (3 * k - 1)) / 2;\n if j > i {\n break;\n }\n if (k & 1) == 1 {\n num += &p[i - j];\n } else {\n num -= &p[i - j];\n }\n j += k;\n if j > i {\n break;\n }\n if (k & 1) == 1 {\n num += &p[i - j];\n } else {\n num -= &p[i - j];\n }\n k += 1;\n }\n p.push(num);\n }\n p[n].clone()\n}\n\nfn main() {\n use std::time::Instant;\n let n = 6666;\n let now = Instant::now();\n let result = partitions(n);\n let time = now.elapsed();\n println!(\"P({}) = {}\", n, result);\n println!(\"elapsed time: {} microseconds\", time.as_micros());\n}\n","language":"Rust"},{"code":"say partitions(6666) # very fast\n","language":"Sidef"},{"code":"func partitionsP(n) {\n func (n) is cached {\n\n n <= 1 && return n\n\n var a = sum(1..floor((sqrt(24*n + 1) + 1)/6), {|k|\n (-1)**(k-1) * __FUNC__(n - ((k*(3*k - 1)) >> 1))\n })\n\n var b = sum(1..ceil((sqrt(24*n + 1) - 7)/6), {|k|\n (-1)**(k-1) * __FUNC__(n - ((k*(3*k + 1)) >> 1))\n })\n\n a + b\n }(n+1)\n}\n\nvar t = Time.micro\n\nsay partitionsP.map(0..25).join(' ')\nsay partitionsP(6666)\n\nsay (\"Took %.4f seconds\" % Time.micro-t)\n","language":"Sidef"},{"code":"import BigInt\n\nfunc partitions(n: Int) -> BigInt {\n var p = [BigInt(1)]\n\n for i in 1...n {\n var num = BigInt(0)\n var k = 1\n\n while true {\n var j = (k * (3 * k - 1)) / 2\n\n if j > i {\n break\n }\n\n if k & 1 == 1 {\n num += p[i - j]\n } else {\n num -= p[i - j]\n }\n\n j += k\n\n if j > i {\n break\n }\n\n if k & 1 == 1 {\n num += p[i - j]\n } else {\n num -= p[i - j]\n }\n\n k += 1\n }\n\n p.append(num)\n }\n\n return p[n]\n}\n\nprint(\"partitions(6666) = \\(partitions(n: 6666))\")\n","language":"Swift"},{"code":"import \"./big\" for BigInt\n\nvar p = []\nvar pd = []\n\nvar partDiffDiff = Fn.new { |n| (n&1 == 1) ? (n + 1)/2 : n + 1 }\n\nvar partDiff = Fn.new { |n|\n if (n < 2) return 1\n pd[n] = pd[n-1] + partDiffDiff.call(n-1)\n return pd[n]\n}\n\nvar partitionsP = Fn.new { |n|\n if (n < 2) return\n var psum = BigInt.zero\n for (i in 1..n) {\n var pdi = partDiff.call(i)\n if (pdi > n) break\n var sign = (i-1)%4 < 2 ? 1 : -1\n psum = psum + p[n-pdi] * sign\n }\n p[n] = psum\n}\n\nvar start = System.clock\nvar N = 6666\np = List.filled(N+1, null)\npd = List.filled(N+1, 0)\np[0] = BigInt.one\np[1] = BigInt.one\npd[0] = 1\npd[1] = 1\nfor (n in 2..N) partitionsP.call(n)\nSystem.print(\"p[%(N)] = %(p[N])\")\nSystem.print(\"Took %(System.clock - start) seconds\")\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\ncategory:\\n- Memoization\\nfrom: http://rosettacode.org/wiki/Partition_function_P\\nnote: Recursion\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"The [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P] is the function P(n), where n∈ℤ, defined as the number of distinct ways in which n can be expressed as the sum of non-increasing positive integers. \\n\\n\\n;Example:\\n P(4) = 5 because 4 = <big>Σ</big>(4) = <big>Σ</big>(3,1) = <big>Σ</big>(2,2) = <big>Σ</big>(2,1,1) = <big>Σ</big>(1,1,1,1)\\n\\n\\nP(n) can be expressed as the recurrence relation: \\n P(n) = P(n-1) +P(n-2) -P(n-5) -P(n-7) +P(n-12) +P(n-15) -P(n-22) -P(n-26) +P(n-35) +P(n-40) ...\\n\\nThe successive numbers in the above equation have the differences: 1, 3, 2, 5, 3, 7, 4, 9, 5, 11, 6, 13, 7, 15, 8 ...\\n\\nThis task may be of popular interest because [https://www.youtube.com/channel/UC1_uAIS3r8Vu6JjXWvastJg Mathologer] made the video, [https://www.youtube.com/watch?v=iJ8pnCO0nTY The hardest \\\"What comes next?\\\" (Euler's pentagonal formula)], where he asks the programmers among his viewers to calculate P(666). The video was viewed more than 100,000 times in the first couple of weeks after its release.\\n\\nIn Wolfram Language, this function has been implemented as PartitionsP.\\n\\n\\n;Task:\\nWrite a function which returns the value of PartitionsP(n). Solutions can be iterative or recursive. \\n\\nBonus task: show how long it takes to compute PartitionsP(6666).\\n\\n\\n;References:\\n* [https://www.youtube.com/watch?v=iJ8pnCO0nTY The hardest \\\"What comes next?\\\" (Euler's pentagonal formula)] The explanatory video by Mathologer that makes this task a popular interest.\\n* [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P] Mathworld entry for the Partition function.\\n* [[wp:Partition_function_(number_theory)|Partition function (number theory)]] Wikipedia entry for the Partition function.\\n\\n\\n;Related tasks:\\n* [[9 billion names of God the integer]]\\n\\n<br><br>\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F partitions(n)\\n V p = [BigInt(1)] [+] [BigInt(0)] * n\\n L(i) 1 .. n\\n V k = 0\\n L\\n k++\\n V j = (k * (3 * k - 1)) I/ 2\\n I j > i\\n L.break\\n I k [&] 1\\n p[i] += p[i - j]\\n E\\n p[i] -= p[i - j]\\n j = (k * (3 * k + 1)) I/ 2\\n I j > i\\n L.break\\n I k [&] 1\\n p[i] += p[i - j]\\n E\\n p[i] -= p[i - j]\\n R p[n]\\n\\nprint(‘Partitions: ’(0.<15).map(x -> partitions(x)))\\n\\nV start = time:perf_counter()\\nprint(partitions(6666))\\nprint(time:perf_counter() - start)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <stdint.h>\\n#include <stdlib.h>\\n#include <stdio.h>\\n#include <time.h>\\n#include <gmp.h>\\n\\nmpz_t* partition(uint64_t n) {\\n\\tmpz_t *pn = (mpz_t *)malloc((n + 2) * sizeof(mpz_t));\\n\\tmpz_init_set_ui(pn[0], 1);\\n\\tmpz_init_set_ui(pn[1], 1);\\n\\tfor (uint64_t i = 2; i < n + 2; i ++) {\\n\\t\\tmpz_init(pn[i]);\\n\\t\\tfor (uint64_t k = 1, penta; ; k++) {\\n\\t\\t\\tpenta = k * (3 * k - 1) >> 1;\\n\\t\\t\\tif (penta >= i) break;\\n\\t\\t\\tif (k & 1) mpz_add(pn[i], pn[i], pn[i - penta]);\\n\\t\\t\\telse mpz_sub(pn[i], pn[i], pn[i - penta]);\\n\\t\\t\\tpenta += k;\\n\\t\\t\\tif (penta >= i) break;\\n\\t\\t\\tif (k & 1) mpz_add(pn[i], pn[i], pn[i - penta]);\\n\\t\\t\\telse mpz_sub(pn[i], pn[i], pn[i - penta]);\\n\\t\\t}\\n\\t}\\n\\tmpz_t *tmp = &pn[n + 1];\\n\\tfor (uint64_t i = 0; i < n + 1; i ++) mpz_clear(pn[i]);\\n\\tfree(pn);\\n\\treturn tmp;\\n}\\n\\nint main(int argc, char const *argv[]) {\\n\\tclock_t start = clock();\\n\\tmpz_t *p = partition(6666);\\n\\tgmp_printf(\\\"%Zd\\\\n\\\", p);\\n\\tprintf(\\\"Elapsed time: %.04f seconds\\\\n\\\",\\n\\t\\t(double)(clock() - start) / (double)CLOCKS_PER_SEC);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <chrono>\\n#include <iostream>\\n#include <vector>\\n#include <gmpxx.h>\\n\\nusing big_int = mpz_class;\\n\\nbig_int partitions(int n) {\\n std::vector<big_int> p(n + 1);\\n p[0] = 1;\\n for (int i = 1; i <= n; ++i) {\\n for (int k = 1;; ++k) {\\n int j = (k * (3*k - 1))/2;\\n if (j > i)\\n break;\\n if (k & 1)\\n p[i] += p[i - j];\\n else\\n p[i] -= p[i - j];\\n j = (k * (3*k + 1))/2;\\n if (j > i)\\n break;\\n if (k & 1)\\n p[i] += p[i - j];\\n else\\n p[i] -= p[i - j];\\n }\\n }\\n return p[n];\\n}\\n\\nint main() {\\n auto start = std::chrono::steady_clock::now();\\n auto result = partitions(6666);\\n auto end = std::chrono::steady_clock::now();\\n std::chrono::duration<double, std::milli> ms(end - start);\\n std::cout << result << '\\\\n';\\n std::cout << \\\"elapsed time: \\\" << ms.count() << \\\" milliseconds\\\\n\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"#include <chrono>\\n#include <iostream>\\n\\nusing namespace std;\\nusing namespace chrono;\\n\\nconst long long Lm = (long)1e18;\\nconst int Fm = 18;\\n\\nstruct LI { long long lo, ml, mh, hi, tp; };\\n\\nLI set(long long s) { LI d;\\n d.lo = s; d.ml = d.mh = d.hi = d.tp = 0; return d; }\\n\\nvoid inc(LI& d, LI s) { // d += s\\n if ((d.lo += s.lo) >= Lm) { d.ml++; d.lo -= Lm; }\\n if ((d.ml += s.ml) >= Lm) { d.mh++; d.ml -= Lm; }\\n if ((d.mh += s.mh) >= Lm) { d.hi++; d.mh -= Lm; }\\n if ((d.hi += s.hi) >= Lm) { d.tp++; d.hi -= Lm; }\\n d.tp += s.tp;\\n}\\n\\nvoid dec(LI& d, LI s) { // d -= s\\n if ((d.lo -= s.lo) < 0) { d.ml--; d.lo += Lm; }\\n if ((d.ml -= s.ml) < 0) { d.mh--; d.ml += Lm; }\\n if ((d.mh -= s.mh) < 0) { d.hi--; d.mh += Lm; }\\n if ((d.hi -= s.hi) < 0) { d.tp--; d.hi += Lm; }\\n d.tp -= s.tp;\\n}\\n\\ninline string sf(long long n) {\\n int len = Fm;\\n string result(len--, '0');\\n for (long long i = n; len >= 0 && i > 0; --len, i /= 10)\\n result[len] = '0' + i % 10;\\n return result;\\n}\\n\\nstring fmt(LI x) { // returns formatted string value of x\\n if (x.tp > 0) return to_string(x.tp) + sf(x.hi) + sf(x.mh) + sf(x.ml) + sf(x.lo);\\n if (x.hi > 0) return to_string(x.hi) + sf(x.mh) + sf(x.ml) + sf(x.lo);\\n if (x.mh > 0) return to_string(x.mh) + sf(x.ml) + sf(x.lo);\\n if (x.ml > 0) return to_string(x.ml) + sf(x.lo);\\n return to_string(x.lo);\\n}\\n\\nLI partcount(int n) { LI p[n + 1]; p[0] = set(1);\\n for (int i = 1; i <= n; i++) {\\n int k = 0, d = -2, j = i; LI x = set(0); while (true) {\\n if ((j -= (d += 3) - k) >= 0) inc(x, p[j]); else break;\\n if ((j -= ++k) >= 0) inc(x, p[j]); else break;\\n if ((j -= (d += 3) - k) >= 0) dec(x, p[j]); else break;\\n if ((j -= ++k) >= 0) dec(x, p[j]); else break;\\n } p[i] = x; } return p[n]; }\\n\\nint main() {\\n auto start = steady_clock::now();\\n auto result = partcount(6666);\\n auto end = steady_clock::now();\\n duration<double, milli> ms(end - start);\\n cout << fmt(result) << \\\" \\\" << ms.count() << \\\" ms\\\";\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nclass Program {\\n\\n const long Lm = (long)1e18;\\n const string Fm = \\\"D18\\\";\\n\\n // provides 5 x 18 = 90 decimal digits\\n struct LI { public long lo, ml, mh, hi, tp; }\\n\\n static void inc(ref LI d, LI s) { // d += s\\n if ((d.lo += s.lo) >= Lm) { d.ml++; d.lo -= Lm; }\\n if ((d.ml += s.ml) >= Lm) { d.mh++; d.ml -= Lm; }\\n if ((d.mh += s.mh) >= Lm) { d.hi++; d.mh -= Lm; }\\n if ((d.hi += s.hi) >= Lm) { d.tp++; d.hi -= Lm; }\\n d.tp += s.tp;\\n }\\n\\n static void dec(ref LI d, LI s) { // d -= s\\n if ((d.lo -= s.lo) < 0) { d.ml--; d.lo += Lm; }\\n if ((d.ml -= s.ml) < 0) { d.mh--; d.ml += Lm; }\\n if ((d.mh -= s.mh) < 0) { d.hi--; d.mh += Lm; }\\n if ((d.hi -= s.hi) < 0) { d.tp--; d.hi += Lm; }\\n d.tp -= s.tp;\\n }\\n\\n static LI set(long s) { LI d;\\n d.lo = s; d.ml = d.mh = d.hi = d.tp = 0; return d; }\\n\\n static string fmt(LI x) { // returns formatted string value of x\\n if (x.tp > 0) return x.tp.ToString() + x.hi.ToString(Fm) + x.mh.ToString(Fm) + x.ml.ToString(Fm) + x.lo.ToString(Fm);\\n if (x.hi > 0) return x.hi.ToString() + x.mh.ToString(Fm) + x.ml.ToString(Fm) + x.lo.ToString(Fm);\\n if (x.mh > 0) return x.mh.ToString() + x.ml.ToString(Fm) + x.lo.ToString(Fm);\\n if (x.ml > 0) return x.ml.ToString() + x.lo.ToString(Fm);\\n return x.lo.ToString();\\n }\\n\\n static LI partcount(int n) {\\n var P = new LI[n + 1]; P[0] = set(1);\\n for (int i = 1; i <= n; i++) {\\n int k = 0, d = -2, j = i;\\n LI x = set(0);\\n while (true) {\\n if ((j -= (d += 3) -k) >= 0) inc(ref x, P[j]); else break;\\n if ((j -= ++k) >= 0) inc(ref x, P[j]); else break;\\n if ((j -= (d += 3) -k) >= 0) dec(ref x, P[j]); else break;\\n if ((j -= ++k) >= 0) dec(ref x, P[j]); else break;\\n }\\n P[i] = x;\\n }\\n return P[n];\\n }\\n\\n static void Main(string[] args) {\\n var sw = System.Diagnostics.Stopwatch.StartNew ();\\n var res = partcount(6666); sw.Stop();\\n Console.Write(\\\"{0} {1} ms\\\", fmt(res), sw.Elapsed.TotalMilliseconds);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"program Partition_function_P;\\n\\n{$APPTYPE CONSOLE}\\n\\nuses\\n System.SysUtils,\\n Velthuis.BigIntegers,\\n System.Diagnostics;\\n\\nvar\\n p: TArray<BigInteger>;\\n pd: TArray<Integer>;\\n\\nfunction PartiDiffDiff(n: Integer): Integer;\\nbegin\\n if n and 1 = 1 then\\n exit((n + 1) div 2);\\n Result := n + 1;\\nend;\\n\\nfunction partDiff(n: Integer): Integer;\\nbegin\\n if n < 2 then\\n exit(1);\\n\\n pd[n] := pd[n - 1] + PartiDiffDiff(n - 1);\\n Result := pd[n];\\nend;\\n\\nprocedure partitionP(n: Integer);\\nbegin\\n if n < 2 then\\n exit;\\n\\n var psum: BigInteger := 0;\\n for var i := 1 to n do\\n begin\\n var pdi := partDiff(i);\\n if pdi > n then\\n Break;\\n\\n var sign: Int64 := -1;\\n\\n if (i - 1) mod 4 < 2 then\\n sign := 1;\\n\\n var t: BigInteger := BigInteger(p[n - pdi]) * BigInteger(sign);\\n psum := psum + t;\\n end;\\n p[n] := psum;\\nend;\\n\\nbegin\\n var stopwatch := TStopwatch.Create;\\n const n = 6666;\\n SetLength(p, n + 1);\\n SetLength(pd, n + 1);\\n stopwatch.Start;\\n p[0] := 1;\\n pd[0] := 1;\\n p[1] := 1;\\n pd[1] := 1;\\n for var i := 2 to n do\\n partitionP(i);\\n stopwatch.Stop;\\n writeln(format('p[%d] = %s', [n, p[n].ToString]));\\n writeln('Took ', stopwatch.ElapsedMilliseconds, 'ms');\\n Readln;\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"use Bitwise, skip_operators: true\\n\\ndefmodule Partition do\\n def init(), do:\\n :ets.new :pN, [:set, :named_table, :private]\\n\\n def gpentagonals(), do: Stream.unfold {1, 0}, &next/1\\n defp next({m, n}) do\\n a = case rem m, 2 do\\n 0 -> div m, 2\\n 1 -> m\\n end\\n {n, {m + 1, n + a}}\\n end\\n\\n def p(0), do: 1\\n def p(n) do\\n case :ets.lookup :pN, n do\\n [{^n, val}] -> val\\n [] ->\\n {val, _} = gpentagonals()\\n |> Stream.drop(1)\\n |> Stream.take_while(fn m -> m <= n end)\\n |> Stream.map(fn g -> p(n - g) end)\\n |> Enum.reduce({0, 0},\\n fn n, {a, sgn} -> {\\n a + (if sgn < 2, do: n, else: -n),\\n band(sgn + 1, 3)\\n }\\n end)\\n :ets.insert :pN, {n, val}\\n val\\n end\\n end\\nend\\n\\nPartition.init\\nIO.puts Partition.p 6666\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"-mode(compile).\\n\\nmain(_) ->\\n ets:new(pN, [set, named_table, protected]),\\n io:format(\\\"~w~n\\\", [p(6666)]).\\n\\np(0) -> 1;\\np(N) ->\\n case ets:lookup(pN, N) of\\n [{N, Pn}] -> Pn;\\n [] ->\\n Terms = [p(N - G) || G <- gpentagonals(N)],\\n Pn = sum_partitions(Terms),\\n ets:insert(pN, {N, Pn}),\\n Pn\\n end.\\n\\nsum_partitions(Terms) -> sum_partitions(Terms, 0, 0).\\nsum_partitions([], _, Sum) -> Sum;\\nsum_partitions([N|Ns], Sgn, Sum) ->\\n Summand = case Sgn < 2 of\\n true -> N;\\n false -> -N\\n end,\\n sum_partitions(Ns, (Sgn+1) band 3, Sum + Summand).\\n\\ngpentagonals(Max) -> gpentagonals(1, Max, [0]).\\ngpentagonals(M, Max, Ps = [N|_]) ->\\n GP = N + case M rem 2 of\\n 0 -> M div 2;\\n 1 -> M\\n end,\\n if\\n GP > Max -> tl(lists:reverse(Ps));\\n true -> gpentagonals(M + 1, Max, [GP|Ps])\\n end.\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"// PartionP: Nigel Galloway. April 12th., 2021\\nlet pP g=let rec fN i g e l=seq{yield(l,e+i);yield(-l,e+i+g);yield! fN(i+1)(g+2)(e+i+g)(-l)}\\n let N,G=Array.create(g+1) 1I,seq{yield (1I,1);yield! fN 1 3 1 1I}|>Seq.takeWhile(fun(_,n)->n<=g)|>List.ofSeq\\n seq{2..g}|>Seq.iter(fun p->N.[p]<-G|>List.takeWhile(fun(_,n)->n<=p)|>Seq.fold(fun Σ (n,g)->Σ+n*N.[p-g]) 0I); N.[g]\\nprintfn \\\"666->%A\\\\n\\\\n6666->%A\\\\n\\\\n123456->%A\\\" (pP 666) (pP 6666) (pP 123456)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: kernel lists lists.lazy math sequences sequences.extras ;\\n\\n! Compute the nth pentagonal number.\\n: penta ( n -- m ) [ sq 3 * ] [ - 2/ ] bi ;\\n\\n! An infinite lazy list of indices to add and subtract in the\\n! sequence of partitions to find the next P.\\n: seq ( -- list )\\n 1 lfrom [ penta 1 - ] <lazy-map> 1 lfrom [ neg penta 1 - ]\\n <lazy-map> lmerge ;\\n\\n! Reduce a sequence by adding two, subtracting two, adding two,\\n! etc...\\n: ++-- ( seq -- n ) 0 [ 2/ odd? [ - ] [ + ] if ] reduce-index ;\\n\\n! Find the next member of the partitions sequence.\\n: step ( seq pseq -- seq 'pseq )\\n dup length [ < ] curry pick swap take-while over <reversed>\\n nths ++-- suffix! ;\\n\\n: partitions ( m -- n )\\n [ seq swap [ <= ] curry lwhile list>array ]\\n [ V{ 1 } clone swap [ step ] times last nip ] bi ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Function PartitionsP(n As UInteger) As ULongInt\\n ' if n > 416, the result becomes to large for a unsigned 64bit integer\\n Dim As ULongInt p(n)\\n Dim As UInteger k, j\\n\\n p(0) = 1\\n For i As UInteger = 1 To n\\n k = 0\\n While TRUE\\n k += 1\\n j = (k * (3*k - 1)) \\\\ 2\\n If (j > i) Then Exit While\\n If (k And 1) Then\\n p(i) += p(i - j)\\n Else\\n p(i) -= p(i - j)\\n End If\\n 'j = (k * (3*k + 1)) \\\\ 2\\n j += k\\n If (j > i) Then Exit While\\n If (k And 1) Then\\n p(i) += p(i - j)\\n Else\\n p(i) -= p(i - j)\\n End If\\n Wend\\n Next i\\n Return p(n)\\nEnd Function\\n\\nPrint !\\\"\\\\nPartitionsP: \\\";\\nFor x As UInteger = 0 To 12\\n Print PartitionsP(x);\\\" \\\";\\nNext x\\n\\nPrint !\\\"\\\\n\\\\ndone\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"' version 26-06-2021\\n' compile with: fbc -s console\\n\\n#Include Once \\\"gmp.bi\\\"\\n\\nSub PartitionsP(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\\n#Define max 6666\\n\\nDim As UInteger n\\nDim As ZString Ptr ans\\nDim As Double t = Timer\\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\\nPartitionsP(max, big_p())\\nans = Mpz_get_str (0, 10, big_p(max))\\nPrint \\\"PartitionsP(\\\"; Str(max); \\\") = \\\"; \\\" \\\"; *ans\\n\\nFor n = 0 To max\\n Mpz_clear(big_p(n))\\nNext\\n\\nPrint Using \\\"time = ###.## ms\\\"; (Timer - t) * 1000\\n\\n' empty keyboard buffer\\nWhile InKey <> \\\"\\\" : Wend\\nPrint : Print \\\"hit any key to end program\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"println[partitionCount[6666]]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n \\\"time\\\"\\n)\\n\\nvar p []*big.Int\\nvar pd []int\\n\\nfunc partDiffDiff(n int) int {\\n if n&1 == 1 {\\n return (n + 1) / 2\\n }\\n return n + 1\\n}\\n\\nfunc partDiff(n int) int {\\n if n < 2 {\\n return 1\\n }\\n pd[n] = pd[n-1] + partDiffDiff(n-1)\\n return pd[n]\\n}\\n\\nfunc partitionsP(n int) {\\n if n < 2 {\\n return\\n }\\n psum := new(big.Int)\\n for i := 1; i <= n; i++ {\\n pdi := partDiff(i)\\n if pdi > n {\\n break\\n }\\n sign := int64(-1)\\n if (i-1)%4 < 2 {\\n sign = 1\\n }\\n t := new(big.Int).Mul(p[n-pdi], big.NewInt(sign))\\n psum.Add(psum, t)\\n }\\n p[n] = psum\\n}\\n\\nfunc main() {\\n start := time.Now()\\n const N = 6666\\n p = make([]*big.Int, N+1)\\n pd = make([]int, N+1)\\n p[0], pd[0] = big.NewInt(1), 1\\n p[1], pd[1] = big.NewInt(1), 1\\n for n := 2; n <= N; n++ {\\n partitionsP(n)\\n }\\n fmt.Printf(\\\"p[%d)] = %d\\\\n\\\", N, p[N])\\n fmt.Printf(\\\"Took %s\\\\n\\\", time.Since(start))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE DeriveFunctor #-}\\n\\n------------------------------------------------------------\\n-- memoization utilities\\n\\ndata Memo a = Node a (Memo a) (Memo a)\\n deriving (Functor)\\n\\nmemo :: Integral a => Memo p -> a -> p\\nmemo (Node a l r) n\\n | n == 0 = a\\n | odd n = memo l (n `div` 2)\\n | otherwise = memo r (n `div` 2 - 1)\\n\\nnats :: Memo Int\\nnats =\\n Node\\n 0\\n ((+ 1) . (* 2) <$> nats)\\n ((* 2) . (+ 1) <$> nats)\\n\\n------------------------------------------------------------\\n-- calculating partitions\\n\\npartitions :: Memo Integer\\npartitions = partitionP <$> nats\\n\\npartitionP :: Int -> Integer\\npartitionP n\\n | n < 2 = 1\\n | otherwise = sum $ zipWith (*) signs terms\\n where\\n terms =\\n [ memo partitions (n - i)\\n | i <- takeWhile (<= n) ofsets\\n ]\\n signs = cycle [1, 1, -1, -1]\\n\\nofsets :: [Int]\\nofsets = scanl1 (+) $ mix [1, 3 ..] [1, 2 ..]\\n where\\n mix a b = concat $ zipWith (\\\\x y -> [x, y]) a b\\n\\nmain :: IO ()\\nmain = print $ partitionP 6666\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" pn =: -/@(+/)@:($:\\\"0)@rec ` (x:@(0&=)) @. (0>:]) M.\\n rec=: - (-: (*\\\"1) _1 1 +/ 3 * ]) @ (>:@i.@>.@%:@((2%3)&*))\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigInteger;\\n\\npublic class PartitionFunction {\\n public static void main(String[] args) {\\n long start = System.currentTimeMillis();\\n BigInteger result = partitions(6666);\\n long end = System.currentTimeMillis();\\n System.out.println(\\\"P(6666) = \\\" + result);\\n System.out.printf(\\\"elapsed time: %d milliseconds\\\\n\\\", end - start);\\n }\\n\\n private static BigInteger partitions(int n) {\\n BigInteger[] p = new BigInteger[n + 1];\\n p[0] = BigInteger.ONE;\\n for (int i = 1; i <= n; ++i) {\\n p[i] = BigInteger.ZERO;\\n for (int k = 1; ; ++k) {\\n int j = (k * (3 * k - 1))/2;\\n if (j > i)\\n break;\\n if ((k & 1) != 0)\\n p[i] = p[i].add(p[i - j]);\\n else\\n p[i] = p[i].subtract(p[i - j]);\\n j += k;\\n if (j > i)\\n break;\\n if ((k & 1) != 0)\\n p[i] = p[i].add(p[i - j]);\\n else\\n p[i] = p[i].subtract(p[i - j]);\\n }\\n }\\n return p[n];\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"function p(n){\\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\\nvar t = Date.now()\\nconsole.log(\\\"p(6666) = \\\" + p(6666))\\nconsole.log(\\\"Computation time in ms: \\\", Date.now() - t)\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"def partitions($n):\\n def div2: (. - (.%2)) / 2;\\n reduce range(1; $n + 1) as $i ( {p: ([1] + [range(0;$n)|0])};\\n . + {k: 0, stop: false}\\n | until(.stop;\\n .k += 1\\n | (((.k * (3*.k - 1)) | div2) ) as $j\\n | if $j > $i then .stop=true\\n \\t else if (.k % 2) == 1\\n \\t then .p[$i] = .p[$i] + .p[$i - $j]\\n else .p[$i] = .p[$i] - .p[$i - $j]\\n end\\n | (((.k * (3*.k + 1)) | div2)) as $j\\n | if $j > $i then .stop=true\\n elif (.k % 2) == 1\\n then .p[$i] = .p[$i] + .p[$i - $j]\\n else .p[$i] = .p[$i] - .p[$i - $j]\\n \\t end\\n \\tend ))\\n | .p[$n] ;\\n\\n[partitions(range(1;15))]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def partDiffDiff($n):\\n if ($n % 2) == 1 then ($n+1) / 2 else $n+1 end;\\n\\n# in: {n, partDiffMemo}\\n# out: object with possibly updated memoization\\ndef partDiff:\\n .n as $n\\n | if .partDiffMemo[$n] then .\\n elif $n<2 then .partDiffMemo[$n]=1\\n else ((.n=($n-1)) | partDiff)\\n | .partDiffMemo[$n] = .partDiffMemo[$n-1] + partDiffDiff($n-1)\\n end;\\n\\n# in: {n, memo, partDiffMemo}\\n# where `.memo[i]` memoizes partitions(i)\\n# and `.partDiffMemo[i]` memoizes partDiff(i)\\n# out: object with possibly updated memoization\\ndef partitionsM:\\n .n as $n\\n | if .memo[$n] then .\\n elif $n<2 then .memo[$n] = 1\\n else label $out\\n | foreach range(1; $n+2) as $i (.emit = false | .psum = 0;\\n if $i > $n then .emit = true\\n else ((.n = $i) | partDiff)\\n\\t| .partDiffMemo[$i] as $pd\\n | if $pd > $n then .emit=true, break $out\\n else {psum, emit} as $local # for restoring relevant state\\n\\t | ((.n = ($n-$pd)) | partitionsM)\\n\\t | .memo[$n-$pd] as $increment\\n\\t | . + $local # restore\\n | if (($i-1)%4)<2\\n then .psum += $increment\\n else .psum -= $increment\\n end\\n\\t end\\n end;\\n select(.emit) )\\n | .memo[$n] = .psum\\n end ;\\n\\ndef partitionsP:\\n . as $n\\n | {n: $n, memo:[], partDiffMemo:[]}\\n | partitionsM\\n | .memo[$n];\\n\\n# Stretch goal:\\n6666 | partitionsP\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Memoize\\n\\nfunction partDiffDiff(n::Int)::Int\\n isodd(n) ? (n+1)÷2 : n+1\\nend\\n\\n@memoize function partDiff(n::Int)::Int\\n n<2 ? 1 : partDiff(n-1)+partDiffDiff(n-1)\\nend\\n\\n@memoize function partitionsP(n::Int)\\n T=BigInt\\n if n<2\\n one(T)\\n else\\n psum = zero(T)\\n for i ∈ 1:n\\n pd = partDiff(i)\\n if pd>n\\n break\\n end\\n if ((i-1)%4)<2\\n psum += partitionsP(n-pd)\\n else\\n psum -= partitionsP(n-pd)\\n end\\n end\\n psum\\n end\\nend\\n\\nn=6666\\n@time println(\\\"p($n) = \\\", partitionsP(n))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"-- returns number of partitions of n\\non partitions(n, res_table)\\n if n < 2 then return 1\\n if voidP(res_table) then\\n res_table = []\\n res_table[n] = 0\\n else if res_table[n] then\\n return res_table[n]\\n end if\\n res = 0\\n i = 0\\n param = 1\\n repeat while param <= n\\n if i mod 4 < 2 then\\n res = res + partitions(n - param, res_table)\\n else\\n res = res - partitions(n - param, res_table)\\n end if\\n if i mod 2 then\\n param = param + i + 2\\n else\\n param = param + i / 2 + 1\\n end if\\n i = i + 1\\n end repeat\\n res_table[n] = res\\n return res\\nend\\n\",\n \"language\": \"Lingo\"\n },\n {\n \"code\": \"p:=proc(n)\\n option remember;\\n local k,s:=0,m;\\n for k from 1 while (m:=iquo(k*(3*k-1),2))<=n do\\n s-=(-1)^k*p(n-m);\\n od;\\n for k from 1 while (m:=iquo(k*(3*k+1),2))<=n do\\n s-=(-1)^k*p(n-m);\\n od;\\n s\\nend:\\np(0):=1:\\n\\ntime(p(6666));\\n# 0.796\\n\\ntime(combinat[numbpart](6666));\\n# 0.406\\n\\np~([$1..20]);\\n# [1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627]\\n\\ncombinat[numbpart]~([$1..20]);\\n# [1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, 385, 490, 627]\\n\\np(1000)\\n# 24061467864032622473692149727991\\n\\ncombinat[numbpart](1000);\\n# 24061467864032622473692149727991\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"PartitionsP /@ Range[15]\\nPartitionsP[666]\\nPartitionsP[6666]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import sequtils, strformat, times\\nimport bignum\\n\\nfunc partitions(n: int): Int =\\n var p = newSeqWith(n + 1, newInt())\\n p[0] = newInt(1)\\n for i in 1..n:\\n var k = 1\\n while true:\\n var j = k * (3 * k - 1) div 2\\n if j > i: break\\n if (k and 1) != 0:\\n inc p[i], p[i - j]\\n else:\\n dec p[i], p[i - j]\\n j = k * (3 * k + 1) div 2\\n if j > i: break\\n if (k and 1) != 0:\\n inc p[i], p[i - j]\\n else:\\n dec p[i], p[i - j]\\n inc k\\n result = p[n]\\n\\nlet t0 = cpuTime()\\necho partitions(6666)\\necho &\\\"Elapsed time: {(cpuTime() - t0) * 1000:.2f} ms\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nno warnings qw(recursion);\\nuse Math::AnyNum qw(:overload);\\nuse Memoize;\\n\\nmemoize('partitionsP');\\nmemoize('partDiff');\\n\\nsub partDiffDiff { my($n) = @_; $n%2 != 0 ? ($n+1)/2 : $n+1 }\\n\\nsub partDiff { my($n) = @_; $n<2 ? 1 : partDiff($n-1) + partDiffDiff($n-1) }\\n\\nsub partitionsP {\\n my($n) = @_;\\n return 1 if $n < 2;\\n\\n my $psum = 0;\\n for my $i (1..$n) {\\n my $pd = partDiff($i);\\n last if $pd > $n;\\n if ( (($i-1)%4) < 2 ) { $psum += partitionsP($n-$pd) }\\n else { $psum -= partitionsP($n-$pd) }\\n }\\n return $psum\\n}\\n\\nprint partitionsP($_) . ' ' for 0..25; print \\\"\\\\n\\\";\\nprint partitionsP(6666) . \\\"\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">partDiffDiff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)/(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">partDiff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">pd</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">[$]</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">partDiffDiff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)}</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">partitionsP</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">nn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">psum</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_init</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">nn</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">partDiff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">nn</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">exit</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">sgn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">remainder</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #0000FF;\\\">?</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #0000FF;\\\">:</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #000000;\\\">pnmpd</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nn</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">pd</span><span style=\\\"color: #0000FF;\\\">)]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">sgn</span><span style=\\\"color: #0000FF;\\\">=-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">psum</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">psum</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pnmpd</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">psum</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">psum</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pnmpd</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">pn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">psum</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">pn</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">max</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">t0</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">6666</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"p(%d) = %s (%s)\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">mpz_get_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">partitionsP</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)),</span><span style=\\\"color: #7060A8;\\\">elapsed</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">time</span><span style=\\\"color: #0000FF;\\\">()-</span><span style=\\\"color: #000000;\\\">t0</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"/* Picat 3.0#5 */\\n/* Author: Hakan Kjellerstrand */\\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 := S - ((-1)**K)*partition1(N-M),\\n K := K + 1,\\n M := (K*(3*K-1)) // 2\\n end,\\n K := 1,\\n M := (K*(3*K+1)) // 2,\\n while (M <= N)\\n S := S - ((-1)**K)*partition1(N-M),\\n K := K + 1,\\n M := (K*(3*K+1)) // 2\\n end,\\n P = S.\\n\\nPicat> time(println('p(6666)'=partition1(6666)))\\np(6666) = 193655306161707661080005073394486091998480950338405932486880600467114423441282418165863\\n\\nCPU time 0.206 seconds.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de gpentagonals (Max)\\n (make\\n (let (N 0 M 1)\\n (loop\\n (inc 'N (if (=0 (& M 1)) (>> 1 M) M))\\n (T (> N Max))\\n (link N)\\n (inc 'M)))))\\n\\n(de p (N)\\n (cache '(NIL) N\\n (if (=0 N)\\n 1\\n (let (Sum 0 Sgn 0)\\n (for G (gpentagonals N)\\n ((if (< Sgn 2) 'inc 'dec) 'Sum (p (- N G)))\\n (setq Sgn (& 3 (inc Sgn))))\\n Sum))))\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"/* SWI-Prolog 8.3.21 */\\n/* Author: Jan Burse */\\n:- table p/2.\\np(0, 1) :- !.\\np(N, X) :-\\n aggregate_all(sum(Z), (between(1,inf,K), M is K*(3*K-1)//2,\\n (M>N, !, fail; L is N-M, p(L,Y), Z is (-1)^K*Y)), A),\\n aggregate_all(sum(Z), (between(1,inf,K), M is K*(3*K+1)//2,\\n (M>N, !, fail; L is N-M, p(L,Y), Z is (-1)^K*Y)), B),\\n X is -A-B.\\n\\n?- time(p(6666,X)).\\n% 13,962,294 inferences, 2.610 CPU in 2.743 seconds (95% CPU, 5350059 Lips)\\nX = 1936553061617076610800050733944860919984809503384\\n05932486880600467114423441282418165863.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"from itertools import islice\\n\\ndef posd():\\n \\\"diff between position numbers. 1, 2, 3... interleaved with 3, 5, 7...\\\"\\n count, odd = 1, 3\\n while True:\\n yield count\\n yield odd\\n count, odd = count + 1, odd + 2\\n\\ndef pos_gen():\\n \\\"position numbers. 1 3 2 5 7 4 9 ...\\\"\\n val = 1\\n diff = posd()\\n while True:\\n yield val\\n val += next(diff)\\n\\ndef plus_minus():\\n \\\"yield (list_offset, sign) or zero for Partition calc\\\"\\n n, sign = 0, [1, 1]\\n p_gen = pos_gen()\\n out_on = next(p_gen)\\n while True:\\n n += 1\\n if n == out_on:\\n next_sign = sign.pop(0)\\n if not sign:\\n sign = [-next_sign] * 2\\n yield -n, next_sign\\n out_on = next(p_gen)\\n else:\\n yield 0\\n\\ndef part(n):\\n \\\"Partition numbers\\\"\\n p = [1]\\n p_m = plus_minus()\\n mods = []\\n for _ in range(n):\\n next_plus_minus = next(p_m)\\n if next_plus_minus:\\n mods.append(next_plus_minus)\\n p.append(sum(p[offset] * sign for offset, sign in mods))\\n return p[-1]\\n\\nprint(\\\"(Intermediaries):\\\")\\nprint(\\\" posd:\\\", list(islice(posd(), 10)))\\nprint(\\\" pos_gen:\\\", list(islice(pos_gen(), 10)))\\nprint(\\\" plus_minus:\\\", list(islice(plus_minus(), 15)))\\nprint(\\\"\\\\nPartitions:\\\", [part(x) for x in range(15)])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def par_primes():\\n \\\"Prime number generator from the partition machine\\\"\\n p = [1]\\n p_m = plus_minus()\\n mods = []\\n n = 0\\n while True:\\n n += 1\\n next_plus_minus = next(p_m)\\n if next_plus_minus:\\n mods.append(next_plus_minus)\\n p.append(sum(p[offset] * sign for offset, sign in mods))\\n if p[0] + 1 == p[-1]:\\n yield p[0]\\n p[0] += 1\\n yield p\\n\\nprint(\\\"\\\\nPrimes:\\\", list(islice(par_primes(), 15)))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from typing import List\\n\\n\\ndef partitions(n: int) -> int:\\n \\\"\\\"\\\"Count partitions.\\\"\\\"\\\"\\n p: List[int] = [1] + [0] * n\\n for i in range(1, n + 1):\\n k: int = 0\\n while True:\\n k += 1\\n j: int = (k * (3*k - 1)) // 2\\n if (j > i):\\n break\\n if (k & 1):\\n p[i] += p[i - j]\\n else:\\n p[i] -= p[i - j]\\n j = (k * (3*k + 1)) // 2\\n if (j > i):\\n break\\n if (k & 1):\\n p[i] += p[i - j]\\n else:\\n p[i] -= p[i - j]\\n\\n return p[n]\\n\\n\\nif __name__ == '__main__':\\n print(\\\"\\\\nPartitions:\\\", [partitions(x) for x in range(15)])\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 1 swap\\n dup 0 = iff drop done\\n [ 2dup = iff [ 2drop 1 ] done\\n 2dup > iff [ 2drop 0 ] done\\n 2dup dip 1+ recurse\\n unrot over - recurse + ] ] is partitions ( n --> n )\\n\\n say \\\"Partitions of 0 to 29\\\" cr\\n 30 times [ i^ partitions echo sp ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require math/number-theory)\\n\\n(define σ\\n (let ((memo (make-hash)))\\n (λ (z)\\n (hash-ref! memo z\\n (λ () (apply + (divisors z)))))))\\n\\n(define p\\n (let ((memo (make-hash '((0 . 1)))))\\n (λ (n)\\n (hash-ref!\\n memo n\\n (λ ()\\n (let ((r (if (zero? n) 1\\n (/ (for/sum ((k (in-range (sub1 n) -1 -1)))\\n (* (σ (- n k))\\n (p k)))\\n n))))\\n (when (zero? (modulo n 1000)) (displayln (cons n r) (current-error-port)))\\n r))))))\\n\\n(map p (range 1 30))\\n(p 666)\\n(p 1000)\\n(p 10000)\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @P = 1, { p(++$) } … *;\\nmy @i = lazy [\\\\+] flat 1, ( 1..* Z (1..*).map: * × 2 + 1 );\\nsub p ($n) { sum @P[$n X- @i] Z× (flat (1, 1, -1, -1) xx *) }\\n\\nput @P[^26];\\nput @P[6666];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\\nnumeric digits 1000 /*able to handle some ginormous numbers*/\\nparse arg lo hi . /*obtain optional arguments from the CL*/\\nif lo=='' | lo==\\\",\\\" then lo= 0 /*Not specified? Then use the default.*/\\nif hi=='' | hi==\\\",\\\" then hi= lo /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*assign default value and low values. */\\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /*assign default value and even digits.*/\\nw= length( commas(hi) ) /*W: is used for aligning the index. */\\n\\n do j=lo to hi /*compute a range of partitionsP. */\\n say right( commas(j), w) ' ' commas( partP(j) )\\n end /*j*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npartP: procedure expose @. !.; parse arg n /*obtain number (index) for computation*/\\n if @.n\\\\==0 then return @.n /*Is it already computed? Return it. */\\n #= 0 /*initialize part P number.*/\\n do k=1 for n; z= n - (k*3 - 1) * k % 2 /*compute the partition P num*/\\n if z<0 then leave /*Is Z negative? Then leave.*/\\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\\n else x= @.z /*use the pre─computed number*/\\n z= z - k /*subtract index (K) from Z. */\\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\\n else y= @.z /*use the pre─computed number*/\\n if k//2 then #= # + x + y /*Odd? Then sum X and Y.*/\\n else #= # - (x + y) /*Even? \\\" subtract \\\" \\\" \\\" */\\n end /*k*/\\n @.n= #; return # /*define and return partitionsP of N. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\\nnumeric digits 1000 /*able to handle some ginormous numbers*/\\nparse arg lo hi . /*obtain optional arguments from the CL*/\\nif lo=='' | lo==\\\",\\\" then lo= 0 /*Not specified? Then use the default.*/\\nif hi=='' | hi==\\\",\\\" then hi= lo /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*default values for some low numbers. */\\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /* \\\" \\\" \\\" all the 1─digit #s*/\\nw= length( commas(hi) ) /*W: is used for aligning the index. */\\n\\n do j=lo to hi /*compute a range of partitionsP. */\\n say right( commas(j), w) ' ' commas( partP(j) )\\n end /*j*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npartP: procedure expose @. !.; parse arg n /*obtain number (index) for computation*/\\n if @.n\\\\==0 then return @.n /*Is it already computed? Return it. */\\n #= 0 /*initialize part P number.*/\\n do k=1 for n; z= n - (k+k+k - 1) * k % 2 /*compute the partition P num*/\\n if z<0 then leave /*Is Z negative? Then leave.*/\\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\\n else x= @.z /*use the pre─computed number*/\\n z= z - k /*subtract index (K) from Z. */\\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\\n else y= @.z /*use the pre─computed number*/\\n parse var k '' -1 _ /*obtain K's last decimal dig*/\\n if !._ then #= # + x + y /*Odd? Then sum X and Y.*/\\n else #= # - (x + y) /*Even? \\\" subtract \\\" \\\" \\\" */\\n end /*k*/\\n @.n= #; return # /*define and return partitionsP of N. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"/*REXX program calculates and displays a specific value (or a range of) partitionsP(N).*/\\nnumeric digits 1000 /*able to handle some ginormous numbers*/\\nparse arg lo hi . /*obtain optional arguments from the CL*/\\nif lo=='' | lo==\\\",\\\" then lo= 0 /*Not specified? Then use the default.*/\\nif hi=='' | hi==\\\",\\\" then hi= lo /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n@.= 0; @.0= 1; @.1= 1; @.2= 2; @.3= 3; @.4= 5 /*default values for some low numbers. */\\n!.= @.; !.1= 1; !.3= 1; !.5= 1; !.7= 1; !.9= 1 /* \\\" \\\" \\\" all the 1─digit #s*/\\nw= length( commas(hi) ) /*W: is used for aligning the index. */\\n do i=1 for hi; a.i= (i+i+i - 1) * i % 2 /*calculate HI expressions (for partP).*/\\n end /*i*/\\n\\n do j=lo to hi /*compute a range of partitionsP. */\\n say right( commas(j), w) ' ' commas( partP(j) )\\n end /*j*/\\nexit 0 /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ncommas: parse arg ?; do jc=length(?)-3 to 1 by -3; ?=insert(',', ?, jc); end; return ?\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\npartP: procedure expose @. !. a.; parse arg n /*obtain number (index) for computation*/\\n if @.n\\\\==0 then return @.n /*Is it already computed? Return it. */\\n #= 0 /*initialize part P number.*/\\n do k=1 for n; z= n - a.k /*compute the partition P num*/\\n if z<0 then leave /*Is Z negative? Then leave.*/\\n if @.z==0 then x= partP(z) /*use recursion if not known.*/\\n else x= @.z /*use the pre─computed number*/\\n z= z - k /*subtract index (K) from Z. */\\n if z<0 then y= 0 /*Is Z negative? Then set Y=0*/\\n else if @.z==0 then y= partP(z) /*use recursion if not known.*/\\n else y= @.z /*use the pre─computed number*/\\n parse var k '' -1 _ /*obtain K's last decimal dig*/\\n if !._ then #= # + x + y /*Odd? Then sum X and Y.*/\\n else #= # - (x + y) /*Even? \\\" subtract \\\" \\\" \\\" */\\n end /*k*/\\n @.n= #; return # /*define and return partitionsP of N. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"// [dependencies]\\n// rug = \\\"1.11\\\"\\n\\nuse rug::Integer;\\n\\nfn partitions(n: usize) -> Integer {\\n let mut p = Vec::with_capacity(n + 1);\\n p.push(Integer::from(1));\\n for i in 1..=n {\\n let mut num = Integer::from(0);\\n let mut k = 1;\\n loop {\\n let mut j = (k * (3 * k - 1)) / 2;\\n if j > i {\\n break;\\n }\\n if (k & 1) == 1 {\\n num += &p[i - j];\\n } else {\\n num -= &p[i - j];\\n }\\n j += k;\\n if j > i {\\n break;\\n }\\n if (k & 1) == 1 {\\n num += &p[i - j];\\n } else {\\n num -= &p[i - j];\\n }\\n k += 1;\\n }\\n p.push(num);\\n }\\n p[n].clone()\\n}\\n\\nfn main() {\\n use std::time::Instant;\\n let n = 6666;\\n let now = Instant::now();\\n let result = partitions(n);\\n let time = now.elapsed();\\n println!(\\\"P({}) = {}\\\", n, result);\\n println!(\\\"elapsed time: {} microseconds\\\", time.as_micros());\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"say partitions(6666) # very fast\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"func partitionsP(n) {\\n func (n) is cached {\\n\\n n <= 1 && return n\\n\\n var a = sum(1..floor((sqrt(24*n + 1) + 1)/6), {|k|\\n (-1)**(k-1) * __FUNC__(n - ((k*(3*k - 1)) >> 1))\\n })\\n\\n var b = sum(1..ceil((sqrt(24*n + 1) - 7)/6), {|k|\\n (-1)**(k-1) * __FUNC__(n - ((k*(3*k + 1)) >> 1))\\n })\\n\\n a + b\\n }(n+1)\\n}\\n\\nvar t = Time.micro\\n\\nsay partitionsP.map(0..25).join(' ')\\nsay partitionsP(6666)\\n\\nsay (\\\"Took %.4f seconds\\\" % Time.micro-t)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"import BigInt\\n\\nfunc partitions(n: Int) -> BigInt {\\n var p = [BigInt(1)]\\n\\n for i in 1...n {\\n var num = BigInt(0)\\n var k = 1\\n\\n while true {\\n var j = (k * (3 * k - 1)) / 2\\n\\n if j > i {\\n break\\n }\\n\\n if k & 1 == 1 {\\n num += p[i - j]\\n } else {\\n num -= p[i - j]\\n }\\n\\n j += k\\n\\n if j > i {\\n break\\n }\\n\\n if k & 1 == 1 {\\n num += p[i - j]\\n } else {\\n num -= p[i - j]\\n }\\n\\n k += 1\\n }\\n\\n p.append(num)\\n }\\n\\n return p[n]\\n}\\n\\nprint(\\\"partitions(6666) = \\\\(partitions(n: 6666))\\\")\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt\\n\\nvar p = []\\nvar pd = []\\n\\nvar partDiffDiff = Fn.new { |n| (n&1 == 1) ? (n + 1)/2 : n + 1 }\\n\\nvar partDiff = Fn.new { |n|\\n if (n < 2) return 1\\n pd[n] = pd[n-1] + partDiffDiff.call(n-1)\\n return pd[n]\\n}\\n\\nvar partitionsP = Fn.new { |n|\\n if (n < 2) return\\n var psum = BigInt.zero\\n for (i in 1..n) {\\n var pdi = partDiff.call(i)\\n if (pdi > n) break\\n var sign = (i-1)%4 < 2 ? 1 : -1\\n psum = psum + p[n-pdi] * sign\\n }\\n p[n] = psum\\n}\\n\\nvar start = System.clock\\nvar N = 6666\\np = List.filled(N+1, null)\\npd = List.filled(N+1, 0)\\np[0] = BigInt.one\\np[1] = BigInt.one\\npd[0] = 1\\npd[1] = 1\\nfor (n in 2..N) partitionsP.call(n)\\nSystem.print(\\\"p[%(N)] = %(p[N])\\\")\\nSystem.print(\\\"Took %(System.clock - start) seconds\\\")\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Partition-function-P"}}},{"rowIdx":1490,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pascal's_triangle\nnote: Arithmetic operations\n","language":"00-META"},{"code":"[[wp:Pascal's triangle|Pascal's triangle]] is an arithmetic and geometric figure often associated with the name of [[wp:Blaise Pascal|Blaise Pascal]], but also studied centuries earlier in India, Persia, China and elsewhere.\n\nIts first few rows look like this: <b>\n 1\n 1 1\n 1 2 1\n 1 3 3 1 </b>\nwhere each element of each row is either 1 or the sum of the two elements right above it. \n\nFor example, the next row of the triangle would be:\n::: '''1''' (since the first element of each row doesn't have two elements above it)\n::: '''4''' (1 + 3)\n::: '''6''' (3 + 3)\n::: '''4''' (3 + 1)\n::: '''1''' (since the last element of each row doesn't have two elements above it) \n\nSo the triangle now looks like this: <b>\n 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1 </b>\n\nEach row <tt> n </tt> (starting with row 0 at the top) shows the coefficients of the binomial expansion of <big><big> (x + y)<sup>n</sup>. </big></big>\n\n\n;Task:\nWrite a function that prints out the first <tt> n </tt> rows of the triangle (with <tt> f(1) </tt> yielding the row consisting of only the element '''1'''). \n\nThis can be done either by summing elements from the previous rows or using a binary coefficient or combination function. \n\nBehavior for <big><tt> n ≤ 0 </tt></big> does not need to be uniform, but should be noted.\n\n\n;See also:\n* [[Evaluate binomial coefficients]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F pascal(n)\n V row = [1]\n V k = [0]\n L 0 .< max(n, 0)\n print(row.join(‘ ’).center(16))\n row = zip(row [+] k, k [+] row).map((l, r) -> l + r)\n\npascal(7)\n","language":"11l"},{"code":"* Pascal's triangle 25/10/2015\nPASCAL CSECT\n USING PASCAL,R15 set base register\n LA R7,1 n=1\nLOOPN C R7,=A(M) do n=1 to m\n BH ELOOPN if n>m then goto\n MVC U,=F'1' u(1)=1\n LA R8,PG pgi=@pg\n LA R6,1 i=1\nLOOPI CR R6,R7 do i=1 to n\n BH ELOOPI if i>n then goto\n LR R1,R6 i\n SLA R1,2 i*4\n L R3,T-4(R1) t(i)\n L R4,T(R1) t(i+1)\n AR R3,R4 t(i)+t(i+1)\n ST R3,U(R1) u(i+1)=t(i)+t(i+1)\n LR R1,R6 i\n SLA R1,2 i*4\n L R2,U-4(R1) u(i)\n XDECO R2,XD edit u(i)\n MVC 0(4,R8),XD+8 output u(i):4\n LA R8,4(R8) pgi=pgi+4\n LA R6,1(R6) i=i+1\n B LOOPI end i\nELOOPI MVC T((M+1)*(L'T)),U t=u\n XPRNT PG,80 print\n LA R7,1(R7) n=n+1\n B LOOPN end n\nELOOPN XR R15,R15 set return code\n BR R14 return to caller\nM EQU 11 <== input\nT DC (M+1)F'0' t(m+1) init 0\nU DC (M+1)F'0' u(m+1) init 0\nPG DC CL80' ' pg init ' '\nXD DS CL12 temp\n YREGS\n END PASCAL\n","language":"360-Assembly"},{"code":"\\ print the array\n: .arr \\ a -- a\n ( . space ) a:each ;\n\n: pasc \\ a --\n \\ print the row\n .arr cr\n dup\n \\ create two rows from the first, one with a leading the other with a trailing 0\n [0] 0 a:insert swap 0 a:push\n \\ add the arrays together to make the new one\n ' n:+ a:op ;\n\n\\ print the first 16 rows:\n[1] ' pasc 16 times\n","language":"8th"},{"code":": ratio \\ m n -- num denom\n tuck n:- n:1+ swap ;\n\n\\ one item in the row: n m\n: pascitem \\ n m -- n\n\tr@ swap\n\tratio\n\tn:*/ n:round int\n\tdup . space ;\n\n\\ One row of Pascal's triangle\n: pascline \\ n --\n\t>r 1 int dup . space\n\t' pascitem\n\t1 r@ loop rdrop drop cr ;\n\n\\ Calculate the first 'n' rows of Pascal's triangle:\n: pasc \\ n\n\t' pascline 0 rot loop cr ;\n\n15 pasc\n","language":"8th"},{"code":"PROC Main()\n BYTE count=[10],row,item\n CHAR ARRAY s(5)\n INT v\n\n FOR row=0 TO count-1\n DO\n v=1\n FOR item=0 TO row\n DO\n StrI(v,s)\n Position(2*(count-row)+4*item-s(0),row+1)\n Print(s)\n v=v*(row-item)/(item+1)\n OD\n PutE()\n OD\nRETURN\n","language":"Action-"},{"code":"package Pascal is\n\n type Row is array (Natural range <>) of Natural;\n\n function Length(R: Row) return Positive;\n\n function First_Row(Max_Length: Positive) return Row;\n\n function Next_Row(R: Row) return Row;\n\nend Pascal;\n","language":"Ada"},{"code":"package body Pascal is\n\n function First_Row(Max_Length: Positive) return Row is\n R: Row(0 .. Max_Length) := (0 | 1 => 1, others => 0);\n begin\n return R;\n end First_Row;\n\n function Next_Row(R: Row) return Row is\n S: Row(R'Range);\n begin\n S(0) := Length(R)+1;\n S(Length(S)) := 1;\n for J in reverse 2 .. Length(R) loop\n S(J) := R(J)+R(J-1);\n end loop;\n S(1) := 1;\n return S;\n end Next_Row;\n\n function Length(R: Row) return Positive is\n begin\n return R(0);\n end Length;\n\nend Pascal;\n","language":"Ada"},{"code":"with Ada.Text_IO, Ada.Integer_Text_IO, Ada.Command_Line, Pascal; use Pascal;\n\nprocedure Triangle is\n\n Number_Of_Rows: Positive := Integer'Value(Ada.Command_Line.Argument(1));\n Row: Pascal.Row := First_Row(Number_Of_Rows);\n\nbegin\n loop\n -- print one row\n for J in 1 .. Length(Row) loop\n\t Ada.Integer_Text_IO.Put(Row(J), 5);\n end loop;\n Ada.Text_IO.New_Line;\n exit when Length(Row) >= Number_Of_Rows;\n Row := Next_Row(Row);\n end loop;\nend Triangle;\n","language":"Ada"},{"code":"PRIO MINLWB = 8, MAXUPB = 8;\nOP MINLWB = ([]INT a,b)INT: (LWB a<LWB b|LWB a|LWB b),\n MAXUPB = ([]INT a,b)INT: (UPB a>UPB b|UPB a|UPB b);\n\nOP + = ([]INT a,b)[]INT:(\n [a MINLWB b:a MAXUPB b]INT out; FOR i FROM LWB out TO UPB out DO out[i]:= 0 OD;\n out[LWB a:UPB a] := a; FOR i FROM LWB b TO UPB b DO out[i]+:= b[i] OD;\n out\n);\n\nINT width = 4, stop = 9;\nFORMAT centre = $n((stop-UPB row+1)*width OVER 2)(q)$;\n\nFLEX[1]INT row := 1; # example of rowing #\nFOR i WHILE\n printf((centre, $g(-width)$, row, $l$));\n# WHILE # i < stop DO\n row := row[AT 1] + row[AT 2]\nOD\n","language":"ALGOL-68"},{"code":"begin\n % prints the first n lines of Pascal's triangle lines %\n % if n is <= 0, no output is produced %\n procedure printPascalTriangle( integer value n ) ;\n if n > 0 then begin\n integer array pascalLine ( 1 :: n );\n pascalLine( 1 ) := 1;\n for line := 1 until n do begin\n for i := line - 1 step - 1 until 2 do pascalLine( i ) := pascalLine( i - 1 ) + pascalLine( i );\n pascalLine( line ) := 1;\n write( s_w := 0, \" \" );\n for i := line until n do writeon( s_w := 0, \" \" );\n for i := 1 until line do writeon( i_w := 6, s_w := 0, pascalLine( i ) )\n end for_line ;\n end printPascalTriangle ;\n\n printPascalTriangle( 8 )\n\nend.\n","language":"ALGOL-W"},{"code":"#include <jambo.h>\n#define Mulbyandmoveto(_X_) Mul by '_X_', Move to '_X_'\n\nMain\n filas=0, Get arg numeric '2', Move to 'filas'\n i=0, r=\"\"\n Loop if( var 'i' Is less than 'filas' )\n c=1, j=0\n Set 'c' To str, Move to 'r'\n Loop if ( var 'j' Is less than 'i' )\n Set 'i' Minus 'j', Plus one 'j', Div it; Mul by and move to 'c'\n Multi cat ' r, \"\\t\", Str(c) '; Move to 'r'\n ++j\n Back\n Printnl 'r'\n ++i\n Back\nEnd\n","language":"Amazing-Hopper"},{"code":"{⍕0~¨⍨(-⌽A)⌽↑,/0,¨⍉A∘.!A←0,⍳⍵}\n","language":"APL"},{"code":"{⍕0~¨⍨(-⌽A)⌽↑,/0,¨⍉A∘.!A←0,⍳⍵}5\n","language":"APL"},{"code":"{{⍉⍵∘.!⍵} 0,⍳⍵}\n","language":"APL"},{"code":"{{⍉⍵∘.!⍵} 0,⍳⍵} 3\n","language":"APL"},{"code":"-------------------- PASCAL'S TRIANGLE -------------------\n\n-- pascal :: Generator [[Int]]\non pascal()\n script nextRow\n on |λ|(row)\n zipWith(my plus, {0} & row, row & {0})\n end |λ|\n end script\n iterate(nextRow, {1})\nend pascal\n\n\n--------------------------- TEST -------------------------\non run\n showPascal(take(7, pascal()))\nend run\n\n\n------------------------ FORMATTING ----------------------\n\n-- showPascal :: [[Int]] -> String\non showPascal(xs)\n set w to length of intercalate(\" \", item -1 of xs)\n script align\n on |λ|(x)\n |center|(w, space, intercalate(\" \", x))\n end |λ|\n end script\n unlines(map(align, xs))\nend showPascal\n\n\n------------------------- GENERIC ------------------------\n\n-- center :: Int -> Char -> String -> String\non |center|(n, cFiller, strText)\n set lngFill to n - (length of strText)\n if lngFill > 0 then\n set strPad to replicate(lngFill div 2, cFiller) as text\n set strCenter to strPad & strText & strPad\n if lngFill mod 2 > 0 then\n cFiller & strCenter\n else\n strCenter\n end if\n else\n strText\n end if\nend |center|\n\n\n-- intercalate :: String -> [String] -> String\non intercalate(sep, xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, sep}\n set s to xs as text\n set my text item delimiters to dlm\n return s\nend intercalate\n\n\n-- iterate :: (a -> a) -> a -> Generator [a]\non iterate(f, x)\n script\n property v : missing value\n property g : mReturn(f)'s |λ|\n on |λ|()\n if missing value is v then\n set v to x\n else\n set v to g(v)\n end if\n return v\n end |λ|\n end script\nend iterate\n\n\n-- length :: [a] -> Int\non |length|(xs)\n set c to class of xs\n if list is c or string is c then\n length of xs\n else\n 2 ^ 30 -- (simple proxy for non-finite)\n end if\nend |length|\n\n\n-- map :: (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 |λ|(item i of xs, i, xs)\n end repeat\n return lst\n end tell\nend map\n\n\n-- min :: 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\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\non mReturn(f)\n -- 2nd class handler function lifted into 1st class script wrapper.\n if script is class of f then\n f\n else\n script\n property |λ| : f\n end script\n end if\nend mReturn\n\n\n\n-- plus :: Num -> Num -> Num\non plus(a, b)\n a + b\nend plus\n\n\n-- Egyptian multiplication - progressively doubling a list, appending\n-- stages of doubling to an accumulator where needed for binary\n-- assembly of a target length\n-- replicate :: 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\n-- take :: Int -> [a] -> [a]\n-- take :: Int -> String -> String\non take(n, xs)\n set c to class of xs\n if list is c then\n if 0 < n then\n items 1 thru min(n, length of xs) of xs\n else\n {}\n end if\n else if string is c then\n if 0 < n then\n text 1 thru min(n, length of xs) of xs\n else\n \"\"\n end if\n else if script is c then\n set ys to {}\n repeat with i from 1 to n\n set end of ys to xs's |λ|()\n end repeat\n return ys\n else\n missing value\n end if\nend take\n\n\n-- unlines :: [String] -> String\non unlines(xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, linefeed}\n set str to xs as text\n set my text item delimiters to dlm\n str\nend unlines\n\n\n-- unwords :: [String] -> String\non unwords(xs)\n set {dlm, my text item delimiters} to ¬\n {my text item delimiters, space}\n set s to xs as text\n set my text item delimiters to dlm\n return s\nend unwords\n\n\n-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\non zipWith(f, xs, ys)\n set lng to min(|length|(xs), |length|(ys))\n if 1 > lng then return {}\n set xs_ to take(lng, xs) -- Allow for non-finite\n set ys_ to take(lng, ys) -- generators like cycle etc\n set lst to {}\n tell mReturn(f)\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\n end tell\nend zipWith\n","language":"AppleScript"},{"code":"pascalTriangle: function [n][\n triangle: new [[1]]\n\n loop 1..dec n 'x [\n 'triangle ++ @[map couple (last triangle)++[0] [0]++(last triangle) 'x -> x\\[0] + x\\[1]]\n ]\n\n return triangle\n]\n\nloop pascalTriangle 10 'row [\n print pad.center join.with: \" \" map to [:string] row 'x -> pad.center x 5 60\n]\n","language":"Arturo"},{"code":"n := 8, p0 := \"1\" ; 1+n rows of Pascal's triangle\nLoop %n% {\n p := \"p\" A_Index, %p% := v := 1, q := \"p\" A_Index-1\n Loop Parse, %q%, %A_Space%\n If (A_Index > 1)\n %p% .= \" \" v+A_LoopField, v := A_LoopField\n %p% .= \" 1\"\n}\n ; Triangular Formatted output\nVarSetCapacity(tabs,n,Asc(\"`t\"))\nt .= tabs \"`t1\"\nLoop %n% {\n t .= \"`n\" SubStr(tabs,A_Index)\n Loop Parse, p%A_Index%, %A_Space%\n t .= A_LoopField \"`t`t\"\n}\nGui Add, Text,, %t% ; Show result in a GUI\nGui Show\nReturn\n\nGuiClose:\n ExitApp\n","language":"AutoHotkey"},{"code":"Msgbox % format(pascalstriangle())\nReturn\n\nformat(o) ; converts object to string\n{\n\tFor k, v in o\n\t\ts .= IsObject(v) ? format(v) \"`n\" : v \" \"\n\tReturn s\n}\npascalstriangle(n=7) ; n rows of Pascal's triangle\n{\n\tp := Object(), z:=Object()\n\tLoop, % n\n\t\tLoop, % row := A_Index\n\t\t\tcol := A_Index\n\t\t\t, p[row, col] := row = 1 and col = 1\n\t\t\t\t? 1\n\t\t\t\t: (p[row-1, col-1] = \"\" ; math operations on blanks return blanks; I want to assume zero\n\t\t\t\t\t? 0\n\t\t\t\t\t: p[row-1, col-1])\n\t\t\t\t+ (p[row-1, col] = \"\"\n\t\t\t\t\t? 0\n\t\t\t\t\t: p[row-1, col])\n\tReturn p\n}\n","language":"AutoHotkey"},{"code":"$ awk 'BEGIN{for(i=0;i<6;i++){c=1;r=c;for(j=0;j<i;j++){c*=(i-j)/(j+1);r=r\" \"c};print r}}'\n","language":"AWK"},{"code":"// Create a Pascal's triangle with a given number of rows.\n// Returns an empty array for row_nr <= 0.\nfun pascals_triangle(row_nr i32) [][]i32 {\n\tmut rows := [][]i32\n\n\t// Iterate over all rows\n\tfor r := 0; r < row_nr; r += 1 {\n\t\t// Store the row above the current one\n\t\tmut above := rows[r - 1]\n\n\t\t// Fill the current row. It contains r + 1 numbers\n\t\tfor i := 0; i <= r; i += 1 {\n\t\t\t// First number is always 1\n\t\t\tif i == 0 {\n\t\t\t\trows.push([1]) // Push new row\n\t\t\t}\n\t\t\t// Last number is always 1\n\t\t\telse if i == r {\n\t\t\t\trows[r].push(1)\n\t\t\t}\n\t\t\t// Other numbers are the sum of the two numbers above them\n\t\t\telse {\n\t\t\t\trows[r].push(above[i - 1] + above[i])\n\t\t\t}\n\t\t}\n\t}\n\n\treturn rows\n}\n\n\n// Helper function to pretty print triangles.\n// It still get's ugly once numbers have >= 2 digits.\nfun print_triangle(triangle [][]i32) {\n\tfor i, row in triangle {\n\t\t// Create string with leading spaces\n\t\tmut s := ' '.repeat(triangle.length - i - 1)\n\n\t\t// Add each number to the string\n\t\tfor n in row {\n\t\t\ts += n.str() + ' '\n\t\t}\n\n\t\t// Print and trim the extra trailing space\n\t\tprintln(s.trim_right(' '))\n\t}\n}\n\n\nfun main() {\n\tprint_triangle(pascals_triangle(7))\n}\n","language":"Bait"},{"code":"DIM i AS Integer\nDIM row AS Integer\nDIM nrows AS Integer\nDIM values(100) AS Integer\n\nINPUT \"Number of rows: \"; nrows\nvalues(1) = 1\nPRINT TAB((nrows)*3);\" 1\"\nFOR row = 2 TO nrows\n PRINT TAB((nrows-row)*3+1);\n FOR i = row TO 1 STEP -1\n values(i) = values(i) + values(i-1)\n PRINT USING \"##### \"; values(i);\n NEXT i\n PRINT\nNEXT row\n","language":"BASIC"},{"code":"@echo off\nsetlocal enabledelayedexpansion\n\n::The Main Thing...\ncls\necho.\nset row=15\ncall :pascal\necho.\npause\nexit /b 0\n::/The Main Thing.\n\n::The Functions...\n:pascal\n\tset /a prev=%row%-1\n\tfor /l %%I in (0,1,%prev%) do (\n\t\tset c=1&set r=\n\t\tfor /l %%K in (0,1,%row%) do (\n\t\t\tif not !c!==0 (\n\t\t\t\tcall :numstr !c!\n\t\t\t\tset r=!r!!space!!c!\n\t\t\t)\n\t\t\tset /a c=!c!*^(%%I-%%K^)/^(%%K+1^)\n\t\t)\n\t\techo !r!\n\t)\ngoto :EOF\n\n:numstr\n\t::This function returns the number of whitespaces to be applied on each numbers.\n\tset cnt=0&set proc=%1&set space=\n\t:loop\n\tset currchar=!proc:~%cnt%,1!\n\tif not \"!currchar!\"==\"\" set /a cnt+=1&goto loop\n\tset /a numspaces=5-!cnt!\n\tfor /l %%A in (1,1,%numspaces%) do set \"space=!space! \"\ngoto :EOF\n::/The Functions.\n","language":"Batch-File"},{"code":" nrows% = 10\n\n colwidth% = 4\n @% = colwidth% : REM Set column width\n FOR row% = 1 TO nrows%\n PRINT SPC(colwidth%*(nrows% - row%)/2);\n acc% = 1\n FOR element% = 1 TO row%\n PRINT acc%;\n acc% = acc% * (row% - element%) / element% + 0.5\n NEXT\n PRINT\n NEXT row%\n","language":"BBC-BASIC"},{"code":"get \"libhdr\"\n\nlet pascal(n) be\n for i=0 to n-1\n $( let c = 1\n for j=1 to 2*(n-1-i) do wrch(' ')\n for k=0 to i\n $( writef(\"%I3 \",c)\n c := c*(i-k)/(k+1)\n $)\n wrch('*N')\n $)\n\nlet start() be pascal(8)\n","language":"BCPL"},{"code":"0\" :swor fo rebmuN\">:#,_&> 55+, v\nv01*p00-1:g00.:<1p011p00:\\-1_v#:<\n>g:1+10p/48*,:#^_$ 55+,1+\\: ^>$$@\n","language":"Befunge"},{"code":"Pascal ← {(0⊸∾+∾⟜0)⍟(↕𝕩)⋈1}\n\n•Show¨Pascal 6\n","language":"BQN"},{"code":"⟨ 1 ⟩\n⟨ 1 1 ⟩\n⟨ 1 2 1 ⟩\n⟨ 1 3 3 1 ⟩\n⟨ 1 4 6 4 1 ⟩\n⟨ 1 5 10 10 5 1 ⟩\n","language":"BQN"},{"code":"( out$\"Number of rows? \"\n& get':?R\n& -1:?I\n& whl\n ' ( 1+!I:<!R:?I\n & 1:?C\n & -1:?K\n & !R+-1*!I:?tabs\n & whl'(!tabs+-1:>0:?tabs&put$\\t)\n & whl\n ' ( 1+!K:~>!I:?K\n & put$(!C \\t\\t)\n & !C*(!I+-1*!K)*(!K+1)^-1:?C\n )\n & put$\\n\n )\n&\n)\n","language":"Bracmat"},{"code":"blsq ) {1}{1 1}{^^2CO{p^?+}m[1+]1[+}15E!#s<-spbx#S\n1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n1 5 10 10 5 1\n1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n1 8 28 56 70 56 28 8 1\n1 9 36 84 126 126 84 36 9 1\n1 10 45 120 210 252 210 120 45 10 1\n1 11 55 165 330 462 462 330 165 55 11 1\n1 12 66 220 495 792 924 792 495 220 66 12 1\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\n1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16 1\n","language":"Burlesque"},{"code":"#include <stdio.h>\n\nvoid pascaltriangle(unsigned int n)\n{\n unsigned int c, i, j, k;\n\n for(i=0; i < n; i++) {\n c = 1;\n for(j=1; j <= 2*(n-1-i); j++) printf(\" \");\n for(k=0; k <= i; k++) {\n printf(\"%3d \", c);\n c = c * (i-k)/(k+1);\n }\n printf(\"\\n\");\n }\n}\n\nint main()\n{\n pascaltriangle(8);\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n\n#define D 32\nint pascals(int *x, int *y, int d)\n{\n\tint i;\n\tfor (i = 1; i < d; i++)\n\t\tprintf(\"%d%c\", y[i] = x[i - 1] + x[i],\n\t\t\ti < d - 1 ? ' ' : '\\n');\n\n\treturn D > d ? pascals(y, x, d + 1) : 0;\n}\n\nint main()\n{\n\tint x[D] = {0, 1, 0}, y[D] = {0};\n\treturn pascals(x, y, 0);\n}\n","language":"C"},{"code":"void triangleC(int nRows) {\n if (nRows <= 0) return;\n int *prevRow = NULL;\n for (int r = 1; r <= nRows; r++) {\n int *currRow = malloc(r * sizeof(int));\n for (int i = 0; i < r; i++) {\n int val = i==0 || i==r-1 ? 1 : prevRow[i-1] + prevRow[i];\n currRow[i] = val;\n printf(\" %4d\", val);\n }\n printf(\"\\n\");\n free(prevRow);\n prevRow = currRow;\n }\n free(prevRow);\n}\n","language":"C"},{"code":"#include <iostream>\n#include <algorithm>\n#include<cstdio>\nusing namespace std;\nvoid Pascal_Triangle(int size) {\n\n\tint a[100][100];\n\tint i, j;\n\n\t//first row and first coloumn has the same value=1\n\tfor (i = 1; i <= size; i++) {\n\t\ta[i][1] = a[1][i] = 1;\n\t}\n\t\n\t//Generate the full Triangle\n\tfor (i = 2; i <= size; i++) {\n\t\tfor (j = 2; j <= size - i; j++) {\n\t\t\tif (a[i - 1][j] == 0 || a[i][j - 1] == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\ta[i][j] = a[i - 1][j] + a[i][j - 1];\n\t\t}\n\t}\n\n\t/*\n\t 1 1 1 1\n\t 1 2 3\n\t 1 3\n\t 1\n\t\n\tfirst print as above format-->\n\t\n\tfor (i = 1; i < size; i++) {\n\t\tfor (j = 1; j < size; j++) {\n\t\t\tif (a[i][j] == 0) {\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\tprintf(\"%8d\",a[i][j]);\n\t\t}\n\t\t\tcout<<\"\\n\\n\";\n\t}*/\n\t\n\t// standard Pascal Triangle Format\n\t\n\tint row,space;\n\tfor (i = 1; i < size; i++) {\n\t\tspace=row=i;\n\t\tj=1;\n\t\t\n\t\twhile(space<=size+(size-i)+1){\n\t\t\t cout<<\" \";\n\t\t\t space++;\n\t\t }\n\t\t\n\t\twhile(j<=i){\n\t\t\tif (a[row][j] == 0){\n\t\t\t\t break;\n\t\t\t }\n\t\t\t\n\t\t\tif(j==1){\n\t\t\t\tprintf(\"%d\",a[row--][j++]);\n\t\t\t}\n\t\t\telse\n\t\t\t\tprintf(\"%6d\",a[row--][j++]);\n\t\t}\n\t\t\tcout<<\"\\n\\n\";\n\t}\n\t\n}\n\nint main()\n{\n\t//freopen(\"out.txt\",\"w\",stdout);\n\t\n\tint size;\n\tcin>>size;\n\tPascal_Triangle(size);\n}\n\n}\n","language":"C++"},{"code":"// Compile with -std=c++11\n#include<iostream>\n#include<vector>\nusing namespace std;\nvoid print_vector(vector<int> dummy){\n\tfor (vector<int>::iterator i = dummy.begin(); i != dummy.end(); ++i)\n\t\tcout<<*i<<\" \";\n\tcout<<endl;\n}\nvoid print_vector_of_vectors(vector<vector<int>> dummy){\n\tfor (vector<vector<int>>::iterator i = dummy.begin(); i != dummy.end(); ++i)\n\t\tprint_vector(*i);\n\tcout<<endl;\n}\nvector<vector<int>> dynamic_triangle(int dummy){\n\tvector<vector<int>> result;\n\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\n\t\tvector<int> row;\n\t\t// The first row\n\t\trow.push_back(1);\n\t\tresult.push_back(row);\n\t\t// The second row\n\t\tif (dummy > 1){\n\t\t\trow.clear();\n\t\t\trow.push_back(1); row.push_back(1);\n\t\t\tresult.push_back(row);\n\t\t}\n\t\t// The other rows\n\t\tif (dummy > 2){\n\t\t\tfor (int i = 2; i < dummy; i++){\n\t\t\t\trow.clear();\n\t\t\t\trow.push_back(1);\n\t\t\t\tfor (int j = 1; j < i; j++)\n\t\t\t\t\trow.push_back(result.back().at(j - 1) + result.back().at(j));\n\t\t\t\trow.push_back(1);\n\t\t\t\tresult.push_back(row);\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\nvector<vector<int>> static_triangle(int dummy){\n\tvector<vector<int>> result;\n\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\n\t\tvector<int> row;\n\t\tresult.resize(dummy); // This should work faster than consecutive push_back()s\n\t\t// The first row\n\t\trow.resize(1);\n\t\trow.at(0) = 1;\n\t\tresult.at(0) = row;\n\t\t// The second row\n\t\tif (result.size() > 1){\n\t\t\trow.resize(2);\n\t\t\trow.at(0) = 1; row.at(1) = 1;\n\t\t\tresult.at(1) = row;\n\t\t}\n\t\t// The other rows\n\t\tif (result.size() > 2){\n\t\t\tfor (int i = 2; i < result.size(); i++){\n\t\t\t\trow.resize(i + 1); // This should work faster than consecutive push_back()s\n\t\t\t\trow.front() = 1;\n\t\t\t\tfor (int j = 1; j < row.size() - 1; j++)\n\t\t\t\t\trow.at(j) = result.at(i - 1).at(j - 1) + result.at(i - 1).at(j);\n\t\t\t\trow.back() = 1;\n\t\t\t\tresult.at(i) = row;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\nint main(){\n\tvector<vector<int>> triangle;\n\tint n;\n\tcout<<endl<<\"The Pascal's Triangle\"<<endl<<\"Enter the number of rows: \";\n\tcin>>n;\n\t// Call the dynamic function\n\ttriangle = dynamic_triangle(n);\n\tcout<<endl<<\"Calculated using dynamic vectors:\"<<endl<<endl;\n\tprint_vector_of_vectors(triangle);\n\t// Call the static function\n\ttriangle = static_triangle(n);\n\tcout<<endl<<\"Calculated using static vectors:\"<<endl<<endl;\n\tprint_vector_of_vectors(triangle);\n\treturn 0;\n}\n","language":"C++"},{"code":"// Compile with -std=c++11\n#include<iostream>\n#include<vector>\nusing namespace std;\nclass pascal_triangle{\n\tvector<vector<int>> data; // This is the actual data\n\tvoid print_row(vector<int> dummy){\n\t\tfor (vector<int>::iterator i = dummy.begin(); i != dummy.end(); ++i)\n\t\t\tcout<<*i<<\" \";\n\t\tcout<<endl;\n\t}\npublic:\n\tpascal_triangle(int dummy){ // Everything is done on the construction phase\n\t\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\n\t\t\tvector<int> row;\n\t\t\tdata.resize(dummy); // Theoretically this should work faster than consecutive push_back()s\n\t\t\t// The first row\n\t\t\trow.resize(1);\n\t\t\trow.at(0) = 1;\n\t\t\tdata.at(0) = row;\n\t\t\t// The second row\n\t\t\tif (data.size() > 1){\n\t\t\t\trow.resize(2);\n\t\t\t\trow.at(0) = 1; row.at(1) = 1;\n\t\t\t\tdata.at(1) = row;\n\t\t\t}\n\t\t\t// The other rows\n\t\t\tif (data.size() > 2){\n\t\t\t\tfor (int i = 2; i < data.size(); i++){\n\t\t\t\t\trow.resize(i + 1); // Theoretically this should work faster than consecutive push_back()s\n\t\t\t\t\trow.front() = 1;\n\t\t\t\t\tfor (int j = 1; j < row.size() - 1; j++)\n\t\t\t\t\t\trow.at(j) = data.at(i - 1).at(j - 1) + data.at(i - 1).at(j);\n\t\t\t\t\trow.back() = 1;\n\t\t\t\t\tdata.at(i) = row;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t~pascal_triangle(){\n\t\tfor (vector<vector<int>>::iterator i = data.begin(); i != data.end(); ++i)\n\t\t\ti->clear(); // I'm not sure about the necessity of this loop!\n\t\tdata.clear();\n\t}\n\tvoid print_row(int dummy){\n\t\tif (dummy < data.size())\n\t\t\tfor (vector<int>::iterator i = data.at(dummy).begin(); i != data.at(dummy).end(); ++i)\n\t\t\t\tcout<<*i<<\" \";\n\t\tcout<<endl;\n\t}\n\tvoid print(){\n\t\tfor (int i = 0; i < data.size(); i++)\n\t\t\tprint_row(i);\n\t}\n\tint get_coeff(int dummy1, int dummy2){\n\t\tint result = 0;\n\t\tif ((dummy1 < data.size()) && (dummy2 < data.at(dummy1).size()))\n\t\t\t\tresult = data.at(dummy1).at(dummy2);\n\t\treturn result;\n\t}\n\tvector<int> get_row(int dummy){\n\t\tvector<int> result;\n\t\tif (dummy < data.size())\n\t\t\tresult = data.at(dummy);\n\t\treturn result;\n\t}\n};\nint main(){\n\tint n;\n\tcout<<endl<<\"The Pascal's Triangle with a class!\"<<endl<<endl<<\"Enter the number of rows: \";\n\tcin>>n;\n\tpascal_triangle myptri(n);\n\tcout<<endl<<\"The whole triangle:\"<<endl;\n\tmyptri.print();\n\tcout<<endl<<\"Just one row:\"<<endl;\n\tmyptri.print_row(n/2);\n\tcout<<endl<<\"Just one coefficient:\"<<endl;\n\tcout<<myptri.get_coeff(n/2, n/4)<<endl<<endl;\n\treturn 0;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace RosettaCode {\n\n class PascalsTriangle {\n\n public static void CreateTriangle(int n) {\n if (n > 0) {\n for (int i = 0; i < n; i++) {\n int c = 1;\n Console.Write(\" \".PadLeft(2 * (n - 1 - i)));\n for (int k = 0; k <= i; k++) {\n Console.Write(\"{0}\", c.ToString().PadLeft(3));\n c = c * (i - k) / (k + 1);\n }\n Console.WriteLine();\n }\n }\n }\n\n public static void Main() {\n CreateTriangle(8);\n }\n }\n}\n","language":"C-sharp"},{"code":"using System;\nusing System.Linq;\nusing System.Numerics;\nusing System.Collections.Generic;\n\nnamespace RosettaCode\n{\n\tpublic static class PascalsTriangle\n\t{\t\t\n\t\tpublic static IEnumerable<BigInteger[]> GetTriangle(int quantityOfRows)\n\t\t{\n\t\t\tIEnumerable<BigInteger> range = Enumerable.Range(0, quantityOfRows).Select(num => new BigInteger(num));\n\t\t\treturn range.Select(num => GetRow(num).ToArray());\n\t\t}\n\n\t\tpublic static IEnumerable<BigInteger> GetRow(BigInteger rowNumber)\n\t\t{\n\t\t\tBigInteger denominator = 1;\n\t\t\tBigInteger numerator = rowNumber;\n\n\t\t\tBigInteger currentValue = 1;\n\t\t\tfor (BigInteger counter = 0; counter <= rowNumber; counter++)\n\t\t\t{\n\t\t\t\tyield return currentValue;\n\t\t\t\tcurrentValue = BigInteger.Multiply(currentValue, numerator--);\n\t\t\t\tcurrentValue = BigInteger.Divide(currentValue, denominator++);\n\t\t\t}\n\t\t\tyield break;\n\t\t}\n\n\t\tpublic static string FormatTriangleString(IEnumerable<BigInteger[]> triangle)\n\t\t{\n\t\t\tint maxDigitWidth = triangle.Last().Max().ToString().Length;\n\t\t\tIEnumerable<string> rows = triangle.Select(arr =>\n\t\t\t\t\tstring.Join(\" \", arr.Select(array => CenterString(array.ToString(), maxDigitWidth)) )\n\t\t\t);\n\t\t\tint maxRowWidth = rows.Last().Length;\n\t\t\treturn string.Join(Environment.NewLine, rows.Select(row => CenterString(row, maxRowWidth)));\n\t\t}\n\n\t\tprivate static string CenterString(string text, int width)\n\t\t{\n\t\t\tint spaces = width - text.Length;\n\t\t\tint padLeft = (spaces / 2) + text.Length;\n\t\t\treturn text.PadLeft(padLeft).PadRight(width);\n\t\t}\n\t}\n}\n","language":"C-sharp"},{"code":"static void Main()\n{\n\tIEnumerable<BigInteger[]> triangle = PascalsTriangle.GetTriangle(20);\n\tstring output = PascalsTriangle.FormatTriangleString(triangle)\n\tConsole.WriteLine(output);\n}\n","language":"C-sharp"},{"code":"(defn pascal [n]\n (let [newrow (fn newrow [lst ret]\n (if lst\n (recur (rest lst)\n (conj ret (+ (first lst) (or (second lst) 0))))\n ret))\n genrow (fn genrow [n lst]\n (when (< 0 n)\n (do (println lst)\n (recur (dec n) (conj (newrow lst []) 1)))))]\n (genrow n [1])))\n(pascal 4)\n","language":"Clojure"},{"code":"(defn nextrow [row]\n (vec (concat [1] (map #(apply + %) (partition 2 1 row)) [1] )))\n\n(defn pascal [n]\n (assert (and (integer? n) (pos? n)))\n (let [triangle (take n (iterate nextrow [1]))]\n (doseq [row triangle]\n (println row))))\n","language":"Clojure"},{"code":"(def pascal\n (iterate\n (fn [prev-row]\n (->>\n (concat [[(first prev-row)]] (partition 2 1 prev-row) [[(last prev-row)]])\n (map (partial apply +) ,,,)))\n [1]))\n","language":"Clojure"},{"code":"(def pascal\n (iterate #(concat [1]\n (map + % (rest %))\n [1])\n [1]))\n","language":"Clojure"},{"code":"(take 10 pascal) ; returns a list of the first 10 pascal rows\n","language":"Clojure"},{"code":"(nth pascal 10) ;returns the nth row\n","language":"Clojure"},{"code":"pascal = (n) ->\n width = 6\n for r in [1..n]\n s = ws (width/2) * (n-r) # center row\n output = (n) -> s += pad width, n\n cell = 1\n output cell\n # Compute binomial coefficients as you go\n # across the row.\n for c in [1...r]\n cell *= (r-c) / c\n output cell\n console.log s\n\nws = (n) ->\n s = ''\n s += ' ' for i in [0...n]\n s\n\npad = (cnt, n) ->\n s = n.toString()\n # There is probably a better way to do this.\n cnt -= s.length\n right = Math.floor(cnt / 2)\n left = cnt - right\n ws(left) + s + ws(right)\n\npascal(7)\n","language":"CoffeeScript"},{"code":"10 INPUT \"HOW MANY\";N\n20 IF N<1 THEN END\n30 DIM C(N)\n40 DIM D(N)\n50 LET C(1)=1\n60 LET D(1)=1\n70 FOR J=1 TO N\n80 FOR I=1 TO N-J+1\n90 PRINT \" \";\n100 NEXT I\n110 FOR I=1 TO J\n120 PRINT C(I)\" \";\n130 NEXT I\n140 PRINT\n150 IF J=N THEN END\n160 C(J+1)=1\n170 D(J+1)=1\n180 FOR I=1 TO J-1\n190 D(I+1)=C(I)+C(I+1)\n200 NEXT I\n210 FOR I=1 TO J\n220 C(I)=D(I)\n230 NEXT I\n240 NEXT J\n","language":"Commodore-BASIC"},{"code":"RUN\nHOW MANY? 8\n 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n 1 5 10 10 5 1\n 1 6 15 20 15 6 1\n 1 7 21 35 35 21 7 1\n 1 8 28 56 70 56 28 8 1\nREADY.\n","language":"Commodore-BASIC"},{"code":"(defun pascal (n)\n (genrow n '(1)))\n\n(defun genrow (n l)\n (when (plusp n)\n (print l)\n (genrow (1- n) (cons 1 (newrow l)))))\n\n(defun newrow (l)\n (if (null (rest l))\n '(1)\n (cons (+ (first l) (second l))\n (newrow (rest l)))))\n","language":"Common-Lisp"},{"code":"(defun pascal-next-row (a)\n (loop :for q :in a\n :and p = 0 :then q\n :as s = (list (+ p q))\n :nconc s :into a\n :finally (rplacd s (list 1))\n (return a)))\n\n(defun pascal (n)\n (loop :for a = (list 1) :then (pascal-next-row a)\n :repeat n\n :collect a))\n","language":"Common-Lisp"},{"code":"(defun next-pascal-triangle-row (list)\n `(1\n ,.(mapcar #'+ list (rest list))\n 1))\n\n(defun pascal-triangle (number-of-rows)\n (loop repeat number-of-rows\n for row = '(1) then (next-pascal-triangle-row row)\n collect row))\n\n(defun print-pascal-triangle (number-of-rows)\n (let* ((triangle (pascal-triangle number-of-rows))\n (max-row-length (length (write-to-string (first (last triangle))))))\n (format t\n (format nil \"~~{~~~D:@<~~{~~A ~~}~~>~~%~~}\" max-row-length)\n triangle)))\n","language":"Common-Lisp"},{"code":"(print-pascal-triangle 4)\n","language":"Common-Lisp"},{"code":" 1\n 1 1\n 1 2 1\n1 3 3 1\n","language":"Common-Lisp"},{"code":"(print-pascal-triangle 8)\n","language":"Common-Lisp"},{"code":" 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n 1 5 10 10 5 1\n 1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n","language":"Common-Lisp"},{"code":"MODULE PascalTriangle;\nIMPORT StdLog, DevCommanders, TextMappers;\n\nTYPE\n\tExpansion* = POINTER TO ARRAY OF LONGINT;\n\nPROCEDURE Show*(e: Expansion);\nVAR\n\ti: INTEGER;\nBEGIN\n\ti := 0;\n\tWHILE (i < LEN(e)) & (e[i] # 0) DO\n\t\tStdLog.Int(e[i]);\n\t\tINC(i)\n\tEND;\n\tStdLog.Ln\nEND Show;\n\nPROCEDURE GenFor*(p: LONGINT): Expansion;\nVAR\n\texpA,expB: Expansion;\n\ti,j: LONGINT;\n\t\n\tPROCEDURE Swap(VAR x,y: Expansion);\n\tVAR\n\t\tswap: Expansion;\n\tBEGIN\n\t\tswap := x; x := y; y := swap\n\tEND Swap;\n\t\nBEGIN\n\tASSERT(p >= 0);\n\tNEW(expA,p + 2);NEW(expB,p + 2);\n\tFOR i := 0 TO p DO\n\t\tIF i = 0 THEN expA[0] := 1\n\t\tELSE\n\t\t\tFOR j := 0 TO i DO\n\t\t\t\tIF j = 0 THEN\n\t\t\t\t\texpB[j] := expA[j]\n\t\t\t\tELSE\n\t\t\t\t\texpB[j] := expA[j - 1] + expA[j]\n\t\t\t\tEND\n\t\t\tEND;\n\t\t\tSwap(expA,expB)\n\t\tEND;\n\tEND;\n\texpB := NIL; (* for the GC *)\n\tRETURN expA\nEND GenFor;\n\n\nPROCEDURE Do*;\nVAR\n\ts: TextMappers.Scanner;\n\texp: Expansion;\nBEGIN\n\ts.ConnectTo(DevCommanders.par.text);\n\ts.SetPos(DevCommanders.par.beg);\n\ts.Scan;\n\tWHILE (~s.rider.eot) DO\n\t\tIF (s.type = TextMappers.char) & (s.char = '~') THEN\n\t\t\tRETURN\n\t\tELSIF (s.type = TextMappers.int) THEN\n\t\t\texp := GenFor(s.int);\n\t\t\tShow(exp)\n\t\tEND;\n\t\ts.Scan\n\tEND\nEND Do;\n\nEND PascalTriangle.\n","language":"Component-Pascal"},{"code":"int[][] pascalsTriangle(in int rows) pure nothrow {\n auto tri = new int[][rows];\n foreach (r; 0 .. rows) {\n int v = 1;\n foreach (c; 0 .. r+1) {\n tri[r] ~= v;\n v = (v * (r - c)) / (c + 1);\n }\n }\n return tri;\n}\n\nvoid main() {\n immutable t = pascalsTriangle(10);\n assert(t == [[1],\n [1, 1],\n [1, 2, 1],\n [1, 3, 3, 1],\n [1, 4, 6, 4, 1],\n [1, 5, 10, 10, 5, 1],\n [1, 6, 15, 20, 15, 6, 1],\n [1, 7, 21, 35, 35, 21, 7, 1],\n [1, 8, 28, 56, 70, 56, 28, 8, 1],\n [1, 9, 36, 84, 126, 126, 84, 36, 9, 1]]);\n}\n","language":"D"},{"code":"import std.stdio, std.algorithm, std.range;\n\nauto pascal() pure nothrow {\n return [1].recurrence!q{ zip(a[n - 1] ~ 0, 0 ~ a[n - 1])\n .map!q{ a[0] + a[1] }\n .array };\n}\n\nvoid main() {\n pascal.take(5).writeln;\n}\n","language":"D"},{"code":"import std.stdio, std.string, std.array, std.format;\n\nstring Pascal(alias dg, T, T initValue)(int n) {\n string output;\n\n void append(in T[] l) {\n output ~= \" \".replicate((n - l.length + 1) * 2);\n foreach (e; l)\n output ~= format(\"%4s\", format(\"%4s\", e));\n output ~= \"\\n\";\n }\n\n if (n > 0) {\n T[][] lines = [[initValue]];\n append(lines[0]);\n foreach (i; 1 .. n) {\n lines ~= lines[i - 1] ~ initValue; // length + 1\n foreach (int j; 1 .. lines[i-1].length)\n lines[i][j] = dg(lines[i-1][j], lines[i-1][j-1]);\n append(lines[i]);\n }\n }\n return output;\n}\n\nstring delegate(int n) genericPascal(alias dg, T, T initValue)() {\n mixin Pascal!(dg, T, initValue);\n return &Pascal;\n}\n\nvoid main() {\n auto pascal = genericPascal!((int a, int b) => a + b, int, 1)();\n static char xor(char a, char b) { return a == b ? '_' : '*'; }\n auto sierpinski = genericPascal!(xor, char, '*')();\n\n foreach (i; [1, 5, 9])\n writef(pascal(i));\n // an order 4 sierpinski triangle is a 2^4 lines generic\n // Pascal triangle with xor operation\n foreach (i; [16])\n writef(sierpinski(i));\n}\n","language":"D"},{"code":"import 'dart:io';\n\npascal(n) {\n if(n<=0) print(\"Not defined\");\n\n else if(n==1) print(1);\n\n else {\n List<List<int>> matrix = new List<List<int>>();\n matrix.add(new List<int>());\n matrix.add(new List<int>());\n matrix[0].add(1);\n matrix[1].add(1);\n matrix[1].add(1);\n for (var i = 2; i < n; i++) {\n List<int> list = new List<int>();\n list.add(1);\n for (var j = 1; j<i; j++) {\n list.add(matrix[i-1][j-1]+matrix[i-1][j]);\n }\n list.add(1);\n matrix.add(list);\n }\n for(var i=0; i<n; i++) {\n for(var j=0; j<=i; j++) {\n stdout.write(matrix[i][j]);\n stdout.write(' ');\n }\n stdout.write('\\n');\n }\n }\n}\n\nvoid main() {\n pascal(0);\n pascal(1);\n pascal(3);\n pascal(6);\n}\n","language":"Dart"},{"code":"program PascalsTriangle;\n\nprocedure Pascal(r:Integer);\nvar\n i, c, k:Integer;\nbegin\n for i := 0 to r - 1 do\n begin\n c := 1;\n for k := 0 to i do\n begin\n Write(c:3);\n c := c * (i - k) div (k + 1);\n end;\n Writeln;\n end;\nend;\n\nbegin\n Pascal(9);\nend.\n","language":"Delphi"},{"code":"procedure Pascal(r : Integer);\nvar\n i, c, k : Integer;\nbegin\n for i:=0 to r-1 do begin\n c:=1;\n for k:=0 to i do begin\n Print(Format('%4d', [c]));\n c:=(c*(i-k)) div (k+1);\n end;\n PrintLn('');\n end;\nend;\n\nPascal(9);\n","language":"DWScript"},{"code":"def pascalsTriangle(n, out) {\n def row := [].diverge(int)\n out.print(\"<table style='text-align: center; border: 0; border-collapse: collapse;'>\")\n for y in 1..n {\n out.print(\"<tr>\")\n row.push(1)\n def skip := n - y\n if (skip > 0) {\n out.print(`<td colspan=\"$skip\"></td>`)\n }\n for x => v in row {\n out.print(`<td>$v</td><td></td>`)\n }\n for i in (1..!y).descending() {\n row[i] += row[i - 1]\n }\n out.println(\"</tr>\")\n }\n out.print(\"</table>\")\n}\n","language":"E"},{"code":"def out := <file:triangle.html>.textWriter()\ntry {\n pascalsTriangle(15, out)\n} finally {\n out.close()\n}\nmakeCommand(\"yourFavoriteWebBrowser\")(\"triangle.html\")\n","language":"E"},{"code":"numfmt 0 4\nproc pascal n . .\n r[] = [ 1 ]\n for i to n\n rn[] = [ ]\n l = 0\n for j to n - len r[]\n write \" \"\n .\n for r in r[]\n write r\n rn[] &= l + r\n l = r\n .\n print \"\"\n rn[] &= l\n swap r[] rn[]\n .\n.\npascal 13\n","language":"EasyLang"},{"code":"note\n\tdescription : \"Prints pascal's triangle\"\n\toutput : \"[\n \t\t\t Per requirements of the RosettaCode example, execution will print the first n rows of pascal's triangle\n \t\t\t ]\"\n\tdate : \"19 December 2013\"\n\tauthors : \"Sandro Meier\", \"Roman Brunner\"\n\trevision : \"1.0\"\n\tlibraries : \"Relies on HASH_TABLE from EIFFEL_BASE library\"\n\timplementation : \"[\n\t\t\t Recursive implementation to calculate the n'th row.\n\t\t\t ]\"\n\twarning : \"[\n\t\t\t\tWill not work for large n's (INTEGER_32)\n\t\t ]\"\n\nclass\n\tAPPLICATION\n\ninherit\n\tARGUMENTS\n\ncreate\n\tmake\n\nfeature {NONE} -- Initialization\n\n\tmake\n\t\tlocal\n\t\t\tn:INTEGER\n\t\tdo\n\t\t\tcreate {HASH_TABLE[ARRAY[INTEGER],INTEGER]}pascal_lines.make (n) --create the hash_table object\n\t\t\tio.new_line\n\t\t\tn:=25\n\t\t\tdraw(n)\n\t\tend\nfeature\n\tline(n:INTEGER):ARRAY[INTEGER]\n\t\t--Calculates the n'th line\n\tlocal\n\t\tupper_line:ARRAY[INTEGER]\n\t\ti:INTEGER\n\tdo\n\t\tif\tn=1 then\t--trivial case first line\n\t\t\tcreate Result.make_filled (0, 1, n+2)\n\t\t\tResult.put (0, 1)\n\t\t\tResult.put (1, 2)\n\t\t\tResult.put (0, 3)\n\t\telseif pascal_lines.has (n) then\t--checks if the result was already calculated\n\t\t\tResult := pascal_lines.at (n)\n\t\telse\t--calculates the n'th line recursively\n\t\t\tcreate Result.make_filled(0,1,n+2) --for caluclation purposes add a 0 at the beginning of each line\n\t\t\tResult.put (0, 1)\n\t\t\tupper_line:=line(n-1)\n\t\t\tfrom\n\t\t\t\ti:=1\n\t\t\tuntil\n\t\t\t\ti>upper_line.count-1\n\t\t\tloop\n\t\t\t\tResult.put(upper_line[i]+upper_line[i+1],i+1)\n\t\t\t\ti:=i+1\n\t\t\tend\n\t\t\tResult.put (0, n+2)\t--for caluclation purposes add a 0 at the end of each line\n\t\t\tpascal_lines.put (Result, n)\n\t\tend\n\tend\n\n\tdraw(n:INTEGER)\n\t\t--draw n lines of pascal's triangle\n\tlocal\n\t\tspace_string:STRING\n\t\twidth, i:INTEGER\n\n\tdo\n\t\tspace_string:=\" \"\t\t--question of design: add space_string at the beginning of each line\n\t\twidth:=line(n).count\n\t\tspace_string.multiply (width)\n\t\tfrom\n\t\t\ti:=1\n\t\tuntil\n\t\t\ti>n\n\t\tloop\n\t\t\tspace_string.remove_tail (1)\n\t\t\tio.put_string (space_string)\n\t\t\tacross line(i) as c\n\t\t\tloop\n\t\t\t\tif\n\t\t\t\t\tc.item/=0\n\t\t\t\tthen\n\t\t\t\t\tio.put_string (c.item.out+\" \")\n\t\t\t\tend\n\t\t\tend\n\t\t\tio.new_line\n\t\t\ti:=i+1\n\t\tend\n\tend\n\nfeature --Access\n\tpascal_lines:HASH_TABLE[ARRAY[INTEGER],INTEGER]\n\t\t--Contains all already calculated lines\nend\n","language":"Eiffel"},{"code":"defmodule Pascal do\n def triangle(n), do: triangle(n,[1])\n\n def triangle(0,list), do: list\n def triangle(n,list) do\n IO.inspect list\n new_list = Enum.zip([0]++list, list++[0]) |> Enum.map(fn {a,b} -> a+b end)\n triangle(n-1,new_list)\n end\nend\n\nPascal.triangle(8)\n","language":"Elixir"},{"code":"(require 'cl-lib)\n\n(defun next-row (row)\n (cl-mapcar #'+ (cons 0 row)\n (append row '(0))))\n\n(defun triangle (row rows)\n (if (= rows 0)\n '()\n (cons row (triangle (next-row row) (- rows 1)))))\n","language":"Emacs-Lisp"},{"code":"(defun pascal (r)\n (dotimes (i r)\n (let ((c 1))\n (dotimes (k (+ i 1))\n (princ (format \"%d \" c))\n (setq c (/ (* c (- i k))\n (+ k 1))))\n (terpri))))\n","language":"Emacs-Lisp"},{"code":"(defun pascal (r)\n (let ((out \"\"))\n (dotimes (i r)\n (let ((c 1))\n (dotimes (k (+ i 1))\n (setq out (concat out (format \"%d \" c)))\n (setq c (/ (* c (- i k))\n (+ k 1))))\n (setq out (concat out \"\\n\"))))\n out))\n","language":"Emacs-Lisp"},{"code":"-import(lists).\n-export([pascal/1]).\n\npascal(1)-> [[1]];\npascal(N) ->\n L = pascal(N-1),\n [H|_] = L,\n [lists:zipwith(fun(X,Y)->X+Y end,[0]++H,H++[0])|L].\n","language":"Erlang"},{"code":"PROGRAM PASCAL_TRIANGLE\n\nPROCEDURE PASCAL(R%)\n LOCAL I%,C%,K%\n FOR I%=0 TO R%-1 DO\n C%=1\n FOR K%=0 TO I% DO\n WRITE(\"###\";C%;)\n C%=(C%*(I%-K%)) DIV (K%+1)\n END FOR\n PRINT\n END FOR\nEND PROCEDURE\n\nBEGIN\n PASCAL(9)\nEND PROGRAM\n","language":"ERRE"},{"code":"sequence row\nrow = {}\nfor m = 1 to 10 do\n row = row & 1\n for n = length(row)-1 to 2 by -1 do\n row[n] += row[n-1]\n end for\n print(1,row)\n puts(1,'\\n')\nend for\n","language":"Euphoria"},{"code":"PASCAL\n=LAMBDA(n,\n BINCOEFF(n - 1)(\n SEQUENCE(1, n, 0, 1)\n )\n)\n\n\nBINCOEFF\n=LAMBDA(n,\n LAMBDA(k,\n QUOTIENT(FACT(n), FACT(k) * FACT(n - k))\n )\n)\n","language":"Excel"},{"code":"TRIANGLE\n=LAMBDA(n,\n LET(\n ixs, SEQUENCE(n, n, 0, 1),\n x, MOD(ixs, n),\n y, QUOTIENT(ixs, n),\n IF(x <= y,\n BINCOEFF(y)(x),\n \"\"\n )\n )\n)\n","language":"Excel"},{"code":"let rec nextrow l =\n match l with\n | [] -> []\n | h :: [] -> [1]\n | h :: t -> h + t.Head :: nextrow t\n\nlet pascalTri n = List.scan(fun l i -> 1 :: nextrow l) [1] [1 .. n]\n\nfor row in pascalTri(10) do\n for i in row do\n printf \"%s\" (i.ToString() + \", \")\n printfn \"%s\" \"\\n\"\n","language":"F-Sharp"},{"code":"USING: grouping kernel math sequences ;\n\n: (pascal) ( seq -- newseq )\n dup last 0 prefix 0 suffix 2 <clumps> [ sum ] map suffix ;\n\n: pascal ( n -- seq )\n 1 - { { 1 } } swap [ (pascal) ] times ;\n","language":"Factor"},{"code":"5 pascal .\n{ { 1 } { 1 1 } { 1 2 1 } { 1 3 3 1 } { 1 4 6 4 1 } }\n","language":"Factor"},{"code":"class Main\n{\n Int[] next_row (Int[] row)\n {\n new_row := [1]\n (row.size-1).times |i|\n {\n new_row.add (row[i] + row[i+1])\n }\n new_row.add (1)\n\n return new_row\n }\n\n Void print_pascal (Int n) // no output for n <= 0\n {\n current_row := [1]\n n.times\n {\n echo (current_row.join(\" \"))\n current_row = next_row (current_row)\n }\n }\n\n Void main ()\n {\n print_pascal (10)\n }\n}\n","language":"Fantom"},{"code":"1.1 S OLD(1)=1; T %4.0, 1, !\n1.2 F N=1,10; D 2\n1.3 Q\n\n2.1 S NEW(1)=1\n2.2 F X=1,N; S NEW(X+1)=OLD(X)+OLD(X+1)\n2.3 F X=1,N+1; D 3\n2.4 T !\n\n3.1 S OLD(X)=NEW(X)\n3.2 T %4.0, OLD(X)\n","language":"FOCAL"},{"code":": init ( n -- )\n here swap cells erase 1 here ! ;\n: .line ( n -- )\n cr here swap 0 do dup @ . cell+ loop drop ;\n: next ( n -- )\n here swap 1- cells here + do\n i @ i cell+ +!\n -1 cells +loop ;\n: pascal ( n -- )\n dup init 1 .line\n 1 ?do i next i 1+ .line loop ;\n","language":"Forth"},{"code":": PascTriangle\n cr dup 0\n ?do\n 1 over 1- i - 2* spaces i 1+ 0 ?do dup 4 .r j i - * i 1+ / loop cr drop\n loop drop\n;\n\n13 PascTriangle\n","language":"Forth"},{"code":"PROGRAM Pascals_Triangle\n\n CALL Print_Triangle(8)\n\nEND PROGRAM Pascals_Triangle\n\nSUBROUTINE Print_Triangle(n)\n\n IMPLICIT NONE\n INTEGER, INTENT(IN) :: n\n INTEGER :: c, i, j, k, spaces\n\n DO i = 0, n-1\n c = 1\n spaces = 3 * (n - 1 - i)\n DO j = 1, spaces\n WRITE(*,\"(A)\", ADVANCE=\"NO\") \" \"\n END DO\n DO k = 0, i\n WRITE(*,\"(I6)\", ADVANCE=\"NO\") c\n c = c * (i - k) / (k + 1)\n END DO\n WRITE(*,*)\n END DO\n\nEND SUBROUTINE Print_Triangle\n","language":"Fortran"},{"code":"' FB 1.05.0 Win64\n\nSub pascalTriangle(n As UInteger)\n If n = 0 Then Return\n Dim prevRow(1 To n) As UInteger\n Dim currRow(1 To n) As UInteger\n Dim start(1 To n) As UInteger ''stores starting column for each row\n start(n) = 1\n For i As Integer = n - 1 To 1 Step -1\n start(i) = start(i + 1) + 3\n Next\n prevRow(1) = 1\n Print Tab(start(1));\n Print 1U\n For i As UInteger = 2 To n\n For j As UInteger = 1 To i\n If j = 1 Then\n Print Tab(start(i)); \"1\";\n currRow(1) = 1\n ElseIf j = i Then\n Print \" 1\"\n currRow(i) = 1\n Else\n currRow(j) = prevRow(j - 1) + prevRow(j)\n Print Using \"######\"; currRow(j); \" \";\n End If\n Next j\n For j As UInteger = 1 To i\n prevRow(j) = currRow(j)\n Next j\n Next i\nEnd Sub\n\npascalTriangle(14)\nPrint\nPrint \"Press any key to quit\"\nSleep\n","language":"FreeBASIC"},{"code":"pascal[rows] :=\n{\n widest = length[toString[binomial[rows-1, (rows-1) div 2]]]\n\n for row = 0 to rows-1\n {\n line = repeat[\" \", round[(rows-row)* (widest+1)/2]]\n for col = 0 to row\n line = line + padRight[binomial[row, col], widest+1, \" \"]\n\n println[line]\n }\n}\n\npascal[10]\n","language":"Frink"},{"code":"import lists.zip\n\ndef\n pascal( 1 ) = [1]\n pascal( n ) = [1] + map( (a, b) -> a + b, zip(pascal(n-1), pascal(n-1).tail()) ) + [1]\n","language":"FunL"},{"code":"import integers.choose\n\ndef pascal( n ) = [choose( n - 1, k ) | k <- 0..n-1]\n","language":"FunL"},{"code":"def triangle( height ) =\n width = max( map(a -> a.toString().length(), pascal(height)) )\n\n if 2|width\n width++\n\n for n <- 1..height\n print( ' '*((width + 1)\\2)*(height - n) )\n println( map(a -> format('%' + width + 'd ', a), pascal(n)).mkString() )\n\ntriangle( 10 )\n","language":"FunL"},{"code":"Pascal := function(n)\n\tlocal i, v;\n\tv := [1];\n\tfor i in [1 .. n] do\n\t\tDisplay(v);\n\t\tv := Concatenation([0], v) + Concatenation(v, [0]);\n\tod;\nend;\n\nPascal(9);\n# [ 1 ]\n# [ 1, 1 ]\n# [ 1, 2, 1 ]\n# [ 1, 3, 3, 1 ]\n# [ 1, 4, 6, 4, 1 ]\n# [ 1, 5, 10, 10, 5, 1 ]\n# [ 1, 6, 15, 20, 15, 6, 1 ]\n# [ 1, 7, 21, 35, 35, 21, 7, 1 ]\n# [ 1, 8, 28, 56, 70, 56, 28, 8, 1 ]\n","language":"GAP"},{"code":"package main\n\nimport \"fmt\"\n\nfunc printTriangle(n int) {\n // degenerate cases\n if n <= 0 {\n return\n }\n fmt.Println(1)\n if n == 1 {\n return\n }\n // iterate over rows, zero based\n a := make([]int, (n+1)/2)\n a[0] = 1\n for row, middle := 1, 0; row < n; row++ {\n // generate new row\n even := row&1 == 0\n if even {\n a[middle+1] = a[middle] * 2\n }\n for i := middle; i > 0; i-- {\n a[i] += a[i-1]\n }\n // print row\n for i := 0; i <= middle; i++ {\n fmt.Print(a[i], \" \")\n }\n if even {\n middle++\n }\n for i := middle; i >= 0; i-- {\n fmt.Print(a[i], \" \")\n }\n fmt.Println(\"\")\n }\n}\n\nfunc main() {\n printTriangle(4)\n}\n","language":"Go"},{"code":"def pascal\npascal = { n -> (n <= 1) ? [1] : [[0] + pascal(n - 1), pascal(n - 1) + [0]].transpose().collect { it.sum() } }\n","language":"Groovy"},{"code":"def count = 15\n(1..count).each { n ->\n printf (\"%2d:\", n); (0..(count-n)).each { print \" \" }; pascal(n).each{ printf(\"%6d \", it) }; println \"\"\n}\n","language":"Groovy"},{"code":"10 INPUT \"Number of rows? \",R\n20 FOR I=0 TO R-1\n30 C=1\n40 FOR K=0 TO I\n50 PRINT USING \"####\";C;\n60 C=C*(I-K)/(K+1)\n70 NEXT\n80 PRINT\n90 NEXT\n","language":"GW-BASIC"},{"code":"zapWith :: (a -> a -> a) -> [a] -> [a] -> [a]\nzapWith f xs [] = xs\nzapWith f [] ys = ys\nzapWith f (x:xs) (y:ys) = f x y : zapWith f xs ys\n","language":"Haskell"},{"code":"extendWith f [] = []\nextendWith f xs@(x:ys) = x : zapWith f xs ys\n","language":"Haskell"},{"code":"pascal = iterate (extendWith (+)) [1]\n","language":"Haskell"},{"code":"*Main> take 6 pascal\n[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1],[1,5,10,10,5,1]]\n","language":"Haskell"},{"code":"-- generate next row from current row\nnextRow row = zipWith (+) ([0] ++ row) (row ++ [0])\n\n-- returns the first n rows\npascal = iterate nextRow [1]\n","language":"Haskell"},{"code":"pascal :: [[Integer]]\npascal =\n (1 : [ 0 | _ <- head pascal])\n : [zipWith (+) (0:row) row | row <- pascal]\n","language":"Haskell"},{"code":"*Pascal> take 5 <$> (take 5 $ triangle)\n[[1,0,0,0,0],[1,1,0,0,0],[1,2,1,0,0],[1,3,3,1,0],[1,4,6,4,1]]\n","language":"Haskell"},{"code":"fac = product . enumFromTo 1\n\nbinCoef n k = fac n `div` (fac k * fac (n - k))\n\npascal = ((fmap . binCoef) <*> enumFromTo 0) . pred\n","language":"Haskell"},{"code":"*Main> putStr $ unlines $ map unwords $ map (map show) $ pascal 10\n1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n1 5 10 10 5 1\n1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n1 8 28 56 70 56 28 8 1\n1 9 36 84 126 126 84 36 9 1\n","language":"Haskell"},{"code":" CALL Pascal(30)\n\nSUBROUTINE Pascal(rows)\n CHARACTER fmt*6\n WRITE(Text=fmt, Format='\"i\", i5.5') 1+rows/4\n\n DO row = 0, rows-1\n n = 1\n DO k = 0, row\n col = rows*(rows-row+2*k)/4\n WRITE(Row=row+1, Column=col, F=fmt) n\n n = n * (row - k) / (k + 1)\n ENDDO\n ENDDO\nEND\n","language":"HicEst"},{"code":"link math\n\nprocedure main(A)\nevery n := !A do { # for each command line argument\n n := integer(\\n) | &null\n pascal(n)\n }\nend\n\nprocedure pascal(n)\t\t#: Pascal triangle\n /n := 16\n write(\"width=\", n, \" height=\", n)\t# carpet header\n fw := *(2 ^ n)+1\n every i := 0 to n - 1 do {\n writes(repl(\" \",fw*(n-i)/2))\n every j := 0 to n - 1 do\n writes(center(binocoef(i, j),fw) | break)\n write()\n }\nend\n","language":"Icon"},{"code":"Pro Pascal, n\n;n is the number of lines of the triangle to be displayed\n r=[1]\n print, r\n for i=0, (n-2) do begin\n pascalrow,r\n endfor\nEnd\n\nPro PascalRow, r\n for i=0,(n_elements(r)-2) do begin\n r[i]=r[i]+r[i+1]\n endfor\nr= [1, r]\nprint, r\n\nEnd\n","language":"IDL"},{"code":"100 PROGRAM \"PascalTr.bas\"\n110 TEXT 80\n120 LET ROW=12\n130 FOR I=0 TO ROW\n140 LET C=1\n150 PRINT TAB(37-I*3);\n160 FOR K=0 TO I\n170 PRINT USING \" #### \":C;\n180 LET C=C*(I-K)/(K+1)\n190 NEXT\n200 PRINT\n210 NEXT\n","language":"IS-BASIC"},{"code":" !~/~ i.5\n1 0 0 0 0\n1 1 0 0 0\n1 2 1 0 0\n1 3 3 1 0\n1 4 6 4 1\n","language":"J"},{"code":" ([: \":@-.&0\"1 !~/~)@i. 5\n1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n","language":"J"},{"code":" (-@|. |.\"_1 [: \":@-.&0\"1 !~/~)@i. 5\n 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n","language":"J"},{"code":" (|.\"_1~ 0-3*i.@-@#) ;@((<'%6d') sprintf each -.&0)\"1 !~/~i.10\n 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n 1 5 10 10 5 1\n 1 6 15 20 15 6 1\n 1 7 21 35 35 21 7 1\n 1 8 28 56 70 56 28 8 1\n 1 9 36 84 126 126 84 36 9 1\n","language":"J"},{"code":" i:5\n_5 _4 _3 _2 _1 0 1 2 3 4 5\n !~/~i:5\n 1 0 0 0 0 1 _5 15 _35 70 _126\n_4 1 0 0 0 1 _4 10 _20 35 _56\n 6 _3 1 0 0 1 _3 6 _10 15 _21\n_4 3 _2 1 0 1 _2 3 _4 5 _6\n 1 _1 1 _1 1 1 _1 1 _1 1 _1\n 0 0 0 0 0 1 0 0 0 0 0\n 0 0 0 0 0 1 1 0 0 0 0\n 0 0 0 0 0 1 2 1 0 0 0\n 0 0 0 0 0 1 3 3 1 0 0\n 0 0 0 0 0 1 4 6 4 1 0\n 0 0 0 0 0 1 5 10 10 5 1\n !/~i:5\n 1 _4 6 _4 1 0 0 0 0 0 0\n 0 1 _3 3 _1 0 0 0 0 0 0\n 0 0 1 _2 1 0 0 0 0 0 0\n 0 0 0 1 _1 0 0 0 0 0 0\n 0 0 0 0 1 0 0 0 0 0 0\n 1 1 1 1 1 1 1 1 1 1 1\n _5 _4 _3 _2 _1 0 1 2 3 4 5\n 15 10 6 3 1 0 0 1 3 6 10\n _35 _20 _10 _4 _1 0 0 0 1 4 10\n 70 35 15 5 1 0 0 0 0 1 5\n_126 _56 _21 _6 _1 0 0 0 0 0 1\n","language":"J"},{"code":"import java.util.ArrayList;\n...//class definition, etc.\npublic static void genPyrN(int rows){\n\tif(rows < 0) return;\n\t//save the last row here\n\tArrayList<Integer> last = new ArrayList<Integer>();\n\tlast.add(1);\n\tSystem.out.println(last);\n\tfor(int i= 1;i <= rows;++i){\n\t\t//work on the next row\n\t\tArrayList<Integer> thisRow= new ArrayList<Integer>();\n\t\tthisRow.add(last.get(0)); //beginning\n\t\tfor(int j= 1;j < i;++j){//loop the number of elements in this row\n\t\t\t//sum from the last row\n\t\t\tthisRow.add(last.get(j - 1) + last.get(j));\n\t\t}\n\t\tthisRow.add(last.get(0)); //end\n\t\tlast= thisRow;//save this row\n\t\tSystem.out.println(thisRow);\n\t}\n}\n","language":"Java"},{"code":"public class Pas{\n\tpublic static void main(String[] args){\n\t\t//usage\n\t\tpas(20);\n\t}\n\n\tpublic static void pas(int rows){\n\t\tfor(int i = 0; i < rows; i++){\n\t\t\tfor(int j = 0; j <= i; j++){\n\t\t\t\tSystem.out.print(ncr(i, j) + \" \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}\n\n\tpublic static long ncr(int n, int r){\n\t\treturn fact(n) / (fact(r) * fact(n - r));\n\t}\n\n\tpublic static long fact(int n){\n\t\tlong ans = 1;\n\t\tfor(int i = 2; i <= n; i++){\n\t\t\tans *= i;\n\t\t}\n\t\treturn ans;\n\t}\n}\n","language":"Java"},{"code":"public class Pascal {\n\tprivate static void printPascalLine (int n) {\n\t\tif (n < 1)\n\t\t\treturn;\n\t\tint m = 1;\n\t\tSystem.out.print(\"1 \");\n\t\tfor (int j=1; j<n; j++) {\n\t\t\tm = m * (n-j)/j;\n\t\t\tSystem.out.print(m);\n\t\t\tSystem.out.print(\" \");\n\t\t}\n\t\tSystem.out.println();\n\t}\n\t\n\tpublic static void printPascal (int nRows) {\n\t\tfor(int i=1; i<=nRows; i++)\n\t\t\tprintPascalLine(i);\n\t}\n}\n","language":"Java"},{"code":"// Pascal's triangle object\nfunction pascalTriangle (rows) {\n\n\t// Number of rows the triangle contains\n\tthis.rows = rows;\n\n\t// The 2D array holding the rows of the triangle\n\tthis.triangle = new Array();\n\tfor (var r = 0; r < rows; r++) {\n\t\tthis.triangle[r] = new Array();\n\t\tfor (var i = 0; i <= r; i++) {\n\t\t\tif (i == 0 || i == r)\n\t\t\t\tthis.triangle[r][i] = 1;\n\t\t\telse\n\t\t\t\tthis.triangle[r][i] = this.triangle[r-1][i-1]+this.triangle[r-1][i];\n\t\t}\n\t}\n\n\t// Method to print the triangle\n\tthis.print = function(base) {\n\t\tif (!base)\n\t\t\tbase = 10;\n\n\t\t// Private method to calculate digits in number\n\t\tvar digits = function(n,b) {\n\t\t\tvar d = 0;\n\t\t\twhile (n >= 1) {\n\t\t\t\td++;\n\t\t\t\tn /= b;\n\t\t\t}\n\t\t\treturn d;\n\t\t}\n\n\t\t// Calculate max spaces needed\n\t\tvar spacing = digits(this.triangle[this.rows-1][Math.round(this.rows/2)],base);\n\n\t\t// Private method to add spacing between numbers\n\t\tvar insertSpaces = function(s) {\n\t\t\tvar buf = \"\";\n\t\t\twhile (s > 0) {\n\t\t\t\ts--;\n\t\t\t\tbuf += \" \";\n\t\t\t}\n\t\t\treturn buf;\n\t\t}\n\n\t\t// Print the triangle line by line\n\t\tfor (var r = 0; r < this.triangle.length; r++) {\n\t\t\tvar l = \"\";\n\t\t\tfor (var s = 0; s < Math.round(this.rows-1-r); s++) {\n\t\t\t\tl += insertSpaces(spacing);\n\t\t\t}\n\t\t\tfor (var i = 0; i < this.triangle[r].length; i++) {\n\t\t\t\tif (i != 0)\n\t\t\t\t\tl += insertSpaces(spacing-Math.ceil(digits(this.triangle[r][i],base)/2));\n\t\t\t\tl += this.triangle[r][i].toString(base);\n\t\t\t\tif (i < this.triangle[r].length-1)\n\t\t\t\t\tl += insertSpaces(spacing-Math.floor(digits(this.triangle[r][i],base)/2));\n\t\t\t}\n\t\t\tprint(l);\n\t\t}\n\t}\n\n}\n\n// Display 4 row triangle in base 10\nvar tri = new pascalTriangle(4);\ntri.print();\n// Display 8 row triangle in base 16\ntri = new pascalTriangle(8);\ntri.print(16);\n","language":"JavaScript"},{"code":"(function (n) {\n 'use strict';\n\n // PASCAL TRIANGLE --------------------------------------------------------\n\n // pascal :: Int -> [[Int]]\n function pascal(n) {\n return foldl(function (a) {\n var xs = a.slice(-1)[0]; // Previous row\n return append(a, [zipWith(\n function (a, b) {\n return a + b;\n },\n append([0], xs),\n append(xs, [0])\n )]);\n }, [\n [1] // Initial seed row\n ], enumFromTo(1, n - 1));\n };\n\n\n // GENERIC FUNCTIONS ------------------------------------------------------\n\n // (++) :: [a] -> [a] -> [a]\n function append(xs, ys) {\n return xs.concat(ys);\n };\n\n // enumFromTo :: Int -> Int -> [Int]\n function enumFromTo(m, n) {\n return Array.from({\n length: Math.floor(n - m) + 1\n }, function (_, i) {\n return m + i;\n });\n };\n\n // foldl :: (b -> a -> b) -> b -> [a] -> b\n function foldl(f, a, xs) {\n return xs.reduce(f, a);\n };\n\n // foldr (a -> b -> b) -> b -> [a] -> b\n function foldr(f, a, xs) {\n return xs.reduceRight(f, a);\n };\n\n // map :: (a -> b) -> [a] -> [b]\n function map(f, xs) {\n return xs.map(f);\n };\n\n // min :: Ord a => a -> a -> a\n function min(a, b) {\n return b < a ? b : a;\n };\n\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\n function zipWith(f, xs, ys) {\n return Array.from({\n length: min(xs.length, ys.length)\n }, function (_, i) {\n return f(xs[i], ys[i]);\n });\n };\n\n // TEST and FORMAT --------------------------------------------------------\n var lstTriangle = pascal(n);\n\n // [[a]] -> bool -> s -> s\n function wikiTable(lstRows, blnHeaderRow, strStyle) {\n return '{| class=\"wikitable\" ' + (strStyle ? 'style=\"' + strStyle +\n '\"' : '') + lstRows.map(function (lstRow, iRow) {\n var strDelim = blnHeaderRow && !iRow ? '!' : '|';\n return '\\n|-\\n' + strDelim + ' ' + lstRow.map(function (v) {\n return typeof v === 'undefined' ? ' ' : v;\n })\n .join(' ' + strDelim + strDelim + ' ');\n })\n .join('') + '\\n|}';\n }\n\n var lstLastLine = lstTriangle.slice(-1)[0],\n lngBase = lstLastLine.length * 2 - 1,\n nWidth = lstLastLine.reduce(function (a, x) {\n var d = x.toString()\n .length;\n return d > a ? d : a;\n }, 1) * lngBase;\n\n return [wikiTable(lstTriangle.map(function (lst) {\n return lst.join(';;')\n .split(';');\n })\n .map(function (line, i) {\n var lstPad = Array((lngBase - line.length) / 2);\n return lstPad.concat(line)\n .concat(lstPad);\n }), false, 'text-align:center;width:' + nWidth + 'em;height:' + nWidth +\n 'em;table-layout:fixed;'), JSON.stringify(lstTriangle)].join('\\n\\n');\n})(7);\n","language":"JavaScript"},{"code":"[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1],[1,5,10,10,5,1],[1,6,15,20,15,6,1]]\n","language":"JavaScript"},{"code":"(() => {\n \"use strict\";\n\n // ---------------- PASCAL'S TRIANGLE ----------------\n\n // pascal :: Generator [[Int]]\n const pascal = () =>\n iterate(\n xs => zipWith(\n a => b => a + b\n )(\n [0, ...xs]\n )(\n [...xs, 0]\n )\n )([1]);\n\n\n // ---------------------- TEST -----------------------\n // main :: IO ()\n const main = () =>\n showPascal(\n take(10)(\n pascal()\n )\n );\n\n\n // showPascal :: [[Int]] -> String\n const showPascal = xs => {\n const w = last(xs).join(\" \").length;\n\n return xs.map(\n ys => center(w)(\" \")(ys.join(\" \"))\n )\n .join(\"\\n\");\n };\n\n\n // ---------------- GENERIC FUNCTIONS ----------------\n\n // center :: Int -> Char -> String -> String\n const center = n =>\n // Size of space -> filler Char ->\n // String -> Centered String\n c => s => {\n const gap = n - s.length;\n\n return 0 < gap ? (() => {\n const\n margin = c.repeat(Math.floor(gap / 2)),\n dust = c.repeat(gap % 2);\n\n return `${margin}${s}${margin}${dust}`;\n })() : s;\n };\n\n\n // iterate :: (a -> a) -> a -> Gen [a]\n const iterate = f =>\n // An infinite list of repeated\n // applications of f to x.\n function* (x) {\n let v = x;\n\n while (true) {\n yield v;\n v = f(v);\n }\n };\n\n\n // last :: [a] -> a\n const last = xs =>\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\n\n\n // take :: Int -> [a] -> [a]\n // take :: Int -> String -> String\n const take = n =>\n // The first n elements of a list,\n // string of characters, or stream.\n xs => \"GeneratorFunction\" !== xs\n .constructor.constructor.name ? (\n xs.slice(0, n)\n ) : Array.from({\n length: n\n }, () => {\n const x = xs.next();\n\n return x.done ? [] : [x.value];\n }).flat();\n\n\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\n const zipWith = f =>\n // A list constructed by zipping with a\n // custom function, rather than with the\n // default tuple constructor.\n xs => ys => xs.map(\n (x, i) => f(x)(ys[i])\n ).slice(\n 0, Math.min(xs.length, ys.length)\n );\n\n\n // MAIN ---\n return main();\n})();\n","language":"JavaScript"},{"code":"const aux = n => {\n if(n <= 1) return [1]\n const prevLayer = aux(n - 1)\n const shifted = [0, ...prevLayer]\n return shifted.map((x, i) => (prevLayer[i] || 0) + x)\n}\nconst pascal = n => {\n for(let i = 1; i <= n; i++) {\n console.log(aux(i).join(' '))\n }\n}\npascal(8)\n","language":"JavaScript"},{"code":"const aux = (() => {\n const layers = [[1], [1]]\n return n => {\n if(layers[n]) return layers[n]\n const prevLayer = aux(n - 1)\n const shifted = [0, ...prevLayer]\n layers[n] = shifted.map((x, i) => (prevLayer[i] || 0) + x)\n return layers[n]\n }\n})()\nconst pascal = n => {\n for(let i = 1; i <= n; i++) {\n console.log(aux(i).join(' '))\n }\n}\npascal(8)\n","language":"JavaScript"},{"code":"# pascal(n) for n>=0; pascal(0) emits an empty stream.\ndef pascal(n):\n def _pascal: # input: the previous row\n . as $in\n | .,\n if length >= n then empty\n else\n reduce range(0;length-1) as $i\n ([1]; . + [ $in[$i] + $in[$i + 1] ]) + [1] | _pascal\n end;\n if n <= 0 then empty else [1] | _pascal end ;\n","language":"Jq"},{"code":"$ jq -c -n -f pascal_triangle.jq\n[1]\n[1,1]\n[1,2,1]\n[1,3,3,1]\n[1,4,6,4,1]\n","language":"Jq"},{"code":"def pascal(n):\n if n <= 0 then empty\n else [1]\n | recurse( if length >= n then empty\n else . as $in\n | reduce range(0;length-1) as $i\n ([1]; . + [ $in[$i] + $in[$i + 1] ]) + [1]\n end)\n end;\n","language":"Jq"},{"code":"iround(x) = round(Int64, x)\n\ntriangle(n) = iround.(exp(diagm(-1=> 1:n)))\n\nfunction pascal(n)\n t=triangle(n)\n println.(join.([filter(!iszero, t[i,:]) for i in 1:(n+1)], \" \"))\nend\n","language":"Julia"},{"code":"function pascal(n)\n (n<=0) && error(\"Pascal trinalge can not have zero or negative rows\")\n r=Vector{Int}(undef,n)\n pr=Vector{Int}(undef,n)\n pr[1]=r[1]=1\n println(@view pr[1])\n for i=2:n\n r[1]=r[i]=1\n for j=2:i-1\n r[j]=pr[j-1]+pr[j]\n end\n println(join(view(r,1:i), \" \"))\n r,pr=pr,r\n end\nend\n","language":"Julia"},{"code":"pascal:{(x-1){+':x,0}\\1}\npascal 6\n(1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n 1 5 10 10 5 1)\n","language":"K"},{"code":"fun pas(rows: Int) {\n for (i in 0..rows - 1) {\n for (j in 0..i)\n print(ncr(i, j).toString() + \" \")\n println()\n }\n}\n\nfun ncr(n: Int, r: Int) = fact(n) / (fact(r) * fact(n - r))\n\nfun fact(n: Int) : Long {\n var ans = 1.toLong()\n for (i in 2..n)\n ans *= i\n return ans\n}\n\nfun main(args: Array<String>) = pas(args[0].toInt())\n","language":"Kotlin"},{"code":"1) Based on this expression of pascalian binomial:\n\n Cnp = [n*(n-1)...(n-p+1)]/[p*(p-1)...2*1]\n\n2) we define the following function:\n\n{def C\n {lambda {:n :p}\n {/ {* {S.serie :n {- :n :p -1} -1}}\n {* {S.serie :p 1 -1}}}}}\n\n{C 16 8}\n-> 12870\n\n3) Writing\n\n1{S.map {lambda {:n} {br}1\n {S.map {C :n} {S.serie 1 {- :n 1}}} 1}\n {S.serie 2 16}}\ndisplays:\n\n1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n1 5 10 10 5 1\n1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n1 8 28 56 70 56 28 8 1\n1 9 36 84 126 126 84 36 9 1\n1 10 45 120 210 252 210 120 45 10 1\n1 11 55 165 330 462 462 330 165 55 11 1\n1 12 66 220 495 792 924 792 495 220 66 12 1\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\n1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16 1\n","language":"Lambdatalk"},{"code":"input \"How much rows would you like? \"; n\ndim a$(n)\n\nfor i= 0 to n\n c = 1\n o$ =\"\"\n for k =0 to i\n o$ =o$ ; c; \" \"\n c =c *(i-k)/(k+1)\n next k\n a$(i)=o$\nnext i\n\nmaxLen = len(a$(n))\nfor i= 0 to n\n print space$((maxLen-len(a$(i)))/2);a$(i)\nnext i\n\nend\n","language":"Liberty-BASIC"},{"code":"10 CLS\n20 INPUT \"Number of rows? \", rows:GOSUB 40\n30 END\n40 FOR i=0 TO rows-1\n50 c=1\n60 FOR k=0 TO i\n70 PRINT USING \"####\";c;\n80 c=c*(i-k)/(k+1)\n90 NEXT\n100 PRINT\n110 NEXT\n120 RETURN\n","language":"Locomotive-Basic"},{"code":"to pascal :n\n if :n = 1 [output [1]]\n localmake \"a pascal :n-1\n output (sentence first :a (map \"sum butfirst :a butlast :a) last :a)\nend\n\nfor [i 1 10] [print pascal :i]\n","language":"Logo"},{"code":":- object(pascals).\n\n :- uses(integer, [plus/3, succ/2]).\n\n :- public(reset/0).\n\n reset :-\n retractall(triangle_(_,_,_)).\n\n :- private(triangle_/3).\n :- dynamic(triangle_/3).\n\n :- public(triangle/2).\n\n triangle(N, Lines) :-\n triangle(N, _, DiffLines),\n difflist::as_list(DiffLines, Lines).\n\n % Shortcut with cached value if it exists.\n triangle(N, Line, DiffLines) :- triangle_(N, Line, DiffLines), !.\n\n triangle(N, Line, DiffLines) :-\n succ(N0, N),\n triangle(N0, Line0, DiffLines0),\n ZL = [0|Line0],\n list::append(Line0, [0], ZR),\n meta::map(plus, ZL, ZR, Line),\n difflist::add(Line, DiffLines0, DiffLines),\n asserta(triangle_(N, Line, DiffLines)).\n\n triangle(1, [1], [[1]|X]-X).\n\n:- end_object.\n","language":"Logtalk"},{"code":"function nextrow(t)\n local ret = {}\n t[0], t[#t+1] = 0, 0\n for i = 1, #t do ret[i] = t[i-1] + t[i] end\n return ret\nend\n\nfunction triangle(n)\n t = {1}\n for i = 1, n do\n print(unpack(t))\n t = nextrow(t)\n end\nend\n","language":"Lua"},{"code":"f:=n->seq(print(seq(binomial(i,k),k=0..i)),i=0..n-1);\n\nf(3);\n","language":"Maple"},{"code":"n=7;\nColumn[StringReplace[ToString /@ Replace[MatrixExp[SparseArray[\n{Band[{2,1}] -> Range[n-1]},{n,n}]],{x__,0..}->{x},2] ,{\"{\"|\"}\"|\",\"->\" \"}], Center]\n","language":"Mathematica"},{"code":"nmax := 10;\npascal[nmax_] := Module[\n {vals = Table[Binomial[n, k], {n, 0, nmax}, {k, 0, n}],\n ids = Table[{n, k}, {n, 0, nmax}, {k, 0, n}],\n labels, left, right, leftright, edgeLabels\n },\n labels = Flatten[Thread /@ (Thread[ids -> vals]), 1];\n left = DeleteCases[Flatten[Flatten[ids, 1] /. {n_, k_} /; (n >= k + 1) :> {{n, k + 1} -> {n + 1, k + 1}}, 1], _?NumberQ];\n right = DeleteCases[Flatten[Flatten[ids, 1] /. {n_, k_} /; (n > k) :> {{n, k} -> {n + 1, k + 1}}, 1], _?NumberQ];\n leftright = DeleteCases[left \\[Union] right, _ -> {b_, _} /; b > nmax];\n edgeLabels = (# -> Style[\"+\", Medium] & /@ leftright);\n Graph[Flatten[ids, 1], leftright\n , VertexLabels -> MapAt[Placed[#, Center] &, labels, {All, 2}]\n , GraphLayout -> \"SpringEmbedding\"\n , VertexSize -> 0.8, EdgeLabels -> edgeLabels\n , PlotLabel -> \"Pascal's Triangle\"\n ]\n ];\npascal[nmax]\n","language":"Mathematica"},{"code":"pascal(n);\n","language":"MATLAB"},{"code":" binomCoeff = diag(rot90(pascal(n)))',\n","language":"MATLAB"},{"code":"sjoin(v, j) := apply(sconcat, rest(join(makelist(j, length(v)), v)))$\n\ndisplay_pascal_triangle(n) := for i from 0 thru 6 do disp(sjoin(makelist(binomial(i, j), j, 0, i), \" \"));\n\ndisplay_pascal_triangle(6);\n/* \"1\"\n \"1 1\"\n \"1 2 1\"\n \"1 3 3 1\"\n \"1 4 6 4 1\"\n \"1 5 10 10 5 1\"\n \"1 6 15 20 15 6 1\" */\n","language":"Maxima"},{"code":"vardef bincoeff(expr n, k) =\nsave ?;\n? := (1 for i=(max(k,n-k)+1) upto n: * i endfor )\n / (1 for i=2 upto min(k, n-k): * i endfor); ?\nenddef;\n\ndef pascaltr expr c =\n string s_;\n for i := 0 upto (c-1):\n s_ := \"\" for k=0 upto (c-i): & \" \" endfor;\n s_ := s_ for k=0 upto i: & decimal(bincoeff(i,k))\n & \" \" if bincoeff(i,k)<9: & \" \" fi endfor;\n message s_;\n endfor\nenddef;\n\npascaltr(4);\nend\n","language":"Metafont"},{"code":"TextWindow.Write(\"Number of rows? \")\nr = TextWindow.ReadNumber()\nFor i = 0 To r - 1\n c = 1\n For k = 0 To i\n TextWindow.CursorLeft = (k + 1) * 4 - Text.GetLength(c)\n TextWindow.Write(c)\n c = c * (i - k) / (k + 1)\n EndFor\n TextWindow.WriteLine(\"\")\nEndFor\n","language":"Microsoft-Small-Basic"},{"code":"MODULE Pascal;\nFROM FormatString IMPORT FormatString;\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\n\nPROCEDURE PrintLine(n : INTEGER);\nVAR\n buf : ARRAY[0..63] OF CHAR;\n m,j : INTEGER;\nBEGIN\n IF n<1 THEN RETURN END;\n m := 1;\n WriteString(\"1 \");\n FOR j:=1 TO n-1 DO\n m := m * (n - j) DIV j;\n FormatString(\"%i \", buf, m);\n WriteString(buf)\n END;\n WriteLn\nEND PrintLine;\n\nPROCEDURE Print(n : INTEGER);\nVAR i : INTEGER;\nBEGIN\n FOR i:=1 TO n DO\n PrintLine(i)\n END\nEND Print;\n\nBEGIN\n Print(10);\n\n ReadChar\nEND Pascal.\n","language":"Modula-2"},{"code":"/* NetRexx */\noptions replace format comments java crossref symbols nobinary\n\nnumeric digits 1000 -- allow very large numbers\nparse arg rows .\nif rows = '' then rows = 11 -- default to 11 rows\nprintPascalTriangle(rows)\nreturn\n\n-- -----------------------------------------------------------------------------\nmethod printPascalTriangle(rows = 11) public static\n lines = ''\n mx = (factorial(rows - 1) / factorial(rows % 2) / factorial(rows - 1 - rows % 2)).length() -- width of widest number\n\n loop row = 1 to rows\n n1 = 1.center(mx)\n line = n1\n loop col = 2 to row\n n2 = col - 1\n n1 = n1 * (row - n2) / n2\n line = line n1.center(mx)\n end col\n lines[row] = line.strip()\n end row\n\n -- display triangle\n ml = lines[rows].length() -- length of longest line\n loop row = 1 to rows\n say lines[row].centre(ml)\n end row\n\n return\n\n-- -----------------------------------------------------------------------------\nmethod factorial(n) public static\n fac = 1\n loop n_ = 2 to n\n fac = fac * n_\n end n_\n return fac /*calc. factorial*/\n","language":"NetRexx"},{"code":"factorial is recur [ 0 =, 1 first, pass, product, -1 +]\ncombination is fork [ > [first, second], 0 first,\n / [factorial second, * [factorial - [second, first], factorial first] ]\n]\npascal is transpose each combination cart [pass, pass] tell\n","language":"Nial"},{"code":"|loaddefs 'pascal.nial'\n|pascal 5\n","language":"Nial"},{"code":"import sequtils, strutils\n\nproc printPascalTriangle(n: int) =\n ## Print a Pascal triangle.\n\n # Build the triangle.\n var triangle: seq[seq[int]]\n triangle.add @[1]\n for _ in 1..<n:\n triangle.add zip(triangle[^1] & @[0], @[0] & triangle[^1]).mapIt(it[0] + it[1])\n\n # Build the lines to display.\n let length = len($max(triangle[^1])) # Maximum length of number.\n var lines: seq[string]\n for row in triangle:\n lines.add row.mapIt(($it).center(length)).join(\" \")\n\n # Display the lines.\n let lineLength = lines[^1].len # Length of largest line (the last one).\n for line in lines:\n echo line.center(lineLength)\n\nprintPascalTriangle(10)\n","language":"Nim"},{"code":"const ROWS = 10\nconst TRILEN = toInt(ROWS * (ROWS + 1) / 2) # Sum of arth progression\nvar triangle = newSeqOfCap[Natural](TRILEN) # Avoid reallocations\n\nproc printPascalTri(row: Natural, result: var seq[Natural]) =\n add(result, 1)\n for i in 2..row-1: add(result, result[^row] + result[^(row-1)])\n add(result, 1)\n\n echo result[^row..^1]\n if row + 1 <= ROWS: printPascalTri(row + 1, result)\n\nprintPascalTri(1, triangle)\n","language":"Nim"},{"code":"(* generate next row from current row *)\nlet next_row row =\n List.map2 (+) ([0] @ row) (row @ [0])\n\n(* returns the first n rows *)\nlet pascal n =\n let rec loop i row =\n if i = n then []\n else row :: loop (i+1) (next_row row)\n in loop 0 [1]\n","language":"OCaml"},{"code":"function pascaltriangle(h)\n for i = 0:h-1\n for k = 0:h-i\n printf(\" \");\n endfor\n for j = 0:i\n printf(\"%3d \", bincoeff(i, j));\n endfor\n printf(\"\\n\");\n endfor\nendfunction\n\npascaltriangle(4);\n","language":"Octave"},{"code":": pascal(n) [ 1 ] #[ dup println dup 0 + 0 rot + zipWith(#+) ] times(n) drop ;\n","language":"Oforth"},{"code":"declare\n fun {NextLine Xs}\n {List.zip 0|Xs {Append Xs [0]}\n fun {$ Left Right}\n Left + Right\n end}\n end\n\n fun {Triangle N}\n {List.take {Iterate [1] NextLine} N}\n end\n\n fun lazy {Iterate I F}\n I|{Iterate {F I} F}\n end\n\n %% Only works nicely for N =< 5.\n proc {PrintTriangle T}\n N = {Length T}\n in\n for\n Line in T\n Indent in N-1..0;~1\n do\n for _ in 1..Indent do {System.printInfo \" \"} end\n for L in Line do {System.printInfo L#\" \"} end\n {System.printInfo \"\\n\"}\n end\n end\nin\n {PrintTriangle {Triangle 5}}\n","language":"Oz"},{"code":"pascals_triangle(N)= {\nmy(row=[],prevrow=[]);\nfor(x=1,N,\n if(x>5,break(1));\n row=eval(Vec(Str(11^(x-1))));\n print(row));\nprevrow=row;\nfor(y=6,N,\n for(p=2,#prevrow,\n row[p]=prevrow[p-1]+prevrow[p]);\n row=concat(row,1);\n prevrow=row;\n print(row);\n );\n}\n","language":"PARI-GP"},{"code":"Program PascalsTriangle(output);\n\nprocedure Pascal(r : Integer);\n var\n i, c, k : Integer;\n begin\n for i := 0 to r-1 do\n begin\n c := 1;\n for k := 0 to i do\n begin\n write(c:3);\n c := (c * (i-k)) div (k+1);\n end;\n writeln;\n end;\nend;\n\nbegin\n Pascal(9)\nend.\n","language":"Pascal"},{"code":"sub pascal {\n my $rows = shift;\n my @next = (1);\n for my $n (1 .. $rows) {\n print \"@next\\n\";\n @next = (1, (map $next[$_]+$next[$_+1], 0 .. $n-2), 1);\n }\n}\n","language":"Perl"},{"code":"use ntheory qw/binomial/;\nsub pascal {\n my $rows = shift;\n for my $n (0 .. $rows-1) {\n print join(\" \", map { binomial($n,$_) } 0 .. $n), \"\\n\";\n }\n}\n","language":"Perl"},{"code":"use bignum;\nsub pascal_line { $_[0] ? unpack \"A(A6)*\", 1000001**$_[0] : 1 }\nsub pascal { print \"@{[map -+-$_, pascal_line $_]}\\n\" for 0..$_[0]-1 }\n","language":"Perl"},{"code":"#!/usr/bin/perl\nuse strict;\nuse warnings;\n\n{\n my @tartaglia ;\n sub tartaglia {\n my ($x,$y) = @_;\n if ($x == 0 or $y == 0) { $tartaglia[$x][$y]=1 ; return 1};\n my $ret ;\n foreach my $yps (0..$y){\n $ret += ( $tartaglia[$x-1][$yps] || tartaglia($x-1,$yps) );\n }\n $tartaglia[$x][$y] = $ret;\n return $ret;\n }\n}\nsub tartaglia_row {\n my $y = shift;\n my $x = 0;\n my @row;\n $row[0] = &tartaglia($x,$y+1);\n foreach my $pos (0..$y-1) {push @row, tartaglia(++$x,--$y)}\n return @row;\n}\n\n\nfor (0..5) {print join ' ', tartaglia_row($_),\"\\n\"}\nprint \"\\n\\n\";\n\n\nprint tartaglia(3,3),\"\\n\";\nmy @third = tartaglia_row(5);\nprint \"@third\\n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">13</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">&</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">,(</span><span style=\"color: #000000;\">13</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" %3d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"<?php\n //Author Ivan Gavryshin @dcc0\nfunction tre($n) {\n $ck=1;\n $kn=$n+1;\n\n if($kn%2==0) {\n $kn=$kn/2;\n $i=0;\n }\n else\n {\n\n $kn+=1;\n $kn=$kn/2;\n $i= 1;\n}\n\n for ($k = 1; $k <= $kn-1; $k++) {\n $ck = $ck/$k*($n-$k+1);\n $arr[] = $ck;\n echo \"+\" . $ck ;\n\n }\n\n\nif ($kn>1) {\n echo $arr[i];\n $arr=array_reverse($arr);\n for ($i; $i<= $kn-1; $i++) {\n echo \"+\" . $arr[$i] ;\n }\n\n }\n\n }\n //set amount of strings here\n while ($n<=20) {\n ++$n;\n echo tre($n);\n echo \"<br/>\";\n}\n\n\n?>\n","language":"PHP"},{"code":"function pascalsTriangle($num){\n\t$c = 1;\n\t$triangle = Array();\n\tfor($i=0;$i<=$num;$i++){\n\t\t$triangle[$i] = Array();\n\t\tif(!isset($triangle[$i-1])){\n\t\t\t$triangle[$i][] = $c;\n\t\t}else{\n\t\t\tfor($j=0;$j<count($triangle[$i-1])+1;$j++){\n\t\t\t\t$triangle[$i][] = (isset($triangle[$i-1][$j-1]) && isset($triangle[$i-1][$j])) ? $triangle[$i-1][$j-1] + $triangle[$i-1][$j] : $c;\n\t\t\t}\n\t\t}\n\t}\n\treturn $triangle;\n}\n\n$tria = pascalsTriangle(8);\nforeach($tria as $val){\n\tforeach($val as $value){\n\t\techo $value . ' ';\n\t}\n\techo '<br>';\n}\n","language":"PHP"},{"code":"%Author: Petar Kabashki\nspatr([]) = [].\nspatr([_|T]) = A, T = [] => A = [].\nspatr([H|T]) = A, T = [TH|_] => A = [H+TH] ++ spatr(T).\n\ntable\npatr(0) = [1].\npatr(1) = [1, 1].\npatr(N) = A, N > 1 => Apre = patr(N-1), A = [1] ++ spatr(Apre) ++ [1].\n\nforeach(I in 0 .. 10) println(patr(I)) end.\n","language":"Picat"},{"code":"[1]\n[1,1]\n[1,2,1]\n[1,3,3,1]\n[1,4,6,4,1]\n[1,5,10,10,5,1]\n[1,6,15,20,15,6,1]\n[1,7,21,35,35,21,7,1]\n[1,8,28,56,70,56,28,8,1]\n[1,9,36,84,126,126,84,36,9,1]\n[1,10,45,120,210,252,210,120,45,10,1]\n","language":"Picat"},{"code":"(de pascalTriangle (N)\n (for I N\n (space (* 2 (- N I)))\n (let C 1\n (for K I\n (prin (align 3 C) \" \")\n (setq C (*/ C (- I K) K)) ) )\n (prinl) ) )\n","language":"PicoLisp"},{"code":"declare (t, u)(40) fixed binary;\ndeclare (i, n) fixed binary;\n\nt,u = 0;\nget (n);\nif n <= 0 then return;\n\ndo n = 1 to n;\n u(1) = 1;\n do i = 1 to n;\n u(i+1) = t(i) + t(i+1);\n end;\n put skip edit ((u(i) do i = 1 to n)) (col(40-2*n), (n+1) f(4));\n t = u;\nend;\n","language":"PL-I"},{"code":" 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n 1 5 10 10 5 1\n 1 6 15 20 15 6 1\n 1 7 21 35 35 21 7 1\n 1 8 28 56 70 56 28 8 1\n 1 9 36 84 126 126 84 36 9 1\n 1 10 45 120 210 252 210 120 45 10 1\n","language":"PL-I"},{"code":"printpascal = (n) :\n if (n < 1) :\n 1 print\n (1)\n . else :\n prev = printpascal(n - 1)\n prev append(0)\n curr = (1)\n n times (i):\n curr append(prev(i) + prev(i + 1))\n .\n \"\\n\" print\n curr join(\", \") print\n curr\n .\n.\n\nprintpascal(read number integer)\n","language":"Potion"},{"code":"$Infinity = 1\n$NewNumbers = $null\n$Numbers = $null\n$Result = $null\n$Number = $null\n$Power = $args[0]\n\nWrite-Host $Power\n\nFor(\n $i=0;\n $i -lt $Infinity;\n $i++\n )\n {\n $Numbers = New-Object Object[] 1\n $Numbers[0] = $Power\n For(\n $k=0;\n $k -lt $NewNumbers.Length;\n $k++\n )\n {\n $Numbers = $Numbers + $NewNumbers[$k]\n }\n If(\n $i -eq 0\n )\n {\n $Numbers = $Numbers + $Power\n }\n $NewNumbers = New-Object Object[] 0\n Try\n {\n For(\n $j=0;\n $j -lt $Numbers.Length;\n $j++\n )\n {\n $Result = $Numbers[$j] + $Numbers[$j+1]\n $NewNumbers = $NewNumbers + $Result\n }\n }\n Catch [System.Management.Automation.RuntimeException]\n {\n Write-Warning \"Value was too large for a Decimal. Script aborted.\"\n Break;\n }\n Foreach(\n $Number in $Numbers\n )\n {\n If(\n $Number.ToString() -eq \"+unendlich\"\n )\n {\n Write-Warning \"Value was too large for a Decimal. Script aborted.\"\n Exit\n }\n }\n Write-Host $Numbers\n $Infinity++\n }\n","language":"PowerShell"},{"code":"pascal(N) :-\n\tpascal(1, N, [1], [[1]|X]-X, L),\n\tmaplist(my_format, L).\n\npascal(Max, Max, L, LC, LF) :-\n\t!,\n\tmake_new_line(L, NL),\n\tappend_dl(LC, [NL|X]-X, LF-[]).\n\npascal(N, Max, L, NC, LF) :-\n\tbuild_new_line(L, NL),\n\tappend_dl(NC, [NL|X]-X, NC1),\n\tN1 is N+1,\n\tpascal(N1, Max, NL, NC1, LF).\n\nbuild_new_line(L, R) :-\n\tbuild(L, 0, X-X, R).\n\nbuild([], V, RC, RF) :-\n\tappend_dl(RC, [V|Y]-Y, RF-[]).\n\nbuild([H|T], V, RC, R) :-\n\tV1 is V+H,\n\tappend_dl(RC, [V1|Y]-Y, RC1),\n\tbuild(T, H, RC1, R).\n\nappend_dl(X1-X2, X2-X3, X1-X3).\n\n% to have a correct output !\nmy_format([H|T]) :-\n\twrite(H),\n\tmaplist(my_writef, T),\n\tnl.\n\nmy_writef(X) :-\n\twritef(' %5r', [X]).\n","language":"Prolog"},{"code":" ?- pascal(15).\n1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n1 5 10 10 5 1\n1 6 15 20 15 6 1\n1 7 21 35 35 21 7 1\n1 8 28 56 70 56 28 8 1\n1 9 36 84 126 126 84 36 9 1\n1 10 45 120 210 252 210 120 45 10 1\n1 11 55 165 330 462 462 330 165 55 11 1\n1 12 66 220 495 792 924 792 495 220 66 12 1\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\ntrue.\n","language":"Prolog"},{"code":"%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n% Produce a pascal's triangle of depth N\n%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n% Prolog is declarative. The predicate pascal/3 below says that to produce\n% a row of depth N, we can do so by first producing the row at depth(N-1),\n% and then adding the paired values in that row. The triangle is produced\n% by prepending the row at N-1 to the preceding rows as recursion unwinds.\n% The triangle produced by pascal/3 is upside down and lacks the last row,\n% so pascal/2 prepends the last row to the triangle and reverses it.\n% Finally, pascal/1 produces the triangle, iterates each row and prints it.\n%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\npascal_row([V], [V]). % No more value pairs to add\npascal_row([V0, V1|T], [V|Rest]) :- % Add values from preceding row\n V is V0 + V1, !, pascal_row([V1|T], Rest). % Drops initial value (1).\n\npascal(1, [1], []). % at depth 1, this row is [1] and no preceding rows.\npascal(N, [1|ThisRow], [Last|Preceding]) :- % Produce a row of depth N\n succ(N0, N), % N is the successor to N0\n pascal(N0, Last, Preceding), % Get the previous row\n !, pascal_row(Last, ThisRow). % Calculate this row from the previous\n\npascal(N, Triangle) :-\n pascal(N, Last, Rows), % Retrieve row at depth N and preceding rows\n !, reverse([Last|Rows], Triangle). % Add last row to triangle and reverse order\n\npascal(N) :-\n pascal(N, Triangle), member(Row, Triangle), % Iterate and write each row\n write(Row), nl, fail.\npascal(_).\n","language":"Prolog"},{"code":"?- pascal(5).\n[1]\n[1,1]\n[1,2,1]\n[1,3,3,1]\n[1,4,6,4,1]\n","language":"Prolog"},{"code":"Procedure pascaltriangle( n.i)\n\n For i= 0 To n\n c = 1\n For k=0 To i\n Print(Str( c)+\" \")\n c = c * (i-k)/(k+1);\n Next ;k\n PrintN(\" \"); nächste zeile\n Next ;i\n\nEndProcedure\n\nOpenConsole()\nParameter.i = Val(ProgramParameter(0))\npascaltriangle(Parameter);\nInput()\n","language":"PureBasic"},{"code":"def pascal(n):\n \"\"\"Prints out n rows of Pascal's triangle.\n It returns False for failure and True for success.\"\"\"\n row = [1]\n k = [0]\n for x in range(max(n,0)):\n print row\n row=[l+r for l,r in zip(row+k,k+row)]\n return n>=1\n","language":"Python"},{"code":"def scan(op, seq, it):\n a = []\n result = it\n a.append(it)\n for x in seq:\n result = op(result, x)\n a.append(result)\n return a\n\ndef pascal(n):\n def nextrow(row, x):\n return [l+r for l,r in zip(row+[0,],[0,]+row)]\n\n return scan(nextrow, range(n-1), [1,])\n\nfor row in pascal(4):\n print(row)\n","language":"Python"},{"code":"'''Pascal's triangle'''\n\nfrom itertools import (accumulate, chain, islice)\nfrom operator import (add)\n\n\n# nextPascal :: [Int] -> [Int]\ndef nextPascal(xs):\n '''A row of Pascal's triangle\n derived from a preceding row.'''\n return list(\n map(add, [0] + xs, xs + [0])\n )\n\n\n# pascalTriangle :: Generator [[Int]]\ndef pascalTriangle():\n '''A non-finite stream of\n Pascal's triangle rows.'''\n return iterate(nextPascal)([1])\n\n\n# finitePascalRows :: Int -> [[Int]]\ndef finitePascalRows(n):\n '''The first n rows of Pascal's triangle.'''\n return accumulate(\n chain(\n [[1]], range(1, n)\n ),\n lambda a, _: nextPascal(a)\n )\n\n\n# ------------------------ TESTS -------------------------\n# main :: IO ()\ndef main():\n '''Test of two different approaches:\n - taking from a non-finite stream of rows,\n - or constructing a finite list of rows.'''\n print('\\n'.join(map(\n showPascal,\n [\n islice(\n pascalTriangle(), # Non finite,\n 7\n ),\n finitePascalRows(7) # finite.\n ]\n )))\n\n\n# showPascal :: [[Int]] -> String\ndef showPascal(xs):\n '''Stringification of a list of\n Pascal triangle rows.'''\n ys = list(xs)\n\n def align(w):\n return lambda ns: center(w)(\n ' '\n )(' '.join(map(str, ns)))\n\n w = len(' '.join((map(str, ys[-1]))))\n return '\\n'.join(map(align(w), ys))\n\n\n# ----------------------- GENERIC ------------------------\n\n# center :: Int -> Char -> String -> String\ndef center(n):\n '''String s padded with c to approximate centre,\n fitting in but not truncated to width n.'''\n def go(c, s):\n qr = divmod(n - len(s), 2)\n q = qr[0]\n return (q * c) + s + ((q + qr[1]) * c)\n\n return lambda c: lambda s: go(c, s)\n\n\n# iterate :: (a -> a) -> a -> Gen [a]\ndef iterate(f):\n '''An infinite list of repeated\n applications of f to x.\n '''\n def go(x):\n v = x\n while True:\n yield v\n v = f(v)\n\n return go\n\n\n# MAIN ---\nif __name__ == '__main__':\n main()\n","language":"Python"},{"code":"pascal:{(x-1){0+':x,0}\\1}\npascal 5\n1\n1 1\n1 2 1\n1 3 3 1\n1 4 6 4 1\n","language":"Q"},{"code":"(define iterate\n _ _ 0 -> []\n F V N -> [V|(iterate F (F V) (1- N))])\n\n(define next-row\n R -> (MAPCAR + [0|R] (append R [0])))\n\n(define pascal\n N -> (iterate next-row [1] N))\n","language":"Qi"},{"code":" [ over size -\n space swap of\n swap join ] is justify ( $ n --> )\n\n [ witheach\n [ number$\n 5 justify echo$ ]\n cr ] is echoline ( [ --> )\n\n [ [] 0 rot 0 join\n witheach\n [ tuck +\n rot join swap ]\n drop ] is nextline ( [ --> [ )\n\n [ ' [ 1 ] swap\n 1 - times\n [ dup echoline\n nextline ]\n echoline ] is pascal ( n --> )\n\n 16 pascal\n","language":"Quackery"},{"code":"pascalTriangle <- function(h) {\n for(i in 0:(h-1)) {\n s <- \"\"\n for(k in 0:(h-i)) s <- paste(s, \" \", sep=\"\")\n for(j in 0:i) {\n s <- paste(s, sprintf(\"%3d \", choose(i, j)), sep=\"\")\n }\n print(s)\n }\n}\n","language":"R"},{"code":"pascalTriangle <- function(h) {\n lapply(0:h, function(i) choose(i, 0:i))\n}\n","language":"R"},{"code":"#lang racket\n\n(define (pascal n)\n (define (next-row current-row)\n (map + (cons 0 current-row)\n (append current-row '(0))))\n (reverse\n (for/fold ([triangle '((1))])\n ([row (in-range 1 n)])\n (cons (next-row (first triangle)) triangle))))\n","language":"Racket"},{"code":"sub pascal {\n [1], { [0, |$_ Z+ |$_, 0] } ... *\n}\n\n.say for pascal[^10];\n","language":"Raku"},{"code":"constant @pascal = [1], -> $prev { [0, |$prev Z+ |$prev, 0] } ... *;\n\n.say for @pascal[^10];\n","language":"Raku"},{"code":"multi sub pascal (1) { $[1] }\nmulti sub pascal (Int $n where 2..*) {\n my @rows = pascal $n - 1;\n |@rows, [0, |@rows[*-1] Z+ |@rows[*-1], 0 ];\n}\n\n.say for pascal 10;\n","language":"Raku"},{"code":"sub pascal ($n where $n >= 1) {\n say my @last = 1;\n for 1 .. $n - 1 -> $row {\n @last = 1, |map({ @last[$_] + @last[$_ + 1] }, 0 .. $row - 2), 1;\n say @last;\n }\n}\n\npascal 10;\n","language":"Raku"},{"code":"DEFINT values(100) = {0,1}\n\nINPUT \"Number of rows: \"; nrows\nPRINT SPACE$((nrows)*3);\" 1\"\nFOR row = 2 TO nrows\n PRINT SPACE$((nrows-row)*3+1);\n FOR i = row TO 1 STEP -1\n values(i) = values(i) + values(i-1)\n PRINT FORMAT$(\"%5d \", values(i));\n NEXT i\n PRINT\nNEXT row\n","language":"RapidQ"},{"code":"INPUT \"Number of rows: \"; nrows\nFOR row = 0 TO nrows-1\n c = 1\n PRINT SPACE$((nrows-row)*3);\n FOR i = 0 TO row\n PRINT FORMAT$(\"%5d \", c);\n c = c * (row - i) / (i+1)\n NEXT i\n PRINT\nNEXT row\n","language":"RapidQ"},{"code":"Red[]\npascal-triangle: function [\n n [ integer! ] \"number of rows\"\n ][\n row: make vector! [ 1 ]\n loop n [\n print row\n left: copy row\n right: copy row\n insert left 0\n append right 0\n row: left + right\n ]\n]\n","language":"Red"},{"code":"2 elements i j\n: pascalTriangle\n cr dup\n [ dup !j 1 swap 1+ [ !i dup putn space @j @i - * @i 1+ / ] iter cr drop ] iter drop\n;\n13 pascalTriangle\n","language":"Retro"},{"code":"/*REXX program displays (or writes to a file) Pascal's triangle (centered/formatted).*/\nnumeric digits 3000 /*be able to handle gihugeic triangles.*/\nparse arg nn . /*obtain the optional argument from CL.*/\nif nn=='' | nn==\",\" then nn= 10 /*Not specified? Then use the default.*/\nn= abs(nn) /*N is the number of rows in triangle.*/\nw= length( !(n-1) % !(n%2) % !(n - 1 - n%2)) /*W: the width of biggest integer. */\nww= (n-1) * (W + 1) + 1 /*WW: \" \" \" triangle's last row.*/\n@.= 1; $.= @.; unity= right(1, w) /*defaults rows & lines; aligned unity.*/\n /* [↓] build rows of Pascals' triangle*/\n do r=1 for n; rm= r-1 /*Note: the first column is always 1.*/\n do c=2 to rm; cm= c-1 /*build the rest of the columns in row.*/\n @.r.c= @.rm.cm + @.rm.c /*assign value to a specific row & col.*/\n $.r = $.r right(@.r.c, w) /*and construct a line for output (row)*/\n end /*c*/ /* [↑] C is the column being built.*/\n if r\\==1 then $.r= $.r unity /*for rows≥2, append a trailing \"1\".*/\n end /*r*/ /* [↑] R is the row being built.*/\n /* [↑] WIDTH: for nicely looking line.*/\n do r=1 for n; $$= center($.r, ww) /*center this particular Pascals' row. */\n if nn>0 then say $$ /*SAY if NN is positive, else */\n else call lineout 'PASCALS.'n, $$ /*write this Pascal's row ───► a file.*/\n end /*r*/\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\n!: procedure; !=1; do j=2 to arg(1); != !*j; end /*j*/; return ! /*compute factorial*/\n","language":"REXX"},{"code":"row = 5\nfor i = 0 to row - 1\n col = 1\n see left(\" \",row-i)\n for k = 0 to i\n see \"\" + col + \" \"\n col = col*(i-k)/(k+1)\n next\n see nl\nnext\n","language":"Ring"},{"code":"def pascal(n)\n raise ArgumentError, \"must be positive.\" if n < 1\n yield ar = [1]\n (n-1).times do\n ar.unshift(0).push(0) # tack a zero on both ends\n yield ar = ar.each_cons(2).map(&:sum)\n end\nend\n\npascal(8){|row| puts row.join(\" \").center(20)}\n","language":"Ruby"},{"code":"def next_row(row) ([0] + row).zip(row + [0]).collect {|l,r| l + r } end\n\ndef pascal(n) n.times.inject([1]) {|x,_| next_row x } end\n\n8.times{|i| p pascal(i)}\n","language":"Ruby"},{"code":"input \"number of rows? \";r\nfor i = 0 to r - 1\n c = 1\n print left$(\" \",(r*2)-(i*2));\n for k = 0 to i\n print using(\"####\",c);\n c = c*(i-k)/(k+1)\n next\n print\nnext\n","language":"Run-BASIC"},{"code":"fn pascal_triangle(n: u64)\n{\n\n for i in 0..n {\n let mut c = 1;\n for _j in 1..2*(n-1-i)+1 {\n print!(\" \");\n }\n for k in 0..i+1 {\n print!(\"{:2} \", c);\n c = c * (i-k)/(k+1);\n }\n println!();\n }\n}\n","language":"Rust"},{"code":" def tri(row: Int): List[Int] =\n row match {\n case 1 => List(1)\n case n: Int => 1 +: ((tri(n - 1) zip tri(n - 1).tail) map { case (a, b) => a + b }) :+ 1\n }\n","language":"Scala"},{"code":"def prettyTri(n:Int) = (1 to n) foreach {i => print(\" \"*(n-i)); tri(i) map (c => print(c + \" \")); println}\n\nprettyTri(5)\n","language":"Scala"},{"code":"object Blaise extends App {\n def pascalTriangle(): Stream[Vector[Int]] =\n Vector(1) #:: Stream.iterate(Vector(1, 1))(1 +: _.sliding(2).map(_.sum).toVector :+ 1)\n\n val output = pascalTriangle().take(15).map(_.mkString(\" \"))\n val longest = output.last.length\n\n println(\"Pascal's Triangle\")\n output.foreach(line => println(s\"${\" \" * ((longest - line.length) / 2)}$line\"))\n}\n","language":"Scala"},{"code":"(define (next-row row)\n (map + (cons 0 row) (append row '(0))))\n\n(define (triangle row rows)\n (if (= rows 0)\n '()\n (cons row (triangle (next-row row) (- rows 1)))))\n\n(triangle (list 1) 5)\n","language":"Scheme"},{"code":"((1) (1 1) (1 2 1) (1 3 3 1) (1 4 6 4 1))\n","language":"Scheme"},{"code":"$ include \"seed7_05.s7i\";\n\nconst proc: main is func\n local\n var integer: numRows is 0;\n var array integer: values is [] (0, 1);\n var integer: row is 0;\n var integer: index is 0;\n begin\n write(\"Number of rows: \");\n readln(numRows);\n writeln(\"1\" lpad succ(numRows) * 3);\n for row range 2 to numRows do\n write(\"\" lpad (numRows - row) * 3);\n values &:= [] 0;\n for index range succ(row) downto 2 do\n values[index] +:= values[pred(index)];\n write(\" \" <& values[index] lpad 5);\n end for;\n writeln;\n end for;\n end func;\n","language":"Seed7"},{"code":"func pascal(rows) {\n var row = [1]\n { | n|\n say row.join(' ')\n row = [1, {|i| row[i] + row[i+1] }.map(0 .. n-2)..., 1]\n } << 1..rows\n}\n \npascal(10)\n","language":"Sidef"},{"code":"function pascal1(n) {\n\treturn(comb(J(1,n,0::n-1),J(n,1,0..n-1)))\n}\n\nfunction pascal2(n) {\n\ta = I(n)\n\ta[.,1] = J(n,1,1)\n\tfor (i=3; i<=n; i++) {\n\t\ta[i,2..i-1] = a[i-1,2..i-1]+a[i-1,1..i-2]\n\t}\n\treturn(a)\n}\n\nfunction pascal3(n) {\n\ta = J(n,n,0)\n\tfor (i=1; i<n; i++) {\n\t\ta[i+1,i] = i\n\t}\n\ts = p = I(n)\n\tk = 1\n\tfor (i=0; i<n; i++) {\n\t\tp = p*a/k++\n\t\ts = s+p\n\t}\n\treturn(s)\n}\n","language":"Stata"},{"code":"function print_pascal_triangle(n) {\n\ta = pascal1(n)\n\tfor (i=1; i<=n; i++) {\n\t\tfor (j=1; j<=i; j++) {\n\t\t\tprintf(\"%10.0f\",a[i,j])\n\t\t}\n\t\tprintf(\"\\n\")\n\t}\n}\n\nprint_pascal_triangle(5)\n 1\n 1 1\n 1 2 1\n 1 3 3 1\n 1 4 6 4 1\n","language":"Stata"},{"code":"func pascal(n:Int)->[Int]{\n if n==1{\n let a=[1]\n print(a)\n return a\n }\n else{\n var a=pascal(n:n-1)\n var temp=a\n for i in 0..<a.count{\n if i+1==a.count{\n temp.append(1)\n break\n }\n temp[i+1] = a[i]+a[i+1]\n }\n a=temp\n print(a)\n return a\n }\n}\nlet waste = pascal(n:10)\n","language":"Swift"},{"code":"proc pascal_iterative n {\n if {$n < 1} {error \"undefined behaviour for n < 1\"}\n set row [list 1]\n lappend rows $row\n set i 1\n while {[incr i] <= $n} {\n set prev $row\n set row [list 1]\n for {set j 1} {$j < [llength $prev]} {incr j} {\n lappend row [expr {[lindex $prev [expr {$j - 1}]] + [lindex $prev $j]}]\n }\n lappend row 1\n lappend rows $row\n }\n return $rows\n}\n\nputs [join [pascal_iterative 6] \\n]\n","language":"Tcl"},{"code":"proc pascal_coefficients n {\n if {$n < 1} {error \"undefined behaviour for n < 1\"}\n for {set i 0} {$i < $n} {incr i} {\n set c 1\n set row [list $c]\n for {set j 0} {$j < $i} {incr j} {\n set c [expr {$c * ($i - $j) / ($j + 1)}]\n lappend row $c\n }\n lappend rows $row\n }\n return $rows\n}\n\nputs [join [pascal_coefficients 6] \\n]\n","language":"Tcl"},{"code":"package require Tcl 8.5\n\nproc pascal_combinations n {\n if {$n < 1} {error \"undefined behaviour for n < 1\"}\n for {set i 0} {$i < $n} {incr i} {\n set row [list]\n for {set j 0} {$j <= $i} {incr j} {\n lappend row [C $i $j]\n }\n lappend rows $row\n }\n return $rows\n}\n\nproc C {n k} {\n expr {[ifact $n] / ([ifact $k] * [ifact [expr {$n - $k}]])}\n}\n\nset fact_cache {1 1}\nproc ifact n {\n global fact_cache\n if {$n < [llength $fact_cache]} {\n return [lindex $fact_cache $n]\n }\n set i [expr {[llength $fact_cache] - 1}]\n set sum [lindex $fact_cache $i]\n while {$i < $n} {\n incr i\n set sum [expr {$sum * $i}]\n lappend fact_cache $sum\n }\n return $sum\n}\n\nputs [join [pascal_combinations 6] \\n]\n","language":"Tcl"},{"code":"set n 100\nputs \"calculate $n rows:\"\nforeach proc {pascal_iterative pascal_coefficients pascal_combinations} {\n puts \"$proc: [time [list $proc $n] 100]\"\n}\n","language":"Tcl"},{"code":"PROGRAM:PASCALTR\n:Lbl IN\n:ClrHome\n:Disp \"NUMBER OF ROWS\"\n:Input N\n:If N < 1:Goto IN\n:{N,N}→dim([A])\n:\"CHEATING TO MAKE IT FASTER\"\n:For(I,1,N)\n:1→[A](1,1)\n:End\n:For(I,2,N)\n:For(J,2,I)\n:[A](I-1,J-1)+[A](I-1,J)→[A](I,J)\n:End\n:End\n:[A]\n","language":"TI-83-BASIC"},{"code":"PROGRAM:PASCALTR\n:Lbl IN\n:ClrHome\n:Disp \"NUMBER OF ROWS\"\n:Input N\n:If N < 1:Goto IN\n:{N,N}→dim([A])\n:For(I,2,N)\n:For(J,2,I)\n:(I-1) nCr (J-1)→[A](I,J)\n:End\n:End\n:[A]\n","language":"TI-83-BASIC"},{"code":"proc pascal (n : int)\n for i : 0 .. n\n var c := 1\n for k : 0 .. i\n put c : 4 ..\n c := c * (i - k) div (k + 1)\n end for\n put \"\"\n end for\nend pascal\n\npascal(5)\n","language":"Turing"},{"code":"// Pascal's triangle\n\nfunction pascal(n: number): void {\n // Display the first n rows of Pascal's triangle\n // if n<=0 then nothing is displayed\n var ld: number[] = new Array(40); // Old\n var nw: number[] = new Array(40); // New\n for (var row = 0; row < n; row++) {\n nw[0] = 1;\n for (var i = 1; i <= row; i++)\n nw[i] = ld[i - 1] + ld[i];\n process.stdout.write(\" \".repeat((n - row - 1) * 2));\n for (var i = 0; i <= row; i++) {\n if (nw[i] < 100)\n process.stdout.write(\" \");\n process.stdout.write(nw[i].toString());\n if (nw[i] < 10)\n process.stdout.write(\" \");\n process.stdout.write(\" \");\n }\n nw[row + 1] = 0;\n // We do not copy data from nw to ld\n // but we work with references.\n var tmp = ld;\n ld = nw;\n nw = tmp;\n console.log();\n }\n}\n\npascal(13);\n","language":"TypeScript"},{"code":"#! /bin/bash\npascal() {\n local -i n=${1:-1}\n if (( n <= 1 )); then\n echo 1\n else\n local output=$( $FUNCNAME $((n - 1)) )\n set -- $( tail -n 1 <<<\"$output\" ) # previous row\n echo \"$output\"\n printf \"1 \"\n while [[ -n $1 ]]; do\n printf \"%d \" $(( $1 + ${2:-0} ))\n shift\n done\n echo\n fi\n}\npascal \"$1\"\n","language":"UNIX-Shell"},{"code":"#import std\n#import nat\n\npascal = choose**ziDS+ iota*t+ iota+ successor\n","language":"Ursala"},{"code":"#import std\n#import nat\n\npascal \"n\" = (next\"n\" sum*NiCixp) <1>\n","language":"Ursala"},{"code":"#cast %nLL\n\nexample = pascal 10\n","language":"Ursala"},{"code":"Option Base 1\nPrivate Sub pascal_triangle(n As Integer)\n Dim odd() As String\n Dim eve() As String\n ReDim odd(1)\n ReDim eve(2)\n odd(1) = \" 1\"\n For i = 1 To n\n If i Mod 2 = 1 Then\n Debug.Print String$(2 * n - 2 * i, \" \") & Join(odd, \" \")\n eve(1) = \" 1\"\n ReDim Preserve eve(i + 1)\n For j = 2 To i\n eve(j) = Format(CStr(Val(odd(j - 1)) + Val(odd(j))), \"@@@\")\n Next j\n eve(i + 1) = \" 1\"\n Else\n Debug.Print String$(2 * n - 2 * i, \" \") & Join(eve, \" \")\n odd(1) = \" 1\"\n ReDim Preserve odd(i + 1)\n For j = 2 To i\n odd(j) = Format(CStr(Val(eve(j - 1)) + Val(eve(j))), \"@@@\")\n Next j\n odd(i + 1) = \" 1\"\n End If\n Next i\nEnd Sub\nPublic Sub main()\n pascal_triangle 13\nEnd Sub\n","language":"VBA"},{"code":"Pascal_Triangle(WScript.Arguments(0))\nFunction Pascal_Triangle(n)\n\tDim values(100)\n\tvalues(1) = 1\n\tWScript.StdOut.Write values(1)\n\tWScript.StdOut.WriteLine\n\tFor row = 2 To n\n\t\tFor i = row To 1 Step -1\n\t\t\tvalues(i) = values(i) + values(i-1)\n\t\t\tWScript.StdOut.Write values(i) & \" \"\n\t\tNext\n\t\tWScript.StdOut.WriteLine\n\tNext\nEnd Function\n","language":"VBScript"},{"code":"#100 = Get_Num(\"Number of rows: \", STATLINE)\n#0=0; #1=1\nIns_Char(' ', COUNT, #100*3-2) Num_Ins(1)\nfor (#99 = 2; #99 <= #100; #99++) {\n Ins_Char(' ', COUNT, (#100-#99)*3)\n #@99 = 0\n for (#98 = #99; #98 > 0; #98--) {\n\t#97 = #98-1\n\t#@98 += #@97\n\tNum_Ins(#@98, COUNT, 6)\n }\n Ins_Newline\n}\n","language":"Vedit-macro-language"},{"code":"#1 = Get_Num(\"Number of rows: \", STATLINE)\nfor (#2 = 0; #2 < #1; #2++) {\n #3 = 1\n Ins_Char(' ', COUNT, (#1-#2-1)*3)\n for (#4 = 0; #4 <= #2; #4++) {\n\tNum_Ins(#3, COUNT, 6)\n\t#3 = #3 * (#2-#4) / (#4+1)\n }\n Ins_Newline\n}\n","language":"Vedit-macro-language"},{"code":"Sub pascaltriangle()\n 'Pascal's triangle\n Const m = 11\n Dim t(40) As Integer, u(40) As Integer\n Dim i As Integer, n As Integer, s As String, ss As String\n ss = \"\"\n For n = 1 To m\n u(1) = 1\n s = \"\"\n For i = 1 To n\n u(i + 1) = t(i) + t(i + 1)\n s = s & u(i) & \" \"\n t(i) = u(i)\n Next i\n ss = ss & s & vbCrLf\n Next n\n MsgBox ss, , \"Pascal's triangle\"\nEnd Sub 'pascaltriangle\n","language":"Visual-Basic"},{"code":"Imports System.Numerics\n\nModule Module1\n Iterator Function GetRow(rowNumber As BigInteger) As IEnumerable(Of BigInteger)\n Dim denominator As BigInteger = 1\n Dim numerator = rowNumber\n\n Dim currentValue As BigInteger = 1\n For counter = 0 To rowNumber\n Yield currentValue\n currentValue = currentValue * numerator\n numerator = numerator - 1\n currentValue = currentValue / denominator\n denominator = denominator + 1\n Next\n End Function\n\n Function GetTriangle(quantityOfRows As Integer) As IEnumerable(Of BigInteger())\n Dim range = Enumerable.Range(0, quantityOfRows).Select(Function(num) New BigInteger(num))\n Return range.Select(Function(num) GetRow(num).ToArray())\n End Function\n\n Function CenterString(text As String, width As Integer)\n Dim spaces = width - text.Length\n Dim padLeft = (spaces / 2) + text.Length\n Return text.PadLeft(padLeft).PadRight(width)\n End Function\n\n Function FormatTriangleString(triangle As IEnumerable(Of BigInteger())) As String\n Dim maxDigitWidth = triangle.Last().Max().ToString().Length\n Dim rows = triangle.Select(Function(arr) String.Join(\" \", arr.Select(Function(array) CenterString(array.ToString(), maxDigitWidth))))\n Dim maxRowWidth = rows.Last().Length\n Return String.Join(Environment.NewLine, rows.Select(Function(row) CenterString(row, maxRowWidth)))\n End Function\n\n Sub Main()\n Dim triangle = GetTriangle(20)\n Dim output = FormatTriangleString(triangle)\n Console.WriteLine(output)\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"./fmt\" for Fmt\nimport \"./math\" for Int\n\nvar pascalTriangle = Fn.new { |n|\n if (n <= 0) return\n for (i in 0...n) {\n System.write(\" \" * (n-i-1))\n for (j in 0..i) {\n Fmt.write(\"$3d \", Int.binomial(i, j))\n }\n System.print()\n }\n}\n\npascalTriangle.call(13)\n","language":"Wren"},{"code":"%include \"io.inc\"\n\nsection .text\nglobal CMAIN\nCMAIN:\n\tmov ebx, 7 ;size\n\tcall mloop\n\tret\n\t\nmloop:\n\tmov edx, 0 ;edx stands for the nth line\nlooping:\n\tpush ebx\n\tpush edx\n\tcall line\n\tpop edx\n\tpop ebx\n\tinc edx\n\tcmp edx, ebx\n\tjl looping\n\txor eax, eax\n\tret\n\t\nline:\n\tmov ecx, 0 ;ecx stands for the nth character in each line\n\tmlp:\n\t\tpush ecx\n push edx\n\t\tcall nCk\n pop edx\n\t\tpop ecx\n\t\tPRINT_DEC 4, eax ;print returned number\n PRINT_STRING \" \"\n\t\tinc ecx\n\t\tcmp ecx, edx ;if\n\t\tjle mlp\n\t\tNEWLINE\n\t\tret\n\t\t\nnCk:\n\t;ecx : j\n\t;edx : i\n\tmov esi, edx\n\tcall fac ;i!\n\tpush eax ;save i!\n\tmov esi, ecx\n\tcall fac ;j!\n\tpush eax ;save j!\n\tmov ebx, edx\n\tsub ebx, ecx ;(i-j)\n\tmov esi, ebx\n\tcall fac ;(i-j)!\n\tpop ebx ;(i-j)! is in eax\n\tmul ebx ;(i-j)! * j!\n\tmov ecx, eax\n\tpop eax ; get i!\n\tdiv ecx ; ; last step : i! divided by (i-j)! * j!\n\tret\n\t\nfac:\n\tpush ecx\n push edx\n\tmov eax, 1\n\tmov ecx, esi\n\tcmp ecx, 0 ; 0! returns 1\n\tje facz\n\tlp:\n\t\tmul ecx ;multiplies eax by ecx and then decrements ecx until ecx is 0\n\t\tdec ecx\n\t\tcmp ecx, 0\n\t\tjg lp\n\t\tjmp end\n\tfacz:\n\t\tmov eax, 1\n\tend:\n pop edx\n\t\tpop ecx\n\t\tret\n","language":"X86-Assembly"},{"code":"PROGRAM \"pascal\"\nVERSION \"0.0001\"\n\nDECLARE FUNCTION Entry()\n\nFUNCTION Entry()\n r@@ = UBYTE(INLINE$(\"Number of rows? \"))\n FOR i@@ = 0 TO r@@ - 1\n c%% = 1\n FOR k@@ = 0 TO i@@\n PRINT FORMAT$(\"####\", c%%);\n c%% = c%% * (i@@ - k@@) / (k@@ + 1)\n NEXT k@@\n PRINT\n NEXT i@@\nEND FUNCTION\nEND PROGRAM\n","language":"XBasic"},{"code":"include c:\\cxpl\\codes;\n\nproc Pascal(N); \\Display the first N rows of Pascal's triangle\nint N; \\if N<=0 then nothing is displayed\nint Row, I, Old(40), New(40);\n[for Row:= 0 to N-1 do\n [New(0):= 1;\n for I:= 1 to Row do New(I):= Old(I-1) + Old(I);\n for I:= 1 to (N-Row-1)*2 do ChOut(0, ^ );\n for I:= 0 to Row do\n [if New(I)<100 then ChOut(0, ^ );\n IntOut(0, New(I));\n if New(I)<10 then ChOut(0, ^ );\n ChOut(0, ^ );\n ];\n New(Row+1):= 0;\n I:= Old; Old:= New; New:= I;\n CrLf(0);\n ];\n];\n\nPascal(13)\n","language":"XPL0"},{"code":"fcn pascalTriangle(n){ // n<=0-->\"\"\n foreach i in (n){\n c := 1;\n print(\" \"*(2*(n-1-i)));\n foreach k in (i+1){\n print(\"%3d \".fmt(c));\n c = c * (i-k)/(k+1);\n }\n println();\n }\n}\n\npascalTriangle(8);\n","language":"Zkl"},{"code":" 10 INPUT \"How many rows? \";n\n 15 IF n<1 THEN GO TO 210\n 20 DIM c(n)\n 25 DIM d(n)\n 30 LET c(1)=1\n 35 LET d(1)=1\n 40 FOR r=1 TO n\n 50 FOR i=1 TO (n-r)\n 60 PRINT \" \";\n 70 NEXT i\n 80 FOR i=1 TO r\n 90 PRINT c(i);\" \";\n100 NEXT i\n110 PRINT\n120 IF r>=n THEN GO TO 140\n130 LET d(r+1)=1\n140 FOR i=2 TO r\n150 LET d(i)=c(i-1)+c(i)\n160 NEXT i\n165 IF r>=n THEN GO TO 200\n170 FOR i=1 TO r+1\n180 LET c(i)=d(i)\n190 NEXT i\n200 NEXT r\n","language":"ZX-Spectrum-Basic"},{"code":"RUN\n","language":"ZX-Spectrum-Basic"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pascal's_triangle\\nnote: Arithmetic operations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[[wp:Pascal's triangle|Pascal's triangle]] is an arithmetic and geometric figure often associated with the name of [[wp:Blaise Pascal|Blaise Pascal]], but also studied centuries earlier in India, Persia, China and elsewhere.\\n\\nIts first few rows look like this: <b>\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1 </b>\\nwhere each element of each row is either 1 or the sum of the two elements right above it. \\n\\nFor example, the next row of the triangle would be:\\n::: '''1''' (since the first element of each row doesn't have two elements above it)\\n::: '''4''' (1 + 3)\\n::: '''6''' (3 + 3)\\n::: '''4''' (3 + 1)\\n::: '''1''' (since the last element of each row doesn't have two elements above it) \\n\\nSo the triangle now looks like this: <b>\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1 </b>\\n\\nEach row <tt> n </tt> (starting with row 0 at the top) shows the coefficients of the binomial expansion of <big><big> (x + y)<sup>n</sup>. </big></big>\\n\\n\\n;Task:\\nWrite a function that prints out the first <tt> n </tt> rows of the triangle (with <tt> f(1) </tt> yielding the row consisting of only the element '''1'''). \\n\\nThis can be done either by summing elements from the previous rows or using a binary coefficient or combination function. \\n\\nBehavior for <big><tt> n ≤ 0 </tt></big> does not need to be uniform, but should be noted.\\n\\n\\n;See also:\\n* [[Evaluate binomial coefficients]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F pascal(n)\\n V row = [1]\\n V k = [0]\\n L 0 .< max(n, 0)\\n print(row.join(‘ ’).center(16))\\n row = zip(row [+] k, k [+] row).map((l, r) -> l + r)\\n\\npascal(7)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"* Pascal's triangle 25/10/2015\\nPASCAL CSECT\\n USING PASCAL,R15 set base register\\n LA R7,1 n=1\\nLOOPN C R7,=A(M) do n=1 to m\\n BH ELOOPN if n>m then goto\\n MVC U,=F'1' u(1)=1\\n LA R8,PG pgi=@pg\\n LA R6,1 i=1\\nLOOPI CR R6,R7 do i=1 to n\\n BH ELOOPI if i>n then goto\\n LR R1,R6 i\\n SLA R1,2 i*4\\n L R3,T-4(R1) t(i)\\n L R4,T(R1) t(i+1)\\n AR R3,R4 t(i)+t(i+1)\\n ST R3,U(R1) u(i+1)=t(i)+t(i+1)\\n LR R1,R6 i\\n SLA R1,2 i*4\\n L R2,U-4(R1) u(i)\\n XDECO R2,XD edit u(i)\\n MVC 0(4,R8),XD+8 output u(i):4\\n LA R8,4(R8) pgi=pgi+4\\n LA R6,1(R6) i=i+1\\n B LOOPI end i\\nELOOPI MVC T((M+1)*(L'T)),U t=u\\n XPRNT PG,80 print\\n LA R7,1(R7) n=n+1\\n B LOOPN end n\\nELOOPN XR R15,R15 set return code\\n BR R14 return to caller\\nM EQU 11 <== input\\nT DC (M+1)F'0' t(m+1) init 0\\nU DC (M+1)F'0' u(m+1) init 0\\nPG DC CL80' ' pg init ' '\\nXD DS CL12 temp\\n YREGS\\n END PASCAL\\n\",\n \"language\": \"360-Assembly\"\n },\n {\n \"code\": \"\\\\ print the array\\n: .arr \\\\ a -- a\\n ( . space ) a:each ;\\n\\n: pasc \\\\ a --\\n \\\\ print the row\\n .arr cr\\n dup\\n \\\\ create two rows from the first, one with a leading the other with a trailing 0\\n [0] 0 a:insert swap 0 a:push\\n \\\\ add the arrays together to make the new one\\n ' n:+ a:op ;\\n\\n\\\\ print the first 16 rows:\\n[1] ' pasc 16 times\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \": ratio \\\\ m n -- num denom\\n tuck n:- n:1+ swap ;\\n\\n\\\\ one item in the row: n m\\n: pascitem \\\\ n m -- n\\n\\tr@ swap\\n\\tratio\\n\\tn:*/ n:round int\\n\\tdup . space ;\\n\\n\\\\ One row of Pascal's triangle\\n: pascline \\\\ n --\\n\\t>r 1 int dup . space\\n\\t' pascitem\\n\\t1 r@ loop rdrop drop cr ;\\n\\n\\\\ Calculate the first 'n' rows of Pascal's triangle:\\n: pasc \\\\ n\\n\\t' pascline 0 rot loop cr ;\\n\\n15 pasc\\n\",\n \"language\": \"8th\"\n },\n {\n \"code\": \"PROC Main()\\n BYTE count=[10],row,item\\n CHAR ARRAY s(5)\\n INT v\\n\\n FOR row=0 TO count-1\\n DO\\n v=1\\n FOR item=0 TO row\\n DO\\n StrI(v,s)\\n Position(2*(count-row)+4*item-s(0),row+1)\\n Print(s)\\n v=v*(row-item)/(item+1)\\n OD\\n PutE()\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"package Pascal is\\n\\n type Row is array (Natural range <>) of Natural;\\n\\n function Length(R: Row) return Positive;\\n\\n function First_Row(Max_Length: Positive) return Row;\\n\\n function Next_Row(R: Row) return Row;\\n\\nend Pascal;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"package body Pascal is\\n\\n function First_Row(Max_Length: Positive) return Row is\\n R: Row(0 .. Max_Length) := (0 | 1 => 1, others => 0);\\n begin\\n return R;\\n end First_Row;\\n\\n function Next_Row(R: Row) return Row is\\n S: Row(R'Range);\\n begin\\n S(0) := Length(R)+1;\\n S(Length(S)) := 1;\\n for J in reverse 2 .. Length(R) loop\\n S(J) := R(J)+R(J-1);\\n end loop;\\n S(1) := 1;\\n return S;\\n end Next_Row;\\n\\n function Length(R: Row) return Positive is\\n begin\\n return R(0);\\n end Length;\\n\\nend Pascal;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"with Ada.Text_IO, Ada.Integer_Text_IO, Ada.Command_Line, Pascal; use Pascal;\\n\\nprocedure Triangle is\\n\\n Number_Of_Rows: Positive := Integer'Value(Ada.Command_Line.Argument(1));\\n Row: Pascal.Row := First_Row(Number_Of_Rows);\\n\\nbegin\\n loop\\n -- print one row\\n for J in 1 .. Length(Row) loop\\n\\t Ada.Integer_Text_IO.Put(Row(J), 5);\\n end loop;\\n Ada.Text_IO.New_Line;\\n exit when Length(Row) >= Number_Of_Rows;\\n Row := Next_Row(Row);\\n end loop;\\nend Triangle;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"PRIO MINLWB = 8, MAXUPB = 8;\\nOP MINLWB = ([]INT a,b)INT: (LWB a<LWB b|LWB a|LWB b),\\n MAXUPB = ([]INT a,b)INT: (UPB a>UPB b|UPB a|UPB b);\\n\\nOP + = ([]INT a,b)[]INT:(\\n [a MINLWB b:a MAXUPB b]INT out; FOR i FROM LWB out TO UPB out DO out[i]:= 0 OD;\\n out[LWB a:UPB a] := a; FOR i FROM LWB b TO UPB b DO out[i]+:= b[i] OD;\\n out\\n);\\n\\nINT width = 4, stop = 9;\\nFORMAT centre = $n((stop-UPB row+1)*width OVER 2)(q)$;\\n\\nFLEX[1]INT row := 1; # example of rowing #\\nFOR i WHILE\\n printf((centre, $g(-width)$, row, $l$));\\n# WHILE # i < stop DO\\n row := row[AT 1] + row[AT 2]\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin\\n % prints the first n lines of Pascal's triangle lines %\\n % if n is <= 0, no output is produced %\\n procedure printPascalTriangle( integer value n ) ;\\n if n > 0 then begin\\n integer array pascalLine ( 1 :: n );\\n pascalLine( 1 ) := 1;\\n for line := 1 until n do begin\\n for i := line - 1 step - 1 until 2 do pascalLine( i ) := pascalLine( i - 1 ) + pascalLine( i );\\n pascalLine( line ) := 1;\\n write( s_w := 0, \\\" \\\" );\\n for i := line until n do writeon( s_w := 0, \\\" \\\" );\\n for i := 1 until line do writeon( i_w := 6, s_w := 0, pascalLine( i ) )\\n end for_line ;\\n end printPascalTriangle ;\\n\\n printPascalTriangle( 8 )\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"#include <jambo.h>\\n#define Mulbyandmoveto(_X_) Mul by '_X_', Move to '_X_'\\n\\nMain\\n filas=0, Get arg numeric '2', Move to 'filas'\\n i=0, r=\\\"\\\"\\n Loop if( var 'i' Is less than 'filas' )\\n c=1, j=0\\n Set 'c' To str, Move to 'r'\\n Loop if ( var 'j' Is less than 'i' )\\n Set 'i' Minus 'j', Plus one 'j', Div it; Mul by and move to 'c'\\n Multi cat ' r, \\\"\\\\t\\\", Str(c) '; Move to 'r'\\n ++j\\n Back\\n Printnl 'r'\\n ++i\\n Back\\nEnd\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \"{⍕0~¨⍨(-⌽A)⌽↑,/0,¨⍉A∘.!A←0,⍳⍵}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"{⍕0~¨⍨(-⌽A)⌽↑,/0,¨⍉A∘.!A←0,⍳⍵}5\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"{{⍉⍵∘.!⍵} 0,⍳⍵}\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"{{⍉⍵∘.!⍵} 0,⍳⍵} 3\\n\",\n \"language\": \"APL\"\n },\n {\n \"code\": \"-------------------- PASCAL'S TRIANGLE -------------------\\n\\n-- pascal :: Generator [[Int]]\\non pascal()\\n script nextRow\\n on |λ|(row)\\n zipWith(my plus, {0} & row, row & {0})\\n end |λ|\\n end script\\n iterate(nextRow, {1})\\nend pascal\\n\\n\\n--------------------------- TEST -------------------------\\non run\\n showPascal(take(7, pascal()))\\nend run\\n\\n\\n------------------------ FORMATTING ----------------------\\n\\n-- showPascal :: [[Int]] -> String\\non showPascal(xs)\\n set w to length of intercalate(\\\" \\\", item -1 of xs)\\n script align\\n on |λ|(x)\\n |center|(w, space, intercalate(\\\" \\\", x))\\n end |λ|\\n end script\\n unlines(map(align, xs))\\nend showPascal\\n\\n\\n------------------------- GENERIC ------------------------\\n\\n-- center :: Int -> Char -> String -> String\\non |center|(n, cFiller, strText)\\n set lngFill to n - (length of strText)\\n if lngFill > 0 then\\n set strPad to replicate(lngFill div 2, cFiller) as text\\n set strCenter to strPad & strText & strPad\\n if lngFill mod 2 > 0 then\\n cFiller & strCenter\\n else\\n strCenter\\n end if\\n else\\n strText\\n end if\\nend |center|\\n\\n\\n-- intercalate :: String -> [String] -> String\\non intercalate(sep, xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, sep}\\n set s to xs as text\\n set my text item delimiters to dlm\\n return s\\nend intercalate\\n\\n\\n-- iterate :: (a -> a) -> a -> Generator [a]\\non iterate(f, x)\\n script\\n property v : missing value\\n property g : mReturn(f)'s |λ|\\n on |λ|()\\n if missing value is v then\\n set v to x\\n else\\n set v to g(v)\\n end if\\n return v\\n end |λ|\\n end script\\nend iterate\\n\\n\\n-- length :: [a] -> Int\\non |length|(xs)\\n set c to class of xs\\n if list is c or string is c then\\n length of xs\\n else\\n 2 ^ 30 -- (simple proxy for non-finite)\\n end if\\nend |length|\\n\\n\\n-- map :: (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 |λ|(item i of xs, i, xs)\\n end repeat\\n return lst\\n end tell\\nend map\\n\\n\\n-- min :: 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\\n-- mReturn :: First-class m => (a -> b) -> m (a -> b)\\non mReturn(f)\\n -- 2nd class handler function lifted into 1st class script wrapper.\\n if script is class of f then\\n f\\n else\\n script\\n property |λ| : f\\n end script\\n end if\\nend mReturn\\n\\n\\n\\n-- plus :: Num -> Num -> Num\\non plus(a, b)\\n a + b\\nend plus\\n\\n\\n-- Egyptian multiplication - progressively doubling a list, appending\\n-- stages of doubling to an accumulator where needed for binary\\n-- assembly of a target length\\n-- replicate :: 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\\n-- take :: Int -> [a] -> [a]\\n-- take :: Int -> String -> String\\non take(n, xs)\\n set c to class of xs\\n if list is c then\\n if 0 < n then\\n items 1 thru min(n, length of xs) of xs\\n else\\n {}\\n end if\\n else if string is c then\\n if 0 < n then\\n text 1 thru min(n, length of xs) of xs\\n else\\n \\\"\\\"\\n end if\\n else if script is c then\\n set ys to {}\\n repeat with i from 1 to n\\n set end of ys to xs's |λ|()\\n end repeat\\n return ys\\n else\\n missing value\\n end if\\nend take\\n\\n\\n-- unlines :: [String] -> String\\non unlines(xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, linefeed}\\n set str to xs as text\\n set my text item delimiters to dlm\\n str\\nend unlines\\n\\n\\n-- unwords :: [String] -> String\\non unwords(xs)\\n set {dlm, my text item delimiters} to ¬\\n {my text item delimiters, space}\\n set s to xs as text\\n set my text item delimiters to dlm\\n return s\\nend unwords\\n\\n\\n-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\non zipWith(f, xs, ys)\\n set lng to min(|length|(xs), |length|(ys))\\n if 1 > lng then return {}\\n set xs_ to take(lng, xs) -- Allow for non-finite\\n set ys_ to take(lng, ys) -- generators like cycle etc\\n set lst to {}\\n tell mReturn(f)\\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\\n end tell\\nend zipWith\\n\",\n \"language\": \"AppleScript\"\n },\n {\n \"code\": \"pascalTriangle: function [n][\\n triangle: new [[1]]\\n\\n loop 1..dec n 'x [\\n 'triangle ++ @[map couple (last triangle)++[0] [0]++(last triangle) 'x -> x\\\\[0] + x\\\\[1]]\\n ]\\n\\n return triangle\\n]\\n\\nloop pascalTriangle 10 'row [\\n print pad.center join.with: \\\" \\\" map to [:string] row 'x -> pad.center x 5 60\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"n := 8, p0 := \\\"1\\\" ; 1+n rows of Pascal's triangle\\nLoop %n% {\\n p := \\\"p\\\" A_Index, %p% := v := 1, q := \\\"p\\\" A_Index-1\\n Loop Parse, %q%, %A_Space%\\n If (A_Index > 1)\\n %p% .= \\\" \\\" v+A_LoopField, v := A_LoopField\\n %p% .= \\\" 1\\\"\\n}\\n ; Triangular Formatted output\\nVarSetCapacity(tabs,n,Asc(\\\"`t\\\"))\\nt .= tabs \\\"`t1\\\"\\nLoop %n% {\\n t .= \\\"`n\\\" SubStr(tabs,A_Index)\\n Loop Parse, p%A_Index%, %A_Space%\\n t .= A_LoopField \\\"`t`t\\\"\\n}\\nGui Add, Text,, %t% ; Show result in a GUI\\nGui Show\\nReturn\\n\\nGuiClose:\\n ExitApp\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"Msgbox % format(pascalstriangle())\\nReturn\\n\\nformat(o) ; converts object to string\\n{\\n\\tFor k, v in o\\n\\t\\ts .= IsObject(v) ? format(v) \\\"`n\\\" : v \\\" \\\"\\n\\tReturn s\\n}\\npascalstriangle(n=7) ; n rows of Pascal's triangle\\n{\\n\\tp := Object(), z:=Object()\\n\\tLoop, % n\\n\\t\\tLoop, % row := A_Index\\n\\t\\t\\tcol := A_Index\\n\\t\\t\\t, p[row, col] := row = 1 and col = 1\\n\\t\\t\\t\\t? 1\\n\\t\\t\\t\\t: (p[row-1, col-1] = \\\"\\\" ; math operations on blanks return blanks; I want to assume zero\\n\\t\\t\\t\\t\\t? 0\\n\\t\\t\\t\\t\\t: p[row-1, col-1])\\n\\t\\t\\t\\t+ (p[row-1, col] = \\\"\\\"\\n\\t\\t\\t\\t\\t? 0\\n\\t\\t\\t\\t\\t: p[row-1, col])\\n\\tReturn p\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"$ awk 'BEGIN{for(i=0;i<6;i++){c=1;r=c;for(j=0;j<i;j++){c*=(i-j)/(j+1);r=r\\\" \\\"c};print r}}'\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"// Create a Pascal's triangle with a given number of rows.\\n// Returns an empty array for row_nr <= 0.\\nfun pascals_triangle(row_nr i32) [][]i32 {\\n\\tmut rows := [][]i32\\n\\n\\t// Iterate over all rows\\n\\tfor r := 0; r < row_nr; r += 1 {\\n\\t\\t// Store the row above the current one\\n\\t\\tmut above := rows[r - 1]\\n\\n\\t\\t// Fill the current row. It contains r + 1 numbers\\n\\t\\tfor i := 0; i <= r; i += 1 {\\n\\t\\t\\t// First number is always 1\\n\\t\\t\\tif i == 0 {\\n\\t\\t\\t\\trows.push([1]) // Push new row\\n\\t\\t\\t}\\n\\t\\t\\t// Last number is always 1\\n\\t\\t\\telse if i == r {\\n\\t\\t\\t\\trows[r].push(1)\\n\\t\\t\\t}\\n\\t\\t\\t// Other numbers are the sum of the two numbers above them\\n\\t\\t\\telse {\\n\\t\\t\\t\\trows[r].push(above[i - 1] + above[i])\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn rows\\n}\\n\\n\\n// Helper function to pretty print triangles.\\n// It still get's ugly once numbers have >= 2 digits.\\nfun print_triangle(triangle [][]i32) {\\n\\tfor i, row in triangle {\\n\\t\\t// Create string with leading spaces\\n\\t\\tmut s := ' '.repeat(triangle.length - i - 1)\\n\\n\\t\\t// Add each number to the string\\n\\t\\tfor n in row {\\n\\t\\t\\ts += n.str() + ' '\\n\\t\\t}\\n\\n\\t\\t// Print and trim the extra trailing space\\n\\t\\tprintln(s.trim_right(' '))\\n\\t}\\n}\\n\\n\\nfun main() {\\n\\tprint_triangle(pascals_triangle(7))\\n}\\n\",\n \"language\": \"Bait\"\n },\n {\n \"code\": \"DIM i AS Integer\\nDIM row AS Integer\\nDIM nrows AS Integer\\nDIM values(100) AS Integer\\n\\nINPUT \\\"Number of rows: \\\"; nrows\\nvalues(1) = 1\\nPRINT TAB((nrows)*3);\\\" 1\\\"\\nFOR row = 2 TO nrows\\n PRINT TAB((nrows-row)*3+1);\\n FOR i = row TO 1 STEP -1\\n values(i) = values(i) + values(i-1)\\n PRINT USING \\\"##### \\\"; values(i);\\n NEXT i\\n PRINT\\nNEXT row\\n\",\n \"language\": \"BASIC\"\n },\n {\n \"code\": \"@echo off\\nsetlocal enabledelayedexpansion\\n\\n::The Main Thing...\\ncls\\necho.\\nset row=15\\ncall :pascal\\necho.\\npause\\nexit /b 0\\n::/The Main Thing.\\n\\n::The Functions...\\n:pascal\\n\\tset /a prev=%row%-1\\n\\tfor /l %%I in (0,1,%prev%) do (\\n\\t\\tset c=1&set r=\\n\\t\\tfor /l %%K in (0,1,%row%) do (\\n\\t\\t\\tif not !c!==0 (\\n\\t\\t\\t\\tcall :numstr !c!\\n\\t\\t\\t\\tset r=!r!!space!!c!\\n\\t\\t\\t)\\n\\t\\t\\tset /a c=!c!*^(%%I-%%K^)/^(%%K+1^)\\n\\t\\t)\\n\\t\\techo !r!\\n\\t)\\ngoto :EOF\\n\\n:numstr\\n\\t::This function returns the number of whitespaces to be applied on each numbers.\\n\\tset cnt=0&set proc=%1&set space=\\n\\t:loop\\n\\tset currchar=!proc:~%cnt%,1!\\n\\tif not \\\"!currchar!\\\"==\\\"\\\" set /a cnt+=1&goto loop\\n\\tset /a numspaces=5-!cnt!\\n\\tfor /l %%A in (1,1,%numspaces%) do set \\\"space=!space! \\\"\\ngoto :EOF\\n::/The Functions.\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \" nrows% = 10\\n\\n colwidth% = 4\\n @% = colwidth% : REM Set column width\\n FOR row% = 1 TO nrows%\\n PRINT SPC(colwidth%*(nrows% - row%)/2);\\n acc% = 1\\n FOR element% = 1 TO row%\\n PRINT acc%;\\n acc% = acc% * (row% - element%) / element% + 0.5\\n NEXT\\n PRINT\\n NEXT row%\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"get \\\"libhdr\\\"\\n\\nlet pascal(n) be\\n for i=0 to n-1\\n $( let c = 1\\n for j=1 to 2*(n-1-i) do wrch(' ')\\n for k=0 to i\\n $( writef(\\\"%I3 \\\",c)\\n c := c*(i-k)/(k+1)\\n $)\\n wrch('*N')\\n $)\\n\\nlet start() be pascal(8)\\n\",\n \"language\": \"BCPL\"\n },\n {\n \"code\": \"0\\\" :swor fo rebmuN\\\">:#,_&> 55+, v\\nv01*p00-1:g00.:<1p011p00:\\\\-1_v#:<\\n>g:1+10p/48*,:#^_$ 55+,1+\\\\: ^>$$@\\n\",\n \"language\": \"Befunge\"\n },\n {\n \"code\": \"Pascal ← {(0⊸∾+∾⟜0)⍟(↕𝕩)⋈1}\\n\\n•Show¨Pascal 6\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"⟨ 1 ⟩\\n⟨ 1 1 ⟩\\n⟨ 1 2 1 ⟩\\n⟨ 1 3 3 1 ⟩\\n⟨ 1 4 6 4 1 ⟩\\n⟨ 1 5 10 10 5 1 ⟩\\n\",\n \"language\": \"BQN\"\n },\n {\n \"code\": \"( out$\\\"Number of rows? \\\"\\n& get':?R\\n& -1:?I\\n& whl\\n ' ( 1+!I:<!R:?I\\n & 1:?C\\n & -1:?K\\n & !R+-1*!I:?tabs\\n & whl'(!tabs+-1:>0:?tabs&put$\\\\t)\\n & whl\\n ' ( 1+!K:~>!I:?K\\n & put$(!C \\\\t\\\\t)\\n & !C*(!I+-1*!K)*(!K+1)^-1:?C\\n )\\n & put$\\\\n\\n )\\n&\\n)\\n\",\n \"language\": \"Bracmat\"\n },\n {\n \"code\": \"blsq ) {1}{1 1}{^^2CO{p^?+}m[1+]1[+}15E!#s<-spbx#S\\n1\\n1 1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n1 5 10 10 5 1\\n1 6 15 20 15 6 1\\n1 7 21 35 35 21 7 1\\n1 8 28 56 70 56 28 8 1\\n1 9 36 84 126 126 84 36 9 1\\n1 10 45 120 210 252 210 120 45 10 1\\n1 11 55 165 330 462 462 330 165 55 11 1\\n1 12 66 220 495 792 924 792 495 220 66 12 1\\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\\n1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16 1\\n\",\n \"language\": \"Burlesque\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\nvoid pascaltriangle(unsigned int n)\\n{\\n unsigned int c, i, j, k;\\n\\n for(i=0; i < n; i++) {\\n c = 1;\\n for(j=1; j <= 2*(n-1-i); j++) printf(\\\" \\\");\\n for(k=0; k <= i; k++) {\\n printf(\\\"%3d \\\", c);\\n c = c * (i-k)/(k+1);\\n }\\n printf(\\\"\\\\n\\\");\\n }\\n}\\n\\nint main()\\n{\\n pascaltriangle(8);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n\\n#define D 32\\nint pascals(int *x, int *y, int d)\\n{\\n\\tint i;\\n\\tfor (i = 1; i < d; i++)\\n\\t\\tprintf(\\\"%d%c\\\", y[i] = x[i - 1] + x[i],\\n\\t\\t\\ti < d - 1 ? ' ' : '\\\\n');\\n\\n\\treturn D > d ? pascals(y, x, d + 1) : 0;\\n}\\n\\nint main()\\n{\\n\\tint x[D] = {0, 1, 0}, y[D] = {0};\\n\\treturn pascals(x, y, 0);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"void triangleC(int nRows) {\\n if (nRows <= 0) return;\\n int *prevRow = NULL;\\n for (int r = 1; r <= nRows; r++) {\\n int *currRow = malloc(r * sizeof(int));\\n for (int i = 0; i < r; i++) {\\n int val = i==0 || i==r-1 ? 1 : prevRow[i-1] + prevRow[i];\\n currRow[i] = val;\\n printf(\\\" %4d\\\", val);\\n }\\n printf(\\\"\\\\n\\\");\\n free(prevRow);\\n prevRow = currRow;\\n }\\n free(prevRow);\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <algorithm>\\n#include<cstdio>\\nusing namespace std;\\nvoid Pascal_Triangle(int size) {\\n\\n\\tint a[100][100];\\n\\tint i, j;\\n\\n\\t//first row and first coloumn has the same value=1\\n\\tfor (i = 1; i <= size; i++) {\\n\\t\\ta[i][1] = a[1][i] = 1;\\n\\t}\\n\\t\\n\\t//Generate the full Triangle\\n\\tfor (i = 2; i <= size; i++) {\\n\\t\\tfor (j = 2; j <= size - i; j++) {\\n\\t\\t\\tif (a[i - 1][j] == 0 || a[i][j - 1] == 0) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\ta[i][j] = a[i - 1][j] + a[i][j - 1];\\n\\t\\t}\\n\\t}\\n\\n\\t/*\\n\\t 1 1 1 1\\n\\t 1 2 3\\n\\t 1 3\\n\\t 1\\n\\t\\n\\tfirst print as above format-->\\n\\t\\n\\tfor (i = 1; i < size; i++) {\\n\\t\\tfor (j = 1; j < size; j++) {\\n\\t\\t\\tif (a[i][j] == 0) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%8d\\\",a[i][j]);\\n\\t\\t}\\n\\t\\t\\tcout<<\\\"\\\\n\\\\n\\\";\\n\\t}*/\\n\\t\\n\\t// standard Pascal Triangle Format\\n\\t\\n\\tint row,space;\\n\\tfor (i = 1; i < size; i++) {\\n\\t\\tspace=row=i;\\n\\t\\tj=1;\\n\\t\\t\\n\\t\\twhile(space<=size+(size-i)+1){\\n\\t\\t\\t cout<<\\\" \\\";\\n\\t\\t\\t space++;\\n\\t\\t }\\n\\t\\t\\n\\t\\twhile(j<=i){\\n\\t\\t\\tif (a[row][j] == 0){\\n\\t\\t\\t\\t break;\\n\\t\\t\\t }\\n\\t\\t\\t\\n\\t\\t\\tif(j==1){\\n\\t\\t\\t\\tprintf(\\\"%d\\\",a[row--][j++]);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t\\tprintf(\\\"%6d\\\",a[row--][j++]);\\n\\t\\t}\\n\\t\\t\\tcout<<\\\"\\\\n\\\\n\\\";\\n\\t}\\n\\t\\n}\\n\\nint main()\\n{\\n\\t//freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n\\t\\n\\tint size;\\n\\tcin>>size;\\n\\tPascal_Triangle(size);\\n}\\n\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"// Compile with -std=c++11\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\nvoid print_vector(vector<int> dummy){\\n\\tfor (vector<int>::iterator i = dummy.begin(); i != dummy.end(); ++i)\\n\\t\\tcout<<*i<<\\\" \\\";\\n\\tcout<<endl;\\n}\\nvoid print_vector_of_vectors(vector<vector<int>> dummy){\\n\\tfor (vector<vector<int>>::iterator i = dummy.begin(); i != dummy.end(); ++i)\\n\\t\\tprint_vector(*i);\\n\\tcout<<endl;\\n}\\nvector<vector<int>> dynamic_triangle(int dummy){\\n\\tvector<vector<int>> result;\\n\\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\\n\\t\\tvector<int> row;\\n\\t\\t// The first row\\n\\t\\trow.push_back(1);\\n\\t\\tresult.push_back(row);\\n\\t\\t// The second row\\n\\t\\tif (dummy > 1){\\n\\t\\t\\trow.clear();\\n\\t\\t\\trow.push_back(1); row.push_back(1);\\n\\t\\t\\tresult.push_back(row);\\n\\t\\t}\\n\\t\\t// The other rows\\n\\t\\tif (dummy > 2){\\n\\t\\t\\tfor (int i = 2; i < dummy; i++){\\n\\t\\t\\t\\trow.clear();\\n\\t\\t\\t\\trow.push_back(1);\\n\\t\\t\\t\\tfor (int j = 1; j < i; j++)\\n\\t\\t\\t\\t\\trow.push_back(result.back().at(j - 1) + result.back().at(j));\\n\\t\\t\\t\\trow.push_back(1);\\n\\t\\t\\t\\tresult.push_back(row);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\nvector<vector<int>> static_triangle(int dummy){\\n\\tvector<vector<int>> result;\\n\\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\\n\\t\\tvector<int> row;\\n\\t\\tresult.resize(dummy); // This should work faster than consecutive push_back()s\\n\\t\\t// The first row\\n\\t\\trow.resize(1);\\n\\t\\trow.at(0) = 1;\\n\\t\\tresult.at(0) = row;\\n\\t\\t// The second row\\n\\t\\tif (result.size() > 1){\\n\\t\\t\\trow.resize(2);\\n\\t\\t\\trow.at(0) = 1; row.at(1) = 1;\\n\\t\\t\\tresult.at(1) = row;\\n\\t\\t}\\n\\t\\t// The other rows\\n\\t\\tif (result.size() > 2){\\n\\t\\t\\tfor (int i = 2; i < result.size(); i++){\\n\\t\\t\\t\\trow.resize(i + 1); // This should work faster than consecutive push_back()s\\n\\t\\t\\t\\trow.front() = 1;\\n\\t\\t\\t\\tfor (int j = 1; j < row.size() - 1; j++)\\n\\t\\t\\t\\t\\trow.at(j) = result.at(i - 1).at(j - 1) + result.at(i - 1).at(j);\\n\\t\\t\\t\\trow.back() = 1;\\n\\t\\t\\t\\tresult.at(i) = row;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\nint main(){\\n\\tvector<vector<int>> triangle;\\n\\tint n;\\n\\tcout<<endl<<\\\"The Pascal's Triangle\\\"<<endl<<\\\"Enter the number of rows: \\\";\\n\\tcin>>n;\\n\\t// Call the dynamic function\\n\\ttriangle = dynamic_triangle(n);\\n\\tcout<<endl<<\\\"Calculated using dynamic vectors:\\\"<<endl<<endl;\\n\\tprint_vector_of_vectors(triangle);\\n\\t// Call the static function\\n\\ttriangle = static_triangle(n);\\n\\tcout<<endl<<\\\"Calculated using static vectors:\\\"<<endl<<endl;\\n\\tprint_vector_of_vectors(triangle);\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"// Compile with -std=c++11\\n#include<iostream>\\n#include<vector>\\nusing namespace std;\\nclass pascal_triangle{\\n\\tvector<vector<int>> data; // This is the actual data\\n\\tvoid print_row(vector<int> dummy){\\n\\t\\tfor (vector<int>::iterator i = dummy.begin(); i != dummy.end(); ++i)\\n\\t\\t\\tcout<<*i<<\\\" \\\";\\n\\t\\tcout<<endl;\\n\\t}\\npublic:\\n\\tpascal_triangle(int dummy){ // Everything is done on the construction phase\\n\\t\\tif (dummy > 0){ // if the argument is 0 or negative exit immediately\\n\\t\\t\\tvector<int> row;\\n\\t\\t\\tdata.resize(dummy); // Theoretically this should work faster than consecutive push_back()s\\n\\t\\t\\t// The first row\\n\\t\\t\\trow.resize(1);\\n\\t\\t\\trow.at(0) = 1;\\n\\t\\t\\tdata.at(0) = row;\\n\\t\\t\\t// The second row\\n\\t\\t\\tif (data.size() > 1){\\n\\t\\t\\t\\trow.resize(2);\\n\\t\\t\\t\\trow.at(0) = 1; row.at(1) = 1;\\n\\t\\t\\t\\tdata.at(1) = row;\\n\\t\\t\\t}\\n\\t\\t\\t// The other rows\\n\\t\\t\\tif (data.size() > 2){\\n\\t\\t\\t\\tfor (int i = 2; i < data.size(); i++){\\n\\t\\t\\t\\t\\trow.resize(i + 1); // Theoretically this should work faster than consecutive push_back()s\\n\\t\\t\\t\\t\\trow.front() = 1;\\n\\t\\t\\t\\t\\tfor (int j = 1; j < row.size() - 1; j++)\\n\\t\\t\\t\\t\\t\\trow.at(j) = data.at(i - 1).at(j - 1) + data.at(i - 1).at(j);\\n\\t\\t\\t\\t\\trow.back() = 1;\\n\\t\\t\\t\\t\\tdata.at(i) = row;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t~pascal_triangle(){\\n\\t\\tfor (vector<vector<int>>::iterator i = data.begin(); i != data.end(); ++i)\\n\\t\\t\\ti->clear(); // I'm not sure about the necessity of this loop!\\n\\t\\tdata.clear();\\n\\t}\\n\\tvoid print_row(int dummy){\\n\\t\\tif (dummy < data.size())\\n\\t\\t\\tfor (vector<int>::iterator i = data.at(dummy).begin(); i != data.at(dummy).end(); ++i)\\n\\t\\t\\t\\tcout<<*i<<\\\" \\\";\\n\\t\\tcout<<endl;\\n\\t}\\n\\tvoid print(){\\n\\t\\tfor (int i = 0; i < data.size(); i++)\\n\\t\\t\\tprint_row(i);\\n\\t}\\n\\tint get_coeff(int dummy1, int dummy2){\\n\\t\\tint result = 0;\\n\\t\\tif ((dummy1 < data.size()) && (dummy2 < data.at(dummy1).size()))\\n\\t\\t\\t\\tresult = data.at(dummy1).at(dummy2);\\n\\t\\treturn result;\\n\\t}\\n\\tvector<int> get_row(int dummy){\\n\\t\\tvector<int> result;\\n\\t\\tif (dummy < data.size())\\n\\t\\t\\tresult = data.at(dummy);\\n\\t\\treturn result;\\n\\t}\\n};\\nint main(){\\n\\tint n;\\n\\tcout<<endl<<\\\"The Pascal's Triangle with a class!\\\"<<endl<<endl<<\\\"Enter the number of rows: \\\";\\n\\tcin>>n;\\n\\tpascal_triangle myptri(n);\\n\\tcout<<endl<<\\\"The whole triangle:\\\"<<endl;\\n\\tmyptri.print();\\n\\tcout<<endl<<\\\"Just one row:\\\"<<endl;\\n\\tmyptri.print_row(n/2);\\n\\tcout<<endl<<\\\"Just one coefficient:\\\"<<endl;\\n\\tcout<<myptri.get_coeff(n/2, n/4)<<endl<<endl;\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace RosettaCode {\\n\\n class PascalsTriangle {\\n\\n public static void CreateTriangle(int n) {\\n if (n > 0) {\\n for (int i = 0; i < n; i++) {\\n int c = 1;\\n Console.Write(\\\" \\\".PadLeft(2 * (n - 1 - i)));\\n for (int k = 0; k <= i; k++) {\\n Console.Write(\\\"{0}\\\", c.ToString().PadLeft(3));\\n c = c * (i - k) / (k + 1);\\n }\\n Console.WriteLine();\\n }\\n }\\n }\\n\\n public static void Main() {\\n CreateTriangle(8);\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\nusing System.Numerics;\\nusing System.Collections.Generic;\\n\\nnamespace RosettaCode\\n{\\n\\tpublic static class PascalsTriangle\\n\\t{\\t\\t\\n\\t\\tpublic static IEnumerable<BigInteger[]> GetTriangle(int quantityOfRows)\\n\\t\\t{\\n\\t\\t\\tIEnumerable<BigInteger> range = Enumerable.Range(0, quantityOfRows).Select(num => new BigInteger(num));\\n\\t\\t\\treturn range.Select(num => GetRow(num).ToArray());\\n\\t\\t}\\n\\n\\t\\tpublic static IEnumerable<BigInteger> GetRow(BigInteger rowNumber)\\n\\t\\t{\\n\\t\\t\\tBigInteger denominator = 1;\\n\\t\\t\\tBigInteger numerator = rowNumber;\\n\\n\\t\\t\\tBigInteger currentValue = 1;\\n\\t\\t\\tfor (BigInteger counter = 0; counter <= rowNumber; counter++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tyield return currentValue;\\n\\t\\t\\t\\tcurrentValue = BigInteger.Multiply(currentValue, numerator--);\\n\\t\\t\\t\\tcurrentValue = BigInteger.Divide(currentValue, denominator++);\\n\\t\\t\\t}\\n\\t\\t\\tyield break;\\n\\t\\t}\\n\\n\\t\\tpublic static string FormatTriangleString(IEnumerable<BigInteger[]> triangle)\\n\\t\\t{\\n\\t\\t\\tint maxDigitWidth = triangle.Last().Max().ToString().Length;\\n\\t\\t\\tIEnumerable<string> rows = triangle.Select(arr =>\\n\\t\\t\\t\\t\\tstring.Join(\\\" \\\", arr.Select(array => CenterString(array.ToString(), maxDigitWidth)) )\\n\\t\\t\\t);\\n\\t\\t\\tint maxRowWidth = rows.Last().Length;\\n\\t\\t\\treturn string.Join(Environment.NewLine, rows.Select(row => CenterString(row, maxRowWidth)));\\n\\t\\t}\\n\\n\\t\\tprivate static string CenterString(string text, int width)\\n\\t\\t{\\n\\t\\t\\tint spaces = width - text.Length;\\n\\t\\t\\tint padLeft = (spaces / 2) + text.Length;\\n\\t\\t\\treturn text.PadLeft(padLeft).PadRight(width);\\n\\t\\t}\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"static void Main()\\n{\\n\\tIEnumerable<BigInteger[]> triangle = PascalsTriangle.GetTriangle(20);\\n\\tstring output = PascalsTriangle.FormatTriangleString(triangle)\\n\\tConsole.WriteLine(output);\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(defn pascal [n]\\n (let [newrow (fn newrow [lst ret]\\n (if lst\\n (recur (rest lst)\\n (conj ret (+ (first lst) (or (second lst) 0))))\\n ret))\\n genrow (fn genrow [n lst]\\n (when (< 0 n)\\n (do (println lst)\\n (recur (dec n) (conj (newrow lst []) 1)))))]\\n (genrow n [1])))\\n(pascal 4)\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn nextrow [row]\\n (vec (concat [1] (map #(apply + %) (partition 2 1 row)) [1] )))\\n\\n(defn pascal [n]\\n (assert (and (integer? n) (pos? n)))\\n (let [triangle (take n (iterate nextrow [1]))]\\n (doseq [row triangle]\\n (println row))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def pascal\\n (iterate\\n (fn [prev-row]\\n (->>\\n (concat [[(first prev-row)]] (partition 2 1 prev-row) [[(last prev-row)]])\\n (map (partial apply +) ,,,)))\\n [1]))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def pascal\\n (iterate #(concat [1]\\n (map + % (rest %))\\n [1])\\n [1]))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(take 10 pascal) ; returns a list of the first 10 pascal rows\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(nth pascal 10) ;returns the nth row\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"pascal = (n) ->\\n width = 6\\n for r in [1..n]\\n s = ws (width/2) * (n-r) # center row\\n output = (n) -> s += pad width, n\\n cell = 1\\n output cell\\n # Compute binomial coefficients as you go\\n # across the row.\\n for c in [1...r]\\n cell *= (r-c) / c\\n output cell\\n console.log s\\n\\nws = (n) ->\\n s = ''\\n s += ' ' for i in [0...n]\\n s\\n\\npad = (cnt, n) ->\\n s = n.toString()\\n # There is probably a better way to do this.\\n cnt -= s.length\\n right = Math.floor(cnt / 2)\\n left = cnt - right\\n ws(left) + s + ws(right)\\n\\npascal(7)\\n\",\n \"language\": \"CoffeeScript\"\n },\n {\n \"code\": \"10 INPUT \\\"HOW MANY\\\";N\\n20 IF N<1 THEN END\\n30 DIM C(N)\\n40 DIM D(N)\\n50 LET C(1)=1\\n60 LET D(1)=1\\n70 FOR J=1 TO N\\n80 FOR I=1 TO N-J+1\\n90 PRINT \\\" \\\";\\n100 NEXT I\\n110 FOR I=1 TO J\\n120 PRINT C(I)\\\" \\\";\\n130 NEXT I\\n140 PRINT\\n150 IF J=N THEN END\\n160 C(J+1)=1\\n170 D(J+1)=1\\n180 FOR I=1 TO J-1\\n190 D(I+1)=C(I)+C(I+1)\\n200 NEXT I\\n210 FOR I=1 TO J\\n220 C(I)=D(I)\\n230 NEXT I\\n240 NEXT J\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"RUN\\nHOW MANY? 8\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n 1 5 10 10 5 1\\n 1 6 15 20 15 6 1\\n 1 7 21 35 35 21 7 1\\n 1 8 28 56 70 56 28 8 1\\nREADY.\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defun pascal (n)\\n (genrow n '(1)))\\n\\n(defun genrow (n l)\\n (when (plusp n)\\n (print l)\\n (genrow (1- n) (cons 1 (newrow l)))))\\n\\n(defun newrow (l)\\n (if (null (rest l))\\n '(1)\\n (cons (+ (first l) (second l))\\n (newrow (rest l)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun pascal-next-row (a)\\n (loop :for q :in a\\n :and p = 0 :then q\\n :as s = (list (+ p q))\\n :nconc s :into a\\n :finally (rplacd s (list 1))\\n (return a)))\\n\\n(defun pascal (n)\\n (loop :for a = (list 1) :then (pascal-next-row a)\\n :repeat n\\n :collect a))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(defun next-pascal-triangle-row (list)\\n `(1\\n ,.(mapcar #'+ list (rest list))\\n 1))\\n\\n(defun pascal-triangle (number-of-rows)\\n (loop repeat number-of-rows\\n for row = '(1) then (next-pascal-triangle-row row)\\n collect row))\\n\\n(defun print-pascal-triangle (number-of-rows)\\n (let* ((triangle (pascal-triangle number-of-rows))\\n (max-row-length (length (write-to-string (first (last triangle))))))\\n (format t\\n (format nil \\\"~~{~~~D:@<~~{~~A ~~}~~>~~%~~}\\\" max-row-length)\\n triangle)))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(print-pascal-triangle 4)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \" 1\\n 1 1\\n 1 2 1\\n1 3 3 1\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(print-pascal-triangle 8)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \" 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n 1 5 10 10 5 1\\n 1 6 15 20 15 6 1\\n1 7 21 35 35 21 7 1\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"MODULE PascalTriangle;\\nIMPORT StdLog, DevCommanders, TextMappers;\\n\\nTYPE\\n\\tExpansion* = POINTER TO ARRAY OF LONGINT;\\n\\nPROCEDURE Show*(e: Expansion);\\nVAR\\n\\ti: INTEGER;\\nBEGIN\\n\\ti := 0;\\n\\tWHILE (i < LEN(e)) & (e[i] # 0) DO\\n\\t\\tStdLog.Int(e[i]);\\n\\t\\tINC(i)\\n\\tEND;\\n\\tStdLog.Ln\\nEND Show;\\n\\nPROCEDURE GenFor*(p: LONGINT): Expansion;\\nVAR\\n\\texpA,expB: Expansion;\\n\\ti,j: LONGINT;\\n\\t\\n\\tPROCEDURE Swap(VAR x,y: Expansion);\\n\\tVAR\\n\\t\\tswap: Expansion;\\n\\tBEGIN\\n\\t\\tswap := x; x := y; y := swap\\n\\tEND Swap;\\n\\t\\nBEGIN\\n\\tASSERT(p >= 0);\\n\\tNEW(expA,p + 2);NEW(expB,p + 2);\\n\\tFOR i := 0 TO p DO\\n\\t\\tIF i = 0 THEN expA[0] := 1\\n\\t\\tELSE\\n\\t\\t\\tFOR j := 0 TO i DO\\n\\t\\t\\t\\tIF j = 0 THEN\\n\\t\\t\\t\\t\\texpB[j] := expA[j]\\n\\t\\t\\t\\tELSE\\n\\t\\t\\t\\t\\texpB[j] := expA[j - 1] + expA[j]\\n\\t\\t\\t\\tEND\\n\\t\\t\\tEND;\\n\\t\\t\\tSwap(expA,expB)\\n\\t\\tEND;\\n\\tEND;\\n\\texpB := NIL; (* for the GC *)\\n\\tRETURN expA\\nEND GenFor;\\n\\n\\nPROCEDURE Do*;\\nVAR\\n\\ts: TextMappers.Scanner;\\n\\texp: Expansion;\\nBEGIN\\n\\ts.ConnectTo(DevCommanders.par.text);\\n\\ts.SetPos(DevCommanders.par.beg);\\n\\ts.Scan;\\n\\tWHILE (~s.rider.eot) DO\\n\\t\\tIF (s.type = TextMappers.char) & (s.char = '~') THEN\\n\\t\\t\\tRETURN\\n\\t\\tELSIF (s.type = TextMappers.int) THEN\\n\\t\\t\\texp := GenFor(s.int);\\n\\t\\t\\tShow(exp)\\n\\t\\tEND;\\n\\t\\ts.Scan\\n\\tEND\\nEND Do;\\n\\nEND PascalTriangle.\\n\",\n \"language\": \"Component-Pascal\"\n },\n {\n \"code\": \"int[][] pascalsTriangle(in int rows) pure nothrow {\\n auto tri = new int[][rows];\\n foreach (r; 0 .. rows) {\\n int v = 1;\\n foreach (c; 0 .. r+1) {\\n tri[r] ~= v;\\n v = (v * (r - c)) / (c + 1);\\n }\\n }\\n return tri;\\n}\\n\\nvoid main() {\\n immutable t = pascalsTriangle(10);\\n assert(t == [[1],\\n [1, 1],\\n [1, 2, 1],\\n [1, 3, 3, 1],\\n [1, 4, 6, 4, 1],\\n [1, 5, 10, 10, 5, 1],\\n [1, 6, 15, 20, 15, 6, 1],\\n [1, 7, 21, 35, 35, 21, 7, 1],\\n [1, 8, 28, 56, 70, 56, 28, 8, 1],\\n [1, 9, 36, 84, 126, 126, 84, 36, 9, 1]]);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm, std.range;\\n\\nauto pascal() pure nothrow {\\n return [1].recurrence!q{ zip(a[n - 1] ~ 0, 0 ~ a[n - 1])\\n .map!q{ a[0] + a[1] }\\n .array };\\n}\\n\\nvoid main() {\\n pascal.take(5).writeln;\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import std.stdio, std.string, std.array, std.format;\\n\\nstring Pascal(alias dg, T, T initValue)(int n) {\\n string output;\\n\\n void append(in T[] l) {\\n output ~= \\\" \\\".replicate((n - l.length + 1) * 2);\\n foreach (e; l)\\n output ~= format(\\\"%4s\\\", format(\\\"%4s\\\", e));\\n output ~= \\\"\\\\n\\\";\\n }\\n\\n if (n > 0) {\\n T[][] lines = [[initValue]];\\n append(lines[0]);\\n foreach (i; 1 .. n) {\\n lines ~= lines[i - 1] ~ initValue; // length + 1\\n foreach (int j; 1 .. lines[i-1].length)\\n lines[i][j] = dg(lines[i-1][j], lines[i-1][j-1]);\\n append(lines[i]);\\n }\\n }\\n return output;\\n}\\n\\nstring delegate(int n) genericPascal(alias dg, T, T initValue)() {\\n mixin Pascal!(dg, T, initValue);\\n return &Pascal;\\n}\\n\\nvoid main() {\\n auto pascal = genericPascal!((int a, int b) => a + b, int, 1)();\\n static char xor(char a, char b) { return a == b ? '_' : '*'; }\\n auto sierpinski = genericPascal!(xor, char, '*')();\\n\\n foreach (i; [1, 5, 9])\\n writef(pascal(i));\\n // an order 4 sierpinski triangle is a 2^4 lines generic\\n // Pascal triangle with xor operation\\n foreach (i; [16])\\n writef(sierpinski(i));\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"import 'dart:io';\\n\\npascal(n) {\\n if(n<=0) print(\\\"Not defined\\\");\\n\\n else if(n==1) print(1);\\n\\n else {\\n List<List<int>> matrix = new List<List<int>>();\\n matrix.add(new List<int>());\\n matrix.add(new List<int>());\\n matrix[0].add(1);\\n matrix[1].add(1);\\n matrix[1].add(1);\\n for (var i = 2; i < n; i++) {\\n List<int> list = new List<int>();\\n list.add(1);\\n for (var j = 1; j<i; j++) {\\n list.add(matrix[i-1][j-1]+matrix[i-1][j]);\\n }\\n list.add(1);\\n matrix.add(list);\\n }\\n for(var i=0; i<n; i++) {\\n for(var j=0; j<=i; j++) {\\n stdout.write(matrix[i][j]);\\n stdout.write(' ');\\n }\\n stdout.write('\\\\n');\\n }\\n }\\n}\\n\\nvoid main() {\\n pascal(0);\\n pascal(1);\\n pascal(3);\\n pascal(6);\\n}\\n\",\n \"language\": \"Dart\"\n },\n {\n \"code\": \"program PascalsTriangle;\\n\\nprocedure Pascal(r:Integer);\\nvar\\n i, c, k:Integer;\\nbegin\\n for i := 0 to r - 1 do\\n begin\\n c := 1;\\n for k := 0 to i do\\n begin\\n Write(c:3);\\n c := c * (i - k) div (k + 1);\\n end;\\n Writeln;\\n end;\\nend;\\n\\nbegin\\n Pascal(9);\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"procedure Pascal(r : Integer);\\nvar\\n i, c, k : Integer;\\nbegin\\n for i:=0 to r-1 do begin\\n c:=1;\\n for k:=0 to i do begin\\n Print(Format('%4d', [c]));\\n c:=(c*(i-k)) div (k+1);\\n end;\\n PrintLn('');\\n end;\\nend;\\n\\nPascal(9);\\n\",\n \"language\": \"DWScript\"\n },\n {\n \"code\": \"def pascalsTriangle(n, out) {\\n def row := [].diverge(int)\\n out.print(\\\"<table style='text-align: center; border: 0; border-collapse: collapse;'>\\\")\\n for y in 1..n {\\n out.print(\\\"<tr>\\\")\\n row.push(1)\\n def skip := n - y\\n if (skip > 0) {\\n out.print(`<td colspan=\\\"$skip\\\"></td>`)\\n }\\n for x => v in row {\\n out.print(`<td>$v</td><td></td>`)\\n }\\n for i in (1..!y).descending() {\\n row[i] += row[i - 1]\\n }\\n out.println(\\\"</tr>\\\")\\n }\\n out.print(\\\"</table>\\\")\\n}\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"def out := <file:triangle.html>.textWriter()\\ntry {\\n pascalsTriangle(15, out)\\n} finally {\\n out.close()\\n}\\nmakeCommand(\\\"yourFavoriteWebBrowser\\\")(\\\"triangle.html\\\")\\n\",\n \"language\": \"E\"\n },\n {\n \"code\": \"numfmt 0 4\\nproc pascal n . .\\n r[] = [ 1 ]\\n for i to n\\n rn[] = [ ]\\n l = 0\\n for j to n - len r[]\\n write \\\" \\\"\\n .\\n for r in r[]\\n write r\\n rn[] &= l + r\\n l = r\\n .\\n print \\\"\\\"\\n rn[] &= l\\n swap r[] rn[]\\n .\\n.\\npascal 13\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"note\\n\\tdescription : \\\"Prints pascal's triangle\\\"\\n\\toutput : \\\"[\\n \\t\\t\\t Per requirements of the RosettaCode example, execution will print the first n rows of pascal's triangle\\n \\t\\t\\t ]\\\"\\n\\tdate : \\\"19 December 2013\\\"\\n\\tauthors : \\\"Sandro Meier\\\", \\\"Roman Brunner\\\"\\n\\trevision : \\\"1.0\\\"\\n\\tlibraries : \\\"Relies on HASH_TABLE from EIFFEL_BASE library\\\"\\n\\timplementation : \\\"[\\n\\t\\t\\t Recursive implementation to calculate the n'th row.\\n\\t\\t\\t ]\\\"\\n\\twarning : \\\"[\\n\\t\\t\\t\\tWill not work for large n's (INTEGER_32)\\n\\t\\t ]\\\"\\n\\nclass\\n\\tAPPLICATION\\n\\ninherit\\n\\tARGUMENTS\\n\\ncreate\\n\\tmake\\n\\nfeature {NONE} -- Initialization\\n\\n\\tmake\\n\\t\\tlocal\\n\\t\\t\\tn:INTEGER\\n\\t\\tdo\\n\\t\\t\\tcreate {HASH_TABLE[ARRAY[INTEGER],INTEGER]}pascal_lines.make (n) --create the hash_table object\\n\\t\\t\\tio.new_line\\n\\t\\t\\tn:=25\\n\\t\\t\\tdraw(n)\\n\\t\\tend\\nfeature\\n\\tline(n:INTEGER):ARRAY[INTEGER]\\n\\t\\t--Calculates the n'th line\\n\\tlocal\\n\\t\\tupper_line:ARRAY[INTEGER]\\n\\t\\ti:INTEGER\\n\\tdo\\n\\t\\tif\\tn=1 then\\t--trivial case first line\\n\\t\\t\\tcreate Result.make_filled (0, 1, n+2)\\n\\t\\t\\tResult.put (0, 1)\\n\\t\\t\\tResult.put (1, 2)\\n\\t\\t\\tResult.put (0, 3)\\n\\t\\telseif pascal_lines.has (n) then\\t--checks if the result was already calculated\\n\\t\\t\\tResult := pascal_lines.at (n)\\n\\t\\telse\\t--calculates the n'th line recursively\\n\\t\\t\\tcreate Result.make_filled(0,1,n+2) --for caluclation purposes add a 0 at the beginning of each line\\n\\t\\t\\tResult.put (0, 1)\\n\\t\\t\\tupper_line:=line(n-1)\\n\\t\\t\\tfrom\\n\\t\\t\\t\\ti:=1\\n\\t\\t\\tuntil\\n\\t\\t\\t\\ti>upper_line.count-1\\n\\t\\t\\tloop\\n\\t\\t\\t\\tResult.put(upper_line[i]+upper_line[i+1],i+1)\\n\\t\\t\\t\\ti:=i+1\\n\\t\\t\\tend\\n\\t\\t\\tResult.put (0, n+2)\\t--for caluclation purposes add a 0 at the end of each line\\n\\t\\t\\tpascal_lines.put (Result, n)\\n\\t\\tend\\n\\tend\\n\\n\\tdraw(n:INTEGER)\\n\\t\\t--draw n lines of pascal's triangle\\n\\tlocal\\n\\t\\tspace_string:STRING\\n\\t\\twidth, i:INTEGER\\n\\n\\tdo\\n\\t\\tspace_string:=\\\" \\\"\\t\\t--question of design: add space_string at the beginning of each line\\n\\t\\twidth:=line(n).count\\n\\t\\tspace_string.multiply (width)\\n\\t\\tfrom\\n\\t\\t\\ti:=1\\n\\t\\tuntil\\n\\t\\t\\ti>n\\n\\t\\tloop\\n\\t\\t\\tspace_string.remove_tail (1)\\n\\t\\t\\tio.put_string (space_string)\\n\\t\\t\\tacross line(i) as c\\n\\t\\t\\tloop\\n\\t\\t\\t\\tif\\n\\t\\t\\t\\t\\tc.item/=0\\n\\t\\t\\t\\tthen\\n\\t\\t\\t\\t\\tio.put_string (c.item.out+\\\" \\\")\\n\\t\\t\\t\\tend\\n\\t\\t\\tend\\n\\t\\t\\tio.new_line\\n\\t\\t\\ti:=i+1\\n\\t\\tend\\n\\tend\\n\\nfeature --Access\\n\\tpascal_lines:HASH_TABLE[ARRAY[INTEGER],INTEGER]\\n\\t\\t--Contains all already calculated lines\\nend\\n\",\n \"language\": \"Eiffel\"\n },\n {\n \"code\": \"defmodule Pascal do\\n def triangle(n), do: triangle(n,[1])\\n\\n def triangle(0,list), do: list\\n def triangle(n,list) do\\n IO.inspect list\\n new_list = Enum.zip([0]++list, list++[0]) |> Enum.map(fn {a,b} -> a+b end)\\n triangle(n-1,new_list)\\n end\\nend\\n\\nPascal.triangle(8)\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"(require 'cl-lib)\\n\\n(defun next-row (row)\\n (cl-mapcar #'+ (cons 0 row)\\n (append row '(0))))\\n\\n(defun triangle (row rows)\\n (if (= rows 0)\\n '()\\n (cons row (triangle (next-row row) (- rows 1)))))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(defun pascal (r)\\n (dotimes (i r)\\n (let ((c 1))\\n (dotimes (k (+ i 1))\\n (princ (format \\\"%d \\\" c))\\n (setq c (/ (* c (- i k))\\n (+ k 1))))\\n (terpri))))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"(defun pascal (r)\\n (let ((out \\\"\\\"))\\n (dotimes (i r)\\n (let ((c 1))\\n (dotimes (k (+ i 1))\\n (setq out (concat out (format \\\"%d \\\" c)))\\n (setq c (/ (* c (- i k))\\n (+ k 1))))\\n (setq out (concat out \\\"\\\\n\\\"))))\\n out))\\n\",\n \"language\": \"Emacs-Lisp\"\n },\n {\n \"code\": \"-import(lists).\\n-export([pascal/1]).\\n\\npascal(1)-> [[1]];\\npascal(N) ->\\n L = pascal(N-1),\\n [H|_] = L,\\n [lists:zipwith(fun(X,Y)->X+Y end,[0]++H,H++[0])|L].\\n\",\n \"language\": \"Erlang\"\n },\n {\n \"code\": \"PROGRAM PASCAL_TRIANGLE\\n\\nPROCEDURE PASCAL(R%)\\n LOCAL I%,C%,K%\\n FOR I%=0 TO R%-1 DO\\n C%=1\\n FOR K%=0 TO I% DO\\n WRITE(\\\"###\\\";C%;)\\n C%=(C%*(I%-K%)) DIV (K%+1)\\n END FOR\\n PRINT\\n END FOR\\nEND PROCEDURE\\n\\nBEGIN\\n PASCAL(9)\\nEND PROGRAM\\n\",\n \"language\": \"ERRE\"\n },\n {\n \"code\": \"sequence row\\nrow = {}\\nfor m = 1 to 10 do\\n row = row & 1\\n for n = length(row)-1 to 2 by -1 do\\n row[n] += row[n-1]\\n end for\\n print(1,row)\\n puts(1,'\\\\n')\\nend for\\n\",\n \"language\": \"Euphoria\"\n },\n {\n \"code\": \"PASCAL\\n=LAMBDA(n,\\n BINCOEFF(n - 1)(\\n SEQUENCE(1, n, 0, 1)\\n )\\n)\\n\\n\\nBINCOEFF\\n=LAMBDA(n,\\n LAMBDA(k,\\n QUOTIENT(FACT(n), FACT(k) * FACT(n - k))\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"TRIANGLE\\n=LAMBDA(n,\\n LET(\\n ixs, SEQUENCE(n, n, 0, 1),\\n x, MOD(ixs, n),\\n y, QUOTIENT(ixs, n),\\n IF(x <= y,\\n BINCOEFF(y)(x),\\n \\\"\\\"\\n )\\n )\\n)\\n\",\n \"language\": \"Excel\"\n },\n {\n \"code\": \"let rec nextrow l =\\n match l with\\n | [] -> []\\n | h :: [] -> [1]\\n | h :: t -> h + t.Head :: nextrow t\\n\\nlet pascalTri n = List.scan(fun l i -> 1 :: nextrow l) [1] [1 .. n]\\n\\nfor row in pascalTri(10) do\\n for i in row do\\n printf \\\"%s\\\" (i.ToString() + \\\", \\\")\\n printfn \\\"%s\\\" \\\"\\\\n\\\"\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: grouping kernel math sequences ;\\n\\n: (pascal) ( seq -- newseq )\\n dup last 0 prefix 0 suffix 2 <clumps> [ sum ] map suffix ;\\n\\n: pascal ( n -- seq )\\n 1 - { { 1 } } swap [ (pascal) ] times ;\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"5 pascal .\\n{ { 1 } { 1 1 } { 1 2 1 } { 1 3 3 1 } { 1 4 6 4 1 } }\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"class Main\\n{\\n Int[] next_row (Int[] row)\\n {\\n new_row := [1]\\n (row.size-1).times |i|\\n {\\n new_row.add (row[i] + row[i+1])\\n }\\n new_row.add (1)\\n\\n return new_row\\n }\\n\\n Void print_pascal (Int n) // no output for n <= 0\\n {\\n current_row := [1]\\n n.times\\n {\\n echo (current_row.join(\\\" \\\"))\\n current_row = next_row (current_row)\\n }\\n }\\n\\n Void main ()\\n {\\n print_pascal (10)\\n }\\n}\\n\",\n \"language\": \"Fantom\"\n },\n {\n \"code\": \"1.1 S OLD(1)=1; T %4.0, 1, !\\n1.2 F N=1,10; D 2\\n1.3 Q\\n\\n2.1 S NEW(1)=1\\n2.2 F X=1,N; S NEW(X+1)=OLD(X)+OLD(X+1)\\n2.3 F X=1,N+1; D 3\\n2.4 T !\\n\\n3.1 S OLD(X)=NEW(X)\\n3.2 T %4.0, OLD(X)\\n\",\n \"language\": \"FOCAL\"\n },\n {\n \"code\": \": init ( n -- )\\n here swap cells erase 1 here ! ;\\n: .line ( n -- )\\n cr here swap 0 do dup @ . cell+ loop drop ;\\n: next ( n -- )\\n here swap 1- cells here + do\\n i @ i cell+ +!\\n -1 cells +loop ;\\n: pascal ( n -- )\\n dup init 1 .line\\n 1 ?do i next i 1+ .line loop ;\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \": PascTriangle\\n cr dup 0\\n ?do\\n 1 over 1- i - 2* spaces i 1+ 0 ?do dup 4 .r j i - * i 1+ / loop cr drop\\n loop drop\\n;\\n\\n13 PascTriangle\\n\",\n \"language\": \"Forth\"\n },\n {\n \"code\": \"PROGRAM Pascals_Triangle\\n\\n CALL Print_Triangle(8)\\n\\nEND PROGRAM Pascals_Triangle\\n\\nSUBROUTINE Print_Triangle(n)\\n\\n IMPLICIT NONE\\n INTEGER, INTENT(IN) :: n\\n INTEGER :: c, i, j, k, spaces\\n\\n DO i = 0, n-1\\n c = 1\\n spaces = 3 * (n - 1 - i)\\n DO j = 1, spaces\\n WRITE(*,\\\"(A)\\\", ADVANCE=\\\"NO\\\") \\\" \\\"\\n END DO\\n DO k = 0, i\\n WRITE(*,\\\"(I6)\\\", ADVANCE=\\\"NO\\\") c\\n c = c * (i - k) / (k + 1)\\n END DO\\n WRITE(*,*)\\n END DO\\n\\nEND SUBROUTINE Print_Triangle\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"' FB 1.05.0 Win64\\n\\nSub pascalTriangle(n As UInteger)\\n If n = 0 Then Return\\n Dim prevRow(1 To n) As UInteger\\n Dim currRow(1 To n) As UInteger\\n Dim start(1 To n) As UInteger ''stores starting column for each row\\n start(n) = 1\\n For i As Integer = n - 1 To 1 Step -1\\n start(i) = start(i + 1) + 3\\n Next\\n prevRow(1) = 1\\n Print Tab(start(1));\\n Print 1U\\n For i As UInteger = 2 To n\\n For j As UInteger = 1 To i\\n If j = 1 Then\\n Print Tab(start(i)); \\\"1\\\";\\n currRow(1) = 1\\n ElseIf j = i Then\\n Print \\\" 1\\\"\\n currRow(i) = 1\\n Else\\n currRow(j) = prevRow(j - 1) + prevRow(j)\\n Print Using \\\"######\\\"; currRow(j); \\\" \\\";\\n End If\\n Next j\\n For j As UInteger = 1 To i\\n prevRow(j) = currRow(j)\\n Next j\\n Next i\\nEnd Sub\\n\\npascalTriangle(14)\\nPrint\\nPrint \\\"Press any key to quit\\\"\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"pascal[rows] :=\\n{\\n widest = length[toString[binomial[rows-1, (rows-1) div 2]]]\\n\\n for row = 0 to rows-1\\n {\\n line = repeat[\\\" \\\", round[(rows-row)* (widest+1)/2]]\\n for col = 0 to row\\n line = line + padRight[binomial[row, col], widest+1, \\\" \\\"]\\n\\n println[line]\\n }\\n}\\n\\npascal[10]\\n\",\n \"language\": \"Frink\"\n },\n {\n \"code\": \"import lists.zip\\n\\ndef\\n pascal( 1 ) = [1]\\n pascal( n ) = [1] + map( (a, b) -> a + b, zip(pascal(n-1), pascal(n-1).tail()) ) + [1]\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"import integers.choose\\n\\ndef pascal( n ) = [choose( n - 1, k ) | k <- 0..n-1]\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"def triangle( height ) =\\n width = max( map(a -> a.toString().length(), pascal(height)) )\\n\\n if 2|width\\n width++\\n\\n for n <- 1..height\\n print( ' '*((width + 1)\\\\2)*(height - n) )\\n println( map(a -> format('%' + width + 'd ', a), pascal(n)).mkString() )\\n\\ntriangle( 10 )\\n\",\n \"language\": \"FunL\"\n },\n {\n \"code\": \"Pascal := function(n)\\n\\tlocal i, v;\\n\\tv := [1];\\n\\tfor i in [1 .. n] do\\n\\t\\tDisplay(v);\\n\\t\\tv := Concatenation([0], v) + Concatenation(v, [0]);\\n\\tod;\\nend;\\n\\nPascal(9);\\n# [ 1 ]\\n# [ 1, 1 ]\\n# [ 1, 2, 1 ]\\n# [ 1, 3, 3, 1 ]\\n# [ 1, 4, 6, 4, 1 ]\\n# [ 1, 5, 10, 10, 5, 1 ]\\n# [ 1, 6, 15, 20, 15, 6, 1 ]\\n# [ 1, 7, 21, 35, 35, 21, 7, 1 ]\\n# [ 1, 8, 28, 56, 70, 56, 28, 8, 1 ]\\n\",\n \"language\": \"GAP\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nfunc printTriangle(n int) {\\n // degenerate cases\\n if n <= 0 {\\n return\\n }\\n fmt.Println(1)\\n if n == 1 {\\n return\\n }\\n // iterate over rows, zero based\\n a := make([]int, (n+1)/2)\\n a[0] = 1\\n for row, middle := 1, 0; row < n; row++ {\\n // generate new row\\n even := row&1 == 0\\n if even {\\n a[middle+1] = a[middle] * 2\\n }\\n for i := middle; i > 0; i-- {\\n a[i] += a[i-1]\\n }\\n // print row\\n for i := 0; i <= middle; i++ {\\n fmt.Print(a[i], \\\" \\\")\\n }\\n if even {\\n middle++\\n }\\n for i := middle; i >= 0; i-- {\\n fmt.Print(a[i], \\\" \\\")\\n }\\n fmt.Println(\\\"\\\")\\n }\\n}\\n\\nfunc main() {\\n printTriangle(4)\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"def pascal\\npascal = { n -> (n <= 1) ? [1] : [[0] + pascal(n - 1), pascal(n - 1) + [0]].transpose().collect { it.sum() } }\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"def count = 15\\n(1..count).each { n ->\\n printf (\\\"%2d:\\\", n); (0..(count-n)).each { print \\\" \\\" }; pascal(n).each{ printf(\\\"%6d \\\", it) }; println \\\"\\\"\\n}\\n\",\n \"language\": \"Groovy\"\n },\n {\n \"code\": \"10 INPUT \\\"Number of rows? \\\",R\\n20 FOR I=0 TO R-1\\n30 C=1\\n40 FOR K=0 TO I\\n50 PRINT USING \\\"####\\\";C;\\n60 C=C*(I-K)/(K+1)\\n70 NEXT\\n80 PRINT\\n90 NEXT\\n\",\n \"language\": \"GW-BASIC\"\n },\n {\n \"code\": \"zapWith :: (a -> a -> a) -> [a] -> [a] -> [a]\\nzapWith f xs [] = xs\\nzapWith f [] ys = ys\\nzapWith f (x:xs) (y:ys) = f x y : zapWith f xs ys\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"extendWith f [] = []\\nextendWith f xs@(x:ys) = x : zapWith f xs ys\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"pascal = iterate (extendWith (+)) [1]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> take 6 pascal\\n[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1],[1,5,10,10,5,1]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"-- generate next row from current row\\nnextRow row = zipWith (+) ([0] ++ row) (row ++ [0])\\n\\n-- returns the first n rows\\npascal = iterate nextRow [1]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"pascal :: [[Integer]]\\npascal =\\n (1 : [ 0 | _ <- head pascal])\\n : [zipWith (+) (0:row) row | row <- pascal]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Pascal> take 5 <$> (take 5 $ triangle)\\n[[1,0,0,0,0],[1,1,0,0,0],[1,2,1,0,0],[1,3,3,1,0],[1,4,6,4,1]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"fac = product . enumFromTo 1\\n\\nbinCoef n k = fac n `div` (fac k * fac (n - k))\\n\\npascal = ((fmap . binCoef) <*> enumFromTo 0) . pred\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main> putStr $ unlines $ map unwords $ map (map show) $ pascal 10\\n1\\n1 1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n1 5 10 10 5 1\\n1 6 15 20 15 6 1\\n1 7 21 35 35 21 7 1\\n1 8 28 56 70 56 28 8 1\\n1 9 36 84 126 126 84 36 9 1\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \" CALL Pascal(30)\\n\\nSUBROUTINE Pascal(rows)\\n CHARACTER fmt*6\\n WRITE(Text=fmt, Format='\\\"i\\\", i5.5') 1+rows/4\\n\\n DO row = 0, rows-1\\n n = 1\\n DO k = 0, row\\n col = rows*(rows-row+2*k)/4\\n WRITE(Row=row+1, Column=col, F=fmt) n\\n n = n * (row - k) / (k + 1)\\n ENDDO\\n ENDDO\\nEND\\n\",\n \"language\": \"HicEst\"\n },\n {\n \"code\": \"link math\\n\\nprocedure main(A)\\nevery n := !A do { # for each command line argument\\n n := integer(\\\\n) | &null\\n pascal(n)\\n }\\nend\\n\\nprocedure pascal(n)\\t\\t#: Pascal triangle\\n /n := 16\\n write(\\\"width=\\\", n, \\\" height=\\\", n)\\t# carpet header\\n fw := *(2 ^ n)+1\\n every i := 0 to n - 1 do {\\n writes(repl(\\\" \\\",fw*(n-i)/2))\\n every j := 0 to n - 1 do\\n writes(center(binocoef(i, j),fw) | break)\\n write()\\n }\\nend\\n\",\n \"language\": \"Icon\"\n },\n {\n \"code\": \"Pro Pascal, n\\n;n is the number of lines of the triangle to be displayed\\n r=[1]\\n print, r\\n for i=0, (n-2) do begin\\n pascalrow,r\\n endfor\\nEnd\\n\\nPro PascalRow, r\\n for i=0,(n_elements(r)-2) do begin\\n r[i]=r[i]+r[i+1]\\n endfor\\nr= [1, r]\\nprint, r\\n\\nEnd\\n\",\n \"language\": \"IDL\"\n },\n {\n \"code\": \"100 PROGRAM \\\"PascalTr.bas\\\"\\n110 TEXT 80\\n120 LET ROW=12\\n130 FOR I=0 TO ROW\\n140 LET C=1\\n150 PRINT TAB(37-I*3);\\n160 FOR K=0 TO I\\n170 PRINT USING \\\" #### \\\":C;\\n180 LET C=C*(I-K)/(K+1)\\n190 NEXT\\n200 PRINT\\n210 NEXT\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \" !~/~ i.5\\n1 0 0 0 0\\n1 1 0 0 0\\n1 2 1 0 0\\n1 3 3 1 0\\n1 4 6 4 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" ([: \\\":@-.&0\\\"1 !~/~)@i. 5\\n1\\n1 1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (-@|. |.\\\"_1 [: \\\":@-.&0\\\"1 !~/~)@i. 5\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" (|.\\\"_1~ 0-3*i.@-@#) ;@((<'%6d') sprintf each -.&0)\\\"1 !~/~i.10\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n 1 5 10 10 5 1\\n 1 6 15 20 15 6 1\\n 1 7 21 35 35 21 7 1\\n 1 8 28 56 70 56 28 8 1\\n 1 9 36 84 126 126 84 36 9 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" i:5\\n_5 _4 _3 _2 _1 0 1 2 3 4 5\\n !~/~i:5\\n 1 0 0 0 0 1 _5 15 _35 70 _126\\n_4 1 0 0 0 1 _4 10 _20 35 _56\\n 6 _3 1 0 0 1 _3 6 _10 15 _21\\n_4 3 _2 1 0 1 _2 3 _4 5 _6\\n 1 _1 1 _1 1 1 _1 1 _1 1 _1\\n 0 0 0 0 0 1 0 0 0 0 0\\n 0 0 0 0 0 1 1 0 0 0 0\\n 0 0 0 0 0 1 2 1 0 0 0\\n 0 0 0 0 0 1 3 3 1 0 0\\n 0 0 0 0 0 1 4 6 4 1 0\\n 0 0 0 0 0 1 5 10 10 5 1\\n !/~i:5\\n 1 _4 6 _4 1 0 0 0 0 0 0\\n 0 1 _3 3 _1 0 0 0 0 0 0\\n 0 0 1 _2 1 0 0 0 0 0 0\\n 0 0 0 1 _1 0 0 0 0 0 0\\n 0 0 0 0 1 0 0 0 0 0 0\\n 1 1 1 1 1 1 1 1 1 1 1\\n _5 _4 _3 _2 _1 0 1 2 3 4 5\\n 15 10 6 3 1 0 0 1 3 6 10\\n _35 _20 _10 _4 _1 0 0 0 1 4 10\\n 70 35 15 5 1 0 0 0 0 1 5\\n_126 _56 _21 _6 _1 0 0 0 0 0 1\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\n...//class definition, etc.\\npublic static void genPyrN(int rows){\\n\\tif(rows < 0) return;\\n\\t//save the last row here\\n\\tArrayList<Integer> last = new ArrayList<Integer>();\\n\\tlast.add(1);\\n\\tSystem.out.println(last);\\n\\tfor(int i= 1;i <= rows;++i){\\n\\t\\t//work on the next row\\n\\t\\tArrayList<Integer> thisRow= new ArrayList<Integer>();\\n\\t\\tthisRow.add(last.get(0)); //beginning\\n\\t\\tfor(int j= 1;j < i;++j){//loop the number of elements in this row\\n\\t\\t\\t//sum from the last row\\n\\t\\t\\tthisRow.add(last.get(j - 1) + last.get(j));\\n\\t\\t}\\n\\t\\tthisRow.add(last.get(0)); //end\\n\\t\\tlast= thisRow;//save this row\\n\\t\\tSystem.out.println(thisRow);\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class Pas{\\n\\tpublic static void main(String[] args){\\n\\t\\t//usage\\n\\t\\tpas(20);\\n\\t}\\n\\n\\tpublic static void pas(int rows){\\n\\t\\tfor(int i = 0; i < rows; i++){\\n\\t\\t\\tfor(int j = 0; j <= i; j++){\\n\\t\\t\\t\\tSystem.out.print(ncr(i, j) + \\\" \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\\n\\n\\tpublic static long ncr(int n, int r){\\n\\t\\treturn fact(n) / (fact(r) * fact(n - r));\\n\\t}\\n\\n\\tpublic static long fact(int n){\\n\\t\\tlong ans = 1;\\n\\t\\tfor(int i = 2; i <= n; i++){\\n\\t\\t\\tans *= i;\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"public class Pascal {\\n\\tprivate static void printPascalLine (int n) {\\n\\t\\tif (n < 1)\\n\\t\\t\\treturn;\\n\\t\\tint m = 1;\\n\\t\\tSystem.out.print(\\\"1 \\\");\\n\\t\\tfor (int j=1; j<n; j++) {\\n\\t\\t\\tm = m * (n-j)/j;\\n\\t\\t\\tSystem.out.print(m);\\n\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t}\\n\\t\\n\\tpublic static void printPascal (int nRows) {\\n\\t\\tfor(int i=1; i<=nRows; i++)\\n\\t\\t\\tprintPascalLine(i);\\n\\t}\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"// Pascal's triangle object\\nfunction pascalTriangle (rows) {\\n\\n\\t// Number of rows the triangle contains\\n\\tthis.rows = rows;\\n\\n\\t// The 2D array holding the rows of the triangle\\n\\tthis.triangle = new Array();\\n\\tfor (var r = 0; r < rows; r++) {\\n\\t\\tthis.triangle[r] = new Array();\\n\\t\\tfor (var i = 0; i <= r; i++) {\\n\\t\\t\\tif (i == 0 || i == r)\\n\\t\\t\\t\\tthis.triangle[r][i] = 1;\\n\\t\\t\\telse\\n\\t\\t\\t\\tthis.triangle[r][i] = this.triangle[r-1][i-1]+this.triangle[r-1][i];\\n\\t\\t}\\n\\t}\\n\\n\\t// Method to print the triangle\\n\\tthis.print = function(base) {\\n\\t\\tif (!base)\\n\\t\\t\\tbase = 10;\\n\\n\\t\\t// Private method to calculate digits in number\\n\\t\\tvar digits = function(n,b) {\\n\\t\\t\\tvar d = 0;\\n\\t\\t\\twhile (n >= 1) {\\n\\t\\t\\t\\td++;\\n\\t\\t\\t\\tn /= b;\\n\\t\\t\\t}\\n\\t\\t\\treturn d;\\n\\t\\t}\\n\\n\\t\\t// Calculate max spaces needed\\n\\t\\tvar spacing = digits(this.triangle[this.rows-1][Math.round(this.rows/2)],base);\\n\\n\\t\\t// Private method to add spacing between numbers\\n\\t\\tvar insertSpaces = function(s) {\\n\\t\\t\\tvar buf = \\\"\\\";\\n\\t\\t\\twhile (s > 0) {\\n\\t\\t\\t\\ts--;\\n\\t\\t\\t\\tbuf += \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\treturn buf;\\n\\t\\t}\\n\\n\\t\\t// Print the triangle line by line\\n\\t\\tfor (var r = 0; r < this.triangle.length; r++) {\\n\\t\\t\\tvar l = \\\"\\\";\\n\\t\\t\\tfor (var s = 0; s < Math.round(this.rows-1-r); s++) {\\n\\t\\t\\t\\tl += insertSpaces(spacing);\\n\\t\\t\\t}\\n\\t\\t\\tfor (var i = 0; i < this.triangle[r].length; i++) {\\n\\t\\t\\t\\tif (i != 0)\\n\\t\\t\\t\\t\\tl += insertSpaces(spacing-Math.ceil(digits(this.triangle[r][i],base)/2));\\n\\t\\t\\t\\tl += this.triangle[r][i].toString(base);\\n\\t\\t\\t\\tif (i < this.triangle[r].length-1)\\n\\t\\t\\t\\t\\tl += insertSpaces(spacing-Math.floor(digits(this.triangle[r][i],base)/2));\\n\\t\\t\\t}\\n\\t\\t\\tprint(l);\\n\\t\\t}\\n\\t}\\n\\n}\\n\\n// Display 4 row triangle in base 10\\nvar tri = new pascalTriangle(4);\\ntri.print();\\n// Display 8 row triangle in base 16\\ntri = new pascalTriangle(8);\\ntri.print(16);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(function (n) {\\n 'use strict';\\n\\n // PASCAL TRIANGLE --------------------------------------------------------\\n\\n // pascal :: Int -> [[Int]]\\n function pascal(n) {\\n return foldl(function (a) {\\n var xs = a.slice(-1)[0]; // Previous row\\n return append(a, [zipWith(\\n function (a, b) {\\n return a + b;\\n },\\n append([0], xs),\\n append(xs, [0])\\n )]);\\n }, [\\n [1] // Initial seed row\\n ], enumFromTo(1, n - 1));\\n };\\n\\n\\n // GENERIC FUNCTIONS ------------------------------------------------------\\n\\n // (++) :: [a] -> [a] -> [a]\\n function append(xs, ys) {\\n return xs.concat(ys);\\n };\\n\\n // enumFromTo :: Int -> Int -> [Int]\\n function enumFromTo(m, n) {\\n return Array.from({\\n length: Math.floor(n - m) + 1\\n }, function (_, i) {\\n return m + i;\\n });\\n };\\n\\n // foldl :: (b -> a -> b) -> b -> [a] -> b\\n function foldl(f, a, xs) {\\n return xs.reduce(f, a);\\n };\\n\\n // foldr (a -> b -> b) -> b -> [a] -> b\\n function foldr(f, a, xs) {\\n return xs.reduceRight(f, a);\\n };\\n\\n // map :: (a -> b) -> [a] -> [b]\\n function map(f, xs) {\\n return xs.map(f);\\n };\\n\\n // min :: Ord a => a -> a -> a\\n function min(a, b) {\\n return b < a ? b : a;\\n };\\n\\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\n function zipWith(f, xs, ys) {\\n return Array.from({\\n length: min(xs.length, ys.length)\\n }, function (_, i) {\\n return f(xs[i], ys[i]);\\n });\\n };\\n\\n // TEST and FORMAT --------------------------------------------------------\\n var lstTriangle = pascal(n);\\n\\n // [[a]] -> bool -> s -> s\\n function wikiTable(lstRows, blnHeaderRow, strStyle) {\\n return '{| class=\\\"wikitable\\\" ' + (strStyle ? 'style=\\\"' + strStyle +\\n '\\\"' : '') + lstRows.map(function (lstRow, iRow) {\\n var strDelim = blnHeaderRow && !iRow ? '!' : '|';\\n return '\\\\n|-\\\\n' + strDelim + ' ' + lstRow.map(function (v) {\\n return typeof v === 'undefined' ? ' ' : v;\\n })\\n .join(' ' + strDelim + strDelim + ' ');\\n })\\n .join('') + '\\\\n|}';\\n }\\n\\n var lstLastLine = lstTriangle.slice(-1)[0],\\n lngBase = lstLastLine.length * 2 - 1,\\n nWidth = lstLastLine.reduce(function (a, x) {\\n var d = x.toString()\\n .length;\\n return d > a ? d : a;\\n }, 1) * lngBase;\\n\\n return [wikiTable(lstTriangle.map(function (lst) {\\n return lst.join(';;')\\n .split(';');\\n })\\n .map(function (line, i) {\\n var lstPad = Array((lngBase - line.length) / 2);\\n return lstPad.concat(line)\\n .concat(lstPad);\\n }), false, 'text-align:center;width:' + nWidth + 'em;height:' + nWidth +\\n 'em;table-layout:fixed;'), JSON.stringify(lstTriangle)].join('\\\\n\\\\n');\\n})(7);\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"[[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1],[1,5,10,10,5,1],[1,6,15,20,15,6,1]]\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"(() => {\\n \\\"use strict\\\";\\n\\n // ---------------- PASCAL'S TRIANGLE ----------------\\n\\n // pascal :: Generator [[Int]]\\n const pascal = () =>\\n iterate(\\n xs => zipWith(\\n a => b => a + b\\n )(\\n [0, ...xs]\\n )(\\n [...xs, 0]\\n )\\n )([1]);\\n\\n\\n // ---------------------- TEST -----------------------\\n // main :: IO ()\\n const main = () =>\\n showPascal(\\n take(10)(\\n pascal()\\n )\\n );\\n\\n\\n // showPascal :: [[Int]] -> String\\n const showPascal = xs => {\\n const w = last(xs).join(\\\" \\\").length;\\n\\n return xs.map(\\n ys => center(w)(\\\" \\\")(ys.join(\\\" \\\"))\\n )\\n .join(\\\"\\\\n\\\");\\n };\\n\\n\\n // ---------------- GENERIC FUNCTIONS ----------------\\n\\n // center :: Int -> Char -> String -> String\\n const center = n =>\\n // Size of space -> filler Char ->\\n // String -> Centered String\\n c => s => {\\n const gap = n - s.length;\\n\\n return 0 < gap ? (() => {\\n const\\n margin = c.repeat(Math.floor(gap / 2)),\\n dust = c.repeat(gap % 2);\\n\\n return `${margin}${s}${margin}${dust}`;\\n })() : s;\\n };\\n\\n\\n // iterate :: (a -> a) -> a -> Gen [a]\\n const iterate = f =>\\n // An infinite list of repeated\\n // applications of f to x.\\n function* (x) {\\n let v = x;\\n\\n while (true) {\\n yield v;\\n v = f(v);\\n }\\n };\\n\\n\\n // last :: [a] -> a\\n const last = xs =>\\n 0 < xs.length ? xs.slice(-1)[0] : undefined;\\n\\n\\n // take :: Int -> [a] -> [a]\\n // take :: Int -> String -> String\\n const take = n =>\\n // The first n elements of a list,\\n // string of characters, or stream.\\n xs => \\\"GeneratorFunction\\\" !== xs\\n .constructor.constructor.name ? (\\n xs.slice(0, n)\\n ) : Array.from({\\n length: n\\n }, () => {\\n const x = xs.next();\\n\\n return x.done ? [] : [x.value];\\n }).flat();\\n\\n\\n // zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]\\n const zipWith = f =>\\n // A list constructed by zipping with a\\n // custom function, rather than with the\\n // default tuple constructor.\\n xs => ys => xs.map(\\n (x, i) => f(x)(ys[i])\\n ).slice(\\n 0, Math.min(xs.length, ys.length)\\n );\\n\\n\\n // MAIN ---\\n return main();\\n})();\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const aux = n => {\\n if(n <= 1) return [1]\\n const prevLayer = aux(n - 1)\\n const shifted = [0, ...prevLayer]\\n return shifted.map((x, i) => (prevLayer[i] || 0) + x)\\n}\\nconst pascal = n => {\\n for(let i = 1; i <= n; i++) {\\n console.log(aux(i).join(' '))\\n }\\n}\\npascal(8)\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"const aux = (() => {\\n const layers = [[1], [1]]\\n return n => {\\n if(layers[n]) return layers[n]\\n const prevLayer = aux(n - 1)\\n const shifted = [0, ...prevLayer]\\n layers[n] = shifted.map((x, i) => (prevLayer[i] || 0) + x)\\n return layers[n]\\n }\\n})()\\nconst pascal = n => {\\n for(let i = 1; i <= n; i++) {\\n console.log(aux(i).join(' '))\\n }\\n}\\npascal(8)\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# pascal(n) for n>=0; pascal(0) emits an empty stream.\\ndef pascal(n):\\n def _pascal: # input: the previous row\\n . as $in\\n | .,\\n if length >= n then empty\\n else\\n reduce range(0;length-1) as $i\\n ([1]; . + [ $in[$i] + $in[$i + 1] ]) + [1] | _pascal\\n end;\\n if n <= 0 then empty else [1] | _pascal end ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"$ jq -c -n -f pascal_triangle.jq\\n[1]\\n[1,1]\\n[1,2,1]\\n[1,3,3,1]\\n[1,4,6,4,1]\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"def pascal(n):\\n if n <= 0 then empty\\n else [1]\\n | recurse( if length >= n then empty\\n else . as $in\\n | reduce range(0;length-1) as $i\\n ([1]; . + [ $in[$i] + $in[$i + 1] ]) + [1]\\n end)\\n end;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"iround(x) = round(Int64, x)\\n\\ntriangle(n) = iround.(exp(diagm(-1=> 1:n)))\\n\\nfunction pascal(n)\\n t=triangle(n)\\n println.(join.([filter(!iszero, t[i,:]) for i in 1:(n+1)], \\\" \\\"))\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"function pascal(n)\\n (n<=0) && error(\\\"Pascal trinalge can not have zero or negative rows\\\")\\n r=Vector{Int}(undef,n)\\n pr=Vector{Int}(undef,n)\\n pr[1]=r[1]=1\\n println(@view pr[1])\\n for i=2:n\\n r[1]=r[i]=1\\n for j=2:i-1\\n r[j]=pr[j-1]+pr[j]\\n end\\n println(join(view(r,1:i), \\\" \\\"))\\n r,pr=pr,r\\n end\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"pascal:{(x-1){+':x,0}\\\\1}\\npascal 6\\n(1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n 1 5 10 10 5 1)\\n\",\n \"language\": \"K\"\n },\n {\n \"code\": \"fun pas(rows: Int) {\\n for (i in 0..rows - 1) {\\n for (j in 0..i)\\n print(ncr(i, j).toString() + \\\" \\\")\\n println()\\n }\\n}\\n\\nfun ncr(n: Int, r: Int) = fact(n) / (fact(r) * fact(n - r))\\n\\nfun fact(n: Int) : Long {\\n var ans = 1.toLong()\\n for (i in 2..n)\\n ans *= i\\n return ans\\n}\\n\\nfun main(args: Array<String>) = pas(args[0].toInt())\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"1) Based on this expression of pascalian binomial:\\n\\n Cnp = [n*(n-1)...(n-p+1)]/[p*(p-1)...2*1]\\n\\n2) we define the following function:\\n\\n{def C\\n {lambda {:n :p}\\n {/ {* {S.serie :n {- :n :p -1} -1}}\\n {* {S.serie :p 1 -1}}}}}\\n\\n{C 16 8}\\n-> 12870\\n\\n3) Writing\\n\\n1{S.map {lambda {:n} {br}1\\n {S.map {C :n} {S.serie 1 {- :n 1}}} 1}\\n {S.serie 2 16}}\\ndisplays:\\n\\n1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n1 5 10 10 5 1\\n1 6 15 20 15 6 1\\n1 7 21 35 35 21 7 1\\n1 8 28 56 70 56 28 8 1\\n1 9 36 84 126 126 84 36 9 1\\n1 10 45 120 210 252 210 120 45 10 1\\n1 11 55 165 330 462 462 330 165 55 11 1\\n1 12 66 220 495 792 924 792 495 220 66 12 1\\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\\n1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16 1\\n\",\n \"language\": \"Lambdatalk\"\n },\n {\n \"code\": \"input \\\"How much rows would you like? \\\"; n\\ndim a$(n)\\n\\nfor i= 0 to n\\n c = 1\\n o$ =\\\"\\\"\\n for k =0 to i\\n o$ =o$ ; c; \\\" \\\"\\n c =c *(i-k)/(k+1)\\n next k\\n a$(i)=o$\\nnext i\\n\\nmaxLen = len(a$(n))\\nfor i= 0 to n\\n print space$((maxLen-len(a$(i)))/2);a$(i)\\nnext i\\n\\nend\\n\",\n \"language\": \"Liberty-BASIC\"\n },\n {\n \"code\": \"10 CLS\\n20 INPUT \\\"Number of rows? \\\", rows:GOSUB 40\\n30 END\\n40 FOR i=0 TO rows-1\\n50 c=1\\n60 FOR k=0 TO i\\n70 PRINT USING \\\"####\\\";c;\\n80 c=c*(i-k)/(k+1)\\n90 NEXT\\n100 PRINT\\n110 NEXT\\n120 RETURN\\n\",\n \"language\": \"Locomotive-Basic\"\n },\n {\n \"code\": \"to pascal :n\\n if :n = 1 [output [1]]\\n localmake \\\"a pascal :n-1\\n output (sentence first :a (map \\\"sum butfirst :a butlast :a) last :a)\\nend\\n\\nfor [i 1 10] [print pascal :i]\\n\",\n \"language\": \"Logo\"\n },\n {\n \"code\": \":- object(pascals).\\n\\n :- uses(integer, [plus/3, succ/2]).\\n\\n :- public(reset/0).\\n\\n reset :-\\n retractall(triangle_(_,_,_)).\\n\\n :- private(triangle_/3).\\n :- dynamic(triangle_/3).\\n\\n :- public(triangle/2).\\n\\n triangle(N, Lines) :-\\n triangle(N, _, DiffLines),\\n difflist::as_list(DiffLines, Lines).\\n\\n % Shortcut with cached value if it exists.\\n triangle(N, Line, DiffLines) :- triangle_(N, Line, DiffLines), !.\\n\\n triangle(N, Line, DiffLines) :-\\n succ(N0, N),\\n triangle(N0, Line0, DiffLines0),\\n ZL = [0|Line0],\\n list::append(Line0, [0], ZR),\\n meta::map(plus, ZL, ZR, Line),\\n difflist::add(Line, DiffLines0, DiffLines),\\n asserta(triangle_(N, Line, DiffLines)).\\n\\n triangle(1, [1], [[1]|X]-X).\\n\\n:- end_object.\\n\",\n \"language\": \"Logtalk\"\n },\n {\n \"code\": \"function nextrow(t)\\n local ret = {}\\n t[0], t[#t+1] = 0, 0\\n for i = 1, #t do ret[i] = t[i-1] + t[i] end\\n return ret\\nend\\n\\nfunction triangle(n)\\n t = {1}\\n for i = 1, n do\\n print(unpack(t))\\n t = nextrow(t)\\n end\\nend\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"f:=n->seq(print(seq(binomial(i,k),k=0..i)),i=0..n-1);\\n\\nf(3);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"n=7;\\nColumn[StringReplace[ToString /@ Replace[MatrixExp[SparseArray[\\n{Band[{2,1}] -> Range[n-1]},{n,n}]],{x__,0..}->{x},2] ,{\\\"{\\\"|\\\"}\\\"|\\\",\\\"->\\\" \\\"}], Center]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"nmax := 10;\\npascal[nmax_] := Module[\\n {vals = Table[Binomial[n, k], {n, 0, nmax}, {k, 0, n}],\\n ids = Table[{n, k}, {n, 0, nmax}, {k, 0, n}],\\n labels, left, right, leftright, edgeLabels\\n },\\n labels = Flatten[Thread /@ (Thread[ids -> vals]), 1];\\n left = DeleteCases[Flatten[Flatten[ids, 1] /. {n_, k_} /; (n >= k + 1) :> {{n, k + 1} -> {n + 1, k + 1}}, 1], _?NumberQ];\\n right = DeleteCases[Flatten[Flatten[ids, 1] /. {n_, k_} /; (n > k) :> {{n, k} -> {n + 1, k + 1}}, 1], _?NumberQ];\\n leftright = DeleteCases[left \\\\[Union] right, _ -> {b_, _} /; b > nmax];\\n edgeLabels = (# -> Style[\\\"+\\\", Medium] & /@ leftright);\\n Graph[Flatten[ids, 1], leftright\\n , VertexLabels -> MapAt[Placed[#, Center] &, labels, {All, 2}]\\n , GraphLayout -> \\\"SpringEmbedding\\\"\\n , VertexSize -> 0.8, EdgeLabels -> edgeLabels\\n , PlotLabel -> \\\"Pascal's Triangle\\\"\\n ]\\n ];\\npascal[nmax]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"pascal(n);\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \" binomCoeff = diag(rot90(pascal(n)))',\\n\",\n \"language\": \"MATLAB\"\n },\n {\n \"code\": \"sjoin(v, j) := apply(sconcat, rest(join(makelist(j, length(v)), v)))$\\n\\ndisplay_pascal_triangle(n) := for i from 0 thru 6 do disp(sjoin(makelist(binomial(i, j), j, 0, i), \\\" \\\"));\\n\\ndisplay_pascal_triangle(6);\\n/* \\\"1\\\"\\n \\\"1 1\\\"\\n \\\"1 2 1\\\"\\n \\\"1 3 3 1\\\"\\n \\\"1 4 6 4 1\\\"\\n \\\"1 5 10 10 5 1\\\"\\n \\\"1 6 15 20 15 6 1\\\" */\\n\",\n \"language\": \"Maxima\"\n },\n {\n \"code\": \"vardef bincoeff(expr n, k) =\\nsave ?;\\n? := (1 for i=(max(k,n-k)+1) upto n: * i endfor )\\n / (1 for i=2 upto min(k, n-k): * i endfor); ?\\nenddef;\\n\\ndef pascaltr expr c =\\n string s_;\\n for i := 0 upto (c-1):\\n s_ := \\\"\\\" for k=0 upto (c-i): & \\\" \\\" endfor;\\n s_ := s_ for k=0 upto i: & decimal(bincoeff(i,k))\\n & \\\" \\\" if bincoeff(i,k)<9: & \\\" \\\" fi endfor;\\n message s_;\\n endfor\\nenddef;\\n\\npascaltr(4);\\nend\\n\",\n \"language\": \"Metafont\"\n },\n {\n \"code\": \"TextWindow.Write(\\\"Number of rows? \\\")\\nr = TextWindow.ReadNumber()\\nFor i = 0 To r - 1\\n c = 1\\n For k = 0 To i\\n TextWindow.CursorLeft = (k + 1) * 4 - Text.GetLength(c)\\n TextWindow.Write(c)\\n c = c * (i - k) / (k + 1)\\n EndFor\\n TextWindow.WriteLine(\\\"\\\")\\nEndFor\\n\",\n \"language\": \"Microsoft-Small-Basic\"\n },\n {\n \"code\": \"MODULE Pascal;\\nFROM FormatString IMPORT FormatString;\\nFROM Terminal IMPORT WriteString,WriteLn,ReadChar;\\n\\nPROCEDURE PrintLine(n : INTEGER);\\nVAR\\n buf : ARRAY[0..63] OF CHAR;\\n m,j : INTEGER;\\nBEGIN\\n IF n<1 THEN RETURN END;\\n m := 1;\\n WriteString(\\\"1 \\\");\\n FOR j:=1 TO n-1 DO\\n m := m * (n - j) DIV j;\\n FormatString(\\\"%i \\\", buf, m);\\n WriteString(buf)\\n END;\\n WriteLn\\nEND PrintLine;\\n\\nPROCEDURE Print(n : INTEGER);\\nVAR i : INTEGER;\\nBEGIN\\n FOR i:=1 TO n DO\\n PrintLine(i)\\n END\\nEND Print;\\n\\nBEGIN\\n Print(10);\\n\\n ReadChar\\nEND Pascal.\\n\",\n \"language\": \"Modula-2\"\n },\n {\n \"code\": \"/* NetRexx */\\noptions replace format comments java crossref symbols nobinary\\n\\nnumeric digits 1000 -- allow very large numbers\\nparse arg rows .\\nif rows = '' then rows = 11 -- default to 11 rows\\nprintPascalTriangle(rows)\\nreturn\\n\\n-- -----------------------------------------------------------------------------\\nmethod printPascalTriangle(rows = 11) public static\\n lines = ''\\n mx = (factorial(rows - 1) / factorial(rows % 2) / factorial(rows - 1 - rows % 2)).length() -- width of widest number\\n\\n loop row = 1 to rows\\n n1 = 1.center(mx)\\n line = n1\\n loop col = 2 to row\\n n2 = col - 1\\n n1 = n1 * (row - n2) / n2\\n line = line n1.center(mx)\\n end col\\n lines[row] = line.strip()\\n end row\\n\\n -- display triangle\\n ml = lines[rows].length() -- length of longest line\\n loop row = 1 to rows\\n say lines[row].centre(ml)\\n end row\\n\\n return\\n\\n-- -----------------------------------------------------------------------------\\nmethod factorial(n) public static\\n fac = 1\\n loop n_ = 2 to n\\n fac = fac * n_\\n end n_\\n return fac /*calc. factorial*/\\n\",\n \"language\": \"NetRexx\"\n },\n {\n \"code\": \"factorial is recur [ 0 =, 1 first, pass, product, -1 +]\\ncombination is fork [ > [first, second], 0 first,\\n / [factorial second, * [factorial - [second, first], factorial first] ]\\n]\\npascal is transpose each combination cart [pass, pass] tell\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"|loaddefs 'pascal.nial'\\n|pascal 5\\n\",\n \"language\": \"Nial\"\n },\n {\n \"code\": \"import sequtils, strutils\\n\\nproc printPascalTriangle(n: int) =\\n ## Print a Pascal triangle.\\n\\n # Build the triangle.\\n var triangle: seq[seq[int]]\\n triangle.add @[1]\\n for _ in 1..<n:\\n triangle.add zip(triangle[^1] & @[0], @[0] & triangle[^1]).mapIt(it[0] + it[1])\\n\\n # Build the lines to display.\\n let length = len($max(triangle[^1])) # Maximum length of number.\\n var lines: seq[string]\\n for row in triangle:\\n lines.add row.mapIt(($it).center(length)).join(\\\" \\\")\\n\\n # Display the lines.\\n let lineLength = lines[^1].len # Length of largest line (the last one).\\n for line in lines:\\n echo line.center(lineLength)\\n\\nprintPascalTriangle(10)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"const ROWS = 10\\nconst TRILEN = toInt(ROWS * (ROWS + 1) / 2) # Sum of arth progression\\nvar triangle = newSeqOfCap[Natural](TRILEN) # Avoid reallocations\\n\\nproc printPascalTri(row: Natural, result: var seq[Natural]) =\\n add(result, 1)\\n for i in 2..row-1: add(result, result[^row] + result[^(row-1)])\\n add(result, 1)\\n\\n echo result[^row..^1]\\n if row + 1 <= ROWS: printPascalTri(row + 1, result)\\n\\nprintPascalTri(1, triangle)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"(* generate next row from current row *)\\nlet next_row row =\\n List.map2 (+) ([0] @ row) (row @ [0])\\n\\n(* returns the first n rows *)\\nlet pascal n =\\n let rec loop i row =\\n if i = n then []\\n else row :: loop (i+1) (next_row row)\\n in loop 0 [1]\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"function pascaltriangle(h)\\n for i = 0:h-1\\n for k = 0:h-i\\n printf(\\\" \\\");\\n endfor\\n for j = 0:i\\n printf(\\\"%3d \\\", bincoeff(i, j));\\n endfor\\n printf(\\\"\\\\n\\\");\\n endfor\\nendfunction\\n\\npascaltriangle(4);\\n\",\n \"language\": \"Octave\"\n },\n {\n \"code\": \": pascal(n) [ 1 ] #[ dup println dup 0 + 0 rot + zipWith(#+) ] times(n) drop ;\\n\",\n \"language\": \"Oforth\"\n },\n {\n \"code\": \"declare\\n fun {NextLine Xs}\\n {List.zip 0|Xs {Append Xs [0]}\\n fun {$ Left Right}\\n Left + Right\\n end}\\n end\\n\\n fun {Triangle N}\\n {List.take {Iterate [1] NextLine} N}\\n end\\n\\n fun lazy {Iterate I F}\\n I|{Iterate {F I} F}\\n end\\n\\n %% Only works nicely for N =< 5.\\n proc {PrintTriangle T}\\n N = {Length T}\\n in\\n for\\n Line in T\\n Indent in N-1..0;~1\\n do\\n for _ in 1..Indent do {System.printInfo \\\" \\\"} end\\n for L in Line do {System.printInfo L#\\\" \\\"} end\\n {System.printInfo \\\"\\\\n\\\"}\\n end\\n end\\nin\\n {PrintTriangle {Triangle 5}}\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"pascals_triangle(N)= {\\nmy(row=[],prevrow=[]);\\nfor(x=1,N,\\n if(x>5,break(1));\\n row=eval(Vec(Str(11^(x-1))));\\n print(row));\\nprevrow=row;\\nfor(y=6,N,\\n for(p=2,#prevrow,\\n row[p]=prevrow[p-1]+prevrow[p]);\\n row=concat(row,1);\\n prevrow=row;\\n print(row);\\n );\\n}\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"Program PascalsTriangle(output);\\n\\nprocedure Pascal(r : Integer);\\n var\\n i, c, k : Integer;\\n begin\\n for i := 0 to r-1 do\\n begin\\n c := 1;\\n for k := 0 to i do\\n begin\\n write(c:3);\\n c := (c * (i-k)) div (k+1);\\n end;\\n writeln;\\n end;\\nend;\\n\\nbegin\\n Pascal(9)\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"sub pascal {\\n my $rows = shift;\\n my @next = (1);\\n for my $n (1 .. $rows) {\\n print \\\"@next\\\\n\\\";\\n @next = (1, (map $next[$_]+$next[$_+1], 0 .. $n-2), 1);\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use ntheory qw/binomial/;\\nsub pascal {\\n my $rows = shift;\\n for my $n (0 .. $rows-1) {\\n print join(\\\" \\\", map { binomial($n,$_) } 0 .. $n), \\\"\\\\n\\\";\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use bignum;\\nsub pascal_line { $_[0] ? unpack \\\"A(A6)*\\\", 1000001**$_[0] : 1 }\\nsub pascal { print \\\"@{[map -+-$_, pascal_line $_]}\\\\n\\\" for 0..$_[0]-1 }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"#!/usr/bin/perl\\nuse strict;\\nuse warnings;\\n\\n{\\n my @tartaglia ;\\n sub tartaglia {\\n my ($x,$y) = @_;\\n if ($x == 0 or $y == 0) { $tartaglia[$x][$y]=1 ; return 1};\\n my $ret ;\\n foreach my $yps (0..$y){\\n $ret += ( $tartaglia[$x-1][$yps] || tartaglia($x-1,$yps) );\\n }\\n $tartaglia[$x][$y] = $ret;\\n return $ret;\\n }\\n}\\nsub tartaglia_row {\\n my $y = shift;\\n my $x = 0;\\n my @row;\\n $row[0] = &tartaglia($x,$y+1);\\n foreach my $pos (0..$y-1) {push @row, tartaglia(++$x,--$y)}\\n return @row;\\n}\\n\\n\\nfor (0..5) {print join ' ', tartaglia_row($_),\\\"\\\\n\\\"}\\nprint \\\"\\\\n\\\\n\\\";\\n\\n\\nprint tartaglia(3,3),\\\"\\\\n\\\";\\nmy @third = tartaglia_row(5);\\nprint \\\"@third\\\\n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">13</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">&</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,(</span><span style=\\\"color: #000000;\\\">13</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" %3d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"<?php\\n //Author Ivan Gavryshin @dcc0\\nfunction tre($n) {\\n $ck=1;\\n $kn=$n+1;\\n\\n if($kn%2==0) {\\n $kn=$kn/2;\\n $i=0;\\n }\\n else\\n {\\n\\n $kn+=1;\\n $kn=$kn/2;\\n $i= 1;\\n}\\n\\n for ($k = 1; $k <= $kn-1; $k++) {\\n $ck = $ck/$k*($n-$k+1);\\n $arr[] = $ck;\\n echo \\\"+\\\" . $ck ;\\n\\n }\\n\\n\\nif ($kn>1) {\\n echo $arr[i];\\n $arr=array_reverse($arr);\\n for ($i; $i<= $kn-1; $i++) {\\n echo \\\"+\\\" . $arr[$i] ;\\n }\\n\\n }\\n\\n }\\n //set amount of strings here\\n while ($n<=20) {\\n ++$n;\\n echo tre($n);\\n echo \\\"<br/>\\\";\\n}\\n\\n\\n?>\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"function pascalsTriangle($num){\\n\\t$c = 1;\\n\\t$triangle = Array();\\n\\tfor($i=0;$i<=$num;$i++){\\n\\t\\t$triangle[$i] = Array();\\n\\t\\tif(!isset($triangle[$i-1])){\\n\\t\\t\\t$triangle[$i][] = $c;\\n\\t\\t}else{\\n\\t\\t\\tfor($j=0;$j<count($triangle[$i-1])+1;$j++){\\n\\t\\t\\t\\t$triangle[$i][] = (isset($triangle[$i-1][$j-1]) && isset($triangle[$i-1][$j])) ? $triangle[$i-1][$j-1] + $triangle[$i-1][$j] : $c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn $triangle;\\n}\\n\\n$tria = pascalsTriangle(8);\\nforeach($tria as $val){\\n\\tforeach($val as $value){\\n\\t\\techo $value . ' ';\\n\\t}\\n\\techo '<br>';\\n}\\n\",\n \"language\": \"PHP\"\n },\n {\n \"code\": \"%Author: Petar Kabashki\\nspatr([]) = [].\\nspatr([_|T]) = A, T = [] => A = [].\\nspatr([H|T]) = A, T = [TH|_] => A = [H+TH] ++ spatr(T).\\n\\ntable\\npatr(0) = [1].\\npatr(1) = [1, 1].\\npatr(N) = A, N > 1 => Apre = patr(N-1), A = [1] ++ spatr(Apre) ++ [1].\\n\\nforeach(I in 0 .. 10) println(patr(I)) end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"[1]\\n[1,1]\\n[1,2,1]\\n[1,3,3,1]\\n[1,4,6,4,1]\\n[1,5,10,10,5,1]\\n[1,6,15,20,15,6,1]\\n[1,7,21,35,35,21,7,1]\\n[1,8,28,56,70,56,28,8,1]\\n[1,9,36,84,126,126,84,36,9,1]\\n[1,10,45,120,210,252,210,120,45,10,1]\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(de pascalTriangle (N)\\n (for I N\\n (space (* 2 (- N I)))\\n (let C 1\\n (for K I\\n (prin (align 3 C) \\\" \\\")\\n (setq C (*/ C (- I K) K)) ) )\\n (prinl) ) )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"declare (t, u)(40) fixed binary;\\ndeclare (i, n) fixed binary;\\n\\nt,u = 0;\\nget (n);\\nif n <= 0 then return;\\n\\ndo n = 1 to n;\\n u(1) = 1;\\n do i = 1 to n;\\n u(i+1) = t(i) + t(i+1);\\n end;\\n put skip edit ((u(i) do i = 1 to n)) (col(40-2*n), (n+1) f(4));\\n t = u;\\nend;\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \" 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n 1 5 10 10 5 1\\n 1 6 15 20 15 6 1\\n 1 7 21 35 35 21 7 1\\n 1 8 28 56 70 56 28 8 1\\n 1 9 36 84 126 126 84 36 9 1\\n 1 10 45 120 210 252 210 120 45 10 1\\n\",\n \"language\": \"PL-I\"\n },\n {\n \"code\": \"printpascal = (n) :\\n if (n < 1) :\\n 1 print\\n (1)\\n . else :\\n prev = printpascal(n - 1)\\n prev append(0)\\n curr = (1)\\n n times (i):\\n curr append(prev(i) + prev(i + 1))\\n .\\n \\\"\\\\n\\\" print\\n curr join(\\\", \\\") print\\n curr\\n .\\n.\\n\\nprintpascal(read number integer)\\n\",\n \"language\": \"Potion\"\n },\n {\n \"code\": \"$Infinity = 1\\n$NewNumbers = $null\\n$Numbers = $null\\n$Result = $null\\n$Number = $null\\n$Power = $args[0]\\n\\nWrite-Host $Power\\n\\nFor(\\n $i=0;\\n $i -lt $Infinity;\\n $i++\\n )\\n {\\n $Numbers = New-Object Object[] 1\\n $Numbers[0] = $Power\\n For(\\n $k=0;\\n $k -lt $NewNumbers.Length;\\n $k++\\n )\\n {\\n $Numbers = $Numbers + $NewNumbers[$k]\\n }\\n If(\\n $i -eq 0\\n )\\n {\\n $Numbers = $Numbers + $Power\\n }\\n $NewNumbers = New-Object Object[] 0\\n Try\\n {\\n For(\\n $j=0;\\n $j -lt $Numbers.Length;\\n $j++\\n )\\n {\\n $Result = $Numbers[$j] + $Numbers[$j+1]\\n $NewNumbers = $NewNumbers + $Result\\n }\\n }\\n Catch [System.Management.Automation.RuntimeException]\\n {\\n Write-Warning \\\"Value was too large for a Decimal. Script aborted.\\\"\\n Break;\\n }\\n Foreach(\\n $Number in $Numbers\\n )\\n {\\n If(\\n $Number.ToString() -eq \\\"+unendlich\\\"\\n )\\n {\\n Write-Warning \\\"Value was too large for a Decimal. Script aborted.\\\"\\n Exit\\n }\\n }\\n Write-Host $Numbers\\n $Infinity++\\n }\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"pascal(N) :-\\n\\tpascal(1, N, [1], [[1]|X]-X, L),\\n\\tmaplist(my_format, L).\\n\\npascal(Max, Max, L, LC, LF) :-\\n\\t!,\\n\\tmake_new_line(L, NL),\\n\\tappend_dl(LC, [NL|X]-X, LF-[]).\\n\\npascal(N, Max, L, NC, LF) :-\\n\\tbuild_new_line(L, NL),\\n\\tappend_dl(NC, [NL|X]-X, NC1),\\n\\tN1 is N+1,\\n\\tpascal(N1, Max, NL, NC1, LF).\\n\\nbuild_new_line(L, R) :-\\n\\tbuild(L, 0, X-X, R).\\n\\nbuild([], V, RC, RF) :-\\n\\tappend_dl(RC, [V|Y]-Y, RF-[]).\\n\\nbuild([H|T], V, RC, R) :-\\n\\tV1 is V+H,\\n\\tappend_dl(RC, [V1|Y]-Y, RC1),\\n\\tbuild(T, H, RC1, R).\\n\\nappend_dl(X1-X2, X2-X3, X1-X3).\\n\\n% to have a correct output !\\nmy_format([H|T]) :-\\n\\twrite(H),\\n\\tmaplist(my_writef, T),\\n\\tnl.\\n\\nmy_writef(X) :-\\n\\twritef(' %5r', [X]).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \" ?- pascal(15).\\n1\\n1 1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n1 5 10 10 5 1\\n1 6 15 20 15 6 1\\n1 7 21 35 35 21 7 1\\n1 8 28 56 70 56 28 8 1\\n1 9 36 84 126 126 84 36 9 1\\n1 10 45 120 210 252 210 120 45 10 1\\n1 11 55 165 330 462 462 330 165 55 11 1\\n1 12 66 220 495 792 924 792 495 220 66 12 1\\n1 13 78 286 715 1287 1716 1716 1287 715 286 78 13 1\\n1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1\\n1 15 105 455 1365 3003 5005 6435 6435 5005 3003 1365 455 105 15 1\\ntrue.\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\n% Produce a pascal's triangle of depth N\\n%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\n% Prolog is declarative. The predicate pascal/3 below says that to produce\\n% a row of depth N, we can do so by first producing the row at depth(N-1),\\n% and then adding the paired values in that row. The triangle is produced\\n% by prepending the row at N-1 to the preceding rows as recursion unwinds.\\n% The triangle produced by pascal/3 is upside down and lacks the last row,\\n% so pascal/2 prepends the last row to the triangle and reverses it.\\n% Finally, pascal/1 produces the triangle, iterates each row and prints it.\\n%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\npascal_row([V], [V]). % No more value pairs to add\\npascal_row([V0, V1|T], [V|Rest]) :- % Add values from preceding row\\n V is V0 + V1, !, pascal_row([V1|T], Rest). % Drops initial value (1).\\n\\npascal(1, [1], []). % at depth 1, this row is [1] and no preceding rows.\\npascal(N, [1|ThisRow], [Last|Preceding]) :- % Produce a row of depth N\\n succ(N0, N), % N is the successor to N0\\n pascal(N0, Last, Preceding), % Get the previous row\\n !, pascal_row(Last, ThisRow). % Calculate this row from the previous\\n\\npascal(N, Triangle) :-\\n pascal(N, Last, Rows), % Retrieve row at depth N and preceding rows\\n !, reverse([Last|Rows], Triangle). % Add last row to triangle and reverse order\\n\\npascal(N) :-\\n pascal(N, Triangle), member(Row, Triangle), % Iterate and write each row\\n write(Row), nl, fail.\\npascal(_).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"?- pascal(5).\\n[1]\\n[1,1]\\n[1,2,1]\\n[1,3,3,1]\\n[1,4,6,4,1]\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"Procedure pascaltriangle( n.i)\\n\\n For i= 0 To n\\n c = 1\\n For k=0 To i\\n Print(Str( c)+\\\" \\\")\\n c = c * (i-k)/(k+1);\\n Next ;k\\n PrintN(\\\" \\\"); nächste zeile\\n Next ;i\\n\\nEndProcedure\\n\\nOpenConsole()\\nParameter.i = Val(ProgramParameter(0))\\npascaltriangle(Parameter);\\nInput()\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"def pascal(n):\\n \\\"\\\"\\\"Prints out n rows of Pascal's triangle.\\n It returns False for failure and True for success.\\\"\\\"\\\"\\n row = [1]\\n k = [0]\\n for x in range(max(n,0)):\\n print row\\n row=[l+r for l,r in zip(row+k,k+row)]\\n return n>=1\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"def scan(op, seq, it):\\n a = []\\n result = it\\n a.append(it)\\n for x in seq:\\n result = op(result, x)\\n a.append(result)\\n return a\\n\\ndef pascal(n):\\n def nextrow(row, x):\\n return [l+r for l,r in zip(row+[0,],[0,]+row)]\\n\\n return scan(nextrow, range(n-1), [1,])\\n\\nfor row in pascal(4):\\n print(row)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"'''Pascal's triangle'''\\n\\nfrom itertools import (accumulate, chain, islice)\\nfrom operator import (add)\\n\\n\\n# nextPascal :: [Int] -> [Int]\\ndef nextPascal(xs):\\n '''A row of Pascal's triangle\\n derived from a preceding row.'''\\n return list(\\n map(add, [0] + xs, xs + [0])\\n )\\n\\n\\n# pascalTriangle :: Generator [[Int]]\\ndef pascalTriangle():\\n '''A non-finite stream of\\n Pascal's triangle rows.'''\\n return iterate(nextPascal)([1])\\n\\n\\n# finitePascalRows :: Int -> [[Int]]\\ndef finitePascalRows(n):\\n '''The first n rows of Pascal's triangle.'''\\n return accumulate(\\n chain(\\n [[1]], range(1, n)\\n ),\\n lambda a, _: nextPascal(a)\\n )\\n\\n\\n# ------------------------ TESTS -------------------------\\n# main :: IO ()\\ndef main():\\n '''Test of two different approaches:\\n - taking from a non-finite stream of rows,\\n - or constructing a finite list of rows.'''\\n print('\\\\n'.join(map(\\n showPascal,\\n [\\n islice(\\n pascalTriangle(), # Non finite,\\n 7\\n ),\\n finitePascalRows(7) # finite.\\n ]\\n )))\\n\\n\\n# showPascal :: [[Int]] -> String\\ndef showPascal(xs):\\n '''Stringification of a list of\\n Pascal triangle rows.'''\\n ys = list(xs)\\n\\n def align(w):\\n return lambda ns: center(w)(\\n ' '\\n )(' '.join(map(str, ns)))\\n\\n w = len(' '.join((map(str, ys[-1]))))\\n return '\\\\n'.join(map(align(w), ys))\\n\\n\\n# ----------------------- GENERIC ------------------------\\n\\n# center :: Int -> Char -> String -> String\\ndef center(n):\\n '''String s padded with c to approximate centre,\\n fitting in but not truncated to width n.'''\\n def go(c, s):\\n qr = divmod(n - len(s), 2)\\n q = qr[0]\\n return (q * c) + s + ((q + qr[1]) * c)\\n\\n return lambda c: lambda s: go(c, s)\\n\\n\\n# iterate :: (a -> a) -> a -> Gen [a]\\ndef iterate(f):\\n '''An infinite list of repeated\\n applications of f to x.\\n '''\\n def go(x):\\n v = x\\n while True:\\n yield v\\n v = f(v)\\n\\n return go\\n\\n\\n# MAIN ---\\nif __name__ == '__main__':\\n main()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"pascal:{(x-1){0+':x,0}\\\\1}\\npascal 5\\n1\\n1 1\\n1 2 1\\n1 3 3 1\\n1 4 6 4 1\\n\",\n \"language\": \"Q\"\n },\n {\n \"code\": \"(define iterate\\n _ _ 0 -> []\\n F V N -> [V|(iterate F (F V) (1- N))])\\n\\n(define next-row\\n R -> (MAPCAR + [0|R] (append R [0])))\\n\\n(define pascal\\n N -> (iterate next-row [1] N))\\n\",\n \"language\": \"Qi\"\n },\n {\n \"code\": \" [ over size -\\n space swap of\\n swap join ] is justify ( $ n --> )\\n\\n [ witheach\\n [ number$\\n 5 justify echo$ ]\\n cr ] is echoline ( [ --> )\\n\\n [ [] 0 rot 0 join\\n witheach\\n [ tuck +\\n rot join swap ]\\n drop ] is nextline ( [ --> [ )\\n\\n [ ' [ 1 ] swap\\n 1 - times\\n [ dup echoline\\n nextline ]\\n echoline ] is pascal ( n --> )\\n\\n 16 pascal\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"pascalTriangle <- function(h) {\\n for(i in 0:(h-1)) {\\n s <- \\\"\\\"\\n for(k in 0:(h-i)) s <- paste(s, \\\" \\\", sep=\\\"\\\")\\n for(j in 0:i) {\\n s <- paste(s, sprintf(\\\"%3d \\\", choose(i, j)), sep=\\\"\\\")\\n }\\n print(s)\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"pascalTriangle <- function(h) {\\n lapply(0:h, function(i) choose(i, 0:i))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define (pascal n)\\n (define (next-row current-row)\\n (map + (cons 0 current-row)\\n (append current-row '(0))))\\n (reverse\\n (for/fold ([triangle '((1))])\\n ([row (in-range 1 n)])\\n (cons (next-row (first triangle)) triangle))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"sub pascal {\\n [1], { [0, |$_ Z+ |$_, 0] } ... *\\n}\\n\\n.say for pascal[^10];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"constant @pascal = [1], -> $prev { [0, |$prev Z+ |$prev, 0] } ... *;\\n\\n.say for @pascal[^10];\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"multi sub pascal (1) { $[1] }\\nmulti sub pascal (Int $n where 2..*) {\\n my @rows = pascal $n - 1;\\n |@rows, [0, |@rows[*-1] Z+ |@rows[*-1], 0 ];\\n}\\n\\n.say for pascal 10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"sub pascal ($n where $n >= 1) {\\n say my @last = 1;\\n for 1 .. $n - 1 -> $row {\\n @last = 1, |map({ @last[$_] + @last[$_ + 1] }, 0 .. $row - 2), 1;\\n say @last;\\n }\\n}\\n\\npascal 10;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"DEFINT values(100) = {0,1}\\n\\nINPUT \\\"Number of rows: \\\"; nrows\\nPRINT SPACE$((nrows)*3);\\\" 1\\\"\\nFOR row = 2 TO nrows\\n PRINT SPACE$((nrows-row)*3+1);\\n FOR i = row TO 1 STEP -1\\n values(i) = values(i) + values(i-1)\\n PRINT FORMAT$(\\\"%5d \\\", values(i));\\n NEXT i\\n PRINT\\nNEXT row\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"INPUT \\\"Number of rows: \\\"; nrows\\nFOR row = 0 TO nrows-1\\n c = 1\\n PRINT SPACE$((nrows-row)*3);\\n FOR i = 0 TO row\\n PRINT FORMAT$(\\\"%5d \\\", c);\\n c = c * (row - i) / (i+1)\\n NEXT i\\n PRINT\\nNEXT row\\n\",\n \"language\": \"RapidQ\"\n },\n {\n \"code\": \"Red[]\\npascal-triangle: function [\\n n [ integer! ] \\\"number of rows\\\"\\n ][\\n row: make vector! [ 1 ]\\n loop n [\\n print row\\n left: copy row\\n right: copy row\\n insert left 0\\n append right 0\\n row: left + right\\n ]\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"2 elements i j\\n: pascalTriangle\\n cr dup\\n [ dup !j 1 swap 1+ [ !i dup putn space @j @i - * @i 1+ / ] iter cr drop ] iter drop\\n;\\n13 pascalTriangle\\n\",\n \"language\": \"Retro\"\n },\n {\n \"code\": \"/*REXX program displays (or writes to a file) Pascal's triangle (centered/formatted).*/\\nnumeric digits 3000 /*be able to handle gihugeic triangles.*/\\nparse arg nn . /*obtain the optional argument from CL.*/\\nif nn=='' | nn==\\\",\\\" then nn= 10 /*Not specified? Then use the default.*/\\nn= abs(nn) /*N is the number of rows in triangle.*/\\nw= length( !(n-1) % !(n%2) % !(n - 1 - n%2)) /*W: the width of biggest integer. */\\nww= (n-1) * (W + 1) + 1 /*WW: \\\" \\\" \\\" triangle's last row.*/\\n@.= 1; $.= @.; unity= right(1, w) /*defaults rows & lines; aligned unity.*/\\n /* [↓] build rows of Pascals' triangle*/\\n do r=1 for n; rm= r-1 /*Note: the first column is always 1.*/\\n do c=2 to rm; cm= c-1 /*build the rest of the columns in row.*/\\n @.r.c= @.rm.cm + @.rm.c /*assign value to a specific row & col.*/\\n $.r = $.r right(@.r.c, w) /*and construct a line for output (row)*/\\n end /*c*/ /* [↑] C is the column being built.*/\\n if r\\\\==1 then $.r= $.r unity /*for rows≥2, append a trailing \\\"1\\\".*/\\n end /*r*/ /* [↑] R is the row being built.*/\\n /* [↑] WIDTH: for nicely looking line.*/\\n do r=1 for n; $$= center($.r, ww) /*center this particular Pascals' row. */\\n if nn>0 then say $$ /*SAY if NN is positive, else */\\n else call lineout 'PASCALS.'n, $$ /*write this Pascal's row ───► a file.*/\\n end /*r*/\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\n!: procedure; !=1; do j=2 to arg(1); != !*j; end /*j*/; return ! /*compute factorial*/\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"row = 5\\nfor i = 0 to row - 1\\n col = 1\\n see left(\\\" \\\",row-i)\\n for k = 0 to i\\n see \\\"\\\" + col + \\\" \\\"\\n col = col*(i-k)/(k+1)\\n next\\n see nl\\nnext\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"def pascal(n)\\n raise ArgumentError, \\\"must be positive.\\\" if n < 1\\n yield ar = [1]\\n (n-1).times do\\n ar.unshift(0).push(0) # tack a zero on both ends\\n yield ar = ar.each_cons(2).map(&:sum)\\n end\\nend\\n\\npascal(8){|row| puts row.join(\\\" \\\").center(20)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"def next_row(row) ([0] + row).zip(row + [0]).collect {|l,r| l + r } end\\n\\ndef pascal(n) n.times.inject([1]) {|x,_| next_row x } end\\n\\n8.times{|i| p pascal(i)}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"input \\\"number of rows? \\\";r\\nfor i = 0 to r - 1\\n c = 1\\n print left$(\\\" \\\",(r*2)-(i*2));\\n for k = 0 to i\\n print using(\\\"####\\\",c);\\n c = c*(i-k)/(k+1)\\n next\\n print\\nnext\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"fn pascal_triangle(n: u64)\\n{\\n\\n for i in 0..n {\\n let mut c = 1;\\n for _j in 1..2*(n-1-i)+1 {\\n print!(\\\" \\\");\\n }\\n for k in 0..i+1 {\\n print!(\\\"{:2} \\\", c);\\n c = c * (i-k)/(k+1);\\n }\\n println!();\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" def tri(row: Int): List[Int] =\\n row match {\\n case 1 => List(1)\\n case n: Int => 1 +: ((tri(n - 1) zip tri(n - 1).tail) map { case (a, b) => a + b }) :+ 1\\n }\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"def prettyTri(n:Int) = (1 to n) foreach {i => print(\\\" \\\"*(n-i)); tri(i) map (c => print(c + \\\" \\\")); println}\\n\\nprettyTri(5)\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"object Blaise extends App {\\n def pascalTriangle(): Stream[Vector[Int]] =\\n Vector(1) #:: Stream.iterate(Vector(1, 1))(1 +: _.sliding(2).map(_.sum).toVector :+ 1)\\n\\n val output = pascalTriangle().take(15).map(_.mkString(\\\" \\\"))\\n val longest = output.last.length\\n\\n println(\\\"Pascal's Triangle\\\")\\n output.foreach(line => println(s\\\"${\\\" \\\" * ((longest - line.length) / 2)}$line\\\"))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"(define (next-row row)\\n (map + (cons 0 row) (append row '(0))))\\n\\n(define (triangle row rows)\\n (if (= rows 0)\\n '()\\n (cons row (triangle (next-row row) (- rows 1)))))\\n\\n(triangle (list 1) 5)\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"((1) (1 1) (1 2 1) (1 3 3 1) (1 4 6 4 1))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst proc: main is func\\n local\\n var integer: numRows is 0;\\n var array integer: values is [] (0, 1);\\n var integer: row is 0;\\n var integer: index is 0;\\n begin\\n write(\\\"Number of rows: \\\");\\n readln(numRows);\\n writeln(\\\"1\\\" lpad succ(numRows) * 3);\\n for row range 2 to numRows do\\n write(\\\"\\\" lpad (numRows - row) * 3);\\n values &:= [] 0;\\n for index range succ(row) downto 2 do\\n values[index] +:= values[pred(index)];\\n write(\\\" \\\" <& values[index] lpad 5);\\n end for;\\n writeln;\\n end for;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"func pascal(rows) {\\n var row = [1]\\n { | n|\\n say row.join(' ')\\n row = [1, {|i| row[i] + row[i+1] }.map(0 .. n-2)..., 1]\\n } << 1..rows\\n}\\n \\npascal(10)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"function pascal1(n) {\\n\\treturn(comb(J(1,n,0::n-1),J(n,1,0..n-1)))\\n}\\n\\nfunction pascal2(n) {\\n\\ta = I(n)\\n\\ta[.,1] = J(n,1,1)\\n\\tfor (i=3; i<=n; i++) {\\n\\t\\ta[i,2..i-1] = a[i-1,2..i-1]+a[i-1,1..i-2]\\n\\t}\\n\\treturn(a)\\n}\\n\\nfunction pascal3(n) {\\n\\ta = J(n,n,0)\\n\\tfor (i=1; i<n; i++) {\\n\\t\\ta[i+1,i] = i\\n\\t}\\n\\ts = p = I(n)\\n\\tk = 1\\n\\tfor (i=0; i<n; i++) {\\n\\t\\tp = p*a/k++\\n\\t\\ts = s+p\\n\\t}\\n\\treturn(s)\\n}\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"function print_pascal_triangle(n) {\\n\\ta = pascal1(n)\\n\\tfor (i=1; i<=n; i++) {\\n\\t\\tfor (j=1; j<=i; j++) {\\n\\t\\t\\tprintf(\\\"%10.0f\\\",a[i,j])\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\")\\n\\t}\\n}\\n\\nprint_pascal_triangle(5)\\n 1\\n 1 1\\n 1 2 1\\n 1 3 3 1\\n 1 4 6 4 1\\n\",\n \"language\": \"Stata\"\n },\n {\n \"code\": \"func pascal(n:Int)->[Int]{\\n if n==1{\\n let a=[1]\\n print(a)\\n return a\\n }\\n else{\\n var a=pascal(n:n-1)\\n var temp=a\\n for i in 0..<a.count{\\n if i+1==a.count{\\n temp.append(1)\\n break\\n }\\n temp[i+1] = a[i]+a[i+1]\\n }\\n a=temp\\n print(a)\\n return a\\n }\\n}\\nlet waste = pascal(n:10)\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"proc pascal_iterative n {\\n if {$n < 1} {error \\\"undefined behaviour for n < 1\\\"}\\n set row [list 1]\\n lappend rows $row\\n set i 1\\n while {[incr i] <= $n} {\\n set prev $row\\n set row [list 1]\\n for {set j 1} {$j < [llength $prev]} {incr j} {\\n lappend row [expr {[lindex $prev [expr {$j - 1}]] + [lindex $prev $j]}]\\n }\\n lappend row 1\\n lappend rows $row\\n }\\n return $rows\\n}\\n\\nputs [join [pascal_iterative 6] \\\\n]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"proc pascal_coefficients n {\\n if {$n < 1} {error \\\"undefined behaviour for n < 1\\\"}\\n for {set i 0} {$i < $n} {incr i} {\\n set c 1\\n set row [list $c]\\n for {set j 0} {$j < $i} {incr j} {\\n set c [expr {$c * ($i - $j) / ($j + 1)}]\\n lappend row $c\\n }\\n lappend rows $row\\n }\\n return $rows\\n}\\n\\nputs [join [pascal_coefficients 6] \\\\n]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"package require Tcl 8.5\\n\\nproc pascal_combinations n {\\n if {$n < 1} {error \\\"undefined behaviour for n < 1\\\"}\\n for {set i 0} {$i < $n} {incr i} {\\n set row [list]\\n for {set j 0} {$j <= $i} {incr j} {\\n lappend row [C $i $j]\\n }\\n lappend rows $row\\n }\\n return $rows\\n}\\n\\nproc C {n k} {\\n expr {[ifact $n] / ([ifact $k] * [ifact [expr {$n - $k}]])}\\n}\\n\\nset fact_cache {1 1}\\nproc ifact n {\\n global fact_cache\\n if {$n < [llength $fact_cache]} {\\n return [lindex $fact_cache $n]\\n }\\n set i [expr {[llength $fact_cache] - 1}]\\n set sum [lindex $fact_cache $i]\\n while {$i < $n} {\\n incr i\\n set sum [expr {$sum * $i}]\\n lappend fact_cache $sum\\n }\\n return $sum\\n}\\n\\nputs [join [pascal_combinations 6] \\\\n]\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"set n 100\\nputs \\\"calculate $n rows:\\\"\\nforeach proc {pascal_iterative pascal_coefficients pascal_combinations} {\\n puts \\\"$proc: [time [list $proc $n] 100]\\\"\\n}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"PROGRAM:PASCALTR\\n:Lbl IN\\n:ClrHome\\n:Disp \\\"NUMBER OF ROWS\\\"\\n:Input N\\n:If N < 1:Goto IN\\n:{N,N}→dim([A])\\n:\\\"CHEATING TO MAKE IT FASTER\\\"\\n:For(I,1,N)\\n:1→[A](1,1)\\n:End\\n:For(I,2,N)\\n:For(J,2,I)\\n:[A](I-1,J-1)+[A](I-1,J)→[A](I,J)\\n:End\\n:End\\n:[A]\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"PROGRAM:PASCALTR\\n:Lbl IN\\n:ClrHome\\n:Disp \\\"NUMBER OF ROWS\\\"\\n:Input N\\n:If N < 1:Goto IN\\n:{N,N}→dim([A])\\n:For(I,2,N)\\n:For(J,2,I)\\n:(I-1) nCr (J-1)→[A](I,J)\\n:End\\n:End\\n:[A]\\n\",\n \"language\": \"TI-83-BASIC\"\n },\n {\n \"code\": \"proc pascal (n : int)\\n for i : 0 .. n\\n var c := 1\\n for k : 0 .. i\\n put c : 4 ..\\n c := c * (i - k) div (k + 1)\\n end for\\n put \\\"\\\"\\n end for\\nend pascal\\n\\npascal(5)\\n\",\n \"language\": \"Turing\"\n },\n {\n \"code\": \"// Pascal's triangle\\n\\nfunction pascal(n: number): void {\\n // Display the first n rows of Pascal's triangle\\n // if n<=0 then nothing is displayed\\n var ld: number[] = new Array(40); // Old\\n var nw: number[] = new Array(40); // New\\n for (var row = 0; row < n; row++) {\\n nw[0] = 1;\\n for (var i = 1; i <= row; i++)\\n nw[i] = ld[i - 1] + ld[i];\\n process.stdout.write(\\\" \\\".repeat((n - row - 1) * 2));\\n for (var i = 0; i <= row; i++) {\\n if (nw[i] < 100)\\n process.stdout.write(\\\" \\\");\\n process.stdout.write(nw[i].toString());\\n if (nw[i] < 10)\\n process.stdout.write(\\\" \\\");\\n process.stdout.write(\\\" \\\");\\n }\\n nw[row + 1] = 0;\\n // We do not copy data from nw to ld\\n // but we work with references.\\n var tmp = ld;\\n ld = nw;\\n nw = tmp;\\n console.log();\\n }\\n}\\n\\npascal(13);\\n\",\n \"language\": \"TypeScript\"\n },\n {\n \"code\": \"#! /bin/bash\\npascal() {\\n local -i n=${1:-1}\\n if (( n <= 1 )); then\\n echo 1\\n else\\n local output=$( $FUNCNAME $((n - 1)) )\\n set -- $( tail -n 1 <<<\\\"$output\\\" ) # previous row\\n echo \\\"$output\\\"\\n printf \\\"1 \\\"\\n while [[ -n $1 ]]; do\\n printf \\\"%d \\\" $(( $1 + ${2:-0} ))\\n shift\\n done\\n echo\\n fi\\n}\\npascal \\\"$1\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\npascal = choose**ziDS+ iota*t+ iota+ successor\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#import std\\n#import nat\\n\\npascal \\\"n\\\" = (next\\\"n\\\" sum*NiCixp) <1>\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"#cast %nLL\\n\\nexample = pascal 10\\n\",\n \"language\": \"Ursala\"\n },\n {\n \"code\": \"Option Base 1\\nPrivate Sub pascal_triangle(n As Integer)\\n Dim odd() As String\\n Dim eve() As String\\n ReDim odd(1)\\n ReDim eve(2)\\n odd(1) = \\\" 1\\\"\\n For i = 1 To n\\n If i Mod 2 = 1 Then\\n Debug.Print String$(2 * n - 2 * i, \\\" \\\") & Join(odd, \\\" \\\")\\n eve(1) = \\\" 1\\\"\\n ReDim Preserve eve(i + 1)\\n For j = 2 To i\\n eve(j) = Format(CStr(Val(odd(j - 1)) + Val(odd(j))), \\\"@@@\\\")\\n Next j\\n eve(i + 1) = \\\" 1\\\"\\n Else\\n Debug.Print String$(2 * n - 2 * i, \\\" \\\") & Join(eve, \\\" \\\")\\n odd(1) = \\\" 1\\\"\\n ReDim Preserve odd(i + 1)\\n For j = 2 To i\\n odd(j) = Format(CStr(Val(eve(j - 1)) + Val(eve(j))), \\\"@@@\\\")\\n Next j\\n odd(i + 1) = \\\" 1\\\"\\n End If\\n Next i\\nEnd Sub\\nPublic Sub main()\\n pascal_triangle 13\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"Pascal_Triangle(WScript.Arguments(0))\\nFunction Pascal_Triangle(n)\\n\\tDim values(100)\\n\\tvalues(1) = 1\\n\\tWScript.StdOut.Write values(1)\\n\\tWScript.StdOut.WriteLine\\n\\tFor row = 2 To n\\n\\t\\tFor i = row To 1 Step -1\\n\\t\\t\\tvalues(i) = values(i) + values(i-1)\\n\\t\\t\\tWScript.StdOut.Write values(i) & \\\" \\\"\\n\\t\\tNext\\n\\t\\tWScript.StdOut.WriteLine\\n\\tNext\\nEnd Function\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"#100 = Get_Num(\\\"Number of rows: \\\", STATLINE)\\n#0=0; #1=1\\nIns_Char(' ', COUNT, #100*3-2) Num_Ins(1)\\nfor (#99 = 2; #99 <= #100; #99++) {\\n Ins_Char(' ', COUNT, (#100-#99)*3)\\n #@99 = 0\\n for (#98 = #99; #98 > 0; #98--) {\\n\\t#97 = #98-1\\n\\t#@98 += #@97\\n\\tNum_Ins(#@98, COUNT, 6)\\n }\\n Ins_Newline\\n}\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"#1 = Get_Num(\\\"Number of rows: \\\", STATLINE)\\nfor (#2 = 0; #2 < #1; #2++) {\\n #3 = 1\\n Ins_Char(' ', COUNT, (#1-#2-1)*3)\\n for (#4 = 0; #4 <= #2; #4++) {\\n\\tNum_Ins(#3, COUNT, 6)\\n\\t#3 = #3 * (#2-#4) / (#4+1)\\n }\\n Ins_Newline\\n}\\n\",\n \"language\": \"Vedit-macro-language\"\n },\n {\n \"code\": \"Sub pascaltriangle()\\n 'Pascal's triangle\\n Const m = 11\\n Dim t(40) As Integer, u(40) As Integer\\n Dim i As Integer, n As Integer, s As String, ss As String\\n ss = \\\"\\\"\\n For n = 1 To m\\n u(1) = 1\\n s = \\\"\\\"\\n For i = 1 To n\\n u(i + 1) = t(i) + t(i + 1)\\n s = s & u(i) & \\\" \\\"\\n t(i) = u(i)\\n Next i\\n ss = ss & s & vbCrLf\\n Next n\\n MsgBox ss, , \\\"Pascal's triangle\\\"\\nEnd Sub 'pascaltriangle\\n\",\n \"language\": \"Visual-Basic\"\n },\n {\n \"code\": \"Imports System.Numerics\\n\\nModule Module1\\n Iterator Function GetRow(rowNumber As BigInteger) As IEnumerable(Of BigInteger)\\n Dim denominator As BigInteger = 1\\n Dim numerator = rowNumber\\n\\n Dim currentValue As BigInteger = 1\\n For counter = 0 To rowNumber\\n Yield currentValue\\n currentValue = currentValue * numerator\\n numerator = numerator - 1\\n currentValue = currentValue / denominator\\n denominator = denominator + 1\\n Next\\n End Function\\n\\n Function GetTriangle(quantityOfRows As Integer) As IEnumerable(Of BigInteger())\\n Dim range = Enumerable.Range(0, quantityOfRows).Select(Function(num) New BigInteger(num))\\n Return range.Select(Function(num) GetRow(num).ToArray())\\n End Function\\n\\n Function CenterString(text As String, width As Integer)\\n Dim spaces = width - text.Length\\n Dim padLeft = (spaces / 2) + text.Length\\n Return text.PadLeft(padLeft).PadRight(width)\\n End Function\\n\\n Function FormatTriangleString(triangle As IEnumerable(Of BigInteger())) As String\\n Dim maxDigitWidth = triangle.Last().Max().ToString().Length\\n Dim rows = triangle.Select(Function(arr) String.Join(\\\" \\\", arr.Select(Function(array) CenterString(array.ToString(), maxDigitWidth))))\\n Dim maxRowWidth = rows.Last().Length\\n Return String.Join(Environment.NewLine, rows.Select(Function(row) CenterString(row, maxRowWidth)))\\n End Function\\n\\n Sub Main()\\n Dim triangle = GetTriangle(20)\\n Dim output = FormatTriangleString(triangle)\\n Console.WriteLine(output)\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\nimport \\\"./math\\\" for Int\\n\\nvar pascalTriangle = Fn.new { |n|\\n if (n <= 0) return\\n for (i in 0...n) {\\n System.write(\\\" \\\" * (n-i-1))\\n for (j in 0..i) {\\n Fmt.write(\\\"$3d \\\", Int.binomial(i, j))\\n }\\n System.print()\\n }\\n}\\n\\npascalTriangle.call(13)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"%include \\\"io.inc\\\"\\n\\nsection .text\\nglobal CMAIN\\nCMAIN:\\n\\tmov ebx, 7 ;size\\n\\tcall mloop\\n\\tret\\n\\t\\nmloop:\\n\\tmov edx, 0 ;edx stands for the nth line\\nlooping:\\n\\tpush ebx\\n\\tpush edx\\n\\tcall line\\n\\tpop edx\\n\\tpop ebx\\n\\tinc edx\\n\\tcmp edx, ebx\\n\\tjl looping\\n\\txor eax, eax\\n\\tret\\n\\t\\nline:\\n\\tmov ecx, 0 ;ecx stands for the nth character in each line\\n\\tmlp:\\n\\t\\tpush ecx\\n push edx\\n\\t\\tcall nCk\\n pop edx\\n\\t\\tpop ecx\\n\\t\\tPRINT_DEC 4, eax ;print returned number\\n PRINT_STRING \\\" \\\"\\n\\t\\tinc ecx\\n\\t\\tcmp ecx, edx ;if\\n\\t\\tjle mlp\\n\\t\\tNEWLINE\\n\\t\\tret\\n\\t\\t\\nnCk:\\n\\t;ecx : j\\n\\t;edx : i\\n\\tmov esi, edx\\n\\tcall fac ;i!\\n\\tpush eax ;save i!\\n\\tmov esi, ecx\\n\\tcall fac ;j!\\n\\tpush eax ;save j!\\n\\tmov ebx, edx\\n\\tsub ebx, ecx ;(i-j)\\n\\tmov esi, ebx\\n\\tcall fac ;(i-j)!\\n\\tpop ebx ;(i-j)! is in eax\\n\\tmul ebx ;(i-j)! * j!\\n\\tmov ecx, eax\\n\\tpop eax ; get i!\\n\\tdiv ecx ; ; last step : i! divided by (i-j)! * j!\\n\\tret\\n\\t\\nfac:\\n\\tpush ecx\\n push edx\\n\\tmov eax, 1\\n\\tmov ecx, esi\\n\\tcmp ecx, 0 ; 0! returns 1\\n\\tje facz\\n\\tlp:\\n\\t\\tmul ecx ;multiplies eax by ecx and then decrements ecx until ecx is 0\\n\\t\\tdec ecx\\n\\t\\tcmp ecx, 0\\n\\t\\tjg lp\\n\\t\\tjmp end\\n\\tfacz:\\n\\t\\tmov eax, 1\\n\\tend:\\n pop edx\\n\\t\\tpop ecx\\n\\t\\tret\\n\",\n \"language\": \"X86-Assembly\"\n },\n {\n \"code\": \"PROGRAM \\\"pascal\\\"\\nVERSION \\\"0.0001\\\"\\n\\nDECLARE FUNCTION Entry()\\n\\nFUNCTION Entry()\\n r@@ = UBYTE(INLINE$(\\\"Number of rows? \\\"))\\n FOR i@@ = 0 TO r@@ - 1\\n c%% = 1\\n FOR k@@ = 0 TO i@@\\n PRINT FORMAT$(\\\"####\\\", c%%);\\n c%% = c%% * (i@@ - k@@) / (k@@ + 1)\\n NEXT k@@\\n PRINT\\n NEXT i@@\\nEND FUNCTION\\nEND PROGRAM\\n\",\n \"language\": \"XBasic\"\n },\n {\n \"code\": \"include c:\\\\cxpl\\\\codes;\\n\\nproc Pascal(N); \\\\Display the first N rows of Pascal's triangle\\nint N; \\\\if N<=0 then nothing is displayed\\nint Row, I, Old(40), New(40);\\n[for Row:= 0 to N-1 do\\n [New(0):= 1;\\n for I:= 1 to Row do New(I):= Old(I-1) + Old(I);\\n for I:= 1 to (N-Row-1)*2 do ChOut(0, ^ );\\n for I:= 0 to Row do\\n [if New(I)<100 then ChOut(0, ^ );\\n IntOut(0, New(I));\\n if New(I)<10 then ChOut(0, ^ );\\n ChOut(0, ^ );\\n ];\\n New(Row+1):= 0;\\n I:= Old; Old:= New; New:= I;\\n CrLf(0);\\n ];\\n];\\n\\nPascal(13)\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"fcn pascalTriangle(n){ // n<=0-->\\\"\\\"\\n foreach i in (n){\\n c := 1;\\n print(\\\" \\\"*(2*(n-1-i)));\\n foreach k in (i+1){\\n print(\\\"%3d \\\".fmt(c));\\n c = c * (i-k)/(k+1);\\n }\\n println();\\n }\\n}\\n\\npascalTriangle(8);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \" 10 INPUT \\\"How many rows? \\\";n\\n 15 IF n<1 THEN GO TO 210\\n 20 DIM c(n)\\n 25 DIM d(n)\\n 30 LET c(1)=1\\n 35 LET d(1)=1\\n 40 FOR r=1 TO n\\n 50 FOR i=1 TO (n-r)\\n 60 PRINT \\\" \\\";\\n 70 NEXT i\\n 80 FOR i=1 TO r\\n 90 PRINT c(i);\\\" \\\";\\n100 NEXT i\\n110 PRINT\\n120 IF r>=n THEN GO TO 140\\n130 LET d(r+1)=1\\n140 FOR i=2 TO r\\n150 LET d(i)=c(i-1)+c(i)\\n160 NEXT i\\n165 IF r>=n THEN GO TO 200\\n170 FOR i=1 TO r+1\\n180 LET c(i)=d(i)\\n190 NEXT i\\n200 NEXT r\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n },\n {\n \"code\": \"RUN\\n\",\n \"language\": \"ZX-Spectrum-Basic\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pascals-triangle"}}},{"rowIdx":1491,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pascal's_triangle/Puzzle\n","language":"00-META"},{"code":"This puzzle involves a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pascals Triangle], also known as a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pyramid of Numbers].\n<pre>\n [ 151]\n [ ][ ]\n [40][ ][ ]\n [ ][ ][ ][ ]\n [ X][11][ Y][ 4][ Z]\n</pre>\nEach brick of the pyramid is the sum of the two bricks situated below it.<br>\nOf the three missing numbers at the base of the pyramid, \nthe middle one is the sum of the other two (that is, Y = X + Z).\n\n\n;Task:\nWrite a program to find a solution to this puzzle.\n<br><br>\n\n","language":"00-TASK"},{"code":"F e(&x, row, col) -> &\n R x[row * (row + 1) I/ 2 + col]\n\nF iterate(&v, &diff, do_print = 1B)\n V tot = 0.0\n L\n e(&v, 0, 0) = 151\n e(&v, 2, 0) = 40\n e(&v, 4, 1) = 11\n e(&v, 4, 3) = 4\n\n L(i) 1..4\n L(j) 0..i\n e(&diff, i, j) = 0\n I j < i\n e(&diff, i, j) += e(&v, i - 1, j) - e(&v, i, j + 1) - e(&v, i, j)\n I j != 0\n e(&diff, i, j) += e(&v, i - 1, j - 1) - e(&v, i, j - 1) - e(&v, i, j)\n\n L(i) 1..3\n L(j) 0.<i\n e(&diff, i, j) += e(&v, i + 1, j) + e(&v, i + 1, j + 1) - e(&v, i, j)\n\n e(&diff, 4, 2) += e(&v, 4, 0) + e(&v, 4, 4) - e(&v, 4, 2)\n\n L(i) 0 .< v.len\n v[i] += diff[i] / 4\n\n tot = sum(diff.map(a -> a * a))\n I do_print\n print(‘dev: ’tot)\n I tot < 0.1\n L.break\n\nV v = [0.0] * 15\nV diff = [0.0] * 15\niterate(&v, &diff)\n\nV idx = 0\nL(i) 5\n L(j) 0..i\n print(‘#4’.format(Int(0.5 + v[idx])), end' I j < i {‘ ’} E \"\\n\")\n idx++\n","language":"11l"},{"code":"with Ada.Text_IO; use Ada.Text_IO;\n\nprocedure Pyramid_of_Numbers is\n\n B_X, B_Y, B_Z : Integer := 0; -- Unknown variables\n\n type Block_Value is record\n Known : Integer := 0;\n X, Y, Z : Integer := 0;\n end record;\n X : constant Block_Value := (0, 1, 0, 0);\n Y : constant Block_Value := (0, 0, 1, 0);\n Z : constant Block_Value := (0, 0, 0, 1);\n procedure Add (L : in out Block_Value; R : Block_Value) is\n begin -- Symbolically adds one block to another\n L.Known := L.Known + R.Known;\n L.X := L.X + R.X - R.Z; -- Z is excluded as n(Y - X - Z) = 0\n L.Y := L.Y + R.Y + R.Z;\n end Add;\n procedure Add (L : in out Block_Value; R : Integer) is\n begin -- Symbolically adds a value to the block\n L.Known := L.Known + R;\n end Add;\n\n function Image (N : Block_Value) return String is\n begin -- The block value, when X,Y,Z are known\n return Integer'Image (N.Known + N.X * B_X + N.Y * B_Y + N.Z * B_Z);\n end Image;\n\n procedure Solve_2x2 (A11, A12, B1, A21, A22, B2 : Integer) is\n begin -- Don't care about things, supposing an integer solution exists\n if A22 = 0 then\n B_X := B2 / A21;\n B_Y := (B1 - A11*B_X) / A12;\n else\n B_X := (B1*A22 - B2*A12) / (A11*A22 - A21*A12);\n B_Y := (B1 - A11*B_X) / A12;\n end if;\n B_Z := B_Y - B_X;\n end Solve_2x2;\n\n B : array (1..5, 1..5) of Block_Value; -- The lower triangle contains blocks\n\nbegin\n -- The bottom blocks\n Add (B(5,1),X); Add (B(5,2),11); Add (B(5,3),Y); Add (B(5,4),4); Add (B(5,5),Z);\n\n -- Upward run\n for Row in reverse 1..4 loop\n for Column in 1..Row loop\n Add (B (Row, Column), B (Row + 1, Column));\n Add (B (Row, Column), B (Row + 1, Column + 1));\n end loop;\n end loop;\n\n -- Now have known blocks 40=(3,1), 151=(1,1) and Y=X+Z to determine X,Y,Z\n Solve_2x2\n ( B(1,1).X, B(1,1).Y, 151 - B(1,1).Known,\n B(3,1).X, B(3,1).Y, 40 - B(3,1).Known\n );\n\n -- Print the results\n for Row in 1..5 loop\n New_Line;\n for Column in 1..Row loop\n Put (Image (B(Row,Column)));\n end loop;\n end loop;\nend Pyramid_of_Numbers;\n","language":"Ada"},{"code":"MODE\n FIELD = REAL,\n VEC = [0]REAL,\n MAT = [0,0]REAL;\nMODE BRICK = UNION(INT, CHAR);\n\nFLEX[][]BRICK puzzle = (\n ( 151),\n ( \" \", \" \"),\n ( 40, \" \", \" \"),\n ( \" \", \" \", \" \", \" \"),\n ( \"x\", 11, \"y\", 4, \"z\")\n);\n\nPROC mat col = (INT row, col)INT: row*(row-1)OVER 2 + col;\nINT col x = mat col(5,1),\n col y = mat col(5,3),\n col z = mat col(5,5);\n\nOP INIT = (REF VEC vec)VOID: FOR elem FROM LWB vec TO UPB vec DO vec[elem]:=0 OD;\nOP INIT = (REF MAT mat)VOID: FOR row FROM LWB mat TO UPB mat DO INIT mat[row,] OD;\n\nOP / = (MAT a, MAT b)MAT:( # matrix division #\n [LWB b:UPB b]INT p ;\n INT sign;\n [,]FIELD lu = lu decomp(b, p, sign);\n [LWB a:UPB a, 1 LWB a:2 UPB a]FIELD out;\n FOR col FROM 2 LWB a TO 2 UPB a DO out[,col] := lu solve(b, lu, p, a[,col]) OD;\n out\n);\n\nOP / = (VEC a, MAT b)VEC: ( # vector division #\n [LWB a:UPB a,1]FIELD transpose a;\n transpose a[,1]:=a;\n (transpose a/b)[,LWB a]\n);\n\nINT upb mat = mat col(UPB puzzle, UPB puzzle);\n[upb mat, upb mat] REAL mat; INIT mat;\n[upb mat] REAL vec; INIT vec;\n\nINT mat row := LWB mat;\nINT known row := UPB mat - UPB puzzle + 1;\n\n# build the simultaneous equation to solve #\nFOR row FROM LWB puzzle TO UPB puzzle DO\n FOR col FROM LWB puzzle[row] TO UPB puzzle[row] DO\n IF row < UPB puzzle THEN\n mat[mat row, mat col(row, col)] := 1;\n mat[mat row, mat col(row+1, col)] := -1;\n mat[mat row, mat col(row+1, col+1)] := -1;\n mat row +:= 1\n FI;\n CASE puzzle[row][col] IN\n (INT value):(\n mat[known row, mat col(row, col)] := 1;\n vec[known row] := value;\n known row +:= 1\n ),\n (CHAR variable):SKIP\n ESAC\n OD\nOD;\n\n# finally add x - y + z = 0 #\nmat[known row, col x] := 1;\nmat[known row, col y] := -1;\nmat[known row, col z] := 1;\n\nFORMAT real repr = $g(-5,2)$;\n\nCO # print details of the simultaneous equation being solved #\nFORMAT\n vec repr = $\"(\"n(2 UPB mat-1)(f(real repr)\", \")f(real repr)\")\"$,\n mat repr = $\"(\"n(1 UPB mat-1)(f(vec repr)\", \"lx)f(vec repr)\")\"$;\n\nprintf(($\"Vec: \"l$,vec repr, vec, $l$));\nprintf(($\"Mat: \"l$,mat repr, mat, $l$));\nEND CO\n\n# finally actually solve the equation #\nVEC solution vec = vec/mat;\n\n# and wrap up by printing the solution #\nFLEX[UPB puzzle]FLEX[0]REAL solution;\nFOR row FROM LWB puzzle TO UPB puzzle DO\n solution[row] := LOC[row]REAL;\n FOR col FROM LWB puzzle[row] TO UPB puzzle[row] DO\n solution[row][col] := solution vec[mat col(row, col)]\n OD;\n printf(($n(UPB puzzle-row)(4x)$, $x\"(\"f(real repr)\")\"$, solution[row], $l$))\nOD;\n\nFOR var FROM 1 BY 2 TO 5 DO\n printf(($5x$,$g$,puzzle[UPB puzzle][var],\"=\", real repr, solution[UPB puzzle][var]))\nOD\n","language":"ALGOL-68"},{"code":"N1 := 11, N2 := 4, N3 := 40, N4 := 151\nZ := (2*N4 - 7*N3 - 8*N2 + 6*N1) / 7\nX := (N3 - 2*N1 - Z) / 2\nMsgBox,, Pascal's Triangle, %X%`n%Z%\n","language":"AutoHotkey"},{"code":";---------------------------------------------------------------------------\n; Pascal's triangle.ahk\n; by wolf_II\n;---------------------------------------------------------------------------\n; http://rosettacode.org/wiki/Pascal's_triangle/Puzzle\n;---------------------------------------------------------------------------\n\n\n\n;---------------------------------------------------------------------------\nAutoExecute: ; auto-execute section of the script\n;---------------------------------------------------------------------------\n #SingleInstance, Force ; only one instance allowed\n #NoEnv ; don't check empty variables\n ;-----------------------------------------------------------------------\n AppName := \"Pascal's triangle\"\n N1 := 11, N2 := 4, N3 := 40, N4 := 151\n\n ; monitor MouseMove events\n OnMessage(0x0200, \"WM_MOUSEMOVE\")\n\n ; GUI\n Gosub, GuiCreate\n Gui, Show,, %AppName%\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nGuiCreate: ; create the GUI\n;---------------------------------------------------------------------------\n Gui, -MinimizeBox\n Gui, Margin, 8, 8\n\n ; 15 edit controls\n Loop, 5\n Loop, % Row := A_Index {\n xx := 208 + (A_Index - 5) * 50 - (Row - 5) * 25\n yy := 8 + (Row - 1) * 22\n vv := Row \"_\" A_Index\n Gui, Add, Edit, x%xx% y%yy% w50 v%vv% Center ReadOnly -TabStop\n }\n GuiControl, -WantReturn, Edit11\n GuiControl, -WantReturn, Edit15\n\n ; buttons (2 hidden)\n Gui, Add, Button, x8 w78, &Restart\n Gui, Add, Button, x+8 wp, &Solve\n Gui, Add, Button, x+8 wp, &Check\n Gui, Add, Button, x8 wp, Cle&ar\n Gui, Add, Button, xp wp Hidden, &Cancel\n Gui, Add, Button, x+8 wp, &New\n Gui, Add, Button, xp wp Hidden, &Apply\n Gui, Add, Button, x+8 wp, E&xit\n\n ; status bar\n Gui, Add, StatusBar\n\n ; blue font\n Gui, Font, bold cBlue\n GuiControl, Font, Edit11\n GuiControl, Font, Edit15\n ; falling through\n\n;---------------------------------------------------------------------------\nButtonRestart: ; restart retaining the blue clues\n;---------------------------------------------------------------------------\n Controls(True) ; enable controls\n Loop, 15\n If A_Index Not In 1,4,11,12,14,15\n GuiControl,, Edit%A_Index% ; clear\n GuiControl,, Edit1, %N4%\n GuiControl,, Edit4, %N3%\n GuiControl,, Edit12, %N1%\n GuiControl,, Edit14, %N2%\n GuiControl,, Edit11, %X%\n GuiControl,, Edit15, %Z%\n GreenFont:\n Gui, Font, bold cGreen\n GuiControl, Font, Edit1\n GuiControl, Font, Edit4\n GuiControl, Font, Edit12\n GuiControl, Font, Edit14\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nButtonSolve: ; calculate solution\n;---------------------------------------------------------------------------\n ; N1 := 11 N2 := 4 N3 := 40 N4 := 151\n ;-----------------------------------------------------------------------\n ; Y = X + Z\n ; 40 = (11+X) + (11+Y)\n ; A = (11+Y) + (Y+4)\n ; B = (4+Y) + (4+Z)\n ; 151 = (40+A) + (A+B)\n ;-----------------------------------------------------------------------\n Gosub, GreenFont\n GuiControl,, Edit15, % Z := Round( (2*N4 - 7*N3 - 8*N2 + 6*N1) / 7 )\n GuiControl,, Edit11, % X := Round( (N3 - 2*N1 - Z) / 2 )\n ; falling through\n\n;---------------------------------------------------------------------------\nButtonCheck: ; check the [entry|solution] for errors\n;---------------------------------------------------------------------------\n Controls(False) ; disable controls\n Gui, Submit, NoHide\n X := 5_1, Z := 5_5\n Loop, 5\n Loop, % Row := A_Index\n If (%Row%_%A_Index% = \"\")\n %Row%_%A_Index% := 0\n GuiControl,, Edit13, % 5_3 := 5_1 + 5_5\n GuiControl,, Edit10, % 4_4 := 5_4 + 5_5\n GuiControl,, Edit9, % 4_3 := 5_3 + 5_4\n GuiControl,, Edit8, % 4_2 := 5_2 + 5_3\n GuiControl,, Edit7, % 4_1 := 5_1 + 5_2\n GuiControl,, Edit6, % 3_3 := 4_4 + 4_3\n GuiControl,, Edit5, % 3_2 := 4_3 + 4_2\n GuiControl,, Edit4, % 3_1 := 4_2 + 4_1\n GuiControl,, Edit3, % 2_2 := 3_3 + 3_2\n GuiControl,, Edit2, % 2_1 := 3_2 + 3_1\n GuiControl,, Edit1, % 1_1 := 2_2 + 2_1\n Gui, Font, bold cRed\n If Not 3_1 = N3\n GuiControl, Font, Edit4\n If Not 1_1 = N4\n GuiControl, Font, Edit1\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nButtonClear: ; restart without the blue clues\n;---------------------------------------------------------------------------\n X := Z := \"\"\n Gosub, ButtonRestart\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nButtonNew: ; enter new numbers for the puzzle\n;---------------------------------------------------------------------------\n Gosub, GreenFont\n Loop, 15\n If A_Index Not In 1,4,12,14\n GuiControl,, Edit%A_Index% ; clear\n Controls(False) ; disable controls\n NewContr(True) ; enable controls for new numbers\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nButtonApply: ; remember the new numbers\n;---------------------------------------------------------------------------\n Gui, Submit, NoHide\n N1 := 5_2, N2 := 5_4, N3 := 3_1, N4 := 1_1\n NewContr(False) ; disable controls for new numbers\n Controls(True) ; enable controls\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nButtonCancel: ; restore the old numbers\n;---------------------------------------------------------------------------\n GuiControl,, Edit1, %N4%\n GuiControl,, Edit4, %N3%\n GuiControl,, Edit12, %N1%\n GuiControl,, Edit14, %N2%\n NewContr(False) ; disable controls for new numbers\n Controls(True) ; enable controls\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nGuiClose:\n;---------------------------------------------------------------------------\nGuiEscape:\n;---------------------------------------------------------------------------\nButtonExit:\n;---------------------------------------------------------------------------\n ; common action\n ExitApp\n\nReturn\n\n\n\n;---------------------------------------------------------------------------\nControls(Bool) { ; [dis|re-en]able some controls\n;---------------------------------------------------------------------------\n Enable := Bool ? \"+\" : \"-\"\n Disable := Bool ? \"-\" : \"+\"\n\n GuiControl, %Disable%ReadOnly, Edit11\n GuiControl, %Disable%ReadOnly, Edit15\n GuiControl, %Enable%TabStop, Edit11\n GuiControl, %Enable%TabStop, Edit15\n\n GuiControl, %Disable%Default, &Restart\n GuiControl, %Enable%Default, &Check\n GuiControl, %Disable%Disabled, &Check\n GuiControl, %Enable%Disabled, &Restart\n}\n\n\n\n;---------------------------------------------------------------------------\nNewContr(Bool) { ; [dis|re-en]able control for new numbers\n;---------------------------------------------------------------------------\n Enable := Bool ? \"+\" : \"-\"\n Disable := Bool ? \"-\" : \"+\"\n\n GuiControl, %Disable%ReadOnly, Edit1\n GuiControl, %Disable%ReadOnly, Edit4\n GuiControl, %Disable%ReadOnly, Edit12\n GuiControl, %Disable%ReadOnly, Edit14\n\n GuiControl, %Enable%TabStop, Edit1\n GuiControl, %Enable%TabStop, Edit4\n GuiControl, %Enable%TabStop, Edit12\n GuiControl, %Enable%TabStop, Edit14\n\n GuiControl, %Enable%Hidden, Button1\n GuiControl, %Enable%Hidden, Button2\n GuiControl, %Enable%Hidden, Button3\n GuiControl, %Enable%Hidden, Button4\n GuiControl, %Disable%Hidden, Button5\n GuiControl, %Enable%Hidden, Button6\n GuiControl, %Disable%Hidden, Button7\n GuiControl, %Enable%Hidden, Button8\n\n}\n\n\n\n;---------------------------------------------------------------------------\nWM_MOUSEMOVE() { ; monitor MouseMove events\n;---------------------------------------------------------------------------\n ; display quick help in StatusBar\n ;-----------------------------------------------------------------------\n global AppName\n CurrControl := A_GuiControl\n IfEqual True,, MsgBox ; dummy\n\n ; mouse is over buttons\n Else If (CurrControl = \"&Restart\")\n SB_SetText(\"restart retaining the blue clues\")\n Else If (CurrControl = \"&Solve\")\n SB_SetText(\"calculate solution\")\n Else If (CurrControl = \"&Check\")\n SB_SetText(\"check if the entries are correct\")\n Else If (CurrControl = \"Cle&ar\")\n SB_SetText(\"restart without the blue clues\")\n Else If (CurrControl = \"&New\")\n SB_SetText(\"enter new numbers for the puzzle\")\n Else If (CurrControl = \"E&xit\")\n SB_SetText(\"exit \" AppName)\n\n ; delete status bar text\n Else SB_SetText(\"\")\n}\n","language":"AutoHotkey"},{"code":" INSTALL @lib$ + \"ARRAYLIB\"\n\n REM Describe the puzzle as a set of simultaneous equations:\n REM a + b = 151\n REM a - c = 40\n REM -b + c + d = 0\n REM e + f = 40\n REM -c + f + g = 0\n REM -d + g + h = 0\n REM e - x = 11\n REM f - y = 11\n REM g - y = 4\n REM h - z = 4\n REM x - y + z = 0\n REM So we have 11 equations in 11 unknowns.\n\n REM We can represent these equations as a matrix and a vector:\n DIM matrix(10,10), vector(10)\n matrix() = \\ a, b, c, d, e, f, g, h, x, y, z\n \\ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, \\\n \\ 1, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0, \\\n \\ 0,-1, 1, 1, 0, 0, 0, 0, 0, 0, 0, \\\n \\ 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, \\\n \\ 0, 0,-1, 0, 0, 1, 1, 0, 0, 0, 0, \\\n \\ 0, 0, 0,-1, 0, 0, 1, 1, 0, 0, 0, \\\n \\ 0, 0, 0, 0, 1, 0, 0, 0,-1, 0, 0, \\\n \\ 0, 0, 0, 0, 0, 1, 0, 0, 0,-1, 0, \\\n \\ 0, 0, 0, 0, 0, 0, 1, 0, 0,-1, 0, \\\n \\ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,-1, \\\n \\ 0, 0, 0, 0, 0, 0, 0, 0, 1,-1, 1\n vector() = 151, 40, 0, 40, 0, 0, 11, 11, 4, 4, 0\n\n REM Now solve the simultaneous equations:\n PROC_invert(matrix())\n vector() = matrix().vector()\n\n PRINT \"X = \" ; vector(8)\n PRINT \"Y = \" ; vector(9)\n PRINT \"Z = \" ; vector(10)\n","language":"BBC-BASIC"},{"code":"/* Pascal's pyramid solver\n *\n * [top]\n * [ ] [ ]\n * [mid] [ ] [ ]\n * [ ] [ ] [ ] [ ]\n * [ x ] [ a ] [ y ] [ b ] [ z ]\n * x + z = y\n *\n * This solution makes use of a little bit of mathematical observation,\n * such as the fact that top = 4(a+b) + 7(x+z) and mid = 2x + 2a + z.\n */\n\n#include <stdio.h>\n#include <math.h>\n\nvoid pascal(int a, int b, int mid, int top, int* x, int* y, int* z)\n{\n double ytemp = (top - 4 * (a + b)) / 7.;\n if(fmod(ytemp, 1.) >= 0.0001)\n {\n x = 0;\n return;\n }\n *y = ytemp;\n *x = mid - 2 * a - *y;\n *z = *y - *x;\n}\nint main()\n{\n int a = 11, b = 4, mid = 40, top = 151;\n int x, y, z;\n pascal(a, b, mid, top, &x, &y, &z);\n if(x != 0)\n printf(\"x: %d, y: %d, z: %d\\n\", x, y, z);\n else printf(\"No solution\\n\");\n\n return 0;\n}\n","language":"C"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n\nvoid show(int *x) {\n\tint i, j;\n\n\tfor (i = 0; i < 5; i++)\n\t\tfor (j = 0; j <= i; j++)\n\t\t\tprintf(\"%4d%c\", *(x++), j < i ? ' ' : '\\n');\n}\n\ninline int sign(int i)\n{\n\treturn i < 0 ? -1 : i > 0;\n}\n\nint iter(int *v, int *diff) {\n\tint sum, i, j, e = 0;\n\n#\tdefine E(x, row, col) x[(row) * ((row) + 1) / 2 + (col)]\n\t/* enforce boundary conditions */\n\tE(v, 0, 0) = 151;\n\tE(v, 2, 0) = 40;\n\tE(v, 4, 1) = 11;\n\tE(v, 4, 3) = 4;\n\n\t/* calculate difference from equilibrium */\n\tfor (i = 1; i < 5; i++) {\n\t\tfor (j = 0; j <= i; j++) {\n\t\t\tE(diff, i, j) = 0;\n\t\t\tif (j < i)\n\t\t\t\tE(diff, i, j) += E(v, i - 1, j) -\n\t\t\t\t\t\t E(v, i, j + 1) -\n\t\t\t\t\t\t E(v, i, j);\n\t\t\tif (j)\n\t\t\t\tE(diff, i, j) += E(v, i - 1, j - 1) -\n\t\t\t\t\t\t E(v, i, j - 1) -\n\t\t\t\t\t\t E(v, i, j);\n\t\t}\n\t}\n\n\tfor (i = 0; i < 4; i++)\n\t\tfor (j = 0; j < i; j++)\n\t\t\tE(diff, i, j) += E(v, i + 1, j) +\n\t\t\t\t\t E(v, i + 1, j + 1) -\n\t\t\t\t\t E(v, i, j);\n\n\tE(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\n#\tundef E\n\n\t/* Do feedback, check if we are done. */\n\tfor (i = sum = 0; i < 15; i++) {\n\t\tsum += !!sign(e = diff[i]);\n\n\t\t/* 1/5-ish feedback strength on average. These numbers are highly\n\t\t magical, depending on nodes' connectivities. */\n\t\tif (e >= 4 || e <= -4) \t\tv[i] += e/5;\n\t\telse if (rand() < RAND_MAX/4)\tv[i] += sign(e);\n\t}\n\treturn sum;\n}\n\nint main() {\n\tint v[15] = { 0 }, diff[15] = { 0 }, i, s;\n\n\tfor (i = s = 1; s; i++) {\n\t\ts = iter(v, diff);\n\t\tprintf(\"pass %d: %d\\n\", i, s);\n\t}\n\tshow(v);\n\n\treturn 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <iomanip>\n\ninline int sign(int i) {\n return i < 0 ? -1 : i > 0;\n}\n\ninline int& E(int *x, int row, int col) {\n return x[row * (row + 1) / 2 + col];\n}\n\nint iter(int *v, int *diff) {\n // enforce boundary conditions\n E(v, 0, 0) = 151;\n E(v, 2, 0) = 40;\n E(v, 4, 1) = 11;\n E(v, 4, 3) = 4;\n\n // calculate difference from equilibrium\n for (auto i = 1u; i < 5u; i++)\n for (auto j = 0u; j <= i; j++) {\n E(diff, i, j) = 0;\n if (j < i)\n E(diff, i, j) += E(v, i - 1, j) - E(v, i, j + 1) - E(v, i, j);\n if (j)\n E(diff, i, j) += E(v, i - 1, j - 1) - E(v, i, j - 1) - E(v, i, j);\n }\n\n for (auto i = 0u; i < 4u; i++)\n for (auto j = 0u; j < i; j++)\n E(diff, i, j) += E(v, i + 1, j) + E(v, i + 1, j + 1) - E(v, i, j);\n\n E(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\n\n // do feedback, check if we are done\n uint sum;\n int e = 0;\n for (auto i = sum = 0u; i < 15u; i++) {\n sum += !!sign(e = diff[i]);\n\n // 1/5-ish feedback strength on average. These numbers are highly magical, depending on nodes' connectivities\n if (e >= 4 || e <= -4)\n v[i] += e / 5;\n else if (rand() < RAND_MAX / 4)\n v[i] += sign(e);\n }\n return sum;\n}\n\nvoid show(int *x) {\n for (auto i = 0u; i < 5u; i++)\n for (auto j = 0u; j <= i; j++)\n std::cout << std::setw(4u) << *(x++) << (j < i ? ' ' : '\\n');\n}\n\nint main() {\n int v[15] = { 0 }, diff[15] = { 0 };\n for (auto i = 1u, s = 1u; s; i++) {\n s = iter(v, diff);\n std::cout << \"pass \" << i << \": \" << s << std::endl;\n }\n show(v);\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\n\nnamespace Pyramid_of_Numbers\n{\n class Program\n\t{\n\t\tpublic static void Main(string[] args)\n\t\t{\n\t\t\t// Set console properties\n\t\t\tConsole.Title = \" Pyramid of Numbers / Pascal's triangle Puzzle\";\n\t\t\tConsole.SetBufferSize(80,1000);\n\t\t\tConsole.SetWindowSize(80,60);\n\t\t\tConsole.ForegroundColor = ConsoleColor.Green;\n\n\t\t\t\n\t\t\t// Main Program Loop\n\t\t\tConsoleKeyInfo k = new ConsoleKeyInfo('Y', ConsoleKey.Y,true,true,true);\n\t\t\twhile (k.Key == ConsoleKey.Y)\n\t\t\t{\n\t\t\t\tConsole.Clear();\n\t\t\t\t\n\t\t\t\tConsole.WriteLine(\"----------------------------------------------\");\n\t\t\t\tConsole.WriteLine(\" Pyramid of Numbers / Pascal's triangle Puzzle\");\n\t\t\t\tConsole.WriteLine(\"----------------------------------------------\");\n\t\t\t\tConsole.WriteLine();\n\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t//\n\t\t\t\t// Declare new Pyramid array\n\t\t\t\t//\n\t\t\t\tint r = 5;// Number of rows\n\t\t\t\tint [,] Pyramid = new int[r,r];\n\t\t\t\t\n\t\t\t\t// Set initial Pyramid values\n\t\t\t\tfor (int i = 0; i < r; i++)\n\t\t\t\t{\n\t\t\t\t\tfor(int j = 0; j < r; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tPyramid[i,j] = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// Show info on created array\n\t\t\t\tConsole.WriteLine(\" Pyramid has \" + r + \" rows\");\n\t\t\t\tConsole.WriteLine(\"--------------------------------------------\");\n\t\t\t\t\n\t\t\t\t// Enter Pyramid values\n\t\t\t\tfor(int i = 0; i <= r-1; i++)\n\t\t\t\t{\n\t\t\t\t\tConsole.WriteLine(\" Enter \" + (i+1).ToString() + \". row values:\");\n\t\t\t\t\tConsole.WriteLine(\"--------------------------------------------\");\n\t\t\t\t\t\n\t\t\t\t\tfor(int j = 0; j < i+1; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tConsole.Write(\" \" + (j+1).ToString() + \". value = \");\n\t\t\t\t\t\tint v = int.Parse(Console.ReadLine());\n\t\t\t\t\t\t\n\t\t\t\t\t\tPyramid[i,j] = v;\n\t\t\t\t\t}\n\t\t\t\t\tConsole.WriteLine(\"--------------------------------------------\");\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t//\n\t\t\t\t// Show initial Pyramid values\n\t\t\t\t//\n\t\t\t\tConsole.WriteLine();\n\t\t\t\tConsole.WriteLine(\" Initial Pyramid Values \");\n\t\t\t\tConsole.WriteLine();\n\t\t\t\t\n\t\t\t\t// Show Pyramid values\n\t\t\t\tfor(int i = 0; i <= r-1; i++)\n\t\t\t\t{\n\t\t\t\t\tfor(int j = 0; j < i+1; j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tConsole.Write(\"{0,4}\",Pyramid[i,j]);\n\t\t\t\t\t}\n\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t}\n\t\t\t\tConsole.WriteLine(\"--------------------------------------------\");\n\t\t\t\t\n\t\t\t\t// Find solution\n\t\t\t\tSolve_Pyramid(Pyramid);\n\t\t\t\t\n\t\t\t\tConsole.WriteLine();\n\t\t\t\tConsole.Write(\" Start new calculation <Y/N> . . . \");\n\t\t\t\tk = Console.ReadKey(true);\n\t\t\t}\n\t\t}\n\t\t\n //\n // Solve Function\n //\n\t\tpublic static void Solve_Pyramid(int [,] Pyramid)\n\t\t{\n\t\t\tint r = 5; // Number of rows\n\t\t\t\n\t\t\t// Calculate Y\n\t\t\tint a = Pyramid[r-1,1];\n\t\t\tint b = Pyramid[r-1,3];\n\t\t\tint c = Pyramid[0,0];\n\t\t\t\n\t\t\tint y = (c - (4*a) - (4*b))/7;\n\t\t\tPyramid[r-1,2] = y;\n\t\t\t\n\t\t\t\n\t\t\t// Create copy of Pyramid\n\t\t\tint [,] Pyramid_Copy = new int[r,r];\n\t\t\tArray.Copy(Pyramid,Pyramid_Copy,r*r);\n\t\t\t\n\t\t\tint n = 0; // solution counter\n\t\t\tfor(int x = 0; x < y + 1; x++)\n\t\t\t{\n\t\t\t\tfor(int z = 0; z < y + 1; z++)\n\t\t\t\t{\n\t\t\t\t\tif( (x+z) == y)\n\t\t\t\t\t{\n\t\t\t\t\t\tPyramid[r-1,0] = x;\n\t\t\t\t\t\tPyramid[r-1,r-1] = z;\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Recalculate Pyramid values\n\t\t\t\t\t\tfor(int i = r-1; i > 0; i--)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor(int j = 0; j < i; j++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tPyramid[i-1,j] = Pyramid[i,j]+Pyramid[i,j+1];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t// Compare Pyramid values\n\t\t\t\t\t\tbool solved = true;\n\t\t\t\t\t\tfor(int i = 0; i < r-1; i++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor(int j = 0; j < i+1; j++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(Pyramid_Copy[i,j]>0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tif(Pyramid[i,j] != Pyramid_Copy[i,j])\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tsolved = false;\n\t\t\t\t\t\t\t\t\t\ti = r;\n\t\t\t\t\t\t\t\t\t\tbreak;\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\t\n\t\t\t\t\t\tif(solved)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tn++;\n\t\t\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t\t\t\tConsole.WriteLine(\" Solved Pyramid Values no.\" + n);\n\t\t\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// Show Pyramid values\n\t\t\t\t\t\t\tfor(int i = 0; i <= r-1; i++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tfor(int j = 0; j < i+1; j++)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tConsole.Write(\"{0,4}\",Pyramid[i,j]);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t\t\t\tConsole.WriteLine(\" X = \" + Pyramid[r-1,0] + \" \" +\n\t\t\t\t\t\t\t \" Y = \" + Pyramid[r-1,2] + \" \" +\n\t\t\t\t\t\t\t \" Z = \" + Pyramid[r-1,4]);\n\t\t\t\t\t\t\tConsole.WriteLine();\n\t\t\t\t\t\t\tConsole.WriteLine(\"--------------------------------------------\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tArray.Copy(Pyramid_Copy,Pyramid,r*r);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(n == 0)\n\t\t\t{\n\t\t\t\tConsole.WriteLine();\n\t\t\t\tConsole.WriteLine(\" Pyramid has no solution \");\n\t\t\t\tConsole.WriteLine();\n\t\t\t}\n\t\t}\n\t\t\n\t}\n}\n","language":"C-sharp"},{"code":"(def bottom [ [0 1 0], [11 0 0], [0 1 1], [4 0 0], [0 0 1] ])\n\n(defn plus [v1 v2] (vec (map + v1 v2)))\n(defn minus [v1 v2] (vec (map - v1 v2)))\n(defn scale [n v] (vec (map #(* n %) v )))\n\n(defn above [row] (map #(apply plus %) (partition 2 1 row)))\n\n(def rows (reverse (take 5 (iterate above bottom))))\n","language":"Clojure"},{"code":"(def c00 (get-in rows [0 0]))\n(def c20 (get-in rows [2 0]))\n\n(def eqn0 (minus c00 [151 0 0]))\n(def eqn1 (minus c20 [ 40 0 0]))\n","language":"Clojure"},{"code":"(defn solve [m]\n (assert (<= 1 m 2))\n (let [n (- 3 m)\n v0 (scale (eqn1 n) eqn0)\n v1 (scale (eqn0 n) eqn1)\n vd (minus v0 v1)]\n (assert (zero? (vd n)))\n (/ (- (vd 0)) (vd m))))\n\n(let [x (solve 1), z (solve 2), y (+ x z)]\n (println \"x =\" x \", y =\" y \", z =\" z))\n","language":"Clojure"},{"code":"(defn dot [v1 v2] (reduce + (map * v1 v2)))\n\n(defn show-pyramid [x z]\n (doseq [row rows]\n (println (map #(dot [1 x z] %) row)))\n","language":"Clojure"},{"code":"let x = -1\n\ndo\n\n\tlet x = x + 1\n\tlet z = 0\n\n\tdo\n\n\t\tlet e = x + 11\n\t\tlet f = 11 + (x + z)\n\t\tlet g = (x + z) + 4\n\t\tlet h = 4 + z\n\n\t\tif e + f = 40 then\n\n\t\t\tlet c = f + g\n\t\t\tlet d = g + h\n\t\t\tlet a = 40 + c\n\t\t\tlet b = c + d\n\t\t\tlet q = 0\n\n\t\t\tif a + b = 151 then\n\n\t\t\t\tlet q = 1\n\n\t\t\tendif\n\n\t\tendif\n\n\t\tif q = 0 then\n\n\t\t\tlet z = z + 1\n\n\t\tendif\n\n\t\twait\n\n\tloopwhile z < 20 and q = 0\n\n\tif q = 0 then\n\n\t\tlet z = -1\n\n\tendif\n\n\twait\n\nloopuntil z >= 0\n\nprint \"x = \", x\nprint \"y = \", x + z\nprint \"z = \", z\n","language":"Craft-Basic"},{"code":"import CLPFD\nimport Constraint (allC, andC)\nimport Findall (findall)\nimport List (init, last)\n\n\nsolve :: [[Int]] -> Success\nsolve body@([n]:rest) =\n domain (concat body) 1 n\n & andC (zipWith atop body rest)\n & labeling [] (concat body)\n where\n xs `atop` ys = andC $ zipWith3 tri xs (init ys) (tail ys)\n\ntri :: Int -> Int -> Int -> Success\ntri x y z = x =# y +# z\n\ntest (x,y,z) | tri y x z =\n [ [151]\n , [ _, _]\n , [40, _, _]\n , [ _, _, _, _]\n , [ x, 11, y, 4, z]\n ]\nmain = findall $ solve . test\n","language":"Curry"},{"code":"import std.stdio, std.algorithm;\n\nvoid iterate(bool doPrint=true)(double[] v, double[] diff) @safe {\n static ref T E(T)(T[] x, in size_t row, in size_t col)\n pure nothrow @safe @nogc {\n return x[row * (row + 1) / 2 + col];\n }\n\n double tot = 0.0;\n do {\n // Enforce boundary conditions.\n E(v, 0, 0) = 151;\n E(v, 2, 0) = 40;\n E(v, 4, 1) = 11;\n E(v, 4, 3) = 4;\n\n // Calculate difference from equilibrium.\n foreach (immutable i; 1 .. 5) {\n foreach (immutable j; 0 .. i + 1) {\n E(diff, i, j) = 0;\n if (j < i)\n E(diff, i, j) += E(v, i - 1, j) - E(v, i, j + 1) - E(v, i, j);\n if (j)\n E(diff, i, j) += E(v, i - 1, j - 1) - E(v, i, j - 1) - E(v, i, j);\n }\n }\n\n foreach (immutable i; 1 .. 4)\n foreach (immutable j; 0 .. i)\n E(diff, i, j) += E(v, i + 1, j) + E(v, i + 1, j + 1) - E(v, i, j);\n\n E(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\n\n // Do feedback, check if we are close enough.\n // 4: scale down the feedback to avoid oscillations.\n v[] += diff[] / 4;\n tot = diff.map!q{ a ^^ 2 }.sum;\n\n static if (doPrint)\n writeln(\"dev: \", tot);\n\n // tot(dx^2) < 0.1 means each cell is no more than 0.5 away\n // from equilibrium. It takes about 50 iterations. After\n // 700 iterations tot is < 1e-25, but that's overkill.\n } while (tot >= 0.1);\n}\n\nvoid main() {\n static void show(in double[] x) nothrow @nogc {\n int idx;\n foreach (immutable i; 0 .. 5)\n foreach (immutable j; 0 .. i+1) {\n printf(\"%4d%c\", cast(int)(0.5 + x[idx]), j < i ? ' ' : '\\n');\n idx++;\n }\n }\n\n double[15] v = 0.0, diff = 0.0;\n iterate(v, diff);\n show(v);\n}\n","language":"D"},{"code":"#load\"Packages\\MathNet.Numerics.FSharp\\MathNet.Numerics.fsx\"\n\nopen MathNet.Numerics.LinearAlgebra\n\nlet A = matrix [\n [ 1.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\n [ -1.; 0.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\n [ 0.; -1.; 1.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\n [ 0.; 0.; 0.; 0.; 1.; 1.; 0.; 0.; 0.; 0.; 0. ]\n [ 0.; 0.; -1.; 0.; 0.; 1.; 1.; 0.; 0.; 0.; 0. ]\n [ 0.; 0.; 0.; -1.; 0.; 0.; 1.; 1.; 0.; 0.; 0. ]\n [ 0.; 0.; 0.; 0.; -1.; 0.; 0.; 0.; 1.; 0.; 0. ]\n [ 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 0.; 1.; 0. ]\n [ 0.; 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 1.; 0. ]\n [ 0.; 0.; 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 1. ]\n [ 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 1.; -1.; 1. ]\n ]\n\nlet b = vector [151.; -40.; 0.; 40.; 0.; 0.; -11.; -11.; -4.; -4.; 0.]\n\nlet x = A.Solve(b)\n\nprintfn \"x = %f, Y = %f, Z = %f\" x.[8] x.[9] x.[10]\n","language":"F-Sharp"},{"code":"USING: arrays backtrack combinators.extras fry grouping.extras\ninterpolate io kernel math math.ranges sequences ;\n\n: base ( ?x ?z -- seq ) 2dup + swap '[ _ 11 _ 4 _ ] >array ;\n\n: up ( seq -- seq' ) [ [ + ] 2clump-map ] twice ;\n\n: find-solution ( -- x z )\n 10 [1,b] dup [ amb-lazy ] bi@ 2dup base\n up dup first 40 = must-be-true\n up first 151 = must-be-true ;\n\nfind-solution [I X = ${1}, Z = ${}I] nl\n","language":"Factor"},{"code":"Function SolveForZ(x As Integer) As Integer\n Dim As Integer a, b, c, d, e, f, g, h, z\n For z = 0 To 20\n e = x + 11\n f = 11 + (x+z)\n g = (x+z) + 4\n h = 4 + z\n If e + f = 40 Then\n c = f + g\n d = g + h\n a = 40 + c\n b = c + d\n If a + b = 151 Then Return z\n End If\n Next z\n Return -1\nEnd Function\n\nDim As Integer x = -1, z = 0\nDo\n x = x + 1\n z = SolveForZ(x)\nLoop Until z >= 0\n\nPrint \"X =\"; x\nPrint \"Y =\"; x + z\nPrint \"Z =\"; z\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\n// representation of an expression in x, y, and z\ntype expr struct {\n x, y, z float64 // coefficients\n c float64 // constant term\n}\n\n// add two expressions\nfunc addExpr(a, b expr) expr {\n return expr{a.x + b.x, a.y + b.y, a.z + b.z, a.c + b.c}\n}\n\n// subtract two expressions\nfunc subExpr(a, b expr) expr {\n return expr{a.x - b.x, a.y - b.y, a.z - b.z, a.c - b.c}\n}\n\n// multiply expression by a constant\nfunc mulExpr(a expr, c float64) expr {\n return expr{a.x * c, a.y * c, a.z * c, a.c * c}\n}\n\n// given a row of expressions, produce the next row up, by the given\n// sum relation between blocks\nfunc addRow(l []expr) []expr {\n if len(l) == 0 {\n panic(\"wrong\")\n }\n r := make([]expr, len(l)-1)\n for i := range r {\n r[i] = addExpr(l[i], l[i+1])\n }\n return r\n}\n\n// given expression b in a variable, and expression a,\n// take b == 0 and substitute to remove that variable from a.\nfunc substX(a, b expr) expr {\n if b.x == 0 {\n panic(\"wrong\")\n }\n return subExpr(a, mulExpr(b, a.x/b.x))\n}\n\nfunc substY(a, b expr) expr {\n if b.y == 0 {\n panic(\"wrong\")\n }\n return subExpr(a, mulExpr(b, a.y/b.y))\n}\n\nfunc substZ(a, b expr) expr {\n if b.z == 0 {\n panic(\"wrong\")\n }\n return subExpr(a, mulExpr(b, a.z/b.z))\n}\n\n// given an expression in a single variable, return value of that variable\nfunc solveX(a expr) float64 {\n if a.x == 0 || a.y != 0 || a.z != 0 {\n panic(\"wrong\")\n }\n return -a.c / a.x\n}\n\nfunc solveY(a expr) float64 {\n if a.x != 0 || a.y == 0 || a.z != 0 {\n panic(\"wrong\")\n }\n return -a.c / a.y\n}\n\nfunc solveZ(a expr) float64 {\n if a.x != 0 || a.y != 0 || a.z == 0 {\n panic(\"wrong\")\n }\n return -a.c / a.z\n}\n\nfunc main() {\n // representation of given information for bottom row\n r5 := []expr{{x: 1}, {c: 11}, {y: 1}, {c: 4}, {z: 1}}\n fmt.Println(\"bottom row:\", r5)\n\n // given definition of brick sum relation\n r4 := addRow(r5)\n fmt.Println(\"next row up:\", r4)\n r3 := addRow(r4)\n fmt.Println(\"middle row:\", r3)\n\n // given relation y = x + z\n xyz := subExpr(expr{y: 1}, expr{x: 1, z: 1})\n fmt.Println(\"xyz relation:\", xyz)\n // remove z from third cell using xyz relation\n r3[2] = substZ(r3[2], xyz)\n fmt.Println(\"middle row after substituting for z:\", r3)\n\n // given cell = 40,\n b := expr{c: 40}\n // this gives an xy relation\n xy := subExpr(r3[0], b)\n fmt.Println(\"xy relation:\", xy)\n // substitute 40 for cell\n r3[0] = b\n\n // remove x from third cell using xy relation\n r3[2] = substX(r3[2], xy)\n fmt.Println(\"middle row after substituting for x:\", r3)\n\n // continue applying brick sum relation to get top cell\n r2 := addRow(r3)\n fmt.Println(\"next row up:\", r2)\n r1 := addRow(r2)\n fmt.Println(\"top row:\", r1)\n\n // given top cell = 151, we have an equation in y\n y := subExpr(r1[0], expr{c: 151})\n fmt.Println(\"y relation:\", y)\n // using xy relation, we get an equation in x\n x := substY(xy, y)\n fmt.Println(\"x relation:\", x)\n // using xyz relation, we get an equation in z\n z := substX(substY(xyz, y), x)\n fmt.Println(\"z relation:\", z)\n\n // show final answers\n fmt.Println(\"x =\", solveX(x))\n fmt.Println(\"y =\", solveY(y))\n fmt.Println(\"z =\", solveZ(z))\n}\n","language":"Go"},{"code":"puzzle = [[\"151\"],[\"\",\"\"],[\"40\",\"\",\"\"],[\"\",\"\",\"\",\"\"],[\"X\",\"11\",\"Y\",\"4\",\"Z\"]]\n","language":"Haskell"},{"code":"triangle n = n * (n+1) `div` 2\n\ncoeff xys x = maybe 0 id $ lookup x xys\n\nrow n cs = [coeff cs k | k <- [1..n]]\n\neqXYZ n = [(0, 1:(-1):1:replicate n 0)]\n\neqPyramid n h = do\n a <- [1..h-1]\n x <- [triangle (a-1) + 1 .. triangle a]\n let y = x+a\n return $ (0, 0:0:0:row n [(x,-1),(y,1),(y+1,1)])\n\neqConst n fields = do\n (k,s) <- zip [1..] fields\n guard $ not $ null s\n return $ case s of\n \"X\" - (0, 1:0:0:row n [(k,-1)])\n \"Y\" - (0, 0:1:0:row n [(k,-1)])\n \"Z\" - (0, 0:0:1:row n [(k,-1)])\n _ - (fromInteger $ read s, 0:0:0:row n [(k,1)])\n\nequations :: [[String]] - ([Rational], [[Rational]])\nequations puzzle = unzip eqs where\n fields = concat puzzle\n eqs = eqXYZ n ++ eqPyramid n h ++ eqConst n fields\n h = length puzzle\n n = length fields\n","language":"Haskell"},{"code":"normalize :: [Rational] - [Integer]\nnormalize xs = [numerator (x * v) | x <- xs] where\n v = fromInteger $ foldr1 lcm $ map denominator $ xs\n\nrun puzzle = map (normalize . drop 3) $ answer where\n (a, m) = equations puzzle\n lr = decompose 0 m\n answer = case solve 0 lr a of\n Nothing - []\n Just x - x : kernel lr\n","language":"Haskell"},{"code":"*Main run puzzle\n[[151,81,70,40,41,29,16,24,17,12,5,11,13,4,8]]\n*Main run [[\"\"],[\"2\",\"\"],[\"X\",\"Y\",\"Z\"]]\n[[3,2,1,1,1,0],[3,0,3,-1,1,2]]\n","language":"Haskell"},{"code":"chk=:40 151&-:@(2 4{{.\"1)\n","language":"J"},{"code":"base=: [,11,+,4,]\n","language":"J"},{"code":"ord=:5\n","language":"J"},{"code":" |.\"2(#~chk\"2) 2(+/\\)^:(<ord)\"1 base/\"1>,{ ;~i:28\n","language":"J"},{"code":",.(1+i.5)<@{.\"0 1{.|.\"2(#~chk\"2) 2(+/\\)^:(<ord)\"1 base/\"1>,{ ;~i:28\n","language":"J"},{"code":",.(<@{.\"0 1~1+i.@#){.|.\"2(#~chk\"2) 2(+/\\)^:(<ord)\"1 base/\"1>,{ ;~i:28\n","language":"J"},{"code":"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic class PascalsTrianglePuzzle {\n\n public static void main(String[] args) {\n Matrix mat = new Matrix(Arrays.asList(1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d, 0d),\n Arrays.asList(0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d),\n Arrays.asList(0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 1d, -1d),\n Arrays.asList(0d, 0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d),\n Arrays.asList(0d, 0d, 0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, -1d),\n Arrays.asList(1d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d),\n Arrays.asList(0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d, 0d, 0d, 0d),\n Arrays.asList(0d, 0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d, 0d, 0d),\n Arrays.asList(0d, 0d, 0d, 0d, -1d, 0d, 1d, 0d, 0d, 0d, 0d),\n Arrays.asList(0d, 0d, 0d, 0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d),\n Arrays.asList(0d, 0d, 0d, 0d, 0d, 0d, 1d, 1d, 0d, 0d, 0d));\n List<Double> b = Arrays.asList(11d, 11d, 0d, 4d, 4d, 40d, 0d, 0d, 40d, 0d, 151d);\n List<Double> solution = cramersRule(mat, b);\n System.out.println(\"Solution = \" + cramersRule(mat, b));\n System.out.printf(\"X = %.2f%n\", solution.get(8));\n System.out.printf(\"Y = %.2f%n\", solution.get(9));\n System.out.printf(\"Z = %.2f%n\", solution.get(10));\n }\n\n private static List<Double> cramersRule(Matrix matrix, List<Double> b) {\n double denominator = matrix.determinant();\n List<Double> result = new ArrayList<>();\n for ( int i = 0 ; i < b.size() ; i++ ) {\n result.add(matrix.replaceColumn(b, i).determinant() / denominator);\n }\n return result;\n }\n\n private static class Matrix {\n\n private List<List<Double>> matrix;\n\n @Override\n public String toString() {\n return matrix.toString();\n }\n\n @SafeVarargs\n public Matrix(List<Double> ... lists) {\n matrix = new ArrayList<>();\n for ( List<Double> list : lists) {\n matrix.add(list);\n }\n }\n\n public Matrix(List<List<Double>> mat) {\n matrix = mat;\n }\n\n public double determinant() {\n if ( matrix.size() == 1 ) {\n return get(0, 0);\n }\n if ( matrix.size() == 2 ) {\n return get(0, 0) * get(1, 1) - get(0, 1) * get(1, 0);\n }\n double sum = 0;\n double sign = 1;\n for ( int i = 0 ; i < matrix.size() ; i++ ) {\n sum += sign * get(0, i) * coFactor(0, i).determinant();\n sign *= -1;\n }\n return sum;\n }\n\n private Matrix coFactor(int row, int col) {\n List<List<Double>> mat = new ArrayList<>();\n for ( int i = 0 ; i < matrix.size() ; i++ ) {\n if ( i == row ) {\n continue;\n }\n List<Double> list = new ArrayList<>();\n for ( int j = 0 ; j < matrix.size() ; j++ ) {\n if ( j == col ) {\n continue;\n }\n list.add(get(i, j));\n }\n mat.add(list);\n }\n return new Matrix(mat);\n }\n\n private Matrix replaceColumn(List<Double> b, int column) {\n List<List<Double>> mat = new ArrayList<>();\n for ( int row = 0 ; row < matrix.size() ; row++ ) {\n List<Double> list = new ArrayList<>();\n for ( int col = 0 ; col < matrix.size() ; col++ ) {\n double value = get(row, col);\n if ( col == column ) {\n value = b.get(row);\n }\n list.add(value);\n }\n mat.add(list);\n }\n return new Matrix(mat);\n }\n\n private double get(int row, int col) {\n return matrix.get(row).get(col);\n }\n\n }\n\n}\n","language":"Java"},{"code":"def solve(r11; r31; r52; r54):\n range(1;r31 - 1) as $X\n | range(1; r31 - 1) as $Y\n | (($Y - $X) | select(. > 0)) as $Z\n | (r52 + $X) as $R41\n | (r52 + $Y) as $R42\n | select($R41 + $R42 == r31)\n | ($Y + r54) as $R43\n | (r54 + $Z) as $R44\n | ($R42 + $R43) as $R32\n | ($R43 + $R44) as $R33\n | (r31 + $R32) as $R21\n | ($R32 + $R33) as $R22\n | select($R21 + $R22 == r11)\n | [$X, $Y, $Z];\n\nsolve(151; 40; 11; 4),\n","language":"Jq"},{"code":"include \"rc-cramers-rule\";\ndef solve(top; mid; a; b):\n cramer(\n [ [7, 7],\n [2, 1]];\n [top - 4*(a+b), mid-2*a]);\n\nsolve(151; 40; 11; 4)\n","language":"Jq"},{"code":"function pascal(a::Integer, b::Integer, mid::Integer, top::Integer)\n yd = round((top - 4 * (a + b)) / 7)\n !isinteger(yd) && return 0, 0, 0\n y = Int(yd)\n x = mid - 2a - y\n return x, y, y - x\nend\n\nx, y, z = pascal(11, 4, 40, 151)\nif !iszero(x)\n println(\"Solution: x = $x, y = $y, z = $z.\")\nelse\n println(\"There is no solution.\")\nend\n","language":"Julia"},{"code":"// version 1.1.3\n\ndata class Solution(val x: Int, val y: Int, val z: Int)\n\nfun Double.isIntegral(tolerance: Double = 0.0) =\n (this - Math.floor(this)) <= tolerance || (Math.ceil(this) - this) <= tolerance\n\nfun pascal(a: Int, b: Int, mid: Int, top: Int): Solution {\n val yd = (top - 4 * (a + b)) / 7.0\n if (!yd.isIntegral(0.0001)) return Solution(0, 0, 0)\n val y = yd.toInt()\n val x = mid - 2 * a - y\n return Solution(x, y, y - x)\n}\n\nfun main(args: Array<String>) {\n val (x, y, z) = pascal(11, 4, 40, 151)\n if (x != 0)\n println(\"Solution is: x = $x, y = $y, z = $z\")\n else\n println(\"There is no solutuon\")\n}\n","language":"Kotlin"},{"code":"sys := {22 + x + y = 40, 78 + 5*y + z = 151, x + z = y}:\nsolve(sys, {x,y,z});\n","language":"Maple"},{"code":"b+c==a\nd+e==b\ne+f==c\ng+h==d\nh+i==e\ni+j==f\nl+X==g\nl+Y==h\nn+Y==i\nn+Z==j\nX+Z==Y\n","language":"Mathematica"},{"code":"a->151\nd->40\nl->11\nn->4\n","language":"Mathematica"},{"code":"eqs={a==b+c,d+e==b,e+f==c,g+h==d,h+i==e,i+j==f,l+X==g,l+Y==h,n+Y==i,n+Z==j,Y==X+Z};\nknowns={a->151,d->40,l->11,n->4};\nSolve[eqs/.knowns,{b,c,e,f,g,h,i,j,X,Y,Z}]\n","language":"Mathematica"},{"code":"{{b -> 81, c -> 70, e -> 41, f -> 29, g -> 16, h -> 24, i -> 17, j -> 12, X -> 5, Y -> 13, Z -> 8}}\n","language":"Mathematica"},{"code":"\t\t\t\t151\n\t\t\t81\t\t70\n\t\t40\t\t41\t\t29\n\t16\t\t24\t\t17\t\t12\n5\t\t11\t\t13\t\t4\t\t8\n","language":"Mathematica"},{"code":"triangle[n_, m_] := Nest[MovingMap[Total, #, 1] &, {x, 11, y, 4, z}, n - 1][[m]]\nSolve[{triangle[3, 1] == 40, triangle[5, 1] == 151, y == x + z}, {x, y, z}]\n","language":"Mathematica"},{"code":"{{x -> 5, y -> 13, z -> 8}}\n","language":"Mathematica"},{"code":"%Pascal's Triangle Puzzle. Nigel Galloway, February 17th., 2020\nint: N11=151; constraint N11=N21+N22;\nvar 1..N11: N21=N31+N32;\nvar 1..N11: N22=N32+N33;\nint: N31=40; constraint N31=N41+N42;\nvar 1..N11: N32=N42+N43;\nvar 1..N11: N33=N43+N44;\nvar 1..N11: N41=X+11;\nvar 1..N11: N42=Y+11;\nvar 1..N11: N43=Y+4;\nvar 1..N11: N44=Z+4;\nvar 1..N11: X;\nvar 1..N11: Y=X+Z;\nvar 1..N11: Z;\n","language":"MiniZinc"},{"code":"import strutils\n\ntype\n\n BlockValue = object\n known: int\n x, y, z: int\n\n Variables = tuple[x, y, z: int]\n\nfunc `+=`(left: var BlockValue; right: BlockValue) =\n ## Symbolically add one block to another.\n left.known += right.known\n left.x += right.x - right.z # Z is excluded as n(Y - X - Z) = 0.\n left.y += right.y + right.z\n\nproc toString(n: BlockValue; vars: Variables): string =\n ## Return the representation of the block value, when X, Y, Z are known.\n result = $(n.known + n.x * vars.x + n.y * vars.y + n.z * vars.z)\n\nproc Solve2x2(a11, a12, b1, a21, a22, b2: int): Variables =\n ## Solve a puzzle, supposing an integer solution exists.\n if a22 == 0:\n result.x = b2 div a21\n result.y = (b1 - a11 * result.x) div a12\n else:\n result.x = (b1 * a22 - b2 * a12) div (a11 * a22 - a21 * a12)\n result.y = (b1 - a11 * result.x) div a12\n result.z = result.y - result.x\n\nvar blocks : array[1..5, array[1..5, BlockValue]] # The lower triangle contains blocks.\n\n# The bottom blocks.\nblocks[5][1] = BlockValue(x: 1)\nblocks[5][2] = BlockValue(known: 11)\nblocks[5][3] = BlockValue(y: 1)\nblocks[5][4] = BlockValue(known: 4)\nblocks[5][5] = BlockValue(z: 1)\n\n# Upward run.\nfor row in countdown(4, 1):\n for column in 1..row:\n blocks[row][column] += blocks[row + 1][column]\n blocks[row][column] += blocks[row + 1][column + 1]\n\n# Now have known blocks 40=[3][1], 151=[1][1] and Y=X+Z to determine X,Y,Z.\nlet vars = Solve2x2(blocks[1][1].x,\n blocks[1][1].y,\n 151 - blocks[1][1].known,\n blocks[3][1].x,\n blocks[3][1].y,\n 40 - blocks[3][1].known)\n\n# Print the results.\nfor row in 1..5:\n var line = \"\"\n for column in 1..row:\n line.addSep(\" \")\n line.add toString(blocks[row][column], vars)\n echo line\n","language":"Nim"},{"code":"%% to compile : ozc -x <file.oz>\nfunctor\n\nimport\n System Application FD Search\ndefine\n\n proc{Quest Root Rules}\n\n proc{Limit Rc Ls}\n case Ls of nil then skip\n [] X|Xs then\n {Limit Rc Xs}\n case X of N#V then\n Rc.N =: V\n [] N1#N2#N3 then\n Rc.N1 =: Rc.N2 + Rc.N3\n end\n end\n end\n\n proc {Pyramid R}\n {FD.tuple solution 15 0#FD.sup R} %% non-negative integers domain\n %% 01 , pyramid format\n %% 02 03\n %% 04 05 06\n %% 07 08 09 10\n %% 11 12 13 14 15\n R.1 =: R.2 + R.3 %% constraints of Pyramid of numbers\n R.2 =: R.4 + R.5\n R.3 =: R.5 + R.6\n R.4 =: R.7 + R.8\n R.5 =: R.8 + R.9\n R.6 =: R.9 + R.10\n R.7 =: R.11 + R.12\n R.8 =: R.12 + R.13\n R.9 =: R.13 + R.14\n R.10 =: R.14 + R.15\n\n {Limit R Rules} %% additional constraints\n\n {FD.distribute ff R}\n end\n in\n {Search.base.one Pyramid Root} %% search for solution\n end\n\n local\n Root R\n in\n {Quest Root [1#151 4#40 12#11 14#4 13#11#15]} %% supply additional constraint rules\n if {Length Root} >= 1 then\n R = Root.1\n {For 1 15 1\n proc{$ I}\n if {Member I [1 3 6 10]} then\n {System.printInfo R.I#'\\n'}\n else\n {System.printInfo R.I#' '}\n end\n end\n }\n else\n {System.showInfo 'No solution found.'}\n end\n end\n\n {Application.exit 0}\nend\n","language":"Oz"},{"code":"Pascals_triangle_puzzle(topvalue=151,leftsidevalue=40,bottomvalue1=11,bottomvalue2=4) = {\ny=(topvalue-(4*(bottomvalue1+bottomvalue2)))/7;\nx=leftsidevalue-(y+2*bottomvalue1);\nz=y-x;\nprint(x\",\"y\",\"z); }\n","language":"PARI-GP"},{"code":"# set up triangle\nmy $rows = 5;\nmy @tri = map { [ map { {x=>0,z=>0,v=>0,rhs=>undef} } 1..$_ ] } 1..$rows;\n$tri[0][0]{rhs} = 151;\n$tri[2][0]{rhs} = 40;\n$tri[4][0]{x} = 1;\n$tri[4][1]{v} = 11;\n$tri[4][2]{x} = 1;\n$tri[4][2]{z} = 1;\n$tri[4][3]{v} = 4;\n$tri[4][4]{z} = 1;\n\n# aggregate from bottom to top\nfor my $row ( reverse 0..@tri-2 ) {\n for my $col ( 0..@{$tri[$row]}-1 ){\n $tri[$row][$col]{$_} = $tri[$row+1][$col]{$_}+$tri[$row+1][$col+1]{$_} for 'x','z','v';\n }\n}\n# find equations\nmy @eqn;\nfor my $row ( @tri ) {\n for my $col ( @$row ){\n push @eqn, [ $$col{x}, $$col{z}, $$col{rhs}-$$col{v} ] if defined $$col{rhs};\n }\n}\n# print equations\nprint \"Equations:\\n\";\nprint \" x + z = y\\n\";\nprintf \"%d x + %d z = %d\\n\", @$_ for @eqn;\n# solve\nmy $f = $eqn[0][1] / $eqn[1][1];\n$eqn[0][$_] -= $f * $eqn[1][$_] for 0..2;\n$f = $eqn[1][0] / $eqn[0][0];\n$eqn[1][$_] -= $f * $eqn[0][$_] for 0..2;\n# print solution\nprint \"Solution:\\n\";\nmy $x = $eqn[0][2]/$eqn[0][0];\nmy $z = $eqn[1][2]/$eqn[1][1];\nmy $y = $x+$z;\nprintf \"x=%d, y=%d, z=%d\\n\", $x, $y, $z;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Pascal_triangle_Puzzle.exw\n -- =======================================\n --\n -- I approached this with a view to solving general pyramid puzzles, not just the one given.\n --\n -- This little ditty converts the pyramid to rules quite nicely, then uses a modified copy\n -- of solveN() from [[Solving_coin_problems#Phix]] to solve those simultaneous equations.\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pyramid</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">151</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"x\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"y\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"z\"</span><span style=\"color: #0000FF;\">}}</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rules</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- each cell in the pyramid is either an integer final value or an equation.\n -- initially the equations are strings, we substitute all with triplets of\n -- the form {k,x,z} ie k+l*x+m*z, and known values < last row become rules.</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">object</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">],</span> <span style=\"color: #000000;\">equ</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"x\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- ie 0 + one x</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"y\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- ie 0 + one x plus one z</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"z\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- ie 0 + one z</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000080;font-style:italic;\">-- examples: x+11 is {0,1,0}+{11,0,0} -> {11,1,0},\n -- 11+y is {11,0,0}+{0,1,1} -> {11,1,1},\n -- 40=\"\"+\"\" is {40,0,0}={22,2,1} ==> {18,2,1}</span>\n <span style=\"color: #000000;\">equ</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"\"</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">equ</span>\n <span style=\"color: #008080;\">else</span> <span style=\"color: #000000;\">prc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">equ</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">prc</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]-</span><span style=\"color: #000000;\">equ</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">rules</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">equ</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">prc</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #7060A8;\">ppOpt</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #004600;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_StrFmt</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">pp_IntCh</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"equations\"</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"rules\"</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- {18,2,1} === 18=2x+z\n -- {73,5,6} === 73=5x+6z</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"=====\\n\"</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">)==</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- more work needed!?\n\n -- modified copy of solveN() from Solving_coin_problems.exw as promised, a\n -- bit of a sledgehammer to crack a peanut is the phrase you are looking for:</span>\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">solveN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- Based on https://mathcs.clarku.edu/~djoyce/ma105/simultaneous.html\n -- aka the ancient Chinese Jiuzhang suanshu ~100 B.C. (!!)\n --\n -- Example (not related to the task problem):\n -- rules = <nowiki>{{</nowiki>18,1,1},{38,1,5<nowiki>}}</nowiki>, ie 18==x+y, 38==x+5y\n -- ==> {13,5}, ie x=13, y=5\n --\n -- In the elimination phase, both x have multipliers of 1, ie both rii and rij are 1,\n -- so we can ignore the two sq_mul and just do [sq_sub] (38=x+5y)-(18=x+y)==>(20=4y).\n -- Obviously therefore y is 5 and substituting backwards x is 13.\n --\n -- Example2 (taken from the task problem):\n -- rules = <nowiki>{{</nowiki>18,2,1},{73,5,6<nowiki>}}</nowiki>, ie 18==2x+z, 73==5x+6z\n -- ==> <nowiki>{{</nowiki>18,2,1},{56,0,7<nowiki>}}</nowiki>, ie rules[2]:=rules[2]*2-rules[1]*5 (eliminate)\n -- ==> <nowiki>{{</nowiki>18,2,1},8}, ie rules[2]:=56/7, aka z:=8 (substitute)\n -- ==> <nowiki>{{</nowiki>10,2,0},8}, ie rules[1]-=1z (substitute)\n -- ==> {5,8}, ie rules[1]:=10/2, aka x:=5 (substitute)\n -- ==> {5,8}, ie x=5, z=8\n -- </span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rj</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">rii</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">rji</span>\n <span style=\"color: #000000;\">rules</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- successively eliminate (grow lower left triangle of 0s)</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rii</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (see note below)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">rj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">rji</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rji</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">rj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sq_sub</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rii</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">sq_mul</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rji</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">assert</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]==</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (job done)</span>\n <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rj</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">l</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">-- then substitute each backwards</span>\n <span style=\"color: #000000;\">ri</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">rii</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]/</span><span style=\"color: #000000;\">ri</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #000080;font-style:italic;\">-- (all else should be 0)</span>\n <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rii</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">rj</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">rji</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">rji</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">-=</span> <span style=\"color: #000000;\">rji</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">rii</span>\n <span style=\"color: #000000;\">rj</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">rj</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">rules</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- Obviously these next two lines directly embody knowledge from the task, and\n -- would need changing for an even slightly different version of the problem:</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">solveN</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rules</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">z</span> <span style=\"color: #000080;font-style:italic;\">-- (as per task desc)</span>\n\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"x=%d, y=%d, z=%d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">z</span><span style=\"color: #0000FF;\">})</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- finally evaluate all the equations and print it.</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">z</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pyramid</span><span style=\"color: #0000FF;\">)</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">solveN</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">18</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">73</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}})</span> <span style=\"color: #000080;font-style:italic;\">-- -- {5,13,8}</span>\n\n <span style=\"color: #7060A8;\">ppOpt</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #004600;\">pp_Nest</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000080;font-style:italic;\">-- Or, hand-coding 11 simultaneous equations for 11 unknowns:\n -- (be warned I had to reorder a bit to avoid rii==0 mishaps,\n -- perhaps solveN() should find or even sort rules somehow)\n --sequence pyramid = <nowiki>{{</nowiki>151},\n -- {\"a\",\"b\"},\n -- {40,\"c\",\"d\"},\n -- {\"e\",\"f\",\"g\",\"h\"},\n -- {\"x\", 11,\"y\", 4,\"z\"<nowiki>}}</nowiki>\n -- a b c d e f g h x y z</span>\n <span style=\"color: #7060A8;\">pp</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">solveN</span><span style=\"color: #0000FF;\">({{</span><span style=\"color: #000000;\">151</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- a+b=151</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- 40+c=a</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- c+d=b</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- g+h=d</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- e+f=40</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- f+g=c</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- x+11=e</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- y+4=g</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- 11+y=f</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- 4+z=h</span>\n <span style=\"color: #0000FF;\">{</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #000080;font-style:italic;\">-- x+z=y\n -- })) -- {81,70,41,29,16,24,17,12,5,13,8}</span>\n <span style=\"color: #0000FF;\">})[-</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #000080;font-style:italic;\">-- {5,13,8}</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">Y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">151</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">))/</span><span style=\"color: #000000;\">7</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">X</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">40</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">Y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">Z</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">Y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">X</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"Two-liner: x=%d, y=%d, z=%d\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">X</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">Z</span><span style=\"color: #0000FF;\">})</span>\n<!--\n","language":"Phix"},{"code":"import cp.\n\ngo =>\n puzzle(T, X, Y,Z),\n foreach(TT in T)\n println(TT)\n end,\n println([x=X,y=Y,z=Z]),\n nl,\n fail, % are there any more solutions?\n nl.\n\n% Port of the Prolog solution\npuzzle(Ts, X, Y, Z) :-\n Ts = [ [151],\n [_, _],\n [40, _, _],\n [_, _, _, _],\n [X, 11, Y, 4, Z]],\n Y #= X + Z,\n triangle(Ts),\n Vs = vars(Ts),\n Vs :: 0..10000,\n solve(Vs).\n\ntriangle([T|Ts]) :-\n ( Ts = [N|_] -> triangle_(T, N), triangle(Ts) ; true ).\n\ntriangle_([], _).\ntriangle_([T|Ts],[A,B|Rest]) :-\n T #= A + B, triangle_(Ts, [B|Rest]).\n","language":"Picat"},{"code":"import cp.\n\npuzzle2 =>\n N = 5, % number of rows\n Len = (N*(N+1)) div 2, % number of entries\n\n % The triangle numbers for 1..N\n T = [I*(I+1) div 2 : I in 1..N],\n\n % The index of first number to use in addition\n % create the indices of the numbers to add,\n % i.e. Adds[I] + Adds[I+1]\n Adds = new_list(T[N-1]),\n Adds[1] := 2,\n foreach(I in 2..T[N-1])\n % \"jump\" of 2 when i-1 is a triangle number\n if membchk(I-1,T) then\n Adds[I] := Adds[I-1] + 2\n else\n Adds[I] := Adds[I-1] + 1\n end\n end,\n\n % the pyramid\n MaxVal = 10_000,\n L = new_list(Len),\n L :: 1..MaxVal,\n\n % The clues.\n L = [ 151,\n _, _,\n 40, _, _,\n _, _,_ , _ ,\n X, 11, Y, 4, Z\n ],\n\n % The sums\n foreach(I in 1..T[N-1])\n L[I] #= L[Adds[I]]+L[Adds[I]+1]\n end,\n\n % The extra constraint\n Y #= X + Z,\n\n solve(L),\n println([x=X,y=Y,z=Z]),\n fail, % check if there is another solution\n nl.\n","language":"Picat"},{"code":"import cp.\n\npuzzle3 =>\n % 1\n % 2 3\n % 4 5 6\n % 7 8 9 10\n %11 12 13 14 15\n\n X = new_list(15),\n X :: 0..10_000,\n X[1] #= X[2]+X[3],\n X[2] #= X[4]+X[5],\n X[3] #= X[5]+X[6],\n X[4] #= X[7]+X[8],\n X[5] #= X[8]+X[9],\n X[6] #= X[9]+X[10],\n X[7] #= X[11]+X[12],\n X[8] #= X[12]+X[13],\n X[9] #= X[13]+X[14],\n X[10] #= X[14]+X[15],\n X[13] #= X[11] + X[15], % Y=X+Z,\n\n % The hints\n X[1] #= 151,\n X[4] #= 40,\n X[12] #= 11,\n X[14] #= 4,\n\n solve(X),\n println([x=X[11],y=X[13],z=X[15]]),\n fail,\n nl.\n","language":"Picat"},{"code":"(be number (@N @Max)\n (^ @C (box 0))\n (repeat)\n (or\n ((^ @ (>= (val (-> @C)) (-> @Max))) T (fail))\n ((^ @N (inc (-> @C)))) ) )\n\n(be + (@A @B @Sum)\n (^ @ (-> @A))\n (^ @ (-> @B))\n (^ @Sum (+ (-> @A) (-> @B))) )\n\n(be + (@A @B @Sum)\n (^ @ (-> @A))\n (^ @ (-> @Sum))\n (^ @B (- (-> @Sum) (-> @A)))\n T\n (^ @ (ge0 (-> @B))) )\n\n(be + (@A @B @Sum)\n (number @A @Sum)\n (^ @B (- (-> @Sum) (-> @A))) )\n\n#{\n 151\n A B\n 40 C D\n E F G H\n X 11 Y 4 Z\n}#\n\n(be puzzle (@X @Y @Z)\n (+ @A @B 151)\n (+ 40 @C @A)\n (+ @C @D @B)\n (+ @E @F 40)\n (+ @F @G @C)\n (+ @G @H @D)\n (+ @X 11 @E)\n (+ 11 @Y @F)\n (+ @Y 4 @G)\n (+ 4 @Z @H)\n (+ @X @Z @Y)\n T )\n","language":"PicoLisp"},{"code":":- use_module(library(clpfd)).\n\npuzzle(Ts, X, Y, Z) :-\n Ts = [ [151],\n [_, _],\n [40, _, _],\n [_, _, _, _],\n [X, 11, Y, 4, Z]],\n Y #= X + Z, triangle(Ts), append(Ts, Vs), Vs ins 0..sup, label(Vs).\n\ntriangle([T|Ts]) :- ( Ts = [N|_] -> triangle_(T, N), triangle(Ts) ; true ).\n\ntriangle_([], _).\ntriangle_([T|Ts], [A,B|Rest]) :- T #= A + B, triangle_(Ts, [B|Rest]).\n\n% ?- puzzle(_,X,Y,Z).\n% X = 5,\n% Y = 13,\n% Z = 8 ;\n","language":"Prolog"},{"code":"; Known;\n; A.\n; [ 151]\n; [a ][b ]\n; [40][c ][d ]\n; [e ][f ][g ][h ]\n; [ X][11][ Y][ 4][ Z]\n;\n; B.\n; Y = X + Z\n\nProcedure.i SolveForZ(x)\n Protected a,b,c,d,e,f,g,h,z\n For z=0 To 20\n e=x+11: f=11+(x+z): g=(x+z)+4: h=4+z\n If e+f=40\n c=f+g : d=g+h: a=40+c: b=c+d\n If a+b=151\n ProcedureReturn z\n EndIf\n EndIf\n Next z\n ProcedureReturn -1\nEndProcedure\n\nDefine x=-1, z=0, title$=\"Pascal's triangle/Puzzle in PureBasic\"\nRepeat\n x+1\n z=SolveForZ(x)\nUntil z>=0\nMessageRequester(title$,\"X=\"+Str(x)+#CRLF$+\"Y=\"+Str(x+z)+#CRLF$+\"Z=\"+Str(z))\n","language":"PureBasic"},{"code":"# Pyramid solver\n# [151]\n# [ ] [ ]\n# [ 40] [ ] [ ]\n# [ ] [ ] [ ] [ ]\n#[ X ] [ 11] [ Y ] [ 4 ] [ Z ]\n# X -Y + Z = 0\n\ndef combine( snl, snr ):\n\n\tcl = {}\n\tif isinstance(snl, int):\n\t\tcl['1'] = snl\n\telif isinstance(snl, string):\n\t\tcl[snl] = 1\n\telse:\n\t\tcl.update( snl)\n\n\tif isinstance(snr, int):\n\t\tn = cl.get('1', 0)\n\t\tcl['1'] = n + snr\n\telif isinstance(snr, string):\n\t\tn = cl.get(snr, 0)\n\t\tcl[snr] = n + 1\n\telse:\n\t\tfor k,v in snr.items():\n\t\t\tn = cl.get(k, 0)\n\t\t\tcl[k] = n+v\n\treturn cl\n\n\ndef constrain(nsum, vn ):\n\tnn = {}\n\tnn.update(vn)\n\tn = nn.get('1', 0)\n\tnn['1'] = n - nsum\n\treturn nn\n\ndef makeMatrix( constraints ):\n\tvmap = set()\n\tfor c in constraints:\n\t\tvmap.update( c.keys())\n\tvmap.remove('1')\n\tnvars = len(vmap)\n\tvmap = sorted(vmap)\t\t# sort here so output is in sorted order\n\tmtx = []\n\tfor c in constraints:\n\t\trow = []\n\t\tfor vv in vmap:\n\t\t\trow.append(float(c.get(vv, 0)))\n\t\trow.append(-float(c.get('1',0)))\n\t\tmtx.append(row)\n\t\n\tif len(constraints) == nvars:\n\t\tprint 'System appears solvable'\n\telif len(constraints) < nvars:\n\t\tprint 'System is not solvable - needs more constraints.'\n\treturn mtx, vmap\n\n\ndef SolvePyramid( vl, cnstr ):\n\n\tvl.reverse()\n\tconstraints = [cnstr]\n\tlvls = len(vl)\n\tfor lvln in range(1,lvls):\n\t\tlvd = vl[lvln]\n\t\tfor k in range(lvls - lvln):\n\t\t\tsn = lvd[k]\n\t\t\tll = vl[lvln-1]\n\t\t\tvn = combine(ll[k], ll[k+1])\n\t\t\tif sn is None:\n\t\t\t\tlvd[k] = vn\n\t\t\telse:\n\t\t\t\tconstraints.append(constrain( sn, vn ))\n\n\tprint 'Constraint Equations:'\n\tfor cstr in constraints:\n\t\tfset = ('%d*%s'%(v,k) for k,v in cstr.items() )\n\t\tprint ' + '.join(fset), ' = 0'\n\n\tmtx,vmap = makeMatrix(constraints)\n\n\tMtxSolve(mtx)\n\n\td = len(vmap)\n\tfor j in range(d):\n\t\tprint vmap[j],'=', mtx[j][d]\n\n\ndef MtxSolve(mtx):\n\t# Simple Matrix solver...\n\n\tmDim = len(mtx)\t\t\t# dimension---\n\tfor j in range(mDim):\n\t\trw0= mtx[j]\n\t\tf = 1.0/rw0[j]\n\t\tfor k in range(j, mDim+1):\n\t\t\trw0[k] *= f\n\t\t\n\t\tfor l in range(1+j,mDim):\n\t\t\trwl = mtx[l]\n\t\t\tf = -rwl[j]\n\t\t\tfor k in range(j, mDim+1):\n\t\t\t\trwl[k] += f * rw0[k]\n\n\t# backsolve part ---\n\tfor j1 in range(1,mDim):\n\t\tj = mDim - j1\n\t\trw0= mtx[j]\n\t\tfor l in range(0, j):\n\t\t\trwl = mtx[l]\n\t\t\tf = -rwl[j]\n\t\t\trwl[j] += f * rw0[j]\n\t\t\trwl[mDim] += f * rw0[mDim]\n\n\treturn mtx\n\n\np = [ [151], [None,None], [40,None,None], [None,None,None,None], ['X', 11, 'Y', 4, 'Z'] ]\naddlConstraint = { 'X':1, 'Y':-1, 'Z':1, '1':0 }\nSolvePyramid( p, addlConstraint)\n","language":"Python"},{"code":"from csp import Problem\n\np = Problem()\npvars = \"R2 R3 R5 R6 R7 R8 R9 R10 X Y Z\".split()\n# 0-151 is the possible finite range of the variables\np.addvars(pvars, xrange(152))\np.addrule(\"R7 == X + 11\")\np.addrule(\"R8 == Y + 11\")\np.addrule(\"R9 == Y + 4\")\np.addrule(\"R10 == Z + 4\")\np.addrule(\"R7 + R8 == 40\")\np.addrule(\"R5 == R8 + R9\")\np.addrule(\"R6 == R9 + R10\")\np.addrule(\"R2 == 40 + R5\")\np.addrule(\"R3 == R5 + R6\")\np.addrule(\"R2 + R3 == 151\")\np.addrule(\"Y == X + Z\")\nfor sol in p.xsolutions():\n print [sol[k] for k in \"XYZ\"]\n","language":"Python"},{"code":"#lang racket/base\n(require racket/list)\n\n(struct cell (v x z) #:transparent)\n\n(define (cell-add cx cy)\n (cell (+ (cell-v cx) (cell-v cy))\n (+ (cell-x cx) (cell-x cy))\n (+ (cell-z cx) (cell-z cy))))\n\n(define (cell-sub cx cy)\n (cell (- (cell-v cx) (cell-v cy))\n (- (cell-x cx) (cell-x cy))\n (- (cell-z cx) (cell-z cy))))\n","language":"Racket"},{"code":"(define (row-above row) (map cell-add (drop row 1) (drop-right row 1)))\n\n(define row0 (list (cell 0 1 0) (cell 11 0 0) (cell 0 1 1) (cell 4 0 0) (cell 0 0 1)))\n(define row1 (row-above row0))\n(define row2 (row-above row1))\n(define row3 (row-above row2))\n(define row4 (row-above row3))\n","language":"Racket"},{"code":"(define eqn40 (cell-sub (car row4) (cell 151 0 0)))\n(define eqn20 (cell-sub (car row2) (cell 40 0 0)))\n","language":"Racket"},{"code":"(define (det2 eqnx eqny get-one get-oth)\n (- (* (get-one eqnx) (get-oth eqny)) (* (get-one eqny) (get-oth eqnx))))\n\n(define (cramer2 eqnx eqny get-val get-unk get-oth)\n (/ (det2 eqnx eqny get-val get-oth)\n (det2 eqnx eqny get-unk get-oth)))\n","language":"Racket"},{"code":"(define x (- (cramer2 eqn20 eqn40 cell-v cell-x cell-z)))\n(define z (- (cramer2 eqn20 eqn40 cell-v cell-z cell-x)))\n\n(displayln (list \"X\" x))\n(displayln (list \"Y\" (+ x z)))\n(displayln (list \"Z\" z))\n","language":"Racket"},{"code":"# set up triangle\nmy $rows = 5;\nmy @tri = (1..$rows).map: { [ { x => 0, z => 0, v => 0, rhs => Nil } xx $_ ] }\n@tri[0][0]<rhs> = 151;\n@tri[2][0]<rhs> = 40;\n@tri[4][0]<x> = 1;\n@tri[4][1]<v> = 11;\n@tri[4][2]<x> = 1;\n@tri[4][2]<z> = 1;\n@tri[4][3]<v> = 4;\n@tri[4][4]<z> = 1;\n\n# aggregate from bottom to top\nfor @tri - 2 ... 0 -> $row {\n for 0 ..^ @tri[$row] -> $col {\n @tri[$row][$col]{$_} = @tri[$row+1][$col]{$_} + @tri[$row+1][$col+1]{$_} for 'x','z','v';\n }\n}\n\n# find equations\nmy @eqn = gather for @tri -> $row {\n for @$row -> $cell {\n take [ $cell<x>, $cell<z>, $cell<rhs> - $cell<v> ] if defined $cell<rhs>;\n }\n}\n\n# print equations\nsay \"Equations:\";\nsay \" x + z = y\";\nfor @eqn -> [$x,$z,$y] { say \"$x x + $z z = $y\" }\n\n# solve\nmy $f = @eqn[0][1] / @eqn[1][1];\n@eqn[0][$_] -= $f * @eqn[1][$_] for 0..2;\n$f = @eqn[1][0] / @eqn[0][0];\n@eqn[1][$_] -= $f * @eqn[0][$_] for 0..2;\n\n# print solution\nsay \"Solution:\";\nmy $x = @eqn[0][2] / @eqn[0][0];\nmy $z = @eqn[1][2] / @eqn[1][1];\nmy $y = $x + $z;\nsay \"x=$x, y=$y, z=$z\";\n","language":"Raku"},{"code":"/*REXX program solves a (Pascal's) \"Pyramid of Numbers\" puzzle given four values. */\n /* ╔══════════════════════════════════════════════════╗\n ║ answer ║\n ║ / ║\n ║ mid / ║\n ║ \\ 151 ║\n ║ \\ ααα ααα ║\n ║ 40 ααα ααα ║\n ║ ααα ααα ααα ααα ║\n ║ x 11 y 4 z ║\n ║ / \\ ║\n ║ find: / \\ ║\n ║ x y z b d ║\n ╚══════════════════════════════════════════════════╝ */\n do #=2; _= sourceLine(#); n= pos('_', _) /* [↓] this DO loop shows (above) box.*/\n if n\\==0 then leave; say _ /*only display up to the above line. */\n end /*#*/; say /* [↑] this is a way for in─line doc. */\nparse arg b d mid answer . /*obtain optional variables from the CL*/\nif b=='' | b==\",\" then b= 11 /*Not specified? Then use the default.*/\nif d=='' | d==\",\" then d= 4 /* \" \" \" \" \" \" */\nif mid='' | mid==\",\" then mid= 40 /* \" \" \" \" \" \" */\nif answer='' | answer==\",\" then answer= 151 /* \" \" \" \" \" \" */\n big= answer - 4*b - 4*d /*calculate BIG number less constants*/\n do x=-big to big\n do y=-big to big\n if x+y\\==mid - 2*b then iterate /*40 = x+2B+Y ──or── 40-2*11 = x+y */\n do z=-big to big\n if z \\== y - x then iterate /*Z has to equal Y-X (Y= X+Z) */\n if x+y*6+z==big then say right('x =', n) x right(\"y =\",n) y right('z =',n) z\n end /*z*/\n end /*y*/\n end /*x*/ /*stick a fork in it, we're all done. */\n","language":"REXX"},{"code":"require 'rref'\n\npyramid = [\n [ 151],\n [nil,nil],\n [40,nil,nil],\n [nil,nil,nil,nil],\n [\"x\", 11,\"y\", 4,\"z\"]\n]\npyramid.each{|row| p row}\n\nequations = [[1,-1,1,0]] # y = x + z\n\ndef parse_equation(str)\n eqn = [0] * 4\n lhs, rhs = str.split(\"=\")\n eqn[3] = rhs.to_i\n for term in lhs.split(\"+\")\n case term\n when \"x\" then eqn[0] += 1\n when \"y\" then eqn[1] += 1\n when \"z\" then eqn[2] += 1\n else eqn[3] -= term.to_i\n end\n end\n eqn\nend\n\n-2.downto(-5) do |row|\n pyramid[row].each_index do |col|\n val = pyramid[row][col]\n sum = \"%s+%s\" % [pyramid[row+1][col], pyramid[row+1][col+1]]\n if val.nil?\n pyramid[row][col] = sum\n else\n equations << parse_equation(sum + \"=#{val}\")\n end\n end\nend\n\nreduced = convert_to(reduced_row_echelon_form(equations), :to_i)\n\nfor eqn in reduced\n if eqn[0] + eqn[1] + eqn[2] != 1\n fail \"no unique solution! #{equations.inspect} ==> #{reduced.inspect}\"\n elsif eqn[0] == 1 then x = eqn[3]\n elsif eqn[1] == 1 then y = eqn[3]\n elsif eqn[2] == 1 then z = eqn[3]\n end\nend\n\nputs\nputs \"x == #{x}\"\nputs \"y == #{y}\"\nputs \"z == #{z}\"\n\nanswer = []\nfor row in pyramid\n answer << row.collect {|cell| eval cell.to_s}\nend\nputs\nanswer.each{|row| p row}\n","language":"Ruby"},{"code":"object PascalTriangle extends App {\n\n val (x, y, z) = pascal(11, 4, 40, 151)\n\n def pascal(a: Int, b: Int, mid: Int, top: Int): (Int, Int, Int) = {\n val y = (top - 4 * (a + b)) / 7\n val x = mid - 2 * a - y\n (x, y, y - x)\n }\n\n println(if (x != 0) s\"Solution is: x = $x, y = $y, z = $z\" else \"There is no solution.\")\n}\n","language":"Scala"},{"code":"# set up triangle\nvar rows = 5\nvar tri = rows.of {|i| (i+1).of { Hash(x => 0, z => 0, v => 0, rhs => nil) } }\ntri[0][0]{:rhs} = 151\ntri[2][0]{:rhs} = 40\ntri[4][0]{:x} = 1\ntri[4][1]{:v} = 11\ntri[4][2]{:x} = 1\ntri[4][2]{:z} = 1\ntri[4][3]{:v} = 4\ntri[4][4]{:z} = 1\n \n# aggregate from bottom to top\nfor row in (tri.len ^.. 1) {\n for col in (^tri[row-1]) {\n [:x, :z, :v].each { |key|\n tri[row-1][col]{key} = (tri[row][col]{key} + tri[row][col+1]{key})\n }\n }\n}\n \n# find equations\nvar eqn = gather {\n for r in tri {\n for c in r {\n take([c{:x}, c{:z}, c{:rhs} - c{:v}]) if defined(c{:rhs})\n }\n }\n}\n \n# print equations\nsay \"Equations:\"\nsay \" x + z = y\"\nfor x,z,y in eqn { say \"#{x}x + #{z}z = #{y}\" }\n \n# solve\nvar f = (eqn[0][1] / eqn[1][1])\n{|i| eqn[0][i] -= (f * eqn[1][i]) } << ^3\nf = (eqn[1][0] / eqn[0][0])\n{|i| eqn[1][i] -= (f * eqn[0][i]) } << ^3\n \n# print solution\nsay \"Solution:\"\nvar x = (eqn[0][2] / eqn[0][0])\nvar z = (eqn[1][2] / eqn[1][1])\nvar y = (x + z)\nsay \"x=#{x}, y=#{y}, z=#{z}\"\n","language":"Sidef"},{"code":"program main;\n\n class Triangle;\n rand bit [7:0] a,b,c,d,e,f,g,h,X,Y,Z;\n\n function new();\n randomize;\n $display(\" [%0d]\", 151);\n $display(\" [%0d][%0d]\", a, b);\n $display(\" [%0d][%0d][%0d]\", 40,c,d);\n $display(\" [%0d][%0d][%0d][%0d]\", e,f,g,h);\n $display(\" [%0d][%0d][%0d][%0d][%0d]\",X,11,Y,4,Z);\n endfunction\n\n constraint structure {\n 151 == a + b;\n\n a == 40 + c;\n b == c + d;\n\n 40 == e + f;\n c == f + g;\n d == g + h;\n\n e == X + 11;\n f == 11 + Y;\n g == Y + 4;\n h == 4 + Z;\n };\n\n constraint extra {\n Y == X + Z;\n };\n\n endclass\n\n Triangle answer = new;\nendprogram\n","language":"SystemVerilog"},{"code":"package require Tcl 8.5\nnamespace path ::tcl::mathop\n\nset pyramid {\n {151.0 \"\" \"\" \"\" \"\"}\n {\"\" \"\" \"\" \"\" \"\"}\n {40.0 \"\" \"\" \"\" \"\"}\n {\"\" \"\" \"\" \"\" \"\"}\n {x 11.0 y 4.0 z}\n}\n\nset equations {{1 -1 1 0}}\n\nproc simplify {terms val} {\n set vars {0 0 0}\n set x 0\n set y 1\n set z 2\n foreach term $terms {\n switch -exact -- $term {\n x - y - z {\n lset vars [set $term] [+ 1 [lindex $vars [set $term]]]\n }\n default {\n set val [- $val $term]\n }\n }\n }\n return [concat $vars $val]\n}\n\nfor {set row [+ [llength $pyramid] -2]} {$row >= 0} {incr row -1} {\n for {set cell 0} {$cell <= $row} {incr cell } {\n\tset sum [concat [lindex $pyramid [+ 1 $row] $cell] [lindex $pyramid [+ 1 $row] [+ 1 $cell]]]\n\tif {[set val [lindex $pyramid $row $cell]] ne \"\"} {\n lappend equations [simplify $sum $val]\n\t} else {\n lset pyramid $row $cell $sum\n }\n }\n}\n\nset solution [toRREF $equations]\nforeach row $solution {\n lassign $row a b c d\n if {$a + $b + $c > 1} {\n error \"problem does not have a unique solution\"\n }\n if {$a} {set x $d}\n if {$b} {set y $d}\n if {$c} {set z $d}\n}\nputs \"x=$x\"\nputs \"y=$y\"\nputs \"z=$z\"\n\nforeach row $pyramid {\n set newrow {}\n foreach cell $row {\n if {$cell eq \"\"} {\n lappend newrow \"\"\n } else {\n lappend newrow [expr [join [string map [list x $x y $y z $z] $cell] +]]\n }\n }\n lappend solved $newrow\n}\nprint_matrix $solved\n","language":"Tcl"},{"code":"import \"./fmt\" for Fmt\n\nvar isIntegral = Fn.new { |x, tol| x.fraction.abs <= tol }\n\nvar pascal = Fn.new { |a, b, mid, top|\n var yd = (top - 4 * (a + b)) / 7\n if (!isIntegral.call(yd, 0.0001)) return [0, 0, 0]\n var y = yd.truncate\n var x = mid - 2*a - y\n return [x, y, y - x]\n}\n\nvar sol = pascal.call(11, 4, 40, 151)\nif (sol[0] != 0) {\n Fmt.print(\"Solution is: x = $d, y = $d, z = $d\", sol[0], sol[1], sol[2])\n} else {\n System.print(\"There is no solution\")\n}\n","language":"Wren"},{"code":"proc Print; int N, A, B, C, D, E;\nint I, P;\ndef Tab = $09;\n[P:= @A; \\point to first number\nfor I:= N to 5-1 do ChOut(0, Tab);\nfor I:= 0 to N-1 do\n [IntOut(0, P(I)); ChOut(0, Tab); ChOut(0, Tab)];\nCrLf(0);\n];\n\nint N, P, Q, R, S, T, U, V, W, X, Y, Z; \\ 151\n[for X:= 0 to 40-11 do \\ N P\n for Z:= 0 to 151-4 do \\ Q R S\n [Y:= X+Z; \\ T U V W\n T:= X+11; \\X 11 Y 4 Z\n U:= 11+Y;\n V:= Y+4;\n W:= 4+Z;\n if T+U = 40 then\n [R:= U+V;\n S:= V+W;\n N:= 40+R;\n P:= R+S;\n if N+P = 151 then\n [Print(1, 151);\n Print(2, N, P);\n Print(3, 40, R, S);\n Print(4, T, U, V, W);\n Print(5, X, 11, Y, 4, Z);\n exit;\n ];\n ];\n ];\n]\n","language":"XPL0"},{"code":"# Pyramid solver\n# [151]\n# [ ] [ ]\n# [ 40] [ ] [ ]\n# [ ] [ ] [ ] [ ]\n#[ X ] [ 11] [ Y ] [ 4 ] [ Z ]\n# Known: X - Y + Z = 0\n\np:=T( L(151), L(Void,Void), L(40,Void,Void), L(Void,Void,Void,Void),\n L(\"X\", 11, \"Y\", 4, \"Z\") );\naddlConstraint:=Dictionary( \"X\",1, \"Y\",-1, \"Z\",1, \"1\",0 );\nsolvePyramid(p, addlConstraint);\n","language":"Zkl"},{"code":"fcn solvePyramid([List]vl,[Dictionary]cnstr){ //ListOfLists,Hash-->zip\n vl=vl.reverse();\n constraints:=L(cnstr);\n lvls:=vl.len();\n foreach lvln in ([1..lvls-1]){\n lvd:=vl[lvln];\n foreach k in (lvls-lvln){\n sn:=lvd[k];\n\t ll:=vl[lvln-1];\n\t vn:=combine(ll[k], ll[k+1]);\n\t if(Void==sn) lvd[k]=vn;\n\t else constraints.append(constrainK(sn,vn));\n }\n }\n println(\"Constraint Equations:\");\n constraints.pump(Console.println,fcn(hash){\n hash.pump(List,fcn([(k,v)]){\"%d*%s\".fmt(v,k)}).concat(\" + \") + \" = 0\"\n });\n\n mtx,vmap:=makeMatrix(constraints);\n mtxSolve(mtx);\n\n d:=vmap.len();\n foreach j in (d){ println(vmap[j],\" = \", mtx[j][d]); }\n}\n\nfcn [mixin=Dictionary] constrainK([Int]nsum,[Dictionary]vn){ //-->new hash of old hash, sum K\n nn:=vn.copy(); nn[\"1\"]=nn.find(\"1\",0) - nsum;\n return(nn.makeReadOnly());\n}\n\nfcn combine(snl,snr){ //Int|String|Hash *2 --> new Hash\n cl:=Dictionary();\n if(snl.isInstanceOf(Int)) cl[\"1\"]=snl;\n else if(snl.isInstanceOf(String)) cl[snl]=1;\n else\t\t\t\t cl =snl.copy();\n\n if(snr.isInstanceOf(Int)) cl[\"1\"]=cl.find(\"1\",0) + snr;\n else if(snr.isInstanceOf(String)) cl[snr]=cl.find(snr,0) + 1;\n else{ foreach k,v in (snr){ \t cl[k] =cl.find(k,0) + v; } }\n return(cl.makeReadOnly())\n}\n\n //-->(listMatrix(row(X,Y,Z,c),row...),List(\"X\",\"Y\",\"Z\"))\nfcn makeMatrix([Dictionary]constraints){\n vmap:=Dictionary();// create a sorted list of the variable names in constraints\n foreach c in (constraints){ vmap.extend(c) } // no duplicate names\n vmap.del(\"1\"); vmap=vmap.keys.sort(); # sort here so output is in sorted order\n\n mtx:=constraints.pump(List,'wrap(c){ // create list of [writeable] rows\n vmap.pump(List, c.find.fp1(0),\"toFloat\").copy()\n .append(-c.find(\"1\",0).toFloat())\n }).copy();\n\n nvars:=vmap.len();\n if(constraints.len()==nvars) println(\"System appears solvable\");\n else if(constraints.len()<nvars)\n println(\"System is not solvable - needs more constraints.\");\n return(mtx,vmap);\n}\n\nfcn mtxSolve([List]mtx){ //munge mtx\t# Simple Matrix solver...\n mDim:=mtx.len();\t\t\t# num rows\n foreach j in (mDim){\n rw0:=mtx[j];\n f:=1.0/rw0[j];\n foreach k in ([j..mDim]){ rw0[k]=rw0[k]*f }\n foreach l in ([j+1..mDim-1]){\n rwl:=mtx[l]; f:=-rwl[j];\n\t foreach k in ([j..mDim]){ rwl[k]+=f*rw0[k] }\n }\n }\n # backsolve part ---\n foreach j1 in ([1..mDim-1]){\n j:=mDim - j1; rw0:=mtx[j];\n foreach l in (j){\n\t rwl:=mtx[l]; f:=-rwl[j];\n\t rwl[j] +=f*rw0[j];\n\t rwl[mDim]+=f*rw0[mDim];\n }\n }\n return(mtx);\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pascal's_triangle/Puzzle\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"This puzzle involves a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pascals Triangle], also known as a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pyramid of Numbers].\\n<pre>\\n [ 151]\\n [ ][ ]\\n [40][ ][ ]\\n [ ][ ][ ][ ]\\n [ X][11][ Y][ 4][ Z]\\n</pre>\\nEach brick of the pyramid is the sum of the two bricks situated below it.<br>\\nOf the three missing numbers at the base of the pyramid, \\nthe middle one is the sum of the other two (that is, Y = X + Z).\\n\\n\\n;Task:\\nWrite a program to find a solution to this puzzle.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F e(&x, row, col) -> &\\n R x[row * (row + 1) I/ 2 + col]\\n\\nF iterate(&v, &diff, do_print = 1B)\\n V tot = 0.0\\n L\\n e(&v, 0, 0) = 151\\n e(&v, 2, 0) = 40\\n e(&v, 4, 1) = 11\\n e(&v, 4, 3) = 4\\n\\n L(i) 1..4\\n L(j) 0..i\\n e(&diff, i, j) = 0\\n I j < i\\n e(&diff, i, j) += e(&v, i - 1, j) - e(&v, i, j + 1) - e(&v, i, j)\\n I j != 0\\n e(&diff, i, j) += e(&v, i - 1, j - 1) - e(&v, i, j - 1) - e(&v, i, j)\\n\\n L(i) 1..3\\n L(j) 0.<i\\n e(&diff, i, j) += e(&v, i + 1, j) + e(&v, i + 1, j + 1) - e(&v, i, j)\\n\\n e(&diff, 4, 2) += e(&v, 4, 0) + e(&v, 4, 4) - e(&v, 4, 2)\\n\\n L(i) 0 .< v.len\\n v[i] += diff[i] / 4\\n\\n tot = sum(diff.map(a -> a * a))\\n I do_print\\n print(‘dev: ’tot)\\n I tot < 0.1\\n L.break\\n\\nV v = [0.0] * 15\\nV diff = [0.0] * 15\\niterate(&v, &diff)\\n\\nV idx = 0\\nL(i) 5\\n L(j) 0..i\\n print(‘#4’.format(Int(0.5 + v[idx])), end' I j < i {‘ ’} E \\\"\\\\n\\\")\\n idx++\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"with Ada.Text_IO; use Ada.Text_IO;\\n\\nprocedure Pyramid_of_Numbers is\\n\\n B_X, B_Y, B_Z : Integer := 0; -- Unknown variables\\n\\n type Block_Value is record\\n Known : Integer := 0;\\n X, Y, Z : Integer := 0;\\n end record;\\n X : constant Block_Value := (0, 1, 0, 0);\\n Y : constant Block_Value := (0, 0, 1, 0);\\n Z : constant Block_Value := (0, 0, 0, 1);\\n procedure Add (L : in out Block_Value; R : Block_Value) is\\n begin -- Symbolically adds one block to another\\n L.Known := L.Known + R.Known;\\n L.X := L.X + R.X - R.Z; -- Z is excluded as n(Y - X - Z) = 0\\n L.Y := L.Y + R.Y + R.Z;\\n end Add;\\n procedure Add (L : in out Block_Value; R : Integer) is\\n begin -- Symbolically adds a value to the block\\n L.Known := L.Known + R;\\n end Add;\\n\\n function Image (N : Block_Value) return String is\\n begin -- The block value, when X,Y,Z are known\\n return Integer'Image (N.Known + N.X * B_X + N.Y * B_Y + N.Z * B_Z);\\n end Image;\\n\\n procedure Solve_2x2 (A11, A12, B1, A21, A22, B2 : Integer) is\\n begin -- Don't care about things, supposing an integer solution exists\\n if A22 = 0 then\\n B_X := B2 / A21;\\n B_Y := (B1 - A11*B_X) / A12;\\n else\\n B_X := (B1*A22 - B2*A12) / (A11*A22 - A21*A12);\\n B_Y := (B1 - A11*B_X) / A12;\\n end if;\\n B_Z := B_Y - B_X;\\n end Solve_2x2;\\n\\n B : array (1..5, 1..5) of Block_Value; -- The lower triangle contains blocks\\n\\nbegin\\n -- The bottom blocks\\n Add (B(5,1),X); Add (B(5,2),11); Add (B(5,3),Y); Add (B(5,4),4); Add (B(5,5),Z);\\n\\n -- Upward run\\n for Row in reverse 1..4 loop\\n for Column in 1..Row loop\\n Add (B (Row, Column), B (Row + 1, Column));\\n Add (B (Row, Column), B (Row + 1, Column + 1));\\n end loop;\\n end loop;\\n\\n -- Now have known blocks 40=(3,1), 151=(1,1) and Y=X+Z to determine X,Y,Z\\n Solve_2x2\\n ( B(1,1).X, B(1,1).Y, 151 - B(1,1).Known,\\n B(3,1).X, B(3,1).Y, 40 - B(3,1).Known\\n );\\n\\n -- Print the results\\n for Row in 1..5 loop\\n New_Line;\\n for Column in 1..Row loop\\n Put (Image (B(Row,Column)));\\n end loop;\\n end loop;\\nend Pyramid_of_Numbers;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"MODE\\n FIELD = REAL,\\n VEC = [0]REAL,\\n MAT = [0,0]REAL;\\nMODE BRICK = UNION(INT, CHAR);\\n\\nFLEX[][]BRICK puzzle = (\\n ( 151),\\n ( \\\" \\\", \\\" \\\"),\\n ( 40, \\\" \\\", \\\" \\\"),\\n ( \\\" \\\", \\\" \\\", \\\" \\\", \\\" \\\"),\\n ( \\\"x\\\", 11, \\\"y\\\", 4, \\\"z\\\")\\n);\\n\\nPROC mat col = (INT row, col)INT: row*(row-1)OVER 2 + col;\\nINT col x = mat col(5,1),\\n col y = mat col(5,3),\\n col z = mat col(5,5);\\n\\nOP INIT = (REF VEC vec)VOID: FOR elem FROM LWB vec TO UPB vec DO vec[elem]:=0 OD;\\nOP INIT = (REF MAT mat)VOID: FOR row FROM LWB mat TO UPB mat DO INIT mat[row,] OD;\\n\\nOP / = (MAT a, MAT b)MAT:( # matrix division #\\n [LWB b:UPB b]INT p ;\\n INT sign;\\n [,]FIELD lu = lu decomp(b, p, sign);\\n [LWB a:UPB a, 1 LWB a:2 UPB a]FIELD out;\\n FOR col FROM 2 LWB a TO 2 UPB a DO out[,col] := lu solve(b, lu, p, a[,col]) OD;\\n out\\n);\\n\\nOP / = (VEC a, MAT b)VEC: ( # vector division #\\n [LWB a:UPB a,1]FIELD transpose a;\\n transpose a[,1]:=a;\\n (transpose a/b)[,LWB a]\\n);\\n\\nINT upb mat = mat col(UPB puzzle, UPB puzzle);\\n[upb mat, upb mat] REAL mat; INIT mat;\\n[upb mat] REAL vec; INIT vec;\\n\\nINT mat row := LWB mat;\\nINT known row := UPB mat - UPB puzzle + 1;\\n\\n# build the simultaneous equation to solve #\\nFOR row FROM LWB puzzle TO UPB puzzle DO\\n FOR col FROM LWB puzzle[row] TO UPB puzzle[row] DO\\n IF row < UPB puzzle THEN\\n mat[mat row, mat col(row, col)] := 1;\\n mat[mat row, mat col(row+1, col)] := -1;\\n mat[mat row, mat col(row+1, col+1)] := -1;\\n mat row +:= 1\\n FI;\\n CASE puzzle[row][col] IN\\n (INT value):(\\n mat[known row, mat col(row, col)] := 1;\\n vec[known row] := value;\\n known row +:= 1\\n ),\\n (CHAR variable):SKIP\\n ESAC\\n OD\\nOD;\\n\\n# finally add x - y + z = 0 #\\nmat[known row, col x] := 1;\\nmat[known row, col y] := -1;\\nmat[known row, col z] := 1;\\n\\nFORMAT real repr = $g(-5,2)$;\\n\\nCO # print details of the simultaneous equation being solved #\\nFORMAT\\n vec repr = $\\\"(\\\"n(2 UPB mat-1)(f(real repr)\\\", \\\")f(real repr)\\\")\\\"$,\\n mat repr = $\\\"(\\\"n(1 UPB mat-1)(f(vec repr)\\\", \\\"lx)f(vec repr)\\\")\\\"$;\\n\\nprintf(($\\\"Vec: \\\"l$,vec repr, vec, $l$));\\nprintf(($\\\"Mat: \\\"l$,mat repr, mat, $l$));\\nEND CO\\n\\n# finally actually solve the equation #\\nVEC solution vec = vec/mat;\\n\\n# and wrap up by printing the solution #\\nFLEX[UPB puzzle]FLEX[0]REAL solution;\\nFOR row FROM LWB puzzle TO UPB puzzle DO\\n solution[row] := LOC[row]REAL;\\n FOR col FROM LWB puzzle[row] TO UPB puzzle[row] DO\\n solution[row][col] := solution vec[mat col(row, col)]\\n OD;\\n printf(($n(UPB puzzle-row)(4x)$, $x\\\"(\\\"f(real repr)\\\")\\\"$, solution[row], $l$))\\nOD;\\n\\nFOR var FROM 1 BY 2 TO 5 DO\\n printf(($5x$,$g$,puzzle[UPB puzzle][var],\\\"=\\\", real repr, solution[UPB puzzle][var]))\\nOD\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"N1 := 11, N2 := 4, N3 := 40, N4 := 151\\nZ := (2*N4 - 7*N3 - 8*N2 + 6*N1) / 7\\nX := (N3 - 2*N1 - Z) / 2\\nMsgBox,, Pascal's Triangle, %X%`n%Z%\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \";---------------------------------------------------------------------------\\n; Pascal's triangle.ahk\\n; by wolf_II\\n;---------------------------------------------------------------------------\\n; http://rosettacode.org/wiki/Pascal's_triangle/Puzzle\\n;---------------------------------------------------------------------------\\n\\n\\n\\n;---------------------------------------------------------------------------\\nAutoExecute: ; auto-execute section of the script\\n;---------------------------------------------------------------------------\\n #SingleInstance, Force ; only one instance allowed\\n #NoEnv ; don't check empty variables\\n ;-----------------------------------------------------------------------\\n AppName := \\\"Pascal's triangle\\\"\\n N1 := 11, N2 := 4, N3 := 40, N4 := 151\\n\\n ; monitor MouseMove events\\n OnMessage(0x0200, \\\"WM_MOUSEMOVE\\\")\\n\\n ; GUI\\n Gosub, GuiCreate\\n Gui, Show,, %AppName%\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nGuiCreate: ; create the GUI\\n;---------------------------------------------------------------------------\\n Gui, -MinimizeBox\\n Gui, Margin, 8, 8\\n\\n ; 15 edit controls\\n Loop, 5\\n Loop, % Row := A_Index {\\n xx := 208 + (A_Index - 5) * 50 - (Row - 5) * 25\\n yy := 8 + (Row - 1) * 22\\n vv := Row \\\"_\\\" A_Index\\n Gui, Add, Edit, x%xx% y%yy% w50 v%vv% Center ReadOnly -TabStop\\n }\\n GuiControl, -WantReturn, Edit11\\n GuiControl, -WantReturn, Edit15\\n\\n ; buttons (2 hidden)\\n Gui, Add, Button, x8 w78, &Restart\\n Gui, Add, Button, x+8 wp, &Solve\\n Gui, Add, Button, x+8 wp, &Check\\n Gui, Add, Button, x8 wp, Cle&ar\\n Gui, Add, Button, xp wp Hidden, &Cancel\\n Gui, Add, Button, x+8 wp, &New\\n Gui, Add, Button, xp wp Hidden, &Apply\\n Gui, Add, Button, x+8 wp, E&xit\\n\\n ; status bar\\n Gui, Add, StatusBar\\n\\n ; blue font\\n Gui, Font, bold cBlue\\n GuiControl, Font, Edit11\\n GuiControl, Font, Edit15\\n ; falling through\\n\\n;---------------------------------------------------------------------------\\nButtonRestart: ; restart retaining the blue clues\\n;---------------------------------------------------------------------------\\n Controls(True) ; enable controls\\n Loop, 15\\n If A_Index Not In 1,4,11,12,14,15\\n GuiControl,, Edit%A_Index% ; clear\\n GuiControl,, Edit1, %N4%\\n GuiControl,, Edit4, %N3%\\n GuiControl,, Edit12, %N1%\\n GuiControl,, Edit14, %N2%\\n GuiControl,, Edit11, %X%\\n GuiControl,, Edit15, %Z%\\n GreenFont:\\n Gui, Font, bold cGreen\\n GuiControl, Font, Edit1\\n GuiControl, Font, Edit4\\n GuiControl, Font, Edit12\\n GuiControl, Font, Edit14\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nButtonSolve: ; calculate solution\\n;---------------------------------------------------------------------------\\n ; N1 := 11 N2 := 4 N3 := 40 N4 := 151\\n ;-----------------------------------------------------------------------\\n ; Y = X + Z\\n ; 40 = (11+X) + (11+Y)\\n ; A = (11+Y) + (Y+4)\\n ; B = (4+Y) + (4+Z)\\n ; 151 = (40+A) + (A+B)\\n ;-----------------------------------------------------------------------\\n Gosub, GreenFont\\n GuiControl,, Edit15, % Z := Round( (2*N4 - 7*N3 - 8*N2 + 6*N1) / 7 )\\n GuiControl,, Edit11, % X := Round( (N3 - 2*N1 - Z) / 2 )\\n ; falling through\\n\\n;---------------------------------------------------------------------------\\nButtonCheck: ; check the [entry|solution] for errors\\n;---------------------------------------------------------------------------\\n Controls(False) ; disable controls\\n Gui, Submit, NoHide\\n X := 5_1, Z := 5_5\\n Loop, 5\\n Loop, % Row := A_Index\\n If (%Row%_%A_Index% = \\\"\\\")\\n %Row%_%A_Index% := 0\\n GuiControl,, Edit13, % 5_3 := 5_1 + 5_5\\n GuiControl,, Edit10, % 4_4 := 5_4 + 5_5\\n GuiControl,, Edit9, % 4_3 := 5_3 + 5_4\\n GuiControl,, Edit8, % 4_2 := 5_2 + 5_3\\n GuiControl,, Edit7, % 4_1 := 5_1 + 5_2\\n GuiControl,, Edit6, % 3_3 := 4_4 + 4_3\\n GuiControl,, Edit5, % 3_2 := 4_3 + 4_2\\n GuiControl,, Edit4, % 3_1 := 4_2 + 4_1\\n GuiControl,, Edit3, % 2_2 := 3_3 + 3_2\\n GuiControl,, Edit2, % 2_1 := 3_2 + 3_1\\n GuiControl,, Edit1, % 1_1 := 2_2 + 2_1\\n Gui, Font, bold cRed\\n If Not 3_1 = N3\\n GuiControl, Font, Edit4\\n If Not 1_1 = N4\\n GuiControl, Font, Edit1\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nButtonClear: ; restart without the blue clues\\n;---------------------------------------------------------------------------\\n X := Z := \\\"\\\"\\n Gosub, ButtonRestart\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nButtonNew: ; enter new numbers for the puzzle\\n;---------------------------------------------------------------------------\\n Gosub, GreenFont\\n Loop, 15\\n If A_Index Not In 1,4,12,14\\n GuiControl,, Edit%A_Index% ; clear\\n Controls(False) ; disable controls\\n NewContr(True) ; enable controls for new numbers\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nButtonApply: ; remember the new numbers\\n;---------------------------------------------------------------------------\\n Gui, Submit, NoHide\\n N1 := 5_2, N2 := 5_4, N3 := 3_1, N4 := 1_1\\n NewContr(False) ; disable controls for new numbers\\n Controls(True) ; enable controls\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nButtonCancel: ; restore the old numbers\\n;---------------------------------------------------------------------------\\n GuiControl,, Edit1, %N4%\\n GuiControl,, Edit4, %N3%\\n GuiControl,, Edit12, %N1%\\n GuiControl,, Edit14, %N2%\\n NewContr(False) ; disable controls for new numbers\\n Controls(True) ; enable controls\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nGuiClose:\\n;---------------------------------------------------------------------------\\nGuiEscape:\\n;---------------------------------------------------------------------------\\nButtonExit:\\n;---------------------------------------------------------------------------\\n ; common action\\n ExitApp\\n\\nReturn\\n\\n\\n\\n;---------------------------------------------------------------------------\\nControls(Bool) { ; [dis|re-en]able some controls\\n;---------------------------------------------------------------------------\\n Enable := Bool ? \\\"+\\\" : \\\"-\\\"\\n Disable := Bool ? \\\"-\\\" : \\\"+\\\"\\n\\n GuiControl, %Disable%ReadOnly, Edit11\\n GuiControl, %Disable%ReadOnly, Edit15\\n GuiControl, %Enable%TabStop, Edit11\\n GuiControl, %Enable%TabStop, Edit15\\n\\n GuiControl, %Disable%Default, &Restart\\n GuiControl, %Enable%Default, &Check\\n GuiControl, %Disable%Disabled, &Check\\n GuiControl, %Enable%Disabled, &Restart\\n}\\n\\n\\n\\n;---------------------------------------------------------------------------\\nNewContr(Bool) { ; [dis|re-en]able control for new numbers\\n;---------------------------------------------------------------------------\\n Enable := Bool ? \\\"+\\\" : \\\"-\\\"\\n Disable := Bool ? \\\"-\\\" : \\\"+\\\"\\n\\n GuiControl, %Disable%ReadOnly, Edit1\\n GuiControl, %Disable%ReadOnly, Edit4\\n GuiControl, %Disable%ReadOnly, Edit12\\n GuiControl, %Disable%ReadOnly, Edit14\\n\\n GuiControl, %Enable%TabStop, Edit1\\n GuiControl, %Enable%TabStop, Edit4\\n GuiControl, %Enable%TabStop, Edit12\\n GuiControl, %Enable%TabStop, Edit14\\n\\n GuiControl, %Enable%Hidden, Button1\\n GuiControl, %Enable%Hidden, Button2\\n GuiControl, %Enable%Hidden, Button3\\n GuiControl, %Enable%Hidden, Button4\\n GuiControl, %Disable%Hidden, Button5\\n GuiControl, %Enable%Hidden, Button6\\n GuiControl, %Disable%Hidden, Button7\\n GuiControl, %Enable%Hidden, Button8\\n\\n}\\n\\n\\n\\n;---------------------------------------------------------------------------\\nWM_MOUSEMOVE() { ; monitor MouseMove events\\n;---------------------------------------------------------------------------\\n ; display quick help in StatusBar\\n ;-----------------------------------------------------------------------\\n global AppName\\n CurrControl := A_GuiControl\\n IfEqual True,, MsgBox ; dummy\\n\\n ; mouse is over buttons\\n Else If (CurrControl = \\\"&Restart\\\")\\n SB_SetText(\\\"restart retaining the blue clues\\\")\\n Else If (CurrControl = \\\"&Solve\\\")\\n SB_SetText(\\\"calculate solution\\\")\\n Else If (CurrControl = \\\"&Check\\\")\\n SB_SetText(\\\"check if the entries are correct\\\")\\n Else If (CurrControl = \\\"Cle&ar\\\")\\n SB_SetText(\\\"restart without the blue clues\\\")\\n Else If (CurrControl = \\\"&New\\\")\\n SB_SetText(\\\"enter new numbers for the puzzle\\\")\\n Else If (CurrControl = \\\"E&xit\\\")\\n SB_SetText(\\\"exit \\\" AppName)\\n\\n ; delete status bar text\\n Else SB_SetText(\\\"\\\")\\n}\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \" INSTALL @lib$ + \\\"ARRAYLIB\\\"\\n\\n REM Describe the puzzle as a set of simultaneous equations:\\n REM a + b = 151\\n REM a - c = 40\\n REM -b + c + d = 0\\n REM e + f = 40\\n REM -c + f + g = 0\\n REM -d + g + h = 0\\n REM e - x = 11\\n REM f - y = 11\\n REM g - y = 4\\n REM h - z = 4\\n REM x - y + z = 0\\n REM So we have 11 equations in 11 unknowns.\\n\\n REM We can represent these equations as a matrix and a vector:\\n DIM matrix(10,10), vector(10)\\n matrix() = \\\\ a, b, c, d, e, f, g, h, x, y, z\\n \\\\ 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, \\\\\\n \\\\ 1, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0, \\\\\\n \\\\ 0,-1, 1, 1, 0, 0, 0, 0, 0, 0, 0, \\\\\\n \\\\ 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, \\\\\\n \\\\ 0, 0,-1, 0, 0, 1, 1, 0, 0, 0, 0, \\\\\\n \\\\ 0, 0, 0,-1, 0, 0, 1, 1, 0, 0, 0, \\\\\\n \\\\ 0, 0, 0, 0, 1, 0, 0, 0,-1, 0, 0, \\\\\\n \\\\ 0, 0, 0, 0, 0, 1, 0, 0, 0,-1, 0, \\\\\\n \\\\ 0, 0, 0, 0, 0, 0, 1, 0, 0,-1, 0, \\\\\\n \\\\ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,-1, \\\\\\n \\\\ 0, 0, 0, 0, 0, 0, 0, 0, 1,-1, 1\\n vector() = 151, 40, 0, 40, 0, 0, 11, 11, 4, 4, 0\\n\\n REM Now solve the simultaneous equations:\\n PROC_invert(matrix())\\n vector() = matrix().vector()\\n\\n PRINT \\\"X = \\\" ; vector(8)\\n PRINT \\\"Y = \\\" ; vector(9)\\n PRINT \\\"Z = \\\" ; vector(10)\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"/* Pascal's pyramid solver\\n *\\n * [top]\\n * [ ] [ ]\\n * [mid] [ ] [ ]\\n * [ ] [ ] [ ] [ ]\\n * [ x ] [ a ] [ y ] [ b ] [ z ]\\n * x + z = y\\n *\\n * This solution makes use of a little bit of mathematical observation,\\n * such as the fact that top = 4(a+b) + 7(x+z) and mid = 2x + 2a + z.\\n */\\n\\n#include <stdio.h>\\n#include <math.h>\\n\\nvoid pascal(int a, int b, int mid, int top, int* x, int* y, int* z)\\n{\\n double ytemp = (top - 4 * (a + b)) / 7.;\\n if(fmod(ytemp, 1.) >= 0.0001)\\n {\\n x = 0;\\n return;\\n }\\n *y = ytemp;\\n *x = mid - 2 * a - *y;\\n *z = *y - *x;\\n}\\nint main()\\n{\\n int a = 11, b = 4, mid = 40, top = 151;\\n int x, y, z;\\n pascal(a, b, mid, top, &x, &y, &z);\\n if(x != 0)\\n printf(\\\"x: %d, y: %d, z: %d\\\\n\\\", x, y, z);\\n else printf(\\\"No solution\\\\n\\\");\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n\\nvoid show(int *x) {\\n\\tint i, j;\\n\\n\\tfor (i = 0; i < 5; i++)\\n\\t\\tfor (j = 0; j <= i; j++)\\n\\t\\t\\tprintf(\\\"%4d%c\\\", *(x++), j < i ? ' ' : '\\\\n');\\n}\\n\\ninline int sign(int i)\\n{\\n\\treturn i < 0 ? -1 : i > 0;\\n}\\n\\nint iter(int *v, int *diff) {\\n\\tint sum, i, j, e = 0;\\n\\n#\\tdefine E(x, row, col) x[(row) * ((row) + 1) / 2 + (col)]\\n\\t/* enforce boundary conditions */\\n\\tE(v, 0, 0) = 151;\\n\\tE(v, 2, 0) = 40;\\n\\tE(v, 4, 1) = 11;\\n\\tE(v, 4, 3) = 4;\\n\\n\\t/* calculate difference from equilibrium */\\n\\tfor (i = 1; i < 5; i++) {\\n\\t\\tfor (j = 0; j <= i; j++) {\\n\\t\\t\\tE(diff, i, j) = 0;\\n\\t\\t\\tif (j < i)\\n\\t\\t\\t\\tE(diff, i, j) += E(v, i - 1, j) -\\n\\t\\t\\t\\t\\t\\t E(v, i, j + 1) -\\n\\t\\t\\t\\t\\t\\t E(v, i, j);\\n\\t\\t\\tif (j)\\n\\t\\t\\t\\tE(diff, i, j) += E(v, i - 1, j - 1) -\\n\\t\\t\\t\\t\\t\\t E(v, i, j - 1) -\\n\\t\\t\\t\\t\\t\\t E(v, i, j);\\n\\t\\t}\\n\\t}\\n\\n\\tfor (i = 0; i < 4; i++)\\n\\t\\tfor (j = 0; j < i; j++)\\n\\t\\t\\tE(diff, i, j) += E(v, i + 1, j) +\\n\\t\\t\\t\\t\\t E(v, i + 1, j + 1) -\\n\\t\\t\\t\\t\\t E(v, i, j);\\n\\n\\tE(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\\n#\\tundef E\\n\\n\\t/* Do feedback, check if we are done. */\\n\\tfor (i = sum = 0; i < 15; i++) {\\n\\t\\tsum += !!sign(e = diff[i]);\\n\\n\\t\\t/* 1/5-ish feedback strength on average. These numbers are highly\\n\\t\\t magical, depending on nodes' connectivities. */\\n\\t\\tif (e >= 4 || e <= -4) \\t\\tv[i] += e/5;\\n\\t\\telse if (rand() < RAND_MAX/4)\\tv[i] += sign(e);\\n\\t}\\n\\treturn sum;\\n}\\n\\nint main() {\\n\\tint v[15] = { 0 }, diff[15] = { 0 }, i, s;\\n\\n\\tfor (i = s = 1; s; i++) {\\n\\t\\ts = iter(v, diff);\\n\\t\\tprintf(\\\"pass %d: %d\\\\n\\\", i, s);\\n\\t}\\n\\tshow(v);\\n\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <iomanip>\\n\\ninline int sign(int i) {\\n return i < 0 ? -1 : i > 0;\\n}\\n\\ninline int& E(int *x, int row, int col) {\\n return x[row * (row + 1) / 2 + col];\\n}\\n\\nint iter(int *v, int *diff) {\\n // enforce boundary conditions\\n E(v, 0, 0) = 151;\\n E(v, 2, 0) = 40;\\n E(v, 4, 1) = 11;\\n E(v, 4, 3) = 4;\\n\\n // calculate difference from equilibrium\\n for (auto i = 1u; i < 5u; i++)\\n for (auto j = 0u; j <= i; j++) {\\n E(diff, i, j) = 0;\\n if (j < i)\\n E(diff, i, j) += E(v, i - 1, j) - E(v, i, j + 1) - E(v, i, j);\\n if (j)\\n E(diff, i, j) += E(v, i - 1, j - 1) - E(v, i, j - 1) - E(v, i, j);\\n }\\n\\n for (auto i = 0u; i < 4u; i++)\\n for (auto j = 0u; j < i; j++)\\n E(diff, i, j) += E(v, i + 1, j) + E(v, i + 1, j + 1) - E(v, i, j);\\n\\n E(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\\n\\n // do feedback, check if we are done\\n uint sum;\\n int e = 0;\\n for (auto i = sum = 0u; i < 15u; i++) {\\n sum += !!sign(e = diff[i]);\\n\\n // 1/5-ish feedback strength on average. These numbers are highly magical, depending on nodes' connectivities\\n if (e >= 4 || e <= -4)\\n v[i] += e / 5;\\n else if (rand() < RAND_MAX / 4)\\n v[i] += sign(e);\\n }\\n return sum;\\n}\\n\\nvoid show(int *x) {\\n for (auto i = 0u; i < 5u; i++)\\n for (auto j = 0u; j <= i; j++)\\n std::cout << std::setw(4u) << *(x++) << (j < i ? ' ' : '\\\\n');\\n}\\n\\nint main() {\\n int v[15] = { 0 }, diff[15] = { 0 };\\n for (auto i = 1u, s = 1u; s; i++) {\\n s = iter(v, diff);\\n std::cout << \\\"pass \\\" << i << \\\": \\\" << s << std::endl;\\n }\\n show(v);\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\n\\nnamespace Pyramid_of_Numbers\\n{\\n class Program\\n\\t{\\n\\t\\tpublic static void Main(string[] args)\\n\\t\\t{\\n\\t\\t\\t// Set console properties\\n\\t\\t\\tConsole.Title = \\\" Pyramid of Numbers / Pascal's triangle Puzzle\\\";\\n\\t\\t\\tConsole.SetBufferSize(80,1000);\\n\\t\\t\\tConsole.SetWindowSize(80,60);\\n\\t\\t\\tConsole.ForegroundColor = ConsoleColor.Green;\\n\\n\\t\\t\\t\\n\\t\\t\\t// Main Program Loop\\n\\t\\t\\tConsoleKeyInfo k = new ConsoleKeyInfo('Y', ConsoleKey.Y,true,true,true);\\n\\t\\t\\twhile (k.Key == ConsoleKey.Y)\\n\\t\\t\\t{\\n\\t\\t\\t\\tConsole.Clear();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tConsole.WriteLine(\\\"----------------------------------------------\\\");\\n\\t\\t\\t\\tConsole.WriteLine(\\\" Pyramid of Numbers / Pascal's triangle Puzzle\\\");\\n\\t\\t\\t\\tConsole.WriteLine(\\\"----------------------------------------------\\\");\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//\\n\\t\\t\\t\\t// Declare new Pyramid array\\n\\t\\t\\t\\t//\\n\\t\\t\\t\\tint r = 5;// Number of rows\\n\\t\\t\\t\\tint [,] Pyramid = new int[r,r];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Set initial Pyramid values\\n\\t\\t\\t\\tfor (int i = 0; i < r; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j = 0; j < r; j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tPyramid[i,j] = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Show info on created array\\n\\t\\t\\t\\tConsole.WriteLine(\\\" Pyramid has \\\" + r + \\\" rows\\\");\\n\\t\\t\\t\\tConsole.WriteLine(\\\"--------------------------------------------\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Enter Pyramid values\\n\\t\\t\\t\\tfor(int i = 0; i <= r-1; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\" Enter \\\" + (i+1).ToString() + \\\". row values:\\\");\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\"--------------------------------------------\\\");\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfor(int j = 0; j < i+1; j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tConsole.Write(\\\" \\\" + (j+1).ToString() + \\\". value = \\\");\\n\\t\\t\\t\\t\\t\\tint v = int.Parse(Console.ReadLine());\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tPyramid[i,j] = v;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tConsole.WriteLine(\\\"--------------------------------------------\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//\\n\\t\\t\\t\\t// Show initial Pyramid values\\n\\t\\t\\t\\t//\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\tConsole.WriteLine(\\\" Initial Pyramid Values \\\");\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Show Pyramid values\\n\\t\\t\\t\\tfor(int i = 0; i <= r-1; i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j = 0; j < i+1; j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tConsole.Write(\\\"{0,4}\\\",Pyramid[i,j]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tConsole.WriteLine(\\\"--------------------------------------------\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Find solution\\n\\t\\t\\t\\tSolve_Pyramid(Pyramid);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\tConsole.Write(\\\" Start new calculation <Y/N> . . . \\\");\\n\\t\\t\\t\\tk = Console.ReadKey(true);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n //\\n // Solve Function\\n //\\n\\t\\tpublic static void Solve_Pyramid(int [,] Pyramid)\\n\\t\\t{\\n\\t\\t\\tint r = 5; // Number of rows\\n\\t\\t\\t\\n\\t\\t\\t// Calculate Y\\n\\t\\t\\tint a = Pyramid[r-1,1];\\n\\t\\t\\tint b = Pyramid[r-1,3];\\n\\t\\t\\tint c = Pyramid[0,0];\\n\\t\\t\\t\\n\\t\\t\\tint y = (c - (4*a) - (4*b))/7;\\n\\t\\t\\tPyramid[r-1,2] = y;\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t// Create copy of Pyramid\\n\\t\\t\\tint [,] Pyramid_Copy = new int[r,r];\\n\\t\\t\\tArray.Copy(Pyramid,Pyramid_Copy,r*r);\\n\\t\\t\\t\\n\\t\\t\\tint n = 0; // solution counter\\n\\t\\t\\tfor(int x = 0; x < y + 1; x++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(int z = 0; z < y + 1; z++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif( (x+z) == y)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tPyramid[r-1,0] = x;\\n\\t\\t\\t\\t\\t\\tPyramid[r-1,r-1] = z;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// Recalculate Pyramid values\\n\\t\\t\\t\\t\\t\\tfor(int i = r-1; i > 0; i--)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tfor(int j = 0; j < i; j++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tPyramid[i-1,j] = Pyramid[i,j]+Pyramid[i,j+1];\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// Compare Pyramid values\\n\\t\\t\\t\\t\\t\\tbool solved = true;\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < r-1; i++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tfor(int j = 0; j < i+1; j++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tif(Pyramid_Copy[i,j]>0)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(Pyramid[i,j] != Pyramid_Copy[i,j])\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsolved = false;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ti = r;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\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\\t\\n\\t\\t\\t\\t\\t\\tif(solved)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tn++;\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine(\\\" Solved Pyramid Values no.\\\" + n);\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// Show Pyramid values\\n\\t\\t\\t\\t\\t\\t\\tfor(int i = 0; i <= r-1; i++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int j = 0; j < i+1; j++)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tConsole.Write(\\\"{0,4}\\\",Pyramid[i,j]);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine(\\\" X = \\\" + Pyramid[r-1,0] + \\\" \\\" +\\n\\t\\t\\t\\t\\t\\t\\t \\\" Y = \\\" + Pyramid[r-1,2] + \\\" \\\" +\\n\\t\\t\\t\\t\\t\\t\\t \\\" Z = \\\" + Pyramid[r-1,4]);\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\t\\t\\t\\tConsole.WriteLine(\\\"--------------------------------------------\\\");\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tArray.Copy(Pyramid_Copy,Pyramid,r*r);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(n == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t\\tConsole.WriteLine(\\\" Pyramid has no solution \\\");\\n\\t\\t\\t\\tConsole.WriteLine();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t}\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(def bottom [ [0 1 0], [11 0 0], [0 1 1], [4 0 0], [0 0 1] ])\\n\\n(defn plus [v1 v2] (vec (map + v1 v2)))\\n(defn minus [v1 v2] (vec (map - v1 v2)))\\n(defn scale [n v] (vec (map #(* n %) v )))\\n\\n(defn above [row] (map #(apply plus %) (partition 2 1 row)))\\n\\n(def rows (reverse (take 5 (iterate above bottom))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(def c00 (get-in rows [0 0]))\\n(def c20 (get-in rows [2 0]))\\n\\n(def eqn0 (minus c00 [151 0 0]))\\n(def eqn1 (minus c20 [ 40 0 0]))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn solve [m]\\n (assert (<= 1 m 2))\\n (let [n (- 3 m)\\n v0 (scale (eqn1 n) eqn0)\\n v1 (scale (eqn0 n) eqn1)\\n vd (minus v0 v1)]\\n (assert (zero? (vd n)))\\n (/ (- (vd 0)) (vd m))))\\n\\n(let [x (solve 1), z (solve 2), y (+ x z)]\\n (println \\\"x =\\\" x \\\", y =\\\" y \\\", z =\\\" z))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(defn dot [v1 v2] (reduce + (map * v1 v2)))\\n\\n(defn show-pyramid [x z]\\n (doseq [row rows]\\n (println (map #(dot [1 x z] %) row)))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"let x = -1\\n\\ndo\\n\\n\\tlet x = x + 1\\n\\tlet z = 0\\n\\n\\tdo\\n\\n\\t\\tlet e = x + 11\\n\\t\\tlet f = 11 + (x + z)\\n\\t\\tlet g = (x + z) + 4\\n\\t\\tlet h = 4 + z\\n\\n\\t\\tif e + f = 40 then\\n\\n\\t\\t\\tlet c = f + g\\n\\t\\t\\tlet d = g + h\\n\\t\\t\\tlet a = 40 + c\\n\\t\\t\\tlet b = c + d\\n\\t\\t\\tlet q = 0\\n\\n\\t\\t\\tif a + b = 151 then\\n\\n\\t\\t\\t\\tlet q = 1\\n\\n\\t\\t\\tendif\\n\\n\\t\\tendif\\n\\n\\t\\tif q = 0 then\\n\\n\\t\\t\\tlet z = z + 1\\n\\n\\t\\tendif\\n\\n\\t\\twait\\n\\n\\tloopwhile z < 20 and q = 0\\n\\n\\tif q = 0 then\\n\\n\\t\\tlet z = -1\\n\\n\\tendif\\n\\n\\twait\\n\\nloopuntil z >= 0\\n\\nprint \\\"x = \\\", x\\nprint \\\"y = \\\", x + z\\nprint \\\"z = \\\", z\\n\",\n \"language\": \"Craft-Basic\"\n },\n {\n \"code\": \"import CLPFD\\nimport Constraint (allC, andC)\\nimport Findall (findall)\\nimport List (init, last)\\n\\n\\nsolve :: [[Int]] -> Success\\nsolve body@([n]:rest) =\\n domain (concat body) 1 n\\n & andC (zipWith atop body rest)\\n & labeling [] (concat body)\\n where\\n xs `atop` ys = andC $ zipWith3 tri xs (init ys) (tail ys)\\n\\ntri :: Int -> Int -> Int -> Success\\ntri x y z = x =# y +# z\\n\\ntest (x,y,z) | tri y x z =\\n [ [151]\\n , [ _, _]\\n , [40, _, _]\\n , [ _, _, _, _]\\n , [ x, 11, y, 4, z]\\n ]\\nmain = findall $ solve . test\\n\",\n \"language\": \"Curry\"\n },\n {\n \"code\": \"import std.stdio, std.algorithm;\\n\\nvoid iterate(bool doPrint=true)(double[] v, double[] diff) @safe {\\n static ref T E(T)(T[] x, in size_t row, in size_t col)\\n pure nothrow @safe @nogc {\\n return x[row * (row + 1) / 2 + col];\\n }\\n\\n double tot = 0.0;\\n do {\\n // Enforce boundary conditions.\\n E(v, 0, 0) = 151;\\n E(v, 2, 0) = 40;\\n E(v, 4, 1) = 11;\\n E(v, 4, 3) = 4;\\n\\n // Calculate difference from equilibrium.\\n foreach (immutable i; 1 .. 5) {\\n foreach (immutable j; 0 .. i + 1) {\\n E(diff, i, j) = 0;\\n if (j < i)\\n E(diff, i, j) += E(v, i - 1, j) - E(v, i, j + 1) - E(v, i, j);\\n if (j)\\n E(diff, i, j) += E(v, i - 1, j - 1) - E(v, i, j - 1) - E(v, i, j);\\n }\\n }\\n\\n foreach (immutable i; 1 .. 4)\\n foreach (immutable j; 0 .. i)\\n E(diff, i, j) += E(v, i + 1, j) + E(v, i + 1, j + 1) - E(v, i, j);\\n\\n E(diff, 4, 2) += E(v, 4, 0) + E(v, 4, 4) - E(v, 4, 2);\\n\\n // Do feedback, check if we are close enough.\\n // 4: scale down the feedback to avoid oscillations.\\n v[] += diff[] / 4;\\n tot = diff.map!q{ a ^^ 2 }.sum;\\n\\n static if (doPrint)\\n writeln(\\\"dev: \\\", tot);\\n\\n // tot(dx^2) < 0.1 means each cell is no more than 0.5 away\\n // from equilibrium. It takes about 50 iterations. After\\n // 700 iterations tot is < 1e-25, but that's overkill.\\n } while (tot >= 0.1);\\n}\\n\\nvoid main() {\\n static void show(in double[] x) nothrow @nogc {\\n int idx;\\n foreach (immutable i; 0 .. 5)\\n foreach (immutable j; 0 .. i+1) {\\n printf(\\\"%4d%c\\\", cast(int)(0.5 + x[idx]), j < i ? ' ' : '\\\\n');\\n idx++;\\n }\\n }\\n\\n double[15] v = 0.0, diff = 0.0;\\n iterate(v, diff);\\n show(v);\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"#load\\\"Packages\\\\MathNet.Numerics.FSharp\\\\MathNet.Numerics.fsx\\\"\\n\\nopen MathNet.Numerics.LinearAlgebra\\n\\nlet A = matrix [\\n [ 1.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\\n [ -1.; 0.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\\n [ 0.; -1.; 1.; 1.; 0.; 0.; 0.; 0.; 0.; 0.; 0. ]\\n [ 0.; 0.; 0.; 0.; 1.; 1.; 0.; 0.; 0.; 0.; 0. ]\\n [ 0.; 0.; -1.; 0.; 0.; 1.; 1.; 0.; 0.; 0.; 0. ]\\n [ 0.; 0.; 0.; -1.; 0.; 0.; 1.; 1.; 0.; 0.; 0. ]\\n [ 0.; 0.; 0.; 0.; -1.; 0.; 0.; 0.; 1.; 0.; 0. ]\\n [ 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 0.; 1.; 0. ]\\n [ 0.; 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 1.; 0. ]\\n [ 0.; 0.; 0.; 0.; 0.; 0.; 0.; -1.; 0.; 0.; 1. ]\\n [ 0.; 0.; 0.; 0.; 0.; 0.; 0.; 0.; 1.; -1.; 1. ]\\n ]\\n\\nlet b = vector [151.; -40.; 0.; 40.; 0.; 0.; -11.; -11.; -4.; -4.; 0.]\\n\\nlet x = A.Solve(b)\\n\\nprintfn \\\"x = %f, Y = %f, Z = %f\\\" x.[8] x.[9] x.[10]\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: arrays backtrack combinators.extras fry grouping.extras\\ninterpolate io kernel math math.ranges sequences ;\\n\\n: base ( ?x ?z -- seq ) 2dup + swap '[ _ 11 _ 4 _ ] >array ;\\n\\n: up ( seq -- seq' ) [ [ + ] 2clump-map ] twice ;\\n\\n: find-solution ( -- x z )\\n 10 [1,b] dup [ amb-lazy ] bi@ 2dup base\\n up dup first 40 = must-be-true\\n up first 151 = must-be-true ;\\n\\nfind-solution [I X = ${1}, Z = ${}I] nl\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Function SolveForZ(x As Integer) As Integer\\n Dim As Integer a, b, c, d, e, f, g, h, z\\n For z = 0 To 20\\n e = x + 11\\n f = 11 + (x+z)\\n g = (x+z) + 4\\n h = 4 + z\\n If e + f = 40 Then\\n c = f + g\\n d = g + h\\n a = 40 + c\\n b = c + d\\n If a + b = 151 Then Return z\\n End If\\n Next z\\n Return -1\\nEnd Function\\n\\nDim As Integer x = -1, z = 0\\nDo\\n x = x + 1\\n z = SolveForZ(x)\\nLoop Until z >= 0\\n\\nPrint \\\"X =\\\"; x\\nPrint \\\"Y =\\\"; x + z\\nPrint \\\"Z =\\\"; z\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\n// representation of an expression in x, y, and z\\ntype expr struct {\\n x, y, z float64 // coefficients\\n c float64 // constant term\\n}\\n\\n// add two expressions\\nfunc addExpr(a, b expr) expr {\\n return expr{a.x + b.x, a.y + b.y, a.z + b.z, a.c + b.c}\\n}\\n\\n// subtract two expressions\\nfunc subExpr(a, b expr) expr {\\n return expr{a.x - b.x, a.y - b.y, a.z - b.z, a.c - b.c}\\n}\\n\\n// multiply expression by a constant\\nfunc mulExpr(a expr, c float64) expr {\\n return expr{a.x * c, a.y * c, a.z * c, a.c * c}\\n}\\n\\n// given a row of expressions, produce the next row up, by the given\\n// sum relation between blocks\\nfunc addRow(l []expr) []expr {\\n if len(l) == 0 {\\n panic(\\\"wrong\\\")\\n }\\n r := make([]expr, len(l)-1)\\n for i := range r {\\n r[i] = addExpr(l[i], l[i+1])\\n }\\n return r\\n}\\n\\n// given expression b in a variable, and expression a,\\n// take b == 0 and substitute to remove that variable from a.\\nfunc substX(a, b expr) expr {\\n if b.x == 0 {\\n panic(\\\"wrong\\\")\\n }\\n return subExpr(a, mulExpr(b, a.x/b.x))\\n}\\n\\nfunc substY(a, b expr) expr {\\n if b.y == 0 {\\n panic(\\\"wrong\\\")\\n }\\n return subExpr(a, mulExpr(b, a.y/b.y))\\n}\\n\\nfunc substZ(a, b expr) expr {\\n if b.z == 0 {\\n panic(\\\"wrong\\\")\\n }\\n return subExpr(a, mulExpr(b, a.z/b.z))\\n}\\n\\n// given an expression in a single variable, return value of that variable\\nfunc solveX(a expr) float64 {\\n if a.x == 0 || a.y != 0 || a.z != 0 {\\n panic(\\\"wrong\\\")\\n }\\n return -a.c / a.x\\n}\\n\\nfunc solveY(a expr) float64 {\\n if a.x != 0 || a.y == 0 || a.z != 0 {\\n panic(\\\"wrong\\\")\\n }\\n return -a.c / a.y\\n}\\n\\nfunc solveZ(a expr) float64 {\\n if a.x != 0 || a.y != 0 || a.z == 0 {\\n panic(\\\"wrong\\\")\\n }\\n return -a.c / a.z\\n}\\n\\nfunc main() {\\n // representation of given information for bottom row\\n r5 := []expr{{x: 1}, {c: 11}, {y: 1}, {c: 4}, {z: 1}}\\n fmt.Println(\\\"bottom row:\\\", r5)\\n\\n // given definition of brick sum relation\\n r4 := addRow(r5)\\n fmt.Println(\\\"next row up:\\\", r4)\\n r3 := addRow(r4)\\n fmt.Println(\\\"middle row:\\\", r3)\\n\\n // given relation y = x + z\\n xyz := subExpr(expr{y: 1}, expr{x: 1, z: 1})\\n fmt.Println(\\\"xyz relation:\\\", xyz)\\n // remove z from third cell using xyz relation\\n r3[2] = substZ(r3[2], xyz)\\n fmt.Println(\\\"middle row after substituting for z:\\\", r3)\\n\\n // given cell = 40,\\n b := expr{c: 40}\\n // this gives an xy relation\\n xy := subExpr(r3[0], b)\\n fmt.Println(\\\"xy relation:\\\", xy)\\n // substitute 40 for cell\\n r3[0] = b\\n\\n // remove x from third cell using xy relation\\n r3[2] = substX(r3[2], xy)\\n fmt.Println(\\\"middle row after substituting for x:\\\", r3)\\n\\n // continue applying brick sum relation to get top cell\\n r2 := addRow(r3)\\n fmt.Println(\\\"next row up:\\\", r2)\\n r1 := addRow(r2)\\n fmt.Println(\\\"top row:\\\", r1)\\n\\n // given top cell = 151, we have an equation in y\\n y := subExpr(r1[0], expr{c: 151})\\n fmt.Println(\\\"y relation:\\\", y)\\n // using xy relation, we get an equation in x\\n x := substY(xy, y)\\n fmt.Println(\\\"x relation:\\\", x)\\n // using xyz relation, we get an equation in z\\n z := substX(substY(xyz, y), x)\\n fmt.Println(\\\"z relation:\\\", z)\\n\\n // show final answers\\n fmt.Println(\\\"x =\\\", solveX(x))\\n fmt.Println(\\\"y =\\\", solveY(y))\\n fmt.Println(\\\"z =\\\", solveZ(z))\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"puzzle = [[\\\"151\\\"],[\\\"\\\",\\\"\\\"],[\\\"40\\\",\\\"\\\",\\\"\\\"],[\\\"\\\",\\\"\\\",\\\"\\\",\\\"\\\"],[\\\"X\\\",\\\"11\\\",\\\"Y\\\",\\\"4\\\",\\\"Z\\\"]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"triangle n = n * (n+1) `div` 2\\n\\ncoeff xys x = maybe 0 id $ lookup x xys\\n\\nrow n cs = [coeff cs k | k <- [1..n]]\\n\\neqXYZ n = [(0, 1:(-1):1:replicate n 0)]\\n\\neqPyramid n h = do\\n a <- [1..h-1]\\n x <- [triangle (a-1) + 1 .. triangle a]\\n let y = x+a\\n return $ (0, 0:0:0:row n [(x,-1),(y,1),(y+1,1)])\\n\\neqConst n fields = do\\n (k,s) <- zip [1..] fields\\n guard $ not $ null s\\n return $ case s of\\n \\\"X\\\" - (0, 1:0:0:row n [(k,-1)])\\n \\\"Y\\\" - (0, 0:1:0:row n [(k,-1)])\\n \\\"Z\\\" - (0, 0:0:1:row n [(k,-1)])\\n _ - (fromInteger $ read s, 0:0:0:row n [(k,1)])\\n\\nequations :: [[String]] - ([Rational], [[Rational]])\\nequations puzzle = unzip eqs where\\n fields = concat puzzle\\n eqs = eqXYZ n ++ eqPyramid n h ++ eqConst n fields\\n h = length puzzle\\n n = length fields\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"normalize :: [Rational] - [Integer]\\nnormalize xs = [numerator (x * v) | x <- xs] where\\n v = fromInteger $ foldr1 lcm $ map denominator $ xs\\n\\nrun puzzle = map (normalize . drop 3) $ answer where\\n (a, m) = equations puzzle\\n lr = decompose 0 m\\n answer = case solve 0 lr a of\\n Nothing - []\\n Just x - x : kernel lr\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"*Main run puzzle\\n[[151,81,70,40,41,29,16,24,17,12,5,11,13,4,8]]\\n*Main run [[\\\"\\\"],[\\\"2\\\",\\\"\\\"],[\\\"X\\\",\\\"Y\\\",\\\"Z\\\"]]\\n[[3,2,1,1,1,0],[3,0,3,-1,1,2]]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"chk=:40 151&-:@(2 4{{.\\\"1)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"base=: [,11,+,4,]\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"ord=:5\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" |.\\\"2(#~chk\\\"2) 2(+/\\\\)^:(<ord)\\\"1 base/\\\"1>,{ ;~i:28\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \",.(1+i.5)<@{.\\\"0 1{.|.\\\"2(#~chk\\\"2) 2(+/\\\\)^:(<ord)\\\"1 base/\\\"1>,{ ;~i:28\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \",.(<@{.\\\"0 1~1+i.@#){.|.\\\"2(#~chk\\\"2) 2(+/\\\\)^:(<ord)\\\"1 base/\\\"1>,{ ;~i:28\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.List;\\n\\npublic class PascalsTrianglePuzzle {\\n\\n public static void main(String[] args) {\\n Matrix mat = new Matrix(Arrays.asList(1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d, 0d),\\n Arrays.asList(0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d),\\n Arrays.asList(0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 1d, -1d),\\n Arrays.asList(0d, 0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, -1d, 0d),\\n Arrays.asList(0d, 0d, 0d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, -1d),\\n Arrays.asList(1d, 1d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d, 0d),\\n Arrays.asList(0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d, 0d, 0d, 0d),\\n Arrays.asList(0d, 0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d, 0d, 0d),\\n Arrays.asList(0d, 0d, 0d, 0d, -1d, 0d, 1d, 0d, 0d, 0d, 0d),\\n Arrays.asList(0d, 0d, 0d, 0d, 1d, 1d, 0d, -1d, 0d, 0d, 0d),\\n Arrays.asList(0d, 0d, 0d, 0d, 0d, 0d, 1d, 1d, 0d, 0d, 0d));\\n List<Double> b = Arrays.asList(11d, 11d, 0d, 4d, 4d, 40d, 0d, 0d, 40d, 0d, 151d);\\n List<Double> solution = cramersRule(mat, b);\\n System.out.println(\\\"Solution = \\\" + cramersRule(mat, b));\\n System.out.printf(\\\"X = %.2f%n\\\", solution.get(8));\\n System.out.printf(\\\"Y = %.2f%n\\\", solution.get(9));\\n System.out.printf(\\\"Z = %.2f%n\\\", solution.get(10));\\n }\\n\\n private static List<Double> cramersRule(Matrix matrix, List<Double> b) {\\n double denominator = matrix.determinant();\\n List<Double> result = new ArrayList<>();\\n for ( int i = 0 ; i < b.size() ; i++ ) {\\n result.add(matrix.replaceColumn(b, i).determinant() / denominator);\\n }\\n return result;\\n }\\n\\n private static class Matrix {\\n\\n private List<List<Double>> matrix;\\n\\n @Override\\n public String toString() {\\n return matrix.toString();\\n }\\n\\n @SafeVarargs\\n public Matrix(List<Double> ... lists) {\\n matrix = new ArrayList<>();\\n for ( List<Double> list : lists) {\\n matrix.add(list);\\n }\\n }\\n\\n public Matrix(List<List<Double>> mat) {\\n matrix = mat;\\n }\\n\\n public double determinant() {\\n if ( matrix.size() == 1 ) {\\n return get(0, 0);\\n }\\n if ( matrix.size() == 2 ) {\\n return get(0, 0) * get(1, 1) - get(0, 1) * get(1, 0);\\n }\\n double sum = 0;\\n double sign = 1;\\n for ( int i = 0 ; i < matrix.size() ; i++ ) {\\n sum += sign * get(0, i) * coFactor(0, i).determinant();\\n sign *= -1;\\n }\\n return sum;\\n }\\n\\n private Matrix coFactor(int row, int col) {\\n List<List<Double>> mat = new ArrayList<>();\\n for ( int i = 0 ; i < matrix.size() ; i++ ) {\\n if ( i == row ) {\\n continue;\\n }\\n List<Double> list = new ArrayList<>();\\n for ( int j = 0 ; j < matrix.size() ; j++ ) {\\n if ( j == col ) {\\n continue;\\n }\\n list.add(get(i, j));\\n }\\n mat.add(list);\\n }\\n return new Matrix(mat);\\n }\\n\\n private Matrix replaceColumn(List<Double> b, int column) {\\n List<List<Double>> mat = new ArrayList<>();\\n for ( int row = 0 ; row < matrix.size() ; row++ ) {\\n List<Double> list = new ArrayList<>();\\n for ( int col = 0 ; col < matrix.size() ; col++ ) {\\n double value = get(row, col);\\n if ( col == column ) {\\n value = b.get(row);\\n }\\n list.add(value);\\n }\\n mat.add(list);\\n }\\n return new Matrix(mat);\\n }\\n\\n private double get(int row, int col) {\\n return matrix.get(row).get(col);\\n }\\n\\n }\\n\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"def solve(r11; r31; r52; r54):\\n range(1;r31 - 1) as $X\\n | range(1; r31 - 1) as $Y\\n | (($Y - $X) | select(. > 0)) as $Z\\n | (r52 + $X) as $R41\\n | (r52 + $Y) as $R42\\n | select($R41 + $R42 == r31)\\n | ($Y + r54) as $R43\\n | (r54 + $Z) as $R44\\n | ($R42 + $R43) as $R32\\n | ($R43 + $R44) as $R33\\n | (r31 + $R32) as $R21\\n | ($R32 + $R33) as $R22\\n | select($R21 + $R22 == r11)\\n | [$X, $Y, $Z];\\n\\nsolve(151; 40; 11; 4),\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"include \\\"rc-cramers-rule\\\";\\ndef solve(top; mid; a; b):\\n cramer(\\n [ [7, 7],\\n [2, 1]];\\n [top - 4*(a+b), mid-2*a]);\\n\\nsolve(151; 40; 11; 4)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function pascal(a::Integer, b::Integer, mid::Integer, top::Integer)\\n yd = round((top - 4 * (a + b)) / 7)\\n !isinteger(yd) && return 0, 0, 0\\n y = Int(yd)\\n x = mid - 2a - y\\n return x, y, y - x\\nend\\n\\nx, y, z = pascal(11, 4, 40, 151)\\nif !iszero(x)\\n println(\\\"Solution: x = $x, y = $y, z = $z.\\\")\\nelse\\n println(\\\"There is no solution.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.3\\n\\ndata class Solution(val x: Int, val y: Int, val z: Int)\\n\\nfun Double.isIntegral(tolerance: Double = 0.0) =\\n (this - Math.floor(this)) <= tolerance || (Math.ceil(this) - this) <= tolerance\\n\\nfun pascal(a: Int, b: Int, mid: Int, top: Int): Solution {\\n val yd = (top - 4 * (a + b)) / 7.0\\n if (!yd.isIntegral(0.0001)) return Solution(0, 0, 0)\\n val y = yd.toInt()\\n val x = mid - 2 * a - y\\n return Solution(x, y, y - x)\\n}\\n\\nfun main(args: Array<String>) {\\n val (x, y, z) = pascal(11, 4, 40, 151)\\n if (x != 0)\\n println(\\\"Solution is: x = $x, y = $y, z = $z\\\")\\n else\\n println(\\\"There is no solutuon\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"sys := {22 + x + y = 40, 78 + 5*y + z = 151, x + z = y}:\\nsolve(sys, {x,y,z});\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"b+c==a\\nd+e==b\\ne+f==c\\ng+h==d\\nh+i==e\\ni+j==f\\nl+X==g\\nl+Y==h\\nn+Y==i\\nn+Z==j\\nX+Z==Y\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"a->151\\nd->40\\nl->11\\nn->4\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"eqs={a==b+c,d+e==b,e+f==c,g+h==d,h+i==e,i+j==f,l+X==g,l+Y==h,n+Y==i,n+Z==j,Y==X+Z};\\nknowns={a->151,d->40,l->11,n->4};\\nSolve[eqs/.knowns,{b,c,e,f,g,h,i,j,X,Y,Z}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{b -> 81, c -> 70, e -> 41, f -> 29, g -> 16, h -> 24, i -> 17, j -> 12, X -> 5, Y -> 13, Z -> 8}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"\\t\\t\\t\\t151\\n\\t\\t\\t81\\t\\t70\\n\\t\\t40\\t\\t41\\t\\t29\\n\\t16\\t\\t24\\t\\t17\\t\\t12\\n5\\t\\t11\\t\\t13\\t\\t4\\t\\t8\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"triangle[n_, m_] := Nest[MovingMap[Total, #, 1] &, {x, 11, y, 4, z}, n - 1][[m]]\\nSolve[{triangle[3, 1] == 40, triangle[5, 1] == 151, y == x + z}, {x, y, z}]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"{{x -> 5, y -> 13, z -> 8}}\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"%Pascal's Triangle Puzzle. Nigel Galloway, February 17th., 2020\\nint: N11=151; constraint N11=N21+N22;\\nvar 1..N11: N21=N31+N32;\\nvar 1..N11: N22=N32+N33;\\nint: N31=40; constraint N31=N41+N42;\\nvar 1..N11: N32=N42+N43;\\nvar 1..N11: N33=N43+N44;\\nvar 1..N11: N41=X+11;\\nvar 1..N11: N42=Y+11;\\nvar 1..N11: N43=Y+4;\\nvar 1..N11: N44=Z+4;\\nvar 1..N11: X;\\nvar 1..N11: Y=X+Z;\\nvar 1..N11: Z;\\n\",\n \"language\": \"MiniZinc\"\n },\n {\n \"code\": \"import strutils\\n\\ntype\\n\\n BlockValue = object\\n known: int\\n x, y, z: int\\n\\n Variables = tuple[x, y, z: int]\\n\\nfunc `+=`(left: var BlockValue; right: BlockValue) =\\n ## Symbolically add one block to another.\\n left.known += right.known\\n left.x += right.x - right.z # Z is excluded as n(Y - X - Z) = 0.\\n left.y += right.y + right.z\\n\\nproc toString(n: BlockValue; vars: Variables): string =\\n ## Return the representation of the block value, when X, Y, Z are known.\\n result = $(n.known + n.x * vars.x + n.y * vars.y + n.z * vars.z)\\n\\nproc Solve2x2(a11, a12, b1, a21, a22, b2: int): Variables =\\n ## Solve a puzzle, supposing an integer solution exists.\\n if a22 == 0:\\n result.x = b2 div a21\\n result.y = (b1 - a11 * result.x) div a12\\n else:\\n result.x = (b1 * a22 - b2 * a12) div (a11 * a22 - a21 * a12)\\n result.y = (b1 - a11 * result.x) div a12\\n result.z = result.y - result.x\\n\\nvar blocks : array[1..5, array[1..5, BlockValue]] # The lower triangle contains blocks.\\n\\n# The bottom blocks.\\nblocks[5][1] = BlockValue(x: 1)\\nblocks[5][2] = BlockValue(known: 11)\\nblocks[5][3] = BlockValue(y: 1)\\nblocks[5][4] = BlockValue(known: 4)\\nblocks[5][5] = BlockValue(z: 1)\\n\\n# Upward run.\\nfor row in countdown(4, 1):\\n for column in 1..row:\\n blocks[row][column] += blocks[row + 1][column]\\n blocks[row][column] += blocks[row + 1][column + 1]\\n\\n# Now have known blocks 40=[3][1], 151=[1][1] and Y=X+Z to determine X,Y,Z.\\nlet vars = Solve2x2(blocks[1][1].x,\\n blocks[1][1].y,\\n 151 - blocks[1][1].known,\\n blocks[3][1].x,\\n blocks[3][1].y,\\n 40 - blocks[3][1].known)\\n\\n# Print the results.\\nfor row in 1..5:\\n var line = \\\"\\\"\\n for column in 1..row:\\n line.addSep(\\\" \\\")\\n line.add toString(blocks[row][column], vars)\\n echo line\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"%% to compile : ozc -x <file.oz>\\nfunctor\\n\\nimport\\n System Application FD Search\\ndefine\\n\\n proc{Quest Root Rules}\\n\\n proc{Limit Rc Ls}\\n case Ls of nil then skip\\n [] X|Xs then\\n {Limit Rc Xs}\\n case X of N#V then\\n Rc.N =: V\\n [] N1#N2#N3 then\\n Rc.N1 =: Rc.N2 + Rc.N3\\n end\\n end\\n end\\n\\n proc {Pyramid R}\\n {FD.tuple solution 15 0#FD.sup R} %% non-negative integers domain\\n %% 01 , pyramid format\\n %% 02 03\\n %% 04 05 06\\n %% 07 08 09 10\\n %% 11 12 13 14 15\\n R.1 =: R.2 + R.3 %% constraints of Pyramid of numbers\\n R.2 =: R.4 + R.5\\n R.3 =: R.5 + R.6\\n R.4 =: R.7 + R.8\\n R.5 =: R.8 + R.9\\n R.6 =: R.9 + R.10\\n R.7 =: R.11 + R.12\\n R.8 =: R.12 + R.13\\n R.9 =: R.13 + R.14\\n R.10 =: R.14 + R.15\\n\\n {Limit R Rules} %% additional constraints\\n\\n {FD.distribute ff R}\\n end\\n in\\n {Search.base.one Pyramid Root} %% search for solution\\n end\\n\\n local\\n Root R\\n in\\n {Quest Root [1#151 4#40 12#11 14#4 13#11#15]} %% supply additional constraint rules\\n if {Length Root} >= 1 then\\n R = Root.1\\n {For 1 15 1\\n proc{$ I}\\n if {Member I [1 3 6 10]} then\\n {System.printInfo R.I#'\\\\n'}\\n else\\n {System.printInfo R.I#' '}\\n end\\n end\\n }\\n else\\n {System.showInfo 'No solution found.'}\\n end\\n end\\n\\n {Application.exit 0}\\nend\\n\",\n \"language\": \"Oz\"\n },\n {\n \"code\": \"Pascals_triangle_puzzle(topvalue=151,leftsidevalue=40,bottomvalue1=11,bottomvalue2=4) = {\\ny=(topvalue-(4*(bottomvalue1+bottomvalue2)))/7;\\nx=leftsidevalue-(y+2*bottomvalue1);\\nz=y-x;\\nprint(x\\\",\\\"y\\\",\\\"z); }\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"# set up triangle\\nmy $rows = 5;\\nmy @tri = map { [ map { {x=>0,z=>0,v=>0,rhs=>undef} } 1..$_ ] } 1..$rows;\\n$tri[0][0]{rhs} = 151;\\n$tri[2][0]{rhs} = 40;\\n$tri[4][0]{x} = 1;\\n$tri[4][1]{v} = 11;\\n$tri[4][2]{x} = 1;\\n$tri[4][2]{z} = 1;\\n$tri[4][3]{v} = 4;\\n$tri[4][4]{z} = 1;\\n\\n# aggregate from bottom to top\\nfor my $row ( reverse 0..@tri-2 ) {\\n for my $col ( 0..@{$tri[$row]}-1 ){\\n $tri[$row][$col]{$_} = $tri[$row+1][$col]{$_}+$tri[$row+1][$col+1]{$_} for 'x','z','v';\\n }\\n}\\n# find equations\\nmy @eqn;\\nfor my $row ( @tri ) {\\n for my $col ( @$row ){\\n push @eqn, [ $$col{x}, $$col{z}, $$col{rhs}-$$col{v} ] if defined $$col{rhs};\\n }\\n}\\n# print equations\\nprint \\\"Equations:\\\\n\\\";\\nprint \\\" x + z = y\\\\n\\\";\\nprintf \\\"%d x + %d z = %d\\\\n\\\", @$_ for @eqn;\\n# solve\\nmy $f = $eqn[0][1] / $eqn[1][1];\\n$eqn[0][$_] -= $f * $eqn[1][$_] for 0..2;\\n$f = $eqn[1][0] / $eqn[0][0];\\n$eqn[1][$_] -= $f * $eqn[0][$_] for 0..2;\\n# print solution\\nprint \\\"Solution:\\\\n\\\";\\nmy $x = $eqn[0][2]/$eqn[0][0];\\nmy $z = $eqn[1][2]/$eqn[1][1];\\nmy $y = $x+$z;\\nprintf \\\"x=%d, y=%d, z=%d\\\\n\\\", $x, $y, $z;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Pascal_triangle_Puzzle.exw\\n -- =======================================\\n --\\n -- I approached this with a view to solving general pyramid puzzles, not just the one given.\\n --\\n -- This little ditty converts the pyramid to rules quite nicely, then uses a modified copy\\n -- of solveN() from [[Solving_coin_problems#Phix]] to solve those simultaneous equations.\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pyramid</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">151</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"x\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"y\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"z\\\"</span><span style=\\\"color: #0000FF;\\\">}}</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rules</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- each cell in the pyramid is either an integer final value or an equation.\\n -- initially the equations are strings, we substitute all with triplets of\\n -- the form {k,x,z} ie k+l*x+m*z, and known values < last row become rules.</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">object</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">],</span> <span style=\\\"color: #000000;\\\">equ</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"x\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ie 0 + one x</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"y\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ie 0 + one x plus one z</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"z\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- ie 0 + one z</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- examples: x+11 is {0,1,0}+{11,0,0} -> {11,1,0},\\n -- 11+y is {11,0,0}+{0,1,1} -> {11,1,1},\\n -- 40=\\\"\\\"+\\\"\\\" is {40,0,0}={22,2,1} ==> {18,2,1}</span>\\n <span style=\\\"color: #000000;\\\">equ</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">equ</span>\\n <span style=\\\"color: #008080;\\\">else</span> <span style=\\\"color: #000000;\\\">prc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">equ</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">prc</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]-</span><span style=\\\"color: #000000;\\\">equ</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">rules</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">equ</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">prc</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #7060A8;\\\">ppOpt</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #004600;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_StrFmt</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">pp_IntCh</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"equations\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"rules\\\"</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {18,2,1} === 18=2x+z\\n -- {73,5,6} === 73=5x+6z</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"=====\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">)==</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- more work needed!?\\n\\n -- modified copy of solveN() from Solving_coin_problems.exw as promised, a\\n -- bit of a sledgehammer to crack a peanut is the phrase you are looking for:</span>\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">solveN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- Based on https://mathcs.clarku.edu/~djoyce/ma105/simultaneous.html\\n -- aka the ancient Chinese Jiuzhang suanshu ~100 B.C. (!!)\\n --\\n -- Example (not related to the task problem):\\n -- rules = <nowiki>{{</nowiki>18,1,1},{38,1,5<nowiki>}}</nowiki>, ie 18==x+y, 38==x+5y\\n -- ==> {13,5}, ie x=13, y=5\\n --\\n -- In the elimination phase, both x have multipliers of 1, ie both rii and rij are 1,\\n -- so we can ignore the two sq_mul and just do [sq_sub] (38=x+5y)-(18=x+y)==>(20=4y).\\n -- Obviously therefore y is 5 and substituting backwards x is 13.\\n --\\n -- Example2 (taken from the task problem):\\n -- rules = <nowiki>{{</nowiki>18,2,1},{73,5,6<nowiki>}}</nowiki>, ie 18==2x+z, 73==5x+6z\\n -- ==> <nowiki>{{</nowiki>18,2,1},{56,0,7<nowiki>}}</nowiki>, ie rules[2]:=rules[2]*2-rules[1]*5 (eliminate)\\n -- ==> <nowiki>{{</nowiki>18,2,1},8}, ie rules[2]:=56/7, aka z:=8 (substitute)\\n -- ==> <nowiki>{{</nowiki>10,2,0},8}, ie rules[1]-=1z (substitute)\\n -- ==> {5,8}, ie rules[1]:=10/2, aka x:=5 (substitute)\\n -- ==> {5,8}, ie x=5, z=8\\n -- </span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rj</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">rii</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">rji</span>\\n <span style=\\\"color: #000000;\\\">rules</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- successively eliminate (grow lower left triangle of 0s)</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rii</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (see note below)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">rj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">rji</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rji</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">rj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sq_sub</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rii</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">sq_mul</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rji</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">assert</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]==</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (job done)</span>\\n <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rj</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- then substitute each backwards</span>\\n <span style=\\\"color: #000000;\\\">ri</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">rii</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]/</span><span style=\\\"color: #000000;\\\">ri</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (all else should be 0)</span>\\n <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rii</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">rj</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">rji</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">rji</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">-=</span> <span style=\\\"color: #000000;\\\">rji</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">rii</span>\\n <span style=\\\"color: #000000;\\\">rj</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">rj</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">rules</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Obviously these next two lines directly embody knowledge from the task, and\\n -- would need changing for an even slightly different version of the problem:</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">solveN</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rules</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">z</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (as per task desc)</span>\\n\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"x=%d, y=%d, z=%d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">z</span><span style=\\\"color: #0000FF;\\\">})</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- finally evaluate all the equations and print it.</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">z</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pyramid</span><span style=\\\"color: #0000FF;\\\">)</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">solveN</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">18</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">73</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}})</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- -- {5,13,8}</span>\\n\\n <span style=\\\"color: #7060A8;\\\">ppOpt</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #004600;\\\">pp_Nest</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- Or, hand-coding 11 simultaneous equations for 11 unknowns:\\n -- (be warned I had to reorder a bit to avoid rii==0 mishaps,\\n -- perhaps solveN() should find or even sort rules somehow)\\n --sequence pyramid = <nowiki>{{</nowiki>151},\\n -- {\\\"a\\\",\\\"b\\\"},\\n -- {40,\\\"c\\\",\\\"d\\\"},\\n -- {\\\"e\\\",\\\"f\\\",\\\"g\\\",\\\"h\\\"},\\n -- {\\\"x\\\", 11,\\\"y\\\", 4,\\\"z\\\"<nowiki>}}</nowiki>\\n -- a b c d e f g h x y z</span>\\n <span style=\\\"color: #7060A8;\\\">pp</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">solveN</span><span style=\\\"color: #0000FF;\\\">({{</span><span style=\\\"color: #000000;\\\">151</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- a+b=151</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 40+c=a</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- c+d=b</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- g+h=d</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- e+f=40</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- f+g=c</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- x+11=e</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- y+4=g</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 11+y=f</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- 4+z=h</span>\\n <span style=\\\"color: #0000FF;\\\">{</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- x+z=y\\n -- })) -- {81,70,41,29,16,24,17,12,5,13,8}</span>\\n <span style=\\\"color: #0000FF;\\\">})[-</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- {5,13,8}</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">Y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">151</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">))/</span><span style=\\\"color: #000000;\\\">7</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">X</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">40</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">Y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">Z</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">Y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">X</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"Two-liner: x=%d, y=%d, z=%d\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">X</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">Z</span><span style=\\\"color: #0000FF;\\\">})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import cp.\\n\\ngo =>\\n puzzle(T, X, Y,Z),\\n foreach(TT in T)\\n println(TT)\\n end,\\n println([x=X,y=Y,z=Z]),\\n nl,\\n fail, % are there any more solutions?\\n nl.\\n\\n% Port of the Prolog solution\\npuzzle(Ts, X, Y, Z) :-\\n Ts = [ [151],\\n [_, _],\\n [40, _, _],\\n [_, _, _, _],\\n [X, 11, Y, 4, Z]],\\n Y #= X + Z,\\n triangle(Ts),\\n Vs = vars(Ts),\\n Vs :: 0..10000,\\n solve(Vs).\\n\\ntriangle([T|Ts]) :-\\n ( Ts = [N|_] -> triangle_(T, N), triangle(Ts) ; true ).\\n\\ntriangle_([], _).\\ntriangle_([T|Ts],[A,B|Rest]) :-\\n T #= A + B, triangle_(Ts, [B|Rest]).\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"import cp.\\n\\npuzzle2 =>\\n N = 5, % number of rows\\n Len = (N*(N+1)) div 2, % number of entries\\n\\n % The triangle numbers for 1..N\\n T = [I*(I+1) div 2 : I in 1..N],\\n\\n % The index of first number to use in addition\\n % create the indices of the numbers to add,\\n % i.e. Adds[I] + Adds[I+1]\\n Adds = new_list(T[N-1]),\\n Adds[1] := 2,\\n foreach(I in 2..T[N-1])\\n % \\\"jump\\\" of 2 when i-1 is a triangle number\\n if membchk(I-1,T) then\\n Adds[I] := Adds[I-1] + 2\\n else\\n Adds[I] := Adds[I-1] + 1\\n end\\n end,\\n\\n % the pyramid\\n MaxVal = 10_000,\\n L = new_list(Len),\\n L :: 1..MaxVal,\\n\\n % The clues.\\n L = [ 151,\\n _, _,\\n 40, _, _,\\n _, _,_ , _ ,\\n X, 11, Y, 4, Z\\n ],\\n\\n % The sums\\n foreach(I in 1..T[N-1])\\n L[I] #= L[Adds[I]]+L[Adds[I]+1]\\n end,\\n\\n % The extra constraint\\n Y #= X + Z,\\n\\n solve(L),\\n println([x=X,y=Y,z=Z]),\\n fail, % check if there is another solution\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"import cp.\\n\\npuzzle3 =>\\n % 1\\n % 2 3\\n % 4 5 6\\n % 7 8 9 10\\n %11 12 13 14 15\\n\\n X = new_list(15),\\n X :: 0..10_000,\\n X[1] #= X[2]+X[3],\\n X[2] #= X[4]+X[5],\\n X[3] #= X[5]+X[6],\\n X[4] #= X[7]+X[8],\\n X[5] #= X[8]+X[9],\\n X[6] #= X[9]+X[10],\\n X[7] #= X[11]+X[12],\\n X[8] #= X[12]+X[13],\\n X[9] #= X[13]+X[14],\\n X[10] #= X[14]+X[15],\\n X[13] #= X[11] + X[15], % Y=X+Z,\\n\\n % The hints\\n X[1] #= 151,\\n X[4] #= 40,\\n X[12] #= 11,\\n X[14] #= 4,\\n\\n solve(X),\\n println([x=X[11],y=X[13],z=X[15]]),\\n fail,\\n nl.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"(be number (@N @Max)\\n (^ @C (box 0))\\n (repeat)\\n (or\\n ((^ @ (>= (val (-> @C)) (-> @Max))) T (fail))\\n ((^ @N (inc (-> @C)))) ) )\\n\\n(be + (@A @B @Sum)\\n (^ @ (-> @A))\\n (^ @ (-> @B))\\n (^ @Sum (+ (-> @A) (-> @B))) )\\n\\n(be + (@A @B @Sum)\\n (^ @ (-> @A))\\n (^ @ (-> @Sum))\\n (^ @B (- (-> @Sum) (-> @A)))\\n T\\n (^ @ (ge0 (-> @B))) )\\n\\n(be + (@A @B @Sum)\\n (number @A @Sum)\\n (^ @B (- (-> @Sum) (-> @A))) )\\n\\n#{\\n 151\\n A B\\n 40 C D\\n E F G H\\n X 11 Y 4 Z\\n}#\\n\\n(be puzzle (@X @Y @Z)\\n (+ @A @B 151)\\n (+ 40 @C @A)\\n (+ @C @D @B)\\n (+ @E @F 40)\\n (+ @F @G @C)\\n (+ @G @H @D)\\n (+ @X 11 @E)\\n (+ 11 @Y @F)\\n (+ @Y 4 @G)\\n (+ 4 @Z @H)\\n (+ @X @Z @Y)\\n T )\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \":- use_module(library(clpfd)).\\n\\npuzzle(Ts, X, Y, Z) :-\\n Ts = [ [151],\\n [_, _],\\n [40, _, _],\\n [_, _, _, _],\\n [X, 11, Y, 4, Z]],\\n Y #= X + Z, triangle(Ts), append(Ts, Vs), Vs ins 0..sup, label(Vs).\\n\\ntriangle([T|Ts]) :- ( Ts = [N|_] -> triangle_(T, N), triangle(Ts) ; true ).\\n\\ntriangle_([], _).\\ntriangle_([T|Ts], [A,B|Rest]) :- T #= A + B, triangle_(Ts, [B|Rest]).\\n\\n% ?- puzzle(_,X,Y,Z).\\n% X = 5,\\n% Y = 13,\\n% Z = 8 ;\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"; Known;\\n; A.\\n; [ 151]\\n; [a ][b ]\\n; [40][c ][d ]\\n; [e ][f ][g ][h ]\\n; [ X][11][ Y][ 4][ Z]\\n;\\n; B.\\n; Y = X + Z\\n\\nProcedure.i SolveForZ(x)\\n Protected a,b,c,d,e,f,g,h,z\\n For z=0 To 20\\n e=x+11: f=11+(x+z): g=(x+z)+4: h=4+z\\n If e+f=40\\n c=f+g : d=g+h: a=40+c: b=c+d\\n If a+b=151\\n ProcedureReturn z\\n EndIf\\n EndIf\\n Next z\\n ProcedureReturn -1\\nEndProcedure\\n\\nDefine x=-1, z=0, title$=\\\"Pascal's triangle/Puzzle in PureBasic\\\"\\nRepeat\\n x+1\\n z=SolveForZ(x)\\nUntil z>=0\\nMessageRequester(title$,\\\"X=\\\"+Str(x)+#CRLF$+\\\"Y=\\\"+Str(x+z)+#CRLF$+\\\"Z=\\\"+Str(z))\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"# Pyramid solver\\n# [151]\\n# [ ] [ ]\\n# [ 40] [ ] [ ]\\n# [ ] [ ] [ ] [ ]\\n#[ X ] [ 11] [ Y ] [ 4 ] [ Z ]\\n# X -Y + Z = 0\\n\\ndef combine( snl, snr ):\\n\\n\\tcl = {}\\n\\tif isinstance(snl, int):\\n\\t\\tcl['1'] = snl\\n\\telif isinstance(snl, string):\\n\\t\\tcl[snl] = 1\\n\\telse:\\n\\t\\tcl.update( snl)\\n\\n\\tif isinstance(snr, int):\\n\\t\\tn = cl.get('1', 0)\\n\\t\\tcl['1'] = n + snr\\n\\telif isinstance(snr, string):\\n\\t\\tn = cl.get(snr, 0)\\n\\t\\tcl[snr] = n + 1\\n\\telse:\\n\\t\\tfor k,v in snr.items():\\n\\t\\t\\tn = cl.get(k, 0)\\n\\t\\t\\tcl[k] = n+v\\n\\treturn cl\\n\\n\\ndef constrain(nsum, vn ):\\n\\tnn = {}\\n\\tnn.update(vn)\\n\\tn = nn.get('1', 0)\\n\\tnn['1'] = n - nsum\\n\\treturn nn\\n\\ndef makeMatrix( constraints ):\\n\\tvmap = set()\\n\\tfor c in constraints:\\n\\t\\tvmap.update( c.keys())\\n\\tvmap.remove('1')\\n\\tnvars = len(vmap)\\n\\tvmap = sorted(vmap)\\t\\t# sort here so output is in sorted order\\n\\tmtx = []\\n\\tfor c in constraints:\\n\\t\\trow = []\\n\\t\\tfor vv in vmap:\\n\\t\\t\\trow.append(float(c.get(vv, 0)))\\n\\t\\trow.append(-float(c.get('1',0)))\\n\\t\\tmtx.append(row)\\n\\t\\n\\tif len(constraints) == nvars:\\n\\t\\tprint 'System appears solvable'\\n\\telif len(constraints) < nvars:\\n\\t\\tprint 'System is not solvable - needs more constraints.'\\n\\treturn mtx, vmap\\n\\n\\ndef SolvePyramid( vl, cnstr ):\\n\\n\\tvl.reverse()\\n\\tconstraints = [cnstr]\\n\\tlvls = len(vl)\\n\\tfor lvln in range(1,lvls):\\n\\t\\tlvd = vl[lvln]\\n\\t\\tfor k in range(lvls - lvln):\\n\\t\\t\\tsn = lvd[k]\\n\\t\\t\\tll = vl[lvln-1]\\n\\t\\t\\tvn = combine(ll[k], ll[k+1])\\n\\t\\t\\tif sn is None:\\n\\t\\t\\t\\tlvd[k] = vn\\n\\t\\t\\telse:\\n\\t\\t\\t\\tconstraints.append(constrain( sn, vn ))\\n\\n\\tprint 'Constraint Equations:'\\n\\tfor cstr in constraints:\\n\\t\\tfset = ('%d*%s'%(v,k) for k,v in cstr.items() )\\n\\t\\tprint ' + '.join(fset), ' = 0'\\n\\n\\tmtx,vmap = makeMatrix(constraints)\\n\\n\\tMtxSolve(mtx)\\n\\n\\td = len(vmap)\\n\\tfor j in range(d):\\n\\t\\tprint vmap[j],'=', mtx[j][d]\\n\\n\\ndef MtxSolve(mtx):\\n\\t# Simple Matrix solver...\\n\\n\\tmDim = len(mtx)\\t\\t\\t# dimension---\\n\\tfor j in range(mDim):\\n\\t\\trw0= mtx[j]\\n\\t\\tf = 1.0/rw0[j]\\n\\t\\tfor k in range(j, mDim+1):\\n\\t\\t\\trw0[k] *= f\\n\\t\\t\\n\\t\\tfor l in range(1+j,mDim):\\n\\t\\t\\trwl = mtx[l]\\n\\t\\t\\tf = -rwl[j]\\n\\t\\t\\tfor k in range(j, mDim+1):\\n\\t\\t\\t\\trwl[k] += f * rw0[k]\\n\\n\\t# backsolve part ---\\n\\tfor j1 in range(1,mDim):\\n\\t\\tj = mDim - j1\\n\\t\\trw0= mtx[j]\\n\\t\\tfor l in range(0, j):\\n\\t\\t\\trwl = mtx[l]\\n\\t\\t\\tf = -rwl[j]\\n\\t\\t\\trwl[j] += f * rw0[j]\\n\\t\\t\\trwl[mDim] += f * rw0[mDim]\\n\\n\\treturn mtx\\n\\n\\np = [ [151], [None,None], [40,None,None], [None,None,None,None], ['X', 11, 'Y', 4, 'Z'] ]\\naddlConstraint = { 'X':1, 'Y':-1, 'Z':1, '1':0 }\\nSolvePyramid( p, addlConstraint)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from csp import Problem\\n\\np = Problem()\\npvars = \\\"R2 R3 R5 R6 R7 R8 R9 R10 X Y Z\\\".split()\\n# 0-151 is the possible finite range of the variables\\np.addvars(pvars, xrange(152))\\np.addrule(\\\"R7 == X + 11\\\")\\np.addrule(\\\"R8 == Y + 11\\\")\\np.addrule(\\\"R9 == Y + 4\\\")\\np.addrule(\\\"R10 == Z + 4\\\")\\np.addrule(\\\"R7 + R8 == 40\\\")\\np.addrule(\\\"R5 == R8 + R9\\\")\\np.addrule(\\\"R6 == R9 + R10\\\")\\np.addrule(\\\"R2 == 40 + R5\\\")\\np.addrule(\\\"R3 == R5 + R6\\\")\\np.addrule(\\\"R2 + R3 == 151\\\")\\np.addrule(\\\"Y == X + Z\\\")\\nfor sol in p.xsolutions():\\n print [sol[k] for k in \\\"XYZ\\\"]\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket/base\\n(require racket/list)\\n\\n(struct cell (v x z) #:transparent)\\n\\n(define (cell-add cx cy)\\n (cell (+ (cell-v cx) (cell-v cy))\\n (+ (cell-x cx) (cell-x cy))\\n (+ (cell-z cx) (cell-z cy))))\\n\\n(define (cell-sub cx cy)\\n (cell (- (cell-v cx) (cell-v cy))\\n (- (cell-x cx) (cell-x cy))\\n (- (cell-z cx) (cell-z cy))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (row-above row) (map cell-add (drop row 1) (drop-right row 1)))\\n\\n(define row0 (list (cell 0 1 0) (cell 11 0 0) (cell 0 1 1) (cell 4 0 0) (cell 0 0 1)))\\n(define row1 (row-above row0))\\n(define row2 (row-above row1))\\n(define row3 (row-above row2))\\n(define row4 (row-above row3))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define eqn40 (cell-sub (car row4) (cell 151 0 0)))\\n(define eqn20 (cell-sub (car row2) (cell 40 0 0)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define (det2 eqnx eqny get-one get-oth)\\n (- (* (get-one eqnx) (get-oth eqny)) (* (get-one eqny) (get-oth eqnx))))\\n\\n(define (cramer2 eqnx eqny get-val get-unk get-oth)\\n (/ (det2 eqnx eqny get-val get-oth)\\n (det2 eqnx eqny get-unk get-oth)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"(define x (- (cramer2 eqn20 eqn40 cell-v cell-x cell-z)))\\n(define z (- (cramer2 eqn20 eqn40 cell-v cell-z cell-x)))\\n\\n(displayln (list \\\"X\\\" x))\\n(displayln (list \\\"Y\\\" (+ x z)))\\n(displayln (list \\\"Z\\\" z))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# set up triangle\\nmy $rows = 5;\\nmy @tri = (1..$rows).map: { [ { x => 0, z => 0, v => 0, rhs => Nil } xx $_ ] }\\n@tri[0][0]<rhs> = 151;\\n@tri[2][0]<rhs> = 40;\\n@tri[4][0]<x> = 1;\\n@tri[4][1]<v> = 11;\\n@tri[4][2]<x> = 1;\\n@tri[4][2]<z> = 1;\\n@tri[4][3]<v> = 4;\\n@tri[4][4]<z> = 1;\\n\\n# aggregate from bottom to top\\nfor @tri - 2 ... 0 -> $row {\\n for 0 ..^ @tri[$row] -> $col {\\n @tri[$row][$col]{$_} = @tri[$row+1][$col]{$_} + @tri[$row+1][$col+1]{$_} for 'x','z','v';\\n }\\n}\\n\\n# find equations\\nmy @eqn = gather for @tri -> $row {\\n for @$row -> $cell {\\n take [ $cell<x>, $cell<z>, $cell<rhs> - $cell<v> ] if defined $cell<rhs>;\\n }\\n}\\n\\n# print equations\\nsay \\\"Equations:\\\";\\nsay \\\" x + z = y\\\";\\nfor @eqn -> [$x,$z,$y] { say \\\"$x x + $z z = $y\\\" }\\n\\n# solve\\nmy $f = @eqn[0][1] / @eqn[1][1];\\n@eqn[0][$_] -= $f * @eqn[1][$_] for 0..2;\\n$f = @eqn[1][0] / @eqn[0][0];\\n@eqn[1][$_] -= $f * @eqn[0][$_] for 0..2;\\n\\n# print solution\\nsay \\\"Solution:\\\";\\nmy $x = @eqn[0][2] / @eqn[0][0];\\nmy $z = @eqn[1][2] / @eqn[1][1];\\nmy $y = $x + $z;\\nsay \\\"x=$x, y=$y, z=$z\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program solves a (Pascal's) \\\"Pyramid of Numbers\\\" puzzle given four values. */\\n /* ╔══════════════════════════════════════════════════╗\\n ║ answer ║\\n ║ / ║\\n ║ mid / ║\\n ║ \\\\ 151 ║\\n ║ \\\\ ααα ααα ║\\n ║ 40 ααα ααα ║\\n ║ ααα ααα ααα ααα ║\\n ║ x 11 y 4 z ║\\n ║ / \\\\ ║\\n ║ find: / \\\\ ║\\n ║ x y z b d ║\\n ╚══════════════════════════════════════════════════╝ */\\n do #=2; _= sourceLine(#); n= pos('_', _) /* [↓] this DO loop shows (above) box.*/\\n if n\\\\==0 then leave; say _ /*only display up to the above line. */\\n end /*#*/; say /* [↑] this is a way for in─line doc. */\\nparse arg b d mid answer . /*obtain optional variables from the CL*/\\nif b=='' | b==\\\",\\\" then b= 11 /*Not specified? Then use the default.*/\\nif d=='' | d==\\\",\\\" then d= 4 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif mid='' | mid==\\\",\\\" then mid= 40 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif answer='' | answer==\\\",\\\" then answer= 151 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\n big= answer - 4*b - 4*d /*calculate BIG number less constants*/\\n do x=-big to big\\n do y=-big to big\\n if x+y\\\\==mid - 2*b then iterate /*40 = x+2B+Y ──or── 40-2*11 = x+y */\\n do z=-big to big\\n if z \\\\== y - x then iterate /*Z has to equal Y-X (Y= X+Z) */\\n if x+y*6+z==big then say right('x =', n) x right(\\\"y =\\\",n) y right('z =',n) z\\n end /*z*/\\n end /*y*/\\n end /*x*/ /*stick a fork in it, we're all done. */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"require 'rref'\\n\\npyramid = [\\n [ 151],\\n [nil,nil],\\n [40,nil,nil],\\n [nil,nil,nil,nil],\\n [\\\"x\\\", 11,\\\"y\\\", 4,\\\"z\\\"]\\n]\\npyramid.each{|row| p row}\\n\\nequations = [[1,-1,1,0]] # y = x + z\\n\\ndef parse_equation(str)\\n eqn = [0] * 4\\n lhs, rhs = str.split(\\\"=\\\")\\n eqn[3] = rhs.to_i\\n for term in lhs.split(\\\"+\\\")\\n case term\\n when \\\"x\\\" then eqn[0] += 1\\n when \\\"y\\\" then eqn[1] += 1\\n when \\\"z\\\" then eqn[2] += 1\\n else eqn[3] -= term.to_i\\n end\\n end\\n eqn\\nend\\n\\n-2.downto(-5) do |row|\\n pyramid[row].each_index do |col|\\n val = pyramid[row][col]\\n sum = \\\"%s+%s\\\" % [pyramid[row+1][col], pyramid[row+1][col+1]]\\n if val.nil?\\n pyramid[row][col] = sum\\n else\\n equations << parse_equation(sum + \\\"=#{val}\\\")\\n end\\n end\\nend\\n\\nreduced = convert_to(reduced_row_echelon_form(equations), :to_i)\\n\\nfor eqn in reduced\\n if eqn[0] + eqn[1] + eqn[2] != 1\\n fail \\\"no unique solution! #{equations.inspect} ==> #{reduced.inspect}\\\"\\n elsif eqn[0] == 1 then x = eqn[3]\\n elsif eqn[1] == 1 then y = eqn[3]\\n elsif eqn[2] == 1 then z = eqn[3]\\n end\\nend\\n\\nputs\\nputs \\\"x == #{x}\\\"\\nputs \\\"y == #{y}\\\"\\nputs \\\"z == #{z}\\\"\\n\\nanswer = []\\nfor row in pyramid\\n answer << row.collect {|cell| eval cell.to_s}\\nend\\nputs\\nanswer.each{|row| p row}\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"object PascalTriangle extends App {\\n\\n val (x, y, z) = pascal(11, 4, 40, 151)\\n\\n def pascal(a: Int, b: Int, mid: Int, top: Int): (Int, Int, Int) = {\\n val y = (top - 4 * (a + b)) / 7\\n val x = mid - 2 * a - y\\n (x, y, y - x)\\n }\\n\\n println(if (x != 0) s\\\"Solution is: x = $x, y = $y, z = $z\\\" else \\\"There is no solution.\\\")\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"# set up triangle\\nvar rows = 5\\nvar tri = rows.of {|i| (i+1).of { Hash(x => 0, z => 0, v => 0, rhs => nil) } }\\ntri[0][0]{:rhs} = 151\\ntri[2][0]{:rhs} = 40\\ntri[4][0]{:x} = 1\\ntri[4][1]{:v} = 11\\ntri[4][2]{:x} = 1\\ntri[4][2]{:z} = 1\\ntri[4][3]{:v} = 4\\ntri[4][4]{:z} = 1\\n \\n# aggregate from bottom to top\\nfor row in (tri.len ^.. 1) {\\n for col in (^tri[row-1]) {\\n [:x, :z, :v].each { |key|\\n tri[row-1][col]{key} = (tri[row][col]{key} + tri[row][col+1]{key})\\n }\\n }\\n}\\n \\n# find equations\\nvar eqn = gather {\\n for r in tri {\\n for c in r {\\n take([c{:x}, c{:z}, c{:rhs} - c{:v}]) if defined(c{:rhs})\\n }\\n }\\n}\\n \\n# print equations\\nsay \\\"Equations:\\\"\\nsay \\\" x + z = y\\\"\\nfor x,z,y in eqn { say \\\"#{x}x + #{z}z = #{y}\\\" }\\n \\n# solve\\nvar f = (eqn[0][1] / eqn[1][1])\\n{|i| eqn[0][i] -= (f * eqn[1][i]) } << ^3\\nf = (eqn[1][0] / eqn[0][0])\\n{|i| eqn[1][i] -= (f * eqn[0][i]) } << ^3\\n \\n# print solution\\nsay \\\"Solution:\\\"\\nvar x = (eqn[0][2] / eqn[0][0])\\nvar z = (eqn[1][2] / eqn[1][1])\\nvar y = (x + z)\\nsay \\\"x=#{x}, y=#{y}, z=#{z}\\\"\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"program main;\\n\\n class Triangle;\\n rand bit [7:0] a,b,c,d,e,f,g,h,X,Y,Z;\\n\\n function new();\\n randomize;\\n $display(\\\" [%0d]\\\", 151);\\n $display(\\\" [%0d][%0d]\\\", a, b);\\n $display(\\\" [%0d][%0d][%0d]\\\", 40,c,d);\\n $display(\\\" [%0d][%0d][%0d][%0d]\\\", e,f,g,h);\\n $display(\\\" [%0d][%0d][%0d][%0d][%0d]\\\",X,11,Y,4,Z);\\n endfunction\\n\\n constraint structure {\\n 151 == a + b;\\n\\n a == 40 + c;\\n b == c + d;\\n\\n 40 == e + f;\\n c == f + g;\\n d == g + h;\\n\\n e == X + 11;\\n f == 11 + Y;\\n g == Y + 4;\\n h == 4 + Z;\\n };\\n\\n constraint extra {\\n Y == X + Z;\\n };\\n\\n endclass\\n\\n Triangle answer = new;\\nendprogram\\n\",\n \"language\": \"SystemVerilog\"\n },\n {\n \"code\": \"package require Tcl 8.5\\nnamespace path ::tcl::mathop\\n\\nset pyramid {\\n {151.0 \\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\"}\\n {\\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\"}\\n {40.0 \\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\"}\\n {\\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\" \\\"\\\"}\\n {x 11.0 y 4.0 z}\\n}\\n\\nset equations {{1 -1 1 0}}\\n\\nproc simplify {terms val} {\\n set vars {0 0 0}\\n set x 0\\n set y 1\\n set z 2\\n foreach term $terms {\\n switch -exact -- $term {\\n x - y - z {\\n lset vars [set $term] [+ 1 [lindex $vars [set $term]]]\\n }\\n default {\\n set val [- $val $term]\\n }\\n }\\n }\\n return [concat $vars $val]\\n}\\n\\nfor {set row [+ [llength $pyramid] -2]} {$row >= 0} {incr row -1} {\\n for {set cell 0} {$cell <= $row} {incr cell } {\\n\\tset sum [concat [lindex $pyramid [+ 1 $row] $cell] [lindex $pyramid [+ 1 $row] [+ 1 $cell]]]\\n\\tif {[set val [lindex $pyramid $row $cell]] ne \\\"\\\"} {\\n lappend equations [simplify $sum $val]\\n\\t} else {\\n lset pyramid $row $cell $sum\\n }\\n }\\n}\\n\\nset solution [toRREF $equations]\\nforeach row $solution {\\n lassign $row a b c d\\n if {$a + $b + $c > 1} {\\n error \\\"problem does not have a unique solution\\\"\\n }\\n if {$a} {set x $d}\\n if {$b} {set y $d}\\n if {$c} {set z $d}\\n}\\nputs \\\"x=$x\\\"\\nputs \\\"y=$y\\\"\\nputs \\\"z=$z\\\"\\n\\nforeach row $pyramid {\\n set newrow {}\\n foreach cell $row {\\n if {$cell eq \\\"\\\"} {\\n lappend newrow \\\"\\\"\\n } else {\\n lappend newrow [expr [join [string map [list x $x y $y z $z] $cell] +]]\\n }\\n }\\n lappend solved $newrow\\n}\\nprint_matrix $solved\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"./fmt\\\" for Fmt\\n\\nvar isIntegral = Fn.new { |x, tol| x.fraction.abs <= tol }\\n\\nvar pascal = Fn.new { |a, b, mid, top|\\n var yd = (top - 4 * (a + b)) / 7\\n if (!isIntegral.call(yd, 0.0001)) return [0, 0, 0]\\n var y = yd.truncate\\n var x = mid - 2*a - y\\n return [x, y, y - x]\\n}\\n\\nvar sol = pascal.call(11, 4, 40, 151)\\nif (sol[0] != 0) {\\n Fmt.print(\\\"Solution is: x = $d, y = $d, z = $d\\\", sol[0], sol[1], sol[2])\\n} else {\\n System.print(\\\"There is no solution\\\")\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc Print; int N, A, B, C, D, E;\\nint I, P;\\ndef Tab = $09;\\n[P:= @A; \\\\point to first number\\nfor I:= N to 5-1 do ChOut(0, Tab);\\nfor I:= 0 to N-1 do\\n [IntOut(0, P(I)); ChOut(0, Tab); ChOut(0, Tab)];\\nCrLf(0);\\n];\\n\\nint N, P, Q, R, S, T, U, V, W, X, Y, Z; \\\\ 151\\n[for X:= 0 to 40-11 do \\\\ N P\\n for Z:= 0 to 151-4 do \\\\ Q R S\\n [Y:= X+Z; \\\\ T U V W\\n T:= X+11; \\\\X 11 Y 4 Z\\n U:= 11+Y;\\n V:= Y+4;\\n W:= 4+Z;\\n if T+U = 40 then\\n [R:= U+V;\\n S:= V+W;\\n N:= 40+R;\\n P:= R+S;\\n if N+P = 151 then\\n [Print(1, 151);\\n Print(2, N, P);\\n Print(3, 40, R, S);\\n Print(4, T, U, V, W);\\n Print(5, X, 11, Y, 4, Z);\\n exit;\\n ];\\n ];\\n ];\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"# Pyramid solver\\n# [151]\\n# [ ] [ ]\\n# [ 40] [ ] [ ]\\n# [ ] [ ] [ ] [ ]\\n#[ X ] [ 11] [ Y ] [ 4 ] [ Z ]\\n# Known: X - Y + Z = 0\\n\\np:=T( L(151), L(Void,Void), L(40,Void,Void), L(Void,Void,Void,Void),\\n L(\\\"X\\\", 11, \\\"Y\\\", 4, \\\"Z\\\") );\\naddlConstraint:=Dictionary( \\\"X\\\",1, \\\"Y\\\",-1, \\\"Z\\\",1, \\\"1\\\",0 );\\nsolvePyramid(p, addlConstraint);\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn solvePyramid([List]vl,[Dictionary]cnstr){ //ListOfLists,Hash-->zip\\n vl=vl.reverse();\\n constraints:=L(cnstr);\\n lvls:=vl.len();\\n foreach lvln in ([1..lvls-1]){\\n lvd:=vl[lvln];\\n foreach k in (lvls-lvln){\\n sn:=lvd[k];\\n\\t ll:=vl[lvln-1];\\n\\t vn:=combine(ll[k], ll[k+1]);\\n\\t if(Void==sn) lvd[k]=vn;\\n\\t else constraints.append(constrainK(sn,vn));\\n }\\n }\\n println(\\\"Constraint Equations:\\\");\\n constraints.pump(Console.println,fcn(hash){\\n hash.pump(List,fcn([(k,v)]){\\\"%d*%s\\\".fmt(v,k)}).concat(\\\" + \\\") + \\\" = 0\\\"\\n });\\n\\n mtx,vmap:=makeMatrix(constraints);\\n mtxSolve(mtx);\\n\\n d:=vmap.len();\\n foreach j in (d){ println(vmap[j],\\\" = \\\", mtx[j][d]); }\\n}\\n\\nfcn [mixin=Dictionary] constrainK([Int]nsum,[Dictionary]vn){ //-->new hash of old hash, sum K\\n nn:=vn.copy(); nn[\\\"1\\\"]=nn.find(\\\"1\\\",0) - nsum;\\n return(nn.makeReadOnly());\\n}\\n\\nfcn combine(snl,snr){ //Int|String|Hash *2 --> new Hash\\n cl:=Dictionary();\\n if(snl.isInstanceOf(Int)) cl[\\\"1\\\"]=snl;\\n else if(snl.isInstanceOf(String)) cl[snl]=1;\\n else\\t\\t\\t\\t cl =snl.copy();\\n\\n if(snr.isInstanceOf(Int)) cl[\\\"1\\\"]=cl.find(\\\"1\\\",0) + snr;\\n else if(snr.isInstanceOf(String)) cl[snr]=cl.find(snr,0) + 1;\\n else{ foreach k,v in (snr){ \\t cl[k] =cl.find(k,0) + v; } }\\n return(cl.makeReadOnly())\\n}\\n\\n //-->(listMatrix(row(X,Y,Z,c),row...),List(\\\"X\\\",\\\"Y\\\",\\\"Z\\\"))\\nfcn makeMatrix([Dictionary]constraints){\\n vmap:=Dictionary();// create a sorted list of the variable names in constraints\\n foreach c in (constraints){ vmap.extend(c) } // no duplicate names\\n vmap.del(\\\"1\\\"); vmap=vmap.keys.sort(); # sort here so output is in sorted order\\n\\n mtx:=constraints.pump(List,'wrap(c){ // create list of [writeable] rows\\n vmap.pump(List, c.find.fp1(0),\\\"toFloat\\\").copy()\\n .append(-c.find(\\\"1\\\",0).toFloat())\\n }).copy();\\n\\n nvars:=vmap.len();\\n if(constraints.len()==nvars) println(\\\"System appears solvable\\\");\\n else if(constraints.len()<nvars)\\n println(\\\"System is not solvable - needs more constraints.\\\");\\n return(mtx,vmap);\\n}\\n\\nfcn mtxSolve([List]mtx){ //munge mtx\\t# Simple Matrix solver...\\n mDim:=mtx.len();\\t\\t\\t# num rows\\n foreach j in (mDim){\\n rw0:=mtx[j];\\n f:=1.0/rw0[j];\\n foreach k in ([j..mDim]){ rw0[k]=rw0[k]*f }\\n foreach l in ([j+1..mDim-1]){\\n rwl:=mtx[l]; f:=-rwl[j];\\n\\t foreach k in ([j..mDim]){ rwl[k]+=f*rw0[k] }\\n }\\n }\\n # backsolve part ---\\n foreach j1 in ([1..mDim-1]){\\n j:=mDim - j1; rw0:=mtx[j];\\n foreach l in (j){\\n\\t rwl:=mtx[l]; f:=-rwl[j];\\n\\t rwl[j] +=f*rw0[j];\\n\\t rwl[mDim]+=f*rw0[mDim];\\n }\\n }\\n return(mtx);\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pascals-triangle-Puzzle"}}},{"rowIdx":1492,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Password_generator\n","language":"00-META"},{"code":"Create a password generation program which will generate passwords containing random ASCII characters from the following groups:\n lower-case letters: a ──► z\n upper-case letters: A ──► Z\n digits: 0 ──► 9\n other printable characters: <big><big> !\"#$%&'()*+,-./:;<=>?@[]^_{|}~ </big></big>\n (the above character list excludes white-space, backslash and grave) \n\n\nThe generated password(s) must include ''at least one'' (of each of the four groups):\n lower-case letter, \n upper-case letter,\n digit (numeral), and \n one \"other\" character. \n\n<br>\nThe user must be able to specify the password length and the number of passwords to generate. \n\nThe passwords should be displayed or written to a file, one per line.\n\nThe randomness should be from a system source or library. \n\nThe program should implement a help option or button which should describe the program and options when invoked. \n\nYou may also allow the user to specify a seed value, and give the option of excluding visually similar characters.\n\nFor example: <big><big> Il1 O0 5S 2Z </big></big> where the characters are: \n::::* capital eye, lowercase ell, the digit one\n::::* capital oh, the digit zero \n::::* the digit five, capital ess\n::::* the digit two, capital zee\n<!-- or zed, on the other side of the pond. -->\n<br><br>\n\n","language":"00-TASK"},{"code":"LDY #0\nLDX #20\nLOOP:\nLDA $FE ;load a random byte\nBMI LOOP ;IF GREATER THAN 7F, ROLL AGAIN\nCMP #$21 ;ASCII CODE FOR !\nBCC LOOP\nCMP #$5C\nBEQ LOOP ;NO \\\nCMP #$60\nBEQ LOOP ;NO `\n;else, must be a good character\nSTA $0200,Y\nINY\nDEX\nBNE LOOP\nBRK ;end program\n","language":"6502-Assembly"},{"code":"\tcpu\t8086\n\tbits\t16\n\t;;;\tMS-DOS syscalls\ngettim:\tequ\t2Ch\t; Get system time\nwrite:\tequ\t40h\t; Write to file\nexit:\tequ\t4Ch\t; Exit with return code\n\t;;;\tMS-DOS process data\narg:\tequ\t80h\t; Command line argument (length + string)\n\t;;;\tBIOS calls\nconout:\tequ\t0Eh\t; Write character to console\nvstate:\tequ\t0Fh\t; Get current video state\nsection\t.text\n\torg\t100h\n\tmov\tah,gettim\t; Seed the RNG using the system time\n\tint\t21h\t\t; (in case of no argument)\n\tmov\t[rnddat],cx\n\tmov\t[rnddat+2],dx\n\tmov\tsi,arg\t\t; See if we have any arguments\n\tlodsb\n\ttest\tal,al\n\tjnz\thasarg\n\tjmp\tusage\t\t; If not, print usage string\n\t;;;\tParse the command line arguments\nhasarg:\txor\tbx,bx\t\t; We do, zero-terminate the string\n\txchg\tal,bl\n\tmov\t[si+bx],al\n\tmov\tdi,count\t; Place to start reading arguments\ndoarg:\tlodsb\t\t\t; Get argument byte\n.chr:\ttest\tal,al\t\t; Zero?\n\tjnz \t.arg\t\t; If not, there are arguments left\n\tjmp\tcheck\t\t; If so, we're done\n.arg:\tcmp\tal,' '\t\t; Space?\n\tje\tdoarg\t\t; Then get next character\n\tcmp\tal,'/'\t\t; Option?\n\tje\topt\n\tdec\tbyte [nargs]\t; Otherwise, it's an argument\n\tjnz\trdnum\t\t; Read a number if we still need one\n\tjmp\tusage\t\t; Otherwise, incorrect arguments\nrdnum:\txor\tbp,bp\t\t; Place to keep number\n.chr:\tmov\tbl,al\t\t; Keep the character in case not a digit\n\tsub\tal,'0'\t\t; Make into digit\n\tcmp\tal,9\t\t; Valid digit?\n\tja\t.done\t\t; If not, done with number\n\tadd\tbp,bp\t\t; Multiply accumulator by 10\n\tmov\tdx,bp\n\tadd\tbp,bp\n\tadd \tbp,bp\n\tadd\tbp,dx\n\txor\tah,ah\t\t; Then add the digit\n\tadd\tbp,ax\n\tlodsb\t\t\t; Read next digit\n\tjmp\t.chr\t\t\n.done:\tmov\tax,bp\t\t; Write the number into memory\n\tstosw\n\tmov\tal,bl\t\t; Restore the character (next argument)\n\tjmp\tdoarg.chr\nopt:\tlodsb\t\t\t; Get option character\n\tor\tal,32\t\t; Make lowercase\n\tcmp\tal,'e'\t\t; E?\n\tje\t.e\n\tcmp\tal,'s'\t\t; S?\n\tje\t.s\n\tjmp\tusage\t\t; If not, invalid argument\n.e:\tinc\tbyte [excl]\t; /E: turn on exclusion\n\tjmp\tdoarg\n.s:\tlodsb\t\t\t; /S: should be followed by '='\n\tcmp\tal,'='\n\tje\t.s_ok\n\tjmp\tusage\t\t; If not, invalid argument\n.s_ok:\txor\tbp,bp\t\t; DX:BP = RNG state\n\txor\tdx,dx\n.hex:\tlodsb\t\t\t; Get (potential) hex digit\n\tmov\tah,al\t\t; Keep it around\n\tcall\thexdgt\t\t; Parse hexadecimal digit\n\tjnc\t.hdone\t\t; If invalid, we're done\n\tshl\tbp,1\t\t; Make room for it in the state\n\trcl\tdx,1\t\t; Because it's a 32-bit value,\n\tshl\tbp,1\t\t; which is stored in two 16-bit registers,\n\trcl\tdx,1\t\t; we have to shift and rotate the bits\n\tshl\tbp,1\t\t; one by one.\n\trcl\tdx,1\n\tshl\tbp,1\n\trcl\tdx,1\n\tor\tdl,al\t\t; Finally, add in the hexadecimal digit\n\tjmp\t.hex\n.hdone:\tmov\t[rnddat],bp\t; Store random seed\n\tmov\t[rnddat+2],dx\n\tmov\tal,ah\t\t; Restore the next character\n\tjmp\tdoarg.chr\n\t;;;\tCheck the arguments\ncheck:\tdec\tbyte [nargs]\t; Were all arguments used?\n\tjz\t.argok\n\tjmp\tusage\n.argok:\tmov\tcx,[count]\t; CX = count\n\tmov\tbp,[length]\t; BP = length\n\ttest\tcx,cx\t\t; Sanity check (count must not be zero)\n\tmov\tsi,errmsg.cnt\n\tjnz\t.cntok\n\tjmp\terror\n.cntok:\tcmp\tbp,4\t\t; Length must be at least four\n\tmov\tsi,errmsg.len\n\tjae\t.len2\n\tjmp\terror\n.len2:\tcmp\tbp,255\t\t; Length must be no more than 255\n\tmov\tsi,errmsg.lmax\n\tjbe\tmkmask\n\tjmp\terror\n\t;;;\tMake a bitmask in which BP fits (for generating random\n\t;;;\tnumbers in the right range)\nmkmask:\tmov\tcx,bp\n\tmov\tbx,cx\n.loop:\tshr\tcx,1\n\tor\tbx,cx\n\ttest\tcx,cx\n\tjnz\t.loop\n\tstc\n\trcl \tbx,1\n\tmov\t[lmask],bl\t; Password <= 255 chars\n\t;;;\tGenerate a password\ngenpwd:\tlea\tcx,[bp-4]\t; Get length minus four\n\tmov\tdi,buffer\t; Write password into buffer\n\tmov\tdl,[excl]\t; Exclusion flag\n\tmov\tbx,lc\t\t; A lowercase letter,\n\tmov\tah,lc.len\t\n\tcall\trndchr\n\tmov\tbx,uc\t\t; An uppercase letter\n\tcall\trndchr\t\t; (same length of course)\n\tmov\tbx,dgt\t\t; A digit,\n\tmov\tah,dgt.len\n\tcall\trndchr\n\tmov\tbx,sym\t\t; And a symbol\n\tmov\tah,sym.len\n\tcall \trndchr\n\ttest\tcx,cx\t\t; If CX=0, we need no extra characters\n\tjz\t.done\n\tmov\tbx,cr\t\t; Otherwise, we need CX extra characters\n\tmov\tah,cr.len\n.loop:\tcall\trndchr\n\tloop\t.loop\n.done:\tmov\tax,0A0Dh\t; End with a newline\n\tstosw\n\t;;;\tSwap the first four characters with random characters\n\t;;;\tfrom the password, so the four necessary characters won't\n\t;;;\tnecessarily be at the beginning.\nswap:\tmov\tdx,bp \t\t; Get length\n\tmov\tdh,[lmask]\t; Load the mask\n\tmov\tsi,buffer\t; Password buffer\n\txor\tbh,bh\n\txor \tah,ah\t\t; Starting at zero\n.loc:\tcall\trand\t\t; Get random byte\n\tand\tal,dh\t\t; Mask off unused bits\n\tcmp\tal,dl\t\t; Result within password?\n\tjae\t.loc\t\t; If not, get another random number\n\tmov\tbl,ah\t\t; Load first character in CL\n\tmov\tcl,[si+bx]\n\tmov\tbl,al\t\t; Load random character in CH\n\tmov\tch,[si+bx]\n\tmov\t[si+bx],cl\t; Write them back the other way around\n\tmov\tbl,ah\n\tmov\t[si+bx],ch\n\tinc\tah\t\t; Next character\n\tcmp\tah,4\t\t; Are we there yet?\n\tjb\t.loc\t\t; If not, do another character.\n\t;;;\tWrite password to standard output\n\txor\tbx,bx\t\t; File handle 0 = stdout\n\tlea\tcx,[bp+2]\t; Length = password length + 2 (for newline)\n\tmov\tdx,si\t\t; Location of password\n\tmov\tah,write\t; Write the password\n\tint\t21h\n\tjnc\t.ok\t\t; Carry clear = success\n\tmov\tsi,errmsg.wrt\t; Otherwise, print error message\n\tjmp\terror\n.ok:\tdec\tword [count] \t; Need any more passwords?\n\tjz\tstop\t\t; If not, stop\n\tjmp\tgenpwd\t\t; Otherwise, make another password\n\t;;;\tQuit with return code 0 (success)\nstop:\tmov\tax,exit<<8\n\tint\t21h\n\t;;;\tGenerate a random character. BX=table, AH=length,\n\t;;;\tDL=exclusion on/off\nrndchr:\tcall\trand\t\t; Random number\n\tand\tal,7Fh\t\t; from 0 to 127\n\tcmp\tal,ah\t\t; Within valid length?\n\tjae\trndchr\t\t; If not, get new random number\n\txlatb\t\t\t; Otherwise, get character from table\n\ttest\tdl,dl\t\t; Is exclusion on?\n\tjz\t.out\t\t; If not, just store it\n\tpush\tcx\t\t; Otherwise, keep CX around,\n\tpush\tdi\t\t; and DI,\n\tmov\tcx,ex.len\t; See if character is in exclusion table\n\tmov\tdi,ex\n\trepne\tscasb\n\tpop\tdi\t\t; restore DI\n\tpop\tcx\t\t; Restore CX\n\tje\trndchr\t\t; And if it was found, get another character\n.out:\tstosb\t\t\t; Store in password buffer\n\tret\n\t;;;\tRandom number generator using XABC algorithm\n\t;;;\tReturns random byte in AL\nrand:\tpush\tcx\n\tpush\tdx\n\tmov\tcx,[rnddat]\t; CH=X CL=A\n\tmov\tdx,[rnddat+2]\t; DH=B DL=C\n\tinc\tch\t\t; X++\n\txor\tcl,ch\t\t; A ^= X\n\txor\tcl,dl\t\t; A ^= C\n\tadd\tdh,cl\t\t; B += A\n\tmov\tal,dh\t\t; C' = B\n\tshr\tal,1\t\t; C' >>= 1\n\txor\tal,cl\t\t; C' ^= A\n\tadd\tal,dl\t\t; C' += C\n\tmov\tdl,al\t\t; C = C'\n\tmov\t[rnddat],cx\n\tmov\t[rnddat+2],dx\n\tpop\tdx\n\tpop\tcx\n\tret\n\t;;;\tIf AL is a hexadecimal digit in ASCII, set AL to be its\n\t;;;\tvalue. Carry flag set if digit was valid.\nhexdgt:\tor\tal,32\t\t; Make letter lowercase (numbers unchanged)\n\tsub\tal,'0'\t\t; Subtract 0\n\tcmp\tal,10\t\t; If it is a valid digit now, we're done\n\tjc\t.out\n\tsub\tal,39\t\t; Otherwise, correct for\n\tcmp\tal,17\t\n.out:\tret\n\t;;;\tWrite the help message, and stop with return code 2\nusage:\tmov\tsi,help\n\t;;;\tWrite an error message, directly to the console, bypassing\n\t;;;\tDOS to ensure it does not end up in the redirected output.\n\t;;;\tThen, stop with return code 2 (failure)\nerror:\tmov\tah,vstate\t; Retrieve current video state\n\tint\t10h\t\t; (this sets BH = current page)\n.loop\tlodsb\t\t\t; Get string byte\n\ttest\tal,al\t\t; Zero?\n\tjz\t.out\t\t; Then we have reached the end\n\tmov\tah,conout\t; Otherwise, write the character\n\tint\t10h\n\tjmp\t.loop\t\t; And get another one\n.out:\tmov\tax,exit<<8|2\t; Stop with error code 2\n\tint\t21h\nsection\t.data\nnargs:\tdb\t3\t\t; We need two non-option arguments\nexcl:\tdb\t0\t\t; Exclusion is off by default\ncr:\t;;;\tPassword characters\nlc:\tdb\t'abcdefghijklmnopqrstuvwxyz'\n.len:\tequ\t$-lc\nuc:\tdb\t'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\n.len:\tequ\t$-uc\ndgt:\tdb\t'0123456789'\n.len:\tequ\t$-dgt\nsym:\tdb\t'!\"#$%&()*+,-./:;<=>?@[]^_{|}~',39 ; 39=single quote\n.len:\tequ \t$-sym\ncr.len:\tequ\t$-cr\nex:\tdb\t'Il1O05S2Z'\t; Excluded characters\n.len:\tequ\t$-ex\n\t;;;\tHelp message\nhelp:\tdb\t'PASSGEN [/S=seed] [/E] count length',13,10\n\tdb\t9,'generate <count> passwords of length <length>',13,10\n\tdb\t13,10\n\tdb\t9,'/S=seed: set RNG seed (hexadecimal number)',13,10\n\tdb\t9,'/E: exclude visually similar characters',13,10\n\tdb\t0\nerrmsg:\t;;;\tError messages\n.len:\tdb\t'Minimum password length is 4.',0\n.lmax:\tdb\t'Maximum password length is 255.',0\n.cnt:\tdb\t'At least one password must be generated.',0\n.wrt:\tdb\t'Write error.',0\nsection\t.bss\ncount:\tresw\t1\t\t; Amount of passwords to generate\nlength:\tresw\t1\t\t; Length of passwords\nlmask:\tresb\t1\t\t; Mask for random number generation\nrnddat:\tresb\t4\t\t; RNG state\nbuffer:\tresb\t257\t\t; Space to store password\n","language":"8086-Assembly"},{"code":"BYTE FUNC GetNumParam(CHAR ARRAY text BYTE min,max)\n BYTE res\n\n DO\n PrintF(\"Input %S (%B-%B): \",text,min,max)\n res=InputB()\n UNTIL res>=min AND res<=max\n OD\nRETURN (res)\n\nBYTE FUNC GetBoolParam(CHAR ARRAY text)\n CHAR ARRAY s(255)\n\n DO\n PrintF(\"%S? (Y/N): \",text)\n InputS(s)\n IF s(0)=1 THEN\n IF s(1)='y OR s(1)='Y THEN\n RETURN (1)\n ELSEIF s(1)='n OR s(1)='N THEN\n RETURN (0)\n FI\n FI\n OD\nRETURN (0)\n\nPROC Shuffle(CHAR ARRAY s)\n BYTE i,j\n CHAR tmp\n\n i=s(0)\n WHILE i>1\n DO\n j=Rand(i)+1\n tmp=s(i) s(i)=s(j) s(j)=tmp\n i==-1\n OD\nRETURN\n\nBYTE FUNC Contains(CHAR ARRAY s CHAR c)\n BYTE i\n\n IF s(0)=0 THEN\n RETURN (0)\n FI\n FOR i=1 TO s(0)\n DO\n IF s(i)=c THEN\n RETURN (1)\n FI\n OD\nRETURN (0)\n\nCHAR FUNC RandChar(CHAR ARRAY s,unsafe)\n BYTE len\n CHAR c\n\n len=s(0)\n DO\n c=s(Rand(len)+1)\n UNTIL Contains(unsafe,c)=0\n OD\nRETURN (c)\n\nPROC Generate(CHAR ARRAY res BYTE len,safe)\n DEFINE PTR=\"CARD\"\n CHAR ARRAY st,\n upper=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n lower=\"abcdefghijklmnopqrstuvwxyz\",\n numbers=\"0123456789\",\n special=\"!\"\"#$%&'()*+,-./:;<=>?@[]^_|\",\n unsafe=\"Il1O05S2Z\"\n PTR ARRAY sets(4)\n BYTE i\n\n sets(0)=upper sets(1)=lower\n sets(2)=numbers sets(3)=special\n\n res(0)=len\n FOR i=1 TO len\n DO\n IF safe THEN\n res(i)=RandChar(sets(i MOD 4),unsafe)\n ELSE\n res(i)=RandChar(sets(i MOD 4),\"\")\n FI\n OD\n Shuffle(res)\nRETURN\n\nPROC PrintHelp()\n PutE()\n PrintE(\"Program generates random passwords\")\n PrintE(\"containing at least one upper-case\")\n PrintE(\"letter, one lower-case letter, one\")\n PrintE(\"digit and one special character.\")\n PrintE(\"It is possible to exclude visually\")\n PrintE(\"similar characters Il1O05S2Z.\")\n PutE()\nRETURN\n\nPROC Main()\n BYTE len,count,safe,i,again,help\n CHAR ARRAY password(255)\n\n help=GetBoolParam(\"Show help\")\n IF help THEN\n PrintHelp()\n FI\n\n DO\n len=GetNumParam(\"length of password\",4,30)\n safe=GetBoolParam(\"Exclude similar chars\")\n count=GetNumParam(\"number of passwords\",1,10)\n PutE()\n FOR i=1 TO count\n DO\n Generate(password,len,safe)\n PrintF(\"%B. %S%E\",i,password)\n OD\n PutE()\n again=GetBoolParam(\"Generate again\")\n UNTIL again=0\n OD\nRETURN\n","language":"Action-"},{"code":"with Ada.Numerics.Discrete_Random;\nwith Ada.Strings.Fixed;\nwith Ada.Command_Line;\nwith Ada.Integer_Text_IO;\nwith Ada.Text_IO;\n\nprocedure Mkpw is\n\n procedure Put_Usage;\n procedure Parse_Command_Line (Success : out Boolean);\n function Create_Password (Length : in Positive;\n Safe : in Boolean)\n return String;\n\n procedure Put_Usage is\n use Ada.Text_IO;\n begin\n Put_Line (\"Usage: \");\n Put_Line (\" mkpw help - Show this help text \");\n Put_Line (\" mkpw [count <n>] [length <l>] [seed <s>] [safe] \");\n Put_Line (\" count <n> - Number of passwords generated (default 4)\");\n Put_Line (\" length <l> - Password length (min 4) (default 4)\");\n Put_Line (\" seed <l> - Seed for random generator (default 0)\");\n Put_Line (\" safe - Do not use unsafe characters (0O1lIS52Z)\");\n end Put_Usage;\n\n Lower_Set : constant String := \"abcdefghijklmnopqrstuvwxyz\";\n Upper_Set : constant String := \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n Digit_Set : constant String := \"0123456789\";\n Spec_Set : constant String := \"!\"\"#$%&'()*+,-./:;<=>?@[]^_{|}~\";\n Unsafe_Set : constant String := \"0O1lI5S2Z\";\n\n Full_Set : constant String := Lower_Set & Upper_Set & Digit_Set & Spec_Set;\n subtype Full_Indices is Positive range Full_Set'Range;\n\n package Full_Index_Generator is\n new Ada.Numerics.Discrete_Random (Full_Indices);\n\n Index_Generator : Full_Index_Generator.Generator;\n\n Config_Safe : Boolean := False;\n Config_Count : Natural := 4;\n Config_Length : Positive := 6;\n Config_Seed : Integer := 0;\n Config_Show_Help : Boolean := False;\n\n procedure Parse_Command_Line (Success : out Boolean) is\n use Ada.Command_Line;\n Got_Safe, Got_Count : Boolean := False;\n Got_Length, Got_Seed : Boolean := False;\n Last : Positive;\n Index : Positive := 1;\n begin\n Success := False;\n if Argument_Count = 1 and then Argument (1) = \"help\" then\n Config_Show_Help := True;\n return;\n end if;\n\n while Index <= Argument_Count loop\n if Ada.Command_Line.Argument (Index) = \"safe\" then\n if Got_Safe then\n return;\n end if;\n Got_Safe := True;\n Config_Safe := True;\n Index := Index + 1;\n elsif Argument (Index) = \"count\" then\n if Got_Count then\n return;\n end if;\n Got_Count := True;\n Ada.Integer_Text_IO.Get (Item => Config_Count,\n From => Argument (Index + 1),\n Last => Last);\n if Last /= Argument (Index + 1)'Last then\n return;\n end if;\n Index := Index + 2;\n elsif Argument (Index) = \"length\" then\n if Got_Length then\n return;\n end if;\n Got_Length := True;\n Ada.Integer_Text_IO.Get (Item => Config_Length,\n From => Argument (Index + 1),\n Last => Last);\n if Last /= Argument (Index + 1)'Last then\n return;\n end if;\n if Config_Length < 4 then\n return;\n end if;\n Index := Index + 2;\n elsif Argument (Index) = \"seed\" then\n if Got_Seed then\n return;\n end if;\n Got_Seed := True;\n Ada.Integer_Text_IO.Get (Item => Config_Seed,\n From => Argument (Index + 1),\n Last => Last);\n if Last /= Argument (Index + 1)'Last then\n return;\n end if;\n Index := Index + 2;\n else\n return;\n end if;\n end loop;\n Success := True;\n exception\n when Constraint_Error | Ada.Text_IO.Data_Error =>\n null;\n end Parse_Command_Line;\n\n function Create_Password (Length : in Positive;\n Safe : in Boolean)\n return String\n is\n\n function Get_Random (Safe : in Boolean)\n return Character;\n\n function Get_Random (Safe : in Boolean)\n return Character\n is\n use Ada.Strings.Fixed;\n C : Character;\n begin\n loop\n C := Full_Set (Full_Index_Generator.Random (Index_Generator));\n if Safe then\n exit when Index (Source => Unsafe_Set, Pattern => \"\" & C) = 0;\n else\n exit;\n end if;\n end loop;\n return C;\n end Get_Random;\n\n function Has_Four (Item : in String)\n return Boolean;\n\n function Has_Four (Item : in String)\n return Boolean\n is\n use Ada.Strings.Fixed;\n Has_Upper, Has_Lower : Boolean := False;\n Has_Digit, Has_Spec : Boolean := False;\n begin\n for C of Item loop\n if Index (Upper_Set, \"\" & C) /= 0 then Has_Upper := True; end if;\n if Index (Lower_Set, \"\" & C) /= 0 then Has_Lower := True; end if;\n if Index (Digit_Set, \"\" & C) /= 0 then Has_Digit := True; end if;\n if Index (Spec_Set, \"\" & C) /= 0 then Has_Spec := True; end if;\n end loop;\n return Has_Upper and Has_Lower and Has_Digit and Has_Spec;\n end Has_Four;\n\n Password : String (1 .. Length);\n begin\n loop\n for I in Password'Range loop\n Password (I) := Get_Random (Safe);\n end loop;\n exit when Has_Four (Password);\n end loop;\n return Password;\n end Create_Password;\n\n Parse_Success : Boolean;\nbegin\n\n Parse_Command_Line (Parse_Success);\n\n if Config_Show_Help or not Parse_Success then\n Put_Usage; return;\n end if;\n\n if Config_Seed = 0 then\n Full_Index_Generator.Reset (Index_Generator);\n else\n Full_Index_Generator.Reset (Index_Generator, Config_Seed);\n end if;\n\n for Count in 1 .. Config_Count loop\n Ada.Text_IO.Put_Line (Create_Password (Length => Config_Length,\n Safe => Config_Safe));\n end loop;\n\nend Mkpw;\n","language":"Ada"},{"code":"1 N=1\n2 L=8\n3 M$=CHR$(13)\n4 D$=CHR$(4)\n5 S$(0)=\"S\"\n6 F$=\"A FILE\"\n7 C$(1)=\" (CURRENT OPTION)\"\n8 DEF FN R(T)=ASC(MID$(G$(T),INT(RND(1)*LEN(G$(T))+1),1))\n9 GOSUB 750\n10 FOR Q = 0 TO 1 STEP 0\n20 GOSUB 50CHOOSE\n30 NEXT Q\n40 END\n\nREM *** CHOOSE ***\n50 PRINT M$M$\"1 GEN 2 DISP 3 FILE 4 LEN 5 NUM 6 SEED\"\n60 PRINT \"7 CHR 8 HELP 9 QUIT \"CHR$(10)\"CHOOSE AN OPTION: \";\n70 GET K$\n75 IF K$ > CHR$(95) THEN K$ = CHR$(ASC(K$) - 32)\n80 PRINT K$\n85 ON VAL(K$) GOTO 100,200,300,400,500,600,700,800,900\n90 GOTO 210OPTIONS\n\nREM *** GENERATE ***\n100 PRINT M$\n105 IF L > 32 THEN PRINT \"UM... OK, THIS MIGHT TAKE A BIT.\"M$\n110 GOSUB 340OPEN\n115 FOR P=1 TO N\n120 P$=\"\"\n125 FOR I=1 TO L\n135 P$=P$+CHR$(FNR(I*(I<5)))\n140 NEXT I\nREM SHUFFLE FIRST 4\n150 FOR I = 1 TO 4\n151 C$=MID$(P$,I,1)\n152 J=INT(RND(1)*L)+1\n153 H$=MID$(P$,J,1)\n154 P$=MID$(P$,1,J-1)+C$+MID$(P$,J+1,L)\n155 P$=MID$(P$,1,I-1)+H$+MID$(P$,I+1,L)\n156 NEXT I\n180 PRINT P$\n185 NEXT P\n190 GOTO 380CLOSE\n\nREM *** DISPLAY ***\n200 C = 0\nREM *** OPTIONS ***\n210 HOME\n215 PRINT \"PASSWORD GENERATOR\"M$M$\n220 PRINT \"1. GENERATE \"N\" PASSWORD\"S$(N=1)M$\n225 PRINT \"2. DISPLAYED\"C$(C=0)M$\" OR\"\n230 PRINT \"3. WRITTEN TO \"F$C$(C=1)M$\n235 PRINT \"4. SPECIFY THE PASSWORD LENGTH = \"L;M$\n240 PRINT \"5. SPECIFY THE NUMBER OF PASSWORDS TO\"M$TAB(31)\"GENERATE\"\n245 PRINT \"6. SPECIFY A SEED VALUE\"M$\n250 PRINT \"7. EXCLUDE VISUALLY SIMILAR CHARACTERS\"M$\n255 PRINT \"8. HELP AND OPTIONS\"\n260 RETURN\n\nREM *** WRITE TO A FILE ***\n300 C = 1\n310 GOTO 210OPTIONS\nREM *** OPEN A FILE ***\n340 IF NOT C THEN RETURN\n345 PRINT D$\"OPEN \"F$\"\n350 PRINT D$\"CLOSE\"F$\n355 PRINT D$\"DELETE \"F$\n360 PRINT D$\"OPEN \"F$\n365 PRINT D$\"WRITE \"F$\n370 RETURN\nREM *** CLOSE A FILE ***\n380 IF NOT C THEN RETURN\n385 PRINT D$\"CLOSE\"F$\n390 RETURN\n\nREM *** SET PASSWORD LENGTH ***\n400 PRINT M$\n410 FOR I = 0 TO 1 STEP 0\n420 INPUT \"ENTER A NUMBER FROM 4 TO 255 TO SPECIFY THE PASSWORD LENGTH = \";L\n430 IF L >= 4 AND L < 256 THEN RETURN\n440 PRINT \"?OUT OF RANGE\"\n450 NEXT I\n\nREM *** SET NUMBER OF PASSWORDS TO GENERATE ***\n500 PRINT M$\n510 FOR I = 0 TO 1 STEP 0\n520 INPUT \"ENTER A NUMBER FROM 1 AND UP TO SPECIFY THE NUMBER OF PASSWORDS TO GENERATE: \";N\n530 IF N >= 1 THEN RETURN\n540 PRINT \"?OUT OF RANGE.\"\n550 NEXT I\n\nREM *** SET A SEED VALUE ***\n600 PRINT M$\n610 INPUT \"ENTER A SEED VALUE: \";S%\n620 PRINT RND(S%)\n630 RETURN\n\nREM *** EXCLUDE ***\n700 PRINT M$\n705 INPUT \"ENTER CHARACTERS TO EXCLUDE:\";E$\nREM *** GROUPS ***\nREM ALWAYS EXCLUDE BACKSLASH AND BACKTICK (GRAVE)\n710 E$=CHR$(92)+CHR$(96)+E$\n711 FOR G = 1 TO 4\n712 G$(G) = \"\"\n713 NEXT G\n720 FOR G = 1 TO 2\n721 FOR K = ASC(\"A\") + (G - 1) * 32 TO ASC(\"Z\") + (G - 1) * 32\n722 GOSUB 770ADD\n723 NEXT K, G\n730 FOR K = 33 TO 64\n731 G = 3 + (K < ASC(STR$(0)) OR K > ASC(STR$(9)))\n732 GOSUB 770ADD\n733 NEXT K\n734 FOR K = 91 TO 96\n735 GOSUB 770ADD\n736 NEXT K\n737 FOR K = 123 TO 126\n738 GOSUB 770ADD\n739 NEXT K\n740 G$(0) = \"\"\n741 FOR G = 1 TO 4\n742 IF LEN(G$(G)) THEN G$(0) = G$(0) + G$(G) : NEXT G : GOTO 800HELP\n743 ?\"THERE MUST BE AT LEAST ONE CHARUNRACTER IN EACH GROUP\"\n744 GOTO 705\nREM *** DEFAULT (QUICK) ***\n750 G$(1)=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n751 FOR I=97TO122:G$(2)=G$(2)+CHR$(I):NEXT\n753 G$(3)=\"0123456789\"\n754 G$(4)=\"!\"+CHR$(34)+\"#$%&'()*+,-./:;<=>?@\"+CHR$(91)+\"]^\"+CHR$(95)\n755 FOR I=123TO126:G$(4)=G$(4)+CHR$(I):NEXTI\n756 G$(0)=G$(0)+G$(1)+G$(2)+G$(3)\n757 GOTO 210OPTIONS\nREM *** ADD TO GROUP\n770 C$ = CHR$(K)\n775 FOR E = 1 TO LEN(E$)\n780 IF C$ <> MID$(E$,E,1) THEN NEXT E : G$(G)=G$(G)+C$ : ?C$;\n790 RETURN\n\nREM *** HELP ***\n800 HOME\n805 PRINT \"GENERATE PASSWORDS CONTAINING RANDOM\"\n810 PRINT \"ASCII CHARACTERS FROM THESE GROUPS:\"M$\n815 PRINT \" LOWERCASE UPPERCASE DIGIT OTHER\"M$\n820 PRINT \" \"LEFT$(G$(2),9)TAB(13)LEFT$(G$(1),9)TAB(23)LEFT$(G$(3),5)TAB(29)LEFT$(G$(4),11)\n825 PRINT \" \"MID$(G$(2),10,9)TAB(13)MID$(G$(1),10,9)TAB(23)MID$(G$(3),6,5)TAB(29)MID$(G$(4),12,11)\n826 PRINT \" \"MID$(G$(2),19,9)TAB(13)MID$(G$(1),19,9)TAB(29)MID$(G$(4),23,15)M$\n840 PRINT \"YOU MAY CHOOSE THE PASSWORD LENGTH, AND\"\n845 PRINT \"HOW MANY PASSWORDS TO GENERATE. IT IS\"\n850 PRINT \"ENSURED THAT THERE IS AT LEAST ONE\"\n855 PRINT \"CHARACTER FROM EACH OF THE GROUPS IN\"\n860 PRINT \"EACH PASSWORD. THERE IS AN OPTION TO\"\n865 PRINT \"EXCLUDE VISUALLY SIMILAR CHARACTERS.\"\n870 RETURN\n\nREM *** QUIT ***\n900 Q = 1\n910 VTAB 23\n920 RETURN\n","language":"Applesoft-BASIC"},{"code":"lowercase: `a`..`z`\nuppercase: `A`..`Z`\ndigits: `0`..`9`\nother: map split \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" => [to :char]\n\nany: lowercase ++ uppercase ++ digits ++ other\n\ngenerate: function [length][\n if length < 4 [\n print (color #red \"ERROR: \") ++ \"password length too short\"\n exit\n ]\n\n chars: new @[sample lowercase sample uppercase sample digits sample other]\n while [length > size chars][\n 'chars ++ sample any\n ]\n\n join shuffle chars\n]\n\nif 0 = size arg [\n print {\n ---------------------------------\n Arturo password generator\n (c) 2021 drkameleon\n ---------------------------------\n usage: passgen.art <length>\n }\n exit\n]\n\nloop 1..10 'x [\n print generate to :integer first arg\n]\n","language":"Arturo"},{"code":"# syntax: GAWK -f PASSWORD_GENERATOR.AWK [-v mask=x] [-v xt=x]\n#\n# examples:\n# REM 4 character passwords using Rosetta Code default of: lower, upper, number, other\n# GAWK -f PASSWORD_GENERATOR.AWK\n#\n# REM 8 character passwords; Rosetta Code default plus another four\n# GAWK -f PASSWORD_GENERATOR.AWK -v mask=LUNPEEEE\n#\n# REM 8 character passwords ignoring Rosetta Code requirement\n# GAWK -f PASSWORD_GENERATOR.AWK -v mask=EEEEEEEE\n#\n# REM help\n# GAWK -f PASSWORD_GENERATOR.AWK ?\n#\n# sorting:\n# PROCINFO[\"sorted_in\"] is used by GAWK\n# SORTTYPE is used by Thompson Automation's TAWK\n#\nBEGIN {\n PROCINFO[\"sorted_in\"] = \"@ind_str_asc\" ; SORTTYPE = 1\n srand()\n# setup strings of valid characters used by mask\n arr[\"L\"] = \"abcdefghijklmnopqrstuvwxyz\" # Lower case\n arr[\"U\"] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\" # Upper case\n arr[\"N\"] = \"0123456789\" # Numbers\n arr[\"P\"] = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" # Punctuation: I.E. other\n arr[\"A\"] = arr[\"L\"] arr[\"U\"] # Alphabetic: lower and upper case\n arr[\"E\"] = arr[\"L\"] arr[\"U\"] arr[\"N\"] arr[\"P\"] # Everything: lower, upper, number, punctuation\n arr[\"B\"] = \" \" # Blank: a space\n# validate array index and length of assignment\n for (i in arr) {\n if (length(i) != 1) {\n error(sprintf(\"arr[%s], index is invalid\",i))\n }\n if (length(arr[i]) == 0) {\n error(sprintf(\"arr[%s], is null\",i))\n }\n mask_valids = sprintf(\"%s%s\",mask_valids,i)\n }\n# validate command line variables\n if (mask == \"\") {\n mask = \"LUNP\" # satisfy Rosetta Code task requirement\n }\n if (xt == \"\") {\n xt = 10 # default iterations\n }\n if (xt !~ /^[0-9]+$/) {\n error(\"xt is not 0-9\")\n }\n# validate each character in mask\n for (i=1; i<=length(mask); i++) {\n c = substr(mask,i,1)\n if (!(c in arr)) {\n error(sprintf(\"mask position %d is %s, invalid\",i,c))\n }\n }\n# help\n if (ARGV[1] == \"?\") {\n syntax()\n exit(0)\n }\n if (ARGC-1 != 0) {\n error(\"no files allowed on command line\")\n }\n# make passwords\n if (errors == 0) {\n for (i=1; i<=xt; i++) {\n make_password()\n }\n }\n exit(errors+0)\n}\nfunction error(message) {\n printf(\"error: %s\\n\",message)\n errors++\n}\nfunction make_password( c,i,indx,password,valids) {\n for (i=1; i<=length(mask); i++) { # for each character in mask\n c = substr(mask,i,1) # extract 1 character from mask\n valids = arr[c] # valid characters for this position in mask\n indx = int(rand() * length(valids)) + 1\n c = substr(valids,indx,1) # extract 1 character from list of valids\n password = password c # build password\n }\n printf(\"%s\\n\",password)\n}\nfunction syntax( cmd,i) {\n cmd = \"GAWK -f PASSWORD_GENERATOR.AWK\"\n printf(\"syntax: %s [-v mask=x] [-v xt=x]\\n\\n\",cmd)\n printf(\" mask 1..n bytes determines password format and length; consists of %s\\n\",mask_valids)\n for (i in arr) {\n printf(\"%9s - %s\\n\",i,(arr[i] == \" \") ? \"<space>\" : arr[i])\n }\n printf(\" xt number of passwords to generate\\n\\n\")\n printf(\"example: %s -v mask=%s -v xt=%s\\n\",cmd,mask,xt)\n}\n","language":"AWK"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n#define DEFAULT_LENGTH 4\n#define DEFAULT_COUNT 1\n\nchar* symbols[] = {\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\", \"abcdefghijklmnopqrstuvwxyz\", \"0123456789\", \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"};\nint length = DEFAULT_LENGTH;\nint count = DEFAULT_COUNT;\nunsigned seed;\nchar exSymbols = 0;\n\nvoid GetPassword () {\n //create an array of values that determine the number of characters from each category\n int lengths[4] = {1, 1, 1, 1};\n int count = 4;\n while (count < length) {\n lengths[rand()%4]++;\n count++;\n }\n\n //loop through the array of lengths and set the characters in password\n char password[length + 1];\n for (int i = 0; i < length; ) {\n //pick which string to read from\n int str = rand()%4;\n if (!lengths[str])continue; //if the number of characters for that string have been reached, continue to the next interation\n\n char c;\n switch (str) {\n case 2:\n c = symbols[str][rand()%10];\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\n c = symbols[str][rand()%10];\n password[i] = c;\n break;\n\n case 3:\n c = symbols[str][rand()%30];\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\n c = symbols[str][rand()%30];\n password[i] = c;\n break;\n\n default:\n c = symbols[str][rand()%26];\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\n c = symbols[str][rand()%26];\n password[i] = c;\n break;\n }\n\n i++;\n lengths[str]--;\n }\n\n password [length] = '\\0';\n printf (\"%s\\n\", password);\n}\n\nint main (int argc, char* argv[]) {\n seed = (unsigned)time(NULL);\n\n //handle user input from the command line\n for (int i = 1; i < argc; i++) {\n switch (argv[i][1]) {\n case 'l':\n if (sscanf (argv[i+1], \"%d\", &length) != 1) {\n puts (\"Unrecognized input. Syntax: -l [integer]\");\n return -1;\n }\n\n if (length < 4) {\n puts (\"Password length must be at least 4 characters.\");\n return -1;\n }\n i++;\n break;\n\n case 'c':\n if (sscanf (argv[i+1], \"%d\", &count) != 1) {\n puts (\"Unrecognized input. Syntax: -c [integer]\");\n return -1;\n }\n\n if (count <= 0) {\n puts (\"Count must be at least 1.\");\n return -1;\n }\n i++;\n break;\n\n case 's':\n if (sscanf (argv[i+1], \"%d\", &seed) != 1) {\n puts (\"Unrecognized input. Syntax: -s [integer]\");\n return -1;\n }\n i++;\n break;\n\n case 'e':\n exSymbols = 1;\n break;\n\n default:\n help:\n printf (\"Help:\\nThis program generates a random password.\\n\"\n \"Commands:\"\n \"Set password length: -l [integer]\\n\"\n \"Set password count: -c [integer]\\n\"\n \"Set seed: -s [integer]\\n\"\n \"Exclude similiar characters: -e\\n\"\n \"Display help: -h\");\n return 0;\n break;\n }\n }\n\n srand (seed);\n\n for (int i = 0; i < count; i++)\n GetPassword();\n\n return 0;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <string>\n#include <algorithm>\n#include <ctime>\n\nconst std::string CHR[] = { \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\", \"abcdefghijklmnopqrstuvwxyz\",\n \"0123456789\", \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" };\nconst std::string UNS = \"O0l1I5S2Z\";\n\nstd::string createPW( int len, bool safe ) {\n std::string pw;\n char t;\n for( int x = 0; x < len; x += 4 ) {\n for( int y = x; y < x + 4 && y < len; y++ ) {\n do {\n t = CHR[y % 4].at( rand() % CHR[y % 4].size() );\n } while( safe && UNS.find( t ) != UNS.npos );\n pw.append( 1, t );\n }\n }\n std::random_shuffle( pw.begin(), pw.end() );\n return pw;\n}\nvoid generate( int len, int count, bool safe ) {\n for( int c = 0; c < count; c++ ) {\n std::cout << createPW( len, safe ) << \"\\n\";\n }\n std::cout << \"\\n\\n\";\n}\nint main( int argc, char* argv[] ){\n if( argv[1][1] == '?' || argc < 5 ) {\n std::cout << \"Syntax: PWGEN length count safe seed /?\\n\"\n \"length:\\tthe length of the password(min 4)\\n\"\n \"count:\\thow many passwords should be generated\\n\"\n \"safe:\\t1 will exclude visually similar characters, 0 won't\\n\"\n \"seed:\\tnumber to seed the random generator or 0\\n\"\n \"/?\\tthis text\\n\\n\";\n } else {\n int l = atoi( argv[1] ),\n c = atoi( argv[2] ),\n e = atoi( argv[3] ),\n s = atoi( argv[4] );\n if( l < 4 ) {\n std::cout << \"Passwords must be at least 4 characters long.\\n\\n\";\n } else {\n if (s == 0) {\n std::srand( time( NULL ) );\n } else {\n std::srand( unsigned( s ) );\n }\n generate( l, c, e != 0 );\n }\n }\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\n\nclass Program\n{\n const string Lower = \"abcdefghijklmnopqrstuvwxyz\";\n const string Upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n const string Digits = \"0123456789\";\n const string Symbols = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\";\n static readonly string[] Full = {Lower, Upper, Digits, Symbols, Lower + Upper + Digits + Symbols};\n\n const string Similar = \"Il1O05S2Z\";\n static readonly string[] Excluded = Full.Select(x => new string(x.Except(Similar).ToArray())).ToArray();\n\n static Random _rng = new Random();\n static string[] _symbolSet = Full;\n\n static void Main(string[] args)\n {\n int length = 12, count = 1;\n try\n {\n foreach (var x in args.Select(arg => arg.Split(':')))\n {\n switch (x[0])\n {\n case \"-l\": length = int.Parse(x[1]); break;\n case \"-c\": count = int.Parse(x[1]); break;\n case \"-s\": _rng = new Random(x[1].GetHashCode()); break;\n case \"-x\": _symbolSet = bool.Parse(x[1]) ? Excluded : Full; break;\n default: throw new FormatException(\"Could not parse arguments\");\n }\n }\n }\n catch { ShowUsage(); return; }\n try\n {\n for (int i = 0; i < count; i++)\n Console.WriteLine(GeneratePass(length));\n }\n catch (Exception ex) { Console.WriteLine(\"Error: \" + ex.Message); }\n }\n\n static void ShowUsage()\n {\n Console.WriteLine(\"Usage: PASSGEN [-l:length] [-c:count] [-s:seed] [-x:(true|false)]\");\n Console.WriteLine(\"\\t-l: the length of the generated passwords\");\n Console.WriteLine(\"\\t-c: the number of passwords to generate\");\n Console.WriteLine(\"\\t-s: seed for the random number generator\");\n Console.WriteLine(\"\\t-x: exclude similar characters: \" + Similar);\n Console.WriteLine(\"Example: PASSGEN -l:10 -c:5 -s:\\\"Sample Seed\\\" -x:true\");\n }\n\n static string GeneratePass(int length)\n {\n var minLength = _symbolSet.Length - 1;\n if(length < minLength)\n throw new Exception(\"password length must be \" + minLength + \" or greater\");\n\n int[] usesRemaining = Enumerable.Repeat(1, _symbolSet.Length).ToArray();\n usesRemaining[minLength] = length - minLength;\n var password = new char[length];\n for (int ii = 0; ii < length; ii++)\n {\n int set = _rng.Next(0, _symbolSet.Length);\n if (usesRemaining[set] > 0)\n {\n usesRemaining[set]--;\n password[ii] = _symbolSet[set][_rng.Next(0, _symbolSet[set].Length)];\n }\n else ii--;\n }\n return new string(password);\n }\n}\n","language":"C-sharp"},{"code":"module rosetta.passwordgenerator \"1.0.0\" {\n import ceylon.random \"1.2.2\";\n}\n","language":"Ceylon"},{"code":"import ceylon.random {\n DefaultRandom,\n Random\n}\n\nCharacter[] lowerCaseChars = 'a'..'z';\nCharacter[] upperCaseChars = 'A'..'Z';\nCharacter[] numsAsChars = '0'..'9';\nCharacter[] specialChars = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\".sequence();\nCharacter[] allChars = lowerCaseChars.append(upperCaseChars)\n .append(numsAsChars)\n .append(specialChars);\n\nshared void run() {\n print(\"2 passwords of size 8\");\n print(\"------\");\n generatePasswords(8,2).each(print);\n print(\"------\");\n print(\"5 passwords of size 12\");\n print(\"------\");\n generatePasswords(12,5).each(print);\n print(\"------\");\n print(\"7 passwords of size 16\");\n print(\"------\");\n generatePasswords(16,7).each(print);\n print(\"------\");\n print(\"2 passwords of size 16 exclude AiX24!~\");\n print(\"------\");\n generatePasswords(16,7,\"AiX24!~\".sequence()).each(print);\n}\n\nString[] generatePasswords(Integer numChars, Integer numPasswords, Character[] excludedChars=[])\n => [for (count in 1..numPasswords) generatePassword(numChars,excludedChars) ];\n\n//The generated password(s) must include at least one lower-case letter, one upper-case letter and one character from digits and 'other'.\nString generatePassword(Integer numChars, Character[] excludedChars) {\n \"Must provide a password length of at least 4\"\n assert(numChars >= 4);\n\n value random = DefaultRandom();\n\n value fixedPartOfPassword = passwordFragmentForRequirements(random,excludedChars);\n\n value randomPart =\n randomPartOfPassword{ random = random;\n index = fixedPartOfPassword.size + 1;\n randomPart = \"\";\n numChars = numChars;\n candidateChars = filterCharsToExclude(allChars, excludedChars); };\n\n value unshuffledPassword = fixedPartOfPassword + randomPart;\n\n assert(unshuffledPassword.string.size == numChars);\n\n \"excluded chars contained\"\n assert(! unshuffledPassword.any((char) => excludedChars.contains(char)));\n\n \"Sizes not equal\"\n assert(unshuffledPassword.size == numChars);\n\n value shuffledPassword =\n shuffleCharsRecursive(unshuffledPassword.string,\"\",unshuffledPassword.indexes().sequence());\n\n \"Sizes not equal\"\n assert(shuffledPassword.string.size == numChars);\n\n \"set of characters not equal\"\n assert(set(unshuffledPassword) == set(shuffledPassword));\n\n return shuffledPassword;\n}\n\nString passwordFragmentForRequirements(Random random, Character[] excludedChars)\n => String({filterAndUse(random,lowerCaseChars, excludedChars),\n filterAndUse(random,upperCaseChars,excludedChars),\n filterAndUse(random,numsAsChars,excludedChars),\n filterAndUse(random,specialChars,excludedChars)});\n\nString randomPartOfPassword(Random random,\n Integer index,\n String randomPart,\n Integer numChars,\n Character[] candidateChars) {\n if(index <= numChars) {\n value candidateCharsIndex = random.nextInteger(candidateChars.size);\n assert(exists allChar = candidateChars[candidateCharsIndex]);\n return randomPartOfPassword{ random=random;\n index=index+1;\n randomPart = randomPart + allChar.string;\n numChars =numChars;\n candidateChars = candidateChars; };\n }\n\n return randomPart;\n}\n\nString shuffleCharsRecursive(String orig,String shuffledString,Integer[] remainingOrigIndexes) {\n value random = DefaultRandom();\n\n if (nonempty constRemainingIndexes = remainingOrigIndexes) {\n value randomIndex = random.nextInteger(orig.size);\n\n assert(exists nextChar = orig[randomIndex]);\n\n String newShuffledString;\n Integer[] newRemainingIndexes;\n\n if (constRemainingIndexes.contains(randomIndex)) {\n newShuffledString = shuffledString + nextChar.string;\n newRemainingIndexes = constRemainingIndexes.filter((index) => randomIndex != index).sequence();\n } else {\n newShuffledString = shuffledString;\n newRemainingIndexes = constRemainingIndexes;\n }\n\n return shuffleCharsRecursive{ orig=orig;\n shuffledString=newShuffledString;\n remainingOrigIndexes=newRemainingIndexes; };\n }\n\n return shuffledString;\n}\n\nCharacter filterAndUse(Random random, Character[] chars, Character[] excludedChars) {\n value charsToUse = filterCharsToExclude(chars, excludedChars);\n value charToUseIndex = random.nextInteger(charsToUse.size);\n assert( exists charToUse = charsToUse[charToUseIndex]);\n return charToUse;\n}\n\nCharacter[] filterCharsToExclude(Character[] chars, Character[] charsToExclude)\n => chars.filter((char) => ! charsToExclude.contains(char)).sequence();\n","language":"Ceylon"},{"code":"(ns pwdgen.core\n (:require [clojure.set :refer [difference]]\n [clojure.tools.cli :refer [parse-opts]])\n (:gen-class))\n\n(def minimum-length 4)\n(def cli-options\n [[\"-c\" \"--count NUMBER\" \"Number of passwords to generate\"\n :default 1\n :parse-fn #(Integer/parseInt %)]\n [\"-l\" \"--length NUMBER\" \"Length of the generated passwords\"\n :default 8\n :parse-fn #(Integer/parseInt %)\n :validate [#(<= minimum-length %) (str \"Must be greater than or equal to \" minimum-length)]]\n [\"-x\", \"--exclude-similar\" \"Exclude similar characters\"]\n [\"-h\" \"--help\"]])\n\n(def lowercase (map char (range (int \\a) (inc (int \\z)))))\n(def uppercase (map char (range (int \\A) (inc (int \\Z)))))\n(def numbers (map char (range (int \\0) (inc (int \\9)))))\n(def specials (remove (set (concat lowercase uppercase numbers [\\` \\\\])) (map char (range (int \\!) (inc (int \\~))))))\n(def similar #{\\I \\l \\1 \\| \\O \\0 \\5 \\S \\2 \\Z})\n\n(defn sanitize [coll options]\n (if (:exclude-similar options) (into '() (difference (set coll) similar)) coll))\n\n(defn generate-password [options]\n (let [upper (rand-nth (sanitize uppercase options))\n lower (rand-nth (sanitize lowercase options))\n number (rand-nth (sanitize numbers options))\n special (rand-nth (sanitize specials options))\n combined (shuffle (sanitize (concat lowercase uppercase numbers specials) options))]\n (shuffle (into (list upper lower number special) (take (- (:length options) minimum-length) combined)))))\n\n(defn -main [& args]\n (let [{:keys [options summary]} (parse-opts args cli-options)]\n (if (:help options) (println summary)\n (dotimes [n (:count options)]\n (println (apply str (generate-password options)))))))\n","language":"Clojure"},{"code":"1 rem password generator\n2 rem rosetta code\n10 g$(1)=\"abcdefghijklmnopqrstuvwxyz\"\n15 g$(2)=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n20 g$(3)=\"0123456789\"\n25 g$(4)=\"<>!@#$%^&*()[];:'.?/\"\n30 print chr$(147);chr$(14)\n35 print \"Password Generator\":print\n40 print \"Press H for help, or any\":print \"other key to begin.\":print\n45 get k$:if k$=\"\" then 45\n50 if k$=\"h\" then gosub 500\n60 print chr$(147)\n65 input \"Enter password length: (6-30)\";pl\n70 if pl<6 or pl>30 then print \"Out of range.\":goto 65\n75 print:input \"How many passwords (1-20)\";np\n80 if np<1 or np>20 then print \"Out of range.\":goto 75\n85 if np>10 then dim pw$(np)\n90 if np*pl > 100 then print:print \"Um... Ok, this might take a bit.\"\n100 for pc=1 to np\n105 for i=1 to 4:g(i)=0:next\n110 tp$=\"\"\n112 for i=1 to pl\n115 cg=int(rnd(1)*4)+1\n120 cc=int(rnd(1)*len(g$(cg)))+1\n125 tp$=tp$+mid$(g$(cg),cc,1)\n130 g(cg)=g(cg)+1\n135 next i\n140 for i=1 to 4\n145 if g(i)=0 then goto 110\n150 next i\n155 pw$(pc)=tp$\n160 next pc\n200 print chr$(147);\"Password list:\":print\n205 for pc=1 to np:print pc;chr$(157);\".\";tab(6);pw$(pc):next pc\n210 print:print \"Again? (y/n)\";\n215 get k$:if k$<>\"y\" and k$<>\"n\" then 215\n220 if k$=\"y\" then clr:goto 10\n225 end\n500 rem *** help ***\n505 print chr$(147);\"This program will generate a password\"\n510 print \"made up of each of the following\"\n515 print \"character types:\":print\n520 print \" - Uppercase Letter (A-Z)\"\n525 print \" - Lowercase Letter (a-z)\"\n530 print \" - Number (0-9)\"\n535 print \" - Punctuation and Other Symbols\"\n540 print \" (e.g. # $ ! & [ . ;, etc.)\"\n545 print\n550 print \"You may choose how many total characters\";\n555 print \"(up to 30) should be in the password, \"\n560 print \"and how many passwords (up to 20) should\";\n565 print \"be generated. The program ensures that \"\n570 print \"there is at least one character from \"\n575 print \"each of the character types in each \"\n580 print \"password.\"\n585 print\n590 print \"Note: You can edit the character lists\"\n595 print \"on lines 10-25 to customize the\"\n600 print \"selection pool.\"\n605 print\n610 print \"Press any key to begin.\"\n615 get k$:if k$=\"\" then 615\n620 return\n","language":"Commodore-BASIC"},{"code":"(defvar *lowercase* '(#\\a #\\b #\\c #\\d #\\e #\\f #\\g #\\h #\\i #\\j #\\k #\\l #\\m\n #\\n #\\o #\\p #\\q #\\r #\\s #\\t #\\u #\\v #\\w #\\x #\\y #\\z))\n\n(defvar *uppercase* '(#\\A #\\B #\\C #\\D #\\E #\\F #\\G #\\H #\\I #\\J #\\K #\\L #\\M\n #\\N #\\O #\\P #\\Q #\\R #\\S #\\T #\\U #\\V #\\W #\\X #\\Y #\\Z))\n\n(defvar *numbers* '(#\\0 #\\1 #\\2 #\\3 #\\4 #\\5 #\\6 #\\7 #\\8 #\\9))\n\n(defvar *special-characters* '(#\\! #\\\\ #\\# #\\$ #\\% #\\& #\\' #\\( #\\) #\\*\n #\\+ #\\, #\\- #\\. #\\/ #\\: #\\; #\\< #\\= #\\>\n #\\? #\\@ #\\[ #\\] #\\^ #\\_ #\\{ #\\| #\\} #\\~))\n\n(defvar *similar-characters* '(#\\I #\\l #\\1 #\\| #\\O #\\0 #\\5 #\\S #\\2 #\\Z))\n\n(defun make-readable (s)\n (remove-if (lambda (x) (member x *similar-characters*)) s))\n\n(defun shuffle-list (input-list)\n (loop with l = (length input-list)\n for i below l\n do (rotatef (nth i input-list)\n (nth (random l) input-list)))\n input-list)\n\n(defun generate-password (len human-readable)\n (let*\n ((upper (if human-readable (make-readable *uppercase*) *uppercase*))\n (lower (if human-readable (make-readable *lowercase*) *lowercase*))\n (number (if human-readable (make-readable *numbers*) *numbers*))\n (special (if human-readable (make-readable *special-characters*) *special-characters*))\n (character-groups (list upper lower number special))\n (initial-password (reduce (lambda (acc x)\n (cons (nth (random (length x)) x) acc))\n character-groups :initial-value NIL)))\n\n (coerce (shuffle-list (reduce (lambda (acc x)\n (declare (ignore x))\n (let ((group (nth (random (length character-groups)) character-groups)))\n (cons (nth (random (length group)) group) acc)))\n (make-list (- len 4)) :initial-value initial-password)) 'string)))\n\n(defun main (len count &optional human-readable)\n (if (< len 4)\n (print \"Length must be at least 4~%\")\n (loop for x from 1 to count do\n (print (generate-password len human-readable)))))\n","language":"Common-Lisp"},{"code":"require \"random/secure\"\n\nspecial_chars = true\nsimilar = 0\nrequire_groups = true\nlength = 20\ncount = 1\n\ndef show_usage\n puts <<-USAGE\n\n Passwords generator\n Usage: pass2 [count] [-l<length>] [-s{0|1|2}] [-ng] [-ns]\n\n count: number of passwords to be generated (default: 1)\n -l<length>: length of passwords (default: 20)\n -s{0|1|2}: exclude visually similar characters.\n 0 - don't exclude (default)\n 1 - exclude 0, O, 1, I, l, |\n 2 - also exclude 2, Z, 5, S\n -ng: don''t require password to include character from every group\n -ns: don''t include special chars in password\n\n Default value of switches is choosen to match the task in page header, but I suggest to use the \"-s1 -ng -ns\".\n USAGE\nend\n\ncount_set = false\nbegin\n ARGV.each do |arg|\n case arg\n when /-l(\\d+)/\n length = $1.to_i\n raise \"Error: minimal length is 4\" if length < 4\n when /-s(\\d)/\n similar = $1.to_i\n raise \"Error: minimal length is 4\" unless {0, 1, 2}.includes? similar\n when /-ng/\n require_groups = false\n when /-ns/\n special_chars = false\n when /(\\d+)/\n raise \"incorrect arguments\" if count_set\n count_set = true\n count = $1.to_i\n else\n raise \"incorrect argument\"\n end\n end\nrescue ex\n puts ex.message\n show_usage\n exit\nend\n\n# actual program\nGROUPS = [('a'..'z').to_a, ('A'..'Z').to_a, ('0'..'9').to_a]\nGROUPS << \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\".chars if special_chars\n\nletters = GROUPS.flatten\nletters -= \"1l|I0O\".chars if similar > 0\nletters -= \"5S2Z\".chars if similar > 1\n\nloop do\n s = Array(Char).new(length) { letters.sample(Random::Secure) }\n # it's better to just discard in order to don't lose enthropy\n next if require_groups && GROUPS.any? { |x| (s & x).size == 0 }\n puts s.join\n count -= 1\n break if count <= 0\nend\n","language":"Crystal"},{"code":"defmodule Password do\n @lower Enum.map(?a..?z, &to_string([&1]))\n @upper Enum.map(?A..?Z, &to_string([&1]))\n @digit Enum.map(?0..?9, &to_string([&1]))\n @other ~S\"\"\"\n!\"#$%&'()*+,-./:;<=>?@[]^_{|}~\n\"\"\" |> String.codepoints |> List.delete_at(-1)\n @all @lower ++ @upper ++ @digit ++ @other\n\n def generator do\n {len, num} = get_argv\n Enum.each(1..num, fn _ ->\n pswd = [Enum.random(@lower), Enum.random(@upper), Enum.random(@digit), Enum.random(@other)]\n IO.puts generator(len-4, pswd)\n end)\n end\n\n def generator(0, pswd), do: Enum.shuffle(pswd) |> Enum.join\n def generator(len, pswd), do: generator(len-1, [Enum.random(@all) | pswd])\n\n def get_argv do\n {len,num} = case System.argv do\n [\"?\"] -> usage\n [] -> {8,1}\n [len] -> {String.to_integer(len), 1}\n [len,num] -> {String.to_integer(len), String.to_integer(num)}\n _ -> usage\n end\n if len<4 or num<1, do: usage, else: {len,num}\n end\n\n defp usage do\n IO.puts [\"Password generator\\n\",\n \"Usage: [password length(=8)] [number of passwords to generate(=1)]\"]\n exit(:normal)\n end\nend\n\nPassword.generator\n","language":"Elixir"},{"code":"// A function to generate passwords of a given length. Nigel Galloway: May 2nd., 2018\nlet N = (set)\"qwertyuiopasdfghjklzxcvbnm\"\nlet I = (set)\"QWERTYUIOPASDFGHJKLZXCVBNM\"\nlet G = (set)\"7894561230\"\nlet E = (set)\"\"\"!\"#$%&'()*+,-./:;<=>?@[]^_{|}~[||]\"\"\"\nlet L = Array.ofSeq (Set.unionMany [N;I;G;E])\nlet y = System.Random 23\nlet pWords n=\n let fN n = not (Set.isEmpty (Set.intersect N n )||Set.isEmpty (Set.intersect I n )||Set.isEmpty (Set.intersect G n )||Set.isEmpty (Set.intersect E n ))\n Seq.initInfinite(fun _->(set)(List.init n (fun _->L.[y.Next()%(Array.length L)])))|>Seq.filter fN|>Seq.map(Set.toArray >> System.String)\n","language":"F-Sharp"},{"code":"pWords 8 |> Seq.take 5 |> Seq.iter(printfn \"%s\")\n","language":"F-Sharp"},{"code":"USING: arrays assocs combinators command-line continuations io\nkernel math math.parser multiline namespaces peg.ebnf\nprettyprint random sequences ;\nFROM: sets => without ;\nIN: rosetta-code.password-generator\n\nSTRING: usage\npassword-generator generates random passwords.\n\n Commands:\n -l [int>=4] Set password length (required)\n -c [int>0] Set password count (required)\n -s [int] Set seed for random number generator\n -x Exclude similar characters\n [empty] Show this help\n;\n\n! Parse command line arguments into assoc\nEBNF: parse-args [=[\n int = \"-\"? [0-9]+ => [[ concat sift string>number ]]\n l = \"-l\" \" \"~ int ?[ 4 >= ]?\n c = \"-c\" \" \"~ int ?[ 0 > ]?\n s = \"-s\" \" \"~ int\n x = \"-x\" => [[ 0 2array ]]\n arg = l | c | s | x\n args = arg ((\" \"~ arg)+)?\n => [[ first2 [ 1array ] dip append ]]\n]=]\n\nCONSTANT: similar {\n \"abcdefghijklmnopqrstuvwxyz\"\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n \"0123456789\"\n \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n}\n\n: dissimilar ( -- seq ) similar [ \"Il1O05S2Z\" without ] map ;\n\n! Set seed if seed provided; otherwise use system rng.\n: choose-rng ( args-assoc -- )\n \"-s\" of [ [ random-generator get ] dip seed-random drop ]\n [ system-random-generator get random-generator set ] if* ;\n\n: choose-character-set ( args-assoc -- seq )\n \"-x\" of dissimilar similar ? ;\n\n! Create a \"base\" for a password; one character from each\n! category.\n: <base> ( seq -- str ) [ random ] \"\" map-as ;\n\n: password ( seq length -- str )\n 4 - over concat [ random ] curry \"\" replicate-as\n [ <base> ] dip append randomize ;\n\n: .passwords ( count seq length -- )\n [ password print ] 2curry times ;\n\n: gen-pwds ( args-assoc -- )\n {\n [ choose-rng ]\n [ \"-c\" of ]\n [ choose-character-set ]\n [ \"-l\" of ]\n } cleave .passwords ;\n\n: main ( -- )\n command-line get \" \" join\n [ parse-args gen-pwds ] [ 2drop usage print ] recover ;\n\nMAIN: main\n","language":"Factor"},{"code":"Dim As String charS(4)\ncharS(1) = \"0123456789\"\ncharS(2) = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\ncharS(3) = \"abcdefghijklmnopqrstuvwxyz\"\ncharS(4) = \"!\"\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\ncharS(0) = charS(1) + charS(2) + charS(3) + charS(4)\n\n\nDim As Integer howBig, howMany\nDo\n Print !\"------ Password Generator ------\\n\"\n Input \"Longitud de la contrase¤a (n>=4): \", howBig\n If howBig < 1 Then Sleep: End\n\n Input \"Cantidad de contrase¤as (n>=1): \", howMany\nLoop While howMany < 1\n\nPrint !\"\\nGeneradas\"; howMany; \" contrase¤as de\"; howBig; \" caracteres\"\n\nDim As Integer i = 0\nDim As String password, Ok, w\nWhile i < howMany\n\tpassword = \"\"\n Ok = \"....\"\n For j As Integer = 1 To howBig\n w = Mid(charS(0), Int(Rnd * Len(charS(0))) + 1, 1)\n For k As Byte = 1 To 4\n If Instr(charS(k), w) Then Ok = Left(Ok, k-1) + \"*\" + Mid(Ok, k+1)\n Next k\n password += w\n Next j\n If Ok = \"****\" Then\n i += 1\n Print Using \"##. &\"; i; password\n End If\nWend\nSleep\n","language":"FreeBASIC"},{"code":"output file \"Password Generator\"\ninclude \"Tlbx GameplayKit.incl\"\n\nbegin enum\n _mApplication\n _mFile\n _mEdit\nend enum\n\nbegin enum 1\n _iSeparator\n _iPreferences\nend enum\n\nbegin enum\n _iCreate\n _iSeparator2\n _iSave\n _iPrint\n _iSeparator4\n _iClose\nend enum\n\n_window = 1\nbegin enum output 1\n _passwordScroll\n _passwordView\n _offscreenPrintView\n _optionsHelp\n _checkOmitIs\n _checkOmitOs\n _checkOmitSs\n _checkOmit2s\n _charactersLongLabel\n _passwordLengthField\n _pwAmountLabel\n _pwAmountField\n _seedLabel\n _seedField\n _helpBtn\n _bottomLine\n _saveBtn\n _printBtn\n _createPasswordsBtn\nend enum\n\n_helpPopover = 2\nbegin enum 1\n _popoverLabel\nend enum\n\n_savePanel = 1\n_pwLenAlert = 2\n\n\nvoid local fn BuildMenus\n // application\n menu _mApplication, _iSeparator\n menu _mApplication, _iPreferences,, @\"Preferences…\", @\",\"\n\n // file\n menu _mFile, -1,, @\"File\"\n menu _mFile, _iCreate,, @\"Create passwords\", @\"p\"\n menu _mFile, _iSeparator2\n menu _mFile, _iSave,, @\"Save\", @\"s\"\n menu _mFile, _iPrint,, @\"Print\", @\"p\"\n menu _mFile, _iSeparator4\n menu _mFile, _iClose,, @\"Close\", @\"w\"\n MenuItemSetAction( _mFile, _iClose, @\"performClose:\" )\n\n editmenu _mEdit\nend fn\n\nvoid local fn BuildWindow\n long tag\n\n CGRect r = fn CGRectMake( 0, 0, 672, 460 )\n window _window, @\"Rosetta Code Password Generator\", r//, NSWindowStyleMaskTitled + NSWindowStyleMaskClosable + NSWindowStyleMaskMiniaturizable\n WindowSetContentMinSize( _window, fn CGSizeMake(310,386) )\n\n r = fn CGRectMake( 20, 73, 515, 370 )\n scrollview _passwordScroll, r, NSLineBorder,,_window\n ViewSetAutoresizingMask( _passwordScroll, NSViewWidthSizable + NSViewHeightSizable )\n\n textview _passwordView, r, _passwordScroll,, _window\n TextViewSetTextContainerInset( _passwordView, fn CGSizeMake( 10, 15 ) )\n TextSetFontWithName( _passwordView, @\"Menlo\", 13.0 )\n\n r = fn CGRectMake( -600, -600, 450, 405 )\n textview _offscreenPrintView, r,,, _window\n TextSetFontWithName( _offscreenPrintView, @\"Menlo\", 13.0 )\n TextSetColor( _offscreenPrintView, fn ColorBlack )\n TextViewSetBackgroundColor( _offscreenPrintView, fn ColorWhite )\n\n r = fn CGRectMake( 547, 424, 60, 16 )\n textlabel _optionsHelp, @\"Exclude:\", r, _window\n\n r = fn CGRectMake( 607, 425, 41, 14 )\n button _checkOmitIs, YES, NSControlStateValueOff, @\"Il1\", r, NSButtonTypeSwitch\n ViewSetToolTip( _checkOmitIs, @\"Omit similar characters I, l and 1.\" )\n r = fn CGRectOffset( r, 0, -24 )\n button _checkOmitOs, YES ,NSControlStateValueOff, @\"O0\", r, NSButtonTypeSwitch\n ViewSetToolTip( _checkOmitOs, @\"Omit similar characters O and 0.\" )\n r = fn CGRectOffset( r, 0, -24 )\n button _checkOmitSs, YES, NSControlStateValueOff, @\"5S\", r, NSButtonTypeSwitch\n ViewSetToolTip( _checkOmitSs, @\"Omit similar characters 5 and S.\" )\n r = fn CGRectOffset( r, 0, -24 )\n button _checkOmit2s, YES, NSControlStateValueOff, @\"2Z\", r, NSButtonTypeSwitch\n ViewSetToolTip( _checkOmit2s, @\"Omit similar characters 2 and Z.\" )\n\n r = fn CGRectMake( 549, 322, 103, 16 )\n textlabel _charactersLongLabel, @\"Chars (4-50)\", r, _window\n\n r = fn CGRectMake( 549, 298, 103, 21 )\n textfield _passwordLengthField, YES, @\"25\", r,_window\n TextFieldSetBordered( _passwordLengthField, YES )\n ControlSetAlignment(_passwordLengthField, NSTextAlignmentCenter )\n ControlSetFormat( _passwordLengthField, @\"0123456789\", YES, 2, 0 )\n ViewSetToolTip( _passwordLengthField, @\"Set password length from 4 to 50.\" )\n\n r = fn CGRectMake( 549, 263, 103, 16 )\n textlabel _pwAmountLabel, @\"Passwords:\", r, _window\n\n r = fn CGRectMake( 549, 240, 103, 21 )\n textfield _pwAmountField, YES, @\"100\", r,_window\n TextFieldSetBordered( _pwAmountField, YES )\n ControlSetAlignment( _pwAmountField, NSTextAlignmentCenter )\n ControlSetFormat( _pwAmountField, @\"0123456789\", YES, 4, 0 )\n ViewSetToolTip( _pwAmountField, @\"Enter number of passwords to generate.\" )\n\n r = fn CGRectMake( 549, 205, 103, 16 )\n textlabel _seedLabel, @\"Seed value:\", r, _window\n\n r = fn CGRectMake( 549, 182, 103, 21 )\n textfield _seedField, YES, , r,_window\n TextFieldSetBordered( _seedField, YES )\n ControlSetAlignment(_seedField, NSTextAlignmentCenter )\n ControlSetFormat( _seedField, @\"0123456789\", YES, 6, 0 )\n ViewSetToolTip( _seedField, @\"Enter optional random seed number.\" )\n\n for tag = _optionsHelp to _seedField\n ViewSetAutoresizingMask( tag, NSViewMinXMargin + NSViewMinYMargin )\n next\n\n r = fn CGRectMake( 631, 70, 25, 25 )\n button _helpBtn, YES,,, r, NSButtonTypeMomentaryLight, NSBezelStyleHelpButton, _window\n ViewSetToolTip( _helpBtn, @\"Click for application help instructions.\" )\n ViewSetAutoresizingMask( _helpBtn, NSViewMinXMargin + NSViewMaxYMargin )\n\n r = fn CGRectMake( 20, 55, 632, 5 )\n box _bottomline,, r, NSBoxSeparator\n ViewSetAutoresizingMask( _bottomline, NSViewWidthSizable + NSViewMaxYMargin )\n\n r = fn CGRectMake( 20, 15, 62, 32 )\n button _printBtn, YES, , @\"Print…\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\n ViewSetAutoresizingMask( _printBtn, NSViewMaxXMargin + NSViewMaxYMargin )\n\n r = fn CGRectMake( 91, 15, 62, 32 )\n button _saveBtn, YES, , @\"Save…\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\n ViewSetAutoresizingMask( _saveBtn, NSViewMaxXMargin + NSViewMaxYMargin )\n\n r = fn CGRectMake( 522, 15, 131, 32 )\n button _createPasswordsBtn, YES, , @\"Create passwords\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\n ViewSetAutoresizingMask( _createPasswordsBtn, NSViewMinXMargin + NSViewMaxYMargin )\nend fn\n\nvoid local fn BuildPopover\n CFStringRef helpText = @\"This application generates randomized passwords from 4 to 50 characters in length. \"\n helpText = fn StringByAppendingString( helpText, @\"Theoretically, the number generated is limited only by system memory.\\n\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"Passwords will contain at least one each of the following character types:\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"\\tLowercase letters\\t\\t: a -> z\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"\\tUppercase letters\\t\\t: A -> Z\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"\\tNumbers\\t\\t\\t\\t: 0 -> 9\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"\\tSpecial characters\\t: !\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\n\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"You can use checkboxes to exclude visually similar characters: Il1 O0 5S 2Z.\\n\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"This application offers two automatic levels of randomization. However you are \" )\n helpText = fn StringByAppendingString( helpText, @\"welcome to enter a custom randomizer seed number in the box provided.\\n\\n\" )\n helpText = fn StringByAppendingString( helpText, @\"Passwords can be copied to the pasteboard, saved to a text file, or printed.\" )\n popover _helpPopover, (0,0,395,365), NSPopoverBehaviorTransient\n textlabel _popoverLabel, helpText, (10,10,375,345)\nend fn\n\nvoid local fn OutOfBoundsAlert\n CFStringRef alertStr = @\"Passwords must be at least four characters long, but no more than 50 characters.\"\n\n alert -_pwLenAlert,, @\"Password length is out of bounds\", alertStr, @\"Okay\", YES\n AlertButtonSetKeyEquivalent( _pwLenAlert, 1, @\"\\e\" )\n AlertSetStyle( _pwLenAlert, NSAlertStyleWarning )\n alert _pwLenAlert\nend fn\n\n\nlocal fn BuildPassword as CFStringRef\n long i\n CFArrayRef charArr = fn AppProperty( @\"charArray\" )\n CFStringRef numbers = charArr[0]\n CFStringRef uppercase = charArr[1]\n CFStringRef lowercase = charArr[2]\n CFStringRef symbols = charArr[3]\n\n // Omit confusing letters selected by user, if any\n if ( fn ButtonState( _checkOmitIs ) == NSControlStateValueOn )\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\"1\", @\"\" )\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\"I\", @\"\" )\n lowercase = fn StringByReplacingOccurrencesOfString( lowercase, @\"l\", @\"\" )\n end if\n\n if ( fn ButtonState( _checkOmitOs ) == NSControlStateValueOn )\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\"0\", @\"\" )\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\"O\", @\"\" )\n end if\n\n if( fn ButtonState( _checkOmitSs ) == NSControlStateValueOn )\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\"5\", @\"\" )\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\"S\", @\"\" )\n end if\n\n if ( fn ButtonState( _checkOmit2s ) == NSControlStateValueOn )\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\"2\", @\"\" )\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\"Z\", @\"\" )\n end if\n\n // Build string pool from other character sets\n CFStringRef allChars = fn StringWithFormat( @\"%@%@%@%@\", numbers, uppercase, lowercase, symbols )\n\n // Begin construction password string with single random character from each character set\n randomize\n CFMutableStringRef pwStr = fn MutableStringWithCapacity(0)\n CFStringRef rndNumberChar = fn StringWithFormat( @\"%c\", fn StringCharacterAtindex( numbers, rnd( len( numbers ) -1 ) ) )\n CFStringRef rndUCaseChar = fn StringWithFormat( @\"%c\", fn StringCharacterAtindex( uppercase, rnd( len( uppercase ) -1 ) ) )\n CFStringRef rndLCaseChar = fn StringWithFormat( @\"%c\", fn StringCharacterAtindex( lowercase, rnd( len( lowercase ) -1 ) ) )\n CFStringRef rndSymbolChar = fn StringWithFormat( @\"%c\", fn StringCharacterAtindex( symbols, rnd( len( symbols ) -1 ) ) )\n\n // Add first four randomized characters to password string\n MutableStringAppendString( pwStr, fn StringWithFormat( @\"%@%@%@%@\", rndNumberChar, rndUCaseChar, rndLCaseChar, rndSymbolChar ) )\n\n // Build array of characters for shuffling\n CFMutableArrayRef mutArr = fn MutableArrayWithCapacity(0)\n for i = 0 to len(allChars) - 1\n unichar tempUni = fn StringCharacterAtIndex( allChars, i )\n CFStringRef s = fn StringWithFormat( @\"%c\", tempUni )\n MutableArrayInsertObjectAtIndex( mutArr, s, i )\n next\n\n // Shuffle character array for randomness\n CFArrayRef rndStrArr = fn GKRandomSourceArrayByShufflingObjectsInArray( fn GKRandomSourceInit, mutArr )\n CFStringRef rndStr = fn ArrayComponentsJoinedByString( rndStrArr, @\"\" )\n\n long pwLength = fn StringIntegerValue( fn ControlStringValue( _passwordLengthField ) )\n\n // Subtract 4 for mandatory charaacters already set\n rndStr = fn StringSubstringToIndex( rndStr, pwLength - 4 )\n MutableStringAppendString( pwStr, rndStr )\nend fn = pwStr\n\n\nvoid local fn RandomizeWithSeed\n CFStringRef seedStr = fn ControlStringValue( _seedField )\n\n if ( len(seedStr) > 0 )\n long seedNum = fn StringIntegerValue( seedStr )\n randomize seedNum\n else\n exit fn\n end if\nend fn\n\n\nvoid local fn CreatePasswords\n NSInteger i\n CFMutableStringRef passwords = fn MutableStringWithCapacity(0)\n long numberNeeded = fn StringIntegerValue( fn ControlStringValue( _pwAmountField ) )\n\n // Get length of password designated by user\n long pwLength = fn StringIntegerValue( fn ControlStringValue( _passwordLengthField ) )\n\n if ( pwLength > 50 ) or ( pwLength < 4 )\n fn OutOfBoundsAlert : exit fn\n end if\n\n fn RandomizeWithSeed\n\n for i = 1 to numberNeeded\n MutableStringAppendString( passwords, fn StringWithFormat( @\"%4d. %@%@\\n\", i, fn BuildPassword, @\"\\n\" ) )\n next\n TextSetString( _passwordView, passwords )\nend fn\n\n\nvoid local fn SaveFile\n savepanel -_savePanel, @\"Save file...\", @\"public.plain-text\",,,, _true\n SavePanelSetCanCreateDirectories( _savePanel, YES )\n SavePanelSetAllowedFileTypes( _savePanel, @[@\"txt\"] )\n SavePanelSetExtensionHidden( _savePanel, NO )\n // Run savepanel; action captured in fn DoDialog\n savepanel _savePanel\nend fn\n\n\nvoid local fn SetViewText( url as CFURLRef )\n CFStringRef tempStr = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )\n WindowSetTitleWithRepresentedURL( _window, url )\n TextSetString( _passwordView, tempStr )\nend fn\n\n\nvoid local fn PrintView( tag as long )\n TextSetString( _offscreenPrintView, fn TextString( tag ) )\n ViewPrint( _offscreenPrintView )\nend fn\n\n// Build character arrays at launch and save as application property\nvoid local fn CreateCharactersDictionary\n CFArrayRef charArray = @[¬\n @\"0123456789\",¬\n @\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",¬\n @\"abcdefghijklmnopqrstuvwxyz\",¬\n @\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"]\n AppSetProperty( @\"charArray\", charArray )\nend fn\n\n\nvoid local fn DoAppEvent( ev as long )\n select (ev)\n case _appDidFinishLaunching\n fn CreateCharactersDictionary\n fn BuildMenus\n fn BuildPopover\n fn BuildWindow\n case _appShouldTerminateAfterLastWindowClosed\n AppEventSetBool(YES)\n end select\nend fn\n\n\nvoid local fn DoMenu( menuID as long, itemID as long )\n select (menuID)\n case _mApplication\n select (itemID)\n case _iPreferences // show preferences window\n end select\n case _mFile\n select (itemID)\n case _iCreate : fn CreatePasswords\n case _iSave : fn SaveFile\n case _iPrint : fn PrintView( _passwordView )\n end select\n end select\nend fn\n\n\nvoid local fn DoDialog( ev as NSInteger, tag as NSInteger, wnd as NSInteger, obj as CFTypeRef )\n select ( ev )\n case _btnClick\n select ( tag )\n case _createPasswordsBtn : fn CreatePasswords\n case _saveBtn : fn SaveFile\n case _printBtn : fn PrintView( _passwordView )\n case _helpBtn : PopoverShow( _helpPopover, CGRectZero, _helpBtn, CGRectMaxXEdge )\n end select\n end select\nend fn\n\non appEvent fn DoAppEvent\non menu fn DoMenu\non dialog fn DoDialog\n\nHandleEvents\n","language":"FutureBasic"},{"code":"' Gambas module file\n\n' INSTRUCTIONS\n' I have not used a GUI as you could not run this in the 'Gambas Playground'\n' Click on the link above to run this program\n' The user can specify the password length and the number of passwords\n' to generate by altering the values of the 2 lines below.\n\nPublic Sub Main()\nDim siPasswordLength As Short = 20 'Password length\nDim siPasswordQuantity As Short = 20 'Password quantity\nDim sLower As String = \"abcdefghijklmnopqrstuvwxyz\" 'Lower case characters\nDim sUpper As String = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\" 'Upper case characters\nDim sNumber As String = \"1234567890\" 'Numbers\nDim sOther As String = \"'!#$%&'()*+,-./:;<=>?@[]^_{|}~\" & Chr(34) 'Other characters + quote\nDim sNoGo As String[] = [\"I1\", \"1I\", \"l1\", \"1l\", \"Il\",\n \"lI\", \"O0\", \"0O\", \"S5\", \"5S\", \"Z2\", \"2Z\"] 'Undesirable string combinations (can be added to if required)\nDim sData As String = sLower & sUpper & sNumber & sOther 'Create 1 string to pick the password characters from\nDim sToCheck, sPassword As String 'To hold a possible password for checking, to hold the passwords\nDim siCount, siLoop, siCounter As Short 'Various counters\nDim bPass As Boolean 'To Pass or not to Pass!\n\nFor siCount = 1 To siPasswordQuantity 'Loop the amount of passwords required\n For siLoop = 1 To siPasswordLength 'Loop for each charater of the required length\n sToCheck &= Mid(sData, Rand(1, Len(sData)), 1) 'Get a random character from sData\n Next\n\n bPass = False 'Set bPass to False\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\n If InStr(sLower, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If a LOWER CASE letter is included set bPass to True\n Next\n\n If bPass Then 'If bPass is True then\n bPass = False 'bPass is False\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\n If InStr(sUpper, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If an UPPER CASE letter is included set bPass to True\n Next\n End If\n\n If bPass Then 'If bPass is True then\n bPass = False 'bPass is False\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\n If InStr(sNumber, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If a NUMBER is included set bPass to True\n Next\n End If\n\n If bPass Then 'If bPass is True then\n bPass = False 'bPass is False\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\n If InStr(sOther, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If an 'OTHER CHARACTER' is included set bPass to True\n Next\n End If\n\n If bPass Then\n For siCounter = 1 To sNoGo.Max 'Loop through each undesirable strings e.g. \"0O\"\n If InStr(sToCheck, sNoGo[siCounter]) Then bPass = False 'If an undesirable combination is located then set bPass to False\n Next\n Endif\n\n If bPass = True Then 'If bPass is True (all checks have been passed) then\n sPassword &= sToCheck & gb.NewLine 'Add the new password to sPassword with a newline\n Else 'Else\n Dec siCount 'Decrease the loop counter by one\n Endif\n sToCheck = \"\" 'Clear sToCheck\nNext\n\nPrint sPassword 'Print the password list\n\nEnd\n","language":"Gambas"},{"code":"package main\n\nimport (\n\t\"crypto/rand\"\n\t\"math/big\"\n\t\"strings\"\n\t\"flag\"\n\t\"math\"\n \"fmt\"\n)\n\nvar lowercase = \"abcdefghijklmnopqrstuvwxyz\"\nvar uppercase = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar numbers = \"0123456789\"\nvar signs = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\nvar similar = \"Il1O05S2Z\"\n\nfunc check(e error){\n\tif e != nil {\n\t\tpanic(e)\n\t}\n}\n\nfunc randstr(length int, alphastr string) string{\n\talphabet := []byte(alphastr)\n\tpass := make([]byte,length)\n\tfor i := 0; i < length; i++ {\n\t\tbign, err := rand.Int(rand.Reader, big.NewInt(int64(len(alphabet))))\n\t\tcheck(err)\n\t\tn := bign.Int64()\n\t\tpass[i] = alphabet[n]\n\t}\n\treturn string(pass)\n}\n\nfunc verify(pass string,checkUpper bool,checkLower bool, checkNumber bool, checkSign bool) bool{\n\tisValid := true\n\tif(checkUpper){\n\t\tisValid = isValid && strings.ContainsAny(pass,uppercase)\n\t}\n\tif(checkLower){\n\t\tisValid = isValid && strings.ContainsAny(pass,lowercase)\n\t}\n\tif(checkNumber){\n\t\tisValid = isValid && strings.ContainsAny(pass,numbers)\n\t}\n\tif(checkSign){\n\t\tisValid = isValid && strings.ContainsAny(pass,signs)\n\t}\n\treturn isValid\n}\n\n\nfunc main() {\n\tpassCount := flag.Int(\"pc\", 6, \"Number of passwords\")\n\tpassLength := flag.Int(\"pl\", 10, \"Passwordlength\")\n\tuseUpper := flag.Bool(\"upper\", true, \"Enables or disables uppercase letters\")\n\tuseLower := flag.Bool(\"lower\", true, \"Enables or disables lowercase letters\")\n\tuseSign := flag.Bool(\"sign\", true, \"Enables or disables signs\")\n\tuseNumbers := flag.Bool(\"number\", true, \"Enables or disables numbers\")\n\tuseSimilar := flag.Bool(\"similar\", true,\"Enables or disables visually similar characters\")\n\tflag.Parse()\n\n\tpassAlphabet := \"\"\n\tif *useUpper {\n\t\tpassAlphabet += uppercase\n\t}\n\tif *useLower {\n\t\tpassAlphabet += lowercase\n\t}\n\tif *useSign {\n\t\tpassAlphabet += signs\n\t}\n\tif *useNumbers {\n\t\tpassAlphabet += numbers\n\t}\n\tif !*useSimilar {\n\t\tfor _, r := range similar{\n\t\t\tpassAlphabet = strings.Replace(passAlphabet,string(r),\"\", 1)\n\t\t}\n\t}\n\tfmt.Printf(\"Generating passwords with an average entropy of %.1f bits \\n\", math.Log2(float64(len(passAlphabet))) * float64(*passLength))\n\tfor i := 0; i < *passCount;i++{\n\t\tpassFound := false\n\t\tpass := \"\"\n\t\tfor(!passFound){\n\t\t\tpass = randstr(*passLength,passAlphabet)\n\t\t\tpassFound = verify(pass,*useUpper,*useLower,*useNumbers,*useSign)\n\t\t}\n\t\tfmt.Println(pass)\n\t}\n}\n","language":"Go"},{"code":"import Control.Monad\nimport Control.Monad.Random\nimport Data.List\n\npassword :: MonadRandom m => [String] -> Int -> m String\npassword charSets n = do\n parts <- getPartition n\n chars <- zipWithM replicateM parts (uniform <$> charSets)\n shuffle (concat chars)\n where\n getPartition n = adjust <$> replicateM (k-1) (getRandomR (1, n `div` k))\n k = length charSets\n adjust p = (n - sum p) : p\n\nshuffle :: (Eq a, MonadRandom m) => [a] -> m [a]\nshuffle [] = pure []\nshuffle lst = do\n x <- uniform lst\n xs <- shuffle (delete x lst)\n return (x : xs)\n","language":"Haskell"},{"code":"import Options\n\ndata Opts = Opts { optLength :: Int\n , optCount :: Int\n , optReadable :: Bool }\n\ninstance Options Opts where\n defineOptions = Opts <$>\n simpleOption \"length\" 8 \"password length\" <*>\n simpleOption \"count\" 1 \"number of passwords to be generated\" <*>\n simpleOption \"readable\" False \"Whether to use only readable characters\"\n\nmain = runCommand $ \\opts args -> do\n let n = optCount opts\n l = optLength opts\n s = if (optReadable opts)\n then zipWith (\\\\) charSets visualySimilar\n else charSets\n res <- replicateM n (password s (max 4 l))\n mapM_ putStrLn res\n where\n charSets = [ ['a'..'z']\n , ['A'..'Z']\n , ['0'..'9']\n , \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" ]\n\n visualySimilar = [\"l\",\"IOSZ\",\"012\",\"!|.,\"]\n","language":"Haskell"},{"code":"thru=: <. + i.@(+*)@-~\nchr=: a.&i.\n\nlower=: 'a' thru&.chr 'z'\nupper=: 'A' thru&.chr 'Z'\ndigit=: '0' thru&.chr '9'\nother=: ('!' thru&.chr '~')-.lower,upper,digit,'`\\'\nall=: lower,upper,digit,other\n\npwgen =:verb define\"0 :: pwhelp\n NB. pick one of each, remainder from all, then shuffle\n (?~y) { (?@# { ])every lower;upper;digit;other;(y-4)#<all\n:\n pwgen x#y\n)\n\npwhelp =:echo bind (noun define)\n [x] pwgen y - generates passwords of length y\n optional x says how many to generate (if you want more than 1)\n\n y must be at least 4 because\n passwords must contain four different kinds of characters.\n)\n","language":"J"},{"code":" pwgen'help'\n [x] pwgen y - generates passwords of length y\n optional x says how many to generate (if you want more than 1)\n\n y must be at least 4 because\n passwords must contain four different kinds of characters.\n\n pwgen 10\nS%\"x8X0}:K\n 5 pwgen 10\n+u.9(XDM.O\n]a@Yb6j~DI\nOo?|2oc4yi\n9V9[EJ:Txs\n$vYd(>4L:m\n","language":"J"},{"code":"import java.util.*;\n\npublic class PasswordGenerator {\n final static Random rand = new Random();\n\n public static void main(String[] args) {\n int num, len;\n\n try {\n if (args.length != 2)\n throw new IllegalArgumentException();\n\n len = Integer.parseInt(args[0]);\n if (len < 4 || len > 16)\n throw new IllegalArgumentException();\n\n num = Integer.parseInt(args[1]);\n if (num < 1 || num > 10)\n throw new IllegalArgumentException();\n\n for (String pw : generatePasswords(num, len))\n System.out.println(pw);\n\n } catch (IllegalArgumentException e) {\n String s = \"Provide the length of the passwords (min 4, max 16) you \"\n + \"want to generate,\\nand how many (min 1, max 10)\";\n System.out.println(s);\n }\n }\n\n private static List<String> generatePasswords(int num, int len) {\n final String s = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\";\n\n List<String> result = new ArrayList<>();\n\n for (int i = 0; i < num; i++) {\n StringBuilder sb = new StringBuilder();\n sb.append(s.charAt(rand.nextInt(s.length())));\n sb.append((char) (rand.nextInt(10) + '0'));\n sb.append((char) (rand.nextInt(26) + 'a'));\n sb.append((char) (rand.nextInt(26) + 'A'));\n\n for (int j = 4; j < len; j++) {\n int r = rand.nextInt(93) + '!';\n if (r == 92 || r == 96) {\n j--;\n } else {\n sb.append((char) r);\n }\n }\n result.add(shuffle(sb));\n }\n return result;\n }\n\n public static String shuffle(StringBuilder sb) {\n int len = sb.length();\n for (int i = len - 1; i > 0; i--) {\n int r = rand.nextInt(i);\n char tmp = sb.charAt(i);\n sb.setCharAt(i, sb.charAt(r));\n sb.setCharAt(r, tmp);\n }\n return sb.toString();\n }\n}\n","language":"Java"},{"code":"String.prototype.shuffle = function() {\n return this.split('').sort(() => Math.random() - .5).join('');\n}\n\nfunction createPwd(opts = {}) {\n let len = opts.len || 5, // password length\n num = opts.num || 1, // number of outputs\n noSims = opts.noSims == false ? false : true, // exclude similar?\n out = [],\n cur, i;\n\n let chars = [\n 'abcdefghijkmnopqrstuvwxyz'.split(''),\n 'ABCDEFGHJKLMNPQRTUVWXY'.split(''),\n '346789'.split(''),\n '!\"#$%&()*+,-./:;<=>?@[]^_{|}'.split('')\n ];\n\n if (!noSims) {\n chars[0].push('l');\n chars[1] = chars[1].concat('IOSZ'.split(''));\n chars[2] = chars[2].concat('1250'.split(''));\n }\n\n if (len < 4) {\n console.log('Password length changed to 4 (minimum)');\n len = 4;\n }\n\n while (out.length < num) {\n cur = '';\n // basic requirement\n for (i = 0; i < 4; i++)\n cur += chars[i][Math.floor(Math.random() * chars[i].length)];\n\n while (cur.length < len) {\n let rnd = Math.floor(Math.random() * chars.length);\n cur += chars[rnd][Math.floor(Math.random() * chars[rnd].length)];\n }\n out.push(cur);\n }\n\n for (i = 0; i < out.length; i++) out[i] = out[i].shuffle();\n\n if (out.length == 1) return out[0];\n return out;\n}\n\n// testing\nconsole.log( createPwd() );\nconsole.log( createPwd( {len: 20}) );\nconsole.log( createPwd( {len: 20, num: 2}) );\nconsole.log( createPwd( {len: 20, num: 2, noSims: false}) );\n","language":"JavaScript"},{"code":"# Output: a prn in range(0;$n) where $n is `.`\ndef prn:\n if . == 1 then 0\n else . as $n\n | ([1, (($n-1)|tostring|length)]|max) as $w\n | [limit($w; inputs)] | join(\"\") | tonumber\n | if . < $n then . else ($n | prn) end\n end;\n\n# Input: an array\n# Output: an array, being a selection of $k elements from . chosen with replacement\ndef prns($k):\n . as $in\n | length as $n\n | [range(0; $k) | $in[$n|prn]];\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;\n\n# Generate a single password of length $len >= 4;\n# certain confusable characters are only allowed iff $simchars is truthy.\ndef passgen($len; $simchars):\n def stoa: explode | map([.]|implode);\n\n if $len < 4 then \"length must be at least 4\" | error\n else\n { DIGIT: (\"0123456789\" | stoa),\n UPPER: [range(65;91) | [.] | implode], # A-Z\n LOWER: [range(97;123) | [.] | implode], # a-z\n OTHER: (\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" | stoa) }\n | if $simchars|not\n then .DIGIT |= . - [\"0\", \"1\", \"2\", \"5\"]\n | .UPPER |= . - [\"O\", \"I\", \"Z\", \"S\"]\n | .LOWER |= . - [\"l\"]\n end\n | (reduce (.DIGIT, .UPPER, .LOWER, .OTHER) as $set ([];\n . + ($set | prns(1)))) +\n (.DIGIT + .UPPER + .LOWER + .OTHER | prns($len - 4))\n | knuthShuffle\n | join(\"\")\n end ;\n\ndef passgen($len):\n passgen($len; true);\n\n# Generate a stream of $npass passwords, each of length $len;\n# certain confusable characters are only allowed iff $simchars is truthy.\ndef passgen($len; $npass; $seed; $simchars):\n if ($seed | type) == \"number\" and $seed > 0 then $seed | prn else null end\n | range(0; $npass)\n | passgen($len; $simchars) ;\n\n\n### Examples:\n\"Without restriction:\", passgen(12; 5; null; true),\n\"\",\n\"Certain confusable characters are disallowed:\", passgen(12; 5; null; false)\n","language":"Jq"},{"code":"function passgen(len::Integer; simchars::Bool=true)::String\n if len < 4; error(\"length must be at least 4\") end\n # Definitions\n DIGIT = collect('0':'9')\n UPPER = collect('A':'Z')\n LOWER = collect('a':'z')\n OTHER = collect(\"!\\\"#\\$%&'()*+,-./:;<=>?@[]^_{|}~\")\n if !simchars\n setdiff!(DIGIT, ['0', '1', '2', '5'])\n setdiff!(UPPER, ['O', 'I', 'Z', 'S'])\n setdiff!(LOWER, [ 'l'])\n end\n ALL = union(DIGIT, UPPER, LOWER, OTHER)\n\n chars = collect(rand(set) for set in (DIGIT, UPPER, LOWER, OTHER))\n len -= 4\n append!(chars, rand(ALL, len))\n\n return join(shuffle!(chars))\nend\n\nfunction passgen(io::IO, len::Int=8, npass::Int=1; seed::Int=-1, simchars::Bool=true)::Vector{String}\n if seed > -1; srand(seed) end\n passwords = collect(passgen(len; simchars=simchars) for i in 1:npass)\n writedlm(io, passwords, '\\n')\n return passwords\nend\n\npassgen(stdout, 10, 12; seed = 1)\n","language":"Julia"},{"code":"// version 1.1.4-3\n\nimport java.util.Random\nimport java.io.File\n\nval r = Random()\nval rr = Random() // use a separate generator for shuffles\nval ls = System.getProperty(\"line.separator\")\n\nvar lower = \"abcdefghijklmnopqrstuvwxyz\"\nvar upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar digit = \"0123456789\"\nvar other = \"\"\"!\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\"\"\n\nval exclChars = arrayOf(\n \"'I', 'l' and '1'\",\n \"'O' and '0' \",\n \"'5' and 'S' \",\n \"'2' and 'Z' \"\n)\n\nfun String.shuffle(): String {\n val sb = StringBuilder(this)\n var n = sb.length\n while (n > 1) {\n val k = rr.nextInt(n--)\n val t = sb[n]\n sb[n] = sb[k]\n sb[k] = t\n }\n return sb.toString()\n}\n\nfun generatePasswords(pwdLen: Int, pwdNum: Int, toConsole: Boolean, toFile: Boolean) {\n val sb = StringBuilder()\n val ll = lower.length\n val ul = upper.length\n val dl = digit.length\n val ol = other.length\n val tl = ll + ul + dl + ol\n var fw = if (toFile) File(\"pwds.txt\").writer() else null\n\n if (toConsole) println(\"\\nThe generated passwords are:\")\n for (i in 0 until pwdNum) {\n sb.setLength(0)\n sb.append(lower[r.nextInt(ll)])\n sb.append(upper[r.nextInt(ul)])\n sb.append(digit[r.nextInt(dl)])\n sb.append(other[r.nextInt(ol)])\n\n for (j in 0 until pwdLen - 4) {\n val k = r.nextInt(tl)\n sb.append(when (k) {\n in 0 until ll -> lower[k]\n in ll until ll + ul -> upper[k - ll]\n in ll + ul until tl - ol -> digit[k - ll - ul]\n else -> other[tl - 1 - k]\n })\n }\n var pwd = sb.toString()\n repeat(5) { pwd = pwd.shuffle() } // shuffle 5 times say\n if (toConsole) println(\" ${\"%2d\".format(i + 1)}: $pwd\")\n if (toFile) {\n fw!!.write(pwd)\n if (i < pwdNum - 1) fw.write(ls)\n }\n }\n if (toFile) {\n println(\"\\nThe generated passwords have been written to the file pwds.txt\")\n fw!!.close()\n }\n}\n\nfun printHelp() {\n println(\"\"\"\n |This program generates up to 99 passwords of between 5 and 20 characters in\n |length.\n |\n |You will be prompted for the values of all parameters when the program is run\n |- there are no command line options to memorize.\n |\n |The passwords can either be written to the console or to a file (pwds.txt),\n |or both.\n |\n |The passwords must contain at least one each of the following character types:\n | lower-case letters : a -> z\n | upper-case letters : A -> Z\n | digits : 0 -> 9\n | other characters : !\"#$%&'()*+,-./:;<=>?@[]^_{|}~\n |\n |Optionally, a seed can be set for the random generator\n |(any non-zero Long integer) otherwise the default seed will be used.\n |Even if the same seed is set, the passwords won't necessarily be exactly\n |the same on each run as additional random shuffles are always performed.\n |\n |You can also specify that various sets of visually similar characters\n |will be excluded (or not) from the passwords, namely: Il1 O0 5S 2Z\n |\n |Finally, the only command line options permitted are -h and -help which\n |will display this page and then exit.\n |\n |Any other command line parameters will simply be ignored and the program\n |will be run normally.\n |\n \"\"\".trimMargin())\n}\n\nfun main(args: Array<String>) {\n if (args.size == 1 && (args[0] == \"-h\" || args[0] == \"-help\")) {\n printHelp()\n return\n }\n\n println(\"Please enter the following and press return after each one\")\n\n var pwdLen: Int?\n do {\n print(\" Password length (5 to 20) : \")\n pwdLen = readLine()!!.toIntOrNull() ?: 0\n }\n while (pwdLen !in 5..20)\n\n var pwdNum: Int?\n do {\n print(\" Number to generate (1 to 99) : \")\n pwdNum = readLine()!!.toIntOrNull() ?: 0\n }\n while (pwdNum !in 1..99)\n\n var seed: Long?\n do {\n print(\" Seed value (0 to use default) : \")\n seed = readLine()!!.toLongOrNull()\n }\n while (seed == null)\n if (seed != 0L) r.setSeed(seed)\n\n println(\" Exclude the following visually similar characters\")\n for (i in 0..3) {\n var yn: String\n do {\n print(\" ${exclChars[i]} y/n : \")\n yn = readLine()!!.toLowerCase()\n }\n while (yn != \"y\" && yn != \"n\")\n if (yn == \"y\") {\n when (i) {\n 0 -> {\n upper = upper.replace(\"I\", \"\")\n lower = lower.replace(\"l\", \"\")\n digit = digit.replace(\"1\", \"\")\n }\n\n 1 -> {\n upper = upper.replace(\"O\", \"\")\n digit = digit.replace(\"0\", \"\")\n }\n\n 2 -> {\n upper = upper.replace(\"S\", \"\")\n digit = digit.replace(\"5\", \"\")\n }\n\n 3 -> {\n upper = upper.replace(\"Z\", \"\")\n digit = digit.replace(\"2\", \"\")\n }\n }\n }\n }\n\n var toConsole: Boolean?\n do {\n print(\" Write to console y/n : \")\n val t = readLine()!!\n toConsole = if (t == \"y\") true else if (t == \"n\") false else null\n }\n while (toConsole == null)\n\n var toFile: Boolean? = true\n if (toConsole) {\n do {\n print(\" Write to file y/n : \")\n val t = readLine()!!\n toFile = if (t == \"y\") true else if (t == \"n\") false else null\n }\n while (toFile == null)\n }\n\n generatePasswords(pwdLen!!, pwdNum!!, toConsole, toFile!!)\n}\n","language":"Kotlin"},{"code":"function randPW (length)\n local index, pw, rnd = 0, \"\"\n local chars = {\n \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n \"abcdefghijklmnopqrstuvwxyz\",\n \"0123456789\",\n \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n }\n repeat\n index = index + 1\n rnd = math.random(chars[index]:len())\n if math.random(2) == 1 then\n pw = pw .. chars[index]:sub(rnd, rnd)\n else\n pw = chars[index]:sub(rnd, rnd) .. pw\n end\n index = index % #chars\n until pw:len() >= length\n return pw\nend\n\nmath.randomseed(os.time())\nif #arg ~= 2 then\n print(\"\\npwgen.lua\")\n print(\"=========\\n\")\n print(\"A Lua script to generate random passwords.\\n\")\n print(\"Usage: lua pwgen.lua [password length] [number of passwords to generate]\\n\")\n os.exit()\nend\nfor i = 1, arg[2] do print(randPW(tonumber(arg[1]))) end\n","language":"Lua"},{"code":"(* Length is the Length of the password, num is the number you want, \\\nand similar=1 if you want similar characters, 0 if not. True and \\\nFalse, should work in place of 1/0 *)\npwgen[length_Integer: 5, num_Integer: 1, similars_Boolean: 1] :=\n pwgenerator[length, num, similars] =\n Module[{list, valid, validchars, similar, k, j, password, pwlist,\n lcase, ucase, digits, spec, s}, lcase = Alphabet[];\n ucase = Capitalize[lcase];\n digits = Range[0, 9];\n spec = StringPartition[\"!:#$%\\'()*+,-./:;>=<?@{}[]^_|~\", 1];\n validchars = Flatten[Union[lcase, ucase, digits, spec]];\n similar = StringPartition[\"Il10O5S2Z\", 1];\n list = {};\n\n Table[valid = 0;\n While[valid == 0,\n For[j = 0; k = {};, j < length, j++,\n AppendTo[k, RandomInteger[{1, Length[validchars]}]]];\n k = Flatten[k];\n password = validchars[[k]];\n Which[(Intersection[password, similar] >= 1 && similars == 0 ),\n valid = 0;, (Intersection[password, similar] == 0 &&\n similars == 1),\n valid = 0;, (Intersection[password, similar] == 0 &&\n similars == 0 ), valid = 1;\n Return[password], (Intersection[password, similar] >= 1 &&\n similars == 1), valid = 1; Return[password]];\n ], {num}];\n\n\n ]\n","language":"Mathematica"},{"code":"import os, parseopt, random, sequtils, strformat, strutils\n\nconst Symbols = toSeq(\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\")\n\n\nproc passGen(passLength = 10,\n count = 1,\n seed = 0,\n excludeSimilars = false): seq[string] =\n ## Generate a sequence of passwords.\n\n # Initialize the random number generator.\n if seed == 0: randomize()\n else: randomize(seed)\n\n # Prepare list of chars per category.\n var\n lowerLetters = toSeq('a'..'z')\n upperLetters = toSeq('A'..'Z')\n digits = toSeq('0'..'9')\n\n if excludeSimilars:\n lowerLetters.delete(lowerLetters.find('l'))\n for c in \"IOSZ\": upperLetters.delete(upperLetters.find(c))\n for c in \"012\": digits.delete(digits.find(c))\n\n let all = lowerLetters & upperLetters & digits & Symbols\n\n # Generate the passwords.\n for _ in 1..count:\n var password = newString(passLength)\n password[0] = lowerLetters.sample\n password[1] = upperLetters.sample\n password[2] = digits.sample\n password[3] = Symbols.sample\n for i in 4..<passLength:\n password[i] = all.sample\n password.shuffle()\n result.add password\n\n\nproc printHelp() =\n ## Print the help message.\n echo &\"Usage: {getAppFileName().lastPathPart} \" &\n \"[-h] [-l:length] [-c:count] [-s:seed] [-x:(true|false)]\"\n echo \" -h: display this help\"\n echo \" -l: length of generated passwords\"\n echo \" -c: number of passwords to generate\"\n echo \" -s: seed for the random number generator\"\n echo \" -x: exclude similar characters\"\n\n\nproc getIntValue(key, val: string): int =\n ## Get a positive integer value from a string.\n try:\n result = val.parseInt()\n if result <= 0:\n raise newException(ValueError, \"\")\n except ValueError:\n quit &\"Wrong value for option -{key}: {val}\", QuitFailure\n\n\nvar\n passLength = 10\n count = 1\n seed = 0\n excludeSimilars = false\n\n# Process options.\nvar parser = initOptParser()\n\nfor kind, key, val in parser.getopt():\n if kind != cmdShortOption:\n printHelp()\n quit(QuitFailure)\n\n case key\n of \"h\":\n printHelp()\n quit(QuitSuccess)\n of \"l\":\n passLength = getIntValue(key, val)\n of \"c\":\n count = getIntValue(key, val)\n of \"s\":\n seed = getIntValue(key, val)\n of \"x\":\n if val.toLowerAscii == \"true\":\n excludeSimilars = true\n elif val.toLowerAscii == \"false\":\n excludeSimilars = false\n else:\n quit &\"Wrong value for option -x: {val}\", QuitFailure\n else:\n quit &\"Wrong option: -{key}\"\n\n# Display the passwords.\nfor pw in passGen(passLength, count, seed, excludeSimilars):\n echo pw\n","language":"Nim"},{"code":"let lower = \"abcdefghijklmnopqrstuvwxyz\"\nlet upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nlet digit = \"0123456789\"\nlet other = \"!\\034#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n\nlet visually_similar = \"Il1O05S2Z\"\n\n\nlet mk_pwd len readable =\n let get_char i =\n match i mod 4 with\n | 0 -> lower.[Random.int (String.length lower)]\n | 1 -> upper.[Random.int (String.length upper)]\n | 2 -> digit.[Random.int (String.length digit)]\n | 3 -> other.[Random.int (String.length other)]\n | _ -> raise Exit\n in\n let f =\n if readable then\n (fun i ->\n let rec aux () =\n let c = get_char i in\n if String.contains visually_similar c\n then aux ()\n else (String.make 1 c)\n in\n aux ()\n )\n else\n (fun i ->\n let c = get_char i in\n (String.make 1 c)\n )\n in\n let r = Array.init len f in\n Array.sort (fun _ _ -> (Random.int 3) - 1) r;\n (String.concat \"\" (Array.to_list r))\n\n\nlet () =\n Random.self_init ();\n let num = ref 1 in\n let len = ref 8 in\n let readable = ref false in\n let speclist = [\n \"-n\", Arg.Set_int num, \"number of passwords\";\n \"-c\", Arg.Set_int len, \"number of characters\";\n \"--readable\", Arg.Set readable, \"readable\";\n \"--rand-init\", Arg.String (fun s ->\n Random.full_init\n (Array.map int_of_char (Array.of_seq (String.to_seq s)))\n ), \"initialise the random generator with a string\";\n ] in\n Arg.parse speclist (fun s -> invalid_arg s) \"Password generator\";\n for i = 1 to !num do\n print_endline (mk_pwd !len !readable)\n done\n","language":"OCaml"},{"code":"/*REXX program generates a random password according to the Rosetta Code task's rules.*/\nparse arg L N seed xxx dbg /*obtain optional arguments from the CL*/\ncasl= 'abcdefghijklmnopqrstuvwxyz' /*define lowercase alphabet. */\ncasu= translate(casle) /*define uppercase alphabet. */\ndigs= '0123456789' /*define digits. */\n/* avoiding the ambiguous characters Il1 o0 5S */\ncasl= 'abcdefghijkmnpqrtuvwxy' /*define lowercase alphabet. */\ncasu= translate(casl) /*define uppercase alphabet. */\ndigs= '0123456789' /*define digits. */\nspec= '''!\"#$%&()+,-./:;<=>?@[]^{|}~' /*define a bunch of special characters.*/\nif L='?' then call help /*does user want documentation shown? */\nif L='' | L=\",\" then L=8 /*Not specified? Then use the default.*/\nIf N='' | N=\",\" then N=1 /* \" \" \" \" \" \" */\nIf xxx=''| xxx=\",\" then xxx='1lI0O2Z5S' /* \" \" \" \" \" \" */\nif seed>'' &,\n seed<>',' then Do\n if \\datatype(seed,'W')then call ser \"seed is not an integer:\" seed\n Call random ,,seed /*the seed for repeatable RANDOM BIF #s*/\n End\ncasl=remove(xxx,casl)\ncasu=remove(xxx,casu)\ndigs=remove(xxx,digs)\nSay 'casl='casl\nSay 'casu='casu\nSay 'digs='digs\nSay 'spec='spec\nif \\datatype(L, 'W') then call ser \"password length, it isn't an integer: \" L\nif L<4 then call ser \"password length, it's too small: \" L\nif L>80 then call ser \"password length, it's too large: \" L\nif \\datatype(N, 'W') then call ser \"number of passwords, it isn't an integer: \" N\nif N<0 then call ser \"number of passwords, it's too small: \" N\n\n do g=1 for N /*generate N passwords (default is 1)*/\n pw=letterL()||letterU()||numeral()||special()/*generate 4 random PW constituents.*/\n do k=5 to L; z=random(1, 4) /* [?] flush out PW with more parts. */\n if z==1 then pw=pw || letterL() /*maybe append random lowercase letter.*/\n if z==2 then pw=pw || letterU() /* \" \" \" uppercase \" */\n if z==3 then pw=pw || numeral() /* \" \" \" numeral */\n if z==4 then pw=pw || special() /* \" \" \" special character*/\n end /*k*/ /* [?] code below randomizes PW chars.*/\n t=length(pw) /*the length of the password (in bytes)*/\n do L+L /*perform a random number of char swaps*/\n a=random(1,t); x=substr(pw,a,1) /*A: 1st char location; X is the char.*/\n b=random(1,t); y=substr(pw,b,1) /*B: 2nd \" \" Y \" \" \" */\n pw=overlay(x,pw,b); pw=overlay(y,pw,a) /* swap the two chars. */\n end /*swaps*/ /* [?] perform extra swap to be sure. */\n say right(g,length(N)) 'password is: ' pw counts() /*display the Nth password */\n end /*g*/\nexit /*stick a fork in it, we're all done. */\n/*--------------------------------------------------------------------------------------*/\nser: say; say '***error*** invalid' arg(1); exit 13 /*display an error message*/\nletterL: return substr(casl, random(1, length(casl)), 1) /*return random lowercase.*/\nletterU: return substr(casu, random(1, length(casu)), 1) /* \" \" uppercase.*/\nnumeral: return substr(digs, random(1, length(digs)), 1) /* \" \" numeral. */\nspecial: return substr(spec, random(1, length(spec)), 1) /* \" \" special char*/\nremove: Procedure\n Parse arg nono,s\n Return space(translate(s,'',nono),0)\n/*--------------------------------------------------------------------------------------*/\ncounts:\n If dbg>'' Then Do\n cnt.=0\n str.=''\n Do j=1 To length(pw)\n c=substr(pw,j,1)\n If pos(c,casL)>0 Then Do; cnt.0casL=cnt.0casL+1; str.0casL=str.0casL||c; End\n If pos(c,casU)>0 Then Do; cnt.0casU=cnt.0casU+1; str.0casU=str.0casU||c; End\n If pos(c,digs)>0 Then Do; cnt.0digs=cnt.0digs+1; str.0digs=str.0digs||c; End\n If pos(c,spec)>0 Then Do; cnt.0spec=cnt.0spec+1; str.0spec=str.0spec||c; End\n End\n txt=cnt.0casL cnt.0casU cnt.0digs cnt.0spec\n If pos(' 0 ',txt)>0 Then\n txt=txt 'error'\n Return txt str.0casL str.0casU str.0digs str.0spec\n End\n Else\n txt=''\n Return txt\nhelp: signal .; .: do j=sigL+2 to sourceline()-1; say sourceline(j); end; exit 0\n/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~ documentation begins on next line.~~~~~~~~~~~~~~~~~~~~~~~~~\n+-----------------------------------------------------------------------------+\n¦ Documentation for the GENPW program: ¦\n¦ ¦\n¦ Rexx genpwd <length|,> <howmany|,> <seed|,> <xxx|,> <dbg> ¦\n¦ 8 1 n '1lI0O2Z5S' none Defaults ¦\n¦ ¦\n¦--- where: ¦\n¦ length is the length of the passwords to be generated. ¦\n¦ The default is 8. ¦\n¦ If a comma (,) is specified, the default is used. ¦\n¦ The minimum is 4, the maximum is 80. ¦\n¦ ¦\n¦ howMany is the number of passwords to be generated. ¦\n¦ The default is 1. ¦\n¦ xxx Characters NOT to be used in generated passwords ¦\n¦ dbg Schow count of characters in the 4 groups ¦\n+-----------------------------------------------------------------------------+\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~documentation ends on the previous line.~~~~~~~~~~~~~~~~~~~*/\n","language":"OoRexx"},{"code":"passwd(len=8, count=1, seed=0) =\n{\n if (len <= 4, print(\"password too short, minimum len=4\"); return(), seed, setrand(seed));\n\n my (C=[\"abcdefghijklmnopqrstuvwxyz\",\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\"0123456789\",\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"], P, j);\n\n for (i=1, count, K = vector(#C); P = \"\";\n for (l=1, len, K[j = random(#C)+1]++;\n P = concat(P, Strchr(Vecsmall(C[j])[random(#C[j])+1]))\n );\n if (prod(z=1, #K, K[z]), print(P), i--) \\\\ if password contains all char classes print else redo\n );\n}\n\naddhelp(passwd, \"passwd({len},{count},{seed}): Password generator, optional: len (min=4, default=8), count (default=1), seed (default=0: no seed)\");\n","language":"PARI-GP"},{"code":"program passwords (input,output);\n\n{$mode objfpc}\n{$H+} { We will need ansi strings instead of short strings\n to hold passwords longer than 255 characters.\n We need to assemble a string to check that each\n password contains an upper, lower, numeral and symbol }\n\n{ This is a random password generater in PASCAL\n Copyright Englebert Finklestien on this day which is\n Setting Orange day 48 of The Aftermath YOLD 3184.\n It is distributed under the terms of the GNU GPL (v3)\n As published by the free software foundation.\n\n Usage :-\n Without any command line arguments this program\n will display 8 8-character long completely random passwords using\n all 96 available character glyphs from the basic ascii set.\n\n With a single integer numerical argument it will\n produce eight passwords of the chosen length.\n\n With a second integer numerical argument between 1 and 65536 it\n will produce that number of passwords.\n\n With two integer arguments the first is taken as the length of password\n and the second as the number of passwords to produce.\n\n The length of passwords can also be specified using -l or --length options\n\n The number of passwords can also be specified using -n or --number options\n\n It is also possible to exclude those glyphs which are simmilar enough to be\n confused (e.g. O and 0) using the -e or --exclude option\n\n There are also the standard -a --about and -h --help options\n\n Other options will produce an error message and the program will halt without\n producing any passwords at all.\n\n }\n\nuses sysutils, getopts;\n\n\n\nvar c : char;\n optionindex : Longint;\n theopts : array[1..5] of TOption;\n numpass, lenpass, count,j : integer;\n i : longint; { used to get a random number }\n strength : byte; { check inclusion of different character groups }\n password : string; { To hold a password as we generate it }\n exc : boolean;\n ex : set of char;\n\nprocedure about;\nbegin\n writeln('Engleberts random password generator');\n writeln('Writen in FreePascal on Linux');\n writeln('This is free software distributed under the GNU GPL v3');\n writeln;\nend;\n\nprocedure help;\nbegin\n writeln('Useage:-');\n writeln('passwords produce 8 passwords each 8 characters long.');\n writeln('Use one or more of the following switches to control the output.');\n writeln('passwords --number=xx -nxx --length=xx -lxx --exclude -e --about -a --help -h');\n writeln('passwords ll nn produce nn passwords of length ll');\n writeln('The exclude option excludes easily confused characters such as `0` and `O` from');\n writeln('the generated passwords.');\n writeln;\nend;\n\n\nbegin\n numpass := 8;\n lenpass := 8;\n exc := False;\n ex := ['1','!','l','|','i','I','J','0','O','S','$','5',';',':',',','.','\\']; { Set of ambiguous characters }\n OptErr := True;\n Randomize; {initialise the random number generator}\n {set up to handle the command line options}\n with theopts[1] do\n begin\n name:='length';\n has_arg:=1;\n flag:=nil;\n value:=#0;\n end;\n with theopts[2] do\n begin\n name:='number';\n has_arg:=1;\n flag:=nil;\n value:=#0;\n end;\n with theopts[3] do\n begin\n name:='help';\n has_arg:=0;\n flag:=nil;\n value:=#0;\n end;\n with theopts[4] do\n begin\n name:='about';\n has_arg:=0;\n flag:=nil;\n value:=#0;\n end;\n with theopts[5] do\n begin\n name:='exclude';\n has_arg:=0;\n flag:=nil;\n value:=#0;\n end;\n\n{ Get and process long and short versions of command line args. }\n c:=#0;\n repeat\n c:=getlongopts('ahel:n:t:',@theopts[1],optionindex);\n case c of\n #0 : begin\n if (theopts[optionindex].name = 'exclude') then exc := True;\n if (theopts[optionindex].name = 'length') then lenpass := StrtoInt(optarg);\n if (theopts[optionindex].name = 'number') then numpass := StrtoInt(optarg);\n\t if (theopts[optionindex].name = 'about') then about;\n\t if (theopts[optionindex].name = 'help') then help;\n end;\n 'a' : about;\n 'h' : help;\n 'e' : exc := True;\n 'l' : lenpass := StrtoInt(optarg);\n 'n' : numpass := StrtoInt(optarg);\n '?',':' : writeln ('Error with opt : ',optopt);\n end; { case }\n until c=endofoptions;\n { deal with any remaining command line parameters (two integers)}\n if optind<=paramcount then\n begin\n count:=1;\n while optind<=paramcount do\n begin\n\t if (count=1) then lenpass := StrtoInt(paramstr(optind)) else numpass := StrtoInt(paramstr(optind));\n inc(optind);\n\t inc(count);\n end;\n end;\n\tif not (exc) then ex :=['\\']; { if we are not going to exclude characters set the exclusion set to almost empty }\n\t{ This generates and displays the actual passwords }\n for count := 1 to numpass do begin\n strength := $00;\n repeat\n password :='';\n for j:= 1 to lenpass do begin\n repeat\n i:=Random(130);\n until (i>32) and (i<127) and (not(chr(i) in ex)) ;\n AppendStr(password,chr(i));\n if (CHR(i) in ['0'..'9']) then strength := strength or $01;\n if (chr(i) in ['a'..'z']) then strength := strength or $02;\n if (chr(i) in ['A'..'Z']) then strength := strength or $04;\n if (chr(i) in ['!'..'/']) then strength := strength or $08;\n if (chr(i) in [':'..'@']) then strength := strength or $08;\n if (chr(i) in ['['..'`']) then strength := strength or $08;\n if (chr(i) in ['{'..'~']) then strength := strength or $08;\n end;\t\n until strength = $0f;\n writeln(password);\n end;\nend.\n","language":"Pascal"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\n\nuse English;\nuse Const::Fast;\nuse Getopt::Long;\nuse Math::Random;\n\nconst my @lcs => 'a' .. 'z';\nconst my @ucs => 'A' .. 'Z';\nconst my @digits => 0 .. 9;\nconst my $others => q{!\"#$%&'()*+,-./:;<=>?@[]^_{|}~}; # \"\n\nmy $pwd_length = 8;\nmy $num_pwds = 6;\nmy $seed_phrase = 'TOO MANY SECRETS';\n\nmy %opts = (\n'password_length=i' => \\$pwd_length,\n'num_passwords=i' => \\$num_pwds,\n'seed_phrase=s' => \\$seed_phrase,\n'help!' => sub {command_line_help(); exit 0}\n);\ncommand_line_help() and exit 1 unless $num_pwds >= 1 and $pwd_length >= 4 and GetOptions(%opts);\n\nrandom_set_seed_from_phrase($seed_phrase);\nsay gen_password() for 1 .. $num_pwds;\n\nsub gen_password {\n my @generators = (\\&random_lc, \\&random_uc, \\&random_digit, \\&random_other);\n my @chars = map {$ARG->()} @generators; # At least one char of each type.\n push @chars, $generators[random_uniform_integer(1, 0, 3)]->() for 1 .. $pwd_length - 4;\n join '', random_permutation(@chars);\n}\n\nsub random_lc { $lcs[ random_uniform_integer(1, 0, $#lcs) ] }\nsub random_uc { $ucs[ random_uniform_integer(1, 0, $#ucs) ] }\nsub random_digit { $digits[ random_uniform_integer(1, 0, $#digits) ] }\nsub random_other { substr($others, random_uniform_integer(1, 0, length($others)-1), 1) }\n\nsub command_line_help {\n say <<~END\n Usage: $PROGRAM_NAME\n [--password_length=<l> default: 8, minimum: 4]\n [--num_passwords=<n> default: 6, minimum: 1]\n [--seed_phrase=<s> default: TOO MANY SECRETS (optional)]\n [--help]\n END\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--with javascript_semantics -- not quite yet:</span>\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span> <span style=\"color: #000080;font-style:italic;\">-- (VALUECHANGED_CB not yet triggering)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">az</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"abcdefghijklmnopqrstuvwxyz\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">AZ</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">O9</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"1234567890\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">OT</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">password</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">exclude</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">\"Il1O05S2Z\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span>\n <span style=\"color: #000000;\">S4</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">apply</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">filter</span><span style=\"color: #0000FF;\">,{{</span><span style=\"color: #000000;\">az</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">AZ</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">O9</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">OT</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #008000;\">\"out\"</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">exclude</span><span style=\"color: #0000FF;\">}})</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">pw</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">sel</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">shuffle</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">}&</span><span style=\"color: #7060A8;\">sq_rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">len</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">)))</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">len</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">S4c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">S4</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">sel</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]]</span>\n <span style=\"color: #000000;\">pw</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">S4c</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">S4c</span><span style=\"color: #0000FF;\">))]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pw</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">lenl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">leng</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numl</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numb</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">dlg</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">valuechanged_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*leng|numb*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">l</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">leng</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">numb</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"VALUE\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">password</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">l</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">s</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">substitute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"&\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"&&\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (on p2js??)</span>\n <span style=\"color: #7060A8;\">IupSetStrAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"TITLE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">s</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"SIZE\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupRefresh</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">lenl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"length(4..99)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">leng</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupText</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"SPIN=YES,SPINMIN=4,SPINMAX=99\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">numl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"number(1..99)\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">numb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupText</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"SPIN=YES,SPINMIN=1,SPINMAX=99\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupLabel</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"FONTFACE=Courier\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">leng</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">numb</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"VALUECHANGED_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"valuechanged_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">IupVbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">lenl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">leng</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">numl</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">numb</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #008000;\">\"GAP=10,NORMALIZESIZE=VERTICAL\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #7060A8;\">IupHbox</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">})},</span><span style=\"color: #008000;\">\"MARGIN=5x5\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #008000;\">`TITLE=\"Password Generator\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"#!/usr/bin/pil\n\n# Default seed\n(seed (in \"/dev/urandom\" (rd 8)))\n\n# Global defaults\n(setq\n *PwCount 1\n *PwLength 12\n *UppChars (mapcar char (range (char \"A\") (char \"Z\")))\n *LowChars (mapcar lowc *UppChars)\n *Digits (mapcar format (range 0 9))\n *Others (chop \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\") )\n\n# Command line options\n(de -count ()\n (setq *PwCount (format (opt))) )\n\n(de -length ()\n (setq *PwLength (format (opt))) )\n\n(de -seed ()\n (seed (opt)) )\n\n(de -exclude ()\n (for C (chop (opt))\n (del C '*UppChars)\n (del C '*LowChars)\n (del C '*Digits)\n (del C '*Others) ) )\n\n(de -help ()\n (prinl \"Generate password(s)\")\n (prinl \"Options:\")\n (prinl \" --help\")\n (prinl \" --count <num>\")\n (prinl \" --length <num>\")\n (prinl \" --seed <chars>\")\n (prinl \" --exclude <chars>\")\n (bye) )\n\n(load T)\n\n# Return random character from list\n(de randChar (Lst)\n (get Lst (rand 1 (length Lst))) )\n\n# Generate password(s)\n(do *PwCount\n (prinl\n (by '(NIL (rand)) sort\n (make\n (link\n (randChar *UppChars) # At least one from each group\n (randChar *LowChars)\n (randChar *Digits)\n (randChar *Others) )\n (do (- *PwLength 4)\n (link\n (randChar\n (caar\n (rot '(*UppChars *Others *Digits *LowChars))) ) ) ) ) ) ) )\n\n(bye)\n","language":"PicoLisp"},{"code":"function New-RandomPassword\n{\n <#\n .SYNOPSIS\n Generates one or more passwords.\n .DESCRIPTION\n Generates one or more passwords.\n .PARAMETER Length\n The password length (default = 8).\n .PARAMETER Count\n The number of passwords to generate.\n .PARAMETER Source\n An array of strings containing characters from which the password will be generated. The default is good for most uses.\n .PARAMETER ExcludeSimilar\n A switch which indicates that visually similar characters should be ignored.\n .EXAMPLE\n New-RandomPassword\n\n Generates one password of the default length (8 characters).\n .EXAMPLE\n New-RandomPassword -Count 4\n\n Generates four passwords each of the default length (8 characters).\n .EXAMPLE\n New-RandomPassword -Length 12 -Source abcdefghijklmnopqrstuvwxyz, ABCDEFGHIJKLMNOPQRSTUVWXYZ, 0123456789\n\n Generates a password with a length of 12 containing at least one char from each string in Source\n .EXAMPLE\n New-RandomPassword -Count 4 -ExcludeSimilar\n\n Generates four passwords each of the default length (8 characters) while excluding similar characters \"Il1O05S2Z\".\n #>\n [CmdletBinding()]\n [OutputType([string])]\n Param\n (\n [Parameter(Mandatory=$false)]\n [ValidateRange(1,[Int]::MaxValue)]\n [Alias(\"l\")]\n [int]\n $Length = 8,\n\n [Parameter(Mandatory=$false)]\n [ValidateRange(1,[Int]::MaxValue)]\n [Alias(\"n\",\"c\")]\n [int]\n $Count = 1,\n\n [Parameter(Mandatory=$false)]\n [Alias(\"s\")]\n [string[]]\n $Source = @(\"abcdefghijklmnopqrstuvwxyz\", \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\", \"0123456789\", \"!\\`\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"),\n\n [Parameter(Mandatory=$false)]\n [Alias(\"x\")]\n [switch]\n $ExcludeSimilar\n )\n\n Begin\n {\n [char[][]] $charArrays = $Source\n [char[]] $allChars = $charArrays | ForEach-Object {$_}\n [char[]] $similar = \"Il1O05S2Z\".ToCharArray()\n\n $random = New-Object -TypeName System.Security.Cryptography.RNGCryptoServiceProvider\n\n function Get-Seed\n {\n $bytes = New-Object -TypeName System.Byte[] -Argument 4\n $random.GetBytes($bytes)\n [BitConverter]::ToUInt32($bytes, 0)\n }\n\n function Add-PasswordCharacter ([char[]]$From)\n {\n $key = Get-Seed\n\n while ($password.ContainsKey($key))\n {\n $key = Get-Seed\n }\n\n $index = (Get-Seed) % $From.Count\n\n if ($ExcludeSimilar)\n {\n while ($From[$index] -in $similar)\n {\n $index = (Get-Seed) % $From.Count\n }\n }\n\n $password.Add($key, $From[$index])\n }\n }\n Process\n {\n for ($i = 1;$i -le $Count; $i++)\n {\n [hashtable] $password = @{}\n\n foreach ($array in $charArrays)\n {\n if($password.Count -lt $Length)\n {\n Add-PasswordCharacter -From $array # Append to $password\n }\n }\n\n for ($j = $password.Count; $j -lt $Length; $j++)\n {\n Add-PasswordCharacter -From $allChars # Append to $password\n }\n\n ($password.GetEnumerator() | Select-Object -ExpandProperty Value) -join \"\"\n }\n }\n}\n","language":"PowerShell"},{"code":"New-RandomPassword -Length 12 -Count 4 -ExcludeSimilar\n","language":"PowerShell"},{"code":"Set-Alias -Name nrp -Value New-RandomPassword -Description \"Generates one or more passwords\"\n\nnrp -l 12 -n 4 -x\n","language":"PowerShell"},{"code":":- set_prolog_flag(double_quotes, chars).\n:- initialization(main, main).\n\nmain( Argv ) :-\n opt_spec( Spec ),\n opt_parse( Spec, Argv, Opts, _ ),\n (\n member( help(true), Opts ) -> show_help\n ;\n member( length( Len ), Opts ),\n member( number( Num ), Opts ),\n print_set_of_passwords( Len, Num )\n ).\n\nshow_help :-\n opt_spec( Spec ),\n opt_help( Spec, HelpText ),\n write( 'Usage: swipl pgen.pl <options>\\n\\n' ),\n write( HelpText ),\n nl.\n\nopt_spec([\n [opt(help), type(boolean), default(false), shortflags([h]), longflags([help]),\n help('Show Help')],\n [opt(length), type(integer), default(10), shortflags([l]), longflags([length]),\n help('Specify the length of each password.')],\n [opt(number), type(integer), default(1), shortflags([n]), longflags([number]),\n help('Specify the number of passwords to create.')]\n]).\n\nprint_set_of_passwords( Length, Number ) :-\n forall(\n between( 1, Number, _ ),\n (\n random_pword( Length, P ),\n maplist( format('~w'), P ),\n nl\n )\n ).\n\nrandom_pword( Length, Pword ) :-\n length( GenPword, Length ),\n findall( C, pword_char( _, C), PwordChars ),\n repeat,\n maplist(populate_pword( PwordChars ), GenPword ),\n maplist( pword_char_rule( GenPword ), [lower, upper, digits, special] ),\n random_permutation( GenPword, Pword ).\n\npopulate_pword( PwordChars, C ) :- random_member( C, PwordChars ).\n\npword_char_rule( Pword, Type ) :-\n pword_char( Type, C ),\n member( C, Pword).\n\npword_char( lower, C ) :- member( C, \"abcdefghijklmnopqrstuvwxyz\" ).\npword_char( upper, C ) :- member( C, \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\" ).\npword_char( digits, C ) :- member( C, \"0123456789\" ).\npword_char( special, C ) :- member( C, \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" ).\n","language":"Prolog"},{"code":"EnableExplicit\n\nProcedure.b CheckPW(pw.s)\n Define flag.b=#True,\n tmp.b=#False,\n c.c,\n s.s,\n i.i\n For c='a' To 'z'\n tmp=Bool(FindString(pw,Chr(c)))\n If tmp : Break : EndIf\n Next\n flag & tmp\n tmp=#False\n For c='A' To 'Z'\n tmp=Bool(FindString(pw,Chr(c)))\n If tmp : Break : EndIf\n Next\n flag & tmp\n tmp=#False\n For c='0' To '9'\n tmp=Bool(FindString(pw,Chr(c)))\n If tmp : Break : EndIf\n Next\n flag & tmp\n tmp=#False\n For c='!' To '/'\n s+Chr(c)\n Next\n For c=':' To '@'\n s+Chr(c)\n Next\n s+\"[]^_{|}~\"\n For i=1 To Len(pw)\n tmp=Bool(FindString(s,Mid(pw,i,1)))\n If tmp : Break : EndIf\n Next\n flag & tmp\n ProcedureReturn flag\nEndProcedure\n\nProcedure.s InputHdl(prompt.s=\"\")\n Define txt.s,\n s.s,\n r.i,\n hlp.s\n Restore Help_01\n Read.s hlp\n Print(prompt)\n Repeat\n s=Inkey()\n If s<>\"\"\n If FindString(\"0123456789\",s)\n txt+s\n Print(s)\n EndIf\n If s=Chr(27)\n txt=\"0\"\n Break\n EndIf\n ElseIf RawKey()\n r=RawKey()\n If r=112\n PrintN(\"\")\n PrintN(hlp)\n Print(~\"\\n\"+prompt)\n EndIf\n EndIf\n Delay(20)\n Until s=Chr(13)\n PrintN(\"\")\n ProcedureReturn txt\nEndProcedure\n\nNewList PasswordChar.c()\nDefine c.c,\n pwlen.i,\n n_of_pw.i,\n pwstr.s,\n i.i\nFor c='!' To '~'\n If c<>'\\' And c<>'`'\n AddElement(PasswordChar()) : PasswordChar()=c\n EndIf\nNext\nOpenConsole(\"Password generator: F1=Help; Esc=End\")\nRepeat\n pwlen=Abs(Val(InputHdl(\"Length of the password (n>=4): \")))\n If pwlen=0 : Break : EndIf\n If pwlen<4 : Continue : EndIf\n n_of_pw=Abs(Val(InputHdl(\"Number of passwords (n>=1): \")))\n If n_of_pw=0 : Break : EndIf\n For i=1 To n_of_pw\n Repeat\n pwstr=Mid(pwstr,2)\n RandomizeList(PasswordChar())\n ResetList(PasswordChar())\n While NextElement(PasswordChar())\n pwstr+Chr(PasswordChar())\n If Len(pwstr)>=pwlen : Break : EndIf\n Wend\n Until CheckPW(pwstr)\n PrintN(RSet(Str(i),Len(Str(n_of_pw)),\" \")+\") \"+pwstr)\n pwstr=\"\"\n Next\n PrintN(\"\")\nForEver\nEnd\n\nDataSection\n Help_01:\n Data.s ~\"Help: Password generator\\n\"+\n ~\"------------------------\\n\"+\n ~\"Blabla bla blabla bla blablabla.\\n\"+\n ~\"Blabla bla blablabla.\\n\"+\n ~\"Bla blabla bla blablabla bla.\\n\"+\n ~\"Blabla bla blabla bla.\\n\"+\n ~\"Bla blabla bla blablabla blablabla.\\n\"+\n ~\"Blabla bla blabla bla blablabla.\\n\"+\n ~\"Blabla blabla bla blablabla.\"\n EndOfHelp:\nEndDataSection\n","language":"PureBasic"},{"code":"import random\n\nlowercase = 'abcdefghijklmnopqrstuvwxyz' # same as string.ascii_lowercase\nuppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' # same as string.ascii_uppercase\ndigits = '0123456789' # same as string.digits\npunctuation = '!\"#$%&\\'()*+,-./:;<=>?@[]^_{|}~' # like string.punctuation but without backslash \\ nor grave `\n\nallowed = lowercase + uppercase + digits + punctuation\n\nvisually_similar = 'Il1O05S2Z'\n\n\ndef new_password(length:int, readable=True) -> str:\n if length < 4:\n print(\"password length={} is too short,\".format(length),\n \"minimum length=4\")\n return ''\n choice = random.SystemRandom().choice\n while True:\n password_chars = [\n choice(lowercase),\n choice(uppercase),\n choice(digits),\n choice(punctuation)\n ] + random.sample(allowed, length-4)\n if (not readable or\n all(c not in visually_similar for c in password_chars)):\n random.SystemRandom().shuffle(password_chars)\n return ''.join(password_chars)\n\n\ndef password_generator(length, qty=1, readable=True):\n for i in range(qty):\n print(new_password(length, readable))\n","language":"Python"},{"code":"passwords <- function(nl = 8, npw = 1, help = FALSE) {\n if (help) return(\"gives npw passwords with nl characters each\")\n if (nl < 4) nl <- 4\n spch <- c(\"!\", \"\\\"\", \"#\", \"$\", \"%\", \"&\", \"'\", \"(\", \")\", \"*\", \"+\", \",\", \"-\", \".\", \"/\", \":\", \";\", \"<\", \"=\", \">\", \"?\", \"@\", \"[\", \"]\", \"^\", \"_\", \"{\", \"|\", \"}\", \"~\")\n for(i in 1:npw) {\n pw <- c(sample(letters, 1), sample(LETTERS, 1), sample(0:9, 1), sample(spch, 1))\n pw <- c(pw, sample(c(letters, LETTERS, 0:9, spch), nl-4, replace = TRUE))\n cat(sample(pw), \"\\n\", sep = \"\")\n }\n}\n\nset.seed(123)\npasswords(help = TRUE)\n## [1] \"gives npw passwords with nl characters each\"\n\npasswords(8)\n## S2XnQoy*\n\npasswords(14, 5)\n## :.iJ=Q7_gP?Cio\n## !yUu7OL|eH;}1p\n## y2{DNvV^Zl^IFe\n## Tj@T19L.q1;I*]\n## 6M+{)xV?i|1UJ/\n","language":"R"},{"code":"#lang racket\n\n(require racket/cmdline)\n\n(define valid-uppercase '(#\\A #\\B #\\C #\\D #\\E #\\F #\\G #\\H #\\I #\\J\n #\\K #\\L #\\M #\\N #\\O #\\P #\\Q #\\R #\\S #\\T\n #\\U #\\V #\\W #\\X #\\Y #\\Z))\n(define valid-lowercase '(#\\a #\\b #\\c #\\d #\\e #\\f #\\g #\\h #\\i #\\j\n #\\k #\\l #\\m #\\n #\\o #\\p #\\q #\\r #\\s #\\t\n #\\u #\\v #\\w #\\x #\\y #\\z))\n(define valid-numbers '(#\\0 #\\1 #\\2 #\\3 #\\4 #\\5 #\\6 #\\7 #\\8 #\\9))\n(define valid-symbols '(#\\! #\\\\ #\\\" #\\# #\\$ #\\% #\\& #\\' #\\( #\\)\n #\\* #\\+ #\\, #\\- #\\. #\\/ #\\: #\\; #\\< #\\=\n #\\> #\\? #\\@ #\\[ #\\] #\\^ #\\_ #\\{ #\\| #\\}\n #\\~))\n\n(define visual-invalid '(#\\0 #\\O #\\1 #\\I #\\l #\\| #\\5 #\\S #\\2 #\\Z))\n\n(define (is-readable? c)\n (empty? (filter (lambda (x) (eq? x c)) visual-invalid)))\n\n(define (random-selection lst)\n (list-ref lst (random (length lst))))\n\n(define (generate len readable)\n (let ([upper (if readable (filter is-readable? valid-uppercase) valid-uppercase)]\n [lower (if readable (filter is-readable? valid-lowercase) valid-lowercase)]\n [numbers (if readable (filter is-readable? valid-numbers) valid-numbers)]\n [symbols (if readable (filter is-readable? valid-symbols) valid-symbols)])\n (let loop ([lst (map random-selection (list upper lower numbers symbols))])\n (cond\n [(<= len (length lst)) (shuffle lst)]\n [else (match (random 4)\n [0 (loop (cons (random-selection upper) lst))]\n [1 (loop (cons (random-selection lower) lst))]\n [2 (loop (cons (random-selection numbers) lst))]\n [3 (loop (cons (random-selection symbols) lst))])]))))\n\n(define (run len cnt seed readable)\n (random-seed seed)\n (let loop ([x cnt])\n (unless (zero? x)\n (display (list->string (generate len readable)))\n (newline)\n (loop (- x 1)))))\n\n(define len (make-parameter 10))\n(define cnt (make-parameter 1))\n(define seed (make-parameter (random 1 1000000)))\n(define readable? (make-parameter #f))\n\n(command-line #:program \"passwdgen\"\n #:once-each\n [(\"-l\" \"--length\") integer \"password length\" (len (string->number integer))]\n [(\"-c\" \"--count\") integer \"number of password\" (cnt (string->number integer))]\n [(\"-s\" \"--seed\") integer \"random generator seed\" (seed (string->number integer))]\n [(\"-r\" \"--readable\") \"safe characters\" (readable? #t)])\n\n\n(run (len) (cnt) (seed) (readable?))\n","language":"Racket"},{"code":"my @chars =\n set('a' .. 'z'),\n set('A' .. 'Z'),\n set('0' .. '9'),\n set(<!\"#$%&'()*+,-./:;<=>?@[]^_{|}~>.comb);\n\n# bleh. unconfuse syntax highlighter. '\"\n\nsub MAIN ( Int :$l = 8, Int :$c = 1, Str :$x = '' ) {\n note 'Password length must be >= 4' and exit if $l < 4;\n note 'Can not generate fewer than 0 passwords' and exit if $c < 0;\n my $chars = [∪] @chars».=&filter;\n note 'Can not exclude an entire required character group' and exit\n if any(@chars».elems) == 0;\n for ^$c {\n my @pswd;\n @pswd.push( @chars[$_].roll ) for ^4;\n @pswd.push( $chars .roll ) for 4 ..^ $l;\n say [~] @pswd.pick(*);\n }\n\n sub filter (Set $set) { $set ∖ set($x.comb) }\n}\n\nsub USAGE() {\n say qq:to/END/;\n Specify a length: --l=8 (default 8),\n Specify a count: --c=1 (default 1),\n Specify characters to exclude: --x=\n (must escape characters significant to the shell)\n E.G.\n {$*PROGRAM-NAME} --l=14 --c=5 --x=0O\\\\\\\"\\\\\\'1l\\\\\\|I\n END\n}\n","language":"Raku"},{"code":"my @char-groups =\n ['a' .. 'z'],\n ['A' .. 'Z'],\n ['0' .. '9'],\n < $ % & \\ ` ~ ! * + , - . / : ; = ? @ ^ _ ~ [ ] ( ) { | } # ' \" \\< \\> >.Array;\n\nsubset MinimumPasswordLength of Int where * >= 4;\nsubset NumberOfPasswords of UInt where * != 0;\n\nsub MAIN( NumberOfPasswords :c(:$count) = 1, MinimumPasswordLength :l(:$length) = 8, Str :x(:$exclude) = '' ) {\n &USAGE() if 1 == (.comb ∖ $exclude.comb).elems for @char-groups;\n .say for password-characters($length, $exclude )\n .map( *.split(' ') )\n .map( *.pick: Inf ) # shuffle, so we don't get a predictable pattern\n .map( *.join )\n .head( $count );\n}\n\nsub password-characters( $len, $exclude ) {\n ( (( char-groups($exclude) xx Inf ).map: *.pick).batch( 4)\n Z~\n (( char-groups($exclude, $len) xx Inf ).map: *.pick).batch($len-4) )\n}\n\nmulti char-groups( $exclude ) { | @char-groups.map( * (-) $exclude.comb ) }\nmulti char-groups( $exclude, $max-weight ) { flat (char-groups($exclude)>>.keys.map: {$_ xx ^$max-weight .roll}) }\n\nsub USAGE() {\n say qq:to/END/;\n Specify a length: -l=10 (minimum 4)\n Specify a count: -c=5 (minimum 1)\n Specify characters to exclude: -x=xkcd (optional)\n Password must have at least one of each: lowercase letter, uppercase letter, digit, punctuation.\n END\n}\n","language":"Raku"},{"code":"/*REXX program generates a random password according to the Rosetta Code task's rules.*/\n@L='abcdefghijklmnopqrstuvwxyz'; @U=@L; upper @U /*define lower-, uppercase Latin chars.*/\n@#= 0123456789 /* \" \" string of base ten numerals.*/\n@@= '!\"#$%&()+,-./:;<=>?@[]^{|}~' || \"'\" /*define a bunch of special characters.*/\nparse arg L N seed xxx yyy . /*obtain optional arguments from the CL*/\nif L=='?' then signal help /*does user want documentation shown? */\nif L=='' | L==\",\" then L=8 /*Not specified? Then use the default.*/\nif N=='' | N==\",\" then N=1 /* \" \" \" \" \" \" */\nif xxx\\=='' then call weed xxx /*Any chars to be ignored? Scrub lists*/\nif yyy\\=='' then call weed x2c(yyy) /*Hex \" \" \" \" \" \" */\nif datatype(seed,'W') then call random ,,seed /*the seed for repeatable RANDOM BIF #s*/\nif \\datatype(L, 'W') then call serr \"password length, it isn't an integer: \" L\nif L<4 then call serr \"password length, it's too small (< 4): \" L\nif L>80 then call serr \"password length, it's too large (> 80): \" L\nif \\datatype(N, 'W') then call serr \"number of passwords, it isn't an integer: \" N\n\n do g=1 to N; $= /*generate N passwords (default is one)*/\n do k=1 for L; z=k; if z>4 then z=random(1,4) /*1st four parts │ random*/\n if z==1 then $=$ || substr(@L,random(1,length(@L)),1) /*append lowercase letter*/\n if z==2 then $=$ || substr(@U,random(1,length(@U)),1) /* \" uppercase \" */\n if z==3 then $=$ || substr(@#,random(1,length(@#)),1) /* \" numeral */\n if z==4 then $=$ || substr(@@,random(1,length(@@)),1) /* \" special character*/\n end /*k*/\n /* [↓] scrambles PW, hides gen order. */\n do a=1 for L; b=random(1, L) /*swap every character with another. */\n parse var $ =(a) x +1 =(b) y +1 /*≡ x=substr($,a,1); y=substr($,b,1) */\n $=overlay(x,$,b); $=overlay(y,$,a) /*(both statements) swap two characters*/\n end /*L+L*/ /* [↑] more swaps obfuscates gen order*/\n\n say right(g, length(N)) 'password is: ' $ /*display the Nth password to console*/\n /* call lineout 'GENPW.PW', $ */ /*and also write the password to a file*/ /*or not.*/\n end /*g*/ /* [↑] {a comment} fileID= GENPW.PW */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nweed: parse arg ig; @L=dont(@L); @U=dont(@U); @#=dont(@#); @@=dont(@@); return\ndont: return space( translate(arg(1), , ig), 0) /*remove chars from a list*/\nserr: say; say '***error*** invalid' arg(1); exit 13 /*display an error message*/\nhelp: signal .; .: do j=sigL+1 to sourceline(); say strip(left(sourceline(j),79)); end /*\n╔═════════════════════════════════════════════════════════════════════════════╗\n║ GENPW ? ◄─── shows this documentation. ║\n║ GENPW ◄─── generates 1 password (with length 8). ║\n║ GENPW len ◄─── generates (all) passwords with this length║\n║ GENPW , n ◄─── generates N number of passwords. ║\n║ GENPW , , seed ◄─── generates passwords using a random seed. ║\n║ GENPW , , , xxx ◄─── generates passwords that don't contain xxx║\n║ GENPW , , , , yyy ◄─── generates passwords that don't contain yyy║\n║ ║\n╟──────────── where [if a comma (,) is specified, the default is used]: ║\n║ len is the length of the passwords to be generated. The default is 8.║\n║ The minimum is 4, the maximum is 80. ║\n║ n is the number of passwords to be generated. The default is 1.║\n║ seed is an integer seed used for the RANDOM BIF. (Default is random.)║\n║ xxx are characters to NOT be used for generating passwords. ║\n║ The default is to use all the (normal) available characters. ║\n║ yyy (same as XXX, except the chars are expressed as hexadecimal pairs).║\n╚═════════════════════════════════════════════════════════════════════════════╝ */\n","language":"REXX"},{"code":"# Project : Password generator\n\nchars = list(4)\nstrp = list(2)\npassword = \"\"\nchars[1] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nchars[2] = \"abcdefghijklmnopqrstuvwxyz\"\nchars[3] = \"0123456789\"\nchars[4] = \"!\\#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n\ninit()\nplen = number(strp[1])\n\nfor n = 1 to strp[2]\n passwords(chars)\n see \"password = \" + password + nl\nnext\n\nfunc passwords(chars)\n index = 0\n password = \"\"\n while index < plen\n index = index + 1\n charsind1 = index % len(chars) + 1\n charsind2 = random(len(chars[charsind1])-1) + 1\n password = password + chars[charsind1][charsind2]\n end\n\nfunc init()\n fp = fopen(\"C:\\Ring\\calmosoft\\pwgen.ring\",\"r\")\n r = \"\"\n str = \"\"\n nr = 0\n while isstring(r)\n r = fgetc(fp)\n if r != char(10) and not feof(fp)\n str = str + r\n nr = nr + 1\n strp[nr] = str\n else\n str = \"\"\n ok\n end\n fclose(fp)\n","language":"Ring"},{"code":"ARRS = [(\"a\"..\"z\").to_a,\n (\"A\"..\"Z\").to_a,\n (\"0\"..\"9\").to_a,\n %q(!\"#$%&'()*+,-./:;<=>?@[]^_{|}~).chars] # \" quote to reset clumsy code colorizer\nALL = ARRS.flatten\n\ndef generate_pwd(size, num)\n raise ArgumentError, \"Desired size too small\" unless size >= ARRS.size\n num.times.map do\n arr = ARRS.map(&:sample)\n (size - ARRS.size).times{ arr << ALL.sample}\n arr.shuffle.join\n end\nend\n\nputs generate_pwd(8,3)\n","language":"Ruby"},{"code":"a$(1) = \"0123456789\"\na$(2) = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\na$(3) = \"abcdefghijklmnopqrstuvwxyz\"\na$(4) = \"!\"\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\na$(0) = a$(1) + a$(2) + a$(3) + a$(4)\n\n[main]\nprint \"----------- Password Generator -----------\"\ninput \"Number of Characters:\";howBig\nif howBig < 1 then goto [exit]\n\ninput \"How many to generate:\";howMany\nif howMany < 1 then goto [main]\n\n' -----------------------------\n' Generate Password\n' -----------------------------\n[gen]\ncls\nprint \"Generate \";howMany;\" passwords with \";howBig;\" characters\"\ni = 0\nwhile i < howMany\n\tpw$\t= \"\"\n\tok$\t= \"....\"\n\tpw$\t= \"\"\n\tfor j = 1 to howBig\n\t \tw$ = mid$(a$(0),int(rnd(0) * len(a$(0))) + 1,1)\n\t\tfor k = 1 to 4\n\t\t\tif instr(a$(k),w$) then ok$ = left$(ok$,k-1) + \"*\" + mid$(ok$,k+1)\n\t \tnext k\n\t \tpw$ = pw$ + w$\n\tnext j\n\tif ok$ = \"****\" then\t' Do we pass with the requirements\n\t\ti\t= i + 1\n\t\tprint \"#\";i;\" \";pw$\n\tend if\nWEND\ngoto [main]\n[exit]\t' get outta here\nend\n","language":"Run-BASIC"},{"code":"use rand::distributions::Alphanumeric;\nuse rand::prelude::IteratorRandom;\nuse rand::{thread_rng, Rng};\nuse std::iter;\nuse std::process;\nuse structopt::StructOpt;\nconst OTHER_VALUES: &str = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\";\n\n// the core logic that creates our password\nfn generate_password(length: u8) -> String {\n // cache thread_rng for better performance\n let mut rng = thread_rng();\n // the Alphanumeric struct provides 3/4\n // of the characters for passwords\n // so we can sample from it\n let mut base_password: Vec<char> = iter::repeat(())\n .map(|()| rng.sample(Alphanumeric))\n .take(length as usize)\n .collect();\n let mut end_range = 10;\n // if the user supplies a password length less than 10\n // we need to adjust the random sample range\n if length < end_range {\n end_range = length;\n }\n // create a random count of how many other characters to add\n let mut to_add = rng.gen_range(1, end_range as usize);\n loop {\n // create an iterator of required other characters\n let special = OTHER_VALUES.chars().choose(&mut rng).unwrap();\n to_add -= 1;\n base_password[to_add] = special;\n if to_add == 0 {\n break;\n }\n }\n base_password.iter().collect()\n}\n\n#[derive(StructOpt, Debug)]\n#[structopt(name = \"password-generator\", about = \"A simple password generator.\")]\nstruct Opt {\n // make it SECURE by default\n // https://cheatsheetseries.owasp.org/cheatsheets/Password_Storage_Cheat_Sheet.html\n /// The password length\n #[structopt(default_value = \"160\")]\n length: u8,\n /// How many passwords to generate\n #[structopt(default_value = \"1\")]\n count: u8,\n}\n\nfn main() {\n // instantiate the options and use them as\n // arguments to our password generator\n let opt = Opt::from_args();\n const MINIMUM_LENGTH: u8 = 30;\n if opt.length < MINIMUM_LENGTH {\n eprintln!(\n \"Please provide a password length greater than or equal to {}\",\n MINIMUM_LENGTH\n );\n process::exit(1);\n }\n for index in 0..opt.count {\n let password = generate_password(opt.length);\n // do not print a newline after the last password\n match index + 1 == opt.count {\n true => print!(\"{}\", password),\n _ => println!(\"{}\", password),\n };\n }\n}\n","language":"Rust"},{"code":"object makepwd extends App {\n\n def newPassword( salt:String = \"\", length:Int = 13, strong:Boolean = true ) = {\n\n val saltHash = salt.hashCode & ~(1 << 31)\n\n import java.util.Calendar._\n\n val cal = java.util.Calendar.getInstance()\n val rand = new scala.util.Random((cal.getTimeInMillis+saltHash).toLong)\n val lower = ('a' to 'z').mkString\n val upper = ('A' to 'Z').mkString\n val nums = ('0' to '9').mkString\n val strongs = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n val unwanted = if( strong ) \"\" else \"0Ol\"\n\n val pool = (lower + upper + nums + (if( strong ) strongs else \"\")).\n filterNot( c => unwanted.contains(c) )\n\n val pwdStream = Stream.continually( (for( n <- 1 to length; c = pool(rand.nextInt(pool.length) ) ) yield c).mkString )\n\n // Drop passwords that don't have at least one of each required character\n pwdStream.filter( pwd =>\n pwd.exists(_.isUpper) &&\n pwd.exists(_.isLower) &&\n pwd.exists(_.isDigit) &&\n (if(strong) pwd.exists(! _.isLetterOrDigit) else true)\n ).head\n }\n\n val pwdLength = \"\"\"^(\\d{1,4})$\"\"\".r\n val howMany = \"\"\"^\\-n(\\d{0,3})$\"\"\".r\n val help = \"\"\"^\\-\\-(help)$\"\"\".r\n val pwdSalt = \"\"\"^\\-s(.*)\"\"\".r\n val strongOption = \"\"\"(?i)(strong)\"\"\".r\n\n\n var (salt,length,strong,helpWanted,count,unknown) = (\"\",13,false,false,1,false)\n\n args.foreach{\n case pwdLength(l) => length = math.min(math.max(l.toInt,6),4000)\n case strongOption(s) => strong = true\n case pwdSalt(s) => salt = s\n case howMany(c) => count = math.min(c.toInt,100)\n case help(h) => helpWanted = true\n case _ => unknown = true\n }\n\n if( count > 1 ) println\n\n if( helpWanted || unknown ) {\n println( \"\"\"\n makepwd <length> \"strong\" -s<salt> -n<how-many> --help\n\n <length> = how long should the password be\n \"strong\" = strong password, omit if special characters not wanted\n -s<salt> = \"-s\" followed by any non-blank characters\n (increases password randomness)\n -n<how-many> = \"-n\" followed by the number of passwords wanted\n --help = displays this\n\n For example: makepwd 13 strong -n20 -sABCDEFG\n\"\"\".stripMargin )\n }\n else for( i <- 1 to count ) println( newPassword( i + salt, length, strong ) )\n\n if( count > 1 ) println\n}\n","language":"Scala"},{"code":"$ include \"seed7_05.s7i\";\n\nconst func string: generate (in integer: length) is func\n result\n var string: password is \"\";\n local\n const set of char: allowed is {'!' .. '~'} - {'\\\\', '`'};\n const set of char: special is allowed - {'A' .. 'Z'} | {'a' .. 'z'} | {'0' .. '9'};\n var integer: index is 0;\n var char: ch is ' ';\n var boolean: ucPresent is FALSE;\n var boolean: lcPresent is FALSE;\n var boolean: digitPresent is FALSE;\n var boolean: specialPresent is FALSE;\n begin\n repeat\n password := \"\";\n ucPresent := FALSE;\n lcPresent := FALSE;\n digitPresent := FALSE;\n specialPresent := FALSE;\n for index range 1 to length do\n ch := rand(allowed);\n ucPresent := ucPresent or ch in {'A' .. 'Z'};\n lcPresent := lcPresent or ch in {'a' .. 'z'};\n digitPresent := digitPresent or ch in {'0' .. '9'};\n specialPresent := specialPresent or ch in special;\n password &:= ch;\n end for;\n until ucPresent and lcPresent and digitPresent and specialPresent;\n end func;\n\nconst proc: main is func\n local\n var integer: length is 0;\n var integer: count is 0;\n begin\n if length(argv(PROGRAM)) <> 2 or not isDigitString(argv(PROGRAM)[1]) or\n not isDigitString(argv(PROGRAM)[2]) then\n writeln(\"Usage: pwgen length count\");\n writeln(\" pwgen -?\");\n writeln(\"length: The length of the password (min 4)\");\n writeln(\"count: How many passwords should be generated\");\n writeln(\"-? Write this text\");\n else\n length := integer(argv(PROGRAM)[1]);\n count := integer(argv(PROGRAM)[2]);\n if length < 4 then\n writeln(\"Passwords must be at least 4 characters long.\");\n else\n for count do\n writeln(generate(length));\n end for;\n end if;\n end if;\n end func;\n","language":"Seed7"},{"code":"#include <stdlib.h>\n#include <time.h>\n\nvoid initRandom(const unsigned int seed){\n if(seed==0){\n srand((unsigned) time(NULL));\n }\n else{\n srand(seed);\n }\n}\n\nint getRand(const int upperBound){\n return rand() % upperBound;\n}\n","language":"Swift"},{"code":"int getRand(const int upperBound);\nvoid initRandom(const unsigned int seed);\n","language":"Swift"},{"code":"import Foundation\nimport GameplayKit // for use of inbuilt Fisher-Yates-Shuffle\n\n/* Prints the usage of this code */\nfunc printHelp() -> Void {\n print(\"Usage: PasswordGenerator [-l:length] [-c:count] [-s:seed] [-x:exclude] [-h:help]\")\n print(\"\\t-l: length of the passwords (at leas 4 characters)\")\n print(\"\\t-c: number of passwords to generate\")\n print(\"\\t-s: seed of the random number generator\")\n print(\"\\t-x: exclude of visually similar characters \\\"Il1O05S2Z\\\"\")\n print(\"\\t-h: print this help\")\n exit(0)\n}\n\n/* Set characters for generating passwords */\nlet _lower:String = \"abcdefghijklmnopqrstuvwxyz\"\nlet _lowerWithoutSimilar:String = \"abcdefghijkmnopqrstuvwxyz\"\nlet _upper:String = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nlet _upperWithoutSimilar = \"ABCDEFGHJKLMNPQRTUVWXY\"\nlet _number:String = \"0123456789\"\nlet _numerWithoutSimilar:String = \"1346789\"\nlet _other:String = \"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\n\n/* Generate character arrays out of strings */\nlet upper = Array(_upper.characters)\nlet upperWithoutSimilar = Array(_upperWithoutSimilar.characters)\nlet lower = Array(_lower.characters)\nlet lowerWithoutSimilar = Array(_lowerWithoutSimilar.characters)\nlet other = Array(_other.characters)\nlet number = Array(_number.characters)\nlet numberWithoutSimilar = Array(_numerWithoutSimilar.characters)\n\nvar length:Int=0, count:Int=0, seed:Int=0, xclude:Bool=false\n\n/* Parse CLI arguments */\nfor i in 1..<CommandLine.arguments.count{\n var arg = CommandLine.arguments[i]\n var argument = arg.components(separatedBy: \":\")\n switch(argument[0]){\n case \"-l\":\n length=Int(argument[1])!\n if length < 4 {\n print(\"A password must contain of at least 4 characters.\")\n exit(-1)\n }\n break\n case \"-c\":\n count=Int(argument[1])!\n break\n case \"-s\":\n seed=Int(argument[1])!\n break\n case \"-x\":\n xclude=true\n break\n case \"-h\":\n printHelp()\n default:\n print(\"Could not parse CLI arguments. Use -h for help.\")\n exit(0)\n }\n}\n\n/* Generate password of given length */\nfunc generatePassword(length len:Int, exclude xcl:Bool) -> String{\n\n var ret:String = \"\", loopCount:Int = 0\n\n while(loopCount < len){\n if ret.characters.count < len {\n if xcl {\n ret += String(upperWithoutSimilar[Int(getRand(Int32(upperWithoutSimilar.count-1)))])\n }\n else {\n ret += String(upper[Int(getRand(Int32(upper.count)))])\n }\n }\n\n if ret.characters.count < len {\n if xcl {\n ret += String(lowerWithoutSimilar[Int(getRand(Int32(lowerWithoutSimilar.count-1)))])\n }\n else {\n ret += String(lower[Int(getRand(Int32(lower.count-1)))])\n }\n }\n\n if ret.characters.count < len {\n if xcl {\n ret += String(numberWithoutSimilar[Int(getRand(Int32(numberWithoutSimilar.count-1)))])\n }\n else {\n ret += String(number[Int(getRand(Int32(number.count-1)))])\n }\n }\n\n if ret.characters.count < len {\n ret += String(other[Int(getRand(Int32(other.count-1)))])\n }\n loopCount += 4\n }\n\n // Shuffle the array with an internal shuffle function\n let shuffled = GKRandomSource.sharedRandom().arrayByShufflingObjects(in: Array(ret.characters))\n ret = \"\"\n for element in shuffled {\n ret += String(describing: element)\n }\n return ret\n}\n\nif xclude {\n print(\"Generating \\(count) passwords with length \\(length) excluding visually similar characters...\")\n}\nelse {\n print(\"Generating \\(count) passwords with length \\(length) not excluding visually similar characters...\")\n}\n\ninitRandom(UInt32(0)) // initialize with C func srand()\n\n// generate the passwords\nfor i in 1...count {\n print(\"\\(i).\\t\\(generatePassword(length:length,exclude:xclude))\")\n}\n","language":"Swift"},{"code":"Option Explicit\nSub Main()\nDim s() As String, i As Long\n Debug.Print \"list of 10 passwords : \"\n'do a list of 10 passwords with password's lenght = 21 and visually similar = False\n s = Gp(10, 21, False)\n 'return\n Debug.Print \"1- with password's lenght = 21 and visually similar = False :\"\n For i = 1 To UBound(s): Debug.Print s(i): Next\n'do a list of 10 passwords with pattern = \"A/9-a/1-9/4-!/5\" and visually similar = True\n s = Gp(10, \"A/9-a/1-9/4-!/5\", True)\n 'return\n Debug.Print \"2- with pattern = \"\"A/9-a/1-9/4-!/5\"\" and visually similar = True :\"\n For i = 1 To UBound(s): Debug.Print s(i): Next\nEnd Sub\nSub HelpMe()\nDim s As String\n s = \"Help :\" & vbCrLf\n s = s & \"----------------------------------\" & vbCrLf\n s = s & \"The function (named : Gp) needs 3 required parameters :\" & vbCrLf & vbCrLf\n s = s & \"1- Nb_Passwords (Long) : the number of passwords to generate.\" & vbCrLf & vbCrLf\n s = s & \"2- NbChar_Or_Pattern (Variant) : either a number or a pattern\" & vbCrLf\n s = s & \" If number : NbChar_Or_Pattern specify the password length. All the digits are random ASCII characters\" & vbCrLf\n s = s & \" If pattern : NbChar_Or_Pattern specify the password length and the layout of passwords.\" & vbCrLf\n s = s & \" The pattern is built like this :\" & vbCrLf\n s = s & \" \"\"A\"\" means Upper case, \"\"a\"\" means lower case, 9 means numerics and ! means others characters.\" & vbCrLf\n s = s & \" \"\"-\"\" is the separator between these values.\" & vbCrLf\n s = s & \" the number of characters is specified after the sign (required): \"\"/\"\"\" & vbCrLf\n s = s & \" example of pattern available : \"\"A/3-a/2-9/1-!/1\"\"\" & vbCrLf & vbCrLf\n s = s & \"3- Excl_Similar_Chars (Boolean) : True if you want the option of excluding visually similar characters.\"\n Debug.Print s\nEnd Sub\nPrivate Function Gp(Nb_Passwords As Long, NbChar_Or_Pattern As Variant, Excl_Similar_Chars As Boolean) As String()\n'generate a list of passwords\nDim l As Long, s() As String\n ReDim s(1 To Nb_Passwords)\n If IsNumeric(NbChar_Or_Pattern) Then\n For l = 1 To Nb_Passwords\n s(l) = p(CLng(NbChar_Or_Pattern), Excl_Similar_Chars)\n Next l\n Else\n For l = 1 To Nb_Passwords\n s(l) = ttt(CStr(NbChar_Or_Pattern), Excl_Similar_Chars)\n Next l\n End If\n Gp = s\nEnd Function\nPublic Function p(n As Long, e As Boolean) As String\n'create 1 password without pattern (just with the password's lenght)\nDim t As String, i As Long, a As Boolean, b As Boolean, c As Boolean, d As Boolean\n Randomize Timer\n If n < 4 Then\n p = \"Error. Numbers of characters is too small. Min : 4\"\n ElseIf n >= 4 And n < 7 Then\n T = u(122, 97) & u(90, 65) & u(57, 48) & v\n For j = 5 To n\n i = Int((4 * Rnd) + 1)\n Select Case i\n Case 1: T = T & u(122, 97)\n Case 2: T = T & u(90, 65)\n Case 3: T = T & u(57, 48)\n Case 4: T = T & v\n End Select\n Next j\n 'Debug.Print T\n p = y(T)\n Else\n Do\n i = Int((4 * Rnd) + 1)\n Select Case i\n Case 1: t = t & u(122, 97): a = True\n Case 2: t = t & u(90, 65): b = True\n Case 3: t = t & u(57, 48): c = True\n Case 4: t = t & v: d = True\n End Select\n If Len(t) >= 2 And e Then\n If x(t) Then t = Left(t, Len(t) - 1)\n End If\n If Len(t) = n Then\n If a And b And c And d Then\n Exit Do\n Else\n w t, a, b, c, d\n p = p(n, e)\n End If\n ElseIf Len(t) > n Then\n w t, a, b, c, d\n p = p(n, e)\n End If\n Loop\n p = t\n End If\nEnd Function\nPublic Function ttt(s As String, e As Boolean) As String\n'create 1 password with pattern\nDim a, i As Long, j As Long, st As String, Nb As Long\n a = Split(s, \"-\")\n For i = 0 To UBound(a)\n Select Case Left(a(i), 1)\n Case \"A\"\n Nb = CLng(Split(a(i), \"/\")(1)): j = 0\n Do\n j = j + 1\n st = st & u(90, 65)\n If Len(st) >= 2 And e Then\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\n End If\n Loop While j < Nb\n Case \"a\"\n Nb = CLng(Split(a(i), \"/\")(1)): j = 0\n Do\n j = j + 1\n st = st & u(122, 97)\n If Len(st) >= 2 And e Then\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\n End If\n Loop While j < Nb\n Case \"9\"\n Nb = CLng(Split(a(i), \"/\")(1)): j = 0\n Do\n j = j + 1\n st = st & u(57, 48)\n If Len(st) >= 2 And e Then\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\n End If\n Loop While j < Nb\n Case \"!\"\n Nb = CLng(Split(a(i), \"/\")(1)): j = 0\n Do\n j = j + 1\n st = st & v\n If Len(st) >= 2 And e Then\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\n End If\n Loop While j < Nb\n End Select\n Next i\n ttt = y(st)\nEnd Function\nPrivate Function u(m As Long, l As Long) As String\n'random 1 character in lower/upper case or numeric\n Randomize Timer\n u = Chr(Int(((m - l + 1) * Rnd) + l))\nEnd Function\nPrivate Function v() As String\n'random 1 character \"special\"\n Randomize Timer\n v = Mid(\"!\"\"#$%&'()*+,-./:;<=>?@[]^_{|}~\", Int((30 * Rnd) + 1), 1)\nEnd Function\nPrivate Sub w(t As String, a As Boolean, b As Boolean, c As Boolean, d As Boolean)\n t = vbNullString: a = False: b = False: c = False: d = False\nEnd Sub\nPrivate Function x(s As String) As Boolean\n'option of excluding visually similar characters\nDim t, i As Long\nConst d As String = \"Il I1 l1 lI 1l 1I 0O O0 5S S5 2Z 2? Z? Z2 ?2 ?Z DO OD\"\n t = Split(d, \" \")\n For i = 0 To UBound(t)\n If Right(s, 2) = t(i) Then\n x = True: Exit Function\n End If\n Next\nEnd Function\nPrivate Function y(s As String) As String\n'shuffle the password's letters only if pattern\nDim i&, t, r As String, d() As Long\n t = Split(StrConv(s, vbUnicode), Chr(0))\n d = z(UBound(t))\n For i = 0 To UBound(t)\n r = r & t(d(i))\n Next i\n y = Left(r, Len(r) - 1)\nEnd Function\nPrivate Function z(l As Long) As Long()\n'http://rosettacode.org/wiki/Best_shuffle#VBA\nDim i As Long, ou As Long, temp() As Long\nDim c As New Collection\n ReDim temp(l)\n If l = 1 Then\n temp(0) = 0\n ElseIf l = 2 Then\n temp(0) = 1: temp(1) = 0\n Else\n Randomize\n Do\n ou = Int(Rnd * l)\n On Error Resume Next\n c.Add CStr(ou), CStr(ou)\n If Err <> 0 Then\n On Error GoTo 0\n Else\n temp(ou) = i\n i = i + 1\n End If\n Loop While c.Count <> l\n End If\n z = temp\nEnd Function\n","language":"VBA"},{"code":"import \"random\" for Random\nimport \"./ioutil\" for FileUtil, File, Input\nimport \"./fmt\" for Fmt\nimport \"os\" for Process\n\nvar r = Random.new()\nvar rr = Random.new() // use a separate generator for shuffles\nvar lb = FileUtil.lineBreak\n\nvar lower = \"abcdefghijklmnopqrstuvwxyz\"\nvar upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nvar digit = \"0123456789\"\nvar other = \"\"\"!\"#$%&'()*+,-./:;<=>?@[]^_{|}~\"\"\"\n\nvar exclChars = [\n \"'I', 'l' and '1'\",\n \"'O' and '0' \",\n \"'5' and 'S' \",\n \"'2' and 'Z' \"\n]\n\nvar shuffle = Fn.new { |s|\n var sl = s.toList\n rr.shuffle(sl)\n return sl.join()\n}\n\nvar generatePasswords = Fn.new { |pwdLen, pwdNum, toConsole, toFile|\n var ll = lower.count\n var ul = upper.count\n var dl = digit.count\n var ol = other.count\n var tl = ll + ul + dl + ol\n var fw = toFile ? File.create(\"pwds.txt\") : null\n\n if (toConsole) System.print(\"\\nThe generated passwords are:\")\n for (i in 0...pwdNum) {\n var pwd = lower[r.int(ll)] + upper[r.int(ul)] + digit[r.int(dl)] + other[r.int(ol)]\n for (j in 0...pwdLen - 4) {\n var k = r.int(tl)\n pwd = pwd + ((k < ll) ? lower[k] :\n (k < ll + ul) ? upper[k - ll] :\n (k < tl - ol) ? digit[k - ll - ul] : other[tl - 1 - k])\n }\n for (i in 1..5) pwd = shuffle.call(pwd) // shuffle 5 times say\n if (toConsole) Fmt.print(\" $2d: $s\", i + 1, pwd)\n if (toFile) {\n fw.writeBytes(pwd)\n if (i < pwdNum - 1) fw.writeBytes(lb)\n }\n }\n if (toFile) {\n System.print(\"\\nThe generated passwords have been written to the file pwds.txt\")\n fw.close()\n }\n}\n\nvar printHelp = Fn.new {\n System.print(\"\"\"\nThis program generates up to 99 passwords of between 5 and 20 characters in\nlength.\n\nYou will be prompted for the values of all parameters when the program is run\n- there are no command line options to memorize.\n\nThe passwords can either be written to the console or to a file (pwds.txt),\nor both.\n\nThe passwords must contain at least one each of the following character types:\n lower-case letters : a -> z\n upper-case letters : A -> Z\n digits : 0 -> 9\n other characters : !\"#$%&'()*+,-./:;<=>?@[]^_{|}~\n\nOptionally, a seed can be set for the random generator\n(any non-zero number) otherwise the default seed will be used.\nEven if the same seed is set, the passwords won't necessarily be exactly\nthe same on each run as additional random shuffles are always performed.\n\nYou can also specify that various sets of visually similar characters\nwill be excluded (or not) from the passwords, namely: Il1 O0 5S 2Z\n\nFinally, the only command line options permitted are -h and -help which\nwill display this page and then exit.\n\nAny other command line parameters will simply be ignored and the program\nwill be run normally.\n\n\"\"\")\n}\n\nvar args = Process.arguments\nif (args.count == 1 && (args[0] == \"-h\" || args[0] == \"-help\")) {\n printHelp.call()\n return\n}\n\nSystem.print(\"Please enter the following and press return after each one\")\n\nvar pwdLen = Input.integer(\" Password length (5 to 20) : \", 5, 20)\nvar pwdNum = Input.integer(\" Number to generate (1 to 99) : \", 1, 99)\n\nvar seed = Input.number (\" Seed value (0 to use default) : \")\nif (seed != 0) r = Random.new(seed)\n\nSystem.print(\" Exclude the following visually similar characters\")\nfor (i in 0..3) {\n var yn = Input.option(\" %(exclChars[i]) y/n : \", \"ynYN\")\n if (yn == \"y\" || yn == \"Y\") {\n if (i == 0) {\n upper = upper.replace(\"I\", \"\")\n lower = lower.replace(\"l\", \"\")\n digit = digit.replace(\"1\", \"\")\n } else if (i == 1) {\n upper = upper.replace(\"O\", \"\")\n digit = digit.replace(\"0\", \"\")\n } else if (i == 2) {\n upper = upper.replace(\"S\", \"\")\n digit = digit.replace(\"5\", \"\")\n } else if (i == 3) {\n upper = upper.replace(\"Z\", \"\")\n digit = digit.replace(\"2\", \"\")\n }\n }\n}\n\nvar toConsole = Input.option(\" Write to console y/n : \", \"ynYN\")\ntoConsole = toConsole == \"y\" || toConsole == \"Y\"\nvar toFile = true\nif (toConsole) {\n toFile = Input.option(\" Write to file y/n : \", \"ynYN\")\n toFile = toFile == \"y\" || toFile == \"Y\"\n}\n\ngeneratePasswords.call(pwdLen, pwdNum, toConsole, toFile)\n","language":"Wren"},{"code":"string 0;\n\nfunc In(C, Str);\nchar C, Str;\n[while Str(0) do\n if C = Str(0) then return true else Str:= Str+1;\nreturn false;\n];\n\nfunc New_password(Length, Readable);\nint Length, Readable, I, C;\nchar Password_chars(100), Punctuation, Visually_similar;\n[if Length < 4 then\n [Text(0, \"Password length = \"); IntOut(0, Length);\n Text(0, \" is too short, minimum length = 4.\");\n return \"\";\n ];\nPunctuation:= \"!^\"#$%&\\'()*+,-./:;<=>?@[]^^_{|}~\";\nVisually_similar:= \"Il1O05S2Z\";\nfor I:= 0 to Length-1 do\n [case Ran(4) of\n 0: C:= Ran(26) + ^a;\n 1: C:= Ran(26) + ^A;\n 2: C:= Ran(10) + ^0;\n 3: C:= Punctuation(Ran(31))\n other [];\n Password_chars(I):= C;\n if Readable and In(C, Visually_similar) then I:= I-1;\n ];\nPassword_chars(I):= 0;\nreturn Password_chars;\n];\n\nproc Password_generator(Length, Qty, Readable);\nint Length, Qty, Readable, I;\nfor I:= 0 to Qty-1 do\n [Text(0, New_password(Length, Readable)); CrLf(0)];\n\n[Password_generator(14, 4, true);\n Password_generator( 8, 4, false);\n]\n","language":"XPL0"},{"code":"var pwdLen=10, pwds=1, xclude=\"\";\n\nargh:=Utils.Argh(\nL(\"+xclude\",\"\",\"Don't use these characters\",fcn(arg){ xclude=arg }),\nL(\"+len\",\"\",\"Number of characters in password\", fcn(arg){ pwdLen=arg.toInt() } ),\nL(\"+num\",\"\",\"Number of passwords to generate\", fcn(arg){ pwds=arg.toInt() } ),\n);\ntry{ argh.parse(vm.arglist) }catch{ System.exit(1) }\n\nisd:='wrap(w){ w.pump(String) - xclude }; // iterator to String\ng1,g2,g3 := isd([\"a\"..\"z\"]), isd([\"A\"..\"Z\"]), isd([\"0\"..\"9\"]);\ng4:=\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\" - xclude;\nall:=String(g1,g2,g3,g4);\nfcn rnd(s){ s[(0).random(s.len())] } // pick a random character from s\n // generate random characters of filler needed to complete password\nfill:=(pwdLen-4).pump.fp(String,rnd.fp(all)); // a deferred/pending calculation\n\ndo(numPwds){\n // Data is byte bucket (and editor). I can shuffle a Data but not a String.\n pwd:=T(g1,g2,g3,g4).pump(Data,rnd); // 1 from each of these into a Data\n pwd.extend(fill()).shuffle().text.println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Password_generator\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"Create a password generation program which will generate passwords containing random ASCII characters from the following groups:\\n lower-case letters: a ──► z\\n upper-case letters: A ──► Z\\n digits: 0 ──► 9\\n other printable characters: <big><big> !\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~ </big></big>\\n (the above character list excludes white-space, backslash and grave) \\n\\n\\nThe generated password(s) must include ''at least one'' (of each of the four groups):\\n lower-case letter, \\n upper-case letter,\\n digit (numeral), and \\n one \\\"other\\\" character. \\n\\n<br>\\nThe user must be able to specify the password length and the number of passwords to generate. \\n\\nThe passwords should be displayed or written to a file, one per line.\\n\\nThe randomness should be from a system source or library. \\n\\nThe program should implement a help option or button which should describe the program and options when invoked. \\n\\nYou may also allow the user to specify a seed value, and give the option of excluding visually similar characters.\\n\\nFor example: <big><big> Il1 O0 5S 2Z </big></big> where the characters are: \\n::::* capital eye, lowercase ell, the digit one\\n::::* capital oh, the digit zero \\n::::* the digit five, capital ess\\n::::* the digit two, capital zee\\n<!-- or zed, on the other side of the pond. -->\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"LDY #0\\nLDX #20\\nLOOP:\\nLDA $FE ;load a random byte\\nBMI LOOP ;IF GREATER THAN 7F, ROLL AGAIN\\nCMP #$21 ;ASCII CODE FOR !\\nBCC LOOP\\nCMP #$5C\\nBEQ LOOP ;NO \\\\\\nCMP #$60\\nBEQ LOOP ;NO `\\n;else, must be a good character\\nSTA $0200,Y\\nINY\\nDEX\\nBNE LOOP\\nBRK ;end program\\n\",\n \"language\": \"6502-Assembly\"\n },\n {\n \"code\": \"\\tcpu\\t8086\\n\\tbits\\t16\\n\\t;;;\\tMS-DOS syscalls\\ngettim:\\tequ\\t2Ch\\t; Get system time\\nwrite:\\tequ\\t40h\\t; Write to file\\nexit:\\tequ\\t4Ch\\t; Exit with return code\\n\\t;;;\\tMS-DOS process data\\narg:\\tequ\\t80h\\t; Command line argument (length + string)\\n\\t;;;\\tBIOS calls\\nconout:\\tequ\\t0Eh\\t; Write character to console\\nvstate:\\tequ\\t0Fh\\t; Get current video state\\nsection\\t.text\\n\\torg\\t100h\\n\\tmov\\tah,gettim\\t; Seed the RNG using the system time\\n\\tint\\t21h\\t\\t; (in case of no argument)\\n\\tmov\\t[rnddat],cx\\n\\tmov\\t[rnddat+2],dx\\n\\tmov\\tsi,arg\\t\\t; See if we have any arguments\\n\\tlodsb\\n\\ttest\\tal,al\\n\\tjnz\\thasarg\\n\\tjmp\\tusage\\t\\t; If not, print usage string\\n\\t;;;\\tParse the command line arguments\\nhasarg:\\txor\\tbx,bx\\t\\t; We do, zero-terminate the string\\n\\txchg\\tal,bl\\n\\tmov\\t[si+bx],al\\n\\tmov\\tdi,count\\t; Place to start reading arguments\\ndoarg:\\tlodsb\\t\\t\\t; Get argument byte\\n.chr:\\ttest\\tal,al\\t\\t; Zero?\\n\\tjnz \\t.arg\\t\\t; If not, there are arguments left\\n\\tjmp\\tcheck\\t\\t; If so, we're done\\n.arg:\\tcmp\\tal,' '\\t\\t; Space?\\n\\tje\\tdoarg\\t\\t; Then get next character\\n\\tcmp\\tal,'/'\\t\\t; Option?\\n\\tje\\topt\\n\\tdec\\tbyte [nargs]\\t; Otherwise, it's an argument\\n\\tjnz\\trdnum\\t\\t; Read a number if we still need one\\n\\tjmp\\tusage\\t\\t; Otherwise, incorrect arguments\\nrdnum:\\txor\\tbp,bp\\t\\t; Place to keep number\\n.chr:\\tmov\\tbl,al\\t\\t; Keep the character in case not a digit\\n\\tsub\\tal,'0'\\t\\t; Make into digit\\n\\tcmp\\tal,9\\t\\t; Valid digit?\\n\\tja\\t.done\\t\\t; If not, done with number\\n\\tadd\\tbp,bp\\t\\t; Multiply accumulator by 10\\n\\tmov\\tdx,bp\\n\\tadd\\tbp,bp\\n\\tadd \\tbp,bp\\n\\tadd\\tbp,dx\\n\\txor\\tah,ah\\t\\t; Then add the digit\\n\\tadd\\tbp,ax\\n\\tlodsb\\t\\t\\t; Read next digit\\n\\tjmp\\t.chr\\t\\t\\n.done:\\tmov\\tax,bp\\t\\t; Write the number into memory\\n\\tstosw\\n\\tmov\\tal,bl\\t\\t; Restore the character (next argument)\\n\\tjmp\\tdoarg.chr\\nopt:\\tlodsb\\t\\t\\t; Get option character\\n\\tor\\tal,32\\t\\t; Make lowercase\\n\\tcmp\\tal,'e'\\t\\t; E?\\n\\tje\\t.e\\n\\tcmp\\tal,'s'\\t\\t; S?\\n\\tje\\t.s\\n\\tjmp\\tusage\\t\\t; If not, invalid argument\\n.e:\\tinc\\tbyte [excl]\\t; /E: turn on exclusion\\n\\tjmp\\tdoarg\\n.s:\\tlodsb\\t\\t\\t; /S: should be followed by '='\\n\\tcmp\\tal,'='\\n\\tje\\t.s_ok\\n\\tjmp\\tusage\\t\\t; If not, invalid argument\\n.s_ok:\\txor\\tbp,bp\\t\\t; DX:BP = RNG state\\n\\txor\\tdx,dx\\n.hex:\\tlodsb\\t\\t\\t; Get (potential) hex digit\\n\\tmov\\tah,al\\t\\t; Keep it around\\n\\tcall\\thexdgt\\t\\t; Parse hexadecimal digit\\n\\tjnc\\t.hdone\\t\\t; If invalid, we're done\\n\\tshl\\tbp,1\\t\\t; Make room for it in the state\\n\\trcl\\tdx,1\\t\\t; Because it's a 32-bit value,\\n\\tshl\\tbp,1\\t\\t; which is stored in two 16-bit registers,\\n\\trcl\\tdx,1\\t\\t; we have to shift and rotate the bits\\n\\tshl\\tbp,1\\t\\t; one by one.\\n\\trcl\\tdx,1\\n\\tshl\\tbp,1\\n\\trcl\\tdx,1\\n\\tor\\tdl,al\\t\\t; Finally, add in the hexadecimal digit\\n\\tjmp\\t.hex\\n.hdone:\\tmov\\t[rnddat],bp\\t; Store random seed\\n\\tmov\\t[rnddat+2],dx\\n\\tmov\\tal,ah\\t\\t; Restore the next character\\n\\tjmp\\tdoarg.chr\\n\\t;;;\\tCheck the arguments\\ncheck:\\tdec\\tbyte [nargs]\\t; Were all arguments used?\\n\\tjz\\t.argok\\n\\tjmp\\tusage\\n.argok:\\tmov\\tcx,[count]\\t; CX = count\\n\\tmov\\tbp,[length]\\t; BP = length\\n\\ttest\\tcx,cx\\t\\t; Sanity check (count must not be zero)\\n\\tmov\\tsi,errmsg.cnt\\n\\tjnz\\t.cntok\\n\\tjmp\\terror\\n.cntok:\\tcmp\\tbp,4\\t\\t; Length must be at least four\\n\\tmov\\tsi,errmsg.len\\n\\tjae\\t.len2\\n\\tjmp\\terror\\n.len2:\\tcmp\\tbp,255\\t\\t; Length must be no more than 255\\n\\tmov\\tsi,errmsg.lmax\\n\\tjbe\\tmkmask\\n\\tjmp\\terror\\n\\t;;;\\tMake a bitmask in which BP fits (for generating random\\n\\t;;;\\tnumbers in the right range)\\nmkmask:\\tmov\\tcx,bp\\n\\tmov\\tbx,cx\\n.loop:\\tshr\\tcx,1\\n\\tor\\tbx,cx\\n\\ttest\\tcx,cx\\n\\tjnz\\t.loop\\n\\tstc\\n\\trcl \\tbx,1\\n\\tmov\\t[lmask],bl\\t; Password <= 255 chars\\n\\t;;;\\tGenerate a password\\ngenpwd:\\tlea\\tcx,[bp-4]\\t; Get length minus four\\n\\tmov\\tdi,buffer\\t; Write password into buffer\\n\\tmov\\tdl,[excl]\\t; Exclusion flag\\n\\tmov\\tbx,lc\\t\\t; A lowercase letter,\\n\\tmov\\tah,lc.len\\t\\n\\tcall\\trndchr\\n\\tmov\\tbx,uc\\t\\t; An uppercase letter\\n\\tcall\\trndchr\\t\\t; (same length of course)\\n\\tmov\\tbx,dgt\\t\\t; A digit,\\n\\tmov\\tah,dgt.len\\n\\tcall\\trndchr\\n\\tmov\\tbx,sym\\t\\t; And a symbol\\n\\tmov\\tah,sym.len\\n\\tcall \\trndchr\\n\\ttest\\tcx,cx\\t\\t; If CX=0, we need no extra characters\\n\\tjz\\t.done\\n\\tmov\\tbx,cr\\t\\t; Otherwise, we need CX extra characters\\n\\tmov\\tah,cr.len\\n.loop:\\tcall\\trndchr\\n\\tloop\\t.loop\\n.done:\\tmov\\tax,0A0Dh\\t; End with a newline\\n\\tstosw\\n\\t;;;\\tSwap the first four characters with random characters\\n\\t;;;\\tfrom the password, so the four necessary characters won't\\n\\t;;;\\tnecessarily be at the beginning.\\nswap:\\tmov\\tdx,bp \\t\\t; Get length\\n\\tmov\\tdh,[lmask]\\t; Load the mask\\n\\tmov\\tsi,buffer\\t; Password buffer\\n\\txor\\tbh,bh\\n\\txor \\tah,ah\\t\\t; Starting at zero\\n.loc:\\tcall\\trand\\t\\t; Get random byte\\n\\tand\\tal,dh\\t\\t; Mask off unused bits\\n\\tcmp\\tal,dl\\t\\t; Result within password?\\n\\tjae\\t.loc\\t\\t; If not, get another random number\\n\\tmov\\tbl,ah\\t\\t; Load first character in CL\\n\\tmov\\tcl,[si+bx]\\n\\tmov\\tbl,al\\t\\t; Load random character in CH\\n\\tmov\\tch,[si+bx]\\n\\tmov\\t[si+bx],cl\\t; Write them back the other way around\\n\\tmov\\tbl,ah\\n\\tmov\\t[si+bx],ch\\n\\tinc\\tah\\t\\t; Next character\\n\\tcmp\\tah,4\\t\\t; Are we there yet?\\n\\tjb\\t.loc\\t\\t; If not, do another character.\\n\\t;;;\\tWrite password to standard output\\n\\txor\\tbx,bx\\t\\t; File handle 0 = stdout\\n\\tlea\\tcx,[bp+2]\\t; Length = password length + 2 (for newline)\\n\\tmov\\tdx,si\\t\\t; Location of password\\n\\tmov\\tah,write\\t; Write the password\\n\\tint\\t21h\\n\\tjnc\\t.ok\\t\\t; Carry clear = success\\n\\tmov\\tsi,errmsg.wrt\\t; Otherwise, print error message\\n\\tjmp\\terror\\n.ok:\\tdec\\tword [count] \\t; Need any more passwords?\\n\\tjz\\tstop\\t\\t; If not, stop\\n\\tjmp\\tgenpwd\\t\\t; Otherwise, make another password\\n\\t;;;\\tQuit with return code 0 (success)\\nstop:\\tmov\\tax,exit<<8\\n\\tint\\t21h\\n\\t;;;\\tGenerate a random character. BX=table, AH=length,\\n\\t;;;\\tDL=exclusion on/off\\nrndchr:\\tcall\\trand\\t\\t; Random number\\n\\tand\\tal,7Fh\\t\\t; from 0 to 127\\n\\tcmp\\tal,ah\\t\\t; Within valid length?\\n\\tjae\\trndchr\\t\\t; If not, get new random number\\n\\txlatb\\t\\t\\t; Otherwise, get character from table\\n\\ttest\\tdl,dl\\t\\t; Is exclusion on?\\n\\tjz\\t.out\\t\\t; If not, just store it\\n\\tpush\\tcx\\t\\t; Otherwise, keep CX around,\\n\\tpush\\tdi\\t\\t; and DI,\\n\\tmov\\tcx,ex.len\\t; See if character is in exclusion table\\n\\tmov\\tdi,ex\\n\\trepne\\tscasb\\n\\tpop\\tdi\\t\\t; restore DI\\n\\tpop\\tcx\\t\\t; Restore CX\\n\\tje\\trndchr\\t\\t; And if it was found, get another character\\n.out:\\tstosb\\t\\t\\t; Store in password buffer\\n\\tret\\n\\t;;;\\tRandom number generator using XABC algorithm\\n\\t;;;\\tReturns random byte in AL\\nrand:\\tpush\\tcx\\n\\tpush\\tdx\\n\\tmov\\tcx,[rnddat]\\t; CH=X CL=A\\n\\tmov\\tdx,[rnddat+2]\\t; DH=B DL=C\\n\\tinc\\tch\\t\\t; X++\\n\\txor\\tcl,ch\\t\\t; A ^= X\\n\\txor\\tcl,dl\\t\\t; A ^= C\\n\\tadd\\tdh,cl\\t\\t; B += A\\n\\tmov\\tal,dh\\t\\t; C' = B\\n\\tshr\\tal,1\\t\\t; C' >>= 1\\n\\txor\\tal,cl\\t\\t; C' ^= A\\n\\tadd\\tal,dl\\t\\t; C' += C\\n\\tmov\\tdl,al\\t\\t; C = C'\\n\\tmov\\t[rnddat],cx\\n\\tmov\\t[rnddat+2],dx\\n\\tpop\\tdx\\n\\tpop\\tcx\\n\\tret\\n\\t;;;\\tIf AL is a hexadecimal digit in ASCII, set AL to be its\\n\\t;;;\\tvalue. Carry flag set if digit was valid.\\nhexdgt:\\tor\\tal,32\\t\\t; Make letter lowercase (numbers unchanged)\\n\\tsub\\tal,'0'\\t\\t; Subtract 0\\n\\tcmp\\tal,10\\t\\t; If it is a valid digit now, we're done\\n\\tjc\\t.out\\n\\tsub\\tal,39\\t\\t; Otherwise, correct for\\n\\tcmp\\tal,17\\t\\n.out:\\tret\\n\\t;;;\\tWrite the help message, and stop with return code 2\\nusage:\\tmov\\tsi,help\\n\\t;;;\\tWrite an error message, directly to the console, bypassing\\n\\t;;;\\tDOS to ensure it does not end up in the redirected output.\\n\\t;;;\\tThen, stop with return code 2 (failure)\\nerror:\\tmov\\tah,vstate\\t; Retrieve current video state\\n\\tint\\t10h\\t\\t; (this sets BH = current page)\\n.loop\\tlodsb\\t\\t\\t; Get string byte\\n\\ttest\\tal,al\\t\\t; Zero?\\n\\tjz\\t.out\\t\\t; Then we have reached the end\\n\\tmov\\tah,conout\\t; Otherwise, write the character\\n\\tint\\t10h\\n\\tjmp\\t.loop\\t\\t; And get another one\\n.out:\\tmov\\tax,exit<<8|2\\t; Stop with error code 2\\n\\tint\\t21h\\nsection\\t.data\\nnargs:\\tdb\\t3\\t\\t; We need two non-option arguments\\nexcl:\\tdb\\t0\\t\\t; Exclusion is off by default\\ncr:\\t;;;\\tPassword characters\\nlc:\\tdb\\t'abcdefghijklmnopqrstuvwxyz'\\n.len:\\tequ\\t$-lc\\nuc:\\tdb\\t'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\\n.len:\\tequ\\t$-uc\\ndgt:\\tdb\\t'0123456789'\\n.len:\\tequ\\t$-dgt\\nsym:\\tdb\\t'!\\\"#$%&()*+,-./:;<=>?@[]^_{|}~',39 ; 39=single quote\\n.len:\\tequ \\t$-sym\\ncr.len:\\tequ\\t$-cr\\nex:\\tdb\\t'Il1O05S2Z'\\t; Excluded characters\\n.len:\\tequ\\t$-ex\\n\\t;;;\\tHelp message\\nhelp:\\tdb\\t'PASSGEN [/S=seed] [/E] count length',13,10\\n\\tdb\\t9,'generate <count> passwords of length <length>',13,10\\n\\tdb\\t13,10\\n\\tdb\\t9,'/S=seed: set RNG seed (hexadecimal number)',13,10\\n\\tdb\\t9,'/E: exclude visually similar characters',13,10\\n\\tdb\\t0\\nerrmsg:\\t;;;\\tError messages\\n.len:\\tdb\\t'Minimum password length is 4.',0\\n.lmax:\\tdb\\t'Maximum password length is 255.',0\\n.cnt:\\tdb\\t'At least one password must be generated.',0\\n.wrt:\\tdb\\t'Write error.',0\\nsection\\t.bss\\ncount:\\tresw\\t1\\t\\t; Amount of passwords to generate\\nlength:\\tresw\\t1\\t\\t; Length of passwords\\nlmask:\\tresb\\t1\\t\\t; Mask for random number generation\\nrnddat:\\tresb\\t4\\t\\t; RNG state\\nbuffer:\\tresb\\t257\\t\\t; Space to store password\\n\",\n \"language\": \"8086-Assembly\"\n },\n {\n \"code\": \"BYTE FUNC GetNumParam(CHAR ARRAY text BYTE min,max)\\n BYTE res\\n\\n DO\\n PrintF(\\\"Input %S (%B-%B): \\\",text,min,max)\\n res=InputB()\\n UNTIL res>=min AND res<=max\\n OD\\nRETURN (res)\\n\\nBYTE FUNC GetBoolParam(CHAR ARRAY text)\\n CHAR ARRAY s(255)\\n\\n DO\\n PrintF(\\\"%S? (Y/N): \\\",text)\\n InputS(s)\\n IF s(0)=1 THEN\\n IF s(1)='y OR s(1)='Y THEN\\n RETURN (1)\\n ELSEIF s(1)='n OR s(1)='N THEN\\n RETURN (0)\\n FI\\n FI\\n OD\\nRETURN (0)\\n\\nPROC Shuffle(CHAR ARRAY s)\\n BYTE i,j\\n CHAR tmp\\n\\n i=s(0)\\n WHILE i>1\\n DO\\n j=Rand(i)+1\\n tmp=s(i) s(i)=s(j) s(j)=tmp\\n i==-1\\n OD\\nRETURN\\n\\nBYTE FUNC Contains(CHAR ARRAY s CHAR c)\\n BYTE i\\n\\n IF s(0)=0 THEN\\n RETURN (0)\\n FI\\n FOR i=1 TO s(0)\\n DO\\n IF s(i)=c THEN\\n RETURN (1)\\n FI\\n OD\\nRETURN (0)\\n\\nCHAR FUNC RandChar(CHAR ARRAY s,unsafe)\\n BYTE len\\n CHAR c\\n\\n len=s(0)\\n DO\\n c=s(Rand(len)+1)\\n UNTIL Contains(unsafe,c)=0\\n OD\\nRETURN (c)\\n\\nPROC Generate(CHAR ARRAY res BYTE len,safe)\\n DEFINE PTR=\\\"CARD\\\"\\n CHAR ARRAY st,\\n upper=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n lower=\\\"abcdefghijklmnopqrstuvwxyz\\\",\\n numbers=\\\"0123456789\\\",\\n special=\\\"!\\\"\\\"#$%&'()*+,-./:;<=>?@[]^_|\\\",\\n unsafe=\\\"Il1O05S2Z\\\"\\n PTR ARRAY sets(4)\\n BYTE i\\n\\n sets(0)=upper sets(1)=lower\\n sets(2)=numbers sets(3)=special\\n\\n res(0)=len\\n FOR i=1 TO len\\n DO\\n IF safe THEN\\n res(i)=RandChar(sets(i MOD 4),unsafe)\\n ELSE\\n res(i)=RandChar(sets(i MOD 4),\\\"\\\")\\n FI\\n OD\\n Shuffle(res)\\nRETURN\\n\\nPROC PrintHelp()\\n PutE()\\n PrintE(\\\"Program generates random passwords\\\")\\n PrintE(\\\"containing at least one upper-case\\\")\\n PrintE(\\\"letter, one lower-case letter, one\\\")\\n PrintE(\\\"digit and one special character.\\\")\\n PrintE(\\\"It is possible to exclude visually\\\")\\n PrintE(\\\"similar characters Il1O05S2Z.\\\")\\n PutE()\\nRETURN\\n\\nPROC Main()\\n BYTE len,count,safe,i,again,help\\n CHAR ARRAY password(255)\\n\\n help=GetBoolParam(\\\"Show help\\\")\\n IF help THEN\\n PrintHelp()\\n FI\\n\\n DO\\n len=GetNumParam(\\\"length of password\\\",4,30)\\n safe=GetBoolParam(\\\"Exclude similar chars\\\")\\n count=GetNumParam(\\\"number of passwords\\\",1,10)\\n PutE()\\n FOR i=1 TO count\\n DO\\n Generate(password,len,safe)\\n PrintF(\\\"%B. %S%E\\\",i,password)\\n OD\\n PutE()\\n again=GetBoolParam(\\\"Generate again\\\")\\n UNTIL again=0\\n OD\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Numerics.Discrete_Random;\\nwith Ada.Strings.Fixed;\\nwith Ada.Command_Line;\\nwith Ada.Integer_Text_IO;\\nwith Ada.Text_IO;\\n\\nprocedure Mkpw is\\n\\n procedure Put_Usage;\\n procedure Parse_Command_Line (Success : out Boolean);\\n function Create_Password (Length : in Positive;\\n Safe : in Boolean)\\n return String;\\n\\n procedure Put_Usage is\\n use Ada.Text_IO;\\n begin\\n Put_Line (\\\"Usage: \\\");\\n Put_Line (\\\" mkpw help - Show this help text \\\");\\n Put_Line (\\\" mkpw [count <n>] [length <l>] [seed <s>] [safe] \\\");\\n Put_Line (\\\" count <n> - Number of passwords generated (default 4)\\\");\\n Put_Line (\\\" length <l> - Password length (min 4) (default 4)\\\");\\n Put_Line (\\\" seed <l> - Seed for random generator (default 0)\\\");\\n Put_Line (\\\" safe - Do not use unsafe characters (0O1lIS52Z)\\\");\\n end Put_Usage;\\n\\n Lower_Set : constant String := \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n Upper_Set : constant String := \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n Digit_Set : constant String := \\\"0123456789\\\";\\n Spec_Set : constant String := \\\"!\\\"\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\";\\n Unsafe_Set : constant String := \\\"0O1lI5S2Z\\\";\\n\\n Full_Set : constant String := Lower_Set & Upper_Set & Digit_Set & Spec_Set;\\n subtype Full_Indices is Positive range Full_Set'Range;\\n\\n package Full_Index_Generator is\\n new Ada.Numerics.Discrete_Random (Full_Indices);\\n\\n Index_Generator : Full_Index_Generator.Generator;\\n\\n Config_Safe : Boolean := False;\\n Config_Count : Natural := 4;\\n Config_Length : Positive := 6;\\n Config_Seed : Integer := 0;\\n Config_Show_Help : Boolean := False;\\n\\n procedure Parse_Command_Line (Success : out Boolean) is\\n use Ada.Command_Line;\\n Got_Safe, Got_Count : Boolean := False;\\n Got_Length, Got_Seed : Boolean := False;\\n Last : Positive;\\n Index : Positive := 1;\\n begin\\n Success := False;\\n if Argument_Count = 1 and then Argument (1) = \\\"help\\\" then\\n Config_Show_Help := True;\\n return;\\n end if;\\n\\n while Index <= Argument_Count loop\\n if Ada.Command_Line.Argument (Index) = \\\"safe\\\" then\\n if Got_Safe then\\n return;\\n end if;\\n Got_Safe := True;\\n Config_Safe := True;\\n Index := Index + 1;\\n elsif Argument (Index) = \\\"count\\\" then\\n if Got_Count then\\n return;\\n end if;\\n Got_Count := True;\\n Ada.Integer_Text_IO.Get (Item => Config_Count,\\n From => Argument (Index + 1),\\n Last => Last);\\n if Last /= Argument (Index + 1)'Last then\\n return;\\n end if;\\n Index := Index + 2;\\n elsif Argument (Index) = \\\"length\\\" then\\n if Got_Length then\\n return;\\n end if;\\n Got_Length := True;\\n Ada.Integer_Text_IO.Get (Item => Config_Length,\\n From => Argument (Index + 1),\\n Last => Last);\\n if Last /= Argument (Index + 1)'Last then\\n return;\\n end if;\\n if Config_Length < 4 then\\n return;\\n end if;\\n Index := Index + 2;\\n elsif Argument (Index) = \\\"seed\\\" then\\n if Got_Seed then\\n return;\\n end if;\\n Got_Seed := True;\\n Ada.Integer_Text_IO.Get (Item => Config_Seed,\\n From => Argument (Index + 1),\\n Last => Last);\\n if Last /= Argument (Index + 1)'Last then\\n return;\\n end if;\\n Index := Index + 2;\\n else\\n return;\\n end if;\\n end loop;\\n Success := True;\\n exception\\n when Constraint_Error | Ada.Text_IO.Data_Error =>\\n null;\\n end Parse_Command_Line;\\n\\n function Create_Password (Length : in Positive;\\n Safe : in Boolean)\\n return String\\n is\\n\\n function Get_Random (Safe : in Boolean)\\n return Character;\\n\\n function Get_Random (Safe : in Boolean)\\n return Character\\n is\\n use Ada.Strings.Fixed;\\n C : Character;\\n begin\\n loop\\n C := Full_Set (Full_Index_Generator.Random (Index_Generator));\\n if Safe then\\n exit when Index (Source => Unsafe_Set, Pattern => \\\"\\\" & C) = 0;\\n else\\n exit;\\n end if;\\n end loop;\\n return C;\\n end Get_Random;\\n\\n function Has_Four (Item : in String)\\n return Boolean;\\n\\n function Has_Four (Item : in String)\\n return Boolean\\n is\\n use Ada.Strings.Fixed;\\n Has_Upper, Has_Lower : Boolean := False;\\n Has_Digit, Has_Spec : Boolean := False;\\n begin\\n for C of Item loop\\n if Index (Upper_Set, \\\"\\\" & C) /= 0 then Has_Upper := True; end if;\\n if Index (Lower_Set, \\\"\\\" & C) /= 0 then Has_Lower := True; end if;\\n if Index (Digit_Set, \\\"\\\" & C) /= 0 then Has_Digit := True; end if;\\n if Index (Spec_Set, \\\"\\\" & C) /= 0 then Has_Spec := True; end if;\\n end loop;\\n return Has_Upper and Has_Lower and Has_Digit and Has_Spec;\\n end Has_Four;\\n\\n Password : String (1 .. Length);\\n begin\\n loop\\n for I in Password'Range loop\\n Password (I) := Get_Random (Safe);\\n end loop;\\n exit when Has_Four (Password);\\n end loop;\\n return Password;\\n end Create_Password;\\n\\n Parse_Success : Boolean;\\nbegin\\n\\n Parse_Command_Line (Parse_Success);\\n\\n if Config_Show_Help or not Parse_Success then\\n Put_Usage; return;\\n end if;\\n\\n if Config_Seed = 0 then\\n Full_Index_Generator.Reset (Index_Generator);\\n else\\n Full_Index_Generator.Reset (Index_Generator, Config_Seed);\\n end if;\\n\\n for Count in 1 .. Config_Count loop\\n Ada.Text_IO.Put_Line (Create_Password (Length => Config_Length,\\n Safe => Config_Safe));\\n end loop;\\n\\nend Mkpw;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"1 N=1\\n2 L=8\\n3 M$=CHR$(13)\\n4 D$=CHR$(4)\\n5 S$(0)=\\\"S\\\"\\n6 F$=\\\"A FILE\\\"\\n7 C$(1)=\\\" (CURRENT OPTION)\\\"\\n8 DEF FN R(T)=ASC(MID$(G$(T),INT(RND(1)*LEN(G$(T))+1),1))\\n9 GOSUB 750\\n10 FOR Q = 0 TO 1 STEP 0\\n20 GOSUB 50CHOOSE\\n30 NEXT Q\\n40 END\\n\\nREM *** CHOOSE ***\\n50 PRINT M$M$\\\"1 GEN 2 DISP 3 FILE 4 LEN 5 NUM 6 SEED\\\"\\n60 PRINT \\\"7 CHR 8 HELP 9 QUIT \\\"CHR$(10)\\\"CHOOSE AN OPTION: \\\";\\n70 GET K$\\n75 IF K$ > CHR$(95) THEN K$ = CHR$(ASC(K$) - 32)\\n80 PRINT K$\\n85 ON VAL(K$) GOTO 100,200,300,400,500,600,700,800,900\\n90 GOTO 210OPTIONS\\n\\nREM *** GENERATE ***\\n100 PRINT M$\\n105 IF L > 32 THEN PRINT \\\"UM... OK, THIS MIGHT TAKE A BIT.\\\"M$\\n110 GOSUB 340OPEN\\n115 FOR P=1 TO N\\n120 P$=\\\"\\\"\\n125 FOR I=1 TO L\\n135 P$=P$+CHR$(FNR(I*(I<5)))\\n140 NEXT I\\nREM SHUFFLE FIRST 4\\n150 FOR I = 1 TO 4\\n151 C$=MID$(P$,I,1)\\n152 J=INT(RND(1)*L)+1\\n153 H$=MID$(P$,J,1)\\n154 P$=MID$(P$,1,J-1)+C$+MID$(P$,J+1,L)\\n155 P$=MID$(P$,1,I-1)+H$+MID$(P$,I+1,L)\\n156 NEXT I\\n180 PRINT P$\\n185 NEXT P\\n190 GOTO 380CLOSE\\n\\nREM *** DISPLAY ***\\n200 C = 0\\nREM *** OPTIONS ***\\n210 HOME\\n215 PRINT \\\"PASSWORD GENERATOR\\\"M$M$\\n220 PRINT \\\"1. GENERATE \\\"N\\\" PASSWORD\\\"S$(N=1)M$\\n225 PRINT \\\"2. DISPLAYED\\\"C$(C=0)M$\\\" OR\\\"\\n230 PRINT \\\"3. WRITTEN TO \\\"F$C$(C=1)M$\\n235 PRINT \\\"4. SPECIFY THE PASSWORD LENGTH = \\\"L;M$\\n240 PRINT \\\"5. SPECIFY THE NUMBER OF PASSWORDS TO\\\"M$TAB(31)\\\"GENERATE\\\"\\n245 PRINT \\\"6. SPECIFY A SEED VALUE\\\"M$\\n250 PRINT \\\"7. EXCLUDE VISUALLY SIMILAR CHARACTERS\\\"M$\\n255 PRINT \\\"8. HELP AND OPTIONS\\\"\\n260 RETURN\\n\\nREM *** WRITE TO A FILE ***\\n300 C = 1\\n310 GOTO 210OPTIONS\\nREM *** OPEN A FILE ***\\n340 IF NOT C THEN RETURN\\n345 PRINT D$\\\"OPEN \\\"F$\\\"\\n350 PRINT D$\\\"CLOSE\\\"F$\\n355 PRINT D$\\\"DELETE \\\"F$\\n360 PRINT D$\\\"OPEN \\\"F$\\n365 PRINT D$\\\"WRITE \\\"F$\\n370 RETURN\\nREM *** CLOSE A FILE ***\\n380 IF NOT C THEN RETURN\\n385 PRINT D$\\\"CLOSE\\\"F$\\n390 RETURN\\n\\nREM *** SET PASSWORD LENGTH ***\\n400 PRINT M$\\n410 FOR I = 0 TO 1 STEP 0\\n420 INPUT \\\"ENTER A NUMBER FROM 4 TO 255 TO SPECIFY THE PASSWORD LENGTH = \\\";L\\n430 IF L >= 4 AND L < 256 THEN RETURN\\n440 PRINT \\\"?OUT OF RANGE\\\"\\n450 NEXT I\\n\\nREM *** SET NUMBER OF PASSWORDS TO GENERATE ***\\n500 PRINT M$\\n510 FOR I = 0 TO 1 STEP 0\\n520 INPUT \\\"ENTER A NUMBER FROM 1 AND UP TO SPECIFY THE NUMBER OF PASSWORDS TO GENERATE: \\\";N\\n530 IF N >= 1 THEN RETURN\\n540 PRINT \\\"?OUT OF RANGE.\\\"\\n550 NEXT I\\n\\nREM *** SET A SEED VALUE ***\\n600 PRINT M$\\n610 INPUT \\\"ENTER A SEED VALUE: \\\";S%\\n620 PRINT RND(S%)\\n630 RETURN\\n\\nREM *** EXCLUDE ***\\n700 PRINT M$\\n705 INPUT \\\"ENTER CHARACTERS TO EXCLUDE:\\\";E$\\nREM *** GROUPS ***\\nREM ALWAYS EXCLUDE BACKSLASH AND BACKTICK (GRAVE)\\n710 E$=CHR$(92)+CHR$(96)+E$\\n711 FOR G = 1 TO 4\\n712 G$(G) = \\\"\\\"\\n713 NEXT G\\n720 FOR G = 1 TO 2\\n721 FOR K = ASC(\\\"A\\\") + (G - 1) * 32 TO ASC(\\\"Z\\\") + (G - 1) * 32\\n722 GOSUB 770ADD\\n723 NEXT K, G\\n730 FOR K = 33 TO 64\\n731 G = 3 + (K < ASC(STR$(0)) OR K > ASC(STR$(9)))\\n732 GOSUB 770ADD\\n733 NEXT K\\n734 FOR K = 91 TO 96\\n735 GOSUB 770ADD\\n736 NEXT K\\n737 FOR K = 123 TO 126\\n738 GOSUB 770ADD\\n739 NEXT K\\n740 G$(0) = \\\"\\\"\\n741 FOR G = 1 TO 4\\n742 IF LEN(G$(G)) THEN G$(0) = G$(0) + G$(G) : NEXT G : GOTO 800HELP\\n743 ?\\\"THERE MUST BE AT LEAST ONE CHARUNRACTER IN EACH GROUP\\\"\\n744 GOTO 705\\nREM *** DEFAULT (QUICK) ***\\n750 G$(1)=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n751 FOR I=97TO122:G$(2)=G$(2)+CHR$(I):NEXT\\n753 G$(3)=\\\"0123456789\\\"\\n754 G$(4)=\\\"!\\\"+CHR$(34)+\\\"#$%&'()*+,-./:;<=>?@\\\"+CHR$(91)+\\\"]^\\\"+CHR$(95)\\n755 FOR I=123TO126:G$(4)=G$(4)+CHR$(I):NEXTI\\n756 G$(0)=G$(0)+G$(1)+G$(2)+G$(3)\\n757 GOTO 210OPTIONS\\nREM *** ADD TO GROUP\\n770 C$ = CHR$(K)\\n775 FOR E = 1 TO LEN(E$)\\n780 IF C$ <> MID$(E$,E,1) THEN NEXT E : G$(G)=G$(G)+C$ : ?C$;\\n790 RETURN\\n\\nREM *** HELP ***\\n800 HOME\\n805 PRINT \\\"GENERATE PASSWORDS CONTAINING RANDOM\\\"\\n810 PRINT \\\"ASCII CHARACTERS FROM THESE GROUPS:\\\"M$\\n815 PRINT \\\" LOWERCASE UPPERCASE DIGIT OTHER\\\"M$\\n820 PRINT \\\" \\\"LEFT$(G$(2),9)TAB(13)LEFT$(G$(1),9)TAB(23)LEFT$(G$(3),5)TAB(29)LEFT$(G$(4),11)\\n825 PRINT \\\" \\\"MID$(G$(2),10,9)TAB(13)MID$(G$(1),10,9)TAB(23)MID$(G$(3),6,5)TAB(29)MID$(G$(4),12,11)\\n826 PRINT \\\" \\\"MID$(G$(2),19,9)TAB(13)MID$(G$(1),19,9)TAB(29)MID$(G$(4),23,15)M$\\n840 PRINT \\\"YOU MAY CHOOSE THE PASSWORD LENGTH, AND\\\"\\n845 PRINT \\\"HOW MANY PASSWORDS TO GENERATE. IT IS\\\"\\n850 PRINT \\\"ENSURED THAT THERE IS AT LEAST ONE\\\"\\n855 PRINT \\\"CHARACTER FROM EACH OF THE GROUPS IN\\\"\\n860 PRINT \\\"EACH PASSWORD. THERE IS AN OPTION TO\\\"\\n865 PRINT \\\"EXCLUDE VISUALLY SIMILAR CHARACTERS.\\\"\\n870 RETURN\\n\\nREM *** QUIT ***\\n900 Q = 1\\n910 VTAB 23\\n920 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"lowercase: `a`..`z`\\nuppercase: `A`..`Z`\\ndigits: `0`..`9`\\nother: map split \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" => [to :char]\\n\\nany: lowercase ++ uppercase ++ digits ++ other\\n\\ngenerate: function [length][\\n if length < 4 [\\n print (color #red \\\"ERROR: \\\") ++ \\\"password length too short\\\"\\n exit\\n ]\\n\\n chars: new @[sample lowercase sample uppercase sample digits sample other]\\n while [length > size chars][\\n 'chars ++ sample any\\n ]\\n\\n join shuffle chars\\n]\\n\\nif 0 = size arg [\\n print {\\n ---------------------------------\\n Arturo password generator\\n (c) 2021 drkameleon\\n ---------------------------------\\n usage: passgen.art <length>\\n }\\n exit\\n]\\n\\nloop 1..10 'x [\\n print generate to :integer first arg\\n]\\n\",\n \"language\": \"Arturo\"\n },\n {\n \"code\": \"# syntax: GAWK -f PASSWORD_GENERATOR.AWK [-v mask=x] [-v xt=x]\\n#\\n# examples:\\n# REM 4 character passwords using Rosetta Code default of: lower, upper, number, other\\n# GAWK -f PASSWORD_GENERATOR.AWK\\n#\\n# REM 8 character passwords; Rosetta Code default plus another four\\n# GAWK -f PASSWORD_GENERATOR.AWK -v mask=LUNPEEEE\\n#\\n# REM 8 character passwords ignoring Rosetta Code requirement\\n# GAWK -f PASSWORD_GENERATOR.AWK -v mask=EEEEEEEE\\n#\\n# REM help\\n# GAWK -f PASSWORD_GENERATOR.AWK ?\\n#\\n# sorting:\\n# PROCINFO[\\\"sorted_in\\\"] is used by GAWK\\n# SORTTYPE is used by Thompson Automation's TAWK\\n#\\nBEGIN {\\n PROCINFO[\\\"sorted_in\\\"] = \\\"@ind_str_asc\\\" ; SORTTYPE = 1\\n srand()\\n# setup strings of valid characters used by mask\\n arr[\\\"L\\\"] = \\\"abcdefghijklmnopqrstuvwxyz\\\" # Lower case\\n arr[\\\"U\\\"] = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\" # Upper case\\n arr[\\\"N\\\"] = \\\"0123456789\\\" # Numbers\\n arr[\\\"P\\\"] = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" # Punctuation: I.E. other\\n arr[\\\"A\\\"] = arr[\\\"L\\\"] arr[\\\"U\\\"] # Alphabetic: lower and upper case\\n arr[\\\"E\\\"] = arr[\\\"L\\\"] arr[\\\"U\\\"] arr[\\\"N\\\"] arr[\\\"P\\\"] # Everything: lower, upper, number, punctuation\\n arr[\\\"B\\\"] = \\\" \\\" # Blank: a space\\n# validate array index and length of assignment\\n for (i in arr) {\\n if (length(i) != 1) {\\n error(sprintf(\\\"arr[%s], index is invalid\\\",i))\\n }\\n if (length(arr[i]) == 0) {\\n error(sprintf(\\\"arr[%s], is null\\\",i))\\n }\\n mask_valids = sprintf(\\\"%s%s\\\",mask_valids,i)\\n }\\n# validate command line variables\\n if (mask == \\\"\\\") {\\n mask = \\\"LUNP\\\" # satisfy Rosetta Code task requirement\\n }\\n if (xt == \\\"\\\") {\\n xt = 10 # default iterations\\n }\\n if (xt !~ /^[0-9]+$/) {\\n error(\\\"xt is not 0-9\\\")\\n }\\n# validate each character in mask\\n for (i=1; i<=length(mask); i++) {\\n c = substr(mask,i,1)\\n if (!(c in arr)) {\\n error(sprintf(\\\"mask position %d is %s, invalid\\\",i,c))\\n }\\n }\\n# help\\n if (ARGV[1] == \\\"?\\\") {\\n syntax()\\n exit(0)\\n }\\n if (ARGC-1 != 0) {\\n error(\\\"no files allowed on command line\\\")\\n }\\n# make passwords\\n if (errors == 0) {\\n for (i=1; i<=xt; i++) {\\n make_password()\\n }\\n }\\n exit(errors+0)\\n}\\nfunction error(message) {\\n printf(\\\"error: %s\\\\n\\\",message)\\n errors++\\n}\\nfunction make_password( c,i,indx,password,valids) {\\n for (i=1; i<=length(mask); i++) { # for each character in mask\\n c = substr(mask,i,1) # extract 1 character from mask\\n valids = arr[c] # valid characters for this position in mask\\n indx = int(rand() * length(valids)) + 1\\n c = substr(valids,indx,1) # extract 1 character from list of valids\\n password = password c # build password\\n }\\n printf(\\\"%s\\\\n\\\",password)\\n}\\nfunction syntax( cmd,i) {\\n cmd = \\\"GAWK -f PASSWORD_GENERATOR.AWK\\\"\\n printf(\\\"syntax: %s [-v mask=x] [-v xt=x]\\\\n\\\\n\\\",cmd)\\n printf(\\\" mask 1..n bytes determines password format and length; consists of %s\\\\n\\\",mask_valids)\\n for (i in arr) {\\n printf(\\\"%9s - %s\\\\n\\\",i,(arr[i] == \\\" \\\") ? \\\"<space>\\\" : arr[i])\\n }\\n printf(\\\" xt number of passwords to generate\\\\n\\\\n\\\")\\n printf(\\\"example: %s -v mask=%s -v xt=%s\\\\n\\\",cmd,mask,xt)\\n}\\n\",\n \"language\": \"AWK\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n\\n#define DEFAULT_LENGTH 4\\n#define DEFAULT_COUNT 1\\n\\nchar* symbols[] = {\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"0123456789\\\", \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"};\\nint length = DEFAULT_LENGTH;\\nint count = DEFAULT_COUNT;\\nunsigned seed;\\nchar exSymbols = 0;\\n\\nvoid GetPassword () {\\n //create an array of values that determine the number of characters from each category\\n int lengths[4] = {1, 1, 1, 1};\\n int count = 4;\\n while (count < length) {\\n lengths[rand()%4]++;\\n count++;\\n }\\n\\n //loop through the array of lengths and set the characters in password\\n char password[length + 1];\\n for (int i = 0; i < length; ) {\\n //pick which string to read from\\n int str = rand()%4;\\n if (!lengths[str])continue; //if the number of characters for that string have been reached, continue to the next interation\\n\\n char c;\\n switch (str) {\\n case 2:\\n c = symbols[str][rand()%10];\\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\\n c = symbols[str][rand()%10];\\n password[i] = c;\\n break;\\n\\n case 3:\\n c = symbols[str][rand()%30];\\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\\n c = symbols[str][rand()%30];\\n password[i] = c;\\n break;\\n\\n default:\\n c = symbols[str][rand()%26];\\n while (exSymbols && (c == 'I' || c == 'l' || c == '1' || c == 'O' || c == '0' || c == '5' || c == 'S' || c == '2' || c == 'Z'))\\n c = symbols[str][rand()%26];\\n password[i] = c;\\n break;\\n }\\n\\n i++;\\n lengths[str]--;\\n }\\n\\n password [length] = '\\\\0';\\n printf (\\\"%s\\\\n\\\", password);\\n}\\n\\nint main (int argc, char* argv[]) {\\n seed = (unsigned)time(NULL);\\n\\n //handle user input from the command line\\n for (int i = 1; i < argc; i++) {\\n switch (argv[i][1]) {\\n case 'l':\\n if (sscanf (argv[i+1], \\\"%d\\\", &length) != 1) {\\n puts (\\\"Unrecognized input. Syntax: -l [integer]\\\");\\n return -1;\\n }\\n\\n if (length < 4) {\\n puts (\\\"Password length must be at least 4 characters.\\\");\\n return -1;\\n }\\n i++;\\n break;\\n\\n case 'c':\\n if (sscanf (argv[i+1], \\\"%d\\\", &count) != 1) {\\n puts (\\\"Unrecognized input. Syntax: -c [integer]\\\");\\n return -1;\\n }\\n\\n if (count <= 0) {\\n puts (\\\"Count must be at least 1.\\\");\\n return -1;\\n }\\n i++;\\n break;\\n\\n case 's':\\n if (sscanf (argv[i+1], \\\"%d\\\", &seed) != 1) {\\n puts (\\\"Unrecognized input. Syntax: -s [integer]\\\");\\n return -1;\\n }\\n i++;\\n break;\\n\\n case 'e':\\n exSymbols = 1;\\n break;\\n\\n default:\\n help:\\n printf (\\\"Help:\\\\nThis program generates a random password.\\\\n\\\"\\n \\\"Commands:\\\"\\n \\\"Set password length: -l [integer]\\\\n\\\"\\n \\\"Set password count: -c [integer]\\\\n\\\"\\n \\\"Set seed: -s [integer]\\\\n\\\"\\n \\\"Exclude similiar characters: -e\\\\n\\\"\\n \\\"Display help: -h\\\");\\n return 0;\\n break;\\n }\\n }\\n\\n srand (seed);\\n\\n for (int i = 0; i < count; i++)\\n GetPassword();\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <string>\\n#include <algorithm>\\n#include <ctime>\\n\\nconst std::string CHR[] = { \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"0123456789\\\", \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" };\\nconst std::string UNS = \\\"O0l1I5S2Z\\\";\\n\\nstd::string createPW( int len, bool safe ) {\\n std::string pw;\\n char t;\\n for( int x = 0; x < len; x += 4 ) {\\n for( int y = x; y < x + 4 && y < len; y++ ) {\\n do {\\n t = CHR[y % 4].at( rand() % CHR[y % 4].size() );\\n } while( safe && UNS.find( t ) != UNS.npos );\\n pw.append( 1, t );\\n }\\n }\\n std::random_shuffle( pw.begin(), pw.end() );\\n return pw;\\n}\\nvoid generate( int len, int count, bool safe ) {\\n for( int c = 0; c < count; c++ ) {\\n std::cout << createPW( len, safe ) << \\\"\\\\n\\\";\\n }\\n std::cout << \\\"\\\\n\\\\n\\\";\\n}\\nint main( int argc, char* argv[] ){\\n if( argv[1][1] == '?' || argc < 5 ) {\\n std::cout << \\\"Syntax: PWGEN length count safe seed /?\\\\n\\\"\\n \\\"length:\\\\tthe length of the password(min 4)\\\\n\\\"\\n \\\"count:\\\\thow many passwords should be generated\\\\n\\\"\\n \\\"safe:\\\\t1 will exclude visually similar characters, 0 won't\\\\n\\\"\\n \\\"seed:\\\\tnumber to seed the random generator or 0\\\\n\\\"\\n \\\"/?\\\\tthis text\\\\n\\\\n\\\";\\n } else {\\n int l = atoi( argv[1] ),\\n c = atoi( argv[2] ),\\n e = atoi( argv[3] ),\\n s = atoi( argv[4] );\\n if( l < 4 ) {\\n std::cout << \\\"Passwords must be at least 4 characters long.\\\\n\\\\n\\\";\\n } else {\\n if (s == 0) {\\n std::srand( time( NULL ) );\\n } else {\\n std::srand( unsigned( s ) );\\n }\\n generate( l, c, e != 0 );\\n }\\n }\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nclass Program\\n{\\n const string Lower = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n const string Upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\n const string Digits = \\\"0123456789\\\";\\n const string Symbols = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\";\\n static readonly string[] Full = {Lower, Upper, Digits, Symbols, Lower + Upper + Digits + Symbols};\\n\\n const string Similar = \\\"Il1O05S2Z\\\";\\n static readonly string[] Excluded = Full.Select(x => new string(x.Except(Similar).ToArray())).ToArray();\\n\\n static Random _rng = new Random();\\n static string[] _symbolSet = Full;\\n\\n static void Main(string[] args)\\n {\\n int length = 12, count = 1;\\n try\\n {\\n foreach (var x in args.Select(arg => arg.Split(':')))\\n {\\n switch (x[0])\\n {\\n case \\\"-l\\\": length = int.Parse(x[1]); break;\\n case \\\"-c\\\": count = int.Parse(x[1]); break;\\n case \\\"-s\\\": _rng = new Random(x[1].GetHashCode()); break;\\n case \\\"-x\\\": _symbolSet = bool.Parse(x[1]) ? Excluded : Full; break;\\n default: throw new FormatException(\\\"Could not parse arguments\\\");\\n }\\n }\\n }\\n catch { ShowUsage(); return; }\\n try\\n {\\n for (int i = 0; i < count; i++)\\n Console.WriteLine(GeneratePass(length));\\n }\\n catch (Exception ex) { Console.WriteLine(\\\"Error: \\\" + ex.Message); }\\n }\\n\\n static void ShowUsage()\\n {\\n Console.WriteLine(\\\"Usage: PASSGEN [-l:length] [-c:count] [-s:seed] [-x:(true|false)]\\\");\\n Console.WriteLine(\\\"\\\\t-l: the length of the generated passwords\\\");\\n Console.WriteLine(\\\"\\\\t-c: the number of passwords to generate\\\");\\n Console.WriteLine(\\\"\\\\t-s: seed for the random number generator\\\");\\n Console.WriteLine(\\\"\\\\t-x: exclude similar characters: \\\" + Similar);\\n Console.WriteLine(\\\"Example: PASSGEN -l:10 -c:5 -s:\\\\\\\"Sample Seed\\\\\\\" -x:true\\\");\\n }\\n\\n static string GeneratePass(int length)\\n {\\n var minLength = _symbolSet.Length - 1;\\n if(length < minLength)\\n throw new Exception(\\\"password length must be \\\" + minLength + \\\" or greater\\\");\\n\\n int[] usesRemaining = Enumerable.Repeat(1, _symbolSet.Length).ToArray();\\n usesRemaining[minLength] = length - minLength;\\n var password = new char[length];\\n for (int ii = 0; ii < length; ii++)\\n {\\n int set = _rng.Next(0, _symbolSet.Length);\\n if (usesRemaining[set] > 0)\\n {\\n usesRemaining[set]--;\\n password[ii] = _symbolSet[set][_rng.Next(0, _symbolSet[set].Length)];\\n }\\n else ii--;\\n }\\n return new string(password);\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"module rosetta.passwordgenerator \\\"1.0.0\\\" {\\n import ceylon.random \\\"1.2.2\\\";\\n}\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"import ceylon.random {\\n DefaultRandom,\\n Random\\n}\\n\\nCharacter[] lowerCaseChars = 'a'..'z';\\nCharacter[] upperCaseChars = 'A'..'Z';\\nCharacter[] numsAsChars = '0'..'9';\\nCharacter[] specialChars = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\".sequence();\\nCharacter[] allChars = lowerCaseChars.append(upperCaseChars)\\n .append(numsAsChars)\\n .append(specialChars);\\n\\nshared void run() {\\n print(\\\"2 passwords of size 8\\\");\\n print(\\\"------\\\");\\n generatePasswords(8,2).each(print);\\n print(\\\"------\\\");\\n print(\\\"5 passwords of size 12\\\");\\n print(\\\"------\\\");\\n generatePasswords(12,5).each(print);\\n print(\\\"------\\\");\\n print(\\\"7 passwords of size 16\\\");\\n print(\\\"------\\\");\\n generatePasswords(16,7).each(print);\\n print(\\\"------\\\");\\n print(\\\"2 passwords of size 16 exclude AiX24!~\\\");\\n print(\\\"------\\\");\\n generatePasswords(16,7,\\\"AiX24!~\\\".sequence()).each(print);\\n}\\n\\nString[] generatePasswords(Integer numChars, Integer numPasswords, Character[] excludedChars=[])\\n => [for (count in 1..numPasswords) generatePassword(numChars,excludedChars) ];\\n\\n//The generated password(s) must include at least one lower-case letter, one upper-case letter and one character from digits and 'other'.\\nString generatePassword(Integer numChars, Character[] excludedChars) {\\n \\\"Must provide a password length of at least 4\\\"\\n assert(numChars >= 4);\\n\\n value random = DefaultRandom();\\n\\n value fixedPartOfPassword = passwordFragmentForRequirements(random,excludedChars);\\n\\n value randomPart =\\n randomPartOfPassword{ random = random;\\n index = fixedPartOfPassword.size + 1;\\n randomPart = \\\"\\\";\\n numChars = numChars;\\n candidateChars = filterCharsToExclude(allChars, excludedChars); };\\n\\n value unshuffledPassword = fixedPartOfPassword + randomPart;\\n\\n assert(unshuffledPassword.string.size == numChars);\\n\\n \\\"excluded chars contained\\\"\\n assert(! unshuffledPassword.any((char) => excludedChars.contains(char)));\\n\\n \\\"Sizes not equal\\\"\\n assert(unshuffledPassword.size == numChars);\\n\\n value shuffledPassword =\\n shuffleCharsRecursive(unshuffledPassword.string,\\\"\\\",unshuffledPassword.indexes().sequence());\\n\\n \\\"Sizes not equal\\\"\\n assert(shuffledPassword.string.size == numChars);\\n\\n \\\"set of characters not equal\\\"\\n assert(set(unshuffledPassword) == set(shuffledPassword));\\n\\n return shuffledPassword;\\n}\\n\\nString passwordFragmentForRequirements(Random random, Character[] excludedChars)\\n => String({filterAndUse(random,lowerCaseChars, excludedChars),\\n filterAndUse(random,upperCaseChars,excludedChars),\\n filterAndUse(random,numsAsChars,excludedChars),\\n filterAndUse(random,specialChars,excludedChars)});\\n\\nString randomPartOfPassword(Random random,\\n Integer index,\\n String randomPart,\\n Integer numChars,\\n Character[] candidateChars) {\\n if(index <= numChars) {\\n value candidateCharsIndex = random.nextInteger(candidateChars.size);\\n assert(exists allChar = candidateChars[candidateCharsIndex]);\\n return randomPartOfPassword{ random=random;\\n index=index+1;\\n randomPart = randomPart + allChar.string;\\n numChars =numChars;\\n candidateChars = candidateChars; };\\n }\\n\\n return randomPart;\\n}\\n\\nString shuffleCharsRecursive(String orig,String shuffledString,Integer[] remainingOrigIndexes) {\\n value random = DefaultRandom();\\n\\n if (nonempty constRemainingIndexes = remainingOrigIndexes) {\\n value randomIndex = random.nextInteger(orig.size);\\n\\n assert(exists nextChar = orig[randomIndex]);\\n\\n String newShuffledString;\\n Integer[] newRemainingIndexes;\\n\\n if (constRemainingIndexes.contains(randomIndex)) {\\n newShuffledString = shuffledString + nextChar.string;\\n newRemainingIndexes = constRemainingIndexes.filter((index) => randomIndex != index).sequence();\\n } else {\\n newShuffledString = shuffledString;\\n newRemainingIndexes = constRemainingIndexes;\\n }\\n\\n return shuffleCharsRecursive{ orig=orig;\\n shuffledString=newShuffledString;\\n remainingOrigIndexes=newRemainingIndexes; };\\n }\\n\\n return shuffledString;\\n}\\n\\nCharacter filterAndUse(Random random, Character[] chars, Character[] excludedChars) {\\n value charsToUse = filterCharsToExclude(chars, excludedChars);\\n value charToUseIndex = random.nextInteger(charsToUse.size);\\n assert( exists charToUse = charsToUse[charToUseIndex]);\\n return charToUse;\\n}\\n\\nCharacter[] filterCharsToExclude(Character[] chars, Character[] charsToExclude)\\n => chars.filter((char) => ! charsToExclude.contains(char)).sequence();\\n\",\n \"language\": \"Ceylon\"\n },\n {\n \"code\": \"(ns pwdgen.core\\n (:require [clojure.set :refer [difference]]\\n [clojure.tools.cli :refer [parse-opts]])\\n (:gen-class))\\n\\n(def minimum-length 4)\\n(def cli-options\\n [[\\\"-c\\\" \\\"--count NUMBER\\\" \\\"Number of passwords to generate\\\"\\n :default 1\\n :parse-fn #(Integer/parseInt %)]\\n [\\\"-l\\\" \\\"--length NUMBER\\\" \\\"Length of the generated passwords\\\"\\n :default 8\\n :parse-fn #(Integer/parseInt %)\\n :validate [#(<= minimum-length %) (str \\\"Must be greater than or equal to \\\" minimum-length)]]\\n [\\\"-x\\\", \\\"--exclude-similar\\\" \\\"Exclude similar characters\\\"]\\n [\\\"-h\\\" \\\"--help\\\"]])\\n\\n(def lowercase (map char (range (int \\\\a) (inc (int \\\\z)))))\\n(def uppercase (map char (range (int \\\\A) (inc (int \\\\Z)))))\\n(def numbers (map char (range (int \\\\0) (inc (int \\\\9)))))\\n(def specials (remove (set (concat lowercase uppercase numbers [\\\\` \\\\\\\\])) (map char (range (int \\\\!) (inc (int \\\\~))))))\\n(def similar #{\\\\I \\\\l \\\\1 \\\\| \\\\O \\\\0 \\\\5 \\\\S \\\\2 \\\\Z})\\n\\n(defn sanitize [coll options]\\n (if (:exclude-similar options) (into '() (difference (set coll) similar)) coll))\\n\\n(defn generate-password [options]\\n (let [upper (rand-nth (sanitize uppercase options))\\n lower (rand-nth (sanitize lowercase options))\\n number (rand-nth (sanitize numbers options))\\n special (rand-nth (sanitize specials options))\\n combined (shuffle (sanitize (concat lowercase uppercase numbers specials) options))]\\n (shuffle (into (list upper lower number special) (take (- (:length options) minimum-length) combined)))))\\n\\n(defn -main [& args]\\n (let [{:keys [options summary]} (parse-opts args cli-options)]\\n (if (:help options) (println summary)\\n (dotimes [n (:count options)]\\n (println (apply str (generate-password options)))))))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"1 rem password generator\\n2 rem rosetta code\\n10 g$(1)=\\\"abcdefghijklmnopqrstuvwxyz\\\"\\n15 g$(2)=\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n20 g$(3)=\\\"0123456789\\\"\\n25 g$(4)=\\\"<>!@#$%^&*()[];:'.?/\\\"\\n30 print chr$(147);chr$(14)\\n35 print \\\"Password Generator\\\":print\\n40 print \\\"Press H for help, or any\\\":print \\\"other key to begin.\\\":print\\n45 get k$:if k$=\\\"\\\" then 45\\n50 if k$=\\\"h\\\" then gosub 500\\n60 print chr$(147)\\n65 input \\\"Enter password length: (6-30)\\\";pl\\n70 if pl<6 or pl>30 then print \\\"Out of range.\\\":goto 65\\n75 print:input \\\"How many passwords (1-20)\\\";np\\n80 if np<1 or np>20 then print \\\"Out of range.\\\":goto 75\\n85 if np>10 then dim pw$(np)\\n90 if np*pl > 100 then print:print \\\"Um... Ok, this might take a bit.\\\"\\n100 for pc=1 to np\\n105 for i=1 to 4:g(i)=0:next\\n110 tp$=\\\"\\\"\\n112 for i=1 to pl\\n115 cg=int(rnd(1)*4)+1\\n120 cc=int(rnd(1)*len(g$(cg)))+1\\n125 tp$=tp$+mid$(g$(cg),cc,1)\\n130 g(cg)=g(cg)+1\\n135 next i\\n140 for i=1 to 4\\n145 if g(i)=0 then goto 110\\n150 next i\\n155 pw$(pc)=tp$\\n160 next pc\\n200 print chr$(147);\\\"Password list:\\\":print\\n205 for pc=1 to np:print pc;chr$(157);\\\".\\\";tab(6);pw$(pc):next pc\\n210 print:print \\\"Again? (y/n)\\\";\\n215 get k$:if k$<>\\\"y\\\" and k$<>\\\"n\\\" then 215\\n220 if k$=\\\"y\\\" then clr:goto 10\\n225 end\\n500 rem *** help ***\\n505 print chr$(147);\\\"This program will generate a password\\\"\\n510 print \\\"made up of each of the following\\\"\\n515 print \\\"character types:\\\":print\\n520 print \\\" - Uppercase Letter (A-Z)\\\"\\n525 print \\\" - Lowercase Letter (a-z)\\\"\\n530 print \\\" - Number (0-9)\\\"\\n535 print \\\" - Punctuation and Other Symbols\\\"\\n540 print \\\" (e.g. # $ ! & [ . ;, etc.)\\\"\\n545 print\\n550 print \\\"You may choose how many total characters\\\";\\n555 print \\\"(up to 30) should be in the password, \\\"\\n560 print \\\"and how many passwords (up to 20) should\\\";\\n565 print \\\"be generated. The program ensures that \\\"\\n570 print \\\"there is at least one character from \\\"\\n575 print \\\"each of the character types in each \\\"\\n580 print \\\"password.\\\"\\n585 print\\n590 print \\\"Note: You can edit the character lists\\\"\\n595 print \\\"on lines 10-25 to customize the\\\"\\n600 print \\\"selection pool.\\\"\\n605 print\\n610 print \\\"Press any key to begin.\\\"\\n615 get k$:if k$=\\\"\\\" then 615\\n620 return\\n\",\n \"language\": \"Commodore-BASIC\"\n },\n {\n \"code\": \"(defvar *lowercase* '(#\\\\a #\\\\b #\\\\c #\\\\d #\\\\e #\\\\f #\\\\g #\\\\h #\\\\i #\\\\j #\\\\k #\\\\l #\\\\m\\n #\\\\n #\\\\o #\\\\p #\\\\q #\\\\r #\\\\s #\\\\t #\\\\u #\\\\v #\\\\w #\\\\x #\\\\y #\\\\z))\\n\\n(defvar *uppercase* '(#\\\\A #\\\\B #\\\\C #\\\\D #\\\\E #\\\\F #\\\\G #\\\\H #\\\\I #\\\\J #\\\\K #\\\\L #\\\\M\\n #\\\\N #\\\\O #\\\\P #\\\\Q #\\\\R #\\\\S #\\\\T #\\\\U #\\\\V #\\\\W #\\\\X #\\\\Y #\\\\Z))\\n\\n(defvar *numbers* '(#\\\\0 #\\\\1 #\\\\2 #\\\\3 #\\\\4 #\\\\5 #\\\\6 #\\\\7 #\\\\8 #\\\\9))\\n\\n(defvar *special-characters* '(#\\\\! #\\\\\\\\ #\\\\# #\\\\$ #\\\\% #\\\\& #\\\\' #\\\\( #\\\\) #\\\\*\\n #\\\\+ #\\\\, #\\\\- #\\\\. #\\\\/ #\\\\: #\\\\; #\\\\< #\\\\= #\\\\>\\n #\\\\? #\\\\@ #\\\\[ #\\\\] #\\\\^ #\\\\_ #\\\\{ #\\\\| #\\\\} #\\\\~))\\n\\n(defvar *similar-characters* '(#\\\\I #\\\\l #\\\\1 #\\\\| #\\\\O #\\\\0 #\\\\5 #\\\\S #\\\\2 #\\\\Z))\\n\\n(defun make-readable (s)\\n (remove-if (lambda (x) (member x *similar-characters*)) s))\\n\\n(defun shuffle-list (input-list)\\n (loop with l = (length input-list)\\n for i below l\\n do (rotatef (nth i input-list)\\n (nth (random l) input-list)))\\n input-list)\\n\\n(defun generate-password (len human-readable)\\n (let*\\n ((upper (if human-readable (make-readable *uppercase*) *uppercase*))\\n (lower (if human-readable (make-readable *lowercase*) *lowercase*))\\n (number (if human-readable (make-readable *numbers*) *numbers*))\\n (special (if human-readable (make-readable *special-characters*) *special-characters*))\\n (character-groups (list upper lower number special))\\n (initial-password (reduce (lambda (acc x)\\n (cons (nth (random (length x)) x) acc))\\n character-groups :initial-value NIL)))\\n\\n (coerce (shuffle-list (reduce (lambda (acc x)\\n (declare (ignore x))\\n (let ((group (nth (random (length character-groups)) character-groups)))\\n (cons (nth (random (length group)) group) acc)))\\n (make-list (- len 4)) :initial-value initial-password)) 'string)))\\n\\n(defun main (len count &optional human-readable)\\n (if (< len 4)\\n (print \\\"Length must be at least 4~%\\\")\\n (loop for x from 1 to count do\\n (print (generate-password len human-readable)))))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"require \\\"random/secure\\\"\\n\\nspecial_chars = true\\nsimilar = 0\\nrequire_groups = true\\nlength = 20\\ncount = 1\\n\\ndef show_usage\\n puts <<-USAGE\\n\\n Passwords generator\\n Usage: pass2 [count] [-l<length>] [-s{0|1|2}] [-ng] [-ns]\\n\\n count: number of passwords to be generated (default: 1)\\n -l<length>: length of passwords (default: 20)\\n -s{0|1|2}: exclude visually similar characters.\\n 0 - don't exclude (default)\\n 1 - exclude 0, O, 1, I, l, |\\n 2 - also exclude 2, Z, 5, S\\n -ng: don''t require password to include character from every group\\n -ns: don''t include special chars in password\\n\\n Default value of switches is choosen to match the task in page header, but I suggest to use the \\\"-s1 -ng -ns\\\".\\n USAGE\\nend\\n\\ncount_set = false\\nbegin\\n ARGV.each do |arg|\\n case arg\\n when /-l(\\\\d+)/\\n length = $1.to_i\\n raise \\\"Error: minimal length is 4\\\" if length < 4\\n when /-s(\\\\d)/\\n similar = $1.to_i\\n raise \\\"Error: minimal length is 4\\\" unless {0, 1, 2}.includes? similar\\n when /-ng/\\n require_groups = false\\n when /-ns/\\n special_chars = false\\n when /(\\\\d+)/\\n raise \\\"incorrect arguments\\\" if count_set\\n count_set = true\\n count = $1.to_i\\n else\\n raise \\\"incorrect argument\\\"\\n end\\n end\\nrescue ex\\n puts ex.message\\n show_usage\\n exit\\nend\\n\\n# actual program\\nGROUPS = [('a'..'z').to_a, ('A'..'Z').to_a, ('0'..'9').to_a]\\nGROUPS << \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\".chars if special_chars\\n\\nletters = GROUPS.flatten\\nletters -= \\\"1l|I0O\\\".chars if similar > 0\\nletters -= \\\"5S2Z\\\".chars if similar > 1\\n\\nloop do\\n s = Array(Char).new(length) { letters.sample(Random::Secure) }\\n # it's better to just discard in order to don't lose enthropy\\n next if require_groups && GROUPS.any? { |x| (s & x).size == 0 }\\n puts s.join\\n count -= 1\\n break if count <= 0\\nend\\n\",\n \"language\": \"Crystal\"\n },\n {\n \"code\": \"defmodule Password do\\n @lower Enum.map(?a..?z, &to_string([&1]))\\n @upper Enum.map(?A..?Z, &to_string([&1]))\\n @digit Enum.map(?0..?9, &to_string([&1]))\\n @other ~S\\\"\\\"\\\"\\n!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\n\\\"\\\"\\\" |> String.codepoints |> List.delete_at(-1)\\n @all @lower ++ @upper ++ @digit ++ @other\\n\\n def generator do\\n {len, num} = get_argv\\n Enum.each(1..num, fn _ ->\\n pswd = [Enum.random(@lower), Enum.random(@upper), Enum.random(@digit), Enum.random(@other)]\\n IO.puts generator(len-4, pswd)\\n end)\\n end\\n\\n def generator(0, pswd), do: Enum.shuffle(pswd) |> Enum.join\\n def generator(len, pswd), do: generator(len-1, [Enum.random(@all) | pswd])\\n\\n def get_argv do\\n {len,num} = case System.argv do\\n [\\\"?\\\"] -> usage\\n [] -> {8,1}\\n [len] -> {String.to_integer(len), 1}\\n [len,num] -> {String.to_integer(len), String.to_integer(num)}\\n _ -> usage\\n end\\n if len<4 or num<1, do: usage, else: {len,num}\\n end\\n\\n defp usage do\\n IO.puts [\\\"Password generator\\\\n\\\",\\n \\\"Usage: [password length(=8)] [number of passwords to generate(=1)]\\\"]\\n exit(:normal)\\n end\\nend\\n\\nPassword.generator\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"// A function to generate passwords of a given length. Nigel Galloway: May 2nd., 2018\\nlet N = (set)\\\"qwertyuiopasdfghjklzxcvbnm\\\"\\nlet I = (set)\\\"QWERTYUIOPASDFGHJKLZXCVBNM\\\"\\nlet G = (set)\\\"7894561230\\\"\\nlet E = (set)\\\"\\\"\\\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~[||]\\\"\\\"\\\"\\nlet L = Array.ofSeq (Set.unionMany [N;I;G;E])\\nlet y = System.Random 23\\nlet pWords n=\\n let fN n = not (Set.isEmpty (Set.intersect N n )||Set.isEmpty (Set.intersect I n )||Set.isEmpty (Set.intersect G n )||Set.isEmpty (Set.intersect E n ))\\n Seq.initInfinite(fun _->(set)(List.init n (fun _->L.[y.Next()%(Array.length L)])))|>Seq.filter fN|>Seq.map(Set.toArray >> System.String)\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"pWords 8 |> Seq.take 5 |> Seq.iter(printfn \\\"%s\\\")\\n\",\n \"language\": \"F-Sharp\"\n },\n {\n \"code\": \"USING: arrays assocs combinators command-line continuations io\\nkernel math math.parser multiline namespaces peg.ebnf\\nprettyprint random sequences ;\\nFROM: sets => without ;\\nIN: rosetta-code.password-generator\\n\\nSTRING: usage\\npassword-generator generates random passwords.\\n\\n Commands:\\n -l [int>=4] Set password length (required)\\n -c [int>0] Set password count (required)\\n -s [int] Set seed for random number generator\\n -x Exclude similar characters\\n [empty] Show this help\\n;\\n\\n! Parse command line arguments into assoc\\nEBNF: parse-args [=[\\n int = \\\"-\\\"? [0-9]+ => [[ concat sift string>number ]]\\n l = \\\"-l\\\" \\\" \\\"~ int ?[ 4 >= ]?\\n c = \\\"-c\\\" \\\" \\\"~ int ?[ 0 > ]?\\n s = \\\"-s\\\" \\\" \\\"~ int\\n x = \\\"-x\\\" => [[ 0 2array ]]\\n arg = l | c | s | x\\n args = arg ((\\\" \\\"~ arg)+)?\\n => [[ first2 [ 1array ] dip append ]]\\n]=]\\n\\nCONSTANT: similar {\\n \\\"abcdefghijklmnopqrstuvwxyz\\\"\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\n \\\"0123456789\\\"\\n \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n}\\n\\n: dissimilar ( -- seq ) similar [ \\\"Il1O05S2Z\\\" without ] map ;\\n\\n! Set seed if seed provided; otherwise use system rng.\\n: choose-rng ( args-assoc -- )\\n \\\"-s\\\" of [ [ random-generator get ] dip seed-random drop ]\\n [ system-random-generator get random-generator set ] if* ;\\n\\n: choose-character-set ( args-assoc -- seq )\\n \\\"-x\\\" of dissimilar similar ? ;\\n\\n! Create a \\\"base\\\" for a password; one character from each\\n! category.\\n: <base> ( seq -- str ) [ random ] \\\"\\\" map-as ;\\n\\n: password ( seq length -- str )\\n 4 - over concat [ random ] curry \\\"\\\" replicate-as\\n [ <base> ] dip append randomize ;\\n\\n: .passwords ( count seq length -- )\\n [ password print ] 2curry times ;\\n\\n: gen-pwds ( args-assoc -- )\\n {\\n [ choose-rng ]\\n [ \\\"-c\\\" of ]\\n [ choose-character-set ]\\n [ \\\"-l\\\" of ]\\n } cleave .passwords ;\\n\\n: main ( -- )\\n command-line get \\\" \\\" join\\n [ parse-args gen-pwds ] [ 2drop usage print ] recover ;\\n\\nMAIN: main\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Dim As String charS(4)\\ncharS(1) = \\\"0123456789\\\"\\ncharS(2) = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\ncharS(3) = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\ncharS(4) = \\\"!\\\"\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\ncharS(0) = charS(1) + charS(2) + charS(3) + charS(4)\\n\\n\\nDim As Integer howBig, howMany\\nDo\\n Print !\\\"------ Password Generator ------\\\\n\\\"\\n Input \\\"Longitud de la contrase¤a (n>=4): \\\", howBig\\n If howBig < 1 Then Sleep: End\\n\\n Input \\\"Cantidad de contrase¤as (n>=1): \\\", howMany\\nLoop While howMany < 1\\n\\nPrint !\\\"\\\\nGeneradas\\\"; howMany; \\\" contrase¤as de\\\"; howBig; \\\" caracteres\\\"\\n\\nDim As Integer i = 0\\nDim As String password, Ok, w\\nWhile i < howMany\\n\\tpassword = \\\"\\\"\\n Ok = \\\"....\\\"\\n For j As Integer = 1 To howBig\\n w = Mid(charS(0), Int(Rnd * Len(charS(0))) + 1, 1)\\n For k As Byte = 1 To 4\\n If Instr(charS(k), w) Then Ok = Left(Ok, k-1) + \\\"*\\\" + Mid(Ok, k+1)\\n Next k\\n password += w\\n Next j\\n If Ok = \\\"****\\\" Then\\n i += 1\\n Print Using \\\"##. &\\\"; i; password\\n End If\\nWend\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"output file \\\"Password Generator\\\"\\ninclude \\\"Tlbx GameplayKit.incl\\\"\\n\\nbegin enum\\n _mApplication\\n _mFile\\n _mEdit\\nend enum\\n\\nbegin enum 1\\n _iSeparator\\n _iPreferences\\nend enum\\n\\nbegin enum\\n _iCreate\\n _iSeparator2\\n _iSave\\n _iPrint\\n _iSeparator4\\n _iClose\\nend enum\\n\\n_window = 1\\nbegin enum output 1\\n _passwordScroll\\n _passwordView\\n _offscreenPrintView\\n _optionsHelp\\n _checkOmitIs\\n _checkOmitOs\\n _checkOmitSs\\n _checkOmit2s\\n _charactersLongLabel\\n _passwordLengthField\\n _pwAmountLabel\\n _pwAmountField\\n _seedLabel\\n _seedField\\n _helpBtn\\n _bottomLine\\n _saveBtn\\n _printBtn\\n _createPasswordsBtn\\nend enum\\n\\n_helpPopover = 2\\nbegin enum 1\\n _popoverLabel\\nend enum\\n\\n_savePanel = 1\\n_pwLenAlert = 2\\n\\n\\nvoid local fn BuildMenus\\n // application\\n menu _mApplication, _iSeparator\\n menu _mApplication, _iPreferences,, @\\\"Preferences…\\\", @\\\",\\\"\\n\\n // file\\n menu _mFile, -1,, @\\\"File\\\"\\n menu _mFile, _iCreate,, @\\\"Create passwords\\\", @\\\"p\\\"\\n menu _mFile, _iSeparator2\\n menu _mFile, _iSave,, @\\\"Save\\\", @\\\"s\\\"\\n menu _mFile, _iPrint,, @\\\"Print\\\", @\\\"p\\\"\\n menu _mFile, _iSeparator4\\n menu _mFile, _iClose,, @\\\"Close\\\", @\\\"w\\\"\\n MenuItemSetAction( _mFile, _iClose, @\\\"performClose:\\\" )\\n\\n editmenu _mEdit\\nend fn\\n\\nvoid local fn BuildWindow\\n long tag\\n\\n CGRect r = fn CGRectMake( 0, 0, 672, 460 )\\n window _window, @\\\"Rosetta Code Password Generator\\\", r//, NSWindowStyleMaskTitled + NSWindowStyleMaskClosable + NSWindowStyleMaskMiniaturizable\\n WindowSetContentMinSize( _window, fn CGSizeMake(310,386) )\\n\\n r = fn CGRectMake( 20, 73, 515, 370 )\\n scrollview _passwordScroll, r, NSLineBorder,,_window\\n ViewSetAutoresizingMask( _passwordScroll, NSViewWidthSizable + NSViewHeightSizable )\\n\\n textview _passwordView, r, _passwordScroll,, _window\\n TextViewSetTextContainerInset( _passwordView, fn CGSizeMake( 10, 15 ) )\\n TextSetFontWithName( _passwordView, @\\\"Menlo\\\", 13.0 )\\n\\n r = fn CGRectMake( -600, -600, 450, 405 )\\n textview _offscreenPrintView, r,,, _window\\n TextSetFontWithName( _offscreenPrintView, @\\\"Menlo\\\", 13.0 )\\n TextSetColor( _offscreenPrintView, fn ColorBlack )\\n TextViewSetBackgroundColor( _offscreenPrintView, fn ColorWhite )\\n\\n r = fn CGRectMake( 547, 424, 60, 16 )\\n textlabel _optionsHelp, @\\\"Exclude:\\\", r, _window\\n\\n r = fn CGRectMake( 607, 425, 41, 14 )\\n button _checkOmitIs, YES, NSControlStateValueOff, @\\\"Il1\\\", r, NSButtonTypeSwitch\\n ViewSetToolTip( _checkOmitIs, @\\\"Omit similar characters I, l and 1.\\\" )\\n r = fn CGRectOffset( r, 0, -24 )\\n button _checkOmitOs, YES ,NSControlStateValueOff, @\\\"O0\\\", r, NSButtonTypeSwitch\\n ViewSetToolTip( _checkOmitOs, @\\\"Omit similar characters O and 0.\\\" )\\n r = fn CGRectOffset( r, 0, -24 )\\n button _checkOmitSs, YES, NSControlStateValueOff, @\\\"5S\\\", r, NSButtonTypeSwitch\\n ViewSetToolTip( _checkOmitSs, @\\\"Omit similar characters 5 and S.\\\" )\\n r = fn CGRectOffset( r, 0, -24 )\\n button _checkOmit2s, YES, NSControlStateValueOff, @\\\"2Z\\\", r, NSButtonTypeSwitch\\n ViewSetToolTip( _checkOmit2s, @\\\"Omit similar characters 2 and Z.\\\" )\\n\\n r = fn CGRectMake( 549, 322, 103, 16 )\\n textlabel _charactersLongLabel, @\\\"Chars (4-50)\\\", r, _window\\n\\n r = fn CGRectMake( 549, 298, 103, 21 )\\n textfield _passwordLengthField, YES, @\\\"25\\\", r,_window\\n TextFieldSetBordered( _passwordLengthField, YES )\\n ControlSetAlignment(_passwordLengthField, NSTextAlignmentCenter )\\n ControlSetFormat( _passwordLengthField, @\\\"0123456789\\\", YES, 2, 0 )\\n ViewSetToolTip( _passwordLengthField, @\\\"Set password length from 4 to 50.\\\" )\\n\\n r = fn CGRectMake( 549, 263, 103, 16 )\\n textlabel _pwAmountLabel, @\\\"Passwords:\\\", r, _window\\n\\n r = fn CGRectMake( 549, 240, 103, 21 )\\n textfield _pwAmountField, YES, @\\\"100\\\", r,_window\\n TextFieldSetBordered( _pwAmountField, YES )\\n ControlSetAlignment( _pwAmountField, NSTextAlignmentCenter )\\n ControlSetFormat( _pwAmountField, @\\\"0123456789\\\", YES, 4, 0 )\\n ViewSetToolTip( _pwAmountField, @\\\"Enter number of passwords to generate.\\\" )\\n\\n r = fn CGRectMake( 549, 205, 103, 16 )\\n textlabel _seedLabel, @\\\"Seed value:\\\", r, _window\\n\\n r = fn CGRectMake( 549, 182, 103, 21 )\\n textfield _seedField, YES, , r,_window\\n TextFieldSetBordered( _seedField, YES )\\n ControlSetAlignment(_seedField, NSTextAlignmentCenter )\\n ControlSetFormat( _seedField, @\\\"0123456789\\\", YES, 6, 0 )\\n ViewSetToolTip( _seedField, @\\\"Enter optional random seed number.\\\" )\\n\\n for tag = _optionsHelp to _seedField\\n ViewSetAutoresizingMask( tag, NSViewMinXMargin + NSViewMinYMargin )\\n next\\n\\n r = fn CGRectMake( 631, 70, 25, 25 )\\n button _helpBtn, YES,,, r, NSButtonTypeMomentaryLight, NSBezelStyleHelpButton, _window\\n ViewSetToolTip( _helpBtn, @\\\"Click for application help instructions.\\\" )\\n ViewSetAutoresizingMask( _helpBtn, NSViewMinXMargin + NSViewMaxYMargin )\\n\\n r = fn CGRectMake( 20, 55, 632, 5 )\\n box _bottomline,, r, NSBoxSeparator\\n ViewSetAutoresizingMask( _bottomline, NSViewWidthSizable + NSViewMaxYMargin )\\n\\n r = fn CGRectMake( 20, 15, 62, 32 )\\n button _printBtn, YES, , @\\\"Print…\\\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\\n ViewSetAutoresizingMask( _printBtn, NSViewMaxXMargin + NSViewMaxYMargin )\\n\\n r = fn CGRectMake( 91, 15, 62, 32 )\\n button _saveBtn, YES, , @\\\"Save…\\\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\\n ViewSetAutoresizingMask( _saveBtn, NSViewMaxXMargin + NSViewMaxYMargin )\\n\\n r = fn CGRectMake( 522, 15, 131, 32 )\\n button _createPasswordsBtn, YES, , @\\\"Create passwords\\\", r, NSButtonTypeMomentaryLight, NSBezelStyleRegularSquare, _window\\n ViewSetAutoresizingMask( _createPasswordsBtn, NSViewMinXMargin + NSViewMaxYMargin )\\nend fn\\n\\nvoid local fn BuildPopover\\n CFStringRef helpText = @\\\"This application generates randomized passwords from 4 to 50 characters in length. \\\"\\n helpText = fn StringByAppendingString( helpText, @\\\"Theoretically, the number generated is limited only by system memory.\\\\n\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"Passwords will contain at least one each of the following character types:\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"\\\\tLowercase letters\\\\t\\\\t: a -> z\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"\\\\tUppercase letters\\\\t\\\\t: A -> Z\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"\\\\tNumbers\\\\t\\\\t\\\\t\\\\t: 0 -> 9\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"\\\\tSpecial characters\\\\t: !\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\\n\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"You can use checkboxes to exclude visually similar characters: Il1 O0 5S 2Z.\\\\n\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"This application offers two automatic levels of randomization. However you are \\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"welcome to enter a custom randomizer seed number in the box provided.\\\\n\\\\n\\\" )\\n helpText = fn StringByAppendingString( helpText, @\\\"Passwords can be copied to the pasteboard, saved to a text file, or printed.\\\" )\\n popover _helpPopover, (0,0,395,365), NSPopoverBehaviorTransient\\n textlabel _popoverLabel, helpText, (10,10,375,345)\\nend fn\\n\\nvoid local fn OutOfBoundsAlert\\n CFStringRef alertStr = @\\\"Passwords must be at least four characters long, but no more than 50 characters.\\\"\\n\\n alert -_pwLenAlert,, @\\\"Password length is out of bounds\\\", alertStr, @\\\"Okay\\\", YES\\n AlertButtonSetKeyEquivalent( _pwLenAlert, 1, @\\\"\\\\e\\\" )\\n AlertSetStyle( _pwLenAlert, NSAlertStyleWarning )\\n alert _pwLenAlert\\nend fn\\n\\n\\nlocal fn BuildPassword as CFStringRef\\n long i\\n CFArrayRef charArr = fn AppProperty( @\\\"charArray\\\" )\\n CFStringRef numbers = charArr[0]\\n CFStringRef uppercase = charArr[1]\\n CFStringRef lowercase = charArr[2]\\n CFStringRef symbols = charArr[3]\\n\\n // Omit confusing letters selected by user, if any\\n if ( fn ButtonState( _checkOmitIs ) == NSControlStateValueOn )\\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\\\"1\\\", @\\\"\\\" )\\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\\\"I\\\", @\\\"\\\" )\\n lowercase = fn StringByReplacingOccurrencesOfString( lowercase, @\\\"l\\\", @\\\"\\\" )\\n end if\\n\\n if ( fn ButtonState( _checkOmitOs ) == NSControlStateValueOn )\\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\\\"0\\\", @\\\"\\\" )\\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\\\"O\\\", @\\\"\\\" )\\n end if\\n\\n if( fn ButtonState( _checkOmitSs ) == NSControlStateValueOn )\\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\\\"5\\\", @\\\"\\\" )\\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\\\"S\\\", @\\\"\\\" )\\n end if\\n\\n if ( fn ButtonState( _checkOmit2s ) == NSControlStateValueOn )\\n numbers = fn StringByReplacingOccurrencesOfString( numbers, @\\\"2\\\", @\\\"\\\" )\\n uppercase = fn StringByReplacingOccurrencesOfString( uppercase, @\\\"Z\\\", @\\\"\\\" )\\n end if\\n\\n // Build string pool from other character sets\\n CFStringRef allChars = fn StringWithFormat( @\\\"%@%@%@%@\\\", numbers, uppercase, lowercase, symbols )\\n\\n // Begin construction password string with single random character from each character set\\n randomize\\n CFMutableStringRef pwStr = fn MutableStringWithCapacity(0)\\n CFStringRef rndNumberChar = fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtindex( numbers, rnd( len( numbers ) -1 ) ) )\\n CFStringRef rndUCaseChar = fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtindex( uppercase, rnd( len( uppercase ) -1 ) ) )\\n CFStringRef rndLCaseChar = fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtindex( lowercase, rnd( len( lowercase ) -1 ) ) )\\n CFStringRef rndSymbolChar = fn StringWithFormat( @\\\"%c\\\", fn StringCharacterAtindex( symbols, rnd( len( symbols ) -1 ) ) )\\n\\n // Add first four randomized characters to password string\\n MutableStringAppendString( pwStr, fn StringWithFormat( @\\\"%@%@%@%@\\\", rndNumberChar, rndUCaseChar, rndLCaseChar, rndSymbolChar ) )\\n\\n // Build array of characters for shuffling\\n CFMutableArrayRef mutArr = fn MutableArrayWithCapacity(0)\\n for i = 0 to len(allChars) - 1\\n unichar tempUni = fn StringCharacterAtIndex( allChars, i )\\n CFStringRef s = fn StringWithFormat( @\\\"%c\\\", tempUni )\\n MutableArrayInsertObjectAtIndex( mutArr, s, i )\\n next\\n\\n // Shuffle character array for randomness\\n CFArrayRef rndStrArr = fn GKRandomSourceArrayByShufflingObjectsInArray( fn GKRandomSourceInit, mutArr )\\n CFStringRef rndStr = fn ArrayComponentsJoinedByString( rndStrArr, @\\\"\\\" )\\n\\n long pwLength = fn StringIntegerValue( fn ControlStringValue( _passwordLengthField ) )\\n\\n // Subtract 4 for mandatory charaacters already set\\n rndStr = fn StringSubstringToIndex( rndStr, pwLength - 4 )\\n MutableStringAppendString( pwStr, rndStr )\\nend fn = pwStr\\n\\n\\nvoid local fn RandomizeWithSeed\\n CFStringRef seedStr = fn ControlStringValue( _seedField )\\n\\n if ( len(seedStr) > 0 )\\n long seedNum = fn StringIntegerValue( seedStr )\\n randomize seedNum\\n else\\n exit fn\\n end if\\nend fn\\n\\n\\nvoid local fn CreatePasswords\\n NSInteger i\\n CFMutableStringRef passwords = fn MutableStringWithCapacity(0)\\n long numberNeeded = fn StringIntegerValue( fn ControlStringValue( _pwAmountField ) )\\n\\n // Get length of password designated by user\\n long pwLength = fn StringIntegerValue( fn ControlStringValue( _passwordLengthField ) )\\n\\n if ( pwLength > 50 ) or ( pwLength < 4 )\\n fn OutOfBoundsAlert : exit fn\\n end if\\n\\n fn RandomizeWithSeed\\n\\n for i = 1 to numberNeeded\\n MutableStringAppendString( passwords, fn StringWithFormat( @\\\"%4d. %@%@\\\\n\\\", i, fn BuildPassword, @\\\"\\\\n\\\" ) )\\n next\\n TextSetString( _passwordView, passwords )\\nend fn\\n\\n\\nvoid local fn SaveFile\\n savepanel -_savePanel, @\\\"Save file...\\\", @\\\"public.plain-text\\\",,,, _true\\n SavePanelSetCanCreateDirectories( _savePanel, YES )\\n SavePanelSetAllowedFileTypes( _savePanel, @[@\\\"txt\\\"] )\\n SavePanelSetExtensionHidden( _savePanel, NO )\\n // Run savepanel; action captured in fn DoDialog\\n savepanel _savePanel\\nend fn\\n\\n\\nvoid local fn SetViewText( url as CFURLRef )\\n CFStringRef tempStr = fn StringWithContentsOfURL( url, NSUTF8StringEncoding, NULL )\\n WindowSetTitleWithRepresentedURL( _window, url )\\n TextSetString( _passwordView, tempStr )\\nend fn\\n\\n\\nvoid local fn PrintView( tag as long )\\n TextSetString( _offscreenPrintView, fn TextString( tag ) )\\n ViewPrint( _offscreenPrintView )\\nend fn\\n\\n// Build character arrays at launch and save as application property\\nvoid local fn CreateCharactersDictionary\\n CFArrayRef charArray = @[¬\\n @\\\"0123456789\\\",¬\\n @\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",¬\\n @\\\"abcdefghijklmnopqrstuvwxyz\\\",¬\\n @\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"]\\n AppSetProperty( @\\\"charArray\\\", charArray )\\nend fn\\n\\n\\nvoid local fn DoAppEvent( ev as long )\\n select (ev)\\n case _appDidFinishLaunching\\n fn CreateCharactersDictionary\\n fn BuildMenus\\n fn BuildPopover\\n fn BuildWindow\\n case _appShouldTerminateAfterLastWindowClosed\\n AppEventSetBool(YES)\\n end select\\nend fn\\n\\n\\nvoid local fn DoMenu( menuID as long, itemID as long )\\n select (menuID)\\n case _mApplication\\n select (itemID)\\n case _iPreferences // show preferences window\\n end select\\n case _mFile\\n select (itemID)\\n case _iCreate : fn CreatePasswords\\n case _iSave : fn SaveFile\\n case _iPrint : fn PrintView( _passwordView )\\n end select\\n end select\\nend fn\\n\\n\\nvoid local fn DoDialog( ev as NSInteger, tag as NSInteger, wnd as NSInteger, obj as CFTypeRef )\\n select ( ev )\\n case _btnClick\\n select ( tag )\\n case _createPasswordsBtn : fn CreatePasswords\\n case _saveBtn : fn SaveFile\\n case _printBtn : fn PrintView( _passwordView )\\n case _helpBtn : PopoverShow( _helpPopover, CGRectZero, _helpBtn, CGRectMaxXEdge )\\n end select\\n end select\\nend fn\\n\\non appEvent fn DoAppEvent\\non menu fn DoMenu\\non dialog fn DoDialog\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"' Gambas module file\\n\\n' INSTRUCTIONS\\n' I have not used a GUI as you could not run this in the 'Gambas Playground'\\n' Click on the link above to run this program\\n' The user can specify the password length and the number of passwords\\n' to generate by altering the values of the 2 lines below.\\n\\nPublic Sub Main()\\nDim siPasswordLength As Short = 20 'Password length\\nDim siPasswordQuantity As Short = 20 'Password quantity\\nDim sLower As String = \\\"abcdefghijklmnopqrstuvwxyz\\\" 'Lower case characters\\nDim sUpper As String = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\" 'Upper case characters\\nDim sNumber As String = \\\"1234567890\\\" 'Numbers\\nDim sOther As String = \\\"'!#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" & Chr(34) 'Other characters + quote\\nDim sNoGo As String[] = [\\\"I1\\\", \\\"1I\\\", \\\"l1\\\", \\\"1l\\\", \\\"Il\\\",\\n \\\"lI\\\", \\\"O0\\\", \\\"0O\\\", \\\"S5\\\", \\\"5S\\\", \\\"Z2\\\", \\\"2Z\\\"] 'Undesirable string combinations (can be added to if required)\\nDim sData As String = sLower & sUpper & sNumber & sOther 'Create 1 string to pick the password characters from\\nDim sToCheck, sPassword As String 'To hold a possible password for checking, to hold the passwords\\nDim siCount, siLoop, siCounter As Short 'Various counters\\nDim bPass As Boolean 'To Pass or not to Pass!\\n\\nFor siCount = 1 To siPasswordQuantity 'Loop the amount of passwords required\\n For siLoop = 1 To siPasswordLength 'Loop for each charater of the required length\\n sToCheck &= Mid(sData, Rand(1, Len(sData)), 1) 'Get a random character from sData\\n Next\\n\\n bPass = False 'Set bPass to False\\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\\n If InStr(sLower, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If a LOWER CASE letter is included set bPass to True\\n Next\\n\\n If bPass Then 'If bPass is True then\\n bPass = False 'bPass is False\\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\\n If InStr(sUpper, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If an UPPER CASE letter is included set bPass to True\\n Next\\n End If\\n\\n If bPass Then 'If bPass is True then\\n bPass = False 'bPass is False\\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\\n If InStr(sNumber, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If a NUMBER is included set bPass to True\\n Next\\n End If\\n\\n If bPass Then 'If bPass is True then\\n bPass = False 'bPass is False\\n For siCounter = 1 To Len(sToCheck) 'Loop through each character in the generated password\\n If InStr(sOther, Mid(sToCheck, siCounter, 1)) Then bPass = True 'If an 'OTHER CHARACTER' is included set bPass to True\\n Next\\n End If\\n\\n If bPass Then\\n For siCounter = 1 To sNoGo.Max 'Loop through each undesirable strings e.g. \\\"0O\\\"\\n If InStr(sToCheck, sNoGo[siCounter]) Then bPass = False 'If an undesirable combination is located then set bPass to False\\n Next\\n Endif\\n\\n If bPass = True Then 'If bPass is True (all checks have been passed) then\\n sPassword &= sToCheck & gb.NewLine 'Add the new password to sPassword with a newline\\n Else 'Else\\n Dec siCount 'Decrease the loop counter by one\\n Endif\\n sToCheck = \\\"\\\" 'Clear sToCheck\\nNext\\n\\nPrint sPassword 'Print the password list\\n\\nEnd\\n\",\n \"language\": \"Gambas\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"crypto/rand\\\"\\n\\t\\\"math/big\\\"\\n\\t\\\"strings\\\"\\n\\t\\\"flag\\\"\\n\\t\\\"math\\\"\\n \\\"fmt\\\"\\n)\\n\\nvar lowercase = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nvar uppercase = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nvar numbers = \\\"0123456789\\\"\\nvar signs = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\nvar similar = \\\"Il1O05S2Z\\\"\\n\\nfunc check(e error){\\n\\tif e != nil {\\n\\t\\tpanic(e)\\n\\t}\\n}\\n\\nfunc randstr(length int, alphastr string) string{\\n\\talphabet := []byte(alphastr)\\n\\tpass := make([]byte,length)\\n\\tfor i := 0; i < length; i++ {\\n\\t\\tbign, err := rand.Int(rand.Reader, big.NewInt(int64(len(alphabet))))\\n\\t\\tcheck(err)\\n\\t\\tn := bign.Int64()\\n\\t\\tpass[i] = alphabet[n]\\n\\t}\\n\\treturn string(pass)\\n}\\n\\nfunc verify(pass string,checkUpper bool,checkLower bool, checkNumber bool, checkSign bool) bool{\\n\\tisValid := true\\n\\tif(checkUpper){\\n\\t\\tisValid = isValid && strings.ContainsAny(pass,uppercase)\\n\\t}\\n\\tif(checkLower){\\n\\t\\tisValid = isValid && strings.ContainsAny(pass,lowercase)\\n\\t}\\n\\tif(checkNumber){\\n\\t\\tisValid = isValid && strings.ContainsAny(pass,numbers)\\n\\t}\\n\\tif(checkSign){\\n\\t\\tisValid = isValid && strings.ContainsAny(pass,signs)\\n\\t}\\n\\treturn isValid\\n}\\n\\n\\nfunc main() {\\n\\tpassCount := flag.Int(\\\"pc\\\", 6, \\\"Number of passwords\\\")\\n\\tpassLength := flag.Int(\\\"pl\\\", 10, \\\"Passwordlength\\\")\\n\\tuseUpper := flag.Bool(\\\"upper\\\", true, \\\"Enables or disables uppercase letters\\\")\\n\\tuseLower := flag.Bool(\\\"lower\\\", true, \\\"Enables or disables lowercase letters\\\")\\n\\tuseSign := flag.Bool(\\\"sign\\\", true, \\\"Enables or disables signs\\\")\\n\\tuseNumbers := flag.Bool(\\\"number\\\", true, \\\"Enables or disables numbers\\\")\\n\\tuseSimilar := flag.Bool(\\\"similar\\\", true,\\\"Enables or disables visually similar characters\\\")\\n\\tflag.Parse()\\n\\n\\tpassAlphabet := \\\"\\\"\\n\\tif *useUpper {\\n\\t\\tpassAlphabet += uppercase\\n\\t}\\n\\tif *useLower {\\n\\t\\tpassAlphabet += lowercase\\n\\t}\\n\\tif *useSign {\\n\\t\\tpassAlphabet += signs\\n\\t}\\n\\tif *useNumbers {\\n\\t\\tpassAlphabet += numbers\\n\\t}\\n\\tif !*useSimilar {\\n\\t\\tfor _, r := range similar{\\n\\t\\t\\tpassAlphabet = strings.Replace(passAlphabet,string(r),\\\"\\\", 1)\\n\\t\\t}\\n\\t}\\n\\tfmt.Printf(\\\"Generating passwords with an average entropy of %.1f bits \\\\n\\\", math.Log2(float64(len(passAlphabet))) * float64(*passLength))\\n\\tfor i := 0; i < *passCount;i++{\\n\\t\\tpassFound := false\\n\\t\\tpass := \\\"\\\"\\n\\t\\tfor(!passFound){\\n\\t\\t\\tpass = randstr(*passLength,passAlphabet)\\n\\t\\t\\tpassFound = verify(pass,*useUpper,*useLower,*useNumbers,*useSign)\\n\\t\\t}\\n\\t\\tfmt.Println(pass)\\n\\t}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Control.Monad\\nimport Control.Monad.Random\\nimport Data.List\\n\\npassword :: MonadRandom m => [String] -> Int -> m String\\npassword charSets n = do\\n parts <- getPartition n\\n chars <- zipWithM replicateM parts (uniform <$> charSets)\\n shuffle (concat chars)\\n where\\n getPartition n = adjust <$> replicateM (k-1) (getRandomR (1, n `div` k))\\n k = length charSets\\n adjust p = (n - sum p) : p\\n\\nshuffle :: (Eq a, MonadRandom m) => [a] -> m [a]\\nshuffle [] = pure []\\nshuffle lst = do\\n x <- uniform lst\\n xs <- shuffle (delete x lst)\\n return (x : xs)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import Options\\n\\ndata Opts = Opts { optLength :: Int\\n , optCount :: Int\\n , optReadable :: Bool }\\n\\ninstance Options Opts where\\n defineOptions = Opts <$>\\n simpleOption \\\"length\\\" 8 \\\"password length\\\" <*>\\n simpleOption \\\"count\\\" 1 \\\"number of passwords to be generated\\\" <*>\\n simpleOption \\\"readable\\\" False \\\"Whether to use only readable characters\\\"\\n\\nmain = runCommand $ \\\\opts args -> do\\n let n = optCount opts\\n l = optLength opts\\n s = if (optReadable opts)\\n then zipWith (\\\\\\\\) charSets visualySimilar\\n else charSets\\n res <- replicateM n (password s (max 4 l))\\n mapM_ putStrLn res\\n where\\n charSets = [ ['a'..'z']\\n , ['A'..'Z']\\n , ['0'..'9']\\n , \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" ]\\n\\n visualySimilar = [\\\"l\\\",\\\"IOSZ\\\",\\\"012\\\",\\\"!|.,\\\"]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"thru=: <. + i.@(+*)@-~\\nchr=: a.&i.\\n\\nlower=: 'a' thru&.chr 'z'\\nupper=: 'A' thru&.chr 'Z'\\ndigit=: '0' thru&.chr '9'\\nother=: ('!' thru&.chr '~')-.lower,upper,digit,'`\\\\'\\nall=: lower,upper,digit,other\\n\\npwgen =:verb define\\\"0 :: pwhelp\\n NB. pick one of each, remainder from all, then shuffle\\n (?~y) { (?@# { ])every lower;upper;digit;other;(y-4)#<all\\n:\\n pwgen x#y\\n)\\n\\npwhelp =:echo bind (noun define)\\n [x] pwgen y - generates passwords of length y\\n optional x says how many to generate (if you want more than 1)\\n\\n y must be at least 4 because\\n passwords must contain four different kinds of characters.\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" pwgen'help'\\n [x] pwgen y - generates passwords of length y\\n optional x says how many to generate (if you want more than 1)\\n\\n y must be at least 4 because\\n passwords must contain four different kinds of characters.\\n\\n pwgen 10\\nS%\\\"x8X0}:K\\n 5 pwgen 10\\n+u.9(XDM.O\\n]a@Yb6j~DI\\nOo?|2oc4yi\\n9V9[EJ:Txs\\n$vYd(>4L:m\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class PasswordGenerator {\\n final static Random rand = new Random();\\n\\n public static void main(String[] args) {\\n int num, len;\\n\\n try {\\n if (args.length != 2)\\n throw new IllegalArgumentException();\\n\\n len = Integer.parseInt(args[0]);\\n if (len < 4 || len > 16)\\n throw new IllegalArgumentException();\\n\\n num = Integer.parseInt(args[1]);\\n if (num < 1 || num > 10)\\n throw new IllegalArgumentException();\\n\\n for (String pw : generatePasswords(num, len))\\n System.out.println(pw);\\n\\n } catch (IllegalArgumentException e) {\\n String s = \\\"Provide the length of the passwords (min 4, max 16) you \\\"\\n + \\\"want to generate,\\\\nand how many (min 1, max 10)\\\";\\n System.out.println(s);\\n }\\n }\\n\\n private static List<String> generatePasswords(int num, int len) {\\n final String s = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\";\\n\\n List<String> result = new ArrayList<>();\\n\\n for (int i = 0; i < num; i++) {\\n StringBuilder sb = new StringBuilder();\\n sb.append(s.charAt(rand.nextInt(s.length())));\\n sb.append((char) (rand.nextInt(10) + '0'));\\n sb.append((char) (rand.nextInt(26) + 'a'));\\n sb.append((char) (rand.nextInt(26) + 'A'));\\n\\n for (int j = 4; j < len; j++) {\\n int r = rand.nextInt(93) + '!';\\n if (r == 92 || r == 96) {\\n j--;\\n } else {\\n sb.append((char) r);\\n }\\n }\\n result.add(shuffle(sb));\\n }\\n return result;\\n }\\n\\n public static String shuffle(StringBuilder sb) {\\n int len = sb.length();\\n for (int i = len - 1; i > 0; i--) {\\n int r = rand.nextInt(i);\\n char tmp = sb.charAt(i);\\n sb.setCharAt(i, sb.charAt(r));\\n sb.setCharAt(r, tmp);\\n }\\n return sb.toString();\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"String.prototype.shuffle = function() {\\n return this.split('').sort(() => Math.random() - .5).join('');\\n}\\n\\nfunction createPwd(opts = {}) {\\n let len = opts.len || 5, // password length\\n num = opts.num || 1, // number of outputs\\n noSims = opts.noSims == false ? false : true, // exclude similar?\\n out = [],\\n cur, i;\\n\\n let chars = [\\n 'abcdefghijkmnopqrstuvwxyz'.split(''),\\n 'ABCDEFGHJKLMNPQRTUVWXY'.split(''),\\n '346789'.split(''),\\n '!\\\"#$%&()*+,-./:;<=>?@[]^_{|}'.split('')\\n ];\\n\\n if (!noSims) {\\n chars[0].push('l');\\n chars[1] = chars[1].concat('IOSZ'.split(''));\\n chars[2] = chars[2].concat('1250'.split(''));\\n }\\n\\n if (len < 4) {\\n console.log('Password length changed to 4 (minimum)');\\n len = 4;\\n }\\n\\n while (out.length < num) {\\n cur = '';\\n // basic requirement\\n for (i = 0; i < 4; i++)\\n cur += chars[i][Math.floor(Math.random() * chars[i].length)];\\n\\n while (cur.length < len) {\\n let rnd = Math.floor(Math.random() * chars.length);\\n cur += chars[rnd][Math.floor(Math.random() * chars[rnd].length)];\\n }\\n out.push(cur);\\n }\\n\\n for (i = 0; i < out.length; i++) out[i] = out[i].shuffle();\\n\\n if (out.length == 1) return out[0];\\n return out;\\n}\\n\\n// testing\\nconsole.log( createPwd() );\\nconsole.log( createPwd( {len: 20}) );\\nconsole.log( createPwd( {len: 20, num: 2}) );\\nconsole.log( createPwd( {len: 20, num: 2, noSims: false}) );\\n\",\n \"language\": \"JavaScript\"\n },\n {\n \"code\": \"# Output: a prn in range(0;$n) where $n is `.`\\ndef prn:\\n if . == 1 then 0\\n else . as $n\\n | ([1, (($n-1)|tostring|length)]|max) as $w\\n | [limit($w; inputs)] | join(\\\"\\\") | tonumber\\n | if . < $n then . else ($n | prn) end\\n end;\\n\\n# Input: an array\\n# Output: an array, being a selection of $k elements from . chosen with replacement\\ndef prns($k):\\n . as $in\\n | length as $n\\n | [range(0; $k) | $in[$n|prn]];\\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;\\n\\n# Generate a single password of length $len >= 4;\\n# certain confusable characters are only allowed iff $simchars is truthy.\\ndef passgen($len; $simchars):\\n def stoa: explode | map([.]|implode);\\n\\n if $len < 4 then \\\"length must be at least 4\\\" | error\\n else\\n { DIGIT: (\\\"0123456789\\\" | stoa),\\n UPPER: [range(65;91) | [.] | implode], # A-Z\\n LOWER: [range(97;123) | [.] | implode], # a-z\\n OTHER: (\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" | stoa) }\\n | if $simchars|not\\n then .DIGIT |= . - [\\\"0\\\", \\\"1\\\", \\\"2\\\", \\\"5\\\"]\\n | .UPPER |= . - [\\\"O\\\", \\\"I\\\", \\\"Z\\\", \\\"S\\\"]\\n | .LOWER |= . - [\\\"l\\\"]\\n end\\n | (reduce (.DIGIT, .UPPER, .LOWER, .OTHER) as $set ([];\\n . + ($set | prns(1)))) +\\n (.DIGIT + .UPPER + .LOWER + .OTHER | prns($len - 4))\\n | knuthShuffle\\n | join(\\\"\\\")\\n end ;\\n\\ndef passgen($len):\\n passgen($len; true);\\n\\n# Generate a stream of $npass passwords, each of length $len;\\n# certain confusable characters are only allowed iff $simchars is truthy.\\ndef passgen($len; $npass; $seed; $simchars):\\n if ($seed | type) == \\\"number\\\" and $seed > 0 then $seed | prn else null end\\n | range(0; $npass)\\n | passgen($len; $simchars) ;\\n\\n\\n### Examples:\\n\\\"Without restriction:\\\", passgen(12; 5; null; true),\\n\\\"\\\",\\n\\\"Certain confusable characters are disallowed:\\\", passgen(12; 5; null; false)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"function passgen(len::Integer; simchars::Bool=true)::String\\n if len < 4; error(\\\"length must be at least 4\\\") end\\n # Definitions\\n DIGIT = collect('0':'9')\\n UPPER = collect('A':'Z')\\n LOWER = collect('a':'z')\\n OTHER = collect(\\\"!\\\\\\\"#\\\\$%&'()*+,-./:;<=>?@[]^_{|}~\\\")\\n if !simchars\\n setdiff!(DIGIT, ['0', '1', '2', '5'])\\n setdiff!(UPPER, ['O', 'I', 'Z', 'S'])\\n setdiff!(LOWER, [ 'l'])\\n end\\n ALL = union(DIGIT, UPPER, LOWER, OTHER)\\n\\n chars = collect(rand(set) for set in (DIGIT, UPPER, LOWER, OTHER))\\n len -= 4\\n append!(chars, rand(ALL, len))\\n\\n return join(shuffle!(chars))\\nend\\n\\nfunction passgen(io::IO, len::Int=8, npass::Int=1; seed::Int=-1, simchars::Bool=true)::Vector{String}\\n if seed > -1; srand(seed) end\\n passwords = collect(passgen(len; simchars=simchars) for i in 1:npass)\\n writedlm(io, passwords, '\\\\n')\\n return passwords\\nend\\n\\npassgen(stdout, 10, 12; seed = 1)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.4-3\\n\\nimport java.util.Random\\nimport java.io.File\\n\\nval r = Random()\\nval rr = Random() // use a separate generator for shuffles\\nval ls = System.getProperty(\\\"line.separator\\\")\\n\\nvar lower = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nvar upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nvar digit = \\\"0123456789\\\"\\nvar other = \\\"\\\"\\\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\\"\\\"\\n\\nval exclChars = arrayOf(\\n \\\"'I', 'l' and '1'\\\",\\n \\\"'O' and '0' \\\",\\n \\\"'5' and 'S' \\\",\\n \\\"'2' and 'Z' \\\"\\n)\\n\\nfun String.shuffle(): String {\\n val sb = StringBuilder(this)\\n var n = sb.length\\n while (n > 1) {\\n val k = rr.nextInt(n--)\\n val t = sb[n]\\n sb[n] = sb[k]\\n sb[k] = t\\n }\\n return sb.toString()\\n}\\n\\nfun generatePasswords(pwdLen: Int, pwdNum: Int, toConsole: Boolean, toFile: Boolean) {\\n val sb = StringBuilder()\\n val ll = lower.length\\n val ul = upper.length\\n val dl = digit.length\\n val ol = other.length\\n val tl = ll + ul + dl + ol\\n var fw = if (toFile) File(\\\"pwds.txt\\\").writer() else null\\n\\n if (toConsole) println(\\\"\\\\nThe generated passwords are:\\\")\\n for (i in 0 until pwdNum) {\\n sb.setLength(0)\\n sb.append(lower[r.nextInt(ll)])\\n sb.append(upper[r.nextInt(ul)])\\n sb.append(digit[r.nextInt(dl)])\\n sb.append(other[r.nextInt(ol)])\\n\\n for (j in 0 until pwdLen - 4) {\\n val k = r.nextInt(tl)\\n sb.append(when (k) {\\n in 0 until ll -> lower[k]\\n in ll until ll + ul -> upper[k - ll]\\n in ll + ul until tl - ol -> digit[k - ll - ul]\\n else -> other[tl - 1 - k]\\n })\\n }\\n var pwd = sb.toString()\\n repeat(5) { pwd = pwd.shuffle() } // shuffle 5 times say\\n if (toConsole) println(\\\" ${\\\"%2d\\\".format(i + 1)}: $pwd\\\")\\n if (toFile) {\\n fw!!.write(pwd)\\n if (i < pwdNum - 1) fw.write(ls)\\n }\\n }\\n if (toFile) {\\n println(\\\"\\\\nThe generated passwords have been written to the file pwds.txt\\\")\\n fw!!.close()\\n }\\n}\\n\\nfun printHelp() {\\n println(\\\"\\\"\\\"\\n |This program generates up to 99 passwords of between 5 and 20 characters in\\n |length.\\n |\\n |You will be prompted for the values of all parameters when the program is run\\n |- there are no command line options to memorize.\\n |\\n |The passwords can either be written to the console or to a file (pwds.txt),\\n |or both.\\n |\\n |The passwords must contain at least one each of the following character types:\\n | lower-case letters : a -> z\\n | upper-case letters : A -> Z\\n | digits : 0 -> 9\\n | other characters : !\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\n |\\n |Optionally, a seed can be set for the random generator\\n |(any non-zero Long integer) otherwise the default seed will be used.\\n |Even if the same seed is set, the passwords won't necessarily be exactly\\n |the same on each run as additional random shuffles are always performed.\\n |\\n |You can also specify that various sets of visually similar characters\\n |will be excluded (or not) from the passwords, namely: Il1 O0 5S 2Z\\n |\\n |Finally, the only command line options permitted are -h and -help which\\n |will display this page and then exit.\\n |\\n |Any other command line parameters will simply be ignored and the program\\n |will be run normally.\\n |\\n \\\"\\\"\\\".trimMargin())\\n}\\n\\nfun main(args: Array<String>) {\\n if (args.size == 1 && (args[0] == \\\"-h\\\" || args[0] == \\\"-help\\\")) {\\n printHelp()\\n return\\n }\\n\\n println(\\\"Please enter the following and press return after each one\\\")\\n\\n var pwdLen: Int?\\n do {\\n print(\\\" Password length (5 to 20) : \\\")\\n pwdLen = readLine()!!.toIntOrNull() ?: 0\\n }\\n while (pwdLen !in 5..20)\\n\\n var pwdNum: Int?\\n do {\\n print(\\\" Number to generate (1 to 99) : \\\")\\n pwdNum = readLine()!!.toIntOrNull() ?: 0\\n }\\n while (pwdNum !in 1..99)\\n\\n var seed: Long?\\n do {\\n print(\\\" Seed value (0 to use default) : \\\")\\n seed = readLine()!!.toLongOrNull()\\n }\\n while (seed == null)\\n if (seed != 0L) r.setSeed(seed)\\n\\n println(\\\" Exclude the following visually similar characters\\\")\\n for (i in 0..3) {\\n var yn: String\\n do {\\n print(\\\" ${exclChars[i]} y/n : \\\")\\n yn = readLine()!!.toLowerCase()\\n }\\n while (yn != \\\"y\\\" && yn != \\\"n\\\")\\n if (yn == \\\"y\\\") {\\n when (i) {\\n 0 -> {\\n upper = upper.replace(\\\"I\\\", \\\"\\\")\\n lower = lower.replace(\\\"l\\\", \\\"\\\")\\n digit = digit.replace(\\\"1\\\", \\\"\\\")\\n }\\n\\n 1 -> {\\n upper = upper.replace(\\\"O\\\", \\\"\\\")\\n digit = digit.replace(\\\"0\\\", \\\"\\\")\\n }\\n\\n 2 -> {\\n upper = upper.replace(\\\"S\\\", \\\"\\\")\\n digit = digit.replace(\\\"5\\\", \\\"\\\")\\n }\\n\\n 3 -> {\\n upper = upper.replace(\\\"Z\\\", \\\"\\\")\\n digit = digit.replace(\\\"2\\\", \\\"\\\")\\n }\\n }\\n }\\n }\\n\\n var toConsole: Boolean?\\n do {\\n print(\\\" Write to console y/n : \\\")\\n val t = readLine()!!\\n toConsole = if (t == \\\"y\\\") true else if (t == \\\"n\\\") false else null\\n }\\n while (toConsole == null)\\n\\n var toFile: Boolean? = true\\n if (toConsole) {\\n do {\\n print(\\\" Write to file y/n : \\\")\\n val t = readLine()!!\\n toFile = if (t == \\\"y\\\") true else if (t == \\\"n\\\") false else null\\n }\\n while (toFile == null)\\n }\\n\\n generatePasswords(pwdLen!!, pwdNum!!, toConsole, toFile!!)\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function randPW (length)\\n local index, pw, rnd = 0, \\\"\\\"\\n local chars = {\\n \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n \\\"0123456789\\\",\\n \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n }\\n repeat\\n index = index + 1\\n rnd = math.random(chars[index]:len())\\n if math.random(2) == 1 then\\n pw = pw .. chars[index]:sub(rnd, rnd)\\n else\\n pw = chars[index]:sub(rnd, rnd) .. pw\\n end\\n index = index % #chars\\n until pw:len() >= length\\n return pw\\nend\\n\\nmath.randomseed(os.time())\\nif #arg ~= 2 then\\n print(\\\"\\\\npwgen.lua\\\")\\n print(\\\"=========\\\\n\\\")\\n print(\\\"A Lua script to generate random passwords.\\\\n\\\")\\n print(\\\"Usage: lua pwgen.lua [password length] [number of passwords to generate]\\\\n\\\")\\n os.exit()\\nend\\nfor i = 1, arg[2] do print(randPW(tonumber(arg[1]))) end\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"(* Length is the Length of the password, num is the number you want, \\\\\\nand similar=1 if you want similar characters, 0 if not. True and \\\\\\nFalse, should work in place of 1/0 *)\\npwgen[length_Integer: 5, num_Integer: 1, similars_Boolean: 1] :=\\n pwgenerator[length, num, similars] =\\n Module[{list, valid, validchars, similar, k, j, password, pwlist,\\n lcase, ucase, digits, spec, s}, lcase = Alphabet[];\\n ucase = Capitalize[lcase];\\n digits = Range[0, 9];\\n spec = StringPartition[\\\"!:#$%\\\\'()*+,-./:;>=<?@{}[]^_|~\\\", 1];\\n validchars = Flatten[Union[lcase, ucase, digits, spec]];\\n similar = StringPartition[\\\"Il10O5S2Z\\\", 1];\\n list = {};\\n\\n Table[valid = 0;\\n While[valid == 0,\\n For[j = 0; k = {};, j < length, j++,\\n AppendTo[k, RandomInteger[{1, Length[validchars]}]]];\\n k = Flatten[k];\\n password = validchars[[k]];\\n Which[(Intersection[password, similar] >= 1 && similars == 0 ),\\n valid = 0;, (Intersection[password, similar] == 0 &&\\n similars == 1),\\n valid = 0;, (Intersection[password, similar] == 0 &&\\n similars == 0 ), valid = 1;\\n Return[password], (Intersection[password, similar] >= 1 &&\\n similars == 1), valid = 1; Return[password]];\\n ], {num}];\\n\\n\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import os, parseopt, random, sequtils, strformat, strutils\\n\\nconst Symbols = toSeq(\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\")\\n\\n\\nproc passGen(passLength = 10,\\n count = 1,\\n seed = 0,\\n excludeSimilars = false): seq[string] =\\n ## Generate a sequence of passwords.\\n\\n # Initialize the random number generator.\\n if seed == 0: randomize()\\n else: randomize(seed)\\n\\n # Prepare list of chars per category.\\n var\\n lowerLetters = toSeq('a'..'z')\\n upperLetters = toSeq('A'..'Z')\\n digits = toSeq('0'..'9')\\n\\n if excludeSimilars:\\n lowerLetters.delete(lowerLetters.find('l'))\\n for c in \\\"IOSZ\\\": upperLetters.delete(upperLetters.find(c))\\n for c in \\\"012\\\": digits.delete(digits.find(c))\\n\\n let all = lowerLetters & upperLetters & digits & Symbols\\n\\n # Generate the passwords.\\n for _ in 1..count:\\n var password = newString(passLength)\\n password[0] = lowerLetters.sample\\n password[1] = upperLetters.sample\\n password[2] = digits.sample\\n password[3] = Symbols.sample\\n for i in 4..<passLength:\\n password[i] = all.sample\\n password.shuffle()\\n result.add password\\n\\n\\nproc printHelp() =\\n ## Print the help message.\\n echo &\\\"Usage: {getAppFileName().lastPathPart} \\\" &\\n \\\"[-h] [-l:length] [-c:count] [-s:seed] [-x:(true|false)]\\\"\\n echo \\\" -h: display this help\\\"\\n echo \\\" -l: length of generated passwords\\\"\\n echo \\\" -c: number of passwords to generate\\\"\\n echo \\\" -s: seed for the random number generator\\\"\\n echo \\\" -x: exclude similar characters\\\"\\n\\n\\nproc getIntValue(key, val: string): int =\\n ## Get a positive integer value from a string.\\n try:\\n result = val.parseInt()\\n if result <= 0:\\n raise newException(ValueError, \\\"\\\")\\n except ValueError:\\n quit &\\\"Wrong value for option -{key}: {val}\\\", QuitFailure\\n\\n\\nvar\\n passLength = 10\\n count = 1\\n seed = 0\\n excludeSimilars = false\\n\\n# Process options.\\nvar parser = initOptParser()\\n\\nfor kind, key, val in parser.getopt():\\n if kind != cmdShortOption:\\n printHelp()\\n quit(QuitFailure)\\n\\n case key\\n of \\\"h\\\":\\n printHelp()\\n quit(QuitSuccess)\\n of \\\"l\\\":\\n passLength = getIntValue(key, val)\\n of \\\"c\\\":\\n count = getIntValue(key, val)\\n of \\\"s\\\":\\n seed = getIntValue(key, val)\\n of \\\"x\\\":\\n if val.toLowerAscii == \\\"true\\\":\\n excludeSimilars = true\\n elif val.toLowerAscii == \\\"false\\\":\\n excludeSimilars = false\\n else:\\n quit &\\\"Wrong value for option -x: {val}\\\", QuitFailure\\n else:\\n quit &\\\"Wrong option: -{key}\\\"\\n\\n# Display the passwords.\\nfor pw in passGen(passLength, count, seed, excludeSimilars):\\n echo pw\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"let lower = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nlet upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nlet digit = \\\"0123456789\\\"\\nlet other = \\\"!\\\\034#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n\\nlet visually_similar = \\\"Il1O05S2Z\\\"\\n\\n\\nlet mk_pwd len readable =\\n let get_char i =\\n match i mod 4 with\\n | 0 -> lower.[Random.int (String.length lower)]\\n | 1 -> upper.[Random.int (String.length upper)]\\n | 2 -> digit.[Random.int (String.length digit)]\\n | 3 -> other.[Random.int (String.length other)]\\n | _ -> raise Exit\\n in\\n let f =\\n if readable then\\n (fun i ->\\n let rec aux () =\\n let c = get_char i in\\n if String.contains visually_similar c\\n then aux ()\\n else (String.make 1 c)\\n in\\n aux ()\\n )\\n else\\n (fun i ->\\n let c = get_char i in\\n (String.make 1 c)\\n )\\n in\\n let r = Array.init len f in\\n Array.sort (fun _ _ -> (Random.int 3) - 1) r;\\n (String.concat \\\"\\\" (Array.to_list r))\\n\\n\\nlet () =\\n Random.self_init ();\\n let num = ref 1 in\\n let len = ref 8 in\\n let readable = ref false in\\n let speclist = [\\n \\\"-n\\\", Arg.Set_int num, \\\"number of passwords\\\";\\n \\\"-c\\\", Arg.Set_int len, \\\"number of characters\\\";\\n \\\"--readable\\\", Arg.Set readable, \\\"readable\\\";\\n \\\"--rand-init\\\", Arg.String (fun s ->\\n Random.full_init\\n (Array.map int_of_char (Array.of_seq (String.to_seq s)))\\n ), \\\"initialise the random generator with a string\\\";\\n ] in\\n Arg.parse speclist (fun s -> invalid_arg s) \\\"Password generator\\\";\\n for i = 1 to !num do\\n print_endline (mk_pwd !len !readable)\\n done\\n\",\n \"language\": \"OCaml\"\n },\n {\n \"code\": \"/*REXX program generates a random password according to the Rosetta Code task's rules.*/\\nparse arg L N seed xxx dbg /*obtain optional arguments from the CL*/\\ncasl= 'abcdefghijklmnopqrstuvwxyz' /*define lowercase alphabet. */\\ncasu= translate(casle) /*define uppercase alphabet. */\\ndigs= '0123456789' /*define digits. */\\n/* avoiding the ambiguous characters Il1 o0 5S */\\ncasl= 'abcdefghijkmnpqrtuvwxy' /*define lowercase alphabet. */\\ncasu= translate(casl) /*define uppercase alphabet. */\\ndigs= '0123456789' /*define digits. */\\nspec= '''!\\\"#$%&()+,-./:;<=>?@[]^{|}~' /*define a bunch of special characters.*/\\nif L='?' then call help /*does user want documentation shown? */\\nif L='' | L=\\\",\\\" then L=8 /*Not specified? Then use the default.*/\\nIf N='' | N=\\\",\\\" then N=1 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nIf xxx=''| xxx=\\\",\\\" then xxx='1lI0O2Z5S' /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif seed>'' &,\\n seed<>',' then Do\\n if \\\\datatype(seed,'W')then call ser \\\"seed is not an integer:\\\" seed\\n Call random ,,seed /*the seed for repeatable RANDOM BIF #s*/\\n End\\ncasl=remove(xxx,casl)\\ncasu=remove(xxx,casu)\\ndigs=remove(xxx,digs)\\nSay 'casl='casl\\nSay 'casu='casu\\nSay 'digs='digs\\nSay 'spec='spec\\nif \\\\datatype(L, 'W') then call ser \\\"password length, it isn't an integer: \\\" L\\nif L<4 then call ser \\\"password length, it's too small: \\\" L\\nif L>80 then call ser \\\"password length, it's too large: \\\" L\\nif \\\\datatype(N, 'W') then call ser \\\"number of passwords, it isn't an integer: \\\" N\\nif N<0 then call ser \\\"number of passwords, it's too small: \\\" N\\n\\n do g=1 for N /*generate N passwords (default is 1)*/\\n pw=letterL()||letterU()||numeral()||special()/*generate 4 random PW constituents.*/\\n do k=5 to L; z=random(1, 4) /* [?] flush out PW with more parts. */\\n if z==1 then pw=pw || letterL() /*maybe append random lowercase letter.*/\\n if z==2 then pw=pw || letterU() /* \\\" \\\" \\\" uppercase \\\" */\\n if z==3 then pw=pw || numeral() /* \\\" \\\" \\\" numeral */\\n if z==4 then pw=pw || special() /* \\\" \\\" \\\" special character*/\\n end /*k*/ /* [?] code below randomizes PW chars.*/\\n t=length(pw) /*the length of the password (in bytes)*/\\n do L+L /*perform a random number of char swaps*/\\n a=random(1,t); x=substr(pw,a,1) /*A: 1st char location; X is the char.*/\\n b=random(1,t); y=substr(pw,b,1) /*B: 2nd \\\" \\\" Y \\\" \\\" \\\" */\\n pw=overlay(x,pw,b); pw=overlay(y,pw,a) /* swap the two chars. */\\n end /*swaps*/ /* [?] perform extra swap to be sure. */\\n say right(g,length(N)) 'password is: ' pw counts() /*display the Nth password */\\n end /*g*/\\nexit /*stick a fork in it, we're all done. */\\n/*--------------------------------------------------------------------------------------*/\\nser: say; say '***error*** invalid' arg(1); exit 13 /*display an error message*/\\nletterL: return substr(casl, random(1, length(casl)), 1) /*return random lowercase.*/\\nletterU: return substr(casu, random(1, length(casu)), 1) /* \\\" \\\" uppercase.*/\\nnumeral: return substr(digs, random(1, length(digs)), 1) /* \\\" \\\" numeral. */\\nspecial: return substr(spec, random(1, length(spec)), 1) /* \\\" \\\" special char*/\\nremove: Procedure\\n Parse arg nono,s\\n Return space(translate(s,'',nono),0)\\n/*--------------------------------------------------------------------------------------*/\\ncounts:\\n If dbg>'' Then Do\\n cnt.=0\\n str.=''\\n Do j=1 To length(pw)\\n c=substr(pw,j,1)\\n If pos(c,casL)>0 Then Do; cnt.0casL=cnt.0casL+1; str.0casL=str.0casL||c; End\\n If pos(c,casU)>0 Then Do; cnt.0casU=cnt.0casU+1; str.0casU=str.0casU||c; End\\n If pos(c,digs)>0 Then Do; cnt.0digs=cnt.0digs+1; str.0digs=str.0digs||c; End\\n If pos(c,spec)>0 Then Do; cnt.0spec=cnt.0spec+1; str.0spec=str.0spec||c; End\\n End\\n txt=cnt.0casL cnt.0casU cnt.0digs cnt.0spec\\n If pos(' 0 ',txt)>0 Then\\n txt=txt 'error'\\n Return txt str.0casL str.0casU str.0digs str.0spec\\n End\\n Else\\n txt=''\\n Return txt\\nhelp: signal .; .: do j=sigL+2 to sourceline()-1; say sourceline(j); end; exit 0\\n/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~ documentation begins on next line.~~~~~~~~~~~~~~~~~~~~~~~~~\\n+-----------------------------------------------------------------------------+\\n¦ Documentation for the GENPW program: ¦\\n¦ ¦\\n¦ Rexx genpwd <length|,> <howmany|,> <seed|,> <xxx|,> <dbg> ¦\\n¦ 8 1 n '1lI0O2Z5S' none Defaults ¦\\n¦ ¦\\n¦--- where: ¦\\n¦ length is the length of the passwords to be generated. ¦\\n¦ The default is 8. ¦\\n¦ If a comma (,) is specified, the default is used. ¦\\n¦ The minimum is 4, the maximum is 80. ¦\\n¦ ¦\\n¦ howMany is the number of passwords to be generated. ¦\\n¦ The default is 1. ¦\\n¦ xxx Characters NOT to be used in generated passwords ¦\\n¦ dbg Schow count of characters in the 4 groups ¦\\n+-----------------------------------------------------------------------------+\\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~documentation ends on the previous line.~~~~~~~~~~~~~~~~~~~*/\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"passwd(len=8, count=1, seed=0) =\\n{\\n if (len <= 4, print(\\\"password too short, minimum len=4\\\"); return(), seed, setrand(seed));\\n\\n my (C=[\\\"abcdefghijklmnopqrstuvwxyz\\\",\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\\"0123456789\\\",\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"], P, j);\\n\\n for (i=1, count, K = vector(#C); P = \\\"\\\";\\n for (l=1, len, K[j = random(#C)+1]++;\\n P = concat(P, Strchr(Vecsmall(C[j])[random(#C[j])+1]))\\n );\\n if (prod(z=1, #K, K[z]), print(P), i--) \\\\\\\\ if password contains all char classes print else redo\\n );\\n}\\n\\naddhelp(passwd, \\\"passwd({len},{count},{seed}): Password generator, optional: len (min=4, default=8), count (default=1), seed (default=0: no seed)\\\");\\n\",\n \"language\": \"PARI-GP\"\n },\n {\n \"code\": \"program passwords (input,output);\\n\\n{$mode objfpc}\\n{$H+} { We will need ansi strings instead of short strings\\n to hold passwords longer than 255 characters.\\n We need to assemble a string to check that each\\n password contains an upper, lower, numeral and symbol }\\n\\n{ This is a random password generater in PASCAL\\n Copyright Englebert Finklestien on this day which is\\n Setting Orange day 48 of The Aftermath YOLD 3184.\\n It is distributed under the terms of the GNU GPL (v3)\\n As published by the free software foundation.\\n\\n Usage :-\\n Without any command line arguments this program\\n will display 8 8-character long completely random passwords using\\n all 96 available character glyphs from the basic ascii set.\\n\\n With a single integer numerical argument it will\\n produce eight passwords of the chosen length.\\n\\n With a second integer numerical argument between 1 and 65536 it\\n will produce that number of passwords.\\n\\n With two integer arguments the first is taken as the length of password\\n and the second as the number of passwords to produce.\\n\\n The length of passwords can also be specified using -l or --length options\\n\\n The number of passwords can also be specified using -n or --number options\\n\\n It is also possible to exclude those glyphs which are simmilar enough to be\\n confused (e.g. O and 0) using the -e or --exclude option\\n\\n There are also the standard -a --about and -h --help options\\n\\n Other options will produce an error message and the program will halt without\\n producing any passwords at all.\\n\\n }\\n\\nuses sysutils, getopts;\\n\\n\\n\\nvar c : char;\\n optionindex : Longint;\\n theopts : array[1..5] of TOption;\\n numpass, lenpass, count,j : integer;\\n i : longint; { used to get a random number }\\n strength : byte; { check inclusion of different character groups }\\n password : string; { To hold a password as we generate it }\\n exc : boolean;\\n ex : set of char;\\n\\nprocedure about;\\nbegin\\n writeln('Engleberts random password generator');\\n writeln('Writen in FreePascal on Linux');\\n writeln('This is free software distributed under the GNU GPL v3');\\n writeln;\\nend;\\n\\nprocedure help;\\nbegin\\n writeln('Useage:-');\\n writeln('passwords produce 8 passwords each 8 characters long.');\\n writeln('Use one or more of the following switches to control the output.');\\n writeln('passwords --number=xx -nxx --length=xx -lxx --exclude -e --about -a --help -h');\\n writeln('passwords ll nn produce nn passwords of length ll');\\n writeln('The exclude option excludes easily confused characters such as `0` and `O` from');\\n writeln('the generated passwords.');\\n writeln;\\nend;\\n\\n\\nbegin\\n numpass := 8;\\n lenpass := 8;\\n exc := False;\\n ex := ['1','!','l','|','i','I','J','0','O','S','$','5',';',':',',','.','\\\\']; { Set of ambiguous characters }\\n OptErr := True;\\n Randomize; {initialise the random number generator}\\n {set up to handle the command line options}\\n with theopts[1] do\\n begin\\n name:='length';\\n has_arg:=1;\\n flag:=nil;\\n value:=#0;\\n end;\\n with theopts[2] do\\n begin\\n name:='number';\\n has_arg:=1;\\n flag:=nil;\\n value:=#0;\\n end;\\n with theopts[3] do\\n begin\\n name:='help';\\n has_arg:=0;\\n flag:=nil;\\n value:=#0;\\n end;\\n with theopts[4] do\\n begin\\n name:='about';\\n has_arg:=0;\\n flag:=nil;\\n value:=#0;\\n end;\\n with theopts[5] do\\n begin\\n name:='exclude';\\n has_arg:=0;\\n flag:=nil;\\n value:=#0;\\n end;\\n\\n{ Get and process long and short versions of command line args. }\\n c:=#0;\\n repeat\\n c:=getlongopts('ahel:n:t:',@theopts[1],optionindex);\\n case c of\\n #0 : begin\\n if (theopts[optionindex].name = 'exclude') then exc := True;\\n if (theopts[optionindex].name = 'length') then lenpass := StrtoInt(optarg);\\n if (theopts[optionindex].name = 'number') then numpass := StrtoInt(optarg);\\n\\t if (theopts[optionindex].name = 'about') then about;\\n\\t if (theopts[optionindex].name = 'help') then help;\\n end;\\n 'a' : about;\\n 'h' : help;\\n 'e' : exc := True;\\n 'l' : lenpass := StrtoInt(optarg);\\n 'n' : numpass := StrtoInt(optarg);\\n '?',':' : writeln ('Error with opt : ',optopt);\\n end; { case }\\n until c=endofoptions;\\n { deal with any remaining command line parameters (two integers)}\\n if optind<=paramcount then\\n begin\\n count:=1;\\n while optind<=paramcount do\\n begin\\n\\t if (count=1) then lenpass := StrtoInt(paramstr(optind)) else numpass := StrtoInt(paramstr(optind));\\n inc(optind);\\n\\t inc(count);\\n end;\\n end;\\n\\tif not (exc) then ex :=['\\\\']; { if we are not going to exclude characters set the exclusion set to almost empty }\\n\\t{ This generates and displays the actual passwords }\\n for count := 1 to numpass do begin\\n strength := $00;\\n repeat\\n password :='';\\n for j:= 1 to lenpass do begin\\n repeat\\n i:=Random(130);\\n until (i>32) and (i<127) and (not(chr(i) in ex)) ;\\n AppendStr(password,chr(i));\\n if (CHR(i) in ['0'..'9']) then strength := strength or $01;\\n if (chr(i) in ['a'..'z']) then strength := strength or $02;\\n if (chr(i) in ['A'..'Z']) then strength := strength or $04;\\n if (chr(i) in ['!'..'/']) then strength := strength or $08;\\n if (chr(i) in [':'..'@']) then strength := strength or $08;\\n if (chr(i) in ['['..'`']) then strength := strength or $08;\\n if (chr(i) in ['{'..'~']) then strength := strength or $08;\\n end;\\t\\n until strength = $0f;\\n writeln(password);\\n end;\\nend.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\n\\nuse English;\\nuse Const::Fast;\\nuse Getopt::Long;\\nuse Math::Random;\\n\\nconst my @lcs => 'a' .. 'z';\\nconst my @ucs => 'A' .. 'Z';\\nconst my @digits => 0 .. 9;\\nconst my $others => q{!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~}; # \\\"\\n\\nmy $pwd_length = 8;\\nmy $num_pwds = 6;\\nmy $seed_phrase = 'TOO MANY SECRETS';\\n\\nmy %opts = (\\n'password_length=i' => \\\\$pwd_length,\\n'num_passwords=i' => \\\\$num_pwds,\\n'seed_phrase=s' => \\\\$seed_phrase,\\n'help!' => sub {command_line_help(); exit 0}\\n);\\ncommand_line_help() and exit 1 unless $num_pwds >= 1 and $pwd_length >= 4 and GetOptions(%opts);\\n\\nrandom_set_seed_from_phrase($seed_phrase);\\nsay gen_password() for 1 .. $num_pwds;\\n\\nsub gen_password {\\n my @generators = (\\\\&random_lc, \\\\&random_uc, \\\\&random_digit, \\\\&random_other);\\n my @chars = map {$ARG->()} @generators; # At least one char of each type.\\n push @chars, $generators[random_uniform_integer(1, 0, 3)]->() for 1 .. $pwd_length - 4;\\n join '', random_permutation(@chars);\\n}\\n\\nsub random_lc { $lcs[ random_uniform_integer(1, 0, $#lcs) ] }\\nsub random_uc { $ucs[ random_uniform_integer(1, 0, $#ucs) ] }\\nsub random_digit { $digits[ random_uniform_integer(1, 0, $#digits) ] }\\nsub random_other { substr($others, random_uniform_integer(1, 0, length($others)-1), 1) }\\n\\nsub command_line_help {\\n say <<~END\\n Usage: $PROGRAM_NAME\\n [--password_length=<l> default: 8, minimum: 4]\\n [--num_passwords=<n> default: 6, minimum: 1]\\n [--seed_phrase=<s> default: TOO MANY SECRETS (optional)]\\n [--help]\\n END\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--with javascript_semantics -- not quite yet:</span>\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (VALUECHANGED_CB not yet triggering)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">az</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"abcdefghijklmnopqrstuvwxyz\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">AZ</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">O9</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"1234567890\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">OT</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">password</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">exclude</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">\\\"Il1O05S2Z\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span>\\n <span style=\\\"color: #000000;\\\">S4</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">apply</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">filter</span><span style=\\\"color: #0000FF;\\\">,{{</span><span style=\\\"color: #000000;\\\">az</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">AZ</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">O9</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">OT</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #008000;\\\">\\\"out\\\"</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">exclude</span><span style=\\\"color: #0000FF;\\\">}})</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">pw</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">sel</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">shuffle</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">}&</span><span style=\\\"color: #7060A8;\\\">sq_rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">len</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">)))</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">len</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">S4c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">S4</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">sel</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]]</span>\\n <span style=\\\"color: #000000;\\\">pw</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">S4c</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">S4c</span><span style=\\\"color: #0000FF;\\\">))]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pw</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">lenl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">leng</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numl</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numb</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">dlg</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">valuechanged_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*leng|numb*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">l</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">leng</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">numb</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"VALUE\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">password</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">l</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">s</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">substitute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"&\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"&&\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (on p2js??)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetStrAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"TITLE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">s</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"SIZE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupRefresh</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">lenl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"length(4..99)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">leng</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupText</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"SPIN=YES,SPINMIN=4,SPINMAX=99\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">numl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"number(1..99)\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">numb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupText</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"SPIN=YES,SPINMIN=1,SPINMAX=99\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupLabel</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"FONTFACE=Courier\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">leng</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">numb</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"VALUECHANGED_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"valuechanged_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">IupVbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">lenl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">leng</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">numl</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">numb</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #008000;\\\">\\\"GAP=10,NORMALIZESIZE=VERTICAL\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #7060A8;\\\">IupHbox</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">})},</span><span style=\\\"color: #008000;\\\">\\\"MARGIN=5x5\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">`TITLE=\\\"Password Generator\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"#!/usr/bin/pil\\n\\n# Default seed\\n(seed (in \\\"/dev/urandom\\\" (rd 8)))\\n\\n# Global defaults\\n(setq\\n *PwCount 1\\n *PwLength 12\\n *UppChars (mapcar char (range (char \\\"A\\\") (char \\\"Z\\\")))\\n *LowChars (mapcar lowc *UppChars)\\n *Digits (mapcar format (range 0 9))\\n *Others (chop \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\") )\\n\\n# Command line options\\n(de -count ()\\n (setq *PwCount (format (opt))) )\\n\\n(de -length ()\\n (setq *PwLength (format (opt))) )\\n\\n(de -seed ()\\n (seed (opt)) )\\n\\n(de -exclude ()\\n (for C (chop (opt))\\n (del C '*UppChars)\\n (del C '*LowChars)\\n (del C '*Digits)\\n (del C '*Others) ) )\\n\\n(de -help ()\\n (prinl \\\"Generate password(s)\\\")\\n (prinl \\\"Options:\\\")\\n (prinl \\\" --help\\\")\\n (prinl \\\" --count <num>\\\")\\n (prinl \\\" --length <num>\\\")\\n (prinl \\\" --seed <chars>\\\")\\n (prinl \\\" --exclude <chars>\\\")\\n (bye) )\\n\\n(load T)\\n\\n# Return random character from list\\n(de randChar (Lst)\\n (get Lst (rand 1 (length Lst))) )\\n\\n# Generate password(s)\\n(do *PwCount\\n (prinl\\n (by '(NIL (rand)) sort\\n (make\\n (link\\n (randChar *UppChars) # At least one from each group\\n (randChar *LowChars)\\n (randChar *Digits)\\n (randChar *Others) )\\n (do (- *PwLength 4)\\n (link\\n (randChar\\n (caar\\n (rot '(*UppChars *Others *Digits *LowChars))) ) ) ) ) ) ) )\\n\\n(bye)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"function New-RandomPassword\\n{\\n <#\\n .SYNOPSIS\\n Generates one or more passwords.\\n .DESCRIPTION\\n Generates one or more passwords.\\n .PARAMETER Length\\n The password length (default = 8).\\n .PARAMETER Count\\n The number of passwords to generate.\\n .PARAMETER Source\\n An array of strings containing characters from which the password will be generated. The default is good for most uses.\\n .PARAMETER ExcludeSimilar\\n A switch which indicates that visually similar characters should be ignored.\\n .EXAMPLE\\n New-RandomPassword\\n\\n Generates one password of the default length (8 characters).\\n .EXAMPLE\\n New-RandomPassword -Count 4\\n\\n Generates four passwords each of the default length (8 characters).\\n .EXAMPLE\\n New-RandomPassword -Length 12 -Source abcdefghijklmnopqrstuvwxyz, ABCDEFGHIJKLMNOPQRSTUVWXYZ, 0123456789\\n\\n Generates a password with a length of 12 containing at least one char from each string in Source\\n .EXAMPLE\\n New-RandomPassword -Count 4 -ExcludeSimilar\\n\\n Generates four passwords each of the default length (8 characters) while excluding similar characters \\\"Il1O05S2Z\\\".\\n #>\\n [CmdletBinding()]\\n [OutputType([string])]\\n Param\\n (\\n [Parameter(Mandatory=$false)]\\n [ValidateRange(1,[Int]::MaxValue)]\\n [Alias(\\\"l\\\")]\\n [int]\\n $Length = 8,\\n\\n [Parameter(Mandatory=$false)]\\n [ValidateRange(1,[Int]::MaxValue)]\\n [Alias(\\\"n\\\",\\\"c\\\")]\\n [int]\\n $Count = 1,\\n\\n [Parameter(Mandatory=$false)]\\n [Alias(\\\"s\\\")]\\n [string[]]\\n $Source = @(\\\"abcdefghijklmnopqrstuvwxyz\\\", \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\", \\\"0123456789\\\", \\\"!\\\\`\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"),\\n\\n [Parameter(Mandatory=$false)]\\n [Alias(\\\"x\\\")]\\n [switch]\\n $ExcludeSimilar\\n )\\n\\n Begin\\n {\\n [char[][]] $charArrays = $Source\\n [char[]] $allChars = $charArrays | ForEach-Object {$_}\\n [char[]] $similar = \\\"Il1O05S2Z\\\".ToCharArray()\\n\\n $random = New-Object -TypeName System.Security.Cryptography.RNGCryptoServiceProvider\\n\\n function Get-Seed\\n {\\n $bytes = New-Object -TypeName System.Byte[] -Argument 4\\n $random.GetBytes($bytes)\\n [BitConverter]::ToUInt32($bytes, 0)\\n }\\n\\n function Add-PasswordCharacter ([char[]]$From)\\n {\\n $key = Get-Seed\\n\\n while ($password.ContainsKey($key))\\n {\\n $key = Get-Seed\\n }\\n\\n $index = (Get-Seed) % $From.Count\\n\\n if ($ExcludeSimilar)\\n {\\n while ($From[$index] -in $similar)\\n {\\n $index = (Get-Seed) % $From.Count\\n }\\n }\\n\\n $password.Add($key, $From[$index])\\n }\\n }\\n Process\\n {\\n for ($i = 1;$i -le $Count; $i++)\\n {\\n [hashtable] $password = @{}\\n\\n foreach ($array in $charArrays)\\n {\\n if($password.Count -lt $Length)\\n {\\n Add-PasswordCharacter -From $array # Append to $password\\n }\\n }\\n\\n for ($j = $password.Count; $j -lt $Length; $j++)\\n {\\n Add-PasswordCharacter -From $allChars # Append to $password\\n }\\n\\n ($password.GetEnumerator() | Select-Object -ExpandProperty Value) -join \\\"\\\"\\n }\\n }\\n}\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"New-RandomPassword -Length 12 -Count 4 -ExcludeSimilar\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \"Set-Alias -Name nrp -Value New-RandomPassword -Description \\\"Generates one or more passwords\\\"\\n\\nnrp -l 12 -n 4 -x\\n\",\n \"language\": \"PowerShell\"\n },\n {\n \"code\": \":- set_prolog_flag(double_quotes, chars).\\n:- initialization(main, main).\\n\\nmain( Argv ) :-\\n opt_spec( Spec ),\\n opt_parse( Spec, Argv, Opts, _ ),\\n (\\n member( help(true), Opts ) -> show_help\\n ;\\n member( length( Len ), Opts ),\\n member( number( Num ), Opts ),\\n print_set_of_passwords( Len, Num )\\n ).\\n\\nshow_help :-\\n opt_spec( Spec ),\\n opt_help( Spec, HelpText ),\\n write( 'Usage: swipl pgen.pl <options>\\\\n\\\\n' ),\\n write( HelpText ),\\n nl.\\n\\nopt_spec([\\n [opt(help), type(boolean), default(false), shortflags([h]), longflags([help]),\\n help('Show Help')],\\n [opt(length), type(integer), default(10), shortflags([l]), longflags([length]),\\n help('Specify the length of each password.')],\\n [opt(number), type(integer), default(1), shortflags([n]), longflags([number]),\\n help('Specify the number of passwords to create.')]\\n]).\\n\\nprint_set_of_passwords( Length, Number ) :-\\n forall(\\n between( 1, Number, _ ),\\n (\\n random_pword( Length, P ),\\n maplist( format('~w'), P ),\\n nl\\n )\\n ).\\n\\nrandom_pword( Length, Pword ) :-\\n length( GenPword, Length ),\\n findall( C, pword_char( _, C), PwordChars ),\\n repeat,\\n maplist(populate_pword( PwordChars ), GenPword ),\\n maplist( pword_char_rule( GenPword ), [lower, upper, digits, special] ),\\n random_permutation( GenPword, Pword ).\\n\\npopulate_pword( PwordChars, C ) :- random_member( C, PwordChars ).\\n\\npword_char_rule( Pword, Type ) :-\\n pword_char( Type, C ),\\n member( C, Pword).\\n\\npword_char( lower, C ) :- member( C, \\\"abcdefghijklmnopqrstuvwxyz\\\" ).\\npword_char( upper, C ) :- member( C, \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\" ).\\npword_char( digits, C ) :- member( C, \\\"0123456789\\\" ).\\npword_char( special, C ) :- member( C, \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" ).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"EnableExplicit\\n\\nProcedure.b CheckPW(pw.s)\\n Define flag.b=#True,\\n tmp.b=#False,\\n c.c,\\n s.s,\\n i.i\\n For c='a' To 'z'\\n tmp=Bool(FindString(pw,Chr(c)))\\n If tmp : Break : EndIf\\n Next\\n flag & tmp\\n tmp=#False\\n For c='A' To 'Z'\\n tmp=Bool(FindString(pw,Chr(c)))\\n If tmp : Break : EndIf\\n Next\\n flag & tmp\\n tmp=#False\\n For c='0' To '9'\\n tmp=Bool(FindString(pw,Chr(c)))\\n If tmp : Break : EndIf\\n Next\\n flag & tmp\\n tmp=#False\\n For c='!' To '/'\\n s+Chr(c)\\n Next\\n For c=':' To '@'\\n s+Chr(c)\\n Next\\n s+\\\"[]^_{|}~\\\"\\n For i=1 To Len(pw)\\n tmp=Bool(FindString(s,Mid(pw,i,1)))\\n If tmp : Break : EndIf\\n Next\\n flag & tmp\\n ProcedureReturn flag\\nEndProcedure\\n\\nProcedure.s InputHdl(prompt.s=\\\"\\\")\\n Define txt.s,\\n s.s,\\n r.i,\\n hlp.s\\n Restore Help_01\\n Read.s hlp\\n Print(prompt)\\n Repeat\\n s=Inkey()\\n If s<>\\\"\\\"\\n If FindString(\\\"0123456789\\\",s)\\n txt+s\\n Print(s)\\n EndIf\\n If s=Chr(27)\\n txt=\\\"0\\\"\\n Break\\n EndIf\\n ElseIf RawKey()\\n r=RawKey()\\n If r=112\\n PrintN(\\\"\\\")\\n PrintN(hlp)\\n Print(~\\\"\\\\n\\\"+prompt)\\n EndIf\\n EndIf\\n Delay(20)\\n Until s=Chr(13)\\n PrintN(\\\"\\\")\\n ProcedureReturn txt\\nEndProcedure\\n\\nNewList PasswordChar.c()\\nDefine c.c,\\n pwlen.i,\\n n_of_pw.i,\\n pwstr.s,\\n i.i\\nFor c='!' To '~'\\n If c<>'\\\\' And c<>'`'\\n AddElement(PasswordChar()) : PasswordChar()=c\\n EndIf\\nNext\\nOpenConsole(\\\"Password generator: F1=Help; Esc=End\\\")\\nRepeat\\n pwlen=Abs(Val(InputHdl(\\\"Length of the password (n>=4): \\\")))\\n If pwlen=0 : Break : EndIf\\n If pwlen<4 : Continue : EndIf\\n n_of_pw=Abs(Val(InputHdl(\\\"Number of passwords (n>=1): \\\")))\\n If n_of_pw=0 : Break : EndIf\\n For i=1 To n_of_pw\\n Repeat\\n pwstr=Mid(pwstr,2)\\n RandomizeList(PasswordChar())\\n ResetList(PasswordChar())\\n While NextElement(PasswordChar())\\n pwstr+Chr(PasswordChar())\\n If Len(pwstr)>=pwlen : Break : EndIf\\n Wend\\n Until CheckPW(pwstr)\\n PrintN(RSet(Str(i),Len(Str(n_of_pw)),\\\" \\\")+\\\") \\\"+pwstr)\\n pwstr=\\\"\\\"\\n Next\\n PrintN(\\\"\\\")\\nForEver\\nEnd\\n\\nDataSection\\n Help_01:\\n Data.s ~\\\"Help: Password generator\\\\n\\\"+\\n ~\\\"------------------------\\\\n\\\"+\\n ~\\\"Blabla bla blabla bla blablabla.\\\\n\\\"+\\n ~\\\"Blabla bla blablabla.\\\\n\\\"+\\n ~\\\"Bla blabla bla blablabla bla.\\\\n\\\"+\\n ~\\\"Blabla bla blabla bla.\\\\n\\\"+\\n ~\\\"Bla blabla bla blablabla blablabla.\\\\n\\\"+\\n ~\\\"Blabla bla blabla bla blablabla.\\\\n\\\"+\\n ~\\\"Blabla blabla bla blablabla.\\\"\\n EndOfHelp:\\nEndDataSection\\n\",\n \"language\": \"PureBasic\"\n },\n {\n \"code\": \"import random\\n\\nlowercase = 'abcdefghijklmnopqrstuvwxyz' # same as string.ascii_lowercase\\nuppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' # same as string.ascii_uppercase\\ndigits = '0123456789' # same as string.digits\\npunctuation = '!\\\"#$%&\\\\'()*+,-./:;<=>?@[]^_{|}~' # like string.punctuation but without backslash \\\\ nor grave `\\n\\nallowed = lowercase + uppercase + digits + punctuation\\n\\nvisually_similar = 'Il1O05S2Z'\\n\\n\\ndef new_password(length:int, readable=True) -> str:\\n if length < 4:\\n print(\\\"password length={} is too short,\\\".format(length),\\n \\\"minimum length=4\\\")\\n return ''\\n choice = random.SystemRandom().choice\\n while True:\\n password_chars = [\\n choice(lowercase),\\n choice(uppercase),\\n choice(digits),\\n choice(punctuation)\\n ] + random.sample(allowed, length-4)\\n if (not readable or\\n all(c not in visually_similar for c in password_chars)):\\n random.SystemRandom().shuffle(password_chars)\\n return ''.join(password_chars)\\n\\n\\ndef password_generator(length, qty=1, readable=True):\\n for i in range(qty):\\n print(new_password(length, readable))\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"passwords <- function(nl = 8, npw = 1, help = FALSE) {\\n if (help) return(\\\"gives npw passwords with nl characters each\\\")\\n if (nl < 4) nl <- 4\\n spch <- c(\\\"!\\\", \\\"\\\\\\\"\\\", \\\"#\\\", \\\"$\\\", \\\"%\\\", \\\"&\\\", \\\"'\\\", \\\"(\\\", \\\")\\\", \\\"*\\\", \\\"+\\\", \\\",\\\", \\\"-\\\", \\\".\\\", \\\"/\\\", \\\":\\\", \\\";\\\", \\\"<\\\", \\\"=\\\", \\\">\\\", \\\"?\\\", \\\"@\\\", \\\"[\\\", \\\"]\\\", \\\"^\\\", \\\"_\\\", \\\"{\\\", \\\"|\\\", \\\"}\\\", \\\"~\\\")\\n for(i in 1:npw) {\\n pw <- c(sample(letters, 1), sample(LETTERS, 1), sample(0:9, 1), sample(spch, 1))\\n pw <- c(pw, sample(c(letters, LETTERS, 0:9, spch), nl-4, replace = TRUE))\\n cat(sample(pw), \\\"\\\\n\\\", sep = \\\"\\\")\\n }\\n}\\n\\nset.seed(123)\\npasswords(help = TRUE)\\n## [1] \\\"gives npw passwords with nl characters each\\\"\\n\\npasswords(8)\\n## S2XnQoy*\\n\\npasswords(14, 5)\\n## :.iJ=Q7_gP?Cio\\n## !yUu7OL|eH;}1p\\n## y2{DNvV^Zl^IFe\\n## Tj@T19L.q1;I*]\\n## 6M+{)xV?i|1UJ/\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/cmdline)\\n\\n(define valid-uppercase '(#\\\\A #\\\\B #\\\\C #\\\\D #\\\\E #\\\\F #\\\\G #\\\\H #\\\\I #\\\\J\\n #\\\\K #\\\\L #\\\\M #\\\\N #\\\\O #\\\\P #\\\\Q #\\\\R #\\\\S #\\\\T\\n #\\\\U #\\\\V #\\\\W #\\\\X #\\\\Y #\\\\Z))\\n(define valid-lowercase '(#\\\\a #\\\\b #\\\\c #\\\\d #\\\\e #\\\\f #\\\\g #\\\\h #\\\\i #\\\\j\\n #\\\\k #\\\\l #\\\\m #\\\\n #\\\\o #\\\\p #\\\\q #\\\\r #\\\\s #\\\\t\\n #\\\\u #\\\\v #\\\\w #\\\\x #\\\\y #\\\\z))\\n(define valid-numbers '(#\\\\0 #\\\\1 #\\\\2 #\\\\3 #\\\\4 #\\\\5 #\\\\6 #\\\\7 #\\\\8 #\\\\9))\\n(define valid-symbols '(#\\\\! #\\\\\\\\ #\\\\\\\" #\\\\# #\\\\$ #\\\\% #\\\\& #\\\\' #\\\\( #\\\\)\\n #\\\\* #\\\\+ #\\\\, #\\\\- #\\\\. #\\\\/ #\\\\: #\\\\; #\\\\< #\\\\=\\n #\\\\> #\\\\? #\\\\@ #\\\\[ #\\\\] #\\\\^ #\\\\_ #\\\\{ #\\\\| #\\\\}\\n #\\\\~))\\n\\n(define visual-invalid '(#\\\\0 #\\\\O #\\\\1 #\\\\I #\\\\l #\\\\| #\\\\5 #\\\\S #\\\\2 #\\\\Z))\\n\\n(define (is-readable? c)\\n (empty? (filter (lambda (x) (eq? x c)) visual-invalid)))\\n\\n(define (random-selection lst)\\n (list-ref lst (random (length lst))))\\n\\n(define (generate len readable)\\n (let ([upper (if readable (filter is-readable? valid-uppercase) valid-uppercase)]\\n [lower (if readable (filter is-readable? valid-lowercase) valid-lowercase)]\\n [numbers (if readable (filter is-readable? valid-numbers) valid-numbers)]\\n [symbols (if readable (filter is-readable? valid-symbols) valid-symbols)])\\n (let loop ([lst (map random-selection (list upper lower numbers symbols))])\\n (cond\\n [(<= len (length lst)) (shuffle lst)]\\n [else (match (random 4)\\n [0 (loop (cons (random-selection upper) lst))]\\n [1 (loop (cons (random-selection lower) lst))]\\n [2 (loop (cons (random-selection numbers) lst))]\\n [3 (loop (cons (random-selection symbols) lst))])]))))\\n\\n(define (run len cnt seed readable)\\n (random-seed seed)\\n (let loop ([x cnt])\\n (unless (zero? x)\\n (display (list->string (generate len readable)))\\n (newline)\\n (loop (- x 1)))))\\n\\n(define len (make-parameter 10))\\n(define cnt (make-parameter 1))\\n(define seed (make-parameter (random 1 1000000)))\\n(define readable? (make-parameter #f))\\n\\n(command-line #:program \\\"passwdgen\\\"\\n #:once-each\\n [(\\\"-l\\\" \\\"--length\\\") integer \\\"password length\\\" (len (string->number integer))]\\n [(\\\"-c\\\" \\\"--count\\\") integer \\\"number of password\\\" (cnt (string->number integer))]\\n [(\\\"-s\\\" \\\"--seed\\\") integer \\\"random generator seed\\\" (seed (string->number integer))]\\n [(\\\"-r\\\" \\\"--readable\\\") \\\"safe characters\\\" (readable? #t)])\\n\\n\\n(run (len) (cnt) (seed) (readable?))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @chars =\\n set('a' .. 'z'),\\n set('A' .. 'Z'),\\n set('0' .. '9'),\\n set(<!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~>.comb);\\n\\n# bleh. unconfuse syntax highlighter. '\\\"\\n\\nsub MAIN ( Int :$l = 8, Int :$c = 1, Str :$x = '' ) {\\n note 'Password length must be >= 4' and exit if $l < 4;\\n note 'Can not generate fewer than 0 passwords' and exit if $c < 0;\\n my $chars = [∪] @chars».=&filter;\\n note 'Can not exclude an entire required character group' and exit\\n if any(@chars».elems) == 0;\\n for ^$c {\\n my @pswd;\\n @pswd.push( @chars[$_].roll ) for ^4;\\n @pswd.push( $chars .roll ) for 4 ..^ $l;\\n say [~] @pswd.pick(*);\\n }\\n\\n sub filter (Set $set) { $set ∖ set($x.comb) }\\n}\\n\\nsub USAGE() {\\n say qq:to/END/;\\n Specify a length: --l=8 (default 8),\\n Specify a count: --c=1 (default 1),\\n Specify characters to exclude: --x=\\n (must escape characters significant to the shell)\\n E.G.\\n {$*PROGRAM-NAME} --l=14 --c=5 --x=0O\\\\\\\\\\\\\\\"\\\\\\\\\\\\'1l\\\\\\\\\\\\|I\\n END\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"my @char-groups =\\n ['a' .. 'z'],\\n ['A' .. 'Z'],\\n ['0' .. '9'],\\n < $ % & \\\\ ` ~ ! * + , - . / : ; = ? @ ^ _ ~ [ ] ( ) { | } # ' \\\" \\\\< \\\\> >.Array;\\n\\nsubset MinimumPasswordLength of Int where * >= 4;\\nsubset NumberOfPasswords of UInt where * != 0;\\n\\nsub MAIN( NumberOfPasswords :c(:$count) = 1, MinimumPasswordLength :l(:$length) = 8, Str :x(:$exclude) = '' ) {\\n &USAGE() if 1 == (.comb ∖ $exclude.comb).elems for @char-groups;\\n .say for password-characters($length, $exclude )\\n .map( *.split(' ') )\\n .map( *.pick: Inf ) # shuffle, so we don't get a predictable pattern\\n .map( *.join )\\n .head( $count );\\n}\\n\\nsub password-characters( $len, $exclude ) {\\n ( (( char-groups($exclude) xx Inf ).map: *.pick).batch( 4)\\n Z~\\n (( char-groups($exclude, $len) xx Inf ).map: *.pick).batch($len-4) )\\n}\\n\\nmulti char-groups( $exclude ) { | @char-groups.map( * (-) $exclude.comb ) }\\nmulti char-groups( $exclude, $max-weight ) { flat (char-groups($exclude)>>.keys.map: {$_ xx ^$max-weight .roll}) }\\n\\nsub USAGE() {\\n say qq:to/END/;\\n Specify a length: -l=10 (minimum 4)\\n Specify a count: -c=5 (minimum 1)\\n Specify characters to exclude: -x=xkcd (optional)\\n Password must have at least one of each: lowercase letter, uppercase letter, digit, punctuation.\\n END\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program generates a random password according to the Rosetta Code task's rules.*/\\n@L='abcdefghijklmnopqrstuvwxyz'; @U=@L; upper @U /*define lower-, uppercase Latin chars.*/\\n@#= 0123456789 /* \\\" \\\" string of base ten numerals.*/\\n@@= '!\\\"#$%&()+,-./:;<=>?@[]^{|}~' || \\\"'\\\" /*define a bunch of special characters.*/\\nparse arg L N seed xxx yyy . /*obtain optional arguments from the CL*/\\nif L=='?' then signal help /*does user want documentation shown? */\\nif L=='' | L==\\\",\\\" then L=8 /*Not specified? Then use the default.*/\\nif N=='' | N==\\\",\\\" then N=1 /* \\\" \\\" \\\" \\\" \\\" \\\" */\\nif xxx\\\\=='' then call weed xxx /*Any chars to be ignored? Scrub lists*/\\nif yyy\\\\=='' then call weed x2c(yyy) /*Hex \\\" \\\" \\\" \\\" \\\" \\\" */\\nif datatype(seed,'W') then call random ,,seed /*the seed for repeatable RANDOM BIF #s*/\\nif \\\\datatype(L, 'W') then call serr \\\"password length, it isn't an integer: \\\" L\\nif L<4 then call serr \\\"password length, it's too small (< 4): \\\" L\\nif L>80 then call serr \\\"password length, it's too large (> 80): \\\" L\\nif \\\\datatype(N, 'W') then call serr \\\"number of passwords, it isn't an integer: \\\" N\\n\\n do g=1 to N; $= /*generate N passwords (default is one)*/\\n do k=1 for L; z=k; if z>4 then z=random(1,4) /*1st four parts │ random*/\\n if z==1 then $=$ || substr(@L,random(1,length(@L)),1) /*append lowercase letter*/\\n if z==2 then $=$ || substr(@U,random(1,length(@U)),1) /* \\\" uppercase \\\" */\\n if z==3 then $=$ || substr(@#,random(1,length(@#)),1) /* \\\" numeral */\\n if z==4 then $=$ || substr(@@,random(1,length(@@)),1) /* \\\" special character*/\\n end /*k*/\\n /* [↓] scrambles PW, hides gen order. */\\n do a=1 for L; b=random(1, L) /*swap every character with another. */\\n parse var $ =(a) x +1 =(b) y +1 /*≡ x=substr($,a,1); y=substr($,b,1) */\\n $=overlay(x,$,b); $=overlay(y,$,a) /*(both statements) swap two characters*/\\n end /*L+L*/ /* [↑] more swaps obfuscates gen order*/\\n\\n say right(g, length(N)) 'password is: ' $ /*display the Nth password to console*/\\n /* call lineout 'GENPW.PW', $ */ /*and also write the password to a file*/ /*or not.*/\\n end /*g*/ /* [↑] {a comment} fileID= GENPW.PW */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nweed: parse arg ig; @L=dont(@L); @U=dont(@U); @#=dont(@#); @@=dont(@@); return\\ndont: return space( translate(arg(1), , ig), 0) /*remove chars from a list*/\\nserr: say; say '***error*** invalid' arg(1); exit 13 /*display an error message*/\\nhelp: signal .; .: do j=sigL+1 to sourceline(); say strip(left(sourceline(j),79)); end /*\\n╔═════════════════════════════════════════════════════════════════════════════╗\\n║ GENPW ? ◄─── shows this documentation. ║\\n║ GENPW ◄─── generates 1 password (with length 8). ║\\n║ GENPW len ◄─── generates (all) passwords with this length║\\n║ GENPW , n ◄─── generates N number of passwords. ║\\n║ GENPW , , seed ◄─── generates passwords using a random seed. ║\\n║ GENPW , , , xxx ◄─── generates passwords that don't contain xxx║\\n║ GENPW , , , , yyy ◄─── generates passwords that don't contain yyy║\\n║ ║\\n╟──────────── where [if a comma (,) is specified, the default is used]: ║\\n║ len is the length of the passwords to be generated. The default is 8.║\\n║ The minimum is 4, the maximum is 80. ║\\n║ n is the number of passwords to be generated. The default is 1.║\\n║ seed is an integer seed used for the RANDOM BIF. (Default is random.)║\\n║ xxx are characters to NOT be used for generating passwords. ║\\n║ The default is to use all the (normal) available characters. ║\\n║ yyy (same as XXX, except the chars are expressed as hexadecimal pairs).║\\n╚═════════════════════════════════════════════════════════════════════════════╝ */\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Password generator\\n\\nchars = list(4)\\nstrp = list(2)\\npassword = \\\"\\\"\\nchars[1] = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nchars[2] = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nchars[3] = \\\"0123456789\\\"\\nchars[4] = \\\"!\\\\#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n\\ninit()\\nplen = number(strp[1])\\n\\nfor n = 1 to strp[2]\\n passwords(chars)\\n see \\\"password = \\\" + password + nl\\nnext\\n\\nfunc passwords(chars)\\n index = 0\\n password = \\\"\\\"\\n while index < plen\\n index = index + 1\\n charsind1 = index % len(chars) + 1\\n charsind2 = random(len(chars[charsind1])-1) + 1\\n password = password + chars[charsind1][charsind2]\\n end\\n\\nfunc init()\\n fp = fopen(\\\"C:\\\\Ring\\\\calmosoft\\\\pwgen.ring\\\",\\\"r\\\")\\n r = \\\"\\\"\\n str = \\\"\\\"\\n nr = 0\\n while isstring(r)\\n r = fgetc(fp)\\n if r != char(10) and not feof(fp)\\n str = str + r\\n nr = nr + 1\\n strp[nr] = str\\n else\\n str = \\\"\\\"\\n ok\\n end\\n fclose(fp)\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"ARRS = [(\\\"a\\\"..\\\"z\\\").to_a,\\n (\\\"A\\\"..\\\"Z\\\").to_a,\\n (\\\"0\\\"..\\\"9\\\").to_a,\\n %q(!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~).chars] # \\\" quote to reset clumsy code colorizer\\nALL = ARRS.flatten\\n\\ndef generate_pwd(size, num)\\n raise ArgumentError, \\\"Desired size too small\\\" unless size >= ARRS.size\\n num.times.map do\\n arr = ARRS.map(&:sample)\\n (size - ARRS.size).times{ arr << ALL.sample}\\n arr.shuffle.join\\n end\\nend\\n\\nputs generate_pwd(8,3)\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"a$(1) = \\\"0123456789\\\"\\na$(2) = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\na$(3) = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\na$(4) = \\\"!\\\"\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\na$(0) = a$(1) + a$(2) + a$(3) + a$(4)\\n\\n[main]\\nprint \\\"----------- Password Generator -----------\\\"\\ninput \\\"Number of Characters:\\\";howBig\\nif howBig < 1 then goto [exit]\\n\\ninput \\\"How many to generate:\\\";howMany\\nif howMany < 1 then goto [main]\\n\\n' -----------------------------\\n' Generate Password\\n' -----------------------------\\n[gen]\\ncls\\nprint \\\"Generate \\\";howMany;\\\" passwords with \\\";howBig;\\\" characters\\\"\\ni = 0\\nwhile i < howMany\\n\\tpw$\\t= \\\"\\\"\\n\\tok$\\t= \\\"....\\\"\\n\\tpw$\\t= \\\"\\\"\\n\\tfor j = 1 to howBig\\n\\t \\tw$ = mid$(a$(0),int(rnd(0) * len(a$(0))) + 1,1)\\n\\t\\tfor k = 1 to 4\\n\\t\\t\\tif instr(a$(k),w$) then ok$ = left$(ok$,k-1) + \\\"*\\\" + mid$(ok$,k+1)\\n\\t \\tnext k\\n\\t \\tpw$ = pw$ + w$\\n\\tnext j\\n\\tif ok$ = \\\"****\\\" then\\t' Do we pass with the requirements\\n\\t\\ti\\t= i + 1\\n\\t\\tprint \\\"#\\\";i;\\\" \\\";pw$\\n\\tend if\\nWEND\\ngoto [main]\\n[exit]\\t' get outta here\\nend\\n\",\n \"language\": \"Run-BASIC\"\n },\n {\n \"code\": \"use rand::distributions::Alphanumeric;\\nuse rand::prelude::IteratorRandom;\\nuse rand::{thread_rng, Rng};\\nuse std::iter;\\nuse std::process;\\nuse structopt::StructOpt;\\nconst OTHER_VALUES: &str = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\";\\n\\n// the core logic that creates our password\\nfn generate_password(length: u8) -> String {\\n // cache thread_rng for better performance\\n let mut rng = thread_rng();\\n // the Alphanumeric struct provides 3/4\\n // of the characters for passwords\\n // so we can sample from it\\n let mut base_password: Vec<char> = iter::repeat(())\\n .map(|()| rng.sample(Alphanumeric))\\n .take(length as usize)\\n .collect();\\n let mut end_range = 10;\\n // if the user supplies a password length less than 10\\n // we need to adjust the random sample range\\n if length < end_range {\\n end_range = length;\\n }\\n // create a random count of how many other characters to add\\n let mut to_add = rng.gen_range(1, end_range as usize);\\n loop {\\n // create an iterator of required other characters\\n let special = OTHER_VALUES.chars().choose(&mut rng).unwrap();\\n to_add -= 1;\\n base_password[to_add] = special;\\n if to_add == 0 {\\n break;\\n }\\n }\\n base_password.iter().collect()\\n}\\n\\n#[derive(StructOpt, Debug)]\\n#[structopt(name = \\\"password-generator\\\", about = \\\"A simple password generator.\\\")]\\nstruct Opt {\\n // make it SECURE by default\\n // https://cheatsheetseries.owasp.org/cheatsheets/Password_Storage_Cheat_Sheet.html\\n /// The password length\\n #[structopt(default_value = \\\"160\\\")]\\n length: u8,\\n /// How many passwords to generate\\n #[structopt(default_value = \\\"1\\\")]\\n count: u8,\\n}\\n\\nfn main() {\\n // instantiate the options and use them as\\n // arguments to our password generator\\n let opt = Opt::from_args();\\n const MINIMUM_LENGTH: u8 = 30;\\n if opt.length < MINIMUM_LENGTH {\\n eprintln!(\\n \\\"Please provide a password length greater than or equal to {}\\\",\\n MINIMUM_LENGTH\\n );\\n process::exit(1);\\n }\\n for index in 0..opt.count {\\n let password = generate_password(opt.length);\\n // do not print a newline after the last password\\n match index + 1 == opt.count {\\n true => print!(\\\"{}\\\", password),\\n _ => println!(\\\"{}\\\", password),\\n };\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"object makepwd extends App {\\n\\n def newPassword( salt:String = \\\"\\\", length:Int = 13, strong:Boolean = true ) = {\\n\\n val saltHash = salt.hashCode & ~(1 << 31)\\n\\n import java.util.Calendar._\\n\\n val cal = java.util.Calendar.getInstance()\\n val rand = new scala.util.Random((cal.getTimeInMillis+saltHash).toLong)\\n val lower = ('a' to 'z').mkString\\n val upper = ('A' to 'Z').mkString\\n val nums = ('0' to '9').mkString\\n val strongs = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n val unwanted = if( strong ) \\\"\\\" else \\\"0Ol\\\"\\n\\n val pool = (lower + upper + nums + (if( strong ) strongs else \\\"\\\")).\\n filterNot( c => unwanted.contains(c) )\\n\\n val pwdStream = Stream.continually( (for( n <- 1 to length; c = pool(rand.nextInt(pool.length) ) ) yield c).mkString )\\n\\n // Drop passwords that don't have at least one of each required character\\n pwdStream.filter( pwd =>\\n pwd.exists(_.isUpper) &&\\n pwd.exists(_.isLower) &&\\n pwd.exists(_.isDigit) &&\\n (if(strong) pwd.exists(! _.isLetterOrDigit) else true)\\n ).head\\n }\\n\\n val pwdLength = \\\"\\\"\\\"^(\\\\d{1,4})$\\\"\\\"\\\".r\\n val howMany = \\\"\\\"\\\"^\\\\-n(\\\\d{0,3})$\\\"\\\"\\\".r\\n val help = \\\"\\\"\\\"^\\\\-\\\\-(help)$\\\"\\\"\\\".r\\n val pwdSalt = \\\"\\\"\\\"^\\\\-s(.*)\\\"\\\"\\\".r\\n val strongOption = \\\"\\\"\\\"(?i)(strong)\\\"\\\"\\\".r\\n\\n\\n var (salt,length,strong,helpWanted,count,unknown) = (\\\"\\\",13,false,false,1,false)\\n\\n args.foreach{\\n case pwdLength(l) => length = math.min(math.max(l.toInt,6),4000)\\n case strongOption(s) => strong = true\\n case pwdSalt(s) => salt = s\\n case howMany(c) => count = math.min(c.toInt,100)\\n case help(h) => helpWanted = true\\n case _ => unknown = true\\n }\\n\\n if( count > 1 ) println\\n\\n if( helpWanted || unknown ) {\\n println( \\\"\\\"\\\"\\n makepwd <length> \\\"strong\\\" -s<salt> -n<how-many> --help\\n\\n <length> = how long should the password be\\n \\\"strong\\\" = strong password, omit if special characters not wanted\\n -s<salt> = \\\"-s\\\" followed by any non-blank characters\\n (increases password randomness)\\n -n<how-many> = \\\"-n\\\" followed by the number of passwords wanted\\n --help = displays this\\n\\n For example: makepwd 13 strong -n20 -sABCDEFG\\n\\\"\\\"\\\".stripMargin )\\n }\\n else for( i <- 1 to count ) println( newPassword( i + salt, length, strong ) )\\n\\n if( count > 1 ) println\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"$ include \\\"seed7_05.s7i\\\";\\n\\nconst func string: generate (in integer: length) is func\\n result\\n var string: password is \\\"\\\";\\n local\\n const set of char: allowed is {'!' .. '~'} - {'\\\\\\\\', '`'};\\n const set of char: special is allowed - {'A' .. 'Z'} | {'a' .. 'z'} | {'0' .. '9'};\\n var integer: index is 0;\\n var char: ch is ' ';\\n var boolean: ucPresent is FALSE;\\n var boolean: lcPresent is FALSE;\\n var boolean: digitPresent is FALSE;\\n var boolean: specialPresent is FALSE;\\n begin\\n repeat\\n password := \\\"\\\";\\n ucPresent := FALSE;\\n lcPresent := FALSE;\\n digitPresent := FALSE;\\n specialPresent := FALSE;\\n for index range 1 to length do\\n ch := rand(allowed);\\n ucPresent := ucPresent or ch in {'A' .. 'Z'};\\n lcPresent := lcPresent or ch in {'a' .. 'z'};\\n digitPresent := digitPresent or ch in {'0' .. '9'};\\n specialPresent := specialPresent or ch in special;\\n password &:= ch;\\n end for;\\n until ucPresent and lcPresent and digitPresent and specialPresent;\\n end func;\\n\\nconst proc: main is func\\n local\\n var integer: length is 0;\\n var integer: count is 0;\\n begin\\n if length(argv(PROGRAM)) <> 2 or not isDigitString(argv(PROGRAM)[1]) or\\n not isDigitString(argv(PROGRAM)[2]) then\\n writeln(\\\"Usage: pwgen length count\\\");\\n writeln(\\\" pwgen -?\\\");\\n writeln(\\\"length: The length of the password (min 4)\\\");\\n writeln(\\\"count: How many passwords should be generated\\\");\\n writeln(\\\"-? Write this text\\\");\\n else\\n length := integer(argv(PROGRAM)[1]);\\n count := integer(argv(PROGRAM)[2]);\\n if length < 4 then\\n writeln(\\\"Passwords must be at least 4 characters long.\\\");\\n else\\n for count do\\n writeln(generate(length));\\n end for;\\n end if;\\n end if;\\n end func;\\n\",\n \"language\": \"Seed7\"\n },\n {\n \"code\": \"#include <stdlib.h>\\n#include <time.h>\\n\\nvoid initRandom(const unsigned int seed){\\n if(seed==0){\\n srand((unsigned) time(NULL));\\n }\\n else{\\n srand(seed);\\n }\\n}\\n\\nint getRand(const int upperBound){\\n return rand() % upperBound;\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"int getRand(const int upperBound);\\nvoid initRandom(const unsigned int seed);\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import Foundation\\nimport GameplayKit // for use of inbuilt Fisher-Yates-Shuffle\\n\\n/* Prints the usage of this code */\\nfunc printHelp() -> Void {\\n print(\\\"Usage: PasswordGenerator [-l:length] [-c:count] [-s:seed] [-x:exclude] [-h:help]\\\")\\n print(\\\"\\\\t-l: length of the passwords (at leas 4 characters)\\\")\\n print(\\\"\\\\t-c: number of passwords to generate\\\")\\n print(\\\"\\\\t-s: seed of the random number generator\\\")\\n print(\\\"\\\\t-x: exclude of visually similar characters \\\\\\\"Il1O05S2Z\\\\\\\"\\\")\\n print(\\\"\\\\t-h: print this help\\\")\\n exit(0)\\n}\\n\\n/* Set characters for generating passwords */\\nlet _lower:String = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nlet _lowerWithoutSimilar:String = \\\"abcdefghijkmnopqrstuvwxyz\\\"\\nlet _upper:String = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nlet _upperWithoutSimilar = \\\"ABCDEFGHJKLMNPQRTUVWXY\\\"\\nlet _number:String = \\\"0123456789\\\"\\nlet _numerWithoutSimilar:String = \\\"1346789\\\"\\nlet _other:String = \\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\n\\n/* Generate character arrays out of strings */\\nlet upper = Array(_upper.characters)\\nlet upperWithoutSimilar = Array(_upperWithoutSimilar.characters)\\nlet lower = Array(_lower.characters)\\nlet lowerWithoutSimilar = Array(_lowerWithoutSimilar.characters)\\nlet other = Array(_other.characters)\\nlet number = Array(_number.characters)\\nlet numberWithoutSimilar = Array(_numerWithoutSimilar.characters)\\n\\nvar length:Int=0, count:Int=0, seed:Int=0, xclude:Bool=false\\n\\n/* Parse CLI arguments */\\nfor i in 1..<CommandLine.arguments.count{\\n var arg = CommandLine.arguments[i]\\n var argument = arg.components(separatedBy: \\\":\\\")\\n switch(argument[0]){\\n case \\\"-l\\\":\\n length=Int(argument[1])!\\n if length < 4 {\\n print(\\\"A password must contain of at least 4 characters.\\\")\\n exit(-1)\\n }\\n break\\n case \\\"-c\\\":\\n count=Int(argument[1])!\\n break\\n case \\\"-s\\\":\\n seed=Int(argument[1])!\\n break\\n case \\\"-x\\\":\\n xclude=true\\n break\\n case \\\"-h\\\":\\n printHelp()\\n default:\\n print(\\\"Could not parse CLI arguments. Use -h for help.\\\")\\n exit(0)\\n }\\n}\\n\\n/* Generate password of given length */\\nfunc generatePassword(length len:Int, exclude xcl:Bool) -> String{\\n\\n var ret:String = \\\"\\\", loopCount:Int = 0\\n\\n while(loopCount < len){\\n if ret.characters.count < len {\\n if xcl {\\n ret += String(upperWithoutSimilar[Int(getRand(Int32(upperWithoutSimilar.count-1)))])\\n }\\n else {\\n ret += String(upper[Int(getRand(Int32(upper.count)))])\\n }\\n }\\n\\n if ret.characters.count < len {\\n if xcl {\\n ret += String(lowerWithoutSimilar[Int(getRand(Int32(lowerWithoutSimilar.count-1)))])\\n }\\n else {\\n ret += String(lower[Int(getRand(Int32(lower.count-1)))])\\n }\\n }\\n\\n if ret.characters.count < len {\\n if xcl {\\n ret += String(numberWithoutSimilar[Int(getRand(Int32(numberWithoutSimilar.count-1)))])\\n }\\n else {\\n ret += String(number[Int(getRand(Int32(number.count-1)))])\\n }\\n }\\n\\n if ret.characters.count < len {\\n ret += String(other[Int(getRand(Int32(other.count-1)))])\\n }\\n loopCount += 4\\n }\\n\\n // Shuffle the array with an internal shuffle function\\n let shuffled = GKRandomSource.sharedRandom().arrayByShufflingObjects(in: Array(ret.characters))\\n ret = \\\"\\\"\\n for element in shuffled {\\n ret += String(describing: element)\\n }\\n return ret\\n}\\n\\nif xclude {\\n print(\\\"Generating \\\\(count) passwords with length \\\\(length) excluding visually similar characters...\\\")\\n}\\nelse {\\n print(\\\"Generating \\\\(count) passwords with length \\\\(length) not excluding visually similar characters...\\\")\\n}\\n\\ninitRandom(UInt32(0)) // initialize with C func srand()\\n\\n// generate the passwords\\nfor i in 1...count {\\n print(\\\"\\\\(i).\\\\t\\\\(generatePassword(length:length,exclude:xclude))\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"Option Explicit\\nSub Main()\\nDim s() As String, i As Long\\n Debug.Print \\\"list of 10 passwords : \\\"\\n'do a list of 10 passwords with password's lenght = 21 and visually similar = False\\n s = Gp(10, 21, False)\\n 'return\\n Debug.Print \\\"1- with password's lenght = 21 and visually similar = False :\\\"\\n For i = 1 To UBound(s): Debug.Print s(i): Next\\n'do a list of 10 passwords with pattern = \\\"A/9-a/1-9/4-!/5\\\" and visually similar = True\\n s = Gp(10, \\\"A/9-a/1-9/4-!/5\\\", True)\\n 'return\\n Debug.Print \\\"2- with pattern = \\\"\\\"A/9-a/1-9/4-!/5\\\"\\\" and visually similar = True :\\\"\\n For i = 1 To UBound(s): Debug.Print s(i): Next\\nEnd Sub\\nSub HelpMe()\\nDim s As String\\n s = \\\"Help :\\\" & vbCrLf\\n s = s & \\\"----------------------------------\\\" & vbCrLf\\n s = s & \\\"The function (named : Gp) needs 3 required parameters :\\\" & vbCrLf & vbCrLf\\n s = s & \\\"1- Nb_Passwords (Long) : the number of passwords to generate.\\\" & vbCrLf & vbCrLf\\n s = s & \\\"2- NbChar_Or_Pattern (Variant) : either a number or a pattern\\\" & vbCrLf\\n s = s & \\\" If number : NbChar_Or_Pattern specify the password length. All the digits are random ASCII characters\\\" & vbCrLf\\n s = s & \\\" If pattern : NbChar_Or_Pattern specify the password length and the layout of passwords.\\\" & vbCrLf\\n s = s & \\\" The pattern is built like this :\\\" & vbCrLf\\n s = s & \\\" \\\"\\\"A\\\"\\\" means Upper case, \\\"\\\"a\\\"\\\" means lower case, 9 means numerics and ! means others characters.\\\" & vbCrLf\\n s = s & \\\" \\\"\\\"-\\\"\\\" is the separator between these values.\\\" & vbCrLf\\n s = s & \\\" the number of characters is specified after the sign (required): \\\"\\\"/\\\"\\\"\\\" & vbCrLf\\n s = s & \\\" example of pattern available : \\\"\\\"A/3-a/2-9/1-!/1\\\"\\\"\\\" & vbCrLf & vbCrLf\\n s = s & \\\"3- Excl_Similar_Chars (Boolean) : True if you want the option of excluding visually similar characters.\\\"\\n Debug.Print s\\nEnd Sub\\nPrivate Function Gp(Nb_Passwords As Long, NbChar_Or_Pattern As Variant, Excl_Similar_Chars As Boolean) As String()\\n'generate a list of passwords\\nDim l As Long, s() As String\\n ReDim s(1 To Nb_Passwords)\\n If IsNumeric(NbChar_Or_Pattern) Then\\n For l = 1 To Nb_Passwords\\n s(l) = p(CLng(NbChar_Or_Pattern), Excl_Similar_Chars)\\n Next l\\n Else\\n For l = 1 To Nb_Passwords\\n s(l) = ttt(CStr(NbChar_Or_Pattern), Excl_Similar_Chars)\\n Next l\\n End If\\n Gp = s\\nEnd Function\\nPublic Function p(n As Long, e As Boolean) As String\\n'create 1 password without pattern (just with the password's lenght)\\nDim t As String, i As Long, a As Boolean, b As Boolean, c As Boolean, d As Boolean\\n Randomize Timer\\n If n < 4 Then\\n p = \\\"Error. Numbers of characters is too small. Min : 4\\\"\\n ElseIf n >= 4 And n < 7 Then\\n T = u(122, 97) & u(90, 65) & u(57, 48) & v\\n For j = 5 To n\\n i = Int((4 * Rnd) + 1)\\n Select Case i\\n Case 1: T = T & u(122, 97)\\n Case 2: T = T & u(90, 65)\\n Case 3: T = T & u(57, 48)\\n Case 4: T = T & v\\n End Select\\n Next j\\n 'Debug.Print T\\n p = y(T)\\n Else\\n Do\\n i = Int((4 * Rnd) + 1)\\n Select Case i\\n Case 1: t = t & u(122, 97): a = True\\n Case 2: t = t & u(90, 65): b = True\\n Case 3: t = t & u(57, 48): c = True\\n Case 4: t = t & v: d = True\\n End Select\\n If Len(t) >= 2 And e Then\\n If x(t) Then t = Left(t, Len(t) - 1)\\n End If\\n If Len(t) = n Then\\n If a And b And c And d Then\\n Exit Do\\n Else\\n w t, a, b, c, d\\n p = p(n, e)\\n End If\\n ElseIf Len(t) > n Then\\n w t, a, b, c, d\\n p = p(n, e)\\n End If\\n Loop\\n p = t\\n End If\\nEnd Function\\nPublic Function ttt(s As String, e As Boolean) As String\\n'create 1 password with pattern\\nDim a, i As Long, j As Long, st As String, Nb As Long\\n a = Split(s, \\\"-\\\")\\n For i = 0 To UBound(a)\\n Select Case Left(a(i), 1)\\n Case \\\"A\\\"\\n Nb = CLng(Split(a(i), \\\"/\\\")(1)): j = 0\\n Do\\n j = j + 1\\n st = st & u(90, 65)\\n If Len(st) >= 2 And e Then\\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\\n End If\\n Loop While j < Nb\\n Case \\\"a\\\"\\n Nb = CLng(Split(a(i), \\\"/\\\")(1)): j = 0\\n Do\\n j = j + 1\\n st = st & u(122, 97)\\n If Len(st) >= 2 And e Then\\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\\n End If\\n Loop While j < Nb\\n Case \\\"9\\\"\\n Nb = CLng(Split(a(i), \\\"/\\\")(1)): j = 0\\n Do\\n j = j + 1\\n st = st & u(57, 48)\\n If Len(st) >= 2 And e Then\\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\\n End If\\n Loop While j < Nb\\n Case \\\"!\\\"\\n Nb = CLng(Split(a(i), \\\"/\\\")(1)): j = 0\\n Do\\n j = j + 1\\n st = st & v\\n If Len(st) >= 2 And e Then\\n If x(st) Then st = Left(st, Len(st) - 1): j = j - 1\\n End If\\n Loop While j < Nb\\n End Select\\n Next i\\n ttt = y(st)\\nEnd Function\\nPrivate Function u(m As Long, l As Long) As String\\n'random 1 character in lower/upper case or numeric\\n Randomize Timer\\n u = Chr(Int(((m - l + 1) * Rnd) + l))\\nEnd Function\\nPrivate Function v() As String\\n'random 1 character \\\"special\\\"\\n Randomize Timer\\n v = Mid(\\\"!\\\"\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\", Int((30 * Rnd) + 1), 1)\\nEnd Function\\nPrivate Sub w(t As String, a As Boolean, b As Boolean, c As Boolean, d As Boolean)\\n t = vbNullString: a = False: b = False: c = False: d = False\\nEnd Sub\\nPrivate Function x(s As String) As Boolean\\n'option of excluding visually similar characters\\nDim t, i As Long\\nConst d As String = \\\"Il I1 l1 lI 1l 1I 0O O0 5S S5 2Z 2? Z? Z2 ?2 ?Z DO OD\\\"\\n t = Split(d, \\\" \\\")\\n For i = 0 To UBound(t)\\n If Right(s, 2) = t(i) Then\\n x = True: Exit Function\\n End If\\n Next\\nEnd Function\\nPrivate Function y(s As String) As String\\n'shuffle the password's letters only if pattern\\nDim i&, t, r As String, d() As Long\\n t = Split(StrConv(s, vbUnicode), Chr(0))\\n d = z(UBound(t))\\n For i = 0 To UBound(t)\\n r = r & t(d(i))\\n Next i\\n y = Left(r, Len(r) - 1)\\nEnd Function\\nPrivate Function z(l As Long) As Long()\\n'http://rosettacode.org/wiki/Best_shuffle#VBA\\nDim i As Long, ou As Long, temp() As Long\\nDim c As New Collection\\n ReDim temp(l)\\n If l = 1 Then\\n temp(0) = 0\\n ElseIf l = 2 Then\\n temp(0) = 1: temp(1) = 0\\n Else\\n Randomize\\n Do\\n ou = Int(Rnd * l)\\n On Error Resume Next\\n c.Add CStr(ou), CStr(ou)\\n If Err <> 0 Then\\n On Error GoTo 0\\n Else\\n temp(ou) = i\\n i = i + 1\\n End If\\n Loop While c.Count <> l\\n End If\\n z = temp\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./ioutil\\\" for FileUtil, File, Input\\nimport \\\"./fmt\\\" for Fmt\\nimport \\\"os\\\" for Process\\n\\nvar r = Random.new()\\nvar rr = Random.new() // use a separate generator for shuffles\\nvar lb = FileUtil.lineBreak\\n\\nvar lower = \\\"abcdefghijklmnopqrstuvwxyz\\\"\\nvar upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\"\\nvar digit = \\\"0123456789\\\"\\nvar other = \\\"\\\"\\\"!\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\"\\\"\\\"\\n\\nvar exclChars = [\\n \\\"'I', 'l' and '1'\\\",\\n \\\"'O' and '0' \\\",\\n \\\"'5' and 'S' \\\",\\n \\\"'2' and 'Z' \\\"\\n]\\n\\nvar shuffle = Fn.new { |s|\\n var sl = s.toList\\n rr.shuffle(sl)\\n return sl.join()\\n}\\n\\nvar generatePasswords = Fn.new { |pwdLen, pwdNum, toConsole, toFile|\\n var ll = lower.count\\n var ul = upper.count\\n var dl = digit.count\\n var ol = other.count\\n var tl = ll + ul + dl + ol\\n var fw = toFile ? File.create(\\\"pwds.txt\\\") : null\\n\\n if (toConsole) System.print(\\\"\\\\nThe generated passwords are:\\\")\\n for (i in 0...pwdNum) {\\n var pwd = lower[r.int(ll)] + upper[r.int(ul)] + digit[r.int(dl)] + other[r.int(ol)]\\n for (j in 0...pwdLen - 4) {\\n var k = r.int(tl)\\n pwd = pwd + ((k < ll) ? lower[k] :\\n (k < ll + ul) ? upper[k - ll] :\\n (k < tl - ol) ? digit[k - ll - ul] : other[tl - 1 - k])\\n }\\n for (i in 1..5) pwd = shuffle.call(pwd) // shuffle 5 times say\\n if (toConsole) Fmt.print(\\\" $2d: $s\\\", i + 1, pwd)\\n if (toFile) {\\n fw.writeBytes(pwd)\\n if (i < pwdNum - 1) fw.writeBytes(lb)\\n }\\n }\\n if (toFile) {\\n System.print(\\\"\\\\nThe generated passwords have been written to the file pwds.txt\\\")\\n fw.close()\\n }\\n}\\n\\nvar printHelp = Fn.new {\\n System.print(\\\"\\\"\\\"\\nThis program generates up to 99 passwords of between 5 and 20 characters in\\nlength.\\n\\nYou will be prompted for the values of all parameters when the program is run\\n- there are no command line options to memorize.\\n\\nThe passwords can either be written to the console or to a file (pwds.txt),\\nor both.\\n\\nThe passwords must contain at least one each of the following character types:\\n lower-case letters : a -> z\\n upper-case letters : A -> Z\\n digits : 0 -> 9\\n other characters : !\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\n\\nOptionally, a seed can be set for the random generator\\n(any non-zero number) otherwise the default seed will be used.\\nEven if the same seed is set, the passwords won't necessarily be exactly\\nthe same on each run as additional random shuffles are always performed.\\n\\nYou can also specify that various sets of visually similar characters\\nwill be excluded (or not) from the passwords, namely: Il1 O0 5S 2Z\\n\\nFinally, the only command line options permitted are -h and -help which\\nwill display this page and then exit.\\n\\nAny other command line parameters will simply be ignored and the program\\nwill be run normally.\\n\\n\\\"\\\"\\\")\\n}\\n\\nvar args = Process.arguments\\nif (args.count == 1 && (args[0] == \\\"-h\\\" || args[0] == \\\"-help\\\")) {\\n printHelp.call()\\n return\\n}\\n\\nSystem.print(\\\"Please enter the following and press return after each one\\\")\\n\\nvar pwdLen = Input.integer(\\\" Password length (5 to 20) : \\\", 5, 20)\\nvar pwdNum = Input.integer(\\\" Number to generate (1 to 99) : \\\", 1, 99)\\n\\nvar seed = Input.number (\\\" Seed value (0 to use default) : \\\")\\nif (seed != 0) r = Random.new(seed)\\n\\nSystem.print(\\\" Exclude the following visually similar characters\\\")\\nfor (i in 0..3) {\\n var yn = Input.option(\\\" %(exclChars[i]) y/n : \\\", \\\"ynYN\\\")\\n if (yn == \\\"y\\\" || yn == \\\"Y\\\") {\\n if (i == 0) {\\n upper = upper.replace(\\\"I\\\", \\\"\\\")\\n lower = lower.replace(\\\"l\\\", \\\"\\\")\\n digit = digit.replace(\\\"1\\\", \\\"\\\")\\n } else if (i == 1) {\\n upper = upper.replace(\\\"O\\\", \\\"\\\")\\n digit = digit.replace(\\\"0\\\", \\\"\\\")\\n } else if (i == 2) {\\n upper = upper.replace(\\\"S\\\", \\\"\\\")\\n digit = digit.replace(\\\"5\\\", \\\"\\\")\\n } else if (i == 3) {\\n upper = upper.replace(\\\"Z\\\", \\\"\\\")\\n digit = digit.replace(\\\"2\\\", \\\"\\\")\\n }\\n }\\n}\\n\\nvar toConsole = Input.option(\\\" Write to console y/n : \\\", \\\"ynYN\\\")\\ntoConsole = toConsole == \\\"y\\\" || toConsole == \\\"Y\\\"\\nvar toFile = true\\nif (toConsole) {\\n toFile = Input.option(\\\" Write to file y/n : \\\", \\\"ynYN\\\")\\n toFile = toFile == \\\"y\\\" || toFile == \\\"Y\\\"\\n}\\n\\ngeneratePasswords.call(pwdLen, pwdNum, toConsole, toFile)\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"string 0;\\n\\nfunc In(C, Str);\\nchar C, Str;\\n[while Str(0) do\\n if C = Str(0) then return true else Str:= Str+1;\\nreturn false;\\n];\\n\\nfunc New_password(Length, Readable);\\nint Length, Readable, I, C;\\nchar Password_chars(100), Punctuation, Visually_similar;\\n[if Length < 4 then\\n [Text(0, \\\"Password length = \\\"); IntOut(0, Length);\\n Text(0, \\\" is too short, minimum length = 4.\\\");\\n return \\\"\\\";\\n ];\\nPunctuation:= \\\"!^\\\"#$%&\\\\'()*+,-./:;<=>?@[]^^_{|}~\\\";\\nVisually_similar:= \\\"Il1O05S2Z\\\";\\nfor I:= 0 to Length-1 do\\n [case Ran(4) of\\n 0: C:= Ran(26) + ^a;\\n 1: C:= Ran(26) + ^A;\\n 2: C:= Ran(10) + ^0;\\n 3: C:= Punctuation(Ran(31))\\n other [];\\n Password_chars(I):= C;\\n if Readable and In(C, Visually_similar) then I:= I-1;\\n ];\\nPassword_chars(I):= 0;\\nreturn Password_chars;\\n];\\n\\nproc Password_generator(Length, Qty, Readable);\\nint Length, Qty, Readable, I;\\nfor I:= 0 to Qty-1 do\\n [Text(0, New_password(Length, Readable)); CrLf(0)];\\n\\n[Password_generator(14, 4, true);\\n Password_generator( 8, 4, false);\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"var pwdLen=10, pwds=1, xclude=\\\"\\\";\\n\\nargh:=Utils.Argh(\\nL(\\\"+xclude\\\",\\\"\\\",\\\"Don't use these characters\\\",fcn(arg){ xclude=arg }),\\nL(\\\"+len\\\",\\\"\\\",\\\"Number of characters in password\\\", fcn(arg){ pwdLen=arg.toInt() } ),\\nL(\\\"+num\\\",\\\"\\\",\\\"Number of passwords to generate\\\", fcn(arg){ pwds=arg.toInt() } ),\\n);\\ntry{ argh.parse(vm.arglist) }catch{ System.exit(1) }\\n\\nisd:='wrap(w){ w.pump(String) - xclude }; // iterator to String\\ng1,g2,g3 := isd([\\\"a\\\"..\\\"z\\\"]), isd([\\\"A\\\"..\\\"Z\\\"]), isd([\\\"0\\\"..\\\"9\\\"]);\\ng4:=\\\"!\\\\\\\"#$%&'()*+,-./:;<=>?@[]^_{|}~\\\" - xclude;\\nall:=String(g1,g2,g3,g4);\\nfcn rnd(s){ s[(0).random(s.len())] } // pick a random character from s\\n // generate random characters of filler needed to complete password\\nfill:=(pwdLen-4).pump.fp(String,rnd.fp(all)); // a deferred/pending calculation\\n\\ndo(numPwds){\\n // Data is byte bucket (and editor). I can shuffle a Data but not a String.\\n pwd:=T(g1,g2,g3,g4).pump(Data,rnd); // 1 from each of these into a Data\\n pwd.extend(fill()).shuffle().text.println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Password-generator"}}},{"rowIdx":1493,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Peaceful_chess_queen_armies\n","language":"00-META"},{"code":"In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces ''not'' of its own colour.\n<br>\n<table style=\"font-weight:bold\">\n <tr align=\"center\" valign=\"middle\">\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n <td style=\"width:16pt; height:16pt;\">⇖</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\">⇑</td>\n <td style=\"width:16pt; height:16pt;\">⇗</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n</tr>\n <tr align=\"center\" valign=\"middle\">\n <td style=\"width:16pt; height:16pt;\">⇐</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\">⇐</td>\n <td style=\"width:16pt; height:16pt;\"><font color=\"lime\">♛</font></td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\">⇒</td>\n <td style=\"width:16pt; height:16pt;\">⇒</td>\n</tr>\n <tr align=\"center\" valign=\"middle\">\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n <td style=\"width:16pt; height:16pt;\">⇙</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\">⇓</td>\n <td style=\"width:16pt; height:16pt;\">⇘</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n</tr>\n <tr align=\"center\" valign=\"middle\">\n <td style=\"width:16pt; height:16pt;\">⇙</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n <td style=\"width:16pt; height:16pt;\">⇓</td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n <td style=\"width:16pt; height:16pt;\">⇘</td>\n</tr>\n <tr align=\"center\" valign=\"middle\">\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n <td style=\"width:16pt; height:16pt;\"></td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\">⇓</td>\n <td style=\"width:16pt; height:16pt;\"></td>\n <td style=\"width:16pt; height:16pt;\" bgcolor=\"silver\"></td>\n</tr>\n</table>\n<br>\n\nThe goal of Peaceful chess queen armies is to arrange <code>m</code> black queens and <code>m</code> white queens on an <code>n-by-n</code> square grid, (the board), so that ''no queen attacks another of a different colour''.\n\n\n;Task:\n# Create a routine to represent two-colour queens on a 2-D board. (Alternating black/white background colours, Unicode chess pieces and other embellishments are not necessary, but may be used at your discretion).\n# Create a routine to generate at least one solution to placing <code>m</code> equal numbers of black and white queens on an <code>n</code> square board.\n# Display here results for the <code>m=4, n=5</code> case.\n\n\n;References:\n* [http://www.mathopt.org/Optima-Issues/optima62.pdf Peaceably Coexisting Armies of Queens] (Pdf) by Robert A. Bosch. Optima, the Mathematical Programming Socity newsletter, issue 62.\n* [https://oeis.org/A250000 A250000] OEIS\n<br><br>\n\n","language":"00-TASK"},{"code":"T.enum Piece\n EMPTY\n BLACK\n WHITE\n\nF isAttacking(queen, pos)\n R queen.x == pos.x\n | queen.y == pos.y\n | abs(queen.x - pos.x) == abs(queen.y - pos.y)\n\nF place(m, n, &pBlackQueens, &pWhiteQueens)\n I m == 0\n R 1B\n\n V placingBlack = 1B\n L(i) 0 .< n\n L(j) 0 .< n\n V pos = (i, j)\n L(queen) pBlackQueens\n I queen == pos | (!placingBlack & isAttacking(queen, pos))\n L.break\n L.was_no_break\n L(queen) pWhiteQueens\n I queen == pos | (placingBlack & isAttacking(queen, pos))\n L.break\n L.was_no_break\n I placingBlack\n pBlackQueens [+]= pos\n placingBlack = 0B\n E\n pWhiteQueens [+]= pos\n I place(m - 1, n, &pBlackQueens, &pWhiteQueens)\n R 1B\n pBlackQueens.pop()\n pWhiteQueens.pop()\n placingBlack = 1B\n\n I !placingBlack\n pBlackQueens.pop()\n R 0B\n\nF printBoard(n, blackQueens, whiteQueens)\n V board = [Piece.EMPTY] * (n * n)\n\n L(queen) blackQueens\n board[queen.x * n + queen.y] = Piece.BLACK\n\n L(queen) whiteQueens\n board[queen.x * n + queen.y] = Piece.WHITE\n\n L(b) board\n V i = L.index\n I i != 0 & i % n == 0\n print()\n I b == BLACK\n print(‘B ’, end' ‘’)\n E I b == WHITE\n print(‘W ’, end' ‘’)\n E\n V j = i I/ n\n V k = i - j * n\n I j % 2 == k % 2\n print(‘x ’, end' ‘’)\n E\n print(‘o ’, end' ‘’)\n print(\"\\n\")\n\nV nms = [\n (2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)\n ]\n\nL(nm) nms\n print(‘#. black and #. white queens on a #. x #. board:’.format(nm[1], nm[1], nm[0], nm[0]))\n [(Int, Int)] blackQueens, whiteQueens\n I place(nm[1], nm[0], &blackQueens, &whiteQueens)\n printBoard(nm[0], blackQueens, whiteQueens)\n E\n print(\"No solution exists.\\n\")\n","language":"11l"},{"code":"(********************************************************************)\n\n#define ATS_DYNLOADFLAG 0\n\n#include \"share/atspre_define.hats\"\n#include \"share/atspre_staload.hats\"\n\nstaload UN = \"prelude/SATS/unsafe.sats\"\n\n#define NIL list_vt_nil ()\n#define :: list_vt_cons\n\n#ifndef NDEBUG #then\n (* Safety is relatively unimportant in this program.\n Therefore I have made it so you can put ‘-DATS NDEBUG=1’ on\n your patscc command line, to skip some assertloc tests. *)\n #define NDEBUG 0\n#endif\n\n(********************************************************************)\n\n#define EMPTY 0\n#define BLACK 1\n#define WHITE ~1\n\nstadef is_color (c : int) : bool = (~1 <= c && c <= 1)\nstadef reverse_color (c : int) : int = ~c\n\ntypedef color_t (tk : tkind, c : int) =\n [is_color c]\n g1int (tk, c)\ntypedef color_t (tk : tkind) =\n [c : int | is_color c]\n g1int (tk, c)\n\nfn {tk : tkind}\nreverse_color {c : int | is_color c}\n (c : g1int (tk, c)) :<>\n [c_rev : int | is_color c_rev;\n c_rev == reverse_color c]\n g1int (tk, c_rev) =\n (* This template is a fancy way to say ‘minus’. *)\n ~c\n\n(********************************************************************)\n\n(* Matrix indices will run from 0..n-1 rather than 1..n. *)\n\n#define SIDE_MAX 16 (* The maximum side size. For\n efficiency, please make it a\n power of two. *)\n#define BOARD_SIZE 256 (* The storage size for a board. *)\n\nprval _ = prop_verify {SIDE_MAX * SIDE_MAX == BOARD_SIZE} ()\n\nfn {tk : tkind}\nrow_index {k : int | 0 <= k; k < BOARD_SIZE}\n (k : g1int (tk, k)) :<>\n [i : int | 0 <= i; i < SIDE_MAX]\n g1int (tk, i) =\n (* Let the C compiler convert this to bitmasking. *)\n g1int_nmod (k, g1i2i SIDE_MAX)\n\nfn {tk : tkind}\ncolumn_index {k : int | 0 <= k; k < BOARD_SIZE}\n (k : g1int (tk, k)) :<>\n [i : int | 0 <= i; i < SIDE_MAX]\n g1int (tk, i) =\n (* Let the C compiler convert this to a shift. *)\n k / g1i2i SIDE_MAX\n\nfn {tk : tkind}\nstorage_index {i, j : int | 0 <= i; i < SIDE_MAX;\n 0 <= j; j < SIDE_MAX}\n (i : g1int (tk, i),\n j : g1int (tk, j)) :<>\n [k : int | 0 <= k; k < BOARD_SIZE]\n g1int (tk, k) =\n (* Let the C compiler convert this to a shift and add. *)\n i + (j * g1i2i SIDE_MAX)\n\n(********************************************************************)\n\nextern fn {tk_index : tkind}\ntest_equiv$reindex_i\n {i, j : int | 0 <= i; 0 <= j}\n {n : int | 0 <= n; n <= SIDE_MAX;\n i < n; j < n}\n (i : g1int (tk_index, i),\n j : g1int (tk_index, j),\n n : g1int (tk_index, n)) :<>\n [i1 : int | 0 <= i1; i1 < SIDE_MAX]\n g1int (tk_index, i1)\n\nextern fn {tk_index : tkind}\ntest_equiv$reindex_j\n {i, j : int | 0 <= i; 0 <= j}\n {n : int | 0 <= n; n <= SIDE_MAX;\n i < n; j < n}\n (i : g1int (tk_index, i),\n j : g1int (tk_index, j),\n n : g1int (tk_index, n)) :<>\n [j1 : int | 0 <= j1; j1 < SIDE_MAX]\n g1int (tk_index, j1)\n\nextern fn {tk_color : tkind}\ntest_equiv$recolor\n {c : int | is_color c}\n (c : g1int (tk_color, c)) :<>\n [c1 : int | is_color c1]\n g1int (tk_color, c1)\n\nfn {tk_index, tk_color : tkind}\ntest_equiv {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n macdef reindex_i = test_equiv$reindex_i<tk_index>\n macdef reindex_j = test_equiv$reindex_j<tk_index>\n macdef recolor = test_equiv$recolor<tk_color>\n\n fun\n loopj {j : int | ~1 <= j; j < n} .<j + 1>.\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n),\n j : g1int (tk_index, j)) :\n bool =\n if j < g1i2i 0 then\n true\n else\n let\n fun loopi {i : int | ~1 <= i; i < n} .<i + 1>.\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n),\n j : g1int (tk_index, j),\n i : g1int (tk_index, i)) :\n bool =\n if i < g1i2i 0 then\n true\n else\n let\n val ka = storage_index<tk_index> (i, j)\n val color_a = a[ka]\n\n val i1 = test_equiv$reindex_i<tk_index> (i, j, n)\n val j1 = test_equiv$reindex_j<tk_index> (i, j, n)\n val kb = storage_index<tk_index> (i1, j1)\n val color_b = recolor b[kb]\n in\n if color_a = color_b then\n loopi (a, b, n, j, pred i)\n else\n false\n end\n in\n if loopi (a, b, n, j, g1i2i (pred n)) then\n loopj (a, b, n, pred j)\n else\n false\n end\n in\n loopj (a, b, n, g1i2i (pred n))\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_rotate0\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* No rotations or reflections. *)\n implement\n test_equiv$reindex_i<tk_index> (i, j, n) = i\n implement\n test_equiv$reindex_j<tk_index> (i, j, n) = j\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_rotate90\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Matrix rotation counterclockwise by 90 degrees. *)\n implement\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - j\n implement\n test_equiv$reindex_j<tk_index> (i, j, n) = i\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_rotate180\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Matrix rotation by 180 degrees. *)\n implement\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - i\n implement\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - j\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_rotate270\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Matrix rotation counterclockwise by 270 degrees. *)\n implement\n test_equiv$reindex_i<tk_index> (i, j, n) = j\n implement\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - i\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_reflecti\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Reverse the order of the rows. *)\n implement\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - i\n implement\n test_equiv$reindex_j<tk_index> (i, j, n) = j\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_reflectj\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Reverse the order of the columns. *)\n implement\n test_equiv$reindex_i<tk_index> (i, j, n) = i\n implement\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - j\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_reflect_diag_down\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Transpose the matrix around its main diagonal. *)\n implement\n test_equiv$reindex_i<tk_index> (i, j, n) = j\n implement\n test_equiv$reindex_j<tk_index> (i, j, n) = i\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\ntest_equiv_reflect_diag_up\n {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n bool =\n let\n (* Transpose the matrix around its main skew diagonal. *)\n implement\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - j\n implement\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - i\n in\n test_equiv<tk_index, tk_color> (a, b, n)\n end\n\nfn {tk_index, tk_color : tkind}\nboard_equiv {n : int | 0 <= n; n <= SIDE_MAX}\n (a : &(@[color_t tk_color][BOARD_SIZE]),\n b : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n),\n rotation_equiv_classes : bool) :\n bool =\n let\n (* Leave the colors unchanged. *)\n implement test_equiv$recolor<tk_color> (c) = c\n\n (* Test without rotations or reflections. *)\n val equiv = test_equiv_rotate0<tk_index, tk_color> (a, b, n)\n in\n if ~rotation_equiv_classes then\n equiv\n else\n let\n (* Leave the colors unchanged. *)\n implement test_equiv$recolor<tk_color> (c) = c\n\n val equiv =\n (equiv ||\n test_equiv_rotate90<tk_index, tk_color> (a, b, n) ||\n test_equiv_rotate180<tk_index, tk_color> (a, b, n) ||\n test_equiv_rotate270<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflecti<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflectj<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflect_diag_down<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflect_diag_up<tk_index, tk_color> (a, b, n))\n\n (* Reverse the colors of b in each test. *)\n implement test_equiv$recolor<tk_color> (c) = reverse_color c\n\n val equiv =\n (equiv ||\n test_equiv_rotate0<tk_index, tk_color> (a, b, n) ||\n test_equiv_rotate90<tk_index, tk_color> (a, b, n) ||\n test_equiv_rotate180<tk_index, tk_color> (a, b, n) ||\n test_equiv_rotate270<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflecti<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflectj<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflect_diag_down<tk_index, tk_color> (a, b, n) ||\n test_equiv_reflect_diag_up<tk_index, tk_color> (a, b, n))\n in\n equiv\n end\n end\n\n(********************************************************************)\n\nfn {tk_index : tkind}\nfprint_rule {n : int | 0 <= n; n <= SIDE_MAX}\n (f : FILEref,\n n : g1int (tk_index, n)) :\n void =\n let\n fun\n loop {j : int | 0 <= j; j <= n} .<n - j>.\n (j : g1int (tk_index, j)) :\n void =\n if j <> n then\n begin\n fileref_puts (f, \"----+\");\n loop (succ j)\n end\n in\n fileref_puts (f, \"+\");\n loop (g1i2i 0)\n end\n\nfn {tk_index, tk_color : tkind}\nfprint_board {n : int | 0 <= n; n <= SIDE_MAX}\n (f : FILEref,\n a : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n)) :\n void =\n if n <> 0 then\n let\n fun\n loopi {i : int | ~1 <= i; i < n} .<i + 1>.\n (f : FILEref,\n a : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n),\n i : g1int (tk_index, i)) :\n void =\n if i <> ~1 then\n let\n fun\n loopj {j : int | 0 <= j; j <= n} .<n - j>.\n (f : FILEref,\n a : &(@[color_t tk_color][BOARD_SIZE]),\n n : g1int (tk_index, n),\n i : g1int (tk_index, i),\n j : g1int (tk_index, j)) :\n void =\n if j <> n then\n let\n val k = storage_index<tk_index> (i, j)\n val color = a[k]\n val representation =\n if color = g1i2i BLACK then\n \"| B \"\n else if color = g1i2i WHITE then\n \"| W \"\n else\n \"| \"\n in\n fileref_puts (f, representation);\n loopj (f, a, n, i, succ j)\n end\n in\n fileref_puts (f, \"\\n\");\n loopj (f, a, n, i, g1i2i 0);\n fileref_puts (f, \"|\\n\");\n fprint_rule (f, n);\n loopi (f, a, n, pred i)\n end\n in\n fprint_rule (f, n);\n loopi (f, a, n, pred n)\n end\n\n(********************************************************************)\n\n(* M2_MAX equals the maximum number of queens of either color.\n Thus it is the maximum of 2*m, where m is the number of queens\n in an army. *)\n#define M2_MAX BOARD_SIZE\n\n(* The even-index queens are BLACK, the odd-index queens are WHITE. *)\n\nvtypedef board_record_vt (tk_color : tkind,\n p : addr) =\n @{\n pf = @[color_t tk_color][BOARD_SIZE] @ p,\n pfgc = mfree_gc_v p |\n p = ptr p\n }\nvtypedef board_record_vt (tk_color : tkind) =\n [p : addr | null < p]\n board_record_vt (tk_color, p)\n\nvtypedef board_record_list_vt (tk_color : tkind,\n n : int) =\n list_vt (board_record_vt tk_color, n)\nvtypedef board_record_list_vt (tk_color : tkind) =\n [n : int]\n board_record_list_vt (tk_color, n)\n\nfn\nboard_record_vt_free\n {tk_color : tkind}\n {p : addr}\n (record : board_record_vt (tk_color, p)) :\n void =\n let\n val @{\n pf = pf,\n pfgc = pfgc |\n p = p\n } = record\n in\n array_ptr_free (pf, pfgc | p)\n end\n\noverload free with board_record_vt_free\n\nfn\nboard_record_list_vt_free\n {tk_color : tkind}\n {n : int}\n (lst : board_record_list_vt (tk_color, n)) :\n void =\n let\n fun\n loop {n : int | 0 <= n} .<n>.\n (lst : board_record_list_vt (tk_color, n)) :\n void =\n case+ lst of\n | ~ NIL => ()\n | ~ head :: tail =>\n begin\n free head;\n loop tail\n end\n\n prval _ = lemma_list_vt_param lst\n in\n loop lst\n end\n\nfn {tk_index, tk_color : tkind}\nany_board_equiv {n : int | 0 <= n; n <= SIDE_MAX}\n (board : &(@[color_t tk_color][BOARD_SIZE]),\n lst : !board_record_list_vt tk_color,\n n : g1int (tk_index, n),\n rotation_equiv_classes : bool) :\n bool =\n let\n macdef board_equiv = board_equiv<tk_index, tk_color>\n\n fun\n loop {k : int | 0 <= k} .<k>.\n (board : &(@[color_t tk_color][BOARD_SIZE]),\n lst : !board_record_list_vt (tk_color, k),\n n : g1int (tk_index, n)) :\n bool =\n case+ lst of\n | NIL => false\n | head :: tail =>\n if board_equiv (!(head.p), board, n,\n rotation_equiv_classes) then\n true\n else\n loop (board, tail, n)\n\n prval _ = lemma_list_vt_param lst\n in\n loop (board, lst, n)\n end\n\nfn {tk_index, tk_color : tkind}\nqueens_to_board\n {count : int | 0 <= count; count <= M2_MAX}\n (queens : &(@[g1int tk_index][M2_MAX]),\n count : int count) :\n [p : addr | null < p]\n board_record_vt (tk_color, p) =\n let\n typedef color_t = color_t tk_color\n\n fun\n loop {k : int | ~1 <= k; k < count} .<k + 1>.\n (queens : &(@[g1int tk_index][M2_MAX]),\n board : &(@[color_t tk_color][BOARD_SIZE]),\n k : int k) :\n void =\n if 0 <= k then\n let\n val [coords : int] coords = queens[k]\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {0 <= coords} ()\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\n #else\n val _ = assertloc (g1i2i 0 <= coords)\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\n #endif\n in\n if g1int_nmod (k, 2) = 0 then\n board[coords] := g1i2i BLACK\n else\n board[coords] := g1i2i WHITE;\n loop (queens, board, pred k)\n end\n\n val @(pf, pfgc | p) = array_ptr_alloc<color_t> (i2sz BOARD_SIZE)\n val _ = array_initize_elt<color_t> (!p, i2sz BOARD_SIZE,\n g1i2i EMPTY)\n val _ = loop (queens, !p, pred count)\n in\n @{\n pf = pf,\n pfgc = pfgc |\n p = p\n }\n end\n\nfn {tk : tkind}\nqueen_would_fit_in\n {count : int | 0 <= count; count <= M2_MAX}\n {i, j : int | 0 <= i; i < SIDE_MAX;\n 0 <= j; j < SIDE_MAX}\n (queens : &(@[g1int tk][M2_MAX]),\n count : int count,\n i : g1int (tk, i),\n j : g1int (tk, j)) :\n bool =\n (* Would a new queen at (i,j) be feasible? *)\n if count = 0 then\n true\n else\n let\n fun\n loop {k : int | ~1 <= k; k < count}\n (queens : &(@[g1int tk][M2_MAX]),\n k : int k) :\n bool =\n if k < 0 then\n true\n else\n let\n val [coords : int] coords = queens[k]\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {0 <= coords} ()\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\n #else\n val _ = assertloc (g1i2i 0 <= coords)\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\n #endif\n\n val i1 = row_index<tk> coords\n val j1 = column_index<tk> coords\n in\n if g1int_nmod (k, 2) = g1int_nmod (count, 2) then\n (* The two queens are of the same color. They may not\n share the same square. *)\n begin\n if i <> i1 || j <> j1 then\n loop (queens, pred k)\n else\n false\n end\n else\n (* The two queens are of different colors. They may not\n share the same square nor attack each other. *)\n begin\n if (i <> i1 &&\n j <> j1 &&\n i + j <> i1 + j1 &&\n i - j <> i1 - j1) then\n loop (queens, pred k)\n else\n false\n end\n end\n in\n loop (queens, pred count)\n end\n\nfn {tk : tkind}\nlatest_queen_fits_in\n {count : int | 1 <= count; count <= M2_MAX}\n (queens : &(@[g1int tk][M2_MAX]),\n count : int count) :\n bool =\n let\n val [coords : int] coords = queens[pred count]\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {0 <= coords} ()\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\n #else\n val _ = assertloc (g1i2i 0 <= coords)\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\n #endif\n\n val i = row_index<tk> coords\n val j = column_index<tk> coords\n in\n queen_would_fit_in<tk> (queens, pred count, i, j)\n end\n\nfn {tk_index, tk_color : tkind}\nfind_solutions\n {m : int | 0 <= m; 2 * m <= M2_MAX}\n {n : int | 0 <= n; n <= SIDE_MAX}\n {max_solutions : int | 0 <= max_solutions}\n (f : FILEref,\n m : int m,\n n : g1int (tk_index, n),\n rotation_equiv_classes : bool,\n max_solutions : int max_solutions) :\n [num_solutions : int | 0 <= num_solutions;\n num_solutions <= max_solutions]\n @(int num_solutions,\n board_record_list_vt (tk_color, num_solutions)) =\n (* This template function both prints the solutions and returns\n them as a linked list. *)\n if m = 0 then\n @(0, NIL)\n else if max_solutions = 0 then\n @(0, NIL)\n else\n let\n macdef latest_queen_fits_in = latest_queen_fits_in<tk_index>\n macdef queens_to_board = queens_to_board<tk_index, tk_color>\n macdef fprint_board = fprint_board<tk_index, tk_color>\n macdef any_board_equiv = any_board_equiv<tk_index, tk_color>\n macdef row_index = row_index<tk_index>\n macdef column_index = column_index<tk_index>\n macdef storage_index = storage_index<tk_index>\n\n fnx\n loop {num_solutions : int | 0 <= num_solutions;\n num_solutions <= max_solutions}\n {num_queens : int | 0 <= num_queens;\n num_queens <= 2 * m}\n (solutions : board_record_list_vt (tk_color,\n num_solutions),\n num_solutions : int num_solutions,\n queens : &(@[g1int tk_index][M2_MAX]),\n num_queens : int num_queens) :\n [num_solutions1 : int | 0 <= num_solutions1;\n num_solutions1 <= max_solutions]\n @(int num_solutions1,\n board_record_list_vt (tk_color, num_solutions1)) =\n if num_queens = 0 then\n @(num_solutions, solutions)\n else if num_solutions = max_solutions then\n @(num_solutions, solutions)\n else if latest_queen_fits_in (queens, num_queens) then\n begin\n if num_queens = 2 * m then\n let\n val board = queens_to_board (queens, num_queens)\n val equiv_solution =\n any_board_equiv (!(board.p), solutions, n,\n rotation_equiv_classes)\n in\n if ~equiv_solution then\n begin\n fprintln! (f, \"Solution \",\n succ num_solutions);\n fprint_board (f, !(board.p), n);\n fileref_puts (f, \"\\n\\n\");\n move_a_queen (board :: solutions,\n succ num_solutions,\n queens, num_queens)\n end\n else\n begin\n free board;\n move_a_queen (solutions, num_solutions,\n queens, num_queens)\n end\n end\n else\n add_another_queen (solutions, num_solutions,\n queens, num_queens)\n end\n else\n move_a_queen (solutions, num_solutions,\n queens, num_queens)\n and\n add_another_queen\n {num_solutions : int |\n 0 <= num_solutions;\n num_solutions <= max_solutions}\n {num_queens : int | 0 <= num_queens;\n num_queens + 1 <= 2 * m}\n (solutions : board_record_list_vt\n (tk_color, num_solutions),\n num_solutions : int num_solutions,\n queens : &(@[g1int tk_index][M2_MAX]),\n num_queens : int num_queens) :\n [num_solutions1 : int | 0 <= num_solutions1;\n num_solutions1 <= max_solutions]\n @(int num_solutions1,\n board_record_list_vt (tk_color, num_solutions1)) =\n let\n val coords = storage_index (g1i2i 0, g1i2i 0)\n in\n queens[num_queens] := coords;\n loop (solutions, num_solutions, queens, succ num_queens)\n end\n and\n move_a_queen {num_solutions : int |\n 0 <= num_solutions;\n num_solutions <= max_solutions}\n {num_queens : int | 0 <= num_queens;\n num_queens <= 2 * m}\n (solutions : board_record_list_vt\n (tk_color, num_solutions),\n num_solutions : int num_solutions,\n queens : &(@[g1int tk_index][M2_MAX]),\n num_queens : int num_queens) :\n [num_solutions1 : int | 0 <= num_solutions1;\n num_solutions1 <= max_solutions]\n @(int num_solutions1,\n board_record_list_vt (tk_color, num_solutions1)) =\n if num_queens = 0 then\n loop (solutions, num_solutions, queens, num_queens)\n else\n let\n val [coords : int] coords = queens[pred num_queens]\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {0 <= coords} ()\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\n #else\n val _ = assertloc (g1i2i 0 <= coords)\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\n #endif\n\n val [i : int] i = row_index coords\n val [j : int] j = column_index coords\n\n prval _ = prop_verify {0 <= i} ()\n prval _ = prop_verify {i < SIDE_MAX} ()\n\n prval _ = prop_verify {0 <= j} ()\n prval _ = prop_verify {j < SIDE_MAX} ()\n\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {i < n} ()\n prval _ = $UN.prop_assert {j < n} ()\n #else\n val _ = $effmask_exn assertloc (i < n)\n val _ = $effmask_exn assertloc (j < n)\n #endif\n in\n if j = pred n then\n begin\n if i = pred n then\n (* Backtrack. *)\n move_a_queen (solutions, num_solutions,\n queens, pred num_queens)\n else\n let\n val coords = storage_index (succ i, j)\n in\n queens[pred num_queens] := coords;\n loop (solutions, num_solutions,\n queens, num_queens)\n end\n end\n else\n let\n #if NDEBUG <> 0 #then\n prval _ = $UN.prop_assert {j < n - 1} ()\n #else\n val _ = $effmask_exn assertloc (j < pred n)\n #endif\n in\n if i = pred n then\n let\n val coords = storage_index (g1i2i 0, succ j)\n in\n queens[pred num_queens] := coords;\n loop (solutions, num_solutions,\n queens, num_queens)\n end\n else\n let\n val coords = storage_index (succ i, j)\n in\n queens[pred num_queens] := coords;\n loop (solutions, num_solutions,\n queens, num_queens)\n end\n end\n end\n\n var queens = @[g1int tk_index][M2_MAX] (g1i2i 0)\n in\n queens[0] := storage_index (g1i2i 0, g1i2i 0);\n loop (NIL, 0, queens, 1)\n end\n\n(********************************************************************)\n\n%{^\n#include <stdlib.h>\n#include <limits.h>\n%}\n\nimplement\nmain0 (argc, argv) =\n let\n stadef tk_index = int_kind\n stadef tk_color = int_kind\n\n macdef usage_error (status) =\n begin\n println! (\"Usage: \", argv[0],\n \" M N IGNORE_EQUIVALENTS [MAX_SOLUTIONS]\");\n exit (,(status))\n end\n\n val max_max_solutions =\n $extval ([i : int | 0 <= i] int i, \"INT_MAX\")\n in\n if 4 <= argc then\n let\n val m = $extfcall (int, \"atoi\", argv[1])\n val m = g1ofg0 m\n val _ = if m < 0 then usage_error (2)\n val _ = assertloc (0 <= m)\n val _ =\n if M2_MAX < 2 * m then\n begin\n println! (argv[0], \": M cannot be larger than \",\n M2_MAX / 2);\n usage_error (2)\n end\n val _ = assertloc (2 * m <= M2_MAX)\n\n val n = $extfcall (int, \"atoi\", argv[2])\n val n = g1ofg0 n\n val _ = if n < 0 then usage_error (2)\n val _ = assertloc (0 <= n)\n val _ =\n if SIDE_MAX < n then\n begin\n println! (argv[0], \": N cannot be larger than \",\n SIDE_MAX);\n usage_error (2)\n end\n val _ = assertloc (n <= SIDE_MAX)\n\n val ignore_equivalents =\n if argv[3] = \"T\" || argv[3] = \"t\" || argv[3] = \"1\" then\n true\n else if argv[3] = \"F\" || argv[3] = \"f\" || argv[3] = \"0\" then\n false\n else\n begin\n println! (argv[0],\n \": select T=t=1 or F=f=0 \",\n \"for IGNORE_EQUIVALENTS\");\n usage_error (2);\n false\n end\n in\n if argc = 5 then\n let\n val max_solutions = $extfcall (int, \"atoi\", argv[4])\n val max_solutions = g1ofg0 max_solutions\n val max_solutions = max (0, max_solutions)\n\n val @(num_solutions, solutions) =\n find_solutions<tk_index, tk_color>\n (stdout_ref, m, n, ignore_equivalents,\n max_solutions)\n in\n board_record_list_vt_free solutions\n end\n else\n let\n val @(num_solutions, solutions) =\n find_solutions<tk_index, tk_color>\n (stdout_ref, m, n, ignore_equivalents,\n max_max_solutions)\n in\n board_record_list_vt_free solutions\n end\n end\n else\n usage_error (1)\n end\n\n(********************************************************************)\n","language":"ATS"},{"code":"#include <math.h>\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n\nenum Piece {\n Empty,\n Black,\n White,\n};\n\ntypedef struct Position_t {\n int x, y;\n} Position;\n\n///////////////////////////////////////////////\n\nstruct Node_t {\n Position pos;\n struct Node_t *next;\n};\n\nvoid releaseNode(struct Node_t *head) {\n if (head == NULL) return;\n\n releaseNode(head->next);\n head->next = NULL;\n\n free(head);\n}\n\ntypedef struct List_t {\n struct Node_t *head;\n struct Node_t *tail;\n size_t length;\n} List;\n\nList makeList() {\n return (List) { NULL, NULL, 0 };\n}\n\nvoid releaseList(List *lst) {\n if (lst == NULL) return;\n\n releaseNode(lst->head);\n lst->head = NULL;\n lst->tail = NULL;\n}\n\nvoid addNode(List *lst, Position pos) {\n struct Node_t *newNode;\n\n if (lst == NULL) {\n exit(EXIT_FAILURE);\n }\n\n newNode = malloc(sizeof(struct Node_t));\n if (newNode == NULL) {\n exit(EXIT_FAILURE);\n }\n\n newNode->next = NULL;\n newNode->pos = pos;\n\n if (lst->head == NULL) {\n lst->head = lst->tail = newNode;\n } else {\n lst->tail->next = newNode;\n lst->tail = newNode;\n }\n\n lst->length++;\n}\n\nvoid removeAt(List *lst, size_t pos) {\n if (lst == NULL) return;\n\n if (pos == 0) {\n struct Node_t *temp = lst->head;\n\n if (lst->tail == lst->head) {\n lst->tail = NULL;\n }\n\n lst->head = lst->head->next;\n temp->next = NULL;\n\n free(temp);\n lst->length--;\n } else {\n struct Node_t *temp = lst->head;\n struct Node_t *rem;\n size_t i = pos;\n\n while (i-- > 1) {\n temp = temp->next;\n }\n\n rem = temp->next;\n if (rem == lst->tail) {\n lst->tail = temp;\n }\n\n temp->next = rem->next;\n\n rem->next = NULL;\n free(rem);\n\n lst->length--;\n }\n}\n\n///////////////////////////////////////////////\n\nbool isAttacking(Position queen, Position pos) {\n return queen.x == pos.x\n || queen.y == pos.y\n || abs(queen.x - pos.x) == abs(queen.y - pos.y);\n}\n\nbool place(int m, int n, List *pBlackQueens, List *pWhiteQueens) {\n struct Node_t *queenNode;\n bool placingBlack = true;\n int i, j;\n\n if (pBlackQueens == NULL || pWhiteQueens == NULL) {\n exit(EXIT_FAILURE);\n }\n\n if (m == 0) return true;\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n Position pos = { i, j };\n\n queenNode = pBlackQueens->head;\n while (queenNode != NULL) {\n if ((queenNode->pos.x == pos.x && queenNode->pos.y == pos.y) || !placingBlack && isAttacking(queenNode->pos, pos)) {\n goto inner;\n }\n queenNode = queenNode->next;\n }\n\n queenNode = pWhiteQueens->head;\n while (queenNode != NULL) {\n if ((queenNode->pos.x == pos.x && queenNode->pos.y == pos.y) || placingBlack && isAttacking(queenNode->pos, pos)) {\n goto inner;\n }\n queenNode = queenNode->next;\n }\n\n if (placingBlack) {\n addNode(pBlackQueens, pos);\n placingBlack = false;\n } else {\n addNode(pWhiteQueens, pos);\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true;\n }\n removeAt(pBlackQueens, pBlackQueens->length - 1);\n removeAt(pWhiteQueens, pWhiteQueens->length - 1);\n placingBlack = true;\n }\n\n inner: {}\n }\n }\n if (!placingBlack) {\n removeAt(pBlackQueens, pBlackQueens->length - 1);\n }\n return false;\n}\n\nvoid printBoard(int n, List *pBlackQueens, List *pWhiteQueens) {\n size_t length = n * n;\n struct Node_t *queenNode;\n char *board;\n size_t i, j, k;\n\n if (pBlackQueens == NULL || pWhiteQueens == NULL) {\n exit(EXIT_FAILURE);\n }\n\n board = calloc(length, sizeof(char));\n if (board == NULL) {\n exit(EXIT_FAILURE);\n }\n\n queenNode = pBlackQueens->head;\n while (queenNode != NULL) {\n board[queenNode->pos.x * n + queenNode->pos.y] = Black;\n queenNode = queenNode->next;\n }\n\n queenNode = pWhiteQueens->head;\n while (queenNode != NULL) {\n board[queenNode->pos.x * n + queenNode->pos.y] = White;\n queenNode = queenNode->next;\n }\n\n for (i = 0; i < length; i++) {\n if (i != 0 && i % n == 0) {\n printf(\"\\n\");\n }\n switch (board[i]) {\n case Black:\n printf(\"B \");\n break;\n case White:\n printf(\"W \");\n break;\n default:\n j = i / n;\n k = i - j * n;\n if (j % 2 == k % 2) {\n printf(\" \");\n } else {\n printf(\"# \");\n }\n break;\n }\n }\n\n printf(\"\\n\\n\");\n}\n\nvoid test(int n, int q) {\n List blackQueens = makeList();\n List whiteQueens = makeList();\n\n printf(\"%d black and %d white queens on a %d x %d board:\\n\", q, q, n, n);\n if (place(q, n, &blackQueens, &whiteQueens)) {\n printBoard(n, &blackQueens, &whiteQueens);\n } else {\n printf(\"No solution exists.\\n\\n\");\n }\n\n releaseList(&blackQueens);\n releaseList(&whiteQueens);\n}\n\nint main() {\n test(2, 1);\n\n test(3, 1);\n test(3, 2);\n\n test(4, 1);\n test(4, 2);\n test(4, 3);\n\n test(5, 1);\n test(5, 2);\n test(5, 3);\n test(5, 4);\n test(5, 5);\n\n test(6, 1);\n test(6, 2);\n test(6, 3);\n test(6, 4);\n test(6, 5);\n test(6, 6);\n\n test(7, 1);\n test(7, 2);\n test(7, 3);\n test(7, 4);\n test(7, 5);\n test(7, 6);\n test(7, 7);\n\n return EXIT_SUCCESS;\n}\n","language":"C"},{"code":"#include <iostream>\n#include <vector>\n\nenum class Piece {\n empty,\n black,\n white\n};\n\ntypedef std::pair<int, int> position;\n\nbool isAttacking(const position &queen, const position &pos) {\n return queen.first == pos.first\n || queen.second == pos.second\n || abs(queen.first - pos.first) == abs(queen.second - pos.second);\n}\n\nbool place(const int m, const int n, std::vector<position> &pBlackQueens, std::vector<position> &pWhiteQueens) {\n if (m == 0) {\n return true;\n }\n bool placingBlack = true;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n auto pos = std::make_pair(i, j);\n for (auto queen : pBlackQueens) {\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\n goto inner;\n }\n }\n for (auto queen : pWhiteQueens) {\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\n goto inner;\n }\n }\n if (placingBlack) {\n pBlackQueens.push_back(pos);\n placingBlack = false;\n } else {\n pWhiteQueens.push_back(pos);\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true;\n }\n pBlackQueens.pop_back();\n pWhiteQueens.pop_back();\n placingBlack = true;\n }\n\n inner: {}\n }\n }\n if (!placingBlack) {\n pBlackQueens.pop_back();\n }\n return false;\n}\n\nvoid printBoard(int n, const std::vector<position> &blackQueens, const std::vector<position> &whiteQueens) {\n std::vector<Piece> board(n * n);\n std::fill(board.begin(), board.end(), Piece::empty);\n\n for (auto &queen : blackQueens) {\n board[queen.first * n + queen.second] = Piece::black;\n }\n for (auto &queen : whiteQueens) {\n board[queen.first * n + queen.second] = Piece::white;\n }\n\n for (size_t i = 0; i < board.size(); ++i) {\n if (i != 0 && i % n == 0) {\n std::cout << '\\n';\n }\n switch (board[i]) {\n case Piece::black:\n std::cout << \"B \";\n break;\n case Piece::white:\n std::cout << \"W \";\n break;\n case Piece::empty:\n default:\n int j = i / n;\n int k = i - j * n;\n if (j % 2 == k % 2) {\n std::cout << \"x \";\n } else {\n std::cout << \"* \";\n }\n break;\n }\n }\n\n std::cout << \"\\n\\n\";\n}\n\nint main() {\n std::vector<position> nms = {\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\n };\n\n for (auto nm : nms) {\n std::cout << nm.second << \" black and \" << nm.second << \" white queens on a \" << nm.first << \" x \" << nm.first << \" board:\\n\";\n std::vector<position> blackQueens, whiteQueens;\n if (place(nm.second, nm.first, blackQueens, whiteQueens)) {\n printBoard(nm.first, blackQueens, whiteQueens);\n } else {\n std::cout << \"No solution exists.\\n\\n\";\n }\n }\n\n return 0;\n}\n","language":"C++"},{"code":"using System;\nusing System.Collections.Generic;\n\nnamespace PeacefulChessQueenArmies {\n using Position = Tuple<int, int>;\n\n enum Piece {\n Empty,\n Black,\n White\n }\n\n class Program {\n static bool IsAttacking(Position queen, Position pos) {\n return queen.Item1 == pos.Item1\n || queen.Item2 == pos.Item2\n || Math.Abs(queen.Item1 - pos.Item1) == Math.Abs(queen.Item2 - pos.Item2);\n }\n\n static bool Place(int m, int n, List<Position> pBlackQueens, List<Position> pWhiteQueens) {\n if (m == 0) {\n return true;\n }\n bool placingBlack = true;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n var pos = new Position(i, j);\n foreach (var queen in pBlackQueens) {\n if (queen.Equals(pos) || !placingBlack && IsAttacking(queen, pos)) {\n goto inner;\n }\n }\n foreach (var queen in pWhiteQueens) {\n if (queen.Equals(pos) || placingBlack && IsAttacking(queen, pos)) {\n goto inner;\n }\n }\n if (placingBlack) {\n pBlackQueens.Add(pos);\n placingBlack = false;\n } else {\n pWhiteQueens.Add(pos);\n if (Place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true;\n }\n pBlackQueens.RemoveAt(pBlackQueens.Count - 1);\n pWhiteQueens.RemoveAt(pWhiteQueens.Count - 1);\n placingBlack = true;\n }\n inner: { }\n }\n }\n if (!placingBlack) {\n pBlackQueens.RemoveAt(pBlackQueens.Count - 1);\n }\n return false;\n }\n\n static void PrintBoard(int n, List<Position> blackQueens, List<Position> whiteQueens) {\n var board = new Piece[n * n];\n\n foreach (var queen in blackQueens) {\n board[queen.Item1 * n + queen.Item2] = Piece.Black;\n }\n foreach (var queen in whiteQueens) {\n board[queen.Item1 * n + queen.Item2] = Piece.White;\n }\n\n for (int i = 0; i < board.Length; i++) {\n if (i != 0 && i % n == 0) {\n Console.WriteLine();\n }\n switch (board[i]) {\n case Piece.Black:\n Console.Write(\"B \");\n break;\n case Piece.White:\n Console.Write(\"W \");\n break;\n case Piece.Empty:\n int j = i / n;\n int k = i - j * n;\n if (j % 2 == k % 2) {\n Console.Write(\" \");\n } else {\n Console.Write(\"# \");\n }\n break;\n }\n }\n\n Console.WriteLine(\"\\n\");\n }\n\n static void Main() {\n var nms = new int[,] {\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\n };\n for (int i = 0; i < nms.GetLength(0); i++) {\n Console.WriteLine(\"{0} black and {0} white queens on a {1} x {1} board:\", nms[i, 1], nms[i, 0]);\n List<Position> blackQueens = new List<Position>();\n List<Position> whiteQueens = new List<Position>();\n if (Place(nms[i, 1], nms[i, 0], blackQueens, whiteQueens)) {\n PrintBoard(nms[i, 0], blackQueens, whiteQueens);\n } else {\n Console.WriteLine(\"No solution exists.\\n\");\n }\n }\n }\n }\n}\n","language":"C-sharp"},{"code":"import std.array;\nimport std.math;\nimport std.stdio;\nimport std.typecons;\n\nenum Piece {\n empty,\n black,\n white,\n}\n\nalias position = Tuple!(int, \"i\", int, \"j\");\n\nbool place(int m, int n, ref position[] pBlackQueens, ref position[] pWhiteQueens) {\n if (m == 0) {\n return true;\n }\n bool placingBlack = true;\n foreach (i; 0..n) {\n inner:\n foreach (j; 0..n) {\n auto pos = position(i, j);\n foreach (queen; pBlackQueens) {\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\n continue inner;\n }\n }\n foreach (queen; pWhiteQueens) {\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\n continue inner;\n }\n }\n if (placingBlack) {\n pBlackQueens ~= pos;\n placingBlack = false;\n } else {\n pWhiteQueens ~= pos;\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true;\n }\n pBlackQueens.length--;\n pWhiteQueens.length--;\n placingBlack = true;\n }\n }\n }\n if (!placingBlack) {\n pBlackQueens.length--;\n }\n return false;\n}\n\nbool isAttacking(position queen, position pos) {\n return queen.i == pos.i\n || queen.j == pos.j\n || abs(queen.i - pos.i) == abs(queen.j - pos.j);\n}\n\nvoid printBoard(int n, position[] blackQueens, position[] whiteQueens) {\n auto board = uninitializedArray!(Piece[])(n * n);\n board[] = Piece.empty;\n\n foreach (queen; blackQueens) {\n board[queen.i * n + queen.j] = Piece.black;\n }\n foreach (queen; whiteQueens) {\n board[queen.i * n + queen.j] = Piece.white;\n }\n foreach (i,b; board) {\n if (i != 0 && i % n == 0) {\n writeln;\n }\n final switch (b) {\n case Piece.black:\n write(\"B \");\n break;\n case Piece.white:\n write(\"W \");\n break;\n case Piece.empty:\n int j = i / n;\n int k = i - j * n;\n\n if (j % 2 == k % 2) {\n write(\"• \"w);\n } else {\n write(\"◦ \"w);\n }\n break;\n }\n }\n writeln('\\n');\n}\n\nvoid main() {\n auto nms = [\n [2, 1], [3, 1], [3, 2], [4, 1], [4, 2], [4, 3],\n [5, 1], [5, 2], [5, 3], [5, 4], [5, 5],\n [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6],\n [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7],\n ];\n foreach (nm; nms) {\n writefln(\"%d black and %d white queens on a %d x %d board:\", nm[1], nm[1], nm[0], nm[0]);\n position[] blackQueens;\n position[] whiteQueens;\n if (place(nm[1], nm[0], blackQueens, whiteQueens)) {\n printBoard(nm[0], blackQueens, whiteQueens);\n } else {\n writeln(\"No solution exists.\\n\");\n }\n }\n}\n","language":"D"},{"code":"program peaceful_queens_elements_generator\n use, intrinsic :: iso_fortran_env, only: int64\n use, intrinsic :: iso_fortran_env, only: error_unit\n\n implicit none\n\n ! 64-bit integers, for boards up to 8-by-8.\n integer, parameter :: kind8x8 = int64\n\n ! 128-bit integers, for boards up to 11-by-11.\n ! This value is correct for gfortran.\n integer, parameter :: kind11x11 = 16\n\n integer(kind = kind11x11), parameter :: one = 1\n integer(kind = kind11x11), parameter :: two = 2\n\n integer, parameter :: n_max = 11\n\n integer(kind = kind11x11) :: rook1_masks(0 : n_max - 1)\n integer(kind = kind11x11) :: rook2_masks(0 : n_max - 1)\n integer(kind = kind11x11) :: bishop1_masks(0 : (2 * n_max) - 4)\n integer(kind = kind11x11) :: bishop2_masks(0 : (2 * n_max) - 4)\n\n ! Combines rook1_masks and rook2_masks.\n integer(kind = kind11x11) :: rook_masks(0 : (2 * n_max) - 1)\n\n ! Combines bishop1_masks and bishop2_masks.\n integer(kind = kind11x11) :: bishop_masks(0 : (4 * n_max) - 7)\n\n ! Combines rook and bishop masks.\n integer(kind = kind11x11) :: queen_masks(0 : (6 * n_max) - 7)\n\n character(len = 16), parameter :: s_kind8x8 = \"kind8x8 \"\n character(len = 16), parameter :: s_kind11x11 = \"kind11x11 \"\n\n character(200) :: arg\n integer :: arg_count\n\n integer :: m, n, max_solutions\n integer :: board_kind\n\n arg_count = command_argument_count ()\n if (arg_count /= 3) then\n call get_command_argument (0, arg)\n write (error_unit, '(\"Usage: \", A, \" M N MAX_SOLUTIONS\")') trim (arg)\n stop 1\n end if\n\n call get_command_argument (1, arg)\n read (arg, *) m\n if (m < 1) then\n write (error_unit, '(\"M must be between 1 or greater.\")')\n stop 2\n end if\n\n call get_command_argument (2, arg)\n read (arg, *) n\n if (n < 3 .or. 11 < n) then\n write (error_unit, '(\"N must be between 3 and \", I0, \", inclusive.\")') n_max\n stop 2\n end if\n\n call get_command_argument (3, arg)\n read (arg, *) max_solutions\n\n write (*, '(\"module peaceful_queens_elements\")')\n write (*, '()')\n write (*, '(\" use, intrinsic :: iso_fortran_env, only: int64\")')\n write (*, '()')\n write (*, '(\" implicit none\")')\n write (*, '(\" private\")')\n write (*, '()')\n write (*, '(\" integer, parameter, public :: m = \", I0)') m\n write (*, '(\" integer, parameter, public :: n = \", I0)') n\n write (*, '(\" integer, parameter, public :: max_solutions = \", I0)') max_solutions\n write (*, '()')\n if (n <= 8) then\n write (*, '(\" ! 64-bit integers, for boards up to 8-by-8.\")')\n write (*, '(\" integer, parameter, private :: kind8x8 = int64\")')\n else\n write (*, '(\" ! 128-bit integers, for boards up to 11-by-11.\")')\n write (*, '(\" integer, parameter, private :: kind11x11 = \", I0)') kind11x11\n end if\n write (*, '(\" integer, parameter, public :: board_kind = \", A)') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '()')\n write (*, '(\" public :: rooks1_attack_check\")')\n write (*, '(\" public :: rooks2_attack_check\")')\n write (*, '(\" public :: rooks_attack_check\")')\n write (*, '(\" public :: bishops1_attack_check\")')\n write (*, '(\" public :: bishops2_attack_check\")')\n write (*, '(\" public :: bishops_attack_check\")')\n write (*, '(\" public :: queens_attack_check\")')\n write (*, '()')\n write (*, '(\" public :: board_rotate90\")')\n write (*, '(\" public :: board_rotate180\")')\n write (*, '(\" public :: board_rotate270\")')\n write (*, '(\" public :: board_reflect1\")')\n write (*, '(\" public :: board_reflect2\")')\n write (*, '(\" public :: board_reflect3\")')\n write (*, '(\" public :: board_reflect4\")')\n write (*, '()')\n\n call write_rook1_masks\n call write_rook2_masks\n call write_bishop1_masks\n call write_bishop2_masks\n call write_rook_masks\n call write_bishop_masks\n call write_queen_masks\n\n write (*, '(\"contains\")')\n write (*, '()')\n\n call write_rooks1_attack_check\n call write_rooks2_attack_check\n call write_bishops1_attack_check\n call write_bishops2_attack_check\n call write_rooks_attack_check\n call write_bishops_attack_check\n call write_queens_attack_check\n\n call write_board_rotate90\n call write_board_rotate180\n call write_board_rotate270\n call write_board_reflect1\n call write_board_reflect2\n call write_board_reflect3\n call write_board_reflect4\n\n call write_insert_zeros\n call write_reverse_insert_zeros\n\n write (*, '(\"end module peaceful_queens_elements\")')\n\ncontains\n\n subroutine write_rook1_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, n - 1\n write (*, '(\" integer(kind = \", A, \"), parameter :: rook1_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & rook1_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_rook1_masks\n\n subroutine write_rook2_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, n - 1\n write (*, '(\" integer(kind = \", A, \"), parameter :: rook2_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & rook2_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_rook2_masks\n\n subroutine write_bishop1_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, (2 * n) - 4\n write (*, '(\" integer(kind = \", A, \"), parameter :: bishop1_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & bishop1_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_bishop1_masks\n\n subroutine write_bishop2_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, (2 * n) - 4\n write (*, '(\" integer(kind = \", A, \"), parameter :: bishop2_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & bishop2_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_bishop2_masks\n\n subroutine write_rook_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, (2 * n) - 1\n write (*, '(\" integer(kind = \", A, \"), parameter :: rook_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & rook_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_rook_masks\n\n subroutine write_bishop_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, (4 * n) - 7\n write (*, '(\" integer(kind = \", A, \"), parameter :: bishop_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & bishop_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_bishop_masks\n\n subroutine write_queen_masks\n integer :: i\n\n call fill_masks (n)\n do i = 0, (6 * n) - 7\n write (*, '(\" integer(kind = \", A, \"), parameter :: queen_mask_\",&\n & I0, \"x\", I0, \"_\", I0, \" = int (z''\", Z0.32, \"'', kind &\n &= \", A, \")\")') trim (s_kindnxn (n)), n, n, i,&\n & queen_masks(i), trim (s_kindnxn (n))\n end do\n write (*, '()')\n end subroutine write_queen_masks\n\n subroutine write_rooks1_attack_check\n integer :: i\n\n write (*, '(\" elemental function rooks1_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, rook1_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, rook1_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, n - 1\n write (*, '(\" & ((iand (army1, rook1_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, rook1_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= n - 1) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function rooks1_attack_check\")')\n write (*, '()')\n end subroutine write_rooks1_attack_check\n\n subroutine write_rooks2_attack_check\n integer :: i\n\n write (*, '(\" elemental function rooks2_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, rook2_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, rook2_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, n - 1\n write (*, '(\" & ((iand (army1, rook2_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, rook2_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= n - 1) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function rooks2_attack_check\")')\n write (*, '()')\n end subroutine write_rooks2_attack_check\n\n subroutine write_bishops1_attack_check\n integer :: i\n\n write (*, '(\" elemental function bishops1_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, bishop1_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, bishop1_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, (2 * n) - 4\n write (*, '(\" & ((iand (army1, bishop1_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, bishop1_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= (2 * n) - 4) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function bishops1_attack_check\")')\n write (*, '()')\n end subroutine write_bishops1_attack_check\n\n subroutine write_bishops2_attack_check\n integer :: i\n\n write (*, '(\" elemental function bishops2_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, bishop2_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, bishop2_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, (2 * n) - 4\n write (*, '(\" & ((iand (army1, bishop2_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, bishop2_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= (2 * n) - 4) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function bishops2_attack_check\")')\n write (*, '()')\n end subroutine write_bishops2_attack_check\n\n subroutine write_rooks_attack_check\n integer :: i\n\n write (*, '(\" elemental function rooks_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, rook_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, rook_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, (2 * n) - 1\n write (*, '(\" & ((iand (army1, rook_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, rook_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= (2 * n) - 1) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function rooks_attack_check\")')\n write (*, '()')\n end subroutine write_rooks_attack_check\n\n subroutine write_bishops_attack_check\n integer :: i\n\n write (*, '(\" elemental function bishops_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, bishop_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, bishop_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, (4 * n) - 7\n write (*, '(\" & ((iand (army1, bishop_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, bishop_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= (4 * n) - 7) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function bishops_attack_check\")')\n write (*, '()')\n end subroutine write_bishops_attack_check\n\n subroutine write_queens_attack_check\n integer :: i\n\n write (*, '(\" elemental function queens_attack_check (army1, army2) result (attacking)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: army1, army2\")') trim (s_kindnxn (n))\n write (*, '(\" logical :: attacking\")')\n write (*, '()')\n write (*, '(\" attacking = ((iand (army1, queen_mask_\", I0, \"x\", I0,&\n & \"_0) /= 0) .and. (iand (army2, queen_mask_\", I0, \"x\", I0, \"_0) /=&\n & 0)) .or. &\")') n, n, n, n\n do i = 1, (6 * n) - 7\n write (*, '(\" & ((iand (army1, queen_mask_\", I0, \"x\",&\n & I0, \"_\", I0, \") /= 0) .and. (iand (army2, queen_mask_\", I0,&\n & \"x\", I0, \"_\", I0, \") /= 0))\")', advance = 'no') n, n, i, n, n, i\n if (i /= (6 * n) - 7) then\n write (*, '(\" .or. &\")')\n else\n write (*, '()')\n end if\n end do\n write (*, '(\" end function queens_attack_check\")')\n write (*, '()')\n end subroutine write_queens_attack_check\n\n subroutine write_board_rotate90\n integer :: i, j\n\n write (*, '(\" elemental function board_rotate90 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Rotation 90 degrees in one of the orientations.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (reverse_insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \"), &\")') n, n, n, i, -i * n, i\n else\n write (*, '(\" ishft (reverse_insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \")\")', advance = 'no') n, n, n, i, -i * n, i\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_rotate90\")')\n write (*, '()')\n end subroutine write_board_rotate90\n\n subroutine write_board_rotate180\n write (*, '(\" elemental function board_rotate180 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Rotation 180 degrees.\")')\n write (*, '()')\n write (*, '(\" b = board_reflect1 (board_reflect2 (a))\")')\n write (*, '(\" end function board_rotate180\")')\n write (*, '()')\n end subroutine write_board_rotate180\n\n subroutine write_board_rotate270\n integer :: i, j\n\n write (*, '(\" elemental function board_rotate270 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Rotation 270 degrees in one of the orientations.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \"), &\")') n, n, n, i, -i * n, n - 1 - i\n else\n write (*, '(\" ishft (insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \")\")', advance = 'no') n, n, n, i, -i * n, n - 1 - i\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_rotate270\")')\n write (*, '()')\n end subroutine write_board_rotate270\n\n subroutine write_board_reflect1\n integer :: i, j\n\n write (*, '(\" elemental function board_reflect1 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Reflection of rows or columns.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (iand (rook2_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \", I0, \"), &\")') &\n & n, n, i, (n - 1) - (2 * i)\n else\n write (*, '(\"ishft (iand (rook2_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \", I0, \")\")', advance = 'no') &\n & n, n, i, (n - 1) - (2 * i)\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_reflect1\")')\n write (*, '()')\n end subroutine write_board_reflect1\n\n subroutine write_board_reflect2\n integer :: i, j\n\n write (*, '(\" elemental function board_reflect2 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Reflection of rows or columns.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \", I0, \"), &\")') &\n & n, n, i, n * ((n - 1) - (2 * i))\n else\n write (*, '(\"ishft (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \", I0, \")\")', advance = 'no') &\n & n, n, i, n * ((n - 1) - (2 * i))\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_reflect2\")')\n write (*, '()')\n end subroutine write_board_reflect2\n\n subroutine write_board_reflect3\n integer :: i, j\n\n write (*, '(\" elemental function board_reflect3 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Reflection around one of the two main diagonals.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \"), &\")') n, n, n, i, -i * n, i\n else\n write (*, '(\" ishft (insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \")\")', advance = 'no') n, n, n, i, -i * n, i\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_reflect3\")')\n write (*, '()')\n end subroutine write_board_reflect3\n\n subroutine write_board_reflect4\n integer :: i, j\n\n write (*, '(\" elemental function board_reflect4 (a) result (b)\")')\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n write (*, '(\" ! Reflection around one of the two main diagonals.\")')\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (reverse_insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \"), &\")') n, n, n, i, -i * n, n - 1 - i\n else\n write (*, '(\" ishft (reverse_insert_zeros_\", I0, \" (ishft&\n & (iand (rook1_mask_\", I0, \"x\", I0, \"_\", I0, \", a), \",&\n & I0, \")), \", I0, \")\")', advance = 'no') n, n, n, i, -i * n, n - 1 - i\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function board_reflect4\")')\n write (*, '()')\n end subroutine write_board_reflect4\n\n subroutine write_insert_zeros\n integer :: i, j\n\n write (*, '(\" elemental function insert_zeros_\", I0, \" (a) result (b)\")') n\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (ibits (a, \", I0, \", 1), \", I0, \"), &\")') i, i * n\n else\n write (*, '(\"ishft (ibits (a, \", I0, \", 1), \", I0, \")\")', advance = 'no') i, i * n\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function insert_zeros_\", I0)') n\n write (*, '()')\n end subroutine write_insert_zeros\n\n subroutine write_reverse_insert_zeros\n integer :: i, j\n\n write (*, '(\" elemental function reverse_insert_zeros_\", I0, \" (a) result (b)\")') n\n write (*, '(\" integer(kind = \", A, \"), value :: a\")') trim (s_kindnxn (n))\n write (*, '(\" integer(kind = \", A, \") :: b\")') trim (s_kindnxn (n))\n write (*, '()')\n do i = 0, n - 1\n if (i == 0) then\n write (*, '(\" b = \")', advance = 'no')\n else\n write (*, '(\" & \")', advance = 'no')\n do j = 1, i\n write (*, '(\" \")', advance = 'no')\n end do\n end if\n if (i /= n - 1) then\n write (*, '(\"ior (ishft (ibits (a, \", I0, \", 1), \", I0, \"), &\")') n - 1 - i, i * n\n else\n write (*, '(\"ishft (ibits (a, \", I0, \", 1), \", I0, \")\")', advance = 'no') n - 1 - i, i * n\n do j = 1, n - 1\n write (*, '(\")\")', advance = 'no')\n end do\n write (*, '()')\n end if\n end do\n write (*, '(\" end function reverse_insert_zeros_\", I0)') n\n write (*, '()')\n end subroutine write_reverse_insert_zeros\n\n function s_kindnxn (n) result (s)\n integer, intent(in) :: n\n character(len = 16) :: s\n\n if (n <= 8) then\n s = s_kind8x8\n else\n s = s_kind11x11\n end if\n end function s_kindnxn\n\n subroutine fill_masks (n)\n integer, intent(in) :: n\n\n call fill_rook1_masks (n)\n call fill_rook2_masks (n)\n call fill_bishop1_masks (n)\n call fill_bishop2_masks (n)\n call fill_rook_masks (n)\n call fill_bishop_masks (n)\n call fill_queen_masks (n)\n end subroutine fill_masks\n\n subroutine fill_rook1_masks (n)\n integer, intent(in) :: n\n\n integer :: i\n integer(kind = kind11x11) :: mask\n\n mask = (two ** n) - 1\n do i = 0, n - 1\n rook1_masks(i) = mask\n mask = ishft (mask, n)\n end do\n end subroutine fill_rook1_masks\n\n subroutine fill_rook2_masks (n)\n integer, intent(in) :: n\n\n integer :: i\n integer(kind = kind11x11) :: mask\n\n mask = 0\n do i = 0, n - 1\n mask = ior (ishft (mask, n), one)\n end do\n do i = 0, n - 1\n rook2_masks(i) = mask\n mask = ishft (mask, 1)\n end do\n end subroutine fill_rook2_masks\n\n subroutine fill_bishop1_masks (n)\n integer, intent(in) :: n\n\n integer :: i, j, k\n integer(kind = kind11x11) :: mask0, mask1\n\n ! Masks for diagonals. Put them in order from most densely\n ! populated to least densely populated.\n\n do k = 0, n - 2\n mask0 = 0\n mask1 = 0\n do i = k, n - 1\n j = i - k\n mask0 = ior (mask0, ishft (one, i + (j * n)))\n mask1 = ior (mask1, ishft (one, j + (i * n)))\n end do\n if (k == 0) then\n bishop1_masks(0) = mask0\n else\n bishop1_masks((2 * k) - 1) = mask0\n bishop1_masks(2 * k) = mask1\n end if\n end do\n end subroutine fill_bishop1_masks\n\n subroutine fill_bishop2_masks (n)\n integer, intent(in) :: n\n\n integer :: i, j, k\n integer :: i1, j1\n integer(kind = kind11x11) :: mask0, mask1\n\n ! Masks for skew diagonals. Put them in order from most densely\n ! populated to least densely populated.\n\n do k = 0, n - 2\n mask0 = 0\n mask1 = 0\n do i = k, n - 1\n j = i - k\n i1 = n - 1 - i\n j1 = n - 1 - j\n mask0 = ior (mask0, ishft (one, j + (i1 * n)))\n mask1 = ior (mask1, ishft (one, i + (j1 * n)))\n end do\n if (k == 0) then\n bishop2_masks(0) = mask0\n else\n bishop2_masks((2 * k) - 1) = mask0\n bishop2_masks(2 * k) = mask1\n end if\n end do\n end subroutine fill_bishop2_masks\n\n subroutine fill_rook_masks (n)\n integer, intent(in) :: n\n\n rook_masks(0 : n - 1) = rook1_masks\n rook_masks(n : (2 * n) - 1) = rook2_masks\n end subroutine fill_rook_masks\n\n subroutine fill_bishop_masks (n)\n integer, intent(in) :: n\n\n integer :: i\n\n ! Put the masks in order from most densely populated to least\n ! densely populated.\n\n do i = 0, (2 * n) - 4\n bishop_masks(2 * i) = bishop1_masks(i)\n bishop_masks((2 * i) + 1) = bishop2_masks(i)\n end do\n end subroutine fill_bishop_masks\n\n subroutine fill_queen_masks (n)\n integer, intent(in) :: n\n\n queen_masks(0 : (2 * n) - 1) = rook_masks\n queen_masks(2 * n : (6 * n) - 7) = bishop_masks\n end subroutine fill_queen_masks\n\nend program peaceful_queens_elements_generator\n","language":"Fortran"},{"code":"module peaceful_queens_support\n use, non_intrinsic :: peaceful_queens_elements\n\n implicit none\n private\n\n public :: write_board\n public :: write_board_without_spaces\n public :: write_board_with_spaces\n\n public :: save_a_solution\n\n interface write_board\n module procedure write_board_without_spaces\n module procedure write_board_with_spaces\n end interface write_board\n\ncontains\n\n subroutine write_board_without_spaces (unit, army_b, army_w)\n integer, intent(in) :: unit\n integer(kind = board_kind), intent(in) :: army_b, army_w\n\n call write_board_with_spaces (unit, army_b, army_w, 0)\n end subroutine write_board_without_spaces\n\n subroutine write_board_with_spaces (unit, army_b, army_w, num_spaces)\n integer, intent(in) :: unit\n integer(kind = board_kind), intent(in) :: army_b, army_w\n integer, intent(in) :: num_spaces\n\n integer(kind = board_kind), parameter :: zero = 0\n integer(kind = board_kind), parameter :: one = 1\n\n integer :: i, j\n integer(kind = board_kind) :: rank_b, rank_w\n integer(kind = board_kind) :: mask\n\n character(1), allocatable :: queens(:)\n character(4), allocatable :: rules(:)\n character(1), allocatable :: spaces(:)\n\n allocate (queens(0 : n - 1))\n allocate (rules(0 : n - 1))\n allocate (spaces(1 : num_spaces))\n\n rules = \"----\"\n if (0 < num_spaces) then\n spaces = \" \" ! For putting spaces after newlines.\n end if\n\n mask = not (ishft (not (zero), n))\n write (unit, '(\"+\", 100(A4, \"+\"))') rules\n do i = 0, n - 1\n rank_b = iand (mask, ishft (army_b, -i * n))\n rank_w = iand (mask, ishft (army_w, -i * n))\n do j = 0, n - 1\n if (iand (rank_b, ishft (one, j)) /= 0) then\n queens(j) = \"B\"\n else if (iand (rank_w, ishft (one, j)) /= 0) then\n queens(j) = \"W\"\n else\n queens(j) = \" \"\n end if\n end do\n write (unit, '(100A1)', advance = 'no') spaces\n write (unit, '(\"|\", 100(A3, \" |\"))') queens\n write (unit, '(100A1)', advance = 'no') spaces\n if (i /= n - 1) then\n write (unit, '(\"+\", 100(A4, \"+\"))') rules\n else\n write (unit, '(\"+\", 100(A4, \"+\"))', advance = 'no') rules\n end if\n end do\n end subroutine write_board_with_spaces\n\n subroutine save_a_solution (army1, army2, num_solutions, armies1, armies2)\n integer(kind = board_kind), intent(in) :: army1, army2\n integer, intent(inout) :: num_solutions\n integer(kind = board_kind), intent(inout) :: armies1(1:8, 1:max_solutions)\n integer(kind = board_kind), intent(inout) :: armies2(1:8, 1:max_solutions)\n\n ! A sanity check.\n if (queens_attack_check (army1, army2)) then\n error stop\n end if\n\n num_solutions = num_solutions + 1\n\n armies1(1, num_solutions) = army1\n armies1(2, num_solutions) = board_rotate90 (army1)\n armies1(3, num_solutions) = board_rotate180 (army1)\n armies1(4, num_solutions) = board_rotate270 (army1)\n armies1(5, num_solutions) = board_reflect1 (army1)\n armies1(6, num_solutions) = board_reflect2 (army1)\n armies1(7, num_solutions) = board_reflect3 (army1)\n armies1(8, num_solutions) = board_reflect4 (army1)\n\n armies2(1, num_solutions) = army2\n armies2(2, num_solutions) = board_rotate90 (army2)\n armies2(3, num_solutions) = board_rotate180 (army2)\n armies2(4, num_solutions) = board_rotate270 (army2)\n armies2(5, num_solutions) = board_reflect1 (army2)\n armies2(6, num_solutions) = board_reflect2 (army2)\n armies2(7, num_solutions) = board_reflect3 (army2)\n armies2(8, num_solutions) = board_reflect4 (army2)\n end subroutine save_a_solution\n\nend module peaceful_queens_support\n\nmodule peaceful_queens_solver\n use, non_intrinsic :: peaceful_queens_elements\n use, non_intrinsic :: peaceful_queens_support\n\n implicit none\n private\n\n public :: solve_peaceful_queens\n\n integer(kind = board_kind), parameter :: zero = 0_board_kind\n integer(kind = board_kind), parameter :: one = 1_board_kind\n integer(kind = board_kind), parameter :: two = 2_board_kind\n\ncontains\n\n subroutine solve_peaceful_queens (unit, show_equivalents, &\n & num_solutions, armies1, armies2)\n integer, intent(in) :: unit\n logical, intent(in) :: show_equivalents\n integer, intent(out) :: num_solutions\n integer(kind = board_kind), intent(out) :: armies1(1:8, 1:max_solutions)\n integer(kind = board_kind), intent(out) :: armies2(1:8, 1:max_solutions)\n\n call solve (zero, 0, 0, zero, 0, 0, 0)\n\n contains\n\n recursive subroutine solve (army1, rooklike11, rooklike12, &\n & army2, rooklike21, rooklike22, index)\n integer(kind = board_kind), value :: army1\n integer, value :: rooklike11, rooklike12\n integer(kind = board_kind), value :: army2\n integer, value :: rooklike21, rooklike22\n integer, value :: index\n\n integer :: num_queens1\n integer :: num_queens2\n integer(kind = board_kind) :: new_army\n integer(kind = board_kind) :: new_army_reversed\n integer :: bit1, bit2\n logical :: skip\n\n num_queens1 = popcnt (army1)\n num_queens2 = popcnt (army2)\n\n if (num_queens1 + num_queens2 == 2 * m) then\n if (.not. is_a_duplicate (army1, army2, num_solutions, armies1, armies2)) then\n call save_a_solution (army1, army2, num_solutions, armies1, armies2)\n write (unit, '(\"Solution \", I0)') num_solutions\n call write_board (unit, army1, army2)\n write (unit, '()')\n write (unit, '()')\n call optionally_write_equivalents\n end if\n else if (num_queens1 - num_queens2 == 0) then\n ! It is time to add a queen to army1.\n do while (num_solutions < max_solutions .and. index /= n**2)\n skip = .false.\n new_army = ior (army1, ishft (one, index))\n if (new_army == army1) then\n skip = .true.\n else if (index < n) then\n new_army_reversed = board_reflect1 (new_army)\n if (new_army_reversed < new_army) then\n ! Skip a bunch of board_reflect1 equivalents.\n skip = .true.\n end if\n end if\n if (skip) then\n index = index + 1\n else\n bit1 = ishft (1, index / n)\n bit2 = ishft (1, mod (index, n))\n if (iand (rooklike21, bit1) /= 0) then\n index = round_up_to_multiple (index + 1, n)\n else if (iand (rooklike22, bit2) /= 0) then\n index = index + 1\n else if (bishops_attack_check (new_army, army2)) then\n index = index + 1\n else\n call solve (new_army, &\n & ior (rooklike11, bit1), &\n & ior (rooklike12, bit2), &\n & army2, rooklike21, rooklike22, &\n & n)\n index = index + 1\n end if\n end if\n end do\n else\n ! It is time to add a queen to army2.\n do while (num_solutions < max_solutions .and. index /= n**2)\n new_army = ior (army2, ishft (one, index))\n skip = (new_army == army2)\n if (skip) then\n index = index + 1\n else\n bit1 = ishft (1, index / n)\n bit2 = ishft (1, mod (index, n))\n if (iand (rooklike11, bit1) /= 0) then\n index = round_up_to_multiple (index + 1, n)\n else if (iand (rooklike12, bit2) /= 0) then\n index = index + 1\n else if (bishops_attack_check (army1, new_army)) then\n index = index + 1\n else\n call solve (army1, rooklike11, rooklike12, &\n & new_army, &\n & ior (rooklike21, bit1), &\n & ior (rooklike22, bit2), &\n & 0)\n index = index + 1\n end if\n end if\n end do\n end if\n end subroutine solve\n\n subroutine optionally_write_equivalents\n integer :: i\n\n if (show_equivalents) then\n write (unit, '(5X)', advance = 'no')\n write (unit, '(\"Equivalents\")')\n\n write (unit, '(5X)', advance = 'no')\n call write_board (unit, armies2(1, num_solutions), armies1(1, num_solutions), 5)\n write (unit, '()')\n write (unit, '()')\n\n do i = 2, 5\n if (all ((armies1(i, num_solutions) /= armies1(1 : i - 1, num_solutions) .or. &\n & armies2(i, num_solutions) /= armies2(1 : i - 1, num_solutions)) .and. &\n & (armies2(i, num_solutions) /= armies1(1 : i - 1, num_solutions) .or. &\n & armies1(i, num_solutions) /= armies2(1 : i - 1, num_solutions)))) then\n write (unit, '(5X)', advance = 'no')\n call write_board (unit, armies1(i, num_solutions), armies2(i, num_solutions), 5)\n write (unit, '()')\n write (unit, '()')\n write (unit, '(5X)', advance = 'no')\n call write_board (unit, armies2(i, num_solutions), armies1(i, num_solutions), 5)\n write (unit, '()')\n write (unit, '()')\n end if\n end do\n end if\n end subroutine optionally_write_equivalents\n\n end subroutine solve_peaceful_queens\n\n elemental function round_up_to_multiple (x, n) result (y)\n integer, value :: x, n\n integer :: y\n\n y = x + mod (n - mod (x, n), n)\n end function round_up_to_multiple\n\n pure function is_a_duplicate (army1, army2, num_solutions, armies1, armies2) result (is_dup)\n integer(kind = board_kind), intent(in) :: army1, army2\n integer, intent(in) :: num_solutions\n integer(kind = board_kind), intent(in) :: armies1(1:8, 1:max_solutions)\n integer(kind = board_kind), intent(in) :: armies2(1:8, 1:max_solutions)\n logical :: is_dup\n\n is_dup = any ((army1 == armies1(:, 1:num_solutions) .and. &\n & army2 == armies2(:, 1:num_solutions)) .or. &\n & (army2 == armies1(:, 1:num_solutions) .and. &\n & army1 == armies2(:, 1:num_solutions)))\n end function is_a_duplicate\n\nend module peaceful_queens_solver\n\nprogram peaceful_queens\n use, intrinsic :: iso_fortran_env, only: output_unit\n use, non_intrinsic :: peaceful_queens_elements\n use, non_intrinsic :: peaceful_queens_support\n use, non_intrinsic :: peaceful_queens_solver\n\n implicit none\n\n integer :: num_solutions\n logical :: show_equivalents\n integer(kind = board_kind) :: armies1(1:8, 1:max_solutions)\n integer(kind = board_kind) :: armies2(1:8, 1:max_solutions)\n\n integer :: arg_count\n character(len = 200) :: arg\n\n show_equivalents = .false.\n\n arg_count = command_argument_count ()\n if (1 <= arg_count) then\n call get_command_argument (1, arg)\n select case (trim (arg))\n case ('1', 't', 'T', 'true', 'y', 'Y', 'yes')\n show_equivalents = .true.\n end select\n end if\n\n call solve_peaceful_queens (output_unit, show_equivalents, &\n & num_solutions, armies1, armies2)\n\nend program peaceful_queens\n","language":"Fortran"},{"code":"#!/bin/sh\n#\n# Driver script for peaceful_queens in Fortran.\n#\n\nif test ${ZSH_VERSION+y} && (emulate sh) >/dev/null 2>&1; then\n emulate sh\nfi\n\nif test $# -ne 3 && test $# -ne 4; then\n echo \"Usage: $0 M N MAX_SOLUTIONS [SHOW_EQUIVALENTS]\"\n exit 1\nfi\n\nM=${1}\nN=${2}\nMAX_SOLUTIONS=${3}\nSHOW_EQUIVALENTS=${4}\n\nRM_GENERATED_SRC=yes\nCHECK=no\n\ncase ${CHECK} in\n 0 | f | F | false | N | n | no) FCCHECK=\"\" ;;\n 1 | t | T | true | Y | y | yes) FCCHECK=\"-fcheck=all\" ;;\n *) echo 'CHECK is set incorrectly';\n exit 1 ;;\nesac\n\nFC=\"gfortran\"\nFCFLAGS=\"-std=f2018 -g -O3 -march=native -fno-stack-protector -Wall -Wextra ${FCCHECK}\"\n\n# If you have the graphite optimizer, here are some marginally helpful\n# flags. They barely make a difference, for me.\nFCFLAGS=\"${FCFLAGS} -funroll-loops -floop-nest-optimize\"\n\nRUN_IT=\"yes\"\n\n${FC} -o peaceful_queens_elements_generator peaceful_queens_elements_generator.f90 &&\n ./peaceful_queens_elements_generator ${M} ${N} ${MAX_SOLUTIONS} > peaceful_queens_elements.f90 &&\n ${FC} ${FCFLAGS} -c peaceful_queens_elements.f90 &&\n if test x\"${RM_GENERATED_SRC}\" != xno; then rm -f peaceful_queens_elements.f90; fi &&\n ${FC} ${FCFLAGS} -c peaceful_queens.f90 &&\n ${FC} ${FCFLAGS} -o peaceful_queens peaceful_queens_elements.o peaceful_queens.o &&\n if test x\"${RUN_IT}\" = xyes; then time ./peaceful_queens ${SHOW_EQUIVALENTS}; else :; fi\n","language":"Fortran"},{"code":"Type posicion\n x As Integer\n y As Integer\nEnd Type\n\nType pieza\n empty As Integer\n black As Integer\n white As Integer\nEnd Type\n\nFunction isAttacking(q As posicion, posic As posicion) As Integer\n Return (q.x = posic.x Or q.y = posic.y Or Abs(q.x - posic.x) = Abs(q.y - posic.y))\nEnd Function\n\nSub place(m As Integer, n As Integer, blackQueens() As posicion, whiteQueens() As posicion, Byref result As Integer)\n If m = 0 Then\n result = -1\n Exit Sub\n End If\n Dim As Integer placingBlack = -1\n Dim As Integer i, j, k, equalposicion\n Dim As Boolean inner\n\n For i = 0 To n-1\n For j = 0 To n-1\n Dim As posicion posic = Type<posicion>(i, j)\n inner = False\n For k = Lbound(blackQueens) To Ubound(blackQueens)\n equalposicion = (blackQueens(k).x = posic.x And blackQueens(k).y = posic.y)\n If equalposicion Or (Not placingBlack And isAttacking(blackQueens(k), posic)) Then\n inner = True\n Exit For\n End If\n Next\n If Not inner Then\n For k = Lbound(whiteQueens) To Ubound(whiteQueens)\n equalposicion = (whiteQueens(k).x = posic.x And whiteQueens(k).y = posic.y)\n If equalposicion Or (placingBlack And isAttacking(whiteQueens(k), posic)) Then\n inner = True\n Exit For\n End If\n Next\n If Not inner Then\n If placingBlack Then\n Redim Preserve blackQueens(Ubound(blackQueens) + 1)\n blackQueens(Ubound(blackQueens)) = posic\n placingBlack = 0\n Else\n Redim Preserve whiteQueens(Ubound(whiteQueens) + 1)\n whiteQueens(Ubound(whiteQueens)) = posic\n place(m-1, n, blackQueens(), whiteQueens(), result)\n If result Then Exit Sub\n Redim Preserve blackQueens(Ubound(blackQueens) - 1)\n Redim Preserve whiteQueens(Ubound(whiteQueens) - 1)\n placingBlack = -1\n End If\n End If\n End If\n Next\n Next\n If Not placingBlack Then Redim Preserve blackQueens(Ubound(blackQueens) - 1)\n result = 0\nEnd Sub\n\nSub printBoard(n As Integer, blackQueens() As posicion, whiteQueens() As posicion)\n Dim As Integer board(n * n)\n Dim As Integer i, j, k\n\n For i = Lbound(blackQueens) To Ubound(blackQueens)\n board(blackQueens(i).x * n + blackQueens(i).y) = 1\n Next\n For i = Lbound(whiteQueens) To Ubound(whiteQueens)\n board(whiteQueens(i).x * n + whiteQueens(i).y) = 2\n Next\n For i = 0 To n*n-1\n If i Mod n = 0 And i <> 0 Then Print\n Select Case board(i)\n Case 1\n Print \"B \";\n Case 2\n Print \"W \";\n Case Else\n j = i \\ n\n k = i - j * n\n If j Mod 2 = k Mod 2 Then\n Print Chr(253); \" \";\n Else\n Print Chr(252); \" \";\n End If\n End Select\n Next i\n Print\nEnd Sub\n\nDim As posicion nms(23) = { _\nType<posicion>(2, 1), Type<posicion>(3, 1), Type<posicion>(3, 2), Type<posicion>(4, 1), Type<posicion>(4, 2), Type<posicion>(4, 3), _\nType<posicion>(5, 1), Type<posicion>(5, 2), Type<posicion>(5, 3), Type<posicion>(5, 4), Type<posicion>(5, 5), _\nType<posicion>(6, 1), Type<posicion>(6, 2), Type<posicion>(6, 3), Type<posicion>(6, 4), Type<posicion>(6, 5), Type<posicion>(6, 6), _\nType<posicion>(7, 1), Type<posicion>(7, 2), Type<posicion>(7, 3), Type<posicion>(7, 4), Type<posicion>(7, 5), Type<posicion>(7, 6), Type<posicion>(7, 7) }\n\nFor i As Integer = Lbound(nms) To Ubound(nms)\n Print Chr(10); nms(i).y; \" black and \"; nms(i).y; \" white queens on a \"; nms(i).x; \" x \"; nms(i).x; \" board:\"\n Dim As posicion blackQueens(0)\n Dim As posicion whiteQueens(0)\n Dim As Integer result\n place(nms(i).y, nms(i).x, blackQueens(), whiteQueens(), result)\n If result Then\n printBoard(nms(i).x, blackQueens(), whiteQueens())\n Else\n Print \"No solution exists.\"\n End If\nNext i\n\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport \"fmt\"\n\nconst (\n empty = iota\n black\n white\n)\n\nconst (\n bqueen = 'B'\n wqueen = 'W'\n bbullet = '•'\n wbullet = '◦'\n)\n\ntype position struct{ i, j int }\n\nfunc iabs(i int) int {\n if i < 0 {\n return -i\n }\n return i\n}\n\nfunc place(m, n int, pBlackQueens, pWhiteQueens *[]position) bool {\n if m == 0 {\n return true\n }\n placingBlack := true\n for i := 0; i < n; i++ {\n inner:\n for j := 0; j < n; j++ {\n pos := position{i, j}\n for _, queen := range *pBlackQueens {\n if queen == pos || !placingBlack && isAttacking(queen, pos) {\n continue inner\n }\n }\n for _, queen := range *pWhiteQueens {\n if queen == pos || placingBlack && isAttacking(queen, pos) {\n continue inner\n }\n }\n if placingBlack {\n *pBlackQueens = append(*pBlackQueens, pos)\n placingBlack = false\n } else {\n *pWhiteQueens = append(*pWhiteQueens, pos)\n if place(m-1, n, pBlackQueens, pWhiteQueens) {\n return true\n }\n *pBlackQueens = (*pBlackQueens)[0 : len(*pBlackQueens)-1]\n *pWhiteQueens = (*pWhiteQueens)[0 : len(*pWhiteQueens)-1]\n placingBlack = true\n }\n }\n }\n if !placingBlack {\n *pBlackQueens = (*pBlackQueens)[0 : len(*pBlackQueens)-1]\n }\n return false\n}\n\nfunc isAttacking(queen, pos position) bool {\n if queen.i == pos.i {\n return true\n }\n if queen.j == pos.j {\n return true\n }\n if iabs(queen.i-pos.i) == iabs(queen.j-pos.j) {\n return true\n }\n return false\n}\n\nfunc printBoard(n int, blackQueens, whiteQueens []position) {\n board := make([]int, n*n)\n for _, queen := range blackQueens {\n board[queen.i*n+queen.j] = black\n }\n for _, queen := range whiteQueens {\n board[queen.i*n+queen.j] = white\n }\n\n for i, b := range board {\n if i != 0 && i%n == 0 {\n fmt.Println()\n }\n switch b {\n case black:\n fmt.Printf(\"%c \", bqueen)\n case white:\n fmt.Printf(\"%c \", wqueen)\n case empty:\n if i%2 == 0 {\n fmt.Printf(\"%c \", bbullet)\n } else {\n fmt.Printf(\"%c \", wbullet)\n }\n }\n }\n fmt.Println(\"\\n\")\n}\n\nfunc main() {\n nms := [][2]int{\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\n }\n for _, nm := range nms {\n n, m := nm[0], nm[1]\n fmt.Printf(\"%d black and %d white queens on a %d x %d board:\\n\", m, m, n, n)\n var blackQueens, whiteQueens []position\n if place(m, n, &blackQueens, &whiteQueens) {\n printBoard(n, blackQueens, whiteQueens)\n } else {\n fmt.Println(\"No solution exists.\\n\")\n }\n }\n}\n","language":"Go"},{"code":"import java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.List;\n\npublic class Peaceful {\n enum Piece {\n Empty,\n Black,\n White,\n }\n\n public static class Position {\n public int x, y;\n\n public Position(int x, int y) {\n this.x = x;\n this.y = y;\n }\n\n @Override\n public boolean equals(Object obj) {\n if (obj instanceof Position) {\n Position pos = (Position) obj;\n return pos.x == x && pos.y == y;\n }\n return false;\n }\n }\n\n private static boolean place(int m, int n, List<Position> pBlackQueens, List<Position> pWhiteQueens) {\n if (m == 0) {\n return true;\n }\n boolean placingBlack = true;\n for (int i = 0; i < n; ++i) {\n inner:\n for (int j = 0; j < n; ++j) {\n Position pos = new Position(i, j);\n for (Position queen : pBlackQueens) {\n if (pos.equals(queen) || !placingBlack && isAttacking(queen, pos)) {\n continue inner;\n }\n }\n for (Position queen : pWhiteQueens) {\n if (pos.equals(queen) || placingBlack && isAttacking(queen, pos)) {\n continue inner;\n }\n }\n if (placingBlack) {\n pBlackQueens.add(pos);\n placingBlack = false;\n } else {\n pWhiteQueens.add(pos);\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true;\n }\n pBlackQueens.remove(pBlackQueens.size() - 1);\n pWhiteQueens.remove(pWhiteQueens.size() - 1);\n placingBlack = true;\n }\n }\n }\n if (!placingBlack) {\n pBlackQueens.remove(pBlackQueens.size() - 1);\n }\n return false;\n }\n\n private static boolean isAttacking(Position queen, Position pos) {\n return queen.x == pos.x\n || queen.y == pos.y\n || Math.abs(queen.x - pos.x) == Math.abs(queen.y - pos.y);\n }\n\n private static void printBoard(int n, List<Position> blackQueens, List<Position> whiteQueens) {\n Piece[] board = new Piece[n * n];\n Arrays.fill(board, Piece.Empty);\n\n for (Position queen : blackQueens) {\n board[queen.x + n * queen.y] = Piece.Black;\n }\n for (Position queen : whiteQueens) {\n board[queen.x + n * queen.y] = Piece.White;\n }\n for (int i = 0; i < board.length; ++i) {\n if ((i != 0) && i % n == 0) {\n System.out.println();\n }\n\n Piece b = board[i];\n if (b == Piece.Black) {\n System.out.print(\"B \");\n } else if (b == Piece.White) {\n System.out.print(\"W \");\n } else {\n int j = i / n;\n int k = i - j * n;\n if (j % 2 == k % 2) {\n System.out.print(\"• \");\n } else {\n System.out.print(\"◦ \");\n }\n }\n }\n System.out.println('\\n');\n }\n\n public static void main(String[] args) {\n List<Position> nms = List.of(\n new Position(2, 1),\n new Position(3, 1),\n new Position(3, 2),\n new Position(4, 1),\n new Position(4, 2),\n new Position(4, 3),\n new Position(5, 1),\n new Position(5, 2),\n new Position(5, 3),\n new Position(5, 4),\n new Position(5, 5),\n new Position(6, 1),\n new Position(6, 2),\n new Position(6, 3),\n new Position(6, 4),\n new Position(6, 5),\n new Position(6, 6),\n new Position(7, 1),\n new Position(7, 2),\n new Position(7, 3),\n new Position(7, 4),\n new Position(7, 5),\n new Position(7, 6),\n new Position(7, 7)\n );\n for (Position nm : nms) {\n int m = nm.y;\n int n = nm.x;\n System.out.printf(\"%d black and %d white queens on a %d x %d board:\\n\", m, m, n, n);\n List<Position> blackQueens = new ArrayList<>();\n List<Position> whiteQueens = new ArrayList<>();\n if (place(m, n, blackQueens, whiteQueens)) {\n printBoard(n, blackQueens, whiteQueens);\n } else {\n System.out.println(\"No solution exists.\\n\");\n }\n }\n }\n}\n","language":"Java"},{"code":"using Gtk\n\nstruct Position\n row::Int\n col::Int\nend\n\nfunction place!(numeach, bsize, bqueens, wqueens)\n isattack(q, pos) = (q.row == pos.row || q.col == pos.col ||\n abs(q.row - pos.row) == abs(q.col - pos.col))\n noattack(qs, pos) = !any(x -> isattack(x, pos), qs)\n positionopen(bqs, wqs, p) = !any(x -> x == p, bqs) && !any(x -> x == p, wqs)\n\n placingbqueens = true\n if numeach < 1\n return true\n end\n for i in 1:bsize, j in 1:bsize\n bpos = Position(i, j)\n if positionopen(bqueens, wqueens, bpos)\n if placingbqueens && noattack(wqueens, bpos)\n push!(bqueens, bpos)\n placingbqueens = false\n elseif !placingbqueens && noattack(bqueens, bpos)\n push!(wqueens, bpos)\n if place!(numeach - 1, bsize, bqueens, wqueens)\n return true\n end\n pop!(bqueens)\n pop!(wqueens)\n placingbqueens = true\n end\n end\n end\n if !placingbqueens\n pop!(bqueens)\n end\n false\nend\n\nfunction peacefulqueenapp()\n win = GtkWindow(\"Peaceful Chess Queen Armies\", 800, 800) |> (GtkFrame() |> (box = GtkBox(:v)))\n boardsize = 5\n numqueenseach = 4\n hbox = GtkBox(:h)\n boardscale = GtkScale(false, 2:16)\n set_gtk_property!(boardscale, :hexpand, true)\n blabel = GtkLabel(\"Choose Board Size\")\n nqueenscale = GtkScale(false, 1:24)\n set_gtk_property!(nqueenscale, :hexpand, true)\n qlabel = GtkLabel(\"Choose Number of Queens Per Side\")\n solveit = GtkButton(\"Solve\")\n set_gtk_property!(solveit, :label, \" Solve \")\n solvequeens(wid) = (boardsize = Int(GAccessor.value(boardscale));\n numqueenseach = Int(GAccessor.value(nqueenscale)); update!())\n signal_connect(solvequeens, solveit, :clicked)\n map(w->push!(hbox, w),[blabel, boardscale, qlabel, nqueenscale, solveit])\n scrwin = GtkScrolledWindow()\n grid = GtkGrid()\n push!(scrwin, grid)\n map(w -> push!(box, w),[hbox, scrwin])\n piece = (white = \"\\u2655\", black = \"\\u265B\", blank = \" \")\n stylist = GtkStyleProvider(Gtk.CssProviderLeaf(data=\"\"\"\n label {background-image: image(cornsilk); font-size: 48px;}\n button {background-image: image(tan); font-size: 48px;}\"\"\"))\n\n function update!()\n bqueens, wqueens = Vector{Position}(), Vector{Position}()\n place!(numqueenseach, boardsize, bqueens, wqueens)\n if length(bqueens) == 0\n warn_dialog(\"No solution for board size $boardsize and $numqueenseach queens each.\", win)\n return\n end\n empty!(grid)\n labels = Array{Gtk.GtkLabelLeaf, 2}(undef, (boardsize, boardsize))\n buttons = Array{GtkButtonLeaf, 2}(undef, (boardsize, boardsize))\n for i in 1:boardsize, j in 1:boardsize\n if isodd(i + j)\n grid[i, j] = buttons[i, j] = GtkButton(piece.blank)\n set_gtk_property!(buttons[i, j], :expand, true)\n push!(Gtk.GAccessor.style_context(buttons[i, j]), stylist, 600)\n else\n grid[i, j] = labels[i, j] = GtkLabel(piece.blank)\n set_gtk_property!(labels[i, j], :expand, true)\n push!(Gtk.GAccessor.style_context(labels[i, j]), stylist, 600)\n end\n pos = Position(i, j)\n if pos in bqueens\n set_gtk_property!(grid[i, j], :label, piece.black)\n elseif pos in wqueens\n set_gtk_property!(grid[i, j], :label, piece.white)\n end\n end\n showall(win)\n end\n\n update!()\n cond = Condition()\n endit(w) = notify(cond)\n signal_connect(endit, win, :destroy)\n showall(win)\n wait(cond)\nend\n\npeacefulqueenapp()\n","language":"Julia"},{"code":"import kotlin.math.abs\n\nenum class Piece {\n Empty,\n Black,\n White,\n}\n\ntypealias Position = Pair<Int, Int>\n\nfun place(m: Int, n: Int, pBlackQueens: MutableList<Position>, pWhiteQueens: MutableList<Position>): Boolean {\n if (m == 0) {\n return true\n }\n var placingBlack = true\n for (i in 0 until n) {\n inner@\n for (j in 0 until n) {\n val pos = Position(i, j)\n for (queen in pBlackQueens) {\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\n continue@inner\n }\n }\n for (queen in pWhiteQueens) {\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\n continue@inner\n }\n }\n placingBlack = if (placingBlack) {\n pBlackQueens.add(pos)\n false\n } else {\n pWhiteQueens.add(pos)\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\n return true\n }\n pBlackQueens.removeAt(pBlackQueens.lastIndex)\n pWhiteQueens.removeAt(pWhiteQueens.lastIndex)\n true\n }\n }\n }\n if (!placingBlack) {\n pBlackQueens.removeAt(pBlackQueens.lastIndex)\n }\n return false\n}\n\nfun isAttacking(queen: Position, pos: Position): Boolean {\n return queen.first == pos.first\n || queen.second == pos.second\n || abs(queen.first - pos.first) == abs(queen.second - pos.second)\n}\n\nfun printBoard(n: Int, blackQueens: List<Position>, whiteQueens: List<Position>) {\n val board = MutableList(n * n) { Piece.Empty }\n\n for (queen in blackQueens) {\n board[queen.first * n + queen.second] = Piece.Black\n }\n for (queen in whiteQueens) {\n board[queen.first * n + queen.second] = Piece.White\n }\n for ((i, b) in board.withIndex()) {\n if (i != 0 && i % n == 0) {\n println()\n }\n if (b == Piece.Black) {\n print(\"B \")\n } else if (b == Piece.White) {\n print(\"W \")\n } else {\n val j = i / n\n val k = i - j * n\n if (j % 2 == k % 2) {\n print(\"• \")\n } else {\n print(\"◦ \")\n }\n }\n }\n println('\\n')\n}\n\nfun main() {\n val nms = listOf(\n Pair(2, 1), Pair(3, 1), Pair(3, 2), Pair(4, 1), Pair(4, 2), Pair(4, 3),\n Pair(5, 1), Pair(5, 2), Pair(5, 3), Pair(5, 4), Pair(5, 5),\n Pair(6, 1), Pair(6, 2), Pair(6, 3), Pair(6, 4), Pair(6, 5), Pair(6, 6),\n Pair(7, 1), Pair(7, 2), Pair(7, 3), Pair(7, 4), Pair(7, 5), Pair(7, 6), Pair(7, 7)\n )\n for ((n, m) in nms) {\n println(\"$m black and $m white queens on a $n x $n board:\")\n val blackQueens = mutableListOf<Position>()\n val whiteQueens = mutableListOf<Position>()\n if (place(m, n, blackQueens, whiteQueens)) {\n printBoard(n, blackQueens, whiteQueens)\n } else {\n println(\"No solution exists.\\n\")\n }\n }\n}\n","language":"Kotlin"},{"code":"ClearAll[ValidSpots, VisibleByQueen, SolveQueen, GetSolution]\nVisualizeState[state_] := Module[{q, cells},\n q = MapIndexed[If[#[\"q\"] == -1, {}, Text[Style[#[\"q\"], 24], #2]] &, state, {2}];\n cells = MapIndexed[{If[OddQ[Total[#2]], FaceForm[],\n FaceForm[GrayLevel[0.8]]], EdgeForm[Black],\n Rectangle[#2 - 0.5, #2 + 0.5]} &, state, {2}];\n Graphics[{cells, q}]\n ]\nValidSpots[state_, tp_Integer] := Module[{vals},\n vals = Catenate@MapIndexed[If[#1[\"q\"] == -1 \\[And] DeleteCases[#1[\"v\"], tp] == {}, #2, Missing[]] &, state, {2}];\n DeleteMissing[vals]\n ]\nVisibleByQueen[{i_, j_}, {a_, b_}] := i == a \\[Or] j == b \\[Or] i + j == a + b \\[Or] i - j == a - b\nPlaceQueen[state_, pos : {i_Integer, j_Integer}, tp_Integer] := Module[{vals, out},\n out = state;\n out[[i, j]] = Association[out[[i, j]], \"q\" -> tp];\n out = MapIndexed[If[VisibleByQueen[{i, j}, #2], <|#1, \"v\" -> Append[#1[\"v\"], tp]|>, #1] &, out, {2}];\n out\n ]\nSolveQueen[state_, toplace_List] :=\n Module[{len = Length[toplace], next, valid, newstate},\n If[len == 0,\n Print[VisualizeState@state];\n Print[StringRiffle[StringJoin /@ Map[ToString, state[[All, All, \"q\"]] /. -1 -> \".\", {2}], \"\\n\"]];\n Abort[];\n ,\n next = First[toplace];\n valid = ValidSpots[state, next];\n Do[\n newstate = PlaceQueen[state, v, next];\n SolveQueen[newstate, Rest[toplace]]\n ,\n {v, valid}\n ]\n ]\n ]\nGetSolution[n_Integer?Positive, m_Integer?Positive, numcol_ : 2] :=\n Module[{state, tp},\n state = ConstantArray[<|\"q\" -> -1, \"v\" -> {}|>, {n, n}];\n tp = Flatten[Transpose[ConstantArray[#, m] & /@ Range[numcol]]];\n SolveQueen[state, tp]\n ]\nGetSolution[8, 4, 3](* Solves placing 3 armies of each 4 queens on an 8*8 board*)\nGetSolution[5, 4, 2](* Solves placing 2 armies of each 4 queens on an 5*5 board*)\n","language":"Mathematica"},{"code":"import sequtils, strformat\n\ntype\n\n Piece {.pure.} = enum Empty, Black, White\n Position = tuple[x, y: int]\n\n\nfunc isAttacking(queen, pos: Position): bool =\n queen.x == pos.x or queen.y == pos.y or abs(queen.x - pos.x) == abs(queen.y - pos.y)\n\n\nfunc place(m, n: int; blackQueens, whiteQueens: var seq[Position]): bool =\n\n if m == 0: return true\n\n var placingBlack = true\n for i in 0..<n:\n for j in 0..<n:\n\n block inner:\n let pos: Position = (i, j)\n for queen in blackQueens:\n if queen == pos or not placingBlack and queen.isAttacking(pos):\n break inner\n for queen in whiteQueens:\n if queen == pos or placingBlack and queen.isAttacking(pos):\n break inner\n\n if placingBlack:\n blackQueens.add pos\n else:\n whiteQueens.add pos\n if place(m - 1, n, blackQueens, whiteQueens): return true\n discard blackQueens.pop()\n discard whiteQueens.pop()\n placingBlack = not placingBlack\n\n if not placingBlack:\n discard blackQueens.pop()\n\n\nproc printBoard(n: int; blackQueens, whiteQueens: seq[Position]) =\n\n var board = newSeqWith(n, newSeq[Piece](n)) # Initialized to Empty.\n\n for queen in blackQueens:\n board[queen.x][queen.y] = Black\n for queen in whiteQueens:\n board[queen.x][queen.y] = White\n\n for i in 0..<n:\n for j in 0..<n:\n stdout.write case board[i][j]\n of Black: \"B \"\n of White: \"W \"\n of Empty: (if (i and 1) == (j and 1): \"• \" else: \"◦ \")\n stdout.write '\\n'\n\n echo \"\"\n\n\nconst Nms = [(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)]\n\nfor (n, m) in Nms:\n echo &\"{m} black and {m} white queens on a {n} x {n} board:\"\n var blackQueens, whiteQueens: seq[Position]\n if place(m, n, blackQueens, whiteQueens):\n printBoard(n, blackQueens, whiteQueens)\n else:\n echo \"No solution exists.\\n\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\n\nmy $m = shift // 4;\nmy $n = shift // 5;\nmy %seen;\nmy $gaps = join '|', qr/-*/, map qr/.{$_}(?:-.{$_})*/s, $n-1, $n, $n+1;\nmy $attack = qr/(\\w)(?:$gaps)(?!\\1)\\w/;\n\nplace( scalar ('-' x $n . \"\\n\") x $n );\nprint \"No solution to $m $n\\n\";\n\nsub place\n {\n local $_ = shift;\n $seen{$_}++ || /$attack/ and return; # previously or attack\n (my $have = tr/WB//) < $m * 2 or exit !print \"Solution to $m $n\\n\\n$_\";\n place( s/-\\G/ qw(W B)[$have % 2] /er ) while /-/g; # place next queen\n }\n","language":"Perl"},{"code":"use strict;\nuse warnings;\nuse feature 'say';\nuse feature 'state';\nuse utf8;\nbinmode(STDOUT, ':utf8');\n\n# recursively place the next queen\nsub place {\n my($board, $n, $m, $empty_square) = @_;\n state(%seen,$attack,$solution);\n\n # logic of 'attack' regex: queen ( ... paths between queens containing only empty squares ... ) queen of other color\n unless ($attack) {\n $attack =\n '([WB])' . # 1st queen\n '(?:' .\n join('|',\n \"[$empty_square]*\",\n map {\n \"(?^s:.{$_}(?:[$empty_square].{$_})*)\"\n } $n-1, $n, $n+1\n ) .\n ')' .\n '(?!\\1)[WB]'; # 2nd queen\n }\n\n # pass first result found back up the stack (omit this line to get last result found)\n return $solution if $solution;\n\n # bail out if seen this configuration previously, or attack detected\n return if $seen{$board}++ or $board =~ /$attack/;\n\n # success if queen count is m×2\n $solution = $board and return if $m * 2 == (my $have = $board =~ tr/WB//);\n\n # place the next queen (alternating colors each time)\n place( $board =~ s/[$empty_square]\\G/ qw<W B>[$have % 2] /er, $n, $m, $empty_square )\n while $board =~ /[$empty_square]/g;\n\n return $solution\n}\n\nmy($m, $n) = $#ARGV == 1 ? @ARGV : (4, 5);\nmy $empty_square = '◦•';\nmy $board = join \"\\n\", map { substr $empty_square x $n, $_%2, $n } 1..$n;\n\nmy $solution = place $board, $n, $m, $empty_square;\n\nsay $solution\n ? sprintf \"Solution to $m $n\\n\\n%s\", map { s/(.)/$1 /gm; s/B /♛/gm; s/W /♕/gmr } $solution\n : \"No solution to $m $n\";\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Queen_Armies.exw\n -- =============================\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #7060A8;\">requires</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"1.0.2\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- (puts(fn,x,false) for p2js.js)</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">html</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">as_html</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">queens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">``</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">`♛`</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">`<font color=\"green\">♕</font>`</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #008000;\">`<span style=\"color:red\">?</span>`</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">showboard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">board</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">'-'</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">board</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'B'</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">board</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'W'</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">as_html</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"<br><b>## %d black and %d white queens on a %d-by-%d board</b><br>\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">}),</span>\n <span style=\"color: #000000;\">tbl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"</span>\n <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\"<table style=\\\"font-weight:bold\\\">\\n \"</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">tbl</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\" </tr>\\n <tr valign=\\\"middle\\\" align=\\\"center\\\">\\n\"</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">xw</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">xb</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">({</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">},</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)!=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">dx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">xw</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">xb</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">queens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">bg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #008000;\">` bgcolor=\"silver\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">tbl</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\" <td style=\\\"width:14pt; height:14pt;\\\"%s>%s</td>\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">bg</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">tbl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">11</span><span style=\"color: #0000FF;\">..$]</span>\n <span style=\"color: #000000;\">out</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\" </tr>\\n</table>\\n<br>\\n\"</span>\n <span style=\"color: #000000;\">html</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">out</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">b</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d black and %d white queens on a %d x %d board:\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">b</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">board</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- ?{n,blackqueens, whitequeens}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">isAttacking</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">queen</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">queen</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pj</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pos</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">pi</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">pj</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">qi</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">pi</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #7060A8;\">abs</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">qj</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">pj</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">blackqueens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{},</span> <span style=\"color: #000000;\">whitequeens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">m</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #000000;\">showboard</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">placingBlack</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">pos</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">queen</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">queen</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">pos</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">((</span><span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">placingBlack</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">isAttacking</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">queen</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">pos</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">!={}</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">queen</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">queen</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #000000;\">pos</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">placingBlack</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">isAttacking</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">queen</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">pos</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">exit</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">!={}</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">placingBlack</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">blackqueens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">placingBlack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">whitequeens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">blackqueens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">blackqueens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">whitequeens</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">whitequeens</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..$-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">placingBlack</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">7</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-(</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">no</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"Cannot place %d+ queen armies on a %d-by-%d board\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">m</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">as_html</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">html</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"<b># %s</b><br><br>\\n\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">no</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s.\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">no</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">html_header</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n <!DOCTYPE html>\n <html lang=\"en\">\n <head>\n <meta charset=\"utf-8\" />\n <meta http-equiv=\"Content-Type\" content=\"text/html; charset=UTF-8\" />\n <title>Queen Armies</title>\n </head>\n <body>\n <h2>queen armies</h2>\n \"\"\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">-- or <div style=\"overflow:scroll; height:250px;\"></span>\n <span style=\"color: #000000;\">html_footer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n </body>\n </html>\n \"\"\"</span> <span style=\"color: #000080;font-style:italic;\">-- or </div></span>\n\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">as_html</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fn</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">open</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"queen_armies.html\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"w\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html_header</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">html_footer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">close</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">fn</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"See queen_armies.html\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n\n <span style=\"color: #0000FF;\">?</span><span style=\"color: #008000;\">\"done\"</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">wait_key</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"from itertools import combinations, product, count\nfrom functools import lru_cache, reduce\n\n\n_bbullet, _wbullet = '\\u2022\\u25E6'\n_or = set.__or__\n\ndef place(m, n):\n \"Place m black and white queens, peacefully, on an n-by-n board\"\n board = set(product(range(n), repeat=2)) # (x, y) tuples\n placements = {frozenset(c) for c in combinations(board, m)}\n for blacks in placements:\n black_attacks = reduce(_or,\n (queen_attacks_from(pos, n) for pos in blacks),\n set())\n for whites in {frozenset(c) # Never on blsck attacking squares\n for c in combinations(board - black_attacks, m)}:\n if not black_attacks & whites:\n return blacks, whites\n return set(), set()\n\n@lru_cache(maxsize=None)\ndef queen_attacks_from(pos, n):\n x0, y0 = pos\n a = set([pos]) # Its position\n a.update((x, y0) for x in range(n)) # Its row\n a.update((x0, y) for y in range(n)) # Its column\n # Diagonals\n for x1 in range(n):\n # l-to-r diag\n y1 = y0 -x0 +x1\n if 0 <= y1 < n:\n a.add((x1, y1))\n # r-to-l diag\n y1 = y0 +x0 -x1\n if 0 <= y1 < n:\n a.add((x1, y1))\n return a\n\ndef pboard(black_white, n):\n \"Print board\"\n if black_white is None:\n blk, wht = set(), set()\n else:\n blk, wht = black_white\n print(f\"## {len(blk)} black and {len(wht)} white queens \"\n f\"on a {n}-by-{n} board:\", end='')\n for x, y in product(range(n), repeat=2):\n if y == 0:\n print()\n xy = (x, y)\n ch = ('?' if xy in blk and xy in wht\n else 'B' if xy in blk\n else 'W' if xy in wht\n else _bbullet if (x + y)%2 else _wbullet)\n print('%s' % ch, end='')\n print()\n\nif __name__ == '__main__':\n n=2\n for n in range(2, 7):\n print()\n for m in count(1):\n ans = place(m, n)\n if ans[0]:\n pboard(ans, n)\n else:\n print (f\"# Can't place {m} queens on a {n}-by-{n} board\")\n break\n #\n print('\\n')\n m, n = 5, 7\n ans = place(m, n)\n pboard(ans, n)\n","language":"Python"},{"code":"from peaceful_queen_armies_simpler import place\nfrom itertools import product, count\n\n_bqueenh, _wqueenh = '♛', '<font color=\"green\">♕</font>'\n\ndef hboard(black_white, n):\n \"HTML board generator\"\n if black_white is None:\n blk, wht = set(), set()\n else:\n blk, wht = black_white\n out = (f\"<br><b>## {len(blk)} black and {len(wht)} white queens \"\n f\"on a {n}-by-{n} board</b><br>\\n\")\n out += '<table style=\"font-weight:bold\">\\n '\n tbl = ''\n for x, y in product(range(n), repeat=2):\n if y == 0:\n tbl += ' </tr>\\n <tr valign=\"middle\" align=\"center\">\\n'\n xy = (x, y)\n ch = ('<span style=\"color:red\">?</span>' if xy in blk and xy in wht\n else _bqueenh if xy in blk\n else _wqueenh if xy in wht\n else \"\")\n bg = \"\" if (x + y)%2 else ' bgcolor=\"silver\"'\n tbl += f' <td style=\"width:14pt; height:14pt;\"{bg}>{ch}</td>\\n'\n out += tbl[7:]\n out += ' </tr>\\n</table>\\n<br>\\n'\n return out\n\nif __name__ == '__main__':\n n=2\n html = ''\n for n in range(2, 7):\n print()\n for m in count(1):\n ans = place(m, n)\n if ans[0]:\n html += hboard(ans, n)\n else:\n html += (f\"<b># Can't place {m} queen armies on a \"\n f\"{n}-by-{n} board</b><br><br>\\n\\n\" )\n break\n #\n html += '<br>\\n'\n m, n = 6, 7\n ans = place(m, n)\n html += hboard(ans, n)\n with open('peaceful_queen_armies.htm', 'w') as f:\n f.write(html)\n","language":"Python"},{"code":"# recursively place the next queen\nsub place ($board, $n, $m, $empty-square) {\n my $cnt;\n state (%seen,$attack);\n state $solution = False;\n\n # logic of regex: queen ( ... paths between queens containing only empty squares ... ) queen of other color\n once {\n my %Q = 'WBBW'.comb; # return the queen of alternate color\n my $re =\n '(<[WB]>)' ~ # 1st queen\n '[' ~\n join(' |',\n qq/<[$empty-square]>*/,\n map {\n qq/ . ** {$_}[<[$empty-square]> . ** {$_}]*/\n }, $n-1, $n, $n+1\n ) ~\n ']' ~\n '<{%Q{$0}}>'; # 2nd queen\n $attack = \"rx/$re/\".EVAL;\n }\n\n # return first result found (omit this line to get last result found)\n return $solution if $solution;\n\n # bail out if seen this configuration previously, or attack detected\n return if %seen{$board}++ or $board ~~ $attack;\n\n # success if queen count is m×2, set state variable and return from recursion\n $solution = $board and return if $m * 2 == my $queens = $board.comb.Bag{<W B>}.sum;\n\n # place the next queen (alternating colors each time)\n place( $board.subst( /<[◦•]>/, {<W B>[$queens % 2]}, :nth($cnt) ), $n, $m, $empty-square )\n while $board ~~ m:nth(++$cnt)/<[◦•]>/;\n\n return $solution\n}\n\nmy ($m, $n) = @*ARGS == 2 ?? @*ARGS !! (4, 5);\nmy $empty-square = '◦•';\nmy $board = ($empty-square x $n**2).comb.rotor($n)>>.join[^$n].join: \"\\n\";\n\nmy $solution = place $board, $n, $m, $empty-square;\n\nsay $solution\n ?? \"Solution to $m $n\\n\\n{S:g/(\\N)/$0 / with $solution}\"\n !! \"No solution to $m $n\";\n","language":"Raku"},{"code":"class Position\n attr_reader :x, :y\n\n def initialize(x, y)\n @x = x\n @y = y\n end\n\n def ==(other)\n self.x == other.x &&\n self.y == other.y\n end\n\n def to_s\n '(%d, %d)' % [@x, @y]\n end\n\n def to_str\n to_s\n end\nend\n\ndef isAttacking(queen, pos)\n return queen.x == pos.x ||\n queen.y == pos.y ||\n (queen.x - pos.x).abs() == (queen.y - pos.y).abs()\nend\n\ndef place(m, n, blackQueens, whiteQueens)\n if m == 0 then\n return true\n end\n placingBlack = true\n for i in 0 .. n-1\n for j in 0 .. n-1\n catch :inner do\n pos = Position.new(i, j)\n for queen in blackQueens\n if pos == queen || !placingBlack && isAttacking(queen, pos) then\n throw :inner\n end\n end\n for queen in whiteQueens\n if pos == queen || placingBlack && isAttacking(queen, pos) then\n throw :inner\n end\n end\n if placingBlack then\n blackQueens << pos\n placingBlack = false\n else\n whiteQueens << pos\n if place(m - 1, n, blackQueens, whiteQueens) then\n return true\n end\n blackQueens.pop\n whiteQueens.pop\n placingBlack = true\n end\n end\n end\n end\n if !placingBlack then\n blackQueens.pop\n end\n return false\nend\n\ndef printBoard(n, blackQueens, whiteQueens)\n # initialize the board\n board = Array.new(n) { Array.new(n) { ' ' } }\n for i in 0 .. n-1\n for j in 0 .. n-1\n if i % 2 == j % 2 then\n board[i][j] = '•'\n else\n board[i][j] = '◦'\n end\n end\n end\n\n # insert the queens\n for queen in blackQueens\n board[queen.y][queen.x] = 'B'\n end\n for queen in whiteQueens\n board[queen.y][queen.x] = 'W'\n end\n\n # print the board\n for row in board\n for cell in row\n print cell, ' '\n end\n print \"\\n\"\n end\n print \"\\n\"\nend\n\nnms = [\n [2, 1],\n [3, 1], [3, 2],\n [4, 1], [4, 2], [4, 3],\n [5, 1], [5, 2], [5, 3], [5, 4], [5, 5],\n [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6],\n [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7]\n]\nfor nm in nms\n m = nm[1]\n n = nm[0]\n print \"%d black and %d white queens on a %d x %d board:\\n\" % [m, m, n, n]\n\n blackQueens = []\n whiteQueens = []\n if place(m, n, blackQueens, whiteQueens) then\n printBoard(n, blackQueens, whiteQueens)\n else\n print \"No solution exists.\\n\\n\"\n end\nend\n","language":"Ruby"},{"code":";;;\n;;; Solutions to the Peaceful Chess Queen Armies puzzle, in R7RS\n;;; Scheme (using also SRFI-132).\n;;;\n;;; https://rosettacode.org/wiki/Peaceful_chess_queen_armies\n;;;\n\n(cond-expand\n (r7rs)\n (chicken (import (r7rs))))\n\n(import (scheme process-context))\n(import (only (srfi 132) list-sort))\n\n(define-record-type <&fail>\n (make-the-one-unique-&fail-that-you-must-not-make-twice)\n do-not-use-this:&fail?)\n\n(define &fail\n (make-the-one-unique-&fail-that-you-must-not-make-twice))\n\n(define (failure? f)\n (eq? f &fail))\n\n(define (success? f)\n (not (failure? f)))\n\n(define *suspend*\n (make-parameter (lambda (x) x)))\n\n(define (suspend v)\n ((*suspend*) v))\n\n(define (fail-forever)\n (let loop ()\n (suspend &fail)\n (loop)))\n\n(define (make-generator-procedure thunk)\n ;;\n ;; Make a suspendable procedure that takes no arguments. It is a\n ;; simple generator of values. (One can elaborate on this to have\n ;; the procedure accept an argument upon resumption, like an Icon\n ;; co-expression.)\n ;;\n (define (next-run return)\n (define (my-suspend v)\n (set! return\n (call/cc\n (lambda (resumption-point)\n (set! next-run resumption-point)\n (return v)))))\n (parameterize ((*suspend* my-suspend))\n (suspend (thunk))\n (fail-forever)))\n (lambda ()\n (call/cc next-run)))\n\n(define BLACK 'B)\n(define WHITE 'W)\n\n(define (flip-color c)\n (if (eq? c BLACK) WHITE BLACK))\n\n(define-record-type <queen>\n (make-queen color rank file)\n queen?\n (color queen-color)\n (rank queen-rank)\n (file queen-file))\n\n(define (serialize-queen queen)\n (string-append (if (eq? (queen-color queen) BLACK) \"B\" \"W\")\n \"(\" (number->string (queen-rank queen))\n \",\" (number->string (queen-file queen)) \")\"))\n\n(define (serialize-queens queens)\n (apply string-append\n (list-sort string<? (map serialize-queen queens))))\n\n(define (queens->string n queens)\n\n (define board\n (let ((board (make-vector (* n n) #f)))\n (do ((q queens (cdr q)))\n ((null? q))\n (let* ((color (queen-color (car q)))\n (i (queen-rank (car q)))\n (j (queen-file (car q))))\n (vector-set! board (ij->index n i j) color)))\n board))\n\n (define rule\n (let ((str \"+\"))\n (do ((j 1 (+ j 1)))\n ((= j (+ n 1)))\n (set! str (string-append str \"----+\")))\n str))\n\n (define str \"\")\n\n (when (< 0 n)\n (set! str rule)\n (do ((i n (- i 1)))\n ((= i 0))\n (set! str (string-append str \"\\n\"))\n (do ((j 1 (+ j 1)))\n ((= j (+ n 1)))\n (let* ((color (vector-ref board (ij->index n i j)))\n (representation\n (cond ((eq? color #f) \" \")\n ((eq? color BLACK) \" B \")\n ((eq? color WHITE) \" W \")\n (else \" ?? \"))))\n (set! str (string-append str \"|\" representation))))\n (set! str (string-append str \"|\\n\" rule))))\n str)\n\n(define (queen-fits-in? queen other-queens)\n (or (null? other-queens)\n (let ((other (car other-queens)))\n (let ((colorq (queen-color queen))\n (rankq (queen-rank queen))\n (fileq (queen-file queen))\n (coloro (queen-color other))\n (ranko (queen-rank other))\n (fileo (queen-file other)))\n (if (eq? colorq coloro)\n (and (or (not (= rankq ranko))\n (not (= fileq fileo)))\n (queen-fits-in? queen (cdr other-queens)))\n (and (not (= rankq ranko))\n (not (= fileq fileo))\n (not (= (+ rankq fileq) (+ ranko fileo)))\n (not (= (- rankq fileq) (- ranko fileo)))\n (queen-fits-in? queen (cdr other-queens))))))))\n\n(define (latest-queen-fits-in? queens)\n (or (null? (cdr queens))\n (queen-fits-in? (car queens) (cdr queens))))\n\n(define (make-peaceful-queens-generator m n)\n (make-generator-procedure\n (lambda ()\n (define solutions '())\n\n (let loop ((queens (list (make-queen BLACK 1 1)))\n (num-queens 1))\n\n (define (add-another-queen)\n (let ((color (flip-color (queen-color (car queens)))))\n (loop (cons (make-queen color 1 1) queens)\n (+ num-queens 1))))\n\n (define (move-a-queen)\n (let drop-one ((queens queens)\n (num-queens num-queens))\n (if (zero? num-queens)\n (loop '() 0)\n (let* ((latest (car queens))\n (color (queen-color latest))\n (rank (queen-rank latest))\n (file (queen-file latest)))\n (if (and (= rank n) (= file n))\n (drop-one (cdr queens) (- num-queens 1))\n (let-values (((rank^ file^)\n (advance-ij n rank file)))\n (loop (cons (make-queen color rank^ file^)\n (cdr queens))\n num-queens)))))))\n\n (cond ((zero? num-queens)\n ;; There are no more solutions.\n &fail)\n\n ((latest-queen-fits-in? queens)\n (if (= num-queens (* 2 m))\n (let ((str (serialize-queens queens)))\n ;; The current \"queens\" is a solution.\n (unless (member str solutions)\n ;; The current \"queens\" is a *new* solution.\n (set! solutions (cons str solutions))\n (suspend queens))\n (move-a-queen))\n (add-another-queen)))\n\n (else\n (move-a-queen)))))))\n\n(define (ij->index n i j)\n (let ((i1 (- i 1))\n (j1 (- j 1)))\n (+ i1 (* n j1))))\n\n(define (index->ij n index)\n (let-values (((q r) (floor/ index n)))\n (values (+ r 1) (+ q 1))))\n\n(define (advance-ij n i j)\n (index->ij n (+ (ij->index n i j) 1)))\n\n(define args (command-line))\n(unless (or (= (length args) 3)\n (= (length args) 4))\n (display \"Usage: \")\n (display (list-ref args 0))\n (display \" M N [MAX_SOLUTIONS]\")\n (newline)\n (exit 1))\n(define m (string->number (list-ref args 1)))\n(define n (string->number (list-ref args 2)))\n(define max-solutions\n (if (= (length args) 4)\n (string->number (list-ref args 3))\n +inf.0))\n\n(define generate-peaceful-queens\n (make-peaceful-queens-generator m n))\n\n(let loop ((next-solution-number 1))\n (when (<= next-solution-number max-solutions)\n (let ((solution (generate-peaceful-queens)))\n (when (success? solution)\n (display \"Solution \")\n (display next-solution-number)\n (newline)\n (display (queens->string n solution))\n (newline)\n (newline)\n (loop (+ next-solution-number 1))))))\n","language":"Scheme"},{"code":";;;\n;;; Solutions to the Peaceful Chess Queen Armies puzzle, in R7RS\n;;; Scheme. This implementation returns only one of each equivalent\n;;; solution. See https://oeis.org/A260680\n;;;\n;;; I weed out equivalent solutions by comparing them tediously\n;;; against solutions already found.\n;;;\n;;; (At least when compiled with CHICKEN 5.3.0, this program gets kind\n;;; of slow for m=5, n=6, once you get past having found the 35\n;;; non-equivalent solutions. There are still other, equivalent\n;;; solutions to eliminate.)\n;;;\n;;; https://rosettacode.org/wiki/Peaceful_chess_queen_armies\n;;;\n\n(cond-expand\n (r7rs)\n (chicken (import (r7rs))))\n\n(import (scheme process-context))\n\n(define-record-type <&fail>\n (make-the-one-unique-&fail-that-you-must-not-make-twice)\n do-not-use-this:&fail?)\n\n(define &fail\n (make-the-one-unique-&fail-that-you-must-not-make-twice))\n\n(define (failure? f)\n (eq? f &fail))\n\n(define (success? f)\n (not (failure? f)))\n\n(define *suspend*\n (make-parameter (lambda (x) x)))\n\n(define (suspend v)\n ((*suspend*) v))\n\n(define (fail-forever)\n (let loop ()\n (suspend &fail)\n (loop)))\n\n(define (make-generator-procedure thunk)\n ;;\n ;; Make a suspendable procedure that takes no arguments. It is a\n ;; simple generator of values. (One can elaborate on this to have\n ;; the procedure accept an argument upon resumption, like an Icon\n ;; co-expression.)\n ;;\n (define (next-run return)\n (define (my-suspend v)\n (set! return\n (call/cc\n (lambda (resumption-point)\n (set! next-run resumption-point)\n (return v)))))\n (parameterize ((*suspend* my-suspend))\n (suspend (thunk))\n (fail-forever)))\n (lambda ()\n (call/cc next-run)))\n\n(define (isqrt m)\n ;; Integer Newton’s method. See\n ;; https://en.wikipedia.org/w/index.php?title=Integer_square_root&oldid=1074473475#Using_only_integer_division\n (let ((k (truncate-quotient m 2)))\n (if (zero? k)\n m\n (let loop ((k k)\n (k^ (truncate-quotient\n (+ k (truncate-quotient m k)) 2)))\n (if (< k^ k)\n (loop k^ (truncate-quotient\n (+ k^ (truncate-quotient m k^)) 2))\n k)))))\n\n(define (ij->index n i j)\n (let ((i1 (- i 1))\n (j1 (- j 1)))\n (+ i1 (* n j1))))\n\n(define (index->ij n index)\n (let-values (((q r) (floor/ index n)))\n (values (+ r 1) (+ q 1))))\n\n(define (advance-ij n i j)\n (index->ij n (+ (ij->index n i j) 1)))\n\n(define (index-rotate90 n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n (- n j -1) i)))\n\n(define (index-rotate180 n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n (- n i -1) (- n j -1))))\n\n(define (index-rotate270 n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n j (- n i -1))))\n\n(define (index-reflecti n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n (- n i -1) j)))\n\n(define (index-reflectj n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n i (- n j -1))))\n\n(define (index-reflect-diag-down n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n j i)))\n\n(define (index-reflect-diag-up n index)\n (let-values (((i j) (index->ij n index)))\n (ij->index n (- n j -1) (- n i -1))))\n\n(define BLACK 'B)\n(define WHITE 'W)\n\n(define (reverse-color c)\n (cond ((eq? c WHITE) BLACK)\n ((eq? c BLACK) WHITE)\n (else c)))\n\n(define (pick-color-adjuster c)\n (if (eq? c WHITE)\n reverse-color\n (lambda (x) x)))\n\n(define-record-type <queen>\n (make-queen color rank file)\n queen?\n (color queen-color)\n (rank queen-rank)\n (file queen-file))\n\n(define (queens->board queens)\n (let ((board (make-vector (* n n) #f)))\n (do ((q queens (cdr q)))\n ((null? q))\n (let* ((color (queen-color (car q)))\n (i (queen-rank (car q)))\n (j (queen-file (car q))))\n (vector-set! board (ij->index n i j) color)))\n board))\n\n(define-syntax board-partial-equiv?\n (syntax-rules ()\n ((_ board1 board2 n*n n reindex recolor)\n (let loop ((i 0))\n (or (= i n*n)\n (let ((color1 (vector-ref board1 i))\n (color2 (recolor (vector-ref board2 (reindex n i)))))\n (and (eq? color1 color2)\n (loop (+ i 1)))))))))\n\n(define (board-equiv? board1 board2)\n (define (identity x) x)\n (define (2nd-argument n i) i)\n (let ((n*n (vector-length board1)))\n (or (board-partial-equiv? board1 board2 n*n #f\n 2nd-argument identity)\n (board-partial-equiv? board1 board2 n*n #f\n 2nd-argument reverse-color)\n (let ((n (isqrt n*n)))\n (or (board-partial-equiv? board1 board2 n*n n\n index-rotate90\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-rotate90\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-rotate180\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-rotate180\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-rotate270\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-rotate270\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-reflecti\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-reflecti\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-reflectj\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-reflectj\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-reflect-diag-down\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-reflect-diag-down\n reverse-color)\n (board-partial-equiv? board1 board2 n*n n\n index-reflect-diag-up\n identity)\n (board-partial-equiv? board1 board2 n*n n\n index-reflect-diag-up\n reverse-color) )))))\n\n(define (queens->string n queens)\n\n (define board (queens->board queens))\n\n (define rule\n (let ((str \"+\"))\n (do ((j 1 (+ j 1)))\n ((= j (+ n 1)))\n (set! str (string-append str \"----+\")))\n str))\n\n (define str \"\")\n\n (when (< 0 n)\n (set! str rule)\n (do ((i n (- i 1)))\n ((= i 0))\n (set! str (string-append str \"\\n\"))\n (do ((j 1 (+ j 1)))\n ((= j (+ n 1)))\n (let* ((color (vector-ref board (ij->index n i j)))\n (representation\n (cond ((eq? color #f) \" \")\n ((eq? color BLACK) \" B \")\n ((eq? color WHITE) \" W \")\n (else \" ?? \"))))\n (set! str (string-append str \"|\" representation))))\n (set! str (string-append str \"|\\n\" rule))))\n str)\n\n(define (queen-fits-in? queen other-queens)\n (or (null? other-queens)\n (let ((other (car other-queens)))\n (let ((colorq (queen-color queen))\n (rankq (queen-rank queen))\n (fileq (queen-file queen))\n (coloro (queen-color other))\n (ranko (queen-rank other))\n (fileo (queen-file other)))\n (if (eq? colorq coloro)\n (and (or (not (= rankq ranko))\n (not (= fileq fileo)))\n (queen-fits-in? queen (cdr other-queens)))\n (and (not (= rankq ranko))\n (not (= fileq fileo))\n (not (= (+ rankq fileq) (+ ranko fileo)))\n (not (= (- rankq fileq) (- ranko fileo)))\n (queen-fits-in? queen (cdr other-queens))))))))\n\n(define (latest-queen-fits-in? queens)\n (or (null? (cdr queens))\n (queen-fits-in? (car queens) (cdr queens))))\n\n(define (make-peaceful-queens-generator m n)\n (make-generator-procedure\n (lambda ()\n (define solutions '())\n\n (let loop ((queens (list (make-queen BLACK 1 1)))\n (num-queens 1))\n\n (define (add-another-queen)\n (let ((color (reverse-color (queen-color (car queens)))))\n (loop (cons (make-queen color 1 1) queens)\n (+ num-queens 1))))\n\n (define (move-a-queen)\n (let drop-one ((queens queens)\n (num-queens num-queens))\n (if (zero? num-queens)\n (loop '() 0)\n (let* ((latest (car queens))\n (color (queen-color latest))\n (rank (queen-rank latest))\n (file (queen-file latest)))\n (if (and (= rank n) (= file n))\n (drop-one (cdr queens) (- num-queens 1))\n (let-values (((rank^ file^)\n (advance-ij n rank file)))\n (loop (cons (make-queen color rank^ file^)\n (cdr queens))\n num-queens)))))))\n\n (cond ((zero? num-queens)\n ;; There are no more solutions.\n &fail)\n\n ((latest-queen-fits-in? queens)\n (if (= num-queens (* 2 m))\n (let ((board (queens->board queens)))\n ;; The current \"queens\" is a solution.\n (unless (member board solutions board-equiv?)\n ;; The current \"queens\" is a *new* solution.\n (set! solutions (cons board solutions))\n (suspend queens))\n (move-a-queen))\n (add-another-queen)))\n\n (else\n (move-a-queen)))))))\n\n(define args (command-line))\n(unless (or (= (length args) 3)\n (= (length args) 4))\n (display \"Usage: \")\n (display (list-ref args 0))\n (display \" M N [MAX_SOLUTIONS]\")\n (newline)\n (exit 1))\n(define m (string->number (list-ref args 1)))\n(define n (string->number (list-ref args 2)))\n(define max-solutions\n (if (= (length args) 4)\n (string->number (list-ref args 3))\n +inf.0))\n\n(define generate-peaceful-queens\n (make-peaceful-queens-generator m n))\n\n(let loop ((next-solution-number 1))\n (when (<= next-solution-number max-solutions)\n (let ((solution (generate-peaceful-queens)))\n (when (success? solution)\n (display \"Solution \")\n (display next-solution-number)\n (newline)\n (display (queens->string n solution))\n (newline)\n (newline)\n (loop (+ next-solution-number 1))))))\n","language":"Scheme"},{"code":"enum Piece {\n case empty, black, white\n}\n\ntypealias Position = (Int, Int)\n\nfunc place(_ m: Int, _ n: Int, pBlackQueens: inout [Position], pWhiteQueens: inout [Position]) -> Bool {\n guard m != 0 else {\n return true\n }\n\n var placingBlack = true\n\n for i in 0..<n {\n inner: for j in 0..<n {\n let pos = (i, j)\n\n for queen in pBlackQueens where queen == pos || !placingBlack && isAttacking(queen, pos) {\n continue inner\n }\n\n for queen in pWhiteQueens where queen == pos || placingBlack && isAttacking(queen, pos) {\n continue inner\n }\n\n if placingBlack {\n pBlackQueens.append(pos)\n placingBlack = false\n } else {\n placingBlack = true\n\n pWhiteQueens.append(pos)\n\n if place(m - 1, n, pBlackQueens: &pBlackQueens, pWhiteQueens: &pWhiteQueens) {\n return true\n } else {\n pBlackQueens.removeLast()\n pWhiteQueens.removeLast()\n }\n }\n }\n }\n\n if !placingBlack {\n pBlackQueens.removeLast()\n }\n\n return false\n}\n\nfunc isAttacking(_ queen: Position, _ pos: Position) -> Bool {\n queen.0 == pos.0 || queen.1 == pos.1 || abs(queen.0 - pos.0) == abs(queen.1 - pos.1)\n}\n\nfunc printBoard(n: Int, pBlackQueens: [Position], pWhiteQueens: [Position]) {\n var board = Array(repeating: Piece.empty, count: n * n)\n\n for queen in pBlackQueens {\n board[queen.0 * n + queen.1] = .black\n }\n\n for queen in pWhiteQueens {\n board[queen.0 * n + queen.1] = .white\n }\n\n for (i, p) in board.enumerated() {\n if i != 0 && i % n == 0 {\n print()\n }\n\n switch p {\n case .black:\n print(\"B \", terminator: \"\")\n case .white:\n print(\"W \", terminator: \"\")\n case .empty:\n let j = i / n\n let k = i - j * n\n\n if j % 2 == k % 2 {\n print(\"• \", terminator: \"\")\n } else {\n print(\"◦ \", terminator: \"\")\n }\n }\n }\n\n print(\"\\n\")\n}\n\nlet nms = [\n (2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)\n]\n\nfor (n, m) in nms {\n print(\"\\(m) black and white queens on \\(n) x \\(n) board\")\n\n var blackQueens = [Position]()\n var whiteQueens = [Position]()\n\n if place(m, n, pBlackQueens: &blackQueens, pWhiteQueens: &whiteQueens) {\n printBoard(n: n, pBlackQueens: blackQueens, pWhiteQueens: whiteQueens)\n } else {\n print(\"No solution\")\n }\n}\n","language":"Swift"},{"code":"import \"./dynamic\" for Enum, Tuple\n\nvar Piece = Enum.create(\"Piece\", [\"empty\", \"black\", \"white\"])\n\nvar Pos = Tuple.create(\"Pos\", [\"x\", \"y\"])\n\nvar isAttacking = Fn.new { |q, pos|\n return q.x == pos.x || q.y == pos.y || (q.x - pos.x).abs == (q.y - pos.y).abs\n}\n\nvar place // recursive\nplace = Fn.new { |m, n, blackQueens, whiteQueens|\n if (m == 0) return true\n var placingBlack = true\n for (i in 0...n) {\n for (j in 0...n) {\n var pos = Pos.new(i, j)\n var inner = false\n for (queen in blackQueens) {\n var equalPos = queen.x == pos.x && queen.y == pos.y\n if (equalPos || !placingBlack && isAttacking.call(queen, pos)) {\n inner = true\n break\n }\n }\n if (!inner) {\n for (queen in whiteQueens) {\n var equalPos = queen.x == pos.x && queen.y == pos.y\n if (equalPos || placingBlack && isAttacking.call(queen, pos)) {\n inner = true\n break\n }\n }\n if (!inner) {\n if (placingBlack) {\n blackQueens.add(pos)\n placingBlack = false\n } else {\n whiteQueens.add(pos)\n if (place.call(m-1, n, blackQueens, whiteQueens)) return true\n blackQueens.removeAt(-1)\n whiteQueens.removeAt(-1)\n placingBlack = true\n }\n }\n }\n }\n }\n if (!placingBlack) blackQueens.removeAt(-1)\n return false\n}\n\nvar printBoard = Fn.new { |n, blackQueens, whiteQueens|\n var board = List.filled(n * n, 0)\n for (queen in blackQueens) board[queen.x * n + queen.y] = Piece.black\n for (queen in whiteQueens) board[queen.x * n + queen.y] = Piece.white\n var i = 0\n for (b in board) {\n if (i != 0 && i%n == 0) System.print()\n if (b == Piece.black) {\n System.write(\"B \")\n } else if (b == Piece.white) {\n System.write(\"W \")\n } else {\n var j = (i/n).floor\n var k = i - j*n\n if (j%2 == k%2) {\n System.write(\"• \")\n } else {\n System.write(\"◦ \")\n }\n }\n i = i + 1\n }\n System.print(\"\\n\")\n}\n\nvar nms = [\n Pos.new(2, 1), Pos.new(3, 1), Pos.new(3, 2), Pos.new(4, 1), Pos.new(4, 2), Pos.new(4, 3),\n Pos.new(5, 1), Pos.new(5, 2), Pos.new(5, 3), Pos.new(5, 4), Pos.new(5, 5),\n Pos.new(6, 1), Pos.new(6, 2), Pos.new(6, 3), Pos.new(6, 4), Pos.new(6, 5), Pos.new(6, 6),\n Pos.new(7, 1), Pos.new(7, 2), Pos.new(7, 3), Pos.new(7, 4), Pos.new(7, 5), Pos.new(7, 6), Pos.new(7, 7)\n]\nfor (p in nms) {\n System.print(\"%(p.y) black and %(p.y) white queens on a %(p.x) x %(p.x) board:\")\n var blackQueens = []\n var whiteQueens = []\n if (place.call(p.y, p.x, blackQueens, whiteQueens)) {\n printBoard.call(p.x, blackQueens, whiteQueens)\n } else {\n System.print(\"No solution exists.\\n\")\n }\n}\n","language":"Wren"},{"code":"fcn isAttacked(q, x,y) // ( (r,c), x,y ) : is queen at r,c attacked by q@(x,y)?\n { r,c:=q; (r==x or c==y or r+c==x+y or r-c==x-y) }\nfcn isSafe(r,c,qs) // queen safe at (r,c)?, qs=( (r,c),(r,c)..)\n { ( not qs.filter1(isAttacked,r,c) ) }\nfcn isEmpty(r,c,qs){ (not (qs and qs.filter1('wrap([(x,y)]){ r==x and c==y })) ) }\nfcn _peacefulQueens(N,M,qa,qb){ //--> False | (True,((r,c)..),((r,c)..) )\n // qa,qb --> // ( (r,c),(r,c).. ), solution so far to last good spot\n if(qa.len()==M==qb.len()) return(True,qa,qb);\n n, x,y := N, 0,0;\n if(qa) x,y = qa[-1]; else n=(N+1)/2; // first queen, first quadrant only\n foreach r in ([x..n-1]){\n foreach c in ([y..n-1]){\n\t if(isEmpty(r,c,qa) and isSafe(r,c,qb)){\n\t qc,qd := qa.append(T(r,c)), self.fcn(N,M, qb,qc);\n\t if(qd) return( if(qd[0]==True) qd else T(qc,qd) );\n\t }\n }\n y=0\n }\n False\n}\n\nfcn peacefulQueens(N=5,M=4){ # NxN board, M white and black queens\n qs:=_peacefulQueens(N,M, T,T);\n println(\"Solution for %dx%d board with %d black and %d white queens:\".fmt(N,N,M,M));\n if(not qs)println(\"None\");\n else{\n z:=Data(Void,\"-\"*N*N);\n foreach r,c in (qs[1]){ z[r*N + c]=\"W\" }\n foreach r,c in (qs[2]){ z[r*N + c]=\"B\" }\n z.text.pump(Void,T(Void.Read,N-1),\"println\");\n }\n}\n","language":"Zkl"},{"code":"peacefulQueens();\nforeach n in ([4..10]){ peacefulQueens(n,n) }\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Peaceful_chess_queen_armies\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces ''not'' of its own colour.\\n<br>\\n<table style=\\\"font-weight:bold\\\">\\n <tr align=\\\"center\\\" valign=\\\"middle\\\">\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇖</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\">⇑</td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇗</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n</tr>\\n <tr align=\\\"center\\\" valign=\\\"middle\\\">\\n <td style=\\\"width:16pt; height:16pt;\\\">⇐</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\">⇐</td>\\n <td style=\\\"width:16pt; height:16pt;\\\"><font color=\\\"lime\\\">♛</font></td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\">⇒</td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇒</td>\\n</tr>\\n <tr align=\\\"center\\\" valign=\\\"middle\\\">\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇙</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\">⇓</td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇘</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n</tr>\\n <tr align=\\\"center\\\" valign=\\\"middle\\\">\\n <td style=\\\"width:16pt; height:16pt;\\\">⇙</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇓</td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\">⇘</td>\\n</tr>\\n <tr align=\\\"center\\\" valign=\\\"middle\\\">\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\">⇓</td>\\n <td style=\\\"width:16pt; height:16pt;\\\"></td>\\n <td style=\\\"width:16pt; height:16pt;\\\" bgcolor=\\\"silver\\\"></td>\\n</tr>\\n</table>\\n<br>\\n\\nThe goal of Peaceful chess queen armies is to arrange <code>m</code> black queens and <code>m</code> white queens on an <code>n-by-n</code> square grid, (the board), so that ''no queen attacks another of a different colour''.\\n\\n\\n;Task:\\n# Create a routine to represent two-colour queens on a 2-D board. (Alternating black/white background colours, Unicode chess pieces and other embellishments are not necessary, but may be used at your discretion).\\n# Create a routine to generate at least one solution to placing <code>m</code> equal numbers of black and white queens on an <code>n</code> square board.\\n# Display here results for the <code>m=4, n=5</code> case.\\n\\n\\n;References:\\n* [http://www.mathopt.org/Optima-Issues/optima62.pdf Peaceably Coexisting Armies of Queens] (Pdf) by Robert A. Bosch. Optima, the Mathematical Programming Socity newsletter, issue 62.\\n* [https://oeis.org/A250000 A250000] OEIS\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"T.enum Piece\\n EMPTY\\n BLACK\\n WHITE\\n\\nF isAttacking(queen, pos)\\n R queen.x == pos.x\\n | queen.y == pos.y\\n | abs(queen.x - pos.x) == abs(queen.y - pos.y)\\n\\nF place(m, n, &pBlackQueens, &pWhiteQueens)\\n I m == 0\\n R 1B\\n\\n V placingBlack = 1B\\n L(i) 0 .< n\\n L(j) 0 .< n\\n V pos = (i, j)\\n L(queen) pBlackQueens\\n I queen == pos | (!placingBlack & isAttacking(queen, pos))\\n L.break\\n L.was_no_break\\n L(queen) pWhiteQueens\\n I queen == pos | (placingBlack & isAttacking(queen, pos))\\n L.break\\n L.was_no_break\\n I placingBlack\\n pBlackQueens [+]= pos\\n placingBlack = 0B\\n E\\n pWhiteQueens [+]= pos\\n I place(m - 1, n, &pBlackQueens, &pWhiteQueens)\\n R 1B\\n pBlackQueens.pop()\\n pWhiteQueens.pop()\\n placingBlack = 1B\\n\\n I !placingBlack\\n pBlackQueens.pop()\\n R 0B\\n\\nF printBoard(n, blackQueens, whiteQueens)\\n V board = [Piece.EMPTY] * (n * n)\\n\\n L(queen) blackQueens\\n board[queen.x * n + queen.y] = Piece.BLACK\\n\\n L(queen) whiteQueens\\n board[queen.x * n + queen.y] = Piece.WHITE\\n\\n L(b) board\\n V i = L.index\\n I i != 0 & i % n == 0\\n print()\\n I b == BLACK\\n print(‘B ’, end' ‘’)\\n E I b == WHITE\\n print(‘W ’, end' ‘’)\\n E\\n V j = i I/ n\\n V k = i - j * n\\n I j % 2 == k % 2\\n print(‘x ’, end' ‘’)\\n E\\n print(‘o ’, end' ‘’)\\n print(\\\"\\\\n\\\")\\n\\nV nms = [\\n (2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)\\n ]\\n\\nL(nm) nms\\n print(‘#. black and #. white queens on a #. x #. board:’.format(nm[1], nm[1], nm[0], nm[0]))\\n [(Int, Int)] blackQueens, whiteQueens\\n I place(nm[1], nm[0], &blackQueens, &whiteQueens)\\n printBoard(nm[0], blackQueens, whiteQueens)\\n E\\n print(\\\"No solution exists.\\\\n\\\")\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"(********************************************************************)\\n\\n#define ATS_DYNLOADFLAG 0\\n\\n#include \\\"share/atspre_define.hats\\\"\\n#include \\\"share/atspre_staload.hats\\\"\\n\\nstaload UN = \\\"prelude/SATS/unsafe.sats\\\"\\n\\n#define NIL list_vt_nil ()\\n#define :: list_vt_cons\\n\\n#ifndef NDEBUG #then\\n (* Safety is relatively unimportant in this program.\\n Therefore I have made it so you can put ‘-DATS NDEBUG=1’ on\\n your patscc command line, to skip some assertloc tests. *)\\n #define NDEBUG 0\\n#endif\\n\\n(********************************************************************)\\n\\n#define EMPTY 0\\n#define BLACK 1\\n#define WHITE ~1\\n\\nstadef is_color (c : int) : bool = (~1 <= c && c <= 1)\\nstadef reverse_color (c : int) : int = ~c\\n\\ntypedef color_t (tk : tkind, c : int) =\\n [is_color c]\\n g1int (tk, c)\\ntypedef color_t (tk : tkind) =\\n [c : int | is_color c]\\n g1int (tk, c)\\n\\nfn {tk : tkind}\\nreverse_color {c : int | is_color c}\\n (c : g1int (tk, c)) :<>\\n [c_rev : int | is_color c_rev;\\n c_rev == reverse_color c]\\n g1int (tk, c_rev) =\\n (* This template is a fancy way to say ‘minus’. *)\\n ~c\\n\\n(********************************************************************)\\n\\n(* Matrix indices will run from 0..n-1 rather than 1..n. *)\\n\\n#define SIDE_MAX 16 (* The maximum side size. For\\n efficiency, please make it a\\n power of two. *)\\n#define BOARD_SIZE 256 (* The storage size for a board. *)\\n\\nprval _ = prop_verify {SIDE_MAX * SIDE_MAX == BOARD_SIZE} ()\\n\\nfn {tk : tkind}\\nrow_index {k : int | 0 <= k; k < BOARD_SIZE}\\n (k : g1int (tk, k)) :<>\\n [i : int | 0 <= i; i < SIDE_MAX]\\n g1int (tk, i) =\\n (* Let the C compiler convert this to bitmasking. *)\\n g1int_nmod (k, g1i2i SIDE_MAX)\\n\\nfn {tk : tkind}\\ncolumn_index {k : int | 0 <= k; k < BOARD_SIZE}\\n (k : g1int (tk, k)) :<>\\n [i : int | 0 <= i; i < SIDE_MAX]\\n g1int (tk, i) =\\n (* Let the C compiler convert this to a shift. *)\\n k / g1i2i SIDE_MAX\\n\\nfn {tk : tkind}\\nstorage_index {i, j : int | 0 <= i; i < SIDE_MAX;\\n 0 <= j; j < SIDE_MAX}\\n (i : g1int (tk, i),\\n j : g1int (tk, j)) :<>\\n [k : int | 0 <= k; k < BOARD_SIZE]\\n g1int (tk, k) =\\n (* Let the C compiler convert this to a shift and add. *)\\n i + (j * g1i2i SIDE_MAX)\\n\\n(********************************************************************)\\n\\nextern fn {tk_index : tkind}\\ntest_equiv$reindex_i\\n {i, j : int | 0 <= i; 0 <= j}\\n {n : int | 0 <= n; n <= SIDE_MAX;\\n i < n; j < n}\\n (i : g1int (tk_index, i),\\n j : g1int (tk_index, j),\\n n : g1int (tk_index, n)) :<>\\n [i1 : int | 0 <= i1; i1 < SIDE_MAX]\\n g1int (tk_index, i1)\\n\\nextern fn {tk_index : tkind}\\ntest_equiv$reindex_j\\n {i, j : int | 0 <= i; 0 <= j}\\n {n : int | 0 <= n; n <= SIDE_MAX;\\n i < n; j < n}\\n (i : g1int (tk_index, i),\\n j : g1int (tk_index, j),\\n n : g1int (tk_index, n)) :<>\\n [j1 : int | 0 <= j1; j1 < SIDE_MAX]\\n g1int (tk_index, j1)\\n\\nextern fn {tk_color : tkind}\\ntest_equiv$recolor\\n {c : int | is_color c}\\n (c : g1int (tk_color, c)) :<>\\n [c1 : int | is_color c1]\\n g1int (tk_color, c1)\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n macdef reindex_i = test_equiv$reindex_i<tk_index>\\n macdef reindex_j = test_equiv$reindex_j<tk_index>\\n macdef recolor = test_equiv$recolor<tk_color>\\n\\n fun\\n loopj {j : int | ~1 <= j; j < n} .<j + 1>.\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n),\\n j : g1int (tk_index, j)) :\\n bool =\\n if j < g1i2i 0 then\\n true\\n else\\n let\\n fun loopi {i : int | ~1 <= i; i < n} .<i + 1>.\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n),\\n j : g1int (tk_index, j),\\n i : g1int (tk_index, i)) :\\n bool =\\n if i < g1i2i 0 then\\n true\\n else\\n let\\n val ka = storage_index<tk_index> (i, j)\\n val color_a = a[ka]\\n\\n val i1 = test_equiv$reindex_i<tk_index> (i, j, n)\\n val j1 = test_equiv$reindex_j<tk_index> (i, j, n)\\n val kb = storage_index<tk_index> (i1, j1)\\n val color_b = recolor b[kb]\\n in\\n if color_a = color_b then\\n loopi (a, b, n, j, pred i)\\n else\\n false\\n end\\n in\\n if loopi (a, b, n, j, g1i2i (pred n)) then\\n loopj (a, b, n, pred j)\\n else\\n false\\n end\\n in\\n loopj (a, b, n, g1i2i (pred n))\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_rotate0\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* No rotations or reflections. *)\\n implement\\n test_equiv$reindex_i<tk_index> (i, j, n) = i\\n implement\\n test_equiv$reindex_j<tk_index> (i, j, n) = j\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_rotate90\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Matrix rotation counterclockwise by 90 degrees. *)\\n implement\\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - j\\n implement\\n test_equiv$reindex_j<tk_index> (i, j, n) = i\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_rotate180\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Matrix rotation by 180 degrees. *)\\n implement\\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - i\\n implement\\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - j\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_rotate270\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Matrix rotation counterclockwise by 270 degrees. *)\\n implement\\n test_equiv$reindex_i<tk_index> (i, j, n) = j\\n implement\\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - i\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_reflecti\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Reverse the order of the rows. *)\\n implement\\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - i\\n implement\\n test_equiv$reindex_j<tk_index> (i, j, n) = j\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_reflectj\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Reverse the order of the columns. *)\\n implement\\n test_equiv$reindex_i<tk_index> (i, j, n) = i\\n implement\\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - j\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_reflect_diag_down\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Transpose the matrix around its main diagonal. *)\\n implement\\n test_equiv$reindex_i<tk_index> (i, j, n) = j\\n implement\\n test_equiv$reindex_j<tk_index> (i, j, n) = i\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\ntest_equiv_reflect_diag_up\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n bool =\\n let\\n (* Transpose the matrix around its main skew diagonal. *)\\n implement\\n test_equiv$reindex_i<tk_index> {i, j} {n} (i, j, n) = pred n - j\\n implement\\n test_equiv$reindex_j<tk_index> {i, j} {n} (i, j, n) = pred n - i\\n in\\n test_equiv<tk_index, tk_color> (a, b, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\nboard_equiv {n : int | 0 <= n; n <= SIDE_MAX}\\n (a : &(@[color_t tk_color][BOARD_SIZE]),\\n b : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n),\\n rotation_equiv_classes : bool) :\\n bool =\\n let\\n (* Leave the colors unchanged. *)\\n implement test_equiv$recolor<tk_color> (c) = c\\n\\n (* Test without rotations or reflections. *)\\n val equiv = test_equiv_rotate0<tk_index, tk_color> (a, b, n)\\n in\\n if ~rotation_equiv_classes then\\n equiv\\n else\\n let\\n (* Leave the colors unchanged. *)\\n implement test_equiv$recolor<tk_color> (c) = c\\n\\n val equiv =\\n (equiv ||\\n test_equiv_rotate90<tk_index, tk_color> (a, b, n) ||\\n test_equiv_rotate180<tk_index, tk_color> (a, b, n) ||\\n test_equiv_rotate270<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflecti<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflectj<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflect_diag_down<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflect_diag_up<tk_index, tk_color> (a, b, n))\\n\\n (* Reverse the colors of b in each test. *)\\n implement test_equiv$recolor<tk_color> (c) = reverse_color c\\n\\n val equiv =\\n (equiv ||\\n test_equiv_rotate0<tk_index, tk_color> (a, b, n) ||\\n test_equiv_rotate90<tk_index, tk_color> (a, b, n) ||\\n test_equiv_rotate180<tk_index, tk_color> (a, b, n) ||\\n test_equiv_rotate270<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflecti<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflectj<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflect_diag_down<tk_index, tk_color> (a, b, n) ||\\n test_equiv_reflect_diag_up<tk_index, tk_color> (a, b, n))\\n in\\n equiv\\n end\\n end\\n\\n(********************************************************************)\\n\\nfn {tk_index : tkind}\\nfprint_rule {n : int | 0 <= n; n <= SIDE_MAX}\\n (f : FILEref,\\n n : g1int (tk_index, n)) :\\n void =\\n let\\n fun\\n loop {j : int | 0 <= j; j <= n} .<n - j>.\\n (j : g1int (tk_index, j)) :\\n void =\\n if j <> n then\\n begin\\n fileref_puts (f, \\\"----+\\\");\\n loop (succ j)\\n end\\n in\\n fileref_puts (f, \\\"+\\\");\\n loop (g1i2i 0)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\nfprint_board {n : int | 0 <= n; n <= SIDE_MAX}\\n (f : FILEref,\\n a : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n)) :\\n void =\\n if n <> 0 then\\n let\\n fun\\n loopi {i : int | ~1 <= i; i < n} .<i + 1>.\\n (f : FILEref,\\n a : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n),\\n i : g1int (tk_index, i)) :\\n void =\\n if i <> ~1 then\\n let\\n fun\\n loopj {j : int | 0 <= j; j <= n} .<n - j>.\\n (f : FILEref,\\n a : &(@[color_t tk_color][BOARD_SIZE]),\\n n : g1int (tk_index, n),\\n i : g1int (tk_index, i),\\n j : g1int (tk_index, j)) :\\n void =\\n if j <> n then\\n let\\n val k = storage_index<tk_index> (i, j)\\n val color = a[k]\\n val representation =\\n if color = g1i2i BLACK then\\n \\\"| B \\\"\\n else if color = g1i2i WHITE then\\n \\\"| W \\\"\\n else\\n \\\"| \\\"\\n in\\n fileref_puts (f, representation);\\n loopj (f, a, n, i, succ j)\\n end\\n in\\n fileref_puts (f, \\\"\\\\n\\\");\\n loopj (f, a, n, i, g1i2i 0);\\n fileref_puts (f, \\\"|\\\\n\\\");\\n fprint_rule (f, n);\\n loopi (f, a, n, pred i)\\n end\\n in\\n fprint_rule (f, n);\\n loopi (f, a, n, pred n)\\n end\\n\\n(********************************************************************)\\n\\n(* M2_MAX equals the maximum number of queens of either color.\\n Thus it is the maximum of 2*m, where m is the number of queens\\n in an army. *)\\n#define M2_MAX BOARD_SIZE\\n\\n(* The even-index queens are BLACK, the odd-index queens are WHITE. *)\\n\\nvtypedef board_record_vt (tk_color : tkind,\\n p : addr) =\\n @{\\n pf = @[color_t tk_color][BOARD_SIZE] @ p,\\n pfgc = mfree_gc_v p |\\n p = ptr p\\n }\\nvtypedef board_record_vt (tk_color : tkind) =\\n [p : addr | null < p]\\n board_record_vt (tk_color, p)\\n\\nvtypedef board_record_list_vt (tk_color : tkind,\\n n : int) =\\n list_vt (board_record_vt tk_color, n)\\nvtypedef board_record_list_vt (tk_color : tkind) =\\n [n : int]\\n board_record_list_vt (tk_color, n)\\n\\nfn\\nboard_record_vt_free\\n {tk_color : tkind}\\n {p : addr}\\n (record : board_record_vt (tk_color, p)) :\\n void =\\n let\\n val @{\\n pf = pf,\\n pfgc = pfgc |\\n p = p\\n } = record\\n in\\n array_ptr_free (pf, pfgc | p)\\n end\\n\\noverload free with board_record_vt_free\\n\\nfn\\nboard_record_list_vt_free\\n {tk_color : tkind}\\n {n : int}\\n (lst : board_record_list_vt (tk_color, n)) :\\n void =\\n let\\n fun\\n loop {n : int | 0 <= n} .<n>.\\n (lst : board_record_list_vt (tk_color, n)) :\\n void =\\n case+ lst of\\n | ~ NIL => ()\\n | ~ head :: tail =>\\n begin\\n free head;\\n loop tail\\n end\\n\\n prval _ = lemma_list_vt_param lst\\n in\\n loop lst\\n end\\n\\nfn {tk_index, tk_color : tkind}\\nany_board_equiv {n : int | 0 <= n; n <= SIDE_MAX}\\n (board : &(@[color_t tk_color][BOARD_SIZE]),\\n lst : !board_record_list_vt tk_color,\\n n : g1int (tk_index, n),\\n rotation_equiv_classes : bool) :\\n bool =\\n let\\n macdef board_equiv = board_equiv<tk_index, tk_color>\\n\\n fun\\n loop {k : int | 0 <= k} .<k>.\\n (board : &(@[color_t tk_color][BOARD_SIZE]),\\n lst : !board_record_list_vt (tk_color, k),\\n n : g1int (tk_index, n)) :\\n bool =\\n case+ lst of\\n | NIL => false\\n | head :: tail =>\\n if board_equiv (!(head.p), board, n,\\n rotation_equiv_classes) then\\n true\\n else\\n loop (board, tail, n)\\n\\n prval _ = lemma_list_vt_param lst\\n in\\n loop (board, lst, n)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\nqueens_to_board\\n {count : int | 0 <= count; count <= M2_MAX}\\n (queens : &(@[g1int tk_index][M2_MAX]),\\n count : int count) :\\n [p : addr | null < p]\\n board_record_vt (tk_color, p) =\\n let\\n typedef color_t = color_t tk_color\\n\\n fun\\n loop {k : int | ~1 <= k; k < count} .<k + 1>.\\n (queens : &(@[g1int tk_index][M2_MAX]),\\n board : &(@[color_t tk_color][BOARD_SIZE]),\\n k : int k) :\\n void =\\n if 0 <= k then\\n let\\n val [coords : int] coords = queens[k]\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {0 <= coords} ()\\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\\n #else\\n val _ = assertloc (g1i2i 0 <= coords)\\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\\n #endif\\n in\\n if g1int_nmod (k, 2) = 0 then\\n board[coords] := g1i2i BLACK\\n else\\n board[coords] := g1i2i WHITE;\\n loop (queens, board, pred k)\\n end\\n\\n val @(pf, pfgc | p) = array_ptr_alloc<color_t> (i2sz BOARD_SIZE)\\n val _ = array_initize_elt<color_t> (!p, i2sz BOARD_SIZE,\\n g1i2i EMPTY)\\n val _ = loop (queens, !p, pred count)\\n in\\n @{\\n pf = pf,\\n pfgc = pfgc |\\n p = p\\n }\\n end\\n\\nfn {tk : tkind}\\nqueen_would_fit_in\\n {count : int | 0 <= count; count <= M2_MAX}\\n {i, j : int | 0 <= i; i < SIDE_MAX;\\n 0 <= j; j < SIDE_MAX}\\n (queens : &(@[g1int tk][M2_MAX]),\\n count : int count,\\n i : g1int (tk, i),\\n j : g1int (tk, j)) :\\n bool =\\n (* Would a new queen at (i,j) be feasible? *)\\n if count = 0 then\\n true\\n else\\n let\\n fun\\n loop {k : int | ~1 <= k; k < count}\\n (queens : &(@[g1int tk][M2_MAX]),\\n k : int k) :\\n bool =\\n if k < 0 then\\n true\\n else\\n let\\n val [coords : int] coords = queens[k]\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {0 <= coords} ()\\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\\n #else\\n val _ = assertloc (g1i2i 0 <= coords)\\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\\n #endif\\n\\n val i1 = row_index<tk> coords\\n val j1 = column_index<tk> coords\\n in\\n if g1int_nmod (k, 2) = g1int_nmod (count, 2) then\\n (* The two queens are of the same color. They may not\\n share the same square. *)\\n begin\\n if i <> i1 || j <> j1 then\\n loop (queens, pred k)\\n else\\n false\\n end\\n else\\n (* The two queens are of different colors. They may not\\n share the same square nor attack each other. *)\\n begin\\n if (i <> i1 &&\\n j <> j1 &&\\n i + j <> i1 + j1 &&\\n i - j <> i1 - j1) then\\n loop (queens, pred k)\\n else\\n false\\n end\\n end\\n in\\n loop (queens, pred count)\\n end\\n\\nfn {tk : tkind}\\nlatest_queen_fits_in\\n {count : int | 1 <= count; count <= M2_MAX}\\n (queens : &(@[g1int tk][M2_MAX]),\\n count : int count) :\\n bool =\\n let\\n val [coords : int] coords = queens[pred count]\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {0 <= coords} ()\\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\\n #else\\n val _ = assertloc (g1i2i 0 <= coords)\\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\\n #endif\\n\\n val i = row_index<tk> coords\\n val j = column_index<tk> coords\\n in\\n queen_would_fit_in<tk> (queens, pred count, i, j)\\n end\\n\\nfn {tk_index, tk_color : tkind}\\nfind_solutions\\n {m : int | 0 <= m; 2 * m <= M2_MAX}\\n {n : int | 0 <= n; n <= SIDE_MAX}\\n {max_solutions : int | 0 <= max_solutions}\\n (f : FILEref,\\n m : int m,\\n n : g1int (tk_index, n),\\n rotation_equiv_classes : bool,\\n max_solutions : int max_solutions) :\\n [num_solutions : int | 0 <= num_solutions;\\n num_solutions <= max_solutions]\\n @(int num_solutions,\\n board_record_list_vt (tk_color, num_solutions)) =\\n (* This template function both prints the solutions and returns\\n them as a linked list. *)\\n if m = 0 then\\n @(0, NIL)\\n else if max_solutions = 0 then\\n @(0, NIL)\\n else\\n let\\n macdef latest_queen_fits_in = latest_queen_fits_in<tk_index>\\n macdef queens_to_board = queens_to_board<tk_index, tk_color>\\n macdef fprint_board = fprint_board<tk_index, tk_color>\\n macdef any_board_equiv = any_board_equiv<tk_index, tk_color>\\n macdef row_index = row_index<tk_index>\\n macdef column_index = column_index<tk_index>\\n macdef storage_index = storage_index<tk_index>\\n\\n fnx\\n loop {num_solutions : int | 0 <= num_solutions;\\n num_solutions <= max_solutions}\\n {num_queens : int | 0 <= num_queens;\\n num_queens <= 2 * m}\\n (solutions : board_record_list_vt (tk_color,\\n num_solutions),\\n num_solutions : int num_solutions,\\n queens : &(@[g1int tk_index][M2_MAX]),\\n num_queens : int num_queens) :\\n [num_solutions1 : int | 0 <= num_solutions1;\\n num_solutions1 <= max_solutions]\\n @(int num_solutions1,\\n board_record_list_vt (tk_color, num_solutions1)) =\\n if num_queens = 0 then\\n @(num_solutions, solutions)\\n else if num_solutions = max_solutions then\\n @(num_solutions, solutions)\\n else if latest_queen_fits_in (queens, num_queens) then\\n begin\\n if num_queens = 2 * m then\\n let\\n val board = queens_to_board (queens, num_queens)\\n val equiv_solution =\\n any_board_equiv (!(board.p), solutions, n,\\n rotation_equiv_classes)\\n in\\n if ~equiv_solution then\\n begin\\n fprintln! (f, \\\"Solution \\\",\\n succ num_solutions);\\n fprint_board (f, !(board.p), n);\\n fileref_puts (f, \\\"\\\\n\\\\n\\\");\\n move_a_queen (board :: solutions,\\n succ num_solutions,\\n queens, num_queens)\\n end\\n else\\n begin\\n free board;\\n move_a_queen (solutions, num_solutions,\\n queens, num_queens)\\n end\\n end\\n else\\n add_another_queen (solutions, num_solutions,\\n queens, num_queens)\\n end\\n else\\n move_a_queen (solutions, num_solutions,\\n queens, num_queens)\\n and\\n add_another_queen\\n {num_solutions : int |\\n 0 <= num_solutions;\\n num_solutions <= max_solutions}\\n {num_queens : int | 0 <= num_queens;\\n num_queens + 1 <= 2 * m}\\n (solutions : board_record_list_vt\\n (tk_color, num_solutions),\\n num_solutions : int num_solutions,\\n queens : &(@[g1int tk_index][M2_MAX]),\\n num_queens : int num_queens) :\\n [num_solutions1 : int | 0 <= num_solutions1;\\n num_solutions1 <= max_solutions]\\n @(int num_solutions1,\\n board_record_list_vt (tk_color, num_solutions1)) =\\n let\\n val coords = storage_index (g1i2i 0, g1i2i 0)\\n in\\n queens[num_queens] := coords;\\n loop (solutions, num_solutions, queens, succ num_queens)\\n end\\n and\\n move_a_queen {num_solutions : int |\\n 0 <= num_solutions;\\n num_solutions <= max_solutions}\\n {num_queens : int | 0 <= num_queens;\\n num_queens <= 2 * m}\\n (solutions : board_record_list_vt\\n (tk_color, num_solutions),\\n num_solutions : int num_solutions,\\n queens : &(@[g1int tk_index][M2_MAX]),\\n num_queens : int num_queens) :\\n [num_solutions1 : int | 0 <= num_solutions1;\\n num_solutions1 <= max_solutions]\\n @(int num_solutions1,\\n board_record_list_vt (tk_color, num_solutions1)) =\\n if num_queens = 0 then\\n loop (solutions, num_solutions, queens, num_queens)\\n else\\n let\\n val [coords : int] coords = queens[pred num_queens]\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {0 <= coords} ()\\n prval _ = $UN.prop_assert {coords < BOARD_SIZE} ()\\n #else\\n val _ = assertloc (g1i2i 0 <= coords)\\n val _ = assertloc (coords < g1i2i BOARD_SIZE)\\n #endif\\n\\n val [i : int] i = row_index coords\\n val [j : int] j = column_index coords\\n\\n prval _ = prop_verify {0 <= i} ()\\n prval _ = prop_verify {i < SIDE_MAX} ()\\n\\n prval _ = prop_verify {0 <= j} ()\\n prval _ = prop_verify {j < SIDE_MAX} ()\\n\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {i < n} ()\\n prval _ = $UN.prop_assert {j < n} ()\\n #else\\n val _ = $effmask_exn assertloc (i < n)\\n val _ = $effmask_exn assertloc (j < n)\\n #endif\\n in\\n if j = pred n then\\n begin\\n if i = pred n then\\n (* Backtrack. *)\\n move_a_queen (solutions, num_solutions,\\n queens, pred num_queens)\\n else\\n let\\n val coords = storage_index (succ i, j)\\n in\\n queens[pred num_queens] := coords;\\n loop (solutions, num_solutions,\\n queens, num_queens)\\n end\\n end\\n else\\n let\\n #if NDEBUG <> 0 #then\\n prval _ = $UN.prop_assert {j < n - 1} ()\\n #else\\n val _ = $effmask_exn assertloc (j < pred n)\\n #endif\\n in\\n if i = pred n then\\n let\\n val coords = storage_index (g1i2i 0, succ j)\\n in\\n queens[pred num_queens] := coords;\\n loop (solutions, num_solutions,\\n queens, num_queens)\\n end\\n else\\n let\\n val coords = storage_index (succ i, j)\\n in\\n queens[pred num_queens] := coords;\\n loop (solutions, num_solutions,\\n queens, num_queens)\\n end\\n end\\n end\\n\\n var queens = @[g1int tk_index][M2_MAX] (g1i2i 0)\\n in\\n queens[0] := storage_index (g1i2i 0, g1i2i 0);\\n loop (NIL, 0, queens, 1)\\n end\\n\\n(********************************************************************)\\n\\n%{^\\n#include <stdlib.h>\\n#include <limits.h>\\n%}\\n\\nimplement\\nmain0 (argc, argv) =\\n let\\n stadef tk_index = int_kind\\n stadef tk_color = int_kind\\n\\n macdef usage_error (status) =\\n begin\\n println! (\\\"Usage: \\\", argv[0],\\n \\\" M N IGNORE_EQUIVALENTS [MAX_SOLUTIONS]\\\");\\n exit (,(status))\\n end\\n\\n val max_max_solutions =\\n $extval ([i : int | 0 <= i] int i, \\\"INT_MAX\\\")\\n in\\n if 4 <= argc then\\n let\\n val m = $extfcall (int, \\\"atoi\\\", argv[1])\\n val m = g1ofg0 m\\n val _ = if m < 0 then usage_error (2)\\n val _ = assertloc (0 <= m)\\n val _ =\\n if M2_MAX < 2 * m then\\n begin\\n println! (argv[0], \\\": M cannot be larger than \\\",\\n M2_MAX / 2);\\n usage_error (2)\\n end\\n val _ = assertloc (2 * m <= M2_MAX)\\n\\n val n = $extfcall (int, \\\"atoi\\\", argv[2])\\n val n = g1ofg0 n\\n val _ = if n < 0 then usage_error (2)\\n val _ = assertloc (0 <= n)\\n val _ =\\n if SIDE_MAX < n then\\n begin\\n println! (argv[0], \\\": N cannot be larger than \\\",\\n SIDE_MAX);\\n usage_error (2)\\n end\\n val _ = assertloc (n <= SIDE_MAX)\\n\\n val ignore_equivalents =\\n if argv[3] = \\\"T\\\" || argv[3] = \\\"t\\\" || argv[3] = \\\"1\\\" then\\n true\\n else if argv[3] = \\\"F\\\" || argv[3] = \\\"f\\\" || argv[3] = \\\"0\\\" then\\n false\\n else\\n begin\\n println! (argv[0],\\n \\\": select T=t=1 or F=f=0 \\\",\\n \\\"for IGNORE_EQUIVALENTS\\\");\\n usage_error (2);\\n false\\n end\\n in\\n if argc = 5 then\\n let\\n val max_solutions = $extfcall (int, \\\"atoi\\\", argv[4])\\n val max_solutions = g1ofg0 max_solutions\\n val max_solutions = max (0, max_solutions)\\n\\n val @(num_solutions, solutions) =\\n find_solutions<tk_index, tk_color>\\n (stdout_ref, m, n, ignore_equivalents,\\n max_solutions)\\n in\\n board_record_list_vt_free solutions\\n end\\n else\\n let\\n val @(num_solutions, solutions) =\\n find_solutions<tk_index, tk_color>\\n (stdout_ref, m, n, ignore_equivalents,\\n max_max_solutions)\\n in\\n board_record_list_vt_free solutions\\n end\\n end\\n else\\n usage_error (1)\\n end\\n\\n(********************************************************************)\\n\",\n \"language\": \"ATS\"\n },\n {\n \"code\": \"#include <math.h>\\n#include <stdbool.h>\\n#include <stdio.h>\\n#include <stdlib.h>\\n\\nenum Piece {\\n Empty,\\n Black,\\n White,\\n};\\n\\ntypedef struct Position_t {\\n int x, y;\\n} Position;\\n\\n///////////////////////////////////////////////\\n\\nstruct Node_t {\\n Position pos;\\n struct Node_t *next;\\n};\\n\\nvoid releaseNode(struct Node_t *head) {\\n if (head == NULL) return;\\n\\n releaseNode(head->next);\\n head->next = NULL;\\n\\n free(head);\\n}\\n\\ntypedef struct List_t {\\n struct Node_t *head;\\n struct Node_t *tail;\\n size_t length;\\n} List;\\n\\nList makeList() {\\n return (List) { NULL, NULL, 0 };\\n}\\n\\nvoid releaseList(List *lst) {\\n if (lst == NULL) return;\\n\\n releaseNode(lst->head);\\n lst->head = NULL;\\n lst->tail = NULL;\\n}\\n\\nvoid addNode(List *lst, Position pos) {\\n struct Node_t *newNode;\\n\\n if (lst == NULL) {\\n exit(EXIT_FAILURE);\\n }\\n\\n newNode = malloc(sizeof(struct Node_t));\\n if (newNode == NULL) {\\n exit(EXIT_FAILURE);\\n }\\n\\n newNode->next = NULL;\\n newNode->pos = pos;\\n\\n if (lst->head == NULL) {\\n lst->head = lst->tail = newNode;\\n } else {\\n lst->tail->next = newNode;\\n lst->tail = newNode;\\n }\\n\\n lst->length++;\\n}\\n\\nvoid removeAt(List *lst, size_t pos) {\\n if (lst == NULL) return;\\n\\n if (pos == 0) {\\n struct Node_t *temp = lst->head;\\n\\n if (lst->tail == lst->head) {\\n lst->tail = NULL;\\n }\\n\\n lst->head = lst->head->next;\\n temp->next = NULL;\\n\\n free(temp);\\n lst->length--;\\n } else {\\n struct Node_t *temp = lst->head;\\n struct Node_t *rem;\\n size_t i = pos;\\n\\n while (i-- > 1) {\\n temp = temp->next;\\n }\\n\\n rem = temp->next;\\n if (rem == lst->tail) {\\n lst->tail = temp;\\n }\\n\\n temp->next = rem->next;\\n\\n rem->next = NULL;\\n free(rem);\\n\\n lst->length--;\\n }\\n}\\n\\n///////////////////////////////////////////////\\n\\nbool isAttacking(Position queen, Position pos) {\\n return queen.x == pos.x\\n || queen.y == pos.y\\n || abs(queen.x - pos.x) == abs(queen.y - pos.y);\\n}\\n\\nbool place(int m, int n, List *pBlackQueens, List *pWhiteQueens) {\\n struct Node_t *queenNode;\\n bool placingBlack = true;\\n int i, j;\\n\\n if (pBlackQueens == NULL || pWhiteQueens == NULL) {\\n exit(EXIT_FAILURE);\\n }\\n\\n if (m == 0) return true;\\n for (i = 0; i < n; i++) {\\n for (j = 0; j < n; j++) {\\n Position pos = { i, j };\\n\\n queenNode = pBlackQueens->head;\\n while (queenNode != NULL) {\\n if ((queenNode->pos.x == pos.x && queenNode->pos.y == pos.y) || !placingBlack && isAttacking(queenNode->pos, pos)) {\\n goto inner;\\n }\\n queenNode = queenNode->next;\\n }\\n\\n queenNode = pWhiteQueens->head;\\n while (queenNode != NULL) {\\n if ((queenNode->pos.x == pos.x && queenNode->pos.y == pos.y) || placingBlack && isAttacking(queenNode->pos, pos)) {\\n goto inner;\\n }\\n queenNode = queenNode->next;\\n }\\n\\n if (placingBlack) {\\n addNode(pBlackQueens, pos);\\n placingBlack = false;\\n } else {\\n addNode(pWhiteQueens, pos);\\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true;\\n }\\n removeAt(pBlackQueens, pBlackQueens->length - 1);\\n removeAt(pWhiteQueens, pWhiteQueens->length - 1);\\n placingBlack = true;\\n }\\n\\n inner: {}\\n }\\n }\\n if (!placingBlack) {\\n removeAt(pBlackQueens, pBlackQueens->length - 1);\\n }\\n return false;\\n}\\n\\nvoid printBoard(int n, List *pBlackQueens, List *pWhiteQueens) {\\n size_t length = n * n;\\n struct Node_t *queenNode;\\n char *board;\\n size_t i, j, k;\\n\\n if (pBlackQueens == NULL || pWhiteQueens == NULL) {\\n exit(EXIT_FAILURE);\\n }\\n\\n board = calloc(length, sizeof(char));\\n if (board == NULL) {\\n exit(EXIT_FAILURE);\\n }\\n\\n queenNode = pBlackQueens->head;\\n while (queenNode != NULL) {\\n board[queenNode->pos.x * n + queenNode->pos.y] = Black;\\n queenNode = queenNode->next;\\n }\\n\\n queenNode = pWhiteQueens->head;\\n while (queenNode != NULL) {\\n board[queenNode->pos.x * n + queenNode->pos.y] = White;\\n queenNode = queenNode->next;\\n }\\n\\n for (i = 0; i < length; i++) {\\n if (i != 0 && i % n == 0) {\\n printf(\\\"\\\\n\\\");\\n }\\n switch (board[i]) {\\n case Black:\\n printf(\\\"B \\\");\\n break;\\n case White:\\n printf(\\\"W \\\");\\n break;\\n default:\\n j = i / n;\\n k = i - j * n;\\n if (j % 2 == k % 2) {\\n printf(\\\" \\\");\\n } else {\\n printf(\\\"# \\\");\\n }\\n break;\\n }\\n }\\n\\n printf(\\\"\\\\n\\\\n\\\");\\n}\\n\\nvoid test(int n, int q) {\\n List blackQueens = makeList();\\n List whiteQueens = makeList();\\n\\n printf(\\\"%d black and %d white queens on a %d x %d board:\\\\n\\\", q, q, n, n);\\n if (place(q, n, &blackQueens, &whiteQueens)) {\\n printBoard(n, &blackQueens, &whiteQueens);\\n } else {\\n printf(\\\"No solution exists.\\\\n\\\\n\\\");\\n }\\n\\n releaseList(&blackQueens);\\n releaseList(&whiteQueens);\\n}\\n\\nint main() {\\n test(2, 1);\\n\\n test(3, 1);\\n test(3, 2);\\n\\n test(4, 1);\\n test(4, 2);\\n test(4, 3);\\n\\n test(5, 1);\\n test(5, 2);\\n test(5, 3);\\n test(5, 4);\\n test(5, 5);\\n\\n test(6, 1);\\n test(6, 2);\\n test(6, 3);\\n test(6, 4);\\n test(6, 5);\\n test(6, 6);\\n\\n test(7, 1);\\n test(7, 2);\\n test(7, 3);\\n test(7, 4);\\n test(7, 5);\\n test(7, 6);\\n test(7, 7);\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <iostream>\\n#include <vector>\\n\\nenum class Piece {\\n empty,\\n black,\\n white\\n};\\n\\ntypedef std::pair<int, int> position;\\n\\nbool isAttacking(const position &queen, const position &pos) {\\n return queen.first == pos.first\\n || queen.second == pos.second\\n || abs(queen.first - pos.first) == abs(queen.second - pos.second);\\n}\\n\\nbool place(const int m, const int n, std::vector<position> &pBlackQueens, std::vector<position> &pWhiteQueens) {\\n if (m == 0) {\\n return true;\\n }\\n bool placingBlack = true;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n auto pos = std::make_pair(i, j);\\n for (auto queen : pBlackQueens) {\\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\\n goto inner;\\n }\\n }\\n for (auto queen : pWhiteQueens) {\\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\\n goto inner;\\n }\\n }\\n if (placingBlack) {\\n pBlackQueens.push_back(pos);\\n placingBlack = false;\\n } else {\\n pWhiteQueens.push_back(pos);\\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true;\\n }\\n pBlackQueens.pop_back();\\n pWhiteQueens.pop_back();\\n placingBlack = true;\\n }\\n\\n inner: {}\\n }\\n }\\n if (!placingBlack) {\\n pBlackQueens.pop_back();\\n }\\n return false;\\n}\\n\\nvoid printBoard(int n, const std::vector<position> &blackQueens, const std::vector<position> &whiteQueens) {\\n std::vector<Piece> board(n * n);\\n std::fill(board.begin(), board.end(), Piece::empty);\\n\\n for (auto &queen : blackQueens) {\\n board[queen.first * n + queen.second] = Piece::black;\\n }\\n for (auto &queen : whiteQueens) {\\n board[queen.first * n + queen.second] = Piece::white;\\n }\\n\\n for (size_t i = 0; i < board.size(); ++i) {\\n if (i != 0 && i % n == 0) {\\n std::cout << '\\\\n';\\n }\\n switch (board[i]) {\\n case Piece::black:\\n std::cout << \\\"B \\\";\\n break;\\n case Piece::white:\\n std::cout << \\\"W \\\";\\n break;\\n case Piece::empty:\\n default:\\n int j = i / n;\\n int k = i - j * n;\\n if (j % 2 == k % 2) {\\n std::cout << \\\"x \\\";\\n } else {\\n std::cout << \\\"* \\\";\\n }\\n break;\\n }\\n }\\n\\n std::cout << \\\"\\\\n\\\\n\\\";\\n}\\n\\nint main() {\\n std::vector<position> nms = {\\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\\n };\\n\\n for (auto nm : nms) {\\n std::cout << nm.second << \\\" black and \\\" << nm.second << \\\" white queens on a \\\" << nm.first << \\\" x \\\" << nm.first << \\\" board:\\\\n\\\";\\n std::vector<position> blackQueens, whiteQueens;\\n if (place(nm.second, nm.first, blackQueens, whiteQueens)) {\\n printBoard(nm.first, blackQueens, whiteQueens);\\n } else {\\n std::cout << \\\"No solution exists.\\\\n\\\\n\\\";\\n }\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Collections.Generic;\\n\\nnamespace PeacefulChessQueenArmies {\\n using Position = Tuple<int, int>;\\n\\n enum Piece {\\n Empty,\\n Black,\\n White\\n }\\n\\n class Program {\\n static bool IsAttacking(Position queen, Position pos) {\\n return queen.Item1 == pos.Item1\\n || queen.Item2 == pos.Item2\\n || Math.Abs(queen.Item1 - pos.Item1) == Math.Abs(queen.Item2 - pos.Item2);\\n }\\n\\n static bool Place(int m, int n, List<Position> pBlackQueens, List<Position> pWhiteQueens) {\\n if (m == 0) {\\n return true;\\n }\\n bool placingBlack = true;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n var pos = new Position(i, j);\\n foreach (var queen in pBlackQueens) {\\n if (queen.Equals(pos) || !placingBlack && IsAttacking(queen, pos)) {\\n goto inner;\\n }\\n }\\n foreach (var queen in pWhiteQueens) {\\n if (queen.Equals(pos) || placingBlack && IsAttacking(queen, pos)) {\\n goto inner;\\n }\\n }\\n if (placingBlack) {\\n pBlackQueens.Add(pos);\\n placingBlack = false;\\n } else {\\n pWhiteQueens.Add(pos);\\n if (Place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true;\\n }\\n pBlackQueens.RemoveAt(pBlackQueens.Count - 1);\\n pWhiteQueens.RemoveAt(pWhiteQueens.Count - 1);\\n placingBlack = true;\\n }\\n inner: { }\\n }\\n }\\n if (!placingBlack) {\\n pBlackQueens.RemoveAt(pBlackQueens.Count - 1);\\n }\\n return false;\\n }\\n\\n static void PrintBoard(int n, List<Position> blackQueens, List<Position> whiteQueens) {\\n var board = new Piece[n * n];\\n\\n foreach (var queen in blackQueens) {\\n board[queen.Item1 * n + queen.Item2] = Piece.Black;\\n }\\n foreach (var queen in whiteQueens) {\\n board[queen.Item1 * n + queen.Item2] = Piece.White;\\n }\\n\\n for (int i = 0; i < board.Length; i++) {\\n if (i != 0 && i % n == 0) {\\n Console.WriteLine();\\n }\\n switch (board[i]) {\\n case Piece.Black:\\n Console.Write(\\\"B \\\");\\n break;\\n case Piece.White:\\n Console.Write(\\\"W \\\");\\n break;\\n case Piece.Empty:\\n int j = i / n;\\n int k = i - j * n;\\n if (j % 2 == k % 2) {\\n Console.Write(\\\" \\\");\\n } else {\\n Console.Write(\\\"# \\\");\\n }\\n break;\\n }\\n }\\n\\n Console.WriteLine(\\\"\\\\n\\\");\\n }\\n\\n static void Main() {\\n var nms = new int[,] {\\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\\n };\\n for (int i = 0; i < nms.GetLength(0); i++) {\\n Console.WriteLine(\\\"{0} black and {0} white queens on a {1} x {1} board:\\\", nms[i, 1], nms[i, 0]);\\n List<Position> blackQueens = new List<Position>();\\n List<Position> whiteQueens = new List<Position>();\\n if (Place(nms[i, 1], nms[i, 0], blackQueens, whiteQueens)) {\\n PrintBoard(nms[i, 0], blackQueens, whiteQueens);\\n } else {\\n Console.WriteLine(\\\"No solution exists.\\\\n\\\");\\n }\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"import std.array;\\nimport std.math;\\nimport std.stdio;\\nimport std.typecons;\\n\\nenum Piece {\\n empty,\\n black,\\n white,\\n}\\n\\nalias position = Tuple!(int, \\\"i\\\", int, \\\"j\\\");\\n\\nbool place(int m, int n, ref position[] pBlackQueens, ref position[] pWhiteQueens) {\\n if (m == 0) {\\n return true;\\n }\\n bool placingBlack = true;\\n foreach (i; 0..n) {\\n inner:\\n foreach (j; 0..n) {\\n auto pos = position(i, j);\\n foreach (queen; pBlackQueens) {\\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\\n continue inner;\\n }\\n }\\n foreach (queen; pWhiteQueens) {\\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\\n continue inner;\\n }\\n }\\n if (placingBlack) {\\n pBlackQueens ~= pos;\\n placingBlack = false;\\n } else {\\n pWhiteQueens ~= pos;\\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true;\\n }\\n pBlackQueens.length--;\\n pWhiteQueens.length--;\\n placingBlack = true;\\n }\\n }\\n }\\n if (!placingBlack) {\\n pBlackQueens.length--;\\n }\\n return false;\\n}\\n\\nbool isAttacking(position queen, position pos) {\\n return queen.i == pos.i\\n || queen.j == pos.j\\n || abs(queen.i - pos.i) == abs(queen.j - pos.j);\\n}\\n\\nvoid printBoard(int n, position[] blackQueens, position[] whiteQueens) {\\n auto board = uninitializedArray!(Piece[])(n * n);\\n board[] = Piece.empty;\\n\\n foreach (queen; blackQueens) {\\n board[queen.i * n + queen.j] = Piece.black;\\n }\\n foreach (queen; whiteQueens) {\\n board[queen.i * n + queen.j] = Piece.white;\\n }\\n foreach (i,b; board) {\\n if (i != 0 && i % n == 0) {\\n writeln;\\n }\\n final switch (b) {\\n case Piece.black:\\n write(\\\"B \\\");\\n break;\\n case Piece.white:\\n write(\\\"W \\\");\\n break;\\n case Piece.empty:\\n int j = i / n;\\n int k = i - j * n;\\n\\n if (j % 2 == k % 2) {\\n write(\\\"• \\\"w);\\n } else {\\n write(\\\"◦ \\\"w);\\n }\\n break;\\n }\\n }\\n writeln('\\\\n');\\n}\\n\\nvoid main() {\\n auto nms = [\\n [2, 1], [3, 1], [3, 2], [4, 1], [4, 2], [4, 3],\\n [5, 1], [5, 2], [5, 3], [5, 4], [5, 5],\\n [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6],\\n [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7],\\n ];\\n foreach (nm; nms) {\\n writefln(\\\"%d black and %d white queens on a %d x %d board:\\\", nm[1], nm[1], nm[0], nm[0]);\\n position[] blackQueens;\\n position[] whiteQueens;\\n if (place(nm[1], nm[0], blackQueens, whiteQueens)) {\\n printBoard(nm[0], blackQueens, whiteQueens);\\n } else {\\n writeln(\\\"No solution exists.\\\\n\\\");\\n }\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"program peaceful_queens_elements_generator\\n use, intrinsic :: iso_fortran_env, only: int64\\n use, intrinsic :: iso_fortran_env, only: error_unit\\n\\n implicit none\\n\\n ! 64-bit integers, for boards up to 8-by-8.\\n integer, parameter :: kind8x8 = int64\\n\\n ! 128-bit integers, for boards up to 11-by-11.\\n ! This value is correct for gfortran.\\n integer, parameter :: kind11x11 = 16\\n\\n integer(kind = kind11x11), parameter :: one = 1\\n integer(kind = kind11x11), parameter :: two = 2\\n\\n integer, parameter :: n_max = 11\\n\\n integer(kind = kind11x11) :: rook1_masks(0 : n_max - 1)\\n integer(kind = kind11x11) :: rook2_masks(0 : n_max - 1)\\n integer(kind = kind11x11) :: bishop1_masks(0 : (2 * n_max) - 4)\\n integer(kind = kind11x11) :: bishop2_masks(0 : (2 * n_max) - 4)\\n\\n ! Combines rook1_masks and rook2_masks.\\n integer(kind = kind11x11) :: rook_masks(0 : (2 * n_max) - 1)\\n\\n ! Combines bishop1_masks and bishop2_masks.\\n integer(kind = kind11x11) :: bishop_masks(0 : (4 * n_max) - 7)\\n\\n ! Combines rook and bishop masks.\\n integer(kind = kind11x11) :: queen_masks(0 : (6 * n_max) - 7)\\n\\n character(len = 16), parameter :: s_kind8x8 = \\\"kind8x8 \\\"\\n character(len = 16), parameter :: s_kind11x11 = \\\"kind11x11 \\\"\\n\\n character(200) :: arg\\n integer :: arg_count\\n\\n integer :: m, n, max_solutions\\n integer :: board_kind\\n\\n arg_count = command_argument_count ()\\n if (arg_count /= 3) then\\n call get_command_argument (0, arg)\\n write (error_unit, '(\\\"Usage: \\\", A, \\\" M N MAX_SOLUTIONS\\\")') trim (arg)\\n stop 1\\n end if\\n\\n call get_command_argument (1, arg)\\n read (arg, *) m\\n if (m < 1) then\\n write (error_unit, '(\\\"M must be between 1 or greater.\\\")')\\n stop 2\\n end if\\n\\n call get_command_argument (2, arg)\\n read (arg, *) n\\n if (n < 3 .or. 11 < n) then\\n write (error_unit, '(\\\"N must be between 3 and \\\", I0, \\\", inclusive.\\\")') n_max\\n stop 2\\n end if\\n\\n call get_command_argument (3, arg)\\n read (arg, *) max_solutions\\n\\n write (*, '(\\\"module peaceful_queens_elements\\\")')\\n write (*, '()')\\n write (*, '(\\\" use, intrinsic :: iso_fortran_env, only: int64\\\")')\\n write (*, '()')\\n write (*, '(\\\" implicit none\\\")')\\n write (*, '(\\\" private\\\")')\\n write (*, '()')\\n write (*, '(\\\" integer, parameter, public :: m = \\\", I0)') m\\n write (*, '(\\\" integer, parameter, public :: n = \\\", I0)') n\\n write (*, '(\\\" integer, parameter, public :: max_solutions = \\\", I0)') max_solutions\\n write (*, '()')\\n if (n <= 8) then\\n write (*, '(\\\" ! 64-bit integers, for boards up to 8-by-8.\\\")')\\n write (*, '(\\\" integer, parameter, private :: kind8x8 = int64\\\")')\\n else\\n write (*, '(\\\" ! 128-bit integers, for boards up to 11-by-11.\\\")')\\n write (*, '(\\\" integer, parameter, private :: kind11x11 = \\\", I0)') kind11x11\\n end if\\n write (*, '(\\\" integer, parameter, public :: board_kind = \\\", A)') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '()')\\n write (*, '(\\\" public :: rooks1_attack_check\\\")')\\n write (*, '(\\\" public :: rooks2_attack_check\\\")')\\n write (*, '(\\\" public :: rooks_attack_check\\\")')\\n write (*, '(\\\" public :: bishops1_attack_check\\\")')\\n write (*, '(\\\" public :: bishops2_attack_check\\\")')\\n write (*, '(\\\" public :: bishops_attack_check\\\")')\\n write (*, '(\\\" public :: queens_attack_check\\\")')\\n write (*, '()')\\n write (*, '(\\\" public :: board_rotate90\\\")')\\n write (*, '(\\\" public :: board_rotate180\\\")')\\n write (*, '(\\\" public :: board_rotate270\\\")')\\n write (*, '(\\\" public :: board_reflect1\\\")')\\n write (*, '(\\\" public :: board_reflect2\\\")')\\n write (*, '(\\\" public :: board_reflect3\\\")')\\n write (*, '(\\\" public :: board_reflect4\\\")')\\n write (*, '()')\\n\\n call write_rook1_masks\\n call write_rook2_masks\\n call write_bishop1_masks\\n call write_bishop2_masks\\n call write_rook_masks\\n call write_bishop_masks\\n call write_queen_masks\\n\\n write (*, '(\\\"contains\\\")')\\n write (*, '()')\\n\\n call write_rooks1_attack_check\\n call write_rooks2_attack_check\\n call write_bishops1_attack_check\\n call write_bishops2_attack_check\\n call write_rooks_attack_check\\n call write_bishops_attack_check\\n call write_queens_attack_check\\n\\n call write_board_rotate90\\n call write_board_rotate180\\n call write_board_rotate270\\n call write_board_reflect1\\n call write_board_reflect2\\n call write_board_reflect3\\n call write_board_reflect4\\n\\n call write_insert_zeros\\n call write_reverse_insert_zeros\\n\\n write (*, '(\\\"end module peaceful_queens_elements\\\")')\\n\\ncontains\\n\\n subroutine write_rook1_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, n - 1\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: rook1_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & rook1_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_rook1_masks\\n\\n subroutine write_rook2_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, n - 1\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: rook2_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & rook2_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_rook2_masks\\n\\n subroutine write_bishop1_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, (2 * n) - 4\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: bishop1_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & bishop1_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_bishop1_masks\\n\\n subroutine write_bishop2_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, (2 * n) - 4\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: bishop2_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & bishop2_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_bishop2_masks\\n\\n subroutine write_rook_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, (2 * n) - 1\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: rook_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & rook_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_rook_masks\\n\\n subroutine write_bishop_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, (4 * n) - 7\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: bishop_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & bishop_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_bishop_masks\\n\\n subroutine write_queen_masks\\n integer :: i\\n\\n call fill_masks (n)\\n do i = 0, (6 * n) - 7\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), parameter :: queen_mask_\\\",&\\n & I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\" = int (z''\\\", Z0.32, \\\"'', kind &\\n &= \\\", A, \\\")\\\")') trim (s_kindnxn (n)), n, n, i,&\\n & queen_masks(i), trim (s_kindnxn (n))\\n end do\\n write (*, '()')\\n end subroutine write_queen_masks\\n\\n subroutine write_rooks1_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function rooks1_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, rook1_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, n - 1\\n write (*, '(\\\" & ((iand (army1, rook1_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, rook1_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= n - 1) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function rooks1_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_rooks1_attack_check\\n\\n subroutine write_rooks2_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function rooks2_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, rook2_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, rook2_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, n - 1\\n write (*, '(\\\" & ((iand (army1, rook2_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, rook2_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= n - 1) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function rooks2_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_rooks2_attack_check\\n\\n subroutine write_bishops1_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function bishops1_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, bishop1_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, bishop1_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, (2 * n) - 4\\n write (*, '(\\\" & ((iand (army1, bishop1_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, bishop1_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= (2 * n) - 4) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function bishops1_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_bishops1_attack_check\\n\\n subroutine write_bishops2_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function bishops2_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, bishop2_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, bishop2_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, (2 * n) - 4\\n write (*, '(\\\" & ((iand (army1, bishop2_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, bishop2_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= (2 * n) - 4) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function bishops2_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_bishops2_attack_check\\n\\n subroutine write_rooks_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function rooks_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, rook_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, rook_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, (2 * n) - 1\\n write (*, '(\\\" & ((iand (army1, rook_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, rook_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= (2 * n) - 1) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function rooks_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_rooks_attack_check\\n\\n subroutine write_bishops_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function bishops_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, bishop_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, bishop_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, (4 * n) - 7\\n write (*, '(\\\" & ((iand (army1, bishop_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, bishop_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= (4 * n) - 7) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function bishops_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_bishops_attack_check\\n\\n subroutine write_queens_attack_check\\n integer :: i\\n\\n write (*, '(\\\" elemental function queens_attack_check (army1, army2) result (attacking)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: army1, army2\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" logical :: attacking\\\")')\\n write (*, '()')\\n write (*, '(\\\" attacking = ((iand (army1, queen_mask_\\\", I0, \\\"x\\\", I0,&\\n & \\\"_0) /= 0) .and. (iand (army2, queen_mask_\\\", I0, \\\"x\\\", I0, \\\"_0) /=&\\n & 0)) .or. &\\\")') n, n, n, n\\n do i = 1, (6 * n) - 7\\n write (*, '(\\\" & ((iand (army1, queen_mask_\\\", I0, \\\"x\\\",&\\n & I0, \\\"_\\\", I0, \\\") /= 0) .and. (iand (army2, queen_mask_\\\", I0,&\\n & \\\"x\\\", I0, \\\"_\\\", I0, \\\") /= 0))\\\")', advance = 'no') n, n, i, n, n, i\\n if (i /= (6 * n) - 7) then\\n write (*, '(\\\" .or. &\\\")')\\n else\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function queens_attack_check\\\")')\\n write (*, '()')\\n end subroutine write_queens_attack_check\\n\\n subroutine write_board_rotate90\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_rotate90 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Rotation 90 degrees in one of the orientations.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (reverse_insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\"), &\\\")') n, n, n, i, -i * n, i\\n else\\n write (*, '(\\\" ishft (reverse_insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\")\\\")', advance = 'no') n, n, n, i, -i * n, i\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_rotate90\\\")')\\n write (*, '()')\\n end subroutine write_board_rotate90\\n\\n subroutine write_board_rotate180\\n write (*, '(\\\" elemental function board_rotate180 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Rotation 180 degrees.\\\")')\\n write (*, '()')\\n write (*, '(\\\" b = board_reflect1 (board_reflect2 (a))\\\")')\\n write (*, '(\\\" end function board_rotate180\\\")')\\n write (*, '()')\\n end subroutine write_board_rotate180\\n\\n subroutine write_board_rotate270\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_rotate270 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Rotation 270 degrees in one of the orientations.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\"), &\\\")') n, n, n, i, -i * n, n - 1 - i\\n else\\n write (*, '(\\\" ishft (insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\")\\\")', advance = 'no') n, n, n, i, -i * n, n - 1 - i\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_rotate270\\\")')\\n write (*, '()')\\n end subroutine write_board_rotate270\\n\\n subroutine write_board_reflect1\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_reflect1 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Reflection of rows or columns.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (iand (rook2_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\", I0, \\\"), &\\\")') &\\n & n, n, i, (n - 1) - (2 * i)\\n else\\n write (*, '(\\\"ishft (iand (rook2_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\", I0, \\\")\\\")', advance = 'no') &\\n & n, n, i, (n - 1) - (2 * i)\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_reflect1\\\")')\\n write (*, '()')\\n end subroutine write_board_reflect1\\n\\n subroutine write_board_reflect2\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_reflect2 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Reflection of rows or columns.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\", I0, \\\"), &\\\")') &\\n & n, n, i, n * ((n - 1) - (2 * i))\\n else\\n write (*, '(\\\"ishft (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\", I0, \\\")\\\")', advance = 'no') &\\n & n, n, i, n * ((n - 1) - (2 * i))\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_reflect2\\\")')\\n write (*, '()')\\n end subroutine write_board_reflect2\\n\\n subroutine write_board_reflect3\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_reflect3 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Reflection around one of the two main diagonals.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\"), &\\\")') n, n, n, i, -i * n, i\\n else\\n write (*, '(\\\" ishft (insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\")\\\")', advance = 'no') n, n, n, i, -i * n, i\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_reflect3\\\")')\\n write (*, '()')\\n end subroutine write_board_reflect3\\n\\n subroutine write_board_reflect4\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function board_reflect4 (a) result (b)\\\")')\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n write (*, '(\\\" ! Reflection around one of the two main diagonals.\\\")')\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (reverse_insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\"), &\\\")') n, n, n, i, -i * n, n - 1 - i\\n else\\n write (*, '(\\\" ishft (reverse_insert_zeros_\\\", I0, \\\" (ishft&\\n & (iand (rook1_mask_\\\", I0, \\\"x\\\", I0, \\\"_\\\", I0, \\\", a), \\\",&\\n & I0, \\\")), \\\", I0, \\\")\\\")', advance = 'no') n, n, n, i, -i * n, n - 1 - i\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function board_reflect4\\\")')\\n write (*, '()')\\n end subroutine write_board_reflect4\\n\\n subroutine write_insert_zeros\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function insert_zeros_\\\", I0, \\\" (a) result (b)\\\")') n\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (ibits (a, \\\", I0, \\\", 1), \\\", I0, \\\"), &\\\")') i, i * n\\n else\\n write (*, '(\\\"ishft (ibits (a, \\\", I0, \\\", 1), \\\", I0, \\\")\\\")', advance = 'no') i, i * n\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function insert_zeros_\\\", I0)') n\\n write (*, '()')\\n end subroutine write_insert_zeros\\n\\n subroutine write_reverse_insert_zeros\\n integer :: i, j\\n\\n write (*, '(\\\" elemental function reverse_insert_zeros_\\\", I0, \\\" (a) result (b)\\\")') n\\n write (*, '(\\\" integer(kind = \\\", A, \\\"), value :: a\\\")') trim (s_kindnxn (n))\\n write (*, '(\\\" integer(kind = \\\", A, \\\") :: b\\\")') trim (s_kindnxn (n))\\n write (*, '()')\\n do i = 0, n - 1\\n if (i == 0) then\\n write (*, '(\\\" b = \\\")', advance = 'no')\\n else\\n write (*, '(\\\" & \\\")', advance = 'no')\\n do j = 1, i\\n write (*, '(\\\" \\\")', advance = 'no')\\n end do\\n end if\\n if (i /= n - 1) then\\n write (*, '(\\\"ior (ishft (ibits (a, \\\", I0, \\\", 1), \\\", I0, \\\"), &\\\")') n - 1 - i, i * n\\n else\\n write (*, '(\\\"ishft (ibits (a, \\\", I0, \\\", 1), \\\", I0, \\\")\\\")', advance = 'no') n - 1 - i, i * n\\n do j = 1, n - 1\\n write (*, '(\\\")\\\")', advance = 'no')\\n end do\\n write (*, '()')\\n end if\\n end do\\n write (*, '(\\\" end function reverse_insert_zeros_\\\", I0)') n\\n write (*, '()')\\n end subroutine write_reverse_insert_zeros\\n\\n function s_kindnxn (n) result (s)\\n integer, intent(in) :: n\\n character(len = 16) :: s\\n\\n if (n <= 8) then\\n s = s_kind8x8\\n else\\n s = s_kind11x11\\n end if\\n end function s_kindnxn\\n\\n subroutine fill_masks (n)\\n integer, intent(in) :: n\\n\\n call fill_rook1_masks (n)\\n call fill_rook2_masks (n)\\n call fill_bishop1_masks (n)\\n call fill_bishop2_masks (n)\\n call fill_rook_masks (n)\\n call fill_bishop_masks (n)\\n call fill_queen_masks (n)\\n end subroutine fill_masks\\n\\n subroutine fill_rook1_masks (n)\\n integer, intent(in) :: n\\n\\n integer :: i\\n integer(kind = kind11x11) :: mask\\n\\n mask = (two ** n) - 1\\n do i = 0, n - 1\\n rook1_masks(i) = mask\\n mask = ishft (mask, n)\\n end do\\n end subroutine fill_rook1_masks\\n\\n subroutine fill_rook2_masks (n)\\n integer, intent(in) :: n\\n\\n integer :: i\\n integer(kind = kind11x11) :: mask\\n\\n mask = 0\\n do i = 0, n - 1\\n mask = ior (ishft (mask, n), one)\\n end do\\n do i = 0, n - 1\\n rook2_masks(i) = mask\\n mask = ishft (mask, 1)\\n end do\\n end subroutine fill_rook2_masks\\n\\n subroutine fill_bishop1_masks (n)\\n integer, intent(in) :: n\\n\\n integer :: i, j, k\\n integer(kind = kind11x11) :: mask0, mask1\\n\\n ! Masks for diagonals. Put them in order from most densely\\n ! populated to least densely populated.\\n\\n do k = 0, n - 2\\n mask0 = 0\\n mask1 = 0\\n do i = k, n - 1\\n j = i - k\\n mask0 = ior (mask0, ishft (one, i + (j * n)))\\n mask1 = ior (mask1, ishft (one, j + (i * n)))\\n end do\\n if (k == 0) then\\n bishop1_masks(0) = mask0\\n else\\n bishop1_masks((2 * k) - 1) = mask0\\n bishop1_masks(2 * k) = mask1\\n end if\\n end do\\n end subroutine fill_bishop1_masks\\n\\n subroutine fill_bishop2_masks (n)\\n integer, intent(in) :: n\\n\\n integer :: i, j, k\\n integer :: i1, j1\\n integer(kind = kind11x11) :: mask0, mask1\\n\\n ! Masks for skew diagonals. Put them in order from most densely\\n ! populated to least densely populated.\\n\\n do k = 0, n - 2\\n mask0 = 0\\n mask1 = 0\\n do i = k, n - 1\\n j = i - k\\n i1 = n - 1 - i\\n j1 = n - 1 - j\\n mask0 = ior (mask0, ishft (one, j + (i1 * n)))\\n mask1 = ior (mask1, ishft (one, i + (j1 * n)))\\n end do\\n if (k == 0) then\\n bishop2_masks(0) = mask0\\n else\\n bishop2_masks((2 * k) - 1) = mask0\\n bishop2_masks(2 * k) = mask1\\n end if\\n end do\\n end subroutine fill_bishop2_masks\\n\\n subroutine fill_rook_masks (n)\\n integer, intent(in) :: n\\n\\n rook_masks(0 : n - 1) = rook1_masks\\n rook_masks(n : (2 * n) - 1) = rook2_masks\\n end subroutine fill_rook_masks\\n\\n subroutine fill_bishop_masks (n)\\n integer, intent(in) :: n\\n\\n integer :: i\\n\\n ! Put the masks in order from most densely populated to least\\n ! densely populated.\\n\\n do i = 0, (2 * n) - 4\\n bishop_masks(2 * i) = bishop1_masks(i)\\n bishop_masks((2 * i) + 1) = bishop2_masks(i)\\n end do\\n end subroutine fill_bishop_masks\\n\\n subroutine fill_queen_masks (n)\\n integer, intent(in) :: n\\n\\n queen_masks(0 : (2 * n) - 1) = rook_masks\\n queen_masks(2 * n : (6 * n) - 7) = bishop_masks\\n end subroutine fill_queen_masks\\n\\nend program peaceful_queens_elements_generator\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"module peaceful_queens_support\\n use, non_intrinsic :: peaceful_queens_elements\\n\\n implicit none\\n private\\n\\n public :: write_board\\n public :: write_board_without_spaces\\n public :: write_board_with_spaces\\n\\n public :: save_a_solution\\n\\n interface write_board\\n module procedure write_board_without_spaces\\n module procedure write_board_with_spaces\\n end interface write_board\\n\\ncontains\\n\\n subroutine write_board_without_spaces (unit, army_b, army_w)\\n integer, intent(in) :: unit\\n integer(kind = board_kind), intent(in) :: army_b, army_w\\n\\n call write_board_with_spaces (unit, army_b, army_w, 0)\\n end subroutine write_board_without_spaces\\n\\n subroutine write_board_with_spaces (unit, army_b, army_w, num_spaces)\\n integer, intent(in) :: unit\\n integer(kind = board_kind), intent(in) :: army_b, army_w\\n integer, intent(in) :: num_spaces\\n\\n integer(kind = board_kind), parameter :: zero = 0\\n integer(kind = board_kind), parameter :: one = 1\\n\\n integer :: i, j\\n integer(kind = board_kind) :: rank_b, rank_w\\n integer(kind = board_kind) :: mask\\n\\n character(1), allocatable :: queens(:)\\n character(4), allocatable :: rules(:)\\n character(1), allocatable :: spaces(:)\\n\\n allocate (queens(0 : n - 1))\\n allocate (rules(0 : n - 1))\\n allocate (spaces(1 : num_spaces))\\n\\n rules = \\\"----\\\"\\n if (0 < num_spaces) then\\n spaces = \\\" \\\" ! For putting spaces after newlines.\\n end if\\n\\n mask = not (ishft (not (zero), n))\\n write (unit, '(\\\"+\\\", 100(A4, \\\"+\\\"))') rules\\n do i = 0, n - 1\\n rank_b = iand (mask, ishft (army_b, -i * n))\\n rank_w = iand (mask, ishft (army_w, -i * n))\\n do j = 0, n - 1\\n if (iand (rank_b, ishft (one, j)) /= 0) then\\n queens(j) = \\\"B\\\"\\n else if (iand (rank_w, ishft (one, j)) /= 0) then\\n queens(j) = \\\"W\\\"\\n else\\n queens(j) = \\\" \\\"\\n end if\\n end do\\n write (unit, '(100A1)', advance = 'no') spaces\\n write (unit, '(\\\"|\\\", 100(A3, \\\" |\\\"))') queens\\n write (unit, '(100A1)', advance = 'no') spaces\\n if (i /= n - 1) then\\n write (unit, '(\\\"+\\\", 100(A4, \\\"+\\\"))') rules\\n else\\n write (unit, '(\\\"+\\\", 100(A4, \\\"+\\\"))', advance = 'no') rules\\n end if\\n end do\\n end subroutine write_board_with_spaces\\n\\n subroutine save_a_solution (army1, army2, num_solutions, armies1, armies2)\\n integer(kind = board_kind), intent(in) :: army1, army2\\n integer, intent(inout) :: num_solutions\\n integer(kind = board_kind), intent(inout) :: armies1(1:8, 1:max_solutions)\\n integer(kind = board_kind), intent(inout) :: armies2(1:8, 1:max_solutions)\\n\\n ! A sanity check.\\n if (queens_attack_check (army1, army2)) then\\n error stop\\n end if\\n\\n num_solutions = num_solutions + 1\\n\\n armies1(1, num_solutions) = army1\\n armies1(2, num_solutions) = board_rotate90 (army1)\\n armies1(3, num_solutions) = board_rotate180 (army1)\\n armies1(4, num_solutions) = board_rotate270 (army1)\\n armies1(5, num_solutions) = board_reflect1 (army1)\\n armies1(6, num_solutions) = board_reflect2 (army1)\\n armies1(7, num_solutions) = board_reflect3 (army1)\\n armies1(8, num_solutions) = board_reflect4 (army1)\\n\\n armies2(1, num_solutions) = army2\\n armies2(2, num_solutions) = board_rotate90 (army2)\\n armies2(3, num_solutions) = board_rotate180 (army2)\\n armies2(4, num_solutions) = board_rotate270 (army2)\\n armies2(5, num_solutions) = board_reflect1 (army2)\\n armies2(6, num_solutions) = board_reflect2 (army2)\\n armies2(7, num_solutions) = board_reflect3 (army2)\\n armies2(8, num_solutions) = board_reflect4 (army2)\\n end subroutine save_a_solution\\n\\nend module peaceful_queens_support\\n\\nmodule peaceful_queens_solver\\n use, non_intrinsic :: peaceful_queens_elements\\n use, non_intrinsic :: peaceful_queens_support\\n\\n implicit none\\n private\\n\\n public :: solve_peaceful_queens\\n\\n integer(kind = board_kind), parameter :: zero = 0_board_kind\\n integer(kind = board_kind), parameter :: one = 1_board_kind\\n integer(kind = board_kind), parameter :: two = 2_board_kind\\n\\ncontains\\n\\n subroutine solve_peaceful_queens (unit, show_equivalents, &\\n & num_solutions, armies1, armies2)\\n integer, intent(in) :: unit\\n logical, intent(in) :: show_equivalents\\n integer, intent(out) :: num_solutions\\n integer(kind = board_kind), intent(out) :: armies1(1:8, 1:max_solutions)\\n integer(kind = board_kind), intent(out) :: armies2(1:8, 1:max_solutions)\\n\\n call solve (zero, 0, 0, zero, 0, 0, 0)\\n\\n contains\\n\\n recursive subroutine solve (army1, rooklike11, rooklike12, &\\n & army2, rooklike21, rooklike22, index)\\n integer(kind = board_kind), value :: army1\\n integer, value :: rooklike11, rooklike12\\n integer(kind = board_kind), value :: army2\\n integer, value :: rooklike21, rooklike22\\n integer, value :: index\\n\\n integer :: num_queens1\\n integer :: num_queens2\\n integer(kind = board_kind) :: new_army\\n integer(kind = board_kind) :: new_army_reversed\\n integer :: bit1, bit2\\n logical :: skip\\n\\n num_queens1 = popcnt (army1)\\n num_queens2 = popcnt (army2)\\n\\n if (num_queens1 + num_queens2 == 2 * m) then\\n if (.not. is_a_duplicate (army1, army2, num_solutions, armies1, armies2)) then\\n call save_a_solution (army1, army2, num_solutions, armies1, armies2)\\n write (unit, '(\\\"Solution \\\", I0)') num_solutions\\n call write_board (unit, army1, army2)\\n write (unit, '()')\\n write (unit, '()')\\n call optionally_write_equivalents\\n end if\\n else if (num_queens1 - num_queens2 == 0) then\\n ! It is time to add a queen to army1.\\n do while (num_solutions < max_solutions .and. index /= n**2)\\n skip = .false.\\n new_army = ior (army1, ishft (one, index))\\n if (new_army == army1) then\\n skip = .true.\\n else if (index < n) then\\n new_army_reversed = board_reflect1 (new_army)\\n if (new_army_reversed < new_army) then\\n ! Skip a bunch of board_reflect1 equivalents.\\n skip = .true.\\n end if\\n end if\\n if (skip) then\\n index = index + 1\\n else\\n bit1 = ishft (1, index / n)\\n bit2 = ishft (1, mod (index, n))\\n if (iand (rooklike21, bit1) /= 0) then\\n index = round_up_to_multiple (index + 1, n)\\n else if (iand (rooklike22, bit2) /= 0) then\\n index = index + 1\\n else if (bishops_attack_check (new_army, army2)) then\\n index = index + 1\\n else\\n call solve (new_army, &\\n & ior (rooklike11, bit1), &\\n & ior (rooklike12, bit2), &\\n & army2, rooklike21, rooklike22, &\\n & n)\\n index = index + 1\\n end if\\n end if\\n end do\\n else\\n ! It is time to add a queen to army2.\\n do while (num_solutions < max_solutions .and. index /= n**2)\\n new_army = ior (army2, ishft (one, index))\\n skip = (new_army == army2)\\n if (skip) then\\n index = index + 1\\n else\\n bit1 = ishft (1, index / n)\\n bit2 = ishft (1, mod (index, n))\\n if (iand (rooklike11, bit1) /= 0) then\\n index = round_up_to_multiple (index + 1, n)\\n else if (iand (rooklike12, bit2) /= 0) then\\n index = index + 1\\n else if (bishops_attack_check (army1, new_army)) then\\n index = index + 1\\n else\\n call solve (army1, rooklike11, rooklike12, &\\n & new_army, &\\n & ior (rooklike21, bit1), &\\n & ior (rooklike22, bit2), &\\n & 0)\\n index = index + 1\\n end if\\n end if\\n end do\\n end if\\n end subroutine solve\\n\\n subroutine optionally_write_equivalents\\n integer :: i\\n\\n if (show_equivalents) then\\n write (unit, '(5X)', advance = 'no')\\n write (unit, '(\\\"Equivalents\\\")')\\n\\n write (unit, '(5X)', advance = 'no')\\n call write_board (unit, armies2(1, num_solutions), armies1(1, num_solutions), 5)\\n write (unit, '()')\\n write (unit, '()')\\n\\n do i = 2, 5\\n if (all ((armies1(i, num_solutions) /= armies1(1 : i - 1, num_solutions) .or. &\\n & armies2(i, num_solutions) /= armies2(1 : i - 1, num_solutions)) .and. &\\n & (armies2(i, num_solutions) /= armies1(1 : i - 1, num_solutions) .or. &\\n & armies1(i, num_solutions) /= armies2(1 : i - 1, num_solutions)))) then\\n write (unit, '(5X)', advance = 'no')\\n call write_board (unit, armies1(i, num_solutions), armies2(i, num_solutions), 5)\\n write (unit, '()')\\n write (unit, '()')\\n write (unit, '(5X)', advance = 'no')\\n call write_board (unit, armies2(i, num_solutions), armies1(i, num_solutions), 5)\\n write (unit, '()')\\n write (unit, '()')\\n end if\\n end do\\n end if\\n end subroutine optionally_write_equivalents\\n\\n end subroutine solve_peaceful_queens\\n\\n elemental function round_up_to_multiple (x, n) result (y)\\n integer, value :: x, n\\n integer :: y\\n\\n y = x + mod (n - mod (x, n), n)\\n end function round_up_to_multiple\\n\\n pure function is_a_duplicate (army1, army2, num_solutions, armies1, armies2) result (is_dup)\\n integer(kind = board_kind), intent(in) :: army1, army2\\n integer, intent(in) :: num_solutions\\n integer(kind = board_kind), intent(in) :: armies1(1:8, 1:max_solutions)\\n integer(kind = board_kind), intent(in) :: armies2(1:8, 1:max_solutions)\\n logical :: is_dup\\n\\n is_dup = any ((army1 == armies1(:, 1:num_solutions) .and. &\\n & army2 == armies2(:, 1:num_solutions)) .or. &\\n & (army2 == armies1(:, 1:num_solutions) .and. &\\n & army1 == armies2(:, 1:num_solutions)))\\n end function is_a_duplicate\\n\\nend module peaceful_queens_solver\\n\\nprogram peaceful_queens\\n use, intrinsic :: iso_fortran_env, only: output_unit\\n use, non_intrinsic :: peaceful_queens_elements\\n use, non_intrinsic :: peaceful_queens_support\\n use, non_intrinsic :: peaceful_queens_solver\\n\\n implicit none\\n\\n integer :: num_solutions\\n logical :: show_equivalents\\n integer(kind = board_kind) :: armies1(1:8, 1:max_solutions)\\n integer(kind = board_kind) :: armies2(1:8, 1:max_solutions)\\n\\n integer :: arg_count\\n character(len = 200) :: arg\\n\\n show_equivalents = .false.\\n\\n arg_count = command_argument_count ()\\n if (1 <= arg_count) then\\n call get_command_argument (1, arg)\\n select case (trim (arg))\\n case ('1', 't', 'T', 'true', 'y', 'Y', 'yes')\\n show_equivalents = .true.\\n end select\\n end if\\n\\n call solve_peaceful_queens (output_unit, show_equivalents, &\\n & num_solutions, armies1, armies2)\\n\\nend program peaceful_queens\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"#!/bin/sh\\n#\\n# Driver script for peaceful_queens in Fortran.\\n#\\n\\nif test ${ZSH_VERSION+y} && (emulate sh) >/dev/null 2>&1; then\\n emulate sh\\nfi\\n\\nif test $# -ne 3 && test $# -ne 4; then\\n echo \\\"Usage: $0 M N MAX_SOLUTIONS [SHOW_EQUIVALENTS]\\\"\\n exit 1\\nfi\\n\\nM=${1}\\nN=${2}\\nMAX_SOLUTIONS=${3}\\nSHOW_EQUIVALENTS=${4}\\n\\nRM_GENERATED_SRC=yes\\nCHECK=no\\n\\ncase ${CHECK} in\\n 0 | f | F | false | N | n | no) FCCHECK=\\\"\\\" ;;\\n 1 | t | T | true | Y | y | yes) FCCHECK=\\\"-fcheck=all\\\" ;;\\n *) echo 'CHECK is set incorrectly';\\n exit 1 ;;\\nesac\\n\\nFC=\\\"gfortran\\\"\\nFCFLAGS=\\\"-std=f2018 -g -O3 -march=native -fno-stack-protector -Wall -Wextra ${FCCHECK}\\\"\\n\\n# If you have the graphite optimizer, here are some marginally helpful\\n# flags. They barely make a difference, for me.\\nFCFLAGS=\\\"${FCFLAGS} -funroll-loops -floop-nest-optimize\\\"\\n\\nRUN_IT=\\\"yes\\\"\\n\\n${FC} -o peaceful_queens_elements_generator peaceful_queens_elements_generator.f90 &&\\n ./peaceful_queens_elements_generator ${M} ${N} ${MAX_SOLUTIONS} > peaceful_queens_elements.f90 &&\\n ${FC} ${FCFLAGS} -c peaceful_queens_elements.f90 &&\\n if test x\\\"${RM_GENERATED_SRC}\\\" != xno; then rm -f peaceful_queens_elements.f90; fi &&\\n ${FC} ${FCFLAGS} -c peaceful_queens.f90 &&\\n ${FC} ${FCFLAGS} -o peaceful_queens peaceful_queens_elements.o peaceful_queens.o &&\\n if test x\\\"${RUN_IT}\\\" = xyes; then time ./peaceful_queens ${SHOW_EQUIVALENTS}; else :; fi\\n\",\n \"language\": \"Fortran\"\n },\n {\n \"code\": \"Type posicion\\n x As Integer\\n y As Integer\\nEnd Type\\n\\nType pieza\\n empty As Integer\\n black As Integer\\n white As Integer\\nEnd Type\\n\\nFunction isAttacking(q As posicion, posic As posicion) As Integer\\n Return (q.x = posic.x Or q.y = posic.y Or Abs(q.x - posic.x) = Abs(q.y - posic.y))\\nEnd Function\\n\\nSub place(m As Integer, n As Integer, blackQueens() As posicion, whiteQueens() As posicion, Byref result As Integer)\\n If m = 0 Then\\n result = -1\\n Exit Sub\\n End If\\n Dim As Integer placingBlack = -1\\n Dim As Integer i, j, k, equalposicion\\n Dim As Boolean inner\\n\\n For i = 0 To n-1\\n For j = 0 To n-1\\n Dim As posicion posic = Type<posicion>(i, j)\\n inner = False\\n For k = Lbound(blackQueens) To Ubound(blackQueens)\\n equalposicion = (blackQueens(k).x = posic.x And blackQueens(k).y = posic.y)\\n If equalposicion Or (Not placingBlack And isAttacking(blackQueens(k), posic)) Then\\n inner = True\\n Exit For\\n End If\\n Next\\n If Not inner Then\\n For k = Lbound(whiteQueens) To Ubound(whiteQueens)\\n equalposicion = (whiteQueens(k).x = posic.x And whiteQueens(k).y = posic.y)\\n If equalposicion Or (placingBlack And isAttacking(whiteQueens(k), posic)) Then\\n inner = True\\n Exit For\\n End If\\n Next\\n If Not inner Then\\n If placingBlack Then\\n Redim Preserve blackQueens(Ubound(blackQueens) + 1)\\n blackQueens(Ubound(blackQueens)) = posic\\n placingBlack = 0\\n Else\\n Redim Preserve whiteQueens(Ubound(whiteQueens) + 1)\\n whiteQueens(Ubound(whiteQueens)) = posic\\n place(m-1, n, blackQueens(), whiteQueens(), result)\\n If result Then Exit Sub\\n Redim Preserve blackQueens(Ubound(blackQueens) - 1)\\n Redim Preserve whiteQueens(Ubound(whiteQueens) - 1)\\n placingBlack = -1\\n End If\\n End If\\n End If\\n Next\\n Next\\n If Not placingBlack Then Redim Preserve blackQueens(Ubound(blackQueens) - 1)\\n result = 0\\nEnd Sub\\n\\nSub printBoard(n As Integer, blackQueens() As posicion, whiteQueens() As posicion)\\n Dim As Integer board(n * n)\\n Dim As Integer i, j, k\\n\\n For i = Lbound(blackQueens) To Ubound(blackQueens)\\n board(blackQueens(i).x * n + blackQueens(i).y) = 1\\n Next\\n For i = Lbound(whiteQueens) To Ubound(whiteQueens)\\n board(whiteQueens(i).x * n + whiteQueens(i).y) = 2\\n Next\\n For i = 0 To n*n-1\\n If i Mod n = 0 And i <> 0 Then Print\\n Select Case board(i)\\n Case 1\\n Print \\\"B \\\";\\n Case 2\\n Print \\\"W \\\";\\n Case Else\\n j = i \\\\ n\\n k = i - j * n\\n If j Mod 2 = k Mod 2 Then\\n Print Chr(253); \\\" \\\";\\n Else\\n Print Chr(252); \\\" \\\";\\n End If\\n End Select\\n Next i\\n Print\\nEnd Sub\\n\\nDim As posicion nms(23) = { _\\nType<posicion>(2, 1), Type<posicion>(3, 1), Type<posicion>(3, 2), Type<posicion>(4, 1), Type<posicion>(4, 2), Type<posicion>(4, 3), _\\nType<posicion>(5, 1), Type<posicion>(5, 2), Type<posicion>(5, 3), Type<posicion>(5, 4), Type<posicion>(5, 5), _\\nType<posicion>(6, 1), Type<posicion>(6, 2), Type<posicion>(6, 3), Type<posicion>(6, 4), Type<posicion>(6, 5), Type<posicion>(6, 6), _\\nType<posicion>(7, 1), Type<posicion>(7, 2), Type<posicion>(7, 3), Type<posicion>(7, 4), Type<posicion>(7, 5), Type<posicion>(7, 6), Type<posicion>(7, 7) }\\n\\nFor i As Integer = Lbound(nms) To Ubound(nms)\\n Print Chr(10); nms(i).y; \\\" black and \\\"; nms(i).y; \\\" white queens on a \\\"; nms(i).x; \\\" x \\\"; nms(i).x; \\\" board:\\\"\\n Dim As posicion blackQueens(0)\\n Dim As posicion whiteQueens(0)\\n Dim As Integer result\\n place(nms(i).y, nms(i).x, blackQueens(), whiteQueens(), result)\\n If result Then\\n printBoard(nms(i).x, blackQueens(), whiteQueens())\\n Else\\n Print \\\"No solution exists.\\\"\\n End If\\nNext i\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"fmt\\\"\\n\\nconst (\\n empty = iota\\n black\\n white\\n)\\n\\nconst (\\n bqueen = 'B'\\n wqueen = 'W'\\n bbullet = '•'\\n wbullet = '◦'\\n)\\n\\ntype position struct{ i, j int }\\n\\nfunc iabs(i int) int {\\n if i < 0 {\\n return -i\\n }\\n return i\\n}\\n\\nfunc place(m, n int, pBlackQueens, pWhiteQueens *[]position) bool {\\n if m == 0 {\\n return true\\n }\\n placingBlack := true\\n for i := 0; i < n; i++ {\\n inner:\\n for j := 0; j < n; j++ {\\n pos := position{i, j}\\n for _, queen := range *pBlackQueens {\\n if queen == pos || !placingBlack && isAttacking(queen, pos) {\\n continue inner\\n }\\n }\\n for _, queen := range *pWhiteQueens {\\n if queen == pos || placingBlack && isAttacking(queen, pos) {\\n continue inner\\n }\\n }\\n if placingBlack {\\n *pBlackQueens = append(*pBlackQueens, pos)\\n placingBlack = false\\n } else {\\n *pWhiteQueens = append(*pWhiteQueens, pos)\\n if place(m-1, n, pBlackQueens, pWhiteQueens) {\\n return true\\n }\\n *pBlackQueens = (*pBlackQueens)[0 : len(*pBlackQueens)-1]\\n *pWhiteQueens = (*pWhiteQueens)[0 : len(*pWhiteQueens)-1]\\n placingBlack = true\\n }\\n }\\n }\\n if !placingBlack {\\n *pBlackQueens = (*pBlackQueens)[0 : len(*pBlackQueens)-1]\\n }\\n return false\\n}\\n\\nfunc isAttacking(queen, pos position) bool {\\n if queen.i == pos.i {\\n return true\\n }\\n if queen.j == pos.j {\\n return true\\n }\\n if iabs(queen.i-pos.i) == iabs(queen.j-pos.j) {\\n return true\\n }\\n return false\\n}\\n\\nfunc printBoard(n int, blackQueens, whiteQueens []position) {\\n board := make([]int, n*n)\\n for _, queen := range blackQueens {\\n board[queen.i*n+queen.j] = black\\n }\\n for _, queen := range whiteQueens {\\n board[queen.i*n+queen.j] = white\\n }\\n\\n for i, b := range board {\\n if i != 0 && i%n == 0 {\\n fmt.Println()\\n }\\n switch b {\\n case black:\\n fmt.Printf(\\\"%c \\\", bqueen)\\n case white:\\n fmt.Printf(\\\"%c \\\", wqueen)\\n case empty:\\n if i%2 == 0 {\\n fmt.Printf(\\\"%c \\\", bbullet)\\n } else {\\n fmt.Printf(\\\"%c \\\", wbullet)\\n }\\n }\\n }\\n fmt.Println(\\\"\\\\n\\\")\\n}\\n\\nfunc main() {\\n nms := [][2]int{\\n {2, 1}, {3, 1}, {3, 2}, {4, 1}, {4, 2}, {4, 3},\\n {5, 1}, {5, 2}, {5, 3}, {5, 4}, {5, 5},\\n {6, 1}, {6, 2}, {6, 3}, {6, 4}, {6, 5}, {6, 6},\\n {7, 1}, {7, 2}, {7, 3}, {7, 4}, {7, 5}, {7, 6}, {7, 7},\\n }\\n for _, nm := range nms {\\n n, m := nm[0], nm[1]\\n fmt.Printf(\\\"%d black and %d white queens on a %d x %d board:\\\\n\\\", m, m, n, n)\\n var blackQueens, whiteQueens []position\\n if place(m, n, &blackQueens, &whiteQueens) {\\n printBoard(n, blackQueens, whiteQueens)\\n } else {\\n fmt.Println(\\\"No solution exists.\\\\n\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import java.util.ArrayList;\\nimport java.util.Arrays;\\nimport java.util.List;\\n\\npublic class Peaceful {\\n enum Piece {\\n Empty,\\n Black,\\n White,\\n }\\n\\n public static class Position {\\n public int x, y;\\n\\n public Position(int x, int y) {\\n this.x = x;\\n this.y = y;\\n }\\n\\n @Override\\n public boolean equals(Object obj) {\\n if (obj instanceof Position) {\\n Position pos = (Position) obj;\\n return pos.x == x && pos.y == y;\\n }\\n return false;\\n }\\n }\\n\\n private static boolean place(int m, int n, List<Position> pBlackQueens, List<Position> pWhiteQueens) {\\n if (m == 0) {\\n return true;\\n }\\n boolean placingBlack = true;\\n for (int i = 0; i < n; ++i) {\\n inner:\\n for (int j = 0; j < n; ++j) {\\n Position pos = new Position(i, j);\\n for (Position queen : pBlackQueens) {\\n if (pos.equals(queen) || !placingBlack && isAttacking(queen, pos)) {\\n continue inner;\\n }\\n }\\n for (Position queen : pWhiteQueens) {\\n if (pos.equals(queen) || placingBlack && isAttacking(queen, pos)) {\\n continue inner;\\n }\\n }\\n if (placingBlack) {\\n pBlackQueens.add(pos);\\n placingBlack = false;\\n } else {\\n pWhiteQueens.add(pos);\\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true;\\n }\\n pBlackQueens.remove(pBlackQueens.size() - 1);\\n pWhiteQueens.remove(pWhiteQueens.size() - 1);\\n placingBlack = true;\\n }\\n }\\n }\\n if (!placingBlack) {\\n pBlackQueens.remove(pBlackQueens.size() - 1);\\n }\\n return false;\\n }\\n\\n private static boolean isAttacking(Position queen, Position pos) {\\n return queen.x == pos.x\\n || queen.y == pos.y\\n || Math.abs(queen.x - pos.x) == Math.abs(queen.y - pos.y);\\n }\\n\\n private static void printBoard(int n, List<Position> blackQueens, List<Position> whiteQueens) {\\n Piece[] board = new Piece[n * n];\\n Arrays.fill(board, Piece.Empty);\\n\\n for (Position queen : blackQueens) {\\n board[queen.x + n * queen.y] = Piece.Black;\\n }\\n for (Position queen : whiteQueens) {\\n board[queen.x + n * queen.y] = Piece.White;\\n }\\n for (int i = 0; i < board.length; ++i) {\\n if ((i != 0) && i % n == 0) {\\n System.out.println();\\n }\\n\\n Piece b = board[i];\\n if (b == Piece.Black) {\\n System.out.print(\\\"B \\\");\\n } else if (b == Piece.White) {\\n System.out.print(\\\"W \\\");\\n } else {\\n int j = i / n;\\n int k = i - j * n;\\n if (j % 2 == k % 2) {\\n System.out.print(\\\"• \\\");\\n } else {\\n System.out.print(\\\"◦ \\\");\\n }\\n }\\n }\\n System.out.println('\\\\n');\\n }\\n\\n public static void main(String[] args) {\\n List<Position> nms = List.of(\\n new Position(2, 1),\\n new Position(3, 1),\\n new Position(3, 2),\\n new Position(4, 1),\\n new Position(4, 2),\\n new Position(4, 3),\\n new Position(5, 1),\\n new Position(5, 2),\\n new Position(5, 3),\\n new Position(5, 4),\\n new Position(5, 5),\\n new Position(6, 1),\\n new Position(6, 2),\\n new Position(6, 3),\\n new Position(6, 4),\\n new Position(6, 5),\\n new Position(6, 6),\\n new Position(7, 1),\\n new Position(7, 2),\\n new Position(7, 3),\\n new Position(7, 4),\\n new Position(7, 5),\\n new Position(7, 6),\\n new Position(7, 7)\\n );\\n for (Position nm : nms) {\\n int m = nm.y;\\n int n = nm.x;\\n System.out.printf(\\\"%d black and %d white queens on a %d x %d board:\\\\n\\\", m, m, n, n);\\n List<Position> blackQueens = new ArrayList<>();\\n List<Position> whiteQueens = new ArrayList<>();\\n if (place(m, n, blackQueens, whiteQueens)) {\\n printBoard(n, blackQueens, whiteQueens);\\n } else {\\n System.out.println(\\\"No solution exists.\\\\n\\\");\\n }\\n }\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Gtk\\n\\nstruct Position\\n row::Int\\n col::Int\\nend\\n\\nfunction place!(numeach, bsize, bqueens, wqueens)\\n isattack(q, pos) = (q.row == pos.row || q.col == pos.col ||\\n abs(q.row - pos.row) == abs(q.col - pos.col))\\n noattack(qs, pos) = !any(x -> isattack(x, pos), qs)\\n positionopen(bqs, wqs, p) = !any(x -> x == p, bqs) && !any(x -> x == p, wqs)\\n\\n placingbqueens = true\\n if numeach < 1\\n return true\\n end\\n for i in 1:bsize, j in 1:bsize\\n bpos = Position(i, j)\\n if positionopen(bqueens, wqueens, bpos)\\n if placingbqueens && noattack(wqueens, bpos)\\n push!(bqueens, bpos)\\n placingbqueens = false\\n elseif !placingbqueens && noattack(bqueens, bpos)\\n push!(wqueens, bpos)\\n if place!(numeach - 1, bsize, bqueens, wqueens)\\n return true\\n end\\n pop!(bqueens)\\n pop!(wqueens)\\n placingbqueens = true\\n end\\n end\\n end\\n if !placingbqueens\\n pop!(bqueens)\\n end\\n false\\nend\\n\\nfunction peacefulqueenapp()\\n win = GtkWindow(\\\"Peaceful Chess Queen Armies\\\", 800, 800) |> (GtkFrame() |> (box = GtkBox(:v)))\\n boardsize = 5\\n numqueenseach = 4\\n hbox = GtkBox(:h)\\n boardscale = GtkScale(false, 2:16)\\n set_gtk_property!(boardscale, :hexpand, true)\\n blabel = GtkLabel(\\\"Choose Board Size\\\")\\n nqueenscale = GtkScale(false, 1:24)\\n set_gtk_property!(nqueenscale, :hexpand, true)\\n qlabel = GtkLabel(\\\"Choose Number of Queens Per Side\\\")\\n solveit = GtkButton(\\\"Solve\\\")\\n set_gtk_property!(solveit, :label, \\\" Solve \\\")\\n solvequeens(wid) = (boardsize = Int(GAccessor.value(boardscale));\\n numqueenseach = Int(GAccessor.value(nqueenscale)); update!())\\n signal_connect(solvequeens, solveit, :clicked)\\n map(w->push!(hbox, w),[blabel, boardscale, qlabel, nqueenscale, solveit])\\n scrwin = GtkScrolledWindow()\\n grid = GtkGrid()\\n push!(scrwin, grid)\\n map(w -> push!(box, w),[hbox, scrwin])\\n piece = (white = \\\"\\\\u2655\\\", black = \\\"\\\\u265B\\\", blank = \\\" \\\")\\n stylist = GtkStyleProvider(Gtk.CssProviderLeaf(data=\\\"\\\"\\\"\\n label {background-image: image(cornsilk); font-size: 48px;}\\n button {background-image: image(tan); font-size: 48px;}\\\"\\\"\\\"))\\n\\n function update!()\\n bqueens, wqueens = Vector{Position}(), Vector{Position}()\\n place!(numqueenseach, boardsize, bqueens, wqueens)\\n if length(bqueens) == 0\\n warn_dialog(\\\"No solution for board size $boardsize and $numqueenseach queens each.\\\", win)\\n return\\n end\\n empty!(grid)\\n labels = Array{Gtk.GtkLabelLeaf, 2}(undef, (boardsize, boardsize))\\n buttons = Array{GtkButtonLeaf, 2}(undef, (boardsize, boardsize))\\n for i in 1:boardsize, j in 1:boardsize\\n if isodd(i + j)\\n grid[i, j] = buttons[i, j] = GtkButton(piece.blank)\\n set_gtk_property!(buttons[i, j], :expand, true)\\n push!(Gtk.GAccessor.style_context(buttons[i, j]), stylist, 600)\\n else\\n grid[i, j] = labels[i, j] = GtkLabel(piece.blank)\\n set_gtk_property!(labels[i, j], :expand, true)\\n push!(Gtk.GAccessor.style_context(labels[i, j]), stylist, 600)\\n end\\n pos = Position(i, j)\\n if pos in bqueens\\n set_gtk_property!(grid[i, j], :label, piece.black)\\n elseif pos in wqueens\\n set_gtk_property!(grid[i, j], :label, piece.white)\\n end\\n end\\n showall(win)\\n end\\n\\n update!()\\n cond = Condition()\\n endit(w) = notify(cond)\\n signal_connect(endit, win, :destroy)\\n showall(win)\\n wait(cond)\\nend\\n\\npeacefulqueenapp()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"import kotlin.math.abs\\n\\nenum class Piece {\\n Empty,\\n Black,\\n White,\\n}\\n\\ntypealias Position = Pair<Int, Int>\\n\\nfun place(m: Int, n: Int, pBlackQueens: MutableList<Position>, pWhiteQueens: MutableList<Position>): Boolean {\\n if (m == 0) {\\n return true\\n }\\n var placingBlack = true\\n for (i in 0 until n) {\\n inner@\\n for (j in 0 until n) {\\n val pos = Position(i, j)\\n for (queen in pBlackQueens) {\\n if (queen == pos || !placingBlack && isAttacking(queen, pos)) {\\n continue@inner\\n }\\n }\\n for (queen in pWhiteQueens) {\\n if (queen == pos || placingBlack && isAttacking(queen, pos)) {\\n continue@inner\\n }\\n }\\n placingBlack = if (placingBlack) {\\n pBlackQueens.add(pos)\\n false\\n } else {\\n pWhiteQueens.add(pos)\\n if (place(m - 1, n, pBlackQueens, pWhiteQueens)) {\\n return true\\n }\\n pBlackQueens.removeAt(pBlackQueens.lastIndex)\\n pWhiteQueens.removeAt(pWhiteQueens.lastIndex)\\n true\\n }\\n }\\n }\\n if (!placingBlack) {\\n pBlackQueens.removeAt(pBlackQueens.lastIndex)\\n }\\n return false\\n}\\n\\nfun isAttacking(queen: Position, pos: Position): Boolean {\\n return queen.first == pos.first\\n || queen.second == pos.second\\n || abs(queen.first - pos.first) == abs(queen.second - pos.second)\\n}\\n\\nfun printBoard(n: Int, blackQueens: List<Position>, whiteQueens: List<Position>) {\\n val board = MutableList(n * n) { Piece.Empty }\\n\\n for (queen in blackQueens) {\\n board[queen.first * n + queen.second] = Piece.Black\\n }\\n for (queen in whiteQueens) {\\n board[queen.first * n + queen.second] = Piece.White\\n }\\n for ((i, b) in board.withIndex()) {\\n if (i != 0 && i % n == 0) {\\n println()\\n }\\n if (b == Piece.Black) {\\n print(\\\"B \\\")\\n } else if (b == Piece.White) {\\n print(\\\"W \\\")\\n } else {\\n val j = i / n\\n val k = i - j * n\\n if (j % 2 == k % 2) {\\n print(\\\"• \\\")\\n } else {\\n print(\\\"◦ \\\")\\n }\\n }\\n }\\n println('\\\\n')\\n}\\n\\nfun main() {\\n val nms = listOf(\\n Pair(2, 1), Pair(3, 1), Pair(3, 2), Pair(4, 1), Pair(4, 2), Pair(4, 3),\\n Pair(5, 1), Pair(5, 2), Pair(5, 3), Pair(5, 4), Pair(5, 5),\\n Pair(6, 1), Pair(6, 2), Pair(6, 3), Pair(6, 4), Pair(6, 5), Pair(6, 6),\\n Pair(7, 1), Pair(7, 2), Pair(7, 3), Pair(7, 4), Pair(7, 5), Pair(7, 6), Pair(7, 7)\\n )\\n for ((n, m) in nms) {\\n println(\\\"$m black and $m white queens on a $n x $n board:\\\")\\n val blackQueens = mutableListOf<Position>()\\n val whiteQueens = mutableListOf<Position>()\\n if (place(m, n, blackQueens, whiteQueens)) {\\n printBoard(n, blackQueens, whiteQueens)\\n } else {\\n println(\\\"No solution exists.\\\\n\\\")\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"ClearAll[ValidSpots, VisibleByQueen, SolveQueen, GetSolution]\\nVisualizeState[state_] := Module[{q, cells},\\n q = MapIndexed[If[#[\\\"q\\\"] == -1, {}, Text[Style[#[\\\"q\\\"], 24], #2]] &, state, {2}];\\n cells = MapIndexed[{If[OddQ[Total[#2]], FaceForm[],\\n FaceForm[GrayLevel[0.8]]], EdgeForm[Black],\\n Rectangle[#2 - 0.5, #2 + 0.5]} &, state, {2}];\\n Graphics[{cells, q}]\\n ]\\nValidSpots[state_, tp_Integer] := Module[{vals},\\n vals = Catenate@MapIndexed[If[#1[\\\"q\\\"] == -1 \\\\[And] DeleteCases[#1[\\\"v\\\"], tp] == {}, #2, Missing[]] &, state, {2}];\\n DeleteMissing[vals]\\n ]\\nVisibleByQueen[{i_, j_}, {a_, b_}] := i == a \\\\[Or] j == b \\\\[Or] i + j == a + b \\\\[Or] i - j == a - b\\nPlaceQueen[state_, pos : {i_Integer, j_Integer}, tp_Integer] := Module[{vals, out},\\n out = state;\\n out[[i, j]] = Association[out[[i, j]], \\\"q\\\" -> tp];\\n out = MapIndexed[If[VisibleByQueen[{i, j}, #2], <|#1, \\\"v\\\" -> Append[#1[\\\"v\\\"], tp]|>, #1] &, out, {2}];\\n out\\n ]\\nSolveQueen[state_, toplace_List] :=\\n Module[{len = Length[toplace], next, valid, newstate},\\n If[len == 0,\\n Print[VisualizeState@state];\\n Print[StringRiffle[StringJoin /@ Map[ToString, state[[All, All, \\\"q\\\"]] /. -1 -> \\\".\\\", {2}], \\\"\\\\n\\\"]];\\n Abort[];\\n ,\\n next = First[toplace];\\n valid = ValidSpots[state, next];\\n Do[\\n newstate = PlaceQueen[state, v, next];\\n SolveQueen[newstate, Rest[toplace]]\\n ,\\n {v, valid}\\n ]\\n ]\\n ]\\nGetSolution[n_Integer?Positive, m_Integer?Positive, numcol_ : 2] :=\\n Module[{state, tp},\\n state = ConstantArray[<|\\\"q\\\" -> -1, \\\"v\\\" -> {}|>, {n, n}];\\n tp = Flatten[Transpose[ConstantArray[#, m] & /@ Range[numcol]]];\\n SolveQueen[state, tp]\\n ]\\nGetSolution[8, 4, 3](* Solves placing 3 armies of each 4 queens on an 8*8 board*)\\nGetSolution[5, 4, 2](* Solves placing 2 armies of each 4 queens on an 5*5 board*)\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import sequtils, strformat\\n\\ntype\\n\\n Piece {.pure.} = enum Empty, Black, White\\n Position = tuple[x, y: int]\\n\\n\\nfunc isAttacking(queen, pos: Position): bool =\\n queen.x == pos.x or queen.y == pos.y or abs(queen.x - pos.x) == abs(queen.y - pos.y)\\n\\n\\nfunc place(m, n: int; blackQueens, whiteQueens: var seq[Position]): bool =\\n\\n if m == 0: return true\\n\\n var placingBlack = true\\n for i in 0..<n:\\n for j in 0..<n:\\n\\n block inner:\\n let pos: Position = (i, j)\\n for queen in blackQueens:\\n if queen == pos or not placingBlack and queen.isAttacking(pos):\\n break inner\\n for queen in whiteQueens:\\n if queen == pos or placingBlack and queen.isAttacking(pos):\\n break inner\\n\\n if placingBlack:\\n blackQueens.add pos\\n else:\\n whiteQueens.add pos\\n if place(m - 1, n, blackQueens, whiteQueens): return true\\n discard blackQueens.pop()\\n discard whiteQueens.pop()\\n placingBlack = not placingBlack\\n\\n if not placingBlack:\\n discard blackQueens.pop()\\n\\n\\nproc printBoard(n: int; blackQueens, whiteQueens: seq[Position]) =\\n\\n var board = newSeqWith(n, newSeq[Piece](n)) # Initialized to Empty.\\n\\n for queen in blackQueens:\\n board[queen.x][queen.y] = Black\\n for queen in whiteQueens:\\n board[queen.x][queen.y] = White\\n\\n for i in 0..<n:\\n for j in 0..<n:\\n stdout.write case board[i][j]\\n of Black: \\\"B \\\"\\n of White: \\\"W \\\"\\n of Empty: (if (i and 1) == (j and 1): \\\"• \\\" else: \\\"◦ \\\")\\n stdout.write '\\\\n'\\n\\n echo \\\"\\\"\\n\\n\\nconst Nms = [(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)]\\n\\nfor (n, m) in Nms:\\n echo &\\\"{m} black and {m} white queens on a {n} x {n} board:\\\"\\n var blackQueens, whiteQueens: seq[Position]\\n if place(m, n, blackQueens, whiteQueens):\\n printBoard(n, blackQueens, whiteQueens)\\n else:\\n echo \\\"No solution exists.\\\\n\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\n\\nmy $m = shift // 4;\\nmy $n = shift // 5;\\nmy %seen;\\nmy $gaps = join '|', qr/-*/, map qr/.{$_}(?:-.{$_})*/s, $n-1, $n, $n+1;\\nmy $attack = qr/(\\\\w)(?:$gaps)(?!\\\\1)\\\\w/;\\n\\nplace( scalar ('-' x $n . \\\"\\\\n\\\") x $n );\\nprint \\\"No solution to $m $n\\\\n\\\";\\n\\nsub place\\n {\\n local $_ = shift;\\n $seen{$_}++ || /$attack/ and return; # previously or attack\\n (my $have = tr/WB//) < $m * 2 or exit !print \\\"Solution to $m $n\\\\n\\\\n$_\\\";\\n place( s/-\\\\G/ qw(W B)[$have % 2] /er ) while /-/g; # place next queen\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'say';\\nuse feature 'state';\\nuse utf8;\\nbinmode(STDOUT, ':utf8');\\n\\n# recursively place the next queen\\nsub place {\\n my($board, $n, $m, $empty_square) = @_;\\n state(%seen,$attack,$solution);\\n\\n # logic of 'attack' regex: queen ( ... paths between queens containing only empty squares ... ) queen of other color\\n unless ($attack) {\\n $attack =\\n '([WB])' . # 1st queen\\n '(?:' .\\n join('|',\\n \\\"[$empty_square]*\\\",\\n map {\\n \\\"(?^s:.{$_}(?:[$empty_square].{$_})*)\\\"\\n } $n-1, $n, $n+1\\n ) .\\n ')' .\\n '(?!\\\\1)[WB]'; # 2nd queen\\n }\\n\\n # pass first result found back up the stack (omit this line to get last result found)\\n return $solution if $solution;\\n\\n # bail out if seen this configuration previously, or attack detected\\n return if $seen{$board}++ or $board =~ /$attack/;\\n\\n # success if queen count is m×2\\n $solution = $board and return if $m * 2 == (my $have = $board =~ tr/WB//);\\n\\n # place the next queen (alternating colors each time)\\n place( $board =~ s/[$empty_square]\\\\G/ qw<W B>[$have % 2] /er, $n, $m, $empty_square )\\n while $board =~ /[$empty_square]/g;\\n\\n return $solution\\n}\\n\\nmy($m, $n) = $#ARGV == 1 ? @ARGV : (4, 5);\\nmy $empty_square = '◦•';\\nmy $board = join \\\"\\\\n\\\", map { substr $empty_square x $n, $_%2, $n } 1..$n;\\n\\nmy $solution = place $board, $n, $m, $empty_square;\\n\\nsay $solution\\n ? sprintf \\\"Solution to $m $n\\\\n\\\\n%s\\\", map { s/(.)/$1 /gm; s/B /♛/gm; s/W /♕/gmr } $solution\\n : \\\"No solution to $m $n\\\";\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Queen_Armies.exw\\n -- =============================\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #7060A8;\\\">requires</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"1.0.2\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (puts(fn,x,false) for p2js.js)</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">as_html</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">queens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">``</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">`♛`</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">`<font color=\\\"green\\\">♕</font>`</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #008000;\\\">`<span style=\\\"color:red\\\">?</span>`</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">showboard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">board</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">'-'</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'B'</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'W'</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">as_html</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"<br><b>## %d black and %d white queens on a %d-by-%d board</b><br>\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">}),</span>\\n <span style=\\\"color: #000000;\\\">tbl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"</span>\\n <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\"<table style=\\\\\\\"font-weight:bold\\\\\\\">\\\\n \\\"</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">tbl</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\" </tr>\\\\n <tr valign=\\\\\\\"middle\\\\\\\" align=\\\\\\\"center\\\\\\\">\\\\n\\\"</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">xw</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">xb</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">({</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">},</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)!=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">dx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">xw</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">xb</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">queens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">bg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #008000;\\\">` bgcolor=\\\"silver\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">tbl</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\" <td style=\\\\\\\"width:14pt; height:14pt;\\\\\\\"%s>%s</td>\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">bg</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">tbl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">11</span><span style=\\\"color: #0000FF;\\\">..$]</span>\\n <span style=\\\"color: #000000;\\\">out</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\" </tr>\\\\n</table>\\\\n<br>\\\\n\\\"</span>\\n <span style=\\\"color: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">out</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">b</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d black and %d white queens on a %d x %d board:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">b</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">board</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- ?{n,blackqueens, whitequeens}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">isAttacking</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">queen</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">queen</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pj</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pos</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">pi</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">pj</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">qi</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">pi</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #7060A8;\\\">abs</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">qj</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">pj</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">blackqueens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{},</span> <span style=\\\"color: #000000;\\\">whitequeens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">m</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #000000;\\\">showboard</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">placingBlack</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">queen</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">queen</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">((</span><span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">placingBlack</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">isAttacking</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">queen</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">!={}</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">queen</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">queen</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">placingBlack</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">isAttacking</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">queen</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">pos</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">exit</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">!={}</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">placingBlack</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">blackqueens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">placingBlack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">whitequeens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">blackqueens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">blackqueens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">whitequeens</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">whitequeens</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..$-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">placingBlack</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">7</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-(</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">no</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"Cannot place %d+ queen armies on a %d-by-%d board\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">m</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">as_html</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">html</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"<b># %s</b><br><br>\\\\n\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">no</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s.\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">no</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">html_header</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n <!DOCTYPE html>\\n <html lang=\\\"en\\\">\\n <head>\\n <meta charset=\\\"utf-8\\\" />\\n <meta http-equiv=\\\"Content-Type\\\" content=\\\"text/html; charset=UTF-8\\\" />\\n <title>Queen Armies</title>\\n </head>\\n <body>\\n <h2>queen armies</h2>\\n \\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- or <div style=\\\"overflow:scroll; height:250px;\\\"></span>\\n <span style=\\\"color: #000000;\\\">html_footer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n </body>\\n </html>\\n \\\"\\\"\\\"</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- or </div></span>\\n\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">as_html</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fn</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">open</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"queen_armies.html\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"w\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html_header</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">html_footer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">close</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">fn</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"See queen_armies.html\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n\\n <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #008000;\\\">\\\"done\\\"</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">wait_key</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from itertools import combinations, product, count\\nfrom functools import lru_cache, reduce\\n\\n\\n_bbullet, _wbullet = '\\\\u2022\\\\u25E6'\\n_or = set.__or__\\n\\ndef place(m, n):\\n \\\"Place m black and white queens, peacefully, on an n-by-n board\\\"\\n board = set(product(range(n), repeat=2)) # (x, y) tuples\\n placements = {frozenset(c) for c in combinations(board, m)}\\n for blacks in placements:\\n black_attacks = reduce(_or,\\n (queen_attacks_from(pos, n) for pos in blacks),\\n set())\\n for whites in {frozenset(c) # Never on blsck attacking squares\\n for c in combinations(board - black_attacks, m)}:\\n if not black_attacks & whites:\\n return blacks, whites\\n return set(), set()\\n\\n@lru_cache(maxsize=None)\\ndef queen_attacks_from(pos, n):\\n x0, y0 = pos\\n a = set([pos]) # Its position\\n a.update((x, y0) for x in range(n)) # Its row\\n a.update((x0, y) for y in range(n)) # Its column\\n # Diagonals\\n for x1 in range(n):\\n # l-to-r diag\\n y1 = y0 -x0 +x1\\n if 0 <= y1 < n:\\n a.add((x1, y1))\\n # r-to-l diag\\n y1 = y0 +x0 -x1\\n if 0 <= y1 < n:\\n a.add((x1, y1))\\n return a\\n\\ndef pboard(black_white, n):\\n \\\"Print board\\\"\\n if black_white is None:\\n blk, wht = set(), set()\\n else:\\n blk, wht = black_white\\n print(f\\\"## {len(blk)} black and {len(wht)} white queens \\\"\\n f\\\"on a {n}-by-{n} board:\\\", end='')\\n for x, y in product(range(n), repeat=2):\\n if y == 0:\\n print()\\n xy = (x, y)\\n ch = ('?' if xy in blk and xy in wht\\n else 'B' if xy in blk\\n else 'W' if xy in wht\\n else _bbullet if (x + y)%2 else _wbullet)\\n print('%s' % ch, end='')\\n print()\\n\\nif __name__ == '__main__':\\n n=2\\n for n in range(2, 7):\\n print()\\n for m in count(1):\\n ans = place(m, n)\\n if ans[0]:\\n pboard(ans, n)\\n else:\\n print (f\\\"# Can't place {m} queens on a {n}-by-{n} board\\\")\\n break\\n #\\n print('\\\\n')\\n m, n = 5, 7\\n ans = place(m, n)\\n pboard(ans, n)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"from peaceful_queen_armies_simpler import place\\nfrom itertools import product, count\\n\\n_bqueenh, _wqueenh = '♛', '<font color=\\\"green\\\">♕</font>'\\n\\ndef hboard(black_white, n):\\n \\\"HTML board generator\\\"\\n if black_white is None:\\n blk, wht = set(), set()\\n else:\\n blk, wht = black_white\\n out = (f\\\"<br><b>## {len(blk)} black and {len(wht)} white queens \\\"\\n f\\\"on a {n}-by-{n} board</b><br>\\\\n\\\")\\n out += '<table style=\\\"font-weight:bold\\\">\\\\n '\\n tbl = ''\\n for x, y in product(range(n), repeat=2):\\n if y == 0:\\n tbl += ' </tr>\\\\n <tr valign=\\\"middle\\\" align=\\\"center\\\">\\\\n'\\n xy = (x, y)\\n ch = ('<span style=\\\"color:red\\\">?</span>' if xy in blk and xy in wht\\n else _bqueenh if xy in blk\\n else _wqueenh if xy in wht\\n else \\\"\\\")\\n bg = \\\"\\\" if (x + y)%2 else ' bgcolor=\\\"silver\\\"'\\n tbl += f' <td style=\\\"width:14pt; height:14pt;\\\"{bg}>{ch}</td>\\\\n'\\n out += tbl[7:]\\n out += ' </tr>\\\\n</table>\\\\n<br>\\\\n'\\n return out\\n\\nif __name__ == '__main__':\\n n=2\\n html = ''\\n for n in range(2, 7):\\n print()\\n for m in count(1):\\n ans = place(m, n)\\n if ans[0]:\\n html += hboard(ans, n)\\n else:\\n html += (f\\\"<b># Can't place {m} queen armies on a \\\"\\n f\\\"{n}-by-{n} board</b><br><br>\\\\n\\\\n\\\" )\\n break\\n #\\n html += '<br>\\\\n'\\n m, n = 6, 7\\n ans = place(m, n)\\n html += hboard(ans, n)\\n with open('peaceful_queen_armies.htm', 'w') as f:\\n f.write(html)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"# recursively place the next queen\\nsub place ($board, $n, $m, $empty-square) {\\n my $cnt;\\n state (%seen,$attack);\\n state $solution = False;\\n\\n # logic of regex: queen ( ... paths between queens containing only empty squares ... ) queen of other color\\n once {\\n my %Q = 'WBBW'.comb; # return the queen of alternate color\\n my $re =\\n '(<[WB]>)' ~ # 1st queen\\n '[' ~\\n join(' |',\\n qq/<[$empty-square]>*/,\\n map {\\n qq/ . ** {$_}[<[$empty-square]> . ** {$_}]*/\\n }, $n-1, $n, $n+1\\n ) ~\\n ']' ~\\n '<{%Q{$0}}>'; # 2nd queen\\n $attack = \\\"rx/$re/\\\".EVAL;\\n }\\n\\n # return first result found (omit this line to get last result found)\\n return $solution if $solution;\\n\\n # bail out if seen this configuration previously, or attack detected\\n return if %seen{$board}++ or $board ~~ $attack;\\n\\n # success if queen count is m×2, set state variable and return from recursion\\n $solution = $board and return if $m * 2 == my $queens = $board.comb.Bag{<W B>}.sum;\\n\\n # place the next queen (alternating colors each time)\\n place( $board.subst( /<[◦•]>/, {<W B>[$queens % 2]}, :nth($cnt) ), $n, $m, $empty-square )\\n while $board ~~ m:nth(++$cnt)/<[◦•]>/;\\n\\n return $solution\\n}\\n\\nmy ($m, $n) = @*ARGS == 2 ?? @*ARGS !! (4, 5);\\nmy $empty-square = '◦•';\\nmy $board = ($empty-square x $n**2).comb.rotor($n)>>.join[^$n].join: \\\"\\\\n\\\";\\n\\nmy $solution = place $board, $n, $m, $empty-square;\\n\\nsay $solution\\n ?? \\\"Solution to $m $n\\\\n\\\\n{S:g/(\\\\N)/$0 / with $solution}\\\"\\n !! \\\"No solution to $m $n\\\";\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"class Position\\n attr_reader :x, :y\\n\\n def initialize(x, y)\\n @x = x\\n @y = y\\n end\\n\\n def ==(other)\\n self.x == other.x &&\\n self.y == other.y\\n end\\n\\n def to_s\\n '(%d, %d)' % [@x, @y]\\n end\\n\\n def to_str\\n to_s\\n end\\nend\\n\\ndef isAttacking(queen, pos)\\n return queen.x == pos.x ||\\n queen.y == pos.y ||\\n (queen.x - pos.x).abs() == (queen.y - pos.y).abs()\\nend\\n\\ndef place(m, n, blackQueens, whiteQueens)\\n if m == 0 then\\n return true\\n end\\n placingBlack = true\\n for i in 0 .. n-1\\n for j in 0 .. n-1\\n catch :inner do\\n pos = Position.new(i, j)\\n for queen in blackQueens\\n if pos == queen || !placingBlack && isAttacking(queen, pos) then\\n throw :inner\\n end\\n end\\n for queen in whiteQueens\\n if pos == queen || placingBlack && isAttacking(queen, pos) then\\n throw :inner\\n end\\n end\\n if placingBlack then\\n blackQueens << pos\\n placingBlack = false\\n else\\n whiteQueens << pos\\n if place(m - 1, n, blackQueens, whiteQueens) then\\n return true\\n end\\n blackQueens.pop\\n whiteQueens.pop\\n placingBlack = true\\n end\\n end\\n end\\n end\\n if !placingBlack then\\n blackQueens.pop\\n end\\n return false\\nend\\n\\ndef printBoard(n, blackQueens, whiteQueens)\\n # initialize the board\\n board = Array.new(n) { Array.new(n) { ' ' } }\\n for i in 0 .. n-1\\n for j in 0 .. n-1\\n if i % 2 == j % 2 then\\n board[i][j] = '•'\\n else\\n board[i][j] = '◦'\\n end\\n end\\n end\\n\\n # insert the queens\\n for queen in blackQueens\\n board[queen.y][queen.x] = 'B'\\n end\\n for queen in whiteQueens\\n board[queen.y][queen.x] = 'W'\\n end\\n\\n # print the board\\n for row in board\\n for cell in row\\n print cell, ' '\\n end\\n print \\\"\\\\n\\\"\\n end\\n print \\\"\\\\n\\\"\\nend\\n\\nnms = [\\n [2, 1],\\n [3, 1], [3, 2],\\n [4, 1], [4, 2], [4, 3],\\n [5, 1], [5, 2], [5, 3], [5, 4], [5, 5],\\n [6, 1], [6, 2], [6, 3], [6, 4], [6, 5], [6, 6],\\n [7, 1], [7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7]\\n]\\nfor nm in nms\\n m = nm[1]\\n n = nm[0]\\n print \\\"%d black and %d white queens on a %d x %d board:\\\\n\\\" % [m, m, n, n]\\n\\n blackQueens = []\\n whiteQueens = []\\n if place(m, n, blackQueens, whiteQueens) then\\n printBoard(n, blackQueens, whiteQueens)\\n else\\n print \\\"No solution exists.\\\\n\\\\n\\\"\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \";;;\\n;;; Solutions to the Peaceful Chess Queen Armies puzzle, in R7RS\\n;;; Scheme (using also SRFI-132).\\n;;;\\n;;; https://rosettacode.org/wiki/Peaceful_chess_queen_armies\\n;;;\\n\\n(cond-expand\\n (r7rs)\\n (chicken (import (r7rs))))\\n\\n(import (scheme process-context))\\n(import (only (srfi 132) list-sort))\\n\\n(define-record-type <&fail>\\n (make-the-one-unique-&fail-that-you-must-not-make-twice)\\n do-not-use-this:&fail?)\\n\\n(define &fail\\n (make-the-one-unique-&fail-that-you-must-not-make-twice))\\n\\n(define (failure? f)\\n (eq? f &fail))\\n\\n(define (success? f)\\n (not (failure? f)))\\n\\n(define *suspend*\\n (make-parameter (lambda (x) x)))\\n\\n(define (suspend v)\\n ((*suspend*) v))\\n\\n(define (fail-forever)\\n (let loop ()\\n (suspend &fail)\\n (loop)))\\n\\n(define (make-generator-procedure thunk)\\n ;;\\n ;; Make a suspendable procedure that takes no arguments. It is a\\n ;; simple generator of values. (One can elaborate on this to have\\n ;; the procedure accept an argument upon resumption, like an Icon\\n ;; co-expression.)\\n ;;\\n (define (next-run return)\\n (define (my-suspend v)\\n (set! return\\n (call/cc\\n (lambda (resumption-point)\\n (set! next-run resumption-point)\\n (return v)))))\\n (parameterize ((*suspend* my-suspend))\\n (suspend (thunk))\\n (fail-forever)))\\n (lambda ()\\n (call/cc next-run)))\\n\\n(define BLACK 'B)\\n(define WHITE 'W)\\n\\n(define (flip-color c)\\n (if (eq? c BLACK) WHITE BLACK))\\n\\n(define-record-type <queen>\\n (make-queen color rank file)\\n queen?\\n (color queen-color)\\n (rank queen-rank)\\n (file queen-file))\\n\\n(define (serialize-queen queen)\\n (string-append (if (eq? (queen-color queen) BLACK) \\\"B\\\" \\\"W\\\")\\n \\\"(\\\" (number->string (queen-rank queen))\\n \\\",\\\" (number->string (queen-file queen)) \\\")\\\"))\\n\\n(define (serialize-queens queens)\\n (apply string-append\\n (list-sort string<? (map serialize-queen queens))))\\n\\n(define (queens->string n queens)\\n\\n (define board\\n (let ((board (make-vector (* n n) #f)))\\n (do ((q queens (cdr q)))\\n ((null? q))\\n (let* ((color (queen-color (car q)))\\n (i (queen-rank (car q)))\\n (j (queen-file (car q))))\\n (vector-set! board (ij->index n i j) color)))\\n board))\\n\\n (define rule\\n (let ((str \\\"+\\\"))\\n (do ((j 1 (+ j 1)))\\n ((= j (+ n 1)))\\n (set! str (string-append str \\\"----+\\\")))\\n str))\\n\\n (define str \\\"\\\")\\n\\n (when (< 0 n)\\n (set! str rule)\\n (do ((i n (- i 1)))\\n ((= i 0))\\n (set! str (string-append str \\\"\\\\n\\\"))\\n (do ((j 1 (+ j 1)))\\n ((= j (+ n 1)))\\n (let* ((color (vector-ref board (ij->index n i j)))\\n (representation\\n (cond ((eq? color #f) \\\" \\\")\\n ((eq? color BLACK) \\\" B \\\")\\n ((eq? color WHITE) \\\" W \\\")\\n (else \\\" ?? \\\"))))\\n (set! str (string-append str \\\"|\\\" representation))))\\n (set! str (string-append str \\\"|\\\\n\\\" rule))))\\n str)\\n\\n(define (queen-fits-in? queen other-queens)\\n (or (null? other-queens)\\n (let ((other (car other-queens)))\\n (let ((colorq (queen-color queen))\\n (rankq (queen-rank queen))\\n (fileq (queen-file queen))\\n (coloro (queen-color other))\\n (ranko (queen-rank other))\\n (fileo (queen-file other)))\\n (if (eq? colorq coloro)\\n (and (or (not (= rankq ranko))\\n (not (= fileq fileo)))\\n (queen-fits-in? queen (cdr other-queens)))\\n (and (not (= rankq ranko))\\n (not (= fileq fileo))\\n (not (= (+ rankq fileq) (+ ranko fileo)))\\n (not (= (- rankq fileq) (- ranko fileo)))\\n (queen-fits-in? queen (cdr other-queens))))))))\\n\\n(define (latest-queen-fits-in? queens)\\n (or (null? (cdr queens))\\n (queen-fits-in? (car queens) (cdr queens))))\\n\\n(define (make-peaceful-queens-generator m n)\\n (make-generator-procedure\\n (lambda ()\\n (define solutions '())\\n\\n (let loop ((queens (list (make-queen BLACK 1 1)))\\n (num-queens 1))\\n\\n (define (add-another-queen)\\n (let ((color (flip-color (queen-color (car queens)))))\\n (loop (cons (make-queen color 1 1) queens)\\n (+ num-queens 1))))\\n\\n (define (move-a-queen)\\n (let drop-one ((queens queens)\\n (num-queens num-queens))\\n (if (zero? num-queens)\\n (loop '() 0)\\n (let* ((latest (car queens))\\n (color (queen-color latest))\\n (rank (queen-rank latest))\\n (file (queen-file latest)))\\n (if (and (= rank n) (= file n))\\n (drop-one (cdr queens) (- num-queens 1))\\n (let-values (((rank^ file^)\\n (advance-ij n rank file)))\\n (loop (cons (make-queen color rank^ file^)\\n (cdr queens))\\n num-queens)))))))\\n\\n (cond ((zero? num-queens)\\n ;; There are no more solutions.\\n &fail)\\n\\n ((latest-queen-fits-in? queens)\\n (if (= num-queens (* 2 m))\\n (let ((str (serialize-queens queens)))\\n ;; The current \\\"queens\\\" is a solution.\\n (unless (member str solutions)\\n ;; The current \\\"queens\\\" is a *new* solution.\\n (set! solutions (cons str solutions))\\n (suspend queens))\\n (move-a-queen))\\n (add-another-queen)))\\n\\n (else\\n (move-a-queen)))))))\\n\\n(define (ij->index n i j)\\n (let ((i1 (- i 1))\\n (j1 (- j 1)))\\n (+ i1 (* n j1))))\\n\\n(define (index->ij n index)\\n (let-values (((q r) (floor/ index n)))\\n (values (+ r 1) (+ q 1))))\\n\\n(define (advance-ij n i j)\\n (index->ij n (+ (ij->index n i j) 1)))\\n\\n(define args (command-line))\\n(unless (or (= (length args) 3)\\n (= (length args) 4))\\n (display \\\"Usage: \\\")\\n (display (list-ref args 0))\\n (display \\\" M N [MAX_SOLUTIONS]\\\")\\n (newline)\\n (exit 1))\\n(define m (string->number (list-ref args 1)))\\n(define n (string->number (list-ref args 2)))\\n(define max-solutions\\n (if (= (length args) 4)\\n (string->number (list-ref args 3))\\n +inf.0))\\n\\n(define generate-peaceful-queens\\n (make-peaceful-queens-generator m n))\\n\\n(let loop ((next-solution-number 1))\\n (when (<= next-solution-number max-solutions)\\n (let ((solution (generate-peaceful-queens)))\\n (when (success? solution)\\n (display \\\"Solution \\\")\\n (display next-solution-number)\\n (newline)\\n (display (queens->string n solution))\\n (newline)\\n (newline)\\n (loop (+ next-solution-number 1))))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \";;;\\n;;; Solutions to the Peaceful Chess Queen Armies puzzle, in R7RS\\n;;; Scheme. This implementation returns only one of each equivalent\\n;;; solution. See https://oeis.org/A260680\\n;;;\\n;;; I weed out equivalent solutions by comparing them tediously\\n;;; against solutions already found.\\n;;;\\n;;; (At least when compiled with CHICKEN 5.3.0, this program gets kind\\n;;; of slow for m=5, n=6, once you get past having found the 35\\n;;; non-equivalent solutions. There are still other, equivalent\\n;;; solutions to eliminate.)\\n;;;\\n;;; https://rosettacode.org/wiki/Peaceful_chess_queen_armies\\n;;;\\n\\n(cond-expand\\n (r7rs)\\n (chicken (import (r7rs))))\\n\\n(import (scheme process-context))\\n\\n(define-record-type <&fail>\\n (make-the-one-unique-&fail-that-you-must-not-make-twice)\\n do-not-use-this:&fail?)\\n\\n(define &fail\\n (make-the-one-unique-&fail-that-you-must-not-make-twice))\\n\\n(define (failure? f)\\n (eq? f &fail))\\n\\n(define (success? f)\\n (not (failure? f)))\\n\\n(define *suspend*\\n (make-parameter (lambda (x) x)))\\n\\n(define (suspend v)\\n ((*suspend*) v))\\n\\n(define (fail-forever)\\n (let loop ()\\n (suspend &fail)\\n (loop)))\\n\\n(define (make-generator-procedure thunk)\\n ;;\\n ;; Make a suspendable procedure that takes no arguments. It is a\\n ;; simple generator of values. (One can elaborate on this to have\\n ;; the procedure accept an argument upon resumption, like an Icon\\n ;; co-expression.)\\n ;;\\n (define (next-run return)\\n (define (my-suspend v)\\n (set! return\\n (call/cc\\n (lambda (resumption-point)\\n (set! next-run resumption-point)\\n (return v)))))\\n (parameterize ((*suspend* my-suspend))\\n (suspend (thunk))\\n (fail-forever)))\\n (lambda ()\\n (call/cc next-run)))\\n\\n(define (isqrt m)\\n ;; Integer Newton’s method. See\\n ;; https://en.wikipedia.org/w/index.php?title=Integer_square_root&oldid=1074473475#Using_only_integer_division\\n (let ((k (truncate-quotient m 2)))\\n (if (zero? k)\\n m\\n (let loop ((k k)\\n (k^ (truncate-quotient\\n (+ k (truncate-quotient m k)) 2)))\\n (if (< k^ k)\\n (loop k^ (truncate-quotient\\n (+ k^ (truncate-quotient m k^)) 2))\\n k)))))\\n\\n(define (ij->index n i j)\\n (let ((i1 (- i 1))\\n (j1 (- j 1)))\\n (+ i1 (* n j1))))\\n\\n(define (index->ij n index)\\n (let-values (((q r) (floor/ index n)))\\n (values (+ r 1) (+ q 1))))\\n\\n(define (advance-ij n i j)\\n (index->ij n (+ (ij->index n i j) 1)))\\n\\n(define (index-rotate90 n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n (- n j -1) i)))\\n\\n(define (index-rotate180 n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n (- n i -1) (- n j -1))))\\n\\n(define (index-rotate270 n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n j (- n i -1))))\\n\\n(define (index-reflecti n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n (- n i -1) j)))\\n\\n(define (index-reflectj n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n i (- n j -1))))\\n\\n(define (index-reflect-diag-down n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n j i)))\\n\\n(define (index-reflect-diag-up n index)\\n (let-values (((i j) (index->ij n index)))\\n (ij->index n (- n j -1) (- n i -1))))\\n\\n(define BLACK 'B)\\n(define WHITE 'W)\\n\\n(define (reverse-color c)\\n (cond ((eq? c WHITE) BLACK)\\n ((eq? c BLACK) WHITE)\\n (else c)))\\n\\n(define (pick-color-adjuster c)\\n (if (eq? c WHITE)\\n reverse-color\\n (lambda (x) x)))\\n\\n(define-record-type <queen>\\n (make-queen color rank file)\\n queen?\\n (color queen-color)\\n (rank queen-rank)\\n (file queen-file))\\n\\n(define (queens->board queens)\\n (let ((board (make-vector (* n n) #f)))\\n (do ((q queens (cdr q)))\\n ((null? q))\\n (let* ((color (queen-color (car q)))\\n (i (queen-rank (car q)))\\n (j (queen-file (car q))))\\n (vector-set! board (ij->index n i j) color)))\\n board))\\n\\n(define-syntax board-partial-equiv?\\n (syntax-rules ()\\n ((_ board1 board2 n*n n reindex recolor)\\n (let loop ((i 0))\\n (or (= i n*n)\\n (let ((color1 (vector-ref board1 i))\\n (color2 (recolor (vector-ref board2 (reindex n i)))))\\n (and (eq? color1 color2)\\n (loop (+ i 1)))))))))\\n\\n(define (board-equiv? board1 board2)\\n (define (identity x) x)\\n (define (2nd-argument n i) i)\\n (let ((n*n (vector-length board1)))\\n (or (board-partial-equiv? board1 board2 n*n #f\\n 2nd-argument identity)\\n (board-partial-equiv? board1 board2 n*n #f\\n 2nd-argument reverse-color)\\n (let ((n (isqrt n*n)))\\n (or (board-partial-equiv? board1 board2 n*n n\\n index-rotate90\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-rotate90\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-rotate180\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-rotate180\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-rotate270\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-rotate270\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflecti\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflecti\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflectj\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflectj\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflect-diag-down\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflect-diag-down\\n reverse-color)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflect-diag-up\\n identity)\\n (board-partial-equiv? board1 board2 n*n n\\n index-reflect-diag-up\\n reverse-color) )))))\\n\\n(define (queens->string n queens)\\n\\n (define board (queens->board queens))\\n\\n (define rule\\n (let ((str \\\"+\\\"))\\n (do ((j 1 (+ j 1)))\\n ((= j (+ n 1)))\\n (set! str (string-append str \\\"----+\\\")))\\n str))\\n\\n (define str \\\"\\\")\\n\\n (when (< 0 n)\\n (set! str rule)\\n (do ((i n (- i 1)))\\n ((= i 0))\\n (set! str (string-append str \\\"\\\\n\\\"))\\n (do ((j 1 (+ j 1)))\\n ((= j (+ n 1)))\\n (let* ((color (vector-ref board (ij->index n i j)))\\n (representation\\n (cond ((eq? color #f) \\\" \\\")\\n ((eq? color BLACK) \\\" B \\\")\\n ((eq? color WHITE) \\\" W \\\")\\n (else \\\" ?? \\\"))))\\n (set! str (string-append str \\\"|\\\" representation))))\\n (set! str (string-append str \\\"|\\\\n\\\" rule))))\\n str)\\n\\n(define (queen-fits-in? queen other-queens)\\n (or (null? other-queens)\\n (let ((other (car other-queens)))\\n (let ((colorq (queen-color queen))\\n (rankq (queen-rank queen))\\n (fileq (queen-file queen))\\n (coloro (queen-color other))\\n (ranko (queen-rank other))\\n (fileo (queen-file other)))\\n (if (eq? colorq coloro)\\n (and (or (not (= rankq ranko))\\n (not (= fileq fileo)))\\n (queen-fits-in? queen (cdr other-queens)))\\n (and (not (= rankq ranko))\\n (not (= fileq fileo))\\n (not (= (+ rankq fileq) (+ ranko fileo)))\\n (not (= (- rankq fileq) (- ranko fileo)))\\n (queen-fits-in? queen (cdr other-queens))))))))\\n\\n(define (latest-queen-fits-in? queens)\\n (or (null? (cdr queens))\\n (queen-fits-in? (car queens) (cdr queens))))\\n\\n(define (make-peaceful-queens-generator m n)\\n (make-generator-procedure\\n (lambda ()\\n (define solutions '())\\n\\n (let loop ((queens (list (make-queen BLACK 1 1)))\\n (num-queens 1))\\n\\n (define (add-another-queen)\\n (let ((color (reverse-color (queen-color (car queens)))))\\n (loop (cons (make-queen color 1 1) queens)\\n (+ num-queens 1))))\\n\\n (define (move-a-queen)\\n (let drop-one ((queens queens)\\n (num-queens num-queens))\\n (if (zero? num-queens)\\n (loop '() 0)\\n (let* ((latest (car queens))\\n (color (queen-color latest))\\n (rank (queen-rank latest))\\n (file (queen-file latest)))\\n (if (and (= rank n) (= file n))\\n (drop-one (cdr queens) (- num-queens 1))\\n (let-values (((rank^ file^)\\n (advance-ij n rank file)))\\n (loop (cons (make-queen color rank^ file^)\\n (cdr queens))\\n num-queens)))))))\\n\\n (cond ((zero? num-queens)\\n ;; There are no more solutions.\\n &fail)\\n\\n ((latest-queen-fits-in? queens)\\n (if (= num-queens (* 2 m))\\n (let ((board (queens->board queens)))\\n ;; The current \\\"queens\\\" is a solution.\\n (unless (member board solutions board-equiv?)\\n ;; The current \\\"queens\\\" is a *new* solution.\\n (set! solutions (cons board solutions))\\n (suspend queens))\\n (move-a-queen))\\n (add-another-queen)))\\n\\n (else\\n (move-a-queen)))))))\\n\\n(define args (command-line))\\n(unless (or (= (length args) 3)\\n (= (length args) 4))\\n (display \\\"Usage: \\\")\\n (display (list-ref args 0))\\n (display \\\" M N [MAX_SOLUTIONS]\\\")\\n (newline)\\n (exit 1))\\n(define m (string->number (list-ref args 1)))\\n(define n (string->number (list-ref args 2)))\\n(define max-solutions\\n (if (= (length args) 4)\\n (string->number (list-ref args 3))\\n +inf.0))\\n\\n(define generate-peaceful-queens\\n (make-peaceful-queens-generator m n))\\n\\n(let loop ((next-solution-number 1))\\n (when (<= next-solution-number max-solutions)\\n (let ((solution (generate-peaceful-queens)))\\n (when (success? solution)\\n (display \\\"Solution \\\")\\n (display next-solution-number)\\n (newline)\\n (display (queens->string n solution))\\n (newline)\\n (newline)\\n (loop (+ next-solution-number 1))))))\\n\",\n \"language\": \"Scheme\"\n },\n {\n \"code\": \"enum Piece {\\n case empty, black, white\\n}\\n\\ntypealias Position = (Int, Int)\\n\\nfunc place(_ m: Int, _ n: Int, pBlackQueens: inout [Position], pWhiteQueens: inout [Position]) -> Bool {\\n guard m != 0 else {\\n return true\\n }\\n\\n var placingBlack = true\\n\\n for i in 0..<n {\\n inner: for j in 0..<n {\\n let pos = (i, j)\\n\\n for queen in pBlackQueens where queen == pos || !placingBlack && isAttacking(queen, pos) {\\n continue inner\\n }\\n\\n for queen in pWhiteQueens where queen == pos || placingBlack && isAttacking(queen, pos) {\\n continue inner\\n }\\n\\n if placingBlack {\\n pBlackQueens.append(pos)\\n placingBlack = false\\n } else {\\n placingBlack = true\\n\\n pWhiteQueens.append(pos)\\n\\n if place(m - 1, n, pBlackQueens: &pBlackQueens, pWhiteQueens: &pWhiteQueens) {\\n return true\\n } else {\\n pBlackQueens.removeLast()\\n pWhiteQueens.removeLast()\\n }\\n }\\n }\\n }\\n\\n if !placingBlack {\\n pBlackQueens.removeLast()\\n }\\n\\n return false\\n}\\n\\nfunc isAttacking(_ queen: Position, _ pos: Position) -> Bool {\\n queen.0 == pos.0 || queen.1 == pos.1 || abs(queen.0 - pos.0) == abs(queen.1 - pos.1)\\n}\\n\\nfunc printBoard(n: Int, pBlackQueens: [Position], pWhiteQueens: [Position]) {\\n var board = Array(repeating: Piece.empty, count: n * n)\\n\\n for queen in pBlackQueens {\\n board[queen.0 * n + queen.1] = .black\\n }\\n\\n for queen in pWhiteQueens {\\n board[queen.0 * n + queen.1] = .white\\n }\\n\\n for (i, p) in board.enumerated() {\\n if i != 0 && i % n == 0 {\\n print()\\n }\\n\\n switch p {\\n case .black:\\n print(\\\"B \\\", terminator: \\\"\\\")\\n case .white:\\n print(\\\"W \\\", terminator: \\\"\\\")\\n case .empty:\\n let j = i / n\\n let k = i - j * n\\n\\n if j % 2 == k % 2 {\\n print(\\\"• \\\", terminator: \\\"\\\")\\n } else {\\n print(\\\"◦ \\\", terminator: \\\"\\\")\\n }\\n }\\n }\\n\\n print(\\\"\\\\n\\\")\\n}\\n\\nlet nms = [\\n (2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3),\\n (5, 1), (5, 2), (5, 3), (5, 4), (5, 5),\\n (6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6),\\n (7, 1), (7, 2), (7, 3), (7, 4), (7, 5), (7, 6), (7, 7)\\n]\\n\\nfor (n, m) in nms {\\n print(\\\"\\\\(m) black and white queens on \\\\(n) x \\\\(n) board\\\")\\n\\n var blackQueens = [Position]()\\n var whiteQueens = [Position]()\\n\\n if place(m, n, pBlackQueens: &blackQueens, pWhiteQueens: &whiteQueens) {\\n printBoard(n: n, pBlackQueens: blackQueens, pWhiteQueens: whiteQueens)\\n } else {\\n print(\\\"No solution\\\")\\n }\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"import \\\"./dynamic\\\" for Enum, Tuple\\n\\nvar Piece = Enum.create(\\\"Piece\\\", [\\\"empty\\\", \\\"black\\\", \\\"white\\\"])\\n\\nvar Pos = Tuple.create(\\\"Pos\\\", [\\\"x\\\", \\\"y\\\"])\\n\\nvar isAttacking = Fn.new { |q, pos|\\n return q.x == pos.x || q.y == pos.y || (q.x - pos.x).abs == (q.y - pos.y).abs\\n}\\n\\nvar place // recursive\\nplace = Fn.new { |m, n, blackQueens, whiteQueens|\\n if (m == 0) return true\\n var placingBlack = true\\n for (i in 0...n) {\\n for (j in 0...n) {\\n var pos = Pos.new(i, j)\\n var inner = false\\n for (queen in blackQueens) {\\n var equalPos = queen.x == pos.x && queen.y == pos.y\\n if (equalPos || !placingBlack && isAttacking.call(queen, pos)) {\\n inner = true\\n break\\n }\\n }\\n if (!inner) {\\n for (queen in whiteQueens) {\\n var equalPos = queen.x == pos.x && queen.y == pos.y\\n if (equalPos || placingBlack && isAttacking.call(queen, pos)) {\\n inner = true\\n break\\n }\\n }\\n if (!inner) {\\n if (placingBlack) {\\n blackQueens.add(pos)\\n placingBlack = false\\n } else {\\n whiteQueens.add(pos)\\n if (place.call(m-1, n, blackQueens, whiteQueens)) return true\\n blackQueens.removeAt(-1)\\n whiteQueens.removeAt(-1)\\n placingBlack = true\\n }\\n }\\n }\\n }\\n }\\n if (!placingBlack) blackQueens.removeAt(-1)\\n return false\\n}\\n\\nvar printBoard = Fn.new { |n, blackQueens, whiteQueens|\\n var board = List.filled(n * n, 0)\\n for (queen in blackQueens) board[queen.x * n + queen.y] = Piece.black\\n for (queen in whiteQueens) board[queen.x * n + queen.y] = Piece.white\\n var i = 0\\n for (b in board) {\\n if (i != 0 && i%n == 0) System.print()\\n if (b == Piece.black) {\\n System.write(\\\"B \\\")\\n } else if (b == Piece.white) {\\n System.write(\\\"W \\\")\\n } else {\\n var j = (i/n).floor\\n var k = i - j*n\\n if (j%2 == k%2) {\\n System.write(\\\"• \\\")\\n } else {\\n System.write(\\\"◦ \\\")\\n }\\n }\\n i = i + 1\\n }\\n System.print(\\\"\\\\n\\\")\\n}\\n\\nvar nms = [\\n Pos.new(2, 1), Pos.new(3, 1), Pos.new(3, 2), Pos.new(4, 1), Pos.new(4, 2), Pos.new(4, 3),\\n Pos.new(5, 1), Pos.new(5, 2), Pos.new(5, 3), Pos.new(5, 4), Pos.new(5, 5),\\n Pos.new(6, 1), Pos.new(6, 2), Pos.new(6, 3), Pos.new(6, 4), Pos.new(6, 5), Pos.new(6, 6),\\n Pos.new(7, 1), Pos.new(7, 2), Pos.new(7, 3), Pos.new(7, 4), Pos.new(7, 5), Pos.new(7, 6), Pos.new(7, 7)\\n]\\nfor (p in nms) {\\n System.print(\\\"%(p.y) black and %(p.y) white queens on a %(p.x) x %(p.x) board:\\\")\\n var blackQueens = []\\n var whiteQueens = []\\n if (place.call(p.y, p.x, blackQueens, whiteQueens)) {\\n printBoard.call(p.x, blackQueens, whiteQueens)\\n } else {\\n System.print(\\\"No solution exists.\\\\n\\\")\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn isAttacked(q, x,y) // ( (r,c), x,y ) : is queen at r,c attacked by q@(x,y)?\\n { r,c:=q; (r==x or c==y or r+c==x+y or r-c==x-y) }\\nfcn isSafe(r,c,qs) // queen safe at (r,c)?, qs=( (r,c),(r,c)..)\\n { ( not qs.filter1(isAttacked,r,c) ) }\\nfcn isEmpty(r,c,qs){ (not (qs and qs.filter1('wrap([(x,y)]){ r==x and c==y })) ) }\\nfcn _peacefulQueens(N,M,qa,qb){ //--> False | (True,((r,c)..),((r,c)..) )\\n // qa,qb --> // ( (r,c),(r,c).. ), solution so far to last good spot\\n if(qa.len()==M==qb.len()) return(True,qa,qb);\\n n, x,y := N, 0,0;\\n if(qa) x,y = qa[-1]; else n=(N+1)/2; // first queen, first quadrant only\\n foreach r in ([x..n-1]){\\n foreach c in ([y..n-1]){\\n\\t if(isEmpty(r,c,qa) and isSafe(r,c,qb)){\\n\\t qc,qd := qa.append(T(r,c)), self.fcn(N,M, qb,qc);\\n\\t if(qd) return( if(qd[0]==True) qd else T(qc,qd) );\\n\\t }\\n }\\n y=0\\n }\\n False\\n}\\n\\nfcn peacefulQueens(N=5,M=4){ # NxN board, M white and black queens\\n qs:=_peacefulQueens(N,M, T,T);\\n println(\\\"Solution for %dx%d board with %d black and %d white queens:\\\".fmt(N,N,M,M));\\n if(not qs)println(\\\"None\\\");\\n else{\\n z:=Data(Void,\\\"-\\\"*N*N);\\n foreach r,c in (qs[1]){ z[r*N + c]=\\\"W\\\" }\\n foreach r,c in (qs[2]){ z[r*N + c]=\\\"B\\\" }\\n z.text.pump(Void,T(Void.Read,N-1),\\\"println\\\");\\n }\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"peacefulQueens();\\nforeach n in ([4..10]){ peacefulQueens(n,n) }\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Peaceful-chess-queen-armies"}}},{"rowIdx":1494,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Peano_curve\nnote: Fractals\n","language":"00-META"},{"code":"<br/>\n;Task\n\nProduce a graphical or ASCII-art representation of a [[wp:Peano curve|Peano curve]] of at least order 3.\n\n","language":"00-TASK"},{"code":"DEFINE MAXSIZE=\"12\"\n\nINT ARRAY\n angleStack(MAXSIZE)\nBYTE ARRAY\n depthStack(MAXSIZE),stageStack(MAXSIZE)\nBYTE stacksize=[0]\n\nBYTE FUNC IsEmpty()\n IF stacksize=0 THEN RETURN (1) FI\nRETURN (0)\n\nBYTE FUNC IsFull()\n IF stacksize=MAXSIZE THEN RETURN (1) FI\nRETURN (0)\n\nPROC Push(INT angle BYTE depth,stage)\n IF IsFull() THEN Break() FI\n angleStack(stacksize)=angle\n depthStack(stacksize)=depth\n stageStack(stackSize)=stage\n stacksize==+1\nRETURN\n\nPROC Pop(INT POINTER angle BYTE POINTER depth,stage)\n IF IsEmpty() THEN Break() FI\n stacksize==-1\n angle^=angleStack(stacksize)\n depth^=depthStack(stacksize)\n stage^=stageStack(stacksize)\nRETURN\n\nINT FUNC Sin(INT a)\n WHILE a<0 DO a==+360 OD\n WHILE a>360 DO a==-360 OD\n IF a=90 THEN\n RETURN (1)\n ELSEIF a=270 THEN\n RETURN (-1)\n FI\nRETURN (0)\n\nINT FUNC Cos(INT a)\nRETURN (Sin(a-90))\n\nPROC DrawPeano(INT x BYTE y,len BYTE depth)\n BYTE stage\n INT angle=[90],a\n\n Plot(x,y)\n Push(90,depth,0)\n\n WHILE IsEmpty()=0\n DO\n Pop(@a,@depth,@stage)\n IF stage<3 THEN\n Push(a,depth,stage+1)\n FI\n IF stage=0 THEN\n angle==+a\n IF depth>1 THEN\n Push(-a,depth-1,0)\n FI\n ELSEIF stage=1 THEN\n x==+len*Cos(angle)\n y==-len*Sin(angle)\n DrawTo(x,y)\n IF depth>1 THEN\n Push(a,depth-1,0)\n FI\n ELSEIF stage=2 THEN\n x==+len*Cos(angle)\n y==-len*Sin(angle)\n DrawTo(x,y)\n IF depth>1 THEN\n Push(-a,depth-1,0)\n FI\n ELSEIF stage=3 THEN\n angle==-a\n FI\n OD\nRETURN\n\nPROC Main()\n BYTE CH=$02FC,COLOR1=$02C5,COLOR2=$02C6\n\n Graphics(8+16)\n Color=1\n COLOR1=$0C\n COLOR2=$02\n\n DrawPeano(69,186,7,6)\n\n DO UNTIL CH#$FF OD\n CH=$FF\nRETURN\n","language":"Action-"},{"code":"with PDF_Out; use PDF_Out;\n\nprocedure Peano_Curve is\n\n Filename : constant String := \"peano-curve.pdf\";\n Order : constant Positive := 4;\n Scale : constant Real := 2.1;\n Line_Width : constant Real := 2.5;\n Corner : constant Point := (150.0, 50.0);\n Background : constant Color_Type := (0.827, 0.816, 0.016);\n Frame : constant Rectangle := (10.0, 10.0, 820.0, 575.0);\n PDF : PDF_Out_File;\n\n type Coord is record\n X, Y : Natural;\n end record;\n\n function \"+\" (Left : Coord; Right : Coord) return Coord\n is ((Left.X + Right.X, Left.Y + Right.Y));\n\n function \"*\" (Left : Natural; Right : Coord) return Coord\n is ((Left * Right.X, Left * Right.Y));\n\n procedure Peano (Pos : Coord; Length : Positive; I1, I2 : Integer) is\n Len : constant Integer := Length / 3;\n begin\n if Length = 1 then\n PDF.Line (Corner + Scale * (Real (3 * Pos.X), Real (3 * Pos.Y)));\n else\n Peano (Pos + Len * (2 * I1, 2 * I1), Len, I1, I2);\n Peano (Pos + Len * (I1 - I2 + 1, I1 + I2), Len, I1, 1 - I2);\n Peano (Pos + Len * (1, 1), Len, I1, 1 - I2);\n Peano (Pos + Len * (I1 + I2, I1 - I2 + 1), Len, 1 - I1, 1 - I2);\n Peano (Pos + Len * (2 * I2, 2 - 2 * I2), Len, I1, I2);\n Peano (Pos + Len * (1 + I2 - I1, 2 - I1 - I2), Len, I1, I2);\n Peano (Pos + Len * (2 - 2 * I1, 2 - 2 * I1), Len, I1, I2);\n Peano (Pos + Len * (2 - I1 - I2, 1 + I2 - I1), Len, 1 - I1, I2);\n Peano (Pos + Len * (2 - 2 * I2, 2 * I2), Len, 1 - I1, I2);\n end if;\n end Peano;\n\n procedure Draw_Peano is\n begin\n PDF.Stroking_Color (Black);\n PDF.Line_Width (Line_Width);\n PDF.Move (Corner);\n Peano ((0, 0), 3**Order, 0, 0);\n PDF.Finish_Path (Close_Path => False,\n Rendering => Stroke,\n Rule => Nonzero_Winding_Number);\n end Draw_Peano;\n\nbegin\n PDF.Create (Filename);\n PDF.Page_Setup (A4_Landscape);\n\n PDF.Color (Background);\n PDF.Draw (Frame, Fill);\n\n Draw_Peano;\n PDF.Close;\nend Peano_Curve;\n","language":"Ada"},{"code":"BEGIN # Peano Curve in SVG #\n # uses the RC Algol 68 L-System library for the L-System evaluation & #\n # interpretation #\n\n PR read \"lsystem.incl.a68\" PR # include L-System utilities #\n\n PROC peano curve = ( STRING fname, INT size, length, order, init x, init y )VOID:\n IF FILE svg file;\n BOOL open error := IF open( svg file, fname, stand out channel ) = 0\n THEN\n # opened OK - file already exists and #\n # will be overwritten #\n FALSE\n ELSE\n # failed to open the file #\n # - try creating a new file #\n establish( svg file, fname, stand out channel ) /= 0\n FI;\n open error\n THEN # failed to open the file #\n print( ( \"Unable to open \", fname, newline ) );\n stop\n ELSE # file opened OK #\n\n REAL x := init x;\n REAL y := init y;\n INT angle := 90;\n put( svg file, ( \"<svg xmlns='http://www.w3.org/2000/svg' width='\"\n , whole( size, 0 ), \"' height='\", whole( size, 0 ), \"'>\"\n , newline, \"<rect width='100%' height='100%' fill='white'/>\"\n , newline, \"<path stroke-width='1' stroke='black' fill='none' d='\"\n , newline, \"M\", whole( x, 0 ), \",\", whole( y, 0 ), newline\n )\n );\n\n LSYSTEM ssc = ( \"L\"\n , ( \"L\" -> \"LFRFL-F-RFLFR+F+LFRFL\"\n , \"R\" -> \"RFLFR+F+LFRFL-F-RFLFR\"\n )\n );\n STRING curve = ssc EVAL order;\n curve INTERPRET ( ( CHAR c )VOID:\n IF c = \"F\" THEN\n x +:= length * cos( angle * pi / 180 );\n y +:= length * sin( angle * pi / 180 );\n put( svg file, ( \" L\", whole( x, 0 ), \",\", whole( y, 0 ), newline ) )\n ELIF c = \"+\" THEN\n angle +:= 90 MODAB 360\n ELIF c = \"-\" THEN\n angle -:= 90 MODAB 360\n FI\n );\n\n put( svg file, ( \"'/>\", newline, \"</svg>\", newline ) );\n close( svg file )\n FI # sierpinski square # ;\n\n peano curve( \"peano.svg\", 1200, 12, 3, 50, 50 )\n\nEND\n","language":"ALGOL-68"},{"code":"gdip1()\nPeanoX := A_ScreenWidth/2 - 100, PeanoY := A_ScreenHeight/2 - 100\nPeano(PeanoX, PeanoY, 3**3, 5, 5, Arr:=[])\nxmin := xmax := ymin := ymax := 0\nfor i, point in Arr\n{\n\txmin := A_Index = 1 ? point.x : xmin < point.x ? xmin : point.x\n\txmax := point.x > xmax ? point.x : xmax\n\tymin := A_Index = 1 ? point.y : ymin < point.y ? ymin : point.y\n\tymax := point.y > ymax ? point.y : ymax\n}\nfor i, point in Arr\n\tpoints .= point.x - xmin + PeanoX \",\" point.y - ymin + PeanoY \"|\"\npoints := Trim(points, \"|\")\nGdip_DrawLines(G, pPen, Points)\nUpdateLayeredWindow(hwnd1, hdc, 0, 0, Width, Height)\nreturn\n; ---------------------------------------------------------------\nPeano(x, y, lg, i1, i2, Arr) {\n\tif (lg =1 )\n\t{\n\t\tArr[Arr.count()+1, \"x\"] := x\n\t\tArr[Arr.count(), \"y\"] := y\n\t\treturn\n\t}\n\tlg := lg/3\n\tPeano(x+(2*i1*lg)\t, y+(2*i1*lg)\t\t, lg\t, i1\t, i2\t, Arr)\n\tPeano(x+((i1-i2+1)*lg)\t, y+((i1+i2)*lg)\t, lg\t, i1\t, 1-i2\t, Arr)\n\tPeano(x+lg\t\t, y+lg\t\t\t, lg\t, i1\t, 1-i2\t, Arr)\n\tPeano(x+((i1+i2)*lg)\t, y+((i1-i2+1)*lg)\t, lg\t, 1-i1\t, 1-i2\t, Arr)\n\tPeano(x+(2*i2*lg)\t, y+(2*(1-i2)*lg)\t, lg\t, i1\t, i2\t, Arr)\n\tPeano(x+((1+i2-i1)*lg)\t, y+((2-i1-i2)*lg)\t, lg\t, i1\t, i2\t, Arr)\n\tPeano(x+(2*(1-i1)*lg)\t, y+(2*(1-i1)*lg)\t, lg\t, i1\t, i2\t, Arr)\n\tPeano(x+((2-i1-i2)*lg)\t, y+((1+i2-i1)*lg)\t, lg\t, 1-i1\t, i2\t, Arr)\n\tPeano(x+(2*(1-i2)*lg)\t, y+(2*i2*lg)\t\t, lg\t, 1-i1\t, i2\t, Arr)\n}\n; ---------------------------------------------------------------\ngdip1(){\n\tglobal\n\tIf !pToken := Gdip_Startup()\n\t{\n\t\tMsgBox, 48, gdiplus error!, Gdiplus failed to start. Please ensure you have gdiplus on your system\n\t\tExitApp\n\t}\n\tOnExit, Exit\n\tWidth := A_ScreenWidth, Height := A_ScreenHeight\n\tGui, 1: -Caption +E0x80000 +LastFound +OwnDialogs +Owner +AlwaysOnTop\n\tGui, 1: Show, NA\n\thwnd1 := WinExist()\n\thbm := CreateDIBSection(Width, Height)\n\thdc := CreateCompatibleDC()\n\tobm := SelectObject(hdc, hbm)\n\tG := Gdip_GraphicsFromHDC(hdc)\n\tGdip_SetSmoothingMode(G, 4)\n\tpPen := Gdip_CreatePen(0xFFFF0000, 2)\n}\n; ---------------------------------------------------------------\ngdip2(){\n\tglobal\n\tGdip_DeleteBrush(pBrush)\n\tGdip_DeletePen(pPen)\n\tSelectObject(hdc, obm)\n\tDeleteObject(hbm)\n\tDeleteDC(hdc)\n\tGdip_DeleteGraphics(G)\n}\n; ---------------------------------------------------------------\nExit:\ngdip2()\nGdip_Shutdown(pToken)\nExitApp\nReturn\n","language":"AutoHotkey"},{"code":"/*Abhishek Ghosh, 14th September 2018*/\n\n#include <graphics.h>\n#include <math.h>\n\nvoid Peano(int x, int y, int lg, int i1, int i2) {\n\n\tif (lg == 1) {\n\t\tlineto(3*x,3*y);\n\t\treturn;\n\t}\n\t\n\tlg = lg/3;\n\tPeano(x+(2*i1*lg), y+(2*i1*lg), lg, i1, i2);\n\tPeano(x+((i1-i2+1)*lg), y+((i1+i2)*lg), lg, i1, 1-i2);\n\tPeano(x+lg, y+lg, lg, i1, 1-i2);\n\tPeano(x+((i1+i2)*lg), y+((i1-i2+1)*lg), lg, 1-i1, 1-i2);\n\tPeano(x+(2*i2*lg), y+(2*(1-i2)*lg), lg, i1, i2);\n\tPeano(x+((1+i2-i1)*lg), y+((2-i1-i2)*lg), lg, i1, i2);\n\tPeano(x+(2*(1-i1)*lg), y+(2*(1-i1)*lg), lg, i1, i2);\n\tPeano(x+((2-i1-i2)*lg), y+((1+i2-i1)*lg), lg, 1-i1, i2);\n\tPeano(x+(2*(1-i2)*lg), y+(2*i2*lg), lg, 1-i1, i2);\n}\n\nint main(void) {\n\n\tinitwindow(1000,1000,\"Peano, Peano\");\n\n\tPeano(0, 0, 1000, 0, 0); /* Start Peano recursion. */\n\t\n\tgetch();\n\tcleardevice();\n\t\n\treturn 0;\n}\n","language":"C"},{"code":"#include <cmath>\n#include <fstream>\n#include <iostream>\n#include <string>\n\nclass peano_curve {\npublic:\n void write(std::ostream& out, int size, int length, int order);\nprivate:\n static std::string rewrite(const std::string& s);\n void line(std::ostream& out);\n void execute(std::ostream& out, const std::string& s);\n double x_;\n double y_;\n int angle_;\n int length_;\n};\n\nvoid peano_curve::write(std::ostream& out, int size, int length, int order) {\n length_ = length;\n x_ = length;\n y_ = length;\n angle_ = 90;\n out << \"<svg xmlns='http://www.w3.org/2000/svg' width='\"\n << size << \"' height='\" << size << \"'>\\n\";\n out << \"<rect width='100%' height='100%' fill='white'/>\\n\";\n out << \"<path stroke-width='1' stroke='black' fill='none' d='\";\n std::string s = \"L\";\n for (int i = 0; i < order; ++i)\n s = rewrite(s);\n execute(out, s);\n out << \"'/>\\n</svg>\\n\";\n}\n\nstd::string peano_curve::rewrite(const std::string& s) {\n std::string t;\n for (char c : s) {\n switch (c) {\n case 'L':\n t += \"LFRFL-F-RFLFR+F+LFRFL\";\n break;\n case 'R':\n t += \"RFLFR+F+LFRFL-F-RFLFR\";\n break;\n default:\n t += c;\n break;\n }\n }\n return t;\n}\n\nvoid peano_curve::line(std::ostream& out) {\n double theta = (3.14159265359 * angle_)/180.0;\n x_ += length_ * std::cos(theta);\n y_ += length_ * std::sin(theta);\n out << \" L\" << x_ << ',' << y_;\n}\n\nvoid peano_curve::execute(std::ostream& out, const std::string& s) {\n out << 'M' << x_ << ',' << y_;\n for (char c : s) {\n switch (c) {\n case 'F':\n line(out);\n break;\n case '+':\n angle_ = (angle_ + 90) % 360;\n break;\n case '-':\n angle_ = (angle_ - 90) % 360;\n break;\n }\n }\n}\n\nint main() {\n std::ofstream out(\"peano_curve.svg\");\n if (!out) {\n std::cerr << \"Cannot open output file\\n\";\n return 1;\n }\n peano_curve pc;\n pc.write(out, 656, 8, 4);\n return 0;\n}\n","language":"C++"},{"code":"proc lsysexp level . axiom$ rules$[] .\n for l to level\n an$ = \"\"\n for c$ in strchars axiom$\n for i = 1 step 2 to len rules$[]\n if rules$[i] = c$\n c$ = rules$[i + 1]\n break 1\n .\n .\n an$ &= c$\n .\n swap axiom$ an$\n .\n.\nproc lsysdraw axiom$ x y ang . .\n linewidth 0.3\n move x y\n for c$ in strchars axiom$\n if c$ = \"F\"\n x += cos dir\n y += sin dir\n line x y\n elif c$ = \"-\"\n dir -= ang\n elif c$ = \"+\"\n dir += ang\n .\n .\n.\naxiom$ = \"L\"\nrules$[] = [ \"L\" \"LFRFL-F-RFLFR+F+LFRFL\" \"R\" \"RFLFR+F+LFRFL-F-RFLFR\" ]\nlsysexp 4 axiom$ rules$[]\nlsysdraw axiom$ 5 90 90\n","language":"EasyLang"},{"code":"USING: accessors L-system ui ;\n\n: peano ( L-system -- L-system )\n L-parser-dialect >>commands\n [ 90 >>angle ] >>turtle-values\n \"L\" >>axiom\n {\n { \"L\" \"LFRFL-F-RFLFR+F+LFRFL\" }\n { \"R\" \"RFLFR+F+LFRFL-F-RFLFR\" }\n } >>rules ;\n\n[ <L-system> peano \"Peano curve\" open-window ] with-ui\n","language":"Factor"},{"code":"Const anchura = 243 'una potencia de 3 para una curva uniformemente espaciada\n\nScreenres 700,700\n\nSub Peano(x As Integer, y As Integer, lg As Integer, i1 As Integer, i2 As Integer)\n If lg = 1 Then\n Line - (x * 3, y * 3)\n Return\n End If\n lg /= 3\n Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\n Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\n Peano(x + lg, y + lg, lg, i1, 1 - i2)\n Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\n Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\n Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\n Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\n Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\n Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\nEnd Sub\n\nPeano(0, 0, anchura, 0, 0)\n\nSleep\n","language":"FreeBASIC"},{"code":"_window = 1\n_curveSize = 7\n_curveOrder = 3 * 3 * 3 * 3 // 3^4\n\nvoid local fn BuildWindow\n CGRect r = fn CGRectMake( 0, 0, 565, 570 )\n window _window, @\"Peano Curve In FutureBasic\", r, NSWindowStyleMaskTitled\n WindowSetBackgroundColor( _window, fn ColorBlack )\nend fn\n\nlocal fn Peano( x as long, y as long, lg as long, i1 as long, i2 as long )\n ColorRef color = fn ColorRed\n\n if ( lg == 1 ) then line to x * _curveSize, y * _curveSize : exit fn\n lg /= 3\n\n select ( rnd(8) )\n case 1 : color = fn ColorBrown\n case 2 : color = fn ColorRed\n case 3 : color = fn ColorOrange\n case 4 : color = fn ColorYellow\n case 5 : color = fn ColorGreen\n case 6 : color = fn ColorBlue\n case 7 : color = fn ColorPurple\n case 8 : color = fn ColorWhite\n end select\n\n pen 2, color\n fn Peano( x + 2*i1* lg, y + 2*i1* lg, lg, i1, i2 )\n fn Peano( x + (i1-i2+1)*lg, y + (i1+i2)* lg, lg, i1, 1-i2 )\n fn Peano( x + lg, y + lg, lg, i1, 1-i2 )\n fn Peano( x + (i1+i2)* lg, y + (i1-i2+1)*lg, lg, 1-i1, 1-i2 )\n fn Peano( x + 2*i2* lg, y + 2*(1-i2)* lg, lg, i1, i2 )\n fn Peano( x + (1+i2-i1)*lg, y + (2-i1-i2)*lg, lg, i1, i2 )\n fn Peano( x + 2*(1-i1)* lg, y + 2*(1-i1)* lg, lg, i1, i2 )\n fn Peano( x + (2-i1-i2)*lg, y + (1+i2-i1)*lg, lg, 1-i1, i2 )\n fn Peano( x + 2*(1-i2)* lg, y + 2*i2* lg, lg, 1-i1, i2 )\nend fn\n\nrandomize\nfn BuildWindow\nfn Peano( 0, 0, _curveOrder, 0, 0 )\n\nHandleEvents\n","language":"FutureBasic"},{"code":"package main\n\nimport \"github.com/fogleman/gg\"\n\nvar points []gg.Point\n\nconst width = 81\n\nfunc peano(x, y, lg, i1, i2 int) {\n if lg == 1 {\n px := float64(width-x) * 10\n py := float64(width-y) * 10\n points = append(points, gg.Point{px, py})\n return\n }\n lg /= 3\n peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\n peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\n peano(x+lg, y+lg, lg, i1, 1-i2)\n peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\n peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\n peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\n peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\n peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\n peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\n}\n\nfunc main() {\n peano(0, 0, width, 0, 0)\n dc := gg.NewContext(820, 820)\n dc.SetRGB(1, 1, 1) // White background\n dc.Clear()\n for _, p := range points {\n dc.LineTo(p.X, p.Y)\n }\n dc.SetRGB(1, 0, 1) // Magenta curve\n dc.SetLineWidth(1)\n dc.Stroke()\n dc.SavePNG(\"peano.png\")\n}\n","language":"Go"},{"code":"100 PROGRAM \"PeanoC.bas\"\n110 OPTION ANGLE DEGREES\n120 SET VIDEO MODE 5:SET VIDEO COLOR 0:SET VIDEO X 40:SET VIDEO Y 27\n130 OPEN #101:\"video:\"\n140 DISPLAY #101:AT 1 FROM 1 TO 27\n150 PLOT 280,240,ANGLE 90;\n160 CALL PEANO(28,90,6)\n170 DEF PEANO(D,A,LEV)\n180 IF LEV=0 THEN EXIT DEF\n190 PLOT RIGHT A;\n200 CALL PEANO(D,-A,LEV-1)\n210 PLOT FORWARD D;\n220 CALL PEANO(D,A,LEV-1)\n230 PLOT FORWARD D;\n240 CALL PEANO(D,-A,LEV-1)\n250 PLOT LEFT A;\n260 END DEF\n","language":"IS-BASIC"},{"code":"load'viewmat'\nhp=: 3 : '(|.,]) 1 (0 _2 _2 ,&.> _2 _1 0 + #y) } (,.|:) y'\nHP=: 3 3 $ 0 0 0 0 1\nWR=: 16777215 16711680\nviewrgb WR {~ hp ^:7 HP\n","language":"J"},{"code":" require 'viewmat'\n hp=: 3 : '(|.,]) 1 (0 _2 _2 ,&.> _2 _1 0 + #y) } (,.|:) y'\n MG=: 256 #. 128 0 128,:0 192 0\n viewrgb 2 ([ # #\"1) MG {~ hp ^:6 [ 0, 0 1 0 ,: 0,\n","language":"J"},{"code":"import java.io.*;\n\npublic class PeanoCurve {\n public static void main(final String[] args) {\n try (Writer writer = new BufferedWriter(new FileWriter(\"peano_curve.svg\"))) {\n PeanoCurve s = new PeanoCurve(writer);\n final int length = 8;\n s.currentAngle = 90;\n s.currentX = length;\n s.currentY = length;\n s.lineLength = length;\n s.begin(656);\n s.execute(rewrite(4));\n s.end();\n } catch (final Exception ex) {\n ex.printStackTrace();\n }\n }\n\n private PeanoCurve(final Writer writer) {\n this.writer = writer;\n }\n\n private void begin(final int size) throws IOException {\n write(\"<svg xmlns='http://www.w3.org/2000/svg' width='%d' height='%d'>\\n\", size, size);\n write(\"<rect width='100%%' height='100%%' fill='white'/>\\n\");\n write(\"<path stroke-width='1' stroke='black' fill='none' d='\");\n }\n\n private void end() throws IOException {\n write(\"'/>\\n</svg>\\n\");\n }\n\n private void execute(final String s) throws IOException {\n write(\"M%g,%g\\n\", currentX, currentY);\n for (int i = 0, n = s.length(); i < n; ++i) {\n switch (s.charAt(i)) {\n case 'F':\n line(lineLength);\n break;\n case '+':\n turn(ANGLE);\n break;\n case '-':\n turn(-ANGLE);\n break;\n }\n }\n }\n\n private void line(final double length) throws IOException {\n final double theta = (Math.PI * currentAngle) / 180.0;\n currentX += length * Math.cos(theta);\n currentY += length * Math.sin(theta);\n write(\"L%g,%g\\n\", currentX, currentY);\n }\n\n private void turn(final int angle) {\n currentAngle = (currentAngle + angle) % 360;\n }\n\n private void write(final String format, final Object... args) throws IOException {\n writer.write(String.format(format, args));\n }\n\n private static String rewrite(final int order) {\n String s = \"L\";\n for (int i = 0; i < order; ++i) {\n final StringBuilder sb = new StringBuilder();\n for (int j = 0, n = s.length(); j < n; ++j) {\n final char ch = s.charAt(j);\n if (ch == 'L')\n sb.append(\"LFRFL-F-RFLFR+F+LFRFL\");\n else if (ch == 'R')\n sb.append(\"RFLFR+F+LFRFL-F-RFLFR\");\n else\n sb.append(ch);\n }\n s = sb.toString();\n }\n return s;\n }\n\n private final Writer writer;\n private double lineLength;\n private double currentX;\n private double currentY;\n private int currentAngle;\n private static final int ANGLE = 90;\n}\n","language":"Java"},{"code":"# => = 0 degrees\n# ^ = 90 degrees\n# <= = 180 degrees\n# v = 270 degrees\n\n# $start : [$x, $y]\ndef turtle($start):\n $start\n | if type == \"array\" then \"M \\($start|join(\",\"))\" else \"M 0,0\" end\n | {svg: ., up:true, angle:0};\n\ndef turtleUp: .up=true;\ndef turtleDown: .up=false;\n\ndef turtleRotate($angle): .angle = (360 + (.angle + $angle)) % 360;\n\ndef turtleForward($d):\n if .up\n then if .angle== 0 then .svg += \" m \\($d),0\"\n elif .angle== 90 then .svg += \" m 0,-\\($d)\"\n elif .angle==180 then .svg += \" m -\\($d),0\"\n elif .angle==270 then .svg += \" m 0,\\($d)\"\n else \"unsupported angle \\(.angle)\" | error\n end\n else if .angle== 0 then .svg += \" h \\($d)\"\n elif .angle== 90 then .svg += \" v -\\($d)\"\n elif .angle==180 then .svg += \" h -\\($d)\"\n elif .angle==270 then .svg += \" v \\($d)\"\n else \"unsupported angle \\(.angle)\" | error\n end\n end;\n\ndef svg($size):\n \"<svg viewBox=\\\"0 0 \\($size) \\($size)\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\",\n .,\n \"</svg>\";\n\ndef path($fill; $stroke; $width):\n \"<path fill=\\\"\\($fill)\\\" stroke=\\\"\\($stroke)\\\" stroke-width=\\\"\\($width)\\\" d=\\\"\\(.svg)\\\" />\";\n\ndef draw:\n path(\"none\"; \"red\"; \"0.1\") | svg(100) ;\n","language":"Jq"},{"code":"# Compute the curve using a Lindenmayer system of rules\ndef rules:\n { L: \"LFRFL-F-RFLFR+F+LFRFL\",\n R: \"RFLFR+F+LFRFL-F-RFLFR\" } ;\n\ndef peano($count):\n rules as $rules\n | def p($count):\n if $count <= 0 then .\n else gsub(\"L\"; \"l\") | gsub(\"R\"; $rules[\"R\"]) | gsub(\"l\"; $rules[\"L\"]) | p($count-1)\n end;\n \"L\" | p($count) ;\n\ndef interpret($x):\n if $x == \"+\" then turtleRotate(90)\n elif $x == \"-\" then turtleRotate(-90)\n elif $x == \"F\" then turtleForward(1)\n else .\n end;\n\ndef peano_curve($n):\n peano($n)\n | split(\"\")\n | reduce .[] as $action (turtle([1,1]) | turtleDown;\n interpret($action) ) ;\n\npeano_curve(4)\n| draw\n","language":"Jq"},{"code":"# Input: an array\n# Output: the array augmented with another x,y pair\ndef peano($x; $y; $lg; $i1; $i2):\n $lg as $width\n | def p($x; $y; $lg; $i1; $i2):\n if $lg == 1\n then (($width - $x) * 10) as $px\n | (($width - $y) * 10) as $py\n | . + [[$px,$py]]\n else (($lg/3) | floor) as $lg\n | p($x+2*$i1*$lg; $y+2*$i1*$lg; $lg; $i1; $i2)\n | p($x+($i1-$i2+1)*$lg; $y+($i1+$i2)*$lg; $lg; $i1; 1-$i2)\n | p($x+$lg; $y+$lg; $lg; $i1; 1-$i2)\n | p($x+($i1+$i2)*$lg; $y+($i1-$i2+1)*$lg; $lg; 1-$i1; 1-$i2)\n | p($x+2*$i2*$lg; $y+2*(1-$i2)*$lg; $lg; $i1; $i2)\n | p($x+(1+$i2-$i1)*$lg; $y+(2-$i1-$i2)*$lg; $lg; $i1; $i2)\n | p($x+2*(1-$i1)*$lg; $y+2*(1-$i1)*$lg; $lg; $i1; $i2)\n | p($x+(2-$i1-$i2)*$lg; $y+(1+$i2-$i1)*$lg; $lg; 1-$i1; $i2)\n | p($x+2*(1-$i2)*$lg; $y+2*$i2*$lg; $lg; 1-$i1; $i2)\n end;\n p($x; $y; $lg; $i1; $i2);\n\ndef svg:\n \"<svg viewBox=\\\"0 0 820 820\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\" ;\n\ndef path($fill; $stroke):\n \"<path fill=\\\"\\($fill)\\\" stroke=\\\"\\($stroke)\\\" d=\\\"M \";\n\ndef endpath:\n \" \\\" /> </svg>\";\n\ndef peanoCurve:\n null | peano(0; 0; 81; 0; 0) | map(join(\",\")) | join(\" \");\n\nsvg,\n( path(\"none\"; \"red\") + peanoCurve + endpath)\n","language":"Jq"},{"code":"using Gtk, Graphics, Colors\n\nfunction peano(ctx, x, y, lg, i1, i2)\n if lg < 3\n line_to(ctx, x - 250, y - 250)\n stroke(ctx)\n move_to(ctx, x - 250 , y - 250)\n else\n lg = div(lg, 3)\n peano(ctx, x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\n peano(ctx, x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\n peano(ctx, x + lg, y + lg, lg, i1, 1 - i2)\n peano(ctx, x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\n peano(ctx, x + (2 * i2 * lg), y + ( 2 * (1-i2) * lg), lg, i1, i2)\n peano(ctx, x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\n peano(ctx, x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\n peano(ctx, x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\n peano(ctx, x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\n end\nend\n\nconst can = @GtkCanvas()\nconst win = GtkWindow(can, \"Peano Curve\", 500, 500)\n\n@guarded draw(can) do widget\n ctx = getgc(can)\n h = height(can)\n w = width(can)\n set_source(ctx, colorant\"blue\")\n set_line_width(ctx, 1)\n peano(ctx, w/2, h/2, 500, 0, 0)\nend\n\nshow(can)\nconst cond = Condition()\nendit(w) = notify(cond)\nsignal_connect(endit, win, :destroy)\nwait(cond)\n","language":"Julia"},{"code":"local PeanoLSystem = {\n axiom = \"L\",\n rules = {\n L = \"LFRFL-F-RFLFR+F+LFRFL\",\n R = \"RFLFR+F+LFRFL-F-RFLFR\"\n },\n eval = function(self, n)\n local source, result = self.axiom\n for i = 1, n do\n result = \"\"\n for j = 1, #source do\n local ch = source:sub(j,j)\n result = result .. (self.rules[ch] and self.rules[ch] or ch)\n end\n source = result\n end\n return result\n end\n}\n\nfunction Bitmap:drawPath(path, x, y, dx, dy)\n self:set(x, y, \"@\")\n for i = 1, #path do\n local ch = path:sub(i,i)\n if (ch == \"F\") then\n local reps = dx==0 and 1 or 3 -- aspect correction\n for r = 1, reps do\n x, y = x+dx, y+dy\n self:set(x, y, dx==0 and \"|\" or \"-\")\n end\n x, y = x+dx, y+dy\n self:set(x, y, \"+\")\n elseif (ch ==\"-\") then\n dx, dy = dy, -dx\n elseif (ch == \"+\") then\n dx, dy = -dy, dx\n end\n end\n self:set(x, y, \"X\")\nend\n\nfunction Bitmap:render()\n for y = 1, self.height do\n print(table.concat(self.pixels[y]))\n end\nend\n\nbitmap = Bitmap(53*2,53)\nbitmap:clear(\" \")\nbitmap:drawPath(PeanoLSystem:eval(3), 0, 0, 0, 1)\nbitmap:render()\n","language":"Lua"},{"code":"Module Peano_curve {\nCls 1, 0\nConst Center=2\nReport Center, \"Peano curve\"\nlet factor=.9, k=3, wi=k^4\nlet wi2=min.data(scale.x*factor, scale.y*factor), n=wi2/wi\nlet (dx, dy)=((scale.x-wi2)/2, (scale.y-wi2)/2)\ndx+=k*1.2*twipsX\ndy+=k*1.2*twipsY\nmove dx, dy\npen 11 {\n Peano(0,0,wi,0, 0)\n}\n\nsub Peano(x, y, lg, i1, i2)\n if lg ==1 then\n draw to x*n+dx , y*n+dy\n return\n end if\n lg/=k\n Peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\n Peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\n Peano(x+lg, y+lg, lg, i1, 1-i2)\n Peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\n Peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\n Peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\n Peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\n Peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\n Peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\nend sub\n}\nPeano_curve\n","language":"M2000-Interpreter"},{"code":"Graphics[PeanoCurve[4]]\n","language":"Mathematica"},{"code":"import imageman\n\nconst Width = 81\n\nproc peano(points: var seq[Point]; x, y, lg, i1, i2: int) =\n\n if lg == 1:\n points.add ((Width - x) * 10, (Width - y) * 10)\n return\n\n let lg = lg div 3\n points.peano(x + 2 * i1 * lg, y + 2 * i1 * lg, lg, i1, i2)\n points.peano(x + (i1 - i2 + 1) * lg, y + (i1 + i2) * lg, lg, i1, 1 - i2)\n points.peano(x + lg, y + lg, lg, i1, 1 - i2)\n points.peano(x + (i1 + i2) * lg, y + (i1 - i2 + 1) * lg, lg, 1 - i1, 1 - i2)\n points.peano(x + 2 * i2 * lg, y + 2 * (1-i2) * lg, lg, i1, i2)\n points.peano(x + (1 + i2 - i1) * lg, y + (2 - i1 - i2) * lg, lg, i1, i2)\n points.peano(x + 2 * (1 - i1) * lg, y + 2 * (1 - i1) * lg, lg, i1, i2)\n points.peano(x + (2 - i1 - i2) * lg, y + (1 + i2 - i1) * lg, lg, 1 - i1, i2)\n points.peano(x + 2 * (1 - i2) * lg, y + 2 * i2 * lg, lg, 1 - i1, i2)\n\n\nvar points: seq[Point]\npoints.peano(0, 0, Width, 0, 0)\nvar image = initImage[ColorRGBU](820, 820)\nlet color = ColorRGBU([byte 255, 255, 0])\nfor i in 1..points.high:\n image.drawLine(points[i - 1], points[i], color)\nimage.savePNG(\"peano.png\", compression = 9)\n","language":"Nim"},{"code":"use SVG;\nuse List::Util qw(max min);\n\nuse constant pi => 2 * atan2(1, 0);\n\n# Compute the curve with a Lindemayer-system\nmy %rules = (\n L => 'LFRFL-F-RFLFR+F+LFRFL',\n R => 'RFLFR+F+LFRFL-F-RFLFR'\n);\nmy $peano = 'L';\n$peano =~ s/([LR])/$rules{$1}/eg for 1..4;\n\n# Draw the curve in SVG\n($x, $y) = (0, 0);\n$theta = pi/2;\n$r = 4;\n\nfor (split //, $peano) {\n if (/F/) {\n push @X, sprintf \"%.0f\", $x;\n push @Y, sprintf \"%.0f\", $y;\n $x += $r * cos($theta);\n $y += $r * sin($theta);\n }\n elsif (/\\+/) { $theta += pi/2; }\n elsif (/\\-/) { $theta -= pi/2; }\n}\n\n$max = max(@X,@Y);\n$xt = -min(@X)+10;\n$yt = -min(@Y)+10;\n$svg = SVG->new(width=>$max+20, height=>$max+20);\n$points = $svg->get_path(x=>\\@X, y=>\\@Y, -type=>'polyline');\n$svg->rect(width=>\"100%\", height=>\"100%\", style=>{'fill'=>'black'});\n$svg->polyline(%$points, style=>{'stroke'=>'orange', 'stroke-width'=>1}, transform=>\"translate($xt,$yt)\");\n\nopen $fh, '>', 'peano_curve.svg';\nprint $fh $svg->xmlify(-namespace=>'svg');\nclose $fh;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\peano_curve.exw\n -- ============================\n --\n -- Draws a peano curve. Space key toggles between switchback and meander curves.\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">canvas</span>\n <span style=\"color: #004080;\">cdCanvas</span> <span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cdcanvas</span>\n\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">meander</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span> <span style=\"color: #000080;font-style:italic;\">-- space toggles (false==draw switchback curve)</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">width</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">81</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n\n <span style=\"color: #000080;font-style:italic;\">-- switchback peano:\n --\n -- There are (as per wp) four shapes to draw:\n --\n -- 1: +-v ^ 2: ^ v-+ 3: v ^-+ 2: +-^ v\n -- | | | | | | | | | | | |\n -- ^ v-+ +-v ^ +-^ v v ^-+\n --\n -- 1 starts bottom left, ends top right\n -- 2 starts bottom right, ends top left\n -- 3 starts top left, ends bottom right\n -- 4 starts top right, ends bottom left\n --\n -- given the centre point (think {1,1}), and using {0,0} as the bottom left:\n --</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">shapes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}},</span>\n <span style=\"color: #0000FF;\">{{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}},</span> <span style=\"color: #000080;font-style:italic;\">-- (== sq_mul(shapes[1],{-1,0}))</span>\n <span style=\"color: #0000FF;\">{{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}},</span> <span style=\"color: #000080;font-style:italic;\">-- (== reverse(shapes[2]))</span>\n <span style=\"color: #0000FF;\">{{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">},{-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">}}}</span> <span style=\"color: #000080;font-style:italic;\">-- (== reverse(shapes[1]))</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">subshapes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{{</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- == sq_sub({3,3,3,7,7,7,3,3,3},subshapes[1])</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">},</span> <span style=\"color: #000080;font-style:italic;\">-- == sq_sub(5,subshapes[2])</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">}}</span> <span style=\"color: #000080;font-style:italic;\">-- == sq_sub(5,subshapes[1])\n\n -- As noted, it should theoretically be possible to simplify/shorten/remove/inline those tables</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">switchback_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">shape</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- (written from scratch, with a nod to the meander algorithm [below])</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\"><=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">return</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">level</span> <span style=\"color: #0000FF;\">/=</span> <span style=\"color: #000000;\">3</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">9</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">shape</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">switchback_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dx</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">dy</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">level</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">subshapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">shape</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- (translated from Go)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">px</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">width</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">py</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">width</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #0000FF;\">*</span> <span style=\"color: #000000;\">10</span>\n <span style=\"color: #000000;\">points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">px</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">py</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">return</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">lg</span> <span style=\"color: #0000FF;\">/=</span> <span style=\"color: #000000;\">3</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">lg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">i1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">i2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">redraw_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000080;font-style:italic;\">/*posx*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">/*posy*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">)=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">meander</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">meander_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">width</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">switchback_peano</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">41</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">width</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">cdCanvasActivate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasBegin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_OPEN_LINES</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">points</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">cdCanvasVertex</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">cdCanvasEnd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasFlush</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">map_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">cdcanvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cdCreateCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">CD_IUP</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">cddbuffer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cdCreateCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">CD_DBUFFER</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetBackground</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_WHITE</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetForeground</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_MAGENTA</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">key_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_ESC</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CLOSE</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">meander</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">meander</span>\n <span style=\"color: #000000;\">points</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #7060A8;\">cdCanvasClear</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cddbuffer</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupUpdate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CONTINUE</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">canvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"RASTERSIZE=822x822\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallbacks</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"MAP_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"map_cb\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #008000;\">\"ACTION\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"redraw_cb\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`TITLE=\"Peano Curve\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"DIALOGFRAME\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"YES\"</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #000080;font-style:italic;\">-- no resize here</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"KEY_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"key_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"//Abhishek Ghosh, 28th June 2022\n\nvoid Peano(int x, int y, int lg, int i1, int i2) {\n\n if (lg == 1) {\n ellipse(x,y,1,1);\n return;\n }\n\n lg = lg/3;\n Peano(x+(2*i1*lg), y+(2*i1*lg), lg, i1, i2);\n Peano(x+((i1-i2+1)*lg), y+((i1+i2)*lg), lg, i1, 1-i2);\n Peano(x+lg, y+lg, lg, i1, 1-i2);\n Peano(x+((i1+i2)*lg), y+((i1-i2+1)*lg), lg, 1-i1, 1-i2);\n Peano(x+(2*i2*lg), y+(2*(1-i2)*lg), lg, i1, i2);\n Peano(x+((1+i2-i1)*lg), y+((2-i1-i2)*lg), lg, i1, i2);\n Peano(x+(2*(1-i1)*lg), y+(2*(1-i1)*lg), lg, i1, i2);\n Peano(x+((2-i1-i2)*lg), y+((1+i2-i1)*lg), lg, 1-i1, i2);\n Peano(x+(2*(1-i2)*lg), y+(2*i2*lg), lg, 1-i1, i2);\n}\n\nvoid setup(){\n size(1000,1000);\n Peano(0, 0, 1000, 0, 0);\n}\n","language":"Processing"},{"code":"main:-\n write_peano_curve('peano_curve.svg', 656, 4).\n\nwrite_peano_curve(File, Size, Order):-\n open(File, write, Stream),\n format(Stream,\n \"<svg xmlns='http://www.w3.org/2000/svg' width='~d' height='~d'>\\n\",\n [Size, Size]),\n write(Stream, \"<rect width='100%' height='100%' fill='white'/>\\n\"),\n peano_curve(Stream, \"L\", 8, 8, 8, 90, Order),\n write(Stream, \"</svg>\\n\"),\n close(Stream).\n\npeano_curve(Stream, Axiom, X, Y, Length, Angle, Order):-\n write(Stream, \"<path stroke-width='1' stroke='black' fill='none' d='\"),\n format(Stream, 'M~g,~g\\n', [X, Y]),\n rewrite(Axiom, Order, S),\n string_chars(S, Chars),\n execute(Stream, X, Y, Length, Angle, Chars),\n write(Stream, \"'/>\\n\").\n\nrewrite(S, 0, S):-!.\nrewrite(S0, N, S):-\n string_chars(S0, Chars0),\n rewrite1(Chars0, '', S1),\n N1 is N - 1,\n rewrite(S1, N1, S).\n\nrewrite1([], S, S):-!.\nrewrite1([C|Chars], T, S):-\n rewrite2(C, X),\n string_concat(T, X, T1),\n rewrite1(Chars, T1, S).\n\nrewrite2('L', \"LFRFL-F-RFLFR+F+LFRFL\"):-!.\nrewrite2('R', \"RFLFR+F+LFRFL-F-RFLFR\"):-!.\nrewrite2(X, X).\n\nexecute(_, _, _, _, _, []):-!.\nexecute(Stream, X, Y, Length, Angle, ['F'|Chars]):-\n !,\n Theta is (pi * Angle) / 180.0,\n X1 is X + Length * cos(Theta),\n Y1 is Y + Length * sin(Theta),\n format(Stream, 'L~g,~g\\n', [X1, Y1]),\n execute(Stream, X1, Y1, Length, Angle, Chars).\nexecute(Stream, X, Y, Length, Angle, ['+'|Chars]):-\n !,\n Angle1 is (Angle + 90) mod 360,\n execute(Stream, X, Y, Length, Angle1, Chars).\nexecute(Stream, X, Y, Length, Angle, ['-'|Chars]):-\n !,\n Angle1 is (Angle - 90) mod 360,\n execute(Stream, X, Y, Length, Angle1, Chars).\nexecute(Stream, X, Y, Length, Angle, [_|Chars]):-\n execute(Stream, X, Y, Length, Angle, Chars).\n","language":"Prolog"},{"code":"import turtle as tt\nimport inspect\n\nstack = [] # Mark the current stacks in run.\ndef peano(iterations=1):\n global stack\n\n # The turtle Ivan:\n ivan = tt.Turtle(shape = \"classic\", visible = True)\n\n\n # The app window:\n screen = tt.Screen()\n screen.title(\"Desenhin do Peano\")\n screen.bgcolor(\"#232323\")\n screen.delay(0) # Speed on drawing (if higher, more slow)\n screen.setup(width=0.95, height=0.9)\n\n # The size of each step walked (here, named simply \"walk\"). It's not a pixel scale. This may stay still:\n walk = 1\n\n def screenlength(k):\n # A function to make the image good to see (without it would result in a partial image).\n # This will guarantee that we can see the the voids and it's steps.\n if k != 0:\n length = screenlength(k-1)\n return 2*length + 1\n else: return 0\n\n kkkj = screenlength(iterations)\n screen.setworldcoordinates(-1, -1, kkkj + 1, kkkj + 1)\n ivan.color(\"#EEFFFF\", \"#FFFFFF\")\n\n\n # The magic \\(^-^)/:\n def step1(k):\n global stack\n stack.append(len(inspect.stack()))\n if k != 0:\n ivan.left(90)\n step2(k - 1)\n ivan.forward(walk)\n ivan.right(90)\n step1(k - 1)\n ivan.forward(walk)\n step1(k - 1)\n ivan.right(90)\n ivan.forward(walk)\n step2(k - 1)\n ivan.left(90)\n def step2(k):\n global stack\n stack.append(len(inspect.stack()))\n if k != 0:\n ivan.right(90)\n step1(k - 1)\n ivan.forward(walk)\n ivan.left(90)\n step2(k - 1)\n ivan.forward(walk)\n step2(k - 1)\n ivan.left(90)\n ivan.forward(walk)\n step1(k - 1)\n ivan.right(90)\n\n # Making the program work:\n ivan.left(90)\n step2(iterations)\n\n tt.done()\n\nif __name__ == \"__main__\":\n peano(4)\n import pylab as P # This plot, after closing the drawing window, the \"stack\" graphic.\n P.plot(stack)\n P.show()\n","language":"Python"},{"code":" [ $ \"turtleduck.qky\" loadfile ] now!\n\n [ stack ] is switch.arg ( --> [ )\n\n [ switch.arg put ] is switch ( x --> )\n\n [ switch.arg release ] is otherwise ( --> )\n\n [ switch.arg share\n != iff ]else[ done\n otherwise ]'[ do ]done[ ] is case ( x --> )\n\n [ $ \"\" swap witheach\n [ nested quackery join ] ] is expand ( $ --> $ )\n\n [ $ \"F\" ] is F ( $ --> $ )\n\n [ $ \"L\" ] is L ( $ --> $ )\n\n [ $ \"R\" ] is R ( $ --> $ )\n\n [ $ \"AFBFARFRBFAFBLFLAFBFA\" ] is A ( $ --> $ )\n\n [ $ \"BFAFBLFLAFBFARFRBFAFB\" ] is B ( $ --> $ )\n\n $ \"A\"\n\n 4 times expand\n\n turtle\n witheach\n [ switch\n [ char F case [ 4 1 walk ]\n char L case [ -1 4 turn ]\n char R case [ 1 4 turn ]\n otherwise ( ignore ) ] ]\n","language":"Quackery"},{"code":"#to install hilbercurve library, biocmanager needs to be installed first\ninstall.packages(\"BiocManager\")\nBiocManager::install(\"HilbertCurve\")\n#loading library and setting seed for random numbers\nlibrary(HilbertCurve)\nlibrary(circlize)\nset.seed(123)\n\n#4th order peano curve is generated\nfor(i in 1:512) {\n peano = HilbertCurve(1, 512, level = 4, reference = TRUE, arrow = FALSE)\n hc_points(peano, x1 = i, np = NULL, pch = 16, size = unit(3, \"mm\"))\n}\n","language":"R"},{"code":"/* Jens Axel Søgaard, 27th December 2018*/\n#lang racket\n(require metapict metapict/mat)\n\n;;; Turtle State\n(define p (pt 0 0)) ; current position\n(define d (vec 0 1)) ; current direction\n(define c '()) ; line segments drawn so far\n\n;;; Turtle Operations\n(define (jump q) (set! p q))\n(define (move q) (set! c (cons (curve p -- q) c)) (set! p q))\n(define (forward x) (move (pt+ p (vec* x d))))\n(define (left a) (set! d (rot a d)))\n(define (right a) (left (- a)))\n\n;;; Peano\n(define (peano n a h)\n (unless (= n 0)\n (right a)\n (peano (- n 1) (- a) h)\n (forward h)\n (peano (- n 1) a h)\n (forward h)\n (peano (- n 1) (- a) h)\n (left a)))\n\n;;; Produce image\n(set-curve-pict-size 400 400)\n(with-window (window -1 81 -1 82)\n (peano 6 90 3)\n (draw* c))\n","language":"Racket"},{"code":"use SVG;\n\nrole Lindenmayer {\n has %.rules;\n method succ {\n self.comb.map( { %!rules{$^c} // $c } ).join but Lindenmayer(%!rules)\n }\n}\n\nmy $peano = 'L' but Lindenmayer( { 'L' => 'LFRFL-F-RFLFR+F+LFRFL', 'R' => 'RFLFR+F+LFRFL-F-RFLFR' } );\n\n$peano++ xx 4;\nmy @points = (10, 10);\n\nfor $peano.comb {\n state ($x, $y) = @points[0,1];\n state $d = 0 + 8i;\n when 'F' { @points.append: ($x += $d.re).round(1), ($y += $d.im).round(1) }\n when /< + - >/ { $d *= \"{$_}1i\" }\n default { }\n}\n\nsay SVG.serialize(\n svg => [\n :660width, :660height, :style<stroke:lime>,\n :rect[:width<100%>, :height<100%>, :fill<black>],\n :polyline[ :points(@points.join: ','), :fill<black> ],\n ],\n);\n","language":"Raku"},{"code":"load_library :grammar\n\n# Peano class\nclass Peano\n include Processing::Proxy\n attr_reader :draw_length, :vec, :theta, :axiom, :grammar\n DELTA = 60 # degrees\n def initialize(vec)\n @axiom = 'XF' # Axiom\n rules = {\n 'X' => 'X+YF++YF-FX--FXFX-YF+', # LSystem Rules\n 'Y' => '-FX+YFYF++YF+FX--FX-Y'\n }\n @grammar = Grammar.new(axiom, rules)\n @theta = 0\n @draw_length = 100\n @vec = vec\n end\n\n def generate(gen)\n @draw_length = draw_length * 0.6**gen\n grammar.generate gen\n end\n\n def translate_rules(prod)\n coss = ->(orig, alpha, len) { orig + len * DegLut.cos(alpha) }\n sinn = ->(orig, alpha, len) { orig - len * DegLut.sin(alpha) }\n [].tap do |pts| # An array to store line vertices as Vec2D\n prod.scan(/./) do |ch|\n case ch\n when 'F'\n pts << vec.copy\n @vec = Vec2D.new(\n coss.call(vec.x, theta, draw_length),\n sinn.call(vec.y, theta, draw_length)\n )\n pts << vec\n when '+'\n @theta += DELTA\n when '-'\n @theta -= DELTA\n when 'X', 'Y'\n else\n puts(\"character #{ch} not in grammar\")\n end\n end\n end\n end\nend\n\nattr_reader :points\n\ndef setup\n sketch_title 'Peano'\n peano = Peano.new(Vec2D.new(width * 0.65, height * 0.9))\n production = peano.generate 4 # 4 generations looks OK\n @points = peano.translate_rules(production)\n no_loop\nend\n\ndef draw\n background(0)\n render points\nend\n\ndef render(points)\n no_fill\n stroke 200.0\n stroke_weight 3\n begin_shape\n points.each_slice(2) do |v0, v1|\n v0.to_vertex(renderer)\n v1.to_vertex(renderer)\n end\n end_shape\nend\n\ndef renderer\n @renderer ||= GfxRender.new(g)\nend\n\ndef settings\n size(800, 800)\nend\n","language":"Ruby"},{"code":"// [dependencies]\n// svg = \"0.8.0\"\n\nuse svg::node::element::path::Data;\nuse svg::node::element::Path;\n\nstruct PeanoCurve {\n current_x: f64,\n current_y: f64,\n current_angle: i32,\n line_length: f64,\n}\n\nimpl PeanoCurve {\n fn new(x: f64, y: f64, length: f64, angle: i32) -> PeanoCurve {\n PeanoCurve {\n current_x: x,\n current_y: y,\n current_angle: angle,\n line_length: length,\n }\n }\n fn rewrite(order: usize) -> String {\n let mut str = String::from(\"L\");\n for _ in 0..order {\n let mut tmp = String::new();\n for ch in str.chars() {\n match ch {\n 'L' => tmp.push_str(\"LFRFL-F-RFLFR+F+LFRFL\"),\n 'R' => tmp.push_str(\"RFLFR+F+LFRFL-F-RFLFR\"),\n _ => tmp.push(ch),\n }\n }\n str = tmp;\n }\n str\n }\n fn execute(&mut self, order: usize) -> Path {\n let mut data = Data::new().move_to((self.current_x, self.current_y));\n for ch in PeanoCurve::rewrite(order).chars() {\n match ch {\n 'F' => data = self.draw_line(data),\n '+' => self.turn(90),\n '-' => self.turn(-90),\n _ => {}\n }\n }\n Path::new()\n .set(\"fill\", \"none\")\n .set(\"stroke\", \"black\")\n .set(\"stroke-width\", \"1\")\n .set(\"d\", data)\n }\n fn draw_line(&mut self, data: Data) -> Data {\n let theta = (self.current_angle as f64).to_radians();\n self.current_x += self.line_length * theta.cos();\n self.current_y += self.line_length * theta.sin();\n data.line_to((self.current_x, self.current_y))\n }\n fn turn(&mut self, angle: i32) {\n self.current_angle = (self.current_angle + angle) % 360;\n }\n fn save(file: &str, size: usize, order: usize) -> std::io::Result<()> {\n use svg::node::element::Rectangle;\n let rect = Rectangle::new()\n .set(\"width\", \"100%\")\n .set(\"height\", \"100%\")\n .set(\"fill\", \"white\");\n let mut p = PeanoCurve::new(8.0, 8.0, 8.0, 90);\n let document = svg::Document::new()\n .set(\"width\", size)\n .set(\"height\", size)\n .add(rect)\n .add(p.execute(order));\n svg::save(file, &document)\n }\n}\n\nfn main() {\n PeanoCurve::save(\"peano_curve.svg\", 656, 4).unwrap();\n}\n","language":"Rust"},{"code":"var rules = Hash(\n l => 'lFrFl-F-rFlFr+F+lFrFl',\n r => 'rFlFr+F+lFrFl-F-rFlFr',\n)\n\nvar lsys = LSystem(\n width: 500,\n height: 500,\n\n xoff: -50,\n yoff: -50,\n\n len: 5,\n angle: 90,\n color: 'dark green',\n)\n\nlsys.execute('l', 4, \"peano_curve.png\", rules)\n","language":"Sidef"},{"code":"Const WIDTH = 243 'a power of 3 for a evenly spaced curve\nDim n As Long\nDim points() As Single\nDim flag As Boolean\n'Store the coordinate pairs (x, y) generated by Peano into\n'a SafeArrayOfPoints with lineto. The number of points\n'generated depend on WIDTH. Peano is called twice. Once\n'to count the number of points, and twice to generate\n'the points after the dynamic array has been\n'redimensionalised.\n'VBA doesn't have a lineto method. Instead of AddLine, which\n'requires four parameters, including the begin pair of\n'coordinates, the method AddPolyline is used, which is\n'called from main after all the points are generated.\n'This creates a single object, whereas AddLine would\n'create thousands of small unconnected line objects.\nPrivate Sub lineto(x As Integer, y As Integer)\n If flag Then\n points(n, 1) = x\n points(n, 2) = y\n End If\n n = n + 1\nEnd Sub\nPrivate Sub Peano(ByVal x As Integer, ByVal y As Integer, ByVal lg As Integer, _\n ByVal i1 As Integer, ByVal i2 As Integer)\n If (lg = 1) Then\n Call lineto(x * 3, y * 3)\n Exit Sub\n End If\n lg = lg / 3\n Call Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\n Call Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\n Call Peano(x + lg, y + lg, lg, i1, 1 - i2)\n Call Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\n Call Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\n Call Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\n Call Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\n Call Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\n Call Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\nEnd Sub\nSub main()\n n = 1: flag = False\n Call Peano(0, 0, WIDTH, 0, 0) 'Start Peano recursion to count number of points\n ReDim points(1 To n - 1, 1 To 2)\n n = 1: flag = True\n Call Peano(0, 0, WIDTH, 0, 0) 'Start Peano recursion to generate and store points\n ActiveSheet.Shapes.AddPolyline points 'Excel assumed\nEnd Sub\n","language":"VBA"},{"code":"option explicit\n'outputs turtle graphics to svg file and opens it\n\nconst pi180= 0.01745329251994329576923690768489 ' pi/180\nconst pi=3.1415926535897932384626433832795 'pi\nclass turtle\n\n dim fso\n dim fn\n dim svg\n\n dim iang 'radians\n dim ori 'radians\n dim incr\n dim pdown\n dim clr\n dim x\n dim y\n\n public property let orient(n):ori = n*pi180 :end property\n public property let iangle(n):iang= n*pi180 :end property\n public sub pd() : pdown=true: end sub\n public sub pu() :pdown=FALSE :end sub\n\n public sub rt(i)\n ori=ori - i*iang:\n if ori<0 then ori = ori+pi*2\n end sub\n public sub lt(i):\n ori=(ori + i*iang)\n if ori>(pi*2) then ori=ori-pi*2\n end sub\n\n public sub bw(l)\n x= x+ cos(ori+pi)*l*incr\n y= y+ sin(ori+pi)*l*incr\n end sub\n\n public sub fw(l)\n dim x1,y1\n x1=x + cos(ori)*l*incr\n y1=y + sin(ori)*l*incr\n if pdown then line x,y,x1,y1\n x=x1:y=y1\n end sub\n\n Private Sub Class_Initialize()\n setlocale \"us\"\n initsvg\n pdown=true\n end sub\n\n Private Sub Class_Terminate()\n disply\n end sub\n\n private sub line (x,y,x1,y1)\n svg.WriteLine \"<line x1=\"\"\" & x & \"\"\" y1= \"\"\"& y & \"\"\" x2=\"\"\" & x1& \"\"\" y2=\"\"\" & y1 & \"\"\"/>\"\n end sub\n\n private sub disply()\n dim shell\n svg.WriteLine \"</svg></body></html>\"\n svg.close\n Set shell = CreateObject(\"Shell.Application\")\n shell.ShellExecute fn,1,False\n end sub\n\n private sub initsvg()\n dim scriptpath\n Set fso = CreateObject (\"Scripting.Filesystemobject\")\n ScriptPath= Left(WScript.ScriptFullName, InStrRev(WScript.ScriptFullName, \"\\\"))\n fn=Scriptpath & \"SIERP.HTML\"\n Set svg = fso.CreateTextFile(fn,True)\n if SVG IS nothing then wscript.echo \"Can't create svg file\" :vscript.quit\n svg.WriteLine \"<!DOCTYPE html>\" &vbcrlf & \"<html>\" &vbcrlf & \"<head>\"\n svg.writeline \"<style>\" & vbcrlf & \"line {stroke:rgb(255,0,0);stroke-width:.5}\" &vbcrlf &\"</style>\"\n svg.writeline \"</head>\"&vbcrlf & \"<body>\"\n svg.WriteLine \"<svg xmlns=\"\"http://www.w3.org/2000/svg\"\" width=\"\"800\"\" height=\"\"800\"\" viewBox=\"\"0 0 800 800\"\">\"\n end sub\nend class\n\nsub peano (n,a)\n if n=0 then exit sub\n x.rt a\n peano n-1, -a\n x.fw 1\n peano n-1, a\n x.fw 1\n peano n-1, -a\n x.lt a\nend sub\n\n dim x,i\nset x=new turtle\nx.iangle=90\nx.orient=0\nx.incr=7\nx.x=100:x.y=500\npeano 7,1\nset x=nothing 'show image in browser\n","language":"VBScript"},{"code":"import \"graphics\" for Canvas, Color, Point\nimport \"dome\" for Window\n\nclass Game {\n static init() {\n Window.title = \"Peano curve\"\n Canvas.resize(820, 820)\n Window.resize(820, 820)\n Canvas.cls(Color.white) // white background\n __points = []\n __width = 81\n peano(0, 0, __width, 0, 0)\n var col = Color.rgb(255, 0, 255) // magenta\n var prev = __points[0]\n for (p in __points.skip(1)) {\n var curr = p\n Canvas.line(prev.x, prev.y, curr.x, curr.y, col)\n prev = curr\n }\n }\n\n static peano(x, y, lg, i1, i2) {\n if (lg == 1) {\n var px = (__width - x) * 10\n var py = (__width - y) * 10\n __points.add(Point.new(px, py))\n return\n }\n lg = (lg/3).floor\n peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\n peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\n peano(x+lg, y+lg, lg, i1, 1-i2)\n peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\n peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\n peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\n peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\n peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\n peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\n }\n\n static update() {}\n\n static draw(dt) {}\n}\n","language":"Wren"},{"code":"proc Peano(X, Y, Lg, I1, I2);\nint X, Y, Lg, I1, I2;\n[if Lg = 1 then\n [Line(3*X, 3*Y, 11 \\cyan\\);\n return;\n ];\nLg:= Lg/3;\nPeano(X + 2*I1* Lg, Y + 2*I1* Lg, Lg, I1, I2);\nPeano(X + (I1-I2+1)*Lg, Y + (I1+I2)* Lg, Lg, I1, 1-I2);\nPeano(X + Lg, Y + Lg, Lg, I1, 1-I2);\nPeano(X + (I1+I2)* Lg, Y + (I1-I2+1)*Lg, Lg, 1-I1, 1-I2);\nPeano(X + 2*I2* Lg, Y + 2*(1-I2)* Lg, Lg, I1, I2);\nPeano(X + (1+I2-I1)*Lg, Y + (2-I1-I2)*Lg, Lg, I1, I2);\nPeano(X + 2*(1-I1)* Lg, Y + 2*(1-I1)* Lg, Lg, I1, I2);\nPeano(X + (2-I1-I2)*Lg, Y + (1+I2-I1)*Lg, Lg, 1-I1, I2);\nPeano(X + 2*(1-I2)* Lg, Y + 2*I2* Lg, Lg, 1-I1, I2);\n];\n\n[SetVid($13);\nPeano(0, 0, 3*3*3*3, 0, 0); \\start Peano recursion\n]\n","language":"XPL0"},{"code":"WIDTH = 243 //a power of 3 for a evenly spaced curve\n\nopen window 700, 700\n\nPeano(0, 0, WIDTH, 0, 0)\n\nSub Peano(x, y, lg, i1, i2)\n If (lg = 1) Then\n line x * 3, y * 3\n return\n End If\n lg = lg / 3\n Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\n Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\n Peano(x + lg, y + lg, lg, i1, 1 - i2)\n Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\n Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\n Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\n Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\n Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\n Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\nEnd Sub\n","language":"Yabasic"},{"code":"lsystem(\"L\",\t\t\t\t\t// axiom\n Dictionary(\"L\",\"LFRFL-F-RFLFR+F+LFRFL\", \"R\",\"RFLFR+F+LFRFL-F-RFLFR\"), # rules\n \"+-F\", 4)\t\t\t\t \t// constants, order\n: turtle(_);\n\nfcn lsystem(axiom,rules,consts,n){\t// Lindenmayer system --> string\n foreach k in (consts){ rules.add(k,k) }\n buf1,buf2 := Data(Void,axiom).howza(3), Data().howza(3); // characters\n do(n){\n buf1.pump(buf2.clear(), rules.get);\n t:=buf1; buf1=buf2; buf2=t;\t// swap buffers\n }\n buf1.text\t\t// n=4 --> 16,401 characters\n}\n","language":"Zkl"},{"code":"fcn turtle(koch){\n const D=10.0;\n dir,angle, x,y := 0.0, (90.0).toRad(), 20.0, 830.0; // turtle; x,y are float\n img,color := PPM(850,850), 0x00ff00;\n foreach c in (koch){\n switch(c){\n\t case(\"F\"){ // draw forward\n\t dx,dy := D.toRectangular(dir);\n\t tx,ty := x,y; x,y = (x+dx),(y+dy);\n\t img.line(tx.toInt(),ty.toInt(), x.toInt(),y.toInt(), color);\n\t }\n\t case(\"-\"){ dir-=angle } // turn right\n\t case(\"+\"){ dir+=angle } // turn left\n }\n }\n img.writeJPGFile(\"peanoCurve.zkl.jpg\");\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Peano_curve\\nnote: Fractals\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"<br/>\\n;Task\\n\\nProduce a graphical or ASCII-art representation of a [[wp:Peano curve|Peano curve]] of at least order 3.\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"DEFINE MAXSIZE=\\\"12\\\"\\n\\nINT ARRAY\\n angleStack(MAXSIZE)\\nBYTE ARRAY\\n depthStack(MAXSIZE),stageStack(MAXSIZE)\\nBYTE stacksize=[0]\\n\\nBYTE FUNC IsEmpty()\\n IF stacksize=0 THEN RETURN (1) FI\\nRETURN (0)\\n\\nBYTE FUNC IsFull()\\n IF stacksize=MAXSIZE THEN RETURN (1) FI\\nRETURN (0)\\n\\nPROC Push(INT angle BYTE depth,stage)\\n IF IsFull() THEN Break() FI\\n angleStack(stacksize)=angle\\n depthStack(stacksize)=depth\\n stageStack(stackSize)=stage\\n stacksize==+1\\nRETURN\\n\\nPROC Pop(INT POINTER angle BYTE POINTER depth,stage)\\n IF IsEmpty() THEN Break() FI\\n stacksize==-1\\n angle^=angleStack(stacksize)\\n depth^=depthStack(stacksize)\\n stage^=stageStack(stacksize)\\nRETURN\\n\\nINT FUNC Sin(INT a)\\n WHILE a<0 DO a==+360 OD\\n WHILE a>360 DO a==-360 OD\\n IF a=90 THEN\\n RETURN (1)\\n ELSEIF a=270 THEN\\n RETURN (-1)\\n FI\\nRETURN (0)\\n\\nINT FUNC Cos(INT a)\\nRETURN (Sin(a-90))\\n\\nPROC DrawPeano(INT x BYTE y,len BYTE depth)\\n BYTE stage\\n INT angle=[90],a\\n\\n Plot(x,y)\\n Push(90,depth,0)\\n\\n WHILE IsEmpty()=0\\n DO\\n Pop(@a,@depth,@stage)\\n IF stage<3 THEN\\n Push(a,depth,stage+1)\\n FI\\n IF stage=0 THEN\\n angle==+a\\n IF depth>1 THEN\\n Push(-a,depth-1,0)\\n FI\\n ELSEIF stage=1 THEN\\n x==+len*Cos(angle)\\n y==-len*Sin(angle)\\n DrawTo(x,y)\\n IF depth>1 THEN\\n Push(a,depth-1,0)\\n FI\\n ELSEIF stage=2 THEN\\n x==+len*Cos(angle)\\n y==-len*Sin(angle)\\n DrawTo(x,y)\\n IF depth>1 THEN\\n Push(-a,depth-1,0)\\n FI\\n ELSEIF stage=3 THEN\\n angle==-a\\n FI\\n OD\\nRETURN\\n\\nPROC Main()\\n BYTE CH=$02FC,COLOR1=$02C5,COLOR2=$02C6\\n\\n Graphics(8+16)\\n Color=1\\n COLOR1=$0C\\n COLOR2=$02\\n\\n DrawPeano(69,186,7,6)\\n\\n DO UNTIL CH#$FF OD\\n CH=$FF\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with PDF_Out; use PDF_Out;\\n\\nprocedure Peano_Curve is\\n\\n Filename : constant String := \\\"peano-curve.pdf\\\";\\n Order : constant Positive := 4;\\n Scale : constant Real := 2.1;\\n Line_Width : constant Real := 2.5;\\n Corner : constant Point := (150.0, 50.0);\\n Background : constant Color_Type := (0.827, 0.816, 0.016);\\n Frame : constant Rectangle := (10.0, 10.0, 820.0, 575.0);\\n PDF : PDF_Out_File;\\n\\n type Coord is record\\n X, Y : Natural;\\n end record;\\n\\n function \\\"+\\\" (Left : Coord; Right : Coord) return Coord\\n is ((Left.X + Right.X, Left.Y + Right.Y));\\n\\n function \\\"*\\\" (Left : Natural; Right : Coord) return Coord\\n is ((Left * Right.X, Left * Right.Y));\\n\\n procedure Peano (Pos : Coord; Length : Positive; I1, I2 : Integer) is\\n Len : constant Integer := Length / 3;\\n begin\\n if Length = 1 then\\n PDF.Line (Corner + Scale * (Real (3 * Pos.X), Real (3 * Pos.Y)));\\n else\\n Peano (Pos + Len * (2 * I1, 2 * I1), Len, I1, I2);\\n Peano (Pos + Len * (I1 - I2 + 1, I1 + I2), Len, I1, 1 - I2);\\n Peano (Pos + Len * (1, 1), Len, I1, 1 - I2);\\n Peano (Pos + Len * (I1 + I2, I1 - I2 + 1), Len, 1 - I1, 1 - I2);\\n Peano (Pos + Len * (2 * I2, 2 - 2 * I2), Len, I1, I2);\\n Peano (Pos + Len * (1 + I2 - I1, 2 - I1 - I2), Len, I1, I2);\\n Peano (Pos + Len * (2 - 2 * I1, 2 - 2 * I1), Len, I1, I2);\\n Peano (Pos + Len * (2 - I1 - I2, 1 + I2 - I1), Len, 1 - I1, I2);\\n Peano (Pos + Len * (2 - 2 * I2, 2 * I2), Len, 1 - I1, I2);\\n end if;\\n end Peano;\\n\\n procedure Draw_Peano is\\n begin\\n PDF.Stroking_Color (Black);\\n PDF.Line_Width (Line_Width);\\n PDF.Move (Corner);\\n Peano ((0, 0), 3**Order, 0, 0);\\n PDF.Finish_Path (Close_Path => False,\\n Rendering => Stroke,\\n Rule => Nonzero_Winding_Number);\\n end Draw_Peano;\\n\\nbegin\\n PDF.Create (Filename);\\n PDF.Page_Setup (A4_Landscape);\\n\\n PDF.Color (Background);\\n PDF.Draw (Frame, Fill);\\n\\n Draw_Peano;\\n PDF.Close;\\nend Peano_Curve;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"BEGIN # Peano Curve in SVG #\\n # uses the RC Algol 68 L-System library for the L-System evaluation & #\\n # interpretation #\\n\\n PR read \\\"lsystem.incl.a68\\\" PR # include L-System utilities #\\n\\n PROC peano curve = ( STRING fname, INT size, length, order, init x, init y )VOID:\\n IF FILE svg file;\\n BOOL open error := IF open( svg file, fname, stand out channel ) = 0\\n THEN\\n # opened OK - file already exists and #\\n # will be overwritten #\\n FALSE\\n ELSE\\n # failed to open the file #\\n # - try creating a new file #\\n establish( svg file, fname, stand out channel ) /= 0\\n FI;\\n open error\\n THEN # failed to open the file #\\n print( ( \\\"Unable to open \\\", fname, newline ) );\\n stop\\n ELSE # file opened OK #\\n\\n REAL x := init x;\\n REAL y := init y;\\n INT angle := 90;\\n put( svg file, ( \\\"<svg xmlns='http://www.w3.org/2000/svg' width='\\\"\\n , whole( size, 0 ), \\\"' height='\\\", whole( size, 0 ), \\\"'>\\\"\\n , newline, \\\"<rect width='100%' height='100%' fill='white'/>\\\"\\n , newline, \\\"<path stroke-width='1' stroke='black' fill='none' d='\\\"\\n , newline, \\\"M\\\", whole( x, 0 ), \\\",\\\", whole( y, 0 ), newline\\n )\\n );\\n\\n LSYSTEM ssc = ( \\\"L\\\"\\n , ( \\\"L\\\" -> \\\"LFRFL-F-RFLFR+F+LFRFL\\\"\\n , \\\"R\\\" -> \\\"RFLFR+F+LFRFL-F-RFLFR\\\"\\n )\\n );\\n STRING curve = ssc EVAL order;\\n curve INTERPRET ( ( CHAR c )VOID:\\n IF c = \\\"F\\\" THEN\\n x +:= length * cos( angle * pi / 180 );\\n y +:= length * sin( angle * pi / 180 );\\n put( svg file, ( \\\" L\\\", whole( x, 0 ), \\\",\\\", whole( y, 0 ), newline ) )\\n ELIF c = \\\"+\\\" THEN\\n angle +:= 90 MODAB 360\\n ELIF c = \\\"-\\\" THEN\\n angle -:= 90 MODAB 360\\n FI\\n );\\n\\n put( svg file, ( \\\"'/>\\\", newline, \\\"</svg>\\\", newline ) );\\n close( svg file )\\n FI # sierpinski square # ;\\n\\n peano curve( \\\"peano.svg\\\", 1200, 12, 3, 50, 50 )\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"gdip1()\\nPeanoX := A_ScreenWidth/2 - 100, PeanoY := A_ScreenHeight/2 - 100\\nPeano(PeanoX, PeanoY, 3**3, 5, 5, Arr:=[])\\nxmin := xmax := ymin := ymax := 0\\nfor i, point in Arr\\n{\\n\\txmin := A_Index = 1 ? point.x : xmin < point.x ? xmin : point.x\\n\\txmax := point.x > xmax ? point.x : xmax\\n\\tymin := A_Index = 1 ? point.y : ymin < point.y ? ymin : point.y\\n\\tymax := point.y > ymax ? point.y : ymax\\n}\\nfor i, point in Arr\\n\\tpoints .= point.x - xmin + PeanoX \\\",\\\" point.y - ymin + PeanoY \\\"|\\\"\\npoints := Trim(points, \\\"|\\\")\\nGdip_DrawLines(G, pPen, Points)\\nUpdateLayeredWindow(hwnd1, hdc, 0, 0, Width, Height)\\nreturn\\n; ---------------------------------------------------------------\\nPeano(x, y, lg, i1, i2, Arr) {\\n\\tif (lg =1 )\\n\\t{\\n\\t\\tArr[Arr.count()+1, \\\"x\\\"] := x\\n\\t\\tArr[Arr.count(), \\\"y\\\"] := y\\n\\t\\treturn\\n\\t}\\n\\tlg := lg/3\\n\\tPeano(x+(2*i1*lg)\\t, y+(2*i1*lg)\\t\\t, lg\\t, i1\\t, i2\\t, Arr)\\n\\tPeano(x+((i1-i2+1)*lg)\\t, y+((i1+i2)*lg)\\t, lg\\t, i1\\t, 1-i2\\t, Arr)\\n\\tPeano(x+lg\\t\\t, y+lg\\t\\t\\t, lg\\t, i1\\t, 1-i2\\t, Arr)\\n\\tPeano(x+((i1+i2)*lg)\\t, y+((i1-i2+1)*lg)\\t, lg\\t, 1-i1\\t, 1-i2\\t, Arr)\\n\\tPeano(x+(2*i2*lg)\\t, y+(2*(1-i2)*lg)\\t, lg\\t, i1\\t, i2\\t, Arr)\\n\\tPeano(x+((1+i2-i1)*lg)\\t, y+((2-i1-i2)*lg)\\t, lg\\t, i1\\t, i2\\t, Arr)\\n\\tPeano(x+(2*(1-i1)*lg)\\t, y+(2*(1-i1)*lg)\\t, lg\\t, i1\\t, i2\\t, Arr)\\n\\tPeano(x+((2-i1-i2)*lg)\\t, y+((1+i2-i1)*lg)\\t, lg\\t, 1-i1\\t, i2\\t, Arr)\\n\\tPeano(x+(2*(1-i2)*lg)\\t, y+(2*i2*lg)\\t\\t, lg\\t, 1-i1\\t, i2\\t, Arr)\\n}\\n; ---------------------------------------------------------------\\ngdip1(){\\n\\tglobal\\n\\tIf !pToken := Gdip_Startup()\\n\\t{\\n\\t\\tMsgBox, 48, gdiplus error!, Gdiplus failed to start. Please ensure you have gdiplus on your system\\n\\t\\tExitApp\\n\\t}\\n\\tOnExit, Exit\\n\\tWidth := A_ScreenWidth, Height := A_ScreenHeight\\n\\tGui, 1: -Caption +E0x80000 +LastFound +OwnDialogs +Owner +AlwaysOnTop\\n\\tGui, 1: Show, NA\\n\\thwnd1 := WinExist()\\n\\thbm := CreateDIBSection(Width, Height)\\n\\thdc := CreateCompatibleDC()\\n\\tobm := SelectObject(hdc, hbm)\\n\\tG := Gdip_GraphicsFromHDC(hdc)\\n\\tGdip_SetSmoothingMode(G, 4)\\n\\tpPen := Gdip_CreatePen(0xFFFF0000, 2)\\n}\\n; ---------------------------------------------------------------\\ngdip2(){\\n\\tglobal\\n\\tGdip_DeleteBrush(pBrush)\\n\\tGdip_DeletePen(pPen)\\n\\tSelectObject(hdc, obm)\\n\\tDeleteObject(hbm)\\n\\tDeleteDC(hdc)\\n\\tGdip_DeleteGraphics(G)\\n}\\n; ---------------------------------------------------------------\\nExit:\\ngdip2()\\nGdip_Shutdown(pToken)\\nExitApp\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"/*Abhishek Ghosh, 14th September 2018*/\\n\\n#include <graphics.h>\\n#include <math.h>\\n\\nvoid Peano(int x, int y, int lg, int i1, int i2) {\\n\\n\\tif (lg == 1) {\\n\\t\\tlineto(3*x,3*y);\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tlg = lg/3;\\n\\tPeano(x+(2*i1*lg), y+(2*i1*lg), lg, i1, i2);\\n\\tPeano(x+((i1-i2+1)*lg), y+((i1+i2)*lg), lg, i1, 1-i2);\\n\\tPeano(x+lg, y+lg, lg, i1, 1-i2);\\n\\tPeano(x+((i1+i2)*lg), y+((i1-i2+1)*lg), lg, 1-i1, 1-i2);\\n\\tPeano(x+(2*i2*lg), y+(2*(1-i2)*lg), lg, i1, i2);\\n\\tPeano(x+((1+i2-i1)*lg), y+((2-i1-i2)*lg), lg, i1, i2);\\n\\tPeano(x+(2*(1-i1)*lg), y+(2*(1-i1)*lg), lg, i1, i2);\\n\\tPeano(x+((2-i1-i2)*lg), y+((1+i2-i1)*lg), lg, 1-i1, i2);\\n\\tPeano(x+(2*(1-i2)*lg), y+(2*i2*lg), lg, 1-i1, i2);\\n}\\n\\nint main(void) {\\n\\n\\tinitwindow(1000,1000,\\\"Peano, Peano\\\");\\n\\n\\tPeano(0, 0, 1000, 0, 0); /* Start Peano recursion. */\\n\\t\\n\\tgetch();\\n\\tcleardevice();\\n\\t\\n\\treturn 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cmath>\\n#include <fstream>\\n#include <iostream>\\n#include <string>\\n\\nclass peano_curve {\\npublic:\\n void write(std::ostream& out, int size, int length, int order);\\nprivate:\\n static std::string rewrite(const std::string& s);\\n void line(std::ostream& out);\\n void execute(std::ostream& out, const std::string& s);\\n double x_;\\n double y_;\\n int angle_;\\n int length_;\\n};\\n\\nvoid peano_curve::write(std::ostream& out, int size, int length, int order) {\\n length_ = length;\\n x_ = length;\\n y_ = length;\\n angle_ = 90;\\n out << \\\"<svg xmlns='http://www.w3.org/2000/svg' width='\\\"\\n << size << \\\"' height='\\\" << size << \\\"'>\\\\n\\\";\\n out << \\\"<rect width='100%' height='100%' fill='white'/>\\\\n\\\";\\n out << \\\"<path stroke-width='1' stroke='black' fill='none' d='\\\";\\n std::string s = \\\"L\\\";\\n for (int i = 0; i < order; ++i)\\n s = rewrite(s);\\n execute(out, s);\\n out << \\\"'/>\\\\n</svg>\\\\n\\\";\\n}\\n\\nstd::string peano_curve::rewrite(const std::string& s) {\\n std::string t;\\n for (char c : s) {\\n switch (c) {\\n case 'L':\\n t += \\\"LFRFL-F-RFLFR+F+LFRFL\\\";\\n break;\\n case 'R':\\n t += \\\"RFLFR+F+LFRFL-F-RFLFR\\\";\\n break;\\n default:\\n t += c;\\n break;\\n }\\n }\\n return t;\\n}\\n\\nvoid peano_curve::line(std::ostream& out) {\\n double theta = (3.14159265359 * angle_)/180.0;\\n x_ += length_ * std::cos(theta);\\n y_ += length_ * std::sin(theta);\\n out << \\\" L\\\" << x_ << ',' << y_;\\n}\\n\\nvoid peano_curve::execute(std::ostream& out, const std::string& s) {\\n out << 'M' << x_ << ',' << y_;\\n for (char c : s) {\\n switch (c) {\\n case 'F':\\n line(out);\\n break;\\n case '+':\\n angle_ = (angle_ + 90) % 360;\\n break;\\n case '-':\\n angle_ = (angle_ - 90) % 360;\\n break;\\n }\\n }\\n}\\n\\nint main() {\\n std::ofstream out(\\\"peano_curve.svg\\\");\\n if (!out) {\\n std::cerr << \\\"Cannot open output file\\\\n\\\";\\n return 1;\\n }\\n peano_curve pc;\\n pc.write(out, 656, 8, 4);\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"proc lsysexp level . axiom$ rules$[] .\\n for l to level\\n an$ = \\\"\\\"\\n for c$ in strchars axiom$\\n for i = 1 step 2 to len rules$[]\\n if rules$[i] = c$\\n c$ = rules$[i + 1]\\n break 1\\n .\\n .\\n an$ &= c$\\n .\\n swap axiom$ an$\\n .\\n.\\nproc lsysdraw axiom$ x y ang . .\\n linewidth 0.3\\n move x y\\n for c$ in strchars axiom$\\n if c$ = \\\"F\\\"\\n x += cos dir\\n y += sin dir\\n line x y\\n elif c$ = \\\"-\\\"\\n dir -= ang\\n elif c$ = \\\"+\\\"\\n dir += ang\\n .\\n .\\n.\\naxiom$ = \\\"L\\\"\\nrules$[] = [ \\\"L\\\" \\\"LFRFL-F-RFLFR+F+LFRFL\\\" \\\"R\\\" \\\"RFLFR+F+LFRFL-F-RFLFR\\\" ]\\nlsysexp 4 axiom$ rules$[]\\nlsysdraw axiom$ 5 90 90\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"USING: accessors L-system ui ;\\n\\n: peano ( L-system -- L-system )\\n L-parser-dialect >>commands\\n [ 90 >>angle ] >>turtle-values\\n \\\"L\\\" >>axiom\\n {\\n { \\\"L\\\" \\\"LFRFL-F-RFLFR+F+LFRFL\\\" }\\n { \\\"R\\\" \\\"RFLFR+F+LFRFL-F-RFLFR\\\" }\\n } >>rules ;\\n\\n[ <L-system> peano \\\"Peano curve\\\" open-window ] with-ui\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Const anchura = 243 'una potencia de 3 para una curva uniformemente espaciada\\n\\nScreenres 700,700\\n\\nSub Peano(x As Integer, y As Integer, lg As Integer, i1 As Integer, i2 As Integer)\\n If lg = 1 Then\\n Line - (x * 3, y * 3)\\n Return\\n End If\\n lg /= 3\\n Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\\n Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\\n Peano(x + lg, y + lg, lg, i1, 1 - i2)\\n Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\\n Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\\n Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\\n Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\\n Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\\n Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\\nEnd Sub\\n\\nPeano(0, 0, anchura, 0, 0)\\n\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"_window = 1\\n_curveSize = 7\\n_curveOrder = 3 * 3 * 3 * 3 // 3^4\\n\\nvoid local fn BuildWindow\\n CGRect r = fn CGRectMake( 0, 0, 565, 570 )\\n window _window, @\\\"Peano Curve In FutureBasic\\\", r, NSWindowStyleMaskTitled\\n WindowSetBackgroundColor( _window, fn ColorBlack )\\nend fn\\n\\nlocal fn Peano( x as long, y as long, lg as long, i1 as long, i2 as long )\\n ColorRef color = fn ColorRed\\n\\n if ( lg == 1 ) then line to x * _curveSize, y * _curveSize : exit fn\\n lg /= 3\\n\\n select ( rnd(8) )\\n case 1 : color = fn ColorBrown\\n case 2 : color = fn ColorRed\\n case 3 : color = fn ColorOrange\\n case 4 : color = fn ColorYellow\\n case 5 : color = fn ColorGreen\\n case 6 : color = fn ColorBlue\\n case 7 : color = fn ColorPurple\\n case 8 : color = fn ColorWhite\\n end select\\n\\n pen 2, color\\n fn Peano( x + 2*i1* lg, y + 2*i1* lg, lg, i1, i2 )\\n fn Peano( x + (i1-i2+1)*lg, y + (i1+i2)* lg, lg, i1, 1-i2 )\\n fn Peano( x + lg, y + lg, lg, i1, 1-i2 )\\n fn Peano( x + (i1+i2)* lg, y + (i1-i2+1)*lg, lg, 1-i1, 1-i2 )\\n fn Peano( x + 2*i2* lg, y + 2*(1-i2)* lg, lg, i1, i2 )\\n fn Peano( x + (1+i2-i1)*lg, y + (2-i1-i2)*lg, lg, i1, i2 )\\n fn Peano( x + 2*(1-i1)* lg, y + 2*(1-i1)* lg, lg, i1, i2 )\\n fn Peano( x + (2-i1-i2)*lg, y + (1+i2-i1)*lg, lg, 1-i1, i2 )\\n fn Peano( x + 2*(1-i2)* lg, y + 2*i2* lg, lg, 1-i1, i2 )\\nend fn\\n\\nrandomize\\nfn BuildWindow\\nfn Peano( 0, 0, _curveOrder, 0, 0 )\\n\\nHandleEvents\\n\",\n \"language\": \"FutureBasic\"\n },\n {\n \"code\": \"package main\\n\\nimport \\\"github.com/fogleman/gg\\\"\\n\\nvar points []gg.Point\\n\\nconst width = 81\\n\\nfunc peano(x, y, lg, i1, i2 int) {\\n if lg == 1 {\\n px := float64(width-x) * 10\\n py := float64(width-y) * 10\\n points = append(points, gg.Point{px, py})\\n return\\n }\\n lg /= 3\\n peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\\n peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\\n peano(x+lg, y+lg, lg, i1, 1-i2)\\n peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\\n peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\\n peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\\n peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\\n peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\\n peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\\n}\\n\\nfunc main() {\\n peano(0, 0, width, 0, 0)\\n dc := gg.NewContext(820, 820)\\n dc.SetRGB(1, 1, 1) // White background\\n dc.Clear()\\n for _, p := range points {\\n dc.LineTo(p.X, p.Y)\\n }\\n dc.SetRGB(1, 0, 1) // Magenta curve\\n dc.SetLineWidth(1)\\n dc.Stroke()\\n dc.SavePNG(\\\"peano.png\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"100 PROGRAM \\\"PeanoC.bas\\\"\\n110 OPTION ANGLE DEGREES\\n120 SET VIDEO MODE 5:SET VIDEO COLOR 0:SET VIDEO X 40:SET VIDEO Y 27\\n130 OPEN #101:\\\"video:\\\"\\n140 DISPLAY #101:AT 1 FROM 1 TO 27\\n150 PLOT 280,240,ANGLE 90;\\n160 CALL PEANO(28,90,6)\\n170 DEF PEANO(D,A,LEV)\\n180 IF LEV=0 THEN EXIT DEF\\n190 PLOT RIGHT A;\\n200 CALL PEANO(D,-A,LEV-1)\\n210 PLOT FORWARD D;\\n220 CALL PEANO(D,A,LEV-1)\\n230 PLOT FORWARD D;\\n240 CALL PEANO(D,-A,LEV-1)\\n250 PLOT LEFT A;\\n260 END DEF\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"load'viewmat'\\nhp=: 3 : '(|.,]) 1 (0 _2 _2 ,&.> _2 _1 0 + #y) } (,.|:) y'\\nHP=: 3 3 $ 0 0 0 0 1\\nWR=: 16777215 16711680\\nviewrgb WR {~ hp ^:7 HP\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" require 'viewmat'\\n hp=: 3 : '(|.,]) 1 (0 _2 _2 ,&.> _2 _1 0 + #y) } (,.|:) y'\\n MG=: 256 #. 128 0 128,:0 192 0\\n viewrgb 2 ([ # #\\\"1) MG {~ hp ^:6 [ 0, 0 1 0 ,: 0,\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.io.*;\\n\\npublic class PeanoCurve {\\n public static void main(final String[] args) {\\n try (Writer writer = new BufferedWriter(new FileWriter(\\\"peano_curve.svg\\\"))) {\\n PeanoCurve s = new PeanoCurve(writer);\\n final int length = 8;\\n s.currentAngle = 90;\\n s.currentX = length;\\n s.currentY = length;\\n s.lineLength = length;\\n s.begin(656);\\n s.execute(rewrite(4));\\n s.end();\\n } catch (final Exception ex) {\\n ex.printStackTrace();\\n }\\n }\\n\\n private PeanoCurve(final Writer writer) {\\n this.writer = writer;\\n }\\n\\n private void begin(final int size) throws IOException {\\n write(\\\"<svg xmlns='http://www.w3.org/2000/svg' width='%d' height='%d'>\\\\n\\\", size, size);\\n write(\\\"<rect width='100%%' height='100%%' fill='white'/>\\\\n\\\");\\n write(\\\"<path stroke-width='1' stroke='black' fill='none' d='\\\");\\n }\\n\\n private void end() throws IOException {\\n write(\\\"'/>\\\\n</svg>\\\\n\\\");\\n }\\n\\n private void execute(final String s) throws IOException {\\n write(\\\"M%g,%g\\\\n\\\", currentX, currentY);\\n for (int i = 0, n = s.length(); i < n; ++i) {\\n switch (s.charAt(i)) {\\n case 'F':\\n line(lineLength);\\n break;\\n case '+':\\n turn(ANGLE);\\n break;\\n case '-':\\n turn(-ANGLE);\\n break;\\n }\\n }\\n }\\n\\n private void line(final double length) throws IOException {\\n final double theta = (Math.PI * currentAngle) / 180.0;\\n currentX += length * Math.cos(theta);\\n currentY += length * Math.sin(theta);\\n write(\\\"L%g,%g\\\\n\\\", currentX, currentY);\\n }\\n\\n private void turn(final int angle) {\\n currentAngle = (currentAngle + angle) % 360;\\n }\\n\\n private void write(final String format, final Object... args) throws IOException {\\n writer.write(String.format(format, args));\\n }\\n\\n private static String rewrite(final int order) {\\n String s = \\\"L\\\";\\n for (int i = 0; i < order; ++i) {\\n final StringBuilder sb = new StringBuilder();\\n for (int j = 0, n = s.length(); j < n; ++j) {\\n final char ch = s.charAt(j);\\n if (ch == 'L')\\n sb.append(\\\"LFRFL-F-RFLFR+F+LFRFL\\\");\\n else if (ch == 'R')\\n sb.append(\\\"RFLFR+F+LFRFL-F-RFLFR\\\");\\n else\\n sb.append(ch);\\n }\\n s = sb.toString();\\n }\\n return s;\\n }\\n\\n private final Writer writer;\\n private double lineLength;\\n private double currentX;\\n private double currentY;\\n private int currentAngle;\\n private static final int ANGLE = 90;\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# => = 0 degrees\\n# ^ = 90 degrees\\n# <= = 180 degrees\\n# v = 270 degrees\\n\\n# $start : [$x, $y]\\ndef turtle($start):\\n $start\\n | if type == \\\"array\\\" then \\\"M \\\\($start|join(\\\",\\\"))\\\" else \\\"M 0,0\\\" end\\n | {svg: ., up:true, angle:0};\\n\\ndef turtleUp: .up=true;\\ndef turtleDown: .up=false;\\n\\ndef turtleRotate($angle): .angle = (360 + (.angle + $angle)) % 360;\\n\\ndef turtleForward($d):\\n if .up\\n then if .angle== 0 then .svg += \\\" m \\\\($d),0\\\"\\n elif .angle== 90 then .svg += \\\" m 0,-\\\\($d)\\\"\\n elif .angle==180 then .svg += \\\" m -\\\\($d),0\\\"\\n elif .angle==270 then .svg += \\\" m 0,\\\\($d)\\\"\\n else \\\"unsupported angle \\\\(.angle)\\\" | error\\n end\\n else if .angle== 0 then .svg += \\\" h \\\\($d)\\\"\\n elif .angle== 90 then .svg += \\\" v -\\\\($d)\\\"\\n elif .angle==180 then .svg += \\\" h -\\\\($d)\\\"\\n elif .angle==270 then .svg += \\\" v \\\\($d)\\\"\\n else \\\"unsupported angle \\\\(.angle)\\\" | error\\n end\\n end;\\n\\ndef svg($size):\\n \\\"<svg viewBox=\\\\\\\"0 0 \\\\($size) \\\\($size)\\\\\\\" xmlns=\\\\\\\"http://www.w3.org/2000/svg\\\\\\\">\\\",\\n .,\\n \\\"</svg>\\\";\\n\\ndef path($fill; $stroke; $width):\\n \\\"<path fill=\\\\\\\"\\\\($fill)\\\\\\\" stroke=\\\\\\\"\\\\($stroke)\\\\\\\" stroke-width=\\\\\\\"\\\\($width)\\\\\\\" d=\\\\\\\"\\\\(.svg)\\\\\\\" />\\\";\\n\\ndef draw:\\n path(\\\"none\\\"; \\\"red\\\"; \\\"0.1\\\") | svg(100) ;\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Compute the curve using a Lindenmayer system of rules\\ndef rules:\\n { L: \\\"LFRFL-F-RFLFR+F+LFRFL\\\",\\n R: \\\"RFLFR+F+LFRFL-F-RFLFR\\\" } ;\\n\\ndef peano($count):\\n rules as $rules\\n | def p($count):\\n if $count <= 0 then .\\n else gsub(\\\"L\\\"; \\\"l\\\") | gsub(\\\"R\\\"; $rules[\\\"R\\\"]) | gsub(\\\"l\\\"; $rules[\\\"L\\\"]) | p($count-1)\\n end;\\n \\\"L\\\" | p($count) ;\\n\\ndef interpret($x):\\n if $x == \\\"+\\\" then turtleRotate(90)\\n elif $x == \\\"-\\\" then turtleRotate(-90)\\n elif $x == \\\"F\\\" then turtleForward(1)\\n else .\\n end;\\n\\ndef peano_curve($n):\\n peano($n)\\n | split(\\\"\\\")\\n | reduce .[] as $action (turtle([1,1]) | turtleDown;\\n interpret($action) ) ;\\n\\npeano_curve(4)\\n| draw\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"# Input: an array\\n# Output: the array augmented with another x,y pair\\ndef peano($x; $y; $lg; $i1; $i2):\\n $lg as $width\\n | def p($x; $y; $lg; $i1; $i2):\\n if $lg == 1\\n then (($width - $x) * 10) as $px\\n | (($width - $y) * 10) as $py\\n | . + [[$px,$py]]\\n else (($lg/3) | floor) as $lg\\n | p($x+2*$i1*$lg; $y+2*$i1*$lg; $lg; $i1; $i2)\\n | p($x+($i1-$i2+1)*$lg; $y+($i1+$i2)*$lg; $lg; $i1; 1-$i2)\\n | p($x+$lg; $y+$lg; $lg; $i1; 1-$i2)\\n | p($x+($i1+$i2)*$lg; $y+($i1-$i2+1)*$lg; $lg; 1-$i1; 1-$i2)\\n | p($x+2*$i2*$lg; $y+2*(1-$i2)*$lg; $lg; $i1; $i2)\\n | p($x+(1+$i2-$i1)*$lg; $y+(2-$i1-$i2)*$lg; $lg; $i1; $i2)\\n | p($x+2*(1-$i1)*$lg; $y+2*(1-$i1)*$lg; $lg; $i1; $i2)\\n | p($x+(2-$i1-$i2)*$lg; $y+(1+$i2-$i1)*$lg; $lg; 1-$i1; $i2)\\n | p($x+2*(1-$i2)*$lg; $y+2*$i2*$lg; $lg; 1-$i1; $i2)\\n end;\\n p($x; $y; $lg; $i1; $i2);\\n\\ndef svg:\\n \\\"<svg viewBox=\\\\\\\"0 0 820 820\\\\\\\" xmlns=\\\\\\\"http://www.w3.org/2000/svg\\\\\\\">\\\" ;\\n\\ndef path($fill; $stroke):\\n \\\"<path fill=\\\\\\\"\\\\($fill)\\\\\\\" stroke=\\\\\\\"\\\\($stroke)\\\\\\\" d=\\\\\\\"M \\\";\\n\\ndef endpath:\\n \\\" \\\\\\\" /> </svg>\\\";\\n\\ndef peanoCurve:\\n null | peano(0; 0; 81; 0; 0) | map(join(\\\",\\\")) | join(\\\" \\\");\\n\\nsvg,\\n( path(\\\"none\\\"; \\\"red\\\") + peanoCurve + endpath)\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Gtk, Graphics, Colors\\n\\nfunction peano(ctx, x, y, lg, i1, i2)\\n if lg < 3\\n line_to(ctx, x - 250, y - 250)\\n stroke(ctx)\\n move_to(ctx, x - 250 , y - 250)\\n else\\n lg = div(lg, 3)\\n peano(ctx, x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\\n peano(ctx, x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\\n peano(ctx, x + lg, y + lg, lg, i1, 1 - i2)\\n peano(ctx, x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\\n peano(ctx, x + (2 * i2 * lg), y + ( 2 * (1-i2) * lg), lg, i1, i2)\\n peano(ctx, x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\\n peano(ctx, x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\\n peano(ctx, x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\\n peano(ctx, x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\\n end\\nend\\n\\nconst can = @GtkCanvas()\\nconst win = GtkWindow(can, \\\"Peano Curve\\\", 500, 500)\\n\\n@guarded draw(can) do widget\\n ctx = getgc(can)\\n h = height(can)\\n w = width(can)\\n set_source(ctx, colorant\\\"blue\\\")\\n set_line_width(ctx, 1)\\n peano(ctx, w/2, h/2, 500, 0, 0)\\nend\\n\\nshow(can)\\nconst cond = Condition()\\nendit(w) = notify(cond)\\nsignal_connect(endit, win, :destroy)\\nwait(cond)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"local PeanoLSystem = {\\n axiom = \\\"L\\\",\\n rules = {\\n L = \\\"LFRFL-F-RFLFR+F+LFRFL\\\",\\n R = \\\"RFLFR+F+LFRFL-F-RFLFR\\\"\\n },\\n eval = function(self, n)\\n local source, result = self.axiom\\n for i = 1, n do\\n result = \\\"\\\"\\n for j = 1, #source do\\n local ch = source:sub(j,j)\\n result = result .. (self.rules[ch] and self.rules[ch] or ch)\\n end\\n source = result\\n end\\n return result\\n end\\n}\\n\\nfunction Bitmap:drawPath(path, x, y, dx, dy)\\n self:set(x, y, \\\"@\\\")\\n for i = 1, #path do\\n local ch = path:sub(i,i)\\n if (ch == \\\"F\\\") then\\n local reps = dx==0 and 1 or 3 -- aspect correction\\n for r = 1, reps do\\n x, y = x+dx, y+dy\\n self:set(x, y, dx==0 and \\\"|\\\" or \\\"-\\\")\\n end\\n x, y = x+dx, y+dy\\n self:set(x, y, \\\"+\\\")\\n elseif (ch ==\\\"-\\\") then\\n dx, dy = dy, -dx\\n elseif (ch == \\\"+\\\") then\\n dx, dy = -dy, dx\\n end\\n end\\n self:set(x, y, \\\"X\\\")\\nend\\n\\nfunction Bitmap:render()\\n for y = 1, self.height do\\n print(table.concat(self.pixels[y]))\\n end\\nend\\n\\nbitmap = Bitmap(53*2,53)\\nbitmap:clear(\\\" \\\")\\nbitmap:drawPath(PeanoLSystem:eval(3), 0, 0, 0, 1)\\nbitmap:render()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"Module Peano_curve {\\nCls 1, 0\\nConst Center=2\\nReport Center, \\\"Peano curve\\\"\\nlet factor=.9, k=3, wi=k^4\\nlet wi2=min.data(scale.x*factor, scale.y*factor), n=wi2/wi\\nlet (dx, dy)=((scale.x-wi2)/2, (scale.y-wi2)/2)\\ndx+=k*1.2*twipsX\\ndy+=k*1.2*twipsY\\nmove dx, dy\\npen 11 {\\n Peano(0,0,wi,0, 0)\\n}\\n\\nsub Peano(x, y, lg, i1, i2)\\n if lg ==1 then\\n draw to x*n+dx , y*n+dy\\n return\\n end if\\n lg/=k\\n Peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\\n Peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\\n Peano(x+lg, y+lg, lg, i1, 1-i2)\\n Peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\\n Peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\\n Peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\\n Peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\\n Peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\\n Peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\\nend sub\\n}\\nPeano_curve\\n\",\n \"language\": \"M2000-Interpreter\"\n },\n {\n \"code\": \"Graphics[PeanoCurve[4]]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import imageman\\n\\nconst Width = 81\\n\\nproc peano(points: var seq[Point]; x, y, lg, i1, i2: int) =\\n\\n if lg == 1:\\n points.add ((Width - x) * 10, (Width - y) * 10)\\n return\\n\\n let lg = lg div 3\\n points.peano(x + 2 * i1 * lg, y + 2 * i1 * lg, lg, i1, i2)\\n points.peano(x + (i1 - i2 + 1) * lg, y + (i1 + i2) * lg, lg, i1, 1 - i2)\\n points.peano(x + lg, y + lg, lg, i1, 1 - i2)\\n points.peano(x + (i1 + i2) * lg, y + (i1 - i2 + 1) * lg, lg, 1 - i1, 1 - i2)\\n points.peano(x + 2 * i2 * lg, y + 2 * (1-i2) * lg, lg, i1, i2)\\n points.peano(x + (1 + i2 - i1) * lg, y + (2 - i1 - i2) * lg, lg, i1, i2)\\n points.peano(x + 2 * (1 - i1) * lg, y + 2 * (1 - i1) * lg, lg, i1, i2)\\n points.peano(x + (2 - i1 - i2) * lg, y + (1 + i2 - i1) * lg, lg, 1 - i1, i2)\\n points.peano(x + 2 * (1 - i2) * lg, y + 2 * i2 * lg, lg, 1 - i1, i2)\\n\\n\\nvar points: seq[Point]\\npoints.peano(0, 0, Width, 0, 0)\\nvar image = initImage[ColorRGBU](820, 820)\\nlet color = ColorRGBU([byte 255, 255, 0])\\nfor i in 1..points.high:\\n image.drawLine(points[i - 1], points[i], color)\\nimage.savePNG(\\\"peano.png\\\", compression = 9)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use SVG;\\nuse List::Util qw(max min);\\n\\nuse constant pi => 2 * atan2(1, 0);\\n\\n# Compute the curve with a Lindemayer-system\\nmy %rules = (\\n L => 'LFRFL-F-RFLFR+F+LFRFL',\\n R => 'RFLFR+F+LFRFL-F-RFLFR'\\n);\\nmy $peano = 'L';\\n$peano =~ s/([LR])/$rules{$1}/eg for 1..4;\\n\\n# Draw the curve in SVG\\n($x, $y) = (0, 0);\\n$theta = pi/2;\\n$r = 4;\\n\\nfor (split //, $peano) {\\n if (/F/) {\\n push @X, sprintf \\\"%.0f\\\", $x;\\n push @Y, sprintf \\\"%.0f\\\", $y;\\n $x += $r * cos($theta);\\n $y += $r * sin($theta);\\n }\\n elsif (/\\\\+/) { $theta += pi/2; }\\n elsif (/\\\\-/) { $theta -= pi/2; }\\n}\\n\\n$max = max(@X,@Y);\\n$xt = -min(@X)+10;\\n$yt = -min(@Y)+10;\\n$svg = SVG->new(width=>$max+20, height=>$max+20);\\n$points = $svg->get_path(x=>\\\\@X, y=>\\\\@Y, -type=>'polyline');\\n$svg->rect(width=>\\\"100%\\\", height=>\\\"100%\\\", style=>{'fill'=>'black'});\\n$svg->polyline(%$points, style=>{'stroke'=>'orange', 'stroke-width'=>1}, transform=>\\\"translate($xt,$yt)\\\");\\n\\nopen $fh, '>', 'peano_curve.svg';\\nprint $fh $svg->xmlify(-namespace=>'svg');\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\peano_curve.exw\\n -- ============================\\n --\\n -- Draws a peano curve. Space key toggles between switchback and meander curves.\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cdcanvas</span>\\n\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">meander</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- space toggles (false==draw switchback curve)</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">width</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">81</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- switchback peano:\\n --\\n -- There are (as per wp) four shapes to draw:\\n --\\n -- 1: +-v ^ 2: ^ v-+ 3: v ^-+ 2: +-^ v\\n -- | | | | | | | | | | | |\\n -- ^ v-+ +-v ^ +-^ v v ^-+\\n --\\n -- 1 starts bottom left, ends top right\\n -- 2 starts bottom right, ends top left\\n -- 3 starts top left, ends bottom right\\n -- 4 starts top right, ends bottom left\\n --\\n -- given the centre point (think {1,1}), and using {0,0} as the bottom left:\\n --</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">shapes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}},</span>\\n <span style=\\\"color: #0000FF;\\\">{{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (== sq_mul(shapes[1],{-1,0}))</span>\\n <span style=\\\"color: #0000FF;\\\">{{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (== reverse(shapes[2]))</span>\\n <span style=\\\"color: #0000FF;\\\">{{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">},{-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">}}}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- (== reverse(shapes[1]))</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">subshapes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{{</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- == sq_sub({3,3,3,7,7,7,3,3,3},subshapes[1])</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">},</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- == sq_sub(5,subshapes[2])</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">}}</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- == sq_sub(5,subshapes[1])\\n\\n -- As noted, it should theoretically be possible to simplify/shorten/remove/inline those tables</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">switchback_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">shape</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (written from scratch, with a nod to the meander algorithm [below])</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\"><=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">return</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">level</span> <span style=\\\"color: #0000FF;\\\">/=</span> <span style=\\\"color: #000000;\\\">3</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">9</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">shape</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">switchback_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dx</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">dy</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">level</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">subshapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">shape</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (translated from Go)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">px</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">width</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">py</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">width</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #0000FF;\\\">*</span> <span style=\\\"color: #000000;\\\">10</span>\\n <span style=\\\"color: #000000;\\\">points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">px</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">py</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">return</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">lg</span> <span style=\\\"color: #0000FF;\\\">/=</span> <span style=\\\"color: #000000;\\\">3</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">lg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">i1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">i2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">redraw_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posx*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posy*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">)=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">meander</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">meander_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">width</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">switchback_peano</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">41</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">width</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasActivate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasBegin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_OPEN_LINES</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">points</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasVertex</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasEnd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasFlush</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">map_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cdcanvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_IUP</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cddbuffer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_DBUFFER</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetBackground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_WHITE</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetForeground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_MAGENTA</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">key_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_ESC</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">meander</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">meander</span>\\n <span style=\\\"color: #000000;\\\">points</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cddbuffer</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupUpdate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CONTINUE</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">canvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"RASTERSIZE=822x822\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallbacks</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"MAP_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"map_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"redraw_cb\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"Peano Curve\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DIALOGFRAME\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"YES\\\"</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #000080;font-style:italic;\\\">-- no resize here</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"KEY_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"key_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"//Abhishek Ghosh, 28th June 2022\\n\\nvoid Peano(int x, int y, int lg, int i1, int i2) {\\n\\n if (lg == 1) {\\n ellipse(x,y,1,1);\\n return;\\n }\\n\\n lg = lg/3;\\n Peano(x+(2*i1*lg), y+(2*i1*lg), lg, i1, i2);\\n Peano(x+((i1-i2+1)*lg), y+((i1+i2)*lg), lg, i1, 1-i2);\\n Peano(x+lg, y+lg, lg, i1, 1-i2);\\n Peano(x+((i1+i2)*lg), y+((i1-i2+1)*lg), lg, 1-i1, 1-i2);\\n Peano(x+(2*i2*lg), y+(2*(1-i2)*lg), lg, i1, i2);\\n Peano(x+((1+i2-i1)*lg), y+((2-i1-i2)*lg), lg, i1, i2);\\n Peano(x+(2*(1-i1)*lg), y+(2*(1-i1)*lg), lg, i1, i2);\\n Peano(x+((2-i1-i2)*lg), y+((1+i2-i1)*lg), lg, 1-i1, i2);\\n Peano(x+(2*(1-i2)*lg), y+(2*i2*lg), lg, 1-i1, i2);\\n}\\n\\nvoid setup(){\\n size(1000,1000);\\n Peano(0, 0, 1000, 0, 0);\\n}\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"main:-\\n write_peano_curve('peano_curve.svg', 656, 4).\\n\\nwrite_peano_curve(File, Size, Order):-\\n open(File, write, Stream),\\n format(Stream,\\n \\\"<svg xmlns='http://www.w3.org/2000/svg' width='~d' height='~d'>\\\\n\\\",\\n [Size, Size]),\\n write(Stream, \\\"<rect width='100%' height='100%' fill='white'/>\\\\n\\\"),\\n peano_curve(Stream, \\\"L\\\", 8, 8, 8, 90, Order),\\n write(Stream, \\\"</svg>\\\\n\\\"),\\n close(Stream).\\n\\npeano_curve(Stream, Axiom, X, Y, Length, Angle, Order):-\\n write(Stream, \\\"<path stroke-width='1' stroke='black' fill='none' d='\\\"),\\n format(Stream, 'M~g,~g\\\\n', [X, Y]),\\n rewrite(Axiom, Order, S),\\n string_chars(S, Chars),\\n execute(Stream, X, Y, Length, Angle, Chars),\\n write(Stream, \\\"'/>\\\\n\\\").\\n\\nrewrite(S, 0, S):-!.\\nrewrite(S0, N, S):-\\n string_chars(S0, Chars0),\\n rewrite1(Chars0, '', S1),\\n N1 is N - 1,\\n rewrite(S1, N1, S).\\n\\nrewrite1([], S, S):-!.\\nrewrite1([C|Chars], T, S):-\\n rewrite2(C, X),\\n string_concat(T, X, T1),\\n rewrite1(Chars, T1, S).\\n\\nrewrite2('L', \\\"LFRFL-F-RFLFR+F+LFRFL\\\"):-!.\\nrewrite2('R', \\\"RFLFR+F+LFRFL-F-RFLFR\\\"):-!.\\nrewrite2(X, X).\\n\\nexecute(_, _, _, _, _, []):-!.\\nexecute(Stream, X, Y, Length, Angle, ['F'|Chars]):-\\n !,\\n Theta is (pi * Angle) / 180.0,\\n X1 is X + Length * cos(Theta),\\n Y1 is Y + Length * sin(Theta),\\n format(Stream, 'L~g,~g\\\\n', [X1, Y1]),\\n execute(Stream, X1, Y1, Length, Angle, Chars).\\nexecute(Stream, X, Y, Length, Angle, ['+'|Chars]):-\\n !,\\n Angle1 is (Angle + 90) mod 360,\\n execute(Stream, X, Y, Length, Angle1, Chars).\\nexecute(Stream, X, Y, Length, Angle, ['-'|Chars]):-\\n !,\\n Angle1 is (Angle - 90) mod 360,\\n execute(Stream, X, Y, Length, Angle1, Chars).\\nexecute(Stream, X, Y, Length, Angle, [_|Chars]):-\\n execute(Stream, X, Y, Length, Angle, Chars).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"import turtle as tt\\nimport inspect\\n\\nstack = [] # Mark the current stacks in run.\\ndef peano(iterations=1):\\n global stack\\n\\n # The turtle Ivan:\\n ivan = tt.Turtle(shape = \\\"classic\\\", visible = True)\\n\\n\\n # The app window:\\n screen = tt.Screen()\\n screen.title(\\\"Desenhin do Peano\\\")\\n screen.bgcolor(\\\"#232323\\\")\\n screen.delay(0) # Speed on drawing (if higher, more slow)\\n screen.setup(width=0.95, height=0.9)\\n\\n # The size of each step walked (here, named simply \\\"walk\\\"). It's not a pixel scale. This may stay still:\\n walk = 1\\n\\n def screenlength(k):\\n # A function to make the image good to see (without it would result in a partial image).\\n # This will guarantee that we can see the the voids and it's steps.\\n if k != 0:\\n length = screenlength(k-1)\\n return 2*length + 1\\n else: return 0\\n\\n kkkj = screenlength(iterations)\\n screen.setworldcoordinates(-1, -1, kkkj + 1, kkkj + 1)\\n ivan.color(\\\"#EEFFFF\\\", \\\"#FFFFFF\\\")\\n\\n\\n # The magic \\\\(^-^)/:\\n def step1(k):\\n global stack\\n stack.append(len(inspect.stack()))\\n if k != 0:\\n ivan.left(90)\\n step2(k - 1)\\n ivan.forward(walk)\\n ivan.right(90)\\n step1(k - 1)\\n ivan.forward(walk)\\n step1(k - 1)\\n ivan.right(90)\\n ivan.forward(walk)\\n step2(k - 1)\\n ivan.left(90)\\n def step2(k):\\n global stack\\n stack.append(len(inspect.stack()))\\n if k != 0:\\n ivan.right(90)\\n step1(k - 1)\\n ivan.forward(walk)\\n ivan.left(90)\\n step2(k - 1)\\n ivan.forward(walk)\\n step2(k - 1)\\n ivan.left(90)\\n ivan.forward(walk)\\n step1(k - 1)\\n ivan.right(90)\\n\\n # Making the program work:\\n ivan.left(90)\\n step2(iterations)\\n\\n tt.done()\\n\\nif __name__ == \\\"__main__\\\":\\n peano(4)\\n import pylab as P # This plot, after closing the drawing window, the \\\"stack\\\" graphic.\\n P.plot(stack)\\n P.show()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ $ \\\"turtleduck.qky\\\" loadfile ] now!\\n\\n [ stack ] is switch.arg ( --> [ )\\n\\n [ switch.arg put ] is switch ( x --> )\\n\\n [ switch.arg release ] is otherwise ( --> )\\n\\n [ switch.arg share\\n != iff ]else[ done\\n otherwise ]'[ do ]done[ ] is case ( x --> )\\n\\n [ $ \\\"\\\" swap witheach\\n [ nested quackery join ] ] is expand ( $ --> $ )\\n\\n [ $ \\\"F\\\" ] is F ( $ --> $ )\\n\\n [ $ \\\"L\\\" ] is L ( $ --> $ )\\n\\n [ $ \\\"R\\\" ] is R ( $ --> $ )\\n\\n [ $ \\\"AFBFARFRBFAFBLFLAFBFA\\\" ] is A ( $ --> $ )\\n\\n [ $ \\\"BFAFBLFLAFBFARFRBFAFB\\\" ] is B ( $ --> $ )\\n\\n $ \\\"A\\\"\\n\\n 4 times expand\\n\\n turtle\\n witheach\\n [ switch\\n [ char F case [ 4 1 walk ]\\n char L case [ -1 4 turn ]\\n char R case [ 1 4 turn ]\\n otherwise ( ignore ) ] ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#to install hilbercurve library, biocmanager needs to be installed first\\ninstall.packages(\\\"BiocManager\\\")\\nBiocManager::install(\\\"HilbertCurve\\\")\\n#loading library and setting seed for random numbers\\nlibrary(HilbertCurve)\\nlibrary(circlize)\\nset.seed(123)\\n\\n#4th order peano curve is generated\\nfor(i in 1:512) {\\n peano = HilbertCurve(1, 512, level = 4, reference = TRUE, arrow = FALSE)\\n hc_points(peano, x1 = i, np = NULL, pch = 16, size = unit(3, \\\"mm\\\"))\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"/* Jens Axel Søgaard, 27th December 2018*/\\n#lang racket\\n(require metapict metapict/mat)\\n\\n;;; Turtle State\\n(define p (pt 0 0)) ; current position\\n(define d (vec 0 1)) ; current direction\\n(define c '()) ; line segments drawn so far\\n\\n;;; Turtle Operations\\n(define (jump q) (set! p q))\\n(define (move q) (set! c (cons (curve p -- q) c)) (set! p q))\\n(define (forward x) (move (pt+ p (vec* x d))))\\n(define (left a) (set! d (rot a d)))\\n(define (right a) (left (- a)))\\n\\n;;; Peano\\n(define (peano n a h)\\n (unless (= n 0)\\n (right a)\\n (peano (- n 1) (- a) h)\\n (forward h)\\n (peano (- n 1) a h)\\n (forward h)\\n (peano (- n 1) (- a) h)\\n (left a)))\\n\\n;;; Produce image\\n(set-curve-pict-size 400 400)\\n(with-window (window -1 81 -1 82)\\n (peano 6 90 3)\\n (draw* c))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use SVG;\\n\\nrole Lindenmayer {\\n has %.rules;\\n method succ {\\n self.comb.map( { %!rules{$^c} // $c } ).join but Lindenmayer(%!rules)\\n }\\n}\\n\\nmy $peano = 'L' but Lindenmayer( { 'L' => 'LFRFL-F-RFLFR+F+LFRFL', 'R' => 'RFLFR+F+LFRFL-F-RFLFR' } );\\n\\n$peano++ xx 4;\\nmy @points = (10, 10);\\n\\nfor $peano.comb {\\n state ($x, $y) = @points[0,1];\\n state $d = 0 + 8i;\\n when 'F' { @points.append: ($x += $d.re).round(1), ($y += $d.im).round(1) }\\n when /< + - >/ { $d *= \\\"{$_}1i\\\" }\\n default { }\\n}\\n\\nsay SVG.serialize(\\n svg => [\\n :660width, :660height, :style<stroke:lime>,\\n :rect[:width<100%>, :height<100%>, :fill<black>],\\n :polyline[ :points(@points.join: ','), :fill<black> ],\\n ],\\n);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"load_library :grammar\\n\\n# Peano class\\nclass Peano\\n include Processing::Proxy\\n attr_reader :draw_length, :vec, :theta, :axiom, :grammar\\n DELTA = 60 # degrees\\n def initialize(vec)\\n @axiom = 'XF' # Axiom\\n rules = {\\n 'X' => 'X+YF++YF-FX--FXFX-YF+', # LSystem Rules\\n 'Y' => '-FX+YFYF++YF+FX--FX-Y'\\n }\\n @grammar = Grammar.new(axiom, rules)\\n @theta = 0\\n @draw_length = 100\\n @vec = vec\\n end\\n\\n def generate(gen)\\n @draw_length = draw_length * 0.6**gen\\n grammar.generate gen\\n end\\n\\n def translate_rules(prod)\\n coss = ->(orig, alpha, len) { orig + len * DegLut.cos(alpha) }\\n sinn = ->(orig, alpha, len) { orig - len * DegLut.sin(alpha) }\\n [].tap do |pts| # An array to store line vertices as Vec2D\\n prod.scan(/./) do |ch|\\n case ch\\n when 'F'\\n pts << vec.copy\\n @vec = Vec2D.new(\\n coss.call(vec.x, theta, draw_length),\\n sinn.call(vec.y, theta, draw_length)\\n )\\n pts << vec\\n when '+'\\n @theta += DELTA\\n when '-'\\n @theta -= DELTA\\n when 'X', 'Y'\\n else\\n puts(\\\"character #{ch} not in grammar\\\")\\n end\\n end\\n end\\n end\\nend\\n\\nattr_reader :points\\n\\ndef setup\\n sketch_title 'Peano'\\n peano = Peano.new(Vec2D.new(width * 0.65, height * 0.9))\\n production = peano.generate 4 # 4 generations looks OK\\n @points = peano.translate_rules(production)\\n no_loop\\nend\\n\\ndef draw\\n background(0)\\n render points\\nend\\n\\ndef render(points)\\n no_fill\\n stroke 200.0\\n stroke_weight 3\\n begin_shape\\n points.each_slice(2) do |v0, v1|\\n v0.to_vertex(renderer)\\n v1.to_vertex(renderer)\\n end\\n end_shape\\nend\\n\\ndef renderer\\n @renderer ||= GfxRender.new(g)\\nend\\n\\ndef settings\\n size(800, 800)\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"// [dependencies]\\n// svg = \\\"0.8.0\\\"\\n\\nuse svg::node::element::path::Data;\\nuse svg::node::element::Path;\\n\\nstruct PeanoCurve {\\n current_x: f64,\\n current_y: f64,\\n current_angle: i32,\\n line_length: f64,\\n}\\n\\nimpl PeanoCurve {\\n fn new(x: f64, y: f64, length: f64, angle: i32) -> PeanoCurve {\\n PeanoCurve {\\n current_x: x,\\n current_y: y,\\n current_angle: angle,\\n line_length: length,\\n }\\n }\\n fn rewrite(order: usize) -> String {\\n let mut str = String::from(\\\"L\\\");\\n for _ in 0..order {\\n let mut tmp = String::new();\\n for ch in str.chars() {\\n match ch {\\n 'L' => tmp.push_str(\\\"LFRFL-F-RFLFR+F+LFRFL\\\"),\\n 'R' => tmp.push_str(\\\"RFLFR+F+LFRFL-F-RFLFR\\\"),\\n _ => tmp.push(ch),\\n }\\n }\\n str = tmp;\\n }\\n str\\n }\\n fn execute(&mut self, order: usize) -> Path {\\n let mut data = Data::new().move_to((self.current_x, self.current_y));\\n for ch in PeanoCurve::rewrite(order).chars() {\\n match ch {\\n 'F' => data = self.draw_line(data),\\n '+' => self.turn(90),\\n '-' => self.turn(-90),\\n _ => {}\\n }\\n }\\n Path::new()\\n .set(\\\"fill\\\", \\\"none\\\")\\n .set(\\\"stroke\\\", \\\"black\\\")\\n .set(\\\"stroke-width\\\", \\\"1\\\")\\n .set(\\\"d\\\", data)\\n }\\n fn draw_line(&mut self, data: Data) -> Data {\\n let theta = (self.current_angle as f64).to_radians();\\n self.current_x += self.line_length * theta.cos();\\n self.current_y += self.line_length * theta.sin();\\n data.line_to((self.current_x, self.current_y))\\n }\\n fn turn(&mut self, angle: i32) {\\n self.current_angle = (self.current_angle + angle) % 360;\\n }\\n fn save(file: &str, size: usize, order: usize) -> std::io::Result<()> {\\n use svg::node::element::Rectangle;\\n let rect = Rectangle::new()\\n .set(\\\"width\\\", \\\"100%\\\")\\n .set(\\\"height\\\", \\\"100%\\\")\\n .set(\\\"fill\\\", \\\"white\\\");\\n let mut p = PeanoCurve::new(8.0, 8.0, 8.0, 90);\\n let document = svg::Document::new()\\n .set(\\\"width\\\", size)\\n .set(\\\"height\\\", size)\\n .add(rect)\\n .add(p.execute(order));\\n svg::save(file, &document)\\n }\\n}\\n\\nfn main() {\\n PeanoCurve::save(\\\"peano_curve.svg\\\", 656, 4).unwrap();\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \"var rules = Hash(\\n l => 'lFrFl-F-rFlFr+F+lFrFl',\\n r => 'rFlFr+F+lFrFl-F-rFlFr',\\n)\\n\\nvar lsys = LSystem(\\n width: 500,\\n height: 500,\\n\\n xoff: -50,\\n yoff: -50,\\n\\n len: 5,\\n angle: 90,\\n color: 'dark green',\\n)\\n\\nlsys.execute('l', 4, \\\"peano_curve.png\\\", rules)\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"Const WIDTH = 243 'a power of 3 for a evenly spaced curve\\nDim n As Long\\nDim points() As Single\\nDim flag As Boolean\\n'Store the coordinate pairs (x, y) generated by Peano into\\n'a SafeArrayOfPoints with lineto. The number of points\\n'generated depend on WIDTH. Peano is called twice. Once\\n'to count the number of points, and twice to generate\\n'the points after the dynamic array has been\\n'redimensionalised.\\n'VBA doesn't have a lineto method. Instead of AddLine, which\\n'requires four parameters, including the begin pair of\\n'coordinates, the method AddPolyline is used, which is\\n'called from main after all the points are generated.\\n'This creates a single object, whereas AddLine would\\n'create thousands of small unconnected line objects.\\nPrivate Sub lineto(x As Integer, y As Integer)\\n If flag Then\\n points(n, 1) = x\\n points(n, 2) = y\\n End If\\n n = n + 1\\nEnd Sub\\nPrivate Sub Peano(ByVal x As Integer, ByVal y As Integer, ByVal lg As Integer, _\\n ByVal i1 As Integer, ByVal i2 As Integer)\\n If (lg = 1) Then\\n Call lineto(x * 3, y * 3)\\n Exit Sub\\n End If\\n lg = lg / 3\\n Call Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\\n Call Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\\n Call Peano(x + lg, y + lg, lg, i1, 1 - i2)\\n Call Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\\n Call Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\\n Call Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\\n Call Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\\n Call Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\\n Call Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\\nEnd Sub\\nSub main()\\n n = 1: flag = False\\n Call Peano(0, 0, WIDTH, 0, 0) 'Start Peano recursion to count number of points\\n ReDim points(1 To n - 1, 1 To 2)\\n n = 1: flag = True\\n Call Peano(0, 0, WIDTH, 0, 0) 'Start Peano recursion to generate and store points\\n ActiveSheet.Shapes.AddPolyline points 'Excel assumed\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"option explicit\\n'outputs turtle graphics to svg file and opens it\\n\\nconst pi180= 0.01745329251994329576923690768489 ' pi/180\\nconst pi=3.1415926535897932384626433832795 'pi\\nclass turtle\\n\\n dim fso\\n dim fn\\n dim svg\\n\\n dim iang 'radians\\n dim ori 'radians\\n dim incr\\n dim pdown\\n dim clr\\n dim x\\n dim y\\n\\n public property let orient(n):ori = n*pi180 :end property\\n public property let iangle(n):iang= n*pi180 :end property\\n public sub pd() : pdown=true: end sub\\n public sub pu() :pdown=FALSE :end sub\\n\\n public sub rt(i)\\n ori=ori - i*iang:\\n if ori<0 then ori = ori+pi*2\\n end sub\\n public sub lt(i):\\n ori=(ori + i*iang)\\n if ori>(pi*2) then ori=ori-pi*2\\n end sub\\n\\n public sub bw(l)\\n x= x+ cos(ori+pi)*l*incr\\n y= y+ sin(ori+pi)*l*incr\\n end sub\\n\\n public sub fw(l)\\n dim x1,y1\\n x1=x + cos(ori)*l*incr\\n y1=y + sin(ori)*l*incr\\n if pdown then line x,y,x1,y1\\n x=x1:y=y1\\n end sub\\n\\n Private Sub Class_Initialize()\\n setlocale \\\"us\\\"\\n initsvg\\n pdown=true\\n end sub\\n\\n Private Sub Class_Terminate()\\n disply\\n end sub\\n\\n private sub line (x,y,x1,y1)\\n svg.WriteLine \\\"<line x1=\\\"\\\"\\\" & x & \\\"\\\"\\\" y1= \\\"\\\"\\\"& y & \\\"\\\"\\\" x2=\\\"\\\"\\\" & x1& \\\"\\\"\\\" y2=\\\"\\\"\\\" & y1 & \\\"\\\"\\\"/>\\\"\\n end sub\\n\\n private sub disply()\\n dim shell\\n svg.WriteLine \\\"</svg></body></html>\\\"\\n svg.close\\n Set shell = CreateObject(\\\"Shell.Application\\\")\\n shell.ShellExecute fn,1,False\\n end sub\\n\\n private sub initsvg()\\n dim scriptpath\\n Set fso = CreateObject (\\\"Scripting.Filesystemobject\\\")\\n ScriptPath= Left(WScript.ScriptFullName, InStrRev(WScript.ScriptFullName, \\\"\\\\\\\"))\\n fn=Scriptpath & \\\"SIERP.HTML\\\"\\n Set svg = fso.CreateTextFile(fn,True)\\n if SVG IS nothing then wscript.echo \\\"Can't create svg file\\\" :vscript.quit\\n svg.WriteLine \\\"<!DOCTYPE html>\\\" &vbcrlf & \\\"<html>\\\" &vbcrlf & \\\"<head>\\\"\\n svg.writeline \\\"<style>\\\" & vbcrlf & \\\"line {stroke:rgb(255,0,0);stroke-width:.5}\\\" &vbcrlf &\\\"</style>\\\"\\n svg.writeline \\\"</head>\\\"&vbcrlf & \\\"<body>\\\"\\n svg.WriteLine \\\"<svg xmlns=\\\"\\\"http://www.w3.org/2000/svg\\\"\\\" width=\\\"\\\"800\\\"\\\" height=\\\"\\\"800\\\"\\\" viewBox=\\\"\\\"0 0 800 800\\\"\\\">\\\"\\n end sub\\nend class\\n\\nsub peano (n,a)\\n if n=0 then exit sub\\n x.rt a\\n peano n-1, -a\\n x.fw 1\\n peano n-1, a\\n x.fw 1\\n peano n-1, -a\\n x.lt a\\nend sub\\n\\n dim x,i\\nset x=new turtle\\nx.iangle=90\\nx.orient=0\\nx.incr=7\\nx.x=100:x.y=500\\npeano 7,1\\nset x=nothing 'show image in browser\\n\",\n \"language\": \"VBScript\"\n },\n {\n \"code\": \"import \\\"graphics\\\" for Canvas, Color, Point\\nimport \\\"dome\\\" for Window\\n\\nclass Game {\\n static init() {\\n Window.title = \\\"Peano curve\\\"\\n Canvas.resize(820, 820)\\n Window.resize(820, 820)\\n Canvas.cls(Color.white) // white background\\n __points = []\\n __width = 81\\n peano(0, 0, __width, 0, 0)\\n var col = Color.rgb(255, 0, 255) // magenta\\n var prev = __points[0]\\n for (p in __points.skip(1)) {\\n var curr = p\\n Canvas.line(prev.x, prev.y, curr.x, curr.y, col)\\n prev = curr\\n }\\n }\\n\\n static peano(x, y, lg, i1, i2) {\\n if (lg == 1) {\\n var px = (__width - x) * 10\\n var py = (__width - y) * 10\\n __points.add(Point.new(px, py))\\n return\\n }\\n lg = (lg/3).floor\\n peano(x+2*i1*lg, y+2*i1*lg, lg, i1, i2)\\n peano(x+(i1-i2+1)*lg, y+(i1+i2)*lg, lg, i1, 1-i2)\\n peano(x+lg, y+lg, lg, i1, 1-i2)\\n peano(x+(i1+i2)*lg, y+(i1-i2+1)*lg, lg, 1-i1, 1-i2)\\n peano(x+2*i2*lg, y+2*(1-i2)*lg, lg, i1, i2)\\n peano(x+(1+i2-i1)*lg, y+(2-i1-i2)*lg, lg, i1, i2)\\n peano(x+2*(1-i1)*lg, y+2*(1-i1)*lg, lg, i1, i2)\\n peano(x+(2-i1-i2)*lg, y+(1+i2-i1)*lg, lg, 1-i1, i2)\\n peano(x+2*(1-i2)*lg, y+2*i2*lg, lg, 1-i1, i2)\\n }\\n\\n static update() {}\\n\\n static draw(dt) {}\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc Peano(X, Y, Lg, I1, I2);\\nint X, Y, Lg, I1, I2;\\n[if Lg = 1 then\\n [Line(3*X, 3*Y, 11 \\\\cyan\\\\);\\n return;\\n ];\\nLg:= Lg/3;\\nPeano(X + 2*I1* Lg, Y + 2*I1* Lg, Lg, I1, I2);\\nPeano(X + (I1-I2+1)*Lg, Y + (I1+I2)* Lg, Lg, I1, 1-I2);\\nPeano(X + Lg, Y + Lg, Lg, I1, 1-I2);\\nPeano(X + (I1+I2)* Lg, Y + (I1-I2+1)*Lg, Lg, 1-I1, 1-I2);\\nPeano(X + 2*I2* Lg, Y + 2*(1-I2)* Lg, Lg, I1, I2);\\nPeano(X + (1+I2-I1)*Lg, Y + (2-I1-I2)*Lg, Lg, I1, I2);\\nPeano(X + 2*(1-I1)* Lg, Y + 2*(1-I1)* Lg, Lg, I1, I2);\\nPeano(X + (2-I1-I2)*Lg, Y + (1+I2-I1)*Lg, Lg, 1-I1, I2);\\nPeano(X + 2*(1-I2)* Lg, Y + 2*I2* Lg, Lg, 1-I1, I2);\\n];\\n\\n[SetVid($13);\\nPeano(0, 0, 3*3*3*3, 0, 0); \\\\start Peano recursion\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"WIDTH = 243 //a power of 3 for a evenly spaced curve\\n\\nopen window 700, 700\\n\\nPeano(0, 0, WIDTH, 0, 0)\\n\\nSub Peano(x, y, lg, i1, i2)\\n If (lg = 1) Then\\n line x * 3, y * 3\\n return\\n End If\\n lg = lg / 3\\n Peano(x + (2 * i1 * lg), y + (2 * i1 * lg), lg, i1, i2)\\n Peano(x + ((i1 - i2 + 1) * lg), y + ((i1 + i2) * lg), lg, i1, 1 - i2)\\n Peano(x + lg, y + lg, lg, i1, 1 - i2)\\n Peano(x + ((i1 + i2) * lg), y + ((i1 - i2 + 1) * lg), lg, 1 - i1, 1 - i2)\\n Peano(x + (2 * i2 * lg), y + (2 * (1 - i2) * lg), lg, i1, i2)\\n Peano(x + ((1 + i2 - i1) * lg), y + ((2 - i1 - i2) * lg), lg, i1, i2)\\n Peano(x + (2 * (1 - i1) * lg), y + (2 * (1 - i1) * lg), lg, i1, i2)\\n Peano(x + ((2 - i1 - i2) * lg), y + ((1 + i2 - i1) * lg), lg, 1 - i1, i2)\\n Peano(x + (2 * (1 - i2) * lg), y + (2 * i2 * lg), lg, 1 - i1, i2)\\nEnd Sub\\n\",\n \"language\": \"Yabasic\"\n },\n {\n \"code\": \"lsystem(\\\"L\\\",\\t\\t\\t\\t\\t// axiom\\n Dictionary(\\\"L\\\",\\\"LFRFL-F-RFLFR+F+LFRFL\\\", \\\"R\\\",\\\"RFLFR+F+LFRFL-F-RFLFR\\\"), # rules\\n \\\"+-F\\\", 4)\\t\\t\\t\\t \\t// constants, order\\n: turtle(_);\\n\\nfcn lsystem(axiom,rules,consts,n){\\t// Lindenmayer system --> string\\n foreach k in (consts){ rules.add(k,k) }\\n buf1,buf2 := Data(Void,axiom).howza(3), Data().howza(3); // characters\\n do(n){\\n buf1.pump(buf2.clear(), rules.get);\\n t:=buf1; buf1=buf2; buf2=t;\\t// swap buffers\\n }\\n buf1.text\\t\\t// n=4 --> 16,401 characters\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"fcn turtle(koch){\\n const D=10.0;\\n dir,angle, x,y := 0.0, (90.0).toRad(), 20.0, 830.0; // turtle; x,y are float\\n img,color := PPM(850,850), 0x00ff00;\\n foreach c in (koch){\\n switch(c){\\n\\t case(\\\"F\\\"){ // draw forward\\n\\t dx,dy := D.toRectangular(dir);\\n\\t tx,ty := x,y; x,y = (x+dx),(y+dy);\\n\\t img.line(tx.toInt(),ty.toInt(), x.toInt(),y.toInt(), color);\\n\\t }\\n\\t case(\\\"-\\\"){ dir-=angle } // turn right\\n\\t case(\\\"+\\\"){ dir+=angle } // turn left\\n }\\n }\\n img.writeJPGFile(\\\"peanoCurve.zkl.jpg\\\");\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Peano-curve"}}},{"rowIdx":1495,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pell_numbers\n","language":"00-META"},{"code":"'''Pell numbers''' are an infinite sequence of integers that comprise the denominators of the closest rational approximations to the square root of 2 but have many other interesting uses and relationships.\n\nThe numerators of each term of rational approximations to the square root of 2 may ''also'' be derived from '''Pell numbers''', or may be found by taking half of each term of the related sequence: '''Pell-Lucas''' or '''Pell-companion numbers'''.\n\n\nThe '''Pell numbers''': '''0, 1, 2, 5, 12, 29, 70, etc.''', are defined by the recurrence relation:\n\n <span style=\"font-size:125%;font-weight:bold;\">\n P<sub>0</sub> = 0;\n P<sub>1</sub> = 1;\n P<sub>n</sub> = 2 × P<sub>n-1</sub> + P<sub>n-2</sub>;\n </span>\n\nOr, may also be expressed by the closed form formula:\n\n <span style=\"font-size:125%;font-weight:bold;\">\n P<sub>n</sub> = ((1 + √2)<sup>n</sup> - (1 - √2)<sup>n</sup>) / (2 × √2);\n </span>\n\n\n'''Pell-Lucas''' or '''Pell-companion numbers''': '''2, 2, 6, 14, 34, 82, etc.''', are defined by a very similar recurrence relation, differing only in the first two terms:\n\n <span style=\"font-size:125%;font-weight:bold;\">\n Q<sub>0</sub> = 2;\n Q<sub>1</sub> = 2;\n Q<sub>n</sub> = 2 × Q<sub>n-1</sub> + Q<sub>n-2</sub>;\n </span>\n\nOr, may also be expressed by the closed form formula:\n\n <span style=\"font-size:125%;font-weight:bold;\">\n Q<sub>n</sub> = (1 + √2)<sup>n</sup> + (1 - √2)<sup>n</sup>;\n </span>\n\nor\n\n <span style=\"font-size:125%;font-weight:bold;\">\n Q<sub>n</sub> = P<sub>2n</sub> / P<sub>n</sub>;\n </span>\n\n\n\nThe sequence of rational approximations to the square root of 2 begins:\n\n <span style=\"font-size:125%;font-weight:bold;\">\n 1/1, 3/2, 7/5, 17/12, 41/29, ...\n </span>\n\nStarting from '''n = 1''', for each term, the denominator is '''P<sub>n</sub>''' and the numerator is '''Q<sub>n</sub> / 2''' or '''P<sub>n-1</sub> + P<sub>n</sub>'''.\n\n\n\n\n'''Pell primes''' are '''Pell numbers''' that are prime. '''Pell prime indices''' are the indices of the primes in the '''Pell numbers''' sequence. Every '''Pell prime''' index is prime, though not every prime index corresponds to a prime '''Pell number'''.\n\n\n\nIf you take the sum '''S''' of the first '''4n + 1''' '''Pell numbers''', the sum of the terms '''P<sub>2n</sub>''' and '''P<sub>2n + 1</sub>''' will form the square root of '''S'''.\n\nFor instance, the sum of the '''Pell numbers''' up to '''P<sub>5</sub>'''; '''0 + 1 + 2 + 5 + 12 + 29 == 49''', is the square of '''P<sub>2</sub> + P<sub>3</sub> == 2 + 5 == 7'''. The sequence of numbers formed by the sums '''P<sub>2n</sub> + P<sub>2n + 1</sub>''' are known as '''Newman-Shank-Williams numbers''' or '''NSW numbers'''.\n\n\n\n'''Pell numbers''' may also be used to find Pythagorean triple '''near isosceles right triangles'''; right triangles whose legs differ by exactly '''1'''. E.G.: '''(3,4,5), (20,21,29), (119,120,169), etc.'''\n\nFor '''n > 0''', each right triangle hypotenuse is '''P<sub>2n + 1</sub>'''. The shorter leg length is the sum of the terms ''up to'' '''P<sub>2n + 1</sub>'''. The longer leg length is '''1''' more than that.\n\n\n\n;Task\n;* Find and show at least the first 10 '''Pell numbers'''.\n;* Find and show at least the first 10 '''Pell-Lucas numbers'''.\n;* Use the '''Pell''' (and optionally, '''Pell-Lucas''') '''numbers''' sequence to find and show at least the first 10 rational approximations to √2 in both rational and decimal representation.\n;* Find and show at least the first 10 '''Pell primes'''.\n;* Find and show at least the first 10 indices of '''Pell primes'''.\n;* Find and show at least the first 10 '''Newman-Shank-Williams numbers'''\n;* Find and show at least the first 10 Pythagorean triples corresponding to '''near isosceles right triangles'''.\n\n\n\n;See also\n;* [[wp:Pell_number|Wikipedia: Pell number]]\n;* [[oeis:A000129|OEIS:A000129 - Pell numbers]]\n;* [[oeis:A002203|OEIS:A002203 - Companion Pell numbers]] (Pell-Lucas numbers)\n;* [[oeis:A001333|OEIS:A001333 - Numerators of continued fraction convergents to sqrt(2)]] (Companion Pell numbers / 2)\n;* [[oeis:A086383|OEIS:A086383 - Prime terms in the sequence of Pell numbers]]\n;* [[oeis:A096650|OEIS:A096650 - Indices of prime Pell numbers]]\n;* [[oeis:A002315|OEIS:A002315 - NSW numbers]] (Newman-Shank-Williams numbers)\n;* [[wp:Pythagorean_triple|Wikipedia: Pythagorean triple]]\n;* [[Pythagorean triples]]\n\n\n\n\n\n","language":"00-TASK"},{"code":"BEGIN # find some Pell numbers - trans FreeBASIC ( which is trans Phix ) #\n\n PR read \"primes.incl.a68\" PR\n\n [ 0 : 90 ]LONG INT p, pl;\n p[ 0 ] := 0; p[ 1 ] := 1;\n pl[ 0 ] := 2; pl[ 1 ] := 2;\n FOR n FROM 2 TO UPB p DO\n p[ n ] := 2 * p[ n - 1 ] + p[ n - 2 ];\n pl[ n ] := 2 * pl[ n - 1 ] + pl[ n - 2 ]\n OD;\n\n print( ( \"First 20 Pell numbers:\", newline ) );\n FOR n FROM 0 TO 19 DO print( ( \" \", whole( p[ n ], 0 ) ) ) OD;\n print( ( newline, newline, \"First 20 Pell-Lucas numbers:\", newline ) );\n FOR n FROM 0 TO 19 DO print( ( \" \", whole( pl[ n ], 0 ) ) ) OD;\n\n print( ( newline, newline, \"First 20 rational approximations of sqrt(2) (\" ) );\n print( ( fixed( sqrt( 2 ), -15, 13 ), \"):\", newline ) );\n FOR n TO 20 DO\n LONG INT j = pl[ n ] OVER 2, d = p[ n ];\n print( ( \" \", whole( j, 0 ), \"/\", whole( d, 0 ), \" ~= \", fixed( j / d, -15, 13 ), newline ) )\n OD;\n\n print( ( newline, \"First 10 Pell primes:\", newline, \"index Pell prime\", newline ) );\n INT c := 0;\n FOR pdx FROM 2 WHILE c < 10 DO\n IF is probably prime( p[ pdx ] ) THEN\n print( ( whole( pdx, -5 ), \" \", whole( p[ pdx ], 0 ), newline ) );\n c +:= 1\n FI\n OD;\n\n print( ( newline, newline, \"First 20 Newman-Shank-Williams numbers:\", newline ) );\n FOR n FROM 0 TO 19 DO\n LONG INT nsw = p[ 2 * n ] + p[ 2 * n + 1 ];\n print( ( \" \", whole( nsw, 0 ) ) ); IF n = 13 THEN print( ( newline ) ) FI\n OD;\n\n print( ( newline, newline, \"First 20 near isosceles right triangles:\", newline ) );\n LONG INT i0 := 0, i1 := 1, t := 1, found := 0;\n FOR i FROM 2 WHILE found < 20 DO\n LONG INT i2 = i1*2 + i0;\n IF ODD i THEN\n print( ( \" [\", whole( t, 0 ), \", \", whole( t + 1, 0 ), \", \", whole( i2, 0 ), \"]\", newline ) );\n found +:= 1\n FI;\n t +:= i2; i0 := i1; i1 := i2\n OD\n\nEND\n","language":"ALGOL-68"},{"code":"begin % find some Pell numbers - trans FreeBasic ( which is trans Phix ) %\n\n % returns true if n is prime, false otherwise, uses trial division %\n logical procedure isPrime ( integer value n ) ;\n if n < 3 then n = 2\n else if n rem 3 = 0 then n = 3\n else if not odd( n ) then false\n else begin\n logical prime;\n integer f, f2, toNext;\n prime := true;\n f := 5;\n f2 := 25;\n toNext := 24; % note: ( 2n + 1 )^2 - ( 2n - 1 )^2 = 8n %\n while f2 <= n and prime do begin\n prime := n rem f not = 0;\n f := f + 2;\n f2 := toNext;\n toNext := toNext + 8\n end while_f2_le_n_and_prime ;\n prime\n end isPrime ;\n\n integer MAX_P;\n MAX_P := 9;\n begin\n integer array p, pl ( 0 :: 20 ); % need more than 10 Pell numbers %\n integer c, pdx; % to find the fifth Pell prime %\n\n p( 0 ) := 0; p( 1 ) := 1;\n pl( 0 ) := 2; pl( 1 ) := 2;\n for n := 2 until 20 do begin\n p( n ) := 2 * p( n - 1 ) + p( n - 2 );\n pl( n ) := 2 * pl( n - 1 ) + pl( n - 2 )\n end for_n ;\n\n write( \"First 10 Pell numbers:\" );\n for n := 0 until MAX_P do begin writeon( i_w := 1, s_w := 0, \" \", p( n ) ) end;\n write();write( \"First 10 Pell-Lucas numbers:\" );\n for n := 0 until MAX_P do begin\n writeon( i_w := 1, s_w := 0, \" \", pl( n ) )\n end for_n ;\n\n write( s_w := 0, \"First 10 rational approximations of sqrt(2) (\" );\n writeon( s_w := 0, r_format := \"A\", r_w := 8, r_d := 6, sqrt( 2 ), \"):\" );\n for n := 1 until MAX_P do begin\n integer j;\n j := pl( n ) div 2;\n write( i_w := 1, s_w := 0, \" \", j, \"/\", p( n ), \" ~= \"\n , r_format := \"A\", r_w := 8, r_d := 6, j / p( n )\n )\n end for_n;\n\n write();write( \"First 5 Pell primes:\" ); write( \"index Pell prime\" );\n c := 0;\n pdx := 2;\n while c < 5 do begin\n if isPrime( p( pdx ) ) then begin\n write( i_w := 5, s_w := 0, pdx, \" \", i_w := 1, p( pdx ) );\n c := c + 1\n end if_isPrime_p_pdx ;\n pdx := pdx + 1\n end while_c_lt_5 ;\n\n write(); write( \"First 10 Newman-Shank-Williams numbers:\" );write();\n for n := 0 until MAX_P do begin\n integer nsw;\n nsw := p( 2 * n ) + p( 2 * n + 1 );\n writeon( i_w := 1, s_w := 0, \" \", nsw )\n end for_n;\n\n write();write( \"First 10 near isosceles right triangles:\" );\n begin\n integer i, i0, i1, i2, t, found;\n i0 := 0; i1 := 1; t := 1; found := 0;\n i := 1;\n while found < 10 do begin\n i := i + 1;\n i2 := i1*2 + i0;\n if odd( i ) then begin\n write( i_w := 1, s_w := 0, \" [\", t, \", \", t + 1, \", \", i2, \"]\" );\n found := found + 1\n end if_odd_i ;\n t := t + i2; i0 := i1; i1 := i2\n end while_found_lt_10\n end\n\n end\n\nend.\n","language":"ALGOL-W"},{"code":"(defun recurrent-sequence-2 (a0 a1 k1 k2 max)\n \"A generic function for any recurrent sequence of order 2, where a0 and a1 are the initial elements,\n k1 is the factor of a(n-1) and k2 is the factor of a(n-2)\"\n\t(do* ((i 0 (1+ i))\n\t (result (list a1 a0))\n\t (b0 a0 b1)\n\t (b1 a1 b2)\n\t (b2 (+ (* k1 b1) (* k2 b0)) (+ (* k1 b1) (* k2 b0))) )\n\t \t((> i max) (nreverse result))\n\t\t(push b2 result) ))\n\n(defun pell-sequence (max)\n\t(recurrent-sequence-2 0 1 2 1 max) )\n\n(defun pell-lucas-sequence (max)\n\t(recurrent-sequence-2 2 2 2 1 max) )\n\n(defun fibonacci-sequence (max) ; As an extra bonus, you get Fibonacci's numbers with this simple call\n\t(recurrent-sequence-2 1 1 1 1 max) )\n\n(defun rational-approximation-sqrt2 (max)\n \"Approximate square root of 2 with (P(n-1)+P(n-2))/P(n)\"\n\t(butlast (maplist #'(lambda (l) (/ (+ (first l) (or (second l) 0)) (or (second l) 1))) (pell-sequence max))) )\n\n(defun pell-primes (max)\n\t(do* ((i 0 (1+ i))\n\t (result (list 1 0))\n\t (indices nil)\n\t (b0 0 b1)\n\t (b1 1 b2)\n\t (b2 (+ (* 2 b1) (* 1 b0)) (+ (* 2 b1) (* 1 b0))) )\n\t \t((> (length result) max) (values (nreverse result)(nreverse indices)))\n ; primep can be any function determining whether a number is prime, for example,\n ; https://rosettacode.org/wiki/Primality_by_Wilson%27s_theorem#Common_Lisp\n\t (when (primep b2)\n\t\t\t(push b2 result)\n\t\t\t(push i indices) )))\n","language":"Common-Lisp"},{"code":"(pell-sequence 10)\n(0 1 2 5 12 29 70 169 408 985 2378 5741 13860)\n","language":"Common-Lisp"},{"code":"(pell-lucas-sequence 10)\n(2 2 6 14 34 82 198 478 1154 2786 6726 16238 39202)\n","language":"Common-Lisp"},{"code":"(rational-approximation-sqrt2 10)\n(1 3/2 7/5 17/12 41/29 99/70 239/169 577/408 1393/985 3363/2378 8119/5741\n 19601/13860)\n","language":"Common-Lisp"},{"code":"(mapcar #'float (rational-approximation-sqrt2 10))\n(1.0 1.5 1.4 1.4166666 1.4137931 1.4142857 1.4142011 1.4142157 1.4142132\n 1.4142137 1.4142135 1.4142135)\n","language":"Common-Lisp"},{"code":"(pell-primes 7)\n(0 1 2 5 29 5741 33461 44560482149) ;\n(0 1 3 9 11 27)\n","language":"Common-Lisp"},{"code":"#define isOdd(a) (((a) and 1) <> 0)\n\nFunction isPrime(Byval ValorEval As Integer) As Boolean\n If ValorEval < 2 Then Return False\n If ValorEval Mod 2 = 0 Then Return ValorEval = 2\n If ValorEval Mod 3 = 0 Then Return ValorEval = 3\n Dim d As Integer = 5\n While d * d <= ValorEval\n If ValorEval Mod d = 0 Then Return False Else d += 2\n If ValorEval Mod d = 0 Then Return False Else d += 4\n Wend\n Return True\nEnd Function\n\nDim As Integer n\nDim As Integer p(0 To 40), pl(0 To 40)\np(0)= 0: p(1) = 1\npl(0) = 2: pl(1) = 2\nFor n = 2 To 40\n p(n) = 2 * p(n-1) + p(n-2)\n pl(n) = 2 * pl(n-1) + pl(n-2)\nNext n\n\nPrint \"First 20 Pell numbers: \"\nFor n = 0 To 19 : Print p(n); : Next n\nPrint !\"\\n\\nFirst 20 Pell-Lucas: \"\nFor n = 0 To 19 : Print pl(n); : Next n\n\nPrint !\"\\n\\nFirst 20 rational approximations of sqrt(2) (\" & Str(Sqr(2)) & \"): \"\nFor n = 1 To 20\n Dim As Integer j = pl(n)/2, d = p(n)\n Print Using \" &/& ~= &\"; j; d; j/d\nNext n\n\nPrint !\"\\nFirst 6 Pell primes: [for the limitations of the FB standard library]\"\nDim as Integer pdx = 2\nDim As Byte c = 0\nDim As Ulongint ppdx(1 to 20)\ndo\n If isPrime(p(pdx)) Then\n If isPrime(pdx) Then ppdx(c) = pdx : End If\n Print p(pdx)\n c += 1\n End If\n pdx += 1\nloop until c = 6\n\nPrint !\"\\nIndices of first 6 Pell primes: [for the limitations of the FB standard library]\"\nFor n = 0 To 5 : Print \" \"; ppdx(n); : Next n\n\nDim As Ulongint nsw(0 To 20)\nFor n = 0 To 19\n nsw(n) = p(2*n) + p(2*n+1)\nNext n\nPrint !\"\\n\\nFirst 20 Newman-Shank-Williams numbers: \"\nFor n = 0 To 19 : Print \" \"; nsw(n); : Next n\n\nPrint !\"\\n\\nFirst 20 near isosceles right triangles:\"\nDim As Integer i0 = 0, i1 = 1, i2, t = 1, i = 2, found = 0\nDo While found < 20\n i2 = i1*2 + i0\n If isOdd(i) Then\n Print Using \" [&, &, &]\"; t; t+1 ; i2\n found += 1\n End If\n t += i2\n i0 = i1 : i1 = i2\n i += 1\nLoop\nSleep\n","language":"FreeBASIC"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/big\"\n \"rcu\"\n)\n\nfunc main() {\n p := make([]int64, 40)\n p[1] = 1\n for i := 2; i < 40; i++ {\n p[i] = 2*p[i-1] + p[i-2]\n }\n fmt.Println(\"The first 20 Pell numbers are:\")\n fmt.Println(p[0:20])\n\n q := make([]int64, 40)\n q[0] = 2\n q[1] = 2\n for i := 2; i < 40; i++ {\n q[i] = 2*q[i-1] + q[i-2]\n }\n fmt.Println(\"\\nThe first 20 Pell-Lucas numbers are:\")\n fmt.Println(q[0:20])\n\n fmt.Println(\"\\nThe first 20 rational approximations of √2 (1.4142135623730951) are:\")\n for i := 1; i <= 20; i++ {\n r := big.NewRat(q[i]/2, p[i])\n fmt.Printf(\"%-17s ≈ %-18s\\n\", r, r.FloatString(16))\n }\n\n fmt.Println(\"\\nThe first 15 Pell primes are:\")\n p0 := big.NewInt(0)\n p1 := big.NewInt(1)\n p2 := big.NewInt(0)\n two := big.NewInt(2)\n indices := make([]int, 15)\n for index, count := 2, 0; count < 15; index++ {\n p2.Mul(p1, two)\n p2.Add(p2, p0)\n if rcu.IsPrime(index) && p2.ProbablyPrime(15) {\n fmt.Println(p2)\n indices[count] = index\n count++\n }\n p0.Set(p1)\n p1.Set(p2)\n }\n\n fmt.Println(\"\\nIndices of the first 15 Pell primes are:\")\n fmt.Println(indices)\n\n fmt.Println(\"\\nFirst 20 Newman-Shank_Williams numbers:\")\n nsw := make([]int64, 20)\n for n := 0; n < 20; n++ {\n nsw[n] = p[2*n] + p[2*n+1]\n }\n fmt.Println(nsw)\n\n fmt.Println(\"\\nFirst 20 near isosceles right triangles:\")\n u0 := 0\n u1 := 1\n sum := 1\n for i := 2; i < 43; i++ {\n u2 := u1*2 + u0\n if i%2 == 1 {\n fmt.Printf(\"(%d, %d, %d)\\n\", sum, sum+1, u2)\n }\n sum += u2\n u0 = u1\n u1 = u2\n }\n}\n","language":"Go"},{"code":"import Data.Numbers.Primes (isPrime)\n\n----------------------- PELL SERIES ----------------------\n\npell :: Integer -> Integer -> [Integer]\npell a b = a : b : zipWith (+) (pell a b) ((2 *) <$> tail (pell a b))\n\na000129, a002203, a001333, a086383, a096650, a002315 :: [Integer]\na000129 = pell 0 1\n\na002203 = pell 2 2\n\na001333 = (`div` 2) <$> a002203\n\na086383 = filter isPrime a000129\n\na096650 = zip [0 ..] a000129 >>= (\\(i, n) -> [i | isPrime n])\n\na002315 = 1 : 7 : zipWith (-) ((6 *) <$> tail a002315) a002315\n\n\n------------------- PYTHAGOREAN TRIPLES ------------------\n\npythagoreanTriples :: [(Integer, Integer, Integer)]\npythagoreanTriples =\n (tail . concat) $ zipWith3 go [0 ..] a000129 (scanl (+) 0 a000129)\n where\n go i p m\n | odd i = [(m, succ m, p)]\n | otherwise = []\n\n-------------------------- TESTS -------------------------\nmain :: IO ()\nmain = do\n mapM_\n (\\(k, xs) -> putStrLn ('\\n' : k) >> print (take 10 xs))\n [ (\"a000129\", a000129)\n , (\"a002203\", a002203)\n , (\"a001333\", a001333)\n -- Waste of electrical power ?\n -- (\"a086383\", a086383)\n -- (\"a096650\", a096650\n , (\"a002315\", a002315)\n ]\n\n putStrLn \"\\nRational approximations to sqrt 2:\"\n mapM_ putStrLn $\n (take 10 . tail) $\n zipWith\n (\\n d ->\n show n <>\n ('/' : show d) <> \" -> \" <> show (fromIntegral n / fromIntegral d))\n a001333\n a000129\n\n putStrLn \"\\nPythagorean triples:\"\n mapM_ print $ take 10 pythagoreanTriples\n","language":"Haskell"},{"code":"nextPell=: , 1 2+/ .*_2&{. NB. pell, list extender\nPn=: (%:8) %~(1+%:2)&^ - (1-%:2)&^ NB. pell, closed form\nQn=: (1+%:2)&^ + (1-%:2)&^ NB. pell lucas, closed form\nQN=: +: %&Pn ] NB. pell lucas, closed form\nqn=: 2 * (+&Pn <:) NB. pell lucas, closed form\n","language":"J"},{"code":" nextPell^:9(0 1)\n0 1 2 5 12 29 70 169 408 985 2378\n Pn i.11\n0 1 2 5 12 29 70 169 408 985 2378\n nextPell^:9(2 2)\n2 2 6 14 34 82 198 478 1154 2786 6726\n Qn i.11\n2 2 6 14 34 82 198 478 1154 2786 6726\n QN i.11\n0 2 6 14 34 82 198 478 1154 2786 6726\n qn i.11\n2 2 6 14 34 82 198 478 1154 2786 6726\n","language":"J"},{"code":"QN=: 2 >. +: %&Pn ]\n QN i.11\n2 2 6 14 34 82 198 478 1154 2786 6726\n","language":"J"},{"code":" }.(%~ _1}. +//.@,:~) nextPell^:9(0 1)\n1 1.5 1.4 1.41667 1.41379 1.41429 1.4142 1.41422 1.41421 1.41421\n }.(%~ _1}. +//.@,:~) nextPell^:9(0 1x)\n1 3r2 7r5 17r12 41r29 99r70 239r169 577r408 1393r985 3363r2378\n","language":"J"},{"code":" 10{.(#~ 1&p:)nextPell^:99(0 1x)\n2 5 29 5741 33461 44560482149 1746860020068409 68480406462161287469 13558774610046711780701 4125636888562548868221559797461449\n","language":"J"},{"code":" 10{.I. 1&p:nextPell^:99(0 1x)\n2 3 5 11 13 29 41 53 59 89\n","language":"J"},{"code":" _2 +/\\ nextPell^:20(0 1x)\n1 7 41 239 1393 8119 47321 275807 1607521 9369319 54608393\n","language":"J"},{"code":" }.(21$1 0)#|:(}.,~0 1+/+/\\@}:)nextPell^:(20)0 1\n 3 4 5\n 20 21 29\n 119 120 169\n 696 697 985\n 4059 4060 5741\n 23660 23661 33461\n 137903 137904 195025\n 803760 803761 1136689\n 4684659 4684660 6625109\n27304196 27304197 38613965\n","language":"J"},{"code":"import java.math.BigDecimal;\nimport java.math.BigInteger;\nimport java.math.MathContext;\nimport java.util.ArrayList;\nimport java.util.List;\n\npublic final class PellNumbers {\n\n\tpublic static void main(String[] aArgs) {\t\t\n\t\tSystem.out.println(\"7 Tasks\");\n\t\tSystem.out.println(\"-------\");\n\t\tSystem.out.println(\"Task 1, Pell Numbers: \" + pellNumbers(TERM_COUNT));\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"Task 2, Pell-Lucas Numbers: \" + pellLucasNumbers(TERM_COUNT));\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"Task 3, Approximations to square root of 2:\");\n\t\tList<Rational> rationals = squareRoot2(TERM_COUNT + 1);\n\t\tfor ( int i = 1; i < TERM_COUNT + 1; i++ ) {\n\t\t\tSystem.out.println(rationals.get(i) + \" = \" + rationals.get(i).toBigDecimal());\n\t\t}\n\t\tSystem.out.println();\n\t\tList<Pair> pairs = pellPrimes(TERM_COUNT);\n\t\tSystem.out.println(\"Task 4, Pell primes:\");\n\t\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\n\t\t\tSystem.out.println(pairs.get(i).pellPrime);\n\t\t}\n\t\tSystem.out.println();\n\t\tSystem.out.print(\"Task 5, Pell indices of Pell primes:\");\n\t\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\n\t\t\tSystem.out.print(pairs.get(i).index + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t\tSystem.out.println();\n\t\tSystem.out.println(\"Task 6, Newman-Shank-Williams numbers: \" + newmanShankWilliams(TERM_COUNT));\n\t\tSystem.out.println();\t\t\n\t\tSystem.out.println(\"Task , Near isoseles right triangles:\");\n\t\tList<Triple> nearIsoselesRightTriangles = nearIsoslesRightTriangles(TERM_COUNT);\n\t\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\n\t\t\tSystem.out.println(nearIsoselesRightTriangles.get(i));\n\t\t}\t\t\n\t}\n\t\n\tprivate static List<BigInteger> pellNumbers(int aTermCount) {\n\t\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\n\t\tList<BigInteger> result = new ArrayList<BigInteger>();\n\t\tfor ( int i = 0; i < aTermCount; i++ ) {\t\t\t\n\t\t\tresult.add(pellIterator.next());\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tprivate static List<BigInteger> pellLucasNumbers(int aTermCount) {\n\t\tPellIterator pellLucasIterator = new PellIterator(BigInteger.TWO, BigInteger.TWO);\n\t\tList<BigInteger> result = new ArrayList<BigInteger>();\n\t\tfor ( int i = 0; i < aTermCount; i++ ) {\n\t\t\tresult.add(pellLucasIterator.next());\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tprivate static List<Rational> squareRoot2(int aTermCount) {\n\t\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\n\t\tPellIterator pellLucasIterator = new PellIterator(BigInteger.TWO, BigInteger.TWO);\n\t\tList<Rational> result = new ArrayList<Rational>();\n\t\tfor ( int i = 0; i < aTermCount; i++ ) {\n\t\t\tresult.add( new Rational(pellLucasIterator.next().divide(BigInteger.TWO), pellIterator.next()) );\n\t\t}\n\t\treturn result;\t\t\n\t}\n\t\n\tprivate static List<Pair> pellPrimes(int aTermCount) {\n\t\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\n\t\tint index = 0;\n\t\tint count = 0;\n\t\tList<Pair> result = new ArrayList<Pair>();\n\t\twhile ( count < aTermCount ) {\n\t\t\tBigInteger pellNumber = pellIterator.next();\n\t\t\tif ( pellNumber.isProbablePrime(16) ) {\n\t\t\t\tresult.add( new Pair(pellNumber, index) );\n\t\t\t\tcount += 1;\n\t\t\t}\n\t\t\tindex += 1;\t\t\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tprivate static List<BigInteger> newmanShankWilliams(int aTermCount) {\n\t\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\n\t\tList<BigInteger> result = new ArrayList<BigInteger>();\n\t\tfor ( int i = 0; i < aTermCount; i++ ) {\n\t\t\tBigInteger pellNumber = pellIterator.next();\n\t\t\tresult.add(pellNumber.add(pellIterator.next()));\n\t\t}\t\t\n\t\treturn result;\n\t}\n\t\n\tprivate static List<Triple> nearIsoslesRightTriangles(int aTermCount) {\n\t\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\n\t\tpellIterator.next();\n\t\tList<Triple> result = new ArrayList<Triple>();\n\t\tBigInteger sum = pellIterator.next();\n\t\tfor ( int i = 0; i < aTermCount; i++ ) {\n\t\t\tsum = sum.add(pellIterator.next());\n\t\t\tBigInteger nextTerm = pellIterator.next();\n\t\t\tresult.add( new Triple(sum, sum.add(BigInteger.ONE), nextTerm) );\n\t\t\tsum = sum.add(nextTerm);\n\t\t}\n\t\treturn result;\n\t}\n\t\t\n\tprivate static class PellIterator {\n\t\t\t\n\t\tpublic PellIterator(BigInteger aFirst, BigInteger aSecond) {\n\t\t\ta = aFirst; b = aSecond;\n\t\t}\n\t\t\n\t\tpublic BigInteger next() {\n\t\t\taCopy = a;\n\t\t\tbCopy = b;\n\t\t\tb = b.add(b).add(a);\n\t\t\ta = bCopy;\n\t\t\treturn aCopy;\n\t\t}\n\t\t\n\t\tprivate BigInteger a, aCopy, b, bCopy;\n\t\t\n\t}\n\t\n\tprivate static record Rational(BigInteger numerator, BigInteger denominator) {\n\t\t\n\t\tpublic BigDecimal toBigDecimal() {\n\t\t\treturn new BigDecimal(numerator).divide( new BigDecimal(denominator), mathContext );\n\t\t}\n\t\t\n\t\tpublic String toString() {\n\t\t\treturn numerator + \" / \" + denominator;\n\t\t}\n\t\t\n\t\tprivate static MathContext mathContext = new MathContext(34);\n\t\t\n\t}\n\t\n\tprivate static record Pair(BigInteger pellPrime, int index) {}\n\t\n\tprivate static record Triple(BigInteger shortSide, BigInteger longSide, BigInteger hypotenuse) {\n\t\t\n\t\tpublic String toString() {\n\t\t\treturn \"(\" + shortSide + \", \" + longSide + \", \" + hypotenuse + \")\" ;\n\t\t}\n\t\t\n\t}\n\t\n\tprivate static final int TERM_COUNT = 10;\n\t\n}\n","language":"Java"},{"code":"using Primes\n\nfunction pellnumbers(wanted)\n pells = [0, 1]\n wanted < 3 && return pells[1:wanted]\n while length(pells) < wanted\n push!(pells, 2 * pells[end] + pells[end - 1])\n end\n return pells\nend\n\nfunction pelllucasnumbers(wanted)\n pelllucas = [2, 2]\n wanted < 3 && return pelllucas[1:wanted]\n while length(pelllucas) < wanted\n push!(pelllucas, 2 * pelllucas[end] + pelllucas[end - 1])\n end\n return pelllucas\nend\n\nfunction pellprimes(wanted)\n i, lastpell, lastlastpell, primeindices, pellprimes = 1, big\"1\", big\"0\", Int[], BigInt[]\n while length(primeindices) < wanted\n pell = 2 * lastpell + lastlastpell\n i += 1\n if isprime(pell)\n push!(primeindices, i)\n push!(pellprimes, pell)\n end\n lastpell, lastlastpell = pell, lastpell\n end\n return primeindices, pellprimes\nend\n\nfunction approximationsqrt2(wanted)\n p, q = pellnumbers(wanted + 1), pelllucasnumbers(wanted + 1)\n return map(r -> \"$r ≈ $(Float64(r))\", [(q[n] // 2) // p[n] for n in 2:wanted+1])\nend\n\nfunction newmanshankwilliams(wanted)\n pells = pellnumbers(wanted * 2 + 1)\n return [pells[2i - 1] + pells[2i] for i in 1:wanted]\nend\n\nfunction nearisosceles(wanted)\n pells = pellnumbers((wanted + 1) * 2 + 1)\n return map(x -> (last(x), last(x) + 1, first(x)),\n [(pells[2i], sum(pells[1:2i-1])) for i in 2:wanted+1])\nend\n\nfunction printrows(title, vec, columnsize = 8, columns = 10, rjust=false)\n println(title)\n for (i, n) in enumerate(vec)\n print((rjust ? lpad : rpad)(n, columnsize), i % columns == 0 ? \"\\n\" : \"\")\n end\n println()\nend\n\nprintrows(\"Twenty Pell numbers:\", pellnumbers(20))\nprintrows(\"Twenty Pell-Lucas numbers:\", pelllucasnumbers(20))\nprintrows(\"Twenty approximations of √2:\", approximationsqrt2(20), 44, 2)\npindices, pprimes = pellprimes(15)\nprintrows(\"Fifteen Pell primes:\", pprimes, 90, 1)\nprintrows(\"Fifteen Pell prime zero-based indices:\", pindices, 4, 15)\nprintrows(\"Twenty Newman-Shank-Williams numbers:\", newmanshankwilliams(20), 17, 5)\nprintrows(\"Twenty near isosceles triangle triplets:\", nearisosceles(20), 52, 2)\n","language":"Julia"},{"code":"ClearAll[PellNumber, PellLucasNumber]\nPellNumber[0] = 0;\nPellNumber[1] = 1;\nPellNumber[n_] := PellNumber[n] = 2 PellNumber[n - 1] + PellNumber[n - 2]\n\nPellLucasNumber[0] = 2;\nPellLucasNumber[1] = 2;\nPellLucasNumber[n_] := PellLucasNumber[n] = 2 PellLucasNumber[n - 1] + PellLucasNumber[n - 2]\n\npns = PellNumber /@ Range[0, 9]\n\nplns = PellLucasNumber /@ Range[0, 9]\n\nden = Rest@pns;\nnum = Rest@plns/2;\napprox = num/den\nN[approx]\n\npns = {#, PellNumber[#]} & /@ Range[0, 100];\nSelect[pns, Last/*PrimeQ, 10] // Grid\n\nClearAll[PellS]\nPellS[n_] := If[n == 0, 1, PellNumber[2 n] + PellNumber[2 n + 1]]\nPellS /@ Range[0, 19]\n\nClearAll[PythagoreanTriple]\nPythagoreanTriple[n_Integer] := Module[{hypo, short, long},\n hypo = PellNumber[2 n + 1];\n short = Total[PellNumber /@ Range[2 n]];\n long = short + 1;\n {short, long, hypo}\n ]\nPythagoreanTriple /@ Range[10]\n","language":"Mathematica"},{"code":"import std/[strformat, strutils, sugar]\nimport integers\n\ntemplate isOdd(n: int): bool = (n and 1) != 0\n\niterator pellSequence[T](first, second: T; lim = -1): (int, T) =\n ## Yield the sucessive values of a Pell or Pell-Lucas sequence\n ## preceded by their rank.\n ## If \"lim\" is specified and greater than 2, only the \"lim\" first\n ## values are computed.\n ## The iterator works with \"int\" values or \"Integer\" values.\n var prev = first\n var curr = second\n yield (0, prev)\n yield (1, curr)\n var count = 2\n while true:\n swap prev, curr\n curr += 2 * prev\n yield (count, curr)\n inc count\n if count == lim: break\n\necho \"First 10 Pell numbers:\"\nlet p = collect:\n for (idx, val) in pellSequence(0, 1, 11): val\necho p[0..9].join(\" \")\n\necho \"\\nFirst 10 Pell-Lucas numbers:\"\nlet q = collect:\n for (idx, val) in pellSequence(2, 2, 11): val\necho q[0..9].join(\" \")\n\necho \"\\nFirst 10 rational approximations of √2:\"\nfor i in 1..10:\n let n = q[i] div 2\n let d = p[i]\n let r = &\"{n}/{d}\"\n echo &\"{r:>9} = {n/d:.17}\"\n\necho \"\\nFirst 10 Pell primes:\"\n# To avoid an overflow, we need to use Integer values here.\nvar indices: seq[int]\nvar count = 0\nfor (idx, p) in pellSequence(newInteger(0), newInteger(1)):\n if p.isPrime:\n echo p\n indices.add idx\n inc count\n if count == 10: break\n\necho \"\\nFirst 10 Pell primes indices:\"\necho indices.join(\" \")\n\necho \"\\nFirst 10 Newman-Shank-Williams numbers:\"\ncount = 0\nvar prev: int\nfor (idx, p) in pellSequence(0, 1):\n if idx.isOdd:\n inc count\n stdout.write prev + p\n if count == 10: break\n stdout.write ' '\n else:\n prev = p\necho()\n\necho \"\\nFirst 10 near isosceles right triangles:\"\ncount = 0\nvar sum = 0\nfor (idx, p) in pellSequence(0, 1):\n if idx.isOdd and sum != 0:\n echo (sum, sum + 1, p)\n inc count\n if count == 10: break\n inc sum, p\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature <state say>;\nuse bignum;\nuse ntheory 'is_prime';\nuse List::Util <sum head>;\nuse List::Lazy 'lazy_list';\n\nmy $upto = 20;\n\nmy $pell_recur = lazy_list { state @p = (0, 1); push @p, 2*$p[1] + $p[0]; shift @p };\nmy $pell_lucas_recur = lazy_list { state @p = (2, 2); push @p, 2*$p[1] + $p[0]; shift @p };\n\nmy @pell;\npush @pell, $pell_recur->next() for 1..1500; #wart;\n\nmy @pell_lucas;\npush @pell_lucas, $pell_lucas_recur->next() for 1..$upto+1;\n\nsay \"First $upto Pell numbers:\";\nsay join ' ', @pell[0..$upto-1];\n\nsay \"\\nFirst $upto Pell-Lucas numbers:\";\nsay join ' ', @pell_lucas[0..$upto-1];\n\nsay \"\\nFirst $upto rational approximations of √2:\";\nsay sprintf \"%d/%d - %1.16f\", $pell[$_-1] + $pell[$_], $pell[$_], ($pell[$_-1]+$pell[$_])/$pell[$_] for 1..$upto;\n\nsay \"\\nFirst $upto Pell primes:\";\nsay join \"\\n\", head $upto, grep { is_prime $_ } @pell;\n\nsay \"\\nIndices of first $upto Pell primes:\";\nsay join ' ', head $upto, grep { is_prime($pell[$_]) and $_ } 0..$#pell;\n\nsay \"\\nFirst $upto Newman-Shank-Williams numbers:\";\nsay join ' ', map { $pell[2 * $_] + $pell[2 * $_+1] } 0..$upto-1;\n\nsay \"\\nFirst $upto near isoceles right tringles:\";\nmap {\n my $y = 2*$_ + 1;\n my $x = sum @pell[0..$y-1];\n printf \"(%d, %d, %d)\\n\", $x, $x+1, $pell[$y]\n} 1..$upto;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">pl</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">41</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">p</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #000000;\">pl</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"First 20 Pell numbers: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"First 20 Pell-Lucas: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join_by</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">],</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">20</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fmt</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"First 20 rational approximations of sqrt(2) (%.16f):\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">sqrt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">21</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">n</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pl</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">d</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%d/%d ~= %.16g\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">d</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nFirst 20 Pell primes:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #004080;\">mpfr</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n <span style=\"color: #004080;\">mpz</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">p0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mpz_inits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">ppdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">2</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ppdx</span><span style=\"color: #0000FF;\">)<</span><span style=\"color: #000000;\">20</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">mpz_mul_si</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_add</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">is_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pdx</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #7060A8;\">mpz_prime</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">mpz_get_short_str</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">ppdx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ppdx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pdx</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">pdx</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #7060A8;\">mpz_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">mpz_set</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nIndices of first 20 Pell primes: %s\\n\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">ppdx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">nsw</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">20</span> <span style=\"color: #008080;\">do</span> <span style=\"color: #000000;\">nsw</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nsw</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%d\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">]+</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">n</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]))</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">nsw</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">..-</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #008000;\">\"...\"</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nFirst 20 Newman-Shank-Williams numbers: %s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">nsw</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">)})</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\nFirst 20 near isosceles right triangles:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">42</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">side</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sum</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]),</span> <span style=\"color: #000000;\">hypot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"[%d, %d, %d]\\n\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">side</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">side</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">hypot</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n<!--\n","language":"Phix"},{"code":"# pell_numbers.py by Xing216\ndef is_prime(n):\n if n == 1:\n return False\n i = 2\n while i*i <= n:\n if n % i == 0:\n return False\n i += 1\n return True\ndef pell(p0: int,p1: int,its: int):\n nums = [p0,p1]\n primes = {}\n idx = 2\n while len(nums) != its:\n p = 2*nums[-1]+nums[-2]\n if is_prime(p):\n primes[idx] = p\n nums.append(p)\n idx += 1\n return nums, primes\ndef nsw(its: int,pell_nos: list):\n nums = []\n for i in range(its):\n nums.append(pell_nos[2*i] + pell_nos[2*i+1])\n return nums\ndef pt(its: int, pell_nos: list):\n nums = []\n for i in range(1,its+1):\n hypot = pell_nos[2*i+1]\n shorter_leg = sum(pell_nos[:2*i+1])\n longer_leg = shorter_leg + 1\n nums.append((shorter_leg,longer_leg,hypot))\n return nums\npell_nos, pell_primes = pell(0,1,50)\npell_lucas_nos, pl_primes = pell(2,2,10)\nnsw_nos = nsw(10, pell_nos)\npythag_triples = pt(10, pell_nos)\nsqrt2_approx = {}\nfor idx, pell_no in enumerate(pell_nos):\n numer = pell_nos[idx-1] + pell_no\n if pell_no != 0:\n sqrt2_approx[f\"{numer}/{pell_no}\"] = numer/pell_no\nprint(f\"The first 10 Pell Numbers:\\n {' '.join([str(_) for _ in pell_nos[:10]])}\")\nprint(f\"The first 10 Pell-Lucas Numbers:\\n {' '.join([str(_) for _ in pell_lucas_nos])}\")\nprint(f\"The first 10 rational and decimal approximations of sqrt(2) ({(2**0.5):.10f}):\")\nprint(\" rational | decimal\")\nfor rational in list(sqrt2_approx.keys())[:10]:\n print(f\"{rational:>10} ≈ {sqrt2_approx[rational]:.10f}\")\nprint(\"The first 7 Pell Primes:\")\nprint(\" index | Pell Prime\")\nfor idx, prime in pell_primes.items():\n print(f\"{idx:>6} | {prime}\")\nprint(f\"The first 10 Newman-Shank-Williams numbers:\\n {' '.join([str(_) for _ in nsw_nos])}\")\nprint(f\"The first 10 near isosceles right triangles:\")\nfor i in pythag_triples:\n print(f\" {i}\")\n","language":"Python"},{"code":" [ $ \"bigrat.qky\" loadfile ] now!\n\n [ ' [ 0 ] swap\n witheach\n [ over -1 peek\n + join ]\n behead drop ] is cumsum ( [ --> [ )\n\n [ dup -1 peek 2 *\n over -2 peek + join ] is nextterm ( [ --> [ )\n\n [ over 2 - times\n nextterm\n swap split drop ] is sequence ( n [ --> [ )\n\n [ ' [ 0 1 ] sequence ] is pells ( n --> [ )\n\n [ ' [ 2 2 ] sequence ] is companions ( n --> [ )\n\n [ [] swap 1+\n dup companions\n behead drop\n swap pells\n behead drop\n witheach\n [ dip\n [ behead 2 / ]\n join nested\n rot swap join\n swap ]\n drop ] is rootytwos ( n --> [ )\n\n [ stack ] is index ( --> s )\n\n [ temp put\n 1 index put\n [] ' [ 0 1 ]\n [ 1 index tally\n over size\n temp share < while\n nextterm\n behead drop\n index share\n isprime until\n dup -1 peek\n dup isprime iff\n [ swap dip\n [ index share\n swap join\n nested join ] ]\n else drop\n again ]\n drop\n index release\n temp release ] is pellprimes ( n --> [ )\n\n [ [] over 2 * pells\n rot times\n [ behead dip behead +\n join ]\n nip ] is nsws ( n --> [ )\n\n [ [] swap 1+ dup\n 2 * 1+ pells\n dup cumsum\n swap rot times\n [ over i^ 2 * peek\n dup 1+ join\n over i^ 2 * 1+ peek\n join\n dip rot nested join\n unrot ]\n 2drop behead drop ] is nirts ( n --> [ )\n\n say \"Pell numbers \" 10 pells echo\n cr cr\n say \"Pell-Lucas's \" 10 companions echo\n cr cr\n say \"Approximations of sqrt(2)\"\n cr\n 10 rootytwos\n witheach\n [ do 2dup\n vulgar$ echo$ sp\n 10 point$ echo$ cr ]\n cr\n say \"Pell Primes \"\n 7 pellprimes dup\n [] swap\n witheach [ 1 peek join ] echo\n cr\n say \"their indices \"\n [] swap\n witheach [ 0 peek join ] echo\n cr cr\n say \"NSW numbers \" 10 nsws echo\n cr cr\n say \"Near isosceles right triangles\"\n cr\n 10 nirts witheach [ echo cr ]\n","language":"Quackery"},{"code":"my $pell = cache lazy 0, 1, * + * × 2 … *;\nmy $pell-lucas = lazy 2, 2, * + * × 2 … *;\n\nmy $upto = 20;\n\nsay \"First $upto Pell numbers:\\n\" ~ $pell[^$upto];\n\nsay \"\\nFirst $upto Pell-Lucas numbers:\\n\" ~ $pell-lucas[^$upto];\n\nsay \"\\nFirst $upto rational approximations of √2 ({sqrt(2)}):\\n\" ~\n(1..$upto).map({ sprintf \"%d/%d - %1.16f\", $pell[$_-1] + $pell[$_], $pell[$_], ($pell[$_-1]+$pell[$_])/$pell[$_] }).join: \"\\n\";\n\nsay \"\\nFirst $upto Pell primes:\\n\" ~ $pell.grep(&is-prime)[^$upto].join: \"\\n\";\n\nsay \"\\nIndices of first $upto Pell primes:\\n\" ~ (^∞).grep({$pell[$_].is-prime})[^$upto];\n\nsay \"\\nFirst $upto Newman-Shank-Williams numbers:\\n\" ~ (^$upto).map({ $pell[2 × $_, 2 × $_+1].sum });\n\nsay \"\\nFirst $upto near isosceles right triangles:\";\nmap -> \\p { printf \"(%d, %d, %d)\\n\", |($_, $_+1 given $pell[^(2 × p + 1)].sum), $pell[2 × p + 1] }, 1..$upto;\n","language":"Raku"},{"code":"require 'openssl'\ndef prime?(n) = OpenSSL::BN.new(n).prime?\n\npell = Enumerator.new do |y|\n pe = [0,1]\n loop{y << pe[0]; pe << pe[1]*2 + pe.shift}\nend\n\npell_lucas = Enumerator.new do |y|\n pe = [2,2]\n loop{y << pe[0]; pe << pe[1]*2 + pe.shift}\nend\n\nn = 20\nputs \"First #{n} Pell numbers: #{pell.first(n).to_a.inspect}\"\nputs \"\\nFirst #{n} Pell-Lucas numbers: #{pell_lucas.first(n).to_a.inspect}\"\n\nn = 15\nsqrt2 = pell.each_cons(2).lazy.map{|p1,p2| Rational(p1+p2, p2)}.take(n).to_a\nputs \"\\nThe first #{n} rational approximations of √2 (#{Math.sqrt(2)}) are:\"\nsqrt2.each{|n| puts \"%-16s ≈ %-18s\\n\"% [n, n.to_f]}\n\nputs \"\\nThe first #{n} Pell primes with index are:\"\nprimes = pell.with_index.lazy.select{|n, i|prime?(i) && prime?(n)}.first(n)\nprimes.each {|prime, i| puts \"#{i.to_s.ljust(3)} #{prime}\"}\n\nputs \"\\nThe first #{n} NSW numbers:\"\nputs pell.first(2*n).each_slice(2).map(&:sum).join(\", \")\n\nputs \"\\nFirst #{n} near isosceles right triangles:\"\nsum = 1\npell.take(n*2+2).each_slice(2) do |p1,p2|\n next if p1 == 0\n sum += p1\n puts \"#{sum}, #{sum+1}, #{p2}\"\n sum += p2\nend\n","language":"Ruby"},{"code":"val pellNumbers: LazyList[BigInt] =\n BigInt(\"0\") #:: BigInt(\"1\") #::\n (pellNumbers zip pellNumbers.tail).\n map{ case (a,b) => 2*b + a }\n\nval pellLucasNumbers: LazyList[BigInt] =\n BigInt(\"2\") #:: BigInt(\"2\") #::\n (pellLucasNumbers zip pellLucasNumbers.tail).\n map{ case (a,b) => 2*b + a }\n\nval pellPrimes: LazyList[BigInt] =\n pellNumbers.tail.tail.\n filter{ case p => p.isProbablePrime(16) }\n\nval pellIndexOfPrimes: LazyList[BigInt] =\n pellNumbers.tail.tail.\n filter{ case p => p.isProbablePrime(16) }.\n map{ case p => pellNumbers.indexOf(p) }\n\nval pellNSWnumbers: LazyList[BigInt] =\n (pellNumbers.zipWithIndex.collect{ case (p,i) if i%2 == 0 => p}\n zip\n pellNumbers.zipWithIndex.collect{ case (p,i) if i%2 != 0 => p}).\n map{ case (a,b) => a + b }\n\nval pellSqrt2Numerator: LazyList[BigInt] =\n BigInt(1) #:: BigInt(3) #::\n (pellSqrt2Numerator zip pellSqrt2Numerator.tail).\n map{ case (a,b) => 2*b + a }\n\nval pellSqrt2: LazyList[BigDecimal] =\n (pellSqrt2Numerator zip pellNumbers.tail).\n map{ case (n,d) => BigDecimal(n)/BigDecimal(d) }\n\nval pellSqrt2asString: LazyList[String] =\n (pellSqrt2Numerator zip pellNumbers.tail).\n map{ case (n,d) => s\"$n/$d\" }\n\nval pellHypotenuse: LazyList[BigInt] =\n pellNumbers.tail.tail.zipWithIndex.collect{ case (p,i) if i%2 != 0 => p }\n\nval pellShortLeg: LazyList[BigInt] =\n LazyList.from(3,2).map{ case s => pellNumbers.take(s).sum }\n\nval pellTriple: LazyList[(BigInt,BigInt,BigInt)] =\n (pellHypotenuse zip pellShortLeg).\n map{ case (h,s) => (s,s+1,h)}\n\n// Output\n{ println(\"7 Tasks\")\n println(\"-------\")\n println(pellNumbers.take(10).mkString(\"1. Pell Numbers: \", \",\", \"\\n\"))\n println(pellLucasNumbers.take(10).mkString(\"2. Pell-Lucas Numbers: \", \",\", \"\\n\"))\n println((pellSqrt2asString zip pellSqrt2).take(10).\n map { case (f, d) => s\"$f = $d\" }.\n mkString(\"3. Square-root of 2 Approximations: \\n\\n\",\n \"\\n\", \"\\n\"))\n println(pellPrimes.take(10).mkString(\"4. Pell Primes: \\n\\n\", \"\\n\", \"\\n\"))\n println(pellIndexOfPrimes.take(10).mkString(\"5. Pell Index of Primes: \", \",\", \"\\n\"))\n println(pellNSWnumbers.take(10).mkString(\"6. Newman-Shank-Williams Numbers: \\n\\n\", \"\\n\", \"\\n\"))\n println(pellTriple.take(10).mkString(\"7. Near Right-triangle Triples: \\n\\n\", \"\\n\", \"\\n\"))\n}\n","language":"Scala"},{"code":"import \"./big\" for BigInt, BigRat\nimport \"./math\" for Int\nimport \"./fmt\" for Fmt\n\nvar p = List.filled(40, 0)\np[0] = 0\np[1] = 1\nfor (i in 2..39) p[i] = 2 * p[i-1] + p[i-2]\nSystem.print(\"The first 20 Pell numbers are:\")\nSystem.print(p[0..19].join(\" \"))\n\nvar q = List.filled(40, 0)\nq[0] = 2\nq[1] = 2\nfor (i in 2..39) q[i] = 2 * q[i-1] + q[i-2]\nSystem.print(\"\\nThe first 20 Pell-Lucas numbers are:\")\nSystem.print(q[0..19].join(\" \"))\n\nSystem.print(\"\\nThe first 20 rational approximations of √2 (1.4142135623730951) are:\")\nfor (i in 1..20) {\n var r = BigRat.new(q[i]/2, p[i])\n Fmt.print(\"$-17s ≈ $-18s\", r, r.toDecimal(16, true, true))\n}\n\nSystem.print(\"\\nThe first 15 Pell primes are:\")\nvar p0 = BigInt.zero\nvar p1 = BigInt.one\nvar indices = List.filled(15, 0)\nvar count = 0\nvar index = 2\nvar p2\nwhile (count < 15) {\n p2 = p1 * BigInt.two + p0\n if (Int.isPrime(index) && p2.isProbablePrime(10)) {\n System.print(p2)\n indices[count] = index\n count = count + 1\n }\n index = index + 1\n p0 = p1\n p1 = p2\n}\n\nSystem.print(\"\\nIndices of the first 15 Pell primes are:\")\nSystem.print(indices.join(\" \"))\n\nSystem.print(\"\\nFirst 20 Newman-Shank_Williams numbers:\")\nvar nsw = List.filled(20, 0)\nfor (n in 0..19) nsw[n] = p[2*n] + p[2*n+1]\nFmt.print(\"$d\", nsw)\n\nSystem.print(\"\\nFirst 20 near isosceles right triangles:\")\np0 = 0\np1 = 1\nvar sum = 1\nvar i = 2\nwhile (i < 43) {\n p2 = p1 * 2 + p0\n if (i % 2 == 1) {\n Fmt.print(\"($d, $d, $d)\", sum, sum + 1, p2)\n }\n sum = sum + p2\n p0 = p1\n p1 = p2\n i = i + 1\n}\n","language":"Wren"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pell_numbers\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"'''Pell numbers''' are an infinite sequence of integers that comprise the denominators of the closest rational approximations to the square root of 2 but have many other interesting uses and relationships.\\n\\nThe numerators of each term of rational approximations to the square root of 2 may ''also'' be derived from '''Pell numbers''', or may be found by taking half of each term of the related sequence: '''Pell-Lucas''' or '''Pell-companion numbers'''.\\n\\n\\nThe '''Pell numbers''': '''0, 1, 2, 5, 12, 29, 70, etc.''', are defined by the recurrence relation:\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n P<sub>0</sub> = 0;\\n P<sub>1</sub> = 1;\\n P<sub>n</sub> = 2 × P<sub>n-1</sub> + P<sub>n-2</sub>;\\n </span>\\n\\nOr, may also be expressed by the closed form formula:\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n P<sub>n</sub> = ((1 + √2)<sup>n</sup> - (1 - √2)<sup>n</sup>) / (2 × √2);\\n </span>\\n\\n\\n'''Pell-Lucas''' or '''Pell-companion numbers''': '''2, 2, 6, 14, 34, 82, etc.''', are defined by a very similar recurrence relation, differing only in the first two terms:\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n Q<sub>0</sub> = 2;\\n Q<sub>1</sub> = 2;\\n Q<sub>n</sub> = 2 × Q<sub>n-1</sub> + Q<sub>n-2</sub>;\\n </span>\\n\\nOr, may also be expressed by the closed form formula:\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n Q<sub>n</sub> = (1 + √2)<sup>n</sup> + (1 - √2)<sup>n</sup>;\\n </span>\\n\\nor\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n Q<sub>n</sub> = P<sub>2n</sub> / P<sub>n</sub>;\\n </span>\\n\\n\\n\\nThe sequence of rational approximations to the square root of 2 begins:\\n\\n <span style=\\\"font-size:125%;font-weight:bold;\\\">\\n 1/1, 3/2, 7/5, 17/12, 41/29, ...\\n </span>\\n\\nStarting from '''n = 1''', for each term, the denominator is '''P<sub>n</sub>''' and the numerator is '''Q<sub>n</sub> / 2''' or '''P<sub>n-1</sub> + P<sub>n</sub>'''.\\n\\n\\n\\n\\n'''Pell primes''' are '''Pell numbers''' that are prime. '''Pell prime indices''' are the indices of the primes in the '''Pell numbers''' sequence. Every '''Pell prime''' index is prime, though not every prime index corresponds to a prime '''Pell number'''.\\n\\n\\n\\nIf you take the sum '''S''' of the first '''4n + 1''' '''Pell numbers''', the sum of the terms '''P<sub>2n</sub>''' and '''P<sub>2n + 1</sub>''' will form the square root of '''S'''.\\n\\nFor instance, the sum of the '''Pell numbers''' up to '''P<sub>5</sub>'''; '''0 + 1 + 2 + 5 + 12 + 29 == 49''', is the square of '''P<sub>2</sub> + P<sub>3</sub> == 2 + 5 == 7'''. The sequence of numbers formed by the sums '''P<sub>2n</sub> + P<sub>2n + 1</sub>''' are known as '''Newman-Shank-Williams numbers''' or '''NSW numbers'''.\\n\\n\\n\\n'''Pell numbers''' may also be used to find Pythagorean triple '''near isosceles right triangles'''; right triangles whose legs differ by exactly '''1'''. E.G.: '''(3,4,5), (20,21,29), (119,120,169), etc.'''\\n\\nFor '''n > 0''', each right triangle hypotenuse is '''P<sub>2n + 1</sub>'''. The shorter leg length is the sum of the terms ''up to'' '''P<sub>2n + 1</sub>'''. The longer leg length is '''1''' more than that.\\n\\n\\n\\n;Task\\n;* Find and show at least the first 10 '''Pell numbers'''.\\n;* Find and show at least the first 10 '''Pell-Lucas numbers'''.\\n;* Use the '''Pell''' (and optionally, '''Pell-Lucas''') '''numbers''' sequence to find and show at least the first 10 rational approximations to √2 in both rational and decimal representation.\\n;* Find and show at least the first 10 '''Pell primes'''.\\n;* Find and show at least the first 10 indices of '''Pell primes'''.\\n;* Find and show at least the first 10 '''Newman-Shank-Williams numbers'''\\n;* Find and show at least the first 10 Pythagorean triples corresponding to '''near isosceles right triangles'''.\\n\\n\\n\\n;See also\\n;* [[wp:Pell_number|Wikipedia: Pell number]]\\n;* [[oeis:A000129|OEIS:A000129 - Pell numbers]]\\n;* [[oeis:A002203|OEIS:A002203 - Companion Pell numbers]] (Pell-Lucas numbers)\\n;* [[oeis:A001333|OEIS:A001333 - Numerators of continued fraction convergents to sqrt(2)]] (Companion Pell numbers / 2)\\n;* [[oeis:A086383|OEIS:A086383 - Prime terms in the sequence of Pell numbers]]\\n;* [[oeis:A096650|OEIS:A096650 - Indices of prime Pell numbers]]\\n;* [[oeis:A002315|OEIS:A002315 - NSW numbers]] (Newman-Shank-Williams numbers)\\n;* [[wp:Pythagorean_triple|Wikipedia: Pythagorean triple]]\\n;* [[Pythagorean triples]]\\n\\n\\n\\n\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"BEGIN # find some Pell numbers - trans FreeBASIC ( which is trans Phix ) #\\n\\n PR read \\\"primes.incl.a68\\\" PR\\n\\n [ 0 : 90 ]LONG INT p, pl;\\n p[ 0 ] := 0; p[ 1 ] := 1;\\n pl[ 0 ] := 2; pl[ 1 ] := 2;\\n FOR n FROM 2 TO UPB p DO\\n p[ n ] := 2 * p[ n - 1 ] + p[ n - 2 ];\\n pl[ n ] := 2 * pl[ n - 1 ] + pl[ n - 2 ]\\n OD;\\n\\n print( ( \\\"First 20 Pell numbers:\\\", newline ) );\\n FOR n FROM 0 TO 19 DO print( ( \\\" \\\", whole( p[ n ], 0 ) ) ) OD;\\n print( ( newline, newline, \\\"First 20 Pell-Lucas numbers:\\\", newline ) );\\n FOR n FROM 0 TO 19 DO print( ( \\\" \\\", whole( pl[ n ], 0 ) ) ) OD;\\n\\n print( ( newline, newline, \\\"First 20 rational approximations of sqrt(2) (\\\" ) );\\n print( ( fixed( sqrt( 2 ), -15, 13 ), \\\"):\\\", newline ) );\\n FOR n TO 20 DO\\n LONG INT j = pl[ n ] OVER 2, d = p[ n ];\\n print( ( \\\" \\\", whole( j, 0 ), \\\"/\\\", whole( d, 0 ), \\\" ~= \\\", fixed( j / d, -15, 13 ), newline ) )\\n OD;\\n\\n print( ( newline, \\\"First 10 Pell primes:\\\", newline, \\\"index Pell prime\\\", newline ) );\\n INT c := 0;\\n FOR pdx FROM 2 WHILE c < 10 DO\\n IF is probably prime( p[ pdx ] ) THEN\\n print( ( whole( pdx, -5 ), \\\" \\\", whole( p[ pdx ], 0 ), newline ) );\\n c +:= 1\\n FI\\n OD;\\n\\n print( ( newline, newline, \\\"First 20 Newman-Shank-Williams numbers:\\\", newline ) );\\n FOR n FROM 0 TO 19 DO\\n LONG INT nsw = p[ 2 * n ] + p[ 2 * n + 1 ];\\n print( ( \\\" \\\", whole( nsw, 0 ) ) ); IF n = 13 THEN print( ( newline ) ) FI\\n OD;\\n\\n print( ( newline, newline, \\\"First 20 near isosceles right triangles:\\\", newline ) );\\n LONG INT i0 := 0, i1 := 1, t := 1, found := 0;\\n FOR i FROM 2 WHILE found < 20 DO\\n LONG INT i2 = i1*2 + i0;\\n IF ODD i THEN\\n print( ( \\\" [\\\", whole( t, 0 ), \\\", \\\", whole( t + 1, 0 ), \\\", \\\", whole( i2, 0 ), \\\"]\\\", newline ) );\\n found +:= 1\\n FI;\\n t +:= i2; i0 := i1; i1 := i2\\n OD\\n\\nEND\\n\",\n \"language\": \"ALGOL-68\"\n },\n {\n \"code\": \"begin % find some Pell numbers - trans FreeBasic ( which is trans Phix ) %\\n\\n % returns true if n is prime, false otherwise, uses trial division %\\n logical procedure isPrime ( integer value n ) ;\\n if n < 3 then n = 2\\n else if n rem 3 = 0 then n = 3\\n else if not odd( n ) then false\\n else begin\\n logical prime;\\n integer f, f2, toNext;\\n prime := true;\\n f := 5;\\n f2 := 25;\\n toNext := 24; % note: ( 2n + 1 )^2 - ( 2n - 1 )^2 = 8n %\\n while f2 <= n and prime do begin\\n prime := n rem f not = 0;\\n f := f + 2;\\n f2 := toNext;\\n toNext := toNext + 8\\n end while_f2_le_n_and_prime ;\\n prime\\n end isPrime ;\\n\\n integer MAX_P;\\n MAX_P := 9;\\n begin\\n integer array p, pl ( 0 :: 20 ); % need more than 10 Pell numbers %\\n integer c, pdx; % to find the fifth Pell prime %\\n\\n p( 0 ) := 0; p( 1 ) := 1;\\n pl( 0 ) := 2; pl( 1 ) := 2;\\n for n := 2 until 20 do begin\\n p( n ) := 2 * p( n - 1 ) + p( n - 2 );\\n pl( n ) := 2 * pl( n - 1 ) + pl( n - 2 )\\n end for_n ;\\n\\n write( \\\"First 10 Pell numbers:\\\" );\\n for n := 0 until MAX_P do begin writeon( i_w := 1, s_w := 0, \\\" \\\", p( n ) ) end;\\n write();write( \\\"First 10 Pell-Lucas numbers:\\\" );\\n for n := 0 until MAX_P do begin\\n writeon( i_w := 1, s_w := 0, \\\" \\\", pl( n ) )\\n end for_n ;\\n\\n write( s_w := 0, \\\"First 10 rational approximations of sqrt(2) (\\\" );\\n writeon( s_w := 0, r_format := \\\"A\\\", r_w := 8, r_d := 6, sqrt( 2 ), \\\"):\\\" );\\n for n := 1 until MAX_P do begin\\n integer j;\\n j := pl( n ) div 2;\\n write( i_w := 1, s_w := 0, \\\" \\\", j, \\\"/\\\", p( n ), \\\" ~= \\\"\\n , r_format := \\\"A\\\", r_w := 8, r_d := 6, j / p( n )\\n )\\n end for_n;\\n\\n write();write( \\\"First 5 Pell primes:\\\" ); write( \\\"index Pell prime\\\" );\\n c := 0;\\n pdx := 2;\\n while c < 5 do begin\\n if isPrime( p( pdx ) ) then begin\\n write( i_w := 5, s_w := 0, pdx, \\\" \\\", i_w := 1, p( pdx ) );\\n c := c + 1\\n end if_isPrime_p_pdx ;\\n pdx := pdx + 1\\n end while_c_lt_5 ;\\n\\n write(); write( \\\"First 10 Newman-Shank-Williams numbers:\\\" );write();\\n for n := 0 until MAX_P do begin\\n integer nsw;\\n nsw := p( 2 * n ) + p( 2 * n + 1 );\\n writeon( i_w := 1, s_w := 0, \\\" \\\", nsw )\\n end for_n;\\n\\n write();write( \\\"First 10 near isosceles right triangles:\\\" );\\n begin\\n integer i, i0, i1, i2, t, found;\\n i0 := 0; i1 := 1; t := 1; found := 0;\\n i := 1;\\n while found < 10 do begin\\n i := i + 1;\\n i2 := i1*2 + i0;\\n if odd( i ) then begin\\n write( i_w := 1, s_w := 0, \\\" [\\\", t, \\\", \\\", t + 1, \\\", \\\", i2, \\\"]\\\" );\\n found := found + 1\\n end if_odd_i ;\\n t := t + i2; i0 := i1; i1 := i2\\n end while_found_lt_10\\n end\\n\\n end\\n\\nend.\\n\",\n \"language\": \"ALGOL-W\"\n },\n {\n \"code\": \"(defun recurrent-sequence-2 (a0 a1 k1 k2 max)\\n \\\"A generic function for any recurrent sequence of order 2, where a0 and a1 are the initial elements,\\n k1 is the factor of a(n-1) and k2 is the factor of a(n-2)\\\"\\n\\t(do* ((i 0 (1+ i))\\n\\t (result (list a1 a0))\\n\\t (b0 a0 b1)\\n\\t (b1 a1 b2)\\n\\t (b2 (+ (* k1 b1) (* k2 b0)) (+ (* k1 b1) (* k2 b0))) )\\n\\t \\t((> i max) (nreverse result))\\n\\t\\t(push b2 result) ))\\n\\n(defun pell-sequence (max)\\n\\t(recurrent-sequence-2 0 1 2 1 max) )\\n\\n(defun pell-lucas-sequence (max)\\n\\t(recurrent-sequence-2 2 2 2 1 max) )\\n\\n(defun fibonacci-sequence (max) ; As an extra bonus, you get Fibonacci's numbers with this simple call\\n\\t(recurrent-sequence-2 1 1 1 1 max) )\\n\\n(defun rational-approximation-sqrt2 (max)\\n \\\"Approximate square root of 2 with (P(n-1)+P(n-2))/P(n)\\\"\\n\\t(butlast (maplist #'(lambda (l) (/ (+ (first l) (or (second l) 0)) (or (second l) 1))) (pell-sequence max))) )\\n\\n(defun pell-primes (max)\\n\\t(do* ((i 0 (1+ i))\\n\\t (result (list 1 0))\\n\\t (indices nil)\\n\\t (b0 0 b1)\\n\\t (b1 1 b2)\\n\\t (b2 (+ (* 2 b1) (* 1 b0)) (+ (* 2 b1) (* 1 b0))) )\\n\\t \\t((> (length result) max) (values (nreverse result)(nreverse indices)))\\n ; primep can be any function determining whether a number is prime, for example,\\n ; https://rosettacode.org/wiki/Primality_by_Wilson%27s_theorem#Common_Lisp\\n\\t (when (primep b2)\\n\\t\\t\\t(push b2 result)\\n\\t\\t\\t(push i indices) )))\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(pell-sequence 10)\\n(0 1 2 5 12 29 70 169 408 985 2378 5741 13860)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(pell-lucas-sequence 10)\\n(2 2 6 14 34 82 198 478 1154 2786 6726 16238 39202)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(rational-approximation-sqrt2 10)\\n(1 3/2 7/5 17/12 41/29 99/70 239/169 577/408 1393/985 3363/2378 8119/5741\\n 19601/13860)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(mapcar #'float (rational-approximation-sqrt2 10))\\n(1.0 1.5 1.4 1.4166666 1.4137931 1.4142857 1.4142011 1.4142157 1.4142132\\n 1.4142137 1.4142135 1.4142135)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"(pell-primes 7)\\n(0 1 2 5 29 5741 33461 44560482149) ;\\n(0 1 3 9 11 27)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"#define isOdd(a) (((a) and 1) <> 0)\\n\\nFunction isPrime(Byval ValorEval As Integer) As Boolean\\n If ValorEval < 2 Then Return False\\n If ValorEval Mod 2 = 0 Then Return ValorEval = 2\\n If ValorEval Mod 3 = 0 Then Return ValorEval = 3\\n Dim d As Integer = 5\\n While d * d <= ValorEval\\n If ValorEval Mod d = 0 Then Return False Else d += 2\\n If ValorEval Mod d = 0 Then Return False Else d += 4\\n Wend\\n Return True\\nEnd Function\\n\\nDim As Integer n\\nDim As Integer p(0 To 40), pl(0 To 40)\\np(0)= 0: p(1) = 1\\npl(0) = 2: pl(1) = 2\\nFor n = 2 To 40\\n p(n) = 2 * p(n-1) + p(n-2)\\n pl(n) = 2 * pl(n-1) + pl(n-2)\\nNext n\\n\\nPrint \\\"First 20 Pell numbers: \\\"\\nFor n = 0 To 19 : Print p(n); : Next n\\nPrint !\\\"\\\\n\\\\nFirst 20 Pell-Lucas: \\\"\\nFor n = 0 To 19 : Print pl(n); : Next n\\n\\nPrint !\\\"\\\\n\\\\nFirst 20 rational approximations of sqrt(2) (\\\" & Str(Sqr(2)) & \\\"): \\\"\\nFor n = 1 To 20\\n Dim As Integer j = pl(n)/2, d = p(n)\\n Print Using \\\" &/& ~= &\\\"; j; d; j/d\\nNext n\\n\\nPrint !\\\"\\\\nFirst 6 Pell primes: [for the limitations of the FB standard library]\\\"\\nDim as Integer pdx = 2\\nDim As Byte c = 0\\nDim As Ulongint ppdx(1 to 20)\\ndo\\n If isPrime(p(pdx)) Then\\n If isPrime(pdx) Then ppdx(c) = pdx : End If\\n Print p(pdx)\\n c += 1\\n End If\\n pdx += 1\\nloop until c = 6\\n\\nPrint !\\\"\\\\nIndices of first 6 Pell primes: [for the limitations of the FB standard library]\\\"\\nFor n = 0 To 5 : Print \\\" \\\"; ppdx(n); : Next n\\n\\nDim As Ulongint nsw(0 To 20)\\nFor n = 0 To 19\\n nsw(n) = p(2*n) + p(2*n+1)\\nNext n\\nPrint !\\\"\\\\n\\\\nFirst 20 Newman-Shank-Williams numbers: \\\"\\nFor n = 0 To 19 : Print \\\" \\\"; nsw(n); : Next n\\n\\nPrint !\\\"\\\\n\\\\nFirst 20 near isosceles right triangles:\\\"\\nDim As Integer i0 = 0, i1 = 1, i2, t = 1, i = 2, found = 0\\nDo While found < 20\\n i2 = i1*2 + i0\\n If isOdd(i) Then\\n Print Using \\\" [&, &, &]\\\"; t; t+1 ; i2\\n found += 1\\n End If\\n t += i2\\n i0 = i1 : i1 = i2\\n i += 1\\nLoop\\nSleep\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/big\\\"\\n \\\"rcu\\\"\\n)\\n\\nfunc main() {\\n p := make([]int64, 40)\\n p[1] = 1\\n for i := 2; i < 40; i++ {\\n p[i] = 2*p[i-1] + p[i-2]\\n }\\n fmt.Println(\\\"The first 20 Pell numbers are:\\\")\\n fmt.Println(p[0:20])\\n\\n q := make([]int64, 40)\\n q[0] = 2\\n q[1] = 2\\n for i := 2; i < 40; i++ {\\n q[i] = 2*q[i-1] + q[i-2]\\n }\\n fmt.Println(\\\"\\\\nThe first 20 Pell-Lucas numbers are:\\\")\\n fmt.Println(q[0:20])\\n\\n fmt.Println(\\\"\\\\nThe first 20 rational approximations of √2 (1.4142135623730951) are:\\\")\\n for i := 1; i <= 20; i++ {\\n r := big.NewRat(q[i]/2, p[i])\\n fmt.Printf(\\\"%-17s ≈ %-18s\\\\n\\\", r, r.FloatString(16))\\n }\\n\\n fmt.Println(\\\"\\\\nThe first 15 Pell primes are:\\\")\\n p0 := big.NewInt(0)\\n p1 := big.NewInt(1)\\n p2 := big.NewInt(0)\\n two := big.NewInt(2)\\n indices := make([]int, 15)\\n for index, count := 2, 0; count < 15; index++ {\\n p2.Mul(p1, two)\\n p2.Add(p2, p0)\\n if rcu.IsPrime(index) && p2.ProbablyPrime(15) {\\n fmt.Println(p2)\\n indices[count] = index\\n count++\\n }\\n p0.Set(p1)\\n p1.Set(p2)\\n }\\n\\n fmt.Println(\\\"\\\\nIndices of the first 15 Pell primes are:\\\")\\n fmt.Println(indices)\\n\\n fmt.Println(\\\"\\\\nFirst 20 Newman-Shank_Williams numbers:\\\")\\n nsw := make([]int64, 20)\\n for n := 0; n < 20; n++ {\\n nsw[n] = p[2*n] + p[2*n+1]\\n }\\n fmt.Println(nsw)\\n\\n fmt.Println(\\\"\\\\nFirst 20 near isosceles right triangles:\\\")\\n u0 := 0\\n u1 := 1\\n sum := 1\\n for i := 2; i < 43; i++ {\\n u2 := u1*2 + u0\\n if i%2 == 1 {\\n fmt.Printf(\\\"(%d, %d, %d)\\\\n\\\", sum, sum+1, u2)\\n }\\n sum += u2\\n u0 = u1\\n u1 = u2\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import Data.Numbers.Primes (isPrime)\\n\\n----------------------- PELL SERIES ----------------------\\n\\npell :: Integer -> Integer -> [Integer]\\npell a b = a : b : zipWith (+) (pell a b) ((2 *) <$> tail (pell a b))\\n\\na000129, a002203, a001333, a086383, a096650, a002315 :: [Integer]\\na000129 = pell 0 1\\n\\na002203 = pell 2 2\\n\\na001333 = (`div` 2) <$> a002203\\n\\na086383 = filter isPrime a000129\\n\\na096650 = zip [0 ..] a000129 >>= (\\\\(i, n) -> [i | isPrime n])\\n\\na002315 = 1 : 7 : zipWith (-) ((6 *) <$> tail a002315) a002315\\n\\n\\n------------------- PYTHAGOREAN TRIPLES ------------------\\n\\npythagoreanTriples :: [(Integer, Integer, Integer)]\\npythagoreanTriples =\\n (tail . concat) $ zipWith3 go [0 ..] a000129 (scanl (+) 0 a000129)\\n where\\n go i p m\\n | odd i = [(m, succ m, p)]\\n | otherwise = []\\n\\n-------------------------- TESTS -------------------------\\nmain :: IO ()\\nmain = do\\n mapM_\\n (\\\\(k, xs) -> putStrLn ('\\\\n' : k) >> print (take 10 xs))\\n [ (\\\"a000129\\\", a000129)\\n , (\\\"a002203\\\", a002203)\\n , (\\\"a001333\\\", a001333)\\n -- Waste of electrical power ?\\n -- (\\\"a086383\\\", a086383)\\n -- (\\\"a096650\\\", a096650\\n , (\\\"a002315\\\", a002315)\\n ]\\n\\n putStrLn \\\"\\\\nRational approximations to sqrt 2:\\\"\\n mapM_ putStrLn $\\n (take 10 . tail) $\\n zipWith\\n (\\\\n d ->\\n show n <>\\n ('/' : show d) <> \\\" -> \\\" <> show (fromIntegral n / fromIntegral d))\\n a001333\\n a000129\\n\\n putStrLn \\\"\\\\nPythagorean triples:\\\"\\n mapM_ print $ take 10 pythagoreanTriples\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"nextPell=: , 1 2+/ .*_2&{. NB. pell, list extender\\nPn=: (%:8) %~(1+%:2)&^ - (1-%:2)&^ NB. pell, closed form\\nQn=: (1+%:2)&^ + (1-%:2)&^ NB. pell lucas, closed form\\nQN=: +: %&Pn ] NB. pell lucas, closed form\\nqn=: 2 * (+&Pn <:) NB. pell lucas, closed form\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" nextPell^:9(0 1)\\n0 1 2 5 12 29 70 169 408 985 2378\\n Pn i.11\\n0 1 2 5 12 29 70 169 408 985 2378\\n nextPell^:9(2 2)\\n2 2 6 14 34 82 198 478 1154 2786 6726\\n Qn i.11\\n2 2 6 14 34 82 198 478 1154 2786 6726\\n QN i.11\\n0 2 6 14 34 82 198 478 1154 2786 6726\\n qn i.11\\n2 2 6 14 34 82 198 478 1154 2786 6726\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"QN=: 2 >. +: %&Pn ]\\n QN i.11\\n2 2 6 14 34 82 198 478 1154 2786 6726\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" }.(%~ _1}. +//.@,:~) nextPell^:9(0 1)\\n1 1.5 1.4 1.41667 1.41379 1.41429 1.4142 1.41422 1.41421 1.41421\\n }.(%~ _1}. +//.@,:~) nextPell^:9(0 1x)\\n1 3r2 7r5 17r12 41r29 99r70 239r169 577r408 1393r985 3363r2378\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 10{.(#~ 1&p:)nextPell^:99(0 1x)\\n2 5 29 5741 33461 44560482149 1746860020068409 68480406462161287469 13558774610046711780701 4125636888562548868221559797461449\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" 10{.I. 1&p:nextPell^:99(0 1x)\\n2 3 5 11 13 29 41 53 59 89\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" _2 +/\\\\ nextPell^:20(0 1x)\\n1 7 41 239 1393 8119 47321 275807 1607521 9369319 54608393\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" }.(21$1 0)#|:(}.,~0 1+/+/\\\\@}:)nextPell^:(20)0 1\\n 3 4 5\\n 20 21 29\\n 119 120 169\\n 696 697 985\\n 4059 4060 5741\\n 23660 23661 33461\\n 137903 137904 195025\\n 803760 803761 1136689\\n 4684659 4684660 6625109\\n27304196 27304197 38613965\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.math.BigDecimal;\\nimport java.math.BigInteger;\\nimport java.math.MathContext;\\nimport java.util.ArrayList;\\nimport java.util.List;\\n\\npublic final class PellNumbers {\\n\\n\\tpublic static void main(String[] aArgs) {\\t\\t\\n\\t\\tSystem.out.println(\\\"7 Tasks\\\");\\n\\t\\tSystem.out.println(\\\"-------\\\");\\n\\t\\tSystem.out.println(\\\"Task 1, Pell Numbers: \\\" + pellNumbers(TERM_COUNT));\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(\\\"Task 2, Pell-Lucas Numbers: \\\" + pellLucasNumbers(TERM_COUNT));\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(\\\"Task 3, Approximations to square root of 2:\\\");\\n\\t\\tList<Rational> rationals = squareRoot2(TERM_COUNT + 1);\\n\\t\\tfor ( int i = 1; i < TERM_COUNT + 1; i++ ) {\\n\\t\\t\\tSystem.out.println(rationals.get(i) + \\\" = \\\" + rationals.get(i).toBigDecimal());\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\tList<Pair> pairs = pellPrimes(TERM_COUNT);\\n\\t\\tSystem.out.println(\\\"Task 4, Pell primes:\\\");\\n\\t\\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\\n\\t\\t\\tSystem.out.println(pairs.get(i).pellPrime);\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.print(\\\"Task 5, Pell indices of Pell primes:\\\");\\n\\t\\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\\n\\t\\t\\tSystem.out.print(pairs.get(i).index + \\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(\\\"Task 6, Newman-Shank-Williams numbers: \\\" + newmanShankWilliams(TERM_COUNT));\\n\\t\\tSystem.out.println();\\t\\t\\n\\t\\tSystem.out.println(\\\"Task , Near isoseles right triangles:\\\");\\n\\t\\tList<Triple> nearIsoselesRightTriangles = nearIsoslesRightTriangles(TERM_COUNT);\\n\\t\\tfor ( int i = 0; i < TERM_COUNT; i++ ) {\\n\\t\\t\\tSystem.out.println(nearIsoselesRightTriangles.get(i));\\n\\t\\t}\\t\\t\\n\\t}\\n\\t\\n\\tprivate static List<BigInteger> pellNumbers(int aTermCount) {\\n\\t\\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\\n\\t\\tList<BigInteger> result = new ArrayList<BigInteger>();\\n\\t\\tfor ( int i = 0; i < aTermCount; i++ ) {\\t\\t\\t\\n\\t\\t\\tresult.add(pellIterator.next());\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\t\\n\\tprivate static List<BigInteger> pellLucasNumbers(int aTermCount) {\\n\\t\\tPellIterator pellLucasIterator = new PellIterator(BigInteger.TWO, BigInteger.TWO);\\n\\t\\tList<BigInteger> result = new ArrayList<BigInteger>();\\n\\t\\tfor ( int i = 0; i < aTermCount; i++ ) {\\n\\t\\t\\tresult.add(pellLucasIterator.next());\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\t\\n\\tprivate static List<Rational> squareRoot2(int aTermCount) {\\n\\t\\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\\n\\t\\tPellIterator pellLucasIterator = new PellIterator(BigInteger.TWO, BigInteger.TWO);\\n\\t\\tList<Rational> result = new ArrayList<Rational>();\\n\\t\\tfor ( int i = 0; i < aTermCount; i++ ) {\\n\\t\\t\\tresult.add( new Rational(pellLucasIterator.next().divide(BigInteger.TWO), pellIterator.next()) );\\n\\t\\t}\\n\\t\\treturn result;\\t\\t\\n\\t}\\n\\t\\n\\tprivate static List<Pair> pellPrimes(int aTermCount) {\\n\\t\\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\\n\\t\\tint index = 0;\\n\\t\\tint count = 0;\\n\\t\\tList<Pair> result = new ArrayList<Pair>();\\n\\t\\twhile ( count < aTermCount ) {\\n\\t\\t\\tBigInteger pellNumber = pellIterator.next();\\n\\t\\t\\tif ( pellNumber.isProbablePrime(16) ) {\\n\\t\\t\\t\\tresult.add( new Pair(pellNumber, index) );\\n\\t\\t\\t\\tcount += 1;\\n\\t\\t\\t}\\n\\t\\t\\tindex += 1;\\t\\t\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\t\\n\\tprivate static List<BigInteger> newmanShankWilliams(int aTermCount) {\\n\\t\\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\\n\\t\\tList<BigInteger> result = new ArrayList<BigInteger>();\\n\\t\\tfor ( int i = 0; i < aTermCount; i++ ) {\\n\\t\\t\\tBigInteger pellNumber = pellIterator.next();\\n\\t\\t\\tresult.add(pellNumber.add(pellIterator.next()));\\n\\t\\t}\\t\\t\\n\\t\\treturn result;\\n\\t}\\n\\t\\n\\tprivate static List<Triple> nearIsoslesRightTriangles(int aTermCount) {\\n\\t\\tPellIterator pellIterator = new PellIterator(BigInteger.ZERO, BigInteger.ONE);\\n\\t\\tpellIterator.next();\\n\\t\\tList<Triple> result = new ArrayList<Triple>();\\n\\t\\tBigInteger sum = pellIterator.next();\\n\\t\\tfor ( int i = 0; i < aTermCount; i++ ) {\\n\\t\\t\\tsum = sum.add(pellIterator.next());\\n\\t\\t\\tBigInteger nextTerm = pellIterator.next();\\n\\t\\t\\tresult.add( new Triple(sum, sum.add(BigInteger.ONE), nextTerm) );\\n\\t\\t\\tsum = sum.add(nextTerm);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\t\\t\\n\\tprivate static class PellIterator {\\n\\t\\t\\t\\n\\t\\tpublic PellIterator(BigInteger aFirst, BigInteger aSecond) {\\n\\t\\t\\ta = aFirst; b = aSecond;\\n\\t\\t}\\n\\t\\t\\n\\t\\tpublic BigInteger next() {\\n\\t\\t\\taCopy = a;\\n\\t\\t\\tbCopy = b;\\n\\t\\t\\tb = b.add(b).add(a);\\n\\t\\t\\ta = bCopy;\\n\\t\\t\\treturn aCopy;\\n\\t\\t}\\n\\t\\t\\n\\t\\tprivate BigInteger a, aCopy, b, bCopy;\\n\\t\\t\\n\\t}\\n\\t\\n\\tprivate static record Rational(BigInteger numerator, BigInteger denominator) {\\n\\t\\t\\n\\t\\tpublic BigDecimal toBigDecimal() {\\n\\t\\t\\treturn new BigDecimal(numerator).divide( new BigDecimal(denominator), mathContext );\\n\\t\\t}\\n\\t\\t\\n\\t\\tpublic String toString() {\\n\\t\\t\\treturn numerator + \\\" / \\\" + denominator;\\n\\t\\t}\\n\\t\\t\\n\\t\\tprivate static MathContext mathContext = new MathContext(34);\\n\\t\\t\\n\\t}\\n\\t\\n\\tprivate static record Pair(BigInteger pellPrime, int index) {}\\n\\t\\n\\tprivate static record Triple(BigInteger shortSide, BigInteger longSide, BigInteger hypotenuse) {\\n\\t\\t\\n\\t\\tpublic String toString() {\\n\\t\\t\\treturn \\\"(\\\" + shortSide + \\\", \\\" + longSide + \\\", \\\" + hypotenuse + \\\")\\\" ;\\n\\t\\t}\\n\\t\\t\\n\\t}\\n\\t\\n\\tprivate static final int TERM_COUNT = 10;\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Primes\\n\\nfunction pellnumbers(wanted)\\n pells = [0, 1]\\n wanted < 3 && return pells[1:wanted]\\n while length(pells) < wanted\\n push!(pells, 2 * pells[end] + pells[end - 1])\\n end\\n return pells\\nend\\n\\nfunction pelllucasnumbers(wanted)\\n pelllucas = [2, 2]\\n wanted < 3 && return pelllucas[1:wanted]\\n while length(pelllucas) < wanted\\n push!(pelllucas, 2 * pelllucas[end] + pelllucas[end - 1])\\n end\\n return pelllucas\\nend\\n\\nfunction pellprimes(wanted)\\n i, lastpell, lastlastpell, primeindices, pellprimes = 1, big\\\"1\\\", big\\\"0\\\", Int[], BigInt[]\\n while length(primeindices) < wanted\\n pell = 2 * lastpell + lastlastpell\\n i += 1\\n if isprime(pell)\\n push!(primeindices, i)\\n push!(pellprimes, pell)\\n end\\n lastpell, lastlastpell = pell, lastpell\\n end\\n return primeindices, pellprimes\\nend\\n\\nfunction approximationsqrt2(wanted)\\n p, q = pellnumbers(wanted + 1), pelllucasnumbers(wanted + 1)\\n return map(r -> \\\"$r ≈ $(Float64(r))\\\", [(q[n] // 2) // p[n] for n in 2:wanted+1])\\nend\\n\\nfunction newmanshankwilliams(wanted)\\n pells = pellnumbers(wanted * 2 + 1)\\n return [pells[2i - 1] + pells[2i] for i in 1:wanted]\\nend\\n\\nfunction nearisosceles(wanted)\\n pells = pellnumbers((wanted + 1) * 2 + 1)\\n return map(x -> (last(x), last(x) + 1, first(x)),\\n [(pells[2i], sum(pells[1:2i-1])) for i in 2:wanted+1])\\nend\\n\\nfunction printrows(title, vec, columnsize = 8, columns = 10, rjust=false)\\n println(title)\\n for (i, n) in enumerate(vec)\\n print((rjust ? lpad : rpad)(n, columnsize), i % columns == 0 ? \\\"\\\\n\\\" : \\\"\\\")\\n end\\n println()\\nend\\n\\nprintrows(\\\"Twenty Pell numbers:\\\", pellnumbers(20))\\nprintrows(\\\"Twenty Pell-Lucas numbers:\\\", pelllucasnumbers(20))\\nprintrows(\\\"Twenty approximations of √2:\\\", approximationsqrt2(20), 44, 2)\\npindices, pprimes = pellprimes(15)\\nprintrows(\\\"Fifteen Pell primes:\\\", pprimes, 90, 1)\\nprintrows(\\\"Fifteen Pell prime zero-based indices:\\\", pindices, 4, 15)\\nprintrows(\\\"Twenty Newman-Shank-Williams numbers:\\\", newmanshankwilliams(20), 17, 5)\\nprintrows(\\\"Twenty near isosceles triangle triplets:\\\", nearisosceles(20), 52, 2)\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"ClearAll[PellNumber, PellLucasNumber]\\nPellNumber[0] = 0;\\nPellNumber[1] = 1;\\nPellNumber[n_] := PellNumber[n] = 2 PellNumber[n - 1] + PellNumber[n - 2]\\n\\nPellLucasNumber[0] = 2;\\nPellLucasNumber[1] = 2;\\nPellLucasNumber[n_] := PellLucasNumber[n] = 2 PellLucasNumber[n - 1] + PellLucasNumber[n - 2]\\n\\npns = PellNumber /@ Range[0, 9]\\n\\nplns = PellLucasNumber /@ Range[0, 9]\\n\\nden = Rest@pns;\\nnum = Rest@plns/2;\\napprox = num/den\\nN[approx]\\n\\npns = {#, PellNumber[#]} & /@ Range[0, 100];\\nSelect[pns, Last/*PrimeQ, 10] // Grid\\n\\nClearAll[PellS]\\nPellS[n_] := If[n == 0, 1, PellNumber[2 n] + PellNumber[2 n + 1]]\\nPellS /@ Range[0, 19]\\n\\nClearAll[PythagoreanTriple]\\nPythagoreanTriple[n_Integer] := Module[{hypo, short, long},\\n hypo = PellNumber[2 n + 1];\\n short = Total[PellNumber /@ Range[2 n]];\\n long = short + 1;\\n {short, long, hypo}\\n ]\\nPythagoreanTriple /@ Range[10]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import std/[strformat, strutils, sugar]\\nimport integers\\n\\ntemplate isOdd(n: int): bool = (n and 1) != 0\\n\\niterator pellSequence[T](first, second: T; lim = -1): (int, T) =\\n ## Yield the sucessive values of a Pell or Pell-Lucas sequence\\n ## preceded by their rank.\\n ## If \\\"lim\\\" is specified and greater than 2, only the \\\"lim\\\" first\\n ## values are computed.\\n ## The iterator works with \\\"int\\\" values or \\\"Integer\\\" values.\\n var prev = first\\n var curr = second\\n yield (0, prev)\\n yield (1, curr)\\n var count = 2\\n while true:\\n swap prev, curr\\n curr += 2 * prev\\n yield (count, curr)\\n inc count\\n if count == lim: break\\n\\necho \\\"First 10 Pell numbers:\\\"\\nlet p = collect:\\n for (idx, val) in pellSequence(0, 1, 11): val\\necho p[0..9].join(\\\" \\\")\\n\\necho \\\"\\\\nFirst 10 Pell-Lucas numbers:\\\"\\nlet q = collect:\\n for (idx, val) in pellSequence(2, 2, 11): val\\necho q[0..9].join(\\\" \\\")\\n\\necho \\\"\\\\nFirst 10 rational approximations of √2:\\\"\\nfor i in 1..10:\\n let n = q[i] div 2\\n let d = p[i]\\n let r = &\\\"{n}/{d}\\\"\\n echo &\\\"{r:>9} = {n/d:.17}\\\"\\n\\necho \\\"\\\\nFirst 10 Pell primes:\\\"\\n# To avoid an overflow, we need to use Integer values here.\\nvar indices: seq[int]\\nvar count = 0\\nfor (idx, p) in pellSequence(newInteger(0), newInteger(1)):\\n if p.isPrime:\\n echo p\\n indices.add idx\\n inc count\\n if count == 10: break\\n\\necho \\\"\\\\nFirst 10 Pell primes indices:\\\"\\necho indices.join(\\\" \\\")\\n\\necho \\\"\\\\nFirst 10 Newman-Shank-Williams numbers:\\\"\\ncount = 0\\nvar prev: int\\nfor (idx, p) in pellSequence(0, 1):\\n if idx.isOdd:\\n inc count\\n stdout.write prev + p\\n if count == 10: break\\n stdout.write ' '\\n else:\\n prev = p\\necho()\\n\\necho \\\"\\\\nFirst 10 near isosceles right triangles:\\\"\\ncount = 0\\nvar sum = 0\\nfor (idx, p) in pellSequence(0, 1):\\n if idx.isOdd and sum != 0:\\n echo (sum, sum + 1, p)\\n inc count\\n if count == 10: break\\n inc sum, p\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature <state say>;\\nuse bignum;\\nuse ntheory 'is_prime';\\nuse List::Util <sum head>;\\nuse List::Lazy 'lazy_list';\\n\\nmy $upto = 20;\\n\\nmy $pell_recur = lazy_list { state @p = (0, 1); push @p, 2*$p[1] + $p[0]; shift @p };\\nmy $pell_lucas_recur = lazy_list { state @p = (2, 2); push @p, 2*$p[1] + $p[0]; shift @p };\\n\\nmy @pell;\\npush @pell, $pell_recur->next() for 1..1500; #wart;\\n\\nmy @pell_lucas;\\npush @pell_lucas, $pell_lucas_recur->next() for 1..$upto+1;\\n\\nsay \\\"First $upto Pell numbers:\\\";\\nsay join ' ', @pell[0..$upto-1];\\n\\nsay \\\"\\\\nFirst $upto Pell-Lucas numbers:\\\";\\nsay join ' ', @pell_lucas[0..$upto-1];\\n\\nsay \\\"\\\\nFirst $upto rational approximations of √2:\\\";\\nsay sprintf \\\"%d/%d - %1.16f\\\", $pell[$_-1] + $pell[$_], $pell[$_], ($pell[$_-1]+$pell[$_])/$pell[$_] for 1..$upto;\\n\\nsay \\\"\\\\nFirst $upto Pell primes:\\\";\\nsay join \\\"\\\\n\\\", head $upto, grep { is_prime $_ } @pell;\\n\\nsay \\\"\\\\nIndices of first $upto Pell primes:\\\";\\nsay join ' ', head $upto, grep { is_prime($pell[$_]) and $_ } 0..$#pell;\\n\\nsay \\\"\\\\nFirst $upto Newman-Shank-Williams numbers:\\\";\\nsay join ' ', map { $pell[2 * $_] + $pell[2 * $_+1] } 0..$upto-1;\\n\\nsay \\\"\\\\nFirst $upto near isoceles right tringles:\\\";\\nmap {\\n my $y = 2*$_ + 1;\\n my $x = sum @pell[0..$y-1];\\n printf \\\"(%d, %d, %d)\\\\n\\\", $x, $x+1, $pell[$y]\\n} 1..$upto;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">pl</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">41</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #000000;\\\">pl</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"First 20 Pell numbers: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"First 20 Pell-Lucas: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join_by</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">],</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">20</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fmt</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"First 20 rational approximations of sqrt(2) (%.16f):\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">sqrt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">21</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">n</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pl</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">d</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%d/%d ~= %.16g\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">d</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nFirst 20 Pell primes:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #004080;\\\">mpfr</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n <span style=\\\"color: #004080;\\\">mpz</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">p0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mpz_inits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">ppdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">2</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ppdx</span><span style=\\\"color: #0000FF;\\\">)<</span><span style=\\\"color: #000000;\\\">20</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_mul_si</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_add</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">is_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #7060A8;\\\">mpz_prime</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">mpz_get_short_str</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">ppdx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ppdx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pdx</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">pdx</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">mpz_set</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nIndices of first 20 Pell primes: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">ppdx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">nsw</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">20</span> <span style=\\\"color: #008080;\\\">do</span> <span style=\\\"color: #000000;\\\">nsw</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nsw</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%d\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">]+</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">n</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]))</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">nsw</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">..-</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #008000;\\\">\\\"...\\\"</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nFirst 20 Newman-Shank-Williams numbers: %s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">nsw</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\nFirst 20 near isosceles right triangles:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">42</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">side</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sum</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]),</span> <span style=\\\"color: #000000;\\\">hypot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"[%d, %d, %d]\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">side</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">side</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">hypot</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"# pell_numbers.py by Xing216\\ndef is_prime(n):\\n if n == 1:\\n return False\\n i = 2\\n while i*i <= n:\\n if n % i == 0:\\n return False\\n i += 1\\n return True\\ndef pell(p0: int,p1: int,its: int):\\n nums = [p0,p1]\\n primes = {}\\n idx = 2\\n while len(nums) != its:\\n p = 2*nums[-1]+nums[-2]\\n if is_prime(p):\\n primes[idx] = p\\n nums.append(p)\\n idx += 1\\n return nums, primes\\ndef nsw(its: int,pell_nos: list):\\n nums = []\\n for i in range(its):\\n nums.append(pell_nos[2*i] + pell_nos[2*i+1])\\n return nums\\ndef pt(its: int, pell_nos: list):\\n nums = []\\n for i in range(1,its+1):\\n hypot = pell_nos[2*i+1]\\n shorter_leg = sum(pell_nos[:2*i+1])\\n longer_leg = shorter_leg + 1\\n nums.append((shorter_leg,longer_leg,hypot))\\n return nums\\npell_nos, pell_primes = pell(0,1,50)\\npell_lucas_nos, pl_primes = pell(2,2,10)\\nnsw_nos = nsw(10, pell_nos)\\npythag_triples = pt(10, pell_nos)\\nsqrt2_approx = {}\\nfor idx, pell_no in enumerate(pell_nos):\\n numer = pell_nos[idx-1] + pell_no\\n if pell_no != 0:\\n sqrt2_approx[f\\\"{numer}/{pell_no}\\\"] = numer/pell_no\\nprint(f\\\"The first 10 Pell Numbers:\\\\n {' '.join([str(_) for _ in pell_nos[:10]])}\\\")\\nprint(f\\\"The first 10 Pell-Lucas Numbers:\\\\n {' '.join([str(_) for _ in pell_lucas_nos])}\\\")\\nprint(f\\\"The first 10 rational and decimal approximations of sqrt(2) ({(2**0.5):.10f}):\\\")\\nprint(\\\" rational | decimal\\\")\\nfor rational in list(sqrt2_approx.keys())[:10]:\\n print(f\\\"{rational:>10} ≈ {sqrt2_approx[rational]:.10f}\\\")\\nprint(\\\"The first 7 Pell Primes:\\\")\\nprint(\\\" index | Pell Prime\\\")\\nfor idx, prime in pell_primes.items():\\n print(f\\\"{idx:>6} | {prime}\\\")\\nprint(f\\\"The first 10 Newman-Shank-Williams numbers:\\\\n {' '.join([str(_) for _ in nsw_nos])}\\\")\\nprint(f\\\"The first 10 near isosceles right triangles:\\\")\\nfor i in pythag_triples:\\n print(f\\\" {i}\\\")\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ $ \\\"bigrat.qky\\\" loadfile ] now!\\n\\n [ ' [ 0 ] swap\\n witheach\\n [ over -1 peek\\n + join ]\\n behead drop ] is cumsum ( [ --> [ )\\n\\n [ dup -1 peek 2 *\\n over -2 peek + join ] is nextterm ( [ --> [ )\\n\\n [ over 2 - times\\n nextterm\\n swap split drop ] is sequence ( n [ --> [ )\\n\\n [ ' [ 0 1 ] sequence ] is pells ( n --> [ )\\n\\n [ ' [ 2 2 ] sequence ] is companions ( n --> [ )\\n\\n [ [] swap 1+\\n dup companions\\n behead drop\\n swap pells\\n behead drop\\n witheach\\n [ dip\\n [ behead 2 / ]\\n join nested\\n rot swap join\\n swap ]\\n drop ] is rootytwos ( n --> [ )\\n\\n [ stack ] is index ( --> s )\\n\\n [ temp put\\n 1 index put\\n [] ' [ 0 1 ]\\n [ 1 index tally\\n over size\\n temp share < while\\n nextterm\\n behead drop\\n index share\\n isprime until\\n dup -1 peek\\n dup isprime iff\\n [ swap dip\\n [ index share\\n swap join\\n nested join ] ]\\n else drop\\n again ]\\n drop\\n index release\\n temp release ] is pellprimes ( n --> [ )\\n\\n [ [] over 2 * pells\\n rot times\\n [ behead dip behead +\\n join ]\\n nip ] is nsws ( n --> [ )\\n\\n [ [] swap 1+ dup\\n 2 * 1+ pells\\n dup cumsum\\n swap rot times\\n [ over i^ 2 * peek\\n dup 1+ join\\n over i^ 2 * 1+ peek\\n join\\n dip rot nested join\\n unrot ]\\n 2drop behead drop ] is nirts ( n --> [ )\\n\\n say \\\"Pell numbers \\\" 10 pells echo\\n cr cr\\n say \\\"Pell-Lucas's \\\" 10 companions echo\\n cr cr\\n say \\\"Approximations of sqrt(2)\\\"\\n cr\\n 10 rootytwos\\n witheach\\n [ do 2dup\\n vulgar$ echo$ sp\\n 10 point$ echo$ cr ]\\n cr\\n say \\\"Pell Primes \\\"\\n 7 pellprimes dup\\n [] swap\\n witheach [ 1 peek join ] echo\\n cr\\n say \\\"their indices \\\"\\n [] swap\\n witheach [ 0 peek join ] echo\\n cr cr\\n say \\\"NSW numbers \\\" 10 nsws echo\\n cr cr\\n say \\\"Near isosceles right triangles\\\"\\n cr\\n 10 nirts witheach [ echo cr ]\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"my $pell = cache lazy 0, 1, * + * × 2 … *;\\nmy $pell-lucas = lazy 2, 2, * + * × 2 … *;\\n\\nmy $upto = 20;\\n\\nsay \\\"First $upto Pell numbers:\\\\n\\\" ~ $pell[^$upto];\\n\\nsay \\\"\\\\nFirst $upto Pell-Lucas numbers:\\\\n\\\" ~ $pell-lucas[^$upto];\\n\\nsay \\\"\\\\nFirst $upto rational approximations of √2 ({sqrt(2)}):\\\\n\\\" ~\\n(1..$upto).map({ sprintf \\\"%d/%d - %1.16f\\\", $pell[$_-1] + $pell[$_], $pell[$_], ($pell[$_-1]+$pell[$_])/$pell[$_] }).join: \\\"\\\\n\\\";\\n\\nsay \\\"\\\\nFirst $upto Pell primes:\\\\n\\\" ~ $pell.grep(&is-prime)[^$upto].join: \\\"\\\\n\\\";\\n\\nsay \\\"\\\\nIndices of first $upto Pell primes:\\\\n\\\" ~ (^∞).grep({$pell[$_].is-prime})[^$upto];\\n\\nsay \\\"\\\\nFirst $upto Newman-Shank-Williams numbers:\\\\n\\\" ~ (^$upto).map({ $pell[2 × $_, 2 × $_+1].sum });\\n\\nsay \\\"\\\\nFirst $upto near isosceles right triangles:\\\";\\nmap -> \\\\p { printf \\\"(%d, %d, %d)\\\\n\\\", |($_, $_+1 given $pell[^(2 × p + 1)].sum), $pell[2 × p + 1] }, 1..$upto;\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"require 'openssl'\\ndef prime?(n) = OpenSSL::BN.new(n).prime?\\n\\npell = Enumerator.new do |y|\\n pe = [0,1]\\n loop{y << pe[0]; pe << pe[1]*2 + pe.shift}\\nend\\n\\npell_lucas = Enumerator.new do |y|\\n pe = [2,2]\\n loop{y << pe[0]; pe << pe[1]*2 + pe.shift}\\nend\\n\\nn = 20\\nputs \\\"First #{n} Pell numbers: #{pell.first(n).to_a.inspect}\\\"\\nputs \\\"\\\\nFirst #{n} Pell-Lucas numbers: #{pell_lucas.first(n).to_a.inspect}\\\"\\n\\nn = 15\\nsqrt2 = pell.each_cons(2).lazy.map{|p1,p2| Rational(p1+p2, p2)}.take(n).to_a\\nputs \\\"\\\\nThe first #{n} rational approximations of √2 (#{Math.sqrt(2)}) are:\\\"\\nsqrt2.each{|n| puts \\\"%-16s ≈ %-18s\\\\n\\\"% [n, n.to_f]}\\n\\nputs \\\"\\\\nThe first #{n} Pell primes with index are:\\\"\\nprimes = pell.with_index.lazy.select{|n, i|prime?(i) && prime?(n)}.first(n)\\nprimes.each {|prime, i| puts \\\"#{i.to_s.ljust(3)} #{prime}\\\"}\\n\\nputs \\\"\\\\nThe first #{n} NSW numbers:\\\"\\nputs pell.first(2*n).each_slice(2).map(&:sum).join(\\\", \\\")\\n\\nputs \\\"\\\\nFirst #{n} near isosceles right triangles:\\\"\\nsum = 1\\npell.take(n*2+2).each_slice(2) do |p1,p2|\\n next if p1 == 0\\n sum += p1\\n puts \\\"#{sum}, #{sum+1}, #{p2}\\\"\\n sum += p2\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"val pellNumbers: LazyList[BigInt] =\\n BigInt(\\\"0\\\") #:: BigInt(\\\"1\\\") #::\\n (pellNumbers zip pellNumbers.tail).\\n map{ case (a,b) => 2*b + a }\\n\\nval pellLucasNumbers: LazyList[BigInt] =\\n BigInt(\\\"2\\\") #:: BigInt(\\\"2\\\") #::\\n (pellLucasNumbers zip pellLucasNumbers.tail).\\n map{ case (a,b) => 2*b + a }\\n\\nval pellPrimes: LazyList[BigInt] =\\n pellNumbers.tail.tail.\\n filter{ case p => p.isProbablePrime(16) }\\n\\nval pellIndexOfPrimes: LazyList[BigInt] =\\n pellNumbers.tail.tail.\\n filter{ case p => p.isProbablePrime(16) }.\\n map{ case p => pellNumbers.indexOf(p) }\\n\\nval pellNSWnumbers: LazyList[BigInt] =\\n (pellNumbers.zipWithIndex.collect{ case (p,i) if i%2 == 0 => p}\\n zip\\n pellNumbers.zipWithIndex.collect{ case (p,i) if i%2 != 0 => p}).\\n map{ case (a,b) => a + b }\\n\\nval pellSqrt2Numerator: LazyList[BigInt] =\\n BigInt(1) #:: BigInt(3) #::\\n (pellSqrt2Numerator zip pellSqrt2Numerator.tail).\\n map{ case (a,b) => 2*b + a }\\n\\nval pellSqrt2: LazyList[BigDecimal] =\\n (pellSqrt2Numerator zip pellNumbers.tail).\\n map{ case (n,d) => BigDecimal(n)/BigDecimal(d) }\\n\\nval pellSqrt2asString: LazyList[String] =\\n (pellSqrt2Numerator zip pellNumbers.tail).\\n map{ case (n,d) => s\\\"$n/$d\\\" }\\n\\nval pellHypotenuse: LazyList[BigInt] =\\n pellNumbers.tail.tail.zipWithIndex.collect{ case (p,i) if i%2 != 0 => p }\\n\\nval pellShortLeg: LazyList[BigInt] =\\n LazyList.from(3,2).map{ case s => pellNumbers.take(s).sum }\\n\\nval pellTriple: LazyList[(BigInt,BigInt,BigInt)] =\\n (pellHypotenuse zip pellShortLeg).\\n map{ case (h,s) => (s,s+1,h)}\\n\\n// Output\\n{ println(\\\"7 Tasks\\\")\\n println(\\\"-------\\\")\\n println(pellNumbers.take(10).mkString(\\\"1. Pell Numbers: \\\", \\\",\\\", \\\"\\\\n\\\"))\\n println(pellLucasNumbers.take(10).mkString(\\\"2. Pell-Lucas Numbers: \\\", \\\",\\\", \\\"\\\\n\\\"))\\n println((pellSqrt2asString zip pellSqrt2).take(10).\\n map { case (f, d) => s\\\"$f = $d\\\" }.\\n mkString(\\\"3. Square-root of 2 Approximations: \\\\n\\\\n\\\",\\n \\\"\\\\n\\\", \\\"\\\\n\\\"))\\n println(pellPrimes.take(10).mkString(\\\"4. Pell Primes: \\\\n\\\\n\\\", \\\"\\\\n\\\", \\\"\\\\n\\\"))\\n println(pellIndexOfPrimes.take(10).mkString(\\\"5. Pell Index of Primes: \\\", \\\",\\\", \\\"\\\\n\\\"))\\n println(pellNSWnumbers.take(10).mkString(\\\"6. Newman-Shank-Williams Numbers: \\\\n\\\\n\\\", \\\"\\\\n\\\", \\\"\\\\n\\\"))\\n println(pellTriple.take(10).mkString(\\\"7. Near Right-triangle Triples: \\\\n\\\\n\\\", \\\"\\\\n\\\", \\\"\\\\n\\\"))\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"import \\\"./big\\\" for BigInt, BigRat\\nimport \\\"./math\\\" for Int\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar p = List.filled(40, 0)\\np[0] = 0\\np[1] = 1\\nfor (i in 2..39) p[i] = 2 * p[i-1] + p[i-2]\\nSystem.print(\\\"The first 20 Pell numbers are:\\\")\\nSystem.print(p[0..19].join(\\\" \\\"))\\n\\nvar q = List.filled(40, 0)\\nq[0] = 2\\nq[1] = 2\\nfor (i in 2..39) q[i] = 2 * q[i-1] + q[i-2]\\nSystem.print(\\\"\\\\nThe first 20 Pell-Lucas numbers are:\\\")\\nSystem.print(q[0..19].join(\\\" \\\"))\\n\\nSystem.print(\\\"\\\\nThe first 20 rational approximations of √2 (1.4142135623730951) are:\\\")\\nfor (i in 1..20) {\\n var r = BigRat.new(q[i]/2, p[i])\\n Fmt.print(\\\"$-17s ≈ $-18s\\\", r, r.toDecimal(16, true, true))\\n}\\n\\nSystem.print(\\\"\\\\nThe first 15 Pell primes are:\\\")\\nvar p0 = BigInt.zero\\nvar p1 = BigInt.one\\nvar indices = List.filled(15, 0)\\nvar count = 0\\nvar index = 2\\nvar p2\\nwhile (count < 15) {\\n p2 = p1 * BigInt.two + p0\\n if (Int.isPrime(index) && p2.isProbablePrime(10)) {\\n System.print(p2)\\n indices[count] = index\\n count = count + 1\\n }\\n index = index + 1\\n p0 = p1\\n p1 = p2\\n}\\n\\nSystem.print(\\\"\\\\nIndices of the first 15 Pell primes are:\\\")\\nSystem.print(indices.join(\\\" \\\"))\\n\\nSystem.print(\\\"\\\\nFirst 20 Newman-Shank_Williams numbers:\\\")\\nvar nsw = List.filled(20, 0)\\nfor (n in 0..19) nsw[n] = p[2*n] + p[2*n+1]\\nFmt.print(\\\"$d\\\", nsw)\\n\\nSystem.print(\\\"\\\\nFirst 20 near isosceles right triangles:\\\")\\np0 = 0\\np1 = 1\\nvar sum = 1\\nvar i = 2\\nwhile (i < 43) {\\n p2 = p1 * 2 + p0\\n if (i % 2 == 1) {\\n Fmt.print(\\\"($d, $d, $d)\\\", sum, sum + 1, p2)\\n }\\n sum = sum + p2\\n p0 = p1\\n p1 = p2\\n i = i + 1\\n}\\n\",\n \"language\": \"Wren\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pell-numbers"}}},{"rowIdx":1496,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Penney's_game\nnote: Games\n","language":"00-META"},{"code":"[[wp:Penney's_game|Penney's game]] is a game where two players bet on being the first to see a particular sequence of [[wp:Coin_flipping|heads or tails]] in consecutive tosses of a [[wp:Fair_coin|fair coin]].\n\nIt is common to agree on a sequence length of three then one player will openly choose a sequence, for example:\n Heads, Tails, Heads, or '''HTH''' for short.\nThe other player on seeing the first players choice will choose his sequence. The coin is tossed and the first player to see his sequence in the sequence of coin tosses wins.\n\n\n;Example:\nOne player might choose the sequence '''HHT''' and the other '''THT'''. \n\nSuccessive coin tosses of '''HTTHT''' gives the win to the second player as the last three coin tosses are his sequence.\n\n\n;Task\nCreate a program that tosses the coin, keeps score and plays Penney's game against a human opponent.\n* Who chooses and shows their sequence of three should be chosen randomly.\n* If going first, the computer should randomly choose its sequence of three.\n* If going second, the computer should automatically play [[wp:Penney's_game#Analysis_of_the_three-bit_game|the optimum sequence]].\n* Successive coin tosses should be shown.\n\n<br>\nShow output of a game where the computer chooses first and a game where the user goes first here on this page.\n\n\n;See also\n* [https://www.youtube.com/watch?v=OcYnlSenF04 The Penney Ante Part 1] (Video).\n* [https://www.youtube.com/watch?v=U9wak7g5yQA The Penney Ante Part 2] (Video).\n<br><br>\n\n","language":"00-TASK"},{"code":"V first = random:choice([1B, 0B])\n\nV you = ‘’\nV me = ‘’\nV ht = ‘HT’ // to get round ‘bug in MSVC 2017’[https://developercommunity.visualstudio.com/t/bug-with-operator-in-c/565417]\nI first\n me = random:sample(Array(‘HT’ * 3), 3).join(‘’)\n print(‘I choose first and will win on first seeing #. in the list of tosses’.format(me))\n L you.len != 3 | any(you.map(ch -> ch !C :ht)) | you == me\n you = input(‘What sequence of three Heads/Tails will you win with: ’)\nE\n L you.len != 3 | any(you.map(ch -> ch !C :ht))\n you = input(‘After you: What sequence of three Heads/Tails will you win with: ’)\n me = (I you[1] == ‘T’ {‘H’} E ‘T’)‘’you[0.<2]\n print(‘I win on first seeing #. in the list of tosses’.format(me))\n\nprint(\"Rolling:\\n \", end' ‘’)\nV rolled = ‘’\nL\n rolled ‘’= random:choice(‘HT’)\n print(rolled.last, end' ‘’)\n I rolled.ends_with(you)\n print(\"\\n You win!\")\n L.break\n I rolled.ends_with(me)\n print(\"\\n I win!\")\n L.break\n sleep(1)\n","language":"11l"},{"code":"#include <jambo.h>\n\n#define Getanuppercasecharinto(_X_) Getchar(_X_),Let( _X_ := Ucase(_X_) )\n#define Isnotvalidin(_X_) Not( Occurs in (_X_) )\n#define NOELIGEPCDESPUESDETI 0\n#define ELIGEPCDESPUESDETI 1\n\nMain\n Set break\n Get total args\n If ( Is equal to '2' )\n largo=0\n Let ( largo := Get if( Argnum(2) Is less than '3', 3, Argnum(2) ) )\n OTRO=\"S\"\n\n Cursor off\n Loop\n P=\"\", C=\"\", S=\"\", L=0\n Cls\n Locate(1,1), Printnl (\"***** Penney's Game *****\")\n\n If ( Geq( Rand(1), 0.5) )\n Gosub ' Yo tiro ', Set 'NO ELIGE PC DESPUES DE TI',Gosub ' Tú tiras '\n Else\n Set 'ELIGE PC DESPUES DE TI', Gosub ' Tú tiras '\n End If\n\n // a jugar:\n G=\"\", SW=1\n Loop\n Let( G := Cat( G, Get if( Geq( Rand(1), 0.5), \"T\", \"H\" ) ) )\n Locate( 6, 1 ), Printnl( \"Tiradas: \", G )\n\n Continue if ( Less ( Len (G) ---Backup to 'L'---, 3) )\n\n Let ( S := Right( Sub(L, Minus one 'largo') , G) )\n\n If ( Eq( S, P ) )\n Set (\"TU GANAS!!\"), SW=0\n Else If (Eq( S, C ) )\n Set (\"YO GANO!!\"), SW=0\n End If\n Prnl\n Sleep(1)\n Back if( SW ) is not zero\n Printnl ( Utf8(\"¿Otro juego? S/* \") )\n Getchar(OTRO)\n While( Eq (OTRO, \"S\") )\n\n Cursor on\n Else\n Printnl(\"Modo de uso: hopper penny.jambo <n>\\ndonde \\\"n\\\" es el largo de la secuencia\")\n End If\nEnd\n\nSubrutines\n\nDefine ' Yo tiro '\n Locate(4,1), Print( \"Yo elijo... \" )\n i=largo\n Loop\n Let( C := Cat( C, Get if( Geq( Rand(1), 0.5), \"T\", \"H\" ) ) )\n --i\n Back if (i) is positive\n Printnl (C)\n\nReturn\n\nDefine ' Tú tiras, elige pc '\n Locate(3,1), Printnl ( Utf8(\"Tú eliges...\") )\n i=largo, c=0\n Loop\n Get an uppercase char into 'c'\n Continue if ( var(c) Is not valid in (\"HT\") )\n Let( P:=Cat(P,c) )\n Loccol(13), Printnl(P)\n --i\n Back if (i) is positive\n\n If ( elige pc )\n Let (C := P)\n [2] Get from (C)\n Set if( Is equal to (\"H\"), \"T\", \"H\" )\n Cput (C)\n Locate(4,1), Print( \"Yo elijo... \", C )\n End If\nReturn\n","language":"Amazing-Hopper"},{"code":" 100 R = RND ( - 1 * ( PEEK (78) + 256 * PEEK (79))): REM RANDOMIZE\n 110 DEF FN R(R) = INT ( RND (1) * R) * (3 ^ (R = 8)) + 1\n 120 READ P$\n 130 DATA HTHHHHHHTHTTTHHTHTTTHTTT\n 140 LET M$ = CHR$ (13)\n 150 PRINT \"WELCOME TO PENNEY'S GAME!\"M$\n 160 INPUT \"HOW MANY ROUNDS WOULD YOU LIKE TO PLAY? \";ROUNDS%\n 170 PRINT M$\"OK, LET'S PLAY \"ROUNDS%\" ROUNDS.\"\n 180 FOR COUNT = 1 TO ROUNDS%\n 190 PRINT M$\"*** ROUND #\"COUNT\" ***\"M$\n 200 ON FN R(2) GOSUB 300,400\n 210 PRINT \"LET'S GO!\"M$\n 220 GOSUB 450\"PLAY ROUND\n 230 INPUT \"PRESS RETURN TO GO ON...\";N$\n 240 NEXT COUNT\n 250 PRINT M$\"*** END RESULT ***\"M$\n 260 IF YOU > ME THEN PRINT \"CONGRATULATIONS! YOU WON!\"\n 270 IF ME > YOU THEN PRINT \"HOORAY! I WON\"\n 280 IF ME = YOU THEN PRINT \"COOL, WE TIED.\"\n 290 END\n\n 300 ME$ = MID$ (P$, FN R(8),3): REM RANDOM SEQUENCE\n 310 PRINT \"I'LL PICK FIRST THIS TIME.\"M$\" MY SEQUENCE IS \"ME$\".\"\n 320 FOR REP = 0 TO 1 STEP 0\n 330 PRINT \"WHAT SEQUENCE DO YOU WANT?\"\n 340 GOSUB 590\"GET YOUR SEQUENCE\n 350 LET REP = YOU$ < > ME$\n 360 IF NOT REP THEN PRINT \"HEY, THAT'S MY SEQUENCE! THINK FOR YOURSELF!\"\n 370 NEXT REP\n 380 PRINT YOU$\", HUH? SOUNDS OK TO ME.\"\n 390 RETURN\n\n 400 PRINT \"YOU PICK FIRST THIS TIME.\"\n 410 GOSUB 590\"GET YOUR SEQUENCE\n 420 LET ME$ = MID$ (\"HT\",( MID$ (YOU$,2,1) = \"H\") + 1,1) + LEFT$ (YOU$,2)\n 430 PRINT \"OK, SO YOU PICKED \"YOU$M$M$\"MY SEQUENCE WILL BE \"ME$M$\n 440 RETURN\n\n 450 T0SSE$ = MID$ (P$, FN R(8),3): REM RANDOM SEQUENCE\n 460 PRINT \"TOSSING THE COIN: \"M$ MID$ (T0SSE$,2);\n 470 FOR T0SS = 0 TO 1 STEP 0\n 480 LET T0SSE$ = RIGHT$ (T0SSE$,2) + MID$ (\"HT\", FN R(2),1)\n 490 PRINT MID$ (T0SSE$,3);\n 500 IF YOU$ = T0SSE$ THEN 530\"YOU WON\n 510 IF ME$ = T0SSE$ THEN 560\"I WON\n 520 NEXT T0SS\n\n 530 YOU = YOU + 1\n 540 PRINT M$M$\"CONGRATULATIONS! YOU WON THIS ROUND.\"M$\"YOUR NEW SCORE IS \"YOU\".\"\n 550 RETURN\n\n 560 ME = ME + 1\n 570 PRINT M$M$\"YAY, I WON THIS ROUND!\"M$\"MY NEW SCORE IS \"ME\".\"\n 580 RETURN\n\n 590 YOU$ = \"\"\n 600 PRINT \"TYPE 3 LETTERS H OR T: \"\n 610 FOR I = 1 TO 3\n 620 LET V$ = \"HT\"\n 630 GOSUB 670\"GET VALID KEYPRESS\n 640 LET YOU$ = YOU$ + C$\n 650 NEXT I\n 660 LET V$ = M$ + M$\n 670 FOR C = 0 TO 1 STEP 0\n 680 GET C$\n 690 IF ASC (C$) > 95 THEN C$ = CHR$ ( ASC (C$) - 32)\n 700 LET C = C$ = LEFT$ (V$,1) OR C$ = MID$ (V$,2)\n 710 NEXT C\n 720 PRINT C$;\n 730 RETURN\n","language":"Applesoft-BASIC"},{"code":"Gui, font, s12\nGui, add, text, w90, Computer:\nloop, 3\n\tGui, add, button, x+10 h30 w30 vCB%A_Index%\nGui, add, edit, xs w240 R3 vSequence\nGui, add, text, w90, Human:\nloop, 3\n\tGui, add, button, x+10 h30 w30 vHB%A_Index% gHumButton, H\nGui, add, button, xm gToss, toss\nGui, add, button, x+10 gReset, Reset\nGui, show,, Penney's game\nCompSeq := HumSeq := Seq := GameEnd := \"\"\n\nRandomStart:\nRandom, WhoStarts, 1, 2\nif (WhoStarts=1)\n\tgosub, CompButton\nreturn\n;-----------------------------------------------\nCompButton:\nif CompSeq\n\treturn\nLoop, 3\n{\n\tRandom, coin, 1, 2\n\tGuiControl,, CB%A_Index%, % coin=1?\"H\":\"T\"\n\tCompSeq .= coin=1?\"H\":\"T\"\n}\nreturn\n;-----------------------------------------------\nHumButton:\nif HumSeq\n\treturn\nGuiControlGet, B,, % A_GuiControl\nGuiControl,, % A_GuiControl, % B=\"H\"?\"T\":\"H\"\nreturn\n;-----------------------------------------------\nToss:\nif GameEnd\n\treturn\nif !HumSeq\n{\n\tloop 3\n\t{\n\t\tGuiControlGet, B,, HB%A_Index%\n\t\tHumSeq .= B\n\t}\n\tif (CompSeq = HumSeq)\n\t{\n\t\tMsgBox, 262160, Penney's game, Human's Selection Has to be different From Computer's Selection`nTry Again\n\t\tHumSeq := \"\"\n\t\treturn\n\t}\n}\nif !CompSeq\n{\n\tCompSeq := (SubStr(HumSeq,2,1)=\"H\"?\"T\":\"H\") . SubStr(HumSeq,1,2)\n\tloop, Parse, CompSeq\n\t\tGuiControl,, CB%A_Index%, % A_LoopField\n}\n\nRandom, coin, 1, 2\nSeq .= coin=1?\"H\":\"T\"\nGuiControl,, Sequence, % seq\nif (SubStr(Seq, -2) = HumSeq)\n\tMsgBox % GameEnd := \"Human Wins\"\nelse if (SubStr(Seq, -2) = CompSeq)\n\tMsgBox % GameEnd := \"Computer Wins\"\nreturn\n;-----------------------------------------------\nReset:\nloop, 3\n{\n\tGuiControl,, CB%A_Index%\n\tGuiControl,, HB%A_Index%, H\n}\nGuiControl,, Sequence\nCompSeq := HumSeq := Seq := GameEnd := \"\"\ngosub, RandomStart\nreturn\n;-----------------------------------------------\n","language":"AutoHotkey"},{"code":"global jugador, computador, secuencia\njugador = \"\" : computador = \"\"\n\nfunction SecuenciaJugador(secuencia)\n\tdo\n\t\tvalido = TRUE\n\t\tprint chr(10) + \"Ingresa una secuencia de 3 opciones, cada una de ellas H o T:\";\n\t\tinput \" > \", secuencia\n\t\tsecuencia = upper(secuencia)\n\t\tif length(secuencia) <> 3 then valido = FALSE\n\t\tif secuencia = computador then print \"Pero no la misma que yo...\"+ chr(10): valido = FALSE\n\t\tif valido then\n\t\t\tfor i = 1 to 3\n\t\t\t\topcion = mid(secuencia, i, 1)\n\t\t\t\tif opcion <> \"H\" and opcion <> \"T\" then valido = FALSE\n\t\t\tnext i\n\t\tend if\n\tuntil valido\n\tSecuenciaJugador = secuencia\nend function\n\nfunction LanzamientoCPU()\n\tsecuencia = \"\"\n\tcomputador =\"\"\n\tfor i = 1 to 3\n\t\topcion = rand\n\t\tif opcion < .5 then secuencia += \"H\" else secuencia += \"T\"\n\tnext i\n\tLanzamientoCPU = secuencia\nend function\n\ndo\n\tcls\n\tprint \"*** Penney's Game ***\" + chr(10)\n\tif rand < .5 then\n\t\tprint \"Empiezas... \";\n\t\tjugador = SecuenciaJugador(jugador)\n\t\tcomputador = LanzamientoCPU()\n\t\tif jugador = computador then computador = LanzamientoCPU()\n\t\tprint \"Yo gano al ver \"; computador; \" por primera vez en la lista de lanzamientos...\"\n\telse\n\t\tcomputador = LanzamientoCPU()\n\t\tprint \"Elijo primero y gano al ver \"; computador; \" por primera vez en la lista de lanzamientos...\"\n\t\tjugador = SecuenciaJugador(jugador)\n\tend if\nprint: print \"Lanzamientos...\"\n\tsecuencia = \"\"\n\twinner = FALSE\n\tdo\n\t\tpause 1\n\t\tif rand <= .5 then\n\t\t\tsecuencia += \"H\"\n\t\t\tprint \"H \";\n\t\telse\n\t\t\tprint \"T \";\n\t\t\tsecuencia += \"T\"\n\t\tend if\n\t\tif right(secuencia, 3) = jugador then print: print \"¡Felicidades! ¡Ganaste!\": winner = TRUE\n\t\tif right(secuencia, 3) = computador then print: print \"¡Yo gano!\": winner = TRUE\n\tuntil winner\n\tdo\n\t\tvalido = FALSE\n\t\tprint\n\t\tinput \"¿Otra partida? (S/N) \", otra\n\t\tif instr(\"SsNn\", otra) then valido = TRUE\n\tuntil valido\nuntil upper(otra) = \"N\"\nprint \"¡Gracias por jugar!\"\nend\n","language":"BASIC256"},{"code":"::\n::Penney's Game Task from Rosetta Code Wiki\n::Batch File Implementation\n::\n::Please Directly Open the Batch File to play...\n::\n\n@echo off\nsetlocal enabledelayedexpansion\ntitle The Penney's Game Batch File\n\nset cpu=0&set you=0\ncls\necho.\necho Penney's Game\necho Batch File Implementation\n\n:main\nset you_bet=&set cpu_bet=\necho.&echo --------------------------------------------------------&echo.\necho CPU's Score: %cpu% Your Score: %you%\necho.\n<nul set /p \"dummy=Heads I start, Tails you start...\"\nset /a startrnd=%random%%%2\nset firsttoss=Tails&set func=optimal\nif %startrnd%==1 (set firsttoss=Heads&set func=rndbet)\nping -n 3 localhost >nul\n<nul set /p \"dummy=. %firsttoss%^!\"\necho.&echo.\ngoto %func%\n\n:rndbet\nset /a \"seq1=%random%%%2\",\"seq2=%random%%%2\",\"seq3=%random%%%2\"\nset binary=%seq1%%seq2%%seq3%\nset cpu_bet=%binary:1=H%\nset cpu_bet=%cpu_bet:0=T%\necho I will bet first. So, my bet sequence will be %cpu_bet%.\n:again1\nset /p \"you_bet=What will be your bet sequence? \"\ncall :validate again1\necho.&echo So, you're feeling lucky on %you_bet%. We'll see...\ngoto succesivetossing\n\n:optimal\necho Ok. You will bet first.\n:again2\nset /p \"you_bet=What will be your bet sequence? \"\ncall :validate again2\nset seq1=%you_bet:~0,1%&set seq2=%you_bet:~1,1%\nset new_seq1=T\nif /i %seq2%==T set new_seq1=H\nset cpu_bet=%new_seq1%%seq1%%seq2%\necho.&echo Hmm... My bet will be %cpu_bet%. We'll see who's lucky...\n\n:succesivetossing\nset toses=&set cnt=0\necho.\n<nul set /p \"dummy=Tosses: \"\n:tossloop\ncall :tossgen\n<nul set /p dummy=%toss%\nping -n 2 localhost >nul\nset /a newline=%cnt%%%60\nif %newline%==59 (\necho.\n<nul set /p \"dummy=. \"\n)\nif \"%toses:~-3,3%\"==\"%cpu_bet%\" goto iwin\nif \"%toses:~-3,3%\"==\"%you_bet%\" goto uwin\nset /a cnt+=1&goto tossloop\n\n:tossgen\nset /a rand=%random%%%2\nset toss=T\nif %rand%==0 set toss=H\nset toses=%toses%%toss%\ngoto :EOF\n\n:iwin\nset /a cpu+=1&set newgame=\necho.&echo.\necho I Win^^! Better Luck Next Time...\necho.\nset /p \"newgame=[Type Y if U Wanna Beat Me, or Else, Exit...] \"\nif /i \"!newgame!\"==\"Y\" goto :main\nexit\n\n:uwin\nset /a you+=1&set newgame=\necho.&echo.\necho Argh, You Win^^! ...But One Time I'll Beat You.\necho.\nset /p \"newgame=[Type Y for Another Game, or Else, Exit...] \"\nif /i \"!newgame!\"==\"Y\" goto :main\nexit\n\n:validate\necho \"!you_bet!\"|findstr /r /c:\"^\\\"[hHtT][hHtT][hHtT]\\\"$\">nul || (\n\techo [Invalid Input...]&echo.&goto %1\n)\nif /i \"!you_bet!\"==\"%cpu_bet%\" (echo [Bet something different...]&echo.&goto %1)\nfor %%i in (\"t=T\" \"h=H\") do set \"you_bet=!you_bet:%%~i!\"\ngoto :EOF\n","language":"Batch-File"},{"code":"REM >penney\nPRINT \"*** Penney's Game ***\"\nREPEAT\n PRINT ' \"Heads you pick first, tails I pick first.\"\n PRINT \"And it is... \";\n WAIT 100\n ht% = RND(0 - TIME) AND 1\n IF ht% THEN\n PRINT \"heads!\"\n PROC_player_chooses(player$)\n computer$ = FN_optimal(player$)\n PRINT \"I choose \"; computer$; \".\"\n ELSE\n PRINT \"tails!\"\n computer$ = FN_random\n PRINT \"I choose \"; computer$; \".\"\n PROC_player_chooses(player$)\n ENDIF\n PRINT \"Starting the game...\" ' SPC 5;\n sequence$ = \"\"\n winner% = FALSE\n REPEAT\n WAIT 100\n roll% = RND AND 1\n IF roll% THEN\n sequence$ += \"H\"\n PRINT \"H \";\n ELSE\n PRINT \"T \";\n sequence$ += \"T\"\n ENDIF\n IF RIGHT$(sequence$, 3) = computer$ THEN\n PRINT ' \"I won!\"\n winner% = TRUE\n ELSE\n IF RIGHT$(sequence$, 3) = player$ THEN\n PRINT ' \"Congratulations! You won.\"\n winner% = TRUE\n ENDIF\n ENDIF\n UNTIL winner%\n REPEAT\n valid% = FALSE\n INPUT \"Another game? (Y/N) \" another$\n IF INSTR(\"YN\", another$) THEN valid% = TRUE\n UNTIL valid%\nUNTIL another$ = \"N\"\nPRINT \"Thank you for playing!\"\nEND\n:\nDEF PROC_player_chooses(RETURN sequence$)\nLOCAL choice$, valid%, i%\nREPEAT\n valid% = TRUE\n PRINT \"Enter a sequence of three choices, each of them either H or T:\"\n INPUT \"> \" sequence$\n IF LEN sequence$ <> 3 THEN valid% = FALSE\n IF valid% THEN\n FOR i% = 1 TO 3\n choice$ = MID$(sequence$, i%, 1)\n IF choice$ <> \"H\" AND choice$ <> \"T\" THEN valid% = FALSE\n NEXT\n ENDIF\nUNTIL valid%\nENDPROC\n:\nDEF FN_random\nLOCAL sequence$, choice%, i%\nsequence$ = \"\"\nFOR i% = 1 TO 3\n choice% = RND AND 1\n IF choice% THEN sequence$ += \"H\" ELSE sequence$ += \"T\"\nNEXT\n= sequence$\n:\nDEF FN_optimal(sequence$)\nIF MID$(sequence$, 2, 1) = \"H\" THEN\n = \"T\" + LEFT$(sequence$, 2)\nELSE\n = \"H\" + LEFT$(sequence$, 2)\nENDIF\n","language":"BBC-BASIC"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n\n#define SEQLEN 3\n\nint getseq(char *s)\n{\n int r = 0;\n int i = 1 << (SEQLEN - 1);\n\n while (*s && i) {\n switch (*s++) {\n case 'H':\n case 'h':\n r |= i;\n break;\n case 'T':\n case 't':\n /* 0 indicates tails, this is 0, so do nothing */\n break;\n default:\n return -1;\n }\n i >>= 1;\n }\n\n return r;\n}\n\nvoid printseq(int seq)\n{\n int i;\n for (i = SEQLEN - 1; i >= 0; --i)\n printf(\"%c\", seq & (1 << i) ? 'h' : 't');\n}\n\nint getuser(void)\n{\n int user;\n char s[SEQLEN + 1];\n\n printf(\"Enter your sequence of %d (h/t): \", SEQLEN);\n while (1) {\n /* This needs to be manually changed if SEQLEN is changed */\n if (scanf(\"%3s\", s) != 1) exit(1);\n if ((user = getseq(s)) != -1) return user;\n printf(\"Please enter only h/t characters: \");\n }\n}\n\nint getai(int user)\n{\n int ai;\n\n printf(\"Computers sequence of %d is: \", SEQLEN);\n /* The ai's perfect choice will only be perfect for SEQLEN == 3 */\n if (user == -1)\n ai = rand() & (1 << SEQLEN) - 1;\n else\n ai = (user >> 1) | ((~user << 1) & (1 << SEQLEN - 1));\n\n printseq(ai);\n printf(\"\\n\");\n return ai;\n}\n\nint rungame(int user, int ai)\n{\n /* Generate first SEQLEN flips. We only need to store the last SEQLEN\n * tosses at any one time. */\n int last3 = rand() & (1 << SEQLEN) - 1;\n\n printf(\"Tossed sequence: \");\n printseq(last3);\n while (1) {\n if (user == last3) {\n printf(\"\\nUser wins!\\n\");\n return 1;\n }\n\n if (ai == last3) {\n printf(\"\\nAi wins!\\n\");\n return 0;\n }\n\n last3 = ((last3 << 1) & (1 << SEQLEN) - 2) | (rand() & 1);\n printf(\"%c\", last3 & 1 ? 'h' : 't');\n }\n}\n\nint main(void)\n{\n srand(time(NULL));\n int playerwins = 0;\n int totalgames = 0;\n\n /* Just use ctrl-c for exit */\n while (1) {\n int user = -1;\n int ai = -1;\n\n printf(\"\\n\");\n if (rand() & 1) {\n ai = getai(user);\n user = getuser();\n }\n else {\n user = getuser();\n ai = getai(user);\n }\n\n playerwins += rungame(user, ai);\n totalgames++;\n\n printf(\"You have won %d out of %d games\\n\", playerwins, totalgames);\n printf(\"=================================\\n\");\n }\n\n return 0;\n}\n","language":"C"},{"code":"#include <time.h>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nclass penney\n{\npublic:\n penney()\n { pW = cW = 0; }\n void gameLoop()\n {\n\tstring a;\n\twhile( true )\n\t{\n\t playerChoice = computerChoice = \"\";\n\t if( rand() % 2 )\n\t { computer(); player(); }\n\t else\n\t { player(); computer(); }\n\n\t play();\n\n\t cout << \"[Y] to play again \"; cin >> a;\n\t if( a[0] != 'Y' && a[0] != 'y' )\n\t {\n\t\tcout << \"Computer won \" << cW << \" times.\" << endl << \"Player won \" << pW << \" times.\";\n\t\tbreak;\n\t }\n\t cout << endl << endl;\n }\n }\nprivate:\n void computer()\n {\n if( playerChoice.length() == 0 )\n\t{\n\t for( int x = 0; x < 3; x++ )\n\t\tcomputerChoice.append( ( rand() % 2 ) ? \"H\" : \"T\", 1 );\t\n\t}\n\telse\n\t{\n\t computerChoice.append( playerChoice[1] == 'T' ? \"H\" : \"T\", 1 );\n\t computerChoice += playerChoice.substr( 0, 2 );\n\t}\n\tcout << \"Computer's sequence of three is: \" << computerChoice << endl;\n }\n void player()\n {\n\tcout << \"Enter your sequence of three (H/T) \"; cin >> playerChoice;\n }\n void play()\n {\n\tsequence = \"\";\n\twhile( true )\n\t{\n\t sequence.append( ( rand() % 2 ) ? \"H\" : \"T\", 1 );\n\t if( sequence.find( playerChoice ) != sequence.npos )\n\t {\n\t\tshowWinner( 1 );\n\t\tbreak;\n\t }\n\t else if( sequence.find( computerChoice ) != sequence.npos )\n\t {\n\t\tshowWinner( 0 );\n\t\tbreak;\n\t }\n\t}\n }\n void showWinner( int i )\n {\n\tstring s;\n\tif( i ) { s = \"Player wins!\"; pW++; }\n\telse { s = \"Computer wins!\"; cW++; }\n\tcout << \"Tossed sequence: \" << sequence << endl << s << endl << endl;\n }\n string playerChoice, computerChoice, sequence;\n int pW, cW;\n};\nint main( int argc, char* argv[] )\n{\n srand( static_cast<unsigned>( time( NULL ) ) );\n penney game; game.gameLoop();\n return 0;\n}\n","language":"C++"},{"code":"using static System.Console;\nusing static System.Threading.Thread;\nusing System;\n\npublic static class PenneysGame\n{\n const int pause = 500;\n const int N = 3;\n static Random rng = new Random();\n\n static int Toss() => rng.Next(2);\n\n static string AsString(this int sequence) {\n string s = \"\";\n for (int b = 0b100; b > 0; b >>= 1) {\n s += (sequence & b) > 0 ? 'T' : 'H';\n }\n return s;\n }\n\n static int UserInput() {\n while (true) {\n switch (ReadKey().Key) {\n case ConsoleKey.Escape: return -1;\n case ConsoleKey.H: return 0;\n case ConsoleKey.T: return 1;\n }\n Console.Write('\\b');\n }\n }\n\n public static void Main2() {\n int yourScore = 0, myScore = 0;\n while (true) {\n WriteLine($\"Your score: {yourScore}, My score: {myScore}\");\n WriteLine(\"Determining who goes first...\");\n Sleep(pause);\n bool youStart = Toss() == 1;\n WriteLine(youStart ? \"You go first.\" : \"I go first.\");\n int yourSequence = 0, mySequence = 0;\n if (youStart) {\n WriteLine(\"Choose your sequence of (H)eads and (T)ails (or press Esc to exit)\");\n int userChoice;\n for (int i = 0; i < N; i++) {\n if ((userChoice = UserInput()) < 0) return;\n yourSequence = (yourSequence << 1) + userChoice;\n }\n mySequence = ((~yourSequence << 1) & 0b100) | (yourSequence >> 1);\n } else {\n for (int i = 0; i < N; i++) {\n mySequence = (mySequence << 1) + Toss();\n }\n\n WriteLine(\"I chose \" + mySequence.AsString());\n do {\n WriteLine(\"Choose your sequence of (H)eads and (T)ails (or press Esc to exit)\");\n int choice;\n yourSequence = 0;\n for (int i = 0; i < N; i++) {\n if ((choice = UserInput()) < 0) return;\n yourSequence = (yourSequence << 1) + choice;\n }\n if (yourSequence == mySequence) {\n WriteLine();\n WriteLine(\"You cannot choose the same sequence.\");\n }\n } while (yourSequence == mySequence);\n }\n\n WriteLine();\n WriteLine($\"Your sequence: {yourSequence.AsString()}, My sequence: {mySequence.AsString()}\");\n WriteLine(\"Tossing...\");\n int sequence = 0;\n for (int i = 0; i < N; i++) {\n Sleep(pause);\n int toss = Toss();\n sequence = (sequence << 1) + toss;\n Write(toss > 0 ? 'T' : 'H');\n }\n while (true) {\n if (sequence == yourSequence) {\n WriteLine();\n WriteLine(\"You win!\");\n yourScore++;\n break;\n } else if (sequence == mySequence) {\n WriteLine();\n WriteLine(\"I win!\");\n myScore++;\n break;\n }\n Sleep(pause);\n int toss = Toss();\n sequence = ((sequence << 1) + toss) & 0b111;\n Write(toss > 0 ? 'T' : 'H');\n }\n WriteLine(\"Press a key.\");\n ReadKey();\n Clear();\n }\n }\n\n}\n","language":"C-sharp"},{"code":"(ns penney.core\n (:gen-class))\n\n(def heads \\H)\n(def tails \\T)\n\n(defn flip-coin []\n (let [flip (rand-int 2)]\n (if (= flip 0) heads tails)))\n\n(defn turn [coin]\n (if (= coin heads) tails heads))\n\n(defn first-index [combo coll]\n (some #(if (= (second %) combo) (first %)) coll))\n\n(defn find-winner [h c]\n (if (< h c)\n (do (println \"YOU WIN!\\n\") :human)\n (do (println \"COMPUTER WINS!\\n\") :computer)))\n\n(defn flip-off [human comp]\n (let [flips (repeatedly flip-coin)\n idx-flips (map-indexed vector (partition 3 1 flips))\n h (first-index (seq human) idx-flips)\n c (first-index (seq comp) idx-flips)]\n (println (format \"Tosses: %s\" (apply str (take (+ 3 (min h c)) flips))))\n (find-winner h c)))\n\n(defn valid? [combo]\n (if (empty? combo) true (and (= 3 (count combo)) (every? #(or (= heads %) (= tails %)) combo))))\n\n(defn ask-move []\n (println \"What sequence of 3 Heads/Tails do you choose?\")\n (let [input (clojure.string/upper-case (read-line))]\n (if-not (valid? input) (recur) input)))\n\n(defn optimize-against [combo]\n (let [mid (nth combo 1)\n comp (str (turn mid) (first combo) mid)]\n (println (format \"Computer chooses %s: \" comp)) comp))\n\n(defn initial-move [game]\n (let [combo (apply str (repeatedly 3 flip-coin))]\n (println \"--------------\")\n (println (format \"Current score | CPU: %s, You: %s\" (:computer game) (:human game)))\n (if (= (:first-player game) tails)\n (do\n (println \"Computer goes first and chooses: \" combo)\n combo)\n (println \"YOU get to go first.\"))))\n\n(defn play-game [game]\n (let [c-move (initial-move game)\n h-move (ask-move)]\n (if-not (empty? h-move)\n (let [winner (flip-off h-move (if (nil? c-move) (optimize-against h-move) c-move))]\n (recur (assoc game winner (inc (winner game)) :first-player (flip-coin))))\n (println \"Thanks for playing!\"))))\n\n(defn -main [& args]\n (println \"Penney's Game.\")\n (play-game {:first-player (flip-coin)\n :human 0, :computer 0}))\n","language":"Clojure"},{"code":"(setf *random-state* (make-random-state t))\n\n(defparameter *heads* #\\H)\n(defparameter *tails* #\\T)\n\n(defun main ()\n (format t \"Penney's Game~%~%\")\n (format t \"Flipping to see who goes first ...\")\n\n (setq p2 nil)\n (if (string= (flip) *heads*)\n (progn (format t \" I do.~%\")\n (setq p2 (choose-random-sequence))\n (format t \"I choose: ~A~%\" p2))\n (format t \"You do.~%\"))\n\n (setq p1 nil)\n (loop while (null p1) doing\n (format t \"Enter your three-flip sequence: \")\n (setq p1 (string (read)))\n (cond ((/= (length p1) 3)\n (format t \"Sequence must consist of three flips.~%\")\n (setq p1 nil))\n ((string= p1 p2)\n (format t \"Sequence must be different from mine.~%\")\n (setq p1 nil))\n ((notevery #'valid? (coerce p1 'list))\n (format t \"Sequence must be contain only ~A's and ~A's.~%\" *heads* *tails*)\n (setq p1 nil))))\n (format t \"You picked: ~A~%\" p1)\n\n (if (null p2)\n (progn\n (setq p2 (choose-optimal-sequence p1))\n (format t \"I choose: ~A~%\" p2)))\n\n (format t \"Here we go. ~A, you win; ~A, I win.~%\" p1 p2)\n (format t \"Flips:\")\n (let ((winner nil)\n (flips '()))\n (loop while (null winner) doing\n (setq flips (cons (flip) flips))\n (format t \" ~A\" (car flips))\n (if (>= (length flips) 3)\n (let ((trail (coerce (reverse (subseq flips 0 3)) 'string)))\n (cond ((string= trail p1) (setq winner \"You\"))\n ((string= trail p2) (setq winner \"I\"))))))\n (format t \"~&~A win!\" winner)))\n\n(defparameter *sides* (list *heads* *tails*))\n(defun flip () (nth (random 2 *random-state*) *sides*))\n\n(defun valid? (flip) (not (null (member flip *sides*))))\n\n(defun opposite (flip) (if (string= flip *heads*) *tails* *heads*))\n\n(defun choose-random-sequence () (coerce (list (flip) (flip) (flip)) 'string))\n\n(defun choose-optimal-sequence (against)\n (let* ((opposed (coerce against 'list))\n (middle (cadr opposed))\n (my-list (list (opposite middle) (car opposed) middle)))\n (coerce my-list 'string)))\n\n(main)\n","language":"Common-Lisp"},{"code":"void main() {\n import std.stdio, std.random, std.algorithm, std.string,\n std.conv, std.range, core.thread;\n\n immutable first = uniform(0, 2) == 0;\n\n string you, me;\n if (first) {\n me = 3.iota.map!(_ => \"HT\"[uniform(0, $)]).text;\n writefln(\"I choose first and will win on first seeing %s in the list of tosses\", me);\n while (you.length != 3 || you.any!(c => !c.among('H', 'T')) || you == me) {\n \"What sequence of three Heads/Tails will you win with: \".write;\n you = readln.strip;\n }\n } else {\n while (you.length != 3 || you.any!(c => !c.among('H', 'T'))) {\n \"After you: What sequence of three Heads/Tails will you win with: \".write;\n you = readln.strip;\n }\n me = (you[1] == 'T' ? 'H' : 'T') ~ you[0 .. 2];\n writefln(\"I win on first seeing %s in the list of tosses\", me);\n }\n\n \"Rolling:\\n \".write;\n string rolled;\n while (true) {\n rolled ~= \"HT\"[uniform(0, $)];\n rolled.back.write;\n if (rolled.endsWith(you))\n return \"\\n You win!\".writeln;\n if (rolled.endsWith(me))\n return \"\\n I win!\".writeln;\n Thread.sleep(1.seconds);\n }\n}\n","language":"D"},{"code":"defmodule Penney do\n @toss [:Heads, :Tails]\n\n def game(score \\\\ {0,0})\n def game({iwin, ywin}=score) do\n IO.puts \"Penney game score I : #{iwin}, You : #{ywin}\"\n [i, you] = @toss\n coin = Enum.random(@toss)\n IO.puts \"#{i} I start, #{you} you start ..... #{coin}\"\n {myC, yC} = setup(coin)\n seq = for _ <- 1..3, do: Enum.random(@toss)\n IO.write Enum.join(seq, \" \")\n {winner, score} = loop(seq, myC, yC, score)\n IO.puts \"\\n #{winner} win!\\n\"\n game(score)\n end\n\n defp setup(:Heads) do\n myC = Enum.shuffle(@toss) ++ [Enum.random(@toss)]\n joined = Enum.join(myC, \" \")\n IO.puts \"I chose : #{joined}\"\n {myC, yourChoice}\n end\n defp setup(:Tails) do\n yC = yourChoice\n myC = (@toss -- [Enum.at(yC,1)]) ++ Enum.take(yC,2)\n joined = Enum.join(myC, \" \")\n IO.puts \"I chose : #{joined}\"\n {myC, yC}\n end\n\n defp yourChoice do\n IO.write \"Enter your choice (H/T) \"\n choice = read([])\n IO.puts \"You chose: #{Enum.join(choice, \" \")}\"\n choice\n end\n\n defp read([_,_,_]=choice), do: choice\n defp read(choice) do\n case IO.getn(\"\") |> String.upcase do\n \"H\" -> read(choice ++ [:Heads])\n \"T\" -> read(choice ++ [:Tails])\n _ -> read(choice)\n end\n end\n\n defp loop(myC, myC, _, {iwin, ywin}), do: {\"I\", {iwin+1, ywin}}\n defp loop(yC, _, yC, {iwin, ywin}), do: {\"You\", {iwin, ywin+1}}\n defp loop(seq, myC, yC, score) do\n append = Enum.random(@toss)\n IO.write \" #{append}\"\n loop(tl(seq)++[append], myC, yC, score)\n end\nend\n\nPenney.game\n","language":"Elixir"},{"code":"USING: arrays ascii io kernel math prettyprint random sequences\nstrings ;\nIN: rosetta-code.penneys-game\n\n! Generate a random boolean.\n: t|f ( -- t/f )\n 1 random-bits 0 = ;\n\n! Checks whether the sequence chosen by the human is valid.\n: valid-input? ( seq -- ? )\n [ [ CHAR: H = ] [ CHAR: T = ] bi or ] filter length 3 = ;\n\n! Prompt the human player for a sequence.\n: input-seq ( -- seq )\n \"Please input a 3-long sequence of H or T (heads or tails).\"\n print \"Example: HTH\" print \"> \" write readln >upper >array ;\n\n! Get the human player's input sequence with error checking.\n: get-input ( -- seq )\n t [ drop input-seq dup valid-input? not ] loop ;\n\n! Add a random coin flip to a vector.\n: flip-coin ( vector -- vector' )\n t|f CHAR: H CHAR: T ? over push ;\n\n! Generate a random 3-long sequence of coin flips.\n: rand-seq ( -- seq )\n V{ } clone 3 [ flip-coin ] times ;\n\n! Generate the optimal sequence response to a given sequence.\n: optimal ( seq1 -- seq2 )\n [ second dup CHAR: H = [ CHAR: T ] [ CHAR: H ] if ]\n [ first ] [ second ] tri 3array nip dup\n \"The computer chose \" write >string write \".\" print ;\n\n! Choose a random sequence for the computer and report what\n! was chosen.\n: computer-first ( -- seq )\n \"The computer picks a sequence first and chooses \" write\n rand-seq dup >string write \".\" print >array ;\n\n! The human is prompted to choose any sequence with no\n! restrictions.\n: human-first ( -- seq )\n \"You get to go first.\" print get-input ;\n\n! Forbid the player from choosing the same sequence as the\n! computer.\n: human-second ( cseq -- cseq hseq )\n get-input [ 2dup = not ]\n [ drop\n \"You may not choose the same sequence as the computer.\"\n print get-input\n ] until ;\n\n! Display a message introducing the game.\n: welcome ( -- )\n \"Welcome to Penney's Game. The computer or the player\" print\n \"will be randomly selected to choose a sequence of\" print\n \"three coin tosses. The sequence will be shown to the\" print\n \"opponent, and then he will choose a sequence.\" print nl\n \"Then, a coin will be flipped until the sequence\" print\n \"matches the last three coin flips, and a winner\" print\n \"announced.\" print nl ;\n\n! Check for human victory.\n: human-won? ( cseq hseq coin-flips -- ? )\n 3 tail* >array = nip ;\n\n! Check for computer victory.\n: computer-won? ( cseq hseq coin-flips -- ? )\n 3 tail* >array pick = 2nip ;\n\n! Flip a coin until a victory is detected. Then, inform the\n! player who won.\n: flip-coins ( cseq hseq -- )\n \"Flipping coins...\" print\n rand-seq [ 3dup [ human-won? ] [ computer-won? ] 3bi or ]\n [ flip-coin ] until dup >string print human-won?\n [ \"You won!\" print ] [ \"The computer won.\" print ] if ;\n\n! Randomly choose a player to choose their sequence first.\n! Then play a full round of Penney's Game.\n: start-game ( -- )\n welcome t|f [ human-first dup optimal swap ]\n [ computer-first human-second ] if flip-coins ;\n\nstart-game\n","language":"Factor"},{"code":"Sub Jugador_elige(secuencia As String)\n Dim As String eleccion\n Dim As Byte valido, i\n Do\n valido = True\n Print !\"\\nIngresa una secuencia de 3 opciones, cada una de ellas H o T:\";\n Input \" > \", secuencia\n If Len(secuencia) <> 3 Then valido = False\n If valido Then\n For i = 1 To 3\n eleccion = Mid(Ucase(secuencia), i, 1)\n If eleccion <> \"H\" And eleccion <> \"T\" Then valido = False\n Next\n End If\n Loop Until valido\nEnd Sub\n\nFunction Aleatorio() As String\n Dim As Byte eleccion, i\n Dim As String tirada\n tirada = \"\"\n For i = 1 To 3\n eleccion = Rnd And 1\n If eleccion Then tirada += \"H\" Else tirada += \"T\"\n Next\n Return tirada\nEnd Function\n\nFunction Optima(secuencia As String) As String\n If Mid(secuencia, 2, 1) = \"H\" Then\n Optima = \"T\" + Left(secuencia, 2)\n Else\n Optima = \"H\" + Left(secuencia, 2)\n End If\nEnd Function\n\nRandomize Timer\nDim As String jugador, computador, otro\nDim Shared As String secuencia\nDim As Boolean ganador, valido\nDo\n Cls\n Color 11\n Print \"*** Penney's Game ***\" & Chr(10)\n Color 7\n Print \"Cara eliges primero, cruz yo elijo primero.\"\n Print \"Y es... \";\n Sleep 300\n Dim As Double ht: ht = Rnd(0 - Timer) And 1\n If ht Then\n Print \"cara!\"\n Jugador_elige(jugador)\n computador = Optima(jugador)\n Print !\"\\nYo elijo \"; computador; !\".\\n\"\n Else\n Print \"cruz!\"\n computador = Aleatorio\n Print !\"\\nYo elijo \"; computador; !\".\\n\"\n Jugador_elige(jugador)\n End If\n Print \"Comenzando el juego ...\"\n secuencia = \"\"\n ganador = False\n Do\n Sleep 200\n Dim As Integer lanzar = Rnd And 1\n If lanzar Then\n secuencia += \"H\"\n Print \"H \";\n Else\n Print \"T \";\n secuencia += \"T\"\n End If\n\n If Right(secuencia, 3) = computador Then\n Print !\"\\nGan‚!\\n\"\n ganador = True\n Else\n If Right(secuencia, 3) = jugador Then\n Print !\"\\nFelicidades! Ganaste.\\n\"\n ganador = True\n End If\n End If\n Loop Until ganador\n Do\n valido = False\n Input \"¨Otra ronda? (S/N) \", otro\n If Instr(\"SYN\", Ucase(otro)) Then valido = True\n Loop Until valido\nLoop Until Ucase(otro) = \"N\"\nPrint !\"\\nGracias por jugar!\"\nSleep\nEnd\n","language":"FreeBASIC"},{"code":"package main\nimport \"fmt\"\nimport \"math/rand\"\nfunc main(){\nvar a1,a2,a3,y,match,j,k int\nvar inp string\ny=1\nfor y==1{\nfmt.Println(\"Enter your sequence:\")\nfmt.Scanln(&inp)\nvar Ai [3] int\nvar user [3] int\nfor j=0;j<3;j++{\nif(inp[j]==104){\nuser[j]=1\n}else{\nuser[j]=0\n}\n}\nfor k=0;k<3;k++{\nAi[k]=rand.Intn(2)\n}\nfor user[0]==Ai[0]&&user[1]==Ai[1]&&user[2]==Ai[2]{\nfor k=0;k<3;k++{\nAi[k]=rand.Intn(2)\n}\n}\nfmt.Println(\"You gave the sequence:\")\nprintht(user)\nfmt.Println()\nfmt.Println(\"The computer generated sequence is:\")\nprintht(Ai)\nfmt.Println()\na1=rand.Intn(2)\na2=rand.Intn(2)\na3=rand.Intn(2)\nfmt.Print(\"The generated sequence is:\")\nprinth(a1)\nprinth(a2)\nprinth(a3)\nmatch=0\nfor match==0{\nif(matches(user,a1,a2,a3)==1){\nfmt.Println()\nfmt.Println(\"You have won!!!\")\nmatch=1\n}else if(matches(Ai,a1,a2,a3)==1){\nfmt.Println()\nfmt.Println(\"You lost!! Computer wins\")\nmatch=1\n}else{\na1=a2\na2=a3\na3=rand.Intn(2)\nprinth(a3)\n}\n}\nfmt.Println(\"Do you want to continue(0/1):\")\nfmt.Scanln(&y)\n}\n}\nfunc printht(a [3] int) int{\nvar i int\nfor i=0;i<3;i++{\nif(a[i]==1){\nfmt.Print(\"h\")\n}else{\nfmt.Print(\"t\")\n}\n}\nreturn 1\n}\nfunc printh(a int) int{\nif(a==1){\nfmt.Print(\"h\")\n}else{\nfmt.Print(\"t\")\n}\nreturn 1\n}\nfunc matches(a [3] int,p int,q int,r int) int{\nif(a[0]==p&&a[1]==q&&a[2]==r){\nreturn 1\n}else{\nreturn 0\n}\n}\n","language":"Go"},{"code":"import qualified Data.List as L\nimport System.IO\nimport System.Random\n\ndata CoinToss = H | T deriving (Read, Show, Eq)\n\nparseToss :: String -> [CoinToss]\nparseToss [] = []\nparseToss (s:sx)\n | s == 'h' || s == 'H' = H : parseToss sx\n | s == 't' || s == 'T' = T : parseToss sx\n | otherwise = parseToss sx\n\nnotToss :: CoinToss -> CoinToss\nnotToss H = T\nnotToss T = H\n\ninstance Random CoinToss where\n random g = let (b, gb) = random g in (if b then H else T, gb)\n randomR = undefined\n\nprompt :: (Read a) => String -> String -> (String -> Maybe a) -> IO a\nprompt msg err parse = do\n putStrLn msg\n line <- getLine\n let ans = parse line\n case ans of\n Nothing -> do\n putStrLn err\n prompt msg err parse\n Just ansB -> return ansB\n\nshowCat :: (Show a) => [a] -> String\nshowCat = concatMap show\n\ndata Winner = Player | CPU\n\n-- This may never terminate.\nrunToss :: (RandomGen g) => [CoinToss] -> [CoinToss] -> g -> ([CoinToss], Winner)\nrunToss player cpu gen =\n let stream = randoms gen\n run ss@(s:sx)\n | L.isPrefixOf player ss = player\n | L.isPrefixOf cpu ss = cpu\n | otherwise = s : run sx\n winner = run stream\n in if L.isSuffixOf player winner\n then (winner, Player)\n else (winner, CPU)\n\ngame :: (RandomGen g, Num a, Show a) => Bool -> a -> a -> g -> IO ()\ngame cpuTurn playerScore cpuScore gen = do\n putStrLn $ \"\\nThe current score is CPU: \" ++ show cpuScore\n ++ \", You: \" ++ show playerScore\n\n let (genA, genB) = split gen\n promptPlayer check =\n prompt \"Pick 3 coin sides: \" \"Invalid input.\" $ \\s ->\n let tosses = parseToss s in\n if check tosses then Just tosses else Nothing\n promptCpu x = putStrLn $ \"I have chosen: \" ++ showCat x\n\n (tosses, winner) <-\n if cpuTurn\n then do\n let cpuChoice = take 3 $ randoms gen\n promptCpu cpuChoice\n playerChoice <- promptPlayer $ \\n -> n /= cpuChoice && 3 == length n\n return $ runToss playerChoice cpuChoice genA\n else do\n playerChoice <- promptPlayer $ \\n -> 3 == length n\n let cpuChoice = case playerChoice of [a,b,_] -> [notToss b, a, b]\n promptCpu cpuChoice\n return $ runToss playerChoice cpuChoice genA\n\n putStrLn $ \"The sequence tossed was: \" ++ showCat tosses\n\n case winner of\n Player -> do\n putStrLn \"You win!\"\n game (not cpuTurn) (playerScore + 1) cpuScore genB\n CPU -> do\n putStrLn \"I win!\"\n game (not cpuTurn) playerScore (cpuScore + 1) genB\n\nmain :: IO ()\nmain = do\n hSetBuffering stdin LineBuffering\n stdgen <- getStdGen\n let (cpuFirst, genA) = random stdgen\n game cpuFirst 0 0 genA\n","language":"Haskell"},{"code":"require 'format/printf numeric'\n\nrandomize '' NB. randomize seed for new session\n\nVals=: 'HT' NB. valid values\ninput=: 1!:1@<&1: NB. get input from user\nprompt=: input@echo NB. prompt user for input\ncheckInput=: 'Choose 3 H/Ts' assert (Vals e.~ ]) , 3 = #\ngetUserSeq=: (] [ checkInput)@toupper@prompt\nchoose1st=: Vals {~ 3 ?@$ 2: NB. computer chooses 1st\nchoose2nd=: (0 1 1=1 0 1{])&.(Vals&i.) NB. computer chooses 2nd\n\nplayPenney=: verb define\n if. ?2 do. NB. randomize first chooser\n Comp=. choose1st ''\n 'Computer chose %s' printf <Comp\n You=. getUserSeq 'Choose a sequence of three coin tosses (H/T):'\n 'Choose a different sequence to computer' assert You -.@-: Comp\n else.\n You=. getUserSeq 'Choose a sequence of three coin tosses (H/T):'\n Comp=. choose2nd You\n 'Computer chose %s ' printf <Comp\n end.\n Tosses=. Vals {~ 100 ?@$ 2\n Result=. (Comp,:You) {.@I.@E.\"1 Tosses\n 'Toss sequence is %s' printf < (3 + <./ Result) {. Tosses\n echo ('No result';'You win!';'Computer won!') {::~ *-/ Result\n)\n","language":"J"},{"code":" playPenney''\nComputer chose TTT\nChoose a sequence of three coin tosses (H/T):\nHTT\nToss sequence is TTHHTT\nYou win!\n playPenney''\nChoose a sequence of three coin tosses (H/T):\nHTT\nComputer chose HHT\nToss sequence is HTHTT\nYou win!\n","language":"J"},{"code":"import java.util.*;\n\npublic class PenneysGame {\n\n public static void main(String[] args) {\n Random rand = new Random();\n\n String compChoice = \"\", playerChoice;\n if (rand.nextBoolean()) {\n\n for (int i = 0; i < 3; i++)\n compChoice += \"HT\".charAt(rand.nextInt(2));\n System.out.printf(\"Computer chooses %s%n\", compChoice);\n\n playerChoice = prompt(compChoice);\n\n } else {\n\n playerChoice = prompt(compChoice);\n\n compChoice = \"T\";\n if (playerChoice.charAt(1) == 'T')\n compChoice = \"H\";\n compChoice += playerChoice.substring(0, 2);\n System.out.printf(\"Computer chooses %s%n\", compChoice);\n }\n\n String tossed = \"\";\n while (true) {\n tossed += \"HT\".charAt(rand.nextInt(2));\n System.out.printf(\"Tossed %s%n\" , tossed);\n if (tossed.endsWith(playerChoice)) {\n System.out.println(\"You win!\");\n break;\n }\n if (tossed.endsWith(compChoice)) {\n System.out.println(\"Computer wins!\");\n break;\n }\n }\n }\n\n private static String prompt(String otherChoice) {\n Scanner sc = new Scanner(System.in);\n String s;\n do {\n System.out.print(\"Choose a sequence: \");\n s = sc.nextLine().trim().toUpperCase();\n } while (!s.matches(\"[HT]{3}\") || s.equals(otherChoice));\n return s;\n }\n}\n","language":"Java"},{"code":"const SLEN = 3\n\nautobet() = randbool(SLEN)\nfunction autobet(ob::BitArray{1})\n rlen = length(ob)\n 2 < rlen || return ~ob\n 3 < rlen || return [~ob[2], ob[1:2]]\n opt = falses(rlen)\n opt[1] = true\n opt[end-1:end] = true\n ob != opt || return ~opt\n return opt\nend\nautobet(ob::Array{Bool,1}) = autobet(convert(BitArray{1}, ob))\n\nfunction pgencode{T<:String}(a::T)\n b = uppercase(a)\n 0 < length(b) || return trues(0)\n !ismatch(r\"[^HT]+\", b) || error(@sprintf \"%s is not a HT sequence\" a)\n b = split(b, \"\")\n b .== \"H\"\nend\npgdecode(a::BitArray{1}) = join([i ? \"H\" : \"T\" for i in a], \"\")\n\nfunction humanbet()\n b = \"\"\n while length(b) != SLEN || ismatch(r\"[^HT]+\", b)\n print(\"Your bet? \")\n b = uppercase(chomp(readline()))\n end\n return b\nend\n","language":"Julia"},{"code":"println(\"Playing Penney's Game Against the computer.\")\n\nif randbool()\n mach = autobet()\n println(@sprintf \"The computer bet first, chosing %s.\" pgdecode(mach))\n println(\"Now you can bet.\")\n human = pgencode(humanbet())\nelse\n println(\"You bet first.\")\n human = pgencode(humanbet())\n mach = autobet(human)\nend\nprint(@sprintf \"You bet %s \" pgdecode(human))\nprintln(@sprintf \"and the computer bet %s.\" pgdecode(mach))\n","language":"Julia"},{"code":"pg = randbool(SLEN)\npgtail = copy(pg)\nwhile pgtail != mach && pgtail != human\n push!(pg, randbool())\n pgtail = [pgtail[2:end], pg[end]]\nend\n\nprintln(@sprintf(\"This game lasted %d turns yielding\\n %s\",\n length(pg), pgdecode(pg)))\n\nif human == mach\n println(\"so you and the computer tied.\")\nelseif pgtail == mach\n println(\"so the computer won.\")\nelse\n println(\"so you won.\")\nend\n","language":"Julia"},{"code":"// version 1.2.10\n\nimport java.util.Random\n\nval rand = Random()\n\nval optimum = mapOf(\n \"HHH\" to \"THH\", \"HHT\" to \"THH\", \"HTH\" to \"HHT\", \"HTT\" to \"HHT\",\n \"THH\" to \"TTH\", \"THT\" to \"TTH\", \"TTH\" to \"HTT\", \"TTT\" to \"HTT\"\n)\n\nfun getUserSequence(): String {\n println(\"A sequence of three H or T should be entered\")\n var userSeq: String\n do {\n print(\"Enter your sequence: \")\n userSeq = readLine()!!.toUpperCase()\n }\n while (userSeq.length != 3 || userSeq.any { it != 'H' && it != 'T' })\n return userSeq\n}\n\nfun getComputerSequence(userSeq: String = \"\"): String {\n val compSeq = if(userSeq == \"\")\n String(CharArray(3) { if (rand.nextInt(2) == 0) 'T' else 'H' })\n else\n optimum[userSeq]!!\n println(\"Computer's sequence: $compSeq\")\n return compSeq\n}\n\nfun main(args: Array<String>) {\n var userSeq: String\n var compSeq: String\n val r = rand.nextInt(2)\n if (r == 0) {\n println(\"You go first\")\n userSeq = getUserSequence()\n println()\n compSeq = getComputerSequence(userSeq)\n }\n else {\n println(\"Computer goes first\")\n compSeq = getComputerSequence()\n println()\n userSeq = getUserSequence()\n }\n\n println()\n val coins = StringBuilder()\n while (true) {\n val coin = if (rand.nextInt(2) == 0) 'H' else 'T'\n coins.append(coin)\n println(\"Coins flipped: $coins\")\n val len = coins.length\n if (len >= 3) {\n val seq = coins.substring(len - 3, len)\n if (seq == userSeq) {\n println(\"\\nYou win!\")\n return\n }\n else if (seq == compSeq) {\n println(\"\\nComputer wins!\")\n return\n }\n }\n Thread.sleep(2000) // wait two seconds for next flip\n }\n}\n","language":"Kotlin"},{"code":"function penny_game()\n local player, computer = \"\", \"\"\n function player_choose()\n io.write( \"Enter your sequence of three H and/or T: \" )\n local t = io.read():upper()\n if #t > 3 then t = t:sub( 1, 3 )\n elseif #t < 3 then return \"\"\n end\n\n for i = 1, 3 do\n c = t:sub( i, i )\n if c ~= \"T\" and c ~= \"H\" then\n print( \"Just H's and T's!\" )\n return \"\"\n end\n end\n return t\n end\n function computer_choose()\n local t = \"\"\n if #player > 0 then\n if player:sub( 2, 2 ) == \"T\" then\n t = \"H\"\n else\n t = \"T\";\n end\n t = t .. player:sub( 1, 2 )\n else\n for i = 1, 3 do\n if math.random( 2 ) == 1 then\n t = t .. \"H\"\n else\n t = t .. \"T\"\n end\n end\n end\n return t\n end\n if math.random( 2 ) == 1 then\n computer = computer_choose()\n io.write( \"My sequence is: \" .. computer .. \"\\n\" )\n while( true ) do\n player = player_choose()\n if player:len() == 3 then break end\n end\n else\n while( true ) do\n player = player_choose()\n if player:len() == 3 then break end\n end\n computer = computer_choose()\n io.write( \"My sequence is: \" .. computer .. \"\\n\" )\n end\n local coin, i = \"\", 1\n while( true ) do\n if math.random( 2 ) == 1 then\n coin = coin .. \"T\"\n io.write( \"T\" )\n else\n coin = coin .. \"H\"\n io.write( \"H\" )\n end\n if #coin > 2 then\n local seq = coin:sub( i, i + 2 )\n i = i + 1\n if seq == player then\n print( \"\\nPlayer WINS!!!\" )\n return 1\n elseif seq == computer then\n print( \"\\nComputer WINS!!!\" )\n return -1\n end\n end\n end\nend\nmath.randomseed( os.time() )\nlocal cpu, user = 0, 0\nrepeat\n r = penny_game()\n if r > 0 then\n user = user + 1\n else\n cpu = cpu + 1\n end\n print( \"Player: \" .. user .. \" CPU: \" .. cpu )\n io.write( \"Play again (Y/N)? \" )\n r = io.read()\nuntil( r == \"N\" or r == \"n\" )\n","language":"Lua"},{"code":"randomTorH = function()\n if rnd < 0.5 then return \"T\" else return \"H\"\nend function\n\nif rnd < 0.5 then\n playerSeq = input(\"Input your sequence (e.g. HTH): \").upper\n if playerSeq[1] == \"T\" then compSeq = \"H\" else compSeq = \"T\"\n compSeq = compSeq + playerSeq[:2]\n print \"I choose: \" + compSeq\nelse\n compSeq = randomTorH + randomTorH + randomTorH\n print \"I choose: \" + compSeq\n playerSeq = input(\"Input your sequence (e.g. HTH): \").upper\nend if\n\nprint \"Here we go...\"\nseq = \"\"\nwhile true\n flip = randomTorH\n print flip\n seq = seq + flip\n if seq[-3:] == playerSeq then\n print \"You win!\"\n break\n else if seq[-3:] == compSeq then\n print \"I win!\"\n break\n end if\n wait\nend while\n","language":"MiniScript"},{"code":"import os, random, sequtils, strutils\n\nrandomize()\n\nlet first = sample([false, true])\n\nvar you, me = \"\"\nif first:\n me = newSeqWith(3, sample(\"HT\")).join()\n echo \"I choose first and will win on first seeing $# in the list of tosses.\" % me\n while you.len != 3 or not allCharsInSet(you, {'H', 'T'}) or you == me:\n stdout.write \"What sequence of three Heads/Tails will you win with? \"\n you = stdin.readLine()\nelse:\n while you.len != 3 or not allCharsInSet(you, {'H', 'T'}):\n echo \"After you: what sequence of three Heads/Tails will you win with? \"\n you = stdin.readLine()\n me = (if you[1] == 'T': 'H' else: 'T') & you[0..1]\n echo \"I win on first seeing $# in the list of tosses\" % me\n\nvar rolled = \"\"\nstdout.write \"Rolling:\\n \"\nwhile true:\n rolled.add sample(\"HT\")\n stdout.write rolled[^1]\n stdout.flushFile()\n if rolled.endsWith(you):\n echo \"\\n You win!\"\n break\n elif rolled.endsWith(me):\n echo \"\\n I win!\"\n break\n sleep(1000)\n","language":"Nim"},{"code":"PROGRAM Penney;\n\nTYPE\n CoinToss = (heads, tails);\n Sequence = array [1..3] of CoinToss;\n Player = record\n bet: Sequence;\n score: integer;\n end;\n\nVAR\n Human, Computer: Player;\n Rounds, Count: integer;\n\nFunction TossCoin: CoinToss;\n{ Returns heads or tails at random }\nBegin\n if random(2) = 1 then TossCoin := Heads\n else TossCoin := tails\nEnd;\n\nProcedure PutToss(toss: CoinToss);\n{ Outputs heads or tails as a letter }\nBegin\n if toss = heads then write('H')\n else write('T')\nEnd;\n\nFunction GetToss: CoinToss;\n{ Reads H or T from the keyboard in either lettercase }\nvar c: char;\nBegin\n { Keep reading characters until we get an appropriate letter }\n repeat read(c) until c in ['H', 'h', 'T', 't'];\n { Interpret the letter }\n if c in ['H', 'h'] then GetToss := heads\n else GetToss := tails\nEnd;\n\nProcedure ShowSequence(tosses: Sequence);\n{ Outputs three coin tosses at once }\nVar\n i: integer;\nBegin\n for i := 1 to 3 do PutToss(tosses[i])\nEnd;\n\nProcedure ReadSequence(var tosses: Sequence);\n{ Accepts three coin tosses from the keyboard }\nVar i: integer;\nBegin\n { Get the 3 letters }\n for i := 1 to 3 do tosses[i] := GetToss;\n { Ignore the rest of the line }\n readln\nEnd;\n\nFunction Optimum(opponent: Sequence): Sequence;\n{ Generates the optimum sequence against an opponent }\nBegin\n case opponent[2] of\n heads: Optimum[1] := tails;\n tails: Optimum[1] := heads\n end;\n Optimum[2] := opponent[1];\n Optimum[3] := opponent[2]\nEnd;\n\nFunction RandomSequence: Sequence;\n{ Generates three random coin tosses }\nVar\n i: integer;\nBegin\n for i := 1 to 3 do RandomSequence[i] := TossCoin\nEnd;\n\nFunction Match(first, second: Sequence): Boolean;\n{ Detects whether a sequence of tosses matches another }\nVar\n different: boolean;\n i: integer;\nBegin\n different := false;\n i := 1;\n while (i <= 3) and not different do begin\n if not (first[i] = second[i]) then different := true;\n i := i + 1\n end;\n Match := not different\nEnd;\n\nProcedure PlayRound(var human, computer: Player);\n{ Shows coin tosses and announces the winner }\nVar\n { We only ever need to store the 3 most recent tosses in memory. }\n tosses: Sequence;\nBegin\n { Start with the first three tosses }\n write('Tossing the coin: ');\n tosses := RandomSequence;\n ShowSequence(tosses);\n { Keep tossing the coin until there is a winner. }\n while not (Match(human.bet, tosses) or Match(computer.bet, tosses)) do begin\n tosses[1] := tosses[2];\n tosses[2] := tosses[3];\n tosses[3] := TossCoin;\n PutToss(tosses[3])\n end;\n { Update the winner's score and announce the winner }\n writeln;\n writeln;\n if Match(human.bet, tosses) then begin\n writeln('Congratulations! You won this round.');\n human.score := human.score + 1;\n writeln('Your new score is ', human.score, '.')\n end\n else begin\n writeln('Yay, I won this round!');\n computer.score := computer.score + 1;\n writeln('My new score is ', computer.score, '.')\n end\nEnd;\n\n{ Main Algorithm }\n\nBEGIN\n\n { Welcome the player }\n writeln('Welcome to Penney''s game!');\n writeln;\n write('How many rounds would you like to play? ');\n readln(Rounds);\n writeln;\n writeln('Ok, let''s play ', Rounds, ' rounds.');\n\n { Start the game }\n randomize;\n Human.score := 0;\n Computer.score := 0;\n\n for Count := 1 to Rounds do begin\n\n writeln;\n writeln('*** Round #', Count, ' ***');\n writeln;\n\n { Choose someone randomly to pick the first sequence }\n if TossCoin = heads then begin\n write('I''ll pick first this time.');\n Computer.bet := RandomSequence;\n write(' My sequence is ');\n ShowSequence(Computer.bet);\n writeln('.');\n repeat\n write('What sequence do you want? ');\n ReadSequence(Human.bet);\n if Match(Human.bet, Computer.bet) then\n writeln('Hey, that''s my sequence! Think for yourself!')\n until not Match(Human.bet, Computer.bet);\n ShowSequence(Human.bet);\n writeln(', huh? Sounds ok to me.')\n end\n else begin\n write('You pick first this time. Enter 3 letters H or T: ');\n ReadSequence(Human.bet);\n Computer.bet := Optimum(Human.bet);\n write('Ok, so you picked ');\n ShowSequence(Human.bet);\n writeln;\n write('My sequence will be ');\n ShowSequence(Computer.bet);\n writeln\n end;\n\n { Then we can actually play the round }\n writeln('Let''s go!');\n writeln;\n PlayRound(Human, Computer);\n writeln;\n writeln('Press ENTER to go on...');\n readln\n\n end;\n\n { All the rounds are finished; time to decide who won }\n writeln;\n writeln('*** End Result ***');\n writeln;\n if Human.score > Computer.score then writeln('Congratulations! You won!')\n else if Computer.score > Human.score then writeln('Hooray! I won')\n else writeln('Cool, we tied.');\n writeln;\n writeln('Press ENTER to finish.');\n readln\n\nEND.\n","language":"Pascal"},{"code":"#!usr/bin/perl\nuse 5.020;\nuse strict;\nuse warnings;\n\n#Choose who goes first\nbinaryRand() == 0 ? flipCoin(userFirst()) : flipCoin(compFirst());\n\n#Return a randomly generated 1 or 0\nsub binaryRand\n{\n return int(rand(2));\n}\n#Converts 1's and 0's to H's and T's, respectively.\nsub convert\n{\n my $randNum = binaryRand();\n if($randNum == 0)\n {\n return \"T\"\n }\n else\n {\n return \"H\";\n }\n}\n\n#Prompts for and returns a user's sequence of 3\nsub uSeq\n{\n print(\"Please enter a sequence of 3 of \\\"H\\\" and \\\"T\\\". EG: HHT\\n>\");\n my $uString = <STDIN>;\n\n while(1)\n {\n #Make it uppercase and validate input\n chomp($uString);\n $uString = uc $uString;\n #Check length and content (H's and T's only!)\n if(length $uString == 3 && (substr($uString, 0, 1) =~ /[HT]/ &&\n substr($uString, 1, 1) =~ /[HT]/ &&\n substr($uString, 2, 1) =~ /[HT]/))\n {\n last;\n }\n else\n {\n print(\"Error, try again. \\n\");\n print(\"Please enter a sequence of 3 of \\\"H\\\" and \\\"T\\\". EG: HHT\\n\");\n $uString = <STDIN>;\n }\n }\n return $uString;\n}\n\n#Returns an array with two elements: [0] user's seq, [1] random computer seq.\nsub compFirst\n{\n my $cSeq;\n #Randomly draw a sequence of 3\n for(my $i = 0; $i < 3; $i++)\n {\n $cSeq = $cSeq . convert();\n }\n\n print(\"The computer guesses first:\\ncomp- $cSeq\\n\");\n my $uSeq = uSeq();\n print(\"user- $uSeq\\n\");\n my @seqArr = ($uSeq, $cSeq);\n return @seqArr;\n}\n\n#Returns an array with two elements: [0] user's seq, [1] optimal computer seq.\nsub userFirst\n{\n print(\"The user quesses first:\\n\");\n my $uSeq = uSeq();\n my $cSeq;\n #Generate the optimal sequence based on $uSeq\n my $middle = substr($uSeq, 1, 1);\n $middle eq \"H\" ? $cSeq = \"T\" : $cSeq = \"H\";\n $cSeq = $cSeq . substr($uSeq, 0, 2);\n\n print(\"user- $uSeq\\ncomp- $cSeq\\n\");\n my @seqArr = ($uSeq, $cSeq);\n return @seqArr;\n}\n\n#Flips a coin, checking both sequences against the contents of the given array\nsub flipCoin\n{\n my ($uSeq, $cSeq) = @_;\n my $coin;\n while(1)\n {\n $coin = $coin . convert();\n if($coin =~ m/$uSeq/)\n {\n print(\"The sequence of tosses was: $coin\\n\");\n say(\"The player wins! \");\n last;\n }\n elsif($coin =~ m/$cSeq/)\n {\n print(\"The sequence of tosses was: $coin\\n\");\n say(\"The computer wins! \");\n last;\n }\n }\n}\n","language":"Perl"},{"code":"function trio(integer pick)\n return substitute_all(sprintf(\"%03b\",pick),\"10\",\"HT\")\nend function\n\nfunction getuser(integer bot)\ninteger user\n while 1 do\n user = 8 -- (a bit that clears after 3 shifts)\n printf(1,\"Enter your sequence of 3 (H/T):\");\n while user>7 do\n integer c = upper(wait_key())\n if c=#1B then abort(0) end if -- (Escape)\n if find(c,\"HT\") then\n puts(1,c)\n user = and_bits(user*2+(c='H'),0b111111)\n end if\n end while\n if user!=bot then exit end if\n printf(1,\"\\nYou may not pick the same as Robort!\\n\")\n end while\n printf(1,\"\\n\")\n return user\nend function\n\nfunction getbot(int user)\n int bot = iff(user=-1?rand(8)-1\n :4-and_bits(user,2)*2+floor(user/2))\n printf(1,\"Robort picks %s\\n\", {trio(bot)})\n return bot\nend function\n\nfunction rungame(integer user, bot)\n /* We only need to store the last 3 tosses, as 0..7 */\n int last3 = rand(8)-1\n\n printf(1,\"Rolling: %s\",{trio(last3)})\n while 1 do\n if user=last3 then\n printf(1,\"\\nUser wins!\\n\")\n return 1\n elsif bot=last3 then\n printf(1,\"\\nRobort wins!\\n\")\n return 0\n end if\n last3 = and_bits(last3,3)*2+(rand(2)=1)\n printf(1,\"%c\", iff(and_bits(last3,1) ? 'H' : 'T'))\n sleep(0.5)\n end while\nend function\n\nprocedure main()\n integer playerwins = 0,\n totalgames = 0,\n robortwins = 0\n\n /* Just use ctrl-c or Escape to exit */\n while 1 do\n integer user = -1,\n bot = -1\n\n printf(1,\"\\n\")\n if rand(2)=1 then\n bot = getbot(-1)\n user = getuser(bot)\n else\n user = getuser(-1)\n bot = getbot(user)\n end if\n\n playerwins += rungame(user, bot)\n totalgames += 1\n robortwins = totalgames-playerwins\n\n printf(1,\"Robort:%d You:%d out of %d games\\n\",\n {robortwins, playerwins, totalgames})\n printf(1,\"==================================\\n\")\n end while\n\nend procedure\nmain()\n","language":"Phix"},{"code":"(seed (in \"/dev/urandom\" (rd 8)))\n\n(setq *S (list 0 0))\n\n(de toss (N)\n (make\n (do N\n (link (if (rand T) \"T\" \"H\")) ) ) )\n\n(de comp (A Lst)\n (or\n (for ((I . L) Lst (cddr L) (cdr L))\n (T (fully = A L) I) )\n T ) )\n\n(de score NIL\n (prinl)\n (prinl \"Total score:\")\n (prinl \"^Iuser: \" (car *S))\n (prinl \"^Icomp: \" (cadr *S)) )\n\n(de play NIL\n (let (C (toss 3) Lst (toss (rand 5 12)) U)\n (prinl)\n (prin \"Select toss: \")\n (setq U (in NIL (skip) (line)))\n (prinl \"Comp toss: \" C)\n (prinl \"Toss: \" Lst)\n (setq @ (comp U Lst) @@ (comp C Lst) )\n (cond\n ((< @ @@) (prinl \"User win.\") (inc *S))\n ((> @ @@) (prinl \"Comp win.\") (inc (cdr *S)))\n (T (prinl \"Draw, lets play again.\")) )\n (score) ) )\n\n(de go NIL\n (loop\n (play)\n (T\n (prog\n (prinl)\n (prin \"Want play again? Y/N: \")\n (= \"N\" (uppc (in NIL (char)))) ) ) ) )\n\n(go)\n","language":"PicoLisp"},{"code":"play :- rand1(R), game(R).\n\ngame(h) :-\n format('Your turn first!~n'), player_move(P),\n response(P,C), format('I am choosing '), maplist(writec, C), nl,\n rand3(R), maplist(writec,R),\n roll(P, C, R).\n\ngame(t) :-\n rand3(C),\n format('I am choosing '), maplist(writec, C), nl,\n player_move(P),\n rand3(R), maplist(writec, R),\n roll(P, C, R).\n\nplayer_move([P1,P2,P3]) :-\n read_line_to_codes(user_input,Codes),\n maplist(char_code,[P1,P2,P3],Codes).\n\nroll(P, _, P) :- format('~nYou Win!~n'), !.\nroll(_, C, C) :- format('~nI Win!~n'), !.\n\nroll(P, C, [_,A,B]) :-\n rand1(R),\n coin_s(R,S),\n write(S),\n roll(P,C,[A,B,R]).\n\nresponse([A,B,_], [C,A,B]) :- opp(A,C).\n\nwritec(A) :- coin_s(A,A1), write(A1).\nrand1(R) :- random(V), round(V,I), coin(I,R).\nrand3([R1,R2,R3]) :- rand1(R1), rand1(R2), rand1(R3).\n\ncoin(0,h). coin(1,t).\ncoin_s(h, 'H'). coin_s(t, 'T').\nopp(h, t). opp(t, h).\n","language":"Prolog"},{"code":"from __future__ import print_function\nimport random\nfrom time import sleep\n\nfirst = random.choice([True, False])\n\nyou = ''\nif first:\n me = ''.join(random.sample('HT'*3, 3))\n print('I choose first and will win on first seeing {} in the list of tosses'.format(me))\n while len(you) != 3 or any(ch not in 'HT' for ch in you) or you == me:\n you = input('What sequence of three Heads/Tails will you win with: ')\nelse:\n while len(you) != 3 or any(ch not in 'HT' for ch in you):\n you = input('After you: What sequence of three Heads/Tails will you win with: ')\n me = ('H' if you[1] == 'T' else 'T') + you[:2]\n print('I win on first seeing {} in the list of tosses'.format(me))\n\nprint('Rolling:\\n ', end='')\nrolled = ''\nwhile True:\n rolled += random.choice('HT')\n print(rolled[-1], end='')\n if rolled.endswith(you):\n print('\\n You win!')\n break\n if rolled.endswith(me):\n print('\\n I win!')\n break\n sleep(1) # For dramatic effect\n","language":"Python"},{"code":" [ 2 random iff char H else char T ] is flip ( --> c )\n\n [ 3 times flip join join ] is randstart ( --> $ )\n\n [ -1 split drop\n dup -1 peek\n char T = iff char H else char T\n swap join ] is beststart ( $ --> $ )\n\n [ stack ] is playergoal ( --> s )\n [ stack ] is computergoal ( --> s )\n\n [ say \"This is Penney's game.\"\n cr cr\n say \"We each guess a different \"\n say \"sequence of three coin \"\n say \"flips.\"\n cr\n say \"I will releatedly flip \"\n say \"a coin until one of the \"\n say \"sequences happens.\"\n cr\n say \"The winner is the one who \"\n say \"guesses the sequence that \"\n say \"happens first.\"\n cr cr\n say \"Please enter your sequence \"\n say \"carefully as there is no \"\n say \"error checking.\"\n cr\n say 'For example, for \"heads '\n say 'tails heads\" type \"HTH\".'\n cr cr ] is intro ( --> )\n\n [ intro\n randomise\n flip char H = iff\n [ say \"I start. My guess is: \"\n randstart dup echo$\n computergoal put\n cr\n $ \"Please enter your guess: \"\n input playergoal put ]\n else\n [ say \"You start. \"\n $ \"Please enter your guess: \"\n input dup playergoal put\n beststart dup\n say \"I guess: \" echo$\n computergoal put\n cr ]\n cr\n $ \"\"\n [ flip join\n dup -3 split nip dup\n computergoal share = iff\n [ drop say \"I win.\" ] done\n playergoal share = iff\n [ say \"You win.\" ] done\n again ]\n cr\n say \"The complete sequence was: \"\n echo$ cr\n computergoal release\n playergoal release ] is play ( --> )\n","language":"Quackery"},{"code":"#===============================================================\n# Penney's Game Task from Rosetta Code Wiki\n# R implementation\n#===============================================================\n\npenneysgame <- function() {\n\n #---------------------------------------------------------------\n # Who goes first?\n #---------------------------------------------------------------\n\n first <- sample(c(\"PC\", \"Human\"), 1)\n\n #---------------------------------------------------------------\n # Determine the sequences\n #---------------------------------------------------------------\n\n if (first == \"PC\") { # PC goes first\n\n pc.seq <- sample(c(\"H\", \"T\"), 3, replace = TRUE)\n cat(paste(\"\\nI choose first and will win on first seeing\", paste(pc.seq, collapse = \"\"), \"in the list of tosses.\\n\\n\"))\n human.seq <- readline(\"What sequence of three Heads/Tails will you win with: \")\n human.seq <- unlist(strsplit(human.seq, \"\"))\n\n } else if (first == \"Human\") { # Player goest first\n\n cat(paste(\"\\nYou can choose your winning sequence first.\\n\\n\"))\n human.seq <- readline(\"What sequence of three Heads/Tails will you win with: \")\n human.seq <- unlist(strsplit(human.seq, \"\")) # Split the string into characters\n pc.seq <- c(human.seq[2], human.seq[1:2]) # Append second element at the start\n pc.seq[1] <- ifelse(pc.seq[1] == \"H\", \"T\", \"H\") # Switch first element to get the optimal guess\n cat(paste(\"\\nI win on first seeing\", paste(pc.seq, collapse = \"\"), \"in the list of tosses.\\n\"))\n\n }\n\n #---------------------------------------------------------------\n # Start throwing the coin\n #---------------------------------------------------------------\n\n cat(\"\\nThrowing:\\n\")\n\n ran.seq <- NULL\n\n while(TRUE) {\n\n ran.seq <- c(ran.seq, sample(c(\"H\", \"T\"), 1)) # Add a new coin throw to the vector of throws\n\n cat(\"\\n\", paste(ran.seq, sep = \"\", collapse = \"\")) # Print the sequence thrown so far\n\n if (length(ran.seq) >= 3 && all(tail(ran.seq, 3) == pc.seq)) {\n cat(\"\\n\\nI win!\\n\")\n break\n }\n\n if (length(ran.seq) >= 3 && all(tail(ran.seq, 3) == human.seq)) {\n cat(\"\\n\\nYou win!\\n\")\n break\n }\n\n Sys.sleep(0.5) # Pause for 0.5 seconds\n\n }\n}\n","language":"R"},{"code":"#lang racket\n;; Penney's Game. Tim Brown 2014-10-15\n(define (flip . _) (match (random 2) (0 \"H\") (1 \"T\")))\n\n(define (get-human-sequence) ; no sanity checking here!\n (display \"choose your winning sequence of 3 H or T > \")\n (drop-right (drop (string-split (string-upcase (read-line)) \"\") 1) 1))\n\n(define flips->string (curryr string-join \".\"))\n\n(define (game-on p1 p2)\n (printf \"~a chooses: ~a. ~a chooses: ~a~%\"\n (car p1) (flips->string (cdr p1)) (car p2) (flips->string (cdr p2)))\n (match-define (list (list name.1 p1.1 p1.2 p1.3) (list name.2 p2.1 p2.2 p2.3)) (list p1 p2))\n (let turn ((seq null))\n (match seq\n [(list-rest (== p1.3) (== p1.2) (== p1.1) _) name.1]\n [(list-rest (== p2.3) (== p2.2) (== p2.1) _) name.2]\n [else\n (let* ((flp (flip)) (seq+ (cons flp else)))\n (printf \"new-flip: ~a -> ~a~%\" flp (flips->string (reverse seq+))) (turn seq+))])))\n\n(define (play-game)\n (define-values\n (player-1 player-2)\n (match (flip)\n [\"H\" (printf \"Human chooses first: \")\n (define p1 (cons 'Hom-Sap (get-human-sequence)))\n (values p1 (cons 'Computer\n (match p1\n [(list _ f1 (and f2 (app (match-lambda (\"H\" \"T\") (\"T\" \"H\")) ¬f2)) _)\n (list ¬f2 f1 f2)])))]\n [\"T\" (printf \"Computer chooses first. \")\n (define p1 (cons 'Computer (build-list 3 flip)))\n (printf \"~a chooses: ~a~%\" (car p1) (flips->string (cdr p1)))\n (values p1 (cons 'Hom-Sap (get-human-sequence)))]))\n (printf \"~a wins!~%\" (game-on player-1 player-2)))\n","language":"Racket"},{"code":"enum Coin <Heads Tails>;\nenum Yay <Yay Good Super Hah Ooh Yipee Sweet Cool Yes Haha>;\nenum Boo <Drat Darn Crumb Oops Rats Bah Criminy Argh Shards>;\nenum Bozo «'Dude' 'Cha' 'Bzzt' 'Hey' 'Silly dilly' 'Say what!?' 'You numbskull'»;\n\nsub flipping {\n for 1..4 {\n print \"-\\b\"; sleep .1;\n print \"\\\\\\b\"; sleep .1;\n print \"|\\b\"; sleep .1;\n print \"/\\b\"; sleep .1;\n }\n}\n\nsub your-choice($p is copy) {\n loop (my @seq; @seq != 3; $p = \"{Bozo.pick}! Please pick exactly 3: \") {\n @seq = prompt($p).uc.comb(/ H | T /).map: {\n when 'H' { Heads }\n when 'T' { Tails }\n }\n }\n @seq;\n}\n\nrepeat until prompt(\"Wanna play again? \").lc ~~ /^n/ {\n my $mefirst = Coin.roll;\n print tc \"$mefirst I start, {Coin(+!$mefirst).lc} you start, flipping...\\n\\t\";\n flipping;\n say my $flip = Coin.roll;\n\n my @yours;\n my @mine;\n\n if $flip == $mefirst {\n print \"{Yay.pick}! I get to choose first, and I choose: \"; sleep 2; say @mine = |Coin.roll(3);\n @yours = your-choice(\"Now you gotta choose: \");\n while @yours eqv @mine {\n say \"{Bozo.pick}! We'd both win at the same time if you pick that!\";\n @yours = your-choice(\"Pick something different from me: \");\n }\n say \"So, you'll win if we see: \", @yours;\n }\n else {\n @yours = your-choice(\"{Boo.pick}! First you choose: \");\n say \"OK, you'll win if we see: \", @yours;\n print \"In that case, I'll just randomly choose: \"; sleep 2; say @mine = Coin(+!@yours[1]), |@yours[0,1];\n }\n\n sub check($a,$b,$c) {\n given [$a,$b,$c] {\n when @mine { say \"\\n{Yay.pick}, I win, and you lose!\"; Nil }\n when @yours { say \"\\n{Boo.pick}, you win, but I'll beat you next time!\"; Nil }\n default { Coin.roll }\n }\n }\n\n sleep 1;\n say < OK! Ready? Right... So... Yo!>.pick;\n sleep .5;\n say (\"Pay attention now!\",\n \"Watch closely!\",\n \"Let's do it...\",\n \"You feeling lucky?\",\n \"No way you gonna win this...\",\n \"Can I borrow that coin again?\").pick;\n sleep 1;\n print \"Here we go!\\n\\t\";\n for |Coin.roll(3), &check ...^ :!defined {\n flipping;\n print \"$_ \";\n }\n}\n","language":"Raku"},{"code":"/*REXX program plays/simulates Penney's Game, a two─player coin toss sequence game. */\n__= copies('─', 9) /*literal for eye─catching fence. */\nsignal on halt /*a clean way out if CLBF quits. */\nparse arg # seed . /*obtain optional arguments from the CL*/\nif #=='' | #==\",\" then #= 3 /*Not specified? Then use the default.*/\nif datatype(seed,'W') then call random ,,seed /*use seed for RANDOM #s repeatability.*/\nwins=0; do games=1 /*simulate a number of Penney's games. */\n call game /*simulate a single inning of a game. */\n end /*games*/ /*keep at it until QUIT or halt. */\nexit /*stick a fork in it, we're all done. */\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nhalt: say; say __ \"Penney's Game was halted.\"; say; exit 13\nr: arg ,$; do arg(1); $=$ || random(100, 9991) // 2; end; return $\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's',1) /*pluralizer.*/\n/*──────────────────────────────────────────────────────────────────────────────────────*/\ngame: @.=; tosses=@. /*the coin toss sequence so far. */\n toss1= r(1) /*result: 0=computer, 1=CBLF.*/\n if \\toss1 then call randComp /*maybe let the computer go first*/\n if toss1 then say __ \"You win the first toss, so you pick your sequence first.\"\n else say __ \"The computer won first toss, the pick was: \" @.comp\n call prompter /*get the human's guess from C.L.*/\n call randComp /*get computer's guess if needed.*/\n /*CBLF: carbon-based life form. */\n say __ \" your pick:\" @.CBLF /*echo human's pick to terminal. */\n say __ \"computer's pick:\" @.comp /* \" comp.'s \" \" \" */\n say /* [↓] flip the coin 'til a win.*/\n do flips=1 until pos(@.CBLF, tosses)\\==0 | pos(@.comp, tosses)\\==0\n tosses= tosses || translate( r(1), 'HT', 10)\n end /*flips*/ /* [↑] this is a flipping coin,*/\n /* [↓] series of tosses*/\n say __ \"The tossed coin series was: \" tosses\n say\n @@@=\"won this toss with \" flips ' coin tosses.'\n if pos(@.CBLF,tosses)\\==0 then do; say __ \"You\" @@@; wins=wins+1; end\n else say __ \"The computer\" @@@\n _=wins; if _==0 then _='no'\n say __ \"You've won\" _ \"game\"s(wins) 'out of ' games\".\"\n say; say copies('╩╦', 79 % 2)'╩'; say\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nprompter: oops= __ 'Oops! '; a= /*define some handy REXX literals*/\n @a_z= 'ABCDEFG-IJKLMNOPQRS+UVWXYZ' /*the extraneous alphabetic chars*/\n p=__ 'Pick a sequence of' # \"coin tosses of H or T (Heads or Tails) or Quit:\"\n do until ok; say; say p; pull a /*uppercase the answer. */\n if abbrev('QUIT', a, 1) then exit 1 /*the human wants to quit. */\n a= space( translate(a,,@a_z',./\\;:_'), 0) /*elide extraneous characters. */\n b= translate(a, 10, 'HT'); L= length(a) /*translate ───► bin; get length.*/\n ok= 0 /*the response is OK (so far). */\n select /*verify the user response. */\n when \\datatype(b, 'B') then say oops \"Illegal response.\"\n when \\datatype(a, 'M') then say oops \"Illegal characters in response.\"\n when L==0 then say oops \"No choice was given.\"\n when L<# then say oops \"Not enough coin choices.\"\n when L># then say oops \"Too many coin choices.\"\n when a==@.comp then say oops \"You can't choose the computer's\" ,\n \"choice: \" @.comp\n otherwise ok= 1\n end /*select*/\n end /*until ok*/\n @.CBLF= a; @.CBLF!= b /*we have the human's guess now. */\n return\n/*──────────────────────────────────────────────────────────────────────────────────────*/\nrandComp: if @.comp\\=='' then return /*the computer already has a pick*/\n _= @.CBLF! /* [↓] use best-choice algorithm.*/\n if _\\=='' then g= left((\\substr(_, min(2, #), 1))left(_, 1)substr(_, 3), #)\n do until g\\==@.CBLF!; g= r(#); end /*otherwise, generate a choice. */\n @.comp= translate(g, 'HT', 10)\n return\n","language":"REXX"},{"code":"Toss = [:Heads, :Tails]\n\ndef yourChoice\n puts \"Enter your choice (H/T)\"\n choice = []\n 3.times do\n until (c = $stdin.getc.upcase) == \"H\" or c == \"T\"\n end\n choice << (c==\"H\" ? Toss[0] : Toss[1])\n end\n puts \"You chose #{choice.join(' ')}\"\n choice\nend\n\nloop do\n puts \"\\n%s I start, %s you start ..... %s\" % [*Toss, coin = Toss.sample]\n if coin == Toss[0]\n myC = Toss.shuffle << Toss.sample\n puts \"I chose #{myC.join(' ')}\"\n yC = yourChoice\n else\n yC = yourChoice\n myC = Toss - [yC[1]] + yC.first(2)\n puts \"I chose #{myC.join(' ')}\"\n end\n\n seq = Array.new(3){Toss.sample}\n print seq.join(' ')\n loop do\n puts \"\\n I win!\" or break if seq == myC\n puts \"\\n You win!\" or break if seq == yC\n seq.push(Toss.sample).shift\n print \" #{seq[-1]}\"\n end\nend\n","language":"Ruby"},{"code":"extern crate rand;\n\nuse std::io::{stdin, stdout, Write};\nuse std::thread;\nuse std::time::Duration;\n\nuse rand::Rng;\n\nfn toss_coin<R: Rng>(rng: &mut R, print: bool) -> char {\n let c = if rng.gen() { 'H' } else { 'T' };\n if print {\n print!(\"{}\", c);\n stdout().flush().expect(\"Could not flush stdout\");\n }\n c\n}\n\nfn gen_sequence<R: Rng>(rng: &mut R, seed: Option<&str>) -> String {\n let mut seq = String::new();\n match seed {\n Some(s) => {\n let mut iter = s.chars();\n let c0 = iter.next().unwrap();\n let next = if c0 == 'H' { 'T' } else { 'H' };\n seq.push(next);\n seq.push(c0);\n seq.push(iter.next().unwrap());\n }\n None => {\n for _ in 0..3 {\n seq.push(toss_coin(rng, false))\n }\n }\n }\n seq\n}\n\nfn read_sequence(used_seq: Option<&str>) -> String {\n let mut seq = String::new();\n loop {\n seq.clear();\n println!(\"Please, enter sequence of 3 coins: H (heads) or T (tails): \");\n stdin().read_line(&mut seq).expect(\"failed to read line\");\n seq = seq.trim().to_uppercase();\n // do the cheapest test first\n if seq.len() == 3\n && seq.chars().all(|c| c == 'H' || c == 'T')\n && seq != used_seq.unwrap_or(\"\")\n {\n return seq;\n }\n\n println!(\"Please enter correct sequence!\");\n }\n}\n\nfn main() {\n let mut rng = rand::thread_rng();\n\n println!(\"--Penney's game--\");\n loop {\n let useq: String;\n let aiseq: String;\n if rng.gen::<bool>() {\n println!(\"You choose first!\");\n useq = read_sequence(None);\n println!(\"Your sequence: {}\", useq);\n aiseq = gen_sequence(&mut rng, Some(&useq));\n println!(\"My sequence: {}\", aiseq);\n } else {\n println!(\"I choose first!\");\n aiseq = gen_sequence(&mut rng, None);\n println!(\"My sequence: {}\", aiseq);\n useq = read_sequence(Some(&aiseq));\n println!(\"Your sequence: {}\", useq);\n }\n println!(\"Tossing coins...\");\n let mut coins = String::new();\n for _ in 0..2 {\n // toss first 2 coins\n coins.push(toss_coin(&mut rng, true));\n thread::sleep(Duration::from_millis(500));\n }\n loop {\n coins.push(toss_coin(&mut rng, true));\n thread::sleep(Duration::from_millis(500));\n if coins.contains(&useq) {\n println!(\"\\nYou win!\");\n break;\n }\n if coins.contains(&aiseq) {\n println!(\"\\nI win!\");\n break;\n }\n }\n\n println!(\" Play again? 'Y' to play, 'Q' to exit.\");\n let mut input = String::new();\n stdin().read_line(&mut input).expect(\"failed to read line\");\n match input.trim_start().chars().next().unwrap() {\n 'Y' | 'y' => continue,\n _ => break,\n }\n }\n}\n","language":"Rust"},{"code":" 10 IF RND>=.5 THEN GOTO 100\n 20 PRINT \"YOU PICK FIRST.\"\n 30 INPUT P$\n 40 PRINT \"YOU CHOSE \";P$\n 50 LET C$=\"H\"\n 60 IF P$(2)=\"H\" THEN LET C$=\"T\"\n 70 LET C$=C$+P$( TO 2)\n 80 PRINT \"I CHOOSE \";C$\n 90 GOTO 190\n100 PRINT \"I PICK FIRST.\"\n110 LET C$=\"\"\n120 FOR I=1 TO 3\n130 LET C$=C$+\"H\"\n140 IF RND>=.5 THEN LET C$(I)=\"T\"\n150 NEXT I\n160 PRINT \"I CHOOSE \";C$\n170 INPUT P$\n180 PRINT \"YOU CHOSE \";P$\n190 LET G$=\"\"\n200 IF RND>=.5 THEN GOTO 230\n210 LET G$=G$+\"H\"\n220 GOTO 240\n230 LET G$=G$+\"T\"\n240 PRINT AT 5,0;G$\n250 IF LEN G$<3 THEN GOTO 200\n260 IF G$(LEN G$-2 TO )=P$ THEN GOTO 290\n270 IF G$(LEN G$-2 TO )=C$ THEN GOTO 310\n280 GOTO 200\n290 PRINT \"YOU WIN\"\n300 STOP\n310 PRINT \"I WIN\"\n","language":"Sinclair-ZX81-BASIC"},{"code":"package require Tcl 8.6\n\noo::class create Player {\n variable who seq seen idx\n\n constructor {name sequence} {\n\tset who $name\n\tset seq $sequence\n\tset seen {}\n\tset idx end-[expr {[string length $seq] - 1}]\n }\n\n method pick {} {\n\treturn $seq\n }\n\n method name {} {\n\treturn $who\n }\n\n method match {digit} {\n\tappend seen $digit\n\treturn [expr {[string range $seen $idx end] eq $seq}]\n }\n}\n\noo::class create HumanPlayer {\n superclass Player\n constructor {length {otherPlayersSelection \"\"}} {\n\tfconfigure stdout -buffering none\n\twhile true {\n\t puts -nonewline \"What do you pick? (length $length): \"\n\t if {[gets stdin pick] < 0} exit\n\t set pick [regsub -all {[^HT]} [string map {0 H 1 T h H t T} $pick] \"\"]\n\t if {[string length $pick] eq $length} break\n\t puts \"That's not a legal pick!\"\n\t}\n\tset name \"Human\"\n\tif {[incr ::humans] > 1} {append name \" #$::humans\"}\n\tnext $name $pick\n }\n}\n\noo::class create RobotPlayer {\n superclass Player\n constructor {length {otherPlayersSelection \"\"}} {\n\tif {$otherPlayersSelection eq \"\"} {\n\t set pick \"\"\n\t for {set i 0} {$i < $length} {incr i} {\n\t\tappend pick [lindex {H T} [expr {int(rand()*2)}]]\n\t }\n\t} else {\n\t if {$length != 3} {\n\t\terror \"lengths other than 3 not implemented\"\n\t }\n\t lassign [split $otherPlayersSelection \"\"] a b c\n\t set pick [string cat [string map {H T T H} $b] $a $b]\n\t}\n\tset name \"Robot\"\n\tif {[incr ::robots] > 1} {append name \" #$::robots\"}\n\tputs \"$name picks $pick\"\n\tnext $name $pick\n }\n}\n\nproc game {length args} {\n puts \"Let's play Penney's Game!\"\n\n # instantiate the players\n set picks {}\n set players {}\n while {[llength $args]} {\n\tset idx [expr {int(rand()*[llength $args])}]\n\tset p [[lindex $args $idx] new $length {*}$picks]\n\tset args [lreplace $args $idx $idx]\n\tlappend players $p\n\tlappend picks [$p pick]\n }\n\n # sanity check\n if {[llength $picks] != [llength [lsort -unique $picks]]} {\n\tputs \"Two players picked the same thing; that's illegal\"\n }\n\n # do the game loop\n while 1 {\n\tset coin [lindex {H T} [expr {int(rand()*2)}]]\n\tputs \"Coin flip [incr counter] is $coin\"\n\tforeach p $players {\n\t if {[$p match $coin]} {\n\t\tputs \"[$p name] has won!\"\n\t\treturn\n\t }\n\t}\n }\n}\n\ngame 3 HumanPlayer RobotPlayer\n","language":"Tcl"},{"code":"#!/bin/bash\nmain() {\n printf $'Penney\\'s Game\\n\\n'\n printf 'Flipping to see who goes first ... '\n\n if [[ $(flip) == H ]]; then\n printf 'I do.\\n'\n p2=$(choose_sequence)\n printf 'I choose: %s\\n' \"$p2\"\n else\n printf 'You do.\\n'\n fi\n\n while true; do\n read -p 'Enter your three-flip sequence: ' p1\n p1=$(tr a-z A-Z <<<\"$p1\")\n case \"$p1\" in\n \"$p2\") printf 'Sequence must be different from mine\\n';;\n [HT][HT][HT]) break;;\n *) printf $'Sequence must be three H\\'s or T\\'s\\n';;\n esac\n done\n\n if [ -z \"$p2\" ]; then\n p2=$(choose_sequence \"$p1\")\n printf 'I choose: %s\\n' \"$p2\"\n fi\n\n printf '\\nHere we go. %s, you win; %s, I win.\\n' \"$p1\" \"$p2\"\n printf 'Flips:'\n\n flips=\n while true; do\n flip=$(flip)\n printf ' %s' \"$flip\"\n flips+=$flip\n case \"$flips\" in\n *$p1) printf $'\\nYou win!\\n'; exit 0;;\n *$p2) printf $'\\nI win!\\n'; exit 1;;\n esac\n done\n}\n\nchoose_sequence() {\n local result\n if (( $# )); then\n case \"$1\" in\n ?[Hh]?) result=T;;\n *) result=H;;\n esac\n result+=\"${1%?}\"\n else\n result=$(flip)$(flip)$(flip)\n fi\n printf '%s\\n' \"$result\"\n}\n\nflip() {\n if (( RANDOM % 2 )); then\n printf '%s\\n' H\n else\n printf '%s\\n' T\n fi\n}\n\nmain \"$@\"\n","language":"UNIX-Shell"},{"code":"import rand\nimport os\nimport time\n\nconst optimum = {\n\t\"HHH\": \"THH\", \"HHT\": \"THH\", \"HTH\": \"HHT\", \"HTT\": \"HHT\",\n\t\"THH\": \"TTH\", \"THT\": \"TTH\", \"TTH\": \"HTT\", \"TTT\": \"HTT\"\n}\n\nfn main() {\n\tr := rand.intn(2) or {exit(1)}\n\tmut user_seq :=''\n\tmut comp_seq :=''\n\tmut coin :=''\n\tmut coins :=''\n\tmut len := 0\n\tmut seq :=''\n\n\tif r == 0 {\n\t\tprintln(\"You go first\")\n\t\tuser_seq = user_sequence()\n\t\tprintln('\\n')\n\t\tcomp_seq = computer_sequence(user_seq)\n\t}\n\telse {\n\t\tprintln(\"Computer goes first\")\n\t\tcomp_seq = computer_sequence(user_seq)\n\t\tprintln('\\n')\n\t\tuser_seq = user_sequence()\n\t}\n\tprintln('\\n')\n\tfor true {\n\t\tif (rand.intn(2) or {exit(1)}) == 0 {coin = 'H'} else {coin = 'T'}\n\t\tcoins += coin\n\t\tprintln(\"Coins flipped: $coins\")\n\t\tlen = coins.len\n\t\tif len >= 3 {\n\t\t\tseq = coins.substr(len - 3, len)\n\t\t\tif seq == user_seq {\n\t\t\t\tprintln(\"\\nYou win!\")\n\t\t\t\texit(0)\n\t\t\t}\n\t\t\tif seq == comp_seq {\n\t\t\t\tprintln(\"\\nComputer wins!\")\n\t\t\t\texit(0)\n\t\t\t}\n\t\t}\n\t\ttime.sleep(1 * time.second) // extraneous\n\t}\n}\n\nfn user_sequence() string {\n\tmut user_seq :=''\n\tprintln(\"A sequence of three H or T should be entered\")\n\tfor (user_seq.len != 3) || (user_seq.to_upper().split('').any(it != 'H' && it != 'T') == true) {\n\t\tuser_seq = os.input('Enter your sequence: ').str().to_upper()\n\t}\n\treturn user_seq\n}\n\nfn computer_sequence(user_seq string) string {\n\tmut char_array := []string{len:3}\n\tmut comp_seq :=''\n\tif user_seq == '' {\n\t\tfor _ in 0..2 {\n\t\t\tif (rand.intn(2) or {exit(1)}) == 0 {char_array << 'T'} else {char_array << 'H'}\n\t\t\tcomp_seq = char_array.join('')\n\t\t}\n\t}\t\n\telse {\n\t\tcomp_seq = optimum[user_seq]\n\t}\n\tprintln(\"Computer's sequence: $comp_seq\")\n\treturn comp_seq\n}\n","language":"V-(Vlang)"},{"code":"Option Explicit\n\nPrivate Declare Sub Sleep Lib \"kernel32\" (ByVal dwMilliseconds As Long)\nPrivate Const HT As String = \"H T\"\n\nPublic Sub PenneysGame()\nDim S$, YourSeq$, ComputeSeq$, i&, Seq$, WhoWin$, flag As Boolean\n\n Do\n S = WhoWillBeFirst(Choice(\"Who will be first\"))\n If S = \"ABORT\" Then Exit Do\n Debug.Print S; \" start\"\n YourSeq = Choice(\"Your sequence\", 3)\n If YourSeq Like \"*ABORT*\" Then Exit Do\n Debug.Print \"Your sequence : \" & YourSeq\n ComputeSeq = vbNullString\n For i = 1 To 3\n ComputeSeq = ComputeSeq & Random\n Next i\n Debug.Print \"Computer sequence : \" & ComputeSeq\n Seq = vbNullString\n Do\n Seq = Seq & Random\n Debug.Print Seq\n Sleep 1000\n Loop While Not Winner(ComputeSeq, YourSeq, Seq, WhoWin)\n Debug.Print WhoWin; \" win\"\n If MsgBox(WhoWin & \" win\" & vbCrLf & \"Play again?\", vbYesNo) = vbNo Then flag = True\n Debug.Print \"\"\n Loop While Not flag\n Debug.Print \"Game over\"\nEnd Sub\n\nPrivate Function WhoWillBeFirst(YourChoice As String) As String\nDim S$\n S = Random\n Select Case YourChoice\n Case \"ABORT\": WhoWillBeFirst = YourChoice\n Case Else:\n WhoWillBeFirst = IIf(S = YourChoice, \"You\", \"Computer\")\n End Select\nEnd Function\n\nPrivate Function Choice(Title As String, Optional Seq As Integer) As String\nDim S$, i&, t$\n If Seq = 0 Then Seq = 1\n t = Title\n For i = 1 To Seq\n S = vbNullString\n Do\n S = InputBox(\"Choose between H or T : \", t)\n If StrPtr(S) = 0 Then S = \"Abort\"\n S = UCase(S)\n Loop While S <> \"H\" And S <> \"T\" And S <> \"ABORT\"\n Choice = Choice & S\n t = Title & \" \" & Choice\n If Choice Like \"*ABORT*\" Then Exit For\n Next i\nEnd Function\n\nPrivate Function Random() As String\nRandomize Timer\n Random = Split(HT, \" \")(CInt(Rnd))\nEnd Function\n\nPrivate Function Winner(Cs$, Ys$, S$, W$) As Boolean\n If Len(S) < 3 Then\n Winner = False\n Else\n If Right(S, 3) = Cs And Right(S, 3) = Ys Then\n Winner = True\n W = \"Computer & you\"\n ElseIf Right(S, 3) = Cs And Right(S, 3) <> Ys Then\n Winner = True\n W = \"Computer\"\n ElseIf Right(S, 3) = Ys And Right(S, 3) <> Cs Then\n Winner = True\n W = \"You\"\n End If\n End If\nEnd Function\n","language":"VBA"},{"code":"import \"random\" for Random\nimport \"io\" for Stdin, Stdout\nimport \"timer\" for Timer\nimport \"./str\" for Str\n\nvar rand = Random.new()\n\nvar optimum = {\n \"HHH\": \"THH\", \"HHT\": \"THH\", \"HTH\": \"HHT\", \"HTT\": \"HHT\",\n \"THH\": \"TTH\", \"THT\": \"TTH\", \"TTH\": \"HTT\", \"TTT\": \"HTT\"\n}\n\nvar getUserSequence = Fn.new {\n System.print(\"A sequence of three H or T should be entered\")\n var userSeq\n while (true) {\n System.write(\"Enter your sequence: \")\n Stdout.flush()\n userSeq = Str.upper(Stdin.readLine())\n if (userSeq.count == 3 && userSeq.all { |c| c == \"H\" || c == \"T\" }) break\n }\n return userSeq\n}\n\nvar getComputerSequence = Fn.new { |userSeq|\n var compSeq\n if (userSeq == \"\") {\n var chars = List.filled(3, null)\n for (i in 0..2) chars[i] = (rand.int(2) == 0) ? \"T\" : \"H\"\n compSeq = chars.join()\n } else {\n compSeq = optimum[userSeq]\n }\n System.print(\"Computer's sequence: %(compSeq)\")\n return compSeq\n}\n\nvar userSeq\nvar compSeq\nvar r = rand.int(2)\nif (r == 0) {\n System.print(\"You go first\")\n userSeq = getUserSequence.call()\n System.print()\n compSeq = getComputerSequence.call(userSeq)\n} else {\n System.print(\"Computer goes first\")\n compSeq = getComputerSequence.call(\"\")\n System.print()\n userSeq = getUserSequence.call()\n}\nSystem.print()\nvar coins = \"\"\nwhile (true) {\n var coin = (rand.int(2) == 0) ? \"H\" : \"T\"\n coins = coins + coin\n System.print(\"Coins flipped: %(coins)\")\n var len = coins.count\n if (len >= 3) {\n var seq = coins[len-3...len]\n if (seq == userSeq) {\n System.print(\"\\nYou win!\")\n return\n } else if (seq == compSeq) {\n System.print(\"\\nCompter wins!\")\n return\n }\n }\n Timer.sleep(2000) // wait two seconds for next flip\n}\n","language":"Wren"},{"code":"fcn coinToss{ (0).random(2) and \"H\" or \"T\" } // (0).random(2) --> 0<=r<2\nreg myBet, yourBet;\nif(coinToss()==\"H\"){ // The toss says I go first\n myBet=(3).pump(String,coinToss);\n println(\"I bet \",myBet);\n yourBet=ask(\"Your bet of three (H/T): \")[0,3].toUpper();\n}else{\n yourBet=ask(\"Your bet of three (H/T): \")[0,3].toUpper();\n myBet=((yourBet[1]==\"H\") and \"T\" or \"H\") + yourBet[0,2];\n println(\"I bet \",myBet);\n}\nprint(\"Flipping: \"); coins:=\"\";\nwhile(1){\n print(toss:=coinToss()); coins=coins + toss;\n if(Void!=coins.find(yourBet)){ println(\" You win!\"); break; }\n if(Void!=coins.find(myBet)) { println(\" I win!\"); break; }\n // ignore we both won\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Penney's_game\\nnote: Games\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"[[wp:Penney's_game|Penney's game]] is a game where two players bet on being the first to see a particular sequence of [[wp:Coin_flipping|heads or tails]] in consecutive tosses of a [[wp:Fair_coin|fair coin]].\\n\\nIt is common to agree on a sequence length of three then one player will openly choose a sequence, for example:\\n Heads, Tails, Heads, or '''HTH''' for short.\\nThe other player on seeing the first players choice will choose his sequence. The coin is tossed and the first player to see his sequence in the sequence of coin tosses wins.\\n\\n\\n;Example:\\nOne player might choose the sequence '''HHT''' and the other '''THT'''. \\n\\nSuccessive coin tosses of '''HTTHT''' gives the win to the second player as the last three coin tosses are his sequence.\\n\\n\\n;Task\\nCreate a program that tosses the coin, keeps score and plays Penney's game against a human opponent.\\n* Who chooses and shows their sequence of three should be chosen randomly.\\n* If going first, the computer should randomly choose its sequence of three.\\n* If going second, the computer should automatically play [[wp:Penney's_game#Analysis_of_the_three-bit_game|the optimum sequence]].\\n* Successive coin tosses should be shown.\\n\\n<br>\\nShow output of a game where the computer chooses first and a game where the user goes first here on this page.\\n\\n\\n;See also\\n* [https://www.youtube.com/watch?v=OcYnlSenF04 The Penney Ante Part 1] (Video).\\n* [https://www.youtube.com/watch?v=U9wak7g5yQA The Penney Ante Part 2] (Video).\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"V first = random:choice([1B, 0B])\\n\\nV you = ‘’\\nV me = ‘’\\nV ht = ‘HT’ // to get round ‘bug in MSVC 2017’[https://developercommunity.visualstudio.com/t/bug-with-operator-in-c/565417]\\nI first\\n me = random:sample(Array(‘HT’ * 3), 3).join(‘’)\\n print(‘I choose first and will win on first seeing #. in the list of tosses’.format(me))\\n L you.len != 3 | any(you.map(ch -> ch !C :ht)) | you == me\\n you = input(‘What sequence of three Heads/Tails will you win with: ’)\\nE\\n L you.len != 3 | any(you.map(ch -> ch !C :ht))\\n you = input(‘After you: What sequence of three Heads/Tails will you win with: ’)\\n me = (I you[1] == ‘T’ {‘H’} E ‘T’)‘’you[0.<2]\\n print(‘I win on first seeing #. in the list of tosses’.format(me))\\n\\nprint(\\\"Rolling:\\\\n \\\", end' ‘’)\\nV rolled = ‘’\\nL\\n rolled ‘’= random:choice(‘HT’)\\n print(rolled.last, end' ‘’)\\n I rolled.ends_with(you)\\n print(\\\"\\\\n You win!\\\")\\n L.break\\n I rolled.ends_with(me)\\n print(\\\"\\\\n I win!\\\")\\n L.break\\n sleep(1)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <jambo.h>\\n\\n#define Getanuppercasecharinto(_X_) Getchar(_X_),Let( _X_ := Ucase(_X_) )\\n#define Isnotvalidin(_X_) Not( Occurs in (_X_) )\\n#define NOELIGEPCDESPUESDETI 0\\n#define ELIGEPCDESPUESDETI 1\\n\\nMain\\n Set break\\n Get total args\\n If ( Is equal to '2' )\\n largo=0\\n Let ( largo := Get if( Argnum(2) Is less than '3', 3, Argnum(2) ) )\\n OTRO=\\\"S\\\"\\n\\n Cursor off\\n Loop\\n P=\\\"\\\", C=\\\"\\\", S=\\\"\\\", L=0\\n Cls\\n Locate(1,1), Printnl (\\\"***** Penney's Game *****\\\")\\n\\n If ( Geq( Rand(1), 0.5) )\\n Gosub ' Yo tiro ', Set 'NO ELIGE PC DESPUES DE TI',Gosub ' Tú tiras '\\n Else\\n Set 'ELIGE PC DESPUES DE TI', Gosub ' Tú tiras '\\n End If\\n\\n // a jugar:\\n G=\\\"\\\", SW=1\\n Loop\\n Let( G := Cat( G, Get if( Geq( Rand(1), 0.5), \\\"T\\\", \\\"H\\\" ) ) )\\n Locate( 6, 1 ), Printnl( \\\"Tiradas: \\\", G )\\n\\n Continue if ( Less ( Len (G) ---Backup to 'L'---, 3) )\\n\\n Let ( S := Right( Sub(L, Minus one 'largo') , G) )\\n\\n If ( Eq( S, P ) )\\n Set (\\\"TU GANAS!!\\\"), SW=0\\n Else If (Eq( S, C ) )\\n Set (\\\"YO GANO!!\\\"), SW=0\\n End If\\n Prnl\\n Sleep(1)\\n Back if( SW ) is not zero\\n Printnl ( Utf8(\\\"¿Otro juego? S/* \\\") )\\n Getchar(OTRO)\\n While( Eq (OTRO, \\\"S\\\") )\\n\\n Cursor on\\n Else\\n Printnl(\\\"Modo de uso: hopper penny.jambo <n>\\\\ndonde \\\\\\\"n\\\\\\\" es el largo de la secuencia\\\")\\n End If\\nEnd\\n\\nSubrutines\\n\\nDefine ' Yo tiro '\\n Locate(4,1), Print( \\\"Yo elijo... \\\" )\\n i=largo\\n Loop\\n Let( C := Cat( C, Get if( Geq( Rand(1), 0.5), \\\"T\\\", \\\"H\\\" ) ) )\\n --i\\n Back if (i) is positive\\n Printnl (C)\\n\\nReturn\\n\\nDefine ' Tú tiras, elige pc '\\n Locate(3,1), Printnl ( Utf8(\\\"Tú eliges...\\\") )\\n i=largo, c=0\\n Loop\\n Get an uppercase char into 'c'\\n Continue if ( var(c) Is not valid in (\\\"HT\\\") )\\n Let( P:=Cat(P,c) )\\n Loccol(13), Printnl(P)\\n --i\\n Back if (i) is positive\\n\\n If ( elige pc )\\n Let (C := P)\\n [2] Get from (C)\\n Set if( Is equal to (\\\"H\\\"), \\\"T\\\", \\\"H\\\" )\\n Cput (C)\\n Locate(4,1), Print( \\\"Yo elijo... \\\", C )\\n End If\\nReturn\\n\",\n \"language\": \"Amazing-Hopper\"\n },\n {\n \"code\": \" 100 R = RND ( - 1 * ( PEEK (78) + 256 * PEEK (79))): REM RANDOMIZE\\n 110 DEF FN R(R) = INT ( RND (1) * R) * (3 ^ (R = 8)) + 1\\n 120 READ P$\\n 130 DATA HTHHHHHHTHTTTHHTHTTTHTTT\\n 140 LET M$ = CHR$ (13)\\n 150 PRINT \\\"WELCOME TO PENNEY'S GAME!\\\"M$\\n 160 INPUT \\\"HOW MANY ROUNDS WOULD YOU LIKE TO PLAY? \\\";ROUNDS%\\n 170 PRINT M$\\\"OK, LET'S PLAY \\\"ROUNDS%\\\" ROUNDS.\\\"\\n 180 FOR COUNT = 1 TO ROUNDS%\\n 190 PRINT M$\\\"*** ROUND #\\\"COUNT\\\" ***\\\"M$\\n 200 ON FN R(2) GOSUB 300,400\\n 210 PRINT \\\"LET'S GO!\\\"M$\\n 220 GOSUB 450\\\"PLAY ROUND\\n 230 INPUT \\\"PRESS RETURN TO GO ON...\\\";N$\\n 240 NEXT COUNT\\n 250 PRINT M$\\\"*** END RESULT ***\\\"M$\\n 260 IF YOU > ME THEN PRINT \\\"CONGRATULATIONS! YOU WON!\\\"\\n 270 IF ME > YOU THEN PRINT \\\"HOORAY! I WON\\\"\\n 280 IF ME = YOU THEN PRINT \\\"COOL, WE TIED.\\\"\\n 290 END\\n\\n 300 ME$ = MID$ (P$, FN R(8),3): REM RANDOM SEQUENCE\\n 310 PRINT \\\"I'LL PICK FIRST THIS TIME.\\\"M$\\\" MY SEQUENCE IS \\\"ME$\\\".\\\"\\n 320 FOR REP = 0 TO 1 STEP 0\\n 330 PRINT \\\"WHAT SEQUENCE DO YOU WANT?\\\"\\n 340 GOSUB 590\\\"GET YOUR SEQUENCE\\n 350 LET REP = YOU$ < > ME$\\n 360 IF NOT REP THEN PRINT \\\"HEY, THAT'S MY SEQUENCE! THINK FOR YOURSELF!\\\"\\n 370 NEXT REP\\n 380 PRINT YOU$\\\", HUH? SOUNDS OK TO ME.\\\"\\n 390 RETURN\\n\\n 400 PRINT \\\"YOU PICK FIRST THIS TIME.\\\"\\n 410 GOSUB 590\\\"GET YOUR SEQUENCE\\n 420 LET ME$ = MID$ (\\\"HT\\\",( MID$ (YOU$,2,1) = \\\"H\\\") + 1,1) + LEFT$ (YOU$,2)\\n 430 PRINT \\\"OK, SO YOU PICKED \\\"YOU$M$M$\\\"MY SEQUENCE WILL BE \\\"ME$M$\\n 440 RETURN\\n\\n 450 T0SSE$ = MID$ (P$, FN R(8),3): REM RANDOM SEQUENCE\\n 460 PRINT \\\"TOSSING THE COIN: \\\"M$ MID$ (T0SSE$,2);\\n 470 FOR T0SS = 0 TO 1 STEP 0\\n 480 LET T0SSE$ = RIGHT$ (T0SSE$,2) + MID$ (\\\"HT\\\", FN R(2),1)\\n 490 PRINT MID$ (T0SSE$,3);\\n 500 IF YOU$ = T0SSE$ THEN 530\\\"YOU WON\\n 510 IF ME$ = T0SSE$ THEN 560\\\"I WON\\n 520 NEXT T0SS\\n\\n 530 YOU = YOU + 1\\n 540 PRINT M$M$\\\"CONGRATULATIONS! YOU WON THIS ROUND.\\\"M$\\\"YOUR NEW SCORE IS \\\"YOU\\\".\\\"\\n 550 RETURN\\n\\n 560 ME = ME + 1\\n 570 PRINT M$M$\\\"YAY, I WON THIS ROUND!\\\"M$\\\"MY NEW SCORE IS \\\"ME\\\".\\\"\\n 580 RETURN\\n\\n 590 YOU$ = \\\"\\\"\\n 600 PRINT \\\"TYPE 3 LETTERS H OR T: \\\"\\n 610 FOR I = 1 TO 3\\n 620 LET V$ = \\\"HT\\\"\\n 630 GOSUB 670\\\"GET VALID KEYPRESS\\n 640 LET YOU$ = YOU$ + C$\\n 650 NEXT I\\n 660 LET V$ = M$ + M$\\n 670 FOR C = 0 TO 1 STEP 0\\n 680 GET C$\\n 690 IF ASC (C$) > 95 THEN C$ = CHR$ ( ASC (C$) - 32)\\n 700 LET C = C$ = LEFT$ (V$,1) OR C$ = MID$ (V$,2)\\n 710 NEXT C\\n 720 PRINT C$;\\n 730 RETURN\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"Gui, font, s12\\nGui, add, text, w90, Computer:\\nloop, 3\\n\\tGui, add, button, x+10 h30 w30 vCB%A_Index%\\nGui, add, edit, xs w240 R3 vSequence\\nGui, add, text, w90, Human:\\nloop, 3\\n\\tGui, add, button, x+10 h30 w30 vHB%A_Index% gHumButton, H\\nGui, add, button, xm gToss, toss\\nGui, add, button, x+10 gReset, Reset\\nGui, show,, Penney's game\\nCompSeq := HumSeq := Seq := GameEnd := \\\"\\\"\\n\\nRandomStart:\\nRandom, WhoStarts, 1, 2\\nif (WhoStarts=1)\\n\\tgosub, CompButton\\nreturn\\n;-----------------------------------------------\\nCompButton:\\nif CompSeq\\n\\treturn\\nLoop, 3\\n{\\n\\tRandom, coin, 1, 2\\n\\tGuiControl,, CB%A_Index%, % coin=1?\\\"H\\\":\\\"T\\\"\\n\\tCompSeq .= coin=1?\\\"H\\\":\\\"T\\\"\\n}\\nreturn\\n;-----------------------------------------------\\nHumButton:\\nif HumSeq\\n\\treturn\\nGuiControlGet, B,, % A_GuiControl\\nGuiControl,, % A_GuiControl, % B=\\\"H\\\"?\\\"T\\\":\\\"H\\\"\\nreturn\\n;-----------------------------------------------\\nToss:\\nif GameEnd\\n\\treturn\\nif !HumSeq\\n{\\n\\tloop 3\\n\\t{\\n\\t\\tGuiControlGet, B,, HB%A_Index%\\n\\t\\tHumSeq .= B\\n\\t}\\n\\tif (CompSeq = HumSeq)\\n\\t{\\n\\t\\tMsgBox, 262160, Penney's game, Human's Selection Has to be different From Computer's Selection`nTry Again\\n\\t\\tHumSeq := \\\"\\\"\\n\\t\\treturn\\n\\t}\\n}\\nif !CompSeq\\n{\\n\\tCompSeq := (SubStr(HumSeq,2,1)=\\\"H\\\"?\\\"T\\\":\\\"H\\\") . SubStr(HumSeq,1,2)\\n\\tloop, Parse, CompSeq\\n\\t\\tGuiControl,, CB%A_Index%, % A_LoopField\\n}\\n\\nRandom, coin, 1, 2\\nSeq .= coin=1?\\\"H\\\":\\\"T\\\"\\nGuiControl,, Sequence, % seq\\nif (SubStr(Seq, -2) = HumSeq)\\n\\tMsgBox % GameEnd := \\\"Human Wins\\\"\\nelse if (SubStr(Seq, -2) = CompSeq)\\n\\tMsgBox % GameEnd := \\\"Computer Wins\\\"\\nreturn\\n;-----------------------------------------------\\nReset:\\nloop, 3\\n{\\n\\tGuiControl,, CB%A_Index%\\n\\tGuiControl,, HB%A_Index%, H\\n}\\nGuiControl,, Sequence\\nCompSeq := HumSeq := Seq := GameEnd := \\\"\\\"\\ngosub, RandomStart\\nreturn\\n;-----------------------------------------------\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"global jugador, computador, secuencia\\njugador = \\\"\\\" : computador = \\\"\\\"\\n\\nfunction SecuenciaJugador(secuencia)\\n\\tdo\\n\\t\\tvalido = TRUE\\n\\t\\tprint chr(10) + \\\"Ingresa una secuencia de 3 opciones, cada una de ellas H o T:\\\";\\n\\t\\tinput \\\" > \\\", secuencia\\n\\t\\tsecuencia = upper(secuencia)\\n\\t\\tif length(secuencia) <> 3 then valido = FALSE\\n\\t\\tif secuencia = computador then print \\\"Pero no la misma que yo...\\\"+ chr(10): valido = FALSE\\n\\t\\tif valido then\\n\\t\\t\\tfor i = 1 to 3\\n\\t\\t\\t\\topcion = mid(secuencia, i, 1)\\n\\t\\t\\t\\tif opcion <> \\\"H\\\" and opcion <> \\\"T\\\" then valido = FALSE\\n\\t\\t\\tnext i\\n\\t\\tend if\\n\\tuntil valido\\n\\tSecuenciaJugador = secuencia\\nend function\\n\\nfunction LanzamientoCPU()\\n\\tsecuencia = \\\"\\\"\\n\\tcomputador =\\\"\\\"\\n\\tfor i = 1 to 3\\n\\t\\topcion = rand\\n\\t\\tif opcion < .5 then secuencia += \\\"H\\\" else secuencia += \\\"T\\\"\\n\\tnext i\\n\\tLanzamientoCPU = secuencia\\nend function\\n\\ndo\\n\\tcls\\n\\tprint \\\"*** Penney's Game ***\\\" + chr(10)\\n\\tif rand < .5 then\\n\\t\\tprint \\\"Empiezas... \\\";\\n\\t\\tjugador = SecuenciaJugador(jugador)\\n\\t\\tcomputador = LanzamientoCPU()\\n\\t\\tif jugador = computador then computador = LanzamientoCPU()\\n\\t\\tprint \\\"Yo gano al ver \\\"; computador; \\\" por primera vez en la lista de lanzamientos...\\\"\\n\\telse\\n\\t\\tcomputador = LanzamientoCPU()\\n\\t\\tprint \\\"Elijo primero y gano al ver \\\"; computador; \\\" por primera vez en la lista de lanzamientos...\\\"\\n\\t\\tjugador = SecuenciaJugador(jugador)\\n\\tend if\\nprint: print \\\"Lanzamientos...\\\"\\n\\tsecuencia = \\\"\\\"\\n\\twinner = FALSE\\n\\tdo\\n\\t\\tpause 1\\n\\t\\tif rand <= .5 then\\n\\t\\t\\tsecuencia += \\\"H\\\"\\n\\t\\t\\tprint \\\"H \\\";\\n\\t\\telse\\n\\t\\t\\tprint \\\"T \\\";\\n\\t\\t\\tsecuencia += \\\"T\\\"\\n\\t\\tend if\\n\\t\\tif right(secuencia, 3) = jugador then print: print \\\"¡Felicidades! ¡Ganaste!\\\": winner = TRUE\\n\\t\\tif right(secuencia, 3) = computador then print: print \\\"¡Yo gano!\\\": winner = TRUE\\n\\tuntil winner\\n\\tdo\\n\\t\\tvalido = FALSE\\n\\t\\tprint\\n\\t\\tinput \\\"¿Otra partida? (S/N) \\\", otra\\n\\t\\tif instr(\\\"SsNn\\\", otra) then valido = TRUE\\n\\tuntil valido\\nuntil upper(otra) = \\\"N\\\"\\nprint \\\"¡Gracias por jugar!\\\"\\nend\\n\",\n \"language\": \"BASIC256\"\n },\n {\n \"code\": \"::\\n::Penney's Game Task from Rosetta Code Wiki\\n::Batch File Implementation\\n::\\n::Please Directly Open the Batch File to play...\\n::\\n\\n@echo off\\nsetlocal enabledelayedexpansion\\ntitle The Penney's Game Batch File\\n\\nset cpu=0&set you=0\\ncls\\necho.\\necho Penney's Game\\necho Batch File Implementation\\n\\n:main\\nset you_bet=&set cpu_bet=\\necho.&echo --------------------------------------------------------&echo.\\necho CPU's Score: %cpu% Your Score: %you%\\necho.\\n<nul set /p \\\"dummy=Heads I start, Tails you start...\\\"\\nset /a startrnd=%random%%%2\\nset firsttoss=Tails&set func=optimal\\nif %startrnd%==1 (set firsttoss=Heads&set func=rndbet)\\nping -n 3 localhost >nul\\n<nul set /p \\\"dummy=. %firsttoss%^!\\\"\\necho.&echo.\\ngoto %func%\\n\\n:rndbet\\nset /a \\\"seq1=%random%%%2\\\",\\\"seq2=%random%%%2\\\",\\\"seq3=%random%%%2\\\"\\nset binary=%seq1%%seq2%%seq3%\\nset cpu_bet=%binary:1=H%\\nset cpu_bet=%cpu_bet:0=T%\\necho I will bet first. So, my bet sequence will be %cpu_bet%.\\n:again1\\nset /p \\\"you_bet=What will be your bet sequence? \\\"\\ncall :validate again1\\necho.&echo So, you're feeling lucky on %you_bet%. We'll see...\\ngoto succesivetossing\\n\\n:optimal\\necho Ok. You will bet first.\\n:again2\\nset /p \\\"you_bet=What will be your bet sequence? \\\"\\ncall :validate again2\\nset seq1=%you_bet:~0,1%&set seq2=%you_bet:~1,1%\\nset new_seq1=T\\nif /i %seq2%==T set new_seq1=H\\nset cpu_bet=%new_seq1%%seq1%%seq2%\\necho.&echo Hmm... My bet will be %cpu_bet%. We'll see who's lucky...\\n\\n:succesivetossing\\nset toses=&set cnt=0\\necho.\\n<nul set /p \\\"dummy=Tosses: \\\"\\n:tossloop\\ncall :tossgen\\n<nul set /p dummy=%toss%\\nping -n 2 localhost >nul\\nset /a newline=%cnt%%%60\\nif %newline%==59 (\\necho.\\n<nul set /p \\\"dummy=. \\\"\\n)\\nif \\\"%toses:~-3,3%\\\"==\\\"%cpu_bet%\\\" goto iwin\\nif \\\"%toses:~-3,3%\\\"==\\\"%you_bet%\\\" goto uwin\\nset /a cnt+=1&goto tossloop\\n\\n:tossgen\\nset /a rand=%random%%%2\\nset toss=T\\nif %rand%==0 set toss=H\\nset toses=%toses%%toss%\\ngoto :EOF\\n\\n:iwin\\nset /a cpu+=1&set newgame=\\necho.&echo.\\necho I Win^^! Better Luck Next Time...\\necho.\\nset /p \\\"newgame=[Type Y if U Wanna Beat Me, or Else, Exit...] \\\"\\nif /i \\\"!newgame!\\\"==\\\"Y\\\" goto :main\\nexit\\n\\n:uwin\\nset /a you+=1&set newgame=\\necho.&echo.\\necho Argh, You Win^^! ...But One Time I'll Beat You.\\necho.\\nset /p \\\"newgame=[Type Y for Another Game, or Else, Exit...] \\\"\\nif /i \\\"!newgame!\\\"==\\\"Y\\\" goto :main\\nexit\\n\\n:validate\\necho \\\"!you_bet!\\\"|findstr /r /c:\\\"^\\\\\\\"[hHtT][hHtT][hHtT]\\\\\\\"$\\\">nul || (\\n\\techo [Invalid Input...]&echo.&goto %1\\n)\\nif /i \\\"!you_bet!\\\"==\\\"%cpu_bet%\\\" (echo [Bet something different...]&echo.&goto %1)\\nfor %%i in (\\\"t=T\\\" \\\"h=H\\\") do set \\\"you_bet=!you_bet:%%~i!\\\"\\ngoto :EOF\\n\",\n \"language\": \"Batch-File\"\n },\n {\n \"code\": \"REM >penney\\nPRINT \\\"*** Penney's Game ***\\\"\\nREPEAT\\n PRINT ' \\\"Heads you pick first, tails I pick first.\\\"\\n PRINT \\\"And it is... \\\";\\n WAIT 100\\n ht% = RND(0 - TIME) AND 1\\n IF ht% THEN\\n PRINT \\\"heads!\\\"\\n PROC_player_chooses(player$)\\n computer$ = FN_optimal(player$)\\n PRINT \\\"I choose \\\"; computer$; \\\".\\\"\\n ELSE\\n PRINT \\\"tails!\\\"\\n computer$ = FN_random\\n PRINT \\\"I choose \\\"; computer$; \\\".\\\"\\n PROC_player_chooses(player$)\\n ENDIF\\n PRINT \\\"Starting the game...\\\" ' SPC 5;\\n sequence$ = \\\"\\\"\\n winner% = FALSE\\n REPEAT\\n WAIT 100\\n roll% = RND AND 1\\n IF roll% THEN\\n sequence$ += \\\"H\\\"\\n PRINT \\\"H \\\";\\n ELSE\\n PRINT \\\"T \\\";\\n sequence$ += \\\"T\\\"\\n ENDIF\\n IF RIGHT$(sequence$, 3) = computer$ THEN\\n PRINT ' \\\"I won!\\\"\\n winner% = TRUE\\n ELSE\\n IF RIGHT$(sequence$, 3) = player$ THEN\\n PRINT ' \\\"Congratulations! You won.\\\"\\n winner% = TRUE\\n ENDIF\\n ENDIF\\n UNTIL winner%\\n REPEAT\\n valid% = FALSE\\n INPUT \\\"Another game? (Y/N) \\\" another$\\n IF INSTR(\\\"YN\\\", another$) THEN valid% = TRUE\\n UNTIL valid%\\nUNTIL another$ = \\\"N\\\"\\nPRINT \\\"Thank you for playing!\\\"\\nEND\\n:\\nDEF PROC_player_chooses(RETURN sequence$)\\nLOCAL choice$, valid%, i%\\nREPEAT\\n valid% = TRUE\\n PRINT \\\"Enter a sequence of three choices, each of them either H or T:\\\"\\n INPUT \\\"> \\\" sequence$\\n IF LEN sequence$ <> 3 THEN valid% = FALSE\\n IF valid% THEN\\n FOR i% = 1 TO 3\\n choice$ = MID$(sequence$, i%, 1)\\n IF choice$ <> \\\"H\\\" AND choice$ <> \\\"T\\\" THEN valid% = FALSE\\n NEXT\\n ENDIF\\nUNTIL valid%\\nENDPROC\\n:\\nDEF FN_random\\nLOCAL sequence$, choice%, i%\\nsequence$ = \\\"\\\"\\nFOR i% = 1 TO 3\\n choice% = RND AND 1\\n IF choice% THEN sequence$ += \\\"H\\\" ELSE sequence$ += \\\"T\\\"\\nNEXT\\n= sequence$\\n:\\nDEF FN_optimal(sequence$)\\nIF MID$(sequence$, 2, 1) = \\\"H\\\" THEN\\n = \\\"T\\\" + LEFT$(sequence$, 2)\\nELSE\\n = \\\"H\\\" + LEFT$(sequence$, 2)\\nENDIF\\n\",\n \"language\": \"BBC-BASIC\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n\\n#define SEQLEN 3\\n\\nint getseq(char *s)\\n{\\n int r = 0;\\n int i = 1 << (SEQLEN - 1);\\n\\n while (*s && i) {\\n switch (*s++) {\\n case 'H':\\n case 'h':\\n r |= i;\\n break;\\n case 'T':\\n case 't':\\n /* 0 indicates tails, this is 0, so do nothing */\\n break;\\n default:\\n return -1;\\n }\\n i >>= 1;\\n }\\n\\n return r;\\n}\\n\\nvoid printseq(int seq)\\n{\\n int i;\\n for (i = SEQLEN - 1; i >= 0; --i)\\n printf(\\\"%c\\\", seq & (1 << i) ? 'h' : 't');\\n}\\n\\nint getuser(void)\\n{\\n int user;\\n char s[SEQLEN + 1];\\n\\n printf(\\\"Enter your sequence of %d (h/t): \\\", SEQLEN);\\n while (1) {\\n /* This needs to be manually changed if SEQLEN is changed */\\n if (scanf(\\\"%3s\\\", s) != 1) exit(1);\\n if ((user = getseq(s)) != -1) return user;\\n printf(\\\"Please enter only h/t characters: \\\");\\n }\\n}\\n\\nint getai(int user)\\n{\\n int ai;\\n\\n printf(\\\"Computers sequence of %d is: \\\", SEQLEN);\\n /* The ai's perfect choice will only be perfect for SEQLEN == 3 */\\n if (user == -1)\\n ai = rand() & (1 << SEQLEN) - 1;\\n else\\n ai = (user >> 1) | ((~user << 1) & (1 << SEQLEN - 1));\\n\\n printseq(ai);\\n printf(\\\"\\\\n\\\");\\n return ai;\\n}\\n\\nint rungame(int user, int ai)\\n{\\n /* Generate first SEQLEN flips. We only need to store the last SEQLEN\\n * tosses at any one time. */\\n int last3 = rand() & (1 << SEQLEN) - 1;\\n\\n printf(\\\"Tossed sequence: \\\");\\n printseq(last3);\\n while (1) {\\n if (user == last3) {\\n printf(\\\"\\\\nUser wins!\\\\n\\\");\\n return 1;\\n }\\n\\n if (ai == last3) {\\n printf(\\\"\\\\nAi wins!\\\\n\\\");\\n return 0;\\n }\\n\\n last3 = ((last3 << 1) & (1 << SEQLEN) - 2) | (rand() & 1);\\n printf(\\\"%c\\\", last3 & 1 ? 'h' : 't');\\n }\\n}\\n\\nint main(void)\\n{\\n srand(time(NULL));\\n int playerwins = 0;\\n int totalgames = 0;\\n\\n /* Just use ctrl-c for exit */\\n while (1) {\\n int user = -1;\\n int ai = -1;\\n\\n printf(\\\"\\\\n\\\");\\n if (rand() & 1) {\\n ai = getai(user);\\n user = getuser();\\n }\\n else {\\n user = getuser();\\n ai = getai(user);\\n }\\n\\n playerwins += rungame(user, ai);\\n totalgames++;\\n\\n printf(\\\"You have won %d out of %d games\\\\n\\\", playerwins, totalgames);\\n printf(\\\"=================================\\\\n\\\");\\n }\\n\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <time.h>\\n#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nclass penney\\n{\\npublic:\\n penney()\\n { pW = cW = 0; }\\n void gameLoop()\\n {\\n\\tstring a;\\n\\twhile( true )\\n\\t{\\n\\t playerChoice = computerChoice = \\\"\\\";\\n\\t if( rand() % 2 )\\n\\t { computer(); player(); }\\n\\t else\\n\\t { player(); computer(); }\\n\\n\\t play();\\n\\n\\t cout << \\\"[Y] to play again \\\"; cin >> a;\\n\\t if( a[0] != 'Y' && a[0] != 'y' )\\n\\t {\\n\\t\\tcout << \\\"Computer won \\\" << cW << \\\" times.\\\" << endl << \\\"Player won \\\" << pW << \\\" times.\\\";\\n\\t\\tbreak;\\n\\t }\\n\\t cout << endl << endl;\\n }\\n }\\nprivate:\\n void computer()\\n {\\n if( playerChoice.length() == 0 )\\n\\t{\\n\\t for( int x = 0; x < 3; x++ )\\n\\t\\tcomputerChoice.append( ( rand() % 2 ) ? \\\"H\\\" : \\\"T\\\", 1 );\\t\\n\\t}\\n\\telse\\n\\t{\\n\\t computerChoice.append( playerChoice[1] == 'T' ? \\\"H\\\" : \\\"T\\\", 1 );\\n\\t computerChoice += playerChoice.substr( 0, 2 );\\n\\t}\\n\\tcout << \\\"Computer's sequence of three is: \\\" << computerChoice << endl;\\n }\\n void player()\\n {\\n\\tcout << \\\"Enter your sequence of three (H/T) \\\"; cin >> playerChoice;\\n }\\n void play()\\n {\\n\\tsequence = \\\"\\\";\\n\\twhile( true )\\n\\t{\\n\\t sequence.append( ( rand() % 2 ) ? \\\"H\\\" : \\\"T\\\", 1 );\\n\\t if( sequence.find( playerChoice ) != sequence.npos )\\n\\t {\\n\\t\\tshowWinner( 1 );\\n\\t\\tbreak;\\n\\t }\\n\\t else if( sequence.find( computerChoice ) != sequence.npos )\\n\\t {\\n\\t\\tshowWinner( 0 );\\n\\t\\tbreak;\\n\\t }\\n\\t}\\n }\\n void showWinner( int i )\\n {\\n\\tstring s;\\n\\tif( i ) { s = \\\"Player wins!\\\"; pW++; }\\n\\telse { s = \\\"Computer wins!\\\"; cW++; }\\n\\tcout << \\\"Tossed sequence: \\\" << sequence << endl << s << endl << endl;\\n }\\n string playerChoice, computerChoice, sequence;\\n int pW, cW;\\n};\\nint main( int argc, char* argv[] )\\n{\\n srand( static_cast<unsigned>( time( NULL ) ) );\\n penney game; game.gameLoop();\\n return 0;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using static System.Console;\\nusing static System.Threading.Thread;\\nusing System;\\n\\npublic static class PenneysGame\\n{\\n const int pause = 500;\\n const int N = 3;\\n static Random rng = new Random();\\n\\n static int Toss() => rng.Next(2);\\n\\n static string AsString(this int sequence) {\\n string s = \\\"\\\";\\n for (int b = 0b100; b > 0; b >>= 1) {\\n s += (sequence & b) > 0 ? 'T' : 'H';\\n }\\n return s;\\n }\\n\\n static int UserInput() {\\n while (true) {\\n switch (ReadKey().Key) {\\n case ConsoleKey.Escape: return -1;\\n case ConsoleKey.H: return 0;\\n case ConsoleKey.T: return 1;\\n }\\n Console.Write('\\\\b');\\n }\\n }\\n\\n public static void Main2() {\\n int yourScore = 0, myScore = 0;\\n while (true) {\\n WriteLine($\\\"Your score: {yourScore}, My score: {myScore}\\\");\\n WriteLine(\\\"Determining who goes first...\\\");\\n Sleep(pause);\\n bool youStart = Toss() == 1;\\n WriteLine(youStart ? \\\"You go first.\\\" : \\\"I go first.\\\");\\n int yourSequence = 0, mySequence = 0;\\n if (youStart) {\\n WriteLine(\\\"Choose your sequence of (H)eads and (T)ails (or press Esc to exit)\\\");\\n int userChoice;\\n for (int i = 0; i < N; i++) {\\n if ((userChoice = UserInput()) < 0) return;\\n yourSequence = (yourSequence << 1) + userChoice;\\n }\\n mySequence = ((~yourSequence << 1) & 0b100) | (yourSequence >> 1);\\n } else {\\n for (int i = 0; i < N; i++) {\\n mySequence = (mySequence << 1) + Toss();\\n }\\n\\n WriteLine(\\\"I chose \\\" + mySequence.AsString());\\n do {\\n WriteLine(\\\"Choose your sequence of (H)eads and (T)ails (or press Esc to exit)\\\");\\n int choice;\\n yourSequence = 0;\\n for (int i = 0; i < N; i++) {\\n if ((choice = UserInput()) < 0) return;\\n yourSequence = (yourSequence << 1) + choice;\\n }\\n if (yourSequence == mySequence) {\\n WriteLine();\\n WriteLine(\\\"You cannot choose the same sequence.\\\");\\n }\\n } while (yourSequence == mySequence);\\n }\\n\\n WriteLine();\\n WriteLine($\\\"Your sequence: {yourSequence.AsString()}, My sequence: {mySequence.AsString()}\\\");\\n WriteLine(\\\"Tossing...\\\");\\n int sequence = 0;\\n for (int i = 0; i < N; i++) {\\n Sleep(pause);\\n int toss = Toss();\\n sequence = (sequence << 1) + toss;\\n Write(toss > 0 ? 'T' : 'H');\\n }\\n while (true) {\\n if (sequence == yourSequence) {\\n WriteLine();\\n WriteLine(\\\"You win!\\\");\\n yourScore++;\\n break;\\n } else if (sequence == mySequence) {\\n WriteLine();\\n WriteLine(\\\"I win!\\\");\\n myScore++;\\n break;\\n }\\n Sleep(pause);\\n int toss = Toss();\\n sequence = ((sequence << 1) + toss) & 0b111;\\n Write(toss > 0 ? 'T' : 'H');\\n }\\n WriteLine(\\\"Press a key.\\\");\\n ReadKey();\\n Clear();\\n }\\n }\\n\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"(ns penney.core\\n (:gen-class))\\n\\n(def heads \\\\H)\\n(def tails \\\\T)\\n\\n(defn flip-coin []\\n (let [flip (rand-int 2)]\\n (if (= flip 0) heads tails)))\\n\\n(defn turn [coin]\\n (if (= coin heads) tails heads))\\n\\n(defn first-index [combo coll]\\n (some #(if (= (second %) combo) (first %)) coll))\\n\\n(defn find-winner [h c]\\n (if (< h c)\\n (do (println \\\"YOU WIN!\\\\n\\\") :human)\\n (do (println \\\"COMPUTER WINS!\\\\n\\\") :computer)))\\n\\n(defn flip-off [human comp]\\n (let [flips (repeatedly flip-coin)\\n idx-flips (map-indexed vector (partition 3 1 flips))\\n h (first-index (seq human) idx-flips)\\n c (first-index (seq comp) idx-flips)]\\n (println (format \\\"Tosses: %s\\\" (apply str (take (+ 3 (min h c)) flips))))\\n (find-winner h c)))\\n\\n(defn valid? [combo]\\n (if (empty? combo) true (and (= 3 (count combo)) (every? #(or (= heads %) (= tails %)) combo))))\\n\\n(defn ask-move []\\n (println \\\"What sequence of 3 Heads/Tails do you choose?\\\")\\n (let [input (clojure.string/upper-case (read-line))]\\n (if-not (valid? input) (recur) input)))\\n\\n(defn optimize-against [combo]\\n (let [mid (nth combo 1)\\n comp (str (turn mid) (first combo) mid)]\\n (println (format \\\"Computer chooses %s: \\\" comp)) comp))\\n\\n(defn initial-move [game]\\n (let [combo (apply str (repeatedly 3 flip-coin))]\\n (println \\\"--------------\\\")\\n (println (format \\\"Current score | CPU: %s, You: %s\\\" (:computer game) (:human game)))\\n (if (= (:first-player game) tails)\\n (do\\n (println \\\"Computer goes first and chooses: \\\" combo)\\n combo)\\n (println \\\"YOU get to go first.\\\"))))\\n\\n(defn play-game [game]\\n (let [c-move (initial-move game)\\n h-move (ask-move)]\\n (if-not (empty? h-move)\\n (let [winner (flip-off h-move (if (nil? c-move) (optimize-against h-move) c-move))]\\n (recur (assoc game winner (inc (winner game)) :first-player (flip-coin))))\\n (println \\\"Thanks for playing!\\\"))))\\n\\n(defn -main [& args]\\n (println \\\"Penney's Game.\\\")\\n (play-game {:first-player (flip-coin)\\n :human 0, :computer 0}))\\n\",\n \"language\": \"Clojure\"\n },\n {\n \"code\": \"(setf *random-state* (make-random-state t))\\n\\n(defparameter *heads* #\\\\H)\\n(defparameter *tails* #\\\\T)\\n\\n(defun main ()\\n (format t \\\"Penney's Game~%~%\\\")\\n (format t \\\"Flipping to see who goes first ...\\\")\\n\\n (setq p2 nil)\\n (if (string= (flip) *heads*)\\n (progn (format t \\\" I do.~%\\\")\\n (setq p2 (choose-random-sequence))\\n (format t \\\"I choose: ~A~%\\\" p2))\\n (format t \\\"You do.~%\\\"))\\n\\n (setq p1 nil)\\n (loop while (null p1) doing\\n (format t \\\"Enter your three-flip sequence: \\\")\\n (setq p1 (string (read)))\\n (cond ((/= (length p1) 3)\\n (format t \\\"Sequence must consist of three flips.~%\\\")\\n (setq p1 nil))\\n ((string= p1 p2)\\n (format t \\\"Sequence must be different from mine.~%\\\")\\n (setq p1 nil))\\n ((notevery #'valid? (coerce p1 'list))\\n (format t \\\"Sequence must be contain only ~A's and ~A's.~%\\\" *heads* *tails*)\\n (setq p1 nil))))\\n (format t \\\"You picked: ~A~%\\\" p1)\\n\\n (if (null p2)\\n (progn\\n (setq p2 (choose-optimal-sequence p1))\\n (format t \\\"I choose: ~A~%\\\" p2)))\\n\\n (format t \\\"Here we go. ~A, you win; ~A, I win.~%\\\" p1 p2)\\n (format t \\\"Flips:\\\")\\n (let ((winner nil)\\n (flips '()))\\n (loop while (null winner) doing\\n (setq flips (cons (flip) flips))\\n (format t \\\" ~A\\\" (car flips))\\n (if (>= (length flips) 3)\\n (let ((trail (coerce (reverse (subseq flips 0 3)) 'string)))\\n (cond ((string= trail p1) (setq winner \\\"You\\\"))\\n ((string= trail p2) (setq winner \\\"I\\\"))))))\\n (format t \\\"~&~A win!\\\" winner)))\\n\\n(defparameter *sides* (list *heads* *tails*))\\n(defun flip () (nth (random 2 *random-state*) *sides*))\\n\\n(defun valid? (flip) (not (null (member flip *sides*))))\\n\\n(defun opposite (flip) (if (string= flip *heads*) *tails* *heads*))\\n\\n(defun choose-random-sequence () (coerce (list (flip) (flip) (flip)) 'string))\\n\\n(defun choose-optimal-sequence (against)\\n (let* ((opposed (coerce against 'list))\\n (middle (cadr opposed))\\n (my-list (list (opposite middle) (car opposed) middle)))\\n (coerce my-list 'string)))\\n\\n(main)\\n\",\n \"language\": \"Common-Lisp\"\n },\n {\n \"code\": \"void main() {\\n import std.stdio, std.random, std.algorithm, std.string,\\n std.conv, std.range, core.thread;\\n\\n immutable first = uniform(0, 2) == 0;\\n\\n string you, me;\\n if (first) {\\n me = 3.iota.map!(_ => \\\"HT\\\"[uniform(0, $)]).text;\\n writefln(\\\"I choose first and will win on first seeing %s in the list of tosses\\\", me);\\n while (you.length != 3 || you.any!(c => !c.among('H', 'T')) || you == me) {\\n \\\"What sequence of three Heads/Tails will you win with: \\\".write;\\n you = readln.strip;\\n }\\n } else {\\n while (you.length != 3 || you.any!(c => !c.among('H', 'T'))) {\\n \\\"After you: What sequence of three Heads/Tails will you win with: \\\".write;\\n you = readln.strip;\\n }\\n me = (you[1] == 'T' ? 'H' : 'T') ~ you[0 .. 2];\\n writefln(\\\"I win on first seeing %s in the list of tosses\\\", me);\\n }\\n\\n \\\"Rolling:\\\\n \\\".write;\\n string rolled;\\n while (true) {\\n rolled ~= \\\"HT\\\"[uniform(0, $)];\\n rolled.back.write;\\n if (rolled.endsWith(you))\\n return \\\"\\\\n You win!\\\".writeln;\\n if (rolled.endsWith(me))\\n return \\\"\\\\n I win!\\\".writeln;\\n Thread.sleep(1.seconds);\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"defmodule Penney do\\n @toss [:Heads, :Tails]\\n\\n def game(score \\\\\\\\ {0,0})\\n def game({iwin, ywin}=score) do\\n IO.puts \\\"Penney game score I : #{iwin}, You : #{ywin}\\\"\\n [i, you] = @toss\\n coin = Enum.random(@toss)\\n IO.puts \\\"#{i} I start, #{you} you start ..... #{coin}\\\"\\n {myC, yC} = setup(coin)\\n seq = for _ <- 1..3, do: Enum.random(@toss)\\n IO.write Enum.join(seq, \\\" \\\")\\n {winner, score} = loop(seq, myC, yC, score)\\n IO.puts \\\"\\\\n #{winner} win!\\\\n\\\"\\n game(score)\\n end\\n\\n defp setup(:Heads) do\\n myC = Enum.shuffle(@toss) ++ [Enum.random(@toss)]\\n joined = Enum.join(myC, \\\" \\\")\\n IO.puts \\\"I chose : #{joined}\\\"\\n {myC, yourChoice}\\n end\\n defp setup(:Tails) do\\n yC = yourChoice\\n myC = (@toss -- [Enum.at(yC,1)]) ++ Enum.take(yC,2)\\n joined = Enum.join(myC, \\\" \\\")\\n IO.puts \\\"I chose : #{joined}\\\"\\n {myC, yC}\\n end\\n\\n defp yourChoice do\\n IO.write \\\"Enter your choice (H/T) \\\"\\n choice = read([])\\n IO.puts \\\"You chose: #{Enum.join(choice, \\\" \\\")}\\\"\\n choice\\n end\\n\\n defp read([_,_,_]=choice), do: choice\\n defp read(choice) do\\n case IO.getn(\\\"\\\") |> String.upcase do\\n \\\"H\\\" -> read(choice ++ [:Heads])\\n \\\"T\\\" -> read(choice ++ [:Tails])\\n _ -> read(choice)\\n end\\n end\\n\\n defp loop(myC, myC, _, {iwin, ywin}), do: {\\\"I\\\", {iwin+1, ywin}}\\n defp loop(yC, _, yC, {iwin, ywin}), do: {\\\"You\\\", {iwin, ywin+1}}\\n defp loop(seq, myC, yC, score) do\\n append = Enum.random(@toss)\\n IO.write \\\" #{append}\\\"\\n loop(tl(seq)++[append], myC, yC, score)\\n end\\nend\\n\\nPenney.game\\n\",\n \"language\": \"Elixir\"\n },\n {\n \"code\": \"USING: arrays ascii io kernel math prettyprint random sequences\\nstrings ;\\nIN: rosetta-code.penneys-game\\n\\n! Generate a random boolean.\\n: t|f ( -- t/f )\\n 1 random-bits 0 = ;\\n\\n! Checks whether the sequence chosen by the human is valid.\\n: valid-input? ( seq -- ? )\\n [ [ CHAR: H = ] [ CHAR: T = ] bi or ] filter length 3 = ;\\n\\n! Prompt the human player for a sequence.\\n: input-seq ( -- seq )\\n \\\"Please input a 3-long sequence of H or T (heads or tails).\\\"\\n print \\\"Example: HTH\\\" print \\\"> \\\" write readln >upper >array ;\\n\\n! Get the human player's input sequence with error checking.\\n: get-input ( -- seq )\\n t [ drop input-seq dup valid-input? not ] loop ;\\n\\n! Add a random coin flip to a vector.\\n: flip-coin ( vector -- vector' )\\n t|f CHAR: H CHAR: T ? over push ;\\n\\n! Generate a random 3-long sequence of coin flips.\\n: rand-seq ( -- seq )\\n V{ } clone 3 [ flip-coin ] times ;\\n\\n! Generate the optimal sequence response to a given sequence.\\n: optimal ( seq1 -- seq2 )\\n [ second dup CHAR: H = [ CHAR: T ] [ CHAR: H ] if ]\\n [ first ] [ second ] tri 3array nip dup\\n \\\"The computer chose \\\" write >string write \\\".\\\" print ;\\n\\n! Choose a random sequence for the computer and report what\\n! was chosen.\\n: computer-first ( -- seq )\\n \\\"The computer picks a sequence first and chooses \\\" write\\n rand-seq dup >string write \\\".\\\" print >array ;\\n\\n! The human is prompted to choose any sequence with no\\n! restrictions.\\n: human-first ( -- seq )\\n \\\"You get to go first.\\\" print get-input ;\\n\\n! Forbid the player from choosing the same sequence as the\\n! computer.\\n: human-second ( cseq -- cseq hseq )\\n get-input [ 2dup = not ]\\n [ drop\\n \\\"You may not choose the same sequence as the computer.\\\"\\n print get-input\\n ] until ;\\n\\n! Display a message introducing the game.\\n: welcome ( -- )\\n \\\"Welcome to Penney's Game. The computer or the player\\\" print\\n \\\"will be randomly selected to choose a sequence of\\\" print\\n \\\"three coin tosses. The sequence will be shown to the\\\" print\\n \\\"opponent, and then he will choose a sequence.\\\" print nl\\n \\\"Then, a coin will be flipped until the sequence\\\" print\\n \\\"matches the last three coin flips, and a winner\\\" print\\n \\\"announced.\\\" print nl ;\\n\\n! Check for human victory.\\n: human-won? ( cseq hseq coin-flips -- ? )\\n 3 tail* >array = nip ;\\n\\n! Check for computer victory.\\n: computer-won? ( cseq hseq coin-flips -- ? )\\n 3 tail* >array pick = 2nip ;\\n\\n! Flip a coin until a victory is detected. Then, inform the\\n! player who won.\\n: flip-coins ( cseq hseq -- )\\n \\\"Flipping coins...\\\" print\\n rand-seq [ 3dup [ human-won? ] [ computer-won? ] 3bi or ]\\n [ flip-coin ] until dup >string print human-won?\\n [ \\\"You won!\\\" print ] [ \\\"The computer won.\\\" print ] if ;\\n\\n! Randomly choose a player to choose their sequence first.\\n! Then play a full round of Penney's Game.\\n: start-game ( -- )\\n welcome t|f [ human-first dup optimal swap ]\\n [ computer-first human-second ] if flip-coins ;\\n\\nstart-game\\n\",\n \"language\": \"Factor\"\n },\n {\n \"code\": \"Sub Jugador_elige(secuencia As String)\\n Dim As String eleccion\\n Dim As Byte valido, i\\n Do\\n valido = True\\n Print !\\\"\\\\nIngresa una secuencia de 3 opciones, cada una de ellas H o T:\\\";\\n Input \\\" > \\\", secuencia\\n If Len(secuencia) <> 3 Then valido = False\\n If valido Then\\n For i = 1 To 3\\n eleccion = Mid(Ucase(secuencia), i, 1)\\n If eleccion <> \\\"H\\\" And eleccion <> \\\"T\\\" Then valido = False\\n Next\\n End If\\n Loop Until valido\\nEnd Sub\\n\\nFunction Aleatorio() As String\\n Dim As Byte eleccion, i\\n Dim As String tirada\\n tirada = \\\"\\\"\\n For i = 1 To 3\\n eleccion = Rnd And 1\\n If eleccion Then tirada += \\\"H\\\" Else tirada += \\\"T\\\"\\n Next\\n Return tirada\\nEnd Function\\n\\nFunction Optima(secuencia As String) As String\\n If Mid(secuencia, 2, 1) = \\\"H\\\" Then\\n Optima = \\\"T\\\" + Left(secuencia, 2)\\n Else\\n Optima = \\\"H\\\" + Left(secuencia, 2)\\n End If\\nEnd Function\\n\\nRandomize Timer\\nDim As String jugador, computador, otro\\nDim Shared As String secuencia\\nDim As Boolean ganador, valido\\nDo\\n Cls\\n Color 11\\n Print \\\"*** Penney's Game ***\\\" & Chr(10)\\n Color 7\\n Print \\\"Cara eliges primero, cruz yo elijo primero.\\\"\\n Print \\\"Y es... \\\";\\n Sleep 300\\n Dim As Double ht: ht = Rnd(0 - Timer) And 1\\n If ht Then\\n Print \\\"cara!\\\"\\n Jugador_elige(jugador)\\n computador = Optima(jugador)\\n Print !\\\"\\\\nYo elijo \\\"; computador; !\\\".\\\\n\\\"\\n Else\\n Print \\\"cruz!\\\"\\n computador = Aleatorio\\n Print !\\\"\\\\nYo elijo \\\"; computador; !\\\".\\\\n\\\"\\n Jugador_elige(jugador)\\n End If\\n Print \\\"Comenzando el juego ...\\\"\\n secuencia = \\\"\\\"\\n ganador = False\\n Do\\n Sleep 200\\n Dim As Integer lanzar = Rnd And 1\\n If lanzar Then\\n secuencia += \\\"H\\\"\\n Print \\\"H \\\";\\n Else\\n Print \\\"T \\\";\\n secuencia += \\\"T\\\"\\n End If\\n\\n If Right(secuencia, 3) = computador Then\\n Print !\\\"\\\\nGan‚!\\\\n\\\"\\n ganador = True\\n Else\\n If Right(secuencia, 3) = jugador Then\\n Print !\\\"\\\\nFelicidades! Ganaste.\\\\n\\\"\\n ganador = True\\n End If\\n End If\\n Loop Until ganador\\n Do\\n valido = False\\n Input \\\"¨Otra ronda? (S/N) \\\", otro\\n If Instr(\\\"SYN\\\", Ucase(otro)) Then valido = True\\n Loop Until valido\\nLoop Until Ucase(otro) = \\\"N\\\"\\nPrint !\\\"\\\\nGracias por jugar!\\\"\\nSleep\\nEnd\\n\",\n \"language\": \"FreeBASIC\"\n },\n {\n \"code\": \"package main\\nimport \\\"fmt\\\"\\nimport \\\"math/rand\\\"\\nfunc main(){\\nvar a1,a2,a3,y,match,j,k int\\nvar inp string\\ny=1\\nfor y==1{\\nfmt.Println(\\\"Enter your sequence:\\\")\\nfmt.Scanln(&inp)\\nvar Ai [3] int\\nvar user [3] int\\nfor j=0;j<3;j++{\\nif(inp[j]==104){\\nuser[j]=1\\n}else{\\nuser[j]=0\\n}\\n}\\nfor k=0;k<3;k++{\\nAi[k]=rand.Intn(2)\\n}\\nfor user[0]==Ai[0]&&user[1]==Ai[1]&&user[2]==Ai[2]{\\nfor k=0;k<3;k++{\\nAi[k]=rand.Intn(2)\\n}\\n}\\nfmt.Println(\\\"You gave the sequence:\\\")\\nprintht(user)\\nfmt.Println()\\nfmt.Println(\\\"The computer generated sequence is:\\\")\\nprintht(Ai)\\nfmt.Println()\\na1=rand.Intn(2)\\na2=rand.Intn(2)\\na3=rand.Intn(2)\\nfmt.Print(\\\"The generated sequence is:\\\")\\nprinth(a1)\\nprinth(a2)\\nprinth(a3)\\nmatch=0\\nfor match==0{\\nif(matches(user,a1,a2,a3)==1){\\nfmt.Println()\\nfmt.Println(\\\"You have won!!!\\\")\\nmatch=1\\n}else if(matches(Ai,a1,a2,a3)==1){\\nfmt.Println()\\nfmt.Println(\\\"You lost!! Computer wins\\\")\\nmatch=1\\n}else{\\na1=a2\\na2=a3\\na3=rand.Intn(2)\\nprinth(a3)\\n}\\n}\\nfmt.Println(\\\"Do you want to continue(0/1):\\\")\\nfmt.Scanln(&y)\\n}\\n}\\nfunc printht(a [3] int) int{\\nvar i int\\nfor i=0;i<3;i++{\\nif(a[i]==1){\\nfmt.Print(\\\"h\\\")\\n}else{\\nfmt.Print(\\\"t\\\")\\n}\\n}\\nreturn 1\\n}\\nfunc printh(a int) int{\\nif(a==1){\\nfmt.Print(\\\"h\\\")\\n}else{\\nfmt.Print(\\\"t\\\")\\n}\\nreturn 1\\n}\\nfunc matches(a [3] int,p int,q int,r int) int{\\nif(a[0]==p&&a[1]==q&&a[2]==r){\\nreturn 1\\n}else{\\nreturn 0\\n}\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"import qualified Data.List as L\\nimport System.IO\\nimport System.Random\\n\\ndata CoinToss = H | T deriving (Read, Show, Eq)\\n\\nparseToss :: String -> [CoinToss]\\nparseToss [] = []\\nparseToss (s:sx)\\n | s == 'h' || s == 'H' = H : parseToss sx\\n | s == 't' || s == 'T' = T : parseToss sx\\n | otherwise = parseToss sx\\n\\nnotToss :: CoinToss -> CoinToss\\nnotToss H = T\\nnotToss T = H\\n\\ninstance Random CoinToss where\\n random g = let (b, gb) = random g in (if b then H else T, gb)\\n randomR = undefined\\n\\nprompt :: (Read a) => String -> String -> (String -> Maybe a) -> IO a\\nprompt msg err parse = do\\n putStrLn msg\\n line <- getLine\\n let ans = parse line\\n case ans of\\n Nothing -> do\\n putStrLn err\\n prompt msg err parse\\n Just ansB -> return ansB\\n\\nshowCat :: (Show a) => [a] -> String\\nshowCat = concatMap show\\n\\ndata Winner = Player | CPU\\n\\n-- This may never terminate.\\nrunToss :: (RandomGen g) => [CoinToss] -> [CoinToss] -> g -> ([CoinToss], Winner)\\nrunToss player cpu gen =\\n let stream = randoms gen\\n run ss@(s:sx)\\n | L.isPrefixOf player ss = player\\n | L.isPrefixOf cpu ss = cpu\\n | otherwise = s : run sx\\n winner = run stream\\n in if L.isSuffixOf player winner\\n then (winner, Player)\\n else (winner, CPU)\\n\\ngame :: (RandomGen g, Num a, Show a) => Bool -> a -> a -> g -> IO ()\\ngame cpuTurn playerScore cpuScore gen = do\\n putStrLn $ \\\"\\\\nThe current score is CPU: \\\" ++ show cpuScore\\n ++ \\\", You: \\\" ++ show playerScore\\n\\n let (genA, genB) = split gen\\n promptPlayer check =\\n prompt \\\"Pick 3 coin sides: \\\" \\\"Invalid input.\\\" $ \\\\s ->\\n let tosses = parseToss s in\\n if check tosses then Just tosses else Nothing\\n promptCpu x = putStrLn $ \\\"I have chosen: \\\" ++ showCat x\\n\\n (tosses, winner) <-\\n if cpuTurn\\n then do\\n let cpuChoice = take 3 $ randoms gen\\n promptCpu cpuChoice\\n playerChoice <- promptPlayer $ \\\\n -> n /= cpuChoice && 3 == length n\\n return $ runToss playerChoice cpuChoice genA\\n else do\\n playerChoice <- promptPlayer $ \\\\n -> 3 == length n\\n let cpuChoice = case playerChoice of [a,b,_] -> [notToss b, a, b]\\n promptCpu cpuChoice\\n return $ runToss playerChoice cpuChoice genA\\n\\n putStrLn $ \\\"The sequence tossed was: \\\" ++ showCat tosses\\n\\n case winner of\\n Player -> do\\n putStrLn \\\"You win!\\\"\\n game (not cpuTurn) (playerScore + 1) cpuScore genB\\n CPU -> do\\n putStrLn \\\"I win!\\\"\\n game (not cpuTurn) playerScore (cpuScore + 1) genB\\n\\nmain :: IO ()\\nmain = do\\n hSetBuffering stdin LineBuffering\\n stdgen <- getStdGen\\n let (cpuFirst, genA) = random stdgen\\n game cpuFirst 0 0 genA\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"require 'format/printf numeric'\\n\\nrandomize '' NB. randomize seed for new session\\n\\nVals=: 'HT' NB. valid values\\ninput=: 1!:1@<&1: NB. get input from user\\nprompt=: input@echo NB. prompt user for input\\ncheckInput=: 'Choose 3 H/Ts' assert (Vals e.~ ]) , 3 = #\\ngetUserSeq=: (] [ checkInput)@toupper@prompt\\nchoose1st=: Vals {~ 3 ?@$ 2: NB. computer chooses 1st\\nchoose2nd=: (0 1 1=1 0 1{])&.(Vals&i.) NB. computer chooses 2nd\\n\\nplayPenney=: verb define\\n if. ?2 do. NB. randomize first chooser\\n Comp=. choose1st ''\\n 'Computer chose %s' printf <Comp\\n You=. getUserSeq 'Choose a sequence of three coin tosses (H/T):'\\n 'Choose a different sequence to computer' assert You -.@-: Comp\\n else.\\n You=. getUserSeq 'Choose a sequence of three coin tosses (H/T):'\\n Comp=. choose2nd You\\n 'Computer chose %s ' printf <Comp\\n end.\\n Tosses=. Vals {~ 100 ?@$ 2\\n Result=. (Comp,:You) {.@I.@E.\\\"1 Tosses\\n 'Toss sequence is %s' printf < (3 + <./ Result) {. Tosses\\n echo ('No result';'You win!';'Computer won!') {::~ *-/ Result\\n)\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \" playPenney''\\nComputer chose TTT\\nChoose a sequence of three coin tosses (H/T):\\nHTT\\nToss sequence is TTHHTT\\nYou win!\\n playPenney''\\nChoose a sequence of three coin tosses (H/T):\\nHTT\\nComputer chose HHT\\nToss sequence is HTHTT\\nYou win!\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.util.*;\\n\\npublic class PenneysGame {\\n\\n public static void main(String[] args) {\\n Random rand = new Random();\\n\\n String compChoice = \\\"\\\", playerChoice;\\n if (rand.nextBoolean()) {\\n\\n for (int i = 0; i < 3; i++)\\n compChoice += \\\"HT\\\".charAt(rand.nextInt(2));\\n System.out.printf(\\\"Computer chooses %s%n\\\", compChoice);\\n\\n playerChoice = prompt(compChoice);\\n\\n } else {\\n\\n playerChoice = prompt(compChoice);\\n\\n compChoice = \\\"T\\\";\\n if (playerChoice.charAt(1) == 'T')\\n compChoice = \\\"H\\\";\\n compChoice += playerChoice.substring(0, 2);\\n System.out.printf(\\\"Computer chooses %s%n\\\", compChoice);\\n }\\n\\n String tossed = \\\"\\\";\\n while (true) {\\n tossed += \\\"HT\\\".charAt(rand.nextInt(2));\\n System.out.printf(\\\"Tossed %s%n\\\" , tossed);\\n if (tossed.endsWith(playerChoice)) {\\n System.out.println(\\\"You win!\\\");\\n break;\\n }\\n if (tossed.endsWith(compChoice)) {\\n System.out.println(\\\"Computer wins!\\\");\\n break;\\n }\\n }\\n }\\n\\n private static String prompt(String otherChoice) {\\n Scanner sc = new Scanner(System.in);\\n String s;\\n do {\\n System.out.print(\\\"Choose a sequence: \\\");\\n s = sc.nextLine().trim().toUpperCase();\\n } while (!s.matches(\\\"[HT]{3}\\\") || s.equals(otherChoice));\\n return s;\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"const SLEN = 3\\n\\nautobet() = randbool(SLEN)\\nfunction autobet(ob::BitArray{1})\\n rlen = length(ob)\\n 2 < rlen || return ~ob\\n 3 < rlen || return [~ob[2], ob[1:2]]\\n opt = falses(rlen)\\n opt[1] = true\\n opt[end-1:end] = true\\n ob != opt || return ~opt\\n return opt\\nend\\nautobet(ob::Array{Bool,1}) = autobet(convert(BitArray{1}, ob))\\n\\nfunction pgencode{T<:String}(a::T)\\n b = uppercase(a)\\n 0 < length(b) || return trues(0)\\n !ismatch(r\\\"[^HT]+\\\", b) || error(@sprintf \\\"%s is not a HT sequence\\\" a)\\n b = split(b, \\\"\\\")\\n b .== \\\"H\\\"\\nend\\npgdecode(a::BitArray{1}) = join([i ? \\\"H\\\" : \\\"T\\\" for i in a], \\\"\\\")\\n\\nfunction humanbet()\\n b = \\\"\\\"\\n while length(b) != SLEN || ismatch(r\\\"[^HT]+\\\", b)\\n print(\\\"Your bet? \\\")\\n b = uppercase(chomp(readline()))\\n end\\n return b\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"println(\\\"Playing Penney's Game Against the computer.\\\")\\n\\nif randbool()\\n mach = autobet()\\n println(@sprintf \\\"The computer bet first, chosing %s.\\\" pgdecode(mach))\\n println(\\\"Now you can bet.\\\")\\n human = pgencode(humanbet())\\nelse\\n println(\\\"You bet first.\\\")\\n human = pgencode(humanbet())\\n mach = autobet(human)\\nend\\nprint(@sprintf \\\"You bet %s \\\" pgdecode(human))\\nprintln(@sprintf \\\"and the computer bet %s.\\\" pgdecode(mach))\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"pg = randbool(SLEN)\\npgtail = copy(pg)\\nwhile pgtail != mach && pgtail != human\\n push!(pg, randbool())\\n pgtail = [pgtail[2:end], pg[end]]\\nend\\n\\nprintln(@sprintf(\\\"This game lasted %d turns yielding\\\\n %s\\\",\\n length(pg), pgdecode(pg)))\\n\\nif human == mach\\n println(\\\"so you and the computer tied.\\\")\\nelseif pgtail == mach\\n println(\\\"so the computer won.\\\")\\nelse\\n println(\\\"so you won.\\\")\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.10\\n\\nimport java.util.Random\\n\\nval rand = Random()\\n\\nval optimum = mapOf(\\n \\\"HHH\\\" to \\\"THH\\\", \\\"HHT\\\" to \\\"THH\\\", \\\"HTH\\\" to \\\"HHT\\\", \\\"HTT\\\" to \\\"HHT\\\",\\n \\\"THH\\\" to \\\"TTH\\\", \\\"THT\\\" to \\\"TTH\\\", \\\"TTH\\\" to \\\"HTT\\\", \\\"TTT\\\" to \\\"HTT\\\"\\n)\\n\\nfun getUserSequence(): String {\\n println(\\\"A sequence of three H or T should be entered\\\")\\n var userSeq: String\\n do {\\n print(\\\"Enter your sequence: \\\")\\n userSeq = readLine()!!.toUpperCase()\\n }\\n while (userSeq.length != 3 || userSeq.any { it != 'H' && it != 'T' })\\n return userSeq\\n}\\n\\nfun getComputerSequence(userSeq: String = \\\"\\\"): String {\\n val compSeq = if(userSeq == \\\"\\\")\\n String(CharArray(3) { if (rand.nextInt(2) == 0) 'T' else 'H' })\\n else\\n optimum[userSeq]!!\\n println(\\\"Computer's sequence: $compSeq\\\")\\n return compSeq\\n}\\n\\nfun main(args: Array<String>) {\\n var userSeq: String\\n var compSeq: String\\n val r = rand.nextInt(2)\\n if (r == 0) {\\n println(\\\"You go first\\\")\\n userSeq = getUserSequence()\\n println()\\n compSeq = getComputerSequence(userSeq)\\n }\\n else {\\n println(\\\"Computer goes first\\\")\\n compSeq = getComputerSequence()\\n println()\\n userSeq = getUserSequence()\\n }\\n\\n println()\\n val coins = StringBuilder()\\n while (true) {\\n val coin = if (rand.nextInt(2) == 0) 'H' else 'T'\\n coins.append(coin)\\n println(\\\"Coins flipped: $coins\\\")\\n val len = coins.length\\n if (len >= 3) {\\n val seq = coins.substring(len - 3, len)\\n if (seq == userSeq) {\\n println(\\\"\\\\nYou win!\\\")\\n return\\n }\\n else if (seq == compSeq) {\\n println(\\\"\\\\nComputer wins!\\\")\\n return\\n }\\n }\\n Thread.sleep(2000) // wait two seconds for next flip\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"function penny_game()\\n local player, computer = \\\"\\\", \\\"\\\"\\n function player_choose()\\n io.write( \\\"Enter your sequence of three H and/or T: \\\" )\\n local t = io.read():upper()\\n if #t > 3 then t = t:sub( 1, 3 )\\n elseif #t < 3 then return \\\"\\\"\\n end\\n\\n for i = 1, 3 do\\n c = t:sub( i, i )\\n if c ~= \\\"T\\\" and c ~= \\\"H\\\" then\\n print( \\\"Just H's and T's!\\\" )\\n return \\\"\\\"\\n end\\n end\\n return t\\n end\\n function computer_choose()\\n local t = \\\"\\\"\\n if #player > 0 then\\n if player:sub( 2, 2 ) == \\\"T\\\" then\\n t = \\\"H\\\"\\n else\\n t = \\\"T\\\";\\n end\\n t = t .. player:sub( 1, 2 )\\n else\\n for i = 1, 3 do\\n if math.random( 2 ) == 1 then\\n t = t .. \\\"H\\\"\\n else\\n t = t .. \\\"T\\\"\\n end\\n end\\n end\\n return t\\n end\\n if math.random( 2 ) == 1 then\\n computer = computer_choose()\\n io.write( \\\"My sequence is: \\\" .. computer .. \\\"\\\\n\\\" )\\n while( true ) do\\n player = player_choose()\\n if player:len() == 3 then break end\\n end\\n else\\n while( true ) do\\n player = player_choose()\\n if player:len() == 3 then break end\\n end\\n computer = computer_choose()\\n io.write( \\\"My sequence is: \\\" .. computer .. \\\"\\\\n\\\" )\\n end\\n local coin, i = \\\"\\\", 1\\n while( true ) do\\n if math.random( 2 ) == 1 then\\n coin = coin .. \\\"T\\\"\\n io.write( \\\"T\\\" )\\n else\\n coin = coin .. \\\"H\\\"\\n io.write( \\\"H\\\" )\\n end\\n if #coin > 2 then\\n local seq = coin:sub( i, i + 2 )\\n i = i + 1\\n if seq == player then\\n print( \\\"\\\\nPlayer WINS!!!\\\" )\\n return 1\\n elseif seq == computer then\\n print( \\\"\\\\nComputer WINS!!!\\\" )\\n return -1\\n end\\n end\\n end\\nend\\nmath.randomseed( os.time() )\\nlocal cpu, user = 0, 0\\nrepeat\\n r = penny_game()\\n if r > 0 then\\n user = user + 1\\n else\\n cpu = cpu + 1\\n end\\n print( \\\"Player: \\\" .. user .. \\\" CPU: \\\" .. cpu )\\n io.write( \\\"Play again (Y/N)? \\\" )\\n r = io.read()\\nuntil( r == \\\"N\\\" or r == \\\"n\\\" )\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"randomTorH = function()\\n if rnd < 0.5 then return \\\"T\\\" else return \\\"H\\\"\\nend function\\n\\nif rnd < 0.5 then\\n playerSeq = input(\\\"Input your sequence (e.g. HTH): \\\").upper\\n if playerSeq[1] == \\\"T\\\" then compSeq = \\\"H\\\" else compSeq = \\\"T\\\"\\n compSeq = compSeq + playerSeq[:2]\\n print \\\"I choose: \\\" + compSeq\\nelse\\n compSeq = randomTorH + randomTorH + randomTorH\\n print \\\"I choose: \\\" + compSeq\\n playerSeq = input(\\\"Input your sequence (e.g. HTH): \\\").upper\\nend if\\n\\nprint \\\"Here we go...\\\"\\nseq = \\\"\\\"\\nwhile true\\n flip = randomTorH\\n print flip\\n seq = seq + flip\\n if seq[-3:] == playerSeq then\\n print \\\"You win!\\\"\\n break\\n else if seq[-3:] == compSeq then\\n print \\\"I win!\\\"\\n break\\n end if\\n wait\\nend while\\n\",\n \"language\": \"MiniScript\"\n },\n {\n \"code\": \"import os, random, sequtils, strutils\\n\\nrandomize()\\n\\nlet first = sample([false, true])\\n\\nvar you, me = \\\"\\\"\\nif first:\\n me = newSeqWith(3, sample(\\\"HT\\\")).join()\\n echo \\\"I choose first and will win on first seeing $# in the list of tosses.\\\" % me\\n while you.len != 3 or not allCharsInSet(you, {'H', 'T'}) or you == me:\\n stdout.write \\\"What sequence of three Heads/Tails will you win with? \\\"\\n you = stdin.readLine()\\nelse:\\n while you.len != 3 or not allCharsInSet(you, {'H', 'T'}):\\n echo \\\"After you: what sequence of three Heads/Tails will you win with? \\\"\\n you = stdin.readLine()\\n me = (if you[1] == 'T': 'H' else: 'T') & you[0..1]\\n echo \\\"I win on first seeing $# in the list of tosses\\\" % me\\n\\nvar rolled = \\\"\\\"\\nstdout.write \\\"Rolling:\\\\n \\\"\\nwhile true:\\n rolled.add sample(\\\"HT\\\")\\n stdout.write rolled[^1]\\n stdout.flushFile()\\n if rolled.endsWith(you):\\n echo \\\"\\\\n You win!\\\"\\n break\\n elif rolled.endsWith(me):\\n echo \\\"\\\\n I win!\\\"\\n break\\n sleep(1000)\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"PROGRAM Penney;\\n\\nTYPE\\n CoinToss = (heads, tails);\\n Sequence = array [1..3] of CoinToss;\\n Player = record\\n bet: Sequence;\\n score: integer;\\n end;\\n\\nVAR\\n Human, Computer: Player;\\n Rounds, Count: integer;\\n\\nFunction TossCoin: CoinToss;\\n{ Returns heads or tails at random }\\nBegin\\n if random(2) = 1 then TossCoin := Heads\\n else TossCoin := tails\\nEnd;\\n\\nProcedure PutToss(toss: CoinToss);\\n{ Outputs heads or tails as a letter }\\nBegin\\n if toss = heads then write('H')\\n else write('T')\\nEnd;\\n\\nFunction GetToss: CoinToss;\\n{ Reads H or T from the keyboard in either lettercase }\\nvar c: char;\\nBegin\\n { Keep reading characters until we get an appropriate letter }\\n repeat read(c) until c in ['H', 'h', 'T', 't'];\\n { Interpret the letter }\\n if c in ['H', 'h'] then GetToss := heads\\n else GetToss := tails\\nEnd;\\n\\nProcedure ShowSequence(tosses: Sequence);\\n{ Outputs three coin tosses at once }\\nVar\\n i: integer;\\nBegin\\n for i := 1 to 3 do PutToss(tosses[i])\\nEnd;\\n\\nProcedure ReadSequence(var tosses: Sequence);\\n{ Accepts three coin tosses from the keyboard }\\nVar i: integer;\\nBegin\\n { Get the 3 letters }\\n for i := 1 to 3 do tosses[i] := GetToss;\\n { Ignore the rest of the line }\\n readln\\nEnd;\\n\\nFunction Optimum(opponent: Sequence): Sequence;\\n{ Generates the optimum sequence against an opponent }\\nBegin\\n case opponent[2] of\\n heads: Optimum[1] := tails;\\n tails: Optimum[1] := heads\\n end;\\n Optimum[2] := opponent[1];\\n Optimum[3] := opponent[2]\\nEnd;\\n\\nFunction RandomSequence: Sequence;\\n{ Generates three random coin tosses }\\nVar\\n i: integer;\\nBegin\\n for i := 1 to 3 do RandomSequence[i] := TossCoin\\nEnd;\\n\\nFunction Match(first, second: Sequence): Boolean;\\n{ Detects whether a sequence of tosses matches another }\\nVar\\n different: boolean;\\n i: integer;\\nBegin\\n different := false;\\n i := 1;\\n while (i <= 3) and not different do begin\\n if not (first[i] = second[i]) then different := true;\\n i := i + 1\\n end;\\n Match := not different\\nEnd;\\n\\nProcedure PlayRound(var human, computer: Player);\\n{ Shows coin tosses and announces the winner }\\nVar\\n { We only ever need to store the 3 most recent tosses in memory. }\\n tosses: Sequence;\\nBegin\\n { Start with the first three tosses }\\n write('Tossing the coin: ');\\n tosses := RandomSequence;\\n ShowSequence(tosses);\\n { Keep tossing the coin until there is a winner. }\\n while not (Match(human.bet, tosses) or Match(computer.bet, tosses)) do begin\\n tosses[1] := tosses[2];\\n tosses[2] := tosses[3];\\n tosses[3] := TossCoin;\\n PutToss(tosses[3])\\n end;\\n { Update the winner's score and announce the winner }\\n writeln;\\n writeln;\\n if Match(human.bet, tosses) then begin\\n writeln('Congratulations! You won this round.');\\n human.score := human.score + 1;\\n writeln('Your new score is ', human.score, '.')\\n end\\n else begin\\n writeln('Yay, I won this round!');\\n computer.score := computer.score + 1;\\n writeln('My new score is ', computer.score, '.')\\n end\\nEnd;\\n\\n{ Main Algorithm }\\n\\nBEGIN\\n\\n { Welcome the player }\\n writeln('Welcome to Penney''s game!');\\n writeln;\\n write('How many rounds would you like to play? ');\\n readln(Rounds);\\n writeln;\\n writeln('Ok, let''s play ', Rounds, ' rounds.');\\n\\n { Start the game }\\n randomize;\\n Human.score := 0;\\n Computer.score := 0;\\n\\n for Count := 1 to Rounds do begin\\n\\n writeln;\\n writeln('*** Round #', Count, ' ***');\\n writeln;\\n\\n { Choose someone randomly to pick the first sequence }\\n if TossCoin = heads then begin\\n write('I''ll pick first this time.');\\n Computer.bet := RandomSequence;\\n write(' My sequence is ');\\n ShowSequence(Computer.bet);\\n writeln('.');\\n repeat\\n write('What sequence do you want? ');\\n ReadSequence(Human.bet);\\n if Match(Human.bet, Computer.bet) then\\n writeln('Hey, that''s my sequence! Think for yourself!')\\n until not Match(Human.bet, Computer.bet);\\n ShowSequence(Human.bet);\\n writeln(', huh? Sounds ok to me.')\\n end\\n else begin\\n write('You pick first this time. Enter 3 letters H or T: ');\\n ReadSequence(Human.bet);\\n Computer.bet := Optimum(Human.bet);\\n write('Ok, so you picked ');\\n ShowSequence(Human.bet);\\n writeln;\\n write('My sequence will be ');\\n ShowSequence(Computer.bet);\\n writeln\\n end;\\n\\n { Then we can actually play the round }\\n writeln('Let''s go!');\\n writeln;\\n PlayRound(Human, Computer);\\n writeln;\\n writeln('Press ENTER to go on...');\\n readln\\n\\n end;\\n\\n { All the rounds are finished; time to decide who won }\\n writeln;\\n writeln('*** End Result ***');\\n writeln;\\n if Human.score > Computer.score then writeln('Congratulations! You won!')\\n else if Computer.score > Human.score then writeln('Hooray! I won')\\n else writeln('Cool, we tied.');\\n writeln;\\n writeln('Press ENTER to finish.');\\n readln\\n\\nEND.\\n\",\n \"language\": \"Pascal\"\n },\n {\n \"code\": \"#!usr/bin/perl\\nuse 5.020;\\nuse strict;\\nuse warnings;\\n\\n#Choose who goes first\\nbinaryRand() == 0 ? flipCoin(userFirst()) : flipCoin(compFirst());\\n\\n#Return a randomly generated 1 or 0\\nsub binaryRand\\n{\\n return int(rand(2));\\n}\\n#Converts 1's and 0's to H's and T's, respectively.\\nsub convert\\n{\\n my $randNum = binaryRand();\\n if($randNum == 0)\\n {\\n return \\\"T\\\"\\n }\\n else\\n {\\n return \\\"H\\\";\\n }\\n}\\n\\n#Prompts for and returns a user's sequence of 3\\nsub uSeq\\n{\\n print(\\\"Please enter a sequence of 3 of \\\\\\\"H\\\\\\\" and \\\\\\\"T\\\\\\\". EG: HHT\\\\n>\\\");\\n my $uString = <STDIN>;\\n\\n while(1)\\n {\\n #Make it uppercase and validate input\\n chomp($uString);\\n $uString = uc $uString;\\n #Check length and content (H's and T's only!)\\n if(length $uString == 3 && (substr($uString, 0, 1) =~ /[HT]/ &&\\n substr($uString, 1, 1) =~ /[HT]/ &&\\n substr($uString, 2, 1) =~ /[HT]/))\\n {\\n last;\\n }\\n else\\n {\\n print(\\\"Error, try again. \\\\n\\\");\\n print(\\\"Please enter a sequence of 3 of \\\\\\\"H\\\\\\\" and \\\\\\\"T\\\\\\\". EG: HHT\\\\n\\\");\\n $uString = <STDIN>;\\n }\\n }\\n return $uString;\\n}\\n\\n#Returns an array with two elements: [0] user's seq, [1] random computer seq.\\nsub compFirst\\n{\\n my $cSeq;\\n #Randomly draw a sequence of 3\\n for(my $i = 0; $i < 3; $i++)\\n {\\n $cSeq = $cSeq . convert();\\n }\\n\\n print(\\\"The computer guesses first:\\\\ncomp- $cSeq\\\\n\\\");\\n my $uSeq = uSeq();\\n print(\\\"user- $uSeq\\\\n\\\");\\n my @seqArr = ($uSeq, $cSeq);\\n return @seqArr;\\n}\\n\\n#Returns an array with two elements: [0] user's seq, [1] optimal computer seq.\\nsub userFirst\\n{\\n print(\\\"The user quesses first:\\\\n\\\");\\n my $uSeq = uSeq();\\n my $cSeq;\\n #Generate the optimal sequence based on $uSeq\\n my $middle = substr($uSeq, 1, 1);\\n $middle eq \\\"H\\\" ? $cSeq = \\\"T\\\" : $cSeq = \\\"H\\\";\\n $cSeq = $cSeq . substr($uSeq, 0, 2);\\n\\n print(\\\"user- $uSeq\\\\ncomp- $cSeq\\\\n\\\");\\n my @seqArr = ($uSeq, $cSeq);\\n return @seqArr;\\n}\\n\\n#Flips a coin, checking both sequences against the contents of the given array\\nsub flipCoin\\n{\\n my ($uSeq, $cSeq) = @_;\\n my $coin;\\n while(1)\\n {\\n $coin = $coin . convert();\\n if($coin =~ m/$uSeq/)\\n {\\n print(\\\"The sequence of tosses was: $coin\\\\n\\\");\\n say(\\\"The player wins! \\\");\\n last;\\n }\\n elsif($coin =~ m/$cSeq/)\\n {\\n print(\\\"The sequence of tosses was: $coin\\\\n\\\");\\n say(\\\"The computer wins! \\\");\\n last;\\n }\\n }\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"function trio(integer pick)\\n return substitute_all(sprintf(\\\"%03b\\\",pick),\\\"10\\\",\\\"HT\\\")\\nend function\\n\\nfunction getuser(integer bot)\\ninteger user\\n while 1 do\\n user = 8 -- (a bit that clears after 3 shifts)\\n printf(1,\\\"Enter your sequence of 3 (H/T):\\\");\\n while user>7 do\\n integer c = upper(wait_key())\\n if c=#1B then abort(0) end if -- (Escape)\\n if find(c,\\\"HT\\\") then\\n puts(1,c)\\n user = and_bits(user*2+(c='H'),0b111111)\\n end if\\n end while\\n if user!=bot then exit end if\\n printf(1,\\\"\\\\nYou may not pick the same as Robort!\\\\n\\\")\\n end while\\n printf(1,\\\"\\\\n\\\")\\n return user\\nend function\\n\\nfunction getbot(int user)\\n int bot = iff(user=-1?rand(8)-1\\n :4-and_bits(user,2)*2+floor(user/2))\\n printf(1,\\\"Robort picks %s\\\\n\\\", {trio(bot)})\\n return bot\\nend function\\n\\nfunction rungame(integer user, bot)\\n /* We only need to store the last 3 tosses, as 0..7 */\\n int last3 = rand(8)-1\\n\\n printf(1,\\\"Rolling: %s\\\",{trio(last3)})\\n while 1 do\\n if user=last3 then\\n printf(1,\\\"\\\\nUser wins!\\\\n\\\")\\n return 1\\n elsif bot=last3 then\\n printf(1,\\\"\\\\nRobort wins!\\\\n\\\")\\n return 0\\n end if\\n last3 = and_bits(last3,3)*2+(rand(2)=1)\\n printf(1,\\\"%c\\\", iff(and_bits(last3,1) ? 'H' : 'T'))\\n sleep(0.5)\\n end while\\nend function\\n\\nprocedure main()\\n integer playerwins = 0,\\n totalgames = 0,\\n robortwins = 0\\n\\n /* Just use ctrl-c or Escape to exit */\\n while 1 do\\n integer user = -1,\\n bot = -1\\n\\n printf(1,\\\"\\\\n\\\")\\n if rand(2)=1 then\\n bot = getbot(-1)\\n user = getuser(bot)\\n else\\n user = getuser(-1)\\n bot = getbot(user)\\n end if\\n\\n playerwins += rungame(user, bot)\\n totalgames += 1\\n robortwins = totalgames-playerwins\\n\\n printf(1,\\\"Robort:%d You:%d out of %d games\\\\n\\\",\\n {robortwins, playerwins, totalgames})\\n printf(1,\\\"==================================\\\\n\\\")\\n end while\\n\\nend procedure\\nmain()\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(seed (in \\\"/dev/urandom\\\" (rd 8)))\\n\\n(setq *S (list 0 0))\\n\\n(de toss (N)\\n (make\\n (do N\\n (link (if (rand T) \\\"T\\\" \\\"H\\\")) ) ) )\\n\\n(de comp (A Lst)\\n (or\\n (for ((I . L) Lst (cddr L) (cdr L))\\n (T (fully = A L) I) )\\n T ) )\\n\\n(de score NIL\\n (prinl)\\n (prinl \\\"Total score:\\\")\\n (prinl \\\"^Iuser: \\\" (car *S))\\n (prinl \\\"^Icomp: \\\" (cadr *S)) )\\n\\n(de play NIL\\n (let (C (toss 3) Lst (toss (rand 5 12)) U)\\n (prinl)\\n (prin \\\"Select toss: \\\")\\n (setq U (in NIL (skip) (line)))\\n (prinl \\\"Comp toss: \\\" C)\\n (prinl \\\"Toss: \\\" Lst)\\n (setq @ (comp U Lst) @@ (comp C Lst) )\\n (cond\\n ((< @ @@) (prinl \\\"User win.\\\") (inc *S))\\n ((> @ @@) (prinl \\\"Comp win.\\\") (inc (cdr *S)))\\n (T (prinl \\\"Draw, lets play again.\\\")) )\\n (score) ) )\\n\\n(de go NIL\\n (loop\\n (play)\\n (T\\n (prog\\n (prinl)\\n (prin \\\"Want play again? Y/N: \\\")\\n (= \\\"N\\\" (uppc (in NIL (char)))) ) ) ) )\\n\\n(go)\\n\",\n \"language\": \"PicoLisp\"\n },\n {\n \"code\": \"play :- rand1(R), game(R).\\n\\ngame(h) :-\\n format('Your turn first!~n'), player_move(P),\\n response(P,C), format('I am choosing '), maplist(writec, C), nl,\\n rand3(R), maplist(writec,R),\\n roll(P, C, R).\\n\\ngame(t) :-\\n rand3(C),\\n format('I am choosing '), maplist(writec, C), nl,\\n player_move(P),\\n rand3(R), maplist(writec, R),\\n roll(P, C, R).\\n\\nplayer_move([P1,P2,P3]) :-\\n read_line_to_codes(user_input,Codes),\\n maplist(char_code,[P1,P2,P3],Codes).\\n\\nroll(P, _, P) :- format('~nYou Win!~n'), !.\\nroll(_, C, C) :- format('~nI Win!~n'), !.\\n\\nroll(P, C, [_,A,B]) :-\\n rand1(R),\\n coin_s(R,S),\\n write(S),\\n roll(P,C,[A,B,R]).\\n\\nresponse([A,B,_], [C,A,B]) :- opp(A,C).\\n\\nwritec(A) :- coin_s(A,A1), write(A1).\\nrand1(R) :- random(V), round(V,I), coin(I,R).\\nrand3([R1,R2,R3]) :- rand1(R1), rand1(R2), rand1(R3).\\n\\ncoin(0,h). coin(1,t).\\ncoin_s(h, 'H'). coin_s(t, 'T').\\nopp(h, t). opp(t, h).\\n\",\n \"language\": \"Prolog\"\n },\n {\n \"code\": \"from __future__ import print_function\\nimport random\\nfrom time import sleep\\n\\nfirst = random.choice([True, False])\\n\\nyou = ''\\nif first:\\n me = ''.join(random.sample('HT'*3, 3))\\n print('I choose first and will win on first seeing {} in the list of tosses'.format(me))\\n while len(you) != 3 or any(ch not in 'HT' for ch in you) or you == me:\\n you = input('What sequence of three Heads/Tails will you win with: ')\\nelse:\\n while len(you) != 3 or any(ch not in 'HT' for ch in you):\\n you = input('After you: What sequence of three Heads/Tails will you win with: ')\\n me = ('H' if you[1] == 'T' else 'T') + you[:2]\\n print('I win on first seeing {} in the list of tosses'.format(me))\\n\\nprint('Rolling:\\\\n ', end='')\\nrolled = ''\\nwhile True:\\n rolled += random.choice('HT')\\n print(rolled[-1], end='')\\n if rolled.endswith(you):\\n print('\\\\n You win!')\\n break\\n if rolled.endswith(me):\\n print('\\\\n I win!')\\n break\\n sleep(1) # For dramatic effect\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \" [ 2 random iff char H else char T ] is flip ( --> c )\\n\\n [ 3 times flip join join ] is randstart ( --> $ )\\n\\n [ -1 split drop\\n dup -1 peek\\n char T = iff char H else char T\\n swap join ] is beststart ( $ --> $ )\\n\\n [ stack ] is playergoal ( --> s )\\n [ stack ] is computergoal ( --> s )\\n\\n [ say \\\"This is Penney's game.\\\"\\n cr cr\\n say \\\"We each guess a different \\\"\\n say \\\"sequence of three coin \\\"\\n say \\\"flips.\\\"\\n cr\\n say \\\"I will releatedly flip \\\"\\n say \\\"a coin until one of the \\\"\\n say \\\"sequences happens.\\\"\\n cr\\n say \\\"The winner is the one who \\\"\\n say \\\"guesses the sequence that \\\"\\n say \\\"happens first.\\\"\\n cr cr\\n say \\\"Please enter your sequence \\\"\\n say \\\"carefully as there is no \\\"\\n say \\\"error checking.\\\"\\n cr\\n say 'For example, for \\\"heads '\\n say 'tails heads\\\" type \\\"HTH\\\".'\\n cr cr ] is intro ( --> )\\n\\n [ intro\\n randomise\\n flip char H = iff\\n [ say \\\"I start. My guess is: \\\"\\n randstart dup echo$\\n computergoal put\\n cr\\n $ \\\"Please enter your guess: \\\"\\n input playergoal put ]\\n else\\n [ say \\\"You start. \\\"\\n $ \\\"Please enter your guess: \\\"\\n input dup playergoal put\\n beststart dup\\n say \\\"I guess: \\\" echo$\\n computergoal put\\n cr ]\\n cr\\n $ \\\"\\\"\\n [ flip join\\n dup -3 split nip dup\\n computergoal share = iff\\n [ drop say \\\"I win.\\\" ] done\\n playergoal share = iff\\n [ say \\\"You win.\\\" ] done\\n again ]\\n cr\\n say \\\"The complete sequence was: \\\"\\n echo$ cr\\n computergoal release\\n playergoal release ] is play ( --> )\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"#===============================================================\\n# Penney's Game Task from Rosetta Code Wiki\\n# R implementation\\n#===============================================================\\n\\npenneysgame <- function() {\\n\\n #---------------------------------------------------------------\\n # Who goes first?\\n #---------------------------------------------------------------\\n\\n first <- sample(c(\\\"PC\\\", \\\"Human\\\"), 1)\\n\\n #---------------------------------------------------------------\\n # Determine the sequences\\n #---------------------------------------------------------------\\n\\n if (first == \\\"PC\\\") { # PC goes first\\n\\n pc.seq <- sample(c(\\\"H\\\", \\\"T\\\"), 3, replace = TRUE)\\n cat(paste(\\\"\\\\nI choose first and will win on first seeing\\\", paste(pc.seq, collapse = \\\"\\\"), \\\"in the list of tosses.\\\\n\\\\n\\\"))\\n human.seq <- readline(\\\"What sequence of three Heads/Tails will you win with: \\\")\\n human.seq <- unlist(strsplit(human.seq, \\\"\\\"))\\n\\n } else if (first == \\\"Human\\\") { # Player goest first\\n\\n cat(paste(\\\"\\\\nYou can choose your winning sequence first.\\\\n\\\\n\\\"))\\n human.seq <- readline(\\\"What sequence of three Heads/Tails will you win with: \\\")\\n human.seq <- unlist(strsplit(human.seq, \\\"\\\")) # Split the string into characters\\n pc.seq <- c(human.seq[2], human.seq[1:2]) # Append second element at the start\\n pc.seq[1] <- ifelse(pc.seq[1] == \\\"H\\\", \\\"T\\\", \\\"H\\\") # Switch first element to get the optimal guess\\n cat(paste(\\\"\\\\nI win on first seeing\\\", paste(pc.seq, collapse = \\\"\\\"), \\\"in the list of tosses.\\\\n\\\"))\\n\\n }\\n\\n #---------------------------------------------------------------\\n # Start throwing the coin\\n #---------------------------------------------------------------\\n\\n cat(\\\"\\\\nThrowing:\\\\n\\\")\\n\\n ran.seq <- NULL\\n\\n while(TRUE) {\\n\\n ran.seq <- c(ran.seq, sample(c(\\\"H\\\", \\\"T\\\"), 1)) # Add a new coin throw to the vector of throws\\n\\n cat(\\\"\\\\n\\\", paste(ran.seq, sep = \\\"\\\", collapse = \\\"\\\")) # Print the sequence thrown so far\\n\\n if (length(ran.seq) >= 3 && all(tail(ran.seq, 3) == pc.seq)) {\\n cat(\\\"\\\\n\\\\nI win!\\\\n\\\")\\n break\\n }\\n\\n if (length(ran.seq) >= 3 && all(tail(ran.seq, 3) == human.seq)) {\\n cat(\\\"\\\\n\\\\nYou win!\\\\n\\\")\\n break\\n }\\n\\n Sys.sleep(0.5) # Pause for 0.5 seconds\\n\\n }\\n}\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n;; Penney's Game. Tim Brown 2014-10-15\\n(define (flip . _) (match (random 2) (0 \\\"H\\\") (1 \\\"T\\\")))\\n\\n(define (get-human-sequence) ; no sanity checking here!\\n (display \\\"choose your winning sequence of 3 H or T > \\\")\\n (drop-right (drop (string-split (string-upcase (read-line)) \\\"\\\") 1) 1))\\n\\n(define flips->string (curryr string-join \\\".\\\"))\\n\\n(define (game-on p1 p2)\\n (printf \\\"~a chooses: ~a. ~a chooses: ~a~%\\\"\\n (car p1) (flips->string (cdr p1)) (car p2) (flips->string (cdr p2)))\\n (match-define (list (list name.1 p1.1 p1.2 p1.3) (list name.2 p2.1 p2.2 p2.3)) (list p1 p2))\\n (let turn ((seq null))\\n (match seq\\n [(list-rest (== p1.3) (== p1.2) (== p1.1) _) name.1]\\n [(list-rest (== p2.3) (== p2.2) (== p2.1) _) name.2]\\n [else\\n (let* ((flp (flip)) (seq+ (cons flp else)))\\n (printf \\\"new-flip: ~a -> ~a~%\\\" flp (flips->string (reverse seq+))) (turn seq+))])))\\n\\n(define (play-game)\\n (define-values\\n (player-1 player-2)\\n (match (flip)\\n [\\\"H\\\" (printf \\\"Human chooses first: \\\")\\n (define p1 (cons 'Hom-Sap (get-human-sequence)))\\n (values p1 (cons 'Computer\\n (match p1\\n [(list _ f1 (and f2 (app (match-lambda (\\\"H\\\" \\\"T\\\") (\\\"T\\\" \\\"H\\\")) ¬f2)) _)\\n (list ¬f2 f1 f2)])))]\\n [\\\"T\\\" (printf \\\"Computer chooses first. \\\")\\n (define p1 (cons 'Computer (build-list 3 flip)))\\n (printf \\\"~a chooses: ~a~%\\\" (car p1) (flips->string (cdr p1)))\\n (values p1 (cons 'Hom-Sap (get-human-sequence)))]))\\n (printf \\\"~a wins!~%\\\" (game-on player-1 player-2)))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"enum Coin <Heads Tails>;\\nenum Yay <Yay Good Super Hah Ooh Yipee Sweet Cool Yes Haha>;\\nenum Boo <Drat Darn Crumb Oops Rats Bah Criminy Argh Shards>;\\nenum Bozo «'Dude' 'Cha' 'Bzzt' 'Hey' 'Silly dilly' 'Say what!?' 'You numbskull'»;\\n\\nsub flipping {\\n for 1..4 {\\n print \\\"-\\\\b\\\"; sleep .1;\\n print \\\"\\\\\\\\\\\\b\\\"; sleep .1;\\n print \\\"|\\\\b\\\"; sleep .1;\\n print \\\"/\\\\b\\\"; sleep .1;\\n }\\n}\\n\\nsub your-choice($p is copy) {\\n loop (my @seq; @seq != 3; $p = \\\"{Bozo.pick}! Please pick exactly 3: \\\") {\\n @seq = prompt($p).uc.comb(/ H | T /).map: {\\n when 'H' { Heads }\\n when 'T' { Tails }\\n }\\n }\\n @seq;\\n}\\n\\nrepeat until prompt(\\\"Wanna play again? \\\").lc ~~ /^n/ {\\n my $mefirst = Coin.roll;\\n print tc \\\"$mefirst I start, {Coin(+!$mefirst).lc} you start, flipping...\\\\n\\\\t\\\";\\n flipping;\\n say my $flip = Coin.roll;\\n\\n my @yours;\\n my @mine;\\n\\n if $flip == $mefirst {\\n print \\\"{Yay.pick}! I get to choose first, and I choose: \\\"; sleep 2; say @mine = |Coin.roll(3);\\n @yours = your-choice(\\\"Now you gotta choose: \\\");\\n while @yours eqv @mine {\\n say \\\"{Bozo.pick}! We'd both win at the same time if you pick that!\\\";\\n @yours = your-choice(\\\"Pick something different from me: \\\");\\n }\\n say \\\"So, you'll win if we see: \\\", @yours;\\n }\\n else {\\n @yours = your-choice(\\\"{Boo.pick}! First you choose: \\\");\\n say \\\"OK, you'll win if we see: \\\", @yours;\\n print \\\"In that case, I'll just randomly choose: \\\"; sleep 2; say @mine = Coin(+!@yours[1]), |@yours[0,1];\\n }\\n\\n sub check($a,$b,$c) {\\n given [$a,$b,$c] {\\n when @mine { say \\\"\\\\n{Yay.pick}, I win, and you lose!\\\"; Nil }\\n when @yours { say \\\"\\\\n{Boo.pick}, you win, but I'll beat you next time!\\\"; Nil }\\n default { Coin.roll }\\n }\\n }\\n\\n sleep 1;\\n say < OK! Ready? Right... So... Yo!>.pick;\\n sleep .5;\\n say (\\\"Pay attention now!\\\",\\n \\\"Watch closely!\\\",\\n \\\"Let's do it...\\\",\\n \\\"You feeling lucky?\\\",\\n \\\"No way you gonna win this...\\\",\\n \\\"Can I borrow that coin again?\\\").pick;\\n sleep 1;\\n print \\\"Here we go!\\\\n\\\\t\\\";\\n for |Coin.roll(3), &check ...^ :!defined {\\n flipping;\\n print \\\"$_ \\\";\\n }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"/*REXX program plays/simulates Penney's Game, a two─player coin toss sequence game. */\\n__= copies('─', 9) /*literal for eye─catching fence. */\\nsignal on halt /*a clean way out if CLBF quits. */\\nparse arg # seed . /*obtain optional arguments from the CL*/\\nif #=='' | #==\\\",\\\" then #= 3 /*Not specified? Then use the default.*/\\nif datatype(seed,'W') then call random ,,seed /*use seed for RANDOM #s repeatability.*/\\nwins=0; do games=1 /*simulate a number of Penney's games. */\\n call game /*simulate a single inning of a game. */\\n end /*games*/ /*keep at it until QUIT or halt. */\\nexit /*stick a fork in it, we're all done. */\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nhalt: say; say __ \\\"Penney's Game was halted.\\\"; say; exit 13\\nr: arg ,$; do arg(1); $=$ || random(100, 9991) // 2; end; return $\\ns: if arg(1)==1 then return arg(3); return word(arg(2) 's',1) /*pluralizer.*/\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\ngame: @.=; tosses=@. /*the coin toss sequence so far. */\\n toss1= r(1) /*result: 0=computer, 1=CBLF.*/\\n if \\\\toss1 then call randComp /*maybe let the computer go first*/\\n if toss1 then say __ \\\"You win the first toss, so you pick your sequence first.\\\"\\n else say __ \\\"The computer won first toss, the pick was: \\\" @.comp\\n call prompter /*get the human's guess from C.L.*/\\n call randComp /*get computer's guess if needed.*/\\n /*CBLF: carbon-based life form. */\\n say __ \\\" your pick:\\\" @.CBLF /*echo human's pick to terminal. */\\n say __ \\\"computer's pick:\\\" @.comp /* \\\" comp.'s \\\" \\\" \\\" */\\n say /* [↓] flip the coin 'til a win.*/\\n do flips=1 until pos(@.CBLF, tosses)\\\\==0 | pos(@.comp, tosses)\\\\==0\\n tosses= tosses || translate( r(1), 'HT', 10)\\n end /*flips*/ /* [↑] this is a flipping coin,*/\\n /* [↓] series of tosses*/\\n say __ \\\"The tossed coin series was: \\\" tosses\\n say\\n @@@=\\\"won this toss with \\\" flips ' coin tosses.'\\n if pos(@.CBLF,tosses)\\\\==0 then do; say __ \\\"You\\\" @@@; wins=wins+1; end\\n else say __ \\\"The computer\\\" @@@\\n _=wins; if _==0 then _='no'\\n say __ \\\"You've won\\\" _ \\\"game\\\"s(wins) 'out of ' games\\\".\\\"\\n say; say copies('╩╦', 79 % 2)'╩'; say\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nprompter: oops= __ 'Oops! '; a= /*define some handy REXX literals*/\\n @a_z= 'ABCDEFG-IJKLMNOPQRS+UVWXYZ' /*the extraneous alphabetic chars*/\\n p=__ 'Pick a sequence of' # \\\"coin tosses of H or T (Heads or Tails) or Quit:\\\"\\n do until ok; say; say p; pull a /*uppercase the answer. */\\n if abbrev('QUIT', a, 1) then exit 1 /*the human wants to quit. */\\n a= space( translate(a,,@a_z',./\\\\;:_'), 0) /*elide extraneous characters. */\\n b= translate(a, 10, 'HT'); L= length(a) /*translate ───► bin; get length.*/\\n ok= 0 /*the response is OK (so far). */\\n select /*verify the user response. */\\n when \\\\datatype(b, 'B') then say oops \\\"Illegal response.\\\"\\n when \\\\datatype(a, 'M') then say oops \\\"Illegal characters in response.\\\"\\n when L==0 then say oops \\\"No choice was given.\\\"\\n when L<# then say oops \\\"Not enough coin choices.\\\"\\n when L># then say oops \\\"Too many coin choices.\\\"\\n when a==@.comp then say oops \\\"You can't choose the computer's\\\" ,\\n \\\"choice: \\\" @.comp\\n otherwise ok= 1\\n end /*select*/\\n end /*until ok*/\\n @.CBLF= a; @.CBLF!= b /*we have the human's guess now. */\\n return\\n/*──────────────────────────────────────────────────────────────────────────────────────*/\\nrandComp: if @.comp\\\\=='' then return /*the computer already has a pick*/\\n _= @.CBLF! /* [↓] use best-choice algorithm.*/\\n if _\\\\=='' then g= left((\\\\substr(_, min(2, #), 1))left(_, 1)substr(_, 3), #)\\n do until g\\\\==@.CBLF!; g= r(#); end /*otherwise, generate a choice. */\\n @.comp= translate(g, 'HT', 10)\\n return\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"Toss = [:Heads, :Tails]\\n\\ndef yourChoice\\n puts \\\"Enter your choice (H/T)\\\"\\n choice = []\\n 3.times do\\n until (c = $stdin.getc.upcase) == \\\"H\\\" or c == \\\"T\\\"\\n end\\n choice << (c==\\\"H\\\" ? Toss[0] : Toss[1])\\n end\\n puts \\\"You chose #{choice.join(' ')}\\\"\\n choice\\nend\\n\\nloop do\\n puts \\\"\\\\n%s I start, %s you start ..... %s\\\" % [*Toss, coin = Toss.sample]\\n if coin == Toss[0]\\n myC = Toss.shuffle << Toss.sample\\n puts \\\"I chose #{myC.join(' ')}\\\"\\n yC = yourChoice\\n else\\n yC = yourChoice\\n myC = Toss - [yC[1]] + yC.first(2)\\n puts \\\"I chose #{myC.join(' ')}\\\"\\n end\\n\\n seq = Array.new(3){Toss.sample}\\n print seq.join(' ')\\n loop do\\n puts \\\"\\\\n I win!\\\" or break if seq == myC\\n puts \\\"\\\\n You win!\\\" or break if seq == yC\\n seq.push(Toss.sample).shift\\n print \\\" #{seq[-1]}\\\"\\n end\\nend\\n\",\n \"language\": \"Ruby\"\n },\n {\n \"code\": \"extern crate rand;\\n\\nuse std::io::{stdin, stdout, Write};\\nuse std::thread;\\nuse std::time::Duration;\\n\\nuse rand::Rng;\\n\\nfn toss_coin<R: Rng>(rng: &mut R, print: bool) -> char {\\n let c = if rng.gen() { 'H' } else { 'T' };\\n if print {\\n print!(\\\"{}\\\", c);\\n stdout().flush().expect(\\\"Could not flush stdout\\\");\\n }\\n c\\n}\\n\\nfn gen_sequence<R: Rng>(rng: &mut R, seed: Option<&str>) -> String {\\n let mut seq = String::new();\\n match seed {\\n Some(s) => {\\n let mut iter = s.chars();\\n let c0 = iter.next().unwrap();\\n let next = if c0 == 'H' { 'T' } else { 'H' };\\n seq.push(next);\\n seq.push(c0);\\n seq.push(iter.next().unwrap());\\n }\\n None => {\\n for _ in 0..3 {\\n seq.push(toss_coin(rng, false))\\n }\\n }\\n }\\n seq\\n}\\n\\nfn read_sequence(used_seq: Option<&str>) -> String {\\n let mut seq = String::new();\\n loop {\\n seq.clear();\\n println!(\\\"Please, enter sequence of 3 coins: H (heads) or T (tails): \\\");\\n stdin().read_line(&mut seq).expect(\\\"failed to read line\\\");\\n seq = seq.trim().to_uppercase();\\n // do the cheapest test first\\n if seq.len() == 3\\n && seq.chars().all(|c| c == 'H' || c == 'T')\\n && seq != used_seq.unwrap_or(\\\"\\\")\\n {\\n return seq;\\n }\\n\\n println!(\\\"Please enter correct sequence!\\\");\\n }\\n}\\n\\nfn main() {\\n let mut rng = rand::thread_rng();\\n\\n println!(\\\"--Penney's game--\\\");\\n loop {\\n let useq: String;\\n let aiseq: String;\\n if rng.gen::<bool>() {\\n println!(\\\"You choose first!\\\");\\n useq = read_sequence(None);\\n println!(\\\"Your sequence: {}\\\", useq);\\n aiseq = gen_sequence(&mut rng, Some(&useq));\\n println!(\\\"My sequence: {}\\\", aiseq);\\n } else {\\n println!(\\\"I choose first!\\\");\\n aiseq = gen_sequence(&mut rng, None);\\n println!(\\\"My sequence: {}\\\", aiseq);\\n useq = read_sequence(Some(&aiseq));\\n println!(\\\"Your sequence: {}\\\", useq);\\n }\\n println!(\\\"Tossing coins...\\\");\\n let mut coins = String::new();\\n for _ in 0..2 {\\n // toss first 2 coins\\n coins.push(toss_coin(&mut rng, true));\\n thread::sleep(Duration::from_millis(500));\\n }\\n loop {\\n coins.push(toss_coin(&mut rng, true));\\n thread::sleep(Duration::from_millis(500));\\n if coins.contains(&useq) {\\n println!(\\\"\\\\nYou win!\\\");\\n break;\\n }\\n if coins.contains(&aiseq) {\\n println!(\\\"\\\\nI win!\\\");\\n break;\\n }\\n }\\n\\n println!(\\\" Play again? 'Y' to play, 'Q' to exit.\\\");\\n let mut input = String::new();\\n stdin().read_line(&mut input).expect(\\\"failed to read line\\\");\\n match input.trim_start().chars().next().unwrap() {\\n 'Y' | 'y' => continue,\\n _ => break,\\n }\\n }\\n}\\n\",\n \"language\": \"Rust\"\n },\n {\n \"code\": \" 10 IF RND>=.5 THEN GOTO 100\\n 20 PRINT \\\"YOU PICK FIRST.\\\"\\n 30 INPUT P$\\n 40 PRINT \\\"YOU CHOSE \\\";P$\\n 50 LET C$=\\\"H\\\"\\n 60 IF P$(2)=\\\"H\\\" THEN LET C$=\\\"T\\\"\\n 70 LET C$=C$+P$( TO 2)\\n 80 PRINT \\\"I CHOOSE \\\";C$\\n 90 GOTO 190\\n100 PRINT \\\"I PICK FIRST.\\\"\\n110 LET C$=\\\"\\\"\\n120 FOR I=1 TO 3\\n130 LET C$=C$+\\\"H\\\"\\n140 IF RND>=.5 THEN LET C$(I)=\\\"T\\\"\\n150 NEXT I\\n160 PRINT \\\"I CHOOSE \\\";C$\\n170 INPUT P$\\n180 PRINT \\\"YOU CHOSE \\\";P$\\n190 LET G$=\\\"\\\"\\n200 IF RND>=.5 THEN GOTO 230\\n210 LET G$=G$+\\\"H\\\"\\n220 GOTO 240\\n230 LET G$=G$+\\\"T\\\"\\n240 PRINT AT 5,0;G$\\n250 IF LEN G$<3 THEN GOTO 200\\n260 IF G$(LEN G$-2 TO )=P$ THEN GOTO 290\\n270 IF G$(LEN G$-2 TO )=C$ THEN GOTO 310\\n280 GOTO 200\\n290 PRINT \\\"YOU WIN\\\"\\n300 STOP\\n310 PRINT \\\"I WIN\\\"\\n\",\n \"language\": \"Sinclair-ZX81-BASIC\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\noo::class create Player {\\n variable who seq seen idx\\n\\n constructor {name sequence} {\\n\\tset who $name\\n\\tset seq $sequence\\n\\tset seen {}\\n\\tset idx end-[expr {[string length $seq] - 1}]\\n }\\n\\n method pick {} {\\n\\treturn $seq\\n }\\n\\n method name {} {\\n\\treturn $who\\n }\\n\\n method match {digit} {\\n\\tappend seen $digit\\n\\treturn [expr {[string range $seen $idx end] eq $seq}]\\n }\\n}\\n\\noo::class create HumanPlayer {\\n superclass Player\\n constructor {length {otherPlayersSelection \\\"\\\"}} {\\n\\tfconfigure stdout -buffering none\\n\\twhile true {\\n\\t puts -nonewline \\\"What do you pick? (length $length): \\\"\\n\\t if {[gets stdin pick] < 0} exit\\n\\t set pick [regsub -all {[^HT]} [string map {0 H 1 T h H t T} $pick] \\\"\\\"]\\n\\t if {[string length $pick] eq $length} break\\n\\t puts \\\"That's not a legal pick!\\\"\\n\\t}\\n\\tset name \\\"Human\\\"\\n\\tif {[incr ::humans] > 1} {append name \\\" #$::humans\\\"}\\n\\tnext $name $pick\\n }\\n}\\n\\noo::class create RobotPlayer {\\n superclass Player\\n constructor {length {otherPlayersSelection \\\"\\\"}} {\\n\\tif {$otherPlayersSelection eq \\\"\\\"} {\\n\\t set pick \\\"\\\"\\n\\t for {set i 0} {$i < $length} {incr i} {\\n\\t\\tappend pick [lindex {H T} [expr {int(rand()*2)}]]\\n\\t }\\n\\t} else {\\n\\t if {$length != 3} {\\n\\t\\terror \\\"lengths other than 3 not implemented\\\"\\n\\t }\\n\\t lassign [split $otherPlayersSelection \\\"\\\"] a b c\\n\\t set pick [string cat [string map {H T T H} $b] $a $b]\\n\\t}\\n\\tset name \\\"Robot\\\"\\n\\tif {[incr ::robots] > 1} {append name \\\" #$::robots\\\"}\\n\\tputs \\\"$name picks $pick\\\"\\n\\tnext $name $pick\\n }\\n}\\n\\nproc game {length args} {\\n puts \\\"Let's play Penney's Game!\\\"\\n\\n # instantiate the players\\n set picks {}\\n set players {}\\n while {[llength $args]} {\\n\\tset idx [expr {int(rand()*[llength $args])}]\\n\\tset p [[lindex $args $idx] new $length {*}$picks]\\n\\tset args [lreplace $args $idx $idx]\\n\\tlappend players $p\\n\\tlappend picks [$p pick]\\n }\\n\\n # sanity check\\n if {[llength $picks] != [llength [lsort -unique $picks]]} {\\n\\tputs \\\"Two players picked the same thing; that's illegal\\\"\\n }\\n\\n # do the game loop\\n while 1 {\\n\\tset coin [lindex {H T} [expr {int(rand()*2)}]]\\n\\tputs \\\"Coin flip [incr counter] is $coin\\\"\\n\\tforeach p $players {\\n\\t if {[$p match $coin]} {\\n\\t\\tputs \\\"[$p name] has won!\\\"\\n\\t\\treturn\\n\\t }\\n\\t}\\n }\\n}\\n\\ngame 3 HumanPlayer RobotPlayer\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"#!/bin/bash\\nmain() {\\n printf $'Penney\\\\'s Game\\\\n\\\\n'\\n printf 'Flipping to see who goes first ... '\\n\\n if [[ $(flip) == H ]]; then\\n printf 'I do.\\\\n'\\n p2=$(choose_sequence)\\n printf 'I choose: %s\\\\n' \\\"$p2\\\"\\n else\\n printf 'You do.\\\\n'\\n fi\\n\\n while true; do\\n read -p 'Enter your three-flip sequence: ' p1\\n p1=$(tr a-z A-Z <<<\\\"$p1\\\")\\n case \\\"$p1\\\" in\\n \\\"$p2\\\") printf 'Sequence must be different from mine\\\\n';;\\n [HT][HT][HT]) break;;\\n *) printf $'Sequence must be three H\\\\'s or T\\\\'s\\\\n';;\\n esac\\n done\\n\\n if [ -z \\\"$p2\\\" ]; then\\n p2=$(choose_sequence \\\"$p1\\\")\\n printf 'I choose: %s\\\\n' \\\"$p2\\\"\\n fi\\n\\n printf '\\\\nHere we go. %s, you win; %s, I win.\\\\n' \\\"$p1\\\" \\\"$p2\\\"\\n printf 'Flips:'\\n\\n flips=\\n while true; do\\n flip=$(flip)\\n printf ' %s' \\\"$flip\\\"\\n flips+=$flip\\n case \\\"$flips\\\" in\\n *$p1) printf $'\\\\nYou win!\\\\n'; exit 0;;\\n *$p2) printf $'\\\\nI win!\\\\n'; exit 1;;\\n esac\\n done\\n}\\n\\nchoose_sequence() {\\n local result\\n if (( $# )); then\\n case \\\"$1\\\" in\\n ?[Hh]?) result=T;;\\n *) result=H;;\\n esac\\n result+=\\\"${1%?}\\\"\\n else\\n result=$(flip)$(flip)$(flip)\\n fi\\n printf '%s\\\\n' \\\"$result\\\"\\n}\\n\\nflip() {\\n if (( RANDOM % 2 )); then\\n printf '%s\\\\n' H\\n else\\n printf '%s\\\\n' T\\n fi\\n}\\n\\nmain \\\"$@\\\"\\n\",\n \"language\": \"UNIX-Shell\"\n },\n {\n \"code\": \"import rand\\nimport os\\nimport time\\n\\nconst optimum = {\\n\\t\\\"HHH\\\": \\\"THH\\\", \\\"HHT\\\": \\\"THH\\\", \\\"HTH\\\": \\\"HHT\\\", \\\"HTT\\\": \\\"HHT\\\",\\n\\t\\\"THH\\\": \\\"TTH\\\", \\\"THT\\\": \\\"TTH\\\", \\\"TTH\\\": \\\"HTT\\\", \\\"TTT\\\": \\\"HTT\\\"\\n}\\n\\nfn main() {\\n\\tr := rand.intn(2) or {exit(1)}\\n\\tmut user_seq :=''\\n\\tmut comp_seq :=''\\n\\tmut coin :=''\\n\\tmut coins :=''\\n\\tmut len := 0\\n\\tmut seq :=''\\n\\n\\tif r == 0 {\\n\\t\\tprintln(\\\"You go first\\\")\\n\\t\\tuser_seq = user_sequence()\\n\\t\\tprintln('\\\\n')\\n\\t\\tcomp_seq = computer_sequence(user_seq)\\n\\t}\\n\\telse {\\n\\t\\tprintln(\\\"Computer goes first\\\")\\n\\t\\tcomp_seq = computer_sequence(user_seq)\\n\\t\\tprintln('\\\\n')\\n\\t\\tuser_seq = user_sequence()\\n\\t}\\n\\tprintln('\\\\n')\\n\\tfor true {\\n\\t\\tif (rand.intn(2) or {exit(1)}) == 0 {coin = 'H'} else {coin = 'T'}\\n\\t\\tcoins += coin\\n\\t\\tprintln(\\\"Coins flipped: $coins\\\")\\n\\t\\tlen = coins.len\\n\\t\\tif len >= 3 {\\n\\t\\t\\tseq = coins.substr(len - 3, len)\\n\\t\\t\\tif seq == user_seq {\\n\\t\\t\\t\\tprintln(\\\"\\\\nYou win!\\\")\\n\\t\\t\\t\\texit(0)\\n\\t\\t\\t}\\n\\t\\t\\tif seq == comp_seq {\\n\\t\\t\\t\\tprintln(\\\"\\\\nComputer wins!\\\")\\n\\t\\t\\t\\texit(0)\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttime.sleep(1 * time.second) // extraneous\\n\\t}\\n}\\n\\nfn user_sequence() string {\\n\\tmut user_seq :=''\\n\\tprintln(\\\"A sequence of three H or T should be entered\\\")\\n\\tfor (user_seq.len != 3) || (user_seq.to_upper().split('').any(it != 'H' && it != 'T') == true) {\\n\\t\\tuser_seq = os.input('Enter your sequence: ').str().to_upper()\\n\\t}\\n\\treturn user_seq\\n}\\n\\nfn computer_sequence(user_seq string) string {\\n\\tmut char_array := []string{len:3}\\n\\tmut comp_seq :=''\\n\\tif user_seq == '' {\\n\\t\\tfor _ in 0..2 {\\n\\t\\t\\tif (rand.intn(2) or {exit(1)}) == 0 {char_array << 'T'} else {char_array << 'H'}\\n\\t\\t\\tcomp_seq = char_array.join('')\\n\\t\\t}\\n\\t}\\t\\n\\telse {\\n\\t\\tcomp_seq = optimum[user_seq]\\n\\t}\\n\\tprintln(\\\"Computer's sequence: $comp_seq\\\")\\n\\treturn comp_seq\\n}\\n\",\n \"language\": \"V-(Vlang)\"\n },\n {\n \"code\": \"Option Explicit\\n\\nPrivate Declare Sub Sleep Lib \\\"kernel32\\\" (ByVal dwMilliseconds As Long)\\nPrivate Const HT As String = \\\"H T\\\"\\n\\nPublic Sub PenneysGame()\\nDim S$, YourSeq$, ComputeSeq$, i&, Seq$, WhoWin$, flag As Boolean\\n\\n Do\\n S = WhoWillBeFirst(Choice(\\\"Who will be first\\\"))\\n If S = \\\"ABORT\\\" Then Exit Do\\n Debug.Print S; \\\" start\\\"\\n YourSeq = Choice(\\\"Your sequence\\\", 3)\\n If YourSeq Like \\\"*ABORT*\\\" Then Exit Do\\n Debug.Print \\\"Your sequence : \\\" & YourSeq\\n ComputeSeq = vbNullString\\n For i = 1 To 3\\n ComputeSeq = ComputeSeq & Random\\n Next i\\n Debug.Print \\\"Computer sequence : \\\" & ComputeSeq\\n Seq = vbNullString\\n Do\\n Seq = Seq & Random\\n Debug.Print Seq\\n Sleep 1000\\n Loop While Not Winner(ComputeSeq, YourSeq, Seq, WhoWin)\\n Debug.Print WhoWin; \\\" win\\\"\\n If MsgBox(WhoWin & \\\" win\\\" & vbCrLf & \\\"Play again?\\\", vbYesNo) = vbNo Then flag = True\\n Debug.Print \\\"\\\"\\n Loop While Not flag\\n Debug.Print \\\"Game over\\\"\\nEnd Sub\\n\\nPrivate Function WhoWillBeFirst(YourChoice As String) As String\\nDim S$\\n S = Random\\n Select Case YourChoice\\n Case \\\"ABORT\\\": WhoWillBeFirst = YourChoice\\n Case Else:\\n WhoWillBeFirst = IIf(S = YourChoice, \\\"You\\\", \\\"Computer\\\")\\n End Select\\nEnd Function\\n\\nPrivate Function Choice(Title As String, Optional Seq As Integer) As String\\nDim S$, i&, t$\\n If Seq = 0 Then Seq = 1\\n t = Title\\n For i = 1 To Seq\\n S = vbNullString\\n Do\\n S = InputBox(\\\"Choose between H or T : \\\", t)\\n If StrPtr(S) = 0 Then S = \\\"Abort\\\"\\n S = UCase(S)\\n Loop While S <> \\\"H\\\" And S <> \\\"T\\\" And S <> \\\"ABORT\\\"\\n Choice = Choice & S\\n t = Title & \\\" \\\" & Choice\\n If Choice Like \\\"*ABORT*\\\" Then Exit For\\n Next i\\nEnd Function\\n\\nPrivate Function Random() As String\\nRandomize Timer\\n Random = Split(HT, \\\" \\\")(CInt(Rnd))\\nEnd Function\\n\\nPrivate Function Winner(Cs$, Ys$, S$, W$) As Boolean\\n If Len(S) < 3 Then\\n Winner = False\\n Else\\n If Right(S, 3) = Cs And Right(S, 3) = Ys Then\\n Winner = True\\n W = \\\"Computer & you\\\"\\n ElseIf Right(S, 3) = Cs And Right(S, 3) <> Ys Then\\n Winner = True\\n W = \\\"Computer\\\"\\n ElseIf Right(S, 3) = Ys And Right(S, 3) <> Cs Then\\n Winner = True\\n W = \\\"You\\\"\\n End If\\n End If\\nEnd Function\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"io\\\" for Stdin, Stdout\\nimport \\\"timer\\\" for Timer\\nimport \\\"./str\\\" for Str\\n\\nvar rand = Random.new()\\n\\nvar optimum = {\\n \\\"HHH\\\": \\\"THH\\\", \\\"HHT\\\": \\\"THH\\\", \\\"HTH\\\": \\\"HHT\\\", \\\"HTT\\\": \\\"HHT\\\",\\n \\\"THH\\\": \\\"TTH\\\", \\\"THT\\\": \\\"TTH\\\", \\\"TTH\\\": \\\"HTT\\\", \\\"TTT\\\": \\\"HTT\\\"\\n}\\n\\nvar getUserSequence = Fn.new {\\n System.print(\\\"A sequence of three H or T should be entered\\\")\\n var userSeq\\n while (true) {\\n System.write(\\\"Enter your sequence: \\\")\\n Stdout.flush()\\n userSeq = Str.upper(Stdin.readLine())\\n if (userSeq.count == 3 && userSeq.all { |c| c == \\\"H\\\" || c == \\\"T\\\" }) break\\n }\\n return userSeq\\n}\\n\\nvar getComputerSequence = Fn.new { |userSeq|\\n var compSeq\\n if (userSeq == \\\"\\\") {\\n var chars = List.filled(3, null)\\n for (i in 0..2) chars[i] = (rand.int(2) == 0) ? \\\"T\\\" : \\\"H\\\"\\n compSeq = chars.join()\\n } else {\\n compSeq = optimum[userSeq]\\n }\\n System.print(\\\"Computer's sequence: %(compSeq)\\\")\\n return compSeq\\n}\\n\\nvar userSeq\\nvar compSeq\\nvar r = rand.int(2)\\nif (r == 0) {\\n System.print(\\\"You go first\\\")\\n userSeq = getUserSequence.call()\\n System.print()\\n compSeq = getComputerSequence.call(userSeq)\\n} else {\\n System.print(\\\"Computer goes first\\\")\\n compSeq = getComputerSequence.call(\\\"\\\")\\n System.print()\\n userSeq = getUserSequence.call()\\n}\\nSystem.print()\\nvar coins = \\\"\\\"\\nwhile (true) {\\n var coin = (rand.int(2) == 0) ? \\\"H\\\" : \\\"T\\\"\\n coins = coins + coin\\n System.print(\\\"Coins flipped: %(coins)\\\")\\n var len = coins.count\\n if (len >= 3) {\\n var seq = coins[len-3...len]\\n if (seq == userSeq) {\\n System.print(\\\"\\\\nYou win!\\\")\\n return\\n } else if (seq == compSeq) {\\n System.print(\\\"\\\\nCompter wins!\\\")\\n return\\n }\\n }\\n Timer.sleep(2000) // wait two seconds for next flip\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn coinToss{ (0).random(2) and \\\"H\\\" or \\\"T\\\" } // (0).random(2) --> 0<=r<2\\nreg myBet, yourBet;\\nif(coinToss()==\\\"H\\\"){ // The toss says I go first\\n myBet=(3).pump(String,coinToss);\\n println(\\\"I bet \\\",myBet);\\n yourBet=ask(\\\"Your bet of three (H/T): \\\")[0,3].toUpper();\\n}else{\\n yourBet=ask(\\\"Your bet of three (H/T): \\\")[0,3].toUpper();\\n myBet=((yourBet[1]==\\\"H\\\") and \\\"T\\\" or \\\"H\\\") + yourBet[0,2];\\n println(\\\"I bet \\\",myBet);\\n}\\nprint(\\\"Flipping: \\\"); coins:=\\\"\\\";\\nwhile(1){\\n print(toss:=coinToss()); coins=coins + toss;\\n if(Void!=coins.find(yourBet)){ println(\\\" You win!\\\"); break; }\\n if(Void!=coins.find(myBet)) { println(\\\" I win!\\\"); break; }\\n // ignore we both won\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Penneys-game"}}},{"rowIdx":1497,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pentagram\n","language":"00-META"},{"code":"A [[wp:pentagram|pentagram]] is a star polygon, consisting of a central pentagon of which each side forms the base of an isosceles triangle. The vertex of each triangle, a point of the star, is 36 degrees.\n<br><br>\n\n;Task:\nDraw (or print) a regular pentagram, in any orientation. Use a different color (or token) for stroke and fill, and background. For the fill it should be assumed that all points inside the triangles and the pentagon are inside the pentagram.\n<br><br>\n\n;See also\n* [http://proofsfromthebook.com/2013/08/04/angle-sum-of-a-pentagram/ Angle sum of a pentagram]\n<br><br>\n\n","language":"00-TASK"},{"code":"INCLUDE \"D2:REAL.ACT\" ;from the Action! Tool Kit\n\nDEFINE REALPTR=\"CARD\"\nTYPE PointR=[REALPTR x,y]\n\nINT ARRAY SinTab=[\n 0 4 9 13 18 22 27 31 36 40 44 49 53 58 62 66 71 75 79 83\n 88 92 96 100 104 108 112 116 120 124 128 132 136 139 143\n 147 150 154 158 161 165 168 171 175 178 181 184 187 190\n 193 196 199 202 204 207 210 212 215 217 219 222 224 226\n 228 230 232 234 236 237 239 241 242 243 245 246 247 248\n 249 250 251 252 253 254 254 255 255 255 256 256 256 256]\n\nINT FUNC Sin(INT a)\n WHILE a<0 DO a==+360 OD\n WHILE a>360 DO a==-360 OD\n IF a<=90 THEN\n RETURN (SinTab(a))\n ELSEIF a<=180 THEN\n RETURN (SinTab(180-a))\n ELSEIF a<=270 THEN\n RETURN (-SinTab(a-180))\n ELSE\n RETURN (-SinTab(360-a))\n FI\nRETURN (0)\n\nINT FUNC Cos(INT a)\nRETURN (Sin(a-90))\n\nPROC Det(REAL POINTER x1,y1,x2,y2,res)\n REAL tmp1,tmp2\n\n RealMult(x1,y2,tmp1)\n RealMult(y1,x2,tmp2)\n RealSub(tmp1,tmp2,res)\nRETURN\n\nBYTE FUNC IsZero(REAL POINTER a)\n CHAR ARRAY s(10)\n\n StrR(a,s)\n IF s(0)=1 AND s(1)='0 THEN\n RETURN (1)\n FI\nRETURN (0)\n\nBYTE FUNC Intersection(PointR POINTER p1,p2,p3,p4,res)\n REAL det1,det2,dx1,dx2,dy1,dy2,nom,denom\n\n Det(p1.x,p1.y,p2.x,p2.y,det1)\n Det(p3.x,p3.y,p4.x,p4.y,det2)\n RealSub(p1.x,p2.x,dx1)\n RealSub(p1.y,p2.y,dy1)\n RealSub(p3.x,p4.x,dx2)\n RealSub(p3.y,p4.y,dy2)\n Det(dx1,dy1,dx2,dy2,denom)\n\n IF IsZero(denom) THEN\n RETURN (0)\n FI\n\n Det(det1,dx1,det2,dx2,nom)\n RealDiv(nom,denom,res.x)\n Det(det1,dy1,det2,dy2,nom)\n RealDiv(nom,denom,res.y)\nRETURN (1)\n\nPROC FloodFill(BYTE x0,y0)\n BYTE ARRAY xs(300),ys(300)\n INT first,last\n\n first=0 last=0\n xs(first)=x0\n ys(first)=y0\n\n WHILE first<=last\n DO\n x0=xs(first) y0=ys(first)\n first==+1\n IF Locate(x0,y0)=0 THEN\n Plot(x0,y0)\n IF Locate(x0-1,y0)=0 THEN\n last==+1 xs(last)=x0-1 ys(last)=y0\n FI\n IF Locate(x0+1,y0)=0 THEN\n last==+1 xs(last)=x0+1 ys(last)=y0\n FI\n IF Locate(x0,y0-1)=0 THEN\n last==+1 xs(last)=x0 ys(last)=y0-1\n FI\n IF Locate(x0,y0+1)=0 THEN\n last==+1 xs(last)=x0 ys(last)=y0+1\n FI\n FI\n OD\nRETURN\n\nPROC Pentagram(INT x0,y0,r,a0 BYTE c1,c2)\n INT ARRAY xs(16),ys(16)\n INT angle\n BYTE i\n PointR p1,p2,p3,p4,p\n REAL p1x,p1y,p2x,p2y,p3x,p3y,p4x,p4y,px,py\n\n p1.x=p1x p1.y=p1y\n p2.x=p2x p2.y=p2y\n p3.x=p3x p3.y=p3y\n p4.x=p4x p4.y=p4y\n p.x=px p.y=py\n\n ;outer points\n angle=a0\n FOR i=0 TO 4\n DO\n xs(i)=r*Sin(angle)/256+x0\n ys(i)=r*Cos(angle)/256+y0\n angle==+144\n OD\n\n ;intersection points\n FOR i=0 TO 4\n DO\n IntToReal(xs(i MOD 5),p1x)\n IntToReal(ys(i MOD 5),p1y)\n IntToReal(xs((1+i) MOD 5),p2x)\n IntToReal(ys((1+i) MOD 5),p2y)\n IntToReal(xs((2+i) MOD 5),p3x)\n IntToReal(ys((2+i) MOD 5),p3y)\n IntToReal(xs((3+i) MOD 5),p4x)\n IntToReal(ys((3+i) MOD 5),p4y)\n Intersection(p1,p2,p3,p4,p)\n xs(5+i)=RealToInt(px)\n ys(5+i)=RealToInt(py)\n OD\n\n ;centers of triangles\n FOR i=0 TO 4\n DO\n xs(10+i)=(xs(i)+xs(5+i)+xs(5+(i+2) MOD 5))/3\n ys(10+i)=(ys(i)+ys(5+i)+ys(5+(i+2) MOD 5))/3\n OD\n\n ;center of pentagon\n xs(15)=0 ys(15)=0\n FOR i=5 TO 9\n DO\n xs(15)==+xs(i)\n ys(15)==+ys(i)\n OD\n xs(15)==/5 ys(15)==/5\n\n ;draw lines\n COLOR=c1\n FOR i=0 TO 5\n DO\n IF i=0 THEN\n Plot(xs(i MOD 5),ys(i MOD 5))\n ELSE\n DrawTo(xs(i MOD 5),ys(i MOD 5))\n FI\n OD\n\n ;fill\n COLOR=c2\n FOR i=10 TO 15\n DO\n FloodFill(xs(i),ys(i))\n OD\nRETURN\n\nPROC Main()\n BYTE CH=$02FC\n\n Graphics(7+16)\n SetColor(0,8,4)\n SetColor(1,8,8)\n SetColor(2,8,12)\n Pentagram(40,48,40,0,1,2)\n Pentagram(119,48,40,15,2,3)\n\n DO UNTIL CH#$FF OD\n CH=$FF\nRETURN\n","language":"Action-"},{"code":"with Ada.Numerics.Elementary_Functions;\n\nwith SDL.Video.Windows.Makers;\nwith SDL.Video.Renderers.Makers;\nwith SDL.Video.Rectangles;\nwith SDL.Events.Events;\n\nprocedure Pentagram is\n\n Width : constant := 600;\n Height : constant := 600;\n Offset : constant := 300.0;\n Radius : constant := 250.0;\n\n use SDL.Video.Rectangles;\n use SDL.C;\n\n Window : SDL.Video.Windows.Window;\n Renderer : SDL.Video.Renderers.Renderer;\n Event : SDL.Events.Events.Events;\n\n type Node_Id is mod 5;\n Nodes : array (Node_Id) of Point;\n\n procedure Calculate is\n use Ada.Numerics.Elementary_Functions;\n begin\n for I in Nodes'Range loop\n Nodes (I) := (X => int (Offset + Radius * Sin (Float (I), Cycle => 5.0)),\n Y => int (Offset - Radius * Cos (Float (I), Cycle => 5.0)));\n end loop;\n end Calculate;\n\n function Orient_2D (A, B, C : Point) return int is\n ((B.X - A.X) * (C.Y - A.Y) - (B.Y - A.Y) * (C.X - A.X));\n\n procedure Fill is\n Count : Natural;\n begin\n for Y in int (Offset - Radius) .. int (Offset + Radius) loop\n for X in int (Offset - Radius) .. int (Offset + Radius) loop\n Count := 0;\n for Node in Nodes'Range loop\n Count := Count +\n (if Orient_2D (Nodes (Node), Nodes (Node + 2), (X, Y)) > 0 then 1 else 0);\n end loop;\n if Count in 4 .. 5 then\n Renderer.Draw (Point => (X, Y));\n end if;\n end loop;\n end loop;\n end Fill;\n\n procedure Draw_Outline is\n begin\n for Node in Nodes'Range loop\n Renderer.Draw (Line => (Nodes (Node), Nodes (Node + 2)));\n end loop;\n end Draw_Outline;\n\n procedure Wait is\n use type SDL.Events.Event_Types;\n begin\n loop\n SDL.Events.Events.Wait (Event);\n exit when Event.Common.Event_Type = SDL.Events.Quit;\n end loop;\n end Wait;\n\nbegin\n if not SDL.Initialise (Flags => SDL.Enable_Screen) then\n return;\n end if;\n\n SDL.Video.Windows.Makers.Create (Win => Window,\n Title => \"Pentagram\",\n Position => SDL.Natural_Coordinates'(X => 10, Y => 10),\n Size => SDL.Positive_Sizes'(Width, Height),\n Flags => 0);\n SDL.Video.Renderers.Makers.Create (Renderer, Window.Get_Surface);\n Renderer.Set_Draw_Colour ((0, 0, 0, 255));\n Renderer.Fill (Rectangle => (0, 0, Width, Height));\n\n Calculate;\n Renderer.Set_Draw_Colour ((50, 50, 150, 255));\n Fill;\n Renderer.Set_Draw_Colour ((0, 220, 0, 255));\n Draw_Outline;\n Window.Update_Surface;\n\n Wait;\n Window.Finalize;\n SDL.Finalise;\nend Pentagram;\n","language":"Ada"},{"code":"100 XO = 140\n110 YO = 96\n120 S = 90\n130 B = 7\n140 F = 6\n150 C = 4\n200 POKE 230,64\n210 HCOLOR= B\n220 HPLOT 0,0\n230 CALL 62454\n240 A = 49232\n250 I = PEEK (A + 7) + PEEK (A + 2)\n260 I = PEEK (A + 5) + PEEK (A)\n300 SX = S\n310 SY = S\n320 PI = 3.1415926535\n330 E = PI * 4\n340 S = PI / 1.25\n350 X = SIN (0)\n360 Y = COS (0)\n370 HCOLOR= F\n380 PX = XO + X * SX\n390 PY = YO - Y * SY\n400 FOR I = 0 TO E STEP S\n410 X = SIN (I)\n420 Y = COS (I)\n430 FOR J = 0 TO SX\n440 HPLOT PX,PY TO XO + X * J,YO - Y * J\n450 NEXT J\n460 PX = XO + X * SX\n470 PY = YO - Y * SY\n480 NEXT I\n500 HCOLOR= C\n510 PX = XO + X * SX\n520 PY = YO - Y * SY\n600 FOR I = S TO E STEP S\n610 X = SIN (I)\n620 Y = COS (I)\n630 HPLOT PX,PY TO XO + X * SX,YO - Y * SY\n640 HPLOT PX + 1,PY TO XO + X * SX + 1,YO - Y * SY\n650 HPLOT PX,PY + 1 TO XO + X * SX,YO - Y * SY + 1\n660 HPLOT PX + 1,PY + 1 TO XO + X * SX + 1,YO - Y * SY + 1\n670 PX = XO + X * SX\n680 PY = YO - Y * SY\n690 NEXT I\n","language":"Applesoft-BASIC"},{"code":"#Include Gdip.ahk\t; https://autohotkey.com/boards/viewtopic.php?f=6&t=6517\nWidth :=A_ScreenWidth, Height := A_ScreenHeight\nGui, 1: +E0x20 +Caption +E0x80000 +LastFound +AlwaysOnTop +ToolWindow +OwnDialogs\nGui, 1: Show, NA\nhwnd1 := WinExist()\nOnExit, Exit\n\nIf !pToken := Gdip_Startup()\n{\n\tMsgBox, 48, gdiplus error!, Gdiplus failed to start.\n\t. Please ensure you have gdiplus on your system\n\tExitApp\n}\n\nhbm := CreateDIBSection(Width, Height)\nhdc := CreateCompatibleDC()\nobm := SelectObject(hdc, hbm)\nG := Gdip_GraphicsFromHDC(hdc)\nGdip_SetSmoothingMode(G, 4)\npBrush \t:= Gdip_BrushCreateSolid(0xFF6495ED)\npPen \t:= Gdip_CreatePen(0xff000000, 3)\n\n;---------------------------------\nLL := 165\nCx := Floor(A_ScreenWidth/2)\nCy := Floor(A_ScreenHeight/2)\nphi := 54\n;---------------------------------\nloop, 5\n{\n\ttheta := abs(180-144-phi)\n\tp1x := Floor(Cx + LL * Cos(phi * 0.01745329252))\n\tp1y := Floor(Cy + LL * Sin(phi * 0.01745329252))\n\tp2x := Floor(Cx - LL * Cos(theta * 0.01745329252))\n\tp2y := Floor(Cy - LL * Sin(theta * 0.01745329252))\n\tphi+= 72\n\tGdip_FillPolygon(G, pBrush, p1x \",\" p1y \"|\" Cx \",\" Cy \"|\" p2x \",\" p2y)\n}\nloop, 5\n{\n\ttheta := abs(180-144-phi)\n\tp1x := Floor(Cx + LL * Cos(phi * 0.01745329252))\n\tp1y := Floor(Cy + LL * Sin(phi * 0.01745329252))\n\tp2x := Floor(Cx - LL * Cos(theta * 0.01745329252))\n\tp2y := Floor(Cy - LL * Sin(theta * 0.01745329252))\n\tphi+= 72\n\tGdip_DrawLines(G, pPen, p1x \",\" p1y \"|\" p2x \",\" p2y ) ; \"|\" Cx \",\" Cy )\n}\nUpdateLayeredWindow(hwnd1, hdc, 0, 0, Width, Height)\nGdip_DeleteBrush(pBrush)\nSelectObject(hdc, obm)\nDeleteObject(hbm)\nDeleteDC(hdc)\nGdip_DeleteGraphics(G)\nreturn\n;----------------------------------------------------------------------\nEsc::\nExit:\nGdip_Shutdown(pToken)\nExitApp\nReturn\n","language":"AutoHotkey"},{"code":"#include<graphics.h>\n#include<stdio.h>\n#include<math.h>\n\n#define pi M_PI\n\nint main(){\n\t\n\tchar colourNames[][14] = { \"BLACK\", \"BLUE\", \"GREEN\", \"CYAN\", \"RED\", \"MAGENTA\", \"BROWN\", \"LIGHTGRAY\", \"DARKGRAY\",\n \"LIGHTBLUE\", \"LIGHTGREEN\", \"LIGHTCYAN\", \"LIGHTRED\", \"LIGHTMAGENTA\", \"YELLOW\", \"WHITE\" };\n\t\t\t\n\tint stroke=0,fill=0,back=0,i;\n\t\n\tdouble centerX = 300,centerY = 300,coreSide,armLength,pentaLength;\n\t\n\tprintf(\"Enter core pentagon side length : \");\n\tscanf(\"%lf\",&coreSide);\n\t\n\tprintf(\"Enter pentagram arm length : \");\n\tscanf(\"%lf\",&armLength);\n\t\n\tprintf(\"Available colours are :\\n\");\n\t\n\tfor(i=0;i<16;i++){\n\t\tprintf(\"%d. %s\\t\",i+1,colourNames[i]);\n\t\tif((i+1) % 3 == 0){\n\t\t\tprintf(\"\\n\");\n\t\t}\n\t}\n\t\n\twhile(stroke==fill && fill==back){\n\t\tprintf(\"\\nEnter three diffrenet options for stroke, fill and background : \");\n\t\tscanf(\"%d%d%d\",&stroke,&fill,&back);\n\t}\n\t\n\tpentaLength = coreSide/(2 * tan(pi/5)) + sqrt(armLength*armLength - coreSide*coreSide/4);\n\t\n\tinitwindow(2*centerX,2*centerY,\"Pentagram\");\n\t\t\n\tsetcolor(stroke-1);\n\t\n\tsetfillstyle(SOLID_FILL,back-1);\n\t\n\tbar(0,0,2*centerX,2*centerY);\n\t\n\tfloodfill(centerX,centerY,back-1);\n\t\n\tsetfillstyle(SOLID_FILL,fill-1);\n\n\tfor(i=0;i<5;i++){\n\t\tline(centerX + coreSide*cos(i*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5)/(2*sin(pi/5)),centerX + coreSide*cos((i+1)*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin((i+1)*2*pi/5)/(2*sin(pi/5)));\n\t\tline(centerX + coreSide*cos(i*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5)/(2*sin(pi/5)),centerX + pentaLength*cos(i*2*pi/5 + pi/5),centerY + pentaLength*sin(i*2*pi/5 + pi/5));\n\t\tline(centerX + coreSide*cos((i+1)*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin((i+1)*2*pi/5)/(2*sin(pi/5)),centerX + pentaLength*cos(i*2*pi/5 + pi/5),centerY + pentaLength*sin(i*2*pi/5 + pi/5));\n\t\t\n\t\tfloodfill(centerX + coreSide*cos(i*2*pi/5 + pi/10)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5 + pi/10)/(2*sin(pi/5)),stroke-1);\n\t}\n\t\n\tfloodfill(centerX,centerY,stroke-1);\n\t\n\tgetch();\n\t\n\tclosegraph();\n}\n","language":"C"},{"code":"unit Main;\n\ninterface\n\nuses\n Winapi.Windows, Vcl.Graphics, Vcl.Forms, System.Math;\n\ntype\n TForm1 = class(TForm)\n procedure FormCreate(Sender: TObject);\n procedure FormPaint(Sender: TObject);\n private\n procedure DrawPentagram(len, x, y: Integer; fill, stoke: TColor);\n { Private declarations }\n public\n { Public declarations }\n end;\n\nvar\n Form1: TForm1;\n degrees144: double;\n degrees72: double;\n degrees18: double;\n\nimplementation\n\n{$R *.dfm}\n\nprocedure TForm1.FormCreate(Sender: TObject);\nbegin\n ClientHeight := 640;\n ClientWidth := 640;\n degrees144 := DegToRad(144);\n degrees72 := DegToRad(72);\n degrees18 := DegToRad(18);\nend;\n\nprocedure CreatePolygon(len, x, y, n: integer; ang: double; var points: TArray<TPoint>);\nvar\n angle: Double;\n index, i, x2, y2: Integer;\nbegin\n angle := 0;\n index := 0;\n SetLength(points, n + 1);\n points[index].Create(x, y);\n\n for i := 1 to n do\n begin\n x2 := x + round(len * cos(angle));\n y2 := y + round(len * sin(-angle));\n x := x2;\n y := y2;\n angle := angle - ang;\n\n points[index].Create(x2, y2);\n inc(index);\n end;\n points[index].Create(points[0]);\nend;\n\nprocedure TForm1.DrawPentagram(len, x, y: Integer; fill, stoke: TColor);\nvar\n points, points_internal: TArray<TPoint>;\n L, H: Integer;\nbegin\n // Calc of sides for draw internal pollygon\n // 2H+L = len -> 2H = len - L\n // L = 2H*sin(36/2) (Pythagorean theorem)\n // L = (len-L)sin(18)\n // L = len*sin(18)/[1+sin(18)]\n\n L := round(len * sin(degrees18) / (1 + sin(degrees18)));\n\n // H = (len - L)/2\n\n H := (len - L) div 2;\n\n CreatePolygon(L, x + H, y, 5, degrees72, points_internal);\n CreatePolygon(len, x, y, 5, degrees144, points);\n\n with Canvas, Canvas.Brush do\n begin\n with pen do\n begin\n Color := stoke;\n Style := psSolid;\n Width := 5;\n end;\n Color := fill;\n Polygon(points_internal);\n Polygon(points);\n end;\nend;\n\nprocedure TForm1.FormPaint(Sender: TObject);\nbegin\n with Canvas, Brush do\n begin\n Style := bsSolid;\n Color := clWhite;\n // fill background with white\n FillRect(ClientRect);\n end;\n drawPentagram(500, 70, 250, $ED9564, clDkGray);\nend;\n\nend.\n","language":"Delphi"},{"code":"object Form1: TForm1\n OnCreate = FormCreate\n OnPaint = FormPaint\nend\n","language":"Delphi"},{"code":"xp = 10\nyp = 60\nlinewidth 2\nmove xp yp\nwhile angle < 720\n x = xp + cos angle * 80\n y = yp + sin -angle * 80\n line x y\n f[] &= x\n f[] &= y\n xp = x\n yp = y\n angle += 144\n.\ncolor 900\npolygon f[]\n","language":"EasyLang"},{"code":"package main\n\nimport (\n \"github.com/fogleman/gg\"\n \"math\"\n)\n\nfunc Pentagram(x, y, r float64) []gg.Point {\n points := make([]gg.Point, 5)\n for i := 0; i < 5; i++ {\n fi := float64(i)\n angle := 2*math.Pi*fi/5 - math.Pi/2\n points[i] = gg.Point{x + r*math.Cos(angle), y + r*math.Sin(angle)}\n }\n return points\n}\n\nfunc main() {\n points := Pentagram(320, 320, 250)\n dc := gg.NewContext(640, 640)\n dc.SetRGB(1, 1, 1) // White\n dc.Clear()\n for i := 0; i <= 5; i++ {\n index := (i * 2) % 5\n p := points[index]\n dc.LineTo(p.X, p.Y)\n }\n dc.SetHexColor(\"#6495ED\") // Cornflower Blue\n dc.SetFillRule(gg.FillRuleWinding)\n dc.FillPreserve()\n dc.SetRGB(0, 0, 0) // Black\n dc.SetLineWidth(5)\n dc.Stroke()\n dc.SavePNG(\"pentagram.png\")\n}\n","language":"Go"},{"code":"-- Extract the vertices of a pentagon, re-ordering them so that drawing lines\n-- from one to the next forms a pentagram. Set the line's thickness and its\n-- colour, as well as the fill and background colours. Make the background a\n-- bit larger than the pentagram.\n\nimport Diagrams.Prelude\nimport Diagrams.Backend.SVG.CmdLine\n\npentagram = let [a, b, c, d, e] = trailVertices $ pentagon 1\n in [a, c, e, b, d]\n # fromVertices\n # closeTrail\n # strokeTrail\n # lw ultraThick\n # fc springgreen\n # lc blue\n # bgFrame 0.2 bisque\n\nmain = mainWith (pentagram :: Diagram B)\n","language":"Haskell"},{"code":"100 PROGRAM \"Pentagra.bas\"\n110 OPTION ANGLE DEGREES\n120 GRAPHICS HIRES 4\n130 SET PALETTE BLUE,CYAN,YELLOW,BLACK\n140 PLOT 640,700,ANGLE 288;\n150 FOR I=1 TO 5\n160 PLOT FORWARD 700,RIGHT 144;\n170 NEXT\n180 SET INK 3\n190 SET BEAM OFF:PLOT 0,0,PAINT\n","language":"IS-BASIC"},{"code":"require'plot'\nplot j./2 1 o./180p_1 %~ 144*i. 6\n","language":"J"},{"code":"import java.awt.*;\nimport java.awt.geom.Path2D;\nimport javax.swing.*;\n\npublic class Pentagram extends JPanel {\n\n final double degrees144 = Math.toRadians(144);\n\n public Pentagram() {\n setPreferredSize(new Dimension(640, 640));\n setBackground(Color.white);\n }\n\n private void drawPentagram(Graphics2D g, int len, int x, int y,\n Color fill, Color stroke) {\n double angle = 0;\n\n Path2D p = new Path2D.Float();\n p.moveTo(x, y);\n\n for (int i = 0; i < 5; i++) {\n int x2 = x + (int) (Math.cos(angle) * len);\n int y2 = y + (int) (Math.sin(-angle) * len);\n p.lineTo(x2, y2);\n x = x2;\n y = y2;\n angle -= degrees144;\n }\n p.closePath();\n\n g.setColor(fill);\n g.fill(p);\n\n g.setColor(stroke);\n g.draw(p);\n }\n\n @Override\n public void paintComponent(Graphics gg) {\n super.paintComponent(gg);\n Graphics2D g = (Graphics2D) gg;\n\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\n RenderingHints.VALUE_ANTIALIAS_ON);\n\n g.setStroke(new BasicStroke(5, BasicStroke.CAP_ROUND, 0));\n\n drawPentagram(g, 500, 70, 250, new Color(0x6495ED), Color.darkGray);\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(\"Pentagram\");\n f.setResizable(false);\n f.add(new Pentagram(), BorderLayout.CENTER);\n f.pack();\n f.setLocationRelativeTo(null);\n f.setVisible(true);\n });\n }\n}\n","language":"Java"},{"code":"# Input: {svg, minx, miny, maxx, maxy}\ndef svg:\n # viewBox = <min-x> <min-y> <width> <height>\n \"<svg viewBox='\\(.minx - 4|floor) \\(.miny - 4 |floor) \\(6 + .maxx - .minx|ceil) \\(6 + .maxy - .miny|ceil)'\",\n \" preserveAspectRatio='xMinYmin meet'\",\n \" xmlns='http://www.w3.org/2000/svg' >\",\n .svg,\n \"</svg>\" ;\n\n# Input: an array of [x,y] points\ndef minmax:\n {minx: (map(.[0])|min),\n miny: (map(.[1])|min),\n maxx: (map(.[0])|max),\n maxy: (map(.[1])|max)} ;\n\n# Input: an array of [x,y] points\ndef Polyline($fill; $stroke; $transform):\n def rnd: 1000*.|round/1000;\n def linearize: map( map(rnd) | join(\" \") ) | join(\", \");\n\n \"<polyline points='\"\n + linearize\n + \"'\\n style='fill:\\($fill); stroke: \\($stroke); stroke-width:3;'\"\n + \"\\n transform='\\($transform)' />\" ;\n\n# Output: {minx, miny, maxx, maxy, svg}\ndef pentagram($dim):\n (8 * (1|atan)) as $tau\n | 5 as $sides\n | [ (0, 2, 4, 1, 3, 0)\n | [ 0.9 * $dim * (($tau * $v / $sides) | cos),\n 0.9 * $dim * (($tau * $v / $sides) | sin) ] ]\n | minmax\n + {svg: Polyline(\"seashell\"; \"blue\"; \"rotate(-18)\" )} ;\n\npentagram(200)\n| svg\n","language":"Jq"},{"code":"using Luxor\n\nfunction drawpentagram(path::AbstractString, w::Integer=1000, h::Integer=1000)\n Drawing(h, w, path)\n origin()\n setline(16)\n\n # To get a different color border from the fill, draw twice, first with fill, then without.\n sethue(\"aqua\")\n star(0, 0, 500, 5, 0.39, 3pi/10, :fill)\n\n sethue(\"navy\")\n verts = star(0, 0, 500, 5, 0.5, 3pi/10, vertices=true)\n poly([verts[i] for i in [1,5,9,3,7,1]], :stroke)\n finish()\n preview()\nend\n\ndrawpentagram(\"data/pentagram.png\")\n","language":"Julia"},{"code":"// version 1.1.2\n\nimport java.awt.*\nimport java.awt.geom.Path2D\nimport javax.swing.*\n\nclass Pentagram : JPanel() {\n init {\n preferredSize = Dimension(640, 640)\n background = Color.white\n }\n\n private fun drawPentagram(g: Graphics2D, len: Int, x: Int, y: Int,\n fill: Color, stroke: Color) {\n var x2 = x.toDouble()\n var y2 = y.toDouble()\n var angle = 0.0\n val p = Path2D.Float()\n p.moveTo(x2, y2)\n\n for (i in 0..4) {\n x2 += Math.cos(angle) * len\n y2 += Math.sin(-angle) * len\n p.lineTo(x2, y2)\n angle -= Math.toRadians(144.0)\n }\n\n p.closePath()\n with(g) {\n color = fill\n fill(p)\n color = stroke\n draw(p)\n }\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 g.stroke = BasicStroke(5.0f, BasicStroke.CAP_ROUND, 0)\n drawPentagram(g, 500, 70, 250, Color(0x6495ED), Color.darkGray)\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 = \"Pentagram\"\n isResizable = false\n add(Pentagram(), BorderLayout.CENTER)\n pack()\n setLocationRelativeTo(null)\n isVisible = true\n }\n }\n}\n","language":"Kotlin"},{"code":"local cos, sin, floor, pi = math.cos, math.sin, math.floor, math.pi\n\nfunction Bitmap:render()\n for y = 1, self.height do\n print(table.concat(self.pixels[y]))\n end\nend\n\nfunction Bitmap:pentagram(x, y, radius, rotation, outlcolor, fillcolor)\n local function pxy(i) return x+radius*cos(i*pi*2/5+rotation), y+radius*sin(i*pi*2/5+rotation) end\n local x1, y1 = pxy(0)\n for i = 1, 5 do\n local x2, y2 = pxy(i*2) -- btw: pxy(i) ==> pentagon\n self:line(floor(x1*2), floor(y1), floor(x2*2), floor(y2), outlcolor)\n x1, y1 = x2, y2\n end\n self:floodfill(floor(x*2), floor(y), fillcolor)\n radius = radius / 2\n for i = 1, 5 do\n x1, y1 = pxy(i)\n self:floodfill(floor(x1*2), floor(y1), fillcolor)\n end\nend\n\nbitmap = Bitmap(40*2,40)\nbitmap:clear(\".\")\nbitmap:pentagram(20, 22, 20, -pi/2, \"@\", '+')\nbitmap:render()\n","language":"Lua"},{"code":"with(geometry):\nRegularStarPolygon(middle, 5/2, point(c, 0, 0), 1):\nv := [seq(coordinates(i), i in DefinedAs(middle))]:\npentagram := plottools[rotate](plottools[polygon](v), Pi/2):\nplots[display](pentagram, colour = yellow, axes = none);\n","language":"Maple"},{"code":"Graphics[{\n EdgeForm[Directive[Thickness[0.01], RGBColor[0, 0, 1]]],(*Edge coloring*)\n RGBColor[0.5, 0.5, .50], (*Fill coloring*)\n Polygon[AnglePath[Table[6 Pi/5, 5]]]}\n ]\n","language":"Mathematica"},{"code":"import libgd\nfrom math import sin, cos, degToRad\n\nconst\n width = 500\n height = width\n outerRadius = 200\n\nproc main() =\n\n proc calcPosition(x: int, y: int, radius: int, posAngle: float): (cint, cint) =\n var width = int(radius.float * sin(degToRad(posAngle)))\n var height = int(radius.float * cos(degToRad(posAngle)))\n return (cast[cint](x + width), cast[cint](y - height))\n\n proc getPentagonPoints(startAngle = 0, radius: int): array[5, array[2, int]] =\n let spacingAngle = 360 / 5\n\n var posAngle = (90 - startAngle).float\n\n var n = 0\n var points: array[5, array[2, int]]\n while n < 5:\n (points[n][0], points[n][1]) = calcPosition(250, 250, radius, posAngle)\n n += 1\n posAngle -= spacingAngle\n\n return points\n\n let outerPentagon = getPentagonPoints(18, outerRadius) # rotate 18 degrees\n let innerPentagon = getPentagonPoints(54, int((cos(degToRad(72.0))/cos(degToRad(36.0))) * outerRadius)) # rotate 54 degrees\n\n var pentagram: array[10, array[2, int]]\n var n = 0\n for i in countup(0, 4):\n pentagram[n] = outerPentagon[i]\n inc(n)\n pentagram[n] = innerPentagon[i]\n inc(n)\n\n withGd imageCreate(width, height) as img:\n discard img.setColor(255, 255, 255)\n\n let black = img.setColor(0x404040)\n let blue = img.setColor(0x6495ed)\n\n img.drawPolygon(\n points=pentagram,\n color=blue,\n fill=true,\n open=false)\n\n img.setThickness(4)\n\n img.drawPolygon(\n points=pentagram,\n color=black,\n fill=false,\n open=false)\n\n img.drawPolygon(\n points=innerPentagon,\n color=black,\n fill=false,\n open=false)\n\n let png_out = open(\"pentagram.png\", fmWrite)\n img.writePng(png_out)\n\n png_out.close()\n\nmain()\n","language":"Nim"},{"code":"/* REXX ***************************************************************\n* Create a BMP file showing a pentagram\n**********************************************************************/\npentagram='pentagram.bmp'\n'erase' pentagram\ns='424d4600000000000000360000002800000038000000280000000100180000000000'X\ns=s'1000000000000000000000000000000000000000'x\nSay 'sl='length(s)\nz.0=0\nwhite='ffffff'x\nred ='00ff00'x\ngreen='ff0000'x\nblue ='0000ff'x\nrd6=copies(rd,6)\nm=133\nm=80\nn=80\nhor=m*8 /* 56 */\nver=n*8 /* 40 */\nSay 'hor='hor\nSay 'ver='ver\nSay 'sl='length(s)\ns=overlay(lend(hor),s,19,4)\ns=overlay(lend(ver),s,23,4)\nSay 'sl='length(s)\nz.=copies('ffffff'x,3192%3)\nz.=copies('ffffff'x,8*m)\nz.0=648\ns72 =RxCalcsin(72,,'D')\nc72 =RxCalccos(72,,'D')\ns144=RxCalcsin(144,,'D')\nc144=RxCalccos(144,,'D')\nxm=300\nym=300\nr=200\np.0x.1=xm\np.0y.1=ym+r\np.0x.2=format(xm+r*s72,3,0)\np.0y.2=format(ym+r*c72,3,0)\np.0x.3=format(xm+r*s144,3,0)\np.0y.3=format(ym+r*c144,3,0)\np.0x.4=format(xm-r*s144,3,0)\np.0y.4=p.0y.3\np.0x.5=format(xm-r*s72,3,0)\np.0y.5=p.0y.2\nDo i=1 To 5\n Say p.0x.i p.0y.i\n End\nCall line p.0x.1,p.0y.1,p.0x.3,p.0y.3\nCall line p.0x.1,p.0y.1,p.0x.4,p.0y.4\nCall line p.0x.2,p.0y.2,p.0x.4,p.0y.4\nCall line p.0x.2,p.0y.2,p.0x.5,p.0y.5\nCall line p.0x.3,p.0y.3,p.0x.5,p.0y.5\n\nDo i=1 To z.0\n s=s||z.i\n End\n\nCall lineout pentagram,s\nCall lineout pentagram\nExit\n\nlend:\nReturn reverse(d2c(arg(1),4))\n\nline: Procedure Expose z. red green blue\nParse Arg x0, y0, x1, y1\nSay 'line' x0 y0 x1 y1\ndx = abs(x1-x0)\ndy = abs(y1-y0)\nif x0 < x1 then sx = 1\n else sx = -1\nif y0 < y1 then sy = 1\n else sy = -1\nerr = dx-dy\n\nDo Forever\n xxx=x0*3+2\n Do yy=y0-1 To y0+1\n z.yy=overlay(copies(blue,5),z.yy,xxx)\n End\n if x0 = x1 & y0 = y1 Then Leave\n e2 = 2*err\n if e2 > -dy then do\n err = err - dy\n x0 = x0 + sx\n end\n if e2 < dx then do\n err = err + dx\n y0 = y0 + sy\n end\n end\nReturn\n::requires RxMath Library\n","language":"OoRexx"},{"code":"use SVG;\n\nmy $tau = 2 * 4*atan2(1, 1);\nmy $dim = 200;\nmy $sides = 5;\n\nfor $v (0, 2, 4, 1, 3, 0) {\n push @vx, 0.9 * $dim * cos($tau * $v / $sides);\n push @vy, 0.9 * $dim * sin($tau * $v / $sides);\n}\n\nmy $svg= SVG->new( width => 2*$dim, height => 2*$dim);\n\nmy $points = $svg->get_path(\n x => \\@vx,\n y => \\@vy,\n -type => 'polyline',\n);\n\n$svg->rect (\n width => \"100%\",\n height => \"100%\",\n style => {\n 'fill' => 'bisque'\n }\n);\n\n$svg->polyline (\n %$points,\n style => {\n 'fill' => 'seashell',\n 'stroke' => 'blue',\n 'stroke-width' => 3,\n },\n transform => \"translate($dim,$dim) rotate(-18)\"\n);\n\nopen $fh, '>', 'pentagram.svg';\nprint $fh $svg->xmlify(-namespace=>'svg');\nclose $fh;\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #000080;font-style:italic;\">--\n -- demo\\rosetta\\Pentagram.exw\n -- ==========================\n --\n -- Start/stop rotation by pressing space. Resizeable.\n -- ZXYV stop any rotation and orient up/down/left/right.\n --</span>\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">include</span> <span style=\"color: #000000;\">pGUI</span><span style=\"color: #0000FF;\">.</span><span style=\"color: #000000;\">e</span>\n\n <span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">timer</span>\n <span style=\"color: #004080;\">cdCanvas</span> <span style=\"color: #000000;\">cdcanvas</span>\n\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">enum</span> <span style=\"color: #000000;\">FILL</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">BORDER</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">colours</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">CD_BLUE</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">CD_RED</span><span style=\"color: #0000FF;\">},</span>\n <span style=\"color: #000000;\">modes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">CD_FILL</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">CD_CLOSED_LINES</span><span style=\"color: #0000FF;\">}</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">redraw_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000080;font-style:italic;\">/*posx*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000080;font-style:italic;\">/*posy*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupGetIntInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"DRAWSIZE\"</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cx</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cy</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">radius</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">min</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cx</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">cy</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">0.9</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasActivate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasClear</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetFillMode</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_WINDING</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetLineWidth</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">round</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radius</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">100</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">FILL</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">BORDER</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #7060A8;\">cdCanvasSetForeground</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">colours</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #7060A8;\">cdCanvasBegin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">modes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">mode</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">90</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">666</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">144</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">a</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">rot</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #004600;\">CD_DEG2RAD</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radius</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">cos</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">cx</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">radius</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #7060A8;\">sin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">cy</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasVertex</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">cdCanvasEnd</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">cdCanvasFlush</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">map_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">cdcanvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cdCreateCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">CD_IUP</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ih</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">cdCanvasSetBackground</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">cdcanvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">CD_PARCHMENT</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_DEFAULT</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">timer_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">rot</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">359</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">360</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupRedraw</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_IGNORE</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">key_cb</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">Ihandle</span> <span style=\"color: #000080;font-style:italic;\">/*ih*/</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #004600;\">K_ESC</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CLOSE</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">upper</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">timer</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"RUN\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">IupGetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">timer</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"RUN\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"ZYXV\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupSetInt</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">timer</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"RUN\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">rot</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">90</span>\n <span style=\"color: #7060A8;\">IupRedraw</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">IUP_CONTINUE</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupOpen</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">canvas</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupCanvas</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"RASTERSIZE=640x640\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"MAP_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"map_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"ACTION\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"redraw_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #000000;\">dlg</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupDialog</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">`TITLE=\"Pentagram\"`</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetCallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"KEY_CB\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"key_cb\"</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #7060A8;\">IupShow</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">dlg</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #7060A8;\">IupSetAttribute</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">canvas</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #008000;\">\"RASTERSIZE\"</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004600;\">NULL</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">timer</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">IupTimer</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">Icallback</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"timer_cb\"</span><span style=\"color: #0000FF;\">),</span> <span style=\"color: #000000;\">80</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">active</span><span style=\"color: #0000FF;\">:=</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">platform</span><span style=\"color: #0000FF;\">()!=</span><span style=\"color: #004600;\">JS</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">IupMainLoop</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">IupClose</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">without</span> <span style=\"color: #008080;\">js</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">HDR</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n <?xml version=\"1.0\" standalone=\"no\" ?>\n <!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.0//EN\"\n \"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\">\n <svg height=\"%d\" width=\"%d\" style=\"\" xmlns=\"http://www.w3.org/2000/svg\">\n <rect height=\"100%%\" width=\"100%%\" style=\"fill:black;\" />\n \"\"\"</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">LINE</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\"\"\"\n <polyline points=\"%s\"\n style=\"fill:blue; stroke:white; stroke-width:3;\"\n transform=\"translate(%d, %d) rotate(-18)\" />\n \"\"\"</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">pentagram</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">dim</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">200</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">sides</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">)</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">sides</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">sides</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">theta</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">PI</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">*(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)/</span><span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">cos</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">theta</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">dim</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sin</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">theta</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">dim</span>\n <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%.3f\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"%.3f\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">)}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">v</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">q</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #000000;\">v</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #004080;\">string</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">HDR</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dim</span><span style=\"color: #0000FF;\">*</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #7060A8;\">sprintf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">LINE</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">q</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">dim</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">dim</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #008000;\">\"</svg>\\n\"</span>\n\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">pentagram</span><span style=\"color: #0000FF;\">())</span>\n<!--\n","language":"Phix"},{"code":"%!PS-Adobe-3.0 EPSF\n%%BoundingBox: 0 0 200 600\n\n/n 5 def % 5-star; can be set to other odd numbers\n\n/s { gsave } def\n/r { grestore } def\n/g { .7 setgray } def\n/t { 100 exch translate } def\n/p {\n\t180 90 n div sub rotate\n\t0 0 moveto\n\tn { 0 160 rlineto 180 180 n div sub rotate } repeat\n\tclosepath\n} def\n\ns 570 t p s g eofill r stroke r\t\t% even-odd fill\ns 370 t p s g fill r stroke r\t\t% non-zero fill\ns 170 t p s 2 setlinewidth stroke r g fill r % non-zero, but hide inner strokes\n\n%%EOF\n","language":"PostScript"},{"code":"%!PS-Adobe-3.0 EPSF\n%%BoundingBox: 0 0 400 400\n\n% randomly choose from 5- to 35-stars\n/maxpoint 35 def\n/minpoint 5 def\n/maxradius 30 def\n\n/rnd1 { rand 16#80000000 div } def\n/rnd { rnd1 mul} def\n/rndi { 2 index sub rnd1 mul 1 index div cvi mul add} def\n/line { rotate 0 rlineto } def\n\n/star { gsave\n\t/n minpoint 2 maxpoint rndi def\n\t/r maxradius rnd def\n\t/a 180 180 n div sub def\n\t/b 360 a n mul sub n div def\n\n\t400 rnd 400 rnd translate 360 rnd rotate\n\t0 0 moveto n { r a line r b line } repeat closepath\n\trnd1 rnd1 rnd1 3 { 2 index 1 exch sub } repeat\n\tgsave setrgbcolor fill grestore setrgbcolor stroke\n\tgrestore } def\n\n0 setlinewidth 2000 {star} repeat showpage\n%%EOF\n","language":"PostScript"},{"code":"//Aamrun, 29th June 2022\n\nsize(1000,1000);\n\ntranslate(width/2,height/2);\nrotate(3*PI/2);\nfill(#0000ff);\n\nbeginShape();\nfor(int i=0;i<10;i+=2){\n\n vertex(450*cos(i*2*PI/5),450*sin(i*2*PI/5));\n}\nendShape(CLOSE);\n","language":"Processing"},{"code":"import turtle\n\nturtle.bgcolor(\"green\")\nt = turtle.Turtle()\nt.color(\"red\", \"blue\")\nt.begin_fill()\nfor i in range(0, 5):\n t.forward(200)\n t.right(144)\nt.end_fill()\n","language":"Python"},{"code":"[ $ \"turtleduck.qky\" loadfile ] now!\n\n[ [ 1 1\n 30 times\n [ tuck + ]\n swap join ] constant\n do ] is phi ( --> n/d )\n\n[ 5 times\n [ 2dup walk\n 1 5 turn\n 2dup walk\n 3 5 turn ]\n 2drop ] is star ( n/d --> )\n\n[ 5 times\n [ 2dup walk\n 2 5 turn ]\n 2drop ] is pentagram ( n/d --> )\n\nturtle\n' [ 79 126 229 ] fill [ 200 1 star ]\n10 wide\n-1 10 turn\n200 1 phi v* phi v* pentagram\n1 10 turn\n","language":"Quackery"},{"code":"p <- cbind(x = c(0, 1, 2,-0.5 , 2.5 ,0),\n y = c(0, 1, 0,0.6, 0.6,0))\nplot(p)\nlines(p)\n","language":"R"},{"code":"#lang racket\n(require 2htdp/image)\n\n(overlay\n (star-polygon 100 5 2 \"outline\" (make-pen \"blue\" 4 \"solid\" \"round\" \"round\"))\n (star-polygon 100 5 2 \"solid\" \"cyan\"))\n","language":"Racket"},{"code":"use SVG;\n\nconstant $dim = 200;\nconstant $sides = 5;\n\nmy @vertices = map { 0.9 * $dim * cis($_ * τ / $sides) }, ^$sides;\n\nmy @points = map |*.reals.fmt(\"%0.3f\"),\n flat @vertices[0, 2 ... *], @vertices[1, 3 ... *], @vertices[0];\n\nsay SVG.serialize(\n svg => [\n :width($dim*2), :height($dim*2),\n :rect[:width<100%>, :height<100%>, :style<fill:bisque;>],\n :polyline[ :points(@points.join: ','),\n :style(\"stroke:blue; stroke-width:3; fill:seashell;\"),\n :transform(\"translate($dim,$dim) rotate(-90)\")\n ],\n ],\n);\n","language":"Raku"},{"code":"Red [\n\tSource: https://github.com/vazub/rosetta-red\n\tTabs: 4\n\tNeeds: 'View\n]\n\ncanvas: 500x500\ncenter: as-pair canvas/x / 2 canvas/y / 2\nradius: 200\n\npoints: collect [\n\trepeat vertex 10 [\n\t\tangle: vertex * 36 + 18 ;-- +18 is required for pentagram rotation\n\t\teither vertex // 2 = 1 [\n\t\t\tkeep as-pair (cosine angle) * radius + center/x (sine angle) * radius + center/y\n\t\t][\n\t\t\tkeep as-pair (cosine angle) * radius * 0.382 + center/x (sine angle) * radius * 0.382 + center/y\n\t\t]\n\t]\n]\n\nview [\n\ttitle \"Pentagram\"\n\tbase canvas white\n\tdraw compose/deep [\n\t\tfill-pen mint\n\t\tpolygon (points)\n\t\tline-width 3\n\t\tline (points/1) (points/5) (points/9) (points/3) (points/7) (points/1)\n\t]\n]\n","language":"Red"},{"code":"/* REXX ***************************************************************\n* Create a BMP file showing a pentagram\n**********************************************************************/\nParse Version v\nIf pos('Regina',v)>0 Then\n pentagram='pentagrama.bmp'\nElse\n pentagram='pentagramx.bmp'\n'erase' pentagram\ns='424d4600000000000000360000002800000038000000280000000100180000000000'X||,\n '1000000000000000000000000000000000000000'x\nSay 'sl='length(s)\nz.0=0\nwhite='ffffff'x\nred ='00ff00'x\ngreen='ff0000'x\nblue ='0000ff'x\nrd6=copies(rd,6)\nm=133\nm=80\nn=80\nhor=m*8 /* 56 */\nver=n*8 /* 40 */\nSay 'hor='hor\nSay 'ver='ver\nSay 'sl='length(s)\ns=overlay(lend(hor),s,19,4)\ns=overlay(lend(ver),s,23,4)\nSay 'sl='length(s)\nz.=copies('ffffff'x,3192%3)\nz.=copies('ffffff'x,8*m)\nz.0=648\npi_5=2*3.14159/5\ns72 =sin(pi_5 )\nc72 =cos(pi_5 )\ns144=sin(pi_5*2)\nc144=cos(pi_5*2)\nxm=300\nym=300\nr=200\np.0x.1=xm\np.0y.1=ym+r\n\np.0x.2=format(xm+r*s72,3,0)\np.0y.2=format(ym+r*c72,3,0)\np.0x.3=format(xm+r*s144,3,0)\np.0y.3=format(ym+r*c144,3,0)\np.0x.4=format(xm-r*s144,3,0)\np.0y.4=p.0y.3\np.0x.5=format(xm-r*s72,3,0)\np.0y.5=p.0y.2\nDo i=1 To 5\n Say p.0x.i p.0y.i\n End\nCall line p.0x.1,p.0y.1,p.0x.3,p.0y.3\nCall line p.0x.1,p.0y.1,p.0x.4,p.0y.4\nCall line p.0x.2,p.0y.2,p.0x.4,p.0y.4\nCall line p.0x.2,p.0y.2,p.0x.5,p.0y.5\nCall line p.0x.3,p.0y.3,p.0x.5,p.0y.5\n\nDo i=1 To z.0\n s=s||z.i\n End\n\nCall lineout pentagram,s\nCall lineout pentagram\nExit\n\nlend:\nReturn reverse(d2c(arg(1),4))\n\nline: Procedure Expose z. red green blue\nParse Arg x0, y0, x1, y1\nSay 'line' x0 y0 x1 y1\ndx = abs(x1-x0)\ndy = abs(y1-y0)\nif x0 < x1 then sx = 1\n else sx = -1\nif y0 < y1 then sy = 1\n else sy = -1\nerr = dx-dy\n\nDo Forever\n xxx=x0*3+2\n Do yy=y0-1 To y0+1\n z.yy=overlay(copies(blue,5),z.yy,xxx)\n End\n if x0 = x1 & y0 = y1 Then Leave\n e2 = 2*err\n if e2 > -dy then do\n err = err - dy\n x0 = x0 + sx\n end\n if e2 < dx then do\n err = err + dx\n y0 = y0 + sy\n end\n end\nReturn\n\nsin: Procedure\n/* REXX ****************************************************************\n* Return sin(x<,p>) -- with the specified precision\n***********************************************************************/\n Parse Arg x,prec\n If prec='' Then prec=9\n Numeric Digits (2*prec)\n Numeric Fuzz 3\n pi=3.14159\n Do While x>pi\n x=x-pi\n End\n Do While x<-pi\n x=x+pi\n End\n o=x\n u=1\n r=x\n Do i=3 By 2\n ra=r\n o=-o*x*x\n u=u*i*(i-1)\n r=r+(o/u)\n If r=ra Then Leave\n End\n Numeric Digits prec\n Return r+0\n\ncos: Procedure\n/* REXX ****************************************************************\n* Return cos(x) -- with specified precision\n***********************************************************************/\n Parse Arg x,prec\n If prec='' Then prec=9\n Numeric Digits (2*prec)\n Numeric Fuzz 3\n o=1\n u=1\n r=1\n Do i=1 By 2\n ra=r\n o=-o*x*x\n u=u*i*(i+1)\n r=r+(o/u)\n If r=ra Then Leave\n End\n Numeric Digits prec\n Return r+0\n\nsqrt: Procedure\n/* REXX ***************************************************************\n* EXEC to calculate the square root of a = 2 with high precision\n**********************************************************************/\n Parse Arg x,prec\n If prec<9 Then prec=9\n prec1=2*prec\n eps=10**(-prec1)\n k = 1\n Numeric Digits 3\n r0= x\n r = 1\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\n r0 = r\n r = (r + x/r) / 2\n k = min(prec1,2*k)\n Numeric Digits (k + 5)\n End\n Numeric Digits prec\n Return r+0\n","language":"REXX"},{"code":"# Project : Pentagram\n\nload \"guilib.ring\"\n\npaint = null\n\nnew qapp\n {\n win1 = new qwidget() {\n setwindowtitle(\"Pentagram\")\n setgeometry(100,100,500,600)\n label1 = new qlabel(win1) {\n setgeometry(10,10,400,400)\n settext(\"\")\n }\n new qpushbutton(win1) {\n setgeometry(150,500,100,30)\n settext(\"draw\")\n setclickevent(\"draw()\")\n }\n show()\n }\n exec()\n }\n\nfunc draw\n p1 = new qpicture()\n color = new qcolor() {\n setrgb(0,0,255,255)\n }\n pen = new qpen() {\n setcolor(color)\n setwidth(5)\n }\n paint = new qpainter() {\n begin(p1)\n setpen(pen)\n\n nn = 165\n cx = 800\n cy = 600\n phi = 54\n\n color = new qcolor()\n color.setrgb(0, 0, 255,255)\n mybrush = new qbrush() {setstyle(1) setcolor(color)}\n setbrush(mybrush)\n\n for n = 1 to 5\n theta = fabs(180-144-phi)\n\t p1x = floor(cx + nn * cos(phi * 0.01745329252))\n\t p1y = floor(cy + nn * sin(phi * 0.01745329252))\n\t p2x = floor(cx - nn * cos(theta * 0.01745329252))\n\t p2y = floor(cy - nn * sin(theta * 0.01745329252))\n\t phi+= 72\n\t drawpolygon([[p1x,p1y],[cx,cy],[p2x,p2y]],0)\n next\n\n endpaint()\n }\n label1 { setpicture(p1) show() }\n return\n","language":"Ring"},{"code":"import java.awt._\nimport java.awt.geom.Path2D\n\nimport javax.swing._\n\nobject Pentagram extends App {\n\n SwingUtilities.invokeLater(() =>\n new JFrame(\"Pentagram\") {\n\n class Pentagram extends JPanel {\n setPreferredSize(new Dimension(640, 640))\n setBackground(Color.white)\n final private val degrees144 = Math.toRadians(144)\n\n override def paintComponent(gg: Graphics): Unit = {\n val g = gg.asInstanceOf[Graphics2D]\n\n def drawPentagram(g: Graphics2D, x: Int, y: Int, fill: Color): Unit = {\n var (_x, _y, angle) = (x, y, 0.0)\n val p = new Path2D.Float\n p.moveTo(_x, _y)\n for (i <- 0 until 5) {\n val (x2, y2) = (_x + (Math.cos(angle) * 500).toInt, _y + (Math.sin(-angle) * 500).toInt)\n p.lineTo(x2, y2)\n _x = x2\n _y = y2\n angle -= degrees144\n }\n p.closePath()\n g.setColor(fill)\n g.fill(p)\n g.setColor(Color.darkGray)\n g.draw(p)\n }\n\n super.paintComponent(gg)\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON)\n g.setStroke(new BasicStroke(5, BasicStroke.CAP_ROUND, BasicStroke.JOIN_MITER))\n drawPentagram(g, 70, 250, new Color(0x6495ED))\n }\n }\n\n add(new Pentagram, BorderLayout.CENTER)\n pack()\n setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE)\n setLocationRelativeTo(null)\n setResizable(false)\n setVisible(true)\n }\n )\n\n}\n","language":"Scala"},{"code":"func pentagram(dim=200, sides=5) {\n var pentagram = <<-EOT\n <?xml version=\"1.0\" standalone=\"no\" ?>\n <!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.0//EN\"\n \"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\">\n <svg height=\"#{dim*2}\" width=\"#{dim*2}\" style=\"\" xmlns=\"http://www.w3.org/2000/svg\">\n <rect height=\"100%\" width=\"100%\" style=\"fill:black;\" />\n EOT\n\n func pline(q) {\n <<-EOT\n <polyline points=\"#{{|n| '%0.3f' % n }.map(q, q[0], q[1]).join(' ')}\"\n style=\"fill:blue; stroke:white; stroke-width:3;\"\n transform=\"translate(#{dim}, #{dim}) rotate(-18)\" />\n EOT\n }\n\n var v = {|k| 0.9 * dim * cis(k * Num.tau / sides) }.map(^sides)\n pentagram += pline([v[range(0, v.end, 2)], v[range(1, v.end, 2)]].map{.reals})\n pentagram += '</svg>'\n\n return pentagram\n}\n\nsay pentagram()\n","language":"Sidef"},{"code":"mx,my = #.scrsize()\nxc = mx/2\nyc = my/2\nmr = #.min(mx,my)/3\n#.angle(#.degrees)\n#.drawcolor(1,0,0)\n#.drawsize(10)\n> r, mr..0,-1\n #.drawline(xc,yc-r,xc,yc-r)\n > a, 54..630,144\n #.drawline(r*#.cos(a)+xc,r*#.sin(a)+yc)\n <\n #.drawcolor(1,1,0)\n #.drawsize(1)\n<\n","language":"SPL"},{"code":"package require Tk 8.6 \t;# lmap is new in Tcl/Tk 8.6\n\nset pi [expr 4*atan(1)]\n\npack [canvas .c] -expand yes -fill both ;# create the canvas\n\nupdate ;# draw everything so the dimensions are accurate\n\nset w [winfo width .c] ;# calculate appropriate dimensions\nset h [winfo height .c]\nset r [expr {min($w,$h) * 0.45}]\n\nset points [lmap n {0 1 2 3 4 5} {\n set n [expr {$n * 2}]\n set y [expr {sin($pi * 2 * $n / 5) * $r + $h / 2}]\n set x [expr {cos($pi * 2 * $n / 5) * $r + $w / 2}]\n list $x $y\n}]\nset points [concat {*}$points] ;# flatten the list\n\nputs [.c create line $points]\n\n;# a fun reader exercise is to make the shape respond to mouse events,\n;# or animate it!\n","language":"Tcl"},{"code":"Sub pentagram()\n With ActiveSheet.Shapes.AddShape(msoShape5pointStar, 10, 10, 400, 400)\n .Fill.ForeColor.RGB = RGB(255, 0, 0)\n .Line.Weight = 3\n .Line.ForeColor.RGB = RGB(0, 0, 255)\n End With\nEnd Sub\n","language":"VBA"},{"code":"import \"graphics\" for Canvas, Color, Point\nimport \"dome\" for Window\n\nclass Game {\n static init() {\n Window.title = \"Pentagram\"\n var width = 640\n var height = 640\n Window.resize(width, height)\n Canvas.resize(width, height)\n Canvas.cls(Color.white)\n var col = Color.hex(\"#6495ed\") // cornflower blue\n for (i in 1..240) pentagram(320, 320, i, col)\n for (i in 241..250) pentagram(320, 320, i, Color.black)\n }\n\n static update() {}\n\n static draw(alpha) {}\n\n static pentagram(x, y, r, col) {\n var points = List.filled(5, null)\n for (i in 0..4) {\n var angle = 2*Num.pi*i/5 - Num.pi/2\n points[i] = Point.new(x + r*angle.cos, y + r*angle.sin)\n }\n var prev = points[0]\n for (i in 1..5) {\n var index = (i * 2) % 5\n var curr = points[index]\n Canvas.line(prev.x, prev.y, curr.x, curr.y, col)\n prev = curr\n }\n }\n}\n","language":"Wren"},{"code":"proc FillArea(X, Y, C0, C); \\Replace area colored C0 with color C\nint X, Y, \\starting coordinate for flood fill algorithm\n C0, C; \\initial color, and color to replace it with\ndef S=8000; \\size of queue (must be an even number)\nint Q(S), \\queue (FIFO)\n F, E; \\fill and empty indexes\n\n proc EnQ(X, Y); \\Enqueue coordinate\n int X, Y;\n [Q(F):= X;\n F:= F+1;\n Q(F):= Y;\n F:= F+1;\n if F >= S then F:= 0;\n ]; \\EnQ\n\n proc DeQ; \\Dequeue coordinate\n [X:= Q(E);\n E:= E+1;\n Y:= Q(E);\n E:= E+1;\n if E >= S then E:= 0;\n ]; \\DeQ\n\n[if C0 = C then return;\nF:= 0; E:= 0;\nEnQ(X, Y);\nwhile E # F do\n [DeQ;\n if ReadPix(X, Y) = C0 then\n [Point(X, Y, C);\n EnQ(X+1, Y); \\enqueue adjacent pixels\n EnQ(X-1, Y);\n EnQ(X, Y+1);\n EnQ(X, Y-1);\n ];\n ];\n]; \\FillArea\n\ndef Size = 200.;\ndef Pi = 3.141592654;\ndef Deg144 = 4.*Pi/5.;\nint X, Y, N;\n[SetVid($12); \\set 640x480x4 VGA graphics\nfor Y:= 0 to 480-1 do \\fill screen\n [Move(0, Y); Line(640-1, Y, $F\\white\\)];\nfor N:= 0 to 5 do \\draw pentagram\n [X:= fix(Size*Sin(float(N)*Deg144));\n Y:= fix(Size*Cos(float(N)*Deg144));\n if N = 0 then Move(X+320, 240-Y)\n else Line(X+320, 240-Y, 4\\red\\);\n ];\nFillArea(0, 0, $F, 1); \\replace white (F) with blue (1)\n]\n","language":"XPL0"},{"code":"const DIM=200, SIDES=5, A=360/SIDES, R=DIM.toFloat();\nvs:=[0.0..360-A,A].apply(\"toRad\"); // angles of vertices\n#<<<\n0'|<?xml version=\"1.0\" standalone=\"no\" ?>\n<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.0//EN\"\n\"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\">\n<svg height=\"%d\" width=\"%d\" style=\"\" xmlns=\"http://www.w3.org/2000/svg\">\n<rect height=\"100%\" width=\"100%\" style=\"fill:bisque;\" />|\n#<<<\n.fmt(DIM*2, DIM*2).println();\n\nvar vertices=vs.pump(List,fcn(a){ R.toRectangular(a) }); //( (x,y), (x,y)...\nSIDES.pump(String,pline).println(); // the line pairs that draw the pentagram\n\nfcn pline(n){ a:=(n + 2)%SIDES; // (n,a) are the endpoints of the right leg\n pts:=String(\"\\\"\", (\"% 0.3f,% 0.3f \"*2), \"\\\" \"); // two points\n vs:='wrap(){ T(n,a).pump(List,vertices.get).flatten() }; //(x,y, x,y)\n String(\n (0'|<polyline points=| + pts).fmt(vs().xplode()),\n 0'|style=\"fill:seashell; stroke:blue; stroke-width:3;\" |,\n 0'|transform=\"translate(%d,%d) rotate(-18)\"|.fmt(DIM,DIM),\n \" />\\n\"\n );\n}\nprintln(\"</svg>\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pentagram\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A [[wp:pentagram|pentagram]] is a star polygon, consisting of a central pentagon of which each side forms the base of an isosceles triangle. The vertex of each triangle, a point of the star, is 36 degrees.\\n<br><br>\\n\\n;Task:\\nDraw (or print) a regular pentagram, in any orientation. Use a different color (or token) for stroke and fill, and background. For the fill it should be assumed that all points inside the triangles and the pentagon are inside the pentagram.\\n<br><br>\\n\\n;See also\\n* [http://proofsfromthebook.com/2013/08/04/angle-sum-of-a-pentagram/ Angle sum of a pentagram]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"INCLUDE \\\"D2:REAL.ACT\\\" ;from the Action! Tool Kit\\n\\nDEFINE REALPTR=\\\"CARD\\\"\\nTYPE PointR=[REALPTR x,y]\\n\\nINT ARRAY SinTab=[\\n 0 4 9 13 18 22 27 31 36 40 44 49 53 58 62 66 71 75 79 83\\n 88 92 96 100 104 108 112 116 120 124 128 132 136 139 143\\n 147 150 154 158 161 165 168 171 175 178 181 184 187 190\\n 193 196 199 202 204 207 210 212 215 217 219 222 224 226\\n 228 230 232 234 236 237 239 241 242 243 245 246 247 248\\n 249 250 251 252 253 254 254 255 255 255 256 256 256 256]\\n\\nINT FUNC Sin(INT a)\\n WHILE a<0 DO a==+360 OD\\n WHILE a>360 DO a==-360 OD\\n IF a<=90 THEN\\n RETURN (SinTab(a))\\n ELSEIF a<=180 THEN\\n RETURN (SinTab(180-a))\\n ELSEIF a<=270 THEN\\n RETURN (-SinTab(a-180))\\n ELSE\\n RETURN (-SinTab(360-a))\\n FI\\nRETURN (0)\\n\\nINT FUNC Cos(INT a)\\nRETURN (Sin(a-90))\\n\\nPROC Det(REAL POINTER x1,y1,x2,y2,res)\\n REAL tmp1,tmp2\\n\\n RealMult(x1,y2,tmp1)\\n RealMult(y1,x2,tmp2)\\n RealSub(tmp1,tmp2,res)\\nRETURN\\n\\nBYTE FUNC IsZero(REAL POINTER a)\\n CHAR ARRAY s(10)\\n\\n StrR(a,s)\\n IF s(0)=1 AND s(1)='0 THEN\\n RETURN (1)\\n FI\\nRETURN (0)\\n\\nBYTE FUNC Intersection(PointR POINTER p1,p2,p3,p4,res)\\n REAL det1,det2,dx1,dx2,dy1,dy2,nom,denom\\n\\n Det(p1.x,p1.y,p2.x,p2.y,det1)\\n Det(p3.x,p3.y,p4.x,p4.y,det2)\\n RealSub(p1.x,p2.x,dx1)\\n RealSub(p1.y,p2.y,dy1)\\n RealSub(p3.x,p4.x,dx2)\\n RealSub(p3.y,p4.y,dy2)\\n Det(dx1,dy1,dx2,dy2,denom)\\n\\n IF IsZero(denom) THEN\\n RETURN (0)\\n FI\\n\\n Det(det1,dx1,det2,dx2,nom)\\n RealDiv(nom,denom,res.x)\\n Det(det1,dy1,det2,dy2,nom)\\n RealDiv(nom,denom,res.y)\\nRETURN (1)\\n\\nPROC FloodFill(BYTE x0,y0)\\n BYTE ARRAY xs(300),ys(300)\\n INT first,last\\n\\n first=0 last=0\\n xs(first)=x0\\n ys(first)=y0\\n\\n WHILE first<=last\\n DO\\n x0=xs(first) y0=ys(first)\\n first==+1\\n IF Locate(x0,y0)=0 THEN\\n Plot(x0,y0)\\n IF Locate(x0-1,y0)=0 THEN\\n last==+1 xs(last)=x0-1 ys(last)=y0\\n FI\\n IF Locate(x0+1,y0)=0 THEN\\n last==+1 xs(last)=x0+1 ys(last)=y0\\n FI\\n IF Locate(x0,y0-1)=0 THEN\\n last==+1 xs(last)=x0 ys(last)=y0-1\\n FI\\n IF Locate(x0,y0+1)=0 THEN\\n last==+1 xs(last)=x0 ys(last)=y0+1\\n FI\\n FI\\n OD\\nRETURN\\n\\nPROC Pentagram(INT x0,y0,r,a0 BYTE c1,c2)\\n INT ARRAY xs(16),ys(16)\\n INT angle\\n BYTE i\\n PointR p1,p2,p3,p4,p\\n REAL p1x,p1y,p2x,p2y,p3x,p3y,p4x,p4y,px,py\\n\\n p1.x=p1x p1.y=p1y\\n p2.x=p2x p2.y=p2y\\n p3.x=p3x p3.y=p3y\\n p4.x=p4x p4.y=p4y\\n p.x=px p.y=py\\n\\n ;outer points\\n angle=a0\\n FOR i=0 TO 4\\n DO\\n xs(i)=r*Sin(angle)/256+x0\\n ys(i)=r*Cos(angle)/256+y0\\n angle==+144\\n OD\\n\\n ;intersection points\\n FOR i=0 TO 4\\n DO\\n IntToReal(xs(i MOD 5),p1x)\\n IntToReal(ys(i MOD 5),p1y)\\n IntToReal(xs((1+i) MOD 5),p2x)\\n IntToReal(ys((1+i) MOD 5),p2y)\\n IntToReal(xs((2+i) MOD 5),p3x)\\n IntToReal(ys((2+i) MOD 5),p3y)\\n IntToReal(xs((3+i) MOD 5),p4x)\\n IntToReal(ys((3+i) MOD 5),p4y)\\n Intersection(p1,p2,p3,p4,p)\\n xs(5+i)=RealToInt(px)\\n ys(5+i)=RealToInt(py)\\n OD\\n\\n ;centers of triangles\\n FOR i=0 TO 4\\n DO\\n xs(10+i)=(xs(i)+xs(5+i)+xs(5+(i+2) MOD 5))/3\\n ys(10+i)=(ys(i)+ys(5+i)+ys(5+(i+2) MOD 5))/3\\n OD\\n\\n ;center of pentagon\\n xs(15)=0 ys(15)=0\\n FOR i=5 TO 9\\n DO\\n xs(15)==+xs(i)\\n ys(15)==+ys(i)\\n OD\\n xs(15)==/5 ys(15)==/5\\n\\n ;draw lines\\n COLOR=c1\\n FOR i=0 TO 5\\n DO\\n IF i=0 THEN\\n Plot(xs(i MOD 5),ys(i MOD 5))\\n ELSE\\n DrawTo(xs(i MOD 5),ys(i MOD 5))\\n FI\\n OD\\n\\n ;fill\\n COLOR=c2\\n FOR i=10 TO 15\\n DO\\n FloodFill(xs(i),ys(i))\\n OD\\nRETURN\\n\\nPROC Main()\\n BYTE CH=$02FC\\n\\n Graphics(7+16)\\n SetColor(0,8,4)\\n SetColor(1,8,8)\\n SetColor(2,8,12)\\n Pentagram(40,48,40,0,1,2)\\n Pentagram(119,48,40,15,2,3)\\n\\n DO UNTIL CH#$FF OD\\n CH=$FF\\nRETURN\\n\",\n \"language\": \"Action-\"\n },\n {\n \"code\": \"with Ada.Numerics.Elementary_Functions;\\n\\nwith SDL.Video.Windows.Makers;\\nwith SDL.Video.Renderers.Makers;\\nwith SDL.Video.Rectangles;\\nwith SDL.Events.Events;\\n\\nprocedure Pentagram is\\n\\n Width : constant := 600;\\n Height : constant := 600;\\n Offset : constant := 300.0;\\n Radius : constant := 250.0;\\n\\n use SDL.Video.Rectangles;\\n use SDL.C;\\n\\n Window : SDL.Video.Windows.Window;\\n Renderer : SDL.Video.Renderers.Renderer;\\n Event : SDL.Events.Events.Events;\\n\\n type Node_Id is mod 5;\\n Nodes : array (Node_Id) of Point;\\n\\n procedure Calculate is\\n use Ada.Numerics.Elementary_Functions;\\n begin\\n for I in Nodes'Range loop\\n Nodes (I) := (X => int (Offset + Radius * Sin (Float (I), Cycle => 5.0)),\\n Y => int (Offset - Radius * Cos (Float (I), Cycle => 5.0)));\\n end loop;\\n end Calculate;\\n\\n function Orient_2D (A, B, C : Point) return int is\\n ((B.X - A.X) * (C.Y - A.Y) - (B.Y - A.Y) * (C.X - A.X));\\n\\n procedure Fill is\\n Count : Natural;\\n begin\\n for Y in int (Offset - Radius) .. int (Offset + Radius) loop\\n for X in int (Offset - Radius) .. int (Offset + Radius) loop\\n Count := 0;\\n for Node in Nodes'Range loop\\n Count := Count +\\n (if Orient_2D (Nodes (Node), Nodes (Node + 2), (X, Y)) > 0 then 1 else 0);\\n end loop;\\n if Count in 4 .. 5 then\\n Renderer.Draw (Point => (X, Y));\\n end if;\\n end loop;\\n end loop;\\n end Fill;\\n\\n procedure Draw_Outline is\\n begin\\n for Node in Nodes'Range loop\\n Renderer.Draw (Line => (Nodes (Node), Nodes (Node + 2)));\\n end loop;\\n end Draw_Outline;\\n\\n procedure Wait is\\n use type SDL.Events.Event_Types;\\n begin\\n loop\\n SDL.Events.Events.Wait (Event);\\n exit when Event.Common.Event_Type = SDL.Events.Quit;\\n end loop;\\n end Wait;\\n\\nbegin\\n if not SDL.Initialise (Flags => SDL.Enable_Screen) then\\n return;\\n end if;\\n\\n SDL.Video.Windows.Makers.Create (Win => Window,\\n Title => \\\"Pentagram\\\",\\n Position => SDL.Natural_Coordinates'(X => 10, Y => 10),\\n Size => SDL.Positive_Sizes'(Width, Height),\\n Flags => 0);\\n SDL.Video.Renderers.Makers.Create (Renderer, Window.Get_Surface);\\n Renderer.Set_Draw_Colour ((0, 0, 0, 255));\\n Renderer.Fill (Rectangle => (0, 0, Width, Height));\\n\\n Calculate;\\n Renderer.Set_Draw_Colour ((50, 50, 150, 255));\\n Fill;\\n Renderer.Set_Draw_Colour ((0, 220, 0, 255));\\n Draw_Outline;\\n Window.Update_Surface;\\n\\n Wait;\\n Window.Finalize;\\n SDL.Finalise;\\nend Pentagram;\\n\",\n \"language\": \"Ada\"\n },\n {\n \"code\": \"100 XO = 140\\n110 YO = 96\\n120 S = 90\\n130 B = 7\\n140 F = 6\\n150 C = 4\\n200 POKE 230,64\\n210 HCOLOR= B\\n220 HPLOT 0,0\\n230 CALL 62454\\n240 A = 49232\\n250 I = PEEK (A + 7) + PEEK (A + 2)\\n260 I = PEEK (A + 5) + PEEK (A)\\n300 SX = S\\n310 SY = S\\n320 PI = 3.1415926535\\n330 E = PI * 4\\n340 S = PI / 1.25\\n350 X = SIN (0)\\n360 Y = COS (0)\\n370 HCOLOR= F\\n380 PX = XO + X * SX\\n390 PY = YO - Y * SY\\n400 FOR I = 0 TO E STEP S\\n410 X = SIN (I)\\n420 Y = COS (I)\\n430 FOR J = 0 TO SX\\n440 HPLOT PX,PY TO XO + X * J,YO - Y * J\\n450 NEXT J\\n460 PX = XO + X * SX\\n470 PY = YO - Y * SY\\n480 NEXT I\\n500 HCOLOR= C\\n510 PX = XO + X * SX\\n520 PY = YO - Y * SY\\n600 FOR I = S TO E STEP S\\n610 X = SIN (I)\\n620 Y = COS (I)\\n630 HPLOT PX,PY TO XO + X * SX,YO - Y * SY\\n640 HPLOT PX + 1,PY TO XO + X * SX + 1,YO - Y * SY\\n650 HPLOT PX,PY + 1 TO XO + X * SX,YO - Y * SY + 1\\n660 HPLOT PX + 1,PY + 1 TO XO + X * SX + 1,YO - Y * SY + 1\\n670 PX = XO + X * SX\\n680 PY = YO - Y * SY\\n690 NEXT I\\n\",\n \"language\": \"Applesoft-BASIC\"\n },\n {\n \"code\": \"#Include Gdip.ahk\\t; https://autohotkey.com/boards/viewtopic.php?f=6&t=6517\\nWidth :=A_ScreenWidth, Height := A_ScreenHeight\\nGui, 1: +E0x20 +Caption +E0x80000 +LastFound +AlwaysOnTop +ToolWindow +OwnDialogs\\nGui, 1: Show, NA\\nhwnd1 := WinExist()\\nOnExit, Exit\\n\\nIf !pToken := Gdip_Startup()\\n{\\n\\tMsgBox, 48, gdiplus error!, Gdiplus failed to start.\\n\\t. Please ensure you have gdiplus on your system\\n\\tExitApp\\n}\\n\\nhbm := CreateDIBSection(Width, Height)\\nhdc := CreateCompatibleDC()\\nobm := SelectObject(hdc, hbm)\\nG := Gdip_GraphicsFromHDC(hdc)\\nGdip_SetSmoothingMode(G, 4)\\npBrush \\t:= Gdip_BrushCreateSolid(0xFF6495ED)\\npPen \\t:= Gdip_CreatePen(0xff000000, 3)\\n\\n;---------------------------------\\nLL := 165\\nCx := Floor(A_ScreenWidth/2)\\nCy := Floor(A_ScreenHeight/2)\\nphi := 54\\n;---------------------------------\\nloop, 5\\n{\\n\\ttheta := abs(180-144-phi)\\n\\tp1x := Floor(Cx + LL * Cos(phi * 0.01745329252))\\n\\tp1y := Floor(Cy + LL * Sin(phi * 0.01745329252))\\n\\tp2x := Floor(Cx - LL * Cos(theta * 0.01745329252))\\n\\tp2y := Floor(Cy - LL * Sin(theta * 0.01745329252))\\n\\tphi+= 72\\n\\tGdip_FillPolygon(G, pBrush, p1x \\\",\\\" p1y \\\"|\\\" Cx \\\",\\\" Cy \\\"|\\\" p2x \\\",\\\" p2y)\\n}\\nloop, 5\\n{\\n\\ttheta := abs(180-144-phi)\\n\\tp1x := Floor(Cx + LL * Cos(phi * 0.01745329252))\\n\\tp1y := Floor(Cy + LL * Sin(phi * 0.01745329252))\\n\\tp2x := Floor(Cx - LL * Cos(theta * 0.01745329252))\\n\\tp2y := Floor(Cy - LL * Sin(theta * 0.01745329252))\\n\\tphi+= 72\\n\\tGdip_DrawLines(G, pPen, p1x \\\",\\\" p1y \\\"|\\\" p2x \\\",\\\" p2y ) ; \\\"|\\\" Cx \\\",\\\" Cy )\\n}\\nUpdateLayeredWindow(hwnd1, hdc, 0, 0, Width, Height)\\nGdip_DeleteBrush(pBrush)\\nSelectObject(hdc, obm)\\nDeleteObject(hbm)\\nDeleteDC(hdc)\\nGdip_DeleteGraphics(G)\\nreturn\\n;----------------------------------------------------------------------\\nEsc::\\nExit:\\nGdip_Shutdown(pToken)\\nExitApp\\nReturn\\n\",\n \"language\": \"AutoHotkey\"\n },\n {\n \"code\": \"#include<graphics.h>\\n#include<stdio.h>\\n#include<math.h>\\n\\n#define pi M_PI\\n\\nint main(){\\n\\t\\n\\tchar colourNames[][14] = { \\\"BLACK\\\", \\\"BLUE\\\", \\\"GREEN\\\", \\\"CYAN\\\", \\\"RED\\\", \\\"MAGENTA\\\", \\\"BROWN\\\", \\\"LIGHTGRAY\\\", \\\"DARKGRAY\\\",\\n \\\"LIGHTBLUE\\\", \\\"LIGHTGREEN\\\", \\\"LIGHTCYAN\\\", \\\"LIGHTRED\\\", \\\"LIGHTMAGENTA\\\", \\\"YELLOW\\\", \\\"WHITE\\\" };\\n\\t\\t\\t\\n\\tint stroke=0,fill=0,back=0,i;\\n\\t\\n\\tdouble centerX = 300,centerY = 300,coreSide,armLength,pentaLength;\\n\\t\\n\\tprintf(\\\"Enter core pentagon side length : \\\");\\n\\tscanf(\\\"%lf\\\",&coreSide);\\n\\t\\n\\tprintf(\\\"Enter pentagram arm length : \\\");\\n\\tscanf(\\\"%lf\\\",&armLength);\\n\\t\\n\\tprintf(\\\"Available colours are :\\\\n\\\");\\n\\t\\n\\tfor(i=0;i<16;i++){\\n\\t\\tprintf(\\\"%d. %s\\\\t\\\",i+1,colourNames[i]);\\n\\t\\tif((i+1) % 3 == 0){\\n\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\t\\n\\twhile(stroke==fill && fill==back){\\n\\t\\tprintf(\\\"\\\\nEnter three diffrenet options for stroke, fill and background : \\\");\\n\\t\\tscanf(\\\"%d%d%d\\\",&stroke,&fill,&back);\\n\\t}\\n\\t\\n\\tpentaLength = coreSide/(2 * tan(pi/5)) + sqrt(armLength*armLength - coreSide*coreSide/4);\\n\\t\\n\\tinitwindow(2*centerX,2*centerY,\\\"Pentagram\\\");\\n\\t\\t\\n\\tsetcolor(stroke-1);\\n\\t\\n\\tsetfillstyle(SOLID_FILL,back-1);\\n\\t\\n\\tbar(0,0,2*centerX,2*centerY);\\n\\t\\n\\tfloodfill(centerX,centerY,back-1);\\n\\t\\n\\tsetfillstyle(SOLID_FILL,fill-1);\\n\\n\\tfor(i=0;i<5;i++){\\n\\t\\tline(centerX + coreSide*cos(i*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5)/(2*sin(pi/5)),centerX + coreSide*cos((i+1)*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin((i+1)*2*pi/5)/(2*sin(pi/5)));\\n\\t\\tline(centerX + coreSide*cos(i*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5)/(2*sin(pi/5)),centerX + pentaLength*cos(i*2*pi/5 + pi/5),centerY + pentaLength*sin(i*2*pi/5 + pi/5));\\n\\t\\tline(centerX + coreSide*cos((i+1)*2*pi/5)/(2*sin(pi/5)),centerY + coreSide*sin((i+1)*2*pi/5)/(2*sin(pi/5)),centerX + pentaLength*cos(i*2*pi/5 + pi/5),centerY + pentaLength*sin(i*2*pi/5 + pi/5));\\n\\t\\t\\n\\t\\tfloodfill(centerX + coreSide*cos(i*2*pi/5 + pi/10)/(2*sin(pi/5)),centerY + coreSide*sin(i*2*pi/5 + pi/10)/(2*sin(pi/5)),stroke-1);\\n\\t}\\n\\t\\n\\tfloodfill(centerX,centerY,stroke-1);\\n\\t\\n\\tgetch();\\n\\t\\n\\tclosegraph();\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"unit Main;\\n\\ninterface\\n\\nuses\\n Winapi.Windows, Vcl.Graphics, Vcl.Forms, System.Math;\\n\\ntype\\n TForm1 = class(TForm)\\n procedure FormCreate(Sender: TObject);\\n procedure FormPaint(Sender: TObject);\\n private\\n procedure DrawPentagram(len, x, y: Integer; fill, stoke: TColor);\\n { Private declarations }\\n public\\n { Public declarations }\\n end;\\n\\nvar\\n Form1: TForm1;\\n degrees144: double;\\n degrees72: double;\\n degrees18: double;\\n\\nimplementation\\n\\n{$R *.dfm}\\n\\nprocedure TForm1.FormCreate(Sender: TObject);\\nbegin\\n ClientHeight := 640;\\n ClientWidth := 640;\\n degrees144 := DegToRad(144);\\n degrees72 := DegToRad(72);\\n degrees18 := DegToRad(18);\\nend;\\n\\nprocedure CreatePolygon(len, x, y, n: integer; ang: double; var points: TArray<TPoint>);\\nvar\\n angle: Double;\\n index, i, x2, y2: Integer;\\nbegin\\n angle := 0;\\n index := 0;\\n SetLength(points, n + 1);\\n points[index].Create(x, y);\\n\\n for i := 1 to n do\\n begin\\n x2 := x + round(len * cos(angle));\\n y2 := y + round(len * sin(-angle));\\n x := x2;\\n y := y2;\\n angle := angle - ang;\\n\\n points[index].Create(x2, y2);\\n inc(index);\\n end;\\n points[index].Create(points[0]);\\nend;\\n\\nprocedure TForm1.DrawPentagram(len, x, y: Integer; fill, stoke: TColor);\\nvar\\n points, points_internal: TArray<TPoint>;\\n L, H: Integer;\\nbegin\\n // Calc of sides for draw internal pollygon\\n // 2H+L = len -> 2H = len - L\\n // L = 2H*sin(36/2) (Pythagorean theorem)\\n // L = (len-L)sin(18)\\n // L = len*sin(18)/[1+sin(18)]\\n\\n L := round(len * sin(degrees18) / (1 + sin(degrees18)));\\n\\n // H = (len - L)/2\\n\\n H := (len - L) div 2;\\n\\n CreatePolygon(L, x + H, y, 5, degrees72, points_internal);\\n CreatePolygon(len, x, y, 5, degrees144, points);\\n\\n with Canvas, Canvas.Brush do\\n begin\\n with pen do\\n begin\\n Color := stoke;\\n Style := psSolid;\\n Width := 5;\\n end;\\n Color := fill;\\n Polygon(points_internal);\\n Polygon(points);\\n end;\\nend;\\n\\nprocedure TForm1.FormPaint(Sender: TObject);\\nbegin\\n with Canvas, Brush do\\n begin\\n Style := bsSolid;\\n Color := clWhite;\\n // fill background with white\\n FillRect(ClientRect);\\n end;\\n drawPentagram(500, 70, 250, $ED9564, clDkGray);\\nend;\\n\\nend.\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"object Form1: TForm1\\n OnCreate = FormCreate\\n OnPaint = FormPaint\\nend\\n\",\n \"language\": \"Delphi\"\n },\n {\n \"code\": \"xp = 10\\nyp = 60\\nlinewidth 2\\nmove xp yp\\nwhile angle < 720\\n x = xp + cos angle * 80\\n y = yp + sin -angle * 80\\n line x y\\n f[] &= x\\n f[] &= y\\n xp = x\\n yp = y\\n angle += 144\\n.\\ncolor 900\\npolygon f[]\\n\",\n \"language\": \"EasyLang\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"github.com/fogleman/gg\\\"\\n \\\"math\\\"\\n)\\n\\nfunc Pentagram(x, y, r float64) []gg.Point {\\n points := make([]gg.Point, 5)\\n for i := 0; i < 5; i++ {\\n fi := float64(i)\\n angle := 2*math.Pi*fi/5 - math.Pi/2\\n points[i] = gg.Point{x + r*math.Cos(angle), y + r*math.Sin(angle)}\\n }\\n return points\\n}\\n\\nfunc main() {\\n points := Pentagram(320, 320, 250)\\n dc := gg.NewContext(640, 640)\\n dc.SetRGB(1, 1, 1) // White\\n dc.Clear()\\n for i := 0; i <= 5; i++ {\\n index := (i * 2) % 5\\n p := points[index]\\n dc.LineTo(p.X, p.Y)\\n }\\n dc.SetHexColor(\\\"#6495ED\\\") // Cornflower Blue\\n dc.SetFillRule(gg.FillRuleWinding)\\n dc.FillPreserve()\\n dc.SetRGB(0, 0, 0) // Black\\n dc.SetLineWidth(5)\\n dc.Stroke()\\n dc.SavePNG(\\\"pentagram.png\\\")\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"-- Extract the vertices of a pentagon, re-ordering them so that drawing lines\\n-- from one to the next forms a pentagram. Set the line's thickness and its\\n-- colour, as well as the fill and background colours. Make the background a\\n-- bit larger than the pentagram.\\n\\nimport Diagrams.Prelude\\nimport Diagrams.Backend.SVG.CmdLine\\n\\npentagram = let [a, b, c, d, e] = trailVertices $ pentagon 1\\n in [a, c, e, b, d]\\n # fromVertices\\n # closeTrail\\n # strokeTrail\\n # lw ultraThick\\n # fc springgreen\\n # lc blue\\n # bgFrame 0.2 bisque\\n\\nmain = mainWith (pentagram :: Diagram B)\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"100 PROGRAM \\\"Pentagra.bas\\\"\\n110 OPTION ANGLE DEGREES\\n120 GRAPHICS HIRES 4\\n130 SET PALETTE BLUE,CYAN,YELLOW,BLACK\\n140 PLOT 640,700,ANGLE 288;\\n150 FOR I=1 TO 5\\n160 PLOT FORWARD 700,RIGHT 144;\\n170 NEXT\\n180 SET INK 3\\n190 SET BEAM OFF:PLOT 0,0,PAINT\\n\",\n \"language\": \"IS-BASIC\"\n },\n {\n \"code\": \"require'plot'\\nplot j./2 1 o./180p_1 %~ 144*i. 6\\n\",\n \"language\": \"J\"\n },\n {\n \"code\": \"import java.awt.*;\\nimport java.awt.geom.Path2D;\\nimport javax.swing.*;\\n\\npublic class Pentagram extends JPanel {\\n\\n final double degrees144 = Math.toRadians(144);\\n\\n public Pentagram() {\\n setPreferredSize(new Dimension(640, 640));\\n setBackground(Color.white);\\n }\\n\\n private void drawPentagram(Graphics2D g, int len, int x, int y,\\n Color fill, Color stroke) {\\n double angle = 0;\\n\\n Path2D p = new Path2D.Float();\\n p.moveTo(x, y);\\n\\n for (int i = 0; i < 5; i++) {\\n int x2 = x + (int) (Math.cos(angle) * len);\\n int y2 = y + (int) (Math.sin(-angle) * len);\\n p.lineTo(x2, y2);\\n x = x2;\\n y = y2;\\n angle -= degrees144;\\n }\\n p.closePath();\\n\\n g.setColor(fill);\\n g.fill(p);\\n\\n g.setColor(stroke);\\n g.draw(p);\\n }\\n\\n @Override\\n public void paintComponent(Graphics gg) {\\n super.paintComponent(gg);\\n Graphics2D g = (Graphics2D) gg;\\n\\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING,\\n RenderingHints.VALUE_ANTIALIAS_ON);\\n\\n g.setStroke(new BasicStroke(5, BasicStroke.CAP_ROUND, 0));\\n\\n drawPentagram(g, 500, 70, 250, new Color(0x6495ED), Color.darkGray);\\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(\\\"Pentagram\\\");\\n f.setResizable(false);\\n f.add(new Pentagram(), BorderLayout.CENTER);\\n f.pack();\\n f.setLocationRelativeTo(null);\\n f.setVisible(true);\\n });\\n }\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"# Input: {svg, minx, miny, maxx, maxy}\\ndef svg:\\n # viewBox = <min-x> <min-y> <width> <height>\\n \\\"<svg viewBox='\\\\(.minx - 4|floor) \\\\(.miny - 4 |floor) \\\\(6 + .maxx - .minx|ceil) \\\\(6 + .maxy - .miny|ceil)'\\\",\\n \\\" preserveAspectRatio='xMinYmin meet'\\\",\\n \\\" xmlns='http://www.w3.org/2000/svg' >\\\",\\n .svg,\\n \\\"</svg>\\\" ;\\n\\n# Input: an array of [x,y] points\\ndef minmax:\\n {minx: (map(.[0])|min),\\n miny: (map(.[1])|min),\\n maxx: (map(.[0])|max),\\n maxy: (map(.[1])|max)} ;\\n\\n# Input: an array of [x,y] points\\ndef Polyline($fill; $stroke; $transform):\\n def rnd: 1000*.|round/1000;\\n def linearize: map( map(rnd) | join(\\\" \\\") ) | join(\\\", \\\");\\n\\n \\\"<polyline points='\\\"\\n + linearize\\n + \\\"'\\\\n style='fill:\\\\($fill); stroke: \\\\($stroke); stroke-width:3;'\\\"\\n + \\\"\\\\n transform='\\\\($transform)' />\\\" ;\\n\\n# Output: {minx, miny, maxx, maxy, svg}\\ndef pentagram($dim):\\n (8 * (1|atan)) as $tau\\n | 5 as $sides\\n | [ (0, 2, 4, 1, 3, 0)\\n | [ 0.9 * $dim * (($tau * $v / $sides) | cos),\\n 0.9 * $dim * (($tau * $v / $sides) | sin) ] ]\\n | minmax\\n + {svg: Polyline(\\\"seashell\\\"; \\\"blue\\\"; \\\"rotate(-18)\\\" )} ;\\n\\npentagram(200)\\n| svg\\n\",\n \"language\": \"Jq\"\n },\n {\n \"code\": \"using Luxor\\n\\nfunction drawpentagram(path::AbstractString, w::Integer=1000, h::Integer=1000)\\n Drawing(h, w, path)\\n origin()\\n setline(16)\\n\\n # To get a different color border from the fill, draw twice, first with fill, then without.\\n sethue(\\\"aqua\\\")\\n star(0, 0, 500, 5, 0.39, 3pi/10, :fill)\\n\\n sethue(\\\"navy\\\")\\n verts = star(0, 0, 500, 5, 0.5, 3pi/10, vertices=true)\\n poly([verts[i] for i in [1,5,9,3,7,1]], :stroke)\\n finish()\\n preview()\\nend\\n\\ndrawpentagram(\\\"data/pentagram.png\\\")\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.1.2\\n\\nimport java.awt.*\\nimport java.awt.geom.Path2D\\nimport javax.swing.*\\n\\nclass Pentagram : JPanel() {\\n init {\\n preferredSize = Dimension(640, 640)\\n background = Color.white\\n }\\n\\n private fun drawPentagram(g: Graphics2D, len: Int, x: Int, y: Int,\\n fill: Color, stroke: Color) {\\n var x2 = x.toDouble()\\n var y2 = y.toDouble()\\n var angle = 0.0\\n val p = Path2D.Float()\\n p.moveTo(x2, y2)\\n\\n for (i in 0..4) {\\n x2 += Math.cos(angle) * len\\n y2 += Math.sin(-angle) * len\\n p.lineTo(x2, y2)\\n angle -= Math.toRadians(144.0)\\n }\\n\\n p.closePath()\\n with(g) {\\n color = fill\\n fill(p)\\n color = stroke\\n draw(p)\\n }\\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 g.stroke = BasicStroke(5.0f, BasicStroke.CAP_ROUND, 0)\\n drawPentagram(g, 500, 70, 250, Color(0x6495ED), Color.darkGray)\\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 = \\\"Pentagram\\\"\\n isResizable = false\\n add(Pentagram(), BorderLayout.CENTER)\\n pack()\\n setLocationRelativeTo(null)\\n isVisible = true\\n }\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"local cos, sin, floor, pi = math.cos, math.sin, math.floor, math.pi\\n\\nfunction Bitmap:render()\\n for y = 1, self.height do\\n print(table.concat(self.pixels[y]))\\n end\\nend\\n\\nfunction Bitmap:pentagram(x, y, radius, rotation, outlcolor, fillcolor)\\n local function pxy(i) return x+radius*cos(i*pi*2/5+rotation), y+radius*sin(i*pi*2/5+rotation) end\\n local x1, y1 = pxy(0)\\n for i = 1, 5 do\\n local x2, y2 = pxy(i*2) -- btw: pxy(i) ==> pentagon\\n self:line(floor(x1*2), floor(y1), floor(x2*2), floor(y2), outlcolor)\\n x1, y1 = x2, y2\\n end\\n self:floodfill(floor(x*2), floor(y), fillcolor)\\n radius = radius / 2\\n for i = 1, 5 do\\n x1, y1 = pxy(i)\\n self:floodfill(floor(x1*2), floor(y1), fillcolor)\\n end\\nend\\n\\nbitmap = Bitmap(40*2,40)\\nbitmap:clear(\\\".\\\")\\nbitmap:pentagram(20, 22, 20, -pi/2, \\\"@\\\", '+')\\nbitmap:render()\\n\",\n \"language\": \"Lua\"\n },\n {\n \"code\": \"with(geometry):\\nRegularStarPolygon(middle, 5/2, point(c, 0, 0), 1):\\nv := [seq(coordinates(i), i in DefinedAs(middle))]:\\npentagram := plottools[rotate](plottools[polygon](v), Pi/2):\\nplots[display](pentagram, colour = yellow, axes = none);\\n\",\n \"language\": \"Maple\"\n },\n {\n \"code\": \"Graphics[{\\n EdgeForm[Directive[Thickness[0.01], RGBColor[0, 0, 1]]],(*Edge coloring*)\\n RGBColor[0.5, 0.5, .50], (*Fill coloring*)\\n Polygon[AnglePath[Table[6 Pi/5, 5]]]}\\n ]\\n\",\n \"language\": \"Mathematica\"\n },\n {\n \"code\": \"import libgd\\nfrom math import sin, cos, degToRad\\n\\nconst\\n width = 500\\n height = width\\n outerRadius = 200\\n\\nproc main() =\\n\\n proc calcPosition(x: int, y: int, radius: int, posAngle: float): (cint, cint) =\\n var width = int(radius.float * sin(degToRad(posAngle)))\\n var height = int(radius.float * cos(degToRad(posAngle)))\\n return (cast[cint](x + width), cast[cint](y - height))\\n\\n proc getPentagonPoints(startAngle = 0, radius: int): array[5, array[2, int]] =\\n let spacingAngle = 360 / 5\\n\\n var posAngle = (90 - startAngle).float\\n\\n var n = 0\\n var points: array[5, array[2, int]]\\n while n < 5:\\n (points[n][0], points[n][1]) = calcPosition(250, 250, radius, posAngle)\\n n += 1\\n posAngle -= spacingAngle\\n\\n return points\\n\\n let outerPentagon = getPentagonPoints(18, outerRadius) # rotate 18 degrees\\n let innerPentagon = getPentagonPoints(54, int((cos(degToRad(72.0))/cos(degToRad(36.0))) * outerRadius)) # rotate 54 degrees\\n\\n var pentagram: array[10, array[2, int]]\\n var n = 0\\n for i in countup(0, 4):\\n pentagram[n] = outerPentagon[i]\\n inc(n)\\n pentagram[n] = innerPentagon[i]\\n inc(n)\\n\\n withGd imageCreate(width, height) as img:\\n discard img.setColor(255, 255, 255)\\n\\n let black = img.setColor(0x404040)\\n let blue = img.setColor(0x6495ed)\\n\\n img.drawPolygon(\\n points=pentagram,\\n color=blue,\\n fill=true,\\n open=false)\\n\\n img.setThickness(4)\\n\\n img.drawPolygon(\\n points=pentagram,\\n color=black,\\n fill=false,\\n open=false)\\n\\n img.drawPolygon(\\n points=innerPentagon,\\n color=black,\\n fill=false,\\n open=false)\\n\\n let png_out = open(\\\"pentagram.png\\\", fmWrite)\\n img.writePng(png_out)\\n\\n png_out.close()\\n\\nmain()\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* Create a BMP file showing a pentagram\\n**********************************************************************/\\npentagram='pentagram.bmp'\\n'erase' pentagram\\ns='424d4600000000000000360000002800000038000000280000000100180000000000'X\\ns=s'1000000000000000000000000000000000000000'x\\nSay 'sl='length(s)\\nz.0=0\\nwhite='ffffff'x\\nred ='00ff00'x\\ngreen='ff0000'x\\nblue ='0000ff'x\\nrd6=copies(rd,6)\\nm=133\\nm=80\\nn=80\\nhor=m*8 /* 56 */\\nver=n*8 /* 40 */\\nSay 'hor='hor\\nSay 'ver='ver\\nSay 'sl='length(s)\\ns=overlay(lend(hor),s,19,4)\\ns=overlay(lend(ver),s,23,4)\\nSay 'sl='length(s)\\nz.=copies('ffffff'x,3192%3)\\nz.=copies('ffffff'x,8*m)\\nz.0=648\\ns72 =RxCalcsin(72,,'D')\\nc72 =RxCalccos(72,,'D')\\ns144=RxCalcsin(144,,'D')\\nc144=RxCalccos(144,,'D')\\nxm=300\\nym=300\\nr=200\\np.0x.1=xm\\np.0y.1=ym+r\\np.0x.2=format(xm+r*s72,3,0)\\np.0y.2=format(ym+r*c72,3,0)\\np.0x.3=format(xm+r*s144,3,0)\\np.0y.3=format(ym+r*c144,3,0)\\np.0x.4=format(xm-r*s144,3,0)\\np.0y.4=p.0y.3\\np.0x.5=format(xm-r*s72,3,0)\\np.0y.5=p.0y.2\\nDo i=1 To 5\\n Say p.0x.i p.0y.i\\n End\\nCall line p.0x.1,p.0y.1,p.0x.3,p.0y.3\\nCall line p.0x.1,p.0y.1,p.0x.4,p.0y.4\\nCall line p.0x.2,p.0y.2,p.0x.4,p.0y.4\\nCall line p.0x.2,p.0y.2,p.0x.5,p.0y.5\\nCall line p.0x.3,p.0y.3,p.0x.5,p.0y.5\\n\\nDo i=1 To z.0\\n s=s||z.i\\n End\\n\\nCall lineout pentagram,s\\nCall lineout pentagram\\nExit\\n\\nlend:\\nReturn reverse(d2c(arg(1),4))\\n\\nline: Procedure Expose z. red green blue\\nParse Arg x0, y0, x1, y1\\nSay 'line' x0 y0 x1 y1\\ndx = abs(x1-x0)\\ndy = abs(y1-y0)\\nif x0 < x1 then sx = 1\\n else sx = -1\\nif y0 < y1 then sy = 1\\n else sy = -1\\nerr = dx-dy\\n\\nDo Forever\\n xxx=x0*3+2\\n Do yy=y0-1 To y0+1\\n z.yy=overlay(copies(blue,5),z.yy,xxx)\\n End\\n if x0 = x1 & y0 = y1 Then Leave\\n e2 = 2*err\\n if e2 > -dy then do\\n err = err - dy\\n x0 = x0 + sx\\n end\\n if e2 < dx then do\\n err = err + dx\\n y0 = y0 + sy\\n end\\n end\\nReturn\\n::requires RxMath Library\\n\",\n \"language\": \"OoRexx\"\n },\n {\n \"code\": \"use SVG;\\n\\nmy $tau = 2 * 4*atan2(1, 1);\\nmy $dim = 200;\\nmy $sides = 5;\\n\\nfor $v (0, 2, 4, 1, 3, 0) {\\n push @vx, 0.9 * $dim * cos($tau * $v / $sides);\\n push @vy, 0.9 * $dim * sin($tau * $v / $sides);\\n}\\n\\nmy $svg= SVG->new( width => 2*$dim, height => 2*$dim);\\n\\nmy $points = $svg->get_path(\\n x => \\\\@vx,\\n y => \\\\@vy,\\n -type => 'polyline',\\n);\\n\\n$svg->rect (\\n width => \\\"100%\\\",\\n height => \\\"100%\\\",\\n style => {\\n 'fill' => 'bisque'\\n }\\n);\\n\\n$svg->polyline (\\n %$points,\\n style => {\\n 'fill' => 'seashell',\\n 'stroke' => 'blue',\\n 'stroke-width' => 3,\\n },\\n transform => \\\"translate($dim,$dim) rotate(-18)\\\"\\n);\\n\\nopen $fh, '>', 'pentagram.svg';\\nprint $fh $svg->xmlify(-namespace=>'svg');\\nclose $fh;\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- demo\\\\rosetta\\\\Pentagram.exw\\n -- ==========================\\n --\\n -- Start/stop rotation by pressing space. Resizeable.\\n -- ZXYV stop any rotation and orient up/down/left/right.\\n --</span>\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">include</span> <span style=\\\"color: #000000;\\\">pGUI</span><span style=\\\"color: #0000FF;\\\">.</span><span style=\\\"color: #000000;\\\">e</span>\\n\\n <span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">timer</span>\\n <span style=\\\"color: #004080;\\\">cdCanvas</span> <span style=\\\"color: #000000;\\\">cdcanvas</span>\\n\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">enum</span> <span style=\\\"color: #000000;\\\">FILL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">BORDER</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">colours</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">CD_BLUE</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">CD_RED</span><span style=\\\"color: #0000FF;\\\">},</span>\\n <span style=\\\"color: #000000;\\\">modes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">CD_FILL</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">CD_CLOSED_LINES</span><span style=\\\"color: #0000FF;\\\">}</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">redraw_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posx*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*posy*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupGetIntInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"DRAWSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cx</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cy</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">radius</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">min</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cx</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cy</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">0.9</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasActivate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasClear</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetFillMode</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_WINDING</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetLineWidth</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">round</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radius</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">100</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">FILL</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">BORDER</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetForeground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">colours</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasBegin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">modes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">mode</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">90</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">666</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">144</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">a</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">rot</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #004600;\\\">CD_DEG2RAD</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radius</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">cos</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">cx</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">radius</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #7060A8;\\\">sin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">cy</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasVertex</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasEnd</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasFlush</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">map_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">cdcanvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cdCreateCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">CD_IUP</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ih</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">cdCanvasSetBackground</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">cdcanvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">CD_PARCHMENT</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_DEFAULT</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">timer_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">rot</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">359</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">360</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupRedraw</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_IGNORE</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">key_cb</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">Ihandle</span> <span style=\\\"color: #000080;font-style:italic;\\\">/*ih*/</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #004600;\\\">K_ESC</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CLOSE</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">upper</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">timer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"RUN\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">IupGetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">timer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"RUN\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"ZYXV\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetInt</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">timer</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"RUN\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">rot</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">90</span>\\n <span style=\\\"color: #7060A8;\\\">IupRedraw</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">IUP_CONTINUE</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupOpen</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">canvas</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupCanvas</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"RASTERSIZE=640x640\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"MAP_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"map_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"ACTION\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"redraw_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #000000;\\\">dlg</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupDialog</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">`TITLE=\\\"Pentagram\\\"`</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetCallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"KEY_CB\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"key_cb\\\"</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #7060A8;\\\">IupShow</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">dlg</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #7060A8;\\\">IupSetAttribute</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">canvas</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #008000;\\\">\\\"RASTERSIZE\\\"</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004600;\\\">NULL</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">timer</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">IupTimer</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">Icallback</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"timer_cb\\\"</span><span style=\\\"color: #0000FF;\\\">),</span> <span style=\\\"color: #000000;\\\">80</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">active</span><span style=\\\"color: #0000FF;\\\">:=</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">platform</span><span style=\\\"color: #0000FF;\\\">()!=</span><span style=\\\"color: #004600;\\\">JS</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">IupMainLoop</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">IupClose</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">without</span> <span style=\\\"color: #008080;\\\">js</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">HDR</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n <?xml version=\\\"1.0\\\" standalone=\\\"no\\\" ?>\\n <!DOCTYPE svg PUBLIC \\\"-//W3C//DTD SVG 1.0//EN\\\"\\n \\\"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\\\">\\n <svg height=\\\"%d\\\" width=\\\"%d\\\" style=\\\"\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\\n <rect height=\\\"100%%\\\" width=\\\"100%%\\\" style=\\\"fill:black;\\\" />\\n \\\"\\\"\\\"</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">LINE</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n <polyline points=\\\"%s\\\"\\n style=\\\"fill:blue; stroke:white; stroke-width:3;\\\"\\n transform=\\\"translate(%d, %d) rotate(-18)\\\" />\\n \\\"\\\"\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">pentagram</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">dim</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">200</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">sides</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">)</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">sides</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">sides</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">theta</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">PI</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">*(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)/</span><span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">cos</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">theta</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">dim</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sin</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">theta</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">dim</span>\\n <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%.3f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"%.3f\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">)}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">v</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">q</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #000000;\\\">v</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #004080;\\\">string</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">HDR</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dim</span><span style=\\\"color: #0000FF;\\\">*</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #7060A8;\\\">sprintf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">LINE</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">q</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">dim</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">dim</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #008000;\\\">\\\"</svg>\\\\n\\\"</span>\\n\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">pentagram</span><span style=\\\"color: #0000FF;\\\">())</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"%!PS-Adobe-3.0 EPSF\\n%%BoundingBox: 0 0 200 600\\n\\n/n 5 def % 5-star; can be set to other odd numbers\\n\\n/s { gsave } def\\n/r { grestore } def\\n/g { .7 setgray } def\\n/t { 100 exch translate } def\\n/p {\\n\\t180 90 n div sub rotate\\n\\t0 0 moveto\\n\\tn { 0 160 rlineto 180 180 n div sub rotate } repeat\\n\\tclosepath\\n} def\\n\\ns 570 t p s g eofill r stroke r\\t\\t% even-odd fill\\ns 370 t p s g fill r stroke r\\t\\t% non-zero fill\\ns 170 t p s 2 setlinewidth stroke r g fill r % non-zero, but hide inner strokes\\n\\n%%EOF\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"%!PS-Adobe-3.0 EPSF\\n%%BoundingBox: 0 0 400 400\\n\\n% randomly choose from 5- to 35-stars\\n/maxpoint 35 def\\n/minpoint 5 def\\n/maxradius 30 def\\n\\n/rnd1 { rand 16#80000000 div } def\\n/rnd { rnd1 mul} def\\n/rndi { 2 index sub rnd1 mul 1 index div cvi mul add} def\\n/line { rotate 0 rlineto } def\\n\\n/star { gsave\\n\\t/n minpoint 2 maxpoint rndi def\\n\\t/r maxradius rnd def\\n\\t/a 180 180 n div sub def\\n\\t/b 360 a n mul sub n div def\\n\\n\\t400 rnd 400 rnd translate 360 rnd rotate\\n\\t0 0 moveto n { r a line r b line } repeat closepath\\n\\trnd1 rnd1 rnd1 3 { 2 index 1 exch sub } repeat\\n\\tgsave setrgbcolor fill grestore setrgbcolor stroke\\n\\tgrestore } def\\n\\n0 setlinewidth 2000 {star} repeat showpage\\n%%EOF\\n\",\n \"language\": \"PostScript\"\n },\n {\n \"code\": \"//Aamrun, 29th June 2022\\n\\nsize(1000,1000);\\n\\ntranslate(width/2,height/2);\\nrotate(3*PI/2);\\nfill(#0000ff);\\n\\nbeginShape();\\nfor(int i=0;i<10;i+=2){\\n\\n vertex(450*cos(i*2*PI/5),450*sin(i*2*PI/5));\\n}\\nendShape(CLOSE);\\n\",\n \"language\": \"Processing\"\n },\n {\n \"code\": \"import turtle\\n\\nturtle.bgcolor(\\\"green\\\")\\nt = turtle.Turtle()\\nt.color(\\\"red\\\", \\\"blue\\\")\\nt.begin_fill()\\nfor i in range(0, 5):\\n t.forward(200)\\n t.right(144)\\nt.end_fill()\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"[ $ \\\"turtleduck.qky\\\" loadfile ] now!\\n\\n[ [ 1 1\\n 30 times\\n [ tuck + ]\\n swap join ] constant\\n do ] is phi ( --> n/d )\\n\\n[ 5 times\\n [ 2dup walk\\n 1 5 turn\\n 2dup walk\\n 3 5 turn ]\\n 2drop ] is star ( n/d --> )\\n\\n[ 5 times\\n [ 2dup walk\\n 2 5 turn ]\\n 2drop ] is pentagram ( n/d --> )\\n\\nturtle\\n' [ 79 126 229 ] fill [ 200 1 star ]\\n10 wide\\n-1 10 turn\\n200 1 phi v* phi v* pentagram\\n1 10 turn\\n\",\n \"language\": \"Quackery\"\n },\n {\n \"code\": \"p <- cbind(x = c(0, 1, 2,-0.5 , 2.5 ,0),\\n y = c(0, 1, 0,0.6, 0.6,0))\\nplot(p)\\nlines(p)\\n\",\n \"language\": \"R\"\n },\n {\n \"code\": \"#lang racket\\n(require 2htdp/image)\\n\\n(overlay\\n (star-polygon 100 5 2 \\\"outline\\\" (make-pen \\\"blue\\\" 4 \\\"solid\\\" \\\"round\\\" \\\"round\\\"))\\n (star-polygon 100 5 2 \\\"solid\\\" \\\"cyan\\\"))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"use SVG;\\n\\nconstant $dim = 200;\\nconstant $sides = 5;\\n\\nmy @vertices = map { 0.9 * $dim * cis($_ * τ / $sides) }, ^$sides;\\n\\nmy @points = map |*.reals.fmt(\\\"%0.3f\\\"),\\n flat @vertices[0, 2 ... *], @vertices[1, 3 ... *], @vertices[0];\\n\\nsay SVG.serialize(\\n svg => [\\n :width($dim*2), :height($dim*2),\\n :rect[:width<100%>, :height<100%>, :style<fill:bisque;>],\\n :polyline[ :points(@points.join: ','),\\n :style(\\\"stroke:blue; stroke-width:3; fill:seashell;\\\"),\\n :transform(\\\"translate($dim,$dim) rotate(-90)\\\")\\n ],\\n ],\\n);\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Red [\\n\\tSource: https://github.com/vazub/rosetta-red\\n\\tTabs: 4\\n\\tNeeds: 'View\\n]\\n\\ncanvas: 500x500\\ncenter: as-pair canvas/x / 2 canvas/y / 2\\nradius: 200\\n\\npoints: collect [\\n\\trepeat vertex 10 [\\n\\t\\tangle: vertex * 36 + 18 ;-- +18 is required for pentagram rotation\\n\\t\\teither vertex // 2 = 1 [\\n\\t\\t\\tkeep as-pair (cosine angle) * radius + center/x (sine angle) * radius + center/y\\n\\t\\t][\\n\\t\\t\\tkeep as-pair (cosine angle) * radius * 0.382 + center/x (sine angle) * radius * 0.382 + center/y\\n\\t\\t]\\n\\t]\\n]\\n\\nview [\\n\\ttitle \\\"Pentagram\\\"\\n\\tbase canvas white\\n\\tdraw compose/deep [\\n\\t\\tfill-pen mint\\n\\t\\tpolygon (points)\\n\\t\\tline-width 3\\n\\t\\tline (points/1) (points/5) (points/9) (points/3) (points/7) (points/1)\\n\\t]\\n]\\n\",\n \"language\": \"Red\"\n },\n {\n \"code\": \"/* REXX ***************************************************************\\n* Create a BMP file showing a pentagram\\n**********************************************************************/\\nParse Version v\\nIf pos('Regina',v)>0 Then\\n pentagram='pentagrama.bmp'\\nElse\\n pentagram='pentagramx.bmp'\\n'erase' pentagram\\ns='424d4600000000000000360000002800000038000000280000000100180000000000'X||,\\n '1000000000000000000000000000000000000000'x\\nSay 'sl='length(s)\\nz.0=0\\nwhite='ffffff'x\\nred ='00ff00'x\\ngreen='ff0000'x\\nblue ='0000ff'x\\nrd6=copies(rd,6)\\nm=133\\nm=80\\nn=80\\nhor=m*8 /* 56 */\\nver=n*8 /* 40 */\\nSay 'hor='hor\\nSay 'ver='ver\\nSay 'sl='length(s)\\ns=overlay(lend(hor),s,19,4)\\ns=overlay(lend(ver),s,23,4)\\nSay 'sl='length(s)\\nz.=copies('ffffff'x,3192%3)\\nz.=copies('ffffff'x,8*m)\\nz.0=648\\npi_5=2*3.14159/5\\ns72 =sin(pi_5 )\\nc72 =cos(pi_5 )\\ns144=sin(pi_5*2)\\nc144=cos(pi_5*2)\\nxm=300\\nym=300\\nr=200\\np.0x.1=xm\\np.0y.1=ym+r\\n\\np.0x.2=format(xm+r*s72,3,0)\\np.0y.2=format(ym+r*c72,3,0)\\np.0x.3=format(xm+r*s144,3,0)\\np.0y.3=format(ym+r*c144,3,0)\\np.0x.4=format(xm-r*s144,3,0)\\np.0y.4=p.0y.3\\np.0x.5=format(xm-r*s72,3,0)\\np.0y.5=p.0y.2\\nDo i=1 To 5\\n Say p.0x.i p.0y.i\\n End\\nCall line p.0x.1,p.0y.1,p.0x.3,p.0y.3\\nCall line p.0x.1,p.0y.1,p.0x.4,p.0y.4\\nCall line p.0x.2,p.0y.2,p.0x.4,p.0y.4\\nCall line p.0x.2,p.0y.2,p.0x.5,p.0y.5\\nCall line p.0x.3,p.0y.3,p.0x.5,p.0y.5\\n\\nDo i=1 To z.0\\n s=s||z.i\\n End\\n\\nCall lineout pentagram,s\\nCall lineout pentagram\\nExit\\n\\nlend:\\nReturn reverse(d2c(arg(1),4))\\n\\nline: Procedure Expose z. red green blue\\nParse Arg x0, y0, x1, y1\\nSay 'line' x0 y0 x1 y1\\ndx = abs(x1-x0)\\ndy = abs(y1-y0)\\nif x0 < x1 then sx = 1\\n else sx = -1\\nif y0 < y1 then sy = 1\\n else sy = -1\\nerr = dx-dy\\n\\nDo Forever\\n xxx=x0*3+2\\n Do yy=y0-1 To y0+1\\n z.yy=overlay(copies(blue,5),z.yy,xxx)\\n End\\n if x0 = x1 & y0 = y1 Then Leave\\n e2 = 2*err\\n if e2 > -dy then do\\n err = err - dy\\n x0 = x0 + sx\\n end\\n if e2 < dx then do\\n err = err + dx\\n y0 = y0 + sy\\n end\\n end\\nReturn\\n\\nsin: Procedure\\n/* REXX ****************************************************************\\n* Return sin(x<,p>) -- with the specified precision\\n***********************************************************************/\\n Parse Arg x,prec\\n If prec='' Then prec=9\\n Numeric Digits (2*prec)\\n Numeric Fuzz 3\\n pi=3.14159\\n Do While x>pi\\n x=x-pi\\n End\\n Do While x<-pi\\n x=x+pi\\n End\\n o=x\\n u=1\\n r=x\\n Do i=3 By 2\\n ra=r\\n o=-o*x*x\\n u=u*i*(i-1)\\n r=r+(o/u)\\n If r=ra Then Leave\\n End\\n Numeric Digits prec\\n Return r+0\\n\\ncos: Procedure\\n/* REXX ****************************************************************\\n* Return cos(x) -- with specified precision\\n***********************************************************************/\\n Parse Arg x,prec\\n If prec='' Then prec=9\\n Numeric Digits (2*prec)\\n Numeric Fuzz 3\\n o=1\\n u=1\\n r=1\\n Do i=1 By 2\\n ra=r\\n o=-o*x*x\\n u=u*i*(i+1)\\n r=r+(o/u)\\n If r=ra Then Leave\\n End\\n Numeric Digits prec\\n Return r+0\\n\\nsqrt: Procedure\\n/* REXX ***************************************************************\\n* EXEC to calculate the square root of a = 2 with high precision\\n**********************************************************************/\\n Parse Arg x,prec\\n If prec<9 Then prec=9\\n prec1=2*prec\\n eps=10**(-prec1)\\n k = 1\\n Numeric Digits 3\\n r0= x\\n r = 1\\n Do i=1 By 1 Until r=r0 | (abs(r*r-x)<eps)\\n r0 = r\\n r = (r + x/r) / 2\\n k = min(prec1,2*k)\\n Numeric Digits (k + 5)\\n End\\n Numeric Digits prec\\n Return r+0\\n\",\n \"language\": \"REXX\"\n },\n {\n \"code\": \"# Project : Pentagram\\n\\nload \\\"guilib.ring\\\"\\n\\npaint = null\\n\\nnew qapp\\n {\\n win1 = new qwidget() {\\n setwindowtitle(\\\"Pentagram\\\")\\n setgeometry(100,100,500,600)\\n label1 = new qlabel(win1) {\\n setgeometry(10,10,400,400)\\n settext(\\\"\\\")\\n }\\n new qpushbutton(win1) {\\n setgeometry(150,500,100,30)\\n settext(\\\"draw\\\")\\n setclickevent(\\\"draw()\\\")\\n }\\n show()\\n }\\n exec()\\n }\\n\\nfunc draw\\n p1 = new qpicture()\\n color = new qcolor() {\\n setrgb(0,0,255,255)\\n }\\n pen = new qpen() {\\n setcolor(color)\\n setwidth(5)\\n }\\n paint = new qpainter() {\\n begin(p1)\\n setpen(pen)\\n\\n nn = 165\\n cx = 800\\n cy = 600\\n phi = 54\\n\\n color = new qcolor()\\n color.setrgb(0, 0, 255,255)\\n mybrush = new qbrush() {setstyle(1) setcolor(color)}\\n setbrush(mybrush)\\n\\n for n = 1 to 5\\n theta = fabs(180-144-phi)\\n\\t p1x = floor(cx + nn * cos(phi * 0.01745329252))\\n\\t p1y = floor(cy + nn * sin(phi * 0.01745329252))\\n\\t p2x = floor(cx - nn * cos(theta * 0.01745329252))\\n\\t p2y = floor(cy - nn * sin(theta * 0.01745329252))\\n\\t phi+= 72\\n\\t drawpolygon([[p1x,p1y],[cx,cy],[p2x,p2y]],0)\\n next\\n\\n endpaint()\\n }\\n label1 { setpicture(p1) show() }\\n return\\n\",\n \"language\": \"Ring\"\n },\n {\n \"code\": \"import java.awt._\\nimport java.awt.geom.Path2D\\n\\nimport javax.swing._\\n\\nobject Pentagram extends App {\\n\\n SwingUtilities.invokeLater(() =>\\n new JFrame(\\\"Pentagram\\\") {\\n\\n class Pentagram extends JPanel {\\n setPreferredSize(new Dimension(640, 640))\\n setBackground(Color.white)\\n final private val degrees144 = Math.toRadians(144)\\n\\n override def paintComponent(gg: Graphics): Unit = {\\n val g = gg.asInstanceOf[Graphics2D]\\n\\n def drawPentagram(g: Graphics2D, x: Int, y: Int, fill: Color): Unit = {\\n var (_x, _y, angle) = (x, y, 0.0)\\n val p = new Path2D.Float\\n p.moveTo(_x, _y)\\n for (i <- 0 until 5) {\\n val (x2, y2) = (_x + (Math.cos(angle) * 500).toInt, _y + (Math.sin(-angle) * 500).toInt)\\n p.lineTo(x2, y2)\\n _x = x2\\n _y = y2\\n angle -= degrees144\\n }\\n p.closePath()\\n g.setColor(fill)\\n g.fill(p)\\n g.setColor(Color.darkGray)\\n g.draw(p)\\n }\\n\\n super.paintComponent(gg)\\n g.setRenderingHint(RenderingHints.KEY_ANTIALIASING, RenderingHints.VALUE_ANTIALIAS_ON)\\n g.setStroke(new BasicStroke(5, BasicStroke.CAP_ROUND, BasicStroke.JOIN_MITER))\\n drawPentagram(g, 70, 250, new Color(0x6495ED))\\n }\\n }\\n\\n add(new Pentagram, BorderLayout.CENTER)\\n pack()\\n setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE)\\n setLocationRelativeTo(null)\\n setResizable(false)\\n setVisible(true)\\n }\\n )\\n\\n}\\n\",\n \"language\": \"Scala\"\n },\n {\n \"code\": \"func pentagram(dim=200, sides=5) {\\n var pentagram = <<-EOT\\n <?xml version=\\\"1.0\\\" standalone=\\\"no\\\" ?>\\n <!DOCTYPE svg PUBLIC \\\"-//W3C//DTD SVG 1.0//EN\\\"\\n \\\"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\\\">\\n <svg height=\\\"#{dim*2}\\\" width=\\\"#{dim*2}\\\" style=\\\"\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\\n <rect height=\\\"100%\\\" width=\\\"100%\\\" style=\\\"fill:black;\\\" />\\n EOT\\n\\n func pline(q) {\\n <<-EOT\\n <polyline points=\\\"#{{|n| '%0.3f' % n }.map(q, q[0], q[1]).join(' ')}\\\"\\n style=\\\"fill:blue; stroke:white; stroke-width:3;\\\"\\n transform=\\\"translate(#{dim}, #{dim}) rotate(-18)\\\" />\\n EOT\\n }\\n\\n var v = {|k| 0.9 * dim * cis(k * Num.tau / sides) }.map(^sides)\\n pentagram += pline([v[range(0, v.end, 2)], v[range(1, v.end, 2)]].map{.reals})\\n pentagram += '</svg>'\\n\\n return pentagram\\n}\\n\\nsay pentagram()\\n\",\n \"language\": \"Sidef\"\n },\n {\n \"code\": \"mx,my = #.scrsize()\\nxc = mx/2\\nyc = my/2\\nmr = #.min(mx,my)/3\\n#.angle(#.degrees)\\n#.drawcolor(1,0,0)\\n#.drawsize(10)\\n> r, mr..0,-1\\n #.drawline(xc,yc-r,xc,yc-r)\\n > a, 54..630,144\\n #.drawline(r*#.cos(a)+xc,r*#.sin(a)+yc)\\n <\\n #.drawcolor(1,1,0)\\n #.drawsize(1)\\n<\\n\",\n \"language\": \"SPL\"\n },\n {\n \"code\": \"package require Tk 8.6 \\t;# lmap is new in Tcl/Tk 8.6\\n\\nset pi [expr 4*atan(1)]\\n\\npack [canvas .c] -expand yes -fill both ;# create the canvas\\n\\nupdate ;# draw everything so the dimensions are accurate\\n\\nset w [winfo width .c] ;# calculate appropriate dimensions\\nset h [winfo height .c]\\nset r [expr {min($w,$h) * 0.45}]\\n\\nset points [lmap n {0 1 2 3 4 5} {\\n set n [expr {$n * 2}]\\n set y [expr {sin($pi * 2 * $n / 5) * $r + $h / 2}]\\n set x [expr {cos($pi * 2 * $n / 5) * $r + $w / 2}]\\n list $x $y\\n}]\\nset points [concat {*}$points] ;# flatten the list\\n\\nputs [.c create line $points]\\n\\n;# a fun reader exercise is to make the shape respond to mouse events,\\n;# or animate it!\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"Sub pentagram()\\n With ActiveSheet.Shapes.AddShape(msoShape5pointStar, 10, 10, 400, 400)\\n .Fill.ForeColor.RGB = RGB(255, 0, 0)\\n .Line.Weight = 3\\n .Line.ForeColor.RGB = RGB(0, 0, 255)\\n End With\\nEnd Sub\\n\",\n \"language\": \"VBA\"\n },\n {\n \"code\": \"import \\\"graphics\\\" for Canvas, Color, Point\\nimport \\\"dome\\\" for Window\\n\\nclass Game {\\n static init() {\\n Window.title = \\\"Pentagram\\\"\\n var width = 640\\n var height = 640\\n Window.resize(width, height)\\n Canvas.resize(width, height)\\n Canvas.cls(Color.white)\\n var col = Color.hex(\\\"#6495ed\\\") // cornflower blue\\n for (i in 1..240) pentagram(320, 320, i, col)\\n for (i in 241..250) pentagram(320, 320, i, Color.black)\\n }\\n\\n static update() {}\\n\\n static draw(alpha) {}\\n\\n static pentagram(x, y, r, col) {\\n var points = List.filled(5, null)\\n for (i in 0..4) {\\n var angle = 2*Num.pi*i/5 - Num.pi/2\\n points[i] = Point.new(x + r*angle.cos, y + r*angle.sin)\\n }\\n var prev = points[0]\\n for (i in 1..5) {\\n var index = (i * 2) % 5\\n var curr = points[index]\\n Canvas.line(prev.x, prev.y, curr.x, curr.y, col)\\n prev = curr\\n }\\n }\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"proc FillArea(X, Y, C0, C); \\\\Replace area colored C0 with color C\\nint X, Y, \\\\starting coordinate for flood fill algorithm\\n C0, C; \\\\initial color, and color to replace it with\\ndef S=8000; \\\\size of queue (must be an even number)\\nint Q(S), \\\\queue (FIFO)\\n F, E; \\\\fill and empty indexes\\n\\n proc EnQ(X, Y); \\\\Enqueue coordinate\\n int X, Y;\\n [Q(F):= X;\\n F:= F+1;\\n Q(F):= Y;\\n F:= F+1;\\n if F >= S then F:= 0;\\n ]; \\\\EnQ\\n\\n proc DeQ; \\\\Dequeue coordinate\\n [X:= Q(E);\\n E:= E+1;\\n Y:= Q(E);\\n E:= E+1;\\n if E >= S then E:= 0;\\n ]; \\\\DeQ\\n\\n[if C0 = C then return;\\nF:= 0; E:= 0;\\nEnQ(X, Y);\\nwhile E # F do\\n [DeQ;\\n if ReadPix(X, Y) = C0 then\\n [Point(X, Y, C);\\n EnQ(X+1, Y); \\\\enqueue adjacent pixels\\n EnQ(X-1, Y);\\n EnQ(X, Y+1);\\n EnQ(X, Y-1);\\n ];\\n ];\\n]; \\\\FillArea\\n\\ndef Size = 200.;\\ndef Pi = 3.141592654;\\ndef Deg144 = 4.*Pi/5.;\\nint X, Y, N;\\n[SetVid($12); \\\\set 640x480x4 VGA graphics\\nfor Y:= 0 to 480-1 do \\\\fill screen\\n [Move(0, Y); Line(640-1, Y, $F\\\\white\\\\)];\\nfor N:= 0 to 5 do \\\\draw pentagram\\n [X:= fix(Size*Sin(float(N)*Deg144));\\n Y:= fix(Size*Cos(float(N)*Deg144));\\n if N = 0 then Move(X+320, 240-Y)\\n else Line(X+320, 240-Y, 4\\\\red\\\\);\\n ];\\nFillArea(0, 0, $F, 1); \\\\replace white (F) with blue (1)\\n]\\n\",\n \"language\": \"XPL0\"\n },\n {\n \"code\": \"const DIM=200, SIDES=5, A=360/SIDES, R=DIM.toFloat();\\nvs:=[0.0..360-A,A].apply(\\\"toRad\\\"); // angles of vertices\\n#<<<\\n0'|<?xml version=\\\"1.0\\\" standalone=\\\"no\\\" ?>\\n<!DOCTYPE svg PUBLIC \\\"-//W3C//DTD SVG 1.0//EN\\\"\\n\\\"http://www.w3.org/TR/2001/PR-SVG-20010719/DTD/svg10.dtd\\\">\\n<svg height=\\\"%d\\\" width=\\\"%d\\\" style=\\\"\\\" xmlns=\\\"http://www.w3.org/2000/svg\\\">\\n<rect height=\\\"100%\\\" width=\\\"100%\\\" style=\\\"fill:bisque;\\\" />|\\n#<<<\\n.fmt(DIM*2, DIM*2).println();\\n\\nvar vertices=vs.pump(List,fcn(a){ R.toRectangular(a) }); //( (x,y), (x,y)...\\nSIDES.pump(String,pline).println(); // the line pairs that draw the pentagram\\n\\nfcn pline(n){ a:=(n + 2)%SIDES; // (n,a) are the endpoints of the right leg\\n pts:=String(\\\"\\\\\\\"\\\", (\\\"% 0.3f,% 0.3f \\\"*2), \\\"\\\\\\\" \\\"); // two points\\n vs:='wrap(){ T(n,a).pump(List,vertices.get).flatten() }; //(x,y, x,y)\\n String(\\n (0'|<polyline points=| + pts).fmt(vs().xplode()),\\n 0'|style=\\\"fill:seashell; stroke:blue; stroke-width:3;\\\" |,\\n 0'|transform=\\\"translate(%d,%d) rotate(-18)\\\"|.fmt(DIM,DIM),\\n \\\" />\\\\n\\\"\\n );\\n}\\nprintln(\\\"</svg>\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pentagram"}}},{"rowIdx":1498,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Pentomino_tiling\n","language":"00-META"},{"code":"A [[wp:Pentomino|pentomino]] is a polyomino that consists of 5 squares. There are 12 pentomino shapes, \nif you don't count rotations and reflections. Most pentominoes can form their own mirror image through \nrotation, but some of them have to be flipped over.\n\n<pre> I \n I L N Y \n FF I L NN PP TTT V W X YY ZZ\nFF I L N PP T U U V WW XXX Y Z \n F I LL N P T UUU VVV WW X Y ZZ</pre> \n\n\nA Pentomino tiling is an example of an [[wp:Exact_cover|exact cover]] problem and can take on many forms. \nA traditional tiling presents an 8 by 8 grid, where 4 cells are left uncovered. The other cells are covered \nby the 12 pentomino shapes, without overlaps, with every shape only used once.\n\nThe 4 uncovered cells should be chosen at random. Note that not all configurations are solvable.\n\n\n;Task\nCreate an 8 by 8 tiling and print the result.\n\n\n;Example\n\n<pre>F I I I I I L N\nF F F L L L L N\nW F - X Z Z N N\nW W X X X Z N V\nT W W X - Z Z V\nT T T P P V V V\nT Y - P P U U U\nY Y Y Y P U - U</pre>\n\n\n;Related tasks\n* [[Free_polyominoes_enumeration|Free polyominoes enumeration]]\n<br><br>\n\n","language":"00-TASK"},{"code":"F nonrandom(n)\n UInt32 :seed = 0\n :seed = 1664525 * :seed + 1013904223\n R (:seed >> 16) % n\n\n-V\n SF = [[1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]]\n\n SI = [[0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]]\n\n SL = [[1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]]\n\n SN = [[0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]]\n\n SP = [[0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]]\n\n ST = [[0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]]\n\n\n SU = [[0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]]\n\n SV = [[1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]]\n\n SW = [[1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]]\n\n SX = [[1, -1, 1, 0, 1, 1, 2, 0]]\n\n SY = [[1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]]\n\n SZ = [[0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]]\n\n Shapes = [SF, SI, SL, SN, SP, ST, SU, SV, SW, SX, SY, SZ]\n Symbols = Array(‘FILNPTUVWXYZ-’)\n\n NRows = 8\n NCols = 8\n Blank = Shapes.len\n\nT Tiling\n [[[Int]]] shapes\n [Char] symbols\n [[Int]] grid\n [Bool] placed\n\n F ()\n V indexes = [4, 6, 11, 7, 10, 3, 9, 5, 1, 8, 0, 2]\n L(index) indexes\n .shapes.append(Shapes[index])\n .symbols.append(Symbols[index])\n .symbols.append(Symbols.last)\n\n .grid = [[-1] * NCols] * NRows\n\n L 4\n L\n V randRow = nonrandom(NRows)\n V randCol = nonrandom(NCols)\n I .grid[randRow][randCol] != Blank\n .grid[randRow][randCol] = Blank\n L.break\n\n .placed = [0B] * Shapes.len\n\n F tryPlaceOrientation(o, r, c, shapeIndex)\n L(i) (0 .< o.len).step(2)\n V x = c + o[i + 1]\n V y = r + o[i]\n I x !C 0 .< NCols | y !C 0 .< NRows | .grid[y][x] != -1\n R 0B\n .grid[r][c] = shapeIndex\n L(i) (0 .< o.len).step(2)\n .grid[r + o[i]][c + o[i + 1]] = shapeIndex\n R 1B\n\n F removeOrientation(o, r, c)\n .grid[r][c] = -1\n L(i) (0 .< o.len).step(2)\n .grid[r + o[i]][c + o[i + 1]] = -1\n\n F solve(pos, numPlaced)\n I numPlaced == .shapes.len\n R 1B\n\n V row = pos I/ NCols\n V col = pos % NCols\n I .grid[row][col] != -1\n R .solve(pos + 1, numPlaced)\n\n L(i) 0 .< .shapes.len\n I !.placed[i]\n L(orientation) .shapes[i]\n I !.tryPlaceOrientation(orientation, row, col, i)\n L.continue\n .placed[i] = 1B\n I .solve(pos + 1, numPlaced + 1)\n R 1B\n .removeOrientation(orientation, row, col)\n .placed[i] = 0B\n R 0B\n\n F printResult()\n L(r) .grid\n print(r.map(i -> @.symbols[i]).join(‘ ’))\n\nV tiling = Tiling()\nI tiling.solve(0, 0)\n tiling.printResult()\nE\n print(‘No solution’)\n","language":"11l"},{"code":"#include <algorithm>\n#include <cstdint>\n#include <iostream>\n#include <random>\n#include <vector>\n\nconst std::vector<std::vector<int32_t>> F = { { 1, -1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 1, -1, 1, 0, 2, 0 },\n { 1, 0, 1, 1, 1, 2, 2, 1 }, { 1, 0, 1, 1, 2, -1, 2, 0 }, { 1, -2, 1, -1, 1, 0, 2, -1 },\n { 0, 1, 1, 1, 1, 2, 2, 1 }, { 1, -1, 1, 0, 1, 1, 2, -1 }, { 1, -1, 1, 0, 2, 0, 2, 1 } };\n\nconst std::vector<std::vector<int32_t>> I = { { 0, 1, 0, 2, 0, 3, 0, 4 }, { 1, 0, 2, 0, 3, 0, 4, 0 } };\n\nconst std::vector<std::vector<int32_t>> L = { { 1, 0, 1, 1, 1, 2, 1, 3 }, { 1, 0, 2, 0, 3, -1, 3, 0 },\n { 0, 1, 0, 2, 0, 3, 1, 3 }, { 0, 1, 1, 0, 2, 0, 3, 0 }, { 0, 1, 1, 1, 2, 1, 3, 1 },\n { 0, 1, 0, 2, 0, 3, 1, 0 }, { 1, 0, 2, 0, 3, 0, 3, 1 }, { 1, -3, 1, -2, 1, -1, 1, 0 } };\n\nconst std::vector<std::vector<int32_t>> N = { { 0, 1, 1, -2, 1, -1, 1, 0 }, { 1, 0, 1, 1, 2, 1, 3, 1 },\n { 0, 1, 0, 2, 1, -1, 1, 0 }, { 1, 0, 2, 0, 2, 1, 3, 1 }, { 0, 1, 1, 1, 1, 2, 1, 3 },\n { 1, 0, 2, -1, 2, 0, 3, -1 }, { 0, 1, 0, 2, 1, 2, 1, 3 }, { 1, -1, 1, 0, 2, -1, 3, -1 } };\n\nconst std::vector<std::vector<int32_t>> P = { { 0, 1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 0, 2, 1, 0, 1, 1 },\n { 1, 0, 1, 1, 2, 0, 2, 1 }, { 0, 1, 1, -1, 1, 0, 1, 1 }, { 0, 1, 1, 0, 1, 1, 1, 2 },\n { 1, -1, 1, 0, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 1, 1, 2 }, { 0, 1, 1, 0, 1, 1, 2, 0 } };\n\nconst std::vector<std::vector<int32_t>> T = { { 0, 1, 0, 2, 1, 1, 2, 1 }, { 1, -2, 1, -1, 1, 0, 2, 0 },\n { 1, 0, 2, -1, 2, 0, 2, 1 }, { 1, 0, 1, 1, 1, 2, 2, 0 } };\n\nconst std::vector<std::vector<int32_t>> U = { { 0, 1, 0, 2, 1, 0, 1, 2 }, { 0, 1, 1, 1, 2, 0, 2, 1 },\n { 0, 2, 1, 0, 1, 1, 1, 2 }, { 0, 1, 1, 0, 2, 0, 2, 1 } };\n\nconst std::vector<std::vector<int32_t>> V = { { 1, 0, 2, 0, 2, 1, 2, 2 }, { 0, 1, 0, 2, 1, 0, 2, 0 },\n { 1, 0, 2, -2, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 2, 2, 2 } };\n\nconst std::vector<std::vector<int32_t>> W = { { 1, 0, 1, 1, 2, 1, 2, 2 }, { 1, -1, 1, 0, 2, -2, 2, -1 },\n { 0, 1, 1, 1, 1, 2, 2, 2 }, { 0, 1, 1, -1, 1, 0, 2, -1 } };\n\nconst std::vector<std::vector<int32_t>> X = { { 1, -1, 1, 0, 1, 1, 2, 0 } };\n\nconst std::vector<std::vector<int32_t>> Y = { { 1, -2, 1, -1, 1, 0, 1, 1 }, { 1, -1, 1, 0, 2, 0, 3, 0 },\n { 0, 1, 0, 2, 0, 3, 1, 1 }, { 1, 0, 2, 0, 2, 1, 3, 0 }, { 0, 1, 0, 2, 0, 3, 1, 2 },\n { 1, 0, 1, 1, 2, 0, 3, 0 }, { 1, -1, 1, 0, 1, 1, 1, 2 }, { 1, 0, 2, -1, 2, 0, 3, 0 } };\n\nconst std::vector<std::vector<int32_t>> Z = { { 0, 1, 1, 0, 2, -1, 2, 0 }, { 1, 0, 1, 1, 1, 2, 2, 2 },\n { 0, 1, 1, 1, 2, 1, 2, 2 }, { 1, -2, 1, -1, 1, 0, 2, -2 } };\n\nconst int32_t blank_index = 12;\nconst int32_t nRows = 8;\nconst int32_t nCols = 8;\n\nstd::vector<std::vector<std::vector<int32_t>>> shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z };\nstd::vector<char> symbols = { 'F', 'I', 'L', 'N', 'P', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '-' };\nstd::vector<std::vector<int32_t>> grid{nRows, std::vector<int32_t>(nCols, -1)};\nstd::vector<bool> placed(symbols.size() - 1, false);\n\nstd::random_device random;\nstd::mt19937 generator(random());\nstd::uniform_real_distribution<double> distribution(0.0F, 1.0F);\n\nvoid display() {\n for ( const std::vector<int32_t>& row : grid ) {\n\t for ( const int32_t& index : row ) {\n\t\t std::cout << symbols[index] << \" \";\n\t }\n\t std::cout << std::endl;\n }\n}\n\nvoid shuffle_shapes() {\n\tuint64_t size = shapes.size();\n\twhile ( size > 1 ) {\n\t\tint32_t random = static_cast<int32_t>( distribution(generator) * ( size-- ) );\n\n\t\tconst std::vector<std::vector<int32_t>> temp = shapes[random];\n\t\tshapes[random] = shapes[size];\n\t\tshapes[size] = temp;\n\n\t\tconst char temp_symbol = symbols[random];\n\t\tsymbols[random] = symbols[size];\n\t\tsymbols[size] = temp_symbol;\n\t}\n}\n\nbool place_orientation(const std::vector<int32_t>& orientation,\n const int32_t& row, const int32_t& col, const int32_t& shape_index) {\n\tfor ( uint64_t i = 0; i < orientation.size(); i += 2 ) {\n\t\tint32_t x = col + orientation[i + 1];\n\t\tint32_t y = row + orientation[i];\n\t\tif ( x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1 ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tgrid[row][col] = shape_index;\n\tfor ( uint64_t i = 0; i < orientation.size(); i += 2 ) {\n\t\tgrid[row + orientation[i]][col + orientation[i + 1]] = shape_index;\n\t}\n\treturn true;\n}\n\nvoid remove_orientation(const std::vector<int32_t>& oorientation, const int32_t& row, const int32_t& col) {\n\tgrid[row][col] = -1;\n\tfor ( uint64_t i = 0; i < oorientation.size(); i += 2 ) {\n\t\tgrid[row + oorientation[i]][col + oorientation[i + 1]] = -1;\n\t}\n}\n\nbool solve(const int32_t& position, const uint64_t& number_placed) {\n if ( number_placed == shapes.size() ) {\n\t return true;\n }\n\n int32_t row = position / nCols;\n int32_t col = position % nCols;\n\n if ( grid[row][col] != -1 ) {\n\t return solve(position + 1, number_placed);\n }\n\n for ( uint64_t i = 0; i < shapes.size(); ++i ) {\n\t if ( ! placed[i] ) {\n\t\t for ( const std::vector<int32_t>& orientation : shapes[i] ) {\n\t\t\t if ( ! place_orientation(orientation, row, col, i) ) {\n\t\t\t\t continue;\n\t\t\t }\n\n\t\t\t placed[i] = true;\n\n\t\t\t if ( solve(position + 1, number_placed + 1) ) {\n\t\t\t\t return true;\n\t\t\t }\n\n\t\t\t remove_orientation(orientation, row, col);\n\t\t\t placed[i] = false;\n\t\t }\n\t }\n }\n return false;\n}\n\nint main() {\n\tshuffle_shapes();\n\n\tfor ( int32_t i = 0; i < 4; ++i ) {\n\t\tint32_t random_row, random_col;\n\t\tdo {\n\t\t\trandom_row = static_cast<int32_t>(distribution(generator) * nRows);\n\t\t\trandom_col = static_cast<int32_t>(distribution(generator) * nCols);\n\t\t} while ( grid[random_row][random_col] == blank_index );\n\n\t\tgrid[random_row][random_col] = blank_index;\n\n\t}\n\n\tif ( solve(0, 0) ) {\n\t\tdisplay();\n\t} else {\n\t\tstd::cout << \"No solution found\" << std::endl;\n\t}\n}\n","language":"C++"},{"code":"using System;\nusing System.Linq;\n\nnamespace PentominoTiling\n{\n class Program\n {\n static readonly char[] symbols = \"FILNPTUVWXYZ-\".ToCharArray();\n\n static readonly int nRows = 8;\n static readonly int nCols = 8;\n static readonly int target = 12;\n static readonly int blank = 12;\n\n static int[][] grid = new int[nRows][];\n static bool[] placed = new bool[target];\n\n static void Main(string[] args)\n {\n var rand = new Random();\n\n for (int r = 0; r < nRows; r++)\n grid[r] = Enumerable.Repeat(-1, nCols).ToArray();\n\n for (int i = 0; i < 4; i++)\n {\n int randRow, randCol;\n do\n {\n randRow = rand.Next(nRows);\n randCol = rand.Next(nCols);\n }\n while (grid[randRow][randCol] == blank);\n\n grid[randRow][randCol] = blank;\n }\n\n if (Solve(0, 0))\n {\n PrintResult();\n }\n else\n {\n Console.WriteLine(\"no solution\");\n }\n\n Console.ReadKey();\n }\n\n private static void PrintResult()\n {\n foreach (int[] r in grid)\n {\n foreach (int i in r)\n Console.Write(\"{0} \", symbols[i]);\n Console.WriteLine();\n }\n }\n\n private static bool Solve(int pos, int numPlaced)\n {\n if (numPlaced == target)\n return true;\n\n int row = pos / nCols;\n int col = pos % nCols;\n\n if (grid[row][col] != -1)\n return Solve(pos + 1, numPlaced);\n\n for (int i = 0; i < shapes.Length; i++)\n {\n if (!placed[i])\n {\n foreach (int[] orientation in shapes[i])\n {\n if (!TryPlaceOrientation(orientation, row, col, i))\n continue;\n\n placed[i] = true;\n\n if (Solve(pos + 1, numPlaced + 1))\n return true;\n\n RemoveOrientation(orientation, row, col);\n placed[i] = false;\n }\n }\n }\n return false;\n }\n\n private static void RemoveOrientation(int[] orientation, int row, int col)\n {\n grid[row][col] = -1;\n for (int i = 0; i < orientation.Length; i += 2)\n grid[row + orientation[i]][col + orientation[i + 1]] = -1;\n }\n\n private static bool TryPlaceOrientation(int[] orientation, int row, int col, int shapeIndex)\n {\n for (int i = 0; i < orientation.Length; i += 2)\n {\n int x = col + orientation[i + 1];\n int y = row + orientation[i];\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1)\n return false;\n }\n\n grid[row][col] = shapeIndex;\n for (int i = 0; i < orientation.Length; i += 2)\n grid[row + orientation[i]][col + orientation[i + 1]] = shapeIndex;\n\n return true;\n }\n\n // four (x, y) pairs are listed, (0,0) not included\n static readonly int[][] F = {\n new int[] {1, -1, 1, 0, 1, 1, 2, 1}, new int[] {0, 1, 1, -1, 1, 0, 2, 0},\n new int[] {1, 0, 1, 1, 1, 2, 2, 1}, new int[] {1, 0, 1, 1, 2, -1, 2, 0},\n new int[] {1, -2, 1, -1, 1, 0, 2, -1}, new int[] {0, 1, 1, 1, 1, 2, 2, 1},\n new int[] {1, -1, 1, 0, 1, 1, 2, -1}, new int[] {1, -1, 1, 0, 2, 0, 2, 1}};\n\n static readonly int[][] I = {\n new int[] { 0, 1, 0, 2, 0, 3, 0, 4 }, new int[] { 1, 0, 2, 0, 3, 0, 4, 0 } };\n\n static readonly int[][] L = {\n new int[] {1, 0, 1, 1, 1, 2, 1, 3}, new int[] {1, 0, 2, 0, 3, -1, 3, 0},\n new int[] {0, 1, 0, 2, 0, 3, 1, 3}, new int[] {0, 1, 1, 0, 2, 0, 3, 0},\n new int[] {0, 1, 1, 1, 2, 1, 3, 1}, new int[] {0, 1, 0, 2, 0, 3, 1, 0},\n new int[] {1, 0, 2, 0, 3, 0, 3, 1}, new int[] {1, -3, 1, -2, 1, -1, 1, 0}};\n\n static readonly int[][] N = {\n new int[] {0, 1, 1, -2, 1, -1, 1, 0}, new int[] {1, 0, 1, 1, 2, 1, 3, 1},\n new int[] {0, 1, 0, 2, 1, -1, 1, 0}, new int[] {1, 0, 2, 0, 2, 1, 3, 1},\n new int[] {0, 1, 1, 1, 1, 2, 1, 3}, new int[] {1, 0, 2, -1, 2, 0, 3, -1},\n new int[] {0, 1, 0, 2, 1, 2, 1, 3}, new int[] {1, -1, 1, 0, 2, -1, 3, -1}};\n\n static readonly int[][] P = {\n new int[] {0, 1, 1, 0, 1, 1, 2, 1}, new int[] {0, 1, 0, 2, 1, 0, 1, 1},\n new int[] {1, 0, 1, 1, 2, 0, 2, 1}, new int[] {0, 1, 1, -1, 1, 0, 1, 1},\n new int[] {0, 1, 1, 0, 1, 1, 1, 2}, new int[] {1, -1, 1, 0, 2, -1, 2, 0},\n new int[] {0, 1, 0, 2, 1, 1, 1, 2}, new int[] {0, 1, 1, 0, 1, 1, 2, 0}};\n\n static readonly int[][] T = {\n new int[] {0, 1, 0, 2, 1, 1, 2, 1}, new int[] {1, -2, 1, -1, 1, 0, 2, 0},\n new int[] {1, 0, 2, -1, 2, 0, 2, 1}, new int[] {1, 0, 1, 1, 1, 2, 2, 0}};\n\n static readonly int[][] U = {\n new int[] {0, 1, 0, 2, 1, 0, 1, 2}, new int[] {0, 1, 1, 1, 2, 0, 2, 1},\n new int[] {0, 2, 1, 0, 1, 1, 1, 2}, new int[] {0, 1, 1, 0, 2, 0, 2, 1}};\n\n static readonly int[][] V = {\n new int[] {1, 0, 2, 0, 2, 1, 2, 2}, new int[] {0, 1, 0, 2, 1, 0, 2, 0},\n new int[] {1, 0, 2, -2, 2, -1, 2, 0}, new int[] {0, 1, 0, 2, 1, 2, 2, 2}};\n\n static readonly int[][] W = {\n new int[] {1, 0, 1, 1, 2, 1, 2, 2}, new int[] {1, -1, 1, 0, 2, -2, 2, -1},\n new int[] {0, 1, 1, 1, 1, 2, 2, 2}, new int[] {0, 1, 1, -1, 1, 0, 2, -1}};\n\n static readonly int[][] X = { new int[] { 1, -1, 1, 0, 1, 1, 2, 0 } };\n\n static readonly int[][] Y = {\n new int[] {1, -2, 1, -1, 1, 0, 1, 1}, new int[] {1, -1, 1, 0, 2, 0, 3, 0},\n new int[] {0, 1, 0, 2, 0, 3, 1, 1}, new int[] {1, 0, 2, 0, 2, 1, 3, 0},\n new int[] {0, 1, 0, 2, 0, 3, 1, 2}, new int[] {1, 0, 1, 1, 2, 0, 3, 0},\n new int[] {1, -1, 1, 0, 1, 1, 1, 2}, new int[] {1, 0, 2, -1, 2, 0, 3, 0}};\n\n static readonly int[][] Z = {\n new int[] {0, 1, 1, 0, 2, -1, 2, 0}, new int[] {1, 0, 1, 1, 1, 2, 2, 2},\n new int[] {0, 1, 1, 1, 2, 1, 2, 2}, new int[] {1, -2, 1, -1, 1, 0, 2, -2}};\n\n static readonly int[][][] shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z };\n }\n}\n","language":"C-sharp"},{"code":"package main\n\nimport (\n \"fmt\"\n \"math/rand\"\n \"time\"\n)\n\nvar F = [][]int{\n {1, -1, 1, 0, 1, 1, 2, 1}, {0, 1, 1, -1, 1, 0, 2, 0},\n {1, 0, 1, 1, 1, 2, 2, 1}, {1, 0, 1, 1, 2, -1, 2, 0},\n {1, -2, 1, -1, 1, 0, 2, -1}, {0, 1, 1, 1, 1, 2, 2, 1},\n {1, -1, 1, 0, 1, 1, 2, -1}, {1, -1, 1, 0, 2, 0, 2, 1},\n}\n\nvar I = [][]int{{0, 1, 0, 2, 0, 3, 0, 4}, {1, 0, 2, 0, 3, 0, 4, 0}}\n\nvar L = [][]int{\n {1, 0, 1, 1, 1, 2, 1, 3}, {1, 0, 2, 0, 3, -1, 3, 0},\n {0, 1, 0, 2, 0, 3, 1, 3}, {0, 1, 1, 0, 2, 0, 3, 0}, {0, 1, 1, 1, 2, 1, 3, 1},\n {0, 1, 0, 2, 0, 3, 1, 0}, {1, 0, 2, 0, 3, 0, 3, 1}, {1, -3, 1, -2, 1, -1, 1, 0},\n}\n\nvar N = [][]int{\n {0, 1, 1, -2, 1, -1, 1, 0}, {1, 0, 1, 1, 2, 1, 3, 1},\n {0, 1, 0, 2, 1, -1, 1, 0}, {1, 0, 2, 0, 2, 1, 3, 1}, {0, 1, 1, 1, 1, 2, 1, 3},\n {1, 0, 2, -1, 2, 0, 3, -1}, {0, 1, 0, 2, 1, 2, 1, 3}, {1, -1, 1, 0, 2, -1, 3, -1},\n}\n\nvar P = [][]int{\n {0, 1, 1, 0, 1, 1, 2, 1}, {0, 1, 0, 2, 1, 0, 1, 1},\n {1, 0, 1, 1, 2, 0, 2, 1}, {0, 1, 1, -1, 1, 0, 1, 1}, {0, 1, 1, 0, 1, 1, 1, 2},\n {1, -1, 1, 0, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 1, 1, 2}, {0, 1, 1, 0, 1, 1, 2, 0},\n}\n\nvar T = [][]int{\n {0, 1, 0, 2, 1, 1, 2, 1}, {1, -2, 1, -1, 1, 0, 2, 0},\n {1, 0, 2, -1, 2, 0, 2, 1}, {1, 0, 1, 1, 1, 2, 2, 0},\n}\n\nvar U = [][]int{\n {0, 1, 0, 2, 1, 0, 1, 2}, {0, 1, 1, 1, 2, 0, 2, 1},\n {0, 2, 1, 0, 1, 1, 1, 2}, {0, 1, 1, 0, 2, 0, 2, 1},\n}\n\nvar V = [][]int{\n {1, 0, 2, 0, 2, 1, 2, 2}, {0, 1, 0, 2, 1, 0, 2, 0},\n {1, 0, 2, -2, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 2, 2, 2},\n}\n\nvar W = [][]int{\n {1, 0, 1, 1, 2, 1, 2, 2}, {1, -1, 1, 0, 2, -2, 2, -1},\n {0, 1, 1, 1, 1, 2, 2, 2}, {0, 1, 1, -1, 1, 0, 2, -1},\n}\n\nvar X = [][]int{{1, -1, 1, 0, 1, 1, 2, 0}}\n\nvar Y = [][]int{\n {1, -2, 1, -1, 1, 0, 1, 1}, {1, -1, 1, 0, 2, 0, 3, 0},\n {0, 1, 0, 2, 0, 3, 1, 1}, {1, 0, 2, 0, 2, 1, 3, 0}, {0, 1, 0, 2, 0, 3, 1, 2},\n {1, 0, 1, 1, 2, 0, 3, 0}, {1, -1, 1, 0, 1, 1, 1, 2}, {1, 0, 2, -1, 2, 0, 3, 0},\n}\n\nvar Z = [][]int{\n {0, 1, 1, 0, 2, -1, 2, 0}, {1, 0, 1, 1, 1, 2, 2, 2},\n {0, 1, 1, 1, 2, 1, 2, 2}, {1, -2, 1, -1, 1, 0, 2, -2},\n}\n\nvar shapes = [][][]int{F, I, L, N, P, T, U, V, W, X, Y, Z}\n\nvar symbols = []byte(\"FILNPTUVWXYZ-\")\n\nconst (\n nRows = 8\n nCols = 8\n blank = 12\n)\n\nvar grid [nRows][nCols]int\nvar placed [12]bool\n\nfunc tryPlaceOrientation(o []int, r, c, shapeIndex int) bool {\n for i := 0; i < len(o); i += 2 {\n x := c + o[i+1]\n y := r + o[i]\n if x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1 {\n return false\n }\n }\n grid[r][c] = shapeIndex\n for i := 0; i < len(o); i += 2 {\n grid[r+o[i]][c+o[i+1]] = shapeIndex\n }\n return true\n}\n\nfunc removeOrientation(o []int, r, c int) {\n grid[r][c] = -1\n for i := 0; i < len(o); i += 2 {\n grid[r+o[i]][c+o[i+1]] = -1\n }\n}\n\nfunc solve(pos, numPlaced int) bool {\n if numPlaced == len(shapes) {\n return true\n }\n row := pos / nCols\n col := pos % nCols\n if grid[row][col] != -1 {\n return solve(pos+1, numPlaced)\n }\n\n for i := range shapes {\n if !placed[i] {\n for _, orientation := range shapes[i] {\n if !tryPlaceOrientation(orientation, row, col, i) {\n continue\n }\n placed[i] = true\n if solve(pos+1, numPlaced+1) {\n return true\n }\n removeOrientation(orientation, row, col)\n placed[i] = false\n }\n }\n }\n return false\n}\n\nfunc shuffleShapes() {\n rand.Shuffle(len(shapes), func(i, j int) {\n shapes[i], shapes[j] = shapes[j], shapes[i]\n symbols[i], symbols[j] = symbols[j], symbols[i]\n })\n}\n\nfunc printResult() {\n for _, r := range grid {\n for _, i := range r {\n fmt.Printf(\"%c \", symbols[i])\n }\n fmt.Println()\n }\n}\n\nfunc main() {\n rand.Seed(time.Now().UnixNano())\n shuffleShapes()\n for r := 0; r < nRows; r++ {\n for i := range grid[r] {\n grid[r][i] = -1\n }\n }\n for i := 0; i < 4; i++ {\n var randRow, randCol int\n for {\n randRow = rand.Intn(nRows)\n randCol = rand.Intn(nCols)\n if grid[randRow][randCol] != blank {\n break\n }\n }\n grid[randRow][randCol] = blank\n }\n if solve(0, 0) {\n printResult()\n } else {\n fmt.Println(\"No solution\")\n }\n}\n","language":"Go"},{"code":"package pentominotiling;\n\nimport java.util.*;\n\npublic class PentominoTiling {\n\n static final char[] symbols = \"FILNPTUVWXYZ-\".toCharArray();\n static final Random rand = new Random();\n\n static final int nRows = 8;\n static final int nCols = 8;\n static final int blank = 12;\n\n static int[][] grid = new int[nRows][nCols];\n static boolean[] placed = new boolean[symbols.length - 1];\n\n public static void main(String[] args) {\n shuffleShapes();\n\n for (int r = 0; r < nRows; r++)\n Arrays.fill(grid[r], -1);\n\n for (int i = 0; i < 4; i++) {\n int randRow, randCol;\n do {\n randRow = rand.nextInt(nRows);\n randCol = rand.nextInt(nCols);\n } while (grid[randRow][randCol] == blank);\n grid[randRow][randCol] = blank;\n }\n\n if (solve(0, 0)) {\n printResult();\n } else {\n System.out.println(\"no solution\");\n }\n }\n\n static void shuffleShapes() {\n int n = shapes.length;\n while (n > 1) {\n int r = rand.nextInt(n--);\n\n int[][] tmp = shapes[r];\n shapes[r] = shapes[n];\n shapes[n] = tmp;\n\n char tmpSymbol = symbols[r];\n symbols[r] = symbols[n];\n symbols[n] = tmpSymbol;\n }\n }\n\n static void printResult() {\n for (int[] r : grid) {\n for (int i : r)\n System.out.printf(\"%c \", symbols[i]);\n System.out.println();\n }\n }\n\n static boolean tryPlaceOrientation(int[] o, int r, int c, int shapeIndex) {\n\n for (int i = 0; i < o.length; i += 2) {\n int x = c + o[i + 1];\n int y = r + o[i];\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1)\n return false;\n }\n\n grid[r][c] = shapeIndex;\n for (int i = 0; i < o.length; i += 2)\n grid[r + o[i]][c + o[i + 1]] = shapeIndex;\n\n return true;\n }\n\n static void removeOrientation(int[] o, int r, int c) {\n grid[r][c] = -1;\n for (int i = 0; i < o.length; i += 2)\n grid[r + o[i]][c + o[i + 1]] = -1;\n }\n\n static boolean solve(int pos, int numPlaced) {\n if (numPlaced == shapes.length)\n return true;\n\n int row = pos / nCols;\n int col = pos % nCols;\n\n if (grid[row][col] != -1)\n return solve(pos + 1, numPlaced);\n\n for (int i = 0; i < shapes.length; i++) {\n if (!placed[i]) {\n for (int[] orientation : shapes[i]) {\n\n if (!tryPlaceOrientation(orientation, row, col, i))\n continue;\n\n placed[i] = true;\n\n if (solve(pos + 1, numPlaced + 1))\n return true;\n\n removeOrientation(orientation, row, col);\n placed[i] = false;\n }\n }\n }\n return false;\n }\n\n static final int[][] F = {{1, -1, 1, 0, 1, 1, 2, 1}, {0, 1, 1, -1, 1, 0, 2, 0},\n {1, 0, 1, 1, 1, 2, 2, 1}, {1, 0, 1, 1, 2, -1, 2, 0}, {1, -2, 1, -1, 1, 0, 2, -1},\n {0, 1, 1, 1, 1, 2, 2, 1}, {1, -1, 1, 0, 1, 1, 2, -1}, {1, -1, 1, 0, 2, 0, 2, 1}};\n\n static final int[][] I = {{0, 1, 0, 2, 0, 3, 0, 4}, {1, 0, 2, 0, 3, 0, 4, 0}};\n\n static final int[][] L = {{1, 0, 1, 1, 1, 2, 1, 3}, {1, 0, 2, 0, 3, -1, 3, 0},\n {0, 1, 0, 2, 0, 3, 1, 3}, {0, 1, 1, 0, 2, 0, 3, 0}, {0, 1, 1, 1, 2, 1, 3, 1},\n {0, 1, 0, 2, 0, 3, 1, 0}, {1, 0, 2, 0, 3, 0, 3, 1}, {1, -3, 1, -2, 1, -1, 1, 0}};\n\n static final int[][] N = {{0, 1, 1, -2, 1, -1, 1, 0}, {1, 0, 1, 1, 2, 1, 3, 1},\n {0, 1, 0, 2, 1, -1, 1, 0}, {1, 0, 2, 0, 2, 1, 3, 1}, {0, 1, 1, 1, 1, 2, 1, 3},\n {1, 0, 2, -1, 2, 0, 3, -1}, {0, 1, 0, 2, 1, 2, 1, 3}, {1, -1, 1, 0, 2, -1, 3, -1}};\n\n static final int[][] P = {{0, 1, 1, 0, 1, 1, 2, 1}, {0, 1, 0, 2, 1, 0, 1, 1},\n {1, 0, 1, 1, 2, 0, 2, 1}, {0, 1, 1, -1, 1, 0, 1, 1}, {0, 1, 1, 0, 1, 1, 1, 2},\n {1, -1, 1, 0, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 1, 1, 2}, {0, 1, 1, 0, 1, 1, 2, 0}};\n\n static final int[][] T = {{0, 1, 0, 2, 1, 1, 2, 1}, {1, -2, 1, -1, 1, 0, 2, 0},\n {1, 0, 2, -1, 2, 0, 2, 1}, {1, 0, 1, 1, 1, 2, 2, 0}};\n\n static final int[][] U = {{0, 1, 0, 2, 1, 0, 1, 2}, {0, 1, 1, 1, 2, 0, 2, 1},\n {0, 2, 1, 0, 1, 1, 1, 2}, {0, 1, 1, 0, 2, 0, 2, 1}};\n\n static final int[][] V = {{1, 0, 2, 0, 2, 1, 2, 2}, {0, 1, 0, 2, 1, 0, 2, 0},\n {1, 0, 2, -2, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 2, 2, 2}};\n\n static final int[][] W = {{1, 0, 1, 1, 2, 1, 2, 2}, {1, -1, 1, 0, 2, -2, 2, -1},\n {0, 1, 1, 1, 1, 2, 2, 2}, {0, 1, 1, -1, 1, 0, 2, -1}};\n\n static final int[][] X = {{1, -1, 1, 0, 1, 1, 2, 0}};\n\n static final int[][] Y = {{1, -2, 1, -1, 1, 0, 1, 1}, {1, -1, 1, 0, 2, 0, 3, 0},\n {0, 1, 0, 2, 0, 3, 1, 1}, {1, 0, 2, 0, 2, 1, 3, 0}, {0, 1, 0, 2, 0, 3, 1, 2},\n {1, 0, 1, 1, 2, 0, 3, 0}, {1, -1, 1, 0, 1, 1, 1, 2}, {1, 0, 2, -1, 2, 0, 3, 0}};\n\n static final int[][] Z = {{0, 1, 1, 0, 2, -1, 2, 0}, {1, 0, 1, 1, 1, 2, 2, 2},\n {0, 1, 1, 1, 2, 1, 2, 2}, {1, -2, 1, -1, 1, 0, 2, -2}};\n\n static final int[][][] shapes = {F, I, L, N, P, T, U, V, W, X, Y, Z};\n}\n","language":"Java"},{"code":"using Random\n\nstruct GridPoint x::Int; y::Int end\n\nconst nrows, ncols, target = 8, 8, 12\nconst grid = fill('*', nrows, ncols)\nconst shapeletters = ['F', 'I', 'L', 'N', 'P', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\nconst shapevec = [\n [(1,-1, 1,0, 1,1, 2,1), (0,1, 1,-1, 1,0, 2,0),\n (1,0 , 1,1, 1,2, 2,1), (1,0, 1,1, 2,-1, 2,0), (1,-2, 1,-1, 1,0, 2,-1),\n (0,1, 1,1, 1,2, 2,1), (1,-1, 1,0, 1,1, 2,-1), (1,-1, 1,0, 2,0, 2,1)],\n [(0,1, 0,2, 0,3, 0,4), (1,0, 2,0, 3,0, 4,0)],\n [(1,0, 1,1, 1,2, 1,3), (1,0, 2,0, 3,-1, 3,0),\n (0,1, 0,2, 0,3, 1,3), (0,1, 1,0, 2,0, 3,0), (0,1, 1,1, 2,1, 3,1),\n (0,1, 0,2, 0,3, 1,0), (1,0, 2,0, 3,0, 3,1), (1,-3, 1,-2, 1,-1, 1,0)],\n [(0,1, 1,-2, 1,-1, 1,0), (1,0, 1,1, 2,1, 3,1),\n (0,1, 0,2, 1,-1, 1,0), (1,0, 2,0, 2,1, 3,1), (0,1, 1,1, 1,2, 1,3),\n (1,0, 2,-1, 2,0, 3,-1), (0,1, 0,2, 1,2, 1,3), (1,-1, 1,0, 2,-1, 3,-1)],\n [(0,1, 1,0, 1,1, 2,1), (0,1, 0,2, 1,0, 1,1),\n (1,0, 1,1, 2,0, 2,1), (0,1, 1,-1, 1,0, 1,1), (0,1, 1,0, 1,1, 1,2),\n (1,-1, 1,0, 2,-1, 2,0), (0,1, 0,2, 1,1, 1,2), (0,1, 1,0, 1,1, 2,0)],\n [(0,1, 0,2, 1,1, 2,1), (1,-2, 1,-1, 1,0, 2,0),\n (1,0, 2,-1, 2,0, 2,1), (1,0, 1,1, 1,2, 2,0)],\n [(0,1, 0,2, 1,0, 1,2), (0,1, 1,1, 2,0, 2,1),\n (0,2, 1,0, 1,1, 1,2), (0,1, 1,0, 2,0, 2,1)],\n [(1,0, 2,0, 2,1, 2,2), (0,1, 0,2, 1,0, 2,0),\n (1,0, 2,-2, 2,-1, 2,0), (0,1, 0,2, 1,2, 2,2)],\n [(1,0, 1,1, 2,1, 2,2), (1,-1, 1,0, 2,-2, 2,-1),\n (0,1, 1,1, 1,2, 2,2), (0,1, 1,-1, 1,0, 2,-1)],\n [(1,-1, 1,0, 1,1, 2,0)],\n [(1,-2, 1,-1, 1,0, 1,1), (1,-1, 1,0, 2,0, 3,0),\n (0,1, 0,2, 0,3, 1,1), (1,0, 2,0, 2,1, 3,0), (0,1, 0,2, 0,3, 1,2),\n (1,0, 1,1, 2,0, 3,0), (1,-1, 1,0, 1,1, 1,2), (1,0, 2,-1, 2,0, 3,0)],\n [(0,1, 1,0, 2,-1, 2,0), (1,0, 1,1, 1,2, 2,2),\n (0,1, 1,1, 2,1, 2,2), (1,-2, 1,-1, 1,0, 2,-2)]]\nconst shapes = Dict{Char,Vector{Vector{GridPoint}}}()\nconst placed = Dict{Char,Bool}()\n\nfor (ltr, vec) in zip(shapeletters, shapevec)\n shapes[ltr] = [[GridPoint(v[i], v[i + 1]) for i in 1:2:7] for v in vec]\n placed[ltr] = false\nend\n\nprintgrid(m, w, h) = for x in 1:w for y in 1:h print(m[x, y], \" \") end; println() end\n\nfunction tryplaceorientation(o, R, C, shapeindex)\n for p in o\n r, c = R + p.x, C + p.y\n if r < 1 || r > nrows || c < 1 || c > ncols || grid[r, c] != '*'\n return false\n end\n end\n grid[R, C] = shapeindex\n for p in o\n grid[R + p.x, C + p.y] = shapeindex\n end\n true\nend\n\nfunction removeorientation(o, r, c)\n grid[r, c] = '*'\n for p in o\n grid[r + p.x, c + p.y] = '*'\n end\nend\n\nfunction solve(pos, nplaced)\n if nplaced == target\n return true\n end\n row, col = divrem(pos, ncols) .+ 1\n if grid[row, col] != '*'\n return solve(pos + 1, nplaced)\n end\n for i in keys((shapes))\n if !placed[i]\n for orientation in shapes[i]\n if tryplaceorientation(orientation, row, col, i)\n placed[i] = true\n if solve(pos + 1, nplaced + 1)\n return true\n else\n removeorientation(orientation, row, col)\n placed[i] = false\n end\n end\n end\n end\n end\n false\nend\n\nfunction placepentominoes()\n for p in zip(shuffle(collect(1:nrows))[1:4], shuffle(collect(1:ncols))[1:4])\n grid[p[1], p[2]] = ' '\n end\n if solve(0, 0)\n printgrid(grid, nrows, ncols)\n else\n println(\"No solution found.\")\n end\nend\n\nplacepentominoes()\n","language":"Julia"},{"code":"// Version 1.1.4-3\n\nimport java.util.Random\n\nval F = arrayOf(\n intArrayOf(1, -1, 1, 0, 1, 1, 2, 1), intArrayOf(0, 1, 1, -1, 1, 0, 2, 0),\n intArrayOf(1, 0, 1, 1, 1, 2, 2, 1), intArrayOf(1, 0, 1, 1, 2, -1, 2, 0),\n intArrayOf(1, -2, 1, -1, 1, 0, 2, -1), intArrayOf(0, 1, 1, 1, 1, 2, 2, 1),\n intArrayOf(1, -1, 1, 0, 1, 1, 2, -1), intArrayOf(1, -1, 1, 0, 2, 0, 2, 1)\n)\n\nval I = arrayOf(\n intArrayOf(0, 1, 0, 2, 0, 3, 0, 4), intArrayOf(1, 0, 2, 0, 3, 0, 4, 0)\n)\n\nval L = arrayOf(\n intArrayOf(1, 0, 1, 1, 1, 2, 1, 3), intArrayOf(1, 0, 2, 0, 3, -1, 3, 0),\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 3), intArrayOf(0, 1, 1, 0, 2, 0, 3, 0),\n intArrayOf(0, 1, 1, 1, 2, 1, 3, 1), intArrayOf(0, 1, 0, 2, 0, 3, 1, 0),\n intArrayOf(1, 0, 2, 0, 3, 0, 3, 1), intArrayOf(1, -3, 1, -2, 1, -1, 1, 0)\n)\n\nval N = arrayOf(\n intArrayOf(0, 1, 1, -2, 1, -1, 1, 0), intArrayOf(1, 0, 1, 1, 2, 1, 3, 1),\n intArrayOf(0, 1, 0, 2, 1, -1, 1, 0), intArrayOf(1, 0, 2, 0, 2, 1, 3, 1),\n intArrayOf(0, 1, 1, 1, 1, 2, 1, 3), intArrayOf(1, 0, 2, -1, 2, 0, 3, -1),\n intArrayOf(0, 1, 0, 2, 1, 2, 1, 3), intArrayOf(1, -1, 1, 0, 2, -1, 3, -1)\n)\n\nval P = arrayOf(\n intArrayOf(0, 1, 1, 0, 1, 1, 2, 1), intArrayOf(0, 1, 0, 2, 1, 0, 1, 1),\n intArrayOf(1, 0, 1, 1, 2, 0, 2, 1), intArrayOf(0, 1, 1, -1, 1, 0, 1, 1),\n intArrayOf(0, 1, 1, 0, 1, 1, 1, 2), intArrayOf(1, -1, 1, 0, 2, -1, 2, 0),\n intArrayOf(0, 1, 0, 2, 1, 1, 1, 2), intArrayOf(0, 1, 1, 0, 1, 1, 2, 0)\n)\n\nval T = arrayOf(\n intArrayOf(0, 1, 0, 2, 1, 1, 2, 1), intArrayOf(1, -2, 1, -1, 1, 0, 2, 0),\n intArrayOf(1, 0, 2, -1, 2, 0, 2, 1), intArrayOf(1, 0, 1, 1, 1, 2, 2, 0)\n)\n\nval U = arrayOf(\n intArrayOf(0, 1, 0, 2, 1, 0, 1, 2), intArrayOf(0, 1, 1, 1, 2, 0, 2, 1),\n intArrayOf(0, 2, 1, 0, 1, 1, 1, 2), intArrayOf(0, 1, 1, 0, 2, 0, 2, 1)\n)\n\nval V = arrayOf(\n intArrayOf(1, 0, 2, 0, 2, 1, 2, 2), intArrayOf(0, 1, 0, 2, 1, 0, 2, 0),\n intArrayOf(1, 0, 2, -2, 2, -1, 2, 0), intArrayOf(0, 1, 0, 2, 1, 2, 2, 2)\n)\n\nval W = arrayOf(\n intArrayOf(1, 0, 1, 1, 2, 1, 2, 2), intArrayOf(1, -1, 1, 0, 2, -2, 2, -1),\n intArrayOf(0, 1, 1, 1, 1, 2, 2, 2), intArrayOf(0, 1, 1, -1, 1, 0, 2, -1)\n)\n\nval X = arrayOf(intArrayOf(1, -1, 1, 0, 1, 1, 2, 0))\n\nval Y = arrayOf(\n intArrayOf(1, -2, 1, -1, 1, 0, 1, 1), intArrayOf(1, -1, 1, 0, 2, 0, 3, 0),\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 1), intArrayOf(1, 0, 2, 0, 2, 1, 3, 0),\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 2), intArrayOf(1, 0, 1, 1, 2, 0, 3, 0),\n intArrayOf(1, -1, 1, 0, 1, 1, 1, 2), intArrayOf(1, 0, 2, -1, 2, 0, 3, 0)\n)\n\nval Z = arrayOf(\n intArrayOf(0, 1, 1, 0, 2, -1, 2, 0), intArrayOf(1, 0, 1, 1, 1, 2, 2, 2),\n intArrayOf(0, 1, 1, 1, 2, 1, 2, 2), intArrayOf(1, -2, 1, -1, 1, 0, 2, -2)\n)\n\nval shapes = arrayOf(F, I, L, N, P, T, U, V, W, X, Y, Z)\nval rand = Random()\n\nval symbols = \"FILNPTUVWXYZ-\".toCharArray()\n\nval nRows = 8\nval nCols = 8\nval blank = 12\n\nval grid = Array(nRows) { IntArray(nCols) }\nval placed = BooleanArray(symbols.size - 1)\n\nfun tryPlaceOrientation(o: IntArray, r: Int, c: Int, shapeIndex: Int): Boolean {\n for (i in 0 until o.size step 2) {\n val x = c + o[i + 1]\n val y = r + o[i]\n if (x !in (0 until nCols) || y !in (0 until nRows) || grid[y][x] != - 1) return false\n }\n grid[r][c] = shapeIndex\n for (i in 0 until o.size step 2) grid[r + o[i]][c + o[i + 1]] = shapeIndex\n return true\n}\n\nfun removeOrientation(o: IntArray, r: Int, c: Int) {\n grid[r][c] = -1\n for (i in 0 until o.size step 2) grid[r + o[i]][c + o[i + 1]] = -1\n}\n\nfun solve(pos: Int, numPlaced: Int): Boolean {\n if (numPlaced == shapes.size) return true\n val row = pos / nCols\n val col = pos % nCols\n if (grid[row][col] != -1) return solve(pos + 1, numPlaced)\n\n for (i in 0 until shapes.size) {\n if (!placed[i]) {\n for (orientation in shapes[i]) {\n if (!tryPlaceOrientation(orientation, row, col, i)) continue\n placed[i] = true\n if (solve(pos + 1, numPlaced + 1)) return true\n removeOrientation(orientation, row, col)\n placed[i] = false\n }\n }\n }\n return false\n}\n\nfun shuffleShapes() {\n var n = shapes.size\n while (n > 1) {\n val r = rand.nextInt(n--)\n val tmp = shapes[r]\n shapes[r] = shapes[n]\n shapes[n] = tmp\n val tmpSymbol= symbols[r]\n symbols[r] = symbols[n]\n symbols[n] = tmpSymbol\n }\n}\n\nfun printResult() {\n for (r in grid) {\n for (i in r) print(\"${symbols[i]} \")\n println()\n }\n}\n\nfun main(args: Array<String>) {\n shuffleShapes()\n for (r in 0 until nRows) grid[r].fill(-1)\n for (i in 0..3) {\n var randRow: Int\n var randCol: Int\n do {\n randRow = rand.nextInt(nRows)\n randCol = rand.nextInt(nCols)\n }\n while (grid[randRow][randCol] == blank)\n grid[randRow][randCol] = blank\n }\n if (solve(0, 0)) printResult()\n else println(\"No solution\")\n}\n","language":"Kotlin"},{"code":"import random, sequtils, strutils\n\nconst\n\n F = @[[1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]]\n\n I = @[[0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]]\n\n L = @[[1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]]\n\n N = @[[0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]]\n\n P = @[[0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]]\n\n T = @[[0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]]\n\n\n U = @[[0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]]\n\n V = @[[1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]]\n\n W = @[[1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]]\n\n X = @[[1, -1, 1, 0, 1, 1, 2, 0]]\n\n Y = @[[1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]]\n\n Z = @[[0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]]\n\n Shapes = [F, I, L, N, P, T, U, V, W, X, Y, Z]\n Symbols = @\"FILNPTUVWXYZ-\"\n\n NRows = 8\n NCols = 8\n Blank = Shapes.len\n\n\ntype Tiling = object\n shapes: array[Shapes.len, seq[array[8, int]]] # Shuffled shapes.\n symbols: array[Symbols.len, char] # Associated symbols.\n grid: array[NRows, array[NCols, int]]\n placed: array[Shapes.len, bool]\n\n\nproc initTiling(): Tiling =\n\n # Build list of shapes and symbols.\n var indexes = toSeq(0..11)\n indexes.shuffle()\n for i, index in indexes:\n result.shapes[i] = Shapes[index]\n result.symbols[i] = Symbols[index]\n result.symbols[^1] = Symbols[^1]\n\n # Fill grid.\n for r in result.grid.mitems:\n for c in r.mitems:\n c = -1\n for i in 0..3:\n while true:\n let randRow = rand(NRows - 1)\n let randCol = rand(NCols - 1)\n if result.grid[randRow][randCol] != Blank:\n result.grid[randRow][randCol] = Blank\n break\n\n\nfunc tryPlaceOrientation(t: var Tiling; o: openArray[int]; r, c, shapeIndex: int): bool =\n for i in countup(0, o.len - 2, 2):\n let x = c + o[i + 1]\n let y = r + o[i]\n if x notin 0..<NCols or y notin 0..<NRows or t.grid[y][x] != - 1: return false\n t.grid[r][c] = shapeIndex\n for i in countup(0, o.len - 2, 2): t.grid[r + o[i]][c + o[i + 1]] = shapeIndex\n result = true\n\n\nfunc removeOrientation(t: var Tiling; o: openArray[int]; r, c: int) =\n t.grid[r][c] = -1\n for i in countup(0, o.len - 2, 2): t.grid[r + o[i]][c + o[i + 1]] = -1\n\n\nfunc solve(t: var Tiling; pos, numPlaced: int): bool =\n if numPlaced == t.shapes.len: return true\n let row = pos div NCols\n let col = pos mod NCols\n if t.grid[row][col] != -1: return t.solve(pos + 1, numPlaced)\n\n for i in 0..<t.shapes.len:\n if not t.placed[i]:\n for orientation in t.shapes[i]:\n if not t.tryPlaceOrientation(orientation, row, col, i): continue\n t.placed[i] = true\n if t.solve(pos + 1, numPlaced + 1): return true\n t.removeOrientation(orientation, row, col)\n t.placed[i] = false\n\n\nproc printResult(t: Tiling) =\n for r in t.grid:\n echo r.mapIt(t.symbols[it]).join(\" \")\n\n\nwhen isMainModule:\n randomize()\n var tiling = initTiling()\n if tiling.solve(0, 0): tiling.printResult\n else: echo \"No solution\"\n","language":"Nim"},{"code":"use strict;\nuse warnings;\nuse feature 'bitwise';\n\nmy $size = shift // 8;\n\nsub rotate\n {\n local $_ = shift;\n my $ans = '';\n $ans .= \"\\n\" while s/.$/$ans .= $&; ''/gem;\n $ans;\n }\n\nsub topattern\n {\n local $_ = shift;\n s/.+/ $& . ' ' x ($size - length $&)/ge;\n s/^\\s+|\\s+\\z//g;\n [ tr/ \\nA-Z/.. /r, lc tr/ \\n/\\0/r, substr $_, 0, 1 ]; # pattern, xor-update\n }\n\nmy %all;\n@all{ \" FF\\nFF \\n F \\n\", \"IIIII\\n\", \"LLLL\\nL \\n\", \"NNN \\n NN\\n\",\n \"PPP\\nPP \\n\", \"TTT\\n T \\n T \\n\", \"UUU\\nU U\\n\", \"VVV\\nV \\nV \\n\",\n \"WW \\n WW\\n W\\n\", \" X \\nXXX\\n X \\n\", \"YYYY\\n Y \\n\", \"ZZ \\n Z \\n ZZ\\n\",\n } = ();\n@all{map rotate($_), keys %all} = () for 1 .. 3; # all four rotations\n@all{map s/.+/reverse $&/ger, keys %all} = (); # mirror\nmy @all = map topattern($_), keys %all;\nmy $grid = ( ' ' x $size . \"\\n\" ) x $size;\nmy %used;\nfind( $grid );\n\n# looks for the first open space\nsub find\n {\n my $grid = shift;\n %used >= 12 and exit not print $grid;\n for ( grep ! $used{ $_->[2] }, @all )\n {\n my ($pattern, $pentomino, $letter) = @$_;\n local $used{$letter} = 1;\n $grid =~ /^[^ ]*\\K$pattern/s and find( $grid ^. \"\\0\" x $-[0] . $pentomino );\n }\n }\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">pentominoes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"\"\"\n ......I................................................................\n ......I.....L......N.........................................Y.........\n .FF...I.....L.....NN....PP....TTT...........V.....W....X....YY.....ZZ..\n FF....I.....L.....N.....PP.....T....U.U.....V....WW...XXX....Y.....Z...\n .F....I.....LL....N.....P......T....UUU...VVV...WW.....X.....Y....ZZ...\"\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- </span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">get_shapes</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">offset</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pentominoes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- scan left/right, and up/down, both ways, to give 8 orientations\n -- (computes the equivalent of those hard-coded tables in\n -- other examples, albeit in a slightly different order.)\n --</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">shapes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">letter</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">orientation</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">7</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">shape</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{}</span>\n <span style=\"color: #004080;\">bool</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">fr</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">fc</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">5</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">rr</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">orientation</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#01</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">cc</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008080;\">iff</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">orientation</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#02</span><span style=\"color: #0000FF;\">)?</span><span style=\"color: #000000;\">6</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">:</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">and_bits</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">orientation</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">#04</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">rr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">cc</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">cc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">rr</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">pentominoes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">rr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">offset</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">cc</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">!=</span><span style=\"color: #008000;\">'.'</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">found</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">found</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">fc</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">letter</span><span style=\"color: #0000FF;\">}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #004600;\">true</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #000000;\">shape</span> <span style=\"color: #0000FF;\">&=</span> <span style=\"color: #0000FF;\">{</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">fr</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">fc</span><span style=\"color: #0000FF;\">}</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #7060A8;\">find</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shape</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">shapes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">shape</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">res</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">append</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">res</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">letter</span><span style=\"color: #0000FF;\">&</span><span style=\"color: #008000;\">\"\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">res</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">shapes</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">get_shapes</span><span style=\"color: #0000FF;\">(),</span>\n <span style=\"color: #000000;\">nRows</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">nCols</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">8</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">grid</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">nCols</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">nRows</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">placed</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004600;\">false</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">))</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">re_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #008000;\">' '</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">ch</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">can_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">],</span>\n <span style=\"color: #000000;\">y</span> <span style=\"color: #0000FF;\">:=</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">+</span> <span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">nCols</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">nRows</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #000000;\">re_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">solve</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numPlaced</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">numPlaced</span> <span style=\"color: #0000FF;\">==</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">row</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">floor</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">col</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)+</span><span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">col</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #000000;\">solve</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numPlaced</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">placed</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">o</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">can_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">col</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">placed</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">solve</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">pos</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">numPlaced</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #000000;\">re_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">row</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">col</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">placed</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">unsolveable</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000080;font-style:italic;\">--\n -- The only unsolvable grids seen have\n -- -.- or -..- or -... at edge/corner,\n -- - -- --- -\n -- or somewhere in the middle a -.-\n -- -\n --\n -- Simply place all shapes at all positions/orientations,\n -- all the while checking for any untouchable cells.\n --</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">griddled</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">deep_copy</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">8</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">8</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">ch</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">])</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">o</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">shapes</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">can_place</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">ch</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span>\n <span style=\"color: #000000;\">griddled</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'-'</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">' '</span>\n <span style=\"color: #000000;\">griddled</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">]][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">o</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">k</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">]]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'-'</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">griddled</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]!=</span><span style=\"color: #008000;\">'-'</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">add_four_randomly</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">while</span> <span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">r</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">),</span>\n <span style=\"color: #000000;\">c</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">rand</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">8</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">r</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">c</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'-'</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">1</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">while</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #000000;\">add_four_randomly</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">unsolveable</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"No solution\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">else</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #008080;\">not</span> <span style=\"color: #000000;\">solve</span><span style=\"color: #0000FF;\">()</span> <span style=\"color: #008080;\">then</span> <span style=\"color: #0000FF;\">?</span><span style=\"color: #000000;\">9</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n <span style=\"color: #000000;\">main</span><span style=\"color: #0000FF;\">()</span>\n<!--\n","language":"Phix"},{"code":"import sat, util.\nrotate(Q) = Res => % rotate right by 90 degrees\n NZ = len(Q[1]), NS = len(Q), Res = new_array(NZ,NS),\n foreach(Z in 1..NZ, S in 1..NS) Res[Z,S] = Q[S,NZ+1-Z] end.\n\nmatprint(Q) =>\n NZ = len(Q), NS = len(Q[1]),\n foreach(Z in 1..NZ, S in 1..NS)\n printf(\"%d|\", Q[Z,S]),\n if S=NS then nl end\n end, nl.\n\ngenerate(Res) =>\n P0 = [{{1,1,1,1}, % L\n {1,0,0,0}},\n {{0,1,1,1}, % N\n {1,1,0,0}},\n {{1,1,1,1}, % Y\n {0,1,0,0}},\n {{1,1,0}, % F\n {0,1,1},\n {0,1,0}},\n {{1,1,1}, % T\n {0,1,0},\n {0,1,0}},\n {{0,0,1}, % W\n {0,1,1},\n {1,1,0}},\n {{1,1,1}, % P\n {1,1,0}},\n {{0,0,1}, % V\n {0,0,1},\n {1,1,1}},\n {{1,0,1}, % U\n {1,1,1}},\n {{1,0,0}, % Z\n {1,1,1},\n {0,0,1}},\n {{1,1,1,1,1}}, % I\n {{0,1,0}, % X\n {1,1,1},\n {0,1,0}}],\n Np = len(P0), P = [],\n foreach(I in 1..Np)\n VarI = [P0[I]],\n foreach(_ in 1..3) VarI := [rotate(head(VarI))|VarI] end,\n P := [VarI|P]\n end,\n Res = P.\n\nmain =>\n N = 8, M = new_array(N+4,N+4),\n foreach(R in N+1..N+4, C in 1..N) M[R,C] #= 0 end,\n foreach(R in 1..N, C in N+1..N+4) M[R,C] #= 0 end,\n generate(P), % P[1] = X-Pentomino, then P[2] = I, P[3] = Z, and so on U, V, P, X, W, T, F, Y, N, L\n Np = len(P), M :: 0..Np,\n foreach(I in 1..Np) count(I, vars(M), 5) end, % 12 pentomino\n Idx = new_list(Np), % X has 1 rotation variant, I and Z each 2, the rest 4:\n Idx[1] #= 1, [Idx[2],Idx[3]] :: 1..2, Idx :: 1..4,\n DZ = new_list(Np), DZ :: 0..N-1, % translation of I.th pentomino\n DS = new_list(Np), DS :: 0..N-1,\n foreach(I in 1..Np, J in 1..4) % Constraint only if Idx[I] #= J!\n NZ = len(P[I,J]), NS = len(P[I,J,1]),\n foreach(DZI in 0..N-1, DSI in 0..N-1, Z in 1..NZ, S in 1..NS, P[I,J,Z,S]=1)\n (Idx[I] #= J #/\\ DZ[I] #= DZI #/\\ DS[I] #= DSI) #=> M[DZI+Z,DSI+S] #= I\n end\n end,\n solve(vars(M) ++ DZ ++ DS ++ Idx),\n Chr = \" XIZUVPWTFYNL\",\n foreach(Z in 1..N)\n foreach(S in 1..N)\n\t\t printf(\"%c|\", Chr[1 + M[Z,S]])\n \tend, nl\n end.\n","language":"Picat"},{"code":"from itertools import product\n\nminos = (((197123, 7, 6), (1797, 6, 7), (1287, 6, 7), (196867, 7, 6)),\n ((263937, 6, 6), (197126, 6, 6), (393731, 6, 6), (67332, 6, 6)),\n ((16843011, 7, 5), (2063, 5, 7), (3841, 5, 7), (271, 5, 7), (3848, 5, 7), (50463234, 7, 5), (50397441, 7, 5), (33686019, 7, 5)),\n ((131843, 7, 6), (1798, 6, 7), (775, 6, 7), (1795, 6, 7), (1543, 6, 7), (197377, 7, 6), (197378, 7, 6), (66307, 7, 6)),\n ((132865, 6, 6), (131846, 6, 6), (198146, 6, 6), (132611, 6, 6), (393986, 6, 6), (263938, 6, 6), (67330, 6, 6), (132868, 6, 6)),\n ((1039, 5, 7), (33751554, 7, 5), (16843521, 7, 5), (16974081, 7, 5), (33686274, 7, 5), (3842, 5, 7), (3844, 5, 7), (527, 5, 7)),\n ((1804, 5, 7), (33751297, 7, 5), (33686273, 7, 5), (16974338, 7, 5), (16843522, 7, 5), (782, 5, 7), (3079, 5, 7), (3587, 5, 7)),\n ((263683, 6, 6), (198148, 6, 6), (66310, 6, 6), (393985, 6, 6)),\n ((67329, 6, 6), (131591, 6, 6), (459266, 6, 6), (263940, 6, 6)),\n ((459780, 6, 6), (459009, 6, 6), (263175, 6, 6), (65799, 6, 6)),\n ((4311810305, 8, 4), (31, 4, 8)),\n ((132866, 6, 6),))\n\nboxchar_double_width = ' ╶╺╵└┕╹┖┗╴─╼┘┴┶┚┸┺╸╾━┙┵┷┛┹┻╷┌┍│├┝╿┞┡┐┬┮┤┼┾┦╀╄┑┭┯┥┽┿┩╃╇╻┎┏╽┟┢┃┠┣┒┰┲┧╁╆┨╂╊┓┱┳┪╅╈┫╉╋'\nboxchar_single_width = [c + ' ─━'[i%3] for i, c in enumerate(boxchar_double_width)]\n\n# choose drawing alphabet based on terminal font\npatterns = boxchar_single_width\n\ntiles = []\nfor row in reversed(minos):\n tiles.append([])\n for n, x, y in row:\n for shift in (b*8 + a for a, b in product(range(x), range(y))):\n tiles[-1].append(n << shift)\n\ndef img(seq):\n b = [[0]*10 for _ in range(10)]\n\n for i, s in enumerate(seq):\n for j, k in product(range(8), range(8)):\n if s & (1<<(j*8 + k)):\n b[j + 1][k + 1] = i + 1\n\n idices = [[0]*9 for _ in range(9)]\n for i, j in product(range(9), range(9)):\n n = (b[i+1][j+1], b[i][j+1], b[i][j], b[i+1][j], b[i+1][j+1])\n idices[i][j] = sum((a != b)*(1 + (not a or not b))*3**i for i, (a,b) in enumerate(zip(n, n[1:])))\n\n return '\\n'.join(''.join(patterns[i] for i in row) for row in idices)\n\ndef tile(board=0, seq=tuple(), tiles=tiles):\n if not tiles:\n yield img(seq)\n return\n\n for c in tiles[0]:\n b = board | c\n\n tnext = [] # not using list comprehension ...\n for t in tiles[1:]:\n tnext.append(tuple(n for n in t if not n&b))\n if not tnext[-1]: break # because early break is faster\n else:\n yield from tile(b, seq + (c,), tnext)\n\nfor x in tile():\n print(x)\n","language":"Python"},{"code":"#lang racket\n\n(require racket/hash)\n\n(module+ main (Pentomino-tiling))\n\n(define n-rows 8)\n(define n-cols 8)\n(define blank '-)\n\n(define (build-grid)\n (for/fold ((grid (for*/hash ((r n-rows) (c n-cols)) (values (cons r c) #f)))) ((_ 4))\n (hash-set grid (cons (random n-rows) (random n-cols)) blank)))\n\n(define (make-shapes-map)\n (hash 'F (F) 'I (I) 'L (L) 'N (N) 'P (P) 'T (T) 'U (U) 'V (V) 'W (W) 'X (X) 'Y (Y) 'Z (Z)))\n\n(define (print-grid grid)\n (for ((r n-rows) #:when (when (positive? r) (newline)) (c n-cols))\n (write (hash-ref grid (cons r c))))\n (newline))\n\n(define (Pentomino-tiling (grid (build-grid)))\n (define solution (solve 0 grid (make-shapes-map)))\n (if solution (print-grid solution) (displayln \"no solution\")))\n\n(define (solve p grid shapes (failed-shapes (hash)))\n (define-values (r c) (quotient/remainder p n-cols))\n (cond [(not grid) #f]\n [(hash-empty? shapes) (and (hash-empty? failed-shapes) grid)]\n [(hash-ref grid (cons r c) #f) (solve (add1 p) grid shapes failed-shapes)]\n [else\n (define s (car (hash-keys shapes)))\n (define os (hash-ref shapes s))\n (define shapes-s (hash-remove shapes s))\n (define (try-place-orientation o)\n (and (for/and ((dy.dx o))\n (let ((y (+ r (car dy.dx))) (x (+ c (cdr dy.dx))))\n (and (>= x 0) (>= y 0) (< x n-cols) (< y n-rows) (not (hash-ref grid (cons y x))))))\n (for/fold ((grid (hash-set grid (cons r c) s))) ((dy.dx o))\n (hash-set grid (cons (+ r (car dy.dx)) (+ c (cdr dy.dx))) s))))\n (or (for*/first\n ((o os)\n (solution (in-value (solve (add1 p)\n (try-place-orientation o)\n (hash-union shapes-s failed-shapes))))\n #:when solution)\n solution)\n (solve p grid shapes-s (hash-set failed-shapes s os)))]))\n\n(define (F) '(((1 . -1) (1 . 0) (1 . 1) (2 . 1))\n ((0 . 1) (1 . -1) (1 . 0) (2 . 0))\n ((1 . 0) (1 . 1) (1 . 2) (2 . 1))\n ((1 . 0) (1 . 1) (2 . -1) (2 . 0))\n ((1 . -2) (1 . -1) (1 . 0) (2 . -1))\n ((0 . 1) (1 . 1) (1 . 2) (2 . 1))\n ((1 . -1) (1 . 0) (1 . 1) (2 . -1))\n ((1 . -1) (1 . 0) (2 . 0) (2 . 1))))\n\n(define (I) '(((0 . 1) (0 . 2) (0 . 3) (0 . 4))\n ((1 . 0) (2 . 0) (3 . 0) (4 . 0))))\n\n(define (L) '(((1 . 0) (1 . 1) (1 . 2) (1 . 3))\n ((1 . 0) (2 . 0) (3 . -1) (3 . 0))\n ((0 . 1) (0 . 2) (0 . 3) (1 . 3))\n ((0 . 1) (1 . 0) (2 . 0) (3 . 0))\n ((0 . 1) (1 . 1) (2 . 1) (3 . 1))\n ((0 . 1) (0 . 2) (0 . 3) (1 . 0))\n ((1 . 0) (2 . 0) (3 . 0) (3 . 1))\n ((1 . -3) (1 . -2) (1 . -1) (1 . 0))))\n\n(define (N) '(((0 . 1) (1 . -2) (1 . -1) (1 . 0))\n ((1 . 0) (1 . 1) (2 . 1) (3 . 1))\n ((0 . 1) (0 . 2) (1 . -1) (1 . 0))\n ((1 . 0) (2 . 0) (2 . 1) (3 . 1))\n ((0 . 1) (1 . 1) (1 . 2) (1 . 3))\n ((1 . 0) (2 . -1) (2 . 0) (3 . -1))\n ((0 . 1) (0 . 2) (1 . 2) (1 . 3))\n ((1 . -1) (1 . 0) (2 . -1) (3 . -1))))\n\n(define (P) '(((0 . 1) (1 . 0) (1 . 1) (2 . 1))\n ((0 . 1) (0 . 2) (1 . 0) (1 . 1))\n ((1 . 0) (1 . 1) (2 . 0) (2 . 1))\n ((0 . 1) (1 . -1) (1 . 0) (1 . 1))\n ((0 . 1) (1 . 0) (1 . 1) (1 . 2))\n ((1 . -1) (1 . 0) (2 . -1) (2 . 0))\n ((0 . 1) (0 . 2) (1 . 1) (1 . 2))\n ((0 . 1) (1 . 0) (1 . 1) (2 . 0))))\n\n(define (T) '(((0 . 1) (0 . 2) (1 . 1) (2 . 1))\n ((1 . -2) (1 . -1) (1 . 0) (2 . 0))\n ((1 . 0) (2 . -1) (2 . 0) (2 . 1))\n ((1 . 0) (1 . 1) (1 . 2) (2 . 0))))\n\n(define (U) '(((0 . 1) (0 . 2) (1 . 0) (1 . 2))\n ((0 . 1) (1 . 1) (2 . 0) (2 . 1))\n ((0 . 2) (1 . 0) (1 . 1) (1 . 2))\n ((0 . 1) (1 . 0) (2 . 0) (2 . 1))))\n\n(define (V) '(((1 . 0) (2 . 0) (2 . 1) (2 . 2))\n ((0 . 1) (0 . 2) (1 . 0) (2 . 0))\n ((1 . 0) (2 . -2) (2 . -1) (2 . 0))\n ((0 . 1) (0 . 2) (1 . 2) (2 . 2))))\n\n(define (W) '(((1 . 0) (1 . 1) (2 . 1) (2 . 2))\n ((1 . -1) (1 . 0) (2 . -2) (2 . -1))\n ((0 . 1) (1 . 1) (1 . 2) (2 . 2))\n ((0 . 1) (1 . -1) (1 . 0) (2 . -1))))\n\n(define (X) '(((1 . -1) (1 . 0) (1 . 1) (2 . 0))))\n\n(define (Y) '(((1 . -2) (1 . -1) (1 . 0) (1 . 1))\n ((1 . -1) (1 . 0) (2 . 0) (3 . 0))\n ((0 . 1) (0 . 2) (0 . 3) (1 . 1))\n ((1 . 0) (2 . 0) (2 . 1) (3 . 0))\n ((0 . 1) (0 . 2) (0 . 3) (1 . 2))\n ((1 . 0) (1 . 1) (2 . 0) (3 . 0))\n ((1 . -1) (1 . 0) (1 . 1) (1 . 2))\n ((1 . 0) (2 . -1) (2 . 0) (3 . 0))))\n\n(define (Z) '(((0 . 1) (1 . 0) (2 . -1) (2 . 0))\n ((1 . 0) (1 . 1) (1 . 2) (2 . 2))\n ((0 . 1) (1 . 1) (2 . 1) (2 . 2))\n ((1 . -2) (1 . -1) (1 . 0) (2 . -2))))\n","language":"Racket"},{"code":"# 20201028 Raku programming solution\n\nmy \\F = [ <1 -1 1 0 1 1 2 1>, <0 1 1 -1 1 0 2 0>, <1 0 1 1 1 2 2 1>,\n <1 0 1 1 2 -1 2 0>, <1 -2 1 -1 1 0 2 -1>, <0 1 1 1 1 2 2 1>,\n <1 -1 1 0 1 1 2 -1>, <1 -1 1 0 2 0 2 1> ];\n\nmy \\I = [ <0 1 0 2 0 3 0 4>, <1 0 2 0 3 0 4 0> ];\n\nmy \\L = [ <1 0 1 1 1 2 1 3>, <1 0 2 0 3 0 3 1>, <0 1 0 2 0 3 1 3>,\n <0 1 1 0 2 0 3 0>, <0 1 1 1 2 1 3 1>, <0 1 0 2 0 3 1 0>,\n <1 0 2 0 3 -1 3 0>, <1 -3 1 -2 1 -1 1 0> ];\n\nmy \\N = [ <0 1 1 -2 1 -1 1 0>, <1 0 1 1 2 1 3 1>, <0 1 0 2 1 -1 1 0>,\n <1 0 2 0 2 1 3 1>, <0 1 1 1 1 2 1 3>, <1 0 2 -1 2 0 3 -1>,\n <0 1 0 2 1 2 1 3>, <1 -1 1 0 2 -1 3 -1> ];\n\nmy \\P = [ <0 1 1 0 1 1 2 1>, <0 1 0 2 1 0 1 1>, <1 0 1 1 2 0 2 1>,\n <0 1 1 -1 1 0 1 1>, <0 1 1 0 1 1 1 2>, <1 -1 1 0 2 -1 2 0>,\n <0 1 0 2 1 1 1 2>, <0 1 1 0 1 1 2 0> ];\n\nmy \\T = [ <0 1 0 2 1 1 2 1>, <1 -2 1 -1 1 0 2 0>,\n <1 0 2 -1 2 0 2 1>, <1 0 1 1 1 2 2 0> ];\n\nmy \\U = [ <0 1 0 2 1 0 1 2>, <0 1 1 1 2 0 2 1>,\n <0 2 1 0 1 1 1 2>, <0 1 1 0 2 0 2 1> ];\n\nmy \\V = [ <1 0 2 0 2 1 2 2>, <0 1 0 2 1 0 2 0>,\n <1 0 2 -2 2 -1 2 0>, <0 1 0 2 1 2 2 2> ];\n\nmy \\W = [ <1 0 1 1 2 1 2 2>, <1 -1 1 0 2 -2 2 -1>,\n <0 1 1 1 1 2 2 2>, <0 1 1 -1 1 0 2 -1> ];\n\nmy \\X = [ <1 -1 1 0 1 1 2 0> , ]; # self-ref: reddit.com/r/rakulang/comments/jpys5p/gbi71jt/\n\nmy \\Y = [ <1 -2 1 -1 1 0 1 1>, <1 -1 1 0 2 0 3 0>, <0 1 0 2 0 3 1 1>,\n <1 0 2 0 2 1 3 0>, <0 1 0 2 0 3 1 2>, <1 0 1 1 2 0 3 0>,\n <1 -1 1 0 1 1 1 2>, <1 0 2 -1 2 0 3 0> ];\n\nmy \\Z = [ <0 1 1 0 2 -1 2 0>, <1 0 1 1 1 2 2 2>,\n <0 1 1 1 2 1 2 2>, <1 -2 1 -1 1 0 2 -2> ];\n\nour @shapes = F, I, L, N, P, T, U, V, W, X, Y, Z ;\n\nmy @symbols = \"FILNPTUVWXYZ-\".comb;\nmy %symbols = @symbols.pairs;\nmy $nRows = my $nCols = 8; my $blank = 12;\nmy @grid = [ [-1 xx $nCols ] xx $nRows ];\nmy @placed;\n\nsub shuffleShapes {\n my @rand = (0 ..^+@shapes).pick(*);\n for (0 ..^+@shapes) -> \\i {\n (@shapes[i], @shapes[@rand[i]]) = (@shapes[@rand[i]], @shapes[i]);\n (@symbols[i], @symbols[@rand[i]]) = (@symbols[@rand[i]], @symbols[i])\n }\n}\n\nsub solve($pos,$numPlaced) {\n return True if $numPlaced == +@shapes;\n\n my \\row = $pos div $nCols;\n my \\col = $pos mod $nCols;\n\n return solve($pos + 1, $numPlaced) if @grid[row;col] != -1;\n\n for ^+@shapes -> \\i {\n if !@placed[i] {\n for @shapes[i] -> @orientation {\n for @orientation -> @o {\n next if !tryPlaceOrientation(@o, row, col, i);\n @placed[i] = True;\n return True if solve($pos + 1, $numPlaced + 1);\n removeOrientation(@o, row, col);\n @placed[i] = False;\n }\n }\n }\n }\n return False\n}\n\nsub tryPlaceOrientation (@o, $r, $c, $shapeIndex) {\n\n loop (my $i = 0; $i < +@o; $i += 2) {\n my \\x = $c + @o[$i + 1];\n my \\y = $r + @o[$i];\n return False if\n (x < 0 or x ≥ $nCols or y < 0 or y ≥ $nRows or @grid[y;x] != -1)\n }\n\n @grid[$r;$c] = $shapeIndex;\n loop ($i = 0; $i < +@o; $i += 2) {\n @grid[ $r + @o[$i] ; $c + @o[$i + 1] ] = $shapeIndex;\n }\n return True\n}\n\nsub removeOrientation(@o, $r, $c) {\n @grid[$r;$c] = -1;\n loop (my $i = 0; $i < +@o; $i += 2) {\n @grid[ $r + @o[$i] ; $c + @o[$i + 1] ] = -1;\n }\n}\n\nsub PrintResult {\n my $output;\n for @grid[*] -> @line {\n $output ~= \"%symbols{$_} \" for @line;\n $output ~= \"\\n\"\n }\n if my \\Embedded_Marketing_Mode = True {\n $output .= subst('-', $_.chr) for < 0x24c7 0x24b6 0x24c0 0x24ca >\n }\n say $output\n}\n\n#shuffleShapes(); # xkcd.com/221\n\nfor ^4 {\n loop {\n if @grid[my \\R = (^$nRows).roll;my \\C = (^$nCols).roll] != $blank\n { @grid[R;C] = $blank and last }\n }\n}\n\nPrintResult() if solve 0,0\n","language":"Raku"},{"code":"Module Module1\n\n Dim symbols As Char() = \"XYPFTVNLUZWI█\".ToCharArray(),\n nRows As Integer = 8, nCols As Integer = 8,\n target As Integer = 12, blank As Integer = 12,\n grid As Integer()() = New Integer(nRows - 1)() {},\n placed As Boolean() = New Boolean(target - 1) {},\n pens As List(Of List(Of Integer())), rand As Random,\n seeds As Integer() = {291, 292, 293, 295, 297, 329, 330, 332, 333, 335, 378, 586}\n\n Sub Main()\n Unpack(seeds) : rand = New Random() : ShuffleShapes(2)\n For r As Integer = 0 To nRows - 1\n grid(r) = Enumerable.Repeat(-1, nCols).ToArray() : Next\n For i As Integer = 0 To 3\n Dim rRow, rCol As Integer : Do : rRow = rand.Next(nRows) : rCol = rand.Next(nCols)\n Loop While grid(rRow)(rCol) = blank : grid(rRow)(rCol) = blank\n Next\n If Solve(0, 0) Then\n PrintResult()\n Else\n Console.WriteLine(\"no solution for this configuration:\") : PrintResult()\n End If\n If System.Diagnostics.Debugger.IsAttached Then Console.ReadKey()\n End Sub\n\n Sub ShuffleShapes(count As Integer) ' changes order of the pieces for a more random solution\n For i As Integer = 0 To count : For j = 0 To pens.Count - 1\n Dim r As Integer : Do : r = rand.Next(pens.Count) : Loop Until r <> j\n Dim tmp As List(Of Integer()) = pens(r) : pens(r) = pens(j) : pens(j) = tmp\n Dim ch As Char = symbols(r) : symbols(r) = symbols(j) : symbols(j) = ch\n Next : Next\n End Sub\n\n Sub PrintResult() ' display results\n For Each r As Integer() In grid : For Each i As Integer In r\n Console.Write(\"{0} \", If(i < 0, \".\", symbols(i)))\n Next : Console.WriteLine() : Next\n End Sub\n\n ' returns first found solution only\n Function Solve(ByVal pos As Integer, ByVal numPlaced As Integer) As Boolean\n If numPlaced = target Then Return True\n Dim row As Integer = pos \\ nCols, col As Integer = pos Mod nCols\n If grid(row)(col) <> -1 Then Return Solve(pos + 1, numPlaced)\n For i As Integer = 0 To pens.Count - 1 : If Not placed(i) Then\n For Each orientation As Integer() In pens(i)\n If Not TPO(orientation, row, col, i) Then Continue For\n placed(i) = True : If Solve(pos + 1, numPlaced + 1) Then Return True\n RmvO(orientation, row, col) : placed(i) = False\n Next : End If : Next : Return False\n End Function\n\n ' removes a placed orientation\n Sub RmvO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer)\n grid(row)(col) = -1 : For i As Integer = 0 To ori.Length - 1 Step 2\n grid(row + ori(i))(col + ori(i + 1)) = -1 : Next\n End Sub\n\n ' checks an orientation, if possible it is placed, else returns false\n Function TPO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer,\n ByVal sIdx As Integer) As Boolean\n For i As Integer = 0 To ori.Length - 1 Step 2\n Dim x As Integer = col + ori(i + 1), y As Integer = row + ori(i)\n If x < 0 OrElse x >= nCols OrElse y < 0 OrElse y >= nRows OrElse\n grid(y)(x) <> -1 Then Return False\n Next : grid(row)(col) = sIdx\n For i As Integer = 0 To ori.Length - 1 Step 2\n grid(row + ori(i))(col + ori(i + 1)) = sIdx\n Next : Return True\n End Function\n\n '!' the following routines expand the seed values into the 63 orientation arrays.\n ' source code space savings comparison:\n ' around 2000 chars for the expansion code, verses about 3000 chars for the integer array defs.\n ' perhaps not worth the savings?\n\n Sub Unpack(sv As Integer()) ' unpacks a list of seed values into a set of 63 rotated pentominoes\n pens = New List(Of List(Of Integer())) : For Each item In sv\n Dim Gen As New List(Of Integer()), exi As List(Of Integer) = Expand(item),\n fx As Integer() = ToP(exi) : Gen.Add(fx) : For i As Integer = 1 To 7\n If i = 4 Then Mir(exi) Else Rot(exi)\n fx = ToP(exi) : If Not Gen.Exists(Function(Red) TheSame(Red, fx)) Then Gen.Add(ToP(exi))\n Next : pens.Add(Gen) : Next\n End Sub\n\n ' expands an integer into a set of directions\n Function Expand(i As Integer) As List(Of Integer)\n Expand = {0}.ToList() : For j As Integer = 0 To 3 : Expand.Insert(1, i And 15) : i >>= 4 : Next\n End Function\n\n ' converts a set of directions to an array of y, x pairs\n Function ToP(p As List(Of Integer)) As Integer()\n Dim tmp As List(Of Integer) = {0}.ToList() : For Each item As Integer In p.Skip(1)\n tmp.Add(tmp.Item(item >> 2) + {1, 8, -1, -8}(item And 3)) : Next\n tmp.Sort() : For i As Integer = tmp.Count - 1 To 0 Step -1 : tmp.Item(i) -= tmp.Item(0) : Next\n Dim res As New List(Of Integer) : For Each item In tmp.Skip(1)\n Dim adj = If((item And 7) > 4, 8, 0)\n res.Add((adj + item) \\ 8) : res.Add((item And 7) - adj)\n Next : Return res.ToArray()\n End Function\n\n ' compares integer arrays for equivalency\n Function TheSame(a As Integer(), b As Integer()) As Boolean\n For i As Integer = 0 To a.Count - 1 : If a(i) <> b(i) Then Return False\n Next : Return True\n End Function\n\n Sub Rot(ByRef p As List(Of Integer)) ' rotates a set of directions by 90 degrees\n For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or ((p(i) + 1) And 3) : Next\n End Sub\n\n Sub Mir(ByRef p As List(Of Integer)) ' mirrors a set of directions\n For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or (((p(i) Xor 1) + 1) And 3) : Next\n End Sub\n\nEnd Module\n","language":"Visual-Basic-.NET"},{"code":"import \"random\" for Random\nimport \"./iterate\" for Stepped\n\nvar F = [\n [1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]\n]\n\nvar I = [\n [0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]\n]\n\nvar L = [\n [1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]\n]\n\nvar N = [\n [0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]\n]\n\nvar P = [\n [0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]\n]\n\nvar T = [\n [0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]\n]\n\nvar U = [\n [0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]\n]\n\nvar V = [\n [1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]\n]\n\nvar W = [\n [1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]\n]\n\nvar X = [[1, -1, 1, 0, 1, 1, 2, 0]]\n\nvar Y = [\n [1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]\n]\n\nvar Z = [\n [0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]\n]\n\nvar shapes = [F, I, L, N, P, T, U, V, W, X, Y, Z]\nvar rand = Random.new()\n\nvar symbols = \"FILNPTUVWXYZ-\".toList\n\nvar nRows = 8\nvar nCols = 8\nvar blank = 12\n\nvar grid = List.filled(nRows, null)\nfor (i in 0...nRows) grid[i] = List.filled(nCols, 0)\n\nvar placed = List.filled(symbols.count - 1, false)\n\nvar tryPlaceOrientation = Fn.new { |o, r, c, shapeIndex|\n for (i in Stepped.new(0...o.count, 2)) {\n var x = c + o[i + 1]\n var y = r + o[i]\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != - 1) return false\n }\n grid[r][c] = shapeIndex\n for (i in Stepped.new(0...o.count, 2)) grid[r + o[i]][c + o[i + 1]] = shapeIndex\n return true\n}\n\nvar removeOrientation = Fn.new { |o, r, c|\n grid[r][c] = -1\n for (i in Stepped.new(0...o.count, 2)) grid[r + o[i]][c + o[i + 1]] = -1\n}\n\nvar solve // recursive\nsolve = Fn.new { |pos, numPlaced|\n if (numPlaced == shapes.count) return true\n var row = (pos / nCols).floor\n var col = pos % nCols\n if (grid[row][col] != -1) return solve.call(pos + 1, numPlaced)\n\n for (i in 0...shapes.count) {\n if (!placed[i]) {\n for (orientation in shapes[i]) {\n if (!tryPlaceOrientation.call(orientation, row, col, i)) continue\n placed[i] = true\n if (solve.call(pos + 1, numPlaced + 1)) return true\n removeOrientation.call(orientation, row, col)\n placed[i] = false\n }\n }\n }\n return false\n}\n\nvar shuffleShapes = Fn.new {\n var n = shapes.count\n while (n > 1) {\n var r = rand.int(n)\n n = n - 1\n shapes.swap(r, n)\n symbols.swap(r, n)\n }\n}\n\nvar printResult = Fn.new {\n for (r in grid) {\n for (i in r) System.write(\"%(symbols[i]) \")\n System.print()\n }\n}\n\nshuffleShapes.call()\nfor (r in 0...nRows) {\n for (c in 0...grid[r].count) grid[r][c] = -1\n}\nfor (i in 0..3) {\n var randRow\n var randCol\n while (true) {\n randRow = rand.int(nRows)\n randCol = rand.int(nCols)\n if (grid[randRow][randCol] != blank) break\n }\n grid[randRow][randCol] = blank\n}\nif (solve.call(0, 0)) printResult.call() else System.print(\"No solution\")\n","language":"Wren"},{"code":"fcn printResult\n { foreach row in (grid){ row.apply(symbols.get).concat(\" \").println() } }\nfcn tryPlaceOrientation(o, R,C, shapeIndex){\n foreach ro,co in (o){ r,c:=R+ro, C+co;\n if(r<0 or r>=nRows or c<0 or c>=nCols or grid[r][c]!=-1) return(False);\n }\n grid[R][C]=shapeIndex; foreach ro,co in (o){ grid[R+ro][C+co]=shapeIndex }\n True\n}\nfcn removeOrientation(o, r,c)\n { grid[r][c]=-1; foreach ro,co in (o){ grid[r+ro][c+co]=-1 } }\nfcn solve(pos,numPlaced){\n if(numPlaced==target) return(True);\n\n row,col:=pos.divr(nCols);\n if(grid[row][col]!=-1) return(solve(pos+1,numPlaced));\n\n foreach i in (shapes.len()){\n if(not placed[i]){\n\t foreach orientation in (shapes[i]){\n\t if(not tryPlaceOrientation(orientation, row,col, i)) continue;\n\t placed[i]=True;\n\t if(solve(pos+1,numPlaced+1)) return(True);\n\t removeOrientation(orientation, row,col);\n\t placed[i]=False;\n\t }\n }\n }\n False\n}\n","language":"Zkl"},{"code":"reg [private] // the shapes are made of groups of 4 (r,c) pairs\n _F=T(T(1,-1, 1,0, 1,1, 2,1), T(0,1, 1,-1, 1,0, 2,0),\n T(1,0 , 1,1, 1,2, 2,1), T(1,0, 1,1, 2,-1, 2,0), T(1,-2, 1,-1, 1,0, 2,-1),\n T(0,1, 1,1, 1,2, 2,1), T(1,-1, 1,0, 1,1, 2,-1), T(1,-1, 1,0, 2,0, 2,1)),\n _I=T(T(0,1, 0,2, 0,3, 0,4), T(1,0, 2,0, 3,0, 4,0)),\n _L=T(T(1,0, 1,1, 1,2, 1,3), T(1,0, 2,0, 3,-1, 3,0),\n T(0,1, 0,2, 0,3, 1,3), T(0,1, 1,0, 2,0, 3,0), T(0,1, 1,1, 2,1, 3,1),\n T(0,1, 0,2, 0,3, 1,0), T(1,0, 2,0, 3,0, 3,1), T(1,-3, 1,-2, 1,-1, 1,0)),\n _N=T(T(0,1, 1,-2, 1,-1, 1,0), T(1,0, 1,1, 2,1, 3,1),\n T(0,1, 0,2, 1,-1, 1,0), T(1,0, 2,0, 2,1, 3,1), T(0,1, 1,1, 1,2, 1,3),\n T(1,0, 2,-1, 2,0, 3,-1),T(0,1, 0,2, 1,2, 1,3), T(1,-1, 1,0, 2,-1, 3,-1)),\n _P=T(T(0,1, 1,0, 1,1, 2,1), T(0,1, 0,2, 1,0, 1,1),\n T(1,0, 1,1, 2,0, 2,1), T(0,1, 1,-1, 1,0, 1,1), T(0,1, 1,0, 1,1, 1,2),\n T(1,-1, 1,0, 2,-1, 2,0), T(0,1, 0,2, 1,1, 1,2), T(0,1, 1,0, 1,1, 2,0)),\n _T=T(T(0,1, 0,2, 1,1, 2,1), T(1,-2, 1,-1, 1,0, 2,0),\n T(1,0, 2,-1, 2,0, 2,1), T(1,0, 1,1, 1,2, 2,0)),\n _U=T(T(0,1, 0,2, 1,0, 1,2), T(0,1, 1,1, 2,0, 2,1),\n T(0,2, 1,0, 1,1, 1,2), T(0,1, 1,0, 2,0, 2,1)),\n _V=T(T(1,0, 2,0, 2,1, 2,2), T(0,1, 0,2, 1,0, 2,0),\n T(1,0, 2,-2, 2,-1, 2,0), T(0,1, 0,2, 1,2, 2,2)),\n _W=T(T(1,0, 1,1, 2,1, 2,2), T(1,-1, 1,0, 2,-2, 2,-1),\n T(0,1, 1,1, 1,2, 2,2), T(0,1, 1,-1, 1,0, 2,-1)),\n _X=T(T(1,-1, 1,0, 1,1, 2,0)),\n _Y=T(T(1,-2, 1,-1, 1,0, 1,1), T(1,-1, 1,0, 2,0, 3,0),\n T(0,1, 0,2, 0,3, 1,1), T(1,0, 2,0, 2,1, 3,0), T(0,1, 0,2, 0,3, 1,2),\n T(1,0, 1,1, 2,0, 3,0), T(1,-1, 1,0, 1,1, 1,2), T(1,0, 2,-1, 2,0, 3,0)),\n _Z=T(T(0,1, 1,0, 2,-1, 2,0), T(1,0, 1,1, 1,2, 2,2),\n T(0,1, 1,1, 2,1, 2,2), T(1,-2, 1,-1, 1,0, 2,-2));\n\nconst nRows=8, nCols=8, target=12, blank=12;\nvar [const]\n grid = nRows.pump(List(),nCols.pump(List(),-1).copy),\n placed = target.pump(List(),False),\n\n symbols=\"FILNPTUVWXYZ-\".split(\"\"),\n shapes=T(_F,_I,_L,_N,_P,_T,_U,_V,_W,_X,_Y,_Z) // ((a,b, c,d))-->(((a,b),(c,d)))\n .pump(List,List(\"pump\",List,List(\"pump\",List,Void.Read,T.create)));\n","language":"Zkl"},{"code":"foreach r,c in ([0..nRows-1].walk().shuffle().zip([0..nCols-1].walk().shuffle())[0,4])\n { grid[r][c]=blank } // make sure 4 unique random spots\nif(solve(0,0)) printResult();\nelse\t println(\"No solution\");\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Pentomino_tiling\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"A [[wp:Pentomino|pentomino]] is a polyomino that consists of 5 squares. There are 12 pentomino shapes, \\nif you don't count rotations and reflections. Most pentominoes can form their own mirror image through \\nrotation, but some of them have to be flipped over.\\n\\n<pre> I \\n I L N Y \\n FF I L NN PP TTT V W X YY ZZ\\nFF I L N PP T U U V WW XXX Y Z \\n F I LL N P T UUU VVV WW X Y ZZ</pre> \\n\\n\\nA Pentomino tiling is an example of an [[wp:Exact_cover|exact cover]] problem and can take on many forms. \\nA traditional tiling presents an 8 by 8 grid, where 4 cells are left uncovered. The other cells are covered \\nby the 12 pentomino shapes, without overlaps, with every shape only used once.\\n\\nThe 4 uncovered cells should be chosen at random. Note that not all configurations are solvable.\\n\\n\\n;Task\\nCreate an 8 by 8 tiling and print the result.\\n\\n\\n;Example\\n\\n<pre>F I I I I I L N\\nF F F L L L L N\\nW F - X Z Z N N\\nW W X X X Z N V\\nT W W X - Z Z V\\nT T T P P V V V\\nT Y - P P U U U\\nY Y Y Y P U - U</pre>\\n\\n\\n;Related tasks\\n* [[Free_polyominoes_enumeration|Free polyominoes enumeration]]\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"F nonrandom(n)\\n UInt32 :seed = 0\\n :seed = 1664525 * :seed + 1013904223\\n R (:seed >> 16) % n\\n\\n-V\\n SF = [[1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]]\\n\\n SI = [[0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]]\\n\\n SL = [[1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]]\\n\\n SN = [[0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]]\\n\\n SP = [[0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]]\\n\\n ST = [[0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]]\\n\\n\\n SU = [[0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]]\\n\\n SV = [[1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]]\\n\\n SW = [[1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]]\\n\\n SX = [[1, -1, 1, 0, 1, 1, 2, 0]]\\n\\n SY = [[1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]]\\n\\n SZ = [[0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]]\\n\\n Shapes = [SF, SI, SL, SN, SP, ST, SU, SV, SW, SX, SY, SZ]\\n Symbols = Array(‘FILNPTUVWXYZ-’)\\n\\n NRows = 8\\n NCols = 8\\n Blank = Shapes.len\\n\\nT Tiling\\n [[[Int]]] shapes\\n [Char] symbols\\n [[Int]] grid\\n [Bool] placed\\n\\n F ()\\n V indexes = [4, 6, 11, 7, 10, 3, 9, 5, 1, 8, 0, 2]\\n L(index) indexes\\n .shapes.append(Shapes[index])\\n .symbols.append(Symbols[index])\\n .symbols.append(Symbols.last)\\n\\n .grid = [[-1] * NCols] * NRows\\n\\n L 4\\n L\\n V randRow = nonrandom(NRows)\\n V randCol = nonrandom(NCols)\\n I .grid[randRow][randCol] != Blank\\n .grid[randRow][randCol] = Blank\\n L.break\\n\\n .placed = [0B] * Shapes.len\\n\\n F tryPlaceOrientation(o, r, c, shapeIndex)\\n L(i) (0 .< o.len).step(2)\\n V x = c + o[i + 1]\\n V y = r + o[i]\\n I x !C 0 .< NCols | y !C 0 .< NRows | .grid[y][x] != -1\\n R 0B\\n .grid[r][c] = shapeIndex\\n L(i) (0 .< o.len).step(2)\\n .grid[r + o[i]][c + o[i + 1]] = shapeIndex\\n R 1B\\n\\n F removeOrientation(o, r, c)\\n .grid[r][c] = -1\\n L(i) (0 .< o.len).step(2)\\n .grid[r + o[i]][c + o[i + 1]] = -1\\n\\n F solve(pos, numPlaced)\\n I numPlaced == .shapes.len\\n R 1B\\n\\n V row = pos I/ NCols\\n V col = pos % NCols\\n I .grid[row][col] != -1\\n R .solve(pos + 1, numPlaced)\\n\\n L(i) 0 .< .shapes.len\\n I !.placed[i]\\n L(orientation) .shapes[i]\\n I !.tryPlaceOrientation(orientation, row, col, i)\\n L.continue\\n .placed[i] = 1B\\n I .solve(pos + 1, numPlaced + 1)\\n R 1B\\n .removeOrientation(orientation, row, col)\\n .placed[i] = 0B\\n R 0B\\n\\n F printResult()\\n L(r) .grid\\n print(r.map(i -> @.symbols[i]).join(‘ ’))\\n\\nV tiling = Tiling()\\nI tiling.solve(0, 0)\\n tiling.printResult()\\nE\\n print(‘No solution’)\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <algorithm>\\n#include <cstdint>\\n#include <iostream>\\n#include <random>\\n#include <vector>\\n\\nconst std::vector<std::vector<int32_t>> F = { { 1, -1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 1, -1, 1, 0, 2, 0 },\\n { 1, 0, 1, 1, 1, 2, 2, 1 }, { 1, 0, 1, 1, 2, -1, 2, 0 }, { 1, -2, 1, -1, 1, 0, 2, -1 },\\n { 0, 1, 1, 1, 1, 2, 2, 1 }, { 1, -1, 1, 0, 1, 1, 2, -1 }, { 1, -1, 1, 0, 2, 0, 2, 1 } };\\n\\nconst std::vector<std::vector<int32_t>> I = { { 0, 1, 0, 2, 0, 3, 0, 4 }, { 1, 0, 2, 0, 3, 0, 4, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> L = { { 1, 0, 1, 1, 1, 2, 1, 3 }, { 1, 0, 2, 0, 3, -1, 3, 0 },\\n { 0, 1, 0, 2, 0, 3, 1, 3 }, { 0, 1, 1, 0, 2, 0, 3, 0 }, { 0, 1, 1, 1, 2, 1, 3, 1 },\\n { 0, 1, 0, 2, 0, 3, 1, 0 }, { 1, 0, 2, 0, 3, 0, 3, 1 }, { 1, -3, 1, -2, 1, -1, 1, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> N = { { 0, 1, 1, -2, 1, -1, 1, 0 }, { 1, 0, 1, 1, 2, 1, 3, 1 },\\n { 0, 1, 0, 2, 1, -1, 1, 0 }, { 1, 0, 2, 0, 2, 1, 3, 1 }, { 0, 1, 1, 1, 1, 2, 1, 3 },\\n { 1, 0, 2, -1, 2, 0, 3, -1 }, { 0, 1, 0, 2, 1, 2, 1, 3 }, { 1, -1, 1, 0, 2, -1, 3, -1 } };\\n\\nconst std::vector<std::vector<int32_t>> P = { { 0, 1, 1, 0, 1, 1, 2, 1 }, { 0, 1, 0, 2, 1, 0, 1, 1 },\\n { 1, 0, 1, 1, 2, 0, 2, 1 }, { 0, 1, 1, -1, 1, 0, 1, 1 }, { 0, 1, 1, 0, 1, 1, 1, 2 },\\n { 1, -1, 1, 0, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 1, 1, 2 }, { 0, 1, 1, 0, 1, 1, 2, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> T = { { 0, 1, 0, 2, 1, 1, 2, 1 }, { 1, -2, 1, -1, 1, 0, 2, 0 },\\n { 1, 0, 2, -1, 2, 0, 2, 1 }, { 1, 0, 1, 1, 1, 2, 2, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> U = { { 0, 1, 0, 2, 1, 0, 1, 2 }, { 0, 1, 1, 1, 2, 0, 2, 1 },\\n { 0, 2, 1, 0, 1, 1, 1, 2 }, { 0, 1, 1, 0, 2, 0, 2, 1 } };\\n\\nconst std::vector<std::vector<int32_t>> V = { { 1, 0, 2, 0, 2, 1, 2, 2 }, { 0, 1, 0, 2, 1, 0, 2, 0 },\\n { 1, 0, 2, -2, 2, -1, 2, 0 }, { 0, 1, 0, 2, 1, 2, 2, 2 } };\\n\\nconst std::vector<std::vector<int32_t>> W = { { 1, 0, 1, 1, 2, 1, 2, 2 }, { 1, -1, 1, 0, 2, -2, 2, -1 },\\n { 0, 1, 1, 1, 1, 2, 2, 2 }, { 0, 1, 1, -1, 1, 0, 2, -1 } };\\n\\nconst std::vector<std::vector<int32_t>> X = { { 1, -1, 1, 0, 1, 1, 2, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> Y = { { 1, -2, 1, -1, 1, 0, 1, 1 }, { 1, -1, 1, 0, 2, 0, 3, 0 },\\n { 0, 1, 0, 2, 0, 3, 1, 1 }, { 1, 0, 2, 0, 2, 1, 3, 0 }, { 0, 1, 0, 2, 0, 3, 1, 2 },\\n { 1, 0, 1, 1, 2, 0, 3, 0 }, { 1, -1, 1, 0, 1, 1, 1, 2 }, { 1, 0, 2, -1, 2, 0, 3, 0 } };\\n\\nconst std::vector<std::vector<int32_t>> Z = { { 0, 1, 1, 0, 2, -1, 2, 0 }, { 1, 0, 1, 1, 1, 2, 2, 2 },\\n { 0, 1, 1, 1, 2, 1, 2, 2 }, { 1, -2, 1, -1, 1, 0, 2, -2 } };\\n\\nconst int32_t blank_index = 12;\\nconst int32_t nRows = 8;\\nconst int32_t nCols = 8;\\n\\nstd::vector<std::vector<std::vector<int32_t>>> shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z };\\nstd::vector<char> symbols = { 'F', 'I', 'L', 'N', 'P', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '-' };\\nstd::vector<std::vector<int32_t>> grid{nRows, std::vector<int32_t>(nCols, -1)};\\nstd::vector<bool> placed(symbols.size() - 1, false);\\n\\nstd::random_device random;\\nstd::mt19937 generator(random());\\nstd::uniform_real_distribution<double> distribution(0.0F, 1.0F);\\n\\nvoid display() {\\n for ( const std::vector<int32_t>& row : grid ) {\\n\\t for ( const int32_t& index : row ) {\\n\\t\\t std::cout << symbols[index] << \\\" \\\";\\n\\t }\\n\\t std::cout << std::endl;\\n }\\n}\\n\\nvoid shuffle_shapes() {\\n\\tuint64_t size = shapes.size();\\n\\twhile ( size > 1 ) {\\n\\t\\tint32_t random = static_cast<int32_t>( distribution(generator) * ( size-- ) );\\n\\n\\t\\tconst std::vector<std::vector<int32_t>> temp = shapes[random];\\n\\t\\tshapes[random] = shapes[size];\\n\\t\\tshapes[size] = temp;\\n\\n\\t\\tconst char temp_symbol = symbols[random];\\n\\t\\tsymbols[random] = symbols[size];\\n\\t\\tsymbols[size] = temp_symbol;\\n\\t}\\n}\\n\\nbool place_orientation(const std::vector<int32_t>& orientation,\\n const int32_t& row, const int32_t& col, const int32_t& shape_index) {\\n\\tfor ( uint64_t i = 0; i < orientation.size(); i += 2 ) {\\n\\t\\tint32_t x = col + orientation[i + 1];\\n\\t\\tint32_t y = row + orientation[i];\\n\\t\\tif ( x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1 ) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\tgrid[row][col] = shape_index;\\n\\tfor ( uint64_t i = 0; i < orientation.size(); i += 2 ) {\\n\\t\\tgrid[row + orientation[i]][col + orientation[i + 1]] = shape_index;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid remove_orientation(const std::vector<int32_t>& oorientation, const int32_t& row, const int32_t& col) {\\n\\tgrid[row][col] = -1;\\n\\tfor ( uint64_t i = 0; i < oorientation.size(); i += 2 ) {\\n\\t\\tgrid[row + oorientation[i]][col + oorientation[i + 1]] = -1;\\n\\t}\\n}\\n\\nbool solve(const int32_t& position, const uint64_t& number_placed) {\\n if ( number_placed == shapes.size() ) {\\n\\t return true;\\n }\\n\\n int32_t row = position / nCols;\\n int32_t col = position % nCols;\\n\\n if ( grid[row][col] != -1 ) {\\n\\t return solve(position + 1, number_placed);\\n }\\n\\n for ( uint64_t i = 0; i < shapes.size(); ++i ) {\\n\\t if ( ! placed[i] ) {\\n\\t\\t for ( const std::vector<int32_t>& orientation : shapes[i] ) {\\n\\t\\t\\t if ( ! place_orientation(orientation, row, col, i) ) {\\n\\t\\t\\t\\t continue;\\n\\t\\t\\t }\\n\\n\\t\\t\\t placed[i] = true;\\n\\n\\t\\t\\t if ( solve(position + 1, number_placed + 1) ) {\\n\\t\\t\\t\\t return true;\\n\\t\\t\\t }\\n\\n\\t\\t\\t remove_orientation(orientation, row, col);\\n\\t\\t\\t placed[i] = false;\\n\\t\\t }\\n\\t }\\n }\\n return false;\\n}\\n\\nint main() {\\n\\tshuffle_shapes();\\n\\n\\tfor ( int32_t i = 0; i < 4; ++i ) {\\n\\t\\tint32_t random_row, random_col;\\n\\t\\tdo {\\n\\t\\t\\trandom_row = static_cast<int32_t>(distribution(generator) * nRows);\\n\\t\\t\\trandom_col = static_cast<int32_t>(distribution(generator) * nCols);\\n\\t\\t} while ( grid[random_row][random_col] == blank_index );\\n\\n\\t\\tgrid[random_row][random_col] = blank_index;\\n\\n\\t}\\n\\n\\tif ( solve(0, 0) ) {\\n\\t\\tdisplay();\\n\\t} else {\\n\\t\\tstd::cout << \\\"No solution found\\\" << std::endl;\\n\\t}\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"using System;\\nusing System.Linq;\\n\\nnamespace PentominoTiling\\n{\\n class Program\\n {\\n static readonly char[] symbols = \\\"FILNPTUVWXYZ-\\\".ToCharArray();\\n\\n static readonly int nRows = 8;\\n static readonly int nCols = 8;\\n static readonly int target = 12;\\n static readonly int blank = 12;\\n\\n static int[][] grid = new int[nRows][];\\n static bool[] placed = new bool[target];\\n\\n static void Main(string[] args)\\n {\\n var rand = new Random();\\n\\n for (int r = 0; r < nRows; r++)\\n grid[r] = Enumerable.Repeat(-1, nCols).ToArray();\\n\\n for (int i = 0; i < 4; i++)\\n {\\n int randRow, randCol;\\n do\\n {\\n randRow = rand.Next(nRows);\\n randCol = rand.Next(nCols);\\n }\\n while (grid[randRow][randCol] == blank);\\n\\n grid[randRow][randCol] = blank;\\n }\\n\\n if (Solve(0, 0))\\n {\\n PrintResult();\\n }\\n else\\n {\\n Console.WriteLine(\\\"no solution\\\");\\n }\\n\\n Console.ReadKey();\\n }\\n\\n private static void PrintResult()\\n {\\n foreach (int[] r in grid)\\n {\\n foreach (int i in r)\\n Console.Write(\\\"{0} \\\", symbols[i]);\\n Console.WriteLine();\\n }\\n }\\n\\n private static bool Solve(int pos, int numPlaced)\\n {\\n if (numPlaced == target)\\n return true;\\n\\n int row = pos / nCols;\\n int col = pos % nCols;\\n\\n if (grid[row][col] != -1)\\n return Solve(pos + 1, numPlaced);\\n\\n for (int i = 0; i < shapes.Length; i++)\\n {\\n if (!placed[i])\\n {\\n foreach (int[] orientation in shapes[i])\\n {\\n if (!TryPlaceOrientation(orientation, row, col, i))\\n continue;\\n\\n placed[i] = true;\\n\\n if (Solve(pos + 1, numPlaced + 1))\\n return true;\\n\\n RemoveOrientation(orientation, row, col);\\n placed[i] = false;\\n }\\n }\\n }\\n return false;\\n }\\n\\n private static void RemoveOrientation(int[] orientation, int row, int col)\\n {\\n grid[row][col] = -1;\\n for (int i = 0; i < orientation.Length; i += 2)\\n grid[row + orientation[i]][col + orientation[i + 1]] = -1;\\n }\\n\\n private static bool TryPlaceOrientation(int[] orientation, int row, int col, int shapeIndex)\\n {\\n for (int i = 0; i < orientation.Length; i += 2)\\n {\\n int x = col + orientation[i + 1];\\n int y = row + orientation[i];\\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1)\\n return false;\\n }\\n\\n grid[row][col] = shapeIndex;\\n for (int i = 0; i < orientation.Length; i += 2)\\n grid[row + orientation[i]][col + orientation[i + 1]] = shapeIndex;\\n\\n return true;\\n }\\n\\n // four (x, y) pairs are listed, (0,0) not included\\n static readonly int[][] F = {\\n new int[] {1, -1, 1, 0, 1, 1, 2, 1}, new int[] {0, 1, 1, -1, 1, 0, 2, 0},\\n new int[] {1, 0, 1, 1, 1, 2, 2, 1}, new int[] {1, 0, 1, 1, 2, -1, 2, 0},\\n new int[] {1, -2, 1, -1, 1, 0, 2, -1}, new int[] {0, 1, 1, 1, 1, 2, 2, 1},\\n new int[] {1, -1, 1, 0, 1, 1, 2, -1}, new int[] {1, -1, 1, 0, 2, 0, 2, 1}};\\n\\n static readonly int[][] I = {\\n new int[] { 0, 1, 0, 2, 0, 3, 0, 4 }, new int[] { 1, 0, 2, 0, 3, 0, 4, 0 } };\\n\\n static readonly int[][] L = {\\n new int[] {1, 0, 1, 1, 1, 2, 1, 3}, new int[] {1, 0, 2, 0, 3, -1, 3, 0},\\n new int[] {0, 1, 0, 2, 0, 3, 1, 3}, new int[] {0, 1, 1, 0, 2, 0, 3, 0},\\n new int[] {0, 1, 1, 1, 2, 1, 3, 1}, new int[] {0, 1, 0, 2, 0, 3, 1, 0},\\n new int[] {1, 0, 2, 0, 3, 0, 3, 1}, new int[] {1, -3, 1, -2, 1, -1, 1, 0}};\\n\\n static readonly int[][] N = {\\n new int[] {0, 1, 1, -2, 1, -1, 1, 0}, new int[] {1, 0, 1, 1, 2, 1, 3, 1},\\n new int[] {0, 1, 0, 2, 1, -1, 1, 0}, new int[] {1, 0, 2, 0, 2, 1, 3, 1},\\n new int[] {0, 1, 1, 1, 1, 2, 1, 3}, new int[] {1, 0, 2, -1, 2, 0, 3, -1},\\n new int[] {0, 1, 0, 2, 1, 2, 1, 3}, new int[] {1, -1, 1, 0, 2, -1, 3, -1}};\\n\\n static readonly int[][] P = {\\n new int[] {0, 1, 1, 0, 1, 1, 2, 1}, new int[] {0, 1, 0, 2, 1, 0, 1, 1},\\n new int[] {1, 0, 1, 1, 2, 0, 2, 1}, new int[] {0, 1, 1, -1, 1, 0, 1, 1},\\n new int[] {0, 1, 1, 0, 1, 1, 1, 2}, new int[] {1, -1, 1, 0, 2, -1, 2, 0},\\n new int[] {0, 1, 0, 2, 1, 1, 1, 2}, new int[] {0, 1, 1, 0, 1, 1, 2, 0}};\\n\\n static readonly int[][] T = {\\n new int[] {0, 1, 0, 2, 1, 1, 2, 1}, new int[] {1, -2, 1, -1, 1, 0, 2, 0},\\n new int[] {1, 0, 2, -1, 2, 0, 2, 1}, new int[] {1, 0, 1, 1, 1, 2, 2, 0}};\\n\\n static readonly int[][] U = {\\n new int[] {0, 1, 0, 2, 1, 0, 1, 2}, new int[] {0, 1, 1, 1, 2, 0, 2, 1},\\n new int[] {0, 2, 1, 0, 1, 1, 1, 2}, new int[] {0, 1, 1, 0, 2, 0, 2, 1}};\\n\\n static readonly int[][] V = {\\n new int[] {1, 0, 2, 0, 2, 1, 2, 2}, new int[] {0, 1, 0, 2, 1, 0, 2, 0},\\n new int[] {1, 0, 2, -2, 2, -1, 2, 0}, new int[] {0, 1, 0, 2, 1, 2, 2, 2}};\\n\\n static readonly int[][] W = {\\n new int[] {1, 0, 1, 1, 2, 1, 2, 2}, new int[] {1, -1, 1, 0, 2, -2, 2, -1},\\n new int[] {0, 1, 1, 1, 1, 2, 2, 2}, new int[] {0, 1, 1, -1, 1, 0, 2, -1}};\\n\\n static readonly int[][] X = { new int[] { 1, -1, 1, 0, 1, 1, 2, 0 } };\\n\\n static readonly int[][] Y = {\\n new int[] {1, -2, 1, -1, 1, 0, 1, 1}, new int[] {1, -1, 1, 0, 2, 0, 3, 0},\\n new int[] {0, 1, 0, 2, 0, 3, 1, 1}, new int[] {1, 0, 2, 0, 2, 1, 3, 0},\\n new int[] {0, 1, 0, 2, 0, 3, 1, 2}, new int[] {1, 0, 1, 1, 2, 0, 3, 0},\\n new int[] {1, -1, 1, 0, 1, 1, 1, 2}, new int[] {1, 0, 2, -1, 2, 0, 3, 0}};\\n\\n static readonly int[][] Z = {\\n new int[] {0, 1, 1, 0, 2, -1, 2, 0}, new int[] {1, 0, 1, 1, 1, 2, 2, 2},\\n new int[] {0, 1, 1, 1, 2, 1, 2, 2}, new int[] {1, -2, 1, -1, 1, 0, 2, -2}};\\n\\n static readonly int[][][] shapes = { F, I, L, N, P, T, U, V, W, X, Y, Z };\\n }\\n}\\n\",\n \"language\": \"C-sharp\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"math/rand\\\"\\n \\\"time\\\"\\n)\\n\\nvar F = [][]int{\\n {1, -1, 1, 0, 1, 1, 2, 1}, {0, 1, 1, -1, 1, 0, 2, 0},\\n {1, 0, 1, 1, 1, 2, 2, 1}, {1, 0, 1, 1, 2, -1, 2, 0},\\n {1, -2, 1, -1, 1, 0, 2, -1}, {0, 1, 1, 1, 1, 2, 2, 1},\\n {1, -1, 1, 0, 1, 1, 2, -1}, {1, -1, 1, 0, 2, 0, 2, 1},\\n}\\n\\nvar I = [][]int{{0, 1, 0, 2, 0, 3, 0, 4}, {1, 0, 2, 0, 3, 0, 4, 0}}\\n\\nvar L = [][]int{\\n {1, 0, 1, 1, 1, 2, 1, 3}, {1, 0, 2, 0, 3, -1, 3, 0},\\n {0, 1, 0, 2, 0, 3, 1, 3}, {0, 1, 1, 0, 2, 0, 3, 0}, {0, 1, 1, 1, 2, 1, 3, 1},\\n {0, 1, 0, 2, 0, 3, 1, 0}, {1, 0, 2, 0, 3, 0, 3, 1}, {1, -3, 1, -2, 1, -1, 1, 0},\\n}\\n\\nvar N = [][]int{\\n {0, 1, 1, -2, 1, -1, 1, 0}, {1, 0, 1, 1, 2, 1, 3, 1},\\n {0, 1, 0, 2, 1, -1, 1, 0}, {1, 0, 2, 0, 2, 1, 3, 1}, {0, 1, 1, 1, 1, 2, 1, 3},\\n {1, 0, 2, -1, 2, 0, 3, -1}, {0, 1, 0, 2, 1, 2, 1, 3}, {1, -1, 1, 0, 2, -1, 3, -1},\\n}\\n\\nvar P = [][]int{\\n {0, 1, 1, 0, 1, 1, 2, 1}, {0, 1, 0, 2, 1, 0, 1, 1},\\n {1, 0, 1, 1, 2, 0, 2, 1}, {0, 1, 1, -1, 1, 0, 1, 1}, {0, 1, 1, 0, 1, 1, 1, 2},\\n {1, -1, 1, 0, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 1, 1, 2}, {0, 1, 1, 0, 1, 1, 2, 0},\\n}\\n\\nvar T = [][]int{\\n {0, 1, 0, 2, 1, 1, 2, 1}, {1, -2, 1, -1, 1, 0, 2, 0},\\n {1, 0, 2, -1, 2, 0, 2, 1}, {1, 0, 1, 1, 1, 2, 2, 0},\\n}\\n\\nvar U = [][]int{\\n {0, 1, 0, 2, 1, 0, 1, 2}, {0, 1, 1, 1, 2, 0, 2, 1},\\n {0, 2, 1, 0, 1, 1, 1, 2}, {0, 1, 1, 0, 2, 0, 2, 1},\\n}\\n\\nvar V = [][]int{\\n {1, 0, 2, 0, 2, 1, 2, 2}, {0, 1, 0, 2, 1, 0, 2, 0},\\n {1, 0, 2, -2, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 2, 2, 2},\\n}\\n\\nvar W = [][]int{\\n {1, 0, 1, 1, 2, 1, 2, 2}, {1, -1, 1, 0, 2, -2, 2, -1},\\n {0, 1, 1, 1, 1, 2, 2, 2}, {0, 1, 1, -1, 1, 0, 2, -1},\\n}\\n\\nvar X = [][]int{{1, -1, 1, 0, 1, 1, 2, 0}}\\n\\nvar Y = [][]int{\\n {1, -2, 1, -1, 1, 0, 1, 1}, {1, -1, 1, 0, 2, 0, 3, 0},\\n {0, 1, 0, 2, 0, 3, 1, 1}, {1, 0, 2, 0, 2, 1, 3, 0}, {0, 1, 0, 2, 0, 3, 1, 2},\\n {1, 0, 1, 1, 2, 0, 3, 0}, {1, -1, 1, 0, 1, 1, 1, 2}, {1, 0, 2, -1, 2, 0, 3, 0},\\n}\\n\\nvar Z = [][]int{\\n {0, 1, 1, 0, 2, -1, 2, 0}, {1, 0, 1, 1, 1, 2, 2, 2},\\n {0, 1, 1, 1, 2, 1, 2, 2}, {1, -2, 1, -1, 1, 0, 2, -2},\\n}\\n\\nvar shapes = [][][]int{F, I, L, N, P, T, U, V, W, X, Y, Z}\\n\\nvar symbols = []byte(\\\"FILNPTUVWXYZ-\\\")\\n\\nconst (\\n nRows = 8\\n nCols = 8\\n blank = 12\\n)\\n\\nvar grid [nRows][nCols]int\\nvar placed [12]bool\\n\\nfunc tryPlaceOrientation(o []int, r, c, shapeIndex int) bool {\\n for i := 0; i < len(o); i += 2 {\\n x := c + o[i+1]\\n y := r + o[i]\\n if x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1 {\\n return false\\n }\\n }\\n grid[r][c] = shapeIndex\\n for i := 0; i < len(o); i += 2 {\\n grid[r+o[i]][c+o[i+1]] = shapeIndex\\n }\\n return true\\n}\\n\\nfunc removeOrientation(o []int, r, c int) {\\n grid[r][c] = -1\\n for i := 0; i < len(o); i += 2 {\\n grid[r+o[i]][c+o[i+1]] = -1\\n }\\n}\\n\\nfunc solve(pos, numPlaced int) bool {\\n if numPlaced == len(shapes) {\\n return true\\n }\\n row := pos / nCols\\n col := pos % nCols\\n if grid[row][col] != -1 {\\n return solve(pos+1, numPlaced)\\n }\\n\\n for i := range shapes {\\n if !placed[i] {\\n for _, orientation := range shapes[i] {\\n if !tryPlaceOrientation(orientation, row, col, i) {\\n continue\\n }\\n placed[i] = true\\n if solve(pos+1, numPlaced+1) {\\n return true\\n }\\n removeOrientation(orientation, row, col)\\n placed[i] = false\\n }\\n }\\n }\\n return false\\n}\\n\\nfunc shuffleShapes() {\\n rand.Shuffle(len(shapes), func(i, j int) {\\n shapes[i], shapes[j] = shapes[j], shapes[i]\\n symbols[i], symbols[j] = symbols[j], symbols[i]\\n })\\n}\\n\\nfunc printResult() {\\n for _, r := range grid {\\n for _, i := range r {\\n fmt.Printf(\\\"%c \\\", symbols[i])\\n }\\n fmt.Println()\\n }\\n}\\n\\nfunc main() {\\n rand.Seed(time.Now().UnixNano())\\n shuffleShapes()\\n for r := 0; r < nRows; r++ {\\n for i := range grid[r] {\\n grid[r][i] = -1\\n }\\n }\\n for i := 0; i < 4; i++ {\\n var randRow, randCol int\\n for {\\n randRow = rand.Intn(nRows)\\n randCol = rand.Intn(nCols)\\n if grid[randRow][randCol] != blank {\\n break\\n }\\n }\\n grid[randRow][randCol] = blank\\n }\\n if solve(0, 0) {\\n printResult()\\n } else {\\n fmt.Println(\\\"No solution\\\")\\n }\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"package pentominotiling;\\n\\nimport java.util.*;\\n\\npublic class PentominoTiling {\\n\\n static final char[] symbols = \\\"FILNPTUVWXYZ-\\\".toCharArray();\\n static final Random rand = new Random();\\n\\n static final int nRows = 8;\\n static final int nCols = 8;\\n static final int blank = 12;\\n\\n static int[][] grid = new int[nRows][nCols];\\n static boolean[] placed = new boolean[symbols.length - 1];\\n\\n public static void main(String[] args) {\\n shuffleShapes();\\n\\n for (int r = 0; r < nRows; r++)\\n Arrays.fill(grid[r], -1);\\n\\n for (int i = 0; i < 4; i++) {\\n int randRow, randCol;\\n do {\\n randRow = rand.nextInt(nRows);\\n randCol = rand.nextInt(nCols);\\n } while (grid[randRow][randCol] == blank);\\n grid[randRow][randCol] = blank;\\n }\\n\\n if (solve(0, 0)) {\\n printResult();\\n } else {\\n System.out.println(\\\"no solution\\\");\\n }\\n }\\n\\n static void shuffleShapes() {\\n int n = shapes.length;\\n while (n > 1) {\\n int r = rand.nextInt(n--);\\n\\n int[][] tmp = shapes[r];\\n shapes[r] = shapes[n];\\n shapes[n] = tmp;\\n\\n char tmpSymbol = symbols[r];\\n symbols[r] = symbols[n];\\n symbols[n] = tmpSymbol;\\n }\\n }\\n\\n static void printResult() {\\n for (int[] r : grid) {\\n for (int i : r)\\n System.out.printf(\\\"%c \\\", symbols[i]);\\n System.out.println();\\n }\\n }\\n\\n static boolean tryPlaceOrientation(int[] o, int r, int c, int shapeIndex) {\\n\\n for (int i = 0; i < o.length; i += 2) {\\n int x = c + o[i + 1];\\n int y = r + o[i];\\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != -1)\\n return false;\\n }\\n\\n grid[r][c] = shapeIndex;\\n for (int i = 0; i < o.length; i += 2)\\n grid[r + o[i]][c + o[i + 1]] = shapeIndex;\\n\\n return true;\\n }\\n\\n static void removeOrientation(int[] o, int r, int c) {\\n grid[r][c] = -1;\\n for (int i = 0; i < o.length; i += 2)\\n grid[r + o[i]][c + o[i + 1]] = -1;\\n }\\n\\n static boolean solve(int pos, int numPlaced) {\\n if (numPlaced == shapes.length)\\n return true;\\n\\n int row = pos / nCols;\\n int col = pos % nCols;\\n\\n if (grid[row][col] != -1)\\n return solve(pos + 1, numPlaced);\\n\\n for (int i = 0; i < shapes.length; i++) {\\n if (!placed[i]) {\\n for (int[] orientation : shapes[i]) {\\n\\n if (!tryPlaceOrientation(orientation, row, col, i))\\n continue;\\n\\n placed[i] = true;\\n\\n if (solve(pos + 1, numPlaced + 1))\\n return true;\\n\\n removeOrientation(orientation, row, col);\\n placed[i] = false;\\n }\\n }\\n }\\n return false;\\n }\\n\\n static final int[][] F = {{1, -1, 1, 0, 1, 1, 2, 1}, {0, 1, 1, -1, 1, 0, 2, 0},\\n {1, 0, 1, 1, 1, 2, 2, 1}, {1, 0, 1, 1, 2, -1, 2, 0}, {1, -2, 1, -1, 1, 0, 2, -1},\\n {0, 1, 1, 1, 1, 2, 2, 1}, {1, -1, 1, 0, 1, 1, 2, -1}, {1, -1, 1, 0, 2, 0, 2, 1}};\\n\\n static final int[][] I = {{0, 1, 0, 2, 0, 3, 0, 4}, {1, 0, 2, 0, 3, 0, 4, 0}};\\n\\n static final int[][] L = {{1, 0, 1, 1, 1, 2, 1, 3}, {1, 0, 2, 0, 3, -1, 3, 0},\\n {0, 1, 0, 2, 0, 3, 1, 3}, {0, 1, 1, 0, 2, 0, 3, 0}, {0, 1, 1, 1, 2, 1, 3, 1},\\n {0, 1, 0, 2, 0, 3, 1, 0}, {1, 0, 2, 0, 3, 0, 3, 1}, {1, -3, 1, -2, 1, -1, 1, 0}};\\n\\n static final int[][] N = {{0, 1, 1, -2, 1, -1, 1, 0}, {1, 0, 1, 1, 2, 1, 3, 1},\\n {0, 1, 0, 2, 1, -1, 1, 0}, {1, 0, 2, 0, 2, 1, 3, 1}, {0, 1, 1, 1, 1, 2, 1, 3},\\n {1, 0, 2, -1, 2, 0, 3, -1}, {0, 1, 0, 2, 1, 2, 1, 3}, {1, -1, 1, 0, 2, -1, 3, -1}};\\n\\n static final int[][] P = {{0, 1, 1, 0, 1, 1, 2, 1}, {0, 1, 0, 2, 1, 0, 1, 1},\\n {1, 0, 1, 1, 2, 0, 2, 1}, {0, 1, 1, -1, 1, 0, 1, 1}, {0, 1, 1, 0, 1, 1, 1, 2},\\n {1, -1, 1, 0, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 1, 1, 2}, {0, 1, 1, 0, 1, 1, 2, 0}};\\n\\n static final int[][] T = {{0, 1, 0, 2, 1, 1, 2, 1}, {1, -2, 1, -1, 1, 0, 2, 0},\\n {1, 0, 2, -1, 2, 0, 2, 1}, {1, 0, 1, 1, 1, 2, 2, 0}};\\n\\n static final int[][] U = {{0, 1, 0, 2, 1, 0, 1, 2}, {0, 1, 1, 1, 2, 0, 2, 1},\\n {0, 2, 1, 0, 1, 1, 1, 2}, {0, 1, 1, 0, 2, 0, 2, 1}};\\n\\n static final int[][] V = {{1, 0, 2, 0, 2, 1, 2, 2}, {0, 1, 0, 2, 1, 0, 2, 0},\\n {1, 0, 2, -2, 2, -1, 2, 0}, {0, 1, 0, 2, 1, 2, 2, 2}};\\n\\n static final int[][] W = {{1, 0, 1, 1, 2, 1, 2, 2}, {1, -1, 1, 0, 2, -2, 2, -1},\\n {0, 1, 1, 1, 1, 2, 2, 2}, {0, 1, 1, -1, 1, 0, 2, -1}};\\n\\n static final int[][] X = {{1, -1, 1, 0, 1, 1, 2, 0}};\\n\\n static final int[][] Y = {{1, -2, 1, -1, 1, 0, 1, 1}, {1, -1, 1, 0, 2, 0, 3, 0},\\n {0, 1, 0, 2, 0, 3, 1, 1}, {1, 0, 2, 0, 2, 1, 3, 0}, {0, 1, 0, 2, 0, 3, 1, 2},\\n {1, 0, 1, 1, 2, 0, 3, 0}, {1, -1, 1, 0, 1, 1, 1, 2}, {1, 0, 2, -1, 2, 0, 3, 0}};\\n\\n static final int[][] Z = {{0, 1, 1, 0, 2, -1, 2, 0}, {1, 0, 1, 1, 1, 2, 2, 2},\\n {0, 1, 1, 1, 2, 1, 2, 2}, {1, -2, 1, -1, 1, 0, 2, -2}};\\n\\n static final int[][][] shapes = {F, I, L, N, P, T, U, V, W, X, Y, Z};\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Random\\n\\nstruct GridPoint x::Int; y::Int end\\n\\nconst nrows, ncols, target = 8, 8, 12\\nconst grid = fill('*', nrows, ncols)\\nconst shapeletters = ['F', 'I', 'L', 'N', 'P', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']\\nconst shapevec = [\\n [(1,-1, 1,0, 1,1, 2,1), (0,1, 1,-1, 1,0, 2,0),\\n (1,0 , 1,1, 1,2, 2,1), (1,0, 1,1, 2,-1, 2,0), (1,-2, 1,-1, 1,0, 2,-1),\\n (0,1, 1,1, 1,2, 2,1), (1,-1, 1,0, 1,1, 2,-1), (1,-1, 1,0, 2,0, 2,1)],\\n [(0,1, 0,2, 0,3, 0,4), (1,0, 2,0, 3,0, 4,0)],\\n [(1,0, 1,1, 1,2, 1,3), (1,0, 2,0, 3,-1, 3,0),\\n (0,1, 0,2, 0,3, 1,3), (0,1, 1,0, 2,0, 3,0), (0,1, 1,1, 2,1, 3,1),\\n (0,1, 0,2, 0,3, 1,0), (1,0, 2,0, 3,0, 3,1), (1,-3, 1,-2, 1,-1, 1,0)],\\n [(0,1, 1,-2, 1,-1, 1,0), (1,0, 1,1, 2,1, 3,1),\\n (0,1, 0,2, 1,-1, 1,0), (1,0, 2,0, 2,1, 3,1), (0,1, 1,1, 1,2, 1,3),\\n (1,0, 2,-1, 2,0, 3,-1), (0,1, 0,2, 1,2, 1,3), (1,-1, 1,0, 2,-1, 3,-1)],\\n [(0,1, 1,0, 1,1, 2,1), (0,1, 0,2, 1,0, 1,1),\\n (1,0, 1,1, 2,0, 2,1), (0,1, 1,-1, 1,0, 1,1), (0,1, 1,0, 1,1, 1,2),\\n (1,-1, 1,0, 2,-1, 2,0), (0,1, 0,2, 1,1, 1,2), (0,1, 1,0, 1,1, 2,0)],\\n [(0,1, 0,2, 1,1, 2,1), (1,-2, 1,-1, 1,0, 2,0),\\n (1,0, 2,-1, 2,0, 2,1), (1,0, 1,1, 1,2, 2,0)],\\n [(0,1, 0,2, 1,0, 1,2), (0,1, 1,1, 2,0, 2,1),\\n (0,2, 1,0, 1,1, 1,2), (0,1, 1,0, 2,0, 2,1)],\\n [(1,0, 2,0, 2,1, 2,2), (0,1, 0,2, 1,0, 2,0),\\n (1,0, 2,-2, 2,-1, 2,0), (0,1, 0,2, 1,2, 2,2)],\\n [(1,0, 1,1, 2,1, 2,2), (1,-1, 1,0, 2,-2, 2,-1),\\n (0,1, 1,1, 1,2, 2,2), (0,1, 1,-1, 1,0, 2,-1)],\\n [(1,-1, 1,0, 1,1, 2,0)],\\n [(1,-2, 1,-1, 1,0, 1,1), (1,-1, 1,0, 2,0, 3,0),\\n (0,1, 0,2, 0,3, 1,1), (1,0, 2,0, 2,1, 3,0), (0,1, 0,2, 0,3, 1,2),\\n (1,0, 1,1, 2,0, 3,0), (1,-1, 1,0, 1,1, 1,2), (1,0, 2,-1, 2,0, 3,0)],\\n [(0,1, 1,0, 2,-1, 2,0), (1,0, 1,1, 1,2, 2,2),\\n (0,1, 1,1, 2,1, 2,2), (1,-2, 1,-1, 1,0, 2,-2)]]\\nconst shapes = Dict{Char,Vector{Vector{GridPoint}}}()\\nconst placed = Dict{Char,Bool}()\\n\\nfor (ltr, vec) in zip(shapeletters, shapevec)\\n shapes[ltr] = [[GridPoint(v[i], v[i + 1]) for i in 1:2:7] for v in vec]\\n placed[ltr] = false\\nend\\n\\nprintgrid(m, w, h) = for x in 1:w for y in 1:h print(m[x, y], \\\" \\\") end; println() end\\n\\nfunction tryplaceorientation(o, R, C, shapeindex)\\n for p in o\\n r, c = R + p.x, C + p.y\\n if r < 1 || r > nrows || c < 1 || c > ncols || grid[r, c] != '*'\\n return false\\n end\\n end\\n grid[R, C] = shapeindex\\n for p in o\\n grid[R + p.x, C + p.y] = shapeindex\\n end\\n true\\nend\\n\\nfunction removeorientation(o, r, c)\\n grid[r, c] = '*'\\n for p in o\\n grid[r + p.x, c + p.y] = '*'\\n end\\nend\\n\\nfunction solve(pos, nplaced)\\n if nplaced == target\\n return true\\n end\\n row, col = divrem(pos, ncols) .+ 1\\n if grid[row, col] != '*'\\n return solve(pos + 1, nplaced)\\n end\\n for i in keys((shapes))\\n if !placed[i]\\n for orientation in shapes[i]\\n if tryplaceorientation(orientation, row, col, i)\\n placed[i] = true\\n if solve(pos + 1, nplaced + 1)\\n return true\\n else\\n removeorientation(orientation, row, col)\\n placed[i] = false\\n end\\n end\\n end\\n end\\n end\\n false\\nend\\n\\nfunction placepentominoes()\\n for p in zip(shuffle(collect(1:nrows))[1:4], shuffle(collect(1:ncols))[1:4])\\n grid[p[1], p[2]] = ' '\\n end\\n if solve(0, 0)\\n printgrid(grid, nrows, ncols)\\n else\\n println(\\\"No solution found.\\\")\\n end\\nend\\n\\nplacepentominoes()\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// Version 1.1.4-3\\n\\nimport java.util.Random\\n\\nval F = arrayOf(\\n intArrayOf(1, -1, 1, 0, 1, 1, 2, 1), intArrayOf(0, 1, 1, -1, 1, 0, 2, 0),\\n intArrayOf(1, 0, 1, 1, 1, 2, 2, 1), intArrayOf(1, 0, 1, 1, 2, -1, 2, 0),\\n intArrayOf(1, -2, 1, -1, 1, 0, 2, -1), intArrayOf(0, 1, 1, 1, 1, 2, 2, 1),\\n intArrayOf(1, -1, 1, 0, 1, 1, 2, -1), intArrayOf(1, -1, 1, 0, 2, 0, 2, 1)\\n)\\n\\nval I = arrayOf(\\n intArrayOf(0, 1, 0, 2, 0, 3, 0, 4), intArrayOf(1, 0, 2, 0, 3, 0, 4, 0)\\n)\\n\\nval L = arrayOf(\\n intArrayOf(1, 0, 1, 1, 1, 2, 1, 3), intArrayOf(1, 0, 2, 0, 3, -1, 3, 0),\\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 3), intArrayOf(0, 1, 1, 0, 2, 0, 3, 0),\\n intArrayOf(0, 1, 1, 1, 2, 1, 3, 1), intArrayOf(0, 1, 0, 2, 0, 3, 1, 0),\\n intArrayOf(1, 0, 2, 0, 3, 0, 3, 1), intArrayOf(1, -3, 1, -2, 1, -1, 1, 0)\\n)\\n\\nval N = arrayOf(\\n intArrayOf(0, 1, 1, -2, 1, -1, 1, 0), intArrayOf(1, 0, 1, 1, 2, 1, 3, 1),\\n intArrayOf(0, 1, 0, 2, 1, -1, 1, 0), intArrayOf(1, 0, 2, 0, 2, 1, 3, 1),\\n intArrayOf(0, 1, 1, 1, 1, 2, 1, 3), intArrayOf(1, 0, 2, -1, 2, 0, 3, -1),\\n intArrayOf(0, 1, 0, 2, 1, 2, 1, 3), intArrayOf(1, -1, 1, 0, 2, -1, 3, -1)\\n)\\n\\nval P = arrayOf(\\n intArrayOf(0, 1, 1, 0, 1, 1, 2, 1), intArrayOf(0, 1, 0, 2, 1, 0, 1, 1),\\n intArrayOf(1, 0, 1, 1, 2, 0, 2, 1), intArrayOf(0, 1, 1, -1, 1, 0, 1, 1),\\n intArrayOf(0, 1, 1, 0, 1, 1, 1, 2), intArrayOf(1, -1, 1, 0, 2, -1, 2, 0),\\n intArrayOf(0, 1, 0, 2, 1, 1, 1, 2), intArrayOf(0, 1, 1, 0, 1, 1, 2, 0)\\n)\\n\\nval T = arrayOf(\\n intArrayOf(0, 1, 0, 2, 1, 1, 2, 1), intArrayOf(1, -2, 1, -1, 1, 0, 2, 0),\\n intArrayOf(1, 0, 2, -1, 2, 0, 2, 1), intArrayOf(1, 0, 1, 1, 1, 2, 2, 0)\\n)\\n\\nval U = arrayOf(\\n intArrayOf(0, 1, 0, 2, 1, 0, 1, 2), intArrayOf(0, 1, 1, 1, 2, 0, 2, 1),\\n intArrayOf(0, 2, 1, 0, 1, 1, 1, 2), intArrayOf(0, 1, 1, 0, 2, 0, 2, 1)\\n)\\n\\nval V = arrayOf(\\n intArrayOf(1, 0, 2, 0, 2, 1, 2, 2), intArrayOf(0, 1, 0, 2, 1, 0, 2, 0),\\n intArrayOf(1, 0, 2, -2, 2, -1, 2, 0), intArrayOf(0, 1, 0, 2, 1, 2, 2, 2)\\n)\\n\\nval W = arrayOf(\\n intArrayOf(1, 0, 1, 1, 2, 1, 2, 2), intArrayOf(1, -1, 1, 0, 2, -2, 2, -1),\\n intArrayOf(0, 1, 1, 1, 1, 2, 2, 2), intArrayOf(0, 1, 1, -1, 1, 0, 2, -1)\\n)\\n\\nval X = arrayOf(intArrayOf(1, -1, 1, 0, 1, 1, 2, 0))\\n\\nval Y = arrayOf(\\n intArrayOf(1, -2, 1, -1, 1, 0, 1, 1), intArrayOf(1, -1, 1, 0, 2, 0, 3, 0),\\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 1), intArrayOf(1, 0, 2, 0, 2, 1, 3, 0),\\n intArrayOf(0, 1, 0, 2, 0, 3, 1, 2), intArrayOf(1, 0, 1, 1, 2, 0, 3, 0),\\n intArrayOf(1, -1, 1, 0, 1, 1, 1, 2), intArrayOf(1, 0, 2, -1, 2, 0, 3, 0)\\n)\\n\\nval Z = arrayOf(\\n intArrayOf(0, 1, 1, 0, 2, -1, 2, 0), intArrayOf(1, 0, 1, 1, 1, 2, 2, 2),\\n intArrayOf(0, 1, 1, 1, 2, 1, 2, 2), intArrayOf(1, -2, 1, -1, 1, 0, 2, -2)\\n)\\n\\nval shapes = arrayOf(F, I, L, N, P, T, U, V, W, X, Y, Z)\\nval rand = Random()\\n\\nval symbols = \\\"FILNPTUVWXYZ-\\\".toCharArray()\\n\\nval nRows = 8\\nval nCols = 8\\nval blank = 12\\n\\nval grid = Array(nRows) { IntArray(nCols) }\\nval placed = BooleanArray(symbols.size - 1)\\n\\nfun tryPlaceOrientation(o: IntArray, r: Int, c: Int, shapeIndex: Int): Boolean {\\n for (i in 0 until o.size step 2) {\\n val x = c + o[i + 1]\\n val y = r + o[i]\\n if (x !in (0 until nCols) || y !in (0 until nRows) || grid[y][x] != - 1) return false\\n }\\n grid[r][c] = shapeIndex\\n for (i in 0 until o.size step 2) grid[r + o[i]][c + o[i + 1]] = shapeIndex\\n return true\\n}\\n\\nfun removeOrientation(o: IntArray, r: Int, c: Int) {\\n grid[r][c] = -1\\n for (i in 0 until o.size step 2) grid[r + o[i]][c + o[i + 1]] = -1\\n}\\n\\nfun solve(pos: Int, numPlaced: Int): Boolean {\\n if (numPlaced == shapes.size) return true\\n val row = pos / nCols\\n val col = pos % nCols\\n if (grid[row][col] != -1) return solve(pos + 1, numPlaced)\\n\\n for (i in 0 until shapes.size) {\\n if (!placed[i]) {\\n for (orientation in shapes[i]) {\\n if (!tryPlaceOrientation(orientation, row, col, i)) continue\\n placed[i] = true\\n if (solve(pos + 1, numPlaced + 1)) return true\\n removeOrientation(orientation, row, col)\\n placed[i] = false\\n }\\n }\\n }\\n return false\\n}\\n\\nfun shuffleShapes() {\\n var n = shapes.size\\n while (n > 1) {\\n val r = rand.nextInt(n--)\\n val tmp = shapes[r]\\n shapes[r] = shapes[n]\\n shapes[n] = tmp\\n val tmpSymbol= symbols[r]\\n symbols[r] = symbols[n]\\n symbols[n] = tmpSymbol\\n }\\n}\\n\\nfun printResult() {\\n for (r in grid) {\\n for (i in r) print(\\\"${symbols[i]} \\\")\\n println()\\n }\\n}\\n\\nfun main(args: Array<String>) {\\n shuffleShapes()\\n for (r in 0 until nRows) grid[r].fill(-1)\\n for (i in 0..3) {\\n var randRow: Int\\n var randCol: Int\\n do {\\n randRow = rand.nextInt(nRows)\\n randCol = rand.nextInt(nCols)\\n }\\n while (grid[randRow][randCol] == blank)\\n grid[randRow][randCol] = blank\\n }\\n if (solve(0, 0)) printResult()\\n else println(\\\"No solution\\\")\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import random, sequtils, strutils\\n\\nconst\\n\\n F = @[[1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]]\\n\\n I = @[[0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]]\\n\\n L = @[[1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]]\\n\\n N = @[[0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]]\\n\\n P = @[[0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]]\\n\\n T = @[[0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]]\\n\\n\\n U = @[[0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]]\\n\\n V = @[[1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]]\\n\\n W = @[[1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]]\\n\\n X = @[[1, -1, 1, 0, 1, 1, 2, 0]]\\n\\n Y = @[[1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]]\\n\\n Z = @[[0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]]\\n\\n Shapes = [F, I, L, N, P, T, U, V, W, X, Y, Z]\\n Symbols = @\\\"FILNPTUVWXYZ-\\\"\\n\\n NRows = 8\\n NCols = 8\\n Blank = Shapes.len\\n\\n\\ntype Tiling = object\\n shapes: array[Shapes.len, seq[array[8, int]]] # Shuffled shapes.\\n symbols: array[Symbols.len, char] # Associated symbols.\\n grid: array[NRows, array[NCols, int]]\\n placed: array[Shapes.len, bool]\\n\\n\\nproc initTiling(): Tiling =\\n\\n # Build list of shapes and symbols.\\n var indexes = toSeq(0..11)\\n indexes.shuffle()\\n for i, index in indexes:\\n result.shapes[i] = Shapes[index]\\n result.symbols[i] = Symbols[index]\\n result.symbols[^1] = Symbols[^1]\\n\\n # Fill grid.\\n for r in result.grid.mitems:\\n for c in r.mitems:\\n c = -1\\n for i in 0..3:\\n while true:\\n let randRow = rand(NRows - 1)\\n let randCol = rand(NCols - 1)\\n if result.grid[randRow][randCol] != Blank:\\n result.grid[randRow][randCol] = Blank\\n break\\n\\n\\nfunc tryPlaceOrientation(t: var Tiling; o: openArray[int]; r, c, shapeIndex: int): bool =\\n for i in countup(0, o.len - 2, 2):\\n let x = c + o[i + 1]\\n let y = r + o[i]\\n if x notin 0..<NCols or y notin 0..<NRows or t.grid[y][x] != - 1: return false\\n t.grid[r][c] = shapeIndex\\n for i in countup(0, o.len - 2, 2): t.grid[r + o[i]][c + o[i + 1]] = shapeIndex\\n result = true\\n\\n\\nfunc removeOrientation(t: var Tiling; o: openArray[int]; r, c: int) =\\n t.grid[r][c] = -1\\n for i in countup(0, o.len - 2, 2): t.grid[r + o[i]][c + o[i + 1]] = -1\\n\\n\\nfunc solve(t: var Tiling; pos, numPlaced: int): bool =\\n if numPlaced == t.shapes.len: return true\\n let row = pos div NCols\\n let col = pos mod NCols\\n if t.grid[row][col] != -1: return t.solve(pos + 1, numPlaced)\\n\\n for i in 0..<t.shapes.len:\\n if not t.placed[i]:\\n for orientation in t.shapes[i]:\\n if not t.tryPlaceOrientation(orientation, row, col, i): continue\\n t.placed[i] = true\\n if t.solve(pos + 1, numPlaced + 1): return true\\n t.removeOrientation(orientation, row, col)\\n t.placed[i] = false\\n\\n\\nproc printResult(t: Tiling) =\\n for r in t.grid:\\n echo r.mapIt(t.symbols[it]).join(\\\" \\\")\\n\\n\\nwhen isMainModule:\\n randomize()\\n var tiling = initTiling()\\n if tiling.solve(0, 0): tiling.printResult\\n else: echo \\\"No solution\\\"\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"use strict;\\nuse warnings;\\nuse feature 'bitwise';\\n\\nmy $size = shift // 8;\\n\\nsub rotate\\n {\\n local $_ = shift;\\n my $ans = '';\\n $ans .= \\\"\\\\n\\\" while s/.$/$ans .= $&; ''/gem;\\n $ans;\\n }\\n\\nsub topattern\\n {\\n local $_ = shift;\\n s/.+/ $& . ' ' x ($size - length $&)/ge;\\n s/^\\\\s+|\\\\s+\\\\z//g;\\n [ tr/ \\\\nA-Z/.. /r, lc tr/ \\\\n/\\\\0/r, substr $_, 0, 1 ]; # pattern, xor-update\\n }\\n\\nmy %all;\\n@all{ \\\" FF\\\\nFF \\\\n F \\\\n\\\", \\\"IIIII\\\\n\\\", \\\"LLLL\\\\nL \\\\n\\\", \\\"NNN \\\\n NN\\\\n\\\",\\n \\\"PPP\\\\nPP \\\\n\\\", \\\"TTT\\\\n T \\\\n T \\\\n\\\", \\\"UUU\\\\nU U\\\\n\\\", \\\"VVV\\\\nV \\\\nV \\\\n\\\",\\n \\\"WW \\\\n WW\\\\n W\\\\n\\\", \\\" X \\\\nXXX\\\\n X \\\\n\\\", \\\"YYYY\\\\n Y \\\\n\\\", \\\"ZZ \\\\n Z \\\\n ZZ\\\\n\\\",\\n } = ();\\n@all{map rotate($_), keys %all} = () for 1 .. 3; # all four rotations\\n@all{map s/.+/reverse $&/ger, keys %all} = (); # mirror\\nmy @all = map topattern($_), keys %all;\\nmy $grid = ( ' ' x $size . \\\"\\\\n\\\" ) x $size;\\nmy %used;\\nfind( $grid );\\n\\n# looks for the first open space\\nsub find\\n {\\n my $grid = shift;\\n %used >= 12 and exit not print $grid;\\n for ( grep ! $used{ $_->[2] }, @all )\\n {\\n my ($pattern, $pentomino, $letter) = @$_;\\n local $used{$letter} = 1;\\n $grid =~ /^[^ ]*\\\\K$pattern/s and find( $grid ^. \\\"\\\\0\\\" x $-[0] . $pentomino );\\n }\\n }\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">pentominoes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"\\\"\\\"\\n ......I................................................................\\n ......I.....L......N.........................................Y.........\\n .FF...I.....L.....NN....PP....TTT...........V.....W....X....YY.....ZZ..\\n FF....I.....L.....N.....PP.....T....U.U.....V....WW...XXX....Y.....Z...\\n .F....I.....LL....N.....P......T....UUU...VVV...WW.....X.....Y....ZZ...\\\"\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- </span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">get_shapes</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">offset</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pentominoes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- scan left/right, and up/down, both ways, to give 8 orientations\\n -- (computes the equivalent of those hard-coded tables in\\n -- other examples, albeit in a slightly different order.)\\n --</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">shapes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">letter</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">orientation</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">7</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">shape</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{}</span>\\n <span style=\\\"color: #004080;\\\">bool</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">fr</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">fc</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">5</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">rr</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">orientation</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#01</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">cc</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008080;\\\">iff</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">orientation</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#02</span><span style=\\\"color: #0000FF;\\\">)?</span><span style=\\\"color: #000000;\\\">6</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">:</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">and_bits</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">orientation</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">#04</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">rr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">cc</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">cc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">rr</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">pentominoes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">rr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">offset</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">cc</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">!=</span><span style=\\\"color: #008000;\\\">'.'</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">found</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">found</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">fc</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">letter</span><span style=\\\"color: #0000FF;\\\">}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #004600;\\\">true</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #000000;\\\">shape</span> <span style=\\\"color: #0000FF;\\\">&=</span> <span style=\\\"color: #0000FF;\\\">{</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">fr</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">fc</span><span style=\\\"color: #0000FF;\\\">}</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #7060A8;\\\">find</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shape</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">shapes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">shape</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">res</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">append</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">res</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">letter</span><span style=\\\"color: #0000FF;\\\">&</span><span style=\\\"color: #008000;\\\">\\\"\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">res</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">shapes</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">get_shapes</span><span style=\\\"color: #0000FF;\\\">(),</span>\\n <span style=\\\"color: #000000;\\\">nRows</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">nCols</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">8</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">grid</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">nCols</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">nRows</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">placed</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004600;\\\">false</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">))</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">re_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #008000;\\\">' '</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">ch</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">can_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">],</span>\\n <span style=\\\"color: #000000;\\\">y</span> <span style=\\\"color: #0000FF;\\\">:=</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">+</span> <span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">nCols</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">nRows</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #000000;\\\">re_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">solve</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numPlaced</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">numPlaced</span> <span style=\\\"color: #0000FF;\\\">==</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">row</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">floor</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">col</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)+</span><span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">col</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #000000;\\\">solve</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numPlaced</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">placed</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">o</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">can_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">col</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">placed</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">solve</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">pos</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">numPlaced</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #000000;\\\">re_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">row</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">col</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">placed</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">unsolveable</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">--\\n -- The only unsolvable grids seen have\\n -- -.- or -..- or -... at edge/corner,\\n -- - -- --- -\\n -- or somewhere in the middle a -.-\\n -- -\\n --\\n -- Simply place all shapes at all positions/orientations,\\n -- all the while checking for any untouchable cells.\\n --</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">griddled</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">deep_copy</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">8</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">8</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">ch</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">])</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">o</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">shapes</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">can_place</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">ch</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span>\\n <span style=\\\"color: #000000;\\\">griddled</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'-'</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">' '</span>\\n <span style=\\\"color: #000000;\\\">griddled</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">]][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">o</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">k</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">]]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'-'</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">griddled</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]!=</span><span style=\\\"color: #008000;\\\">'-'</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">add_four_randomly</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">while</span> <span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">r</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">),</span>\\n <span style=\\\"color: #000000;\\\">c</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">rand</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">8</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">r</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">c</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'-'</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">1</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">while</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #000000;\\\">add_four_randomly</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">unsolveable</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"No solution\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">else</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #008080;\\\">not</span> <span style=\\\"color: #000000;\\\">solve</span><span style=\\\"color: #0000FF;\\\">()</span> <span style=\\\"color: #008080;\\\">then</span> <span style=\\\"color: #0000FF;\\\">?</span><span style=\\\"color: #000000;\\\">9</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n <span style=\\\"color: #000000;\\\">main</span><span style=\\\"color: #0000FF;\\\">()</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"import sat, util.\\nrotate(Q) = Res => % rotate right by 90 degrees\\n NZ = len(Q[1]), NS = len(Q), Res = new_array(NZ,NS),\\n foreach(Z in 1..NZ, S in 1..NS) Res[Z,S] = Q[S,NZ+1-Z] end.\\n\\nmatprint(Q) =>\\n NZ = len(Q), NS = len(Q[1]),\\n foreach(Z in 1..NZ, S in 1..NS)\\n printf(\\\"%d|\\\", Q[Z,S]),\\n if S=NS then nl end\\n end, nl.\\n\\ngenerate(Res) =>\\n P0 = [{{1,1,1,1}, % L\\n {1,0,0,0}},\\n {{0,1,1,1}, % N\\n {1,1,0,0}},\\n {{1,1,1,1}, % Y\\n {0,1,0,0}},\\n {{1,1,0}, % F\\n {0,1,1},\\n {0,1,0}},\\n {{1,1,1}, % T\\n {0,1,0},\\n {0,1,0}},\\n {{0,0,1}, % W\\n {0,1,1},\\n {1,1,0}},\\n {{1,1,1}, % P\\n {1,1,0}},\\n {{0,0,1}, % V\\n {0,0,1},\\n {1,1,1}},\\n {{1,0,1}, % U\\n {1,1,1}},\\n {{1,0,0}, % Z\\n {1,1,1},\\n {0,0,1}},\\n {{1,1,1,1,1}}, % I\\n {{0,1,0}, % X\\n {1,1,1},\\n {0,1,0}}],\\n Np = len(P0), P = [],\\n foreach(I in 1..Np)\\n VarI = [P0[I]],\\n foreach(_ in 1..3) VarI := [rotate(head(VarI))|VarI] end,\\n P := [VarI|P]\\n end,\\n Res = P.\\n\\nmain =>\\n N = 8, M = new_array(N+4,N+4),\\n foreach(R in N+1..N+4, C in 1..N) M[R,C] #= 0 end,\\n foreach(R in 1..N, C in N+1..N+4) M[R,C] #= 0 end,\\n generate(P), % P[1] = X-Pentomino, then P[2] = I, P[3] = Z, and so on U, V, P, X, W, T, F, Y, N, L\\n Np = len(P), M :: 0..Np,\\n foreach(I in 1..Np) count(I, vars(M), 5) end, % 12 pentomino\\n Idx = new_list(Np), % X has 1 rotation variant, I and Z each 2, the rest 4:\\n Idx[1] #= 1, [Idx[2],Idx[3]] :: 1..2, Idx :: 1..4,\\n DZ = new_list(Np), DZ :: 0..N-1, % translation of I.th pentomino\\n DS = new_list(Np), DS :: 0..N-1,\\n foreach(I in 1..Np, J in 1..4) % Constraint only if Idx[I] #= J!\\n NZ = len(P[I,J]), NS = len(P[I,J,1]),\\n foreach(DZI in 0..N-1, DSI in 0..N-1, Z in 1..NZ, S in 1..NS, P[I,J,Z,S]=1)\\n (Idx[I] #= J #/\\\\ DZ[I] #= DZI #/\\\\ DS[I] #= DSI) #=> M[DZI+Z,DSI+S] #= I\\n end\\n end,\\n solve(vars(M) ++ DZ ++ DS ++ Idx),\\n Chr = \\\" XIZUVPWTFYNL\\\",\\n foreach(Z in 1..N)\\n foreach(S in 1..N)\\n\\t\\t printf(\\\"%c|\\\", Chr[1 + M[Z,S]])\\n \\tend, nl\\n end.\\n\",\n \"language\": \"Picat\"\n },\n {\n \"code\": \"from itertools import product\\n\\nminos = (((197123, 7, 6), (1797, 6, 7), (1287, 6, 7), (196867, 7, 6)),\\n ((263937, 6, 6), (197126, 6, 6), (393731, 6, 6), (67332, 6, 6)),\\n ((16843011, 7, 5), (2063, 5, 7), (3841, 5, 7), (271, 5, 7), (3848, 5, 7), (50463234, 7, 5), (50397441, 7, 5), (33686019, 7, 5)),\\n ((131843, 7, 6), (1798, 6, 7), (775, 6, 7), (1795, 6, 7), (1543, 6, 7), (197377, 7, 6), (197378, 7, 6), (66307, 7, 6)),\\n ((132865, 6, 6), (131846, 6, 6), (198146, 6, 6), (132611, 6, 6), (393986, 6, 6), (263938, 6, 6), (67330, 6, 6), (132868, 6, 6)),\\n ((1039, 5, 7), (33751554, 7, 5), (16843521, 7, 5), (16974081, 7, 5), (33686274, 7, 5), (3842, 5, 7), (3844, 5, 7), (527, 5, 7)),\\n ((1804, 5, 7), (33751297, 7, 5), (33686273, 7, 5), (16974338, 7, 5), (16843522, 7, 5), (782, 5, 7), (3079, 5, 7), (3587, 5, 7)),\\n ((263683, 6, 6), (198148, 6, 6), (66310, 6, 6), (393985, 6, 6)),\\n ((67329, 6, 6), (131591, 6, 6), (459266, 6, 6), (263940, 6, 6)),\\n ((459780, 6, 6), (459009, 6, 6), (263175, 6, 6), (65799, 6, 6)),\\n ((4311810305, 8, 4), (31, 4, 8)),\\n ((132866, 6, 6),))\\n\\nboxchar_double_width = ' ╶╺╵└┕╹┖┗╴─╼┘┴┶┚┸┺╸╾━┙┵┷┛┹┻╷┌┍│├┝╿┞┡┐┬┮┤┼┾┦╀╄┑┭┯┥┽┿┩╃╇╻┎┏╽┟┢┃┠┣┒┰┲┧╁╆┨╂╊┓┱┳┪╅╈┫╉╋'\\nboxchar_single_width = [c + ' ─━'[i%3] for i, c in enumerate(boxchar_double_width)]\\n\\n# choose drawing alphabet based on terminal font\\npatterns = boxchar_single_width\\n\\ntiles = []\\nfor row in reversed(minos):\\n tiles.append([])\\n for n, x, y in row:\\n for shift in (b*8 + a for a, b in product(range(x), range(y))):\\n tiles[-1].append(n << shift)\\n\\ndef img(seq):\\n b = [[0]*10 for _ in range(10)]\\n\\n for i, s in enumerate(seq):\\n for j, k in product(range(8), range(8)):\\n if s & (1<<(j*8 + k)):\\n b[j + 1][k + 1] = i + 1\\n\\n idices = [[0]*9 for _ in range(9)]\\n for i, j in product(range(9), range(9)):\\n n = (b[i+1][j+1], b[i][j+1], b[i][j], b[i+1][j], b[i+1][j+1])\\n idices[i][j] = sum((a != b)*(1 + (not a or not b))*3**i for i, (a,b) in enumerate(zip(n, n[1:])))\\n\\n return '\\\\n'.join(''.join(patterns[i] for i in row) for row in idices)\\n\\ndef tile(board=0, seq=tuple(), tiles=tiles):\\n if not tiles:\\n yield img(seq)\\n return\\n\\n for c in tiles[0]:\\n b = board | c\\n\\n tnext = [] # not using list comprehension ...\\n for t in tiles[1:]:\\n tnext.append(tuple(n for n in t if not n&b))\\n if not tnext[-1]: break # because early break is faster\\n else:\\n yield from tile(b, seq + (c,), tnext)\\n\\nfor x in tile():\\n print(x)\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(require racket/hash)\\n\\n(module+ main (Pentomino-tiling))\\n\\n(define n-rows 8)\\n(define n-cols 8)\\n(define blank '-)\\n\\n(define (build-grid)\\n (for/fold ((grid (for*/hash ((r n-rows) (c n-cols)) (values (cons r c) #f)))) ((_ 4))\\n (hash-set grid (cons (random n-rows) (random n-cols)) blank)))\\n\\n(define (make-shapes-map)\\n (hash 'F (F) 'I (I) 'L (L) 'N (N) 'P (P) 'T (T) 'U (U) 'V (V) 'W (W) 'X (X) 'Y (Y) 'Z (Z)))\\n\\n(define (print-grid grid)\\n (for ((r n-rows) #:when (when (positive? r) (newline)) (c n-cols))\\n (write (hash-ref grid (cons r c))))\\n (newline))\\n\\n(define (Pentomino-tiling (grid (build-grid)))\\n (define solution (solve 0 grid (make-shapes-map)))\\n (if solution (print-grid solution) (displayln \\\"no solution\\\")))\\n\\n(define (solve p grid shapes (failed-shapes (hash)))\\n (define-values (r c) (quotient/remainder p n-cols))\\n (cond [(not grid) #f]\\n [(hash-empty? shapes) (and (hash-empty? failed-shapes) grid)]\\n [(hash-ref grid (cons r c) #f) (solve (add1 p) grid shapes failed-shapes)]\\n [else\\n (define s (car (hash-keys shapes)))\\n (define os (hash-ref shapes s))\\n (define shapes-s (hash-remove shapes s))\\n (define (try-place-orientation o)\\n (and (for/and ((dy.dx o))\\n (let ((y (+ r (car dy.dx))) (x (+ c (cdr dy.dx))))\\n (and (>= x 0) (>= y 0) (< x n-cols) (< y n-rows) (not (hash-ref grid (cons y x))))))\\n (for/fold ((grid (hash-set grid (cons r c) s))) ((dy.dx o))\\n (hash-set grid (cons (+ r (car dy.dx)) (+ c (cdr dy.dx))) s))))\\n (or (for*/first\\n ((o os)\\n (solution (in-value (solve (add1 p)\\n (try-place-orientation o)\\n (hash-union shapes-s failed-shapes))))\\n #:when solution)\\n solution)\\n (solve p grid shapes-s (hash-set failed-shapes s os)))]))\\n\\n(define (F) '(((1 . -1) (1 . 0) (1 . 1) (2 . 1))\\n ((0 . 1) (1 . -1) (1 . 0) (2 . 0))\\n ((1 . 0) (1 . 1) (1 . 2) (2 . 1))\\n ((1 . 0) (1 . 1) (2 . -1) (2 . 0))\\n ((1 . -2) (1 . -1) (1 . 0) (2 . -1))\\n ((0 . 1) (1 . 1) (1 . 2) (2 . 1))\\n ((1 . -1) (1 . 0) (1 . 1) (2 . -1))\\n ((1 . -1) (1 . 0) (2 . 0) (2 . 1))))\\n\\n(define (I) '(((0 . 1) (0 . 2) (0 . 3) (0 . 4))\\n ((1 . 0) (2 . 0) (3 . 0) (4 . 0))))\\n\\n(define (L) '(((1 . 0) (1 . 1) (1 . 2) (1 . 3))\\n ((1 . 0) (2 . 0) (3 . -1) (3 . 0))\\n ((0 . 1) (0 . 2) (0 . 3) (1 . 3))\\n ((0 . 1) (1 . 0) (2 . 0) (3 . 0))\\n ((0 . 1) (1 . 1) (2 . 1) (3 . 1))\\n ((0 . 1) (0 . 2) (0 . 3) (1 . 0))\\n ((1 . 0) (2 . 0) (3 . 0) (3 . 1))\\n ((1 . -3) (1 . -2) (1 . -1) (1 . 0))))\\n\\n(define (N) '(((0 . 1) (1 . -2) (1 . -1) (1 . 0))\\n ((1 . 0) (1 . 1) (2 . 1) (3 . 1))\\n ((0 . 1) (0 . 2) (1 . -1) (1 . 0))\\n ((1 . 0) (2 . 0) (2 . 1) (3 . 1))\\n ((0 . 1) (1 . 1) (1 . 2) (1 . 3))\\n ((1 . 0) (2 . -1) (2 . 0) (3 . -1))\\n ((0 . 1) (0 . 2) (1 . 2) (1 . 3))\\n ((1 . -1) (1 . 0) (2 . -1) (3 . -1))))\\n\\n(define (P) '(((0 . 1) (1 . 0) (1 . 1) (2 . 1))\\n ((0 . 1) (0 . 2) (1 . 0) (1 . 1))\\n ((1 . 0) (1 . 1) (2 . 0) (2 . 1))\\n ((0 . 1) (1 . -1) (1 . 0) (1 . 1))\\n ((0 . 1) (1 . 0) (1 . 1) (1 . 2))\\n ((1 . -1) (1 . 0) (2 . -1) (2 . 0))\\n ((0 . 1) (0 . 2) (1 . 1) (1 . 2))\\n ((0 . 1) (1 . 0) (1 . 1) (2 . 0))))\\n\\n(define (T) '(((0 . 1) (0 . 2) (1 . 1) (2 . 1))\\n ((1 . -2) (1 . -1) (1 . 0) (2 . 0))\\n ((1 . 0) (2 . -1) (2 . 0) (2 . 1))\\n ((1 . 0) (1 . 1) (1 . 2) (2 . 0))))\\n\\n(define (U) '(((0 . 1) (0 . 2) (1 . 0) (1 . 2))\\n ((0 . 1) (1 . 1) (2 . 0) (2 . 1))\\n ((0 . 2) (1 . 0) (1 . 1) (1 . 2))\\n ((0 . 1) (1 . 0) (2 . 0) (2 . 1))))\\n\\n(define (V) '(((1 . 0) (2 . 0) (2 . 1) (2 . 2))\\n ((0 . 1) (0 . 2) (1 . 0) (2 . 0))\\n ((1 . 0) (2 . -2) (2 . -1) (2 . 0))\\n ((0 . 1) (0 . 2) (1 . 2) (2 . 2))))\\n\\n(define (W) '(((1 . 0) (1 . 1) (2 . 1) (2 . 2))\\n ((1 . -1) (1 . 0) (2 . -2) (2 . -1))\\n ((0 . 1) (1 . 1) (1 . 2) (2 . 2))\\n ((0 . 1) (1 . -1) (1 . 0) (2 . -1))))\\n\\n(define (X) '(((1 . -1) (1 . 0) (1 . 1) (2 . 0))))\\n\\n(define (Y) '(((1 . -2) (1 . -1) (1 . 0) (1 . 1))\\n ((1 . -1) (1 . 0) (2 . 0) (3 . 0))\\n ((0 . 1) (0 . 2) (0 . 3) (1 . 1))\\n ((1 . 0) (2 . 0) (2 . 1) (3 . 0))\\n ((0 . 1) (0 . 2) (0 . 3) (1 . 2))\\n ((1 . 0) (1 . 1) (2 . 0) (3 . 0))\\n ((1 . -1) (1 . 0) (1 . 1) (1 . 2))\\n ((1 . 0) (2 . -1) (2 . 0) (3 . 0))))\\n\\n(define (Z) '(((0 . 1) (1 . 0) (2 . -1) (2 . 0))\\n ((1 . 0) (1 . 1) (1 . 2) (2 . 2))\\n ((0 . 1) (1 . 1) (2 . 1) (2 . 2))\\n ((1 . -2) (1 . -1) (1 . 0) (2 . -2))))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"# 20201028 Raku programming solution\\n\\nmy \\\\F = [ <1 -1 1 0 1 1 2 1>, <0 1 1 -1 1 0 2 0>, <1 0 1 1 1 2 2 1>,\\n <1 0 1 1 2 -1 2 0>, <1 -2 1 -1 1 0 2 -1>, <0 1 1 1 1 2 2 1>,\\n <1 -1 1 0 1 1 2 -1>, <1 -1 1 0 2 0 2 1> ];\\n\\nmy \\\\I = [ <0 1 0 2 0 3 0 4>, <1 0 2 0 3 0 4 0> ];\\n\\nmy \\\\L = [ <1 0 1 1 1 2 1 3>, <1 0 2 0 3 0 3 1>, <0 1 0 2 0 3 1 3>,\\n <0 1 1 0 2 0 3 0>, <0 1 1 1 2 1 3 1>, <0 1 0 2 0 3 1 0>,\\n <1 0 2 0 3 -1 3 0>, <1 -3 1 -2 1 -1 1 0> ];\\n\\nmy \\\\N = [ <0 1 1 -2 1 -1 1 0>, <1 0 1 1 2 1 3 1>, <0 1 0 2 1 -1 1 0>,\\n <1 0 2 0 2 1 3 1>, <0 1 1 1 1 2 1 3>, <1 0 2 -1 2 0 3 -1>,\\n <0 1 0 2 1 2 1 3>, <1 -1 1 0 2 -1 3 -1> ];\\n\\nmy \\\\P = [ <0 1 1 0 1 1 2 1>, <0 1 0 2 1 0 1 1>, <1 0 1 1 2 0 2 1>,\\n <0 1 1 -1 1 0 1 1>, <0 1 1 0 1 1 1 2>, <1 -1 1 0 2 -1 2 0>,\\n <0 1 0 2 1 1 1 2>, <0 1 1 0 1 1 2 0> ];\\n\\nmy \\\\T = [ <0 1 0 2 1 1 2 1>, <1 -2 1 -1 1 0 2 0>,\\n <1 0 2 -1 2 0 2 1>, <1 0 1 1 1 2 2 0> ];\\n\\nmy \\\\U = [ <0 1 0 2 1 0 1 2>, <0 1 1 1 2 0 2 1>,\\n <0 2 1 0 1 1 1 2>, <0 1 1 0 2 0 2 1> ];\\n\\nmy \\\\V = [ <1 0 2 0 2 1 2 2>, <0 1 0 2 1 0 2 0>,\\n <1 0 2 -2 2 -1 2 0>, <0 1 0 2 1 2 2 2> ];\\n\\nmy \\\\W = [ <1 0 1 1 2 1 2 2>, <1 -1 1 0 2 -2 2 -1>,\\n <0 1 1 1 1 2 2 2>, <0 1 1 -1 1 0 2 -1> ];\\n\\nmy \\\\X = [ <1 -1 1 0 1 1 2 0> , ]; # self-ref: reddit.com/r/rakulang/comments/jpys5p/gbi71jt/\\n\\nmy \\\\Y = [ <1 -2 1 -1 1 0 1 1>, <1 -1 1 0 2 0 3 0>, <0 1 0 2 0 3 1 1>,\\n <1 0 2 0 2 1 3 0>, <0 1 0 2 0 3 1 2>, <1 0 1 1 2 0 3 0>,\\n <1 -1 1 0 1 1 1 2>, <1 0 2 -1 2 0 3 0> ];\\n\\nmy \\\\Z = [ <0 1 1 0 2 -1 2 0>, <1 0 1 1 1 2 2 2>,\\n <0 1 1 1 2 1 2 2>, <1 -2 1 -1 1 0 2 -2> ];\\n\\nour @shapes = F, I, L, N, P, T, U, V, W, X, Y, Z ;\\n\\nmy @symbols = \\\"FILNPTUVWXYZ-\\\".comb;\\nmy %symbols = @symbols.pairs;\\nmy $nRows = my $nCols = 8; my $blank = 12;\\nmy @grid = [ [-1 xx $nCols ] xx $nRows ];\\nmy @placed;\\n\\nsub shuffleShapes {\\n my @rand = (0 ..^+@shapes).pick(*);\\n for (0 ..^+@shapes) -> \\\\i {\\n (@shapes[i], @shapes[@rand[i]]) = (@shapes[@rand[i]], @shapes[i]);\\n (@symbols[i], @symbols[@rand[i]]) = (@symbols[@rand[i]], @symbols[i])\\n }\\n}\\n\\nsub solve($pos,$numPlaced) {\\n return True if $numPlaced == +@shapes;\\n\\n my \\\\row = $pos div $nCols;\\n my \\\\col = $pos mod $nCols;\\n\\n return solve($pos + 1, $numPlaced) if @grid[row;col] != -1;\\n\\n for ^+@shapes -> \\\\i {\\n if !@placed[i] {\\n for @shapes[i] -> @orientation {\\n for @orientation -> @o {\\n next if !tryPlaceOrientation(@o, row, col, i);\\n @placed[i] = True;\\n return True if solve($pos + 1, $numPlaced + 1);\\n removeOrientation(@o, row, col);\\n @placed[i] = False;\\n }\\n }\\n }\\n }\\n return False\\n}\\n\\nsub tryPlaceOrientation (@o, $r, $c, $shapeIndex) {\\n\\n loop (my $i = 0; $i < +@o; $i += 2) {\\n my \\\\x = $c + @o[$i + 1];\\n my \\\\y = $r + @o[$i];\\n return False if\\n (x < 0 or x ≥ $nCols or y < 0 or y ≥ $nRows or @grid[y;x] != -1)\\n }\\n\\n @grid[$r;$c] = $shapeIndex;\\n loop ($i = 0; $i < +@o; $i += 2) {\\n @grid[ $r + @o[$i] ; $c + @o[$i + 1] ] = $shapeIndex;\\n }\\n return True\\n}\\n\\nsub removeOrientation(@o, $r, $c) {\\n @grid[$r;$c] = -1;\\n loop (my $i = 0; $i < +@o; $i += 2) {\\n @grid[ $r + @o[$i] ; $c + @o[$i + 1] ] = -1;\\n }\\n}\\n\\nsub PrintResult {\\n my $output;\\n for @grid[*] -> @line {\\n $output ~= \\\"%symbols{$_} \\\" for @line;\\n $output ~= \\\"\\\\n\\\"\\n }\\n if my \\\\Embedded_Marketing_Mode = True {\\n $output .= subst('-', $_.chr) for < 0x24c7 0x24b6 0x24c0 0x24ca >\\n }\\n say $output\\n}\\n\\n#shuffleShapes(); # xkcd.com/221\\n\\nfor ^4 {\\n loop {\\n if @grid[my \\\\R = (^$nRows).roll;my \\\\C = (^$nCols).roll] != $blank\\n { @grid[R;C] = $blank and last }\\n }\\n}\\n\\nPrintResult() if solve 0,0\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"Module Module1\\n\\n Dim symbols As Char() = \\\"XYPFTVNLUZWI█\\\".ToCharArray(),\\n nRows As Integer = 8, nCols As Integer = 8,\\n target As Integer = 12, blank As Integer = 12,\\n grid As Integer()() = New Integer(nRows - 1)() {},\\n placed As Boolean() = New Boolean(target - 1) {},\\n pens As List(Of List(Of Integer())), rand As Random,\\n seeds As Integer() = {291, 292, 293, 295, 297, 329, 330, 332, 333, 335, 378, 586}\\n\\n Sub Main()\\n Unpack(seeds) : rand = New Random() : ShuffleShapes(2)\\n For r As Integer = 0 To nRows - 1\\n grid(r) = Enumerable.Repeat(-1, nCols).ToArray() : Next\\n For i As Integer = 0 To 3\\n Dim rRow, rCol As Integer : Do : rRow = rand.Next(nRows) : rCol = rand.Next(nCols)\\n Loop While grid(rRow)(rCol) = blank : grid(rRow)(rCol) = blank\\n Next\\n If Solve(0, 0) Then\\n PrintResult()\\n Else\\n Console.WriteLine(\\\"no solution for this configuration:\\\") : PrintResult()\\n End If\\n If System.Diagnostics.Debugger.IsAttached Then Console.ReadKey()\\n End Sub\\n\\n Sub ShuffleShapes(count As Integer) ' changes order of the pieces for a more random solution\\n For i As Integer = 0 To count : For j = 0 To pens.Count - 1\\n Dim r As Integer : Do : r = rand.Next(pens.Count) : Loop Until r <> j\\n Dim tmp As List(Of Integer()) = pens(r) : pens(r) = pens(j) : pens(j) = tmp\\n Dim ch As Char = symbols(r) : symbols(r) = symbols(j) : symbols(j) = ch\\n Next : Next\\n End Sub\\n\\n Sub PrintResult() ' display results\\n For Each r As Integer() In grid : For Each i As Integer In r\\n Console.Write(\\\"{0} \\\", If(i < 0, \\\".\\\", symbols(i)))\\n Next : Console.WriteLine() : Next\\n End Sub\\n\\n ' returns first found solution only\\n Function Solve(ByVal pos As Integer, ByVal numPlaced As Integer) As Boolean\\n If numPlaced = target Then Return True\\n Dim row As Integer = pos \\\\ nCols, col As Integer = pos Mod nCols\\n If grid(row)(col) <> -1 Then Return Solve(pos + 1, numPlaced)\\n For i As Integer = 0 To pens.Count - 1 : If Not placed(i) Then\\n For Each orientation As Integer() In pens(i)\\n If Not TPO(orientation, row, col, i) Then Continue For\\n placed(i) = True : If Solve(pos + 1, numPlaced + 1) Then Return True\\n RmvO(orientation, row, col) : placed(i) = False\\n Next : End If : Next : Return False\\n End Function\\n\\n ' removes a placed orientation\\n Sub RmvO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer)\\n grid(row)(col) = -1 : For i As Integer = 0 To ori.Length - 1 Step 2\\n grid(row + ori(i))(col + ori(i + 1)) = -1 : Next\\n End Sub\\n\\n ' checks an orientation, if possible it is placed, else returns false\\n Function TPO(ByVal ori As Integer(), ByVal row As Integer, ByVal col As Integer,\\n ByVal sIdx As Integer) As Boolean\\n For i As Integer = 0 To ori.Length - 1 Step 2\\n Dim x As Integer = col + ori(i + 1), y As Integer = row + ori(i)\\n If x < 0 OrElse x >= nCols OrElse y < 0 OrElse y >= nRows OrElse\\n grid(y)(x) <> -1 Then Return False\\n Next : grid(row)(col) = sIdx\\n For i As Integer = 0 To ori.Length - 1 Step 2\\n grid(row + ori(i))(col + ori(i + 1)) = sIdx\\n Next : Return True\\n End Function\\n\\n '!' the following routines expand the seed values into the 63 orientation arrays.\\n ' source code space savings comparison:\\n ' around 2000 chars for the expansion code, verses about 3000 chars for the integer array defs.\\n ' perhaps not worth the savings?\\n\\n Sub Unpack(sv As Integer()) ' unpacks a list of seed values into a set of 63 rotated pentominoes\\n pens = New List(Of List(Of Integer())) : For Each item In sv\\n Dim Gen As New List(Of Integer()), exi As List(Of Integer) = Expand(item),\\n fx As Integer() = ToP(exi) : Gen.Add(fx) : For i As Integer = 1 To 7\\n If i = 4 Then Mir(exi) Else Rot(exi)\\n fx = ToP(exi) : If Not Gen.Exists(Function(Red) TheSame(Red, fx)) Then Gen.Add(ToP(exi))\\n Next : pens.Add(Gen) : Next\\n End Sub\\n\\n ' expands an integer into a set of directions\\n Function Expand(i As Integer) As List(Of Integer)\\n Expand = {0}.ToList() : For j As Integer = 0 To 3 : Expand.Insert(1, i And 15) : i >>= 4 : Next\\n End Function\\n\\n ' converts a set of directions to an array of y, x pairs\\n Function ToP(p As List(Of Integer)) As Integer()\\n Dim tmp As List(Of Integer) = {0}.ToList() : For Each item As Integer In p.Skip(1)\\n tmp.Add(tmp.Item(item >> 2) + {1, 8, -1, -8}(item And 3)) : Next\\n tmp.Sort() : For i As Integer = tmp.Count - 1 To 0 Step -1 : tmp.Item(i) -= tmp.Item(0) : Next\\n Dim res As New List(Of Integer) : For Each item In tmp.Skip(1)\\n Dim adj = If((item And 7) > 4, 8, 0)\\n res.Add((adj + item) \\\\ 8) : res.Add((item And 7) - adj)\\n Next : Return res.ToArray()\\n End Function\\n\\n ' compares integer arrays for equivalency\\n Function TheSame(a As Integer(), b As Integer()) As Boolean\\n For i As Integer = 0 To a.Count - 1 : If a(i) <> b(i) Then Return False\\n Next : Return True\\n End Function\\n\\n Sub Rot(ByRef p As List(Of Integer)) ' rotates a set of directions by 90 degrees\\n For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or ((p(i) + 1) And 3) : Next\\n End Sub\\n\\n Sub Mir(ByRef p As List(Of Integer)) ' mirrors a set of directions\\n For i As Integer = 0 To p.Count - 1 : p(i) = (p(i) And -4) Or (((p(i) Xor 1) + 1) And 3) : Next\\n End Sub\\n\\nEnd Module\\n\",\n \"language\": \"Visual-Basic-.NET\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./iterate\\\" for Stepped\\n\\nvar F = [\\n [1, -1, 1, 0, 1, 1, 2, 1], [0, 1, 1, -1, 1, 0, 2, 0],\\n [1, 0, 1, 1, 1, 2, 2, 1], [1, 0, 1, 1, 2, -1, 2, 0],\\n [1, -2, 1, -1, 1, 0, 2, -1], [0, 1, 1, 1, 1, 2, 2, 1],\\n [1, -1, 1, 0, 1, 1, 2, -1], [1, -1, 1, 0, 2, 0, 2, 1]\\n]\\n\\nvar I = [\\n [0, 1, 0, 2, 0, 3, 0, 4], [1, 0, 2, 0, 3, 0, 4, 0]\\n]\\n\\nvar L = [\\n [1, 0, 1, 1, 1, 2, 1, 3], [1, 0, 2, 0, 3, -1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 3], [0, 1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 1, 1, 2, 1, 3, 1], [0, 1, 0, 2, 0, 3, 1, 0],\\n [1, 0, 2, 0, 3, 0, 3, 1], [1, -3, 1, -2, 1, -1, 1, 0]\\n]\\n\\nvar N = [\\n [0, 1, 1, -2, 1, -1, 1, 0], [1, 0, 1, 1, 2, 1, 3, 1],\\n [0, 1, 0, 2, 1, -1, 1, 0], [1, 0, 2, 0, 2, 1, 3, 1],\\n [0, 1, 1, 1, 1, 2, 1, 3], [1, 0, 2, -1, 2, 0, 3, -1],\\n [0, 1, 0, 2, 1, 2, 1, 3], [1, -1, 1, 0, 2, -1, 3, -1]\\n]\\n\\nvar P = [\\n [0, 1, 1, 0, 1, 1, 2, 1], [0, 1, 0, 2, 1, 0, 1, 1],\\n [1, 0, 1, 1, 2, 0, 2, 1], [0, 1, 1, -1, 1, 0, 1, 1],\\n [0, 1, 1, 0, 1, 1, 1, 2], [1, -1, 1, 0, 2, -1, 2, 0],\\n [0, 1, 0, 2, 1, 1, 1, 2], [0, 1, 1, 0, 1, 1, 2, 0]\\n]\\n\\nvar T = [\\n [0, 1, 0, 2, 1, 1, 2, 1], [1, -2, 1, -1, 1, 0, 2, 0],\\n [1, 0, 2, -1, 2, 0, 2, 1], [1, 0, 1, 1, 1, 2, 2, 0]\\n]\\n\\nvar U = [\\n [0, 1, 0, 2, 1, 0, 1, 2], [0, 1, 1, 1, 2, 0, 2, 1],\\n [0, 2, 1, 0, 1, 1, 1, 2], [0, 1, 1, 0, 2, 0, 2, 1]\\n]\\n\\nvar V = [\\n [1, 0, 2, 0, 2, 1, 2, 2], [0, 1, 0, 2, 1, 0, 2, 0],\\n [1, 0, 2, -2, 2, -1, 2, 0], [0, 1, 0, 2, 1, 2, 2, 2]\\n]\\n\\nvar W = [\\n [1, 0, 1, 1, 2, 1, 2, 2], [1, -1, 1, 0, 2, -2, 2, -1],\\n [0, 1, 1, 1, 1, 2, 2, 2], [0, 1, 1, -1, 1, 0, 2, -1]\\n]\\n\\nvar X = [[1, -1, 1, 0, 1, 1, 2, 0]]\\n\\nvar Y = [\\n [1, -2, 1, -1, 1, 0, 1, 1], [1, -1, 1, 0, 2, 0, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 1], [1, 0, 2, 0, 2, 1, 3, 0],\\n [0, 1, 0, 2, 0, 3, 1, 2], [1, 0, 1, 1, 2, 0, 3, 0],\\n [1, -1, 1, 0, 1, 1, 1, 2], [1, 0, 2, -1, 2, 0, 3, 0]\\n]\\n\\nvar Z = [\\n [0, 1, 1, 0, 2, -1, 2, 0], [1, 0, 1, 1, 1, 2, 2, 2],\\n [0, 1, 1, 1, 2, 1, 2, 2], [1, -2, 1, -1, 1, 0, 2, -2]\\n]\\n\\nvar shapes = [F, I, L, N, P, T, U, V, W, X, Y, Z]\\nvar rand = Random.new()\\n\\nvar symbols = \\\"FILNPTUVWXYZ-\\\".toList\\n\\nvar nRows = 8\\nvar nCols = 8\\nvar blank = 12\\n\\nvar grid = List.filled(nRows, null)\\nfor (i in 0...nRows) grid[i] = List.filled(nCols, 0)\\n\\nvar placed = List.filled(symbols.count - 1, false)\\n\\nvar tryPlaceOrientation = Fn.new { |o, r, c, shapeIndex|\\n for (i in Stepped.new(0...o.count, 2)) {\\n var x = c + o[i + 1]\\n var y = r + o[i]\\n if (x < 0 || x >= nCols || y < 0 || y >= nRows || grid[y][x] != - 1) return false\\n }\\n grid[r][c] = shapeIndex\\n for (i in Stepped.new(0...o.count, 2)) grid[r + o[i]][c + o[i + 1]] = shapeIndex\\n return true\\n}\\n\\nvar removeOrientation = Fn.new { |o, r, c|\\n grid[r][c] = -1\\n for (i in Stepped.new(0...o.count, 2)) grid[r + o[i]][c + o[i + 1]] = -1\\n}\\n\\nvar solve // recursive\\nsolve = Fn.new { |pos, numPlaced|\\n if (numPlaced == shapes.count) return true\\n var row = (pos / nCols).floor\\n var col = pos % nCols\\n if (grid[row][col] != -1) return solve.call(pos + 1, numPlaced)\\n\\n for (i in 0...shapes.count) {\\n if (!placed[i]) {\\n for (orientation in shapes[i]) {\\n if (!tryPlaceOrientation.call(orientation, row, col, i)) continue\\n placed[i] = true\\n if (solve.call(pos + 1, numPlaced + 1)) return true\\n removeOrientation.call(orientation, row, col)\\n placed[i] = false\\n }\\n }\\n }\\n return false\\n}\\n\\nvar shuffleShapes = Fn.new {\\n var n = shapes.count\\n while (n > 1) {\\n var r = rand.int(n)\\n n = n - 1\\n shapes.swap(r, n)\\n symbols.swap(r, n)\\n }\\n}\\n\\nvar printResult = Fn.new {\\n for (r in grid) {\\n for (i in r) System.write(\\\"%(symbols[i]) \\\")\\n System.print()\\n }\\n}\\n\\nshuffleShapes.call()\\nfor (r in 0...nRows) {\\n for (c in 0...grid[r].count) grid[r][c] = -1\\n}\\nfor (i in 0..3) {\\n var randRow\\n var randCol\\n while (true) {\\n randRow = rand.int(nRows)\\n randCol = rand.int(nCols)\\n if (grid[randRow][randCol] != blank) break\\n }\\n grid[randRow][randCol] = blank\\n}\\nif (solve.call(0, 0)) printResult.call() else System.print(\\\"No solution\\\")\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"fcn printResult\\n { foreach row in (grid){ row.apply(symbols.get).concat(\\\" \\\").println() } }\\nfcn tryPlaceOrientation(o, R,C, shapeIndex){\\n foreach ro,co in (o){ r,c:=R+ro, C+co;\\n if(r<0 or r>=nRows or c<0 or c>=nCols or grid[r][c]!=-1) return(False);\\n }\\n grid[R][C]=shapeIndex; foreach ro,co in (o){ grid[R+ro][C+co]=shapeIndex }\\n True\\n}\\nfcn removeOrientation(o, r,c)\\n { grid[r][c]=-1; foreach ro,co in (o){ grid[r+ro][c+co]=-1 } }\\nfcn solve(pos,numPlaced){\\n if(numPlaced==target) return(True);\\n\\n row,col:=pos.divr(nCols);\\n if(grid[row][col]!=-1) return(solve(pos+1,numPlaced));\\n\\n foreach i in (shapes.len()){\\n if(not placed[i]){\\n\\t foreach orientation in (shapes[i]){\\n\\t if(not tryPlaceOrientation(orientation, row,col, i)) continue;\\n\\t placed[i]=True;\\n\\t if(solve(pos+1,numPlaced+1)) return(True);\\n\\t removeOrientation(orientation, row,col);\\n\\t placed[i]=False;\\n\\t }\\n }\\n }\\n False\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"reg [private] // the shapes are made of groups of 4 (r,c) pairs\\n _F=T(T(1,-1, 1,0, 1,1, 2,1), T(0,1, 1,-1, 1,0, 2,0),\\n T(1,0 , 1,1, 1,2, 2,1), T(1,0, 1,1, 2,-1, 2,0), T(1,-2, 1,-1, 1,0, 2,-1),\\n T(0,1, 1,1, 1,2, 2,1), T(1,-1, 1,0, 1,1, 2,-1), T(1,-1, 1,0, 2,0, 2,1)),\\n _I=T(T(0,1, 0,2, 0,3, 0,4), T(1,0, 2,0, 3,0, 4,0)),\\n _L=T(T(1,0, 1,1, 1,2, 1,3), T(1,0, 2,0, 3,-1, 3,0),\\n T(0,1, 0,2, 0,3, 1,3), T(0,1, 1,0, 2,0, 3,0), T(0,1, 1,1, 2,1, 3,1),\\n T(0,1, 0,2, 0,3, 1,0), T(1,0, 2,0, 3,0, 3,1), T(1,-3, 1,-2, 1,-1, 1,0)),\\n _N=T(T(0,1, 1,-2, 1,-1, 1,0), T(1,0, 1,1, 2,1, 3,1),\\n T(0,1, 0,2, 1,-1, 1,0), T(1,0, 2,0, 2,1, 3,1), T(0,1, 1,1, 1,2, 1,3),\\n T(1,0, 2,-1, 2,0, 3,-1),T(0,1, 0,2, 1,2, 1,3), T(1,-1, 1,0, 2,-1, 3,-1)),\\n _P=T(T(0,1, 1,0, 1,1, 2,1), T(0,1, 0,2, 1,0, 1,1),\\n T(1,0, 1,1, 2,0, 2,1), T(0,1, 1,-1, 1,0, 1,1), T(0,1, 1,0, 1,1, 1,2),\\n T(1,-1, 1,0, 2,-1, 2,0), T(0,1, 0,2, 1,1, 1,2), T(0,1, 1,0, 1,1, 2,0)),\\n _T=T(T(0,1, 0,2, 1,1, 2,1), T(1,-2, 1,-1, 1,0, 2,0),\\n T(1,0, 2,-1, 2,0, 2,1), T(1,0, 1,1, 1,2, 2,0)),\\n _U=T(T(0,1, 0,2, 1,0, 1,2), T(0,1, 1,1, 2,0, 2,1),\\n T(0,2, 1,0, 1,1, 1,2), T(0,1, 1,0, 2,0, 2,1)),\\n _V=T(T(1,0, 2,0, 2,1, 2,2), T(0,1, 0,2, 1,0, 2,0),\\n T(1,0, 2,-2, 2,-1, 2,0), T(0,1, 0,2, 1,2, 2,2)),\\n _W=T(T(1,0, 1,1, 2,1, 2,2), T(1,-1, 1,0, 2,-2, 2,-1),\\n T(0,1, 1,1, 1,2, 2,2), T(0,1, 1,-1, 1,0, 2,-1)),\\n _X=T(T(1,-1, 1,0, 1,1, 2,0)),\\n _Y=T(T(1,-2, 1,-1, 1,0, 1,1), T(1,-1, 1,0, 2,0, 3,0),\\n T(0,1, 0,2, 0,3, 1,1), T(1,0, 2,0, 2,1, 3,0), T(0,1, 0,2, 0,3, 1,2),\\n T(1,0, 1,1, 2,0, 3,0), T(1,-1, 1,0, 1,1, 1,2), T(1,0, 2,-1, 2,0, 3,0)),\\n _Z=T(T(0,1, 1,0, 2,-1, 2,0), T(1,0, 1,1, 1,2, 2,2),\\n T(0,1, 1,1, 2,1, 2,2), T(1,-2, 1,-1, 1,0, 2,-2));\\n\\nconst nRows=8, nCols=8, target=12, blank=12;\\nvar [const]\\n grid = nRows.pump(List(),nCols.pump(List(),-1).copy),\\n placed = target.pump(List(),False),\\n\\n symbols=\\\"FILNPTUVWXYZ-\\\".split(\\\"\\\"),\\n shapes=T(_F,_I,_L,_N,_P,_T,_U,_V,_W,_X,_Y,_Z) // ((a,b, c,d))-->(((a,b),(c,d)))\\n .pump(List,List(\\\"pump\\\",List,List(\\\"pump\\\",List,Void.Read,T.create)));\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"foreach r,c in ([0..nRows-1].walk().shuffle().zip([0..nCols-1].walk().shuffle())[0,4])\\n { grid[r][c]=blank } // make sure 4 unique random spots\\nif(solve(0,0)) printResult();\\nelse\\t println(\\\"No solution\\\");\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Pentomino-tiling"}}},{"rowIdx":1499,"cells":{"solutions":{"kind":"list like","value":[{"code":"---\nfrom: http://rosettacode.org/wiki/Percolation/Bond_percolation\nnote: Percolation Simulations\n","language":"00-META"},{"code":"{{Percolation Simulation}}\nGiven an <math>M \\times N</math> rectangular array of cells numbered <math>\\mathrm{cell}[0..M-1, 0..N-1]</math>, assume <math>M</math> is horizontal and <math>N</math> is downwards. Each <math>\\mathrm{cell}[m, n]</math> is bounded by (horizontal) walls <math>\\mathrm{hwall}[m, n]</math> and <math>\\mathrm{hwall}[m+1, n]</math>; (vertical) walls <math>\\mathrm{vwall}[m, n]</math> and <math>\\mathrm{vwall}[m, n+1]</math>\n\nAssume that the probability of any wall being present is a constant <math>p</math> where\n: <math>0.0 \\le p \\le 1.0</math>\nExcept for the outer horizontal walls at <math>m = 0</math> and <math>m = M</math> which are always present.\n\n;The task:\nSimulate pouring a fluid onto the top surface (<math>n = 0</math>) where the fluid will enter any empty cell it is adjacent to if there is no wall between where it currently is and the cell on the other side of the (missing) wall. \n\nThe fluid does not move beyond the horizontal constraints of the grid.\n\nThe fluid may move “up” within the confines of the grid of cells. If the fluid reaches a bottom cell that has a missing bottom wall then the fluid can be said to 'drip' out the bottom at that point.\n\nGiven <math>p</math> repeat the percolation <math>t</math> times to estimate the proportion of times that the fluid can percolate to the bottom for any given <math>p</math>.\n\nShow how the probability of percolating through the random grid changes with <math>p</math> going from <math>0.0</math> to <math>1.0</math> in <math>0.1</math> increments and with the number of repetitions to estimate the fraction at any given <math>p</math> as <math>t = 100</math>.\n\nUse an <math>M=10, N=10</math> grid of cells for all cases.\n\nOptionally depict fluid successfully percolating through a grid graphically.\n\nShow all output on this page.\n<br><br>\n\n","language":"00-TASK"},{"code":"UInt32 seed = 0\nF nonrandom()\n :seed = 1664525 * :seed + 1013904223\n R Int(:seed >> 16) / Float(FF'FF)\n\nT Grid\n [[Int]] cell, hwall, vwall\n F (cell, hwall, vwall)\n .cell = cell\n .hwall = hwall\n .vwall = vwall\n\nV (M, nn, t) = (10, 10, 100)\n\nT PercolatedException\n (Int, Int) t\n F (t)\n .t = t\n\nV HVF = ([‘ .’, ‘ _’], [‘:’, ‘|’], [‘ ’, ‘#’])\n\nF newgrid(p)\n V hwall = (0 .. :nn).map(n -> (0 .< :M).map(m -> Int(nonrandom() < @@p)))\n V vwall = (0 .< :nn).map(n -> (0 .. :M).map(m -> (I m C (0, :M) {1} E Int(nonrandom() < @@p))))\n V cell = (0 .< :nn).map(n -> (0 .< :M).map(m -> 0))\n R Grid(cell, hwall, vwall)\n\nF pgrid(grid, percolated)\n V (cell, hwall, vwall) = grid\n V (h, v, f) = :HVF\n L(n) 0 .< :nn\n print(‘ ’(0 .< :M).map(m -> @h[@hwall[@n][m]]).join(‘’))\n print(‘#.) ’.format(n % 10)‘’(0 .. :M).map(m -> @v[@vwall[@n][m]]‘’@f[I m < :M {@cell[@n][m]} E 0]).join(‘’)[0 .< (len)-1])\n V n = :nn\n print(‘ ’(0 .< :M).map(m -> @h[@hwall[@n][m]]).join(‘’))\n I percolated != (-1, -1)\n V where = percolated[0]\n print(‘!) ’(‘ ’ * where)‘ ’f[1])\n\nF flood_fill(m, n, &cell, hwall, vwall) -> N\n cell[n][m] = 1\n I n < :nn - 1 & !hwall[n + 1][m] & !cell[n + 1][m]\n flood_fill(m, n + 1, &cell, hwall, vwall)\n E I n == :nn - 1 & !hwall[n + 1][m]\n X.throw PercolatedException((m, n + 1))\n I m & !vwall[n][m] & !cell[n][m - 1]\n flood_fill(m - 1, n, &cell, hwall, vwall)\n I m < :M - 1 & !vwall[n][m + 1] & !cell[n][m + 1]\n flood_fill(m + 1, n, &cell, hwall, vwall)\n I n != 0 & !hwall[n][m] & !cell[n - 1][m]\n flood_fill(m, n - 1, &cell, hwall, vwall)\n\nF pour_on_top(Grid &grid) -> (Int, Int)?\n V n = 0\n X.try\n L(m) 0 .< :M\n I grid.hwall[n][m] == 0\n flood_fill(m, n, &grid.cell, grid.hwall, grid.vwall)\n X.catch PercolatedException ex\n R ex.t\n R N\n\nV sample_printed = 0B\n[Float = Int] pcount\nL(p10) 11\n V p = (10 - p10) / 10.0\n pcount[p] = 0\n L(tries) 0 .< t\n V grid = newgrid(p)\n (Int, Int)? percolated = pour_on_top(&grid)\n I percolated != N\n pcount[p]++\n I !sample_printed\n print(\"\\nSample percolating #. x #. grid\".format(M, nn))\n pgrid(grid, percolated ? (-1, -1))\n sample_printed = 1B\nprint(\"\\n p: Fraction of #. tries that percolate through\".format(t))\n\nL(p, c) sorted(pcount.items())\n print(‘#.1: #.’.format(p, c / Float(t)))\n","language":"11l"},{"code":"#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n// cell states\n#define FILL 1\n#define RWALL 2 // right wall\n#define BWALL 4 // bottom wall\n\ntypedef unsigned int c_t;\n\nc_t *cells, *start, *end;\nint m, n;\n\nvoid make_grid(double p, int x, int y)\n{\n int i, j, thresh = RAND_MAX * p;\n m = x, n = y;\n\n // Allocate two addition rows to avoid checking bounds.\n // Bottom row is also required by drippage\n start = realloc(start, m * (n + 2) * sizeof(c_t));\n cells = start + m;\n\n for (i = 0; i < m; i++)\n start[i] = BWALL | RWALL;\n\n for (i = 0, end = cells; i < y; i++) {\n for (j = x; --j; )\n *end++ = (rand() < thresh ? BWALL : 0)\n |(rand() < thresh ? RWALL : 0);\n *end++ = RWALL | (rand() < thresh ? BWALL: 0);\n }\n memset(end, 0, sizeof(c_t) * m);\n}\n\nvoid show_grid(void)\n{\n int i, j;\n\n for (j = 0; j < m; j++) printf(\"+--\");\n puts(\"+\");\n\n for (i = 0; i <= n; i++) {\n putchar(i == n ? ' ' : '|');\n for (j = 0; j < m; j++) {\n printf((cells[i*m + j] & FILL) ? \"[]\" : \" \");\n putchar((cells[i*m + j] & RWALL) ? '|' : ' ');\n }\n putchar('\\n');\n\n if (i == n) return;\n\n for (j = 0; j < m; j++)\n printf((cells[i*m + j] & BWALL) ? \"+--\" : \"+ \");\n puts(\"+\");\n }\n}\n\nint fill(c_t *p)\n{\n if ((*p & FILL)) return 0;\n *p |= FILL;\n if (p >= end) return 1; // success: reached bottom row\n\n return ( !(p[ 0] & BWALL) && fill(p + m) ) ||\n ( !(p[ 0] & RWALL) && fill(p + 1) ) ||\n ( !(p[-1] & RWALL) && fill(p - 1) ) ||\n ( !(p[-m] & BWALL) && fill(p - m) );\n}\n\nint percolate(void)\n{\n int i;\n for (i = 0; i < m && !fill(cells + i); i++);\n\n return i < m;\n}\n\nint main(void)\n{\n make_grid(.5, 10, 10);\n percolate();\n show_grid();\n\n int cnt, i, p;\n\n puts(\"\\nrunning 10x10 grids 10000 times for each p:\");\n for (p = 1; p < 10; p++) {\n for (cnt = i = 0; i < 10000; i++) {\n make_grid(p / 10., 10, 10);\n cnt += percolate();\n //show_grid(); // don't\n }\n printf(\"p = %3g: %.4f\\n\", p / 10., (double)cnt / i);\n }\n\n free(start);\n return 0;\n}\n","language":"C"},{"code":"#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nclass Grid {\npublic:\n Grid(const double p, const int x, const int y) : m(x), n(y) {\n const int thresh = static_cast<int>(RAND_MAX * p);\n\n // Allocate two addition rows to avoid checking bounds.\n // Bottom row is also required by drippage\n start = new cell[m * (n + 2)];\n cells = start + m;\n for (auto i = 0; i < m; i++) start[i] = RBWALL;\n end = cells;\n for (auto i = 0; i < y; i++) {\n for (auto j = x; --j;)\n *end++ = (rand() < thresh ? BWALL : 0) | (rand() < thresh ? RWALL : 0);\n *end++ = RWALL | (rand() < thresh ? BWALL : 0);\n }\n memset(end, 0u, sizeof(cell) * m);\n }\n\n ~Grid() {\n delete[] start;\n cells = 0;\n start = 0;\n end = 0;\n }\n\n int percolate() const {\n auto i = 0;\n for (; i < m && !fill(cells + i); i++);\n return i < m;\n }\n\n void show() const {\n for (auto j = 0; j < m; j++)\n cout << (\"+-\");\n cout << '+' << endl;\n\n for (auto i = 0; i <= n; i++) {\n cout << (i == n ? ' ' : '|');\n for (auto j = 0; j < m; j++) {\n cout << ((cells[i * m + j] & FILL) ? \"#\" : \" \");\n cout << ((cells[i * m + j] & RWALL) ? '|' : ' ');\n }\n cout << endl;\n\n if (i == n) return;\n\n for (auto j = 0; j < m; j++)\n cout << ((cells[i * m + j] & BWALL) ? \"+-\" : \"+ \");\n cout << '+' << endl;\n }\n }\n\nprivate:\n enum cell_state {\n FILL = 1 << 0,\n RWALL = 1 << 1, // right wall\n BWALL = 1 << 2, // bottom wall\n RBWALL = RWALL | BWALL // right/bottom wall\n };\n\n typedef unsigned int cell;\n\n bool fill(cell* p) const {\n if ((*p & FILL)) return false;\n *p |= FILL;\n if (p >= end) return true; // success: reached bottom row\n\n return (!(p[0] & BWALL) && fill(p + m)) || (!(p[0] & RWALL) && fill(p + 1))\n ||(!(p[-1] & RWALL) && fill(p - 1)) || (!(p[-m] & BWALL) && fill(p - m));\n }\n\n cell* cells;\n cell* start;\n cell* end;\n const int m;\n const int n;\n};\n\nint main() {\n const auto M = 10, N = 10;\n const Grid grid(.5, M, N);\n grid.percolate();\n grid.show();\n\n const auto C = 10000;\n cout << endl << \"running \" << M << \"x\" << N << \" grids \" << C << \" times for each p:\" << endl;\n for (auto p = 1; p < M; p++) {\n auto cnt = 0, i = 0;\n for (; i < C; i++)\n cnt += Grid(p / static_cast<double>(M), M, N).percolate();\n cout << \"p = \" << p / static_cast<double>(M) << \": \" << static_cast<double>(cnt) / i << endl;\n }\n\n return EXIT_SUCCESS;\n}\n","language":"C++"},{"code":"import std.stdio, std.random, std.array, std.range, std.algorithm;\n\nstruct Grid {\n // Not enforced by runtime and type system:\n // a Cell must contain only the flags bits.\n alias Cell = uint;\n\n enum : Cell { // Cell states (bit flags).\n empty = 0,\n filled = 1,\n rightWall = 2,\n bottomWall = 4\n }\n\n const size_t nc, nr;\n Cell[] cells;\n\n this(in size_t nRows, in size_t nCols) pure nothrow {\n nr = nRows;\n nc = nCols;\n\n // Allocate two addition rows to avoid checking bounds.\n // Bottom row is also required by drippage.\n cells = new Cell[nc * (nr + 2)];\n }\n\n void initialize(in double prob, ref Xorshift rng) {\n cells[0 .. nc] = bottomWall | rightWall; // First row.\n\n uint pos = nc;\n foreach (immutable r; 1 .. nr + 1) {\n foreach (immutable c; 1 .. nc)\n cells[pos++] = (uniform01 < prob ?bottomWall : empty) |\n (uniform01 < prob ? rightWall : empty);\n cells[pos++] = rightWall |\n (uniform01 < prob ? bottomWall : empty);\n }\n\n cells[$ - nc .. $] = empty; // Last row.\n }\n\n bool percolate() pure nothrow @nogc {\n bool fill(in size_t i) pure nothrow @nogc {\n if (cells[i] & filled)\n return false;\n\n cells[i] |= filled;\n\n if (i >= cells.length - nc)\n return true; // Success: reached bottom row.\n\n return (!(cells[i] & bottomWall) && fill(i + nc)) ||\n (!(cells[i] & rightWall) && fill(i + 1)) ||\n (!(cells[i - 1] & rightWall) && fill(i - 1)) ||\n (!(cells[i - nc] & bottomWall) && fill(i - nc));\n }\n\n return iota(nc, nc + nc).any!fill;\n }\n\n void show() const {\n writeln(\"+-\".replicate(nc), '+');\n\n foreach (immutable r; 1 .. nr + 2) {\n write(r == nr + 1 ? ' ' : '|');\n foreach (immutable c; 0 .. nc) {\n immutable cell = cells[r * nc + c];\n write((cell & filled) ? (r <= nr ? '#' : 'X') : ' ');\n write((cell & rightWall) ? '|' : ' ');\n }\n writeln;\n\n if (r == nr + 1)\n return;\n\n foreach (immutable c; 0 .. nc)\n write((cells[r * nc + c] & bottomWall) ? \"+-\" : \"+ \");\n '+'.writeln;\n }\n }\n}\n\nvoid main() {\n enum uint nr = 10, nc = 10; // N. rows and columns of the grid.\n enum uint nTries = 10_000; // N. simulations for each probability.\n enum uint nStepsProb = 10; // N. steps of probability.\n\n auto rng = Xorshift(2);\n auto g = Grid(nr, nc);\n g.initialize(0.5, rng);\n g.percolate;\n g.show;\n\n writefln(\"\\nRunning %dx%d grids %d times for each p:\",\n nr, nc, nTries);\n foreach (immutable p; 0 .. nStepsProb) {\n immutable probability = p / double(nStepsProb);\n uint nPercolated = 0;\n foreach (immutable i; 0 .. nTries) {\n g.initialize(probability, rng);\n nPercolated += g.percolate;\n }\n writefln(\"p = %0.2f: %.4f\",\n probability, nPercolated / double(nTries));\n }\n}\n","language":"D"},{"code":"package main\n\nimport (\n\t\"fmt\"\n\t\"math/rand\"\n\t\"strings\"\n\t\"time\"\n)\n\nfunc main() {\n\tconst (\n\t\tm, n = 10, 10\n\t\tt = 1000\n\t\tminp, maxp, Δp = 0.1, 0.99, 0.1\n\t)\n\n\t// Purposely don't seed for a repeatable example grid:\n\tg := NewGrid(.5, m, n)\n\tg.Percolate()\n\tfmt.Println(g)\n\n\trand.Seed(time.Now().UnixNano()) // could pick a better seed\n\tfor p := float64(minp); p < maxp; p += Δp {\n\t\tcount := 0\n\t\tfor i := 0; i < t; i++ {\n\t\t\tg := NewGrid(p, m, n)\n\t\t\tif g.Percolate() {\n\t\t\t\tcount++\n\t\t\t}\n\t\t}\n\t\tfmt.Printf(\"p=%.2f, %.3f\\n\", p, float64(count)/t)\n\t}\n}\n\ntype cell struct {\n\tfull bool\n\tright, down bool // true if open to the right (x+1) or down (y+1)\n}\n\ntype grid struct {\n\tcell [][]cell // row first, i.e. [y][x]\n}\n\nfunc NewGrid(p float64, xsize, ysize int) *grid {\n\tg := &grid{cell: make([][]cell, ysize)}\n\tfor y := range g.cell {\n\t\tg.cell[y] = make([]cell, xsize)\n\t\tfor x := 0; x < xsize-1; x++ {\n\t\t\tif rand.Float64() > p {\n\t\t\t\tg.cell[y][x].right = true\n\t\t\t}\n\t\t\tif rand.Float64() > p {\n\t\t\t\tg.cell[y][x].down = true\n\t\t\t}\n\t\t}\n\t\tif rand.Float64() > p {\n\t\t\tg.cell[y][xsize-1].down = true\n\t\t}\n\t}\n\treturn g\n}\n\nvar (\n\tfull = map[bool]string{false: \" \", true: \"**\"}\n\thopen = map[bool]string{false: \"--\", true: \" \"}\n\tvopen = map[bool]string{false: \"|\", true: \" \"}\n)\n\nfunc (g *grid) String() string {\n\tvar buf strings.Builder\n\t// Don't really need to call Grow but it helps avoid multiple\n\t// reallocations if the size is large.\n\tbuf.Grow((len(g.cell) + 1) * len(g.cell[0]) * 7)\n\n\tfor _ = range g.cell[0] {\n\t\tbuf.WriteString(\"+\")\n\t\tbuf.WriteString(hopen[false])\n\t}\n\tbuf.WriteString(\"+\\n\")\n\tfor y := range g.cell {\n\t\tbuf.WriteString(vopen[false])\n\t\tfor x := range g.cell[y] {\n\t\t\tbuf.WriteString(full[g.cell[y][x].full])\n\t\t\tbuf.WriteString(vopen[g.cell[y][x].right])\n\t\t}\n\t\tbuf.WriteByte('\\n')\n\t\tfor x := range g.cell[y] {\n\t\t\tbuf.WriteString(\"+\")\n\t\t\tbuf.WriteString(hopen[g.cell[y][x].down])\n\t\t}\n\t\tbuf.WriteString(\"+\\n\")\n\t}\n\tly := len(g.cell) - 1\n\tfor x := range g.cell[ly] {\n\t\tbuf.WriteByte(' ')\n\t\tbuf.WriteString(full[g.cell[ly][x].down && g.cell[ly][x].full])\n\t}\n\treturn buf.String()\n}\n\nfunc (g *grid) Percolate() bool {\n\tfor x := range g.cell[0] {\n\t\tif g.fill(x, 0) {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc (g *grid) fill(x, y int) bool {\n\tif y >= len(g.cell) {\n\t\treturn true // Out the bottom\n\t}\n\tif g.cell[y][x].full {\n\t\treturn false // Allready filled\n\t}\n\tg.cell[y][x].full = true\n\n\tif g.cell[y][x].down && g.fill(x, y+1) {\n\t\treturn true\n\t}\n\tif g.cell[y][x].right && g.fill(x+1, y) {\n\t\treturn true\n\t}\n\tif x > 0 && g.cell[y][x-1].right && g.fill(x-1, y) {\n\t\treturn true\n\t}\n\tif y > 0 && g.cell[y-1][x].down && g.fill(x, y-1) {\n\t\treturn true\n\t}\n\treturn false\n}\n","language":"Go"},{"code":"{-# LANGUAGE OverloadedStrings #-}\nimport Control.Monad\nimport Control.Monad.Random\nimport Data.Array.Unboxed\nimport Data.List\nimport Formatting\n\ndata Field = Field { f :: UArray (Int, Int) Char\n , hWall :: UArray (Int, Int) Bool\n , vWall :: UArray (Int, Int) Bool\n }\n\n-- Start percolating some seepage through a field.\n-- Recurse to continue percolation with new seepage.\npercolateR :: [(Int, Int)] -> Field -> (Field, [(Int,Int)])\npercolateR [] (Field f h v) = (Field f h v, [])\npercolateR seep (Field f h v) =\n let ((xLo,yLo),(xHi,yHi)) = bounds f\n validSeep = filter (\\p@(x,y) -> x >= xLo\n && x <= xHi\n && y >= yLo\n && y <= yHi\n && f!p == ' ') $ nub $ sort seep\n\n north (x,y) = if v ! (x ,y ) then [] else [(x ,y-1)]\n south (x,y) = if v ! (x ,y+1) then [] else [(x ,y+1)]\n west (x,y) = if h ! (x ,y ) then [] else [(x-1,y )]\n east (x,y) = if h ! (x+1,y ) then [] else [(x+1,y )]\n neighbors (x,y) = north(x,y) ++ south(x,y) ++ west(x,y) ++ east(x,y)\n\n in percolateR\n (concatMap neighbors validSeep)\n (Field (f // map (\\p -> (p,'.')) validSeep) h v)\n\n-- Percolate a field; Return the percolated field.\npercolate :: Field -> Field\npercolate start@(Field f _ _) =\n let ((_,_),(xHi,_)) = bounds f\n (final, _) = percolateR [(x,0) | x <- [0..xHi]] start\n in final\n\n-- Generate a random field.\ninitField :: Int -> Int -> Double -> Rand StdGen Field\ninitField width height threshold = do\n let f = listArray ((0,0), (width-1, height-1)) $ repeat ' '\n\n hrnd <- fmap (<threshold) <$> getRandoms\n let h0 = listArray ((0,0),(width, height-1)) hrnd\n h1 = h0 // [((0,y), True) | y <- [0..height-1]] -- close left\n h2 = h1 // [((width,y), True) | y <- [0..height-1]] -- close right\n\n vrnd <- fmap (<threshold) <$> getRandoms\n let v0 = listArray ((0,0),(width-1, height)) vrnd\n v1 = v0 // [((x,0), True) | x <- [0..width-1]] -- close top\n\n return $ Field f h2 v1\n\n-- Assess whether or not percolation reached bottom of field.\nleaks :: Field -> [Bool]\nleaks (Field f _ v) =\n let ((xLo,_),(xHi,yHi)) = bounds f\n in [f!(x,yHi)=='.' && not (v!(x,yHi+1)) | x <- [xLo..xHi]]\n\n-- Run test once; Return bool indicating success or failure.\noneTest :: Int -> Int -> Double -> Rand StdGen Bool\noneTest width height threshold =\n or.leaks.percolate <$> initField width height threshold\n\n-- Run test multple times; Return the number of tests that pass.\nmultiTest :: Int -> Int -> Int -> Double -> Rand StdGen Double\nmultiTest testCount width height threshold = do\n results <- replicateM testCount $ oneTest width height threshold\n let leakyCount = length $ filter id results\n return $ fromIntegral leakyCount / fromIntegral testCount\n\n-- Helper function for display\nalternate :: [a] -> [a] -> [a]\nalternate [] _ = []\nalternate (a:as) bs = a : alternate bs as\n\n-- Display a field with walls and leaks.\nshowField :: Field -> IO ()\nshowField field@(Field a h v) = do\n let ((xLo,yLo),(xHi,yHi)) = bounds a\n fLines = [ [ a!(x,y) | x <- [xLo..xHi]] | y <- [yLo..yHi]]\n hLines = [ [ if h!(x,y) then '|' else ' ' | x <- [xLo..xHi+1]] | y <- [yLo..yHi]]\n vLines = [ [ if v!(x,y) then '-' else ' ' | x <- [xLo..xHi]] | y <- [yLo..yHi+1]]\n lattice = [ [ '+' | x <- [xLo..xHi+1]] | y <- [yLo..yHi+1]]\n\n hDrawn = zipWith alternate hLines fLines\n vDrawn = zipWith alternate lattice vLines\n mapM_ putStrLn $ alternate vDrawn hDrawn\n\n let leakLine = [ if l then '.' else ' ' | l <- leaks field]\n putStrLn $ alternate (repeat ' ') leakLine\n\nmain :: IO ()\nmain = do\n g <- getStdGen\n let threshold = 0.45\n (startField, g2) = runRand (initField 10 10 threshold) g\n\n putStrLn (\"Unpercolated field with \" ++ show threshold ++ \" threshold.\")\n putStrLn \"\"\n showField startField\n\n putStrLn \"\"\n putStrLn \"Same field after percolation.\"\n putStrLn \"\"\n showField $ percolate startField\n\n let testCount = 10000\n densityCount = 10\n putStrLn \"\"\n putStrLn (\"Results of running percolation test \" ++ show testCount ++ \" times with thresholds ranging from 0/\" ++ show densityCount ++ \" to \" ++ show densityCount ++ \"/\" ++ show densityCount ++ \" .\")\n let densities = [0..densityCount]\n let tests = sequence [multiTest testCount 10 10 v\n | density <- densities,\n let v = fromIntegral density / fromIntegral densityCount ]\n let results = zip densities (evalRand tests g2)\n mapM_ print [format (\"p=\" % int % \"/\" % int % \" -> \" % fixed 4) density densityCount x | (density,x) <- results]\n","language":"Haskell"},{"code":"import java.util.Arrays;\nimport java.util.concurrent.ThreadLocalRandom;\n\npublic final class PercolationBond {\n\n\tpublic static void main(String[] aArgs) {\n\t\tSystem.out.println(\"Sample percolation with a \" + COL_COUNT + \" x \" + ROW_COUNT + \" grid:\");\n\t\tmakeGrid(0.5);\n\t\tpercolate();\n\t\tshowGrid();\n\t\t\n\t\tSystem.out.println(\"Using 10,000 repetitions for each probability p:\");\n\t for ( int p = 1; p <= 9; p++ ) {\n\t int percolationCount = 0;\n\t double probability = p / 10.0;\n\t for ( int i = 0; i < 10_000; i++ ) {\n\t makeGrid(probability);\n\t if ( percolate() ) {\n\t \tpercolationCount += 1;\n\t }\n\t }\n\t final double percolationProportion = (double) percolationCount / 10_000;\n\t System.out.println(String.format(\"%s%.1f%s%.4f\", \"p = \", probability, \": \", percolationProportion));\n\t }\n\t}\n\t\n\tprivate static void makeGrid(double aProbability) {\t\n\t Arrays.fill(grid, 0);\n\t for ( int i = 0; i < COL_COUNT; i++ ) {\n\t \tgrid[i] = LOWER_WALL | RIGHT_WALL;\n\t }\n\n\t endOfRow = COL_COUNT;\n\t for ( int i = 0; i < ROW_COUNT; i++ ) {\n\t for ( int j = COL_COUNT - 1; j >= 1; j-- ) {\t \t\n\t \tfinal boolean chance1 = RANDOM.nextDouble() < aProbability;\n\t \tfinal boolean chance2 = RANDOM.nextDouble() < aProbability;\n\t grid[endOfRow++] = ( chance1 ? LOWER_WALL : 0 ) | ( chance2 ? RIGHT_WALL : 0 );\n\t }\n\t final boolean chance3 = RANDOM.nextDouble() < aProbability;\n\t grid[endOfRow++] = RIGHT_WALL | ( chance3 ? LOWER_WALL : 0 );\n\t }\n\t}\n\t\n\tprivate static void showGrid() {\n\t\tfor ( int j = 0; j < COL_COUNT; j++ ) {\n\t \tSystem.out.print(\"+--\");\n\t }\n\t System.out.println(\"+\");\n\t\t\n\t\tfor ( int i = 0; i < ROW_COUNT; i++ ) {\n\t\t\tSystem.out.print(\"|\");\n\t for ( int j = 0; j < COL_COUNT; j++ ) {\n\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & FILL ) != 0 ) ? \"[]\" : \" \" );\n\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & RIGHT_WALL ) != 0 ) ? \"|\" : \" \" );\n\t }\n\t System.out.println();\n\t\t\n\t for ( int j = 0; j < COL_COUNT; j++ ) {\n\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & LOWER_WALL) != 0 ) ? \"+--\" : \"+ \" );\n\t }\n\t System.out.println(\"+\");\n\t\t}\n\t\t\n\t\tSystem.out.print(\" \");\n\t\tfor ( int j = 0; j < COL_COUNT; j++ ) {\n System.out.print( ( ( grid[ROW_COUNT * COL_COUNT + j + COL_COUNT] & FILL ) != 0 ) ? \"[]\" : \" \" );\n System.out.print( ( ( grid[ROW_COUNT * COL_COUNT + j + COL_COUNT] & RIGHT_WALL ) != 0 ) ? \"|\" : \" \" );\n }\n System.out.println(System.lineSeparator());\n\t}\n\t\n\tprivate static boolean fill(int aGridIndex) {\n\t if ( ( grid[aGridIndex] & FILL ) != 0 ) {\n\t \treturn false;\n\t }\t\n\t grid[aGridIndex] |= FILL;\n\t\n\t if ( aGridIndex >= endOfRow ) {\n\t \treturn true;\n\t }\t\n\t return ( ( ( grid[aGridIndex] & LOWER_WALL ) == 0 ) && fill(aGridIndex + COL_COUNT) ) ||\n\t ( ( ( grid[aGridIndex] & RIGHT_WALL ) == 0 ) && fill(aGridIndex + 1) ) ||\n\t ( ( ( grid[aGridIndex - 1] & RIGHT_WALL ) == 0 ) && fill(aGridIndex - 1) ) ||\n\t ( ( ( grid[aGridIndex - COL_COUNT] & LOWER_WALL ) == 0 ) && fill(aGridIndex - COL_COUNT) );\n\t}\n\n\tprivate static boolean percolate() {\n\t\tint i = 0;\n\t while ( i < COL_COUNT && ! fill(COL_COUNT + i) ) {\n\t \ti++;\n\t }\n\t return i < COL_COUNT;\n\t}\n\t\t\n\tprivate static final int ROW_COUNT = 10;\n\tprivate static final int COL_COUNT = 10;\n\t\n\tprivate static int endOfRow = COL_COUNT;\n\tprivate static int[] grid = new int[COL_COUNT * ( ROW_COUNT + 2 )];\n\n\tprivate static final int FILL = 1;\n\tprivate static final int RIGHT_WALL = 2;\n\tprivate static final int LOWER_WALL = 4;\n\n\tprivate static final ThreadLocalRandom RANDOM = ThreadLocalRandom.current();\n\t\n}\n","language":"Java"},{"code":"using Printf, Distributions\n\nstruct Grid\n cells::BitArray{2}\n hwall::BitArray{2}\n vwall::BitArray{2}\nend\nfunction Grid(p::AbstractFloat, m::Integer=10, n::Integer=10)\n cells = fill(false, m, n)\n hwall = rand(Bernoulli(p), m + 1, n)\n vwall = rand(Bernoulli(p), m, n + 1)\n vwall[:, 1] = true\n vwall[:, end] = true\n return Grid(cells, hwall, vwall)\nend\n\nfunction Base.show(io::IO, g::Grid)\n H = (\" .\", \" _\")\n V = (\":\", \"|\")\n C = (\" \", \"#\")\n ind = findfirst(g.cells[end, :] .& .!g.hwall[end, :])\n percolated = !iszero(ind)\n println(io, \"$(size(g.cells, 1))×$(size(g.cells, 2)) $(percolated ? \"Percolated\" : \"Not percolated\") grid\")\n for r in 1:size(g.cells, 1)\n println(io, \" \", join(H[w+1] for w in g.hwall[r, :]))\n println(io, \" $(r % 10)) \", join(V[w+1] * C[c+1] for (w, c) in zip(g.vwall[r, :], g.cells[r, :])))\n end\n println(io, \" \", join(H[w+1] for w in g.hwall[end, :]))\n if percolated\n println(io, \" !) \", \" \" ^ (ind - 1), '#')\n end\nend\n\nfunction floodfill!(m::Integer, n::Integer, cells::AbstractMatrix{<:Integer},\n hwall::AbstractMatrix{<:Integer}, vwall::AbstractMatrix{<:Integer})\n # fill cells\n cells[m, n] = true\n percolated = false\n # bottom\n if m < size(cells, 1) && !hwall[m+1, n] && !cells[m+1, n]\n percolated = percolated || floodfill!(m + 1, n, cells, hwall, vwall)\n # The Bottom\n elseif m == size(cells, 1) && !hwall[m+1, n]\n return true\n end\n # left\n if n > 1 && !vwall[m, n] && !cells[m, n-1]\n percolated = percolated || floodfill!(m, n - 1, cells, hwall, vwall)\n end\n # right\n if n < size(cells, 2) && !vwall[m, n+1] && !cells[m, n+1]\n percolated = percolated || floodfill!(m, n + 1, cells, hwall, vwall)\n end\n # top\n if m > 1 && !hwall[m, n] && !cells[m-1, n]\n percolated = percolated || floodfill!(m - 1, n, cells, hwall, vwall)\n end\n return percolated\nend\nfunction pourontop!(g::Grid)\n m, n = 1, 1\n percolated = false\n while !percolated && n ≤ size(g.cells, 2)\n percolated = !g.hwall[m, n] && floodfill!(m, n, g.cells, g.hwall, g.vwall)\n n += 1\n end\n return percolated\nend\n\nfunction main(probs, nrep::Integer=1000)\n sampleprinted = false\n pcount = zeros(Int, size(probs))\n for (i, p) in enumerate(probs), _ in 1:nrep\n g = Grid(p)\n percolated = pourontop!(g)\n if percolated\n pcount[i] += 1\n if !sampleprinted\n println(g)\n sampleprinted = true\n end\n end\n end\n return pcount ./ nrep\nend\n\nprobs = collect(10:-1:0) ./ 10\npercprobs = main(probs)\n\nprintln(\"Fraction of 1000 tries that percolate through:\")\nfor (pr, pp) in zip(probs, percprobs)\n @printf(\"\\tp = %.3f ⇒ freq. = %5.3f\\n\", pr, pp)\nend\n","language":"Julia"},{"code":"// version 1.2.10\n\nimport java.util.Random\n\nval rand = Random()\nconst val RAND_MAX = 32767\n\n// cell states\nconst val FILL = 1\nconst val RWALL = 2 // right wall\nconst val BWALL = 4 // bottom wall\n\nval x = 10\nval y = 10\nvar grid = IntArray(x * (y + 2))\nvar cells = 0\nvar end = 0\nvar m = 0\nvar n = 0\n\nfun makeGrid(p: Double) {\n val thresh = (p * RAND_MAX).toInt()\n m = x\n n = y\n grid.fill(0) // clears grid\n for (i in 0 until m) grid[i] = BWALL or RWALL\n cells = m\n end = m\n for (i in 0 until y) {\n for (j in x - 1 downTo 1) {\n val r1 = rand.nextInt(RAND_MAX + 1)\n val r2 = rand.nextInt(RAND_MAX + 1)\n grid[end++] = (if (r1 < thresh) BWALL else 0) or\n (if (r2 < thresh) RWALL else 0)\n }\n val r3 = rand.nextInt(RAND_MAX + 1)\n grid[end++] = RWALL or (if (r3 < thresh) BWALL else 0)\n }\n}\n\nfun showGrid() {\n for (j in 0 until m) print(\"+--\")\n println(\"+\")\n\n for (i in 0..n) {\n print(if (i == n) \" \" else \"|\")\n for (j in 0 until m) {\n print(if ((grid[i * m + j + cells] and FILL) != 0) \"[]\" else \" \")\n print(if ((grid[i * m + j + cells] and RWALL) != 0) \"|\" else \" \")\n }\n println()\n if (i == n) return\n for (j in 0 until m) {\n print(if ((grid[i * m + j + cells] and BWALL) != 0) \"+--\" else \"+ \")\n }\n println(\"+\")\n }\n}\n\nfun fill(p: Int): Boolean {\n if ((grid[p] and FILL) != 0) return false\n grid[p] = grid[p] or FILL\n if (p >= end) return true // success: reached bottom row\n return (((grid[p + 0] and BWALL) == 0) && fill(p + m)) ||\n (((grid[p + 0] and RWALL) == 0) && fill(p + 1)) ||\n (((grid[p - 1] and RWALL) == 0) && fill(p - 1)) ||\n (((grid[p - m] and BWALL) == 0) && fill(p - m))\n}\n\nfun percolate(): Boolean {\n var i = 0\n while (i < m && !fill(cells + i)) i++\n return i < m\n}\n\nfun main(args: Array<String>) {\n makeGrid(0.5)\n percolate()\n showGrid()\n\n println(\"\\nrunning $x x $y grids 10,000 times for each p:\")\n for (p in 1..9) {\n var cnt = 0\n val pp = p / 10.0\n for (i in 0 until 10_000) {\n makeGrid(pp)\n if (percolate()) cnt++\n }\n println(\"p = %3g: %.4f\".format(pp, cnt.toDouble() / 10_000))\n }\n}\n","language":"Kotlin"},{"code":"import random, sequtils, strformat, tables\n\ntype\n\n Cell = object\n full: bool\n right, down: bool # True if open to the right (x+1) or down (y+1).\n\n Grid = seq[seq[Cell]] # Row first, i.e. [y][x].\n\n\nproc newGrid(p: float; xsize, ysize: Positive): Grid =\n\n result = newSeqWith(ysize, newSeq[Cell](xsize))\n for row in result.mitems:\n for x in 0..(xsize - 2):\n if rand(1.0) > p: row[x].right = true\n if rand(1.0) > p: row[x].down = true\n if rand(1.0) > p: row[xsize - 1].down = true\n\n\nconst\n Full = {false: \" \", true: \"()\"}.toTable\n HOpen = {false: \"--\", true: \" \"}.toTable\n VOpen = {false: \"|\", true: \" \"}.toTable\n\nproc `$`(grid: Grid): string =\n\n # Preallocate result to avoid multiple reallocations.\n result = newStringOfCap((grid.len + 1) * grid[0].len * 7)\n\n for _ in 0..grid[0].high:\n result.add '+'\n result.add HOpen[false]\n result.add \"+\\n\"\n\n for row in grid:\n result.add VOpen[false]\n for cell in row:\n result.add Full[cell.full]\n result.add VOpen[cell.right]\n result.add '\\n'\n for cell in row:\n result.add '+'\n result.add HOpen[cell.down]\n result.add \"+\\n\"\n\n for cell in grid[^1]:\n result.add ' '\n result.add Full[cell.down and cell.full]\n\n\nproc fill(grid: var Grid; x, y: Natural): bool =\n\n if y >= grid.len: return true # Out the bottom.\n if grid[y][x].full: return false # Already filled.\n grid[y][x].full = true\n\n if grid[y][x].down and grid.fill(x, y + 1): return true\n if grid[y][x].right and grid.fill(x + 1, y): return true\n if x > 0 and grid[y][x - 1].right and grid.fill(x - 1, y): return true\n if y > 0 and grid[y - 1][x].down and grid.fill(x, y - 1): return true\n\n\nproc percolate(grid: var Grid): bool =\n for x in 0..grid[0].high:\n if grid.fill(x, 0): return true\n\n\nconst\n M = 10\n N = 10\n T = 1000\n MinP = 0.1\n MaxP = 0.99\n ΔP = 0.1\n\n# Purposely don't seed for a repeatable example grid.\nvar grid = newGrid(0.4, M, N)\ndiscard grid.percolate()\necho grid\necho \"\"\n\nrandomize()\nvar p = MinP\nwhile p < MaxP:\n var count = 0\n for _ in 1..T:\n var grid = newGrid(p, M, N)\n if grid.percolate(): inc count\n echo &\"p = {p:.2f}: {count / T:.3f}\"\n p += ΔP\n","language":"Nim"},{"code":"my @bond;\nmy $grid = 10;\nmy $water = '▒';\n$D{$_} = $i++ for qw<DeadEnd Up Right Down Left>;\n\nsub percolate {\n generate(shift || 0.6);\n fill(my $x = 1,my $y = 0);\n my @stack;\n\n while () {\n if (my $dir = direction($x,$y)) {\n push @stack, [$x,$y];\n ($x,$y) = move($dir, $x, $y)\n } else {\n return 0 unless @stack;\n ($x,$y) = @{pop @stack}\n }\n return 1 if $y == $#bond;\n }\n}\n\nsub direction {\n my($x, $y) = @_;\n return $D{Down} if $bond[$y+1][$x ] =~ / /;\n return $D{Left} if $bond[$y ][$x-1] =~ / /;\n return $D{Right} if $bond[$y ][$x+1] =~ / /;\n return $D{Up} if defined $bond[$y-1][$x ] && $bond[$y-1][$x] =~ / /;\n return $D{DeadEnd}\n}\n\nsub move {\n my($dir,$x,$y) = @_;\n fill( $x,--$y), fill( $x,--$y) if $dir == $D{Up};\n fill( $x,++$y), fill( $x,++$y) if $dir == $D{Down};\n fill(--$x, $y), fill(--$x, $y) if $dir == $D{Left};\n fill(++$x, $y), fill(++$x, $y) if $dir == $D{Right};\n $x, $y\n}\n\nsub fill {\n my($x, $y) = @_;\n $bond[$y][$x] =~ s/ /$water/g\n}\n\nsub generate {\n our($prob) = shift || 0.5;\n @bond = ();\n our $sp = ' ';\n push @bond, ['│', ($sp, ' ') x ($grid-1), $sp, '│'],\n ['├', hx('┬'), h(), '┤'];\n push @bond, ['│', vx( ), $sp, '│'],\n ['├', hx('┼'), h(), '┤'] for 1..$grid-1;\n push @bond, ['│', vx( ), $sp, '│'],\n ['├', hx('┴'), h(), '┤'],\n ['│', ($sp, ' ') x ($grid-1), $sp, '│'];\n\n sub hx { my($c)=@_; my @l; push @l, (h(),$c) for 1..$grid-1; return @l; }\n sub vx { my @l; push @l, $sp, v() for 1..$grid-1; return @l; }\n sub h { rand() < $prob ? $sp : '───' }\n sub v { rand() < $prob ? ' ' : '│' }\n}\n\nprint \"Sample percolation at .6\\n\";\npercolate(.6);\nfor my $row (@bond) {\n my $line = '';\n $line .= join '', $_ for @$row;\n print \"$line\\n\";\n}\n\nmy $tests = 100;\nprint \"Doing $tests trials at each porosity:\\n\";\nmy @table;\nfor my $p (1 .. 10) {\n $p = $p/10;\n my $total = 0;\n $total += percolate($p) for 1..$tests;\n printf \"p = %0.1f: %0.2f\\n\", $p, $total / $tests\n}\n","language":"Perl"},{"code":"(phixonline)-->\n <span style=\"color: #008080;\">with</span> <span style=\"color: #008080;\">javascript_semantics</span>\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">w</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">h</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">10</span>\n\n <span style=\"color: #004080;\">sequence</span> <span style=\"color: #000000;\">wall</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"+\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\"---\"</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">cell</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #008000;\">\"|\"</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">w</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">\" \"</span><span style=\"color: #0000FF;\">)&</span><span style=\"color: #008000;\">\"\\n\"</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">grid</span>\n\n <span style=\"color: #008080;\">procedure</span> <span style=\"color: #000000;\">new_grid</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">atom</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">grid</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">split</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #7060A8;\">repeat</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">wall</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">h</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #000000;\">cell</span><span style=\"color: #0000FF;\">),</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000080;font-style:italic;\">-- now knock down some walls</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">jstart</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">5</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #7060A8;\">mod</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">)*</span><span style=\"color: #000000;\">3</span><span style=\"color: #0000FF;\">,</span>\n <span style=\"color: #000000;\">jlimit</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">])-</span><span style=\"color: #000000;\">3</span>\n <span style=\"color: #000080;font-style:italic;\">-- (ie 2..38 on odd lines, 5..37 on even)</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">jstart</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">jlimit</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #7060A8;\">rnd</span><span style=\"color: #0000FF;\">()></span><span style=\"color: #000000;\">p</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">i</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">..</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">\" \"</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">procedure</span>\n\n <span style=\"color: #008080;\">function</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">,</span> <span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">3</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">])-</span><span style=\"color: #000000;\">2</span> <span style=\"color: #008080;\">by</span> <span style=\"color: #000000;\">4</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">j</span><span style=\"color: #0000FF;\">)</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #008080;\">elsif</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">]</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #008000;\">'*'</span>\n <span style=\"color: #008080;\">if</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #7060A8;\">length</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">)-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">6</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\"><</span><span style=\"color: #000000;\">36</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">2</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">+</span><span style=\"color: #000000;\">4</span><span style=\"color: #0000FF;\">))</span>\n <span style=\"color: #008080;\">or</span> <span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">></span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">[</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">][</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">]=</span><span style=\"color: #008000;\">' '</span> <span style=\"color: #008080;\">and</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">x</span><span style=\"color: #0000FF;\">-</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">y</span><span style=\"color: #0000FF;\">))</span> <span style=\"color: #008080;\">then</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">true</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">if</span>\n <span style=\"color: #008080;\">return</span> <span style=\"color: #004600;\">false</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">function</span>\n\n <span style=\"color: #008080;\">constant</span> <span style=\"color: #000000;\">LIM</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1000</span>\n\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">0</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">10</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #004080;\">integer</span> <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">0</span>\n <span style=\"color: #008080;\">for</span> <span style=\"color: #000000;\">t</span><span style=\"color: #0000FF;\">=</span><span style=\"color: #000000;\">1</span> <span style=\"color: #008080;\">to</span> <span style=\"color: #000000;\">LIM</span> <span style=\"color: #008080;\">do</span>\n <span style=\"color: #000000;\">new_grid</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">count</span> <span style=\"color: #0000FF;\">+=</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"p=%.1f: %5.3f\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #000000;\">p</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">10</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #000000;\">count</span><span style=\"color: #0000FF;\">/</span><span style=\"color: #000000;\">LIM</span><span style=\"color: #0000FF;\">})</span>\n <span style=\"color: #008080;\">end</span> <span style=\"color: #008080;\">for</span>\n <span style=\"color: #7060A8;\">puts</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"sample grid for p=0.6:\\n\"</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #000000;\">new_grid</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">0.6</span><span style=\"color: #0000FF;\">)</span>\n <span style=\"color: #0000FF;\">{}</span> <span style=\"color: #0000FF;\">=</span> <span style=\"color: #000000;\">percolate</span><span style=\"color: #0000FF;\">()</span>\n <span style=\"color: #7060A8;\">printf</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">1</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">\"%s\\n\"</span><span style=\"color: #0000FF;\">,{</span><span style=\"color: #7060A8;\">join</span><span style=\"color: #0000FF;\">(</span><span style=\"color: #000000;\">grid</span><span style=\"color: #0000FF;\">,</span><span style=\"color: #008000;\">'\\n'</span><span style=\"color: #0000FF;\">)})</span>\n<!--\n","language":"Phix"},{"code":"from collections import namedtuple\nfrom random import random\nfrom pprint import pprint as pp\n\nGrid = namedtuple('Grid', 'cell, hwall, vwall')\n\nM, N, t = 10, 10, 100\n\nclass PercolatedException(Exception): pass\n\nHVF = [(' .', ' _'), (':', '|'), (' ', '#')] # Horiz, vert, fill chars\n\ndef newgrid(p):\n hwall = [[int(random() < p) for m in range(M)]\n for n in range(N+1)]\n vwall = [[(1 if m in (0, M) else int(random() < p)) for m in range(M+1)]\n for n in range(N)]\n cell = [[0 for m in range(M)]\n for n in range(N)]\n return Grid(cell, hwall, vwall)\n\ndef pgrid(grid, percolated=None):\n cell, hwall, vwall = grid\n h, v, f = HVF\n for n in range(N):\n print(' ' + ''.join(h[hwall[n][m]] for m in range(M)))\n print('%i) ' % (n % 10) + ''.join(v[vwall[n][m]] + f[cell[n][m] if m < M else 0]\n for m in range(M+1))[:-1])\n n = N\n print(' ' + ''.join(h[hwall[n][m]] for m in range(M)))\n if percolated:\n where = percolated.args[0][0]\n print('!) ' + ' ' * where + ' ' + f[1])\n\ndef pour_on_top(grid):\n cell, hwall, vwall = grid\n n = 0\n try:\n for m in range(M):\n if not hwall[n][m]:\n flood_fill(m, n, cell, hwall, vwall)\n except PercolatedException as ex:\n return ex\n return None\n\n\ndef flood_fill(m, n, cell, hwall, vwall):\n # fill cell\n cell[n][m] = 1\n # bottom\n if n < N - 1 and not hwall[n + 1][m] and not cell[n+1][m]:\n flood_fill(m, n+1, cell, hwall, vwall)\n # THE bottom\n elif n == N - 1 and not hwall[n + 1][m]:\n raise PercolatedException((m, n+1))\n # left\n if m and not vwall[n][m] and not cell[n][m - 1]:\n flood_fill(m-1, n, cell, hwall, vwall)\n # right\n if m < M - 1 and not vwall[n][m + 1] and not cell[n][m + 1]:\n flood_fill(m+1, n, cell, hwall, vwall)\n # top\n if n and not hwall[n][m] and not cell[n-1][m]:\n flood_fill(m, n-1, cell, hwall, vwall)\n\nif __name__ == '__main__':\n sample_printed = False\n pcount = {}\n for p10 in range(11):\n p = (10 - p10) / 10.0 # count down so sample print is interesting\n pcount[p] = 0\n for tries in range(t):\n grid = newgrid(p)\n percolated = pour_on_top(grid)\n if percolated:\n pcount[p] += 1\n if not sample_printed:\n print('\\nSample percolating %i x %i grid' % (M, N))\n pgrid(grid, percolated)\n sample_printed = True\n print('\\n p: Fraction of %i tries that percolate through' % t )\n\n pp({p:c/float(t) for p, c in pcount.items()})\n","language":"Python"},{"code":"#lang racket\n\n(define has-left-wall? (lambda (x) (bitwise-bit-set? x 0)))\n(define has-right-wall? (lambda (x) (bitwise-bit-set? x 1)))\n(define has-top-wall? (lambda (x) (bitwise-bit-set? x 2)))\n(define has-bottom-wall? (lambda (x) (bitwise-bit-set? x 3)))\n(define has-fluid? (lambda (x) (bitwise-bit-set? x 4)))\n\n(define (walls->cell l? r? t? b?)\n (+ (if l? 1 0) (if r? 2 0) (if t? 4 0) (if b? 8 0)))\n\n(define (bonded-percol-grid M N p)\n (define rv (make-vector (* M N)))\n (for* ((idx (in-range (* M N))))\n (define left-wall?\n (or (zero? (modulo idx M))\n (has-right-wall? (vector-ref rv (sub1 idx)))))\n (define right-wall?\n (or (= (modulo idx M) (sub1 M))\n (< (random) p)))\n (define top-wall?\n (if (< idx M) (< (random) p)\n (has-bottom-wall? (vector-ref rv (- idx M)))))\n (define bottom-wall? (< (random) p))\n (define cell-value\n (walls->cell left-wall? right-wall? top-wall? bottom-wall?))\n (vector-set! rv idx cell-value))\n rv)\n\n(define (display-percol-grid M . vs)\n (define N (/ (vector-length (car vs)) M))\n (define-syntax-rule (tab-eol m)\n (when (= m (sub1 M)) (printf \"\\t\")))\n (for ((n N))\n (for* ((v vs) (m M))\n (when (zero? m) (printf \"+\"))\n (printf\n (match (vector-ref v (+ (* n M) m))\n ((? has-top-wall?) \"-+\")\n ((? has-fluid?) \"#+\")\n (else \".+\")))\n (tab-eol m))\n (newline)\n (for* ((v vs) (m M))\n (when (zero? m) (printf \"|\"))\n (printf\n (match (vector-ref v (+ (* n M) m))\n ((and (? has-fluid?) (? has-right-wall?)) \"#|\")\n ((? has-right-wall?) \".|\")\n ((? has-fluid?) \"##\")\n (else \"..\")))\n (tab-eol m))\n (newline))\n (for* ((v vs) (m M))\n (when (zero? m) (printf \"+\"))\n (printf\n (match (vector-ref v (+ (* (sub1 M) M) m))\n ((? has-bottom-wall?) \"-+\")\n ((? has-fluid?) \"#+\")\n (else \".+\")))\n (tab-eol m))\n (newline))\n\n(define (find-bonded-grid-t/b-path M v)\n (define N (/ (vector-length v) M))\n\n (define (flood-cell idx)\n (cond\n [(= (quotient idx M) N) #t] ; wootiments!\n [(has-fluid? (vector-ref v idx)) #f] ; been here\n [else (define cell (vector-ref v idx))\n (vector-set! v idx (bitwise-ior cell 16))\n (or (and (not (has-bottom-wall? cell)) (flood-cell (+ idx M)))\n (and (not (has-left-wall? cell)) (flood-cell (- idx 1)))\n (and (not (has-right-wall? cell)) (flood-cell (+ idx 1)))\n (and (not (has-top-wall? cell))\n (>= idx M) ; not top row\n (flood-cell (- idx M))))]))\n\n (for/first ((m (in-range M))\n #:unless (has-top-wall? (vector-ref v m))\n #:when (flood-cell m)) #t))\n\n(define t (make-parameter 1000))\n(define (experiment p)\n (/ (for*/sum ((sample (in-range (t)))\n (v (in-value (bonded-percol-grid 10 10 p)))\n #:when (find-bonded-grid-t/b-path 10 v)) 1)\n (t)))\n\n(define (main)\n (for ((tenths (in-range 0 (add1 10))))\n (define p (/ tenths 10))\n (define e (experiment p))\n (printf \"proportion of grids that percolate p=~a : ~a (~a)~%\"\n p e (real->decimal-string e 5))))\n\n(module+ test\n (define (make/display/flood/display-bonded-grid M N p attempts (atmpt 1))\n (define v (bonded-percol-grid M N p))\n (define v+ (vector-copy v))\n (cond [(or (find-bonded-grid-t/b-path M v+) (= attempts 0))\n (define v* (vector-copy v+))\n (define (flood-bonded-grid)\n (when (find-bonded-grid-t/b-path M v*)\n (flood-bonded-grid)))\n (flood-bonded-grid)\n (display-percol-grid M v v+ v*)\n (printf \"After ~a attempt(s)~%~%\" atmpt)]\n [else\n (make/display/flood/display-bonded-grid\n M N p (sub1 attempts) (add1 atmpt))]))\n\n (make/display/flood/display-bonded-grid 10 10 0 20)\n (make/display/flood/display-bonded-grid 10 10 .25 20)\n (make/display/flood/display-bonded-grid 10 10 .50 20)\n (make/display/flood/display-bonded-grid 10 10 .75 20000))\n","language":"Racket"},{"code":"my @bond;\nmy $grid = 10;\nmy $geom = $grid - 1;\nmy $water = '▒';\n\nenum Direction <DeadEnd Up Right Down Left>;\n\nsay 'Sample percolation at .6';\npercolate .6;\n.join.say for @bond;\nsay \"\\n\";\n\nmy $tests = 100;\nsay \"Doing $tests trials at each porosity:\";\nfor .1, .2 ... 1 -> $p {\n printf \"p = %0.1f: %0.2f\\n\", $p, (sum percolate($p) xx $tests) / $tests\n}\n\nsub percolate ( $prob ) {\n generate $prob;\n my @stack;\n my $current = [1;0];\n $current.&fill;\n\n loop {\n if my $dir = direction( $current ) {\n @stack.push: $current;\n $current = move $dir, $current\n }\n else {\n return False unless @stack;\n $current = @stack.pop\n }\n return True if $current[1] == +@bond - 1\n }\n\n sub direction( [$x, $y] ) {\n ( Down if @bond[$y + 1][$x].contains: ' ' ) ||\n ( Left if @bond[$y][$x - 1].contains: ' ' ) ||\n ( Right if @bond[$y][$x + 1].contains: ' ' ) ||\n ( Up if @bond[$y - 1][$x].defined && @bond[$y - 1][$x].contains: ' ' ) ||\n DeadEnd\n }\n\n sub move ( $dir, @cur ) {\n my ( $x, $y ) = @cur;\n given $dir {\n when Up { [$x,--$y].&fill xx 2 }\n when Down { [$x,++$y].&fill xx 2 }\n when Left { [--$x,$y].&fill xx 2 }\n when Right { [++$x,$y].&fill xx 2 }\n }\n [$x, $y]\n }\n\n sub fill ( [$x, $y] ) { @bond[$y;$x].=subst(' ', $water, :g) }\n}\n\nsub generate ( $prob = .5 ) {\n @bond = ();\n my $sp = ' ';\n append @bond, [flat '│', ($sp, ' ') xx $geom, $sp, '│'],\n [flat '├', (h(), '┬') xx $geom, h(), '┤'];\n append @bond, [flat '│', ($sp, v()) xx $geom, $sp, '│'],\n [flat '├', (h(), '┼') xx $geom, h(), '┤'] for ^$geom;\n append @bond, [flat '│', ($sp, v()) xx $geom, $sp, '│'],\n [flat '├', (h(), '┴') xx $geom, h(), '┤'],\n [flat '│', ($sp, ' ') xx $geom, $sp, '│'];\n\n sub h () { rand < $prob ?? $sp !! '───' }\n sub v () { rand < $prob ?? ' ' !! '│' }\n}\n","language":"Raku"},{"code":"let randMax = 32767.0\nlet filled = 1\nlet rightWall = 2\nlet bottomWall = 4\n\nfinal class Percolate {\n let height: Int\n let width: Int\n\n private var grid: [Int]\n private var end: Int\n\n init(height: Int, width: Int) {\n self.height = height\n self.width = width\n self.end = width\n self.grid = [Int](repeating: 0, count: width * (height + 2))\n }\n\n private func fill(at p: Int) -> Bool {\n guard grid[p] & filled == 0 else { return false }\n\n grid[p] |= filled\n\n guard p < end else { return true }\n\n return (((grid[p + 0] & bottomWall) == 0) && fill(at: p + width)) ||\n (((grid[p + 0] & rightWall) == 0) && fill(at: p + 1)) ||\n (((grid[p - 1] & rightWall) == 0) && fill(at: p - 1)) ||\n (((grid[p - width] & bottomWall) == 0) && fill(at: p - width))\n }\n\n func makeGrid(porosity p: Double) {\n grid = [Int](repeating: 0, count: width * (height + 2))\n end = width\n\n let thresh = Int(randMax * p)\n\n for i in 0..<width {\n grid[i] = bottomWall | rightWall\n }\n\n for _ in 0..<height {\n for _ in stride(from: width - 1, through: 1, by: -1) {\n let r1 = Int.random(in: 0..<Int(randMax)+1)\n let r2 = Int.random(in: 0..<Int(randMax)+1)\n\n grid[end] = (r1 < thresh ? bottomWall : 0) | (r2 < thresh ? rightWall : 0)\n\n end += 1\n }\n\n let r3 = Int.random(in: 0..<Int(randMax)+1)\n\n grid[end] = rightWall | (r3 < thresh ? bottomWall : 0)\n\n end += 1\n }\n }\n\n @discardableResult\n func percolate() -> Bool {\n var i = 0\n\n while i < width && !fill(at: width + i) {\n i += 1\n }\n\n return i < width\n }\n\n func showGrid() {\n for _ in 0..<width {\n print(\"+--\", terminator: \"\")\n }\n\n print(\"+\")\n\n for i in 0..<height {\n print(i == height ? \" \" : \"|\", terminator: \"\")\n\n for j in 0..<width {\n print(grid[i * width + j + width] & filled != 0 ? \"[]\" : \" \", terminator: \"\")\n print(grid[i * width + j + width] & rightWall != 0 ? \"|\" : \" \", terminator: \"\")\n }\n\n print()\n\n guard i != height else { return }\n\n for j in 0..<width {\n print(grid[i * width + j + width] & bottomWall != 0 ? \"+--\" : \"+ \", terminator: \"\")\n }\n\n print(\"+\")\n }\n }\n}\n\nlet p = Percolate(height: 10, width: 10)\n\np.makeGrid(porosity: 0.5)\np.percolate()\np.showGrid()\n\nprint(\"Running \\(p.height) x \\(p.width) grid 10,000 times for each porosity\")\n\nfor factor in 1...10 {\n var count = 0\n let porosity = Double(factor) / 10.0\n\n for _ in 0..<10_000 {\n p.makeGrid(porosity: porosity)\n\n if p.percolate() {\n count += 1\n }\n }\n\n print(\"p = \\(porosity): \\(Double(count) / 10_000.0)\")\n}\n","language":"Swift"},{"code":"package require Tcl 8.6\n\n# Structure the bond percolation system as a class\noo::class create BondPercolation {\n variable hwall vwall cells M N\n constructor {width height probability} {\n\tset M $height\n\tset N $width\n\tfor {set i 0} {$i <= $height} {incr i} {\n\t for {set j 0;set walls {}} {$j < $width} {incr j} {\n\t\tlappend walls [expr {rand() < $probability}]\n\t }\n\t lappend hwall $walls\n\t}\n\tfor {set i 0} {$i <= $height} {incr i} {\n\t for {set j 0;set walls {}} {$j <= $width} {incr j} {\n\t\tlappend walls [expr {$j==0 || $j==$width || rand() < $probability}]\n\t }\n\t lappend vwall $walls\n\t}\n\tset cells [lrepeat $height [lrepeat $width 0]]\n }\n\n method print {{percolated \"\"}} {\n\tset nw [string length $M]\n\tset grid $cells\n\tif {$percolated ne \"\"} {\n\t lappend grid [lrepeat $N 0]\n\t lset grid end $percolated 1\n\t}\n\tforeach hws $hwall vws [lrange $vwall 0 end-1] r $grid {\n\t incr row\n\t puts -nonewline [string repeat \" \" [expr {$nw+2}]]\n\t foreach w $hws {\n\t\tputs -nonewline [if {$w} {subst \"+-\"} {subst \"+ \"}]\n\t }\n\t puts \"+\"\n\t puts -nonewline [format \"%-*s\" [expr {$nw+2}] [expr {\n\t\t$row>$M ? $percolated eq \"\" ? \" \" : \">\" : \"$row)\"\n\t }]]\n\t foreach v $vws c $r {\n\t\tputs -nonewline [if {$v==1} {subst \"|\"} {subst \" \"}]\n\t\tputs -nonewline [if {$c==1} {subst \"#\"} {subst \" \"}]\n\t }\n\t puts \"\"\n\t}\n }\n\n method percolate {} {\n\ttry {\n\t for {set i 0} {$i < $N} {incr i} {\n\t\tif {![lindex $hwall 0 $i]} {\n\t\t my FloodFill $i 0\n\t\t}\n\t }\n\t return \"\"\n\t} trap PERCOLATED n {\n\t return $n\n\t}\n }\n method FloodFill {x y} {\n\t# fill cell\n\tlset cells $y $x 1\n\t# bottom\n\tif {![lindex $hwall [expr {$y+1}] $x]} {\n\t if {$y == $N-1} {\n\t\t# THE bottom\n\t\tthrow PERCOLATED $x\n\t }\n\t if {$y < $N-1 && ![lindex $cells [expr {$y+1}] $x]} {\n\t\tmy FloodFill $x [expr {$y+1}]\n\t }\n\t}\n\t# left\n\tif {![lindex $vwall $y $x] && ![lindex $cells $y [expr {$x-1}]]} {\n\t my FloodFill [expr {$x-1}] $y\n\t}\n\t# right\n\tif {![lindex $vwall $y [expr {$x+1}]] && ![lindex $cells $y [expr {$x+1}]]} {\n\t my FloodFill [expr {$x+1}] $y\n\t}\n\t# top\n\tif {$y>0 && ![lindex $hwall $y $x] && ![lindex $cells [expr {$y-1}] $x]} {\n\t my FloodFill $x [expr {$y-1}]\n\t}\n }\n}\n\n# Demonstrate one run\nputs \"Sample percolation, 10x10 p=0.5\"\nBondPercolation create bp 10 10 0.5\nbp print [bp percolate]\nbp destroy\nputs \"\"\n\n# Collect some aggregate statistics\napply {{} {\n puts \"Percentage of tries that percolate, varying p\"\n set tries 100\n for {set pint 0} {$pint <= 10} {incr pint} {\n\tset p [expr {$pint * 0.1}]\n\tset tot 0\n\tfor {set i 0} {$i < $tries} {incr i} {\n\t set bp [BondPercolation new 10 10 $p]\n\t if {[$bp percolate] ne \"\"} {\n\t\tincr tot\n\t }\n\t $bp destroy\n\t}\n\tputs [format \"p=%.2f: %2.1f%%\" $p [expr {$tot*100./$tries}]]\n }\n}}\n","language":"Tcl"},{"code":"import \"random\" for Random\nimport \"./fmt\" for Fmt\n\nvar rand = Random.new()\nvar RAND_MAX = 32767\n\n// cell states\nvar FILL = 1\nvar RWALL = 2 // right wall\nvar BWALL = 4 // bottom wall\n\nvar x = 10\nvar y = 10\nvar grid = List.filled(x * (y + 2), 0)\nvar cells = 0\nvar end = 0\nvar m = 0\nvar n = 0\n\nvar makeGrid = Fn.new { |p|\n var thresh = (p * RAND_MAX).truncate\n m = x\n n = y\n for (i in 0...grid.count) grid[i] = 0 // clears grid\n for (i in 0...m) grid[i] = BWALL | RWALL\n cells = m\n end = m\n for (i in 0...y) {\n for (j in x - 1..1) {\n var r1 = rand.int(RAND_MAX + 1)\n var r2 = rand.int(RAND_MAX + 1)\n grid[end] = ((r1 < thresh) ? BWALL : 0) |\n ((r2 < thresh) ? RWALL : 0)\n end = end + 1\n }\n var r3 = rand.int(RAND_MAX + 1)\n grid[end] = RWALL | ((r3 < thresh) ? BWALL : 0)\n end = end + 1\n }\n}\n\nvar showGrid = Fn.new {\n for (j in 0...m) System.write(\"+--\")\n System.print(\"+\")\n\n for (i in 0..n) {\n System.write((i == n) ? \" \" : \"|\")\n for (j in 0...m) {\n System.write(((grid[i * m + j + cells] & FILL) != 0) ? \"[]\" : \" \")\n System.write(((grid[i * m + j + cells] & RWALL) != 0) ? \"|\" : \" \")\n }\n System.print()\n if (i == n) return\n for (j in 0...m) {\n System.write(((grid[i * m + j + cells] & BWALL) != 0) ? \"+--\" : \"+ \")\n }\n System.print(\"+\")\n }\n}\n\nvar fill // recursive\nfill = Fn.new { |p|\n if ((grid[p] & FILL) != 0) return false\n grid[p] = grid[p] | FILL\n if (p >= end) return true // success: reached bottom row\n return (((grid[p + 0] & BWALL) == 0) && fill.call(p + m)) ||\n (((grid[p + 0] & RWALL) == 0) && fill.call(p + 1)) ||\n (((grid[p - 1] & RWALL) == 0) && fill.call(p - 1)) ||\n (((grid[p - m] & BWALL) == 0) && fill.call(p - m))\n}\n\nvar percolate = Fn.new {\n var i = 0\n while (i < m && !fill.call(cells + i)) i = i + 1\n return i < m\n}\n\nmakeGrid.call(0.5)\npercolate.call()\nshowGrid.call()\n\nSystem.print(\"\\nRunning %(x) x %(y) grids 10,000 times for each p:\")\nfor (p in 1..9) {\n var cnt = 0\n var pp = p / 10\n for (i in 0...10000) {\n makeGrid.call(pp)\n if (percolate.call()) cnt = cnt + 1\n }\n Fmt.print(\"p = $3g: $.4f\", pp, cnt / 10000)\n}\n","language":"Wren"},{"code":"// cell states\nconst FILLED=1; // and odd\nconst RWALL =2; // right wall\nconst BWALL =4; // bottom wall\nfcn P(p,wall){ (0.0).random(1)<p and wall or 0 }\n\nfcn makeGrid(m,n,p){\n // Allocate two addition rows to avoid checking bounds.\n // Bottom row is also required by drippage\n grid:=Data(m*(n+2));\n do(m){ grid.write(BWALL + RWALL); } // grid is topped with walls\n do(n){\n do(m-1){ grid.write( P(p,BWALL) + P(p,RWALL) ) }\n grid.write(RWALL + P(p,BWALL)); // right border is all right wall, as is left border\n }\n do(m){ grid.write(0); } // for drips off the bottom of grid\n grid\n}\nfcn show(grid,m,n){ n+=1;\n println(\"+--\"*m,\"+\");\n foreach i in ([1..n]){ y:=i*m;\n print(i==n and \" \" or \"|\"); // bottom row is special, otherwise always have left wall\n foreach j in (m){ c:=grid[y + j];\n print(c.bitAnd(FILLED) and \"**\" or \" \", c.bitAnd(RWALL)and\"|\"or\" \");\n }\n println();\n\n if(i==n) return(); // nothing under the bottom row\n\n foreach j in (m){ print((grid[y + j].bitAnd(BWALL)) and \"+--\" or \"+ \"); }\n println(\"+\");\n }\n}\nfcn fill(grid,x,m){\n if(grid[x].isOdd) return(False); // aka .bitAnd(FILLED) aka already been here\n grid[x]+=FILLED;\n if(x+m>=grid.len()) return(True); // success: reached bottom row\n return(( not grid[x] .bitAnd(BWALL) and fill(grid,x + m,m) ) or // down\n ( not grid[x] .bitAnd(RWALL) and fill(grid,x + 1,m) ) or // right\n ( not grid[x - 1].bitAnd(RWALL) and fill(grid,x - 1,m) ) or // left\n ( not grid[x - m].bitAnd(BWALL) and fill(grid,x - m,m) )); // up\n}\nfcn percolate(grid,m){\n i:=0; while(i<m and not fill(grid,i+m,m)){ i+=1; } // pour juice on top row\n return(i<m); // percolated through the grid?\n}\n","language":"Zkl"},{"code":"grid:=makeGrid(10,10,0.40);\nprintln(\"Did liquid percolate: \",percolate(grid,10)); show(grid,10,10);\n\nprintln(\"Running 10,000 tests for each case:\");\nforeach p in ([0.0 .. 1.0, 0.1]){\n cnt:=0.0; do(10000){ cnt+=percolate(makeGrid(10,10,p),10); }\n \"p=%.1f: %.4f\".fmt(p, cnt/10000).println();\n}\n","language":"Zkl"}],"string":"[\n {\n \"code\": \"---\\nfrom: http://rosettacode.org/wiki/Percolation/Bond_percolation\\nnote: Percolation Simulations\\n\",\n \"language\": \"00-META\"\n },\n {\n \"code\": \"{{Percolation Simulation}}\\nGiven an <math>M \\\\times N</math> rectangular array of cells numbered <math>\\\\mathrm{cell}[0..M-1, 0..N-1]</math>, assume <math>M</math> is horizontal and <math>N</math> is downwards. Each <math>\\\\mathrm{cell}[m, n]</math> is bounded by (horizontal) walls <math>\\\\mathrm{hwall}[m, n]</math> and <math>\\\\mathrm{hwall}[m+1, n]</math>; (vertical) walls <math>\\\\mathrm{vwall}[m, n]</math> and <math>\\\\mathrm{vwall}[m, n+1]</math>\\n\\nAssume that the probability of any wall being present is a constant <math>p</math> where\\n: <math>0.0 \\\\le p \\\\le 1.0</math>\\nExcept for the outer horizontal walls at <math>m = 0</math> and <math>m = M</math> which are always present.\\n\\n;The task:\\nSimulate pouring a fluid onto the top surface (<math>n = 0</math>) where the fluid will enter any empty cell it is adjacent to if there is no wall between where it currently is and the cell on the other side of the (missing) wall. \\n\\nThe fluid does not move beyond the horizontal constraints of the grid.\\n\\nThe fluid may move “up” within the confines of the grid of cells. If the fluid reaches a bottom cell that has a missing bottom wall then the fluid can be said to 'drip' out the bottom at that point.\\n\\nGiven <math>p</math> repeat the percolation <math>t</math> times to estimate the proportion of times that the fluid can percolate to the bottom for any given <math>p</math>.\\n\\nShow how the probability of percolating through the random grid changes with <math>p</math> going from <math>0.0</math> to <math>1.0</math> in <math>0.1</math> increments and with the number of repetitions to estimate the fraction at any given <math>p</math> as <math>t = 100</math>.\\n\\nUse an <math>M=10, N=10</math> grid of cells for all cases.\\n\\nOptionally depict fluid successfully percolating through a grid graphically.\\n\\nShow all output on this page.\\n<br><br>\\n\\n\",\n \"language\": \"00-TASK\"\n },\n {\n \"code\": \"UInt32 seed = 0\\nF nonrandom()\\n :seed = 1664525 * :seed + 1013904223\\n R Int(:seed >> 16) / Float(FF'FF)\\n\\nT Grid\\n [[Int]] cell, hwall, vwall\\n F (cell, hwall, vwall)\\n .cell = cell\\n .hwall = hwall\\n .vwall = vwall\\n\\nV (M, nn, t) = (10, 10, 100)\\n\\nT PercolatedException\\n (Int, Int) t\\n F (t)\\n .t = t\\n\\nV HVF = ([‘ .’, ‘ _’], [‘:’, ‘|’], [‘ ’, ‘#’])\\n\\nF newgrid(p)\\n V hwall = (0 .. :nn).map(n -> (0 .< :M).map(m -> Int(nonrandom() < @@p)))\\n V vwall = (0 .< :nn).map(n -> (0 .. :M).map(m -> (I m C (0, :M) {1} E Int(nonrandom() < @@p))))\\n V cell = (0 .< :nn).map(n -> (0 .< :M).map(m -> 0))\\n R Grid(cell, hwall, vwall)\\n\\nF pgrid(grid, percolated)\\n V (cell, hwall, vwall) = grid\\n V (h, v, f) = :HVF\\n L(n) 0 .< :nn\\n print(‘ ’(0 .< :M).map(m -> @h[@hwall[@n][m]]).join(‘’))\\n print(‘#.) ’.format(n % 10)‘’(0 .. :M).map(m -> @v[@vwall[@n][m]]‘’@f[I m < :M {@cell[@n][m]} E 0]).join(‘’)[0 .< (len)-1])\\n V n = :nn\\n print(‘ ’(0 .< :M).map(m -> @h[@hwall[@n][m]]).join(‘’))\\n I percolated != (-1, -1)\\n V where = percolated[0]\\n print(‘!) ’(‘ ’ * where)‘ ’f[1])\\n\\nF flood_fill(m, n, &cell, hwall, vwall) -> N\\n cell[n][m] = 1\\n I n < :nn - 1 & !hwall[n + 1][m] & !cell[n + 1][m]\\n flood_fill(m, n + 1, &cell, hwall, vwall)\\n E I n == :nn - 1 & !hwall[n + 1][m]\\n X.throw PercolatedException((m, n + 1))\\n I m & !vwall[n][m] & !cell[n][m - 1]\\n flood_fill(m - 1, n, &cell, hwall, vwall)\\n I m < :M - 1 & !vwall[n][m + 1] & !cell[n][m + 1]\\n flood_fill(m + 1, n, &cell, hwall, vwall)\\n I n != 0 & !hwall[n][m] & !cell[n - 1][m]\\n flood_fill(m, n - 1, &cell, hwall, vwall)\\n\\nF pour_on_top(Grid &grid) -> (Int, Int)?\\n V n = 0\\n X.try\\n L(m) 0 .< :M\\n I grid.hwall[n][m] == 0\\n flood_fill(m, n, &grid.cell, grid.hwall, grid.vwall)\\n X.catch PercolatedException ex\\n R ex.t\\n R N\\n\\nV sample_printed = 0B\\n[Float = Int] pcount\\nL(p10) 11\\n V p = (10 - p10) / 10.0\\n pcount[p] = 0\\n L(tries) 0 .< t\\n V grid = newgrid(p)\\n (Int, Int)? percolated = pour_on_top(&grid)\\n I percolated != N\\n pcount[p]++\\n I !sample_printed\\n print(\\\"\\\\nSample percolating #. x #. grid\\\".format(M, nn))\\n pgrid(grid, percolated ? (-1, -1))\\n sample_printed = 1B\\nprint(\\\"\\\\n p: Fraction of #. tries that percolate through\\\".format(t))\\n\\nL(p, c) sorted(pcount.items())\\n print(‘#.1: #.’.format(p, c / Float(t)))\\n\",\n \"language\": \"11l\"\n },\n {\n \"code\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n\\n// cell states\\n#define FILL 1\\n#define RWALL 2 // right wall\\n#define BWALL 4 // bottom wall\\n\\ntypedef unsigned int c_t;\\n\\nc_t *cells, *start, *end;\\nint m, n;\\n\\nvoid make_grid(double p, int x, int y)\\n{\\n int i, j, thresh = RAND_MAX * p;\\n m = x, n = y;\\n\\n // Allocate two addition rows to avoid checking bounds.\\n // Bottom row is also required by drippage\\n start = realloc(start, m * (n + 2) * sizeof(c_t));\\n cells = start + m;\\n\\n for (i = 0; i < m; i++)\\n start[i] = BWALL | RWALL;\\n\\n for (i = 0, end = cells; i < y; i++) {\\n for (j = x; --j; )\\n *end++ = (rand() < thresh ? BWALL : 0)\\n |(rand() < thresh ? RWALL : 0);\\n *end++ = RWALL | (rand() < thresh ? BWALL: 0);\\n }\\n memset(end, 0, sizeof(c_t) * m);\\n}\\n\\nvoid show_grid(void)\\n{\\n int i, j;\\n\\n for (j = 0; j < m; j++) printf(\\\"+--\\\");\\n puts(\\\"+\\\");\\n\\n for (i = 0; i <= n; i++) {\\n putchar(i == n ? ' ' : '|');\\n for (j = 0; j < m; j++) {\\n printf((cells[i*m + j] & FILL) ? \\\"[]\\\" : \\\" \\\");\\n putchar((cells[i*m + j] & RWALL) ? '|' : ' ');\\n }\\n putchar('\\\\n');\\n\\n if (i == n) return;\\n\\n for (j = 0; j < m; j++)\\n printf((cells[i*m + j] & BWALL) ? \\\"+--\\\" : \\\"+ \\\");\\n puts(\\\"+\\\");\\n }\\n}\\n\\nint fill(c_t *p)\\n{\\n if ((*p & FILL)) return 0;\\n *p |= FILL;\\n if (p >= end) return 1; // success: reached bottom row\\n\\n return ( !(p[ 0] & BWALL) && fill(p + m) ) ||\\n ( !(p[ 0] & RWALL) && fill(p + 1) ) ||\\n ( !(p[-1] & RWALL) && fill(p - 1) ) ||\\n ( !(p[-m] & BWALL) && fill(p - m) );\\n}\\n\\nint percolate(void)\\n{\\n int i;\\n for (i = 0; i < m && !fill(cells + i); i++);\\n\\n return i < m;\\n}\\n\\nint main(void)\\n{\\n make_grid(.5, 10, 10);\\n percolate();\\n show_grid();\\n\\n int cnt, i, p;\\n\\n puts(\\\"\\\\nrunning 10x10 grids 10000 times for each p:\\\");\\n for (p = 1; p < 10; p++) {\\n for (cnt = i = 0; i < 10000; i++) {\\n make_grid(p / 10., 10, 10);\\n cnt += percolate();\\n //show_grid(); // don't\\n }\\n printf(\\\"p = %3g: %.4f\\\\n\\\", p / 10., (double)cnt / i);\\n }\\n\\n free(start);\\n return 0;\\n}\\n\",\n \"language\": \"C\"\n },\n {\n \"code\": \"#include <cstdlib>\\n#include <cstring>\\n#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nclass Grid {\\npublic:\\n Grid(const double p, const int x, const int y) : m(x), n(y) {\\n const int thresh = static_cast<int>(RAND_MAX * p);\\n\\n // Allocate two addition rows to avoid checking bounds.\\n // Bottom row is also required by drippage\\n start = new cell[m * (n + 2)];\\n cells = start + m;\\n for (auto i = 0; i < m; i++) start[i] = RBWALL;\\n end = cells;\\n for (auto i = 0; i < y; i++) {\\n for (auto j = x; --j;)\\n *end++ = (rand() < thresh ? BWALL : 0) | (rand() < thresh ? RWALL : 0);\\n *end++ = RWALL | (rand() < thresh ? BWALL : 0);\\n }\\n memset(end, 0u, sizeof(cell) * m);\\n }\\n\\n ~Grid() {\\n delete[] start;\\n cells = 0;\\n start = 0;\\n end = 0;\\n }\\n\\n int percolate() const {\\n auto i = 0;\\n for (; i < m && !fill(cells + i); i++);\\n return i < m;\\n }\\n\\n void show() const {\\n for (auto j = 0; j < m; j++)\\n cout << (\\\"+-\\\");\\n cout << '+' << endl;\\n\\n for (auto i = 0; i <= n; i++) {\\n cout << (i == n ? ' ' : '|');\\n for (auto j = 0; j < m; j++) {\\n cout << ((cells[i * m + j] & FILL) ? \\\"#\\\" : \\\" \\\");\\n cout << ((cells[i * m + j] & RWALL) ? '|' : ' ');\\n }\\n cout << endl;\\n\\n if (i == n) return;\\n\\n for (auto j = 0; j < m; j++)\\n cout << ((cells[i * m + j] & BWALL) ? \\\"+-\\\" : \\\"+ \\\");\\n cout << '+' << endl;\\n }\\n }\\n\\nprivate:\\n enum cell_state {\\n FILL = 1 << 0,\\n RWALL = 1 << 1, // right wall\\n BWALL = 1 << 2, // bottom wall\\n RBWALL = RWALL | BWALL // right/bottom wall\\n };\\n\\n typedef unsigned int cell;\\n\\n bool fill(cell* p) const {\\n if ((*p & FILL)) return false;\\n *p |= FILL;\\n if (p >= end) return true; // success: reached bottom row\\n\\n return (!(p[0] & BWALL) && fill(p + m)) || (!(p[0] & RWALL) && fill(p + 1))\\n ||(!(p[-1] & RWALL) && fill(p - 1)) || (!(p[-m] & BWALL) && fill(p - m));\\n }\\n\\n cell* cells;\\n cell* start;\\n cell* end;\\n const int m;\\n const int n;\\n};\\n\\nint main() {\\n const auto M = 10, N = 10;\\n const Grid grid(.5, M, N);\\n grid.percolate();\\n grid.show();\\n\\n const auto C = 10000;\\n cout << endl << \\\"running \\\" << M << \\\"x\\\" << N << \\\" grids \\\" << C << \\\" times for each p:\\\" << endl;\\n for (auto p = 1; p < M; p++) {\\n auto cnt = 0, i = 0;\\n for (; i < C; i++)\\n cnt += Grid(p / static_cast<double>(M), M, N).percolate();\\n cout << \\\"p = \\\" << p / static_cast<double>(M) << \\\": \\\" << static_cast<double>(cnt) / i << endl;\\n }\\n\\n return EXIT_SUCCESS;\\n}\\n\",\n \"language\": \"C++\"\n },\n {\n \"code\": \"import std.stdio, std.random, std.array, std.range, std.algorithm;\\n\\nstruct Grid {\\n // Not enforced by runtime and type system:\\n // a Cell must contain only the flags bits.\\n alias Cell = uint;\\n\\n enum : Cell { // Cell states (bit flags).\\n empty = 0,\\n filled = 1,\\n rightWall = 2,\\n bottomWall = 4\\n }\\n\\n const size_t nc, nr;\\n Cell[] cells;\\n\\n this(in size_t nRows, in size_t nCols) pure nothrow {\\n nr = nRows;\\n nc = nCols;\\n\\n // Allocate two addition rows to avoid checking bounds.\\n // Bottom row is also required by drippage.\\n cells = new Cell[nc * (nr + 2)];\\n }\\n\\n void initialize(in double prob, ref Xorshift rng) {\\n cells[0 .. nc] = bottomWall | rightWall; // First row.\\n\\n uint pos = nc;\\n foreach (immutable r; 1 .. nr + 1) {\\n foreach (immutable c; 1 .. nc)\\n cells[pos++] = (uniform01 < prob ?bottomWall : empty) |\\n (uniform01 < prob ? rightWall : empty);\\n cells[pos++] = rightWall |\\n (uniform01 < prob ? bottomWall : empty);\\n }\\n\\n cells[$ - nc .. $] = empty; // Last row.\\n }\\n\\n bool percolate() pure nothrow @nogc {\\n bool fill(in size_t i) pure nothrow @nogc {\\n if (cells[i] & filled)\\n return false;\\n\\n cells[i] |= filled;\\n\\n if (i >= cells.length - nc)\\n return true; // Success: reached bottom row.\\n\\n return (!(cells[i] & bottomWall) && fill(i + nc)) ||\\n (!(cells[i] & rightWall) && fill(i + 1)) ||\\n (!(cells[i - 1] & rightWall) && fill(i - 1)) ||\\n (!(cells[i - nc] & bottomWall) && fill(i - nc));\\n }\\n\\n return iota(nc, nc + nc).any!fill;\\n }\\n\\n void show() const {\\n writeln(\\\"+-\\\".replicate(nc), '+');\\n\\n foreach (immutable r; 1 .. nr + 2) {\\n write(r == nr + 1 ? ' ' : '|');\\n foreach (immutable c; 0 .. nc) {\\n immutable cell = cells[r * nc + c];\\n write((cell & filled) ? (r <= nr ? '#' : 'X') : ' ');\\n write((cell & rightWall) ? '|' : ' ');\\n }\\n writeln;\\n\\n if (r == nr + 1)\\n return;\\n\\n foreach (immutable c; 0 .. nc)\\n write((cells[r * nc + c] & bottomWall) ? \\\"+-\\\" : \\\"+ \\\");\\n '+'.writeln;\\n }\\n }\\n}\\n\\nvoid main() {\\n enum uint nr = 10, nc = 10; // N. rows and columns of the grid.\\n enum uint nTries = 10_000; // N. simulations for each probability.\\n enum uint nStepsProb = 10; // N. steps of probability.\\n\\n auto rng = Xorshift(2);\\n auto g = Grid(nr, nc);\\n g.initialize(0.5, rng);\\n g.percolate;\\n g.show;\\n\\n writefln(\\\"\\\\nRunning %dx%d grids %d times for each p:\\\",\\n nr, nc, nTries);\\n foreach (immutable p; 0 .. nStepsProb) {\\n immutable probability = p / double(nStepsProb);\\n uint nPercolated = 0;\\n foreach (immutable i; 0 .. nTries) {\\n g.initialize(probability, rng);\\n nPercolated += g.percolate;\\n }\\n writefln(\\\"p = %0.2f: %.4f\\\",\\n probability, nPercolated / double(nTries));\\n }\\n}\\n\",\n \"language\": \"D\"\n },\n {\n \"code\": \"package main\\n\\nimport (\\n\\t\\\"fmt\\\"\\n\\t\\\"math/rand\\\"\\n\\t\\\"strings\\\"\\n\\t\\\"time\\\"\\n)\\n\\nfunc main() {\\n\\tconst (\\n\\t\\tm, n = 10, 10\\n\\t\\tt = 1000\\n\\t\\tminp, maxp, Δp = 0.1, 0.99, 0.1\\n\\t)\\n\\n\\t// Purposely don't seed for a repeatable example grid:\\n\\tg := NewGrid(.5, m, n)\\n\\tg.Percolate()\\n\\tfmt.Println(g)\\n\\n\\trand.Seed(time.Now().UnixNano()) // could pick a better seed\\n\\tfor p := float64(minp); p < maxp; p += Δp {\\n\\t\\tcount := 0\\n\\t\\tfor i := 0; i < t; i++ {\\n\\t\\t\\tg := NewGrid(p, m, n)\\n\\t\\t\\tif g.Percolate() {\\n\\t\\t\\t\\tcount++\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfmt.Printf(\\\"p=%.2f, %.3f\\\\n\\\", p, float64(count)/t)\\n\\t}\\n}\\n\\ntype cell struct {\\n\\tfull bool\\n\\tright, down bool // true if open to the right (x+1) or down (y+1)\\n}\\n\\ntype grid struct {\\n\\tcell [][]cell // row first, i.e. [y][x]\\n}\\n\\nfunc NewGrid(p float64, xsize, ysize int) *grid {\\n\\tg := &grid{cell: make([][]cell, ysize)}\\n\\tfor y := range g.cell {\\n\\t\\tg.cell[y] = make([]cell, xsize)\\n\\t\\tfor x := 0; x < xsize-1; x++ {\\n\\t\\t\\tif rand.Float64() > p {\\n\\t\\t\\t\\tg.cell[y][x].right = true\\n\\t\\t\\t}\\n\\t\\t\\tif rand.Float64() > p {\\n\\t\\t\\t\\tg.cell[y][x].down = true\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif rand.Float64() > p {\\n\\t\\t\\tg.cell[y][xsize-1].down = true\\n\\t\\t}\\n\\t}\\n\\treturn g\\n}\\n\\nvar (\\n\\tfull = map[bool]string{false: \\\" \\\", true: \\\"**\\\"}\\n\\thopen = map[bool]string{false: \\\"--\\\", true: \\\" \\\"}\\n\\tvopen = map[bool]string{false: \\\"|\\\", true: \\\" \\\"}\\n)\\n\\nfunc (g *grid) String() string {\\n\\tvar buf strings.Builder\\n\\t// Don't really need to call Grow but it helps avoid multiple\\n\\t// reallocations if the size is large.\\n\\tbuf.Grow((len(g.cell) + 1) * len(g.cell[0]) * 7)\\n\\n\\tfor _ = range g.cell[0] {\\n\\t\\tbuf.WriteString(\\\"+\\\")\\n\\t\\tbuf.WriteString(hopen[false])\\n\\t}\\n\\tbuf.WriteString(\\\"+\\\\n\\\")\\n\\tfor y := range g.cell {\\n\\t\\tbuf.WriteString(vopen[false])\\n\\t\\tfor x := range g.cell[y] {\\n\\t\\t\\tbuf.WriteString(full[g.cell[y][x].full])\\n\\t\\t\\tbuf.WriteString(vopen[g.cell[y][x].right])\\n\\t\\t}\\n\\t\\tbuf.WriteByte('\\\\n')\\n\\t\\tfor x := range g.cell[y] {\\n\\t\\t\\tbuf.WriteString(\\\"+\\\")\\n\\t\\t\\tbuf.WriteString(hopen[g.cell[y][x].down])\\n\\t\\t}\\n\\t\\tbuf.WriteString(\\\"+\\\\n\\\")\\n\\t}\\n\\tly := len(g.cell) - 1\\n\\tfor x := range g.cell[ly] {\\n\\t\\tbuf.WriteByte(' ')\\n\\t\\tbuf.WriteString(full[g.cell[ly][x].down && g.cell[ly][x].full])\\n\\t}\\n\\treturn buf.String()\\n}\\n\\nfunc (g *grid) Percolate() bool {\\n\\tfor x := range g.cell[0] {\\n\\t\\tif g.fill(x, 0) {\\n\\t\\t\\treturn true\\n\\t\\t}\\n\\t}\\n\\treturn false\\n}\\n\\nfunc (g *grid) fill(x, y int) bool {\\n\\tif y >= len(g.cell) {\\n\\t\\treturn true // Out the bottom\\n\\t}\\n\\tif g.cell[y][x].full {\\n\\t\\treturn false // Allready filled\\n\\t}\\n\\tg.cell[y][x].full = true\\n\\n\\tif g.cell[y][x].down && g.fill(x, y+1) {\\n\\t\\treturn true\\n\\t}\\n\\tif g.cell[y][x].right && g.fill(x+1, y) {\\n\\t\\treturn true\\n\\t}\\n\\tif x > 0 && g.cell[y][x-1].right && g.fill(x-1, y) {\\n\\t\\treturn true\\n\\t}\\n\\tif y > 0 && g.cell[y-1][x].down && g.fill(x, y-1) {\\n\\t\\treturn true\\n\\t}\\n\\treturn false\\n}\\n\",\n \"language\": \"Go\"\n },\n {\n \"code\": \"{-# LANGUAGE OverloadedStrings #-}\\nimport Control.Monad\\nimport Control.Monad.Random\\nimport Data.Array.Unboxed\\nimport Data.List\\nimport Formatting\\n\\ndata Field = Field { f :: UArray (Int, Int) Char\\n , hWall :: UArray (Int, Int) Bool\\n , vWall :: UArray (Int, Int) Bool\\n }\\n\\n-- Start percolating some seepage through a field.\\n-- Recurse to continue percolation with new seepage.\\npercolateR :: [(Int, Int)] -> Field -> (Field, [(Int,Int)])\\npercolateR [] (Field f h v) = (Field f h v, [])\\npercolateR seep (Field f h v) =\\n let ((xLo,yLo),(xHi,yHi)) = bounds f\\n validSeep = filter (\\\\p@(x,y) -> x >= xLo\\n && x <= xHi\\n && y >= yLo\\n && y <= yHi\\n && f!p == ' ') $ nub $ sort seep\\n\\n north (x,y) = if v ! (x ,y ) then [] else [(x ,y-1)]\\n south (x,y) = if v ! (x ,y+1) then [] else [(x ,y+1)]\\n west (x,y) = if h ! (x ,y ) then [] else [(x-1,y )]\\n east (x,y) = if h ! (x+1,y ) then [] else [(x+1,y )]\\n neighbors (x,y) = north(x,y) ++ south(x,y) ++ west(x,y) ++ east(x,y)\\n\\n in percolateR\\n (concatMap neighbors validSeep)\\n (Field (f // map (\\\\p -> (p,'.')) validSeep) h v)\\n\\n-- Percolate a field; Return the percolated field.\\npercolate :: Field -> Field\\npercolate start@(Field f _ _) =\\n let ((_,_),(xHi,_)) = bounds f\\n (final, _) = percolateR [(x,0) | x <- [0..xHi]] start\\n in final\\n\\n-- Generate a random field.\\ninitField :: Int -> Int -> Double -> Rand StdGen Field\\ninitField width height threshold = do\\n let f = listArray ((0,0), (width-1, height-1)) $ repeat ' '\\n\\n hrnd <- fmap (<threshold) <$> getRandoms\\n let h0 = listArray ((0,0),(width, height-1)) hrnd\\n h1 = h0 // [((0,y), True) | y <- [0..height-1]] -- close left\\n h2 = h1 // [((width,y), True) | y <- [0..height-1]] -- close right\\n\\n vrnd <- fmap (<threshold) <$> getRandoms\\n let v0 = listArray ((0,0),(width-1, height)) vrnd\\n v1 = v0 // [((x,0), True) | x <- [0..width-1]] -- close top\\n\\n return $ Field f h2 v1\\n\\n-- Assess whether or not percolation reached bottom of field.\\nleaks :: Field -> [Bool]\\nleaks (Field f _ v) =\\n let ((xLo,_),(xHi,yHi)) = bounds f\\n in [f!(x,yHi)=='.' && not (v!(x,yHi+1)) | x <- [xLo..xHi]]\\n\\n-- Run test once; Return bool indicating success or failure.\\noneTest :: Int -> Int -> Double -> Rand StdGen Bool\\noneTest width height threshold =\\n or.leaks.percolate <$> initField width height threshold\\n\\n-- Run test multple times; Return the number of tests that pass.\\nmultiTest :: Int -> Int -> Int -> Double -> Rand StdGen Double\\nmultiTest testCount width height threshold = do\\n results <- replicateM testCount $ oneTest width height threshold\\n let leakyCount = length $ filter id results\\n return $ fromIntegral leakyCount / fromIntegral testCount\\n\\n-- Helper function for display\\nalternate :: [a] -> [a] -> [a]\\nalternate [] _ = []\\nalternate (a:as) bs = a : alternate bs as\\n\\n-- Display a field with walls and leaks.\\nshowField :: Field -> IO ()\\nshowField field@(Field a h v) = do\\n let ((xLo,yLo),(xHi,yHi)) = bounds a\\n fLines = [ [ a!(x,y) | x <- [xLo..xHi]] | y <- [yLo..yHi]]\\n hLines = [ [ if h!(x,y) then '|' else ' ' | x <- [xLo..xHi+1]] | y <- [yLo..yHi]]\\n vLines = [ [ if v!(x,y) then '-' else ' ' | x <- [xLo..xHi]] | y <- [yLo..yHi+1]]\\n lattice = [ [ '+' | x <- [xLo..xHi+1]] | y <- [yLo..yHi+1]]\\n\\n hDrawn = zipWith alternate hLines fLines\\n vDrawn = zipWith alternate lattice vLines\\n mapM_ putStrLn $ alternate vDrawn hDrawn\\n\\n let leakLine = [ if l then '.' else ' ' | l <- leaks field]\\n putStrLn $ alternate (repeat ' ') leakLine\\n\\nmain :: IO ()\\nmain = do\\n g <- getStdGen\\n let threshold = 0.45\\n (startField, g2) = runRand (initField 10 10 threshold) g\\n\\n putStrLn (\\\"Unpercolated field with \\\" ++ show threshold ++ \\\" threshold.\\\")\\n putStrLn \\\"\\\"\\n showField startField\\n\\n putStrLn \\\"\\\"\\n putStrLn \\\"Same field after percolation.\\\"\\n putStrLn \\\"\\\"\\n showField $ percolate startField\\n\\n let testCount = 10000\\n densityCount = 10\\n putStrLn \\\"\\\"\\n putStrLn (\\\"Results of running percolation test \\\" ++ show testCount ++ \\\" times with thresholds ranging from 0/\\\" ++ show densityCount ++ \\\" to \\\" ++ show densityCount ++ \\\"/\\\" ++ show densityCount ++ \\\" .\\\")\\n let densities = [0..densityCount]\\n let tests = sequence [multiTest testCount 10 10 v\\n | density <- densities,\\n let v = fromIntegral density / fromIntegral densityCount ]\\n let results = zip densities (evalRand tests g2)\\n mapM_ print [format (\\\"p=\\\" % int % \\\"/\\\" % int % \\\" -> \\\" % fixed 4) density densityCount x | (density,x) <- results]\\n\",\n \"language\": \"Haskell\"\n },\n {\n \"code\": \"import java.util.Arrays;\\nimport java.util.concurrent.ThreadLocalRandom;\\n\\npublic final class PercolationBond {\\n\\n\\tpublic static void main(String[] aArgs) {\\n\\t\\tSystem.out.println(\\\"Sample percolation with a \\\" + COL_COUNT + \\\" x \\\" + ROW_COUNT + \\\" grid:\\\");\\n\\t\\tmakeGrid(0.5);\\n\\t\\tpercolate();\\n\\t\\tshowGrid();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Using 10,000 repetitions for each probability p:\\\");\\n\\t for ( int p = 1; p <= 9; p++ ) {\\n\\t int percolationCount = 0;\\n\\t double probability = p / 10.0;\\n\\t for ( int i = 0; i < 10_000; i++ ) {\\n\\t makeGrid(probability);\\n\\t if ( percolate() ) {\\n\\t \\tpercolationCount += 1;\\n\\t }\\n\\t }\\n\\t final double percolationProportion = (double) percolationCount / 10_000;\\n\\t System.out.println(String.format(\\\"%s%.1f%s%.4f\\\", \\\"p = \\\", probability, \\\": \\\", percolationProportion));\\n\\t }\\n\\t}\\n\\t\\n\\tprivate static void makeGrid(double aProbability) {\\t\\n\\t Arrays.fill(grid, 0);\\n\\t for ( int i = 0; i < COL_COUNT; i++ ) {\\n\\t \\tgrid[i] = LOWER_WALL | RIGHT_WALL;\\n\\t }\\n\\n\\t endOfRow = COL_COUNT;\\n\\t for ( int i = 0; i < ROW_COUNT; i++ ) {\\n\\t for ( int j = COL_COUNT - 1; j >= 1; j-- ) {\\t \\t\\n\\t \\tfinal boolean chance1 = RANDOM.nextDouble() < aProbability;\\n\\t \\tfinal boolean chance2 = RANDOM.nextDouble() < aProbability;\\n\\t grid[endOfRow++] = ( chance1 ? LOWER_WALL : 0 ) | ( chance2 ? RIGHT_WALL : 0 );\\n\\t }\\n\\t final boolean chance3 = RANDOM.nextDouble() < aProbability;\\n\\t grid[endOfRow++] = RIGHT_WALL | ( chance3 ? LOWER_WALL : 0 );\\n\\t }\\n\\t}\\n\\t\\n\\tprivate static void showGrid() {\\n\\t\\tfor ( int j = 0; j < COL_COUNT; j++ ) {\\n\\t \\tSystem.out.print(\\\"+--\\\");\\n\\t }\\n\\t System.out.println(\\\"+\\\");\\n\\t\\t\\n\\t\\tfor ( int i = 0; i < ROW_COUNT; i++ ) {\\n\\t\\t\\tSystem.out.print(\\\"|\\\");\\n\\t for ( int j = 0; j < COL_COUNT; j++ ) {\\n\\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & FILL ) != 0 ) ? \\\"[]\\\" : \\\" \\\" );\\n\\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & RIGHT_WALL ) != 0 ) ? \\\"|\\\" : \\\" \\\" );\\n\\t }\\n\\t System.out.println();\\n\\t\\t\\n\\t for ( int j = 0; j < COL_COUNT; j++ ) {\\n\\t System.out.print( ( ( grid[i * COL_COUNT + j + COL_COUNT] & LOWER_WALL) != 0 ) ? \\\"+--\\\" : \\\"+ \\\" );\\n\\t }\\n\\t System.out.println(\\\"+\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\tfor ( int j = 0; j < COL_COUNT; j++ ) {\\n System.out.print( ( ( grid[ROW_COUNT * COL_COUNT + j + COL_COUNT] & FILL ) != 0 ) ? \\\"[]\\\" : \\\" \\\" );\\n System.out.print( ( ( grid[ROW_COUNT * COL_COUNT + j + COL_COUNT] & RIGHT_WALL ) != 0 ) ? \\\"|\\\" : \\\" \\\" );\\n }\\n System.out.println(System.lineSeparator());\\n\\t}\\n\\t\\n\\tprivate static boolean fill(int aGridIndex) {\\n\\t if ( ( grid[aGridIndex] & FILL ) != 0 ) {\\n\\t \\treturn false;\\n\\t }\\t\\n\\t grid[aGridIndex] |= FILL;\\n\\t\\n\\t if ( aGridIndex >= endOfRow ) {\\n\\t \\treturn true;\\n\\t }\\t\\n\\t return ( ( ( grid[aGridIndex] & LOWER_WALL ) == 0 ) && fill(aGridIndex + COL_COUNT) ) ||\\n\\t ( ( ( grid[aGridIndex] & RIGHT_WALL ) == 0 ) && fill(aGridIndex + 1) ) ||\\n\\t ( ( ( grid[aGridIndex - 1] & RIGHT_WALL ) == 0 ) && fill(aGridIndex - 1) ) ||\\n\\t ( ( ( grid[aGridIndex - COL_COUNT] & LOWER_WALL ) == 0 ) && fill(aGridIndex - COL_COUNT) );\\n\\t}\\n\\n\\tprivate static boolean percolate() {\\n\\t\\tint i = 0;\\n\\t while ( i < COL_COUNT && ! fill(COL_COUNT + i) ) {\\n\\t \\ti++;\\n\\t }\\n\\t return i < COL_COUNT;\\n\\t}\\n\\t\\t\\n\\tprivate static final int ROW_COUNT = 10;\\n\\tprivate static final int COL_COUNT = 10;\\n\\t\\n\\tprivate static int endOfRow = COL_COUNT;\\n\\tprivate static int[] grid = new int[COL_COUNT * ( ROW_COUNT + 2 )];\\n\\n\\tprivate static final int FILL = 1;\\n\\tprivate static final int RIGHT_WALL = 2;\\n\\tprivate static final int LOWER_WALL = 4;\\n\\n\\tprivate static final ThreadLocalRandom RANDOM = ThreadLocalRandom.current();\\n\\t\\n}\\n\",\n \"language\": \"Java\"\n },\n {\n \"code\": \"using Printf, Distributions\\n\\nstruct Grid\\n cells::BitArray{2}\\n hwall::BitArray{2}\\n vwall::BitArray{2}\\nend\\nfunction Grid(p::AbstractFloat, m::Integer=10, n::Integer=10)\\n cells = fill(false, m, n)\\n hwall = rand(Bernoulli(p), m + 1, n)\\n vwall = rand(Bernoulli(p), m, n + 1)\\n vwall[:, 1] = true\\n vwall[:, end] = true\\n return Grid(cells, hwall, vwall)\\nend\\n\\nfunction Base.show(io::IO, g::Grid)\\n H = (\\\" .\\\", \\\" _\\\")\\n V = (\\\":\\\", \\\"|\\\")\\n C = (\\\" \\\", \\\"#\\\")\\n ind = findfirst(g.cells[end, :] .& .!g.hwall[end, :])\\n percolated = !iszero(ind)\\n println(io, \\\"$(size(g.cells, 1))×$(size(g.cells, 2)) $(percolated ? \\\"Percolated\\\" : \\\"Not percolated\\\") grid\\\")\\n for r in 1:size(g.cells, 1)\\n println(io, \\\" \\\", join(H[w+1] for w in g.hwall[r, :]))\\n println(io, \\\" $(r % 10)) \\\", join(V[w+1] * C[c+1] for (w, c) in zip(g.vwall[r, :], g.cells[r, :])))\\n end\\n println(io, \\\" \\\", join(H[w+1] for w in g.hwall[end, :]))\\n if percolated\\n println(io, \\\" !) \\\", \\\" \\\" ^ (ind - 1), '#')\\n end\\nend\\n\\nfunction floodfill!(m::Integer, n::Integer, cells::AbstractMatrix{<:Integer},\\n hwall::AbstractMatrix{<:Integer}, vwall::AbstractMatrix{<:Integer})\\n # fill cells\\n cells[m, n] = true\\n percolated = false\\n # bottom\\n if m < size(cells, 1) && !hwall[m+1, n] && !cells[m+1, n]\\n percolated = percolated || floodfill!(m + 1, n, cells, hwall, vwall)\\n # The Bottom\\n elseif m == size(cells, 1) && !hwall[m+1, n]\\n return true\\n end\\n # left\\n if n > 1 && !vwall[m, n] && !cells[m, n-1]\\n percolated = percolated || floodfill!(m, n - 1, cells, hwall, vwall)\\n end\\n # right\\n if n < size(cells, 2) && !vwall[m, n+1] && !cells[m, n+1]\\n percolated = percolated || floodfill!(m, n + 1, cells, hwall, vwall)\\n end\\n # top\\n if m > 1 && !hwall[m, n] && !cells[m-1, n]\\n percolated = percolated || floodfill!(m - 1, n, cells, hwall, vwall)\\n end\\n return percolated\\nend\\nfunction pourontop!(g::Grid)\\n m, n = 1, 1\\n percolated = false\\n while !percolated && n ≤ size(g.cells, 2)\\n percolated = !g.hwall[m, n] && floodfill!(m, n, g.cells, g.hwall, g.vwall)\\n n += 1\\n end\\n return percolated\\nend\\n\\nfunction main(probs, nrep::Integer=1000)\\n sampleprinted = false\\n pcount = zeros(Int, size(probs))\\n for (i, p) in enumerate(probs), _ in 1:nrep\\n g = Grid(p)\\n percolated = pourontop!(g)\\n if percolated\\n pcount[i] += 1\\n if !sampleprinted\\n println(g)\\n sampleprinted = true\\n end\\n end\\n end\\n return pcount ./ nrep\\nend\\n\\nprobs = collect(10:-1:0) ./ 10\\npercprobs = main(probs)\\n\\nprintln(\\\"Fraction of 1000 tries that percolate through:\\\")\\nfor (pr, pp) in zip(probs, percprobs)\\n @printf(\\\"\\\\tp = %.3f ⇒ freq. = %5.3f\\\\n\\\", pr, pp)\\nend\\n\",\n \"language\": \"Julia\"\n },\n {\n \"code\": \"// version 1.2.10\\n\\nimport java.util.Random\\n\\nval rand = Random()\\nconst val RAND_MAX = 32767\\n\\n// cell states\\nconst val FILL = 1\\nconst val RWALL = 2 // right wall\\nconst val BWALL = 4 // bottom wall\\n\\nval x = 10\\nval y = 10\\nvar grid = IntArray(x * (y + 2))\\nvar cells = 0\\nvar end = 0\\nvar m = 0\\nvar n = 0\\n\\nfun makeGrid(p: Double) {\\n val thresh = (p * RAND_MAX).toInt()\\n m = x\\n n = y\\n grid.fill(0) // clears grid\\n for (i in 0 until m) grid[i] = BWALL or RWALL\\n cells = m\\n end = m\\n for (i in 0 until y) {\\n for (j in x - 1 downTo 1) {\\n val r1 = rand.nextInt(RAND_MAX + 1)\\n val r2 = rand.nextInt(RAND_MAX + 1)\\n grid[end++] = (if (r1 < thresh) BWALL else 0) or\\n (if (r2 < thresh) RWALL else 0)\\n }\\n val r3 = rand.nextInt(RAND_MAX + 1)\\n grid[end++] = RWALL or (if (r3 < thresh) BWALL else 0)\\n }\\n}\\n\\nfun showGrid() {\\n for (j in 0 until m) print(\\\"+--\\\")\\n println(\\\"+\\\")\\n\\n for (i in 0..n) {\\n print(if (i == n) \\\" \\\" else \\\"|\\\")\\n for (j in 0 until m) {\\n print(if ((grid[i * m + j + cells] and FILL) != 0) \\\"[]\\\" else \\\" \\\")\\n print(if ((grid[i * m + j + cells] and RWALL) != 0) \\\"|\\\" else \\\" \\\")\\n }\\n println()\\n if (i == n) return\\n for (j in 0 until m) {\\n print(if ((grid[i * m + j + cells] and BWALL) != 0) \\\"+--\\\" else \\\"+ \\\")\\n }\\n println(\\\"+\\\")\\n }\\n}\\n\\nfun fill(p: Int): Boolean {\\n if ((grid[p] and FILL) != 0) return false\\n grid[p] = grid[p] or FILL\\n if (p >= end) return true // success: reached bottom row\\n return (((grid[p + 0] and BWALL) == 0) && fill(p + m)) ||\\n (((grid[p + 0] and RWALL) == 0) && fill(p + 1)) ||\\n (((grid[p - 1] and RWALL) == 0) && fill(p - 1)) ||\\n (((grid[p - m] and BWALL) == 0) && fill(p - m))\\n}\\n\\nfun percolate(): Boolean {\\n var i = 0\\n while (i < m && !fill(cells + i)) i++\\n return i < m\\n}\\n\\nfun main(args: Array<String>) {\\n makeGrid(0.5)\\n percolate()\\n showGrid()\\n\\n println(\\\"\\\\nrunning $x x $y grids 10,000 times for each p:\\\")\\n for (p in 1..9) {\\n var cnt = 0\\n val pp = p / 10.0\\n for (i in 0 until 10_000) {\\n makeGrid(pp)\\n if (percolate()) cnt++\\n }\\n println(\\\"p = %3g: %.4f\\\".format(pp, cnt.toDouble() / 10_000))\\n }\\n}\\n\",\n \"language\": \"Kotlin\"\n },\n {\n \"code\": \"import random, sequtils, strformat, tables\\n\\ntype\\n\\n Cell = object\\n full: bool\\n right, down: bool # True if open to the right (x+1) or down (y+1).\\n\\n Grid = seq[seq[Cell]] # Row first, i.e. [y][x].\\n\\n\\nproc newGrid(p: float; xsize, ysize: Positive): Grid =\\n\\n result = newSeqWith(ysize, newSeq[Cell](xsize))\\n for row in result.mitems:\\n for x in 0..(xsize - 2):\\n if rand(1.0) > p: row[x].right = true\\n if rand(1.0) > p: row[x].down = true\\n if rand(1.0) > p: row[xsize - 1].down = true\\n\\n\\nconst\\n Full = {false: \\\" \\\", true: \\\"()\\\"}.toTable\\n HOpen = {false: \\\"--\\\", true: \\\" \\\"}.toTable\\n VOpen = {false: \\\"|\\\", true: \\\" \\\"}.toTable\\n\\nproc `$`(grid: Grid): string =\\n\\n # Preallocate result to avoid multiple reallocations.\\n result = newStringOfCap((grid.len + 1) * grid[0].len * 7)\\n\\n for _ in 0..grid[0].high:\\n result.add '+'\\n result.add HOpen[false]\\n result.add \\\"+\\\\n\\\"\\n\\n for row in grid:\\n result.add VOpen[false]\\n for cell in row:\\n result.add Full[cell.full]\\n result.add VOpen[cell.right]\\n result.add '\\\\n'\\n for cell in row:\\n result.add '+'\\n result.add HOpen[cell.down]\\n result.add \\\"+\\\\n\\\"\\n\\n for cell in grid[^1]:\\n result.add ' '\\n result.add Full[cell.down and cell.full]\\n\\n\\nproc fill(grid: var Grid; x, y: Natural): bool =\\n\\n if y >= grid.len: return true # Out the bottom.\\n if grid[y][x].full: return false # Already filled.\\n grid[y][x].full = true\\n\\n if grid[y][x].down and grid.fill(x, y + 1): return true\\n if grid[y][x].right and grid.fill(x + 1, y): return true\\n if x > 0 and grid[y][x - 1].right and grid.fill(x - 1, y): return true\\n if y > 0 and grid[y - 1][x].down and grid.fill(x, y - 1): return true\\n\\n\\nproc percolate(grid: var Grid): bool =\\n for x in 0..grid[0].high:\\n if grid.fill(x, 0): return true\\n\\n\\nconst\\n M = 10\\n N = 10\\n T = 1000\\n MinP = 0.1\\n MaxP = 0.99\\n ΔP = 0.1\\n\\n# Purposely don't seed for a repeatable example grid.\\nvar grid = newGrid(0.4, M, N)\\ndiscard grid.percolate()\\necho grid\\necho \\\"\\\"\\n\\nrandomize()\\nvar p = MinP\\nwhile p < MaxP:\\n var count = 0\\n for _ in 1..T:\\n var grid = newGrid(p, M, N)\\n if grid.percolate(): inc count\\n echo &\\\"p = {p:.2f}: {count / T:.3f}\\\"\\n p += ΔP\\n\",\n \"language\": \"Nim\"\n },\n {\n \"code\": \"my @bond;\\nmy $grid = 10;\\nmy $water = '▒';\\n$D{$_} = $i++ for qw<DeadEnd Up Right Down Left>;\\n\\nsub percolate {\\n generate(shift || 0.6);\\n fill(my $x = 1,my $y = 0);\\n my @stack;\\n\\n while () {\\n if (my $dir = direction($x,$y)) {\\n push @stack, [$x,$y];\\n ($x,$y) = move($dir, $x, $y)\\n } else {\\n return 0 unless @stack;\\n ($x,$y) = @{pop @stack}\\n }\\n return 1 if $y == $#bond;\\n }\\n}\\n\\nsub direction {\\n my($x, $y) = @_;\\n return $D{Down} if $bond[$y+1][$x ] =~ / /;\\n return $D{Left} if $bond[$y ][$x-1] =~ / /;\\n return $D{Right} if $bond[$y ][$x+1] =~ / /;\\n return $D{Up} if defined $bond[$y-1][$x ] && $bond[$y-1][$x] =~ / /;\\n return $D{DeadEnd}\\n}\\n\\nsub move {\\n my($dir,$x,$y) = @_;\\n fill( $x,--$y), fill( $x,--$y) if $dir == $D{Up};\\n fill( $x,++$y), fill( $x,++$y) if $dir == $D{Down};\\n fill(--$x, $y), fill(--$x, $y) if $dir == $D{Left};\\n fill(++$x, $y), fill(++$x, $y) if $dir == $D{Right};\\n $x, $y\\n}\\n\\nsub fill {\\n my($x, $y) = @_;\\n $bond[$y][$x] =~ s/ /$water/g\\n}\\n\\nsub generate {\\n our($prob) = shift || 0.5;\\n @bond = ();\\n our $sp = ' ';\\n push @bond, ['│', ($sp, ' ') x ($grid-1), $sp, '│'],\\n ['├', hx('┬'), h(), '┤'];\\n push @bond, ['│', vx( ), $sp, '│'],\\n ['├', hx('┼'), h(), '┤'] for 1..$grid-1;\\n push @bond, ['│', vx( ), $sp, '│'],\\n ['├', hx('┴'), h(), '┤'],\\n ['│', ($sp, ' ') x ($grid-1), $sp, '│'];\\n\\n sub hx { my($c)=@_; my @l; push @l, (h(),$c) for 1..$grid-1; return @l; }\\n sub vx { my @l; push @l, $sp, v() for 1..$grid-1; return @l; }\\n sub h { rand() < $prob ? $sp : '───' }\\n sub v { rand() < $prob ? ' ' : '│' }\\n}\\n\\nprint \\\"Sample percolation at .6\\\\n\\\";\\npercolate(.6);\\nfor my $row (@bond) {\\n my $line = '';\\n $line .= join '', $_ for @$row;\\n print \\\"$line\\\\n\\\";\\n}\\n\\nmy $tests = 100;\\nprint \\\"Doing $tests trials at each porosity:\\\\n\\\";\\nmy @table;\\nfor my $p (1 .. 10) {\\n $p = $p/10;\\n my $total = 0;\\n $total += percolate($p) for 1..$tests;\\n printf \\\"p = %0.1f: %0.2f\\\\n\\\", $p, $total / $tests\\n}\\n\",\n \"language\": \"Perl\"\n },\n {\n \"code\": \"(phixonline)-->\\n <span style=\\\"color: #008080;\\\">with</span> <span style=\\\"color: #008080;\\\">javascript_semantics</span>\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">w</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">h</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">10</span>\\n\\n <span style=\\\"color: #004080;\\\">sequence</span> <span style=\\\"color: #000000;\\\">wall</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"+\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\"---\\\"</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">cell</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #008000;\\\">\\\"|\\\"</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">w</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">\\\" \\\"</span><span style=\\\"color: #0000FF;\\\">)&</span><span style=\\\"color: #008000;\\\">\\\"\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">grid</span>\\n\\n <span style=\\\"color: #008080;\\\">procedure</span> <span style=\\\"color: #000000;\\\">new_grid</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">atom</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">grid</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">split</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #7060A8;\\\">repeat</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">wall</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">h</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #000000;\\\">cell</span><span style=\\\"color: #0000FF;\\\">),</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- now knock down some walls</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">jstart</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">5</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #7060A8;\\\">mod</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">)*</span><span style=\\\"color: #000000;\\\">3</span><span style=\\\"color: #0000FF;\\\">,</span>\\n <span style=\\\"color: #000000;\\\">jlimit</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">])-</span><span style=\\\"color: #000000;\\\">3</span>\\n <span style=\\\"color: #000080;font-style:italic;\\\">-- (ie 2..38 on odd lines, 5..37 on even)</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">jstart</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">jlimit</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #7060A8;\\\">rnd</span><span style=\\\"color: #0000FF;\\\">()></span><span style=\\\"color: #000000;\\\">p</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">i</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">..</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">\\\" \\\"</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">procedure</span>\\n\\n <span style=\\\"color: #008080;\\\">function</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">,</span> <span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">3</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">])-</span><span style=\\\"color: #000000;\\\">2</span> <span style=\\\"color: #008080;\\\">by</span> <span style=\\\"color: #000000;\\\">4</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">j</span><span style=\\\"color: #0000FF;\\\">)</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #008080;\\\">elsif</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">]</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #008000;\\\">'*'</span>\\n <span style=\\\"color: #008080;\\\">if</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #7060A8;\\\">length</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">)-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">6</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\"><</span><span style=\\\"color: #000000;\\\">36</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">2</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">+</span><span style=\\\"color: #000000;\\\">4</span><span style=\\\"color: #0000FF;\\\">))</span>\\n <span style=\\\"color: #008080;\\\">or</span> <span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">></span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">[</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">][</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">]=</span><span style=\\\"color: #008000;\\\">' '</span> <span style=\\\"color: #008080;\\\">and</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">x</span><span style=\\\"color: #0000FF;\\\">-</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">y</span><span style=\\\"color: #0000FF;\\\">))</span> <span style=\\\"color: #008080;\\\">then</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">true</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">if</span>\\n <span style=\\\"color: #008080;\\\">return</span> <span style=\\\"color: #004600;\\\">false</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">function</span>\\n\\n <span style=\\\"color: #008080;\\\">constant</span> <span style=\\\"color: #000000;\\\">LIM</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1000</span>\\n\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">0</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">10</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #004080;\\\">integer</span> <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">0</span>\\n <span style=\\\"color: #008080;\\\">for</span> <span style=\\\"color: #000000;\\\">t</span><span style=\\\"color: #0000FF;\\\">=</span><span style=\\\"color: #000000;\\\">1</span> <span style=\\\"color: #008080;\\\">to</span> <span style=\\\"color: #000000;\\\">LIM</span> <span style=\\\"color: #008080;\\\">do</span>\\n <span style=\\\"color: #000000;\\\">new_grid</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">count</span> <span style=\\\"color: #0000FF;\\\">+=</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"p=%.1f: %5.3f\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #000000;\\\">p</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">10</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #000000;\\\">count</span><span style=\\\"color: #0000FF;\\\">/</span><span style=\\\"color: #000000;\\\">LIM</span><span style=\\\"color: #0000FF;\\\">})</span>\\n <span style=\\\"color: #008080;\\\">end</span> <span style=\\\"color: #008080;\\\">for</span>\\n <span style=\\\"color: #7060A8;\\\">puts</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"sample grid for p=0.6:\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #000000;\\\">new_grid</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">0.6</span><span style=\\\"color: #0000FF;\\\">)</span>\\n <span style=\\\"color: #0000FF;\\\">{}</span> <span style=\\\"color: #0000FF;\\\">=</span> <span style=\\\"color: #000000;\\\">percolate</span><span style=\\\"color: #0000FF;\\\">()</span>\\n <span style=\\\"color: #7060A8;\\\">printf</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">1</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">\\\"%s\\\\n\\\"</span><span style=\\\"color: #0000FF;\\\">,{</span><span style=\\\"color: #7060A8;\\\">join</span><span style=\\\"color: #0000FF;\\\">(</span><span style=\\\"color: #000000;\\\">grid</span><span style=\\\"color: #0000FF;\\\">,</span><span style=\\\"color: #008000;\\\">'\\\\n'</span><span style=\\\"color: #0000FF;\\\">)})</span>\\n<!--\\n\",\n \"language\": \"Phix\"\n },\n {\n \"code\": \"from collections import namedtuple\\nfrom random import random\\nfrom pprint import pprint as pp\\n\\nGrid = namedtuple('Grid', 'cell, hwall, vwall')\\n\\nM, N, t = 10, 10, 100\\n\\nclass PercolatedException(Exception): pass\\n\\nHVF = [(' .', ' _'), (':', '|'), (' ', '#')] # Horiz, vert, fill chars\\n\\ndef newgrid(p):\\n hwall = [[int(random() < p) for m in range(M)]\\n for n in range(N+1)]\\n vwall = [[(1 if m in (0, M) else int(random() < p)) for m in range(M+1)]\\n for n in range(N)]\\n cell = [[0 for m in range(M)]\\n for n in range(N)]\\n return Grid(cell, hwall, vwall)\\n\\ndef pgrid(grid, percolated=None):\\n cell, hwall, vwall = grid\\n h, v, f = HVF\\n for n in range(N):\\n print(' ' + ''.join(h[hwall[n][m]] for m in range(M)))\\n print('%i) ' % (n % 10) + ''.join(v[vwall[n][m]] + f[cell[n][m] if m < M else 0]\\n for m in range(M+1))[:-1])\\n n = N\\n print(' ' + ''.join(h[hwall[n][m]] for m in range(M)))\\n if percolated:\\n where = percolated.args[0][0]\\n print('!) ' + ' ' * where + ' ' + f[1])\\n\\ndef pour_on_top(grid):\\n cell, hwall, vwall = grid\\n n = 0\\n try:\\n for m in range(M):\\n if not hwall[n][m]:\\n flood_fill(m, n, cell, hwall, vwall)\\n except PercolatedException as ex:\\n return ex\\n return None\\n\\n\\ndef flood_fill(m, n, cell, hwall, vwall):\\n # fill cell\\n cell[n][m] = 1\\n # bottom\\n if n < N - 1 and not hwall[n + 1][m] and not cell[n+1][m]:\\n flood_fill(m, n+1, cell, hwall, vwall)\\n # THE bottom\\n elif n == N - 1 and not hwall[n + 1][m]:\\n raise PercolatedException((m, n+1))\\n # left\\n if m and not vwall[n][m] and not cell[n][m - 1]:\\n flood_fill(m-1, n, cell, hwall, vwall)\\n # right\\n if m < M - 1 and not vwall[n][m + 1] and not cell[n][m + 1]:\\n flood_fill(m+1, n, cell, hwall, vwall)\\n # top\\n if n and not hwall[n][m] and not cell[n-1][m]:\\n flood_fill(m, n-1, cell, hwall, vwall)\\n\\nif __name__ == '__main__':\\n sample_printed = False\\n pcount = {}\\n for p10 in range(11):\\n p = (10 - p10) / 10.0 # count down so sample print is interesting\\n pcount[p] = 0\\n for tries in range(t):\\n grid = newgrid(p)\\n percolated = pour_on_top(grid)\\n if percolated:\\n pcount[p] += 1\\n if not sample_printed:\\n print('\\\\nSample percolating %i x %i grid' % (M, N))\\n pgrid(grid, percolated)\\n sample_printed = True\\n print('\\\\n p: Fraction of %i tries that percolate through' % t )\\n\\n pp({p:c/float(t) for p, c in pcount.items()})\\n\",\n \"language\": \"Python\"\n },\n {\n \"code\": \"#lang racket\\n\\n(define has-left-wall? (lambda (x) (bitwise-bit-set? x 0)))\\n(define has-right-wall? (lambda (x) (bitwise-bit-set? x 1)))\\n(define has-top-wall? (lambda (x) (bitwise-bit-set? x 2)))\\n(define has-bottom-wall? (lambda (x) (bitwise-bit-set? x 3)))\\n(define has-fluid? (lambda (x) (bitwise-bit-set? x 4)))\\n\\n(define (walls->cell l? r? t? b?)\\n (+ (if l? 1 0) (if r? 2 0) (if t? 4 0) (if b? 8 0)))\\n\\n(define (bonded-percol-grid M N p)\\n (define rv (make-vector (* M N)))\\n (for* ((idx (in-range (* M N))))\\n (define left-wall?\\n (or (zero? (modulo idx M))\\n (has-right-wall? (vector-ref rv (sub1 idx)))))\\n (define right-wall?\\n (or (= (modulo idx M) (sub1 M))\\n (< (random) p)))\\n (define top-wall?\\n (if (< idx M) (< (random) p)\\n (has-bottom-wall? (vector-ref rv (- idx M)))))\\n (define bottom-wall? (< (random) p))\\n (define cell-value\\n (walls->cell left-wall? right-wall? top-wall? bottom-wall?))\\n (vector-set! rv idx cell-value))\\n rv)\\n\\n(define (display-percol-grid M . vs)\\n (define N (/ (vector-length (car vs)) M))\\n (define-syntax-rule (tab-eol m)\\n (when (= m (sub1 M)) (printf \\\"\\\\t\\\")))\\n (for ((n N))\\n (for* ((v vs) (m M))\\n (when (zero? m) (printf \\\"+\\\"))\\n (printf\\n (match (vector-ref v (+ (* n M) m))\\n ((? has-top-wall?) \\\"-+\\\")\\n ((? has-fluid?) \\\"#+\\\")\\n (else \\\".+\\\")))\\n (tab-eol m))\\n (newline)\\n (for* ((v vs) (m M))\\n (when (zero? m) (printf \\\"|\\\"))\\n (printf\\n (match (vector-ref v (+ (* n M) m))\\n ((and (? has-fluid?) (? has-right-wall?)) \\\"#|\\\")\\n ((? has-right-wall?) \\\".|\\\")\\n ((? has-fluid?) \\\"##\\\")\\n (else \\\"..\\\")))\\n (tab-eol m))\\n (newline))\\n (for* ((v vs) (m M))\\n (when (zero? m) (printf \\\"+\\\"))\\n (printf\\n (match (vector-ref v (+ (* (sub1 M) M) m))\\n ((? has-bottom-wall?) \\\"-+\\\")\\n ((? has-fluid?) \\\"#+\\\")\\n (else \\\".+\\\")))\\n (tab-eol m))\\n (newline))\\n\\n(define (find-bonded-grid-t/b-path M v)\\n (define N (/ (vector-length v) M))\\n\\n (define (flood-cell idx)\\n (cond\\n [(= (quotient idx M) N) #t] ; wootiments!\\n [(has-fluid? (vector-ref v idx)) #f] ; been here\\n [else (define cell (vector-ref v idx))\\n (vector-set! v idx (bitwise-ior cell 16))\\n (or (and (not (has-bottom-wall? cell)) (flood-cell (+ idx M)))\\n (and (not (has-left-wall? cell)) (flood-cell (- idx 1)))\\n (and (not (has-right-wall? cell)) (flood-cell (+ idx 1)))\\n (and (not (has-top-wall? cell))\\n (>= idx M) ; not top row\\n (flood-cell (- idx M))))]))\\n\\n (for/first ((m (in-range M))\\n #:unless (has-top-wall? (vector-ref v m))\\n #:when (flood-cell m)) #t))\\n\\n(define t (make-parameter 1000))\\n(define (experiment p)\\n (/ (for*/sum ((sample (in-range (t)))\\n (v (in-value (bonded-percol-grid 10 10 p)))\\n #:when (find-bonded-grid-t/b-path 10 v)) 1)\\n (t)))\\n\\n(define (main)\\n (for ((tenths (in-range 0 (add1 10))))\\n (define p (/ tenths 10))\\n (define e (experiment p))\\n (printf \\\"proportion of grids that percolate p=~a : ~a (~a)~%\\\"\\n p e (real->decimal-string e 5))))\\n\\n(module+ test\\n (define (make/display/flood/display-bonded-grid M N p attempts (atmpt 1))\\n (define v (bonded-percol-grid M N p))\\n (define v+ (vector-copy v))\\n (cond [(or (find-bonded-grid-t/b-path M v+) (= attempts 0))\\n (define v* (vector-copy v+))\\n (define (flood-bonded-grid)\\n (when (find-bonded-grid-t/b-path M v*)\\n (flood-bonded-grid)))\\n (flood-bonded-grid)\\n (display-percol-grid M v v+ v*)\\n (printf \\\"After ~a attempt(s)~%~%\\\" atmpt)]\\n [else\\n (make/display/flood/display-bonded-grid\\n M N p (sub1 attempts) (add1 atmpt))]))\\n\\n (make/display/flood/display-bonded-grid 10 10 0 20)\\n (make/display/flood/display-bonded-grid 10 10 .25 20)\\n (make/display/flood/display-bonded-grid 10 10 .50 20)\\n (make/display/flood/display-bonded-grid 10 10 .75 20000))\\n\",\n \"language\": \"Racket\"\n },\n {\n \"code\": \"my @bond;\\nmy $grid = 10;\\nmy $geom = $grid - 1;\\nmy $water = '▒';\\n\\nenum Direction <DeadEnd Up Right Down Left>;\\n\\nsay 'Sample percolation at .6';\\npercolate .6;\\n.join.say for @bond;\\nsay \\\"\\\\n\\\";\\n\\nmy $tests = 100;\\nsay \\\"Doing $tests trials at each porosity:\\\";\\nfor .1, .2 ... 1 -> $p {\\n printf \\\"p = %0.1f: %0.2f\\\\n\\\", $p, (sum percolate($p) xx $tests) / $tests\\n}\\n\\nsub percolate ( $prob ) {\\n generate $prob;\\n my @stack;\\n my $current = [1;0];\\n $current.&fill;\\n\\n loop {\\n if my $dir = direction( $current ) {\\n @stack.push: $current;\\n $current = move $dir, $current\\n }\\n else {\\n return False unless @stack;\\n $current = @stack.pop\\n }\\n return True if $current[1] == +@bond - 1\\n }\\n\\n sub direction( [$x, $y] ) {\\n ( Down if @bond[$y + 1][$x].contains: ' ' ) ||\\n ( Left if @bond[$y][$x - 1].contains: ' ' ) ||\\n ( Right if @bond[$y][$x + 1].contains: ' ' ) ||\\n ( Up if @bond[$y - 1][$x].defined && @bond[$y - 1][$x].contains: ' ' ) ||\\n DeadEnd\\n }\\n\\n sub move ( $dir, @cur ) {\\n my ( $x, $y ) = @cur;\\n given $dir {\\n when Up { [$x,--$y].&fill xx 2 }\\n when Down { [$x,++$y].&fill xx 2 }\\n when Left { [--$x,$y].&fill xx 2 }\\n when Right { [++$x,$y].&fill xx 2 }\\n }\\n [$x, $y]\\n }\\n\\n sub fill ( [$x, $y] ) { @bond[$y;$x].=subst(' ', $water, :g) }\\n}\\n\\nsub generate ( $prob = .5 ) {\\n @bond = ();\\n my $sp = ' ';\\n append @bond, [flat '│', ($sp, ' ') xx $geom, $sp, '│'],\\n [flat '├', (h(), '┬') xx $geom, h(), '┤'];\\n append @bond, [flat '│', ($sp, v()) xx $geom, $sp, '│'],\\n [flat '├', (h(), '┼') xx $geom, h(), '┤'] for ^$geom;\\n append @bond, [flat '│', ($sp, v()) xx $geom, $sp, '│'],\\n [flat '├', (h(), '┴') xx $geom, h(), '┤'],\\n [flat '│', ($sp, ' ') xx $geom, $sp, '│'];\\n\\n sub h () { rand < $prob ?? $sp !! '───' }\\n sub v () { rand < $prob ?? ' ' !! '│' }\\n}\\n\",\n \"language\": \"Raku\"\n },\n {\n \"code\": \"let randMax = 32767.0\\nlet filled = 1\\nlet rightWall = 2\\nlet bottomWall = 4\\n\\nfinal class Percolate {\\n let height: Int\\n let width: Int\\n\\n private var grid: [Int]\\n private var end: Int\\n\\n init(height: Int, width: Int) {\\n self.height = height\\n self.width = width\\n self.end = width\\n self.grid = [Int](repeating: 0, count: width * (height + 2))\\n }\\n\\n private func fill(at p: Int) -> Bool {\\n guard grid[p] & filled == 0 else { return false }\\n\\n grid[p] |= filled\\n\\n guard p < end else { return true }\\n\\n return (((grid[p + 0] & bottomWall) == 0) && fill(at: p + width)) ||\\n (((grid[p + 0] & rightWall) == 0) && fill(at: p + 1)) ||\\n (((grid[p - 1] & rightWall) == 0) && fill(at: p - 1)) ||\\n (((grid[p - width] & bottomWall) == 0) && fill(at: p - width))\\n }\\n\\n func makeGrid(porosity p: Double) {\\n grid = [Int](repeating: 0, count: width * (height + 2))\\n end = width\\n\\n let thresh = Int(randMax * p)\\n\\n for i in 0..<width {\\n grid[i] = bottomWall | rightWall\\n }\\n\\n for _ in 0..<height {\\n for _ in stride(from: width - 1, through: 1, by: -1) {\\n let r1 = Int.random(in: 0..<Int(randMax)+1)\\n let r2 = Int.random(in: 0..<Int(randMax)+1)\\n\\n grid[end] = (r1 < thresh ? bottomWall : 0) | (r2 < thresh ? rightWall : 0)\\n\\n end += 1\\n }\\n\\n let r3 = Int.random(in: 0..<Int(randMax)+1)\\n\\n grid[end] = rightWall | (r3 < thresh ? bottomWall : 0)\\n\\n end += 1\\n }\\n }\\n\\n @discardableResult\\n func percolate() -> Bool {\\n var i = 0\\n\\n while i < width && !fill(at: width + i) {\\n i += 1\\n }\\n\\n return i < width\\n }\\n\\n func showGrid() {\\n for _ in 0..<width {\\n print(\\\"+--\\\", terminator: \\\"\\\")\\n }\\n\\n print(\\\"+\\\")\\n\\n for i in 0..<height {\\n print(i == height ? \\\" \\\" : \\\"|\\\", terminator: \\\"\\\")\\n\\n for j in 0..<width {\\n print(grid[i * width + j + width] & filled != 0 ? \\\"[]\\\" : \\\" \\\", terminator: \\\"\\\")\\n print(grid[i * width + j + width] & rightWall != 0 ? \\\"|\\\" : \\\" \\\", terminator: \\\"\\\")\\n }\\n\\n print()\\n\\n guard i != height else { return }\\n\\n for j in 0..<width {\\n print(grid[i * width + j + width] & bottomWall != 0 ? \\\"+--\\\" : \\\"+ \\\", terminator: \\\"\\\")\\n }\\n\\n print(\\\"+\\\")\\n }\\n }\\n}\\n\\nlet p = Percolate(height: 10, width: 10)\\n\\np.makeGrid(porosity: 0.5)\\np.percolate()\\np.showGrid()\\n\\nprint(\\\"Running \\\\(p.height) x \\\\(p.width) grid 10,000 times for each porosity\\\")\\n\\nfor factor in 1...10 {\\n var count = 0\\n let porosity = Double(factor) / 10.0\\n\\n for _ in 0..<10_000 {\\n p.makeGrid(porosity: porosity)\\n\\n if p.percolate() {\\n count += 1\\n }\\n }\\n\\n print(\\\"p = \\\\(porosity): \\\\(Double(count) / 10_000.0)\\\")\\n}\\n\",\n \"language\": \"Swift\"\n },\n {\n \"code\": \"package require Tcl 8.6\\n\\n# Structure the bond percolation system as a class\\noo::class create BondPercolation {\\n variable hwall vwall cells M N\\n constructor {width height probability} {\\n\\tset M $height\\n\\tset N $width\\n\\tfor {set i 0} {$i <= $height} {incr i} {\\n\\t for {set j 0;set walls {}} {$j < $width} {incr j} {\\n\\t\\tlappend walls [expr {rand() < $probability}]\\n\\t }\\n\\t lappend hwall $walls\\n\\t}\\n\\tfor {set i 0} {$i <= $height} {incr i} {\\n\\t for {set j 0;set walls {}} {$j <= $width} {incr j} {\\n\\t\\tlappend walls [expr {$j==0 || $j==$width || rand() < $probability}]\\n\\t }\\n\\t lappend vwall $walls\\n\\t}\\n\\tset cells [lrepeat $height [lrepeat $width 0]]\\n }\\n\\n method print {{percolated \\\"\\\"}} {\\n\\tset nw [string length $M]\\n\\tset grid $cells\\n\\tif {$percolated ne \\\"\\\"} {\\n\\t lappend grid [lrepeat $N 0]\\n\\t lset grid end $percolated 1\\n\\t}\\n\\tforeach hws $hwall vws [lrange $vwall 0 end-1] r $grid {\\n\\t incr row\\n\\t puts -nonewline [string repeat \\\" \\\" [expr {$nw+2}]]\\n\\t foreach w $hws {\\n\\t\\tputs -nonewline [if {$w} {subst \\\"+-\\\"} {subst \\\"+ \\\"}]\\n\\t }\\n\\t puts \\\"+\\\"\\n\\t puts -nonewline [format \\\"%-*s\\\" [expr {$nw+2}] [expr {\\n\\t\\t$row>$M ? $percolated eq \\\"\\\" ? \\\" \\\" : \\\">\\\" : \\\"$row)\\\"\\n\\t }]]\\n\\t foreach v $vws c $r {\\n\\t\\tputs -nonewline [if {$v==1} {subst \\\"|\\\"} {subst \\\" \\\"}]\\n\\t\\tputs -nonewline [if {$c==1} {subst \\\"#\\\"} {subst \\\" \\\"}]\\n\\t }\\n\\t puts \\\"\\\"\\n\\t}\\n }\\n\\n method percolate {} {\\n\\ttry {\\n\\t for {set i 0} {$i < $N} {incr i} {\\n\\t\\tif {![lindex $hwall 0 $i]} {\\n\\t\\t my FloodFill $i 0\\n\\t\\t}\\n\\t }\\n\\t return \\\"\\\"\\n\\t} trap PERCOLATED n {\\n\\t return $n\\n\\t}\\n }\\n method FloodFill {x y} {\\n\\t# fill cell\\n\\tlset cells $y $x 1\\n\\t# bottom\\n\\tif {![lindex $hwall [expr {$y+1}] $x]} {\\n\\t if {$y == $N-1} {\\n\\t\\t# THE bottom\\n\\t\\tthrow PERCOLATED $x\\n\\t }\\n\\t if {$y < $N-1 && ![lindex $cells [expr {$y+1}] $x]} {\\n\\t\\tmy FloodFill $x [expr {$y+1}]\\n\\t }\\n\\t}\\n\\t# left\\n\\tif {![lindex $vwall $y $x] && ![lindex $cells $y [expr {$x-1}]]} {\\n\\t my FloodFill [expr {$x-1}] $y\\n\\t}\\n\\t# right\\n\\tif {![lindex $vwall $y [expr {$x+1}]] && ![lindex $cells $y [expr {$x+1}]]} {\\n\\t my FloodFill [expr {$x+1}] $y\\n\\t}\\n\\t# top\\n\\tif {$y>0 && ![lindex $hwall $y $x] && ![lindex $cells [expr {$y-1}] $x]} {\\n\\t my FloodFill $x [expr {$y-1}]\\n\\t}\\n }\\n}\\n\\n# Demonstrate one run\\nputs \\\"Sample percolation, 10x10 p=0.5\\\"\\nBondPercolation create bp 10 10 0.5\\nbp print [bp percolate]\\nbp destroy\\nputs \\\"\\\"\\n\\n# Collect some aggregate statistics\\napply {{} {\\n puts \\\"Percentage of tries that percolate, varying p\\\"\\n set tries 100\\n for {set pint 0} {$pint <= 10} {incr pint} {\\n\\tset p [expr {$pint * 0.1}]\\n\\tset tot 0\\n\\tfor {set i 0} {$i < $tries} {incr i} {\\n\\t set bp [BondPercolation new 10 10 $p]\\n\\t if {[$bp percolate] ne \\\"\\\"} {\\n\\t\\tincr tot\\n\\t }\\n\\t $bp destroy\\n\\t}\\n\\tputs [format \\\"p=%.2f: %2.1f%%\\\" $p [expr {$tot*100./$tries}]]\\n }\\n}}\\n\",\n \"language\": \"Tcl\"\n },\n {\n \"code\": \"import \\\"random\\\" for Random\\nimport \\\"./fmt\\\" for Fmt\\n\\nvar rand = Random.new()\\nvar RAND_MAX = 32767\\n\\n// cell states\\nvar FILL = 1\\nvar RWALL = 2 // right wall\\nvar BWALL = 4 // bottom wall\\n\\nvar x = 10\\nvar y = 10\\nvar grid = List.filled(x * (y + 2), 0)\\nvar cells = 0\\nvar end = 0\\nvar m = 0\\nvar n = 0\\n\\nvar makeGrid = Fn.new { |p|\\n var thresh = (p * RAND_MAX).truncate\\n m = x\\n n = y\\n for (i in 0...grid.count) grid[i] = 0 // clears grid\\n for (i in 0...m) grid[i] = BWALL | RWALL\\n cells = m\\n end = m\\n for (i in 0...y) {\\n for (j in x - 1..1) {\\n var r1 = rand.int(RAND_MAX + 1)\\n var r2 = rand.int(RAND_MAX + 1)\\n grid[end] = ((r1 < thresh) ? BWALL : 0) |\\n ((r2 < thresh) ? RWALL : 0)\\n end = end + 1\\n }\\n var r3 = rand.int(RAND_MAX + 1)\\n grid[end] = RWALL | ((r3 < thresh) ? BWALL : 0)\\n end = end + 1\\n }\\n}\\n\\nvar showGrid = Fn.new {\\n for (j in 0...m) System.write(\\\"+--\\\")\\n System.print(\\\"+\\\")\\n\\n for (i in 0..n) {\\n System.write((i == n) ? \\\" \\\" : \\\"|\\\")\\n for (j in 0...m) {\\n System.write(((grid[i * m + j + cells] & FILL) != 0) ? \\\"[]\\\" : \\\" \\\")\\n System.write(((grid[i * m + j + cells] & RWALL) != 0) ? \\\"|\\\" : \\\" \\\")\\n }\\n System.print()\\n if (i == n) return\\n for (j in 0...m) {\\n System.write(((grid[i * m + j + cells] & BWALL) != 0) ? \\\"+--\\\" : \\\"+ \\\")\\n }\\n System.print(\\\"+\\\")\\n }\\n}\\n\\nvar fill // recursive\\nfill = Fn.new { |p|\\n if ((grid[p] & FILL) != 0) return false\\n grid[p] = grid[p] | FILL\\n if (p >= end) return true // success: reached bottom row\\n return (((grid[p + 0] & BWALL) == 0) && fill.call(p + m)) ||\\n (((grid[p + 0] & RWALL) == 0) && fill.call(p + 1)) ||\\n (((grid[p - 1] & RWALL) == 0) && fill.call(p - 1)) ||\\n (((grid[p - m] & BWALL) == 0) && fill.call(p - m))\\n}\\n\\nvar percolate = Fn.new {\\n var i = 0\\n while (i < m && !fill.call(cells + i)) i = i + 1\\n return i < m\\n}\\n\\nmakeGrid.call(0.5)\\npercolate.call()\\nshowGrid.call()\\n\\nSystem.print(\\\"\\\\nRunning %(x) x %(y) grids 10,000 times for each p:\\\")\\nfor (p in 1..9) {\\n var cnt = 0\\n var pp = p / 10\\n for (i in 0...10000) {\\n makeGrid.call(pp)\\n if (percolate.call()) cnt = cnt + 1\\n }\\n Fmt.print(\\\"p = $3g: $.4f\\\", pp, cnt / 10000)\\n}\\n\",\n \"language\": \"Wren\"\n },\n {\n \"code\": \"// cell states\\nconst FILLED=1; // and odd\\nconst RWALL =2; // right wall\\nconst BWALL =4; // bottom wall\\nfcn P(p,wall){ (0.0).random(1)<p and wall or 0 }\\n\\nfcn makeGrid(m,n,p){\\n // Allocate two addition rows to avoid checking bounds.\\n // Bottom row is also required by drippage\\n grid:=Data(m*(n+2));\\n do(m){ grid.write(BWALL + RWALL); } // grid is topped with walls\\n do(n){\\n do(m-1){ grid.write( P(p,BWALL) + P(p,RWALL) ) }\\n grid.write(RWALL + P(p,BWALL)); // right border is all right wall, as is left border\\n }\\n do(m){ grid.write(0); } // for drips off the bottom of grid\\n grid\\n}\\nfcn show(grid,m,n){ n+=1;\\n println(\\\"+--\\\"*m,\\\"+\\\");\\n foreach i in ([1..n]){ y:=i*m;\\n print(i==n and \\\" \\\" or \\\"|\\\"); // bottom row is special, otherwise always have left wall\\n foreach j in (m){ c:=grid[y + j];\\n print(c.bitAnd(FILLED) and \\\"**\\\" or \\\" \\\", c.bitAnd(RWALL)and\\\"|\\\"or\\\" \\\");\\n }\\n println();\\n\\n if(i==n) return(); // nothing under the bottom row\\n\\n foreach j in (m){ print((grid[y + j].bitAnd(BWALL)) and \\\"+--\\\" or \\\"+ \\\"); }\\n println(\\\"+\\\");\\n }\\n}\\nfcn fill(grid,x,m){\\n if(grid[x].isOdd) return(False); // aka .bitAnd(FILLED) aka already been here\\n grid[x]+=FILLED;\\n if(x+m>=grid.len()) return(True); // success: reached bottom row\\n return(( not grid[x] .bitAnd(BWALL) and fill(grid,x + m,m) ) or // down\\n ( not grid[x] .bitAnd(RWALL) and fill(grid,x + 1,m) ) or // right\\n ( not grid[x - 1].bitAnd(RWALL) and fill(grid,x - 1,m) ) or // left\\n ( not grid[x - m].bitAnd(BWALL) and fill(grid,x - m,m) )); // up\\n}\\nfcn percolate(grid,m){\\n i:=0; while(i<m and not fill(grid,i+m,m)){ i+=1; } // pour juice on top row\\n return(i<m); // percolated through the grid?\\n}\\n\",\n \"language\": \"Zkl\"\n },\n {\n \"code\": \"grid:=makeGrid(10,10,0.40);\\nprintln(\\\"Did liquid percolate: \\\",percolate(grid,10)); show(grid,10,10);\\n\\nprintln(\\\"Running 10,000 tests for each case:\\\");\\nforeach p in ([0.0 .. 1.0, 0.1]){\\n cnt:=0.0; do(10000){ cnt+=percolate(makeGrid(10,10,p),10); }\\n \\\"p=%.1f: %.4f\\\".fmt(p, cnt/10000).println();\\n}\\n\",\n \"language\": \"Zkl\"\n }\n]","isConversational":false},"task_name":{"kind":"string","value":"Percolation-Bond-percolation"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":14,"numItemsPerPage":100,"numTotalItems":1840,"offset":1400,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4OTY0NjY2OSwianRpIjoiNTIyY2I1MzUtMWUwYy00ZDc3LTkzYjUtMDZjMmM2MWEyMDg4Iiwic3ViIjoiL2RhdGFzZXRzL0d1eXRyb24vUm9zZXR0YUNvZGVEYXRhU2V0MSIsImV4cCI6MTc4OTY1MDI2OSwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.MQv0FysAWwtSDK7hHJEvMb3emCUAQFiOora0sfNKItnLkJqdJs1UHdIRyXYWyCnoSTFpvTGZuxPiziFWbeaCBA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":1840,"numBytesParquet":69595962}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
solutions listlengths 2 791 | task_name stringlengths 2 86 |
|---|---|
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Meissel–Mertens_constant\n",
"language": "00-META"
},
{
"code": ";Task:\nCalculate Meissel–Mertens constant up to a precision your language can handle.\n\n\n;Motivation:\nAnalogous to Euler's constant, which is important in determining the sum of rec... | Meissel-Mertens-constant |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Memory_allocation\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nShow how to explicitly allocate and deallocate blocks of memory in your language. \n\nShow access to different types of memory (i.e., [[heap]], [[system ... | Memory-allocation |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Memory_layout_of_a_data_structure\n",
"language": "00-META"
},
{
"code": "It is often useful to control the memory layout of fields in a data structure to match an interface control definition, or to interface with hardware. Define a data structure m... | Memory-layout-of-a-data-structure |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Merge_and_aggregate_datasets\nnote: Data Structures\n",
"language": "00-META"
},
{
"code": "Merge and aggregate datasets\n\n\n;Task:\nMerge and aggregate two datasets as provided in '''.csv''' files into a new resulting dataset.\n\nUse ... | Merge-and-aggregate-datasets |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Mertens_function\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The Mertens function '''M(x)''' is the '''count''' of '''square-free integers''' up to '''x''' that have an '''even number''' of prime factors, '''minus''' the '''count''' ... | Mertens-function |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Metallic_ratios\n",
"language": "00-META"
},
{
"code": "Many people have heard of the '''Golden ratio''', phi ('''φ'''). Phi is just one of a series\nof related ratios that are referred to as the \"'''Metallic ratios'''\".\n\nThe '''Golden ratio''' w... | Metallic-ratios |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Metered_concurrency\nnote: Concurrency\nrequires:\n- Concurrency\n",
"language": "00-META"
},
{
"code": "The goal of this task is to create a [[wp:Counting semaphore|counting semaphore]] used to control the execution of a set of concurrent units. Thi... | Metered-concurrency |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Metronome\n",
"language": "00-META"
},
{
"code": "The task is to implement a [https://en.wikipedia.org/wiki/Metronomemetronome metronome]. \n\nThe metronome should be capable of producing high and low audio beats, accompanied by a visual beat ... | Metronome |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Mian-Chowla_sequence\n",
"language": "00-META"
},
{
"code": "The [[wp:Mian–Chowla sequence|Mian–Chowla sequence]] is an integer sequence defined recursively.\n\n\nMian–Chowla is an infinite instance of a [[wp:Sidon sequence|Sidon sequence]], and belo... | Mian-Chowla-sequence |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Miller–Rabin_primality_test\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "The [[wp:Miller–Rabin primality test|Miller–Rabin primality test]] or Rabin–Miller primality test is a primality test: an algorithm which determines whether a gi... | Miller-Rabin-primality-test |
[
{
"code": "---\ncategory:\n- Puzzles\nfrom: http://rosettacode.org/wiki/Mind_boggling_card_trick\n",
"language": "00-META"
},
{
"code": "Matt Parker of the \"Stand Up Maths channel\" has a [https://www.youtube.com/watch?v=aNpGxZ_1KXU <u>YouTube video</u>] of a card trick that creates a... | Mind-boggling-card-trick |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Minesweeper_game\nnote: games\n",
"language": "00-META"
},
{
"code": "There is an n by m grid that has a random number (between 10% to 20% of the total number of tiles, though older implementations may use 20%..60% instead) of randomly placed mines t... | Minesweeper-game |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Minimum_multiple_of_m_where_digital_sum_equals_m\n",
"language": "00-META"
},
{
"code": "Generate the sequence '''a(n)''' when each element is the minimum integer multiple '''m''' such that the digit sum of '''n''' times '''m''' is equal to '''n'''.\... | Minimum-multiple-of-m-where-digital-sum-equals-m |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Minimum_positive_multiple_in_base_10_using_only_0_and_1\n",
"language": "00-META"
},
{
"code": "Every positive integer has infinitely many base-10 multiples that only use the digits '''0''' and '''1'''. The goal of this task is to find and display th... | Minimum-positive-multiple-in-base-10-using-only-0-and-1 |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Minkowski_question-mark_function\n",
"language": "00-META"
},
{
"code": "The '''Minkowski question-mark function''' converts the continued fraction representation {{math|[a<sub>0</sub>; a<sub>1</sub>, a<sub>2</sub>, a<sub>3</sub>, ...]}} of a number ... | Minkowski-question-mark-function |
[
{
"code": "---\ncategory:\n- Mathematics\nfrom: http://rosettacode.org/wiki/Modular_arithmetic\n",
"language": "00-META"
},
{
"code": "'''[[wp:Modular arithmetic|Modular arithmetic]]''' is a form of arithmetic (a calculation technique involving the concepts of addition and multiplication) which is d... | Modular-arithmetic |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Modular_exponentiation\n",
"language": "00-META"
},
{
"code": "Find the last '''40''' decimal digits of <math>a^b</math>, where\n\n::* <math>a = 2988348162058574136915891421498819466320163312926952423791023078876139... | Modular-exponentiation |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Modular_inverse\n",
"language": "00-META"
},
{
"code": "From [http://en.wikipedia.org/wiki/Modular_multiplicative_inverse Wikipedia]:\n\nIn [[wp:modular arithmetic|modular arithmetic]], the '''modular multiplicative inverse''' of an [[integer]... | Modular-inverse |
[
{
"code": "---\ncategory:\n- Monads\nfrom: http://rosettacode.org/wiki/Monads/Maybe_monad\n",
"language": "00-META"
},
{
"code": "Demonstrate in your programming language the following:\n\n#Construct a Maybe Monad by writing the 'bind' function and the 'unit' (sometimes known as 'return') function f... | Monads-Maybe-monad |
[
{
"code": "---\ncategory:\n- Monads\nfrom: http://rosettacode.org/wiki/Monads/Writer_monad\n",
"language": "00-META"
},
{
"code": "The Writer monad is a programming design pattern which makes it possible to compose functions which return their result values paired with a log string. The final result... | Monads-Writer-monad |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Monte_Carlo_methods\nnote: Probability and statistics\n",
"language": "00-META"
},
{
"code": "A '''Monte Carlo Simulation''' is a way of approximating the value of a function \nwhere calculating the actual value is difficult or impossible. <br>\nIt u... | Monte-Carlo-methods |
[
{
"code": "---\ncategory:\n- Temporal media\nfrom: http://rosettacode.org/wiki/Morse_code\nnote: Sound\nrequires:\n- Sound\n",
"language": "00-META"
},
{
"code": "[[wp:Morse_code|Morse code]] is one of the simplest and most versatile methods of telecommunication in existence. \nIt has been in use fo... | Morse-code |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Motzkin_numbers\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Definition\nThe '''n'''th [https://en.wikipedia.org/wiki/Motzkin_number Motzkin number] (denoted by M[n]) is the number of different ways of drawing non-intersecting chords... | Motzkin-numbers |
[
{
"code": "---\ncategory:\n- Testing\n- Hardware\n- Pointing devices\nfrom: http://rosettacode.org/wiki/Mouse_position\nnote: GUI\n",
"language": "00-META"
},
{
"code": ";Task:\nGet the current location of the mouse cursor relative to the active window. \n\nPlease specify if the window may be extern... | Mouse-position |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Multi-base_primes\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "Prime numbers are prime no matter what base they are represented in.\n\nA prime number in a base other than 10 may not ''look'' prime at first glance.\n\nFor instance: '''... | Multi-base-primes |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Multi-dimensional_array\n",
"language": "00-META"
},
{
"code": "For the purposes of this task, the actual memory layout or access method of this data structure is not mandated. \n\nIt is enough to:\n# State the number and extent of each index to the ... | Multi-dimensional-array |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Multifactorial\n",
"language": "00-META"
},
{
"code": "The factorial of a number, written as <math>n!</math>, is defined as <math>n! = n(n-1)(n-2)...(2)(1)</math>.\n\n[http://mathworld.wolfram.com/Multifactorial.html Multifactorials] generalize facto... | Multifactorial |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Multiple_regression\nnote: Probability and statistics\n",
"language": "00-META"
},
{
"code": ";Task:\nGiven a set of data vectors in the following format:\n\n <math>y = \\{ y_1, y_2, ..., y_n \\}\\,</math>\n\n <math>X_i = \\{ x_{i1}, x_{i2}, ..... | Multiple-regression |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Multiplication_tables\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": ";Task:\nProduce a formatted 12×12 multiplication table of the kind memorized by rote when in primary (or elementary) s... | Multiplication-tables |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Multiplicative_order\nnote: Discrete math\n",
"language": "00-META"
},
{
"code": "The '''multiplicative order''' of ''a'' relative to ''m'' is the least positive integer ''n'' such that ''a^n'' is 1 (modulo ''m'').\n\n\n;Example:\nThe multiplicative ... | Multiplicative-order |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Munchausen_numbers\n",
"language": "00-META"
},
{
"code": "A [[wp:Munchausen number|Munchausen number]] is a natural number ''n'' the sum of whose digits (in base 10), each raised to the power of itself, equals ''n''.\n\n('''Munchausen''' is also spe... | Munchausen-numbers |
[
{
"code": "---\ncategory:\n- Graphics algorithms\nfrom: http://rosettacode.org/wiki/Munching_squares\nnote: Raster graphics operations\n",
"language": "00-META"
},
{
"code": "Render a graphical pattern where each pixel is colored by the value of 'x xor y' from an arbitrary [[wp:color table|color tab... | Munching-squares |
[
{
"code": "---\ncategory:\n- Temporal media\nfrom: http://rosettacode.org/wiki/Musical_scale\n",
"language": "00-META"
},
{
"code": ";Task:\nOutput the 8 notes of the <b>C major</b> diatonic scale to the default musical sound device on the system. Specifically, pitch must be tuned to 12-tone equal t... | Musical-scale |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Mutual_recursion\nnote: recursion\n",
"language": "00-META"
},
{
"code": "Two functions are said to be mutually recursive if the first calls the second, \nand in turn the second calls the first.\n\nWrite two mutually recursive functions that compute ... | Mutual-recursion |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/N-queens_problem\n",
"language": "00-META"
},
{
"code": "Solve the [[WP:Eight_queens_puzzle|eight queens puzzle]]. \n\n\nYou can extend the problem to solve the puzzle with a board of size <big>'''N'''x'''N'''</big>.\n \nFor the number of solu... | N-queens-problem |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/N-smooth_numbers\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": "'''n-smooth''' numbers are positive integers which have no prime factors <big> > </big> '''n'''.\n\nThe '''n''' in the expression '''n-smooth... | N-smooth-numbers |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Naming_conventions\nnote: Programming environment operations\n",
"language": "00-META"
},
{
"code": "Many languages have naming conventions regarding the identifiers used in the language, its libraries, and programs written in th... | Naming-conventions |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Narcissist\n",
"language": "00-META"
},
{
"code": "Quoting from the [http://esolangs.org/wiki/Narcissist Esolangs wiki page]:\n\n<blockquote>\nA '''narcissist''' (or '''Narcissus program''') is the decision-problem version of a [[quine]].\n</blockquo... | Narcissist |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Narcissistic_decimal_number\n",
"language": "00-META"
},
{
"code": "A [http://mathworld.wolfram.com/NarcissisticNumber.html Narcissistic decimal number] is a non-negative integer, <math>n</math>, that is equal to the sum o... | Narcissistic-decimal-number |
[
{
"code": "---\ncategory:\n- Date and time\nfrom: http://rosettacode.org/wiki/Nautical_bell\n",
"language": "00-META"
},
{
"code": ";Task\n\nWrite a small program that emulates a [[wp:Ship's bell#Timing_of_duty_periods|nautical bell]] producing a ringing bell pattern at certain times throughout the ... | Nautical-bell |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Negative_base_numbers\n",
"language": "00-META"
},
{
"code": "Negative base numbers are an alternate way to encode numbers without the need for a minus sign. Various negative bases may be used including negadecimal (base -10), negabinary (-2) and neg... | Negative-base-numbers |
[
{
"code": "---\ncategory:\n- Scope\n- Functions and subroutines\nfrom: http://rosettacode.org/wiki/Nested_function\n",
"language": "00-META"
},
{
"code": "In many languages, functions can be nested, resulting in outer functions and inner functions. The inner function can access variables from the ou... | Nested-function |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Next_highest_int_from_digits\n",
"language": "00-META"
},
{
"code": "Given a zero or positive integer, the task is to generate the next largest\ninteger using only the given digits<sup>*1</sup>.\n\n* Numbers will not be padded to the left with... | Next-highest-int-from-digits |
[
{
"code": "---\ncategory:\n- Puzzles\n- Games\nfrom: http://rosettacode.org/wiki/Nim_game\n",
"language": "00-META"
},
{
"code": "Nim is a simple game where the second player─if they know the trick─will always win.\n\n\nThe game has only 3 rules:\n::* start with '''12''' tokens\... | Nim-game |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Non-continuous_subsequences\nnote: Discrete math\n",
"language": "00-META"
},
{
"code": "Consider some sequence of elements. (It differs from a mere set of elements by having an ordering among members.)\n\nA ''subsequence'' contains some subset of th... | Non-continuous-subsequences |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Non-decimal_radices/Input\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "It is common to have a string containing a number written in some format, with the most common ones being decimal, hexadecimal, octal and binary. Such stri... | Non-decimal-radices-Input |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Non-decimal_radices/Output\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "Programming languages often have built-in routines to convert a non-negative integer for printing in different number bases. Such common number bases migh... | Non-decimal-radices-Output |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Non-transitive_dice\n",
"language": "00-META"
},
{
"code": "Let our dice select numbers on their faces with equal probability, i.e. fair dice.\nDice may have more or less than six faces. (The possibility of there being a \n3D physical shape that has ... | Non-transitive-dice |
[
{
"code": "---\ncategory:\n- Puzzles\nfrom: http://rosettacode.org/wiki/Nonogram_solver\n",
"language": "00-META"
},
{
"code": "A [[wp:Nonogram|nonogram]] is a puzzle that provides \nnumeric clues used to fill in a grid of cells, \nestablishing for each cell whether it is filled or not. \nThe puzzle... | Nonogram-solver |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/N'th\nnote: Ordinal numbers\n",
"language": "00-META"
},
{
"code": "Write a function/method/subroutine/... that when given an integer greater than or equal to zero returns a string of the number followed by an apostr... | Nth |
[
{
"code": "---\ncategory:\n- Simple\nfrom: http://rosettacode.org/wiki/Nth_root\nnote: Classic CS problems and programs\n",
"language": "00-META"
},
{
"code": ";Task:\nImplement the algorithm to compute the principal [[wp:Nth root|<big>''n''<sup>th</sup></big> root]] <big><big><... | Nth-root |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Number_names\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": ";Task:\nShow how to spell out a number in English. \n\nYou can use a preexisting implementation or roll your own, but you should support inputs up to at least one milli... | Number-names |
[
{
"code": "---\ncategory:\n- Puzzles\nfrom: http://rosettacode.org/wiki/Number_reversal_game\nnote: Games\n",
"language": "00-META"
},
{
"code": ";Task:\nGiven a jumbled list of the numbers '''1''' to '''9''' that are definitely ''not'' in \nascending order.... | Number-reversal-game |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Numbers_which_are_not_the_sum_of_distinct_squares\n",
"language": "00-META"
},
{
"code": "Integer squares are the set of integers multiplied by themselves: 1 x 1 = '''1''', 2 × 2 = '''4''', 3 × 3 = '''9''', etc. ( 1, 4, 9, 16 ... )\n\nMost positive i... | Numbers-which-are-not-the-sum-of-distinct-squares |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Numbers_with_equal_rises_and_falls\n",
"language": "00-META"
},
{
"code": "When a number is written in base 10, adjacent digits may \"rise\" or \"fall\" as the number is read (usually from left to right).\n\n\n;Definition:\nGiven the de... | Numbers-with-equal-rises-and-falls |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Numeric_error_propagation\n",
"language": "00-META"
},
{
"code": "If '''f''', '''a''', and '''b''' are values with uncertainties σ<sub>f</sub>, σ<sub>a</sub>, and σ<sub>b</sub>, an... | Numeric-error-propagation |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Numerical_and_alphabetical_suffixes\n",
"language": "00-META"
},
{
"code": "This task is about expressing numbers with an attached (abutted) suffix multiplier(s), the suffix(es) could be:\n::* an alphabetic (named) multiplier which coul... | Numerical-and-alphabetical-suffixes |
[
{
"code": "---\ncategory:\n- Arithmetic\n- Mathematics\nfrom: http://rosettacode.org/wiki/Numerical_integration/Gauss-Legendre_Quadrature\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "{|border=1 cellspacing=0 cellpadding=3\n|In a general [[wp:Gaussian quadrature|Gaussian quadr... | Numerical-integration-Gauss-Legendre-Quadrature |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Object_serialization\nnote: Object oriented\n",
"language": "00-META"
},
{
"code": "Create a set of data types based upon [[inheritance]]. Each data type or class should have a print command that displays the contents of an instance of that class to ... | Object-serialization |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Odd_word_problem\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a program that solves the [http://c2.com/cgi/wiki?OddWordProblem odd word problem] with the restrictions given below.\n\n\n;Description:\nYou are promised an input stream consisti... | Odd-word-problem |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Old_Russian_measure_of_length\n",
"language": "00-META"
},
{
"code": ";Task:\nWrite a program to perform a conversion of the old Russian measures of length to the metric system (and vice versa).\n\n\nIt is an example of a linear transformation... | Old-Russian-measure-of-length |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/OLE_automation\nnote: OLE Automation Client and Server\n",
"language": "00-META"
},
{
"code": "[http://en.wikipedia.org/wiki/OLE_Automation OLE Automation] is an inter-process communication mechanism based on [http://en.wikipedia.org/wi... | OLE-automation |
[
{
"code": "---\ncategory:\n- Cellular automata\nfrom: http://rosettacode.org/wiki/One-dimensional_cellular_automata\nnote: Games\n",
"language": "00-META"
},
{
"code": "Assume an array of cells with an initial distribution of live and dead cells, \nand imaginary cells off the end of the array having... | One-dimensional-cellular-automata |
[
{
"code": "---\ncategory:\n- Encryption\n- File_handling\nfrom: http://rosettacode.org/wiki/One-time_pad\n",
"language": "00-META"
},
{
"code": "Implement a [[wp:One-time pad|One-time pad]], for encrypting and decrypting messages.<br>\nTo keep it simple, we will be using letters only.\n\n;Sub-Tasks:... | One-time-pad |
[
{
"code": "---\ncategory:\n- GUI\n- Temporal media\nfrom: http://rosettacode.org/wiki/OpenGL\nnote: 3D\nrequires:\n- Graphics\n",
"language": "00-META"
},
{
"code": ";Task:\nDisplay a smooth shaded triangle with OpenGL.\n\n[[image:Triangle.png|right|thumb|300px|Triangle created using C example compi... | OpenGL |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/OpenWebNet_password\n",
"language": "00-META"
},
{
"code": "Calculate the password requested by ethernet gateways from the Legrand / Bticino MyHome OpenWebNet home automation system when the user's ip address is not in the gateway's whitelist\n\n'''N... | OpenWebNet-password |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Optional_parameters\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": ";Task:\nDefine a function/method/subroutine which sorts a sequence (\"table\") of sequences (\"rows\") of strings (\"cells\"), by one of the strings. Besides t... | Optional-parameters |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Order_by_pair_comparisons\nnote: Sorting Algorithms\n",
"language": "00-META"
},
{
"code": "{{Sorting Algorithm}}\n[[Category:Sorting]]\n\nAssume we have a set of items that can be sorted into an order by the user.\n\nThe user is presented with pairs... | Order-by-pair-comparisons |
[
{
"code": "---\ncategory:\n- Sorting\nfrom: http://rosettacode.org/wiki/Order_disjoint_list_items\nnote: Sorting Algorithms\n",
"language": "00-META"
},
{
"code": "{{Sorting Algorithm}}\n\nGiven <code>M</code> as a list of items and another list <code>N</code> of items ch... | Order-disjoint-list-items |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ordered_partitions\nnote: Discrete math\n",
"language": "00-META"
},
{
"code": "In this task we want to find the ordered partitions into fixed-size blocks. \n\nThis task is related to [[Combinations]] in that it has to do with discrete mathematics an... | Ordered-partitions |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ordered_words\nnote: text processing\n",
"language": "00-META"
},
{
"code": "An ''ordered word'' is a word in which the letters appear in alphabetic order. \n\nExamples include '''abbey''' and '''dirt'''. \n\n{{task... | Ordered-words |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Ormiston_triples\n",
"language": "00-META"
},
{
"code": ";Definition\nAn '''Ormiston triple''' is three consecutive prime numbers which are anagrams, i.e. contain the same decimal digits but in a different order.\n\n;Example\nThe three consecutive pr... | Ormiston-triples |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/P-Adic_numbers,_basic\nnote: mathematics\n",
"language": "00-META"
},
{
"code": ";Conversion and addition of [[wp:P-adic_number|p-adic Numbers]].\n\n\n;Task.\n\nConvert two rationals to p-adic numbers and add them up.\nRational reconstruction is need... | P-Adic-numbers-basic |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/P-Adic_square_roots\nnote: mathematics\n",
"language": "00-META"
},
{
"code": ";Task.\n\nConvert rational a/b to its approximate [[wp:Hensel%27s_lemma#Hensel's_lemma_for_p-adic_numbers|p-adic square root]]. To check the result,\nsquare the root and c... | P-Adic-square-roots |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/P-value_correction\nnote: Probability and statistics\n",
"language": "00-META"
},
{
"code": "Given a list of [[wp:p-value|p-values]], adjust the p-values for multiple comparisons. This is done in order to control the false positive, or Type 1 error r... | P-value-correction |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Padovan_sequence\n",
"language": "00-META"
},
{
"code": "The [[wp:Padovan sequence|Padovan sequence]] is similar to the [[wp:Fibonacci sequence|Fibonacci sequence]] in several ways.\nSome are given in the table below, and the referenced video shows s... | Padovan-sequence |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Palindrome_dates\n",
"language": "00-META"
},
{
"code": "Today ('''2020-02-02''', at the time of this writing) happens to be a palindrome, without the hyphens, not only for those countries which express their dates ... | Palindrome-dates |
[
{
"code": "---\ncategory:\n- Recursion\n- String manipulation\n- Classic CS problems and programs\n- Palindromes\nfrom: http://rosettacode.org/wiki/Palindrome_detection\nnote: Text processing\n",
"language": "00-META"
},
{
"code": "A [[wp:Palindrome|palindrome]] is a phrase which reads the same back... | Palindrome-detection |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pancake_numbers\n",
"language": "00-META"
},
{
"code": "Adrian Monk has problems and an assistant, Sharona Fleming. Sharona can deal with most of Adrian's problems except his lack of punctuality paying her remuneration. 2 pay checks down and she pre... | Pancake-numbers |
[
{
"code": "---\ncategory:\n- String manipulation\nfrom: http://rosettacode.org/wiki/Pangram_checker\n",
"language": "00-META"
},
{
"code": "A pangram is a sentence that contains all the letters of the English alphabet at least once.\n\nFor example: ''The quick brown fox jumps over the lazy do... | Pangram-checker |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Paraffins\n",
"language": "00-META"
},
{
"code": "This organic chemistry task is essentially to implement a tree enumeration algorithm.\n\n\n;Task:\nEnumerate, without repetitions and in order of increasing size, all possible paraffin molecules (also... | Paraffins |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Parallel_calculations\nnote: Control Structures\n",
"language": "00-META"
},
{
"code": "Many programming languages allow you to specify computations to be run in parallel. \nWhile [[Concurrent computing]] is focused on concurrency, \nthe purpose of t... | Parallel-calculations |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Parameterized_SQL_statement\nnote: Database operations\n",
"language": "00-META"
},
{
"code": "Parameterized SQL statements are an easy way to avoid [[wp:SQL injection|SQL injection]] attacks. SQL drivers and libraries will automatically \"sanitize\"... | Parameterized-SQL-statement |
[
{
"code": "---\ncategory:\n- Type System\nfrom: http://rosettacode.org/wiki/Parametric_polymorphism\nnote: Basic language learning\n",
"language": "00-META"
},
{
"code": "[[wp:Parametric Polymorphism|Parametric Polymorphism]] is a way to define types or functions that are generic over other types. T... | Parametric-polymorphism |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Parsing/RPN_calculator_algorithm\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a stack-based evaluator for an expression in [[wp:Reverse Polish notation|<u>r</u>everse <u>P</u>olish <u>n</u>otation (RPN)]] that also shows the c... | Parsing-RPN-calculator-algorithm |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Parsing/RPN_to_infix_conversion\n",
"language": "00-META"
},
{
"code": ";Task:\nCreate a program that takes an [[wp:Reverse Polish notation|RPN]] representation of an expression formatted as a space separated sequence of tokens and generates the equi... | Parsing-RPN-to-infix-conversion |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Parsing/Shunting-yard_algorithm\n",
"language": "00-META"
},
{
"code": ";Task:\nGiven the operator characteristics and input from the [[wp:Shunting-yard_algorithm|Shunting-yard algorithm]] page and tables, use the algorithm to show the changes in the... | Parsing-Shunting-yard-algorithm |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Particle_fountain\n",
"language": "00-META"
},
{
"code": "Implement a particle fountain.\n\nEmulate a fountain of water droplets in a gravitational field being sprayed up and then falling back down.\n\nThe particle fountain should be generally ordere... | Particle-fountain |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Partition_an_integer_x_into_n_primes\nnote: Prime Numbers\n",
"language": "00-META"
},
{
"code": ";Task:\nPartition a positive integer '''X''' into '''N''' distinct primes. \n\n\nOr, to put it in another way:\n\nFind  ... | Partition-an-integer-x-into-n-primes |
[
{
"code": "---\ncategory:\n- Memoization\nfrom: http://rosettacode.org/wiki/Partition_function_P\nnote: Recursion\n",
"language": "00-META"
},
{
"code": "The [https://mathworld.wolfram.com/PartitionFunctionP.html Partition Function P] is the function P(n), where n∈ℤ, defined as the number of distinc... | Partition-function-P |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pascal's_triangle\nnote: Arithmetic operations\n",
"language": "00-META"
},
{
"code": "[[wp:Pascal's triangle|Pascal's triangle]] is an arithmetic and geometric figure often associated with the name of [[wp:Blaise Pascal|Blaise Pascal]], but also stu... | Pascals-triangle |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pascal's_triangle/Puzzle\n",
"language": "00-META"
},
{
"code": "This puzzle involves a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pascals Triangle], also known as a [http://xunor.free.fr/en/riddles/auto/pyramidnb.php Pyramid of Numbers].\n<... | Pascals-triangle-Puzzle |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Password_generator\n",
"language": "00-META"
},
{
"code": "Create a password generation program which will generate passwords containing random ASCII characters from the following groups:\n lower-case letters: a ──► z\n upper-case ... | Password-generator |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Peaceful_chess_queen_armies\n",
"language": "00-META"
},
{
"code": "In chess, a queen attacks positions from where it is, in straight lines up-down and left-right as well as on both its diagonals. It attacks only pieces ''not'' of its own colour.\n<b... | Peaceful-chess-queen-armies |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Peano_curve\nnote: Fractals\n",
"language": "00-META"
},
{
"code": "<br/>\n;Task\n\nProduce a graphical or ASCII-art representation of a [[wp:Peano curve|Peano curve]] of at least order 3.\n\n",
"language": "00-TASK"
},
{
"code": "DEFINE ... | Peano-curve |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pell_numbers\n",
"language": "00-META"
},
{
"code": "'''Pell numbers''' are an infinite sequence of integers that comprise the denominators of the closest rational approximations to the square root of 2 but have many other interesting uses and relati... | Pell-numbers |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Penney's_game\nnote: Games\n",
"language": "00-META"
},
{
"code": "[[wp:Penney's_game|Penney's game]] is a game where two players bet on being the first to see a particular sequence of [[wp:Coin_flipping|heads or tails]] in consecutive tosses of a [[... | Penneys-game |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pentagram\n",
"language": "00-META"
},
{
"code": "A [[wp:pentagram|pentagram]] is a star polygon, consisting of a central pentagon of which each side forms the base of an isosceles triangle. The vertex of each triangle, a point of the star, is 36 deg... | Pentagram |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Pentomino_tiling\n",
"language": "00-META"
},
{
"code": "A [[wp:Pentomino|pentomino]] is a polyomino that consists of 5 squares. There are 12 pentomino shapes, \nif you don't count rotations and reflections. Most pentominoes can form their own mirror... | Pentomino-tiling |
[
{
"code": "---\nfrom: http://rosettacode.org/wiki/Percolation/Bond_percolation\nnote: Percolation Simulations\n",
"language": "00-META"
},
{
"code": "{{Percolation Simulation}}\nGiven an <math>M \\times N</math> rectangular array of cells numbered <math>\\mathrm{cell}[0..M-1, 0..N-1]</math>, assume ... | Percolation-Bond-percolation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.